[
    {
        "filename": "100 doors_1.txt",
        "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))",
        "safe": true
    },
    {
        "filename": "100 doors_10.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_100.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_101.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_102.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_103.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_104.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_105.txt",
        "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$)",
        "safe": true
    },
    {
        "filename": "100 doors_106.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100 doors_107.txt",
        "content": ">\"d\">:00p1-:>:::9%\\9/9+g2%!\\:9v\n$.v_^#!$::$_^#`\"c\":+g00p+9/9\\%<\n::<_@#`$:\\*:+55:+1p27g1g+9/9\\%9\n",
        "safe": true
    },
    {
        "filename": "100 doors_108.txt",
        "content": "1+:::*.9`#@_\n",
        "safe": true
    },
    {
        "filename": "100 doors_109.txt",
        "content": "108p0>:18p;;>:9g!18g9p08g]\n*`!0\\|+relet|-1`*aap81::+]\n;::+1<r]!g9;>$08g1+:08paa[\n*`#@_^._aa\n",
        "safe": true
    },
    {
        "filename": "100 doors_11.txt",
        "content": "1001000010000001000000001000000000010000000000001000000000000001000000000000000010000000000000000001",
        "safe": true
    },
    {
        "filename": "100 doors_110.txt",
        "content": "0001000100010101000110100000010110000011001110110010100011010000000000101111111000000101111101011001011001000110100001111100110100101111101111000000001011111111110110011001111111011100000000101111110000001011111010110011011100101011000000101111011001011110011110011110110100000000001011011100111011110000000001000000111001110100000000101101110110",
        "safe": true
    },
    {
        "filename": "100 doors_111.txt",
        "content": "1001000010000001000000001000000000010000000000001000000000000001000000000000000010000000000000000001",
        "safe": true
    },
    {
        "filename": "100 doors_112.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_113.txt",
        "content": "for i in 1..101 {\n  echo 'Door ${i} is ${i ** 0.5\u00a0% 1 > 0\u00a0? \"closed\"\u00a0: \"open\"}'\n}",
        "safe": true
    },
    {
        "filename": "100 doors_114.txt",
        "content": "for i in 1..11 echo 'Door ${i**2} is open'",
        "safe": true
    },
    {
        "filename": "100 doors_115.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_116.txt",
        "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];",
        "safe": true
    },
    {
        "filename": "100 doors_117.txt",
        "content": " > 1   \n > 4   \n > 9   \n > 16   \n > 25   \n > 36   \n > 49   \n > 64   \n > 81   \n > 100   \n",
        "safe": true
    },
    {
        "filename": "100 doors_118.txt",
        "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)",
        "safe": true
    },
    {
        "filename": "100 doors_119.txt",
        "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)",
        "safe": true
    },
    {
        "filename": "100 doors_12.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_120.txt",
        "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)",
        "safe": true
    },
    {
        "filename": "100 doors_121.txt",
        "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)",
        "safe": true
    },
    {
        "filename": "100 doors_122.txt",
        "content": "100doors-tbl$\n& 100doors-var$\n& 100doors-list$\n& 100doors-obj$;",
        "safe": true
    },
    {
        "filename": "100 doors_123.txt",
        "content": "blsq ) 10ro2?^\n{1 4 9 16 25 36 49 64 81 100}",
        "safe": true
    },
    {
        "filename": "100 doors_124.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_125.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_126.txt",
        "content": "swch\n",
        "safe": true
    },
    {
        "filename": "100 doors_127.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_128.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_129.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_13.txt",
        "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\"",
        "safe": true
    },
    {
        "filename": "100 doors_130.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_131.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_132.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_133.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_134.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_135.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_136.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_137.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_138.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_139.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_14.txt",
        "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\"",
        "safe": true
    },
    {
        "filename": "100 doors_140.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_141.txt",
        "content": "100_doors\n",
        "safe": true
    },
    {
        "filename": "100 doors_142.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_143.txt",
        "content": "1: open\n4: open\n9: open\n16: open\n25: open\n36: open\n49: open\n64: open\n81: open\n100: open\n",
        "safe": true
    },
    {
        "filename": "100 doors_144.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_145.txt",
        "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 }",
        "safe": true
    },
    {
        "filename": "100 doors_146.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_147.txt",
        "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 @",
        "safe": true
    },
    {
        "filename": "100 doors_148.txt",
        "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 @",
        "safe": true
    },
    {
        "filename": "100 doors_149.txt",
        "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)",
        "safe": true
    },
    {
        "filename": "100 doors_15.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_150.txt",
        "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)",
        "safe": true
    },
    {
        "filename": "100 doors_151.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_152.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_153.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_154.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_155.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_156.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_157.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100 doors_158.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_159.txt",
        "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'",
        "safe": true
    },
    {
        "filename": "100 doors_16.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_160.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_161.txt",
        "content": "isInteger = (i) -> Math.floor(i) == i\n\nconsole.log door for door in [1..100] when isInteger Math.sqrt door\n",
        "safe": true
    },
    {
        "filename": "100 doors_162.txt",
        "content": "console.log Math.pow(i,2) for i in [1..10]\n",
        "safe": true
    },
    {
        "filename": "100 doors_163.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_164.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_165.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_166.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_167.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_168.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100 doors_169.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_17.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_170.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_171.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_172.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_173.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_174.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_175.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_176.txt",
        "content": "(let  ((i 0))\n    (mapcar (lambda (x)\n                (if (zerop (mod (sqrt (incf i)) 1))\n                    \"_\" \"#\"))\n            (make-list 100)))\n",
        "safe": true
    },
    {
        "filename": "100 doors_177.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_178.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_179.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_18.txt",
        "content": "DO 10 TIMES.\n  DATA(val) = sy-index * sy-index.\n  WRITE: / val.\nENDDO.\n",
        "safe": true
    },
    {
        "filename": "100 doors_180.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_181.txt",
        "content": "Goal prison 100 = prisoo 100. compute. reflexivity. Qed.",
        "safe": true
    },
    {
        "filename": "100 doors_182.txt",
        "content": "Goal forall n, prison n = prisoo n. Abort.",
        "safe": true
    },
    {
        "filename": "100 doors_183.txt",
        "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;",
        "safe": true
    },
    {
        "filename": "100 doors_184.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_185.txt",
        "content": "do\n\n\tlet i = i + 1\n\tprint i * i, \" \",\n\nloop i * i < 100",
        "safe": true
    },
    {
        "filename": "100 doors_186.txt",
        "content": "1 4 9 16 25 36 49 64 81 100 ",
        "safe": true
    },
    {
        "filename": "100 doors_187.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_188.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_189.txt",
        "content": "1 4 9 16 25 36 49 64 81 100 ",
        "safe": true
    },
    {
        "filename": "100 doors_19.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_190.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_191.txt",
        "content": "1 4 9 16 25 36 49 64 81 100 ",
        "safe": true
    },
    {
        "filename": "100 doors_192.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_193.txt",
        "content": "[1, 4, 9, 16, 25, 36, 49, 64, 81, 100]\n[1, 4, 9, 16, 25, 36, 49, 64, 81, 100]",
        "safe": true
    },
    {
        "filename": "100 doors_194.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_195.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_196.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_197.txt",
        "content": "main() {\n  for(int i=1,s=3;i<=100;i+=s,s+=2)\n    print(\"door $i is open\");\n}",
        "safe": true
    },
    {
        "filename": "100 doors_198.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_199.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_2.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_20.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_200.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_201.txt",
        "content": " 1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100 doors_202.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_203.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_204.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100 doors_205.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_206.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_207.txt",
        "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');",
        "safe": true
    },
    {
        "filename": "100 doors_208.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_209.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_21.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_210.txt",
        "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;",
        "safe": true
    },
    {
        "filename": "100 doors_211.txt",
        "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 \" \" )",
        "safe": true
    },
    {
        "filename": "100 doors_212.txt",
        "content": "Open doors: 1 4 9 16 25 36 49 64 81 100 ",
        "safe": true
    },
    {
        "filename": "100 doors_213.txt",
        "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)",
        "safe": true
    },
    {
        "filename": "100 doors_214.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100 doors_215.txt",
        "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\"",
        "safe": true
    },
    {
        "filename": "100 doors_216.txt",
        "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;",
        "safe": true
    },
    {
        "filename": "100 doors_217.txt",
        "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);",
        "safe": true
    },
    {
        "filename": "100 doors_218.txt",
        "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')));",
        "safe": true
    },
    {
        "filename": "100 doors_219.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_22.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_220.txt",
        "content": "open doors: 1, 4, 9, 16, 25, 36, 49, 64, 81, 100\n",
        "safe": true
    },
    {
        "filename": "100 doors_221.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_222.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_223.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_224.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_225.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_226.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_227.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_228.txt",
        "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..]]",
        "safe": true
    },
    {
        "filename": "100 doors_229.txt",
        "content": "open list\nrun n = takeWhile (<n) [& k*k \\\\ k <- [1..]]",
        "safe": true
    },
    {
        "filename": "100 doors_23.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_230.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_231.txt",
        "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}\"",
        "safe": true
    },
    {
        "filename": "100 doors_232.txt",
        "content": "All doors are closed except these: [1, 4, 9, 16, 25, 36, 49, 64, 81, 100]",
        "safe": true
    },
    {
        "filename": "100 doors_233.txt",
        "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)))",
        "safe": true
    },
    {
        "filename": "100 doors_234.txt",
        "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))",
        "safe": true
    },
    {
        "filename": "100 doors_235.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_236.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_237.txt",
        "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).",
        "safe": true
    },
    {
        "filename": "100 doors_238.txt",
        "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)).",
        "safe": true
    },
    {
        "filename": "100 doors_239.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_24.txt",
        "content": "Following doors are open:\n1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100 doors_240.txt",
        "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)].",
        "safe": true
    },
    {
        "filename": "100 doors_241.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_242.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_243.txt",
        "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 ]",
        "safe": true
    },
    {
        "filename": "100 doors_244.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_245.txt",
        "content": "=IF($A2/C$1=INT($A2/C$1),IF(B2=0,1,IF(B2=1,0)),B2)",
        "safe": true
    },
    {
        "filename": "100 doors_246.txt",
        "content": "=IF($A3/C$1=INT($A3/C$1),IF(B3=0,1,IF(B3=1,0)),B3)",
        "safe": true
    },
    {
        "filename": "100 doors_247.txt",
        "content": "=IF($A2/D$1=INT($A2/D$1),IF(C2=0,1,IF(C2=1,0)),C2)",
        "safe": true
    },
    {
        "filename": "100 doors_248.txt",
        "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 \"\"",
        "safe": true
    },
    {
        "filename": "100 doors_249.txt",
        "content": "1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100 doors_25.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_250.txt",
        "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 |]",
        "safe": true
    },
    {
        "filename": "100 doors_251.txt",
        "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))",
        "safe": true
    },
    {
        "filename": "100 doors_252.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_253.txt",
        "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;",
        "safe": true
    },
    {
        "filename": "100 doors_254.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_255.txt",
        "content": "for door in [ 1\u00a0: 101 ]: > \"Door \", $door, \" is: \", fract( door ** 0.5 )\u00a0? \"closed\"\u00a0: \"open\"",
        "safe": true
    },
    {
        "filename": "100 doors_256.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_257.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_258.txt",
        "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 })",
        "safe": true
    },
    {
        "filename": "100 doors_259.txt",
        "content": "    echo(\"Open doors are \" + (1..100).toList.findAll { it.toFloat.pow(0.5f).toInt.pow(2) == it})",
        "safe": true
    },
    {
        "filename": "100 doors_26.txt",
        "content": "Using #HASH-OFF, OPTION OICC =\"^\" , CICC =\"^\"\n",
        "safe": true
    },
    {
        "filename": "100 doors_260.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_261.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_262.txt",
        "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)",
        "safe": true
    },
    {
        "filename": "100 doors_263.txt",
        "content": "; do algorithm iterations sqrt(100) = 10 times\n(repeat i 10 (setcar (nth (- (* i i) 1) doors) 't))",
        "safe": true
    },
    {
        "filename": "100 doors_264.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_265.txt",
        "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^",
        "safe": true
    },
    {
        "filename": "100 doors_266.txt",
        "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,!",
        "safe": true
    },
    {
        "filename": "100 doors_267.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_268.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_269.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_27.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_270.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_271.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_272.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100 doors_273.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_274.txt",
        "content": "doors that are open nr: 1 4 9 16 25 36 49 64 81 100 \n\nThere are 10 doors open",
        "safe": true
    },
    {
        "filename": "100 doors_275.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_276.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_277.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_278.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_279.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_28.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_280.txt",
        "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 \"]",
        "safe": true
    },
    {
        "filename": "100 doors_281.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_282.txt",
        "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') )",
        "safe": true
    },
    {
        "filename": "100 doors_283.txt",
        "content": "import math.sqrt\n\nfor i <- 1..100\n  println( i + ' ' + (if sqrt(i) is Integer then 'open' else 'closed') )",
        "safe": true
    },
    {
        "filename": "100 doors_284.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_285.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_286.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_287.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_288.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_289.txt",
        "content": "1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100 doors_29.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_290.txt",
        "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 ]",
        "safe": true
    },
    {
        "filename": "100 doors_291.txt",
        "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)",
        "safe": true
    },
    {
        "filename": "100 doors_292.txt",
        "content": "Doors open\u00a0: 1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100 doors_293.txt",
        "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)",
        "safe": true
    },
    {
        "filename": "100 doors_294.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_295.txt",
        "content": "Result:\n10010000 10000001 00000000 10000000 00010000 00000000 10000000 00000001 00000000 00000000 10000000 00000000 0001",
        "safe": true
    },
    {
        "filename": "100 doors_296.txt",
        "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();",
        "safe": true
    },
    {
        "filename": "100 doors_297.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_298.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_299.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_3.txt",
        "content": "   1   4   9  16  25  36  49  64  81 100",
        "safe": true
    },
    {
        "filename": "100 doors_30.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_300.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_301.txt",
        "content": "O--O----O------O--------O----------O------------O--------------O----------------O------------------O\n",
        "safe": true
    },
    {
        "filename": "100 doors_302.txt",
        "content": "100:c;[{0}c*]:d;\nc,{.c,>\\)%{.d<\\.d=1^\\)d>++:d;}/}/\n[c,{)\"door \"\\+\" is\"+}%d{{\"open\"}{\"closed\"}if}%]zip\n{\" \"*puts}/",
        "safe": true
    },
    {
        "filename": "100 doors_303.txt",
        "content": "100,{)}%\n{:d.sqrt 2?=\n{\"open\"}{\"close\"}if\"door \"d+\" is \"+\\+puts}/",
        "safe": true
    },
    {
        "filename": "100 doors_304.txt",
        "content": "[{\"close\"}100*]:d;\n10,{)2?(.d<\\[\"open\"]\\)d>++:d;}/\n[100,{)\"door \"\\+\" is\"+}%d]zip\n{\" \"*puts}/",
        "safe": true
    },
    {
        "filename": "100 doors_305.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_306.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_307.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_308.txt",
        "content": "(1..100).each {\n   println(\"Door #${it} is ${Math.sqrt(it).with{it==(int)it}\u00a0? 'open'\u00a0: 'closed'}.\")\n}",
        "safe": true
    },
    {
        "filename": "100 doors_309.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100 doors_31.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_310.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_311.txt",
        "content": "1\n4\n9\n16\n25\n36\n49\n64\n81\n100\n",
        "safe": true
    },
    {
        "filename": "100 doors_312.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_313.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_314.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_315.txt",
        "content": "data Door\n  = Open\n  | Closed\n  deriving (Eq, Show)\n\ntoggle\u00a0:: Door -> Door\ntoggle Open = Closed\ntoggle Closed = Open\n\ntoggleEvery\u00a0:: Int -> [Door] -> [Door]\ntoggleEvery k = zipWith toggleK [1 ..]\n  where\n    toggleK n door\n      | n `mod` k == 0 = toggle door\n      | otherwise = door\n\nrun\u00a0:: Int -> [Door]\nrun n = foldr toggleEvery (replicate n Closed) [1 .. n]\n\nmain\u00a0:: IO ()\nmain = print $ filter ((== Open) . snd) $ zip [1 ..] (run 100)",
        "safe": true
    },
    {
        "filename": "100 doors_316.txt",
        "content": "[(1,Open),(4,Open),(9,Open),(16,Open),(25,Open),(36,Open),(49,Open),(64,Open),(81,Open),(100,Open)]",
        "safe": true
    },
    {
        "filename": "100 doors_317.txt",
        "content": "run n = findIndices odd $ foldr toggleEvery (replicate n 0) [0..n] where toggleEvery k =  zipWith (+) $ cycle $ 1\u00a0: replicate k 0",
        "safe": true
    },
    {
        "filename": "100 doors_318.txt",
        "content": "gate\u00a0:: Eq a => [a] -> [a] -> [Door]\ngate (x:xs) (y:ys) | x == y  =  Open  \u00a0: gate xs ys\ngate (x:xs) ys               =  Closed\u00a0: gate xs ys\ngate []     _                =  []\n\nrun n = gate [1..n] [k*k | k <- [1..]]",
        "safe": true
    },
    {
        "filename": "100 doors_319.txt",
        "content": "run n = takeWhile (< n) [k*k | k <- [1..]]",
        "safe": true
    },
    {
        "filename": "100 doors_32.txt",
        "content": "var doors = new int [100]\n\nforeach pass 100 {\n    for (var door = pass\u00a0; door < 100\u00a0; door += pass+1) {\n        doors[door] = !doors[door]\n    }\n}\n\nvar d = 1\nforeach door doors {\n    println (\"door \" + d++ + \" is \" + (door\u00a0? \"open\"\u00a0: \"closed\"))\n\n}",
        "safe": true
    },
    {
        "filename": "100 doors_320.txt",
        "content": "class Main\n{\n    static public function main()\n    {\n        findOpenDoors( 100 );\n    }\n\n    static function findOpenDoors( n\u00a0: Int )\n    {\n        var door = [];\n        for( i in 0...n + 1 ){ door[ i ] = false; }\n        for( i in 1...n + 1 ){\n            var j = i;\n            while( j <= n ){ \n                door[ j ] =\u00a0! door[ j ];\n                j += i;\n            }\n        }\n        for( i in 1...n + 1 ){\n            if( door[ i ] ){ Sys.print( ' $i' ); }\n        }\n    }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_321.txt",
        "content": " 1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100 doors_322.txt",
        "content": "class RosettaDemo\n{\n    static public function main()\n    {\n        findOpenLockers(100);\n    }\n\n    static function findOpenLockers(n\u00a0: Int)\n    {\n        var i = 1;\n\n        while((i*i) <= n)\n        {\n            Sys.println(i*i);\n            i++;\n        }\n    }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_323.txt",
        "content": "REAL\u00a0:: n=100, open=1, door(n)\n\ndoor = 1 - open\u00a0! = closed\nDO i = 1, n\n  DO j = i, n, i\n    door(j) = open - door(j)\n  ENDDO\nENDDO\nDLG(Text=door, TItle=SUM(door)//\" doors open\")",
        "safe": true
    },
    {
        "filename": "100 doors_324.txt",
        "content": "door = 1 - open\u00a0! = closed\nDO i = 1, n^0.5\n  door(i*i) = open\nENDDO\nDLG(Text=door, TItle=SUM(door)//\" doors open\")",
        "safe": true
    },
    {
        "filename": "100 doors_325.txt",
        "content": "U8 is_open[100];\nU8 pass = 0, door = 0;\n\n/* do the 100 passes */\nfor (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 */\nfor (door = 0; door < 100; ++door)\n  if (is_open[door])\n    Print(\"Door #%d is open.\\n\", door + 1);\n  else\n    Print(\"Door #%d is closed.\\n\", door + 1);",
        "safe": true
    },
    {
        "filename": "100 doors_326.txt",
        "content": "|^\n=/  doors=(list\u00a0?)  (reap 100\u00a0%.n)\n=/  passes=(list (list\u00a0?))  (turn (gulf 1 100) pass-n)\n|-\n?~  passes  doors\n$(doors (toggle doors i.passes), passes t.passes)\n++  pass-n\n  |=  n=@ud\n  (turn (gulf 1 100) |=(k=@ud =((mod k n) 0)))\n++  toggle\n  |=  [a=(list\u00a0?) b=(list\u00a0?)]\n  =|  c=(list\u00a0?)\n  |-\n \u00a0?:  |(?=(~ a)\u00a0?=(~ b))  (flop c)\n  $(a t.a, b t.b, c [=((mix i.a i.b) 1) c])\n--",
        "safe": true
    },
    {
        "filename": "100 doors_327.txt",
        "content": "#! /bin/sh\nexec huginn --no-argv -E \"${0}\"\n#! huginn\n\nimport Algorithms as algo;\n\nmain() {\n        doorCount = 100;\n        doors = [].resize( doorCount, false );\n\n        for ( pass\u00a0: algo.range( doorCount ) ) {\n                i = 0;\n                step = pass + 1;\n                while ( i < doorCount ) {\n                        doors[i] =\u00a0! doors[i];\n                        i += step;\n                }\n        }\n\n        for ( i\u00a0: algo.range( doorCount ) ) {\n                if ( doors[i] ) {\n                        print( \"door {} is open\\n\".format( i ) );\n                }\n        }\n        return ( 0 );\n}",
        "safe": true
    },
    {
        "filename": "100 doors_328.txt",
        "content": "(setv doors (* [False] 100))\n\n(for [pass (range (len doors))]\n  (for [i (range pass (len doors) (inc pass))]\n    (assoc doors i (not (get doors i)))))\n\n(for [i (range (len doors))]\n  (print (.format \"Door {} is {}.\"\n    (inc i)\n    (if (get doors i) \"open\" \"closed\"))))",
        "safe": true
    },
    {
        "filename": "100 doors_329.txt",
        "content": "software {\n\tvar doors = len(100)\n\t\n\tfor pass over [1, 100]\n\t\tvar door = pass - 1\n\t\tloop door < len(doors) {\n\t\t\tdoors[door] = doors[door]/0\n\t\t\tdoor += pass\n\t\t}\n\tend\n\t\n\tfor door,isopen in doors\n\t\tif isopen\n\t\t\tprint(\"Door \",door+1,\": open\")\n\t\tend\n\tend\n\tprint(\"All other doors are closed\")\n}",
        "safe": true
    },
    {
        "filename": "100 doors_33.txt",
        "content": "begin\n \ncomment - 100 doors problem in ALGOL-60;\n \nboolean array doors[1:100];\ninteger i, j;\nboolean open, closed;\n \nopen\u00a0:= true;\nclosed\u00a0:= not true;\n \noutstring(1,\"100 Doors Problem\\n\");\n \ncomment - all doors are initially closed;\nfor i\u00a0:= 1 step 1 until 100 do\n  doors[i]\u00a0:= closed;\n \ncomment\n  cycle through at increasing intervals\n  and flip each door encountered;\nfor i\u00a0:= 1 step 1 until 100 do\n  for j\u00a0:= i step i until 100 do\n    doors[j]\u00a0:= not doors[j];\n \ncomment - show which doors are open;\noutstring(1,\"The open doors are:\");\nfor i\u00a0:= 1 step 1 until 100 do\n  if doors[i] then\n     outinteger(1,i);\n \nend\n",
        "safe": true
    },
    {
        "filename": "100 doors_330.txt",
        "content": "procedure main()\n    door\u00a0:= table(0)    # default value of entries is 0\n    every pass\u00a0:= 1 to 100 do\n        every door[i\u00a0:= pass to 100 by pass]\u00a0:= 1 - door[i]\n\n    every write(\"Door \", i\u00a0:= 1 to 100, \" is \", if door[i] = 1 then \"open\" else \"closed\")\nend",
        "safe": true
    },
    {
        "filename": "100 doors_331.txt",
        "content": "procedure main()\n    every write(\"Door \", i\u00a0:= 1 to 100, \" is \", if integer(sqrt(i)) = sqrt(i) then \"open\" else \"closed\")\nend",
        "safe": true
    },
    {
        "filename": "100 doors_332.txt",
        "content": "procedure main(args)\n    dMap\u00a0:= table(\"closed\")\n    every dMap[(1 to sqrt(100))^2]\u00a0:= \"open\"\n    every write(\"Door \",i\u00a0:= 1 to 100,\" is \",dMap[i])\nend",
        "safe": true
    },
    {
        "filename": "100 doors_333.txt",
        "content": "import Data.Vect\n\n-- Creates list from 0 to n (not including n) \nupTo\u00a0: (m\u00a0: Nat) -> Vect m (Fin m)\nupTo Z = []\nupTo (S n) = 0\u00a0:: (map FS (upTo n))\n\ndata DoorState = DoorOpen | DoorClosed\n\ntoggleDoor\u00a0: DoorState -> DoorState\ntoggleDoor DoorOpen = DoorClosed\ntoggleDoor DoorClosed = DoorOpen\n\nisOpen\u00a0: DoorState -> Bool\nisOpen DoorOpen = True\nisOpen DoorClosed = False\n\ninitialDoors\u00a0: Vect 100 DoorState\ninitialDoors = fromList $ map (\\_ => DoorClosed) [1..100]\n\niterate\u00a0: (n\u00a0: Fin m) -> Vect m DoorState -> Vect m DoorState\niterate n doors {m} = \n  map (\\(idx, doorState) => \n          if ((S (finToNat idx)) `mod` (S (finToNat n))) == Z \n              then toggleDoor doorState \n              else doorState)  \n      (zip (upTo m) doors)\n\n-- Returns all doors left open at the end\nsolveDoors\u00a0: List (Fin 100)\nsolveDoors = \n  findIndices isOpen $ foldl (\\doors,val => iterate val doors) initialDoors (upTo 100)\n\nmain\u00a0: IO ()\nmain = print $ map (\\n => S (finToNat n)) solveDoors",
        "safe": true
    },
    {
        "filename": "100 doors_334.txt",
        "content": "Hallway is a room.\n\nA toggle door is a kind of thing.\nA toggle door can be open or closed. It is usually closed.\nA toggle door has a number called the door number.\nUnderstand the door number property as referring to a toggle door.\nRule for printing the name of a toggle door: say \"door #[door number]\".\n\nThere are 100 toggle doors.\n\nWhen play begins (this is the initialize doors rule):\n\tlet the next door number be 1;\n\trepeat with D running through toggle doors:\n\t\tnow the door number of D is the next door number;\n\t\tincrement the next door number.\n\nTo toggle (D - open toggle door): now D is closed.\nTo toggle (D - closed toggle door): now D is open.\n\nWhen play begins (this is the solve puzzle rule):\n\tlet the door list be the list of toggle doors;\n\tlet the door count be the number of entries in the door list;\n\trepeat with iteration running from 1 to 100:\n\t\tlet N be the iteration;\n\t\twhile N is less than the door count:\n\t\t\ttoggle entry N in the door list;\n\t\t\tincrease N by the iteration;\n\tsay \"Doors left open: [list of open toggle doors].\";\n\tend the story.",
        "safe": true
    },
    {
        "filename": "100 doors_335.txt",
        "content": "MAIN\n    DEFINE\n        i, pass SMALLINT,\n        doors ARRAY[100] OF SMALLINT\n \n    FOR i = 1 TO 100\n        LET doors[i] = FALSE\n    END FOR\n \n    FOR pass = 1 TO 100\n        FOR i = pass TO 100 STEP pass\n            LET doors[i] = NOT doors[i]\n        END FOR\n    END FOR\n \n    FOR i = 1 TO 100\n        IF doors[i]\n          THEN DISPLAY i USING \"Door <<& is open\"\n          ELSE DISPLAY i USING \"Door <<& is closed\"\n        END IF\n    END FOR\nEND MAIN",
        "safe": true
    },
    {
        "filename": "100 doors_336.txt",
        "content": "(var doors (times 100 false))\n\n(for i  (range 1 101)\n     i2 (range (dec i) 100 i)\n  (var! doors (set-at [i2] (! (i2 doors))))\n  (continue))\n\n(-> (xmap vec doors)\n    (filter 1)\n    (map (comp 0 inc))\n    (join \", \")\n   @(str \"open doors: \"))",
        "safe": true
    },
    {
        "filename": "100 doors_337.txt",
        "content": "open doors: 1, 4, 9, 16, 25, 36, 49, 64, 81, 100\n",
        "safe": true
    },
    {
        "filename": "100 doors_338.txt",
        "content": "doors\u00a0:= List clone\n100 repeat(doors append(false))\nfor(i,1,100,\n    for(x,i,100, i, doors atPut(x - 1, doors at(x - 1) not))\n)\ndoors foreach(i, x, if(x, \"Door #{i + 1} is open\" interpolate println))",
        "safe": true
    },
    {
        "filename": "100 doors_339.txt",
        "content": "(Range 1 to(10) asList) foreach(v, \"Door #{v ** 2} is open.\" interpolate println)",
        "safe": true
    },
    {
        "filename": "100 doors_34.txt",
        "content": "100 Doors Problem\nThe open doors are: 1  4  9  16  25  36  49  64  81  100\n",
        "safe": true
    },
    {
        "filename": "100 doors_340.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100 doors_341.txt",
        "content": "NDoors = Origin mimic\n\nNDoors Toggle = Origin mimic do(\n  initialize = method(toggled?, @toggled? = toggled?)\n  toggle! = method(@toggled? = !toggled?. self)\n)\n\nNDoors Doors = Origin mimic do(\n  initialize = method(n,\n    @n = n\n    @doors = {} addKeysAndValues(1..n, (1..n) map(_, NDoors Toggle mimic(false)))\n  )\n  numsToToggle = method(n, for(x <- (1..@n), (x\u00a0% n) zero?, x))\n  toggleThese = method(nums, nums each(x, @doors[x] = @doors at(x) toggle))\n  show = method(@doors filter:dict(value toggled?) keys sort println)\n)\n\n; Test code\nx = NDoors Doors mimic(100)\n(1..100) each(n, x toggleThese(x numsToToggle(n)))\nx show",
        "safe": true
    },
    {
        "filename": "100 doors_342.txt",
        "content": "theory Scratch\n  imports Main\nbegin\n\nsection\u2039100 Doors\u203a\n\n  datatype doorstate = Open | Closed\n  \n  fun toggle\u00a0:: \"doorstate \u21d2 doorstate\" where\n    \"toggle Open   = Closed\"\n  | \"toggle Closed = Open\"\n  \n  fun walk\u00a0:: \"('a \u21d2 'a) \u21d2 nat \u21d2 nat \u21d2 'a list \u21d2 'a list\" where\n    \"walk f _     _       []     = []\"\n  | \"walk f every 0       (x#xs) = (f x) # walk f every every xs\"\n  | \"walk f every (Suc n) (x#xs) = x # walk f every n xs\"\n  \n  text\u2039Example: \\<^const>\u2039toggle\u203a every second door. (second = 1, because of 0 indexing)\u203a\n  lemma \"walk toggle 1 1 [Open, Open, Open, Open, Open, Open] =\n                         [Open, Closed, Open, Closed, Open, Closed]\" by code_simp\n  \n  text\u2039Example: \\<^const>\u2039toggle\u203a every third door.\u203a\n  lemma \"walk toggle 2 2 [Open, Open, Open, Open, Open, Open] =\n                         [Open, Open, Closed, Open, Open, Closed]\" by code_simp\n  \n  text\u2039Walking each door is essentially the same as the common \\<^const>\u2039map\u203a function.\u203a\n  lemma \"walk f 0 0 xs = map f xs\"\n    by(induction xs) (simp)+\n  \n  lemma walk_beginning:\n    \"walk f every n xs = (walk f every n (take (Suc n) xs)) @ (walk f every every (drop (Suc n) xs))\"\n    by(induction f every n xs rule:walk.induct) (simp)+\n  \n  text\u2039A convenience definition to take the off-by-one into account and setting the starting position.\u203a\n  definition visit_every\u00a0:: \"('a \u21d2 'a) \u21d2 nat \u21d2 'a list \u21d2 'a list\" where\n    \"visit_every f every xs \u2261 walk f (every - 1) (every - 1) xs\"\n  \n  \n  fun iterate\u00a0:: \"nat \u21d2 (nat \u21d2 'a \u21d2 'a) \u21d2 nat \u21d2 'a \u21d2 'a\" where\n    \"iterate 0       _ _ a = a\"\n  | \"iterate (Suc i) f n a = iterate i f (Suc n) (f n a)\"\n  \n  text\u2039The 100 doors problem.\u203a\n  definition \"onehundred_doors \u2261 iterate 100 (visit_every toggle) 1 (replicate 100 Closed)\"\n  \n  lemma \"onehundred_doors =\n    [Open, Closed, Closed, Open, Closed, Closed, Closed,\n     Closed, Open, Closed, Closed, Closed, Closed, Closed,\n     Closed, Open, Closed, Closed, Closed, Closed, Closed,\n     Closed, Closed, Closed, Open, Closed, Closed, Closed,\n     Closed, Closed, Closed, Closed, Closed, Closed, Closed,\n     Open, Closed, Closed, Closed, Closed, Closed, Closed,\n     Closed, Closed, Closed, Closed, Closed, Closed, Open,\n     Closed, Closed, Closed, Closed, Closed, Closed, Closed,\n     Closed, Closed, Closed, Closed, Closed, Closed, Closed,\n     Open, Closed, Closed, Closed, Closed, Closed, Closed,\n     Closed, Closed, Closed, Closed, Closed, Closed, Closed,\n     Closed, Closed, Closed, Open, Closed, Closed, Closed,\n     Closed, Closed, Closed, Closed, Closed, Closed, Closed,\n     Closed, Closed, Closed, Closed, Closed, Closed, Closed,\n     Closed, Open]\" by code_simp\n  \n  text\u2039Filtering for the open doors, we get the same result as the Haskell implementation.\u203a\n  lemma\n    \"[(i, door) \u2190 enumerate 1 onehundred_doors. door = Open] =\n     [(1,Open),(4,Open),(9,Open),(16,Open),(25,Open),(36,Open),(49,Open),(64,Open),(81,Open),(100,Open)]\"\n    by code_simp\n\nsection\u2039Equivalence to Haskell Implementation\u203a\ntext\u2039\nWe will now present an alternative implementation, which is similar to the Haskell implementation\non \ud83c\udf10\u2039https://rosettacode.org/wiki/100_doors#Haskell\u203a. We will prove, that the two behave the same;\nin general, not just for a fixed set of 100 doors.\n\u203a\n\n  definition map_every_start\u00a0:: \"('a \u21d2 'a) \u21d2 nat \u21d2 nat \u21d2 'a list \u21d2 'a list\" where\n    \"map_every_start f every start xs \u2261\n      map (\u03bb(i, x). if i mod every = 0 then f x else x) (enumerate start xs)\"\n\n  definition visit_every_alt\u00a0:: \"('a \u21d2 'a) \u21d2 nat \u21d2 'a list \u21d2 'a list\" where\n    \"visit_every_alt f every xs \u2261 map_every_start f every 1 xs\"\n  \n  text\u2039Essentially, \\<^term>\u2039start\u203a and \\<^term>\u2039start mod every\u203a behave the same.\u203a\n  lemma map_every_start_cycle:\n    \"map_every_start f every (start + k*every) xs = map_every_start f every start xs\"\n    proof(induction xs arbitrary: start)\n      case Nil\n      show \"map_every_start f every (start + k * every) [] = map_every_start f every start []\"\n        by(simp add: map_every_start_def)\n    next\n      case (Cons x xs)\n      from Cons.IH[of \"Suc start\"]\n        show \"map_every_start f every (start + k * every) (x # xs) =\n              map_every_start f every start (x # xs)\"\n        by(simp add: map_every_start_def)\n    qed\n  corollary map_every_start_cycle_zero:\n    \"map_every_start f every every xs = map_every_start f every 0 xs\"\n    using map_every_start_cycle[where k=1 and start=0, simplified] by blast\n  \n  lemma map_every_start_fst_zero:\n    \"map_every_start f every 0 (x # xs) = f x # map_every_start f every (Suc 0) xs\"\n    by(simp add: map_every_start_def)\n  \n  text\u2039\n  The first \\<^term>\u2039n\u203a elements are not processed by \\<^term>\u2039f\u203a,\n  as long as \\<^term>\u2039n\u203a is less than the \\<^term>\u2039every\u203a cycle.\n \u00a0\u203a\n  lemma map_every_start_skip_first: \"Suc n < every \u27f9\n         map_every_start f every (every - (Suc n)) (x # xs) = \n         x # map_every_start f every (every - n) xs\"\n    by(simp add: map_every_start_def Suc_diff_Suc)\n\n  lemma map_every_start_append:\n    \"map_every_start f n s (ds1 @ ds2) =\n     map_every_start f n s ds1 @ map_every_start f n (s + length ds1) ds2\"\n    by(simp add: map_every_start_def enumerate_append_eq)\n\n  text\u2039\n  The \\<^const>\u2039walk\u203a function and \\<^const>\u2039map_every_start\u203a behave the same,\n  as long as the starting \\<^term>\u2039n\u203a is less than the \\<^term>\u2039every\u203a cycle,\n  because \\<^const>\u2039walk\u203a allows pushing the start arbitrarily far and\n  \\<^const>\u2039map_every_start\u203a only allows deferring the start within\n  the \\<^term>\u2039every\u203a cycle.\n  This generalization is needed to strengthen the induction hypothesis\n  for the proof.\n \u00a0\u203a\n  lemma walk_eq_map_every_start:\n    \"n \u2264 every \u27f9 walk f every n xs = map_every_start f (Suc every) (Suc every - n) xs\"\n    proof(induction xs arbitrary: n)\n      case Nil\n      show \"walk f every n [] = map_every_start f (Suc every) (Suc every - n) []\"\n        by(simp add: map_every_start_def)\n    next\n      case (Cons x xs)\n      then show \"walk f every n (x # xs) = map_every_start f (Suc every) (Suc every - n) (x # xs)\"\n      proof(cases n)\n        case 0\n        with Cons.IH show ?thesis \n          by(simp add: map_every_start_cycle_zero map_every_start_fst_zero)\n      next\n        case (Suc n2)\n        with Cons.prems map_every_start_skip_first[of n2 \"Suc every\"] have\n          \"map_every_start f (Suc every) (Suc every - Suc n2) (x # xs) =\n           x # map_every_start f (Suc every) (Suc every - n2) xs\"\n          by fastforce\n        with Suc Cons show ?thesis\n          by(simp)\n      qed\n    qed\n  \n  corollary walk_eq_visit_every_alt:\n    \"walk f every every xs = visit_every_alt f (Suc every) xs\"\n    unfolding visit_every_alt_def\n    using walk_eq_map_every_start by fastforce\n\n  text\u2039\n  Despite their very different implementations, our alternative visit function behaves the same\n  as our original visit function.\n  Text the theorem includes \\<^term>\u2039Suc every\u203a to express that we exclude \\<^term>\u2039every = 0\u203a.\n \u00a0\u203a\n  theorem visit_every_eq_visit_every_alt:\n    \"visit_every f (Suc every) xs = visit_every_alt f (Suc every) xs\"\n    unfolding visit_every_def\n    using walk_eq_visit_every_alt by fastforce\n\n  text\u2039Also, the \\<^const>\u2039iterate\u203a function we implemented above can be implemented by a simple \\<^const>\u2039fold\u203a.\u203a\n  lemma fold_upt_helper: assumes n_geq_1: \"Suc 0 \u2264 n\"\n    shows \"fold f [Suc s..<n + s] (f s xs) = fold f [s..<n + s] xs\"\n  proof -\n    from n_geq_1 have \"[s..<n + s] = s#[Suc s..<n + s]\" by (simp add: Suc_le_lessD upt_rec)\n    from this have \"fold f [s..<n + s] xs = fold f (s#[Suc s..<n + s]) xs\" by simp\n    also have \"fold f (s#[Suc s..<n + s]) xs = fold f [Suc s..<n + s] (f s xs)\" by(simp)\n    ultimately show ?thesis by simp\n  qed\n  \n  theorem iterate_eq_fold: \"iterate n f s xs = fold f [s ..< n+s] xs\"\n  proof(induction n arbitrary: s xs)\n    case 0\n    then show \"iterate 0 f s xs = fold f [s..<0 + s] xs\" by simp\n  next\n    case (Suc n)\n    from Suc show \"iterate (Suc n) f s xs = fold f [s..<Suc n + s] xs\" \n      by(simp add: fold_upt_helper not_less_eq_eq)\n  qed\n\nsection\u2039Efficient Implementation\u203a\ntext \u2039\nAs noted on this page, the only doors that remain open are those whose numbers are perfect squares.\nYet, rosettacode does not want us to take this shortcut, since we want to compare implementations\nacross programming languages. But we can prove that our code computes the same result as reporting\nall doors with a perfect square number as open:\n\u203a\n  theorem \"[(i, door) \u2190 enumerate 1 onehundred_doors. door = Open] =\n           [(i*i, Open). i \u2190 [1..<11]]\"\n    by code_simp\nend",
        "safe": true
    },
    {
        "filename": "100 doors_343.txt",
        "content": "   ~:/ (100 $ - {. 1:)\"0 >:i.100\n1 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 ...\n   ~:/ 0=|/~ >:i.100  NB. alternative\n1 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 ...\n   (*/\"1)2|>:_ q:>:i.100 NB. alternative",
        "safe": true
    },
    {
        "filename": "100 doors_344.txt",
        "content": "   (e. *:) 1+i.100\n1 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 ...\n   1 (<:*:i.10)} 100$0  NB. alternative\n1 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 ...",
        "safe": true
    },
    {
        "filename": "100 doors_345.txt",
        "content": "   'these doors are open: ',\": I. (i.101) e. *: 1+i.10\nthese doors are open: 1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100 doors_346.txt",
        "content": "(def doors (seq [_ :range [0 100]] false))\n\n(loop [pass :range [0 100]\n       door :range [pass 100 (inc pass)]]\n  (put doors door (not (doors door))))\n\n(print \"open doors: \"\u00a0;(seq [i :range [0 100] :when (doors i)] (string (inc i) \" \")))",
        "safe": true
    },
    {
        "filename": "100 doors_347.txt",
        "content": "open doors: 1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100 doors_348.txt",
        "content": "class HundredDoors {\n    public static void main(String[] args) {\n        boolean[] doors = new boolean[101];\n\n        for (int i = 1; i < doors.length; i++) {\n            for (int j = i; j < doors.length; j += i) {\n                doors[j] = !doors[j];\n            }\n        }\n\n        for (int i = 1; i < doors.length; i++) {\n            if (doors[i]) {\n                System.out.printf(\"Door %d is open.%n\", i);\n            }\n        }\n    }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_349.txt",
        "content": "import java.util.BitSet;\n\npublic class HundredDoors {\n    public static void main(String[] args) {\n        final int n = 100;\n        var a = new BitSet(n);\n        for (int i = 1; i <= n; i++) {\n            for (int j = i - 1; j < n; j += i) {\n                a.flip(j);\n            }\n        }\n        a.stream().map(i -> i + 1).forEachOrdered(System.out::println);\n    }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_35.txt",
        "content": "PROC doors = (INT limit)VOID:\n(\n  MODE DOORSTATE = BOOL;\n  BOOL closed = FALSE;\n  BOOL open = NOT closed;\n  MODE DOORLIST = [limit]DOORSTATE;\n\n  DOORLIST the doors;\n  FOR i FROM LWB the doors TO UPB the doors DO the doors[i]:=closed OD;\n\n  FOR i FROM LWB the doors TO UPB the doors DO\n    FOR j FROM LWB the doors BY i TO UPB the doors DO\n      the doors[j]\u00a0:= NOT the doors[j]\n    OD\n  OD;\n  FOR i FROM LWB the doors TO UPB the doors DO\n    print((whole(i,-12),\" is \",(the doors[i]|\"opened\"|\"closed\"),newline))\n  OD\n);\ndoors(100)\n",
        "safe": true
    },
    {
        "filename": "100 doors_350.txt",
        "content": "class HundredDoors {\n    public static void main(String[] args) {\n        for (int i = 1; i <= 10; i++)\n            System.out.printf(\"Door %d is open.%n\", i * i);\n    }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_351.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100 doors_352.txt",
        "content": "import java.util.stream.Collectors;\nimport java.util.stream.IntStream;\n\nclass HundredDoors {\n    public static void main(String args[]) {\n        String openDoors = IntStream.rangeClosed(1, 100)\n                .filter(i -> Math.pow((int) Math.sqrt(i), 2) == i)\n                .mapToObj(Integer::toString)\n                .collect(Collectors.joining(\", \"));\n        System.out.printf(\"Open doors: %s%n\", openDoors);\n    }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_353.txt",
        "content": "Open doors: 1, 4, 9, 16, 25, 36, 49, 64, 81, 100\n",
        "safe": true
    },
    {
        "filename": "100 doors_354.txt",
        "content": "var doors=[];\nfor (var i=0;i<100;i++)\n    doors[i]=false;\nfor (var i=1;i<=100;i++)\n    for (var i2=i-1;i2<100;i2+=i)\n        doors[i2]=!doors[i2];\nfor (var i=1;i<=100;i++)\n    console.log(\"Door %d is %s\",i,doors[i-1]?\"open\":\"closed\")",
        "safe": true
    },
    {
        "filename": "100 doors_355.txt",
        "content": "(function (n) {\n    \"use strict\";\n    function finalDoors(n) {\n        var lstRange = range(1, n);\n        return lstRange\n            .reduce(function (a, _, k) {\n                var m = k + 1;\n                return a.map(function (x, i) {\n                    var j = i + 1;\n                    return [j, j\u00a0% m\u00a0? x[1]\u00a0: !x[1]];\n                });\n            }, zip(\n                lstRange,\n                replicate(n, false)\n            ));\n    };\n    function zip(xs, ys) {\n        return xs.length === ys.length\u00a0? (\n            xs.map(function (x, i) {\n                return [x, ys[i]];\n            })\n        )\u00a0: undefined;\n    }\n    function replicate(n, a) {\n        var v = [a],\n            o = [];\n        if (n < 1) return o;\n        while (n > 1) {\n            if (n & 1) o = o.concat(v);\n            n >>= 1;\n            v = v.concat(v);\n        }\n        return o.concat(v);\n    }\n    function range(m, n, delta) {\n        var d = delta || 1,\n            blnUp = n > m,\n            lng = Math.floor((blnUp\u00a0? n - m\u00a0: m - n) / d) + 1,\n            a = Array(lng),\n            i = lng;\n        if (blnUp)\n            while (i--) a[i] = (d * i) + m;\n        else\n            while (i--) a[i] = m - (d * i);\n        return a;\n    }\n    return finalDoors(n)\n        .filter(function (tuple) {\n            return tuple[1];\n        })\n        .map(function (tuple) {\n            return {\n                door: tuple[0],\n                open: tuple[1]\n            };\n        });\n\n})(100);",
        "safe": true
    },
    {
        "filename": "100 doors_356.txt",
        "content": "for (var door = 1; door <= 100; door++) {\n  var sqrt = Math.sqrt(door);\n  if (sqrt === (sqrt | 0)) {\n    console.log(\"Door %d is open\", door);\n  }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_357.txt",
        "content": "for(var door=1;i<10/*Math.sqrt(100)*/;i++){\n console.log(\"Door %d is open\",i*i);\n}",
        "safe": true
    },
    {
        "filename": "100 doors_358.txt",
        "content": "(function (n) {\n    \"use strict\";\n    return range(1, 100)\n        .filter(function (x) {\n            return integerFactors(x)\n                .length\u00a0% 2;\n        });\n    function integerFactors(n) {\n        var rRoot = Math.sqrt(n),\n            intRoot = Math.floor(rRoot),\n            lows = range(1, intRoot)\n            .filter(function (x) {\n                return (n\u00a0% x) === 0;\n            });\n        return lows.concat(lows.map(function (x) {\n                return n / x;\n            })\n            .reverse()\n            .slice((rRoot === intRoot) | 0));\n    }\n    function range(m, n, delta) {\n        var d = delta || 1,\n            blnUp = n > m,\n            lng = Math.floor((blnUp\u00a0? n - m\u00a0: m - n) / d) + 1,\n            a = Array(lng),\n            i = lng;\n        if (blnUp)\n            while (i--) a[i] = (d * i) + m;\n        else\n            while (i--) a[i] = m - (d * i);\n        return a;\n    }\n})(100);",
        "safe": true
    },
    {
        "filename": "100 doors_359.txt",
        "content": "(function (n) {\n    \"use strict\";\n    return perfectSquaresUpTo(100);\n    function perfectSquaresUpTo(n) {\n        return range(1, Math.floor(Math.sqrt(n)))\n            .map(function (x) {\n                return x * x;\n            });\n    }\n    function range(m, n, delta) {\n        var d = delta || 1,\n            blnUp = n > m,\n            lng = Math.floor((blnUp\u00a0? n - m\u00a0: m - n) / d) + 1,\n            a = Array(lng),\n            i = lng;\n        if (blnUp)\n            while (i--) a[i] = (d * i) + m;\n        else\n            while (i--) a[i] = m - (d * i);\n        return a;\n    }\n})(100);",
        "safe": true
    },
    {
        "filename": "100 doors_36.txt",
        "content": "PROC doors optimised = ( INT limit )VOID:\n  FOR i TO limit DO\n    REAL num\u00a0:= sqrt(i);\n    print((whole(i,0),\" is \",(ENTIER num = num |\"opened\"|\"closed\"),newline))\n  OD\n;\ndoors optimised(100)\n",
        "safe": true
    },
    {
        "filename": "100 doors_360.txt",
        "content": "Array.apply(null, { length: 100 })\n  .map((v, i) => i + 1)\n    .forEach(door => { \n      var sqrt = Math.sqrt(door); \n\n      if (sqrt === (sqrt | 0)) {\n        console.log(\"Door %d is open\", door);\n      } \n    });",
        "safe": true
    },
    {
        "filename": "100 doors_361.txt",
        "content": "// Array comprehension style\n[ for (i of Array.apply(null, { length: 100 })) i ].forEach((_, i) => { \n  var door = i + 1\n  var sqrt = Math.sqrt(door); \n\n  if (sqrt === (sqrt | 0)) {\n    console.log(\"Door \" + door + \" is open\");\n  } \n});",
        "safe": true
    },
    {
        "filename": "100 doors_362.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_363.txt",
        "content": "(function (n) {\n \n \n    // ONLY PERFECT SQUARES HAVE AN ODD NUMBER OF INTEGER FACTORS\n    // (Leaving the door open at the end of the process) \n \n    return perfectSquaresUpTo(n);\n \n \n    // perfectSquaresUpTo\u00a0:: Int -> [Int]\n    function perfectSquaresUpTo(n) {\n        return range(1, Math.floor(Math.sqrt(n)))\n            .map(x => x * x);\n    }\n \n \n    // GENERIC\n \n    // range(intFrom, intTo, optional intStep)\n    // Int -> Int -> Maybe Int -> [Int]\n    function range(m, n, step) {\n        let d = (step || 1) * (n >= m\u00a0? 1\u00a0: -1);\n \n        return Array.from({\n            length: Math.floor((n - m) / d) + 1\n        }, (_, i) => m + (i * d));\n    }\n \n})(100);",
        "safe": true
    },
    {
        "filename": "100 doors_364.txt",
        "content": "[1, 4, 9, 16, 25, 36, 49, 64, 81, 100]",
        "safe": true
    },
    {
        "filename": "100 doors_365.txt",
        "content": "\"use strict\";\n\n// Doors can be open or closed.\nconst open = \"O\";\nconst closed = \"C\";\n\n// There are 100 doors in a row that are all initially closed.\nconst doorsCount = 100;\nconst doors = [];\nfor (let i = 0; i < doorsCount; doors[i] = closed, i++);\n\n// You make 100 passes by the doors, visiting every door and toggle the door (if\n// the door is closed, open it; if it is open, close it), according to the rules\n// of the task.\nfor (let pass = 1; pass <= doorsCount; pass++)\n    for (let i = pass - 1; i < doorsCount; i += pass)\n        doors[i] = doors[i] == open\u00a0? closed\u00a0: open;\n\n// Answer the question: what state are the doors in after the last pass?\ndoors.forEach((v, i) =>\n    console.log(`Doors ${i + 1} are ${v == open\u00a0? 'opened'\u00a0: 'closed'}.`));\n\n// Which are open, which are closed?\nlet openKeyList = [];\nlet closedKeyList = [];\nfor (let door of doors.entries())\n    if (door[1] == open)\n        openKeyList.push(door[0] + 1);\n    else\n        closedKeyList.push(door[0] + 1);\nconsole.log(\"These are open doors: \" + openKeyList.join(\", \") + \".\");\nconsole.log(\"These are closed doors: \" + closedKeyList.join(\", \") + \".\");\n\n// Assert:\nconst expected = [];\nfor (let i = 1; i * i <= doorsCount; expected.push(i * i), i++);\nif (openKeyList.every((v, i) => v === expected[i]))\n    console.log(\"The task is solved.\")\nelse\n    throw \"These aren't the doors you're looking for.\";",
        "safe": true
    },
    {
        "filename": "100 doors_366.txt",
        "content": "# Solution for n doors:\ndef doors(n):\n\n  def print:\n    . as $doors\n    | range(1; length+1)\n    | if $doors[.] then \"Door \\(.) is open\" else empty end;\n\n    [range(n+1)|null] as $doors\n  | reduce range(1; n+1) as $run\n      ( $doors; reduce range($run; n+1; $run ) as $door\n                  ( .; .[$door] = (.[$door] | not) ) )\n  | print\u00a0;",
        "safe": true
    },
    {
        "filename": "100 doors_367.txt",
        "content": "# Solution for 100 doors:\ndef solution:\n  range(1;11) | \"Door \\(. * .) is open\";",
        "safe": true
    },
    {
        "filename": "100 doors_368.txt",
        "content": "doors = falses(100)\nfor a in 1:100, b in a:a:100\n    doors[b] = !doors[b]\nend\nfor a = 1:100\n    println(\"Door $a is \" * (doors[a]\u00a0? \"open.\"\u00a0: \"closed.\")) \nend",
        "safe": true
    },
    {
        "filename": "100 doors_369.txt",
        "content": "for i in 1:10 println(\"Door $(i^2) is open.\") end",
        "safe": true
    },
    {
        "filename": "100 doors_37.txt",
        "content": "begin\n    % find the first few squares via the unoptimised door flipping method  \u00a0%\n \n    integer doorMax;\n    doorMax\u00a0:= 100;\n \n    begin\n        % need to start a new block so the array can have variable bounds  \u00a0%\n \n        % array of doors - door( i ) is true if open, false if closed      \u00a0%\n        logical array door( 1\u00a0:: doorMax );\n \n        % set all doors to closed                                          \u00a0%\n        for i\u00a0:= 1 until doorMax do door( i )\u00a0:= false;\n \n        % repeatedly flip the doors                                        \u00a0%\n        for i\u00a0:= 1 until doorMax\n        do begin\n            for j\u00a0:= i step i until doorMax\n            do begin\n                door( j )\u00a0:= not door( j )\n            end\n        end;\n \n        % display the results                                              \u00a0%\n        i_w\u00a0:= 1; % set integer field width                                \u00a0%\n        s_w\u00a0:= 1; % and separator width                                    \u00a0%\n        for i\u00a0:= 1 until doorMax do if door( i ) then writeon( i )\n \n    end\n \nend.\n",
        "safe": true
    },
    {
        "filename": "100 doors_370.txt",
        "content": "   doors:{`closed`open![;2]@#:'1_=,/&:'0=t!\\:/:t:!101}",
        "safe": true
    },
    {
        "filename": "100 doors_371.txt",
        "content": "   (1+!10)^2\n1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100 doors_372.txt",
        "content": "   {(1+!_ x^%2)^2}100\n1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100 doors_373.txt",
        "content": "include ..\\Utilitys.tlhy\n\n%n 100 !n\n0 $n repeat\n\n$n [dup sqrt int dup * over\n== ( [1 swap set] [drop] ) if] for\n\n$n [ ( \"The door \" over  \" is \" ) lprint get ( [\"OPEN\"] [\"closed\"] ) if print nl] for\n\n( \"Time elapsed: \" msec \" seconds\" ) lprint nl\n\npstack\n\" \" input",
        "safe": true
    },
    {
        "filename": "100 doors_374.txt",
        "content": "flip::{,/{(1-*x),1_x}'x:#y}\ni::0;(100{i::i+1;flip(i;x)}:*100:^0)?1",
        "safe": true
    },
    {
        "filename": "100 doors_375.txt",
        "content": "(1+!9)^2",
        "safe": true
    },
    {
        "filename": "100 doors_376.txt",
        "content": "type state\n  Open\n  Closed\n\nfun toggle(self: state): state\n  match self\n    Open   -> Closed\n    Closed -> Open\n\ninline extern unsafe-assign\u00a0: forall<a> ( v\u00a0: vector<a>, i\u00a0: ssize_t, x\u00a0: a ) -> total ()\n  c \"kk_vector_unsafe_assign\"\n\nfun main()\n  val doors = vector(100, Closed)\n  for(0,99) fn(pass)\n    var door\u00a0:= pass\n    while { door < 99 }\n      doors.unsafe-assign(door.ssize_t, doors[door].toggle)\n      door\u00a0:= door + (pass+1)\n  doors.foreach-indexed fn(idx, it)\n    match it\n      Open   -> println(\"door \" ++ (idx + 1).show ++ \" is open\")\n      Closed -> println(\"door \" ++ (idx + 1).show ++ \" is closed\")",
        "safe": true
    },
    {
        "filename": "100 doors_377.txt",
        "content": "fun main()\n  val doors = list(0,99,1,fn(i) Closed)\n  val transformed = list(1,99).foldl(doors) fn(drs, pass)\n    drs.map-indexed fn(i, door)\n      if ((i + 1)\u00a0% pass) == 0 then door.toggle else door\n  transformed.foreach-indexed fn(idx, it)\n    match it\n      Open   -> println(\"door \" ++ (idx + 1).show ++ \" is open\")\n      Closed -> println(\"door \" ++ (idx + 1).show ++ \" is closed\")",
        "safe": true
    },
    {
        "filename": "100 doors_378.txt",
        "content": "fun oneHundredDoors(): List<Int> {\n    val doors = BooleanArray(100) { false }\n\n    repeat(doors.size) { i ->\n        for (j in i until doors.size step (i + 1)) {\n            doors[j] = !doors[j]\n        }\n    }\n\n    return doors\n        .foldIndexed(emptyList()) { i, acc, door ->\n            if (door) acc + (i + 1) else acc\n        }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_379.txt",
        "content": "range InitialDoor from 1 to 100 step 1\n| extend DoorsVisited=range(InitialDoor, 100, InitialDoor)\n| mvexpand DoorVisited=DoorsVisited to typeof(int)\n| summarize VisitCount=count() by DoorVisited\n| project Door=DoorVisited, IsOpen=(VisitCount\u00a0% 2) == 1",
        "safe": true
    },
    {
        "filename": "100 doors_38.txt",
        "content": " 1 4 9 16 25 36 49 64 81 100 \n",
        "safe": true
    },
    {
        "filename": "100 doors_380.txt",
        "content": "1) unoptimized version\n\n{def doors\n {A.new\n  {S.map {lambda {} false} {S.serie 1 100}}}}\n-> doors\n\n{def toggle\n {lambda {:i :a}\n  {let { {_ {A.set! :i {not {A.get :i :a}} :a} }}}}}\n-> toggle\n\n{S.map {lambda {:b} \n {S.map {lambda {:i} {toggle :i {doors}}} \n  {S.serie :b 99 {+ :b 1}}}}\n   {S.serie 0 99}} \n->\n\n{S.replace \\s by space in \n {S.map {lambda {:i} {if {A.get :i {doors}} then {+ :i 1} else}} \n  {S.serie 0 99}}}\n\n-> 1 4 9 16 25 36 49 64 81 100\n\n2.2) optimized version\n\n{S.replace \\s by space in \n {S.map {lambda {:i}\n         {let { {:root {sqrt :i}} } \n              {if {= :root {round :root}} \n               then {* :root :root}\n               else}}}\n        {S.serie 1 100}}}\n\n-> 1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100 doors_381.txt",
        "content": "&doors = fn.arrayGenerateFrom(fn.inc, 100)\nfp.mapper = ($i) -> {\n\t$n\n\t$open = 0\n\trepeat($[n], 100) {\n\t\t$open $= $i\u00a0% +|$n?!$open:$open\n\t}\n\t\n\treturn $open\n}\nfn.arrayMap(&doors, fp.mapper)\n\nfn.print(Open doors:)\n$i\nrepeat($[i], @&doors) {\n\tif(&doors[$i]) {\n\t\tfn.printf(\\s%03d, parser.op(+|$i))\n\t}\n}\nfn.println()",
        "safe": true
    },
    {
        "filename": "100 doors_382.txt",
        "content": "Open doors: 001 004 009 016 025 036 049 064 081 100\n",
        "safe": true
    },
    {
        "filename": "100 doors_383.txt",
        "content": "var doors = [false] * 100\n\nfor i of doors {\n    for j = i; j <= len(doors); j += i {\n        doors[j] = not doors[j]\n    }\n}\n\nwriteln for[=[]] i of doors { if doors[i]: _for = more(_for, i) }",
        "safe": true
    },
    {
        "filename": "100 doors_384.txt",
        "content": "writeln foldfrom(fn a, b, c: if(b: a~[c]; a), [], doors, series(1..len(doors)))",
        "safe": true
    },
    {
        "filename": "100 doors_385.txt",
        "content": "writeln map(fn{^2}, 1..10)",
        "safe": true
    },
    {
        "filename": "100 doors_386.txt",
        "content": "[1, 4, 9, 16, 25, 36, 49, 64, 81, 100]",
        "safe": true
    },
    {
        "filename": "100 doors_387.txt",
        "content": "loop(100) => {^\n\tlocal(root = math_sqrt(loop_count))\n\tlocal(state = (#root == math_ceil(#root)\u00a0? '<strong>open</strong>' | 'closed'))\n\t#state\u00a0!= 'closed'\u00a0? 'Door ' + loop_count + ': ' + #state + '<br>'\n^}",
        "safe": true
    },
    {
        "filename": "100 doors_388.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_389.txt",
        "content": "use 'format importAllSigils.\n\ndoors\u00a0:= Object clone.\ndoors missing\u00a0:= { False. }.\ndoors check\u00a0:= {\n  self slot ($1 ordinal).\n}.\ndoors toggle\u00a0:= {\n  self slot ($1 ordinal) = self slot ($1 ordinal) not.\n}.\n1 upto 101 do {\n  takes '[i].\n  local 'j = i.\n  while { j <= 100. } do {\n    doors toggle (j).\n    j = j + i.\n  }.\n}.\n$stdout printf: ~fmt \"The open doors are: ~A\", 1 upto 101 filter { doors check. } to (Array).",
        "safe": true
    },
    {
        "filename": "100 doors_39.txt",
        "content": "BEGIN\n\nINTEGER ARRAY DOORS[1:100];\nINTEGER I, J, OPEN, CLOSED;\n\nOPEN\u00a0:= 1;\nCLOSED\u00a0:= 0;\n\n% ALL DOORS ARE INITIALLY CLOSED\u00a0%\nFOR I\u00a0:= 1 STEP 1 UNTIL 100 DO\n  BEGIN\n    DOORS[I]\u00a0:= CLOSED;\n  END;\n\n% PASS THROUGH AT INCREASING INTERVALS AND FLIP\u00a0%\nFOR I\u00a0:= 1 STEP 1 UNTIL 100 DO\n  BEGIN\n     FOR J\u00a0:= I STEP I UNTIL 100 DO\n       BEGIN\n         DOORS[J]\u00a0:= 1 - DOORS[J];\n       END;\n  END;\n\n% SHOW RESULTS\u00a0%\nWRITE(\"THE OPEN DOORS ARE:\");\nWRITE(\"\");\nFOR I\u00a0:= 1 STEP 1 UNTIL 100 DO\n  BEGIN\n    IF DOORS[I] = OPEN THEN\n      WRITEON(I);\n  END;\n\nEND",
        "safe": true
    },
    {
        "filename": "100 doors_390.txt",
        "content": "to doors\n\t;Problem 100 Doors \n\t;Lhogho\n\n\tfor \"p [1 100] \n\t[\n\t\tmake :p \"false\n\t]\n\n\tfor \"a [1 100 1]\n\t[\n\t\tfor \"b [:a 100 :a]\n\t\t[\n\t\t\tif :b < 101 \n\t\t\t[\n\t\t\t\tmake :b not thing :b\n\t\t\t]\n\t\t]\n\t]\n\n\tfor \"c [1 100]\n\t[\n\t\tif thing :c \n\t\t[ \n\t\t\t(print \"door :c \"is \"open) \n\t\t]\n\t] \nend\n\ndoors",
        "safe": true
    },
    {
        "filename": "100 doors_391.txt",
        "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\nprint \"open doors \";\nfor door = 1 to 100\n    if doors(door) then print door;\"  \";\nnext door",
        "safe": true
    },
    {
        "filename": "100 doors_392.txt",
        "content": "var doors = List.fill(100, false)\n\nfor i in 0...99:\n    for j in i...99 by i + 1:\n        doors[j] = !doors[j]\n\n# The type must be specified since the list starts off empty.\nvar open_doors: List[Integer] = []\n\ndoors.each_index{|i|\n    if doors[i]:\n        open_doors.push(i + 1)\n}\n\nprint($\"Open doors: ^(open_doors)\")",
        "safe": true
    },
    {
        "filename": "100 doors_393.txt",
        "content": "Open doors: [1, 4, 9, 16, 25, 36, 49, 64, 81, 100]",
        "safe": true
    },
    {
        "filename": "100 doors_394.txt",
        "content": "on mouseUp   \n   repeat with tStep = 1 to 100\n      repeat with tDoor = tStep to 100 step tStep\n         put not tDoors[tDoor] into tDoors[tDoor]\n      end repeat\n      if tDoors[tStep] then put \"Door \" & tStep & \" is open\" & cr after tList\n   end repeat\n   set the text of field \"Doors\" to tList\nend mouseUp",
        "safe": true
    },
    {
        "filename": "100 doors_395.txt",
        "content": "to doors\n;Problem 100 Doors \n;FMSLogo\n;lrcvs 2010\n\nmake \"door (vector 100 1) \nfor [p 1 100][setitem :p :door 0] \n  \nfor [a 1 100 1][for [b :a 100 :a][make \"x item :b :door \n\t                          ifelse :x  = 0 [setitem :b :door 1][setitem :b :door 0] ] ] \n  \nfor [c 1 100][make \"y item :c :door \n\t      ifelse :y = 0 [pr (list :c \"Close)] [pr (list :c \"Open)] ] \nend",
        "safe": true
    },
    {
        "filename": "100 doors_396.txt",
        "content": "HAI 1.3\n\nI HAS A doors ITZ A BUKKIT\nIM IN YR hallway UPPIN YR door TIL BOTH SAEM door AN 100\n    doors HAS A SRS door ITZ FAIL BTW, INISHULIZE ALL TEH DOORZ AS CLOZD\nIM OUTTA YR hallway\n\nIM IN YR hallway UPPIN YR pass TIL BOTH SAEM pass AN 100\n    I HAS A door ITZ pass\n    IM IN YR passer\n        doors'Z SRS door R NOT doors'Z SRS door\n        door R SUM OF door AN SUM OF pass AN 1\n        DIFFRINT door AN SMALLR OF door AN 99, O RLY?\n            YA RLY, GTFO\n        OIC\n    IM OUTTA YR passer\nIM OUTTA YR hallway\n\nIM IN YR printer UPPIN YR door TIL BOTH SAEM door AN 100\n    VISIBLE \"Door #\" SUM OF door AN 1 \" is \"!\n    doors'Z SRS door, O RLY?\n        YA RLY, VISIBLE \"open.\"\n        NO WAI, VISIBLE \"closed.\"\n    OIC\nIM OUTTA YR printer\n\nKTHXBYE",
        "safe": true
    },
    {
        "filename": "100 doors_397.txt",
        "content": "local is_open = {}\n\nfor pass = 1,100 do\n    for door = pass,100,pass do\n        is_open[door] = not is_open[door]\n    end\nend\n\nfor i,v in next,is_open do\n    print ('Door '..i..':',v and 'open' or 'close')\nend",
        "safe": true
    },
    {
        "filename": "100 doors_398.txt",
        "content": "Module Doors100 {\n      Dim Doors(1 to 100)\n      For i=1 to 100\n            For j=i to 100 step i\n                  Doors(j)~\n            Next j\n      Next i\n      DispAll()\n      ' optimization\n      Dim Doors(1 to 100)=False\n      For i=1 to 10\n            Doors(i**2)=True\n      Next i\n      Print\n      DispAll()\n      Sub DispAll()\n            Local i\n            For i=1 to 100\n                  if Doors(i) then print i,\n            Next i\n            Print\n      End Sub\n}\nDoors100",
        "safe": true
    },
    {
        "filename": "100 doors_399.txt",
        "content": "define(`_set', `define(`$1[$2]', `$3')')dnl\ndefine(`_get', `defn(`$1[$2]')')dnl\ndefine(`for',`ifelse($#,0,``$0'',`ifelse(eval($2<=$3),1,\n`pushdef(`$1',$2)$5`'popdef(`$1')$0(`$1',eval($2+$4),$3,$4,`$5')')')')dnl\ndefine(`opposite',`_set(`door',$1,ifelse(_get(`door',$1),`closed',`open',`closed'))')dnl\ndefine(`upper',`100')dnl\nfor(`x',`1',upper,`1',`_set(`door',x,`closed')')dnl\nfor(`x',`1',upper,`1',`for(`y',x,upper,x,`opposite(y)')')dnl\nfor(`x',`1',upper,`1',`door x is _get(`door',x)\n')dnl",
        "safe": true
    },
    {
        "filename": "100 doors_4.txt",
        "content": "@echo off\nset doors=%@repeat[C,100]\ndo step = 1 to 100\n  do door = %step to 100 by %step\n    set doors=%@left[%@eval[%door-1],%doors]%@if[%@instr[%@eval[%door-1],1,%doors]==C,O,C]%@right[%@eval[100-%door],%doors]\n  enddo\nenddo",
        "safe": true
    },
    {
        "filename": "100 doors_40.txt",
        "content": "THE OPEN DOORS ARE:\n     1     4     9    16    25    36    49    64    81   100\n",
        "safe": true
    },
    {
        "filename": "100 doors_400.txt",
        "content": "        .TITLE  DOORS\n        .MCALL  .TTYOUT,.EXIT\nNDOORS  =       ^D100\nDOORS::\n       \u00a0; CLOSE ALL DOORS\n        MOV     #DOORBF+1,R0\nCLOSE:  CLR     (R0)+\n        CMP     R0,#BUFTOP\n        BLT     CLOSE\n\n       \u00a0; VISIT DOORS\n        MOV     #1,R1                  \u00a0; R1 = PASS\nPASS:   MOV     R1,R2                  \u00a0; R2 = DOOR\nDOOR:   COMB    DOORBF(R2)             \u00a0; VISIT DOOR\n        ADD     R1,R2\n        CMP     R2,#NDOORS             \u00a0; NEXT DOOR\n        BLE     DOOR\n        INC     R1\n        CMP     R1,R2                  \u00a0; NEXT PASS\n        BLE     PASS\n\n       \u00a0; DISPLAY DOORS AS ASCII 0 OR 1\n        MOV     #DOORBF+1,R1\nDISP:   MOVB    (R1)+,R0\n        BICB    #^C1,R0\n        BISB    #^D48,R0\n        .TTYOUT\n        CMP     R1,#BUFTOP\n        BLT     DISP\n\n        .EXIT\nDOORBF: .BLKB   NDOORS+1\nBUFTOP  =       .\n        .END    DOORS",
        "safe": true
    },
    {
        "filename": "100 doors_401.txt",
        "content": "1001000010000001000000001000000000010000000000001000000000000001000000000000000010000000000000000001",
        "safe": true
    },
    {
        "filename": "100 doors_402.txt",
        "content": "            NORMAL MODE IS INTEGER\n            DIMENSION OPEN(100)\n            PRINT COMMENT $ $\n           \n          R MAKE SURE ALL DOORS ARE CLOSED AT BEGINNING\n            THROUGH CLOSE, FOR DOOR=1, 1, DOOR.G.100\nCLOSE       OPEN(DOOR) = 0\n\n          R MAKE 100 PASSES\n            THROUGH TOGGLE, FOR PASS=1, 1, PASS.G.100\n            THROUGH TOGGLE, FOR DOOR=PASS, PASS, DOOR.G.100\nTOGGLE      OPEN(DOOR) = 1 - OPEN(DOOR) \n\n          R PRINT THE DOORS THAT ARE OPEN\n            THROUGH SHOW, FOR DOOR=1, 1, DOOR.G.100\nSHOW        WHENEVER OPEN(DOOR).E.1, PRINT FORMAT ISOPEN, DOOR\n           \n            VECTOR VALUES ISOPEN = $5HDOOR ,I3,S1,8HIS OPEN.*$     \n            END OF PROGRAM",
        "safe": true
    },
    {
        "filename": "100 doors_403.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100 doors_404.txt",
        "content": ".DEFAULT_GOAL:=100\ndigit=1 2 3 4 5 6 7 8 9\ndoors:=$(digit) $(foreach i,$(digit),$(foreach j,0 $(digit),$i$j)) 100\n$(doors):;@: $(if $(filter %1 %3 %5 %7 %9,$(words $^)),$(info $@))\n$(foreach i,$(doors),$(eval $i: $(word $i,0 $(doors))))\n0 $(addprefix pass,$(doors)):\npass:=X\ndep=$(eval count+=$(pass))$(eval $(words $(count)):pass$(words $(pass)))\nloop=$(foreach inner,$(doors),$(if $(word 101,$(count)),,$(dep)))\n$(foreach outer,$(doors),$(eval pass+=X)$(eval count:=)$(loop))",
        "safe": true
    },
    {
        "filename": "100 doors_405.txt",
        "content": "NDoors\u00a0:= proc( N\u00a0:: posint )\n        # Initialise, using 0 to represent \"closed\"\n        local pass, door, doors\u00a0:= Array( 1 .. N, 'datatype' = 'integer'[ 1 ] );\n        # Now do N passes\n        for pass from 1 to N do\n                for door from pass by pass while door <= N do\n                        doors[ door ]\u00a0:= 1 - doors[ door ]\n                end do\n        end do;\n        # Output\n        for door from 1 to N do\n                printf( \"Door %d is %s.\\n\", door, `if`( doors[ door ] = 0, \"closed\", \"open\" ) )\n        end do;\n        # Since this is a printing routine, return nothing.\n        NULL\nend proc:",
        "safe": true
    },
    {
        "filename": "100 doors_406.txt",
        "content": "> NDoors( 100 );",
        "safe": true
    },
    {
        "filename": "100 doors_407.txt",
        "content": "> seq( i^2, i = 1 .. isqrt( 100 ) );\n                  1, 4, 9, 16, 25, 36, 49, 64, 81, 100",
        "safe": true
    },
    {
        "filename": "100 doors_408.txt",
        "content": "> [seq]( 1 .. 10 )^~2;\n                 [1, 4, 9, 16, 25, 36, 49, 64, 81, 100]",
        "safe": true
    },
    {
        "filename": "100 doors_409.txt",
        "content": "n=100;\ntmp=ConstantArray[-1,n];\nDo[tmp[[i;;;;i]]*=-1;,{i,n}];\nDo[Print[\"door \",i,\" is \",If[tmp[[i]]==-1,\"closed\",\"open\"]],{i,1,Length[tmp]}]",
        "safe": true
    },
    {
        "filename": "100 doors_41.txt",
        "content": "PROC main()\n  DEF t[100]: ARRAY,\n      pass, door\n  FOR door\u00a0:= 0 TO 99 DO t[door]\u00a0:= FALSE\n  FOR pass\u00a0:= 0 TO 99\n    door\u00a0:= pass\n    WHILE door <= 99\n      t[door]\u00a0:= Not(t[door])\n      door\u00a0:= door + pass + 1\n    ENDWHILE\n  ENDFOR\n  FOR door\u00a0:= 0 TO 99 DO WriteF('\\d is \\s\\n', door+1,\n                                IF t[door] THEN 'open' ELSE 'closed')\nENDPROC",
        "safe": true
    },
    {
        "filename": "100 doors_410.txt",
        "content": "f[n_] = \"Closed\"; \nDo[Do[If[f[n] == \"Closed\", f[n] = \"Open\", f[n] = \"Closed\"], {n, k, 100, k}], {k, 1, 100}]; \nTable[f[n], {n, 1, 100}]",
        "safe": true
    },
    {
        "filename": "100 doors_411.txt",
        "content": "Fold[\n ReplacePart[#1, (i_ /; Mod[i, #2] == 0)\u00a0:> (-#1[[i]])] &,\n ConstantArray[-1, {100}],\n Range[100]\n] /. {1 -> \"Open\", -1 -> \"Closed\"}",
        "safe": true
    },
    {
        "filename": "100 doors_412.txt",
        "content": "Do[Print[\"door \",i,\" is \",If[IntegerQ[Sqrt[i]],\"open\",\"closed\"]],{i,100}]",
        "safe": true
    },
    {
        "filename": "100 doors_413.txt",
        "content": "n=100;\na=Range[1,Sqrt[n]]^2\nDo[Print[\"door \",i,\" is \",If[MemberQ[a,i],\"open\",\"closed\"]],{i,100}]",
        "safe": true
    },
    {
        "filename": "100 doors_414.txt",
        "content": "n=100\nnn=1\na=0\nFor[i=1,i<=n,i++,\n If[i==nn,\n  Print[\"door \",i,\" is open\"];\n  a++;\n  nn+=2a+1;\n ,\n  Print[\"door \",i,\" is closed\"];\n ];\n]",
        "safe": true
    },
    {
        "filename": "100 doors_415.txt",
        "content": "Pick[Range[100], Xor@@@Array[Divisible[#1,#2]&, {100,100}]]",
        "safe": true
    },
    {
        "filename": "100 doors_416.txt",
        "content": "Range[Sqrt[100]]^2",
        "safe": true
    },
    {
        "filename": "100 doors_417.txt",
        "content": "a = false(1,100);\nfor b=1:100\n  for i = b:b:100\n    a(i) = ~a(i);\n  end\nend\na",
        "safe": true
    },
    {
        "filename": "100 doors_418.txt",
        "content": "for x=1:100;\n  if sqrt(x) == floor(sqrt(x))\n    a(i)=1;\n  end\nend\na",
        "safe": true
    },
    {
        "filename": "100 doors_419.txt",
        "content": "doors   = zeros(1,100); // 0: closed 1: open\nfor i = 1:100\n    doors(i:i:100) = 1-doors(i:i:100)\nend\ndoors",
        "safe": true
    },
    {
        "filename": "100 doors_42.txt",
        "content": "doors\u2190{100\u2374((\u2375-1)\u23740),1}\n\u2260\u233f\u2283doors\u00a8 \u2373100\n",
        "safe": true
    },
    {
        "filename": "100 doors_420.txt",
        "content": "a = zeros(100,1);\nfor counter = 1:sqrt(100);\n  a(counter^2) = 1;\nend\na",
        "safe": true
    },
    {
        "filename": "100 doors_421.txt",
        "content": "function [doors,opened,closed] = hundredDoors()\n\n    %Initialize the doors, make them booleans for easy vectorization\n    doors = logical( (1:1:100) );\n    \n    %Go through the flipping process, ignore the 1 case because the doors\n    %array is already initialized to all open\n    for initialPosition = (2:100)\n        doors(initialPosition:initialPosition:100) = not( doors(initialPosition:initialPosition:100) );\n    end\n    \n    opened = find(doors); %Stores the numbers of the open doors\n    closed = find( not(doors) ); %Stores the numbers of the closed doors\n    \nend",
        "safe": true
    },
    {
        "filename": "100 doors_422.txt",
        "content": "doors((1:10).^2) = 1;\n\ndoors",
        "safe": true
    },
    {
        "filename": "100 doors_423.txt",
        "content": "doors(n)\u00a0:= block([v], local(v),\n  v: makelist(true, n),\n  for i: 2 thru n do\n  for j: i step i thru n do v[j]: not v[j],\n  sublist_indices(v, 'identity));",
        "safe": true
    },
    {
        "filename": "100 doors_424.txt",
        "content": "doors(100);\n/* [1, 4, 9, 16, 25, 36, 49, 64, 81, 100] */",
        "safe": true
    },
    {
        "filename": "100 doors_425.txt",
        "content": "doorsOpen = for i in 1 to 100 collect false\n\nfor pass in 1 to 100 do\n(\n    for door in pass to 100 by pass do\n    (\n        doorsOpen[door] = not doorsOpen[door]\n    )\n)\n\nfor i in 1 to doorsOpen.count do\n(\n    format (\"Door\u00a0% is open?:\u00a0%\\n\") i doorsOpen[i]\n)",
        "safe": true
    },
    {
        "filename": "100 doors_426.txt",
        "content": "for i in 1 to 100 do\n(\n    root = pow i 0.5\n    format (\"Door\u00a0% is open?:\u00a0%\\n\") i (root == (root as integer))\n)",
        "safe": true
    },
    {
        "filename": "100 doors_427.txt",
        "content": ":- module doors.\n:- interface.\n:- import_module io.\n:- pred main(io::di, io::uo) is det.\n:- implementation.\n:- import_module bitmap, bool, list, string, int.\n\n:- func doors = bitmap.\ndoors = bitmap.init(100, no).\n\n:- pred walk(int, bitmap, bitmap).\n:- mode walk(in, bitmap_di, bitmap_uo) is det.\nwalk(Pass, !Doors)\u00a0:-\n    walk(Pass, Pass, !Doors).\n\n:- pred walk(int, int, bitmap, bitmap).\n:- mode walk(in, in, bitmap_di, bitmap_uo) is det.\nwalk(At, By, !Doors)\u00a0:-\n    ( if bitmap.in_range(!.Doors, At - 1) then\n        bitmap.unsafe_flip(At - 1, !Doors),\n        walk(At + By, By, !Doors)\n    else\n        true\n    ).\n\n:- pred report(bitmap, int, io, io).\n:- mode report(bitmap_di, in, di, uo) is det.\nreport(Doors, N, !IO)\u00a0:-\n    ( if is_set(Doors, N - 1) then\n        State = \"open\"\n    else\n        State = \"closed\"\n    ),\n    io.format(\"door #%d is %s\\n\",\n        [i(N), s(State)], !IO).\n\nmain(!IO)\u00a0:-\n    list.foldl(walk, 1 .. 100, doors, Doors),\n    list.foldl(report(Doors), 1 .. 100, !IO).",
        "safe": true
    },
    {
        "filename": "100 doors_428.txt",
        "content": "boolean doors[];\nfor i = 1 upto 100: doors[i]\u00a0:= false; endfor\nfor i = 1 upto 100:\n  for j = 1 step i until 100:\n    doors[j]\u00a0:= not doors[j];\n  endfor\nendfor\nfor i = 1 upto 100:\n  message decimal(i) & \" \" & if doors[i]: \"open\" else: \"close\" fi;\nendfor\nend",
        "safe": true
    },
    {
        "filename": "100 doors_429.txt",
        "content": "For offset = 1 To 100\n  For i = 0 To 100 Step offset\n    a[i] = a[i] + 1\n  EndFor\nEndFor\n' Print \"opened\" doors\nFor i = 1 To 100\n  If math.Remainder(a[i], 2) = 1 Then \n    TextWindow.WriteLine(i)\n  EndIf  \nEndFor",
        "safe": true
    },
    {
        "filename": "100 doors_43.txt",
        "content": "2|+/[1]0=D\u2218.|D\u2190\u2373100\n",
        "safe": true
    },
    {
        "filename": "100 doors_430.txt",
        "content": "1\n4\n9\n16\n25\n36\n49\n64\n81\n100\n",
        "safe": true
    },
    {
        "filename": "100 doors_431.txt",
        "content": "d = {}\nfor p in range(1, 100)\n    for t in range(p, 100, p)\n        if d.hasIndex(t) then d.remove t else d.push t\n    end for\nend for\n\nprint d.indexes.sort",
        "safe": true
    },
    {
        "filename": "100 doors_432.txt",
        "content": "[1, 4, 9, 16, 25, 36, 49, 64, 81, 100]",
        "safe": true
    },
    {
        "filename": "100 doors_433.txt",
        "content": "d = [false] * 101\nopen = []\nfor p in range(1, 100)\n    for t in range(p, 100, p)\n        d[t] = not d[t]\n    end for\n    if d[p] then open.push p\nend for\n\nprint open",
        "safe": true
    },
    {
        "filename": "100 doors_434.txt",
        "content": ".data\n  doors:     .space 100\n  num_str:   .asciiz \"Number \"\n  comma_gap: .asciiz \" is \"\n  newline:   .asciiz \"\\n\"\n\n.text\nmain:\n# Clear all the cells to zero\n  li $t1, 100\n  la $t2, doors\nclear_loop:\n  sb $0, ($t2)\n  add $t2, $t2, 1\n  sub $t1, $t1, 1\n  bnez $t1, clear_loop\n\n# Now start the loops\n  li $t0, 1         # This will the the step size\n  li $t4, 1         # just an arbitrary 1\nloop1:\n  move $t1, $t0      # Counter\n  la $t2, doors      # Current pointer\n  add $t2, $t2, $t0\n  addi $t2, $t2, -1\nloop2:\n  lb $t3, ($t2)\n  sub $t3, $t4, $t3\n  sb $t3, ($t2)\n  add $t1, $t1, $t0\n  add $t2, $t2, $t0\n  ble $t1, 100, loop2\n\n  addi $t0, $t0, 1\n  ble $t0, 100, loop1\n\n  # Now display everything\n  la $t0, doors\n  li $t1, 1\nloop3:\n  li $v0, 4\n  la $a0, num_str\n  syscall\n  \n  li $v0, 1\n  move $a0, $t1\n  syscall\n\n  li $v0, 4\n  la $a0, comma_gap\n  syscall\n\n  li $v0, 1\n  lb $a0, ($t0)\n  syscall\n\n  li $v0, 4,\n  la $a0, newline\n  syscall\n\n  addi $t0, $t0, 1\n  addi $t1, $t1, 1\n  bne $t1, 101 loop3",
        "safe": true
    },
    {
        "filename": "100 doors_435.txt",
        "content": "import java.util.ArrayList\n\nclass Door\n\t:state\n\n\tdef initialize\n\t\t@state=false\n\tend\n \n\tdef closed?;\u00a0!@state; end\n\tdef open?; @state; end\n\n\tdef close; @state=false; end\n\tdef open; @state=true; end\n \n\tdef toggle\n\t\tif closed?\n\t\t\topen\n\t\telse\n\t\t\tclose\n\t\tend\n\tend\n \n\tdef toString; Boolean.toString(@state); end\nend\n \ndoors=ArrayList.new\n1.upto(100) do\n    doors.add(Door.new)\nend \n\n1.upto(100) do |multiplier|\n    index = 0\n    doors.each do |door|\n        Door(door).toggle if (index+1)%multiplier == 0\n        index += 1\n    end\nend\n\ni = 0\ndoors.each do |door| \n    puts \"Door #{i+1} is #{door}.\"\n    i+=1\nend",
        "safe": true
    },
    {
        "filename": "100 doors_436.txt",
        "content": "main\u00a0:: [sys_message]\nmain = [Stdout (show (openDoors 100)), \n        Stdout \"\\n\"]    \n\nopenDoors\u00a0:: num->[num]\nopenDoors doors =\n    map snd (filter fst (zip2 (doorStates doors) [1..]))\n\ndoorStates\u00a0:: num->[bool]\ndoorStates doors =\n    take doors (foldr (zipWith (~=)) (repeat False) (map pass [1..doors]))\n\npass\u00a0:: num->[bool]\npass n = tl (concat (repeat (take n (True:repeat False))))\n\nzipWith f x y = map f' (zip2 x y)\n                where f' (x,y) = f x y",
        "safe": true
    },
    {
        "filename": "100 doors_437.txt",
        "content": "[1,4,9,16,25,36,49,64,81,100]",
        "safe": true
    },
    {
        "filename": "100 doors_438.txt",
        "content": "var %d = $str(0 $+ $chr(32),100), %m = 1\nwhile (%m <= 100) {\n  var %n = 1\n  while ($calc(%n * %m) <= 100) {\n    var %d = $puttok(%d,$iif($gettok(%d,$calc(%n * %m),32),0,1),$calc(%n * %m),32)\n    inc %n\n  }\n  inc %m\n}\necho -ag All Doors (Boolean): %d\nvar %n = 1\nwhile (%n <= $findtok(%d,1,0,32)) {\n  var %t = %t $findtok(%d,1,%n,32)\n  inc %n\n}\necho -ag Open Door Numbers: %t",
        "safe": true
    },
    {
        "filename": "100 doors_439.txt",
        "content": "MCSKIP \"WITH\" NL\n\"\" 100 doors\nMCINS\u00a0%.\nMCSKIP MT,<>\n\"\" Doors represented by P1-P100, 0 is closed\nMCPVAR 100\n\"\" Set P variables to 0\nMCDEF ZEROPS WITHS NL AS <MCSET T1=1\n%L1.MCSET PT1=0\nMCSET T1=T1+1\nMCGO L1 UNLESS T1 EN 101\n>\nZEROPS\n\"\" Generate door state\nMCDEF STATE WITHS () AS <MCSET T1=%A1.\nMCGO L1 UNLESS T1 EN 0\nclosed<>MCGO L0\n%L1.open>\n\"\" Main macro - no arguments\n\"\" T1 is pass number\n\"\" T2 is door number\nMCDEF DOORS WITHS NL\nAS <MCSET T1=1\n\"\" pass loop\n%L1.MCGO L4 IF T1 GR 100\n\"\" door loop\nMCSET T2=T1\n%L2.MCGO L3 IF T2 GR 100\nMCSET PT2=1-PT2\nMCSET T2=T2+T1\nMCGO L2\n%L3.MCSET T1=T1+1\nMCGO L1\n%L4.\"\" now output the result\nMCSET T1=1\n%L5.door %T1. is STATE(%PT1.)\nMCSET T1=T1+1\nMCGO L5 UNLESS T1 GR 100\n>\n\"\" Do it\nDOORS",
        "safe": true
    },
    {
        "filename": "100 doors_44.txt",
        "content": "\u2260\u233f0=(\u2373100)\u2218.|\u2373100\n",
        "safe": true
    },
    {
        "filename": "100 doors_440.txt",
        "content": "MODULE Doors;\nIMPORT InOut;\n\nTYPE State = (Closed, Open);\nTYPE List = ARRAY [1 .. 100] OF State;\n\nVAR\n  Doors: List;\n  I, J:  CARDINAL;\n\nBEGIN\n  FOR I\u00a0:= 1 TO 100 DO\n    FOR J\u00a0:= 1 TO 100 DO\n      IF J MOD I = 0 THEN\n        IF Doors[J] = Closed THEN\n          Doors[J]\u00a0:= Open\n        ELSE\n          Doors[J]\u00a0:= Closed\n        END\n      END\n    END\n  END;\n\n  FOR I\u00a0:= 1 TO 100 DO\n    InOut.WriteCard(I, 3);\n    InOut.WriteString(' is ');\n\n    IF Doors[I] = Closed THEN\n      InOut.WriteString('Closed.')\n    ELSE\n      InOut.WriteString('Open.')\n    END;\n\n    InOut.WriteLn\n  END\nEND Doors.",
        "safe": true
    },
    {
        "filename": "100 doors_441.txt",
        "content": "MODULE DoorsOpt;\nIMPORT InOut;\n\nTYPE State = (Closed, Open);\nTYPE List = ARRAY [1 .. 100] OF State;\n\nVAR\n  Doors: List;\n  I:  CARDINAL;\n\nBEGIN\n  FOR I\u00a0:= 1 TO 10 DO\n    Doors[I*I]\u00a0:= Open\n  END;\n\n  FOR I\u00a0:= 1 TO 100 DO\n    InOut.WriteCard(I, 3);\n    InOut.WriteString(' is ');\n    IF Doors[I] = Closed THEN\n      InOut.WriteString('Closed.')\n    ELSE\n      InOut.WriteString('Open.')\n    END;\n    InOut.WriteLn\n  END\nEND DoorsOpt.",
        "safe": true
    },
    {
        "filename": "100 doors_442.txt",
        "content": "MODULE Doors EXPORTS Main;\n\nIMPORT IO, Fmt;\n\nTYPE State = {Closed, Open};\nTYPE List = ARRAY [1..100] OF State;\n\nVAR doors\u00a0:= List{State.Closed, ..};\n\nBEGIN\n  FOR i\u00a0:= 1 TO 100 DO\n    FOR j\u00a0:= FIRST(doors) TO LAST(doors) DO\n      IF j MOD i = 0 THEN\n        IF doors[j] = State.Closed THEN\n          doors[j]\u00a0:= State.Open;\n        ELSE\n          doors[j]\u00a0:= State.Closed;\n        END;\n      END;\n    END;\n  END;\n\n  FOR i\u00a0:= FIRST(doors) TO LAST(doors) DO\n    IO.Put(Fmt.Int(i) & \" is \");\n    IF doors[i] = State.Closed THEN\n      IO.Put(\"Closed.\\n\");\n    ELSE\n      IO.Put(\"Open.\\n\");\n    END;\n  END;\nEND Doors.",
        "safe": true
    },
    {
        "filename": "100 doors_443.txt",
        "content": "MODULE DoorsOpt EXPORTS Main;\n\nIMPORT IO, Fmt;\n\nTYPE State = {Closed, Open};\nTYPE List = ARRAY [1..100] OF State;\n\nVAR doors\u00a0:= List{State.Closed, ..};\n\nBEGIN\n  FOR i\u00a0:= 1 TO 10 DO\n    doors[i * i]\u00a0:= State.Open;\n  END;\n\n  FOR i\u00a0:= FIRST(doors) TO LAST(doors) DO\n    IO.Put(Fmt.Int(i) & \" is \");\n    IF doors[i] = State.Closed THEN\n      IO.Put(\"Closed.\\n\");\n    ELSE\n      IO.Put(\"Open.\\n\");\n    END;\n  END;\nEND DoorsOpt.",
        "safe": true
    },
    {
        "filename": "100 doors_444.txt",
        "content": "101 var l .\n\nfor l 0 endfor\narr\n\n0 var i .\nfor l\n    i 1 + var i var j .\n    j l < var pass .\n    while pass\n        get j not insert j .\n        j i + var j\n        l < var pass .  \n    endwhile\nendfor\nprint /# show all doors #/\n\n/# show only open doors #/\n|| print .\n0 var i .\nfor l\n    get i\n    if\u00a0: i out | | out . . endif .\n    i 1 + var i .\nendfor\n\ninput . /# pause until ENTER key pressed #/",
        "safe": true
    },
    {
        "filename": "100 doors_445.txt",
        "content": "is_open = make(100);\nfor pass in [1..100]\n  for door in [pass..100]\n    if (door\u00a0% pass)\n      continue;\n    endif\n    is_open[door] = !is_open[door];\n  endfor\nendfor\n\n\"output the result\";\nfor door in [1..100]\n  player:tell(\"door #\", door, \" is \", (is_open[door]\u00a0? \"open\"\u00a0: \"closed\"), \".\");\nendfor",
        "safe": true
    },
    {
        "filename": "100 doors_446.txt",
        "content": "is_open = [false for door = 1,100]\n \nfor pass = 1,100 \n    for door = pass,100,pass\n        is_open[door] = not is_open[door]\n  \nfor i,v in ipairs is_open\n    print \"Door #{i}: \" .. if v then 'open' else 'closed'",
        "safe": true
    },
    {
        "filename": "100 doors_447.txt",
        "content": "doors\tnew door,pass\n\tFor door=1:1:100 Set door(door)=0\n\tFor pass=1:1:100 For door=pass:pass:100 Set door(door)='door(door)\n\tFor door=1:1:100 If door(door) Write\u00a0!,\"Door\",$j(door,4),\" is open\"\n\tWrite\u00a0!,\"All other doors are closed.\"\n\tQuit\nDo doors\nDoor   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\nAll other doors are closed.",
        "safe": true
    },
    {
        "filename": "100 doors_448.txt",
        "content": "use std\n\nconst main = {\n\tvar isopen\t: bool[100]\n\n\tstd.slfill(isopen[:], false)\n\tfor var i = 0; i < isopen.len; i++\n\t\tfor var j = i; j < isopen.len; j += i + 1\n\t\t\tisopen[j] = !isopen[j]\n\t\t;;\n\t;;\n\n\tfor var i = 0; i < isopen.len; i++\n\t\tif isopen[i]\n\t\t\tstd.put(\"door {} is open\\n\", i + 1)\n\t\t;;\n\t;;\n}",
        "safe": true
    },
    {
        "filename": "100 doors_449.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_45.txt",
        "content": "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 \n      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 \n      0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1",
        "safe": true
    },
    {
        "filename": "100 doors_450.txt",
        "content": "DROP PROCEDURE IF EXISTS one_hundred_doors;\n\nDELIMITER |\n\nCREATE PROCEDURE one_hundred_doors (n INT)\nBEGIN\n  DROP TEMPORARY TABLE IF EXISTS doors; \n  CREATE TEMPORARY TABLE doors (\n    id INTEGER NOT NULL,\n    open BOOLEAN DEFAULT FALSE,\n    PRIMARY KEY (id)\n  );\n\n  SET @i = 1;\n  create_doors: LOOP\n    INSERT INTO doors (id, open) values (@i, FALSE);\n    SET @i = @i + 1;\n    IF @i > n THEN\n      LEAVE create_doors;\n    END IF;\n  END LOOP create_doors;\n\n  SET @i = 1;\n  toggle_doors: LOOP\n    UPDATE doors SET open = NOT open WHERE MOD(id, @i) = 0;\n    SET @i = @i + 1;\n    IF @i > n THEN\n      LEAVE toggle_doors;\n    END IF;\n  END LOOP toggle_doors;\n\n  SELECT id FROM doors WHERE open;\nEND|\n\nDELIMITER\u00a0;\n\nCALL one_hundred_doors(100);",
        "safe": true
    },
    {
        "filename": "100 doors_451.txt",
        "content": "+-----+\n| id  |\n+-----+\n|   1 |\n|   4 |\n|   9 |\n|  16 |\n|  25 |\n|  36 |\n|  49 |\n|  64 |\n|  81 |\n| 100 |\n+-----+\n10 rows in set (0.02 sec)\n",
        "safe": true
    },
    {
        "filename": "100 doors_452.txt",
        "content": "// allocate a boolean array with all closed doors (false)\n// we need 101 since there will technically be a door 0\ndoors = {false} * 101\n \n// loop through all the step lengths (1-100)\nfor step in range(1, 100)\n\t// loop through all the doors, stepping by step\n\tfor door in range(0, len(doors) - 1, step)\n\t\t// change the state of the current door\n\t\tdoors[door] = !doors[door]\n\tend for\nend for\n \n// loop through and print the doors that are open, skipping door 0\nfor i in range(1, len(doors) - 1)\n\t// if the door is open, display it\n\tif doors[i]\n\t\tprintln \"Door \" + i + \" is open.\"\n\tend if\nend for",
        "safe": true
    },
    {
        "filename": "100 doors_453.txt",
        "content": "/* NetRexx */\noptions replace format comments java crossref symbols binary\n\nTrue  = Rexx(1 == 1)\nFalse = Rexx(\\True)\n\ndoors = False\n\nloop i_ = 1 to 100\n  loop j_ = 1 to 100\n    if 0 = (j_ // i_) then doors[j_] = \\doors[j_]\n    end j_\n  end i_\n\nloop d_ = 1 to 100\n  if doors[d_] then  state = 'open'\n  else  state = 'closed'\n\n  say 'Door Nr.' Rexx(d_).right(4) 'is' state\n  end d_",
        "safe": true
    },
    {
        "filename": "100 doors_454.txt",
        "content": "/* NetRexx */\noptions replace format comments java crossref symbols binary\n\nTrue  = (1 == 1)\nFalse = \\True\n\ndoors = boolean[100]\n\nloop i_ = 0 to 9\n  doors[(i_ + 1) * (i_ + 1) - 1] = True;\n  end i_\n\nloop i_ = 0 to 99\n  if doors[i_] then  state = 'open'\n  else  state = 'closed'\n\n  say 'Door Nr.' Rexx(i_ + 1).right(4) 'is' state\n  end i_",
        "safe": true
    },
    {
        "filename": "100 doors_455.txt",
        "content": "/* NetRexx */\noptions replace format comments java crossref savelog symbols binary\n\nresultstring = ''\n\nloop i_ = 1 to 10\n  resultstring = resultstring || 'Door Nr.' Rexx(i_ * i_).right(4) 'is open\\n'\n  end i_\n\nsay resultstring",
        "safe": true
    },
    {
        "filename": "100 doors_456.txt",
        "content": "/* NetRexx */\n\nloop i = 1 to 10\n   say 'Door Nr.' i * i 'is open.'\n  end i",
        "safe": true
    },
    {
        "filename": "100 doors_457.txt",
        "content": "(define (status door-num)\n    (let ((x (int (sqrt door-num))))\n     (if\n       (= (* x x) door-num) (string \"Door \" door-num \" Open\")\n       (string \"Door \" door-num \" Closed\"))))\n\n(dolist (n (map status (sequence 1 100)))\n  (println n))",
        "safe": true
    },
    {
        "filename": "100 doors_458.txt",
        "content": "(set 'Doors (array 100)) \u00a0;; Default value: nil (Closed)\n\n(for (x 0 99)\n    (for (y x 99 (+ 1 x))\n        (setf (Doors y) (not (Doors y)))))\n\n(for (x 0 99) \u00a0;; Display open doors\n    (if (Doors x)\n        (println (+ x 1) \"\u00a0: Open\")))",
        "safe": true
    },
    {
        "filename": "100 doors_459.txt",
        "content": "1\u00a0: Open\n4\u00a0: Open\n9\u00a0: Open\n16\u00a0: Open\n25\u00a0: Open\n36\u00a0: Open\n49\u00a0: Open\n64\u00a0: Open\n81\u00a0: Open\n100\u00a0: Open\n",
        "safe": true
    },
    {
        "filename": "100 doors_46.txt",
        "content": "\u2378\u2260\u233f0=(\u2373100)\u2218.|\u2373100\n",
        "safe": true
    },
    {
        "filename": "100 doors_460.txt",
        "content": "     n:=100;reduce xor (count n eachright mod count n eachall<1)\nlooloooolooooooloooooooolooooooooooloooooooooooolooooooooooooooloooooooooooooooo\n\nlooooooooooooooooool",
        "safe": true
    },
    {
        "filename": "100 doors_461.txt",
        "content": "     true findall (n:=100;reduce xor (count n eachright mod count n eachall<1))+1\n1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100 doors_462.txt",
        "content": "     count 10 power 2\n1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100 doors_463.txt",
        "content": "from strutils import `%`\n\nconst numDoors = 100\nvar doors: array[1..numDoors, bool]\n\nfor pass in 1..numDoors:\n  for door in countup(pass, numDoors, pass):\n    doors[door] = not doors[door]\n\nfor door in 1..numDoors:\n  echo \"Door $1 is $2.\"\u00a0% [$door, if doors[door]: \"open\" else: \"closed\"]",
        "safe": true
    },
    {
        "filename": "100 doors_464.txt",
        "content": "from strutils import `%`\n\nconst numDoors = 100\nvar doors {.compileTime.}: array[1..numDoors, bool]\n\nproc calcDoors(): string =\n  for pass in 1..numDoors:\n    for door in countup(pass, numDoors, pass):\n      doors[door] = not doors[door] \n  for door in 1..numDoors:\n    result.add(\"Door $1 is $2.\\n\"\u00a0% [$door, if doors[door]: \"open\" else: \"closed\"])\n\nconst outputString: string = calcDoors()\n\necho outputString",
        "safe": true
    },
    {
        "filename": "100 doors_465.txt",
        "content": "MODULE Doors;\n  IMPORT Out;\n  \n  PROCEDURE Do*;  (* In Oberon an asterisk after an identifier is an export mark *)\n    CONST N = 100; len = N + 1;\n    VAR i, j: INTEGER;\n      closed: ARRAY len OF BOOLEAN;  (* Arrays in Oberon always start with index 0; closed[0] is not used *)\n  BEGIN\n    FOR i\u00a0:= 1 TO N DO closed[i]\u00a0:= TRUE END;\n    FOR i\u00a0:= 1 TO N DO\n      j\u00a0:= 1;\n      WHILE j < len DO\n        IF j MOD i = 0 THEN closed[j]\u00a0:= ~closed[j] END; INC(j)  (* ~ = NOT *)\n      END\n    END;\n    (* Print a state diagram of all doors *)\n    FOR i\u00a0:= 1 TO N DO \n      IF (i - 1) MOD 10 = 0 THEN Out.Ln END;\n      IF closed[i] THEN Out.String(\"- \") ELSE Out.String(\"+ \") END\n    END;  Out.Ln;\n    (* Print the numbers of the open doors *)\n    FOR i\u00a0:= 1 TO N DO \n      IF ~closed[i] THEN Out.Int(i, 0); Out.Char(\" \") END\n    END;  Out.Ln\n  END Do;\n\nEND Doors.\n",
        "safe": true
    },
    {
        "filename": "100 doors_466.txt",
        "content": "+ \u2013 \u2013 + \u2013 \u2013 \u2013 \u2013 + \u2013 \n\u2013 \u2013 \u2013 \u2013 \u2013 + \u2013 \u2013 \u2013 \u2013 \n\u2013 \u2013 \u2013 \u2013 + \u2013 \u2013 \u2013 \u2013 \u2013 \n\u2013 \u2013 \u2013 \u2013 \u2013 + \u2013 \u2013 \u2013 \u2013 \n\u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 + \u2013 \n\u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \n\u2013 \u2013 \u2013 + \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \n\u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \n+ \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \n\u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 + \n1 4 9 16 25 36 49 64 81 100 \n",
        "safe": true
    },
    {
        "filename": "100 doors_467.txt",
        "content": "bundle Default {\n  class Doors {\n    function\u00a0: Main(args\u00a0: String[]) ~ Nil {\n      doors\u00a0:= Bool->New[100];\n      \n      for(pass\u00a0:= 0; pass < 10; pass += 1;) {\n        doors[(pass + 1) * (pass + 1) - 1]\u00a0:= true;\n      };\n      \n      for(i\u00a0:= 0; i < 100; i += 1;) {    \n        IO.Console->GetInstance()->Print(\"Door #\")->Print(i + 1)->Print(\" is \");\n        if(doors[i]) {\n          \"open.\"->PrintLine();\n        }\n        else {\n          \"closed.\"->PrintLine();\n        };\n      };\n    }\n  }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_468.txt",
        "content": "@import Foundation;\n\nint main(int argc, const char * argv[]) {\n    @autoreleasepool {\n        \n        // Create a mutable array\n        NSMutableArray *doorArray = [@[] mutableCopy];\n        \n        // Fill the doorArray with 100 closed doors\n        for (NSInteger i = 0; i < 100; ++i) {\n            doorArray[i] = @NO;\n        }\n        \n        // Do the 100 passes\n        for (NSInteger pass = 0; pass < 100; ++pass) {\n            for (NSInteger door = pass; door < 100; door += pass+1) {\n                doorArray[door] = [doorArray[door]  isEqual: @YES]\u00a0? @NO\u00a0: @YES;\n            }\n        }\n        \n        // Print the results\n        [doorArray enumerateObjectsUsingBlock:^(id obj, NSUInteger idx, BOOL *stop) {\n            if ([obj isEqual: @YES]) {\n                NSLog(@\"Door number %lu is open\", idx + 1);\n            }\n        }];\n    }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_469.txt",
        "content": "@import Foundation;\n\n#pragma mark - Classes\n////////////////////////////////////////////////////\n// Model class header - A we are using a category to add a method to MSMutableArray\n@interface NSMutableArray (DoorModelExtension)\n\n- (void)setNumberOfDoors:(NSUInteger)doors;\n\n@end\n\n// Model class implementation\n@implementation NSMutableArray (DoorModelExtension)\n\n- (void)setNumberOfDoors:(NSUInteger)doors {\n    // Fill the doorArray with 100 closed doors\n    for (NSInteger i = 0; i < doors; ++i) {\n        self[i] = @NO;\n    }\n}\n@end\n////////////////////////////////////////////////////\n\n// View class header - A simple class to handle printing our values\n@interface DoorViewClass\u00a0: NSObject\n\n- (void)printResultsOfDoorTask:(NSMutableArray *)doors;\n\n@end\n\n// View class implementation\n@implementation DoorViewClass\n\n- (void)printResultsOfDoorTask:(NSMutableArray *)doors {\n\n    // Print the results, using an enumeration block for easy index tracking\n    [doors enumerateObjectsUsingBlock:^(id obj, NSUInteger idx, BOOL *stop) {\n        if ([obj isEqual: @YES]) {\n            NSLog(@\"Door number %lu is open\", idx + 1);\n        }\n    }];\n}\n\n@end\n////////////////////////////////////////////////////\n\n#pragma mark - main\n// With our classes set we can use them from our controller, in this case main\nint main(int argc, const char * argv[]) {\n    \n    // Init our classes\n    NSMutableArray *doorArray = [NSMutableArray array];\n    DoorViewClass *doorView = [DoorViewClass new];\n    \n    // Use our class category to add the doors\n    [doorArray setNumberOfDoors:100];\n    \n    // Do the 100 passes\n    for (NSUInteger pass = 0; pass < 100; ++pass) {\n        for (NSUInteger door = pass; door < 100; door += pass+1) {\n            doorArray[door] = [doorArray[door]  isEqual: @YES]\u00a0? @NO\u00a0: @YES;\n        }\n    }\n    \n    // Print the results\n    [doorView printResultsOfDoorTask:doorArray];\n   \n}",
        "safe": true
    },
    {
        "filename": "100 doors_47.txt",
        "content": "1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100 doors_470.txt",
        "content": "let max_doors = 100\n\nlet show_doors =\n  Array.iteri (fun i x -> Printf.printf \"Door %d is %s\\n\" (i+1)\n                                        (if x then \"open\" else \"closed\"))\n\nlet flip_doors doors =\n  for i = 1 to max_doors do\n    let rec flip idx =\n      if idx < max_doors then begin\n        doors.(idx) <- not doors.(idx);\n        flip (idx + i)\n      end\n    in flip (i - 1)\n  done;\n  doors\n\nlet () =\n  show_doors (flip_doors (Array.make max_doors false))",
        "safe": true
    },
    {
        "filename": "100 doors_471.txt",
        "content": "let optimised_flip_doors doors =\n  for i = 1 to int_of_float (sqrt (float_of_int max_doors)) do\n    doors.(i*i - 1) <- true\n  done;\n  doors\n\nlet () =\n  show_doors (optimised_flip_doors (Array.make max_doors false))",
        "safe": true
    },
    {
        "filename": "100 doors_472.txt",
        "content": "type door = Open | Closed    (* human readable code *)\n\nlet flipdoor = function Open -> Closed | Closed -> Open\n\nlet string_of_door =       \n  function Open -> \"is open.\" | Closed -> \"is closed.\"\n\nlet printdoors ls =\n  let f i d = Printf.printf \"Door %i %s\\n\" (i + 1) (string_of_door d)\n  in List.iteri f ls\n\nlet outerlim = 100\nlet innerlim = 100\n\nlet rec outer cnt accu =\n  let rec inner i door = match i > innerlim with (* define inner loop *)\n    | true  -> door                         \n    | false -> inner (i + 1) (if (cnt mod i) = 0 then flipdoor door else door)\n  in (* define and do outer loop *)\n  match cnt > outerlim with\n  | true  -> List.rev accu\n  | false -> outer  (cnt + 1)  (inner 1 Closed\u00a0:: accu) (* generate new entries with inner *)\n\nlet () = printdoors (outer 1 [])",
        "safe": true
    },
    {
        "filename": "100 doors_473.txt",
        "content": "doors = false(100,1);\nfor i = 1:100\n  for j = i:i:100\n    doors(j) = !doors(j);\n  endfor\nendfor\nfor i = 1:100\n  if ( doors(i) )\n    s = \"open\";\n  else\n    s = \"closed\";\n  endif\n  printf(\"%d %s\\n\", i, s);\nendfor",
        "safe": true
    },
    {
        "filename": "100 doors_474.txt",
        "content": "package main\n\nimport \"core:fmt\"\n\nmain\u00a0:: proc() {\n using fmt\n  \n  Door_State\u00a0:: enum {Closed, Open}\n  \n  doors\u00a0:= [?]Door_State { 0..<100 = .Closed }\n  \n  for i in  1..=100 {\n    for j\u00a0:= i-1; j < 100; j += i {\n      if doors[j] == .Closed {\n        doors[j] = .Open\n      } else {\n        doors[j] = .Closed\n      }\n    }\n  }\n  for state, i in doors {\n    println(\"Door: \",int(i+1),\" -> \",state)\n  }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_475.txt",
        "content": "package main\n\nimport \"core:fmt\"\nimport \"core:math\"\n\nmain\u00a0:: proc() {\n using fmt\n  \n  Door_State\u00a0:: enum {Closed, Open}\n  \n  doors\u00a0:= [?]Door_State { 0..<100 = .Closed }\n  \n  for i in  1..=100 {\n     res\u00a0:= math.sqrt_f64( f64(i) )\n     if math.mod_f64( res, 1) == 0 {\n        doors[i-1] = .Open\n     } else {\n        doors[i-1] = .Closed\n     }\n     println(\"Door: \", i, \" -> \", doors[i-1])\n  }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_476.txt",
        "content": ": doors\n| i j l |\n   100 false Array newWith dup ->l\n   100 loop: i [ \n      i 100 i step: j [ l put ( j , j l at not ) ] \n      ] \n;",
        "safe": true
    },
    {
        "filename": "100 doors_477.txt",
        "content": "(define (flip doors every)\n   (map (lambda (door num)\n            (mod (+ door (if (eq? (mod num every) 0) 1 0)) 2))\n      doors\n      (iota (length doors) 1)))\n\n(define doors\n   (let loop ((doors (repeat 0 100)) (n 1))\n      (if (eq? n 100)\n         doors\n         (loop (flip doors n) (+ n 1)))))\n\n(print \"100th doors: \" doors)",
        "safe": true
    },
    {
        "filename": "100 doors_478.txt",
        "content": "100th doors: (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 0)\n",
        "safe": true
    },
    {
        "filename": "100 doors_479.txt",
        "content": "process\n  local switch doors size 100\u00a0; all initialised ('1st pass' to false)\n\n  repeat over doors\n    repeat for integer door from #item to 100 by #item\n      do when doors[door] = false\n        activate doors[door]\u00a0; illustrating alternative to set ... to\n      else\n        set doors[door] to false\n      done\n    again\n  again\n\n  repeat over doors\n    do when doors = true\n      put #error '%d(#item)%n'\n    done\n  again",
        "safe": true
    },
    {
        "filename": "100 doors_48.txt",
        "content": "set is_open to {}\nrepeat 100 times\n   set end of is_open to false\nend\nrepeat with pass from 1 to 100\n  repeat with door from pass to 100 by pass\n    set item door of is_open to not item door of is_open\n  end\nend\nset open_doors to {}\nrepeat with door from 1 to 100\n   if item door of is_open then\n     set end of open_doors to door\n   end\nend\nset text item delimiters to \", \"\ndisplay dialog \"Open doors: \" & open_doors\n",
        "safe": true
    },
    {
        "filename": "100 doors_480.txt",
        "content": "1\n4\n9\n16\n25\n36\n49\n64\n81\n100\n",
        "safe": true
    },
    {
        "filename": "100 doors_481.txt",
        "content": "process\n  local integer door initial {1}\n  local integer step initial {3}\n\n  repeat\n    output \"Door %d(door) is open%n\"\n    increment door by step\n    increment step by 2\n    exit when door > 100\n  again",
        "safe": true
    },
    {
        "filename": "100 doors_482.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_483.txt",
        "content": "$Door dict def\n1 1 100 {Door exch false put} for\n$Toggle {dup Door exch get not Door up put} def\n$EveryNthDoor {dup 100 {Toggle} for} def\n$Run {1 1 100 {EveryNthDoor} for} def\n$ShowDoor {dup `Door no. ' exch cvs cat ` is ' cat\n  exch Door exch get {`open.\\n'}{`shut.\\n'} ifelse cat\n  print flush} def\nRun 1 1 100 {ShowDoor} for",
        "safe": true
    },
    {
        "filename": "100 doors_484.txt",
        "content": "Door no. 1 is open.\nDoor no. 2 is shut.\nDoor no. 3 is shut.\nDoor no. 4 is open.\nDoor no. 5 is shut.\nDoor no. 6 is shut.\nDoor no. 7 is shut.\nDoor no. 8 is shut.\nDoor no. 9 is open.\nDoor no. 10 is shut.\nDoor no. 11 is shut.\nDoor no. 12 is shut.\nDoor no. 13 is shut.\nDoor no. 14 is shut.\nDoor no. 15 is shut.\nDoor no. 16 is open.\nDoor no. 17 is shut.\nDoor no. 18 is shut.\nDoor no. 19 is shut.\nDoor no. 20 is shut.\nDoor no. 21 is shut.\nDoor no. 22 is shut.\nDoor no. 23 is shut.\nDoor no. 24 is shut.\nDoor no. 25 is open.\nDoor no. 26 is shut.\nDoor no. 27 is shut.\nDoor no. 28 is shut.\nDoor no. 29 is shut.\nDoor no. 30 is shut.\nDoor no. 31 is shut.\nDoor no. 32 is shut.\nDoor no. 33 is shut.\nDoor no. 34 is shut.\nDoor no. 35 is shut.\nDoor no. 36 is open.\nDoor no. 37 is shut.\nDoor no. 38 is shut.\nDoor no. 39 is shut.\nDoor no. 40 is shut.\nDoor no. 41 is shut.\nDoor no. 42 is shut.\nDoor no. 43 is shut.\nDoor no. 44 is shut.\nDoor no. 45 is shut.\nDoor no. 46 is shut.\nDoor no. 47 is shut.\nDoor no. 48 is shut.\nDoor no. 49 is open.\nDoor no. 50 is shut.\nDoor no. 51 is shut.\nDoor no. 52 is shut.\nDoor no. 53 is shut.\nDoor no. 54 is shut.\nDoor no. 55 is shut.\nDoor no. 56 is shut.\nDoor no. 57 is shut.\nDoor no. 58 is shut.\nDoor no. 59 is shut.\nDoor no. 60 is shut.\nDoor no. 61 is shut.\nDoor no. 62 is shut.\nDoor no. 63 is shut.\nDoor no. 64 is open.\nDoor no. 65 is shut.\nDoor no. 66 is shut.\nDoor no. 67 is shut.\nDoor no. 68 is shut.\nDoor no. 69 is shut.\nDoor no. 70 is shut.\nDoor no. 71 is shut.\nDoor no. 72 is shut.\nDoor no. 73 is shut.\nDoor no. 74 is shut.\nDoor no. 75 is shut.\nDoor no. 76 is shut.\nDoor no. 77 is shut.\nDoor no. 78 is shut.\nDoor no. 79 is shut.\nDoor no. 80 is shut.\nDoor no. 81 is open.\nDoor no. 82 is shut.\nDoor no. 83 is shut.\nDoor no. 84 is shut.\nDoor no. 85 is shut.\nDoor no. 86 is shut.\nDoor no. 87 is shut.\nDoor no. 88 is shut.\nDoor no. 89 is shut.\nDoor no. 90 is shut.\nDoor no. 91 is shut.\nDoor no. 92 is shut.\nDoor no. 93 is shut.\nDoor no. 94 is shut.\nDoor no. 95 is shut.\nDoor no. 96 is shut.\nDoor no. 97 is shut.\nDoor no. 98 is shut.\nDoor no. 99 is shut.\nDoor no. 100 is open.",
        "safe": true
    },
    {
        "filename": "100 doors_485.txt",
        "content": "doors = .array~new(100)    -- array containing all of the doors\ndo i = 1 to doors~size     -- initialize with a collection of closed doors\n   doors[i] = .door~new(i)\nend\n\ndo inc = 1 to doors~size\n  do d = inc to doors~size by inc\n    doors[d]~toggle\n  end\nend\nsay \"The open doors after 100 passes:\"\ndo door over doors\n  if door~isopen then say door\nend\n\n::class door           -- simple class to represent a door\n::method init          -- initialize an instance of a door\n  expose id state      -- instance variables of a door\n  use strict arg id    -- set the id\n  state = .false       -- initial state is closed\n\n::method toggle        -- toggle the state of the door\n  expose state\n  state = \\state\n\n::method isopen        -- test if the door is open\n  expose state\n  return state\n\n::method string        -- return a string value for a door\n  expose state id\n  if state then return \"Door\" id \"is open\"\n  else return \"Door\" id \"is closed\"\n\n::method state         -- return door state as a descriptive string\n  expose state\n  if state then return \"open\"\n  else return \"closed\"",
        "safe": true
    },
    {
        "filename": "100 doors_486.txt",
        "content": "DEFINE VARIABLE lopen   AS LOGICAL     NO-UNDO EXTENT 100.\nDEFINE VARIABLE idoor   AS INTEGER     NO-UNDO.\nDEFINE VARIABLE ipass   AS INTEGER     NO-UNDO.\nDEFINE VARIABLE cresult AS CHARACTER   NO-UNDO.\n\nDO ipass = 1 TO 100:\n   idoor = 0.\n   DO WHILE idoor <= 100:\n      idoor = idoor + ipass.\n      IF idoor <= 100 THEN\n         lopen[ idoor ] = NOT lopen[ idoor ].\n   END.\nEND.\n\nDO idoor = 1 TO 100:\n   cresult = cresult + STRING( lopen[ idoor ], \"1  /0  \" ).\n   IF idoor MODULO 10 = 0 THEN\n      cresult = cresult + \"~r\":U.\nEND.\n\nMESSAGE cresult VIEW-AS ALERT-BOX.",
        "safe": true
    },
    {
        "filename": "100 doors_487.txt",
        "content": "def    doors 100\nint    door[doors],i ,j, c\nstring cr,tab,pr\n'\nfor i=1 to doors\n  for j=i to doors step i\n    door[j]=1-door[j]\n    if door[j] then c++ else c--\n  next\nnext\n'\ncr=chr(13) chr(10)\npr=\"Doors Open: \" c cr cr \n'\nfor i=1 to doors\n   if door[i] then pr+=i cr\nnext\nprint pr\n",
        "safe": true
    },
    {
        "filename": "100 doors_488.txt",
        "content": "declare\n  NumDoors = 100\n  NumPasses = 100\n\n  fun {NewDoor} closed end\n\n  fun {Toggle Door}\n     case Door of closed then open\n     [] open then closed\n     end\n  end\n\n  fun {Pass Doors I}\n     {List.mapInd Doors\n      fun {$ Index Door}\n         if Index mod I == 0 then {Toggle Door}\n         else Door\n         end\n      end}\n  end\n  \n  Doors0 = {MakeList NumDoors}\n  {ForAll Doors0 NewDoor}\n\n  DoorsN = {FoldL {List.number 1 NumPasses 1} Pass Doors0}\nin\n \u00a0%% print open doors\n  {List.forAllInd DoorsN\n   proc {$ Index Door}\n      if Door == open then\n\t {System.showInfo \"Door \"#Index#\" is open.\"}\n      end\n   end\n  }",
        "safe": true
    },
    {
        "filename": "100 doors_489.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_49.txt",
        "content": "on _100doors()\n    script o\n        property doors : {}\n    end script\n    repeat 100 times\n        set end of o's doors to false -- false = \"not open\".\n    end repeat\n    repeat with pass from 1 to 100\n        if (not item pass of o's doors) then set item pass of o's doors to pass\n        repeat with d from (pass + pass) to 100 by pass\n            set item d of o's doors to (not item d of o's doors)\n        end repeat\n    end repeat\n    \n    return o's doors's integers\nend _100doors\n\non join(lst, delim)\n    set astid to AppleScript's text item delimiters\n    set AppleScript's text item delimiters to delim\n    set txt to lst as text\n    set AppleScript's text item delimiters to astid\n    return txt\nend join\n\nreturn \"Open doors:\n\" & join(_100doors(), \", \")\n",
        "safe": true
    },
    {
        "filename": "100 doors_490.txt",
        "content": "v=vector(d=100);/*set 100 closed doors*/\nfor(i=1,d,forstep(j=i,d,i,v[j]=1-v[j]));\nfor(i=1,d,if(v[i],print(\"Door \",i,\" is open.\")))",
        "safe": true
    },
    {
        "filename": "100 doors_491.txt",
        "content": "for(n=1,sqrt(100),print(\"Door \",n^2,\" is open.\"))",
        "safe": true
    },
    {
        "filename": "100 doors_492.txt",
        "content": "doors =vector(100);\nprint(\"open doors are\u00a0: \");\nfor(i=1,100,for(j=i,100,doors[j]=!doors[j];j +=i-1))\nfor(k=1,100,if(doors[k]==1,print1(\" \",k)))",
        "safe": true
    },
    {
        "filename": "100 doors_493.txt",
        "content": "Open doors are:\n 1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100 doors_494.txt",
        "content": "Program OneHundredDoors;\n\nvar\n   doors\u00a0: Array[1..100] of Boolean;\n   i, j\t\u00a0: Integer;\n   \nbegin\n   for i\u00a0:= 1 to 100 do\n      doors[i]\u00a0:= False;\n   for i\u00a0:= 1 to 100 do begin\n      j\u00a0:= i;\n      while j <= 100 do begin\n\t doors[j]\u00a0:= not doors[j];\n\t j\u00a0:= j + i\n      end\n   end;\n   for i\u00a0:= 1 to 100 do begin\n      Write(i, ' ');\n      if doors[i] then\n\t WriteLn('open')\n      else\n\t WriteLn('closed');\n   end\nend.",
        "safe": true
    },
    {
        "filename": "100 doors_495.txt",
        "content": "program OneHundredDoors;\n\n{$APPTYPE CONSOLE}\n\nuses\n  math, sysutils;\n\nvar\n   AOpendoors \u00a0: String;\n   ACloseDoors\u00a0: String;\n   i\t      \u00a0: Integer;\n\nbegin\n   for i\u00a0:= 1 to 100 do\n   begin\n      if (sqrt(i) = floor(sqrt(i))) then\n        AOpenDoors\u00a0:= AOpenDoors + IntToStr(i) + ';'\n      else\n        ACloseDoors\u00a0:= ACloseDoors + IntToStr(i) +';';\n   end;\n\n   WriteLn('Open doors: ' + AOpenDoors);\n   WriteLn('Close doors: ' + ACloseDoors);\nend.",
        "safe": true
    },
    {
        "filename": "100 doors_496.txt",
        "content": "1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100 doors_497.txt",
        "content": ";100 doors example program for x86 DOS\n;Compiles with Pebble to 95 bytes com executable\n\nprogram examples\\100doors\n\ndata\n\n\tint i[0]\n\tint d[0]\n\nbegin\n\n\tlabel loop\n\n\t\t+1 [i]\n\t\t[d] = [i] * [i]\n\t\techo [d]\n\t\tcrlf\n\n\tif [d] < 100 then loop\n\n\tpause\n\tkill\n\nend",
        "safe": true
    },
    {
        "filename": "100 doors_498.txt",
        "content": "my @doors;\nfor my $pass (1 .. 100) {\n    for (1 .. 100) {\n        if (0 == $_\u00a0% $pass) {\n            $doors[$_] = not $doors[$_];\n        };\n    };\n};\n\nprint \"Door $_ is \", $doors[$_]\u00a0? \"open\"\u00a0: \"closed\", \"\\n\" for 1 .. 100;",
        "safe": true
    },
    {
        "filename": "100 doors_499.txt",
        "content": "#!/usr/bin/perl\nuse strict;\nuse warnings;\n\nmy @doors = (1) x 100;\nfor my $N (1 .. 100) {\n   $doors[$_]=1-$doors[$_] for map { $_*$N - 1 } 1 .. int(100/$N);\n}\nprint join(\"\\n\", map { \"Door $_ is Open\" } grep {\u00a0! $doors[$_-1] } 1 .. 100), \"\\n\";\nprint \"The rest are closed\\n\";",
        "safe": true
    },
    {
        "filename": "100 doors_5.txt",
        "content": "%@left[n,string]                      ^: Return n leftmost chars in string\n%@right[n,string]                     ^: Return n rightmost chars in string\n%@if[condition,true-val,false-val]    ^: Evaluate condition; return true-val if true, false-val if false\n",
        "safe": true
    },
    {
        "filename": "100 doors_50.txt",
        "content": "\"Open doors:\n1, 4, 9, 16, 25, 36, 49, 64, 81, 100\"\n",
        "safe": true
    },
    {
        "filename": "100 doors_500.txt",
        "content": "print \"Door $_ is open\\n\" for map $_**2, 1 .. 10;",
        "safe": true
    },
    {
        "filename": "100 doors_501.txt",
        "content": "print \"Door $_ is \", qw\"closed open\"[int sqrt == sqrt], \"\\n\" for 1..100;",
        "safe": true
    },
    {
        "filename": "100 doors_502.txt",
        "content": "while( ++$i <= 100 )\n{\n    $root = sqrt($i);\n    if ( int( $root ) == $root )\n    {\n        print \"Door $i is open\\n\";\n    }\n    else\n    {\n        print \"Door $i is closed\\n\";\n    }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_503.txt",
        "content": "use perl5i::2;\n\npackage doors {\n\n  use perl5i::2;\n  use Const::Fast;\n\n  const my $OPEN   => 1;\n  const my $CLOSED => 0;\n\n  # ----------------------------------------\n  # Constructor: door->new( @args );\n  # input: N - how many doors?\n  # returns: door object\n  #\n  method new($class: @args ) {\n    my $self = bless {}, $class;\n    $self->_init( @args );\n    return $self;\n  }\n\n  # ----------------------------------------\n  # class initializer.\n  # input: how many doors?\n  # sets N, creates N+1 doors ( door zero is not used ).\n  #\n  method _init( $N ) {\n    $self->{N} = $N;\n    $self->{doors} = [ ($CLOSED) x ($N+1) ];\n  }\n\n  # ----------------------------------------\n  # $self->toggle( $door_number );\n  # input: number of door to toggle.\n  # OPEN a CLOSED door; CLOSE an OPEN  door.\n  #\n  method toggle( $which ) {\n    $self->{doors}[$which] = ( $self->{doors}[$which] == $OPEN\n                              \u00a0? $CLOSED\n                              \u00a0: $OPEN\n        \t\t     );\n  }\n\n  # ----------------------------------------\n  # $self->toggle_n( $cycle );\n  # input: number.\n  # Toggle doors 0, $cycle, 2 * $cycle, 3 * $cycle, .. $self->{N}\n  #\n  method toggle_n( $n ) {\n    $self->toggle($_)\n      for map { $n * $_ }\n          ( 1 .. int( $self->{N} / $n) );\n\n  }\n\n  # ----------------------------------------\n  # $self->toggle_all();\n  # Toggle every door, then every other door, every third door, ...\n  #\n  method toggle_all() {\n    $self->toggle_n( $_ ) for ( 1 .. $self->{N} );\n  }\n\n\n  # ----------------------------------------\n  # $self->print_open();\n  # Print list of which doors are open.\n  #\n  method print_open() {\n    say join ', ', grep { $self->{doors}[$_] == $OPEN } ( 1 ... $self->{N} );\n  }\n}\n\n# ----------------------------------------------------------------------\n# Main Thread\n#\nmy $doors = doors->new(100);\n$doors->toggle_all();\n$doors->print_open();",
        "safe": true
    },
    {
        "filename": "100 doors_504.txt",
        "content": "sequence doors = repeat(false,100)\n \nfor i=1 to 100 do\n    for j=i to 100 by i do\n        doors[j] = not doors[j]\n    end for\nend for\n \nfor i=1 to 100 do\n    if doors[i] == true then\n        printf(1,\"Door #%d is open.\\n\", i)\n    end if\nend for\n",
        "safe": true
    },
    {
        "filename": "100 doors_505.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_506.txt",
        "content": "function doors(integer n)\n-- returns the perfect squares<=n\ninteger door = 1, step = 1\nsequence res = {}\n    while door<=n do\n        res &= door\n        step += 2\n        door += step\n    end while\n    return res\nend function\n \n?doors(100)\n",
        "safe": true
    },
    {
        "filename": "100 doors_507.txt",
        "content": "{1,4,9,16,25,36,49,64,81,100}\n",
        "safe": true
    },
    {
        "filename": "100 doors_508.txt",
        "content": "101 var l                           \n0 l repeat                      \n\nl for\n    var s\n    s l s 3 tolist\n    for\n        var i\n        i get not i set\n    endfor\nendfor\n\nl for\n    var i\n    i get\n    if\n        i print \" \" print\n    endif\nendfor",
        "safe": true
    },
    {
        "filename": "100 doors_509.txt",
        "content": "100 var n   /# Number of doors #/\n0 n repeat  /# Make the doors #/\n\nn for\n    dup\n    sqrt int\n    dup * over == if 1 swap set else drop endif\nendfor\n\nn for\n    \"The door \" print dup print \" is \" print\n    get if \"OPEN.\" else \"closed.\" endif print nl\nendfor",
        "safe": true
    },
    {
        "filename": "100 doors_51.txt",
        "content": "-- FINAL DOOR STATES ---------------------------------------------------------\n\n-- finalDoors\u00a0:: Int -> [(Int, Bool)]\non finalDoors(n)\n    \n    -- toggledCorridor\u00a0:: [(Int, Bool)] -> (Int, Bool) -> Int -> [(Int, Bool)]\n    script toggledCorridor\n        on |\u03bb|(a, _, k)\n            \n            -- perhapsToggled\u00a0:: Bool -> Int -> Bool\n            script perhapsToggled\n                on |\u03bb|(x, i)\n                    if i mod k = 0 then\n                        {i, not item 2 of x}\n                    else\n                        {i, item 2 of x}\n                    end if\n                end |\u03bb|\n            end script\n            \n            map(perhapsToggled, a)\n        end |\u03bb|\n    end script\n    \n    set xs to enumFromTo(1, n)\n    \n    foldl(toggledCorridor, \u00ac\n        zip(xs, replicate(n, {false})), xs)\nend finalDoors\n\n-- TEST ----------------------------------------------------------------------\non run\n    -- isOpenAtEnd\u00a0:: (Int, Bool) -> Bool\n    script isOpenAtEnd\n        on |\u03bb|(door)\n            (item 2 of door)\n        end |\u03bb|\n    end script\n    \n    -- doorNumber\u00a0:: (Int, Bool) -> Int\n    script doorNumber\n        on |\u03bb|(door)\n            (item 1 of door)\n        end |\u03bb|\n    end script\n    \n    map(doorNumber, filter(isOpenAtEnd, finalDoors(100)))\n    \n    --> {1, 4, 9, 16, 25, 36, 49, 64, 81, 100}\nend run\n\n\n-- GENERIC FUNCTIONS ---------------------------------------------------------\n\n-- enumFromTo\u00a0:: Int -> Int -> [Int]\non enumFromTo(m, n)\n    if n < m then\n        set d to -1\n    else\n        set d to 1\n    end if\n    set lst to {}\n    repeat with i from m to n by d\n        set end of lst to i\n    end repeat\n    return lst\nend enumFromTo\n\n-- filter\u00a0:: (a -> Bool) -> [a] -> [a]\non filter(f, xs)\n    tell mReturn(f)\n        set lst to {}\n        set lng to length of xs\n        repeat with i from 1 to lng\n            set v to item i of xs\n            if |\u03bb|(v, i, xs) then set end of lst to v\n        end repeat\n        return lst\n    end tell\nend filter\n\n-- foldl\u00a0:: (a -> b -> a) -> a -> [b] -> a\non foldl(f, startValue, xs)\n    tell mReturn(f)\n        set v to startValue\n        set lng to length of xs\n        repeat with i from 1 to lng\n            set v to |\u03bb|(v, item i of xs, i, xs)\n        end repeat\n        return v\n    end tell\nend foldl\n\n-- map\u00a0:: (a -> b) -> [a] -> [b]\non map(f, xs)\n    tell mReturn(f)\n        set lng to length of xs\n        set lst to {}\n        repeat with i from 1 to lng\n            set end of lst to |\u03bb|(item i of xs, i, xs)\n        end repeat\n        return lst\n    end tell\nend map\n\n-- min\u00a0:: Ord a => a -> a -> a\non min(x, y)\n    if y < x then\n        y\n    else\n        x\n    end if\nend min\n\n-- Lift 2nd class handler function into 1st class script wrapper \n-- mReturn\u00a0:: Handler -> Script\non mReturn(f)\n    if class of f is script then\n        f\n    else\n        script\n            property |\u03bb| : f\n        end script\n    end if\nend mReturn\n\n-- replicate\u00a0:: Int -> a -> [a]\non replicate(n, a)\n    set out to {}\n    if n < 1 then return out\n    set dbl to {a}\n    \n    repeat while (n > 1)\n        if (n mod 2) > 0 then set out to out & dbl\n        set n to (n div 2)\n        set dbl to (dbl & dbl)\n    end repeat\n    return out & dbl\nend replicate\n\n-- zip\u00a0:: [a] -> [b] -> [(a, b)]\non zip(xs, ys)\n    set lng to min(length of xs, length of ys)\n    set lst to {}\n    repeat with i from 1 to lng\n        set end of lst to {item i of xs, item i of ys}\n    end repeat\n    return lst\nend zip\n",
        "safe": true
    },
    {
        "filename": "100 doors_510.txt",
        "content": "100 sqrt for dup * print \" \" print endfor",
        "safe": true
    },
    {
        "filename": "100 doors_511.txt",
        "content": "module doors;\n\nextern printf;\n\n@Integer main [\n\t@Array<@Boolean> doors = new @Array<@Boolean>.init(100);\n\tvar i = 1;\n\twhile (i <= 100) {\n\t\tvar j = i-1;\n\t\twhile (j < 100) {\n\t\t\tdoors.set(j, doors.get(j)::not);\n\t\t\tj = j + i;\n\t\t}\n\t\ti = i::inc;\n\t}\n\ti = 0;\n\twhile (i < 100) {\n\t\tprintf(\"%i %s\\n\", i+1, iif(doors.get(i), \"open\", \"closed\"));\n\t\ti = i::inc;\n\t}\n\treturn 0;\n]",
        "safe": true
    },
    {
        "filename": "100 doors_512.txt",
        "content": "module var;\n\nextern printf;\n\n@Integer main [\n\tvar door = 1;\n\tvar incrementer = 0;\n\tvar current = 1;\n        while (current <= 100)\n        {\n\t\tprintf(\"Door %i \", current);\n\t\tif (current == door)\n\t\t{\n\t\t\tprintf(\"open\\n\");\n\t\t\tincrementer = incrementer::inc;\n\t\t\tdoor = door + 2 * incrementer + 1;\n\t\t}\n\t\telse\n\t\t\tprintf(\"closed\\n\");\n\t\t\n\t\tcurrent = current + 1;\n            \n        }\n\t\n\treturn 0;\n]",
        "safe": true
    },
    {
        "filename": "100 doors_513.txt",
        "content": "<?php\nfor ($i = 1; $i <= 100; $i++) {\n\t$root = sqrt($i);\n\t$state = ($root == ceil($root))\u00a0? 'open'\u00a0: 'closed';\n\techo \"Door {$i}: {$state}\\n\";\n}\n?>",
        "safe": true
    },
    {
        "filename": "100 doors_514.txt",
        "content": "<?php\n$doors = array_fill(1, 100, false);\nfor ($pass = 1; $pass <= 100; ++$pass) {\n\tfor ($nr = 1; $nr <= 100; ++$nr) {\n\t\tif ($nr\u00a0% $pass == 0) {\n\t\t\t$doors[$nr] =\u00a0!$doors[$nr];\n\t\t}\n\t}\n}\nfor ($nr = 1; $nr <= 100; ++$nr)\n\tprintf(\"Door %d: %s\\n\", $nr, ($doors[$nr])?'open':'closed');\n?>",
        "safe": true
    },
    {
        "filename": "100 doors_515.txt",
        "content": "doors(N) => \n   Doors = new_array(N),\n   foreach(I in 1..N) Doors[I]\u00a0:= 0 end,\n   foreach(I in 1..N)\n     foreach(J in I..I..N)\n        Doors[J]\u00a0:= 1^Doors[J]\n     end,\n     if N <= 10 then\n        print_open(Doors)\n     end\n   end,\n   println(Doors),\n   print_open(Doors),\n   nl.\n\nprint_open(Doors) => println([I\u00a0: I in 1..Doors.length, Doors[I] == 1]).",
        "safe": true
    },
    {
        "filename": "100 doors_516.txt",
        "content": "doors_opt(N) =>\n  foreach(I in 1..N)\n     Root = sqrt(I),\n     println([I, cond(Root == 1.0*round(Root), open, closed)])\n  end,\n  nl.",
        "safe": true
    },
    {
        "filename": "100 doors_517.txt",
        "content": "doors_opt2(N) => \n  println([I**2\u00a0: I in 1..N, I**2 <= N]).",
        "safe": true
    },
    {
        "filename": "100 doors_518.txt",
        "content": "(let Doors (need 100)\n   (for I 100\n      (for (D (nth Doors I)  D  (cdr (nth D I)))\n         (set D (not (car D))) ) )\n   (println Doors) )",
        "safe": true
    },
    {
        "filename": "100 doors_519.txt",
        "content": "(let Doors (need 100)\n   (for I (sqrt 100)\n      (set (nth Doors (* I I)) T) )\n   (println Doors) )",
        "safe": true
    },
    {
        "filename": "100 doors_52.txt",
        "content": "{1, 4, 9, 16, 25, 36, 49, 64, 81, 100}\n",
        "safe": true
    },
    {
        "filename": "100 doors_520.txt",
        "content": "(T NIL NIL T NIL NIL NIL NIL T NIL NIL NIL NIL NIL NIL T NIL NIL NIL NIL NIL NIL\n NIL NIL T NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL T NIL NIL NIL NIL NIL NIL NIL\n NIL NIL NIL NIL NIL T 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 T NIL NIL NIL N\nIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL T)",
        "safe": true
    },
    {
        "filename": "100 doors_521.txt",
        "content": "(let Doors (need 100)\n   (for I (sqrt 100)\n      (set (nth Doors (* I I)) T) )\n   (make\n      (for (N . D) Doors\n         (when D (link N)) ) ) )",
        "safe": true
    },
    {
        "filename": "100 doors_522.txt",
        "content": "(1 4 9 16 25 36 49 64 81 100)",
        "safe": true
    },
    {
        "filename": "100 doors_523.txt",
        "content": "array onehundreddoors()\n{\n    array doors = allocate(100);\n    foreach(doors; int i;)\n        for(int j=i; j<100; j+=i+1)\n            doors[j] = !doors[j];\n    return doors;\n}",
        "safe": true
    },
    {
        "filename": "100 doors_524.txt",
        "content": "array doors = map(enumerate(100,1,1), lambda(int x)\n                                      {  \n                                          return sqrt((float)x)%1 == 0.0; \n                                      });",
        "safe": true
    },
    {
        "filename": "100 doors_525.txt",
        "content": "write(\"%{%d %d %d %d %d %d %d %d %d %d\\n%}\\n\", doors/10)",
        "safe": true
    },
    {
        "filename": "100 doors_526.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_527.txt",
        "content": "declare door(100) bit (1) aligned;\ndeclare closed bit (1) static initial ('0'b),\n        open   bit (1) static initial ('1'b);\ndeclare (i, inc) fixed binary;\n\ndoor = closed;\ninc = 1;\ndo until (inc >= 100);\n   do i = inc to 100 by inc;\n      door(i) = ^door(i); /* close door if open; open it if closed. */\n   end;\n   inc = inc+1;\nend;\n\ndo i = 1 to 100;\n   put skip edit ('Door ', trim(i), ' is ') (a);\n   if door(i) then put edit (' open.') (a);\n   else put edit (' closed.') (a);\nend;",
        "safe": true
    },
    {
        "filename": "100 doors_528.txt",
        "content": "/* Solution to the 100 doors problem in PLI-80 */\n\nhundred_doors:\n  procedure options (main);\n\n    %replace\n      open_door by '1'b,\n      closed_door by '0'b,\n      numdoors by 100;\n\n    dcl\n      doors(1:numdoors) bit(1),\n      (i, j) fixed bin(15);\n\n    /* all doors are initially closed */\n    do i = 1 to numdoors;\n      doors(i) = closed_door;\n    end;\n\n    /* cycle through at increasing intervals and flip doors */\n    do i = 1 to numdoors;\n      j = i;\n      do while (j <= numdoors);\n        doors(j) = ^doors(j);\n        j = j + i;\n      end;\n    end;\n\n    /* show results - open doors should all be perfect squares */\n    put skip list ('The open doors are:');\n    do i = 1 to numdoors;\n      if doors(i) = open_door then\n        put edit (i) (F(4));\n    end;\n\nend hundred_doors;",
        "safe": true
    },
    {
        "filename": "100 doors_529.txt",
        "content": "The open doors are:   1   4   9  16  25  36  49  64  81 100\n",
        "safe": true
    },
    {
        "filename": "100 doors_53.txt",
        "content": "map(factorCountMod2, enumFromTo(1, 100))\n\non factorCountMod2(n)\n    {n, (length of integerFactors(n)) mod 2 = 1}\nend factorCountMod2\n",
        "safe": true
    },
    {
        "filename": "100 doors_530.txt",
        "content": "100H: /* FIND THE FIRST FEW SQUARES VIA THE UNOPTIMISED DOOR FLIPPING METHOD */\n\n    /* BDOS SYSTEM CALL */\n    BDOS: PROCEDURE( FN, ARG );\n        DECLARE FN BYTE, ARG ADDRESS;\n        GO TO 5;\n    END BDOS;\n\n    /* PRINTS A BYTE AS A CHARACTER */\n    PRINT$CHAR: PROCEDURE( CH );\n        DECLARE CH BYTE;\n        CALL BDOS( 2, CH );\n    END PRINT$CHAR;\n\n    /* PRINTS A BYTE AS A NUMBER */\n    PRINT$BYTE: PROCEDURE( N );\n        DECLARE N BYTE;\n        DECLARE ( V, D3, D2 ) BYTE;\n        V  = N;\n        D3 = V MOD 10;\n        IF ( V\u00a0:= V / 10 ) <> 0 THEN DO;\n            D2 = V MOD 10;\n            IF ( V\u00a0:= V / 10 ) <> 0 THEN CALL PRINT$CHAR( '0' + V );\n            CALL PRINT$CHAR( '0' + D2 );\n        END;\n        CALL PRINT$CHAR( '0' + D3 );\n    END PRINT$BYTE;\n\n    DECLARE DOOR$DCL LITERALLY '101';\n    DECLARE FALSE    LITERALLY '0';\n    DECLARE CR       LITERALLY '0DH';\n    DECLARE LF       LITERALLY '0AH';\n\n    /* ARRAY OF DOORS - DOOR( I ) IS TRUE IF OPEN, FALSE IF CLOSED */\n    DECLARE DOOR( DOOR$DCL ) BYTE;\n    DECLARE ( I, J )         BYTE;\n\n    /* SET ALL DOORS TO CLOSED */\n    DO I = 0 TO LAST( DOOR ); DOOR( I ) = FALSE; END;\n    /* REPEATEDLY FLIP THE DOORS */\n    DO I = 1 TO LAST( DOOR );\n       DO J = I TO LAST( DOOR ) BY I;\n          DOOR( J ) = NOT DOOR( J );\n       END;\n    END;\n    /* DISPLAY THE RESULTS */\n    DO I = 1 TO LAST( DOOR );\n       IF DOOR( I ) THEN DO;\n          CALL PRINT$CHAR( ' ' );\n          CALL PRINT$BYTE( I );\n       END;\n    END;\n    CALL PRINT$CHAR( CR );\n    CALL PRINT$CHAR( LF );\nEOF",
        "safe": true
    },
    {
        "filename": "100 doors_531.txt",
        "content": " 1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100 doors_532.txt",
        "content": "DECLARE\n  TYPE doorsarray IS VARRAY(100) OF BOOLEAN;\n  doors doorsarray\u00a0:= doorsarray();\nBEGIN\n\ndoors.EXTEND(100);  --ACCOMMODATE 100 DOORS\n\nFOR i IN 1 .. doors.COUNT  --MAKE ALL 100 DOORS FALSE TO INITIALISE\n  LOOP\n     doors(i)\u00a0:= FALSE;                    \n  END LOOP;\n\nFOR j IN 1 .. 100 --ITERATE THRU USING MOD LOGIC AND FLIP THE DOOR RIGHT OPEN OR CLOSE\n LOOP\n      FOR k IN 1 .. 100\n        LOOP\n                  IF MOD(k,j)=0 THEN \n                     doors(k)\u00a0:= NOT doors(k); \n                  END IF;\n        END LOOP;\n END LOOP;\n \nFOR l IN 1 .. doors.COUNT  --PRINT THE STATUS IF ALL 100 DOORS AFTER ALL ITERATION\n  LOOP\n       DBMS_OUTPUT.PUT_LINE('DOOR '||l||' IS -->> '||CASE WHEN SYS.DBMS_SQLTCB_INTERNAL.I_CONVERT_FROM_BOOLEAN(doors(l)) = 'TRUE' \n                                                                THEN 'OPEN' \n                                                              ELSE 'CLOSED' \n                                                        END);\n  END LOOP;\n\nEND;",
        "safe": true
    },
    {
        "filename": "100 doors_533.txt",
        "content": "To create some doors given a count:\n  Loop.\n    If a counter is past the count, exit.\n    Allocate memory for a door.\n    Clear the door's flag.\n    Append the door to the doors.\n  Repeat.\n\nA flag thing is a thing with a flag.\nA door is a flag thing.\n\nTo go through some doors given a number and some passes:\n  Put 0 into a counter.\n  Loop.\n    Add the number to the counter.\n    If the counter is greater than the passes, exit.\n    Pick a door from the doors given the number.\n    Invert the door's flag.\n  Repeat.\n\nTo output the states of some doors:\n  Loop.\n    Bump a counter.\n    Get a door from the doors.\n    If the door is nil, exit.\n    If the door's flag is set, \n      Write \"Door \" then the counter then \" is open\" to the output; \n      Repeat.\n    Write \"Door \" then the counter then \" is closed\" to the output.\n  Repeat.\n\nTo pass doors given a count and some passes:\n  Create some doors given the count.\n  Loop.\n    If a counter is past the passes, break.\n    Go through the doors given the counter and the passes.\n  Repeat.\n  Output the states of the doors.\n  Destroy the doors.\n\nA pass is a number.\n\nTo pick a door from some doors given a number:\n  Loop.\n    If a counter is past the number, exit.\n    Get the door from the doors.\n    If the door is nil, exit.\n  Repeat.\n\nTo run:\n  Start up.\n  Pass doors given 100 and 100 passes.\n  Wait for the escape key.\n  Shut down.",
        "safe": true
    },
    {
        "filename": "100 doors_534.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_535.txt",
        "content": "output =\n  range(1, 100)\n  |> map(visit(100))\n  |> println\n\n----------------------------------------------------------\n\ntoggle(state) =\n  if state == Closed then Open else Closed\n\n----------------------------------------------------------\n-- Door state on iteration i is recursively\n-- defined in terms of previous door state\n\nvisit(i, index) = cond {\n  case (i == 0) Closed\n  case (index\u00a0% i == 0) toggle(lastState)\n  else lastState\n} where lastState = visit(i - 1, index)",
        "safe": true
    },
    {
        "filename": "100 doors_536.txt",
        "content": "[Open, Closed, Closed, Open, Closed, Closed, Closed, Closed, Open, Closed, Closed, Closed, Closed, Closed, Closed, Open, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Open, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Open, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Open, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Open, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Open, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Open]",
        "safe": true
    },
    {
        "filename": "100 doors_537.txt",
        "content": "/* FIND THE FIRST FEW SQUARES VIA THE UNOPTIMISED DOOR FLIPPING METHOD */\ndoors_100H: procedure options                                                   (main);\n\n/* PROGRAM-SPECIFIC %REPLACE STATEMENTS MUST APPEAR BEFORE THE %INCLUDE AS */\n/* E.G. THE CP/M PL/I COMPILER DOESN'T LIKE THEM TO FOLLOW PROCEDURES      */\n   /* PL/I                                                                      */\n      %replace dcldoors by         100;\n   /* PL/M */                                                                   /*\n      DECLARE  DCLDOORS LITERALLY '101';\n   /* */\n\n/* PL/I DEFINITIONS                                                             */\n%include 'pg.inc';\n/* PL/M DEFINITIONS: CP/M BDOS SYSTEM CALL AND CONSOLE I/O ROUTINES, ETC. */    /*\n   DECLARE BINARY LITERALLY 'ADDRESS', CHARACTER LITERALLY 'BYTE';\n   DECLARE FIXED  LITERALLY ' ',       BIT       LITERALLY 'BYTE';\n   DECLARE STATIC LITERALLY ' ',       RETURNS   LITERALLY ' ';\n   DECLARE FALSE  LITERALLY '0',       TRUE LITERALLY '1';\n   DECLARE HBOUND LITERALLY 'LAST',    SADDR  LITERALLY '.';\n   BDOSF: PROCEDURE( FN, ARG )BYTE;\n                               DECLARE FN BYTE, ARG ADDRESS; GOTO 5;   END; \n   BDOS: PROCEDURE( FN, ARG ); DECLARE FN BYTE, ARG ADDRESS; GOTO 5;   END;\n   PRCHAR:   PROCEDURE( C );   DECLARE C BYTE;      CALL BDOS( 2, C ); END;\n   PRSTRING: PROCEDURE( S );   DECLARE S ADDRESS;   CALL BDOS( 9, S ); END;\n   PRNL:     PROCEDURE;        CALL PRCHAR( 0DH ); CALL PRCHAR( 0AH ); END;\n   PRNUMBER: PROCEDURE( N );\n      DECLARE N ADDRESS;\n      DECLARE V ADDRESS, N$STR( 6 ) BYTE, W BYTE;\n      N$STR( W\u00a0:= LAST( N$STR ) ) = '$';\n      N$STR( W\u00a0:= W - 1 ) = '0' + ( ( V\u00a0:= N ) MOD 10 );\n      DO WHILE( ( V\u00a0:= V / 10 ) > 0 );\n         N$STR( W\u00a0:= W - 1 ) = '0' + ( V MOD 10 );\n      END; \n      CALL BDOS( 9, .N$STR( W ) );\n   END PRNUMBER;\n   MODF:     PROCEDURE( A, B )ADDRESS;\n      DECLARE ( A, B ) ADDRESS;\n      RETURN A MOD B;\n   END MODF;\n/* END LANGUAGE DEFINITIONS */\n\n   /* TASK */\n\n   /* ARRAY OF DOORS - DOOR( I ) IS TRUE IF OPEN, FALSE IF CLOSED */\n   DECLARE DOOR( DCLDOORS )  BIT;\n   DECLARE ( I, J, MAXDOOR ) FIXED BINARY;\n\n   MAXDOOR = HBOUND( DOOR                                                       ,1\n                   );\n\n   /* SET ALL DOORS TO CLOSED */\n   DO I = 0 TO MAXDOOR; DOOR( I ) = FALSE; END;\n   /* REPEATEDLY FLIP THE DOORS */\n   DO I = 1 TO MAXDOOR;\n      DO J = I TO MAXDOOR BY I;\n         DOOR( J ) = NOT( DOOR( J ) );\n      END;\n   END;\n   /* DISPLAY THE RESULTS */\n   DO I = 1 TO MAXDOOR;\n      IF DOOR( I ) THEN DO;\n         CALL PRCHAR( ' ' );\n         CALL PRNUMBER( I );\n      END;\n   END;\n   CALL PRNL;\n\nEOF: end doors_100H;",
        "safe": true
    },
    {
        "filename": "100 doors_538.txt",
        "content": " 1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100 doors_539.txt",
        "content": "actor Toggler\n    let doors:Array[Bool]\n    let env: Env\n    new create(count:USize,_env:Env) =>\n        var i:USize=0\n        doors=Array[Bool](count)\n        env=_env\n        while doors.size() < count do\n            doors.push(false)\n        end\n    be togglin(interval\u00a0: USize)=>\n        var i:USize=0\n        try\n            while i < doors.size() do\n                doors.update(i,not doors(i)?)?\n                i=i+interval\n            end\n        else\n            env.out.print(\"Errored while togglin'!\")\n        end\n    be printn(onlyOpen:Bool)=>\n        try\n            for i in doors.keys() do\n                if onlyOpen and not doors(i)? then\n                    continue\n                end\n                env.out.print(\"Door \" + i.string() + \" is \" +\n                    if doors(i)? then\n                        \"Open\"\n                    else\n                        \"closed\"\n                    end)\n            end\n        else\n            env.out.print(\"Error!\")\n        end\n        true\n\nactor OptimizedToggler\n    let doors:Array[Bool]\n    let env:Env\n    new create(count:USize,_env:Env)=>\n        env=_env\n        doors=Array[Bool](count)\n        while doors.size()<count do\n            doors.push(false)\n        end\n    be togglin()=>\n        var i:USize=0\n        if alreadydone then\n            return\n        end\n        try\n            doors.update(0,true)?\n            doors.update(1,true)?\n            while i < doors.size() do\n                i=i+1\n                let z=i*i\n                let x=z*z\n                if z > doors.size() then\n                    break\n                else\n                    doors.update(z,true)?\n                end\n                if x < doors.size() then\n                    doors.update(x,true)?\n                end\n            end\n        end\n    be printn(onlyOpen:Bool)=>\n        try\n            for i in doors.keys() do\n                if onlyOpen and not doors(i)? then\n                    continue\n                end\n                env.out.print(\"Door \" + i.string() + \" is \" +\n                    if doors(i)? then\n                        \"Open\"\n                    else\n                        \"closed\"\n                    end)\n            end\n        else\n            env.out.print(\"Error!\")\n        end\n        true\nactor Main\n    new create(env:Env)=>\n        var count: USize =100\n        try\n            let index=env.args.find(\"-n\",0,0,{(l,r)=>l==r})?\n            try\n            match env.args(index+1)?.read_int[USize]()?\n                | (let x:USize, _)=>count=x\n                end\n            else\n                env.out.print(\"You either neglected to provide an argument after -n or that argument was not an integer greater than zero.\")\n                return\n            end\n        end\n        if env.args.contains(\"optimized\",{(l,r)=>r==l}) then\n            let toggler=OptimizedToggler(count,env)\n            var i:USize = 1\n            toggler.togglin()\n            toggler.printn(env.args.contains(\"onlyopen\", {(l,r)=>l==r}))\n        else\n            let toggler=Toggler(count,env)\n            var i:USize = 1\n            while i < count do\n                toggler.togglin(i)\n                i=i+1\n            end\n            toggler.printn(env.args.contains(\"onlyopen\", {(l,r)=>l==r}))\n        end",
        "safe": true
    },
    {
        "filename": "100 doors_54.txt",
        "content": "-- perfectSquaresUpTo\u00a0:: Int -> [Int]\non perfectSquaresUpTo(n)\n    script squared\n        -- (Int -> Int)\n        on |\u03bb|(x)\n            x * x\n        end |\u03bb|\n    end script\n    \n    set realRoot to n ^ (1 / 2)\n    set intRoot to realRoot as integer\n    set blnNotPerfectSquare to not (intRoot = realRoot)\n    \n    map(squared, enumFromTo(1, intRoot - (blnNotPerfectSquare as integer)))\nend perfectSquaresUpTo\n\non run\n    \n    perfectSquaresUpTo(100)\n    \nend run\n",
        "safe": true
    },
    {
        "filename": "100 doors_540.txt",
        "content": "lvars i;\nlvars doors = {% for i from 1 to 100 do false endfor\u00a0%};\nfor i from 1 to 100 do\n   for j from i by i to 100 do\n      not(doors(j)) -> doors(j);\n   endfor;\nendfor;\n;;; Print state\nfor i from 1 to 100 do\n   printf('Door ' >< i >< ' is ' ><\n            if doors(i) then 'open' else 'closed' endif, '%s\\n');\nendfor;",
        "safe": true
    },
    {
        "filename": "100 doors_541.txt",
        "content": "for i to 100 do\n    lvars root = sqrt(i);\n    i; if root = round(root) then ' open' ><; else ' closed' ><; endif; =>\nendfor;",
        "safe": true
    },
    {
        "filename": "100 doors_542.txt",
        "content": "/doors [ 100 { false } repeat ] def\n\n1 1 100 { dup 1 sub exch 99 {\n        dup doors exch get not doors 3 1 roll put\n} for } for\ndoors pstack",
        "safe": true
    },
    {
        "filename": "100 doors_543.txt",
        "content": "[true false false true false false false false true false ...<90 doors later>... true]",
        "safe": true
    },
    {
        "filename": "100 doors_544.txt",
        "content": "square=1, i=3\n1 to 100(door):\n  if (door == square):\n    (\"door\", door, \"is open\") say\n    square += i\n    i += 2.\n.",
        "safe": true
    },
    {
        "filename": "100 doors_545.txt",
        "content": "$doors = @(0..99)\nfor($i=0; $i -lt 100; $i++) {\n  $doors[$i] = 0  # start with all doors closed\n}\nfor($i=0; $i -lt 100; $i++) {\n  $step = $i + 1\n  for($j=$i; $j -lt 100; $j = $j + $step) {\n    $doors[$j] = $doors[$j] -bxor 1\n  }\n}\nforeach($doornum in 1..100) {\n  if($doors[($doornum-1)] -eq $true) {\"$doornum open\"}\n  else {\"$doornum closed\"}\n}",
        "safe": true
    },
    {
        "filename": "100 doors_546.txt",
        "content": "function Get-DoorState($NumberOfDoors)\n{\n   begin \n   {\n      $Doors = @()\n      $Multiple = 1\n   }\n\n   process\n   {\n      for ($i = 1; $i -le $NumberOfDoors; $i++)\n      {\n         $Door = [pscustomobject]@{\n                    Name = $i\n                    Open = $false\n                 }\n\n         $Doors += $Door   \n      }\n\n      While ($Multiple -le $NumberOfDoors)\n      {\n\t Foreach ($Door in $Doors)\n\t {\n\t    if ($Door.name\u00a0% $Multiple -eq 0)\n               {\n\t          If ($Door.open -eq $False){$Door.open = $True}\n\t          Else {$Door.open = $False}\n\t       }\n\t }\n\t\t\t\n         $Multiple++\n      }\n    }\n\n    end {$Doors}\n}",
        "safe": true
    },
    {
        "filename": "100 doors_547.txt",
        "content": "$doors = 1..100 | ForEach-Object {0}\n1..100 | ForEach-Object { $a=$_;1..100 | Where-Object { -not ( $_\u00a0% $a )  } | ForEach-Object { $doors[$_-1] = $doors[$_-1] -bxor 1 }; if ( $doors[$a-1] ) { \"door opened\" } else { \"door closed\" } }",
        "safe": true
    },
    {
        "filename": "100 doors_548.txt",
        "content": "$doors = 1..100 | ForEach-Object {0}\n$visited = 1..100\n1..100 | ForEach-Object { $a=$_;$visited[0..([math]::floor(100/$a)-1)] | Where-Object { -not ( $_\u00a0% $a )  } | ForEach-Object { $doors[$_-1] = $doors[$_-1] -bxor 1;$visited[$_/$a-1]+=($_/$a) }; if ( $doors[$a-1] ) { \"door opened\" } else { \"door closed\" } }",
        "safe": true
    },
    {
        "filename": "100 doors_549.txt",
        "content": "1..100|foreach-object {$pipe += \"toggle $_ |\"} -begin {$pipe=\"\"}\nfilter toggle($pass) {$_.door = $_.door -xor\u00a0!($_.index\u00a0% $pass);$_}\ninvoke-expression \"1..100| foreach-object {@{index=`$_;door=`$false}} | $pipe  out-host\"",
        "safe": true
    },
    {
        "filename": "100 doors_55.txt",
        "content": "{1, 4, 9, 16, 25, 36, 49, 64, 81, 100}\n",
        "safe": true
    },
    {
        "filename": "100 doors_550.txt",
        "content": "Workflow Calc-Doors {\n    Foreach \u2013parallel ($number in 1..100) {\n        \"Door \" + $number.ToString(\"0000\") + \": \" + @{$true=\"Closed\";$false=\"Open\"}[([Math]::pow($number, 0.5)%1) -ne 0]\n    }\n}\nCalc-Doors | sort",
        "safe": true
    },
    {
        "filename": "100 doors_551.txt",
        "content": "1..10|%{\"Door \"+ $_*$_ + \" is open\"}",
        "safe": true
    },
    {
        "filename": "100 doors_552.txt",
        "content": "boolean[] doors = new boolean[100];\n\nvoid setup() {\n  for (int i = 0; i < 100; i++) {\n    doors[i] = false;\n  }\n  for (int i = 1; i < 100; i++) {\n    for (int j = 0; j < 100; j += i) {\n      doors[j] = !doors[j];\n    }\n  }\n  println(\"Open:\");\n  for (int i = 1; i < 100; i++) {\n    if (doors[i]) {\n      println(i);\n    }\n  }\n  exit();\n}",
        "safe": true
    },
    {
        "filename": "100 doors_553.txt",
        "content": "Open:\n1\n4\n9\n16\n25\n36\n49\n64\n81",
        "safe": true
    },
    {
        "filename": "100 doors_554.txt",
        "content": "setup <- function() {\n  for(door in doors(100, 100)) {\n    stdout$print(paste(door, \"\"))\n  }\n}\n\ndoors <- function(ndoors=100,passes=100) {\n  doors <- rep(FALSE,ndoors)\n  for (ii in seq(1,passes)) {\n      mask <- seq(0,ndoors,ii)\n      doors[mask] <- !doors[mask]  \n  }\n  return (which(doors == TRUE))\n}",
        "safe": true
    },
    {
        "filename": "100 doors_555.txt",
        "content": "1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100 doors_556.txt",
        "content": "enableextensions \nenabledelayedexpansion\neditvar /newvar /value=0 /title=closed\neditvar /newvar /value=1 /title=open\neditvar /newvar /range=1-100 /increment=1 /from=2\neditvar /newvar /value=2 /title=next\n:doors\nfor /alloccurrences (!next!-!102!) do editvar /modify /value=-open-\neditvar /modify /value=-next-=+1\nif -next- /hasvalue=100 goto :cont else goto :doors\n:cont\nprintline !1!-!102!\nstoptask",
        "safe": true
    },
    {
        "filename": "100 doors_557.txt",
        "content": "main\u00a0:-\n    forall(between(1,100,Door), ignore(display(Door))).\n\n% show output if door is open after the 100th pass\ndisplay(Door)\u00a0:-\n    status(Door, 100, open),\n    format(\"Door ~d is open~n\", [Door]).\n\n% true if Door has Status after Pass is done\nstatus(Door, Pass, Status)\u00a0:-\n    Pass > 0,\n    Remainder is Door mod Pass,\n    toggle(Remainder, OldStatus, Status),\n    OldPass is Pass - 1,\n    status(Door, OldPass, OldStatus).\nstatus(_Door, 0, closed).\n\ntoggle(Remainder, Status, Status)\u00a0:-\n    Remainder > 0.\ntoggle(0, open, closed).\ntoggle(0, closed, open).",
        "safe": true
    },
    {
        "filename": "100 doors_558.txt",
        "content": "doors_unoptimized(N)\u00a0:-\n\tlength(L, N),\n\tmaplist(init, L),\n\tdoors(N, N, L, L1),\n\taffiche(N, L1).\n\ninit(close).\n\ndoors(Max, 1, L, L1)\u00a0:-\n\t!,\n       inverse(1, 1, Max, L, L1).\n\ndoors(Max, N, L, L1)\u00a0:-\n\tN1 is N - 1,\n\tdoors(Max, N1, L, L2),\n\tinverse(N, 1, Max, L2, L1).\n\n\ninverse(N, Max, Max, [V], [V1])\u00a0:-\n\t!,\n\t0 =:= Max mod N -> inverse(V, V1); V1 = V.\n\ninverse(N, M, Max, [V|T], [V1|T1])\u00a0:-\n\tM1 is M+1,\n\tinverse(N, M1, Max, T, T1),\n\t(   0 =:= M mod N -> inverse(V, V1); V1 = V).\n\n\ninverse(open, close).\ninverse(close, open).\n\naffiche(N, L)\u00a0:-\n\tforall(between(1, N, I),\n\t       (   nth1(I, L, open) -> format('Door ~w is open.~n', [I]); true)).",
        "safe": true
    },
    {
        "filename": "100 doors_559.txt",
        "content": "doors(Num, Passes)\u00a0:-\n    forall(( everyNth(1,Passes,1,Pass)\n           , forall((everyNth(Pass,Num,Pass,Door), toggle(Door)))\n           ))\n  , show(Num)\n  .\n\n\ntoggle(Door)\u00a0:-\n    Opened = opened(Door)\n  , ( clause(Opened,_) -> retract(Opened)\n                       \u00a0; asserta(Opened)\n    ).\n\n\nshow(Num)\u00a0:-\n    forall(( between(1,Num,Door)\n           , (opened(Door) -> State = opened\u00a0; State = closed)\n           , write(Door), write(' '), write(State), nl\n           )).\n\n\n% utils\nforall(X)\u00a0:- findall(_, X, _).\n\neveryNth(From,To,Step,X)\u00a0:-\n    From =< To\n  , ( X = From\u00a0; From1 is From + Step, everyNth(From1,To,Step,X) )\n  .\n\nmain\u00a0:- doors(100,100), halt.",
        "safe": true
    },
    {
        "filename": "100 doors_56.txt",
        "content": "openshut(n):\n  for x in [1..n]\n    x%n==0\n\npass(n):\n  if n==100\n    openshut(n)\n  else\n    openshut(n) xor pass(n+1)\n\n100doors():\n  pass(1) -> io",
        "safe": true
    },
    {
        "filename": "100 doors_560.txt",
        "content": "doors_optimized(N)\u00a0:-\n\tMax is floor(sqrt(N)),\n\tforall(between(1, Max, I),\n\t       (   J is I*I,format('Door ~w is open.~n',[J]))).",
        "safe": true
    },
    {
        "filename": "100 doors_561.txt",
        "content": ";;; find the first few squares via the unoptimised door flipping method\nPROGRAM hundredDoors\nINCLUDE LIBRARY\nCON INT doorMax = 100\nBYTE door [ doorMax + 1 ]\u00a0; door( i ) is true if open, false if closed\nWORD i\nBYTE j\nBEGIN\nFOR i = 0 TO doorMax           \u00a0; set all doors to closed\n  door[ i ] = false\nFOR i = 1 TO doorMax           \u00a0; repeatedly flip the doors\n  j = i:<\n  WHILE j <= doorMax\n    door[ j ] = not door[ j ]\n    j = j + i:<\nFOR i = 1 TO doorMax           \u00a0; display the results\n  IF door[ i ]\n    OUTPUT \" #W\", i\nOUTPUT \"#C\"\nEND",
        "safe": true
    },
    {
        "filename": "100 doors_562.txt",
        "content": "using system;\n\n// initialize doors as pairs: number, status where 0 means open\nlet doors = zip (1..100) (repeat 1);\n\ntoogle (x,y) = x,~y;\n\ntoogleEvery n d = map (tooglep n) d with\n                    tooglep n d@((x,_)) = toogle d if ~(x mod n);\n                                        = d otherwise; end;\n\n// show description of given doors\nstatus (n,x) = (str n) + (case x of\n                            1 = \" close\";\n                            0 = \" open\"; end);\n\nlet result = foldl (\\a n -> toogleEvery n a) doors (1..100);\n\n// pretty print the result (only open doors)\nshowResult = do (puts.status) final when\n               final = filter open result with\n                         open (_,x) = ~x;\n                       end; end;",
        "safe": true
    },
    {
        "filename": "100 doors_563.txt",
        "content": " \n> showResult;\n1 open\n4 open\n9 open\n16 open\n25 open\n...\n",
        "safe": true
    },
    {
        "filename": "100 doors_564.txt",
        "content": "100Doors.pd\n\n#N canvas 241 375 414 447 10;\n#X obj 63 256 expr doors[$f1] = doors[$f1] ^ 1;\n#X msg 83 118 \\; doors const 0;\n#X msg 44 66 bang;\n#X obj 44 92 t b b b;\n#X obj 43 28 table doors 101;\n#X obj 44 360 sel 0;\n#X obj 44 336 expr if (doors[$f1] == 1 \\, $f1 \\, 0);\n#X obj 63 204 t b f f;\n#X text 81 66 run;\n#X obj 71 384 print -n;\n#X text 132 310 print results (open doors);\n#X obj 63 179 loop 1 100 1;\n#X obj 63 231 loop 1 100 1;\n#X obj 44 310 loop 1 100 1;\n#X text 148 28 create array;\n#X text 151 180 100 passes;\n#X text 179 123 set values to 0;\n#X connect 2 0 3 0;\n#X connect 3 0 13 0;\n#X connect 3 1 11 0;\n#X connect 3 2 1 0;\n#X connect 5 1 9 0;\n#X connect 6 0 5 0;\n#X connect 7 0 12 0;\n#X connect 7 1 12 1;\n#X connect 7 2 12 3;\n#X connect 11 0 7 0;\n#X connect 12 0 0 0;\n#X connect 13 0 6 0;\n\nloop.pd\n\n#N canvas 656 375 427 447 10;\n#X obj 62 179 until;\n#X obj 102 200 f;\n#X obj 62 89 inlet;\n#X obj 303 158 f \\$3;\n#X obj 270 339 outlet;\n#X obj 223 89 inlet;\n#X obj 138 89 inlet;\n#X obj 324 89 inlet;\n#X obj 117 158 f \\$1;\n#X text 323 68 step;\n#X obj 202 158 f \\$2;\n#X obj 62 118 t b b b b;\n#X obj 270 315 spigot;\n#X obj 89 314 sel 0;\n#X obj 137 206 +;\n#X obj 102 237 expr $f1 \\; if ($f3 > 0 \\, if ($f1 > $f2 \\, 0 \\, 1)\n\\, if ($f3 < 0 \\, if ($f1 < $f2 \\, 0 \\, 1) \\, 0)), f 34;\n#X text 63 68 run;\n#X text 136 68 start;\n#X text 227 68 end;\n#X text 58 31 loop (abstraction);\n#X connect 0 0 1 0;\n#X connect 1 0 14 0;\n#X connect 1 0 15 0;\n#X connect 2 0 11 0;\n#X connect 3 0 14 1;\n#X connect 3 0 15 2;\n#X connect 5 0 10 1;\n#X connect 6 0 8 1;\n#X connect 7 0 3 1;\n#X connect 8 0 1 1;\n#X connect 10 0 15 1;\n#X connect 11 0 0 0;\n#X connect 11 1 8 0;\n#X connect 11 2 10 0;\n#X connect 11 3 3 0;\n#X connect 12 0 4 0;\n#X connect 13 0 0 1;\n#X connect 14 0 1 1;\n#X connect 15 0 12 0;\n#X connect 15 1 12 1;\n#X connect 15 1 13 0;",
        "safe": true
    },
    {
        "filename": "100 doors_565.txt",
        "content": "Dim doors.i(100)\n \nFor x = 1 To 100\n  y = x\n  While y <= 100\n    doors(y) = 1 - doors(y)\n    y + x\n  Wend\nNext\n \nOpenConsole()\nPrintN(\"Following Doors are open:\")\nFor x = 1 To 100\n  If doors(x)\n    Print(Str(x) + \", \")\n  EndIf\nNext\nInput()",
        "safe": true
    },
    {
        "filename": "100 doors_566.txt",
        "content": "OpenConsole()\nPrintN(\"Following Doors are open:\")\nFor i = 1 To 100\n    root.f = Sqr(i)\n    If root = Int(root)\n    \tPrint (Str(i) + \", \")\n    EndIf\nNext     \nInput()",
        "safe": true
    },
    {
        "filename": "100 doors_567.txt",
        "content": "Following Doors are open:\n1, 4, 9, 16, 25, 36, 49, 64, 81, 100,",
        "safe": true
    },
    {
        "filename": "100 doors_568.txt",
        "content": "data Door:\n  | open\n  | closed\nend\n \nfun flip-door(d\u00a0:: Door) -> Door:\n  cases(Door) d:\n    | open => closed\n    | closed => open\n  end\nend\n \n\nfun flip-doors(doors\u00a0:: List<Door>) -> List<Door>:\n  doc:```Given a list of door positions, repeatedly switch the positions of\n      every nth door for every nth pass, and return the final list of door\n      positions```\n  for fold(flipped-doors from doors, n from range(1, doors.length() + 1)):\n    for map_n(m from 1, d from flipped-doors):\n      if num-modulo(m, n) == 0:\n        flip-door(d)\n      else:\n        d\n      end\n    end\n  end\nwhere:\n    flip-doors([list: closed, closed, closed]) is\n  [list: open, closed, closed]\n\n  flip-doors([list: closed, closed, closed, closed]) is\n  [list: open, closed, closed, open]\n\n  flip-doors([list: closed, closed, closed, closed, closed, closed]) is\n  [list: open, closed, closed, open, closed, closed]\n\n  closed-100 = for map(_ from range(1, 101)): closed end\n  answer-100 = for map(n from range(1, 101)):\n    if num-is-integer(num-sqrt(n)): open\n    else: closed\n    end\n  end\n\n  flip-doors(closed-100) is answer-100\nend\n\nfun find-indices<A>(pred\u00a0:: (A -> Boolean), xs\u00a0:: List<A>) -> List<Number>:\n    doc:```Given a list and a predicate function, produce a list of index\n      positions where there's a match on the predicate```\n  ps = map_n(lam(n,e): if pred(e): n else: -1 end end, 1, xs)\n  ps.filter(lam(x): x >= 0 end)\nwhere:\n  find-indices((lam(i): i == true end), [list: true,false,true]) is [list:1,3]\nend\n\n\nfun run(n):\n  doc:```Given a list of doors that are closed, make repeated passes \n      over the list, switching the positions of every nth door for \n      each nth pass. Return a list of positions in the list where the\n      door is Open.```\n  doors = repeat(n, closed)\n  ys = flip-doors(doors)\n  find-indices((lam(y): y == open end), ys)\nwhere:\n  run(4) is [list: 1,4]\nend\n \nrun(100)",
        "safe": true
    },
    {
        "filename": "100 doors_569.txt",
        "content": "doors = [False] * 100\nfor i in range(100):\n   for j in range(i, 100, i+1):\n       doors[j] = not doors[j]\n   print(\"Door %d:\"\u00a0% (i+1), 'open' if doors[i] else 'close')",
        "safe": true
    },
    {
        "filename": "100 doors_57.txt",
        "content": "use std, array\n\nclose all doors\nfor each pass from 1 to 100\n  for (door = pass) (door <= 100) (door += pass)\n    toggle door\n\nlet int pass, door.\n\n.: close all doors\u00a0:. {memset doors 0 size of doors}\n.:toggle <int door>:. {   \u00a0!!(doors[door - 1])     }\n\nlet doors be an array of 100 bool\n\nfor each door from 1 to 100\n  printf \"#%.3d %s\\n\" door (doors[door - 1])\u00a0? \"[ ]\", \"[X]\"",
        "safe": true
    },
    {
        "filename": "100 doors_570.txt",
        "content": "for i in xrange(1, 101):\n    root = i ** 0.5\n    print \"Door %d:\"\u00a0% i, 'open' if root == int(root) else 'close'",
        "safe": true
    },
    {
        "filename": "100 doors_571.txt",
        "content": "print '\\n'.join(['Door %s is %s'\u00a0% (i, ('closed', 'open')[(i**0.5).is_integer()]) for i in xrange(1, 101)])",
        "safe": true
    },
    {
        "filename": "100 doors_572.txt",
        "content": "print '\\n'.join('Door %s is %s'\u00a0% (i, 'closed' if i**0.5\u00a0% 1 else 'open') for i in range(1, 101))",
        "safe": true
    },
    {
        "filename": "100 doors_573.txt",
        "content": "for i in range(1, 101):\n    if i**0.5\u00a0% 1:\n        state='closed'\n    else:\n        state='open'\n    print(\"Door {}:{}\".format(i, state))",
        "safe": true
    },
    {
        "filename": "100 doors_574.txt",
        "content": "for i in range(1,11): print(\"Door %s is open\"\u00a0% i**2)",
        "safe": true
    },
    {
        "filename": "100 doors_575.txt",
        "content": "`closed`open(100#0b){@[x;where y;not]}/100#'(til[100]#'0b),'1b",
        "safe": true
    },
    {
        "filename": "100 doors_576.txt",
        "content": "`closed`open (1+til 100) in {x*x} 1+til 10",
        "safe": true
    },
    {
        "filename": "100 doors_577.txt",
        "content": "@[100#`closed; -1+{x*x}1+til 10;\u00a0:; `open]",
        "safe": true
    },
    {
        "filename": "100 doors_578.txt",
        "content": "Const Opened = -1, Closed = 0\nDim Doors(1 To 100) As Integer, Passes As Integer, Index As Integer\nRem Normal implementation\nPrint \"100doors Normal method\"\nFor Passes = 1 To 100 Step 1\n    Doors(Passes) = Closed\nNext Passes\nFor Passes = 1 To 100 Step 1\n    For Index = 0 To 100 Step Passes\n        If Index > 100 Then Exit For\n        If Index > 0 Then If Doors(Index) = Opened Then Doors(Index) = Closed Else Doors(Index) = Opened\n    Next Index\nNext Passes\nPrint \"OPEN DOORS after 100th passes\"\nFor Passes = 1 To 100 Step 1\n    If Doors(Passes) = Opened Then Print Passes; \" \";\nNext\n\nRem Alternative solution of perfect squares\n\nPrint \"Alternative method\"\nPasses = 0\nFor Passes = 1 To 100 Step 1\n    Doors(Passes) = Closed\nNext Passes\nFor Passes = 1 To 100 Step 1\n    If Sqr(Passes) = Int(Sqr(Passes)) Then Doors(Passes) = Opened\nNext\nPrint \"Opened doors found by SQR method\"\nFor Passes = 1 To 100 Step 1\n    If Doors(Passes) = Opened Then Print Passes; \" \";\nNext Passes\nEnd",
        "safe": true
    },
    {
        "filename": "100 doors_579.txt",
        "content": "/O>  [ bit ^ ]                       is toggle      ( f n --> f )\n...   \n...  [ 0\n...    100 times\n...      [ i^ 1+ swap\n...        101 times\n...          [ i^ toggle over step ]\n...      nip ] ]                     is toggledoors (     --> f )\n...   \n...   [ 100 times\n...        [ 1 >> dup 1 &\n...          if [ i^ 1+ echo sp ] ]\n...     drop ]                       is echodoors   (   f -->   )\n...   \n...  toggledoors\n...  say \" These doors are open: \" echodoors cr\n...  say \" The rest are closed.\" cr\n... \n These doors are open: 1 4 9 16 25 36 49 64 81 100 \n The rest are closed.\n\nStack empty.",
        "safe": true
    },
    {
        "filename": "100 doors_58.txt",
        "content": "/* ARM assembly Raspberry PI  */\n/*  program 100doors.s   */\n\n/************************************/\n/* Constantes                       */\n/************************************/\n.equ STDOUT, 1                                 @ Linux output console\n.equ EXIT,   1                                 @ Linux syscall\n.equ WRITE,  4                                 @ Linux syscall\n.equ NBDOORS,   100\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nsMessResult:       .ascii \"The door \"\nsMessValeur:       .fill 11, 1, ' '            @ size => 11\n                      .asciz \"is open.\\n\"\n\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss  \nstTableDoors:\t.skip   4 * NBDOORS\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                         @ entry of program \n    push {fp,lr}                              @ saves 2 registers \n    @ display first line\n    ldr r3,iAdrstTableDoors                   @ table address\n    mov r5,#1            \n1:\n    mov r4,r5\n2:                                            @ begin loop\n    ldr r2,[r3,r4,lsl #2]                     @ read doors index r4\n    cmp r2,#0\n    moveq r2,#1                               @ if r2 = 0   1 -> r2\n    movne r2,#0                               @ if r2 = 1   0 -> r2\n    str r2,[r3,r4,lsl #2]                     @ store value of doors\n    add r4,r5                                 @ increment r4 with  r5 value\n    cmp r4,#NBDOORS                           @ number of doors\u00a0?\n    ble 2b                                    @ no -> loop\n    add r5,#1                                 @ increment the increment\u00a0!!\n    cmp r5,#NBDOORS                           @ number of doors\u00a0?\n    ble 1b                                    @ no -> loop\n\n                                              @ loop display state doors\n    mov r4,#0              \n3:\n    ldr r2,[r3,r4,lsl #2]                     @ read state doors r4 index\n    cmp r2,#0\n    beq 4f\n    mov r0,r4                                 @ open -> display message\n    ldr r1,iAdrsMessValeur                    @ display value index\n    bl conversion10                           @ call function\n    ldr r0,iAdrsMessResult\n    bl affichageMess                          @ display message\n4:\n    add r4,#1\n    cmp r4,#NBDOORS\n    ble 3b                                    @ loop\n \n\n100:                                          @ standard end of the program \n    mov r0, #0                                @ return code\n    pop {fp,lr}                               @restaur 2 registers\n    mov r7, #EXIT                             @ request to exit program\n    svc #0                                    @ perform the system call\n\niAdrsMessValeur:                .int sMessValeur\niAdrstTableDoors:\t\t.int stTableDoors\niAdrsMessResult:\t\t.int sMessResult\n\n/******************************************************************/\n/*     display text with size calculation                         */ \n/******************************************************************/\n/* r0 contains the address of the message */\naffichageMess:\n    push {r0,r1,r2,r7,lr}                     @ save  registres\n    mov r2,#0                                 @ counter length \n1:                                            @ loop length calculation \n    ldrb r1,[r0,r2]                           @ read octet start position + index \n    cmp r1,#0                                 @ if 0 its over \n    addne r2,r2,#1                            @ else add 1 in the length \n    bne 1b                                    @ and loop \n                                              @ so here r2 contains the length of the message \n    mov r1,r0        \t\t\t      @ address message in r1 \n    mov r0,#STDOUT      \t\t      @ code to write to the standard output Linux \n    mov r7, #WRITE                            @ code call system \"write\" \n    svc #0                                    @ call systeme \n    pop {r0,r1,r2,r7,lr}                      @ restaur des  2 registres */ \n    bx lr                                     @ return  \n/******************************************************************/\n/*     Converting a register to a decimal unsigned                */ \n/******************************************************************/\n/* r0 contains value and r1 address area   */\n/* r0 return size of result (no zero final in area) */\n/* area size => 11 bytes          */\n.equ LGZONECAL,   10\nconversion10:\n    push {r1-r4,lr}                            @ save registers \n    mov r3,r1\n    mov r2,#LGZONECAL\n\n1:\t                                       @ start loop\n    bl divisionpar10U                          @unsigned  r0 <- dividende. quotient ->r0 reste -> r1\n    add r1,#48                                 @ digit\t\n    strb r1,[r3,r2]                            @ store digit on area\n    cmp r0,#0                                  @ stop if quotient = 0 \n    subne r2,#1                                @ else previous position\n    bne 1b\t                               @ and loop\n    // and move digit from left of area\n    mov r4,#0\n2:\n    ldrb r1,[r3,r2]\n    strb r1,[r3,r4]\n    add r2,#1\n    add r4,#1\n    cmp r2,#LGZONECAL\n    ble 2b\n    // and move spaces in end on area\n    mov r0,r4                                 @ result length \n    mov r1,#' '                               @ space\t\n3:\n    strb r1,[r3,r4]                           @ store space in area\n    add r4,#1                                 @ next position\n    cmp r4,#LGZONECAL\n    ble 3b                                    @ loop if r4 <= area size\n\n100:\n    pop {r1-r4,lr}                            @ restaur registres \n    bx lr                                     @return\n\n/***************************************************/\n/*   division par 10   unsigned                    */\n/***************************************************/\n/* r0 dividende   */\n/* r0 quotient */\t\n/* r1 remainder  */\ndivisionpar10U:\n    push {r2,r3,r4, lr}\n    mov r4,r0                                        @ save value\n    //mov r3,#0xCCCD                                 @ r3 <- magic_number  lower   @ for Raspberry pi 3\n    //movt r3,#0xCCCC                                @ r3 <- magic_number  upper   @ for Raspberry pi 3\n    ldr r3,iMagicNumber                              @ for Raspberry pi 1 2\n    umull r1, r2, r3, r0                             @ r1<- Lower32Bits(r1*r0) r2<- Upper32Bits(r1*r0) \n    mov r0, r2, LSR #3                               @ r2 <- r2 >> shift 3\n    add r2,r0,r0, lsl #2                             @ r2 <- r0 * 5 \n    sub r1,r4,r2, lsl #1                             @ r1 <- r4 - (r2 * 2)  = r4 - (r0 * 10)\n    pop {r2,r3,r4,lr}\n    bx lr                                            @ leave function \niMagicNumber:            .int 0xCCCCCCCD",
        "safe": true
    },
    {
        "filename": "100 doors_580.txt",
        "content": "doors_puzzle <- function(ndoors, passes = ndoors) {\n    doors <- logical(ndoors)\n    for (ii in seq(passes)) {\n        mask <- seq(ii, ndoors, ii)\n        doors[mask] <- !doors[mask]\t\n    }\n    which(doors)\n}\n\ndoors_puzzle(100)",
        "safe": true
    },
    {
        "filename": "100 doors_581.txt",
        "content": "x <- rep(1, 100)\nfor (i in 1:100-1) {\n    x <- xor(x, rep(c(rep(0,i),1), length.out=100))\n}\nwhich(!x)",
        "safe": true
    },
    {
        "filename": "100 doors_582.txt",
        "content": "doors_puzzle <- function(ndoors=100,passes=100) {\nnames(which(table(unlist(sapply(1:passes, function(X) seq(0, ndoors, by=X))))\u00a0%% 2 == 1))\n}\n\ndoors_puzzle()",
        "safe": true
    },
    {
        "filename": "100 doors_583.txt",
        "content": "H=100\nf=rep(F,H)\nwhich(Reduce(function(d,n) xor(replace(f,seq(n,H,n),T),d), 1:H, f))",
        "safe": true
    },
    {
        "filename": "100 doors_584.txt",
        "content": "1   4   9  16  25  36  49  64  81 100\n",
        "safe": true
    },
    {
        "filename": "100 doors_585.txt",
        "content": "#lang racket\n\n;; Applies fun to every step-th element of seq, leaving the others unchanged.\n(define (map-step fun step seq)\n  (for/list ([elt seq] [i (in-naturals)])\n    ((if (zero? (modulo i step)) fun values) elt)))\n\n(define (toggle-nth n seq)\n  (map-step not n seq))\n\n(define (solve seq)\n  (for/fold ([result seq]) ([_ seq] [pass (in-naturals 1)])\n    (toggle-nth pass result)))\n\n(for ([door (solve (make-vector 101 #f))] [index (in-naturals)]\n      #:when (and door (> index 0)))\n  (printf \"~a is open~%\" index))",
        "safe": true
    },
    {
        "filename": "100 doors_586.txt",
        "content": "#lang racket\n(for ([x (in-range 1 101)] #:when (exact-integer? (sqrt x)))\n  (printf \"~a is open\\n\" x))",
        "safe": true
    },
    {
        "filename": "100 doors_587.txt",
        "content": "#lang slideshow\n(define-syntax-rule (vector-neg! vec pos)\n  (vector-set! vec pos (not (vector-ref vec pos))))\n\n(define (make-doors)\n  (define doors (make-vector 100 #f))\n  (for* ([i 100] [j (in-range i 100 (add1 i))]) (vector-neg! doors j))\n  doors)\n\n(displayln (list->string (for/list ([d (make-doors)]) (if d #\\o #\\-))))\n\n(define closed-door (inset (filled-rectangle 4 20) 2))\n(define open-door (inset (rectangle 4 20) 2))\n\n(for/fold ([doors (rectangle 0 0)]) ([open? (make-doors)])\n  (hc-append doors (if open? open-door closed-door)))",
        "safe": true
    },
    {
        "filename": "100 doors_588.txt",
        "content": "my @doors = False xx 101;\n \n(.=not for @doors[0, $_ ... 100]) for 1..100;\n \nsay \"Door $_ is \", <closed open>[ @doors[$_] ] for 1..100;",
        "safe": true
    },
    {
        "filename": "100 doors_589.txt",
        "content": "say \"Door $_ is open\" for map {$^n ** 2}, 1..10;",
        "safe": true
    },
    {
        "filename": "100 doors_59.txt",
        "content": "/*********************************************/\n/* optimized version                         */\n/*********************************************/\n/* ARM assembly Raspberry PI  */\n/*  program 100doors.s   */\n\n/************************************/\n/* Constantes                       */\n/************************************/\n.equ STDOUT, 1     @ Linux output console\n.equ EXIT,   1     @ Linux syscall\n.equ WRITE,  4     @ Linux syscall\n.equ NBDOORS,   100\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nsMessResult:       .ascii \"The door \"\nsMessValeur:       .fill 11, 1, ' '                 @ size => 11\n                   .asciz \"is open.\\n\"\n\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss  \n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                               @ entry of program \n    push {fp,lr}                                    @ saves 2 registers \n                                                    @ display first line\n    mov r5,#3                                       @ start value of increment\n    mov r4,#1                                       @ start doors\n                                                    @ loop display state doors\n1:\n    mov r0,r4                                       @ open -> display message\n    ldr r1,iAdrsMessValeur                          @ display value index\n    bl conversion10                                 @ call function\n    ldr r0,iAdrsMessResult\n    bl affichageMess                                @ display message\n    add r4,r5                                       @ add increment\n    add r5,#2                                       @ new increment\n    cmp r4,#NBDOORS\n    ble 1b                                          @ loop\n \n\n100:   @ standard end of the program \n    mov r0, #0                                      @ return code\n    pop {fp,lr}                                     @ restaur 2 registers\n    mov r7, #EXIT                                   @ request to exit program\n    svc #0                                          @ perform the system call\n\niAdrsMessValeur:                .int sMessValeur\niAdrsMessResult:\t\t.int sMessResult\n\n/******************************************************************/\n/*     display text with size calculation                         */ \n/******************************************************************/\n/* r0 contains the address of the message */\naffichageMess:\n    push {r0,r1,r2,r7,lr}                           @ save  registres\n    mov r2,#0                                       @ counter length \n1:                                                  @ loop length calculation \n    ldrb r1,[r0,r2]                                 @ read octet start position + index \n    cmp r1,#0                                       @ if 0 its over \n    addne r2,r2,#1                                  @ else add 1 in the length \n    bne 1b                                          @ and loop \n                                                    @ so here r2 contains the length of the message \n    mov r1,r0        \t\t\t            @ address message in r1 \n    mov r0,#STDOUT      \t\t            @ code to write to the standard output Linux \n    mov r7, #WRITE                                  @ code call system \"write\" \n    svc #0                                          @ call systeme \n    pop {r0,r1,r2,r7,lr}                            @ restaur des  2 registres */ \n    bx lr                                           @ return  \n/******************************************************************/\n/*     Converting a register to a decimal unsigned                */ \n/******************************************************************/\n/* r0 contains value and r1 address area   */\n/* r0 return size of result (no zero final in area) */\n/* area size => 11 bytes          */\n.equ LGZONECAL,   10\nconversion10:\n    push {r1-r4,lr}                                 @ save registers \n    mov r3,r1\n    mov r2,#LGZONECAL\n\n1:\t                                            @ start loop\n    bl divisionpar10U                               @ unsigned  r0 <- dividende. quotient ->r0 reste -> r1\n    add r1,#48                                      @ digit\t\n    strb r1,[r3,r2]                                 @ store digit on area\n    cmp r0,#0                                       @ stop if quotient = 0 \n    subne r2,#1                                     @ else previous position\n    bne 1b\t                                    @ and loop\n                                                    @ and move digit from left of area\n    mov r4,#0\n2:\n    ldrb r1,[r3,r2]\n    strb r1,[r3,r4]\n    add r2,#1\n    add r4,#1\n    cmp r2,#LGZONECAL\n    ble 2b\n                                                    @ and move spaces in end on area\n    mov r0,r4                                       @ result length \n    mov r1,#' '                                     @ space\t\n3:\n    strb r1,[r3,r4]                                 @ store space in area\n    add r4,#1                                       @ next position\n    cmp r4,#LGZONECAL\n    ble 3b                                          @ loop if r4 <= area size\n\n100:\n    pop {r1-r4,lr}                                  @ restaur registres \n    bx lr                                           @return\n\n/***************************************************/\n/*   division par 10   unsigned                    */\n/***************************************************/\n/* r0 dividende   */\n/* r0 quotient */\t\n/* r1 remainder  */\ndivisionpar10U:\n    push {r2,r3,r4, lr}\n    mov r4,r0                                       @ save value\n    //mov r3,#0xCCCD                                @ r3 <- magic_number  lower   @ for raspberry 3\n    //movt r3,#0xCCCC                               @ r3 <- magic_number  upper   @ for raspberry 3\n    ldr r3,iMagicNumber                             @ for raspberry 1 2\n    umull r1, r2, r3, r0                            @ r1<- Lower32Bits(r1*r0) r2<- Upper32Bits(r1*r0) \n    mov r0, r2, LSR #3                              @ r2 <- r2 >> shift 3\n    add r2,r0,r0, lsl #2                            @ r2 <- r0 * 5 \n    sub r1,r4,r2, lsl #1                            @ r1 <- r4 - (r2 * 2)  = r4 - (r0 * 10)\n    pop {r2,r3,r4,lr}\n    bx lr                                           @ leave function \niMagicNumber:            .int 0xCCCCCCCD",
        "safe": true
    },
    {
        "filename": "100 doors_590.txt",
        "content": "say 'Door $_ is open' for (1..10)\u00bb\u00b2;",
        "safe": true
    },
    {
        "filename": "100 doors_591.txt",
        "content": " say \"Door $_ is open\" for 1..10 X** 2;",
        "safe": true
    },
    {
        "filename": "100 doors_592.txt",
        "content": "say \"Door $_ is \", <closed open>[.sqrt == .sqrt.floor] for 1..100;",
        "safe": true
    },
    {
        "filename": "100 doors_593.txt",
        "content": "sub  output( @arr, $max ) {\n    my $output = 1;\n    for 1..^$max -> $index {\n\tif @arr[$index] {\n\t    printf \"%4d\", $index;\n\t    say '' if $output++\u00a0%%  10;\n\t}\n    }\n    say '';\n}\n\nsub MAIN ( Int\u00a0:$doors = 100 ) {\n    my $doorcount = $doors + 1;\n    my @door[$doorcount] = 0 xx ($doorcount);\n    \n    INDEX:\n    for 1...^$doorcount -> $index {\n        # flip door $index & its multiples, up to last door.\n        #\n\tfor ($index, * + $index ... *)[^$doors] -> $multiple {\n\t    next INDEX if $multiple > $doors;\n\t    @door[$multiple] =  @door[$multiple]\u00a0?? 0\u00a0!! 1;\n\t}\n    }\n    output @door, $doors+1;\n}",
        "safe": true
    },
    {
        "filename": "100 doors_594.txt",
        "content": "$ ./100_doors.pl6 -doors=100\n   1   4   9  16  25  36  49  64  81\n",
        "safe": true
    },
    {
        "filename": "100 doors_595.txt",
        "content": "dim x as integer, y as integer\ndim door(1 to 100) as byte\n\n'initialize array\nfor x = 1 to 100\u00a0: door(x) = 0\u00a0: next\n\n'set door values\nfor y = 1 to 100\n    for x = y to 100 step y\n        door(x) = not door(x)\n    next x\nnext y\n\n'print result\nfor x = 1 to 100\n    if door(x) then print \"Door \" + str$(x) + \" = open\"\nnext \n\nwhile inkey$=\"\":wend\nend",
        "safe": true
    },
    {
        "filename": "100 doors_596.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_597.txt",
        "content": "doors: array/initial 100 'closed\nrepeat i 100 [\n    door: at doors i\n    forskip door i [change door either 'open = first door ['closed] ['open]]\n]",
        "safe": true
    },
    {
        "filename": "100 doors_598.txt",
        "content": "doors: array/initial 100 'closed\nrepeat i 10 [doors/(i * i): 'open]",
        "safe": true
    },
    {
        "filename": "100 doors_599.txt",
        "content": "Red [\n  Purpose: \"100 Doors Problem (Perfect Squares)\"\n  Author: \"Barry Arthur\"\n  Date: \"07-Oct-2016\"\n]\ndoors: make vector! [char! 8 100]\nrepeat i 100 [change at doors i #\".\"]\n\nrepeat i 100 [\n    j: i\n    while [j <= 100] [\n      door: at doors j\n      change door either #\"O\" = first door [#\".\"] [#\"O\"]\n      j: j + i\n    ]\n]\n\nrepeat i 10 [\n  print copy/part at doors (i - 1 * 10 + 1) 10\n]",
        "safe": true
    },
    {
        "filename": "100 doors_6.txt",
        "content": "; 100 DOORS in  6502 assembly language for: http://www.6502asm.com/beta/index.html\n; Written for the original MOS Technology, Inc. NMOS version of the 6502, but should work with any version.\n; Based on BASIC QB64 unoptimized version: http://rosettacode.org/wiki/100_doors#BASIC\n;\n; Notes:\n;    Doors array[1..100] is at $0201..$0264. On the specified emulator, this is in video memory, so tbe results will \n; be directly shown as pixels in the display.\n;    $0200 (door 0) is cleared for display purposes but is not involved in the open/close loops.\n;    Y register holds Stride\n;    X register holds Index\n;    Zero Page address $01 used to add Stride to Index (via A) because there's no add-to-X or add-Y-to-A instruction.\n\n \u00a0; First, zero door array\n    LDA #00\n    LDX #100\nZ_LOOP:\n    STA 200,X\n    DEX\n    BNE Z_LOOP\n    STA 200,X\n\n \u00a0; Now do doors repeated open/close\n    LDY #01       \u00a0; Initial value of Stride\nS_LOOP:\n    CPY #101\n    BCS S_DONE\n    TYA           \u00a0; Initial value of Index\nI_LOOP:\n    CMP #101\n    BCS I_DONE\n    TAX           \u00a0; Use as Door array index\n    INC $200,X    \u00a0; Toggle bit 0 to reverse state of door\n    STY 01        \u00a0; Add stride (Y) to index (X, via A)\n    ADC 01\n    BCC I_LOOP\nI_DONE:\n    INY\n    BNE S_LOOP\nS_DONE:\n\n \u00a0; Finally, format array values for output: 0 for closed, 1 for open\n    LDX #100\nC_LOOP:\n    LDA $200,X\n    AND #$01\n    STA $200,X\n    DEX\n    BNE C_LOOP",
        "safe": true
    },
    {
        "filename": "100 doors_60.txt",
        "content": "isOpen: map 1..101 => false\n \nloop 1..100 'pass ->\n\tloop (range.step:pass pass 100) 'door [\n\t\tisOpen\\[door]: not? isOpen\\[door]\n\t]\n\nloop 1..100 'x ->\n\tif isOpen\\[x] [\n\t\tprint [\"Door\" x \"is open.\"]\n\t]\n",
        "safe": true
    },
    {
        "filename": "100 doors_600.txt",
        "content": "Red [\"Doors\"]\n\ndoors: make bitset! len: 100\nrepeat step len [\n\trepeat n to-integer len / step [\n\t\tm: step * n \n\t\tdoors/:m: not doors/:m\n\t]\n]\nrepeat n len [if doors/:n [print n]]",
        "safe": true
    },
    {
        "filename": "100 doors_601.txt",
        "content": "$ENTRY Go {\n    = <Show 1 <Walk 1 <Doors>>>;\n};\n\nNDoors { = 100; };\nDoors  { = <Repeat <NDoors> Closed>; };\n\nRepeat {\n    0   s.val =\u00a0;\n    s.N s.val = s.val <Repeat <- s.N 1> s.val>\u00a0;\n};    \n\nToggle {\n    1   Closed e.rest = Open   e.rest;\n    1   Open   e.rest = Closed e.rest;\n    s.N s.door e.rest = s.door <Toggle <- s.N 1> e.rest>;\n};\n    \nPass {\n    s.pass s.door e.doors, <Compare s.door <NDoors>>: '+'\n        = e.doors;\n    s.pass s.door e.doors\n        = <Pass s.pass <+ s.pass s.door> <Toggle s.door e.doors>>;\n};\n\nWalk {\n    s.pass e.doors, <Compare s.pass <NDoors>>: '+' \n        = e.doors;\n    s.pass e.doors\n        = <Walk <+ s.pass 1> <Pass s.pass s.pass e.doors>>;\n};\n\nShow {\n    s.N Open   e.rest = <Prout Door s.N is open> \n                        <Show <+ s.N 1> e.rest>;\n    s.N Closed e.rest = <Show <+ s.N 1> e.rest>;\n    s.N =\u00a0;\n};",
        "safe": true
    },
    {
        "filename": "100 doors_602.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_603.txt",
        "content": "relation door, state\nset i = 1\nwhile i <= 100\ninsert i, 1\nset i = i+1\nend while\nset i = 2\nwhile i <= 100\nupdate state = 1-state where not (door mod i)\nset i = i+1\nend while\nupdate state = \"open\" where state\nupdate state = \"closed\" where state\u00a0!== \"open\"\nprint",
        "safe": true
    },
    {
        "filename": "100 doors_604.txt",
        "content": ":doors (n-) [ #1 repeat dup-pair n:square gt? 0; drop dup n:square n:put sp n:inc again ] do drop-pair\u00a0;\n#100 doors",
        "safe": true
    },
    {
        "filename": "100 doors_605.txt",
        "content": "/*REXX pgm solves the  100 doors puzzle, doing it the hard way by opening/closing doors.*/\nparse arg doors .                                /*obtain the optional argument from CL.*/\nif doors=='' | doors==\",\"  then doors=100        /*not specified?  Then assume 100 doors*/\n                                                 /*        0 =  the door is  closed.    */\n                                                 /*        1 =   \"    \"   \"  open.      */\ndoor.=0                                          /*assume all doors are closed at start.*/\n                do #=1  for doors                /*process a pass\u2500through for all doors.*/\n                    do j=#  by #  to doors       /*  \u00b7\u00b7\u00b7 every Jth door from this point.*/\n                    door.j= \\door.j              /*toggle the  \"openness\"  of the door. */\n                    end   /*j*/\n                end       /*#*/\n\nsay 'After '                doors          \" passes, the following doors are open:\"\nsay\n                do k=1  for doors\n                if door.k  then say right(k, 20) /*add some indentation for the output. */\n                end    /*k*/                     /*stick a fork in it,  we're all done. */",
        "safe": true
    },
    {
        "filename": "100 doors_606.txt",
        "content": "After  100  passes, the following doors are open:\n\n                   1\n                   4\n                   9\n                  16\n                  25\n                  36\n                  49\n                  64\n                  81\n                 100\n",
        "safe": true
    },
    {
        "filename": "100 doors_607.txt",
        "content": "/*REXX pgm solves the  100 doors  puzzle,  doing it the easy way by calculating squares.*/\nparse arg doors .                                /*obtain the optional argument from CL.*/\nif doors=='' | doors==\",\"  then doors=100        /*not specified?  Then assume 100 doors*/\nsay 'After '          doors          \" passes, the following doors are open:\"\nsay\n          do #=1  while  #**2 <= doors           /*process easy pass\u2500through  (squares).*/\n          say right(#**2, 20)                    /*add some indentation for the output. */\n          end   /*#*/                            /*stick a fork in it,  we're all done. */",
        "safe": true
    },
    {
        "filename": "100 doors_608.txt",
        "content": "doors = list(100)\nfor i = 1 to 100\ndoors[i] = false\nnext\n\nFor pass = 1 To 100\n         For door = pass To 100\n             if doors[door] doors[door] = false else doors[door] = true ok\n         door += pass-1\n         Next\nNext\n\nFor door = 1 To 100\n     see \"Door (\" + door + \") is \"\n     If doors[door] see \"Open\" else see \"Closed\" ok\n     see nl\nNext",
        "safe": true
    },
    {
        "filename": "100 doors_609.txt",
        "content": "doors = list(100)\nfor i = 1 to 100\ndoors[i] = false\nnext\n\nFor p = 1 To 10\n        doors[pow(p,2)] = True\nNext\n\nFor door = 1 To 100\n     see \"Door (\" + door + \") is \"\n     If doors[door] see \"Open\" else see \"Closed\" ok\n     see nl\nNext",
        "safe": true
    },
    {
        "filename": "100 doors_61.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100 doors_610.txt",
        "content": " \u226a { }\n   { 100 } 0 CON \n   1 100 FOR ii\n      ii 100 FOR j\n         DUP j GET NOT j SWAP PUT ii STEP    \n   IF DUP ii GET THEN SWAP ii + SWAP END\n   NEXT DROP\n\u226b 'DOORS' STO\n",
        "safe": true
    },
    {
        "filename": "100 doors_611.txt",
        "content": "DOORS ( -- { open_doors } ) \n doors = [False] * 100\nfor i in range(100):\n  for j in range(i, 100, i+1):\n      doors[j] = not doors[j]\n  if doors[i} then print(i)\n// clean stack\n\n",
        "safe": true
    },
    {
        "filename": "100 doors_612.txt",
        "content": "1: { 1 4 9 16 25 36 49 64 81 100 }\n",
        "safe": true
    },
    {
        "filename": "100 doors_613.txt",
        "content": "\u226a { } 1 100 FOR ii IF ii \u221a FP NOT THEN ii + END NEXT \u226b\n",
        "safe": true
    },
    {
        "filename": "100 doors_614.txt",
        "content": "doors = Array.new(101,0)\nprint \"Open doors \"\n(1..100).step(){ |i|\n(i..100).step(i) { |d|\n    doors[d] = doors[d]^= 1\n    if i == d and doors[d] == 1 then\n      print \"#{i} \"\n    end\n  }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_615.txt",
        "content": "Open doors 1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100 doors_616.txt",
        "content": "class Door\n  attr_reader :state\n\n  def initialize\n    @state = :closed\n  end\n  \n  def close\n    @state = :closed\n  end\n\n  def open\n    @state = :open\n  end\n  \n  def closed?\n    @state == :closed\n  end\n  \n  def open?\n    @state == :open\n  end\n  \n  def toggle\n    if closed? then open else close end\n  end\n  \n  def to_s\n    @state.to_s\n  end\nend\n\ndoors = Array.new(100) { Door.new }\n1.upto(100) do |multiplier|\n  doors.each_with_index do |door, i|\n    door.toggle if (i + 1)\u00a0% multiplier == 0\n  end\nend\n\ndoors.each_with_index { |door, i| puts \"Door #{i+1} is #{door}.\" }",
        "safe": true
    },
    {
        "filename": "100 doors_617.txt",
        "content": "n = 100\nOpen = \"open\"\nClosed = \"closed\"\ndef Open.toggle\n  Closed\nend\ndef Closed.toggle\n  Open\nend\ndoors = [Closed] * (n + 1)\nfor mul in 1..n\n  for x in (mul..n).step(mul)\n    doors[x] = doors[x].toggle\n  end\nend\ndoors.each_with_index do |b, i|\n  puts \"Door #{i} is #{b}\" if i > 0\nend",
        "safe": true
    },
    {
        "filename": "100 doors_618.txt",
        "content": "n = 100\n(1..n).each do |i| \n  puts \"Door #{i} is #{i**0.5 == (i**0.5).round\u00a0? \"open\"\u00a0: \"closed\"}\"\nend",
        "safe": true
    },
    {
        "filename": "100 doors_619.txt",
        "content": "doors = [false] * 100\n100.times do |i|\n  (i ... doors.length).step(i + 1) do |j|\n    doors[j] = !doors[j]\n  end\nend\nputs doors.map.with_index(1){|d,i| \"Door #{i} is #{d\u00a0? 'open'\u00a0: 'closed'}.\"}",
        "safe": true
    },
    {
        "filename": "100 doors_62.txt",
        "content": "var doors = falses(100)\n\nfor a in 1..100: for b in a..a..100:\n    doors[b] = not doors[b]\n\nfor a in 1..100:\n    print \"Door $a is ${(doors[a])\u00a0? 'open.': 'closed.'}\"\n",
        "safe": true
    },
    {
        "filename": "100 doors_620.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_621.txt",
        "content": "dim doors(100)\nprint \"Open doors \";\nfor i = 1 to 100 \n    for door = i to 100 step i\n        doors(door) = (doors(door) <> 1)\n        if i = door and doors(door) = 1 then   print i;\" \";\n    next door\nnext i",
        "safe": true
    },
    {
        "filename": "100 doors_622.txt",
        "content": "Open doors 1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100 doors_623.txt",
        "content": "fn main() {\n    let mut door_open = [false; 100];\n    for pass in 1..101 {\n        let mut door = pass;\n        while door <= 100 {\n            door_open[door - 1] = !door_open[door - 1];\n            door += pass;\n        }\n    }\n    for (i, &is_open) in door_open.iter().enumerate() {\n        println!(\n            \"Door {} is {}.\",\n            i + 1,\n            if is_open { \"open\" } else { \"closed\" }\n        );\n    }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_624.txt",
        "content": "fn main() {\n    let doors = vec![false; 100]\n        .iter_mut()\n        .enumerate()\n        .map(|(door, door_state)| {\n            (1..100)\n                .into_iter()\n                .filter(|pass| (door + 1)\u00a0% pass == 0)\n                .map(|_| {\n                    *door_state =\u00a0!*door_state;\n                    *door_state\n                })\n                .last()\n                .unwrap()\n        })\n        .collect::<Vec<_>>();\n\n    println!(\"{:?}\", doors);\n}",
        "safe": true
    },
    {
        "filename": "100 doors_625.txt",
        "content": "fn main() {\n    let squares: Vec<_> = (1..11).map(|n| n * n).collect();\n    let is_square = |num| squares.binary_search(&num).is_ok();\n\n    for i in 1..101 {\n        let state = if is_square(i) { \"open\" } else { \"closed\" };\n        println!(\"Door {} is {}\", i, state);\n    }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_626.txt",
        "content": "fn main() {\n    for i in 1u32..11u32 {\n        println!(\"Door {} is open\", i.pow(2));\n    }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_627.txt",
        "content": "$constant DOOR_OPEN = 1\n$constant DOOR_CLOSED = 0\n$constant MAX_DOORS = 100\n\nvar i, j = integer\ndim integer doors(MAX_DOORS)\n\nrem - all doors are initially closed\nfor i = 1 to MAX_DOORS\n  doors(i) = DOOR_CLOSED\nnext i\n\nrem - cycle through at increasing intervals and flip doors\nfor i = 1 to MAX_DOORS\n  for j = i to MAX_DOORS step i\n    doors(j) = 1 - doors(j)\n  next j\nnext i\n\nrem - report results\nprint \"The open doors are:\"\nfor i = 1 to MAX_DOORS\n  if doors(i) = DOOR_OPEN then\n     print i;\nnext i\n\nend",
        "safe": true
    },
    {
        "filename": "100 doors_628.txt",
        "content": "The open doors are:\n 1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100 doors_629.txt",
        "content": "variable door,\n    isOpen = Char_Type [101],\n    pass;\n \nfor (door = 1; door <= 100; door++) {\n    isOpen[door] = 0;\n}\n \nfor (pass = 1; pass <= 100; pass++) {\n    for (door = pass; door <= 100; door += pass) {\n        isOpen[door] = not isOpen[door];\n    }\n}\n \nfor (door = 1; door <= 100; door++) {\n    if (isOpen[door]) {\n        print(\"Door \" + string(door) + \":open\");\n    } else {\n        print(\"Door \" + string(door) + \":close\");\n    }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_63.txt",
        "content": "for(int i = 1; i < 100; ++i) {\n    if (i % i^2 < 11)  {\n      write(\"Door \", i^2, suffix=none);\n      write(\" is open\");\n    }\n  }\n",
        "safe": true
    },
    {
        "filename": "100 doors_630.txt",
        "content": "variable open\u00a0:= <<(* --> false)>>;\nfor (pass; 1; pass <= 100)\n    for (door_num; pass; door_num <= 100; pass)\n        open[door_num]\u00a0:=\u00a0!(open[door_num]);;;\niterate (door_num; [1...100])\n    print(\"Door \", door_num, \" is \",\n          (open[door_num]\u00a0? \"open.\\n\"\u00a0: \"closed.\\n\"));;",
        "safe": true
    },
    {
        "filename": "100 doors_631.txt",
        "content": "iterate (x; [1...10]) { iterate (y; [(x-1)*(x-1)+1...x*x-1]) { print(\"Door \", y, \" is closed.\\n\"); }; print(\"Door \", x*x, \" is open.\\n\"); };",
        "safe": true
    },
    {
        "filename": "100 doors_632.txt",
        "content": "variable y:=1;for(x;1;x<101)\"Door \"~sprint(x)~\" is \"~(x==y*y?{++y;return\"open\";}:\"closed\")!;",
        "safe": true
    },
    {
        "filename": "100 doors_633.txt",
        "content": "data _null_;\n   open=1;\n   close=0;\n   array Door{100};\n   do Pass = 1 to 100;\n      do Current = Pass to 100 by Pass;\n         if Door{Current} ne open \n            then Door{Current} = open;\n            else Door{Current} = close;\n      end;\n   end;\n   NumberOfOpenDoors = sum(of Door{*});\n   put \"Number of Open Doors:  \" NumberOfOpenDoors; \nrun;",
        "safe": true
    },
    {
        "filename": "100 doors_634.txt",
        "content": "class MAIN is\n  main is\n    doors :ARRAY{BOOL}\u00a0:= #(100);\n    loop\n      pass::= doors.ind!;\n      loop\n        i::= pass.stepto!(doors.size - 1, pass + 1);\n        doors[i]\u00a0:= ~doors[i];\n      end;\n    end;\n    loop\n      #OUT + (doors.ind! + 1) + \" \" + doors.elt! + \"\\n\";\n    end;\n  end;\nend;",
        "safe": true
    },
    {
        "filename": "100 doors_635.txt",
        "content": "for { i <- 1 to 100\n      r = 1 to 100 map (i\u00a0% _ == 0) reduceLeft (_^_)                 \n    } println (i +\" \"+ (if (r) \"open\" else \"closed\"))",
        "safe": true
    },
    {
        "filename": "100 doors_636.txt",
        "content": "def openDoors(length\u00a0: Int = 100) = {\n    var isDoorOpen = new Array[Boolean](length)\n\n    for (i <- 0 until length) {\n        for (j <- i until length by i + 1) {\n            isDoorOpen(j) ^= true\n        }\n    }\n    isDoorOpen\n}\n\nval doorState  = scala.collection.immutable.Map(false -> \"closed\", true -> \"open\")\nval isDoorOpen = openDoors()\n\nfor (doorNo <- 0 until isDoorOpen.length) {\n    println(\"Door %d is %s\".format(doorNo + 1, doorState(isDoorOpen(doorNo))))\n}",
        "safe": true
    },
    {
        "filename": "100 doors_637.txt",
        "content": "val o = 1 to 10 map (i => i * i)\nprintln(\"open: \" + o)\nprintln(\"closed: \" + (1 to 100 filterNot o.contains))",
        "safe": true
    },
    {
        "filename": "100 doors_638.txt",
        "content": "(define *max-doors* 100)\n\n(define (show-doors doors)\n  (let door ((i 0)\n             (l (vector-length doors)))\n    (cond ((= i l) \n           (newline))\n          (else \n           (printf \"~nDoor ~a is ~a\" \n                   (+ i 1) \n                   (if (vector-ref doors i) \"open\" \"closed\"))\n           (door (+ i 1) l)))))\n\n(define (flip-doors doors)\n  (define (flip-all i)\n    (cond ((> i *max-doors*) doors)\n          (else \n           (let flip ((idx (- i 1)))\n             (cond ((>= idx *max-doors*) \n                    (flip-all (+ i 1))) \n                   (else \n                    (vector-set! doors idx (not (vector-ref doors idx)))\n                    (flip (+ idx i))))))))\n  (flip-all 1))\n\n(show-doors (flip-doors (make-vector *max-doors* #f)))",
        "safe": true
    },
    {
        "filename": "100 doors_639.txt",
        "content": "(define (optimised-flip-doors doors)\n  (define (flip-all i)\n    (cond ((> i (floor (sqrt *max-doors*))) doors)\n          (else \n           (vector-set! doors (- (* i i) 1) #t)\n           (flip-all (+ i 1)))))\n  (flip-all 1))\n\n(show-doors (optimised-flip-doors (make-vector *max-doors* #f)))",
        "safe": true
    },
    {
        "filename": "100 doors_64.txt",
        "content": "#include \"share/atspre_staload.hats\"\n\nimplement\nmain0((*void*)) = let\n//\nvar A = @[bool][100](false)\nval A = $UNSAFE.cast{arrayref(bool,100)}(addr@A)\n//\nfnx\nloop\n(\n  pass: intGte(0)\n)\u00a0: void =\n  if pass < 100\n    then loop2 (pass, pass)\n  // end of [if]\nand\nloop2\n(\n  pass: natLt(100), door: intGte(0)\n)\u00a0: void =\n  if door < 100\n    then (A[door]\u00a0:= ~A[door]; loop2(pass, door+pass+1))\n    else loop(pass+1)\n  // end of [if]\n//\nfun\nloop3\n(\n  door: intGte(0)\n)\u00a0: void =\n  if door < 100\n    then (\n      println!(\"door #\", door+1, \" is \", (if A[door] then \"open\" else \"closed\"): string, \".\");\n      loop3(door+1)\n    ) (* end of [then] *)\n  // end of [if]\n//\nin\n  loop(0); loop3 (0)\nend // end of [main0]",
        "safe": true
    },
    {
        "filename": "100 doors_640.txt",
        "content": "(define (N_doors N)\n  (define (init)\n    (define (str n)\n      (if (> n N) '() (cons 0 (str (+ 1 n)))))\n    (str 1))\n  (define (toggle x str)\n    (define (s n lis)\n      (define (revert x)\n        (if (eq? x 0) 1 0))\n      (cond ((null? lis) '())\n          ((zero? (remainder n x)) (cons (revert (car lis)) (s (+ n 1) (cdr lis))))\n          (else (cons (car lis) (s (+ n 1) (cdr lis))))))\n    (s 1 str))\n  (define (iterate x lis)\n    (if (> x N) lis (iterate (+ x 1) (toggle x lis))))\n  (iterate 1 (init)))\n(N_doors 100)",
        "safe": true
    },
    {
        "filename": "100 doors_641.txt",
        "content": "(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)\n",
        "safe": true
    },
    {
        "filename": "100 doors_642.txt",
        "content": "doors=zeros(1,100);\nfor i = 1:100\n  for j = i:i:100\n    doors(j) = ~doors(j);\n  end\nend\nfor i = 1:100\n  if ( doors(i) )\n    s = \"open\";\n  else\n    s = \"closed\";\n  end\n  printf(\"%d %s\\n\", i, s);\nend",
        "safe": true
    },
    {
        "filename": "100 doors_643.txt",
        "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\n13 closed\n14 closed\n15 closed\n16 open\n17 closed\n18 closed\n19 closed\n20 closed\n21 closed\n22 closed\n23 closed\n24 closed\n25 open\n26 closed\n27 closed\n28 closed\n29 closed\n30 closed\n31 closed\n32 closed\n33 closed\n34 closed\n35 closed\n36 open\n37 closed\n38 closed\n39 closed\n40 closed\n41 closed\n42 closed\n43 closed\n44 closed\n45 closed\n46 closed\n47 closed\n48 closed\n49 open\n50 closed\n51 closed\n52 closed\n53 closed\n54 closed\n55 closed\n56 closed\n57 closed\n58 closed\n59 closed\n60 closed\n61 closed\n62 closed\n63 closed\n64 open\n65 closed\n66 closed\n67 closed\n68 closed\n69 closed\n70 closed\n71 closed\n72 closed\n73 closed\n74 closed\n75 closed\n76 closed\n77 closed\n78 closed\n79 closed\n80 closed\n81 open\n82 closed\n83 closed\n84 closed\n85 closed\n86 closed\n87 closed\n88 closed\n89 closed\n90 closed\n91 closed\n92 closed\n93 closed\n94 closed\n95 closed\n96 closed\n97 closed\n98 closed\n99 closed\n100 open\n",
        "safe": true
    },
    {
        "filename": "100 doors_644.txt",
        "content": "$ include \"seed7_05.s7i\";\n \nconst proc: main is func\n  local\n    var array boolean: doorOpen is 100 times FALSE;\n    var integer: pass is 0;\n    var integer: index is 0;\n    var array[boolean] string: closedOrOpen is [boolean] (\"closed\", \"open\");\n  begin\n    for pass range 1 to 100 do\n      for key index range doorOpen do\n        if index rem pass = 0 then\n          doorOpen[index]\u00a0:= not doorOpen[index];\n        end if;\n      end for;\n    end for;\n    for key index range doorOpen do\n      write(index lpad 3 <& \" is \" <& closedOrOpen[doorOpen[index]] rpad 7);\n      if index rem 5 = 0 then\n        writeln;\n      end if;\n    end for;\n  end func;",
        "safe": true
    },
    {
        "filename": "100 doors_645.txt",
        "content": "$ include \"seed7_05.s7i\";\n\nconst proc: main is func\n  local\n    var integer: index is 0;\n    var integer: number is 0;\n    var array[boolean] string: closedOrOpen is [boolean] (\"closed\", \"open\");\n  begin\n    for index range 1 to 100 do\n      number\u00a0:= sqrt(index);\n      write(index lpad 3 <& \" is \" <& closedOrOpen[number**2 = index] rpad 7);\n      if index rem 5 = 0 then\n        writeln;\n      end if;\n    end for;\n  end func;",
        "safe": true
    },
    {
        "filename": "100 doors_646.txt",
        "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 \n 11 is closed  12 is closed  13 is closed  14 is closed  15 is closed \n 16 is open    17 is closed  18 is closed  19 is closed  20 is closed \n 21 is closed  22 is closed  23 is closed  24 is closed  25 is open   \n 26 is closed  27 is closed  28 is closed  29 is closed  30 is closed \n 31 is closed  32 is closed  33 is closed  34 is closed  35 is closed \n 36 is open    37 is closed  38 is closed  39 is closed  40 is closed \n 41 is closed  42 is closed  43 is closed  44 is closed  45 is closed \n 46 is closed  47 is closed  48 is closed  49 is open    50 is closed \n 51 is closed  52 is closed  53 is closed  54 is closed  55 is closed \n 56 is closed  57 is closed  58 is closed  59 is closed  60 is closed \n 61 is closed  62 is closed  63 is closed  64 is open    65 is closed \n 66 is closed  67 is closed  68 is closed  69 is closed  70 is closed \n 71 is closed  72 is closed  73 is closed  74 is closed  75 is closed \n 76 is closed  77 is closed  78 is closed  79 is closed  80 is closed \n 81 is open    82 is closed  83 is closed  84 is closed  85 is closed \n 86 is closed  87 is closed  88 is closed  89 is closed  90 is closed \n 91 is closed  92 is closed  93 is closed  94 is closed  95 is closed \n 96 is closed  97 is closed  98 is closed  99 is closed 100 is open   \n",
        "safe": true
    },
    {
        "filename": "100 doors_647.txt",
        "content": "put false repeated 100 times as a list into Doors100\n\nrepeat 1 to 100\n\tset step to it\n\trepeat step to 100 by step \n\t\tset newValue to not item it of Doors100\n\t\tset item it of Doors100 to newValue\n\tend repeat\nend repeat\n\nput the counter for each item of Doors100 which is true",
        "safe": true
    },
    {
        "filename": "100 doors_648.txt",
        "content": "(1,4,9,16,25,36,49,64,81,100)",
        "safe": true
    },
    {
        "filename": "100 doors_649.txt",
        "content": "import <Utilities/Sequence.sl>;\n\nmain:=\n\tlet\n\t\tdoors\u00a0:= flipDoors(duplicate(false, 100), 1);\n\t\topen[i]\u00a0:= i when doors[i];\n\tin\n\t\topen;\n\t\nflipDoors(doors(1), count)\u00a0:=\n\tlet\n\t\tnewDoors[i]\u00a0:= not doors[i] when i mod count = 0 else doors[i];\n\tin\n\t\tdoors when count >= 100 else flipDoors(newDoors, count + 1);",
        "safe": true
    },
    {
        "filename": "100 doors_65.txt",
        "content": "Loop, 100\n  Door%A_Index% := \"closed\"\n\nLoop, 100 {\n  x := A_Index, y := A_Index\n  While (x <= 100)\n  {\n    CurrentDoor := Door%x%\n    If CurrentDoor contains closed\n    {\n      Door%x% := \"open\"\n      x += y\n    }\n    else if CurrentDoor contains open\n    {\n      Door%x% := \"closed\"\n      x += y\n    }\n  }\n}\n\nLoop, 100 {\n   CurrentDoor := Door%A_Index%\n   If CurrentDoor contains open\n      Res .= \"Door \" A_Index \" is open`n\"\n}\nMsgBox % Res\n",
        "safe": true
    },
    {
        "filename": "100 doors_650.txt",
        "content": "main\u00a0:= flipDoors([1], 2);\n\nflipDoors(openDoors(1), i)\u00a0:=\n\topenDoors when i * i >= 100 else flipDoors(openDoors ++ [i * i], i + 1);",
        "safe": true
    },
    {
        "filename": "100 doors_651.txt",
        "content": "program hundred_doors;\n\nconst toggle\u00a0:= {['open', 'closed'], ['closed', 'open']};\n\ndoorStates\u00a0:= ['closed'] * 100;\n\n(for interval in [1..100])\n  doorStates\u00a0:= [if i mod interval = 0 then\n                    toggle(prevState) else\n                    prevState end:\n                 prevState = doorStates(i)];\nend;\n\n(for finalState = doorStates(i))\n  print('door', i, 'is', finalState);\nend;\n\nend program;",
        "safe": true
    },
    {
        "filename": "100 doors_652.txt",
        "content": "program hundred_doors;\n\ndoorStates\u00a0:= (+/ [['closed'] * oddNum with 'open': oddNum in [1,3..17]]);\n\n(for finalState = doorStates(i))\n  print('door', i, 'is', finalState);\nend;\n\nend program;",
        "safe": true
    },
    {
        "filename": "100 doors_653.txt",
        "content": "!%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n!         I n i t i a l i z a t i o n\n!%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\ndoors% = 100\n\ndim doorArray?(doors%)\n\n!%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n!         M a i n   L o g i c   A r e a\n!%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n// Initialize Array\nfor index% = 1 to doors%\n  doorArray?(index%) = false\nnext index%\n\n// Execute routine\ntoggle_doors\n\n// Print results\nfor index% = 1 to doors%\n  if doorArray?(index%) = true then print index%, ' is open'\nnext index%\n\n\nstop\n\n\n!%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n!         R o u t i n e s\n!%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nroutine toggle_doors\n  for index_outer% = 1 to doors%\n    for index_inner% = 1 to doors%\n      if mod(index_inner%, index_outer%) = 0 then\n        doorArray?(index_inner%) = not doorArray?(index_inner%) \n      end if\n    next index_inner%\n  next index_outer%\nend routine\n\n\nend",
        "safe": true
    },
    {
        "filename": "100 doors_654.txt",
        "content": "var doors = []\n\n{ |pass|\n    { |i|\n        if (pass `divides` i) {\n            doors[i]\u00a0:= false -> not!\n        }\n    } << 1..100\n} << 1..100\n\n{ |i|\n    say (\"Door %3d is %s\"\u00a0% (i, doors[i]\u00a0? 'open'\u00a0: 'closed'))\n} << 1..100",
        "safe": true
    },
    {
        "filename": "100 doors_655.txt",
        "content": "{ |i|\n    \"Door\u00a0%3d is\u00a0%s\\n\".printf(i, <closed open>[i.is_sqr])\n} << 1..100",
        "safe": true
    },
    {
        "filename": "100 doors_656.txt",
        "content": "BEGIN\n    INTEGER LIMIT = 100, door, stride;\n    BOOLEAN ARRAY DOORS(1:LIMIT);\n    TEXT intro;\n\n    FOR stride\u00a0:= 1 STEP 1 UNTIL LIMIT DO\n        FOR door\u00a0:= stride STEP stride UNTIL LIMIT DO\n            DOORS(door)\u00a0:= NOT DOORS(door);\n\n    intro\u00a0:- \"All doors closed but \";\n    FOR door\u00a0:= 1 STEP 1 UNTIL LIMIT DO\n        IF DOORS(door) THEN BEGIN\n            OUTTEXT(intro); OUTINT(door, 0); intro\u00a0:- \", \"\n        END;\n    OUTIMAGE\nEND.",
        "safe": true
    },
    {
        "filename": "100 doors_657.txt",
        "content": "All doors closed but 1, 4, 9, 16, 25, 36, 49, 64, 81, 100",
        "safe": true
    },
    {
        "filename": "100 doors_658.txt",
        "content": "define: #a -> (Array newSize: 100).\na infect: [| :_ | False].\n\na keysDo: [| :pass |\n  pass to: a indexLast by: pass do: [| :door |\n    a at: door infect: #not `er]].\n\na keysAndValuesDo: [| :door :isOpen |\n  inform: 'door #'\u00a0; door\u00a0; ' is '\u00a0; (isOpen ifTrue: ['open'] ifFalse: ['closed'])].",
        "safe": true
    },
    {
        "filename": "100 doors_659.txt",
        "content": "define: #a -> (Array newSize: 100).\na infect: [| :_ | False].\n\n0 below: 10 do: [| :door | a at: door squared put: True].\na keysAndValuesDo: [| :door :isOpen |\n  inform: 'door #'\u00a0; door\u00a0; ' is '\u00a0; (isOpen ifTrue: ['open'] ifFalse: ['closed'])].",
        "safe": true
    },
    {
        "filename": "100 doors_66.txt",
        "content": "increment := 3, square := 1 \nLoop, 100 \n    If (A_Index = square) \n        outstring .= \"`nDoor \" A_Index \" is open\" \n        ,square += increment, increment += 2 \nMsgBox,, Succesfull, % SubStr(outstring, 2)\n",
        "safe": true
    },
    {
        "filename": "100 doors_660.txt",
        "content": "|a|\na\u00a0:= Array new: 100 .\n1 to: 100 do: [ :i | a at: i put: false ].\n\n1 to: 100 do: [ :pass |\n  pass to: 100 by: pass do: [ :door |\n    a at: door put: (a at: door) not .\n  ]\n].\n\n\"output\"\n1 to: 100 do: [ :door |\n   ( 'door #%1 is %2'\u00a0%\n     { door . (a at: door) ifTrue: [ 'open' ] ifFalse: [ 'closed' ] } ) displayNl\n]",
        "safe": true
    },
    {
        "filename": "100 doors_661.txt",
        "content": "|a|\na\u00a0:= (1 to: 100) collect: [ :x | false ].\n1 to: 10 do: [ :i | a at: (i squared) put: true ].\n1 to: 100 do: [ :i |\n   ( 'door #%1 is %2'\u00a0% { i . \n           (a at: i) ifTrue: [ 'open' ] \n                     ifFalse: [ 'closed' ] }\n   ) displayNl\n]",
        "safe": true
    },
    {
        "filename": "100 doors_662.txt",
        "content": "| m w h smh smw delay closedDoor border subMorphList |\n\nclosedDoor\u00a0:= Color black.\nborder\u00a0:= Color veryLightGray.\ndelay\u00a0:= Delay forMilliseconds: 50.\nw\u00a0:= World bounds corner x.\nh\u00a0:= (World bounds corner y) / 2.\nsmw\u00a0:= w/100.\nsmh\u00a0:= h/2.\n\nm\u00a0:= BorderedMorph new position: 0@h.\nm height: smh; width: w; borderColor: border.\nm color: Color veryLightGray.\n\n1 to: 100 do: [ :pos || sm |\n\tsm\u00a0:= BorderedMorph new height: smh\u00a0; width: smw\u00a0; \n\t\tborderColor: border; color: closedDoor; \n\t\tposition: (smw*pos)@h.\n\tm addMorph: sm asElementNumber: pos].\n\nm openInWorld.\ndelay wait.\nsubMorphList\u00a0:= m submorphs.\n\"display every step\"\n[1 to: 100 do: [ :step |\n\tstep to: 100 by: step do: [ :pos | | subMorph |\n\t\tsubMorph\u00a0:= subMorphList at: pos.\n\t\tsubMorph color: subMorph color negated.\n\t\tdelay wait]]] fork.",
        "safe": true
    },
    {
        "filename": "100 doors_663.txt",
        "content": "x=1!y=3!z=0\nPRINT \"Open doors: \";x;\" \";\nDO\n    z=x+y\n    PRINT z;\" \";\n    x=z\n    y=y+2\nUNTIL z>=100\nEND",
        "safe": true
    },
    {
        "filename": "100 doors_664.txt",
        "content": "\t\tDEFINE('PASS(A,I),O')\t\t:(PASS.END)\nPASS\t\tO = 0\nPASS.LOOP\tO = O + I\n\t\tEQ(A<O>,1)\t\t\t:S(PASS.1)F(PASS.0)\nPASS.0\t\tA<O> = 1\t\t\t:S(PASS.LOOP)F(RETURN)\nPASS.1\t\tA<O> = 0\t\t\t:S(PASS.LOOP)F(RETURN)\nPASS.END\n \nMAIN\t\tD = ARRAY(100,0)\n\t\tI = 0\n \nMAIN.LOOP\tI = LE(I,100) I + 1\t\t:F(OUTPUT)\n\t\tPASS(D,I)\t\t\t:(MAIN.LOOP)\n \nOUTPUT\t\tI = 1\u00a0; OPEN = 'Opened doors are: '\nOUTPUT.LOOP\tOPEN = OPEN EQ(D<I>,1) \" \" I\n\t\tI = LE(I,100) I + 1\t\t:S(OUTPUT.LOOP)F(OUTPUT.WRITE)\nOUTPUT.WRITE\tOUTPUT = OPEN\n\nEND",
        "safe": true
    },
    {
        "filename": "100 doors_665.txt",
        "content": "$ snobol4 100doors.sno \nThe Macro Implementation of SNOBOL4 in C (CSNOBOL4) Version 1.3+\n    by Philip L. Budne, January 23, 2011\nSNOBOL4 (Version 3.11, May 19, 1975)\n    Bell Telephone Laboratories, Incorporated\n\nNo errors detected in source program\n\nOpened doors are:  1 4 9 16 25 36 49 64 81 100\nNormal termination at level 0\n100doors.sno:18: Last statement executed was 19\n",
        "safe": true
    },
    {
        "filename": "100 doors_666.txt",
        "content": "MAIN\t\tD = ARRAY(100,0)\n\t\tI = 1\n\nMAIN.LOOP\tLE(I, 10)\t\t\t:F(OUTPUT)\n\t\tD<I ** 2> = 1\t\t\n\t\tI = I + 1\t\t\t:(MAIN.LOOP)\n\nOUTPUT\t\tI = 1\u00a0; O = 'Opened doors are: '\nOUTPUT.LOOP\tO = O EQ(D<I>,1) \" \" I\n\t\tI = LE(I,100) I + 1\t\t:S(OUTPUT.LOOP)F(OUTPUT.WRITE)\nOUTPUT.WRITE\tOUTPUT = O\nEND",
        "safe": true
    },
    {
        "filename": "100 doors_667.txt",
        "content": "#!/usr/local/bin/spar\npragma annotate( summary, \"doors\" )\n       @( description, \"Problem: You have 100 doors in a row that are all initially closed. You\" )\n       @( description, \"make 100 passes by the doors. The first time through, you visit every door\" )\n       @( description, \"and toggle the door (if the door is closed, you open it; if it is open, you\" )\n       @( description, \"close it). The second time you only visit every 2nd door (door #2, #4, #6,\" )\n       @( description, \"...). The third time, every 3rd door (door #3, #6, #9, ...), etc, until you\" )\n       @( description, \"only visit the 100th door.\" )\n       @( description, \"Question: What state are the doors in after the last pass? Which are open,\" )\n       @( description, \"which are closed?\" )\n       @( see_also, \"http://rosettacode.org/wiki/100_doors\" )\n       @( author, \"Ken O. Burtch\" );\npragma license( unrestricted );\n\npragma restriction( no_external_commands );\n\nprocedure Doors is\n   type Door_State is (Closed, Open);\n   type Door_List is array(1..100) of Door_State;\n   The_Doors\u00a0: Door_List;\nbegin\n   for I in 1..100 loop\n      The_Doors(I)\u00a0:= Closed;\n   end loop;\n   for I in 1..100 loop\n      for J in arrays.first(The_Doors)..arrays.last(The_Doors) loop\n         if J mod I = 0 then\n            if The_Doors(J) = Closed then\n                The_Doors(J)\u00a0:= Open;\n            else\n               The_Doors(J)\u00a0:= Closed;\n            end if;\n         end if;\n      end loop;\n   end loop;\n   for I in arrays.first(The_Doors)..arrays.last(The_Doors) loop\n      put (I) @ (\" is \") @ (The_Doors(I));\n      new_line;\n   end loop;\nend Doors;",
        "safe": true
    },
    {
        "filename": "100 doors_668.txt",
        "content": "/* declare the variables */\nvar isOpen = {};\nvar pass, door;\n\n/* initialize the doors */\nfor door = 0; door < 100; door++ {\n\tisOpen[door] = true;\n}\n\n/* do the 99 remaining passes */\nfor pass = 1; pass < 100; ++pass {\n\tfor door = pass; door < 100; door += pass+1 {\n  \t\tisOpen[door] = !isOpen[door];\n\t}\n}\n\n/* print the results */\nvar states = { true: \"open\", false: \"closed\" };\nfor door = 0; door < 100; door++ {\n\tprintf(\"Door #%d is %s.\\n\", door+1, states[isOpen[door]]);\n}",
        "safe": true
    },
    {
        "filename": "100 doors_669.txt",
        "content": "/* declare the variables */\nvar door_sqrt = 1;\nvar door;\n\n/* print the perfect square doors as open */\nfor door = 0; door < 100; door++ {\n\tif (door_sqrt*door_sqrt == door+1) {\n\t\tprintf(\"Door #%d is open.\\n\", door+1);\n\t\tdoor_sqrt ++;\n\t} else {\n\t\tprintf(\"Door #%d is closed.\\n\", door+1);\n\t}\n}",
        "safe": true
    },
    {
        "filename": "100 doors_67.txt",
        "content": "While (Door := A_Index ** 2) <= 100\n   Result .= \"Door \" Door \" is open`n\"\nMsgBox, %Result%\n",
        "safe": true
    },
    {
        "filename": "100 doors_670.txt",
        "content": "con\n  _clkmode = xtal1+pll16x\n  _clkfreq = 80_000_000\n\nobj\n  ser\u00a0: \"FullDuplexSerial.spin\"\n\npub init\n  ser.start(31, 30, 0, 115200)\n\n  doors\n\n  waitcnt(_clkfreq + cnt)\n  ser.stop\n  cogstop(0)\n\nvar\n\n  byte door[101] ' waste one byte by using only door[1..100]\n\npri doors | i,j\n\n  repeat i from 1 to 100\n    repeat j from i to 100 step i\n      not door[j]\n\n  ser.str(string(\"Open doors: \"))\n\n  repeat i from 1 to 100\n    if door[i]\n      ser.dec(i)\n      ser.tx(32)\n\n  ser.str(string(13,10))",
        "safe": true
    },
    {
        "filename": "100 doors_671.txt",
        "content": "Open doors: 1 4 9 16 25 36 49 64 81 100 \n",
        "safe": true
    },
    {
        "filename": "100 doors_672.txt",
        "content": "DECLARE\t@sqr int,\n\t\t@i int,\n\t\t@door int;\n\t\t\nSELECT @sqr =1,\n\t@i = 3,\n\t@door = 1;\t\n\t\t\t\t\nWHILE(@door <=100)\nBEGIN\n\tIF(@door = @sqr)\n\tBEGIN\n\t\tPRINT 'Door ' + RTRIM(CAST(@door as char)) + ' is open.';\n\t\tSET @sqr= @sqr+@i;\n\t\tSET @i=@i+2;\n\tEND\n\tELSE\n\tBEGIN\n\t\tPRINT 'Door ' + RTRIM(CONVERT(char,@door)) + ' is closed.';\n\tEND\nSET @door = @door + 1\nEND",
        "safe": true
    },
    {
        "filename": "100 doors_673.txt",
        "content": "with numbers as (\n    select generate_series(1, 100) as n\n),\npasses as (\n    select passes.n pass, doors.n door \n    from numbers doors\n    cross join numbers passes \n    where doors.n\u00a0% passes.n = 0  -- modulo\n),\ncounting as (\n    select door, count(pass) pass_number \n    from passes\n    group by door\n) \nselect door from counting\nwhere pass_number\u00a0% 2 = 1\norder by door",
        "safe": true
    },
    {
        "filename": "100 doors_674.txt",
        "content": "with numbers as (\n    select rownum as n from dual connect by level <= 100\n),\npasses as (\n    select doors.n door, count(passes.n) pass_number\n    from numbers doors\n    cross join numbers passes \n    where MOD(doors.n, passes.n) = 0  -- modulo\n    group by doors.n\n)\nselect door from passes\nwhere MOD(pass_number, 2) = 1\norder by door",
        "safe": true
    },
    {
        "filename": "100 doors_675.txt",
        "content": "door|\n----+\n   1|\n   4|\n   9|\n   ...\n",
        "safe": true
    },
    {
        "filename": "100 doors_676.txt",
        "content": "--#SET TERMINATOR @\n\nSET SERVEROUTPUT ON @\n\nBEGIN\n DECLARE TYPE DOORS_ARRAY AS BOOLEAN ARRAY [100];\n DECLARE DOORS DOORS_ARRAY;\n DECLARE I SMALLINT;\n DECLARE J SMALLINT;\n DECLARE STATUS CHAR(10);\n DECLARE SIZE SMALLINT DEFAULT 100;\n\n -- Initializes the array, with all spaces (doors) as false (closed).\n SET I = 1;\n WHILE (I <= SIZE) DO\n  SET DOORS[I] = FALSE;\n  SET I = I + 1;\n END WHILE;\n\n -- Processes the doors.\n SET I = 1;\n WHILE (I <= SIZE) DO\n  SET J = 1;\n  WHILE (J <= SIZE) DO\n   IF (MOD(J, I) = 0) THEN\n    IF (DOORS[J] = TRUE) THEN\n     SET DOORS[J] = FALSE;\n    ELSE\n     SET DOORS[J] = TRUE;\n    END IF;\n   END IF;\n   SET J = J + 1;\n  END WHILE;\n  SET I = I + 1;\n END WHILE;\n\n -- Prints the final status o the doors.\n SET I = 1;\n WHILE (I <= SIZE) DO\n  SET STATUS = (CASE WHEN (DOORS[I] = TRUE) THEN 'OPEN' ELSE 'CLOSED' END);\n  CALL DBMS_OUTPUT.PUT_LINE('Door ' || I || ' is '|| STATUS);\n  SET I = I + 1;\n END WHILE;\nEND @",
        "safe": true
    },
    {
        "filename": "100 doors_677.txt",
        "content": "db2 -td@\ndb2 => BEGIN\n...\ndb2 (cont.) => END @\nDB20000I  The SQL command completed successfully.\n\nDoor 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",
        "safe": true
    },
    {
        "filename": "100 doors_678.txt",
        "content": "datatype Door = Closed | Opened\n\nfun toggle Closed = Opened\n  | toggle Opened = Closed\n\nfun pass (step, doors) = List.map (fn (index, door) => if (index mod step) = 0\n\t\t\t\t\t\t       then (index, toggle door)\n\t\t\t\t\t\t       else (index, door))\n\t\t\t\t  doors\n\n(* [1..n] *)\nfun runs n = List.tabulate (n, fn k => k+1)\n\nfun run n =\n    let\n\tval initialdoors = List.tabulate (n, fn i => (i+1, Closed))\n\tval counter = runs n\n    in\n\tfoldl pass initialdoors counter\n    end\n\nfun opened_doors n = List.mapPartial (fn (index, Closed) => NONE\n\t\t\t\t       | (index, Opened) => SOME (index))\n\t\t\t\t     (run n)",
        "safe": true
    },
    {
        "filename": "100 doors_679.txt",
        "content": "- opened_doors 100;\nval it = [1,4,9,16,25,36,49,64,81,100]\u00a0: int list\n",
        "safe": true
    },
    {
        "filename": "100 doors_68.txt",
        "content": "#include <array.au3>\n$doors = 100\n\n;door array, 0 = closed, 1 = open\nLocal $door[$doors +1]\n\nFor $ii = 1 To $doors\n\tFor $i = $ii To $doors Step $ii\n\t\t$door[$i] = Not $door[$i]\n\tnext\nNext\n\n;display to screen\nFor $i = 1 To $doors\n\tConsoleWrite (Number($door[$i])& \" \")\n\tIf Mod($i,10) = 0 Then ConsoleWrite(@CRLF)\nNext\n",
        "safe": true
    },
    {
        "filename": "100 doors_680.txt",
        "content": "clear\nset obs 100\ngen doors=0\ngen index=_n\nforvalues i=1/100 {\n\tquietly replace doors=!doors if mod(_n,`i')==0\n}\nlist index if doors, noobs noheader\n\n  +-------+\n  |     1 |\n  |     4 |\n  |     9 |\n  |    16 |\n  |    25 |\n  |-------|\n  |    36 |\n  |    49 |\n  |    64 |\n  |    81 |\n  |   100 |\n  +-------+",
        "safe": true
    },
    {
        "filename": "100 doors_681.txt",
        "content": "d \".\"\n#d\ni d\n#i\np \"door\" #i\n*p *p \".\"\ni d f \"oc\"\ni d #@f #*p\ni d .\\f \"o\" $ #i\ni i d\n#i +101 i \"\"\n#i\nd d \".\"\n#d +101 d \"\"\n#d",
        "safe": true
    },
    {
        "filename": "100 doors_682.txt",
        "content": "1\n4\n9\n16\n25\n36\n49\n64\n81\n100",
        "safe": true
    },
    {
        "filename": "100 doors_683.txt",
        "content": "(\nvar n = 100, doors = false\u00a0! n;\nvar pass = { |j| (0, j .. n-1).do { |i| doors[i] = doors[i].not } };\n(1..n-1).do(pass);\ndoors.selectIndices { |open| open }; // all are closed except [ 0, 1, 4, 9, 16, 25, 36, 49, 64, 81 ]\n)",
        "safe": true
    },
    {
        "filename": "100 doors_684.txt",
        "content": "/* declare enum to identify the state of a door */\nenum DoorState\u00a0: String {\n    case Opened = \"Opened\"\n    case Closed = \"Closed\"\n}\n\n/* declare list of doors state and initialize them */\nvar doorsStateList = [DoorState](count: 100, repeatedValue: DoorState.Closed)\n\n/* do the 100 passes */\nfor i in 1...100 {\n    /* map on a strideTo instance to only visit the needed doors on each iteration */\n    map(stride(from: i - 1, to: 100, by: i)) {\n        doorsStateList[$0] = doorsStateList[$0] == .Opened\u00a0? .Closed\u00a0: .Opened\n    }\n}\n\n/* print the results */\nfor (index, item) in enumerate(doorsStateList) {\n    println(\"Door \\(index+1) is \\(item.rawValue)\")\n}",
        "safe": true
    },
    {
        "filename": "100 doors_685.txt",
        "content": "/* declare enum to identify the state of a door */\nenum DoorState\u00a0: String {\n    case Opened = \"Opened\"\n    case Closed = \"Closed\"\n}\n\n/* declare list of doors state and initialize them */\nvar doorsStateList = [DoorState](count: 100, repeatedValue: DoorState.Closed)\n\n/* set i^2 doors to opened */\nvar i = 1\ndo {\n    doorsStateList[(i*i)-1] = DoorState.Opened\n    ++i\n} while (i*i) <= doorsStateList.count\n\n/* print the results */\nfor (index, item) in enumerate(doorsStateList) {\n    println(\"Door \\(index+1) is \\(item.rawValue)\")\n}",
        "safe": true
    },
    {
        "filename": "100 doors_686.txt",
        "content": "var arr: [Bool] = Array(1...100).map{ remquo(exp(log(Float($0))/2.0),1).0 == 0 }",
        "safe": true
    },
    {
        "filename": "100 doors_687.txt",
        "content": "source hundredDoors\n  @: [ 1..100 -> 0 ];\n  templates toggle\n    def jump: $;\n    $jump..100:$jump -> \\(\n      when <?($@hundredDoors($) <=0>)> do @hundredDoors($): 1;\n      otherwise @hundredDoors($): 0;\n    \\) -> !VOID\n  end toggle\n  1..100 -> toggle -> !VOID\n  $@ -> \\[i](<=1> ' $i;'\u00a0!\\)\u00a0!\nend hundredDoors\n\n$hundredDoors -> 'Open doors:$...;' -> !OUT::write",
        "safe": true
    },
    {
        "filename": "100 doors_688.txt",
        "content": "hundredDoors source\n  @ set [ 1..100 -> 0 ];\n  toggle templates\n    jump is $;\n    $jump..100:$jump -> templates\n      when <|?($@hundredDoors($) matches <|=0>)> do @hundredDoors($) set 1;\n      otherwise @hundredDoors($) set 0;\n    end -> !VOID\n  end toggle\n  1..100 -> toggle -> !VOID\n  $@(.. as i; -> if <|=1> -> ' $i;')\u00a0!\nend hundredDoors\n\n$hundredDoors -> 'Open doors:$...;'\u00a0!",
        "safe": true
    },
    {
        "filename": "100 doors_689.txt",
        "content": "Open doors: 1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100 doors_69.txt",
        "content": "BEGIN {\n  for(i=1; i <= 100; i++)\n  {\n    doors[i] = 0 # close the doors\n  }\n  for(i=1; i <= 100; i++)\n  {\n    for(j=i; j <= 100; j += i)\n    {\n      doors[j] = (doors[j]+1) % 2\n    }\n  }\n  for(i=1; i <= 100; i++)\n  {\n    print i, doors[i] ? \"open\" : \"close\"\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "100 doors_690.txt",
        "content": "package require Tcl 8.5\nset n 100\nset doors [concat - [lrepeat $n 0]]\nfor {set step 1} {$step <= $n} {incr step} {\n    for {set i $step} {$i <= $n} {incr i $step} {\n        lset doors $i [expr {\u00a0! [lindex $doors $i]}]\n    }\n}\nfor {set i 1} {$i <= $n} {incr i} {\n    puts [format \"door %d is %s\" $i [expr {[lindex $doors $i]\u00a0? \"open\"\u00a0: \"closed\"}]]\n}",
        "safe": true
    },
    {
        "filename": "100 doors_691.txt",
        "content": "package require Tcl 8.5\nset doors [lrepeat [expr {$n + 1}] closed]\nfor {set i 1} {$i <= sqrt($n)} {incr i} {\n    lset doors [expr {$i ** 2}] open\n}\nfor {set i 1} {$i <= $n} {incr i} {\n    puts [format \"door %d is %s\" $i [lindex $doors $i]]\n}",
        "safe": true
    },
    {
        "filename": "100 doors_692.txt",
        "content": "package require Tcl 8.5\npackage require Tk\n\narray set door_status {}\n\n# create the gui\nset doors [list x]\nfor {set i 0} {$i < 10} {incr i} {\n    for {set j 0} {$j < 10} {incr j} {\n        set k [expr {1 + $j + 10*$i}]\n        lappend doors [radiobutton .d_$k -text $k -variable door_status($k) \\\n                         -indicatoron no -offrelief flat -width 3 -value open]\n        grid [lindex $doors $k] -column $j -row $i\n    }\n}\n\n# create the controls\nbutton .start -command go -text Start\nlabel .i_label -text \" door:\"\nentry .i -textvariable i -width 4\nlabel .step_label -text \" step:\"\nentry .step -textvariable step -width 4\ngrid .start - .i_label - .i - .step_label - .step - -row $i\ngrid configure .start -sticky ew\ngrid configure .i_label .step_label -sticky e\ngrid configure .i .step -sticky w\n\nproc go {} {\n    global doors door_status i step\n\n    # initialize the door_status (all closed)\n    for {set d 1} {$d <= 100} {incr d} {\n        set door_status($d) closed\n    }\n    \n    # now, begin opening and closing\n    for {set step 1} {$step <= 100} {incr step} {\n        for {set i 1} {$i <= 100} {incr i} {\n            if {$i\u00a0% $step == 0} {\n                [lindex $doors $i] [expr {$door_status($i) eq \"open\"\u00a0? \"deselect\"\u00a0: \"select\"}]\n                update\n                after 50\n            }\n        }\n    }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_693.txt",
        "content": "seq(0,X,1,100\nFor(X,1,100\n0 or Ans-not(fPart(cumSum(1 or Ans)/A\nEnd\nPause Ans\n",
        "safe": true
    },
    {
        "filename": "100 doors_694.txt",
        "content": "Pause not(fPart(\u221a(seq(X,X,1,100\n",
        "safe": true
    },
    {
        "filename": "100 doors_695.txt",
        "content": "Define doors(fast) = Func\n  Local doors,i,j\n  seq(false,x,1,100)\u00a0? doors\n  If fast Then\n    For i,1,10,1\n      true\u00a0? doors[i^2]\n    EndFor\n  Else\n    For i,1,100,1\n      For j,i,100,i\n        not doors[j]\u00a0? doors[j]\n      EndFor\n    EndFor\n  EndIf\n  Return doors\nEndFunc",
        "safe": true
    },
    {
        "filename": "100 doors_696.txt",
        "content": "for(%steps = 1; %a <= 100; %a++)\n\tfor(%current = %steps; %current <= 100; %current += %steps)\n\t\t%door[%current] =\u00a0!%door[%current];\nfor(%a = 1; %a <= 100; %a++)\n\techo(\"Door #\" @ %a @ \" is\" SPC %door[%current]\u00a0? \"Open\"\u00a0: \"Closed\" @ \".\");",
        "safe": true
    },
    {
        "filename": "100 doors_697.txt",
        "content": "WITH    OneToTen (N)\nAS  (   SELECT  N\n        FROM (  VALUES (0), (1), (2), (3), (4), (5), (6), (7), (8), (9)\n                ) V(N)\n        )\n    ,   InitDoors (Num, IsOpen)\nAS  (   SELECT  1\n            +   1 * Units.N\n            +   10 * Tens.N As Num\n            ,   Convert(Bit, 0) As IsOpen\n        FROM    OneToTen As Units\n        CROSS JOIN  OneToTen As Tens\n        ) -- This part could be easier with a tally table or equivalent table-valued function\n    ,   States (NbStep, Num, IsOpen)\nAS  (   SELECT  0 As NbStep\n            ,   Num\n            ,   IsOpen\n        FROM    InitDoors As InitState\n        UNION ALL\n        SELECT  1 + NbStep\n            ,   Num\n            ,   CASE Num\u00a0% (1 + NbStep)\n                    WHEN 0 THEN ~IsOpen\n                    ELSE IsOpen\n                END\n        FROM    States\n        WHERE   NbStep < 100\n        )\nSELECT  Num As DoorNumber\n    ,   Concat( 'Door number ', Num, ' is '\n            ,   CASE IsOpen\n                    WHEN 1 THEN ' open'\n                    ELSE ' closed'\n                END ) As Result -- Concat needs SQL Server 2012\nFROM    States\nWHERE   NbStep = 100\nORDER By Num\n; -- Fortunately, maximum recursion is 100 in SQL Server.\n-- For more doors, the MAXRECURSION hint should be used.\n-- More doors would also need an InitDoors with more rows.",
        "safe": true
    },
    {
        "filename": "100 doors_698.txt",
        "content": "SET NOCOUNT ON;\n\n-- Doors can be open or closed.\nDECLARE @open CHAR(1) = 'O';\nDECLARE @closed CHAR(1) = 'C';\n\n-- There are 100 doors in a row that are all initially closed.\nDECLARE @doorsCount INT = 100;\nDECLARE @doors TABLE (doorKey INT PRIMARY KEY, doorState CHAR(1));\nWITH sample100 AS (\n    SELECT TOP(100) object_id\n    FROM sys.objects\n)\nINSERT @doors\n  SELECT ROW_NUMBER() OVER (ORDER BY A.object_id) AS doorKey,\n    @closed AS doorState\n  FROM sample100 AS A\n      CROSS JOIN sample100 AS B\n      CROSS JOIN sample100 AS C\n      CROSS JOIN sample100 AS D\n  ORDER BY 1\n  OFFSET 0 ROWS\n  FETCH NEXT @doorsCount ROWS ONLY;\n\n-- You make 100 passes by the doors, visiting every door and toggle the door (if\n-- the door is closed, open it; if it is open, close it), according to the rules\n-- of the task.\nDECLARE @pass INT = 1;\nWHILE @pass <= @doorsCount BEGIN\n  UPDATE @doors\n  SET doorState = CASE doorState WHEN @open THEN @closed ELSE @open END\n  WHERE doorKey >= @pass\n    AND doorKey\u00a0% @pass = 0;\n\n  SET @pass = @pass + 1;\nEND;\n\n-- Answer the question: what state are the doors in after the last pass?\n-- The answer as the query result is:\nSELECT doorKey, doorState FROM @doors;\n-- The answer as the console output is:\nDECLARE @log VARCHAR(max);\nDECLARE @doorKey INT = (SELECT MIN(doorKey) FROM @doors);\nWHILE @doorKey <= @doorsCount BEGIN\n  SET @log = (\n      SELECT TOP(1) CONCAT('Doors ', doorKey, ' are ',\n        CASE doorState WHEN @open THEN ' open' ELSE 'closed' END, '.')\n      FROM @doors\n      WHERE doorKey = @doorKey\n    );\n  RAISERROR (@log, 0, 1) WITH NOWAIT;\n\n  SET @doorKey = (SELECT MIN(doorKey) FROM @doors WHERE doorKey > @doorKey);\nEND;\n\n-- Which are open, which are closed?\n-- The answer as the query result is:\nSELECT doorKey, doorState FROM @doors WHERE doorState = @open;\nSELECT doorKey, doorState FROM @doors WHERE doorState = @closed;\n-- The answer as the console output is:\nSET @log = (\n  SELECT CONCAT('These are open doors: ',\n    STRING_AGG(CAST(doorKey AS VARCHAR(max)), ', '), '.')\n  FROM @doors\n  WHERE doorState = @open\n);\nRAISERROR (@log, 0, 1) WITH NOWAIT;\nSET @log = (\n  SELECT CONCAT('These are closed doors: ',\n    STRING_AGG(CAST(doorKey AS VARCHAR(max)), ', '), '.')\n  FROM @doors\n  WHERE doorState = @closed\n);\nRAISERROR (@log, 0, 1) WITH NOWAIT;\n\n-- Assert:\nDECLARE @expected TABLE (doorKey INT PRIMARY KEY);\nSET @doorKey = 1;\nWHILE @doorKey * @doorKey <= @doorsCount BEGIN\n  INSERT @expected VALUES (@doorKey * @doorKey);\n  SET @doorKey = @doorKey + 1;\nEND;\nIF NOT EXISTS (\n    SELECT doorKey FROM @doors WHERE doorState = @open\n    EXCEPT\n    SELECT doorKey FROM @expected\n  )\n  AND NOT EXISTS (\n    SELECT doorKey FROM @expected\n    EXCEPT\n    SELECT doorKey FROM @doors WHERE doorState = @open\n  )\n  PRINT 'The task is solved.';\nELSE\n  THROW 50000, 'These aren''t the doors you''re looking for.', 1;",
        "safe": true
    },
    {
        "filename": "100 doors_699.txt",
        "content": "#lang transd\n\nMainModule: {\n    doors: Vector<Bool>(100),\n    _start: (\u03bb \n        (for i in Seq(100) do\n            (for k in Seq(i 100 (+ i 1)) do\n                (set-el doors k (not (get doors k)))\n        ))\n\n        (for i in Seq(100) do\n            (if (get doors i) (textout (+ i 1) \" \"))\n    ))\n}",
        "safe": true
    },
    {
        "filename": "100 doors_7.txt",
        "content": "\n  \n    \n      \n        \n          \n            \n              n\n              \n                2\n              \n            \n            =\n            1\n            +\n            3\n            +\n            5\n            +\n            \u2026\n            +\n            (\n            2\n            n\n            \u2212\n            1\n            )\n          \n        \n      \n    \n    {\\displaystyle {\\displaystyle n^{2}=1+3+5+\\ldots +(2n-1)}}\n  \n.\n",
        "safe": true
    },
    {
        "filename": "100 doors_70.txt",
        "content": "BEGIN {\n  for(i=1; i <= 100; i++) {\n    doors[i] = 0 # close the doors\n  }\n  for(i=1; i <= 100; i++) {\n    if ( int(sqrt(i)) == sqrt(i) ) {\n      doors[i] = 1\n    }\n  }\n  for(i=1; i <= 100; i++)\n  {\n    print i, doors[i] ? \"open\" : \"close\"\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "100 doors_700.txt",
        "content": "1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100 doors_701.txt",
        "content": "! Optimized solution with True BASIC\n\nOPTION NOLET\nx = 1 \ny = 3 \nz = 0\nPRINT STR$(x) & \" Open\"\nDO UNTIL z >= 100\nz = x + y\nPRINT STR$(z) & \" Open\"\nx = z \ny = y + 2\nLOOP\n\nEND",
        "safe": true
    },
    {
        "filename": "100 doors_702.txt",
        "content": "// library: math: get: task: door: open: close100 <description></description> <version control></version control> <version>1.0.0.0.11</version> <version control></version control> (filenamemacro=getmaocl.s) [<Program>] [<Research>] [kn, ri, mo, 31-12-2012 22:03:16]\nPROC PROCMathGetTaskDoorOpenClose( INTEGER doorMaxI, INTEGER passMaxI )\n // e.g. PROC Main()\n // e.g.  PROCMathGetTaskDoorOpenClose( 100, 100 )\n // e.g. END\n // e.g.\n // e.g. <F12> Main()\n //\n // ===\n //\n // The output will be:\n //\n // door 1 is open\n // door 4 is open\n // door 9 is open\n // door 16 is open\n // door 25 is open\n // door 36 is open\n // door 49 is open\n // door 64 is open\n // door 81 is open\n // door 100 is open\n // all other doors are closed\n //\n // ===\n //\n INTEGER passMinI = 1\n INTEGER passI = 0\n //\n INTEGER doorminI = 1\n INTEGER doorI = 0\n //\n STRING s[255] = \"\"\n //\n INTEGER bufferI = 0\n //\n PushPosition()\n bufferI = CreateTempBuffer()\n PopPosition()\n //\n FOR doorI = doorMinI TO doorMaxI\n  //\n  SetGlobalInt( Format( \"doorsI\", doorI ), 0 )\n  //\n ENDFOR\n //\n FOR passI = passMinI TO passMaxI\n  //\n  doorI = passI - passI\n  //\n  REPEAT\n   //\n   doorI = doorI + passI\n   //\n   SetGlobalInt( Format( \"doorsI\", doorI ), NOT( GetGlobalInt( Format( \"doorsI\", doorI ) ) ) )\n   //\n  UNTIL ( doorI >= doorMaxI )\n  //\n ENDFOR\n //\n FOR doorI = doorMinI TO doorMaxI\n  //\n  IF ( GetGlobalInt( Format( \"doorsI\", doorI ) ) > 0 )\n   //\n   s = \"open\"\n   //\n   AddLine( Format( \"door\", \" \", doorI, \" \", \"is\", \" \", s ), bufferI )\n   //\n  ELSE\n   //\n   s = \"closed\"\n   //\n  ENDIF\n  //\n ENDFOR\n //\n AddLine( \"all other doors are closed\", bufferI )\n //\n GotoBufferId( bufferI )\n //\nEND\n\nPROC Main()\n PROCMathGetTaskDoorOpenClose( 100, 100 )\nEND",
        "safe": true
    },
    {
        "filename": "100 doors_703.txt",
        "content": "$$ MODE TUSCRIPT\nDICT doors create\nCOMPILE\nLOOP door=1,100\n LOOP pass=1,100\n SET go=MOD (door,pass)\n DICT doors lookup door,num,cnt,status\n   IF (num==0) THEN\n     SET status=\"open\"\n     DICT doors add  door,num,cnt,status\n   ELSE\n    IF (go==0) THEN\n       IF (status==\"closed\") THEN\n         SET status=\"open\"\n       ELSE\n         SET status=\"closed\"\n       ENDIF\n     DICT doors update door,num,cnt,status\n     ENDIF\n   ENDIF\n ENDLOOP\nENDLOOP\nENDCOMPILE\nDICT doors unload door,num,cnt,status",
        "safe": true
    },
    {
        "filename": "100 doors_704.txt",
        "content": " status       = *\n           1 = open\n           2 = closed\n           3 = closed\n           4 = open\n           5 = closed\n           6 = closed\n           7 = closed\n           8 = closed\n           9 = open\n          10 = closed\n          11 = closed\n          12 = closed\n          13 = closed\n          14 = closed\n          15 = closed\n          16 = open\n          17 = closed\n          18 = closed\n          19 = closed\n          20 = closed\n          21 = closed\n          22 = closed\n          23 = closed\n          24 = closed\n          25 = open\n          26 = closed\n          27 = closed\n          28 = closed\n          29 = closed\n          30 = closed\n          31 = closed\n          32 = closed\n          33 = closed\n          34 = closed\n          35 = closed\n          36 = open\n          37 = closed\n          38 = closed\n          39 = closed\n          40 = closed\n          41 = closed\n          42 = closed\n          43 = closed\n          44 = closed\n          45 = closed\n          46 = closed\n          47 = closed\n          48 = closed\n          49 = open\n          50 = closed\n          51 = closed\n          52 = closed\n          53 = closed\n          54 = closed\n          55 = closed\n          56 = closed\n          57 = closed\n          58 = closed\n          59 = closed\n          60 = closed\n          61 = closed\n          62 = closed\n          63 = closed\n          64 = open\n          65 = closed\n          66 = closed\n          67 = closed\n          68 = closed\n          69 = closed\n          70 = closed\n          71 = closed\n          72 = closed\n          73 = closed\n          74 = closed\n          75 = closed\n          76 = closed\n          77 = closed\n          78 = closed\n          79 = closed\n          80 = closed\n          81 = open\n          82 = closed\n          83 = closed\n          84 = closed\n          85 = closed\n          86 = closed\n          87 = closed\n          88 = closed\n          89 = closed\n          90 = closed\n          91 = closed\n          92 = closed\n          93 = closed\n          94 = closed\n          95 = closed\n          96 = closed\n          97 = closed\n          98 = closed\n          99 = closed\n         100 = open\n",
        "safe": true
    },
    {
        "filename": "100 doors_705.txt",
        "content": "interface Door {\n  id: number;\n  open: boolean;\n}\n\nfunction doors(): Door[] {\n  var Doors: Door[] = [];\n\n  for (let i = 1; i <= 100; i++) {\n    Doors.push({id: i, open: false});\n  }\n\n  for (let secuence of Doors) {\n    for (let door of Doors) {\n      if (door.id\u00a0% secuence.id == 0) {\n        door.open = !door.open;\n      }\n    }\n  }\n\n  return Doors.filter(a => a.open);\n}",
        "safe": true
    },
    {
        "filename": "100 doors_706.txt",
        "content": "(defun hyaku-mai-tobira ()\n  (let ((doors (vector 100)))\n    (each ((i (range 0 99)))\n      (each ((j (range i 99 (+ i 1))))\n        (flip [doors j])))\n    doors))\n\n(each ((counter (range 1))\n       (door (hyaku-mai-tobira)))\n  (put-line `door @counter is @(if door \"open\" \"closed\")`))",
        "safe": true
    },
    {
        "filename": "100 doors_707.txt",
        "content": "FOR p = 1 TO 100\n  FOR d = p TO 100 STEP p\n    @(d) = @(d) = 0\n  NEXT d\nNEXT p\n\nFOR d= 1 TO 100\n  IF @(d) PRINT \"Door \";d;\" is open\"\nNEXT d",
        "safe": true
    },
    {
        "filename": "100 doors_708.txt",
        "content": "\u25ff2/+=0\u229e\u25ff.+1\u21e1100\n         +1\u21e1100 # 1-100\n      \u229e\u25ff.       # Mod each with 1-100\n    =0          # Find where mod = 0, aka the divisors\n  /+            # Sum to get num of divisors\n\u25ff2              # Num divisors is odd\n",
        "safe": true
    },
    {
        "filename": "100 doors_709.txt",
        "content": "[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]",
        "safe": true
    },
    {
        "filename": "100 doors_71.txt",
        "content": "(open,closed,change,open?)\u00a0:= (true,false,not,test);\ndoors\u00a0:= bits(100,closed);\nfor i in 1..#doors repeat\n  for j in i..#doors by i repeat\n    doors.j\u00a0:= change doors.j\n[i for i in 1..#doors | open? doors.i]",
        "safe": true
    },
    {
        "filename": "100 doors_710.txt",
        "content": "entry LP_DO_IT\n\n    variables\n        string  V_DOORS\n        boolean V_DOOR_STATE\n        string  V_DOOR_STATE_S\n        numeric V_IDX\n        numeric V_TOTAL_DOORS\n        string  V_DOOR_STATE_LIST\n        numeric V_LOOP_COUNT\n    endvariables\n\n    V_TOTAL_DOORS = 100\n    putitem V_DOORS, V_TOTAL_DOORS, 0\n\n    V_DOORS = $replace (V_DOORS, 1, \"\u00b7;\", \"\u00b7;0\", -1)\n\n    putitem/id V_DOOR_STATE_LIST, \"1\", \"Open\"\n    putitem/id V_DOOR_STATE_LIST, \"0\", \"Close\"\n\n    V_LOOP_COUNT = 1\n    while (V_LOOP_COUNT <= V_TOTAL_DOORS)\n        V_IDX = 0\n        V_IDX = V_IDX + V_LOOP_COUNT\n\n        getitem V_DOOR_STATE, V_DOORS, V_IDX\n        while (V_IDX <= V_TOTAL_DOORS)\n\n            V_DOOR_STATE = !V_DOOR_STATE\n            getitem/id V_DOOR_STATE_S, V_DOOR_STATE_LIST, $number(V_DOOR_STATE)\n            putitem V_DOORS, V_IDX, V_DOOR_STATE\n\n            V_IDX = V_IDX + V_LOOP_COUNT\n            getitem V_DOOR_STATE, V_DOORS, V_IDX\n        endwhile\n\n        V_LOOP_COUNT = V_LOOP_COUNT + 1\n\n    endwhile\n\n    V_IDX = 1\n    getitem V_DOOR_STATE, V_DOORS, V_IDX\n    while (V_IDX <= V_TOTAL_DOORS)\n        getitem/id V_DOOR_STATE_S, V_DOOR_STATE_LIST, $number(V_DOOR_STATE)\n        if (V_DOOR_STATE)\n            putmess \"Door\u00a0%%V_IDX%%% is finally\u00a0%%V_DOOR_STATE_S%%%\"\n        endif\n\n        V_IDX = V_IDX + 1\n        getitem V_DOOR_STATE, V_DOORS, V_IDX\n    endwhile\n\nend\u00a0; LP_DO_IT",
        "safe": true
    },
    {
        "filename": "100 doors_711.txt",
        "content": "\n\nDoor 1 is finally Open\nDoor 4 is finally Open\nDoor 9 is finally Open\nDoor 16 is finally Open\nDoor 25 is finally Open\nDoor 36 is finally Open\nDoor 49 is finally Open\nDoor 64 is finally Open\nDoor 81 is finally Open\nDoor 100 is finally Open\n\n",
        "safe": true
    },
    {
        "filename": "100 doors_712.txt",
        "content": "hundredDoors\u00a0: [Boolean]\nhundredDoors =\n  toggleEachNth\u00a0: Nat -> [Boolean] -> [Boolean]\n  toggleEachNth n doors =\n    go counter = cases\n      [] -> []\n      (d +: ds) -> if counter == n\n        then (not d) +: go 1 ds\n        else d +: go (counter+1) ds\n\n    go 1 doors\n\n  foldr toggleEachNth (replicate 100 'false) (range 1 101)\n\nresults = filterMap (cases (open, ix) -> if open then Some (ix+1) else None)\n                    (indexed hundredDoors)",
        "safe": true
    },
    {
        "filename": "100 doors_713.txt",
        "content": "#! /bin/bash\n\ndeclare -a doors\nfor((i=1; i <= 100; i++)); do\n    doors[$i]=0\ndone\n\nfor((i=1; i <= 100; i++)); do\n    for((j=i; j <= 100; j += i)); do\n\techo $i $j\n\tdoors[$j]=$(( doors[j] ^ 1 ))\n    done\ndone\n\nfor((i=1; i <= 100; i++)); do\n    if [[ ${doors[$i]} -eq 0 ]]; then\n\top=\"closed\"\n    else\n\top=\"open\"\n    fi\n    echo $i $op\ndone",
        "safe": true
    },
    {
        "filename": "100 doors_714.txt",
        "content": "#!/bin/bash\n\nfor i in {1..100}; do\n  door[$i*$i]=1\n  [ -z ${door[$i]} ] && echo \"$i closed\" || echo \"$i open\"\ndone",
        "safe": true
    },
    {
        "filename": "100 doors_715.txt",
        "content": "#\n# 100 doors\n#\n\ndecl int i j\ndecl boolean<> doors\n\n# append 101 boolean values to doors stream\nfor (set i 0) (or (< i 100) (= i 100)) (inc i)\n        append false doors\nend for\n\n# loop through, opening and closing doors\nfor (set i 1) (or (< i 100) (= i 100)) (inc i)\n        for (set j i) (or (< j 100) (= j 100)) (inc j)\n                if (= (mod j i) 0)\n                        set doors<j> (not doors<j>)\n                end if\n        end for\nend for\n\n# loop through and output which doors are open\nfor (set i 1) (or (< i 100) (= i 100)) (inc i)\n        out \"Door \" i \": \" console\n        if doors<i>\n                out \"open\" endl console\n        else\n                out \"closed\" endl console\n        end if\nend if",
        "safe": true
    },
    {
        "filename": "100 doors_716.txt",
        "content": "#import std\n#import nat\n\ndoors = 0!* iota 100\n\npass(\"n\",\"d\") = remainder\\\"n\"?l(~&r,not ~&r)* num \"d\"\n\n#cast %nL\n\nmain = ~&rFlS num pass=>doors nrange(100,1)",
        "safe": true
    },
    {
        "filename": "100 doors_717.txt",
        "content": "#import nat\n\n#cast %nL\n\nmain = product*tiiXS iota10",
        "safe": true
    },
    {
        "filename": "100 doors_718.txt",
        "content": "<1,4,9,16,25,36,49,64,81>\n",
        "safe": true
    },
    {
        "filename": "100 doors_719.txt",
        "content": "\u00b7\u00b7\u00b7\nhttp://rosettacode.org/wiki/100_doors\n\u00b7\u00b7\u00b7\n\u25a0 HundredDoors \n  \u00a7 static\n    \u25b6 main\n    \u2022 args\u2982 String[]\n      open\u2982   boolean: true\n      closed\u2982 boolean: false\n      doors\u2982  boolean[1+100] \u00b7 all initially closed\n      \ud83d\udd01 pass from 1 to 100\n         \u2200 visited \u2208 pass\u2025100 by pass\n         \u00b7 toggle the visited doors\n           if the doors[visited] are closed\n              let the doors[visited] be open\n           else\n              let the doors[visited] be closed\n      for each door #n in doors\u2982 boolean\n        if the door is open\n           System.out.println \"Door #\u2e28n\u2e29 is open.\"",
        "safe": true
    },
    {
        "filename": "100 doors_72.txt",
        "content": "[i for i in 1..100 | perfectSquare? i] -- or\n[i^2 for i in 1..sqrt(100)::Integer]",
        "safe": true
    },
    {
        "filename": "100 doors_720.txt",
        "content": "int main() {\n\tbool doors_open[101];\n\tfor(int i = 1; i < doors_open.length; i++) {\n\t\tfor(int j = 1; i*j < doors_open.length; j++) {\n\t\t\tdoors_open[i*j] = !doors_open[i*j];\n\t\t}\n\t\tstdout.printf(\"%d: %s\\n\", i, (doors_open[i]\u00a0? \"open\"\u00a0: \"closed\"));\n\t}\n\treturn 0;\n}",
        "safe": true
    },
    {
        "filename": "100 doors_721.txt",
        "content": "1: open\n2: closed\n3: closed\n4: open\n5: closed\n6: closed\n7: closed\n8: closed\n9: open\n10: closed\n11: closed\n...",
        "safe": true
    },
    {
        "filename": "100 doors_722.txt",
        "content": "int main() {\n\tint i = 1;\n\twhile(i*i <= 100) {\n\t\tstdout.printf(\"${i*i} open\\n\");\n\t\ti++;\n\t}\n\treturn 0;\n}",
        "safe": true
    },
    {
        "filename": "100 doors_723.txt",
        "content": "1 open\n4 open\n9 open\n16 open\n25 open\n36 open\n49 open\n64 open\n81 open\n100 open",
        "safe": true
    },
    {
        "filename": "100 doors_724.txt",
        "content": "                           00000064  0000     1 n = 100\n                               0000  0000     2 .entry\tdoors, ^m<>\n                         26'AF   9F  0002     3 \tpushab\tb^arr\t\t\t\t; offset signed byte\n                    50   64 8F   9A  0005     4 \tmovzbl\t#n, r0\n                            50   DD  0009     5 \tpushl\tr0\t\t\t\t; (sp) -> .ascid arr\n                                     000B     6 10$:\n                       51   50   D0  000B     7 \tmovl\tr0, r1\t\t\t\t; step = start index\n                                     000E     8 20$:\n                  25'AF41   01   8C  000E     9 \txorb2\t#^a\"0\" \\^a\"1\", b^arr-1[r1]\t; \\ xor toggle \"1\"<->\"0\"\n             FFF5 51   50   6E   F1  0013    10 \tacbl\t(sp), r0, r1, 20$\t\t; limit, step, index\n                         EF 50   F5  0019    11 \tsobgtr\tr0, 10$\t\t\t\t; n..1\n                                     001C    12 \n                            5E   DD  001C    13 \tpushl\tsp\t\t\t\t; descriptor by reference\n              00000000'GF   01   FB  001E    14 \tcalls\t#1, g^lib$put_output\t\t; show result\n                                 04  0025    15 \tret\n                                     0026    16 \n30'30'30'30'30'30'30'30'30'30'30'30' 0026    17 arr:\t.byte\t^a\"0\"[n]\n30'30'30'30'30'30'30'30'30'30'30'30' 0032       \n30'30'30'30'30'30'30'30'30'30'30'30' 003E       \n30'30'30'30'30'30'30'30'30'30'30'30' 004A       \n30'30'30'30'30'30'30'30'30'30'30'30' 0056       \n30'30'30'30'30'30'30'30'30'30'30'30' 0062       \n30'30'30'30'30'30'30'30'30'30'30'30' 006E       \n30'30'30'30'30'30'30'30'30'30'30'30' 007A       \n                        30'30'30'30' 0086       \n                                     008A    18 .end\tdoors\n$ run doors\n1001000010000001000000001000000000010000000000001000000000000001000000000000000010000000000000000001",
        "safe": true
    },
    {
        "filename": "100 doors_725.txt",
        "content": "Sub Rosetta_100Doors()\nDim Door(100) As Boolean, i As Integer, j As Integer\nFor i = 1 To 100 Step 1\n    For j = i To 100 Step i\n        Door(j) = Not Door(j)\n    Next j\n    If Door(i) = True Then\n        Debug.Print \"Door \" & i & \" is Open\"\n    Else\n        Debug.Print \"Door \" & i & \" is Closed\"\n    End If\nNext i\nEnd Sub\n<!-- /lang -->\n\n*** USE THIS ONE, SEE COMMENTED LINES, DONT KNOW WHY EVERYBODY FOLLOWED OTHERS ANSWERS AND CODED THE PROBLEM DIFFERENTLY ***\n*** ALWAYS USE AND TEST A READABLE, EASY TO COMPREHEND CODING BEFORE 'OPTIMIZING' YOUR CODE AND TEST THE 'OPTIMIZED' CODE AGAINST THE 'READABLE' ONE.\nPanikkos Savvides.\n\n\nSub Rosetta_100Doors2()\nDim Door(100) As Boolean, i As Integer, j As Integer\nDim strAns As String\n' There are 100 doors in a row that are all initially closed.\n' You make 100 passes by the doors.\nFor j = 1 To 100\n    ' The first time through, visit every door and toggle the door\n    ' (if the door is closed, open it; if it is open, close it).\n    For i = 1 To 100 Step 1\n      Door(i) = Not Door(i)\n    Next i\n    ' The second time, only visit every 2nd door (door #2, #4, #6, ...), and toggle it.\n    For i = 2 To 100 Step 2\n      Door(i) = Not Door(i)\n    Next i\n    ' The third time, visit every 3rd door (door #3, #6, #9, ...), etc, until you only visit the 100th door.\n    For i = 3 To 100 Step 3\n      Door(i) = Not Door(i)\n    Next i\nNext j\n\nFor j = 1 To 100\n    If Door(j) = True Then\n        strAns = j & strAns & \", \"\n    End If\nNext j\n\nIf Right(strAns, 2) = \", \" Then strAns = Left(strAns, Len(strAns) - 2)\nIf Len(strAns) = 0 Then strAns = \"0\"\nDebug.Print \"Doors [\" & strAns & \"] are open, the rest are closed.\"\n' Doors [0] are open, the rest are closed., AKA ZERO DOORS OPEN\nEnd Sub",
        "safe": true
    },
    {
        "filename": "100 doors_726.txt",
        "content": "Dim doorIsOpen(100), pass, currentDoor, text\n\nFor currentDoor = 0 To 99\n\tdoorIsOpen(currentDoor) = False\nNext\n\nFor pass = 0 To 99\n\tFor currentDoor = pass To 99 Step pass + 1\n\t\tdoorIsOpen(currentDoor) = Not doorIsOpen(currentDoor)\n\tNext\nNext\n\nFor currentDoor = 0 To 99\n\ttext = \"Door #\" & currentDoor + 1 & \" is \"\n\tIf doorIsOpen(currentDoor) Then\n\t\ttext = text & \"open.\"\n\tElse\n\t\ttext = text & \"closed.\"\n\tEnd If\n\tWScript.Echo(text)\nNext",
        "safe": true
    },
    {
        "filename": "100 doors_727.txt",
        "content": "Buf_Switch(Buf_Free)\nIns_Char('-', COUNT, 100)                      // All doors closed\nfor (#1 = 1; #1 <= 100; #1++) {\n    for (#2 = #1; #2 <= 100; #2 += #1) {\n        Goto_Col(#2)\n        Ins_Char((Cur_Char^0x62), OVERWRITE)   // Toggle between '-' and 'O'\n    }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_728.txt",
        "content": "Buf_Switch(Buf_Free)\nIns_Char('-', COUNT, 100)\nfor (#1=1; #1 <= 10; #1++) {\n    Goto_Col(#1*#1)\n    Ins_Char('O', OVERWRITE)\n}",
        "safe": true
    },
    {
        "filename": "100 doors_729.txt",
        "content": "O--O----O------O--------O----------O------------O--------------O----------------O------------------O\n",
        "safe": true
    },
    {
        "filename": "100 doors_73.txt",
        "content": "main()\n{\n  auto doors[100]; /*\u00a0!= 0 means open */\n  auto pass, door;\n\n  door = 0;\n  while( door<100 ) doors[door++] = 0;\n\n  pass = 0;\n  while( pass<100 )\n  {\n    door = pass;\n    while( door<100 )\n    {\n      doors[door] = !doors[door];\n      door =+ pass+1;\n    }\n    ++pass;\n  }\n\n  door = 0;\n  while( door<100 )\n  {\n    printf(\"door #%d is %s.*n\", door+1, doors[door]\u00a0? \"open\"\u00a0: \"closed\");\n    ++door;\n  }\n\n  return(0);\n}",
        "safe": true
    },
    {
        "filename": "100 doors_730.txt",
        "content": "module main;\n  integer i;\n  \n  initial begin\n    $display(\"Las siguientes puertas est\u00e1n abiertas:\");\n    for (i=1; i<=10; i=i+1) if (i%i*i<11) $display(i*i);\n    $finish\u00a0;\n  end\nendmodule",
        "safe": true
    },
    {
        "filename": "100 doors_731.txt",
        "content": "library IEEE;\nuse IEEE.STD_LOGIC_1164.ALL;\n\nentity DOORS is\n\tport (CLK: in std_logic; OUTPUT: out std_logic_vector(1 to 100));\nend DOORS;\n\narchitecture Behavioral of DOORS is\nbegin\n\tprocess (CLK)\n\tvariable TEMP: std_logic_vector(1 to 100);\n\tbegin\n\t\t--setup closed doors\n\t\tTEMP\u00a0:= (others => '0');\n\t\t\n\t\t--looping through\n\t\tfor i in 1 to TEMP'length loop\n\t\t\tfor j in i to TEMP'length loop\n\t\t\t\tif (j mod i) = 0 then\n\t\t\t\t\tTEMP(j)\u00a0:= not TEMP(j);\n\t\t\t\tend if;\n\t\t\tend loop;\n\t\tend loop;\n\t\t\n\t\t--assign output\n\t\tOUTPUT <= TEMP;\n\tend process;\nend Behavioral;",
        "safe": true
    },
    {
        "filename": "100 doors_732.txt",
        "content": "LIBRARY ieee;\nUSE ieee.std_logic_1164.all;\n\n\nentity doors is\n  port (\n        clk  \u00a0: in std_logic;\n        reset\u00a0: in std_logic;\n        door \u00a0: buffer std_logic_vector(1 to 100)\n        );\nend entity doors;\n\n\narchitecture rtl of doors is\n  signal step\u00a0: integer range 1 to 101;\n  signal addr\u00a0: integer range 1 to 201;\nbegin\n  proc_step: process(clk, reset)\n  begin\n    if reset = '1' then\n      step  <= 1;\n      addr  <= 1;\n      door <= (others => '0');\n    elsif rising_edge(clk) then\n      if addr <= 100 then\n        door(addr) <= not door(addr);\n        addr <= addr + step;\n      elsif step <= 100 then\n        addr <= step + 1;\n        step <= step + 1;\n      end if;\n    end if;\n  end process;\nend;",
        "safe": true
    },
    {
        "filename": "100 doors_733.txt",
        "content": "Public Sub Doors100()\n  ' the state of a door is represented by the data type boolean (false = door closed, true = door opened)\n  Dim doorstate(1 To 100) As Boolean ' the doorstate()-array is initialized by VB with value 'false'\n  Dim i As Long, j As Long\n  \n  For i = 1 To 100\n      For j = i To 100 Step i\n          doorstate(j) = Not doorstate(j)\n      Next j\n  Next i\n  \n  Debug.Print \"The following doors are open:\"\n  For i = 1 To 100\n      ' print number if door is openend\n      If doorstate(i) Then Debug.Print CStr(i)\n  Next i\nEnd Sub",
        "safe": true
    },
    {
        "filename": "100 doors_734.txt",
        "content": "The following doors are open:\n1\n4\n9\n16\n25\n36\n49\n64\n81\n100\n",
        "safe": true
    },
    {
        "filename": "100 doors_735.txt",
        "content": "Module Module1\n\n   Sub Main()\n       Dim doors(100) As Boolean 'Door 1 is at index 0\n\n       For pass = 1 To 100\n           For door = pass - 1 To 99 Step pass\n               doors(door) = Not doors(door)\n           Next\n       Next\n\n       For door = 0 To 99\n           Console.WriteLine(\"Door # \" & (door + 1) & \" is \" & If(doors(door), \"Open\", \"Closed\"))\n       Next\n\n       Console.ReadLine()\n   End Sub\n\nEnd Module",
        "safe": true
    },
    {
        "filename": "100 doors_736.txt",
        "content": "Module Module1\n\n   Sub Main()\n       Dim doors(100) As Boolean 'Door 1 is at index 0\n\n       For i = 1 To 10\n           doors(i ^ 2 - 1) = True\n       Next\n\n       For door = 0 To 99\n           Console.WriteLine(\"Door # \" & (door + 1) & \" is \" & If(doors(door), \"Open\", \"Closed\"))\n       Next\n\n       Console.ReadLine()\n   End Sub\n\nEnd Module",
        "safe": true
    },
    {
        "filename": "100 doors_737.txt",
        "content": "const number_doors = 101\n\nfn main() {\n    mut closed_doors\u00a0:= []bool{len: number_doors, init: true} \n    for pass in 0..number_doors {\n        for door\u00a0:= 0; door < number_doors; door += pass + 1 {\n            closed_doors[door] = !closed_doors[door]\n        }\n    }\n    for pass in 1..number_doors {\n        if !closed_doors[pass] {\n            println('Door #$pass Open')\n        }\n    }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_738.txt",
        "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\n",
        "safe": true
    },
    {
        "filename": "100 doors_739.txt",
        "content": "const door_number = 100\n\nfn main(){\n    mut doors\u00a0:= []bool{ len: door_number, init: false } //true open false closed\n\n    mut door_nbr\u00a0:= 1\n    mut increment\u00a0:= 0\n\n    for current in 1..( door_number + 1) {\n        if current == door_nbr {\n            doors[current - 1] = true\n            increment++\n            door_nbr += 2 * increment + 1\n\t\t\tprint('O')\n\t\t} else {\n\t\t\tprint('=')\n\t\t}\n    }\n    println('')\n}",
        "safe": true
    },
    {
        "filename": "100 doors_74.txt",
        "content": "      * NB: the implementation is rather vanilla\n      * besides using the idiomatic buffer overrun.\n      * LOOP is what PERFORM in COBOL is, with defaults.\n      * MOVE in this language acts like OVE CORRESPONDING,\n      * which is actually good here.\n       IDENTIFICATION DIVISION.\n           PROGRAM-ID. ONE HUNDRED DOORS.\n       DATA DIVISION.\n       01 I PICTURE IS 9(3).\n       01 J LIKE I.\n       01 DOOR PICTURE IS 9 OCCURS 100 TIMES.\n       01 STOP LIKE DOOR.\n       PROCEDURE DIVISION.\n      * Initialise the data\n           MOVE HIGH-VALUES TO STOP\n           MOVE SPACES TO DOOR.\n      * Do the main algorithm\n           LOOP VARYING I UNTIL DOOR(I) = 9\n               LOOP VARYING J FROM I TO 100 BY I\n                   SUBTRACT DOOR (J) FROM 1 GIVING DOOR (J)\n               END\n           END.\n      * Print the results\n           LOOP VARYING I UNTIL DOOR(I) = 9\n               DISPLAY \"Door\" I \"is\" WITH NO ADVANCING\n               IF DOOR (I) = 1\n               THEN DISPLAY \"open\"\n               ELSE DISPLAY \"closed\".\n           END.\n",
        "safe": true
    },
    {
        "filename": "100 doors_740.txt",
        "content": "O==O====O======O========O==========O============O==============O================O==================O\n",
        "safe": true
    },
    {
        "filename": "100 doors_741.txt",
        "content": "fn main() {\n\tfor i in 1..11 {\n\t\tprint ( \" Door ${i*i} is open.\\n\" )\n\t}\n}",
        "safe": true
    },
    {
        "filename": "100 doors_742.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_743.txt",
        "content": "10 D=1\n20 :D)=0\n30 D=D+1\n40 #=100>D*20\n50 P=1\n60 D=P\n70 :D)=:D)=0\n80 D=D+P\n90 #=100>D*70\n100 P=P+1\n110 #=100>P*60\n120 D=1\n130 #=:D)*170\n140 D=D+1\n150 #=100>D*130\n160 #=999\n170\u00a0?=\"DOOR \";\n180\u00a0?=D\n190\u00a0?=\" IS OPEN\"\n200 #=!",
        "safe": true
    },
    {
        "filename": "100 doors_744.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_745.txt",
        "content": "def (doors n)\n  let door (table)\n    for step 1 (step <= n) ++step\n      for j 0 (j < n) (j <- j+step)\n        zap! not door.j\n\n    for j 0 (j < n) ++j\n      when door.j\n        pr j\n        pr \" \"",
        "safe": true
    },
    {
        "filename": "100 doors_746.txt",
        "content": "let a => import 'arrays';\nlet s => import 'stream';\nlet io => import 'io';\n\nlet toggle doors m =>\n\ta.stream doors\n\t-> s.enumerate\n\t-> s.map (@ s n => [+ (a.at n 0) 1; a.at n 1])\n\t-> s.map (@ s n => switch n {\n\t\t\t(@ s n => == (% (a.at n 0) m) 0) =>\u00a0! (a.at n 1);\n\t\t\ttrue => a.at n 1;\n\t\t})\n\t-> s.collect\n\t;\n\ns.range 100\n-> s.map false\n-> s.collect\u00a0: doors\n-> s.range 1 100\n-> s.reduce doors toggle\n-> a.stream\n-> s.map (@ s n => switch 0 {\n\t\tn => 'Open';\n\t\ttrue => 'Closed';\n\t} -- io.writeln io.stdout)\n-> s.drain\n;",
        "safe": true
    },
    {
        "filename": "100 doors_747.txt",
        "content": "; unoptimized\n+^[\n  @var doors []\n  \n  @for i rangei [1 100]\n    @for j rangei [i 100 i]\n     \u00a0:!@not `j doors\n  \n  @for i rangei [1 100]\n    @if `i doors\n      !console.log \"door {i} is open\"\n]\n; optimized, map square over 1 to 10\n!*^@sq @to 10",
        "safe": true
    },
    {
        "filename": "100 doors_748.txt",
        "content": "MOD Doors;\n\nIMP Agg.Table;\nIMP Std.String;\nIMP IO.Terminal USE Out;\n\nVAR door <- {}; EVERY door[1:to(100), \"closed\"];\n\nDEF toggle(num) door[num] <- door[num] = \"open\" => \"closed\" // \"open\";\n\nEVERY WITH pass <- 1:to(100), num <- pass:to(100, pass) DO toggle(num);\n\nOut:write('Doors {door @ String.T}.');\n\nEND Doors.",
        "safe": true
    },
    {
        "filename": "100 doors_749.txt",
        "content": "MOD Doors;\n\nIMP IO.Terminal USE Out;\n\nDEF open <- ALL 1:to(100) ^ 2 \\ $ <= 100;\nDEF closed <- ALL 1:to(100) \\ NOT $ IN open;\n\nOut:write('Doors {open} are open.\\n');\nOut:write('Doors {closed} are closed.\\n');\n\nEND Doors.",
        "safe": true
    },
    {
        "filename": "100 doors_75.txt",
        "content": "OPTION BASE 1\n\nDECLARE doors[100]\n\nFOR size = 1 TO 100\n    FOR pass = 0 TO 100 STEP size\n\tdoors[pass] = NOT(doors[pass])\n    NEXT\nNEXT\n\nFOR which = 1 TO 100\n    IF doors[which] THEN PRINT which\nNEXT\n",
        "safe": true
    },
    {
        "filename": "100 doors_750.txt",
        "content": "var doors = [true] * 100\nfor (i in 1..100) {\n    var j = i\n    while (j < 100) {\n        doors[j] = !doors[j]\n        j = j + i + 1\n    }\n}\n\nfor (i in 0...100) {\n    if (doors[i]) System.write(\"%(i + 1) \")\n}\nSystem.print()",
        "safe": true
    },
    {
        "filename": "100 doors_751.txt",
        "content": "var door = 1\nvar increment = 3\nwhile (door <= 100) {\n    System.write(\"%(door) \")\n    door = door + increment\n    increment = increment + 2\n}\nSystem.print()",
        "safe": true
    },
    {
        "filename": "100 doors_752.txt",
        "content": "1 4 9 16 25 36 49 64 81 100 \n",
        "safe": true
    },
    {
        "filename": "100 doors_753.txt",
        "content": "\t\t.NOLIST\n\n; The task can be completed in 48 and \"half\" steps:\n; On the first pass ALL doors are opened.\n; On the second pass every EVEN door is closed.\n; So, instead of all closed, the doors can initially be:\n; Every odd door open, every even door closed and start at pass 3.\n; On 51st and all the next passes, only one door is visited per pass:\n; On 51st pass door 51, on 52nd pass door 52 etc.\n; So, after pass 50, we can make \"half a pass\" starting with door 51\n; and toggling every door up to and including 100.\n; The code uses only volatile registers, so, no string (STOS etc) instructions.\n\n\t\tTITLE\t100 Doors\n\t\tPAGE\t, 132\n\t\t.686\n\t\t.MODEL\tFLAT\n\t\tOPTION\tCASEMAP:NONE\n\n\t\t.SFCOND\n\t\t.LIST\n\n; =============================================================================\n\n\t\t.DATA?\n\nDoors\t\tBYTE\t100 DUP (\u00a0? )\n\n; =============================================================================\n\n\t\t.CODE\n\nPass_Doors\tPROC\n\n\t\tMOV\tEDX, OFFSET Doors\t; Initialize all doors.\n\t\tMOV\tECX, SIZEOF Doors / SIZEOF DWORD\n\t\tMOV\tEAX, 01010101h\t\t; This does first and second pass.\n\nClose_Doors:\tMOV\t[ EDX ], EAX\n\t\tADD\tEDX, SIZEOF DWORD\n\t\tLOOP\tClose_Doors\n\n\t\tMOV\tECX, 2\t\t\t; Pass and step.\n\nPass_Loop:\tMOV\tEDX, OFFSET Doors\n\n\t\tASSUME\tEDX:PTR BYTE\n\nDoors_Loop:\tXOR\t[ EDX ], 1\t\t; Toggle this door.\n\t\tADD\tEDX, ECX               \u00a0; Advance.\n\t\tCMP\tEDX, OFFSET Doors[ SIZEOF Doors ]\n\n\t\tJB\tDoors_Loop\n\n\t\tINC\tECX\n\t\tCMP\tECX, SIZEOF Doors\n\n\t\tJB\tPass_Loop\n\n\t\tXOR\tDoors[ SIZEOF Doors -1 ], 1\u00a0; This is pass 100.\n\t\tRET\n\nPass_Doors\tENDP\n\n; =============================================================================\n\n\t\tEND",
        "safe": true
    },
    {
        "filename": "100 doors_754.txt",
        "content": "PROGRAM \"100doors\"\nVERSION \"0.0001\"\n\nIMPORT \"xma\"\nIMPORT \"xst\"\n\nDECLARE FUNCTION Entry()\n\nFUNCTION Entry()\n  maxpuertas = 100\n  cont = 0\n  DIM puertas[100]\n\n  FOR p = 1 TO maxpuertas\n    IF INT(SQRT(p)) = SQRT(p) THEN puertas[p] = 1\n  NEXT p\n\n  PRINT \"The doors are open: \";\n  FOR p = 1 TO maxpuertas\n    IF puertas[p] = 1 THEN\n       PRINT p; \" \";\n       INC cont\n    END IF\n  NEXT p\n\n  PRINT CHR$(10); \"Are \"; STR$(cont); \" open doors.\"\n\nEND FUNCTION\nEND PROGRAM",
        "safe": true
    },
    {
        "filename": "100 doors_755.txt",
        "content": "// True=Open; False=Closed\nDim doors(100) As Boolean // Booleans default to false\nFor j As Integer = 1 To 100\n  For i As Integer = 1 to 100\n    If i Mod j = 0 Then doors(i) = Not doors(i)\n  Next\nNext",
        "safe": true
    },
    {
        "filename": "100 doors_756.txt",
        "content": "include c:\\cxpl\\codes;          \\intrinsic 'code' declarations\nint     Door(100);              \\You have 100 doors in a row\ndefine  Open, Closed;\nint     D, Pass, Step;\n\n[for D:= 0 to 100-1 do          \\that are all initially closed\n        Door(D):= Closed;\n\nStep:= 1;                       \\The first time through, you visit every door\nfor Pass:= 1 to 100 do          \\You make 100 passes by the doors\n        [D:= Step-1;\n        repeat  \\if the door is closed, you open it; if it is open, you close it\n                if Door(D)=Closed then Door(D):= Open else Door(D):= Closed;\n                D:= D+Step;\n        until   D>=100;\n        Step:= Step+1;          \\The second time you only visit every 2nd door\n        ];                      \\The third time, every 3rd door\n                                \\until you only visit the 100th door\n\\What state are the doors in after the last pass?\nText(0, \"Open: \");              \\Which are open?\nfor D:= 0 to 100-1 do \n        if Door(D)=Open then [IntOut(0, D+1); ChOut(0,^ )];\nCrLf(0);\n\nText(0, \"Closed: \");            \\Which are closed?\nfor D:= 0 to 100-1 do \n        if Door(D)=Closed then [IntOut(0, D+1); ChOut(0,^ )];\nCrLf(0);\n\n\\Optimized: The only doors that remain open are those that are perfect squares\nText(0, \"Open: \");\nD:= 1;\nrepeat  IntOut(0, D*D); ChOut(0,^ );\n        D:= D+1;\nuntil   D*D>100;\nCrLf(0);\n]",
        "safe": true
    },
    {
        "filename": "100 doors_757.txt",
        "content": "<hallway>\n  <door number=\"1\">closed</door>\n  <door number=\"2\">closed</door>\n  <door number=\"3\">closed</door>\n  <door number=\"4\">closed</door>\n  ... etc ...\n  <door number=\"100\">closed</door>\n<hallway>",
        "safe": true
    },
    {
        "filename": "100 doors_758.txt",
        "content": "<xsl:stylesheet version=\"1.0\"\n  xmlns:xsl=\"http://www.w3.org/1999/XSL/Transform\"\n  xmlns:exsl=\"http://exslt.org/common\"\n  exclude-result-prefixes=\"xsl exsl\">\n<xsl:output method=\"xml\" indent=\"yes\" omit-xml-declaration=\"yes\"/>\n\n<xsl:template match=\"/*\">\n  <xsl:copy>\n    <xsl:apply-templates select=\"door\" />\n  </xsl:copy>\n</xsl:template>\n      \n<xsl:template match=\"door\">\n  <xsl:variable name=\"door-num\" select=\"@number\" />\n  <xsl:variable name=\"knocks\">\n    <xsl:for-each select=\"/*/door\">\n      <xsl:if test=\"$door-num mod position() = 0\">\n        <xsl:text>!</xsl:text>\n      </xsl:if>\n    </xsl:for-each>\n  </xsl:variable>\n  <door number=\"{$door-num}\">\n   <xsl:choose>\n     <xsl:when test=\"string-length($knocks) mod 2 = 1\">\n        <xsl:text>open</xsl:text>\n     </xsl:when>\n     <xsl:otherwise>\n        <xsl:text>closed</xsl:text>\n     </xsl:otherwise>\n   </xsl:choose> \n  </door>\n</xsl:template>\n      \n</xsl:stylesheet>",
        "safe": true
    },
    {
        "filename": "100 doors_759.txt",
        "content": "<xsl:stylesheet version=\"2.0\"\n  xmlns:xsl=\"http://www.w3.org/1999/XSL/Transform\">\n<xsl:output method=\"xml\" indent=\"yes\" omit-xml-declaration=\"yes\"/>\n\n<xsl:template match=\"/\">\n  <hallway>\n    <xsl:for-each select=\"1 to 100\">\n      <xsl:variable name=\"door-num\" select=\"position()\" />\n      <door number=\"{$door-num}\">\n        <xsl:value-of select=\"('closed','open')[\n\t    number( sum( for $pass in 1 to 100 return\n\t    number(($door-num mod $pass) = 0)) mod 2 = 1) + 1]\" />\n      </door>\n    </xsl:for-each>\n  </hallway>\n</xsl:template>\n      \n</xsl:stylesheet>",
        "safe": true
    },
    {
        "filename": "100 doors_76.txt",
        "content": "1\n4\n9\n16\n25\n36\n49\n64\n81\n100\n",
        "safe": true
    },
    {
        "filename": "100 doors_760.txt",
        "content": "n = 100\t// doors\nppa = 1\t// next open door\np2 = 1\n\nfor i = 1 to n\n\tprint \"Door \", i, \" is \";\n\tif i < p2 then\n\t\tprint \"closed.\"\n\telse\n\t\tppa = ppa + 1\n\t\tp2 = ppa^2\n\t\tprint \"OPEN.\"\n\tend if\nnext",
        "safe": true
    },
    {
        "filename": "100 doors_761.txt",
        "content": "for i = 1 to sqrt(100)\u00a0: print \"Door \", i**2, \" is open\"\u00a0: next",
        "safe": true
    },
    {
        "filename": "100 doors_762.txt",
        "content": "!yamlscript/v0\n\ndefn main():\n  open =:\n    reduce _ vec([true] * 100) (1 .. 100):\n      fn(doors i):\n        loop j i, doors doors:\n          if j < 100:\n            recur (j + i).++:\n              update-in doors [j]: \\(doors.$j.!)\n            else: doors\n  say: -\"Open doors after 100 passes:\\ \" +\n        (1 .. 100).map(\\(_.--:open && _))\n                  .filter(a).join(', ')",
        "safe": true
    },
    {
        "filename": "100 doors_763.txt",
        "content": "$ ys 100-doors.ys\nOpen doors after 100 passes: 1, 4, 9, 16, 25, 36, 49, 64, 81, 100\n",
        "safe": true
    },
    {
        "filename": "100 doors_764.txt",
        "content": "doors = array(0, 100);\nfor(i = 1; i <= 100; i++)\n    for(j = i; j <= 100; j += i)\n        doors(j) ~= 1;\nprint, where(doors);",
        "safe": true
    },
    {
        "filename": "100 doors_765.txt",
        "content": "doors = array(0, 100);\nfor(i = 1; i <= 100; i++)\n    doors(i::i) ~= 1;\nprint, where(doors);",
        "safe": true
    },
    {
        "filename": "100 doors_766.txt",
        "content": "print, indgen(1:long(sqrt(100)))^2",
        "safe": true
    },
    {
        "filename": "100 doors_767.txt",
        "content": "[1,4,9,16,25,36,49,64,81,100]\n",
        "safe": true
    },
    {
        "filename": "100 doors_768.txt",
        "content": "pub fn main() !void {\n    const stdout = @import(\"std\").io.getStdOut().writer();\n    \n    var doors = [_]bool{false} ** 101;\n    var pass: u8 = 1;\n    var door: u8 = undefined;\n    \n    while (pass <= 100)\u00a0: (pass += 1) {\n        door = pass;\n        while (door <= 100)\u00a0: (door += pass)\n            doors[door] = !doors[door];\n    }\n    \n    for (doors, 0..) |open, num|\n        if (open) \n            try stdout.print(\"Door {d} is open.\\n\", .{num});\n}",
        "safe": true
    },
    {
        "filename": "100 doors_769.txt",
        "content": "pub fn main() !void {\n    const stdout = @import(\"std\").io.getStdOut().writer();\n    \n    var square: u8 = 1;\n    var increment: u8 = 3;\n    var door: u8 = 1;\n    while (door <= 100)\u00a0: (door += 1) {\n        if (door == square) {\n            try stdout.print(\"Door {d} is open\\n\", .{door});\n            square += increment;\n            increment += 2;\n        }\n    }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_77.txt",
        "content": "const NUM_DOORS\u00a0:= 100\n\nfun main() {\n\t// All doors are closed by default (`false`)\n\tmut is_open\u00a0:= []bool{length = NUM_DOORS}\n\n\t// Make 100 passes by the doors\n\tfor pass\u00a0:= 0; pass < 100; pass += 1 {\n\t\t// Only visit every `pass + 1`th door\n\t\tfor door\u00a0:= pass; door < NUM_DOORS; door += pass + 1 {\n\t\t\tis_open[door] = not is_open[door]\n\t\t}\n\t}\n\n\t// Print the doors that are open\n\tfor i, open in is_open {\n\t\tif open {\n\t\t\tprintln(\"Door #${i + 1} is open.\")\n\t\t}\n\t}\n\n}",
        "safe": true
    },
    {
        "filename": "100 doors_770.txt",
        "content": "pub fn main() !void {\n    const stdout = @import(\"std\").io.getStdOut().writer();\n\n    var square: u8 = 1;\n    var increment: u8 = 3;\n    for (1..101) |door| {\n        if (door == square) {\n            try stdout.print(\"Door {d} is open\\n\", .{door});\n            square += increment;\n            increment += 2;\n        }\n    }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_771.txt",
        "content": "pub fn main() !void {\n    const stdout = @import(\"std\").io.getStdOut().writer();\n\n    var door: u8 = 1;\n    while (door * door <= 100)\u00a0: (door += 1) {\n        try stdout.print(\"Door {d} is open\\n\", .{door * door});\n    }\n}",
        "safe": true
    },
    {
        "filename": "100 doors_772.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100 doors_773.txt",
        "content": "doors:=List.createLong(100,False);\t// list of 100 Falses\nforeach n,m in (100,[n..99,n+1]){ doors[m]=(not doors[m]); } //foreach{ foreach{} }\ndoors.filterNs().apply('+(1)).println();",
        "safe": true
    },
    {
        "filename": "100 doors_774.txt",
        "content": "L(1,4,9,16,25,36,49,64,81,100)",
        "safe": true
    },
    {
        "filename": "100 doors_775.txt",
        "content": " 10 REM 100 doors open/closed?\n 20 DIM d(100)\n 25 LET o=0\n 30 FOR a=1 TO 100\n 40 FOR b=a TO 100 STEP a\n 50 LET d(b)=NOT d(b)\n 55 LET o=o+(d(b)=1)-(d(b)=0)\n 60 NEXT b\n 70 NEXT a\n 80 PRINT o;\" open doors\"\n",
        "safe": true
    },
    {
        "filename": "100 doors_776.txt",
        "content": " 10 REM 100 doors open/closed?\n 20 DIM d(100)\n 25 GO SUB 170\n 30 FOR a=1 TO 100\n 35 PRINT AT 0,0;\"step \";a\n 40 FOR b=a TO 100 STEP a\n 45 PRINT AT 0,10;\"door:\";b;\"  \"\n 50 LET d(b)=NOT d(b)\n 55 GO SUB 150\n 60 NEXT b\n 70 NEXT a\n 80 GO SUB 170\n 90 STOP \n150 REM print door status\n151 LET p=(b-1)/10\n152 LET q=1+10*(p-INT p)\n153 LET p=INT p\n154 LET op=op+(d(b)=1)-(d(b)=0)\n156 PRINT AT 2*p+2,2*q;d(b);AT 0,27;op;\"  \"\n160 RETURN \n165 REM print step status\n170 LET op=0\n175 FOR p=0 TO 9\n180 FOR q=1 TO 10\n185 PRINT AT 2*p+2,2*q;d(p*10+q)\n188 LET op=op+d(p*10+q)\n190 NEXT q\n200 NEXT p\n205 PRINT AT 0,22;\"open:\";op;\"  \"\n210 RETURN\n",
        "safe": true
    },
    {
        "filename": "100 doors_78.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100 doors_79.txt",
        "content": " 100 :\n 110  REM  100 DOORS PROBLEM\n 120 :\n 130  DIM D(100)\n 140  FOR P = 1 TO 100\n 150  FOR T = P TO 100 STEP P\n 160  D(T) =  NOT D(T): NEXT T\n 170  NEXT P\n 180  FOR I = 1 TO 100\n 190  IF D(I) THEN  PRINT I;\" \";\n 200  NEXT I\n",
        "safe": true
    },
    {
        "filename": "100 doors_8.txt",
        "content": "  ;assumes memory at $02xx is initially set to 0 and stack pointer is initialized\n  ;the 1 to 100 door byte array will be at $0200-$0263 (decimal 512 to 611)\n  ;Zero-page location $01 will hold delta\n  ;At end, closed doors = $00, open doors = $01\n\nstart:    ldx #0        ;initialize index - first door will be at $200 + $0\n          stx $1\n          inc $1        ;start out with a delta of 1 (0+1=1)\nopenloop: inc $200,X    ;open X'th door\n          inc $1        ;add 2 to delta\n          inc $1\n          txa           ;add delta to X by transferring X to A, adding delta to A, then transferring back to X\n          clc          \u00a0;  clear carry before adding (6502 has no add-without-carry instruction)\n          adc $1\n          tax\n          cpx #$64      ;check to see if we're at or past the 100th door (at $200 + $63)\n          bmi openloop  ;jump back to openloop if less than 100",
        "safe": true
    },
    {
        "filename": "100 doors_80.txt",
        "content": "                                        \n]RUN\n1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100 doors_81.txt",
        "content": "# 100 doors problem\ndim d(100)\n\n# simple solution\nprint \"simple solution\"\ngosub initialize\nfor t = 1 to 100\n   for j = t to 100 step t\n      d[j-1] = not d[j-1]\n   next j\nnext t\ngosub showopen\n\n# more optimized solution\nprint \"more optimized solution\"\ngosub initialize\nfor t = 1 to 10\n      d[t^2-1] = true\nnext t\ngosub showopen\nend\n\ninitialize:\nfor t = 1 to d[?]\n   d[t-1] = false\t # closed\nnext t\nreturn\n\nshowopen:\nfor t = 1 to d[?]\n   print d[t-1]+ \" \";\n   if t%10 = 0 then print\nnext t\nreturn",
        "safe": true
    },
    {
        "filename": "100 doors_82.txt",
        "content": "for i = 1 to 10 : if i % i^2 < 11 then print \"La puerta \"; int(i^2); \" esta abierta\" : end if : next i : end\n",
        "safe": true
    },
    {
        "filename": "100 doors_83.txt",
        "content": "dim doors%(100)\n\nprint \"Finding solution to the 100 Doors Problem\"\n\nrem - all doors are initially closed\nfor i% = 1 to 100\n  doors%(i%) = 0\nnext i%\n\nrem - pass through at increasing intervals\nfor i% = 1 to 100\n  for j% = i% to 100 step i%\n    rem - flip each door encountered\n    doors%(j%) = 1 - doors%(j%)\n  next j%\nnext i%\n\nrem - show which doors are open\nprint \"The open doors are: \";\nfor i% = 1 to 100\n  if doors%(i%) = 1 then print i%;\nnext i%\n\nprint\nprint \"Thanks for consulting the puzzle guru!\"\n\nend\n",
        "safe": true
    },
    {
        "filename": "100 doors_84.txt",
        "content": "Finding solution to the 100 Doors Problem\nThe open doors are: 1 4 9 15 25 36 47 64 81 100\nThanks for consulting the puzzle guru!\n",
        "safe": true
    },
    {
        "filename": "100 doors_85.txt",
        "content": "100 CLS : REM  10 HOME for Applesoft BASIC\n110 DIM D(100)\n120 FOR P = 1 TO 100\n130   FOR T = P TO 100 STEP P\n140     D(T) = NOT D(T)\n150   NEXT T\n160 NEXT P\n170 ' Print \"opened\" doors\n180 FOR I = 1 TO 100\n190   IF D(I) THEN PRINT I;\" \";\n200 NEXT I\n210 END\n",
        "safe": true
    },
    {
        "filename": "100 doors_86.txt",
        "content": ">RUN\n1  4  9  16  25  36  49  64  81  100  >",
        "safe": true
    },
    {
        "filename": "100 doors_87.txt",
        "content": "10 DIM D(100)\n20 FOR I=1 TO 100\n30 FOR J=I TO 100 STEP I\n40 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",
        "safe": true
    },
    {
        "filename": "100 doors_88.txt",
        "content": "100 CLS : REM  10 HOME for Applesoft BASIC\n110 DIM D(100)\n120 FOR P = 1 TO 100\n130   FOR T = P TO 100 STEP P\n140     D(T) = NOT D(T)\n150   NEXT T\n160 NEXT P\n170 ' Print \"opened\" doors\n180 FOR I = 1 TO 100\n190   IF D(I) THEN PRINT I;\" \";\n200 NEXT I\n210 END\n",
        "safe": true
    },
    {
        "filename": "100 doors_89.txt",
        "content": "  1  4  9  16  25  36  49  64  81  100",
        "safe": true
    },
    {
        "filename": "100 doors_9.txt",
        "content": "*-----------------------------------------------------------\n* Title      : 100Doors.X68\n* Written by : G. A. Tippery\n* Date       : 2014-01-17\n* Description: Solves \"100 Doors\" problem, see: http://rosettacode.org/wiki/100_doors\n* Notes      : Translated from C \"Unoptimized\" version, http://rosettacode.org/wiki/100_doors#unoptimized\n*            : No optimizations done relative to C version; \"for(\"-equivalent loops could be optimized.\n*-----------------------------------------------------------\n\n*\n*   System-specific general console I/O macros (Sim68K, in this case)\n*\nPUTS    MACRO\n    ** Print a null-terminated string w/o CRLF **\n    ** Usage: PUTS stringaddress\n    ** Returns with D0, A1 modified\n        MOVEQ   #14,D0      ; task number 14 (display null string)\n        LEA     \\1,A1       ; address of string\n        TRAP    #15         ; display it\n        ENDM\n*\nPRINTN  MACRO\n    ** Print decimal integer from number in register\n    ** Usage: PRINTN register\n    ** Returns with D0,D1 modified\n        IFNC '\\1','D1'      ;if some register other than D1\n          MOVE.L \\1,D1      ;put number to display in D1\n        ENDC\n        MOVE.B  #3,D0\n        TRAP    #15         ;display number in D1\n*\n*   Generic constants\n*\nCR      EQU     13      ;ASCII Carriage Return\nLF      EQU     10      ;ASCII Line Feed\n\n*\n*   Definitions specific to this program\n*\n*   Register usage:\n*   D3 == pass (index)\n*   D4 == door (index)\n*   A2 == Doors array pointer\n*\nSIZE    EQU     100             ;Define a symbolic constant for # of doors\n\n        ORG     $1000           ;Specify load address for program -- actual address system-specific\nSTART:                          ; Execution starts here\n        LEA     Doors,A2        ; make A2 point to Doors byte array\n        MOVEQ   #0,D3\nPassLoop:\n        CMP     #SIZE,D3\n        BCC     ExitPassLoop    ; Branch on Carry Clear - being used as Branch on Higher or Equal\n        MOVE    D3,D4\nDoorLoop:\n        CMP     #SIZE,D4\n        BCC     ExitDoorLoop\n        NOT.B   0(A2,D4)\n        ADD     D3,D4\n        ADDQ    #1,D4\n        BRA     DoorLoop\nExitDoorLoop:\n        ADDQ    #1,D3\n        BRA     PassLoop\nExitPassLoop:\n\n* $28 = 40. bytes of code to this point. 32626 cycles so far.\n*   At this point, the result exists as the 100 bytes starting at address Doors.\n* To get output, we must use methods specific to the particular hardware, OS, or\n* emulator system that the code is running on.  I use macros to \"hide\" some of the\n* system-specific details; equivalent macros would be written for another system.\n\n        MOVEQ   #0,D4\nPrintLoop:\n        CMP     #SIZE,D4\n        BCC     ExitPrintLoop\n        PUTS    DoorMsg1\n        MOVE    D4,D1\n        ADDQ    #1,D1           ; Convert index to 1-based instead of 0-based\n        PRINTN  D1\n        PUTS    DoorMsg2\n        TST.B   0(A2,D4)        ; Is this door open (!= 0)?\n        BNE     ItsOpen\n        PUTS    DoorMsgC\n        BRA     Next\nItsOpen:\n        PUTS    DoorMsgO\nNext:\n        ADDQ    #1,D4\n        BRA     PrintLoop\nExitPrintLoop:\n\n*  What to do at end of program is also system-specific\n        SIMHALT             ;Halt simulator\n*\n* $78 = 120. bytes of code to this point, but this will depend on how the I/O macros are actually written.\n* Cycle count is nearly meaningless, as the I/O hardware and routines will dominate the timing.\n\n*\n*   Data memory usage\n*\n        ORG     $2000\nDoors   DCB.B   SIZE,0      ;Reserve 100 bytes, prefilled with zeros\n\nDoorMsg1 DC.B   'Door ',0\nDoorMsg2 DC.B   ' is ',0\nDoorMsgC DC.B   'closed',CR,LF,0\nDoorMsgO DC.B   'open',CR,LF,0\n\n        END     START       ;last line of source\n",
        "safe": true
    },
    {
        "filename": "100 doors_90.txt",
        "content": "100 PROGRAM \"100doors.bas\"\n110 NUMERIC D(1 TO 100)\n120 FOR I=1 TO 100\n130   LET D(I)=0\n140 NEXT\n150 FOR I=1 TO 100\n160   FOR J=I TO 100 STEP I\n170     LET D(J)=NOT D(J)\n180   NEXT \n190 NEXT\n200 FOR I=1 TO 100\n210   IF D(I) THEN PRINT I\n220 NEXT",
        "safe": true
    },
    {
        "filename": "100 doors_91.txt",
        "content": "100 PROGRAM \"100doors.bas\"\n110 LET NR=1:LET D=3\n120 DO\n130   PRINT NR\n140   LET NR=NR+D:LET D=D+2\n150 LOOP WHILE NR<=100",
        "safe": true
    },
    {
        "filename": "100 doors_92.txt",
        "content": "10 PRINT \"FOLLOWING DOORS ARE OPEN:\"\n20 LET I = 0\n30 REM LOOP\n40 LET I = I + 1\n50 PRINT I * I; \" \";\n60 IF I * I < 100 THEN 30\n70 END\n",
        "safe": true
    },
    {
        "filename": "100 doors_93.txt",
        "content": "10 DIM D(100)\n20 FOR I=1 TO 100\n30 FOR J=i TO 100 STEP I\n40 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\n100 END\n",
        "safe": true
    },
    {
        "filename": "100 doors_94.txt",
        "content": "                                        \n]RUN\n1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100 doors_95.txt",
        "content": "REM \"100 Doors\" program for QB64 BASIC (http://www.qb64.net/), a QuickBASIC-like compiler.\nREM Author: G. A. Tippery\nREM Date: 12-Feb-2014\nREM\nREM   Unoptimized (naive) version, per specifications at http://rosettacode.org/wiki/100_doors\n\nDEFINT A-Z\nCONST N = 100\nDIM door(N)\n\nFOR stride = 1 TO N\n    FOR index = stride TO N STEP stride\n        LET door(index) = NOT (door(index))\n    NEXT index\nNEXT stride\n\nPRINT \"Open doors:\"\nFOR index = 1 TO N\n    IF door(index) THEN PRINT index\nNEXT index\n\nEND\n",
        "safe": true
    },
    {
        "filename": "100 doors_96.txt",
        "content": "DIM doors(0 TO 99)\nFOR pass = 0 TO 99\n\tFOR door = pass TO 99 STEP pass + 1\n\t\tPRINT doors(door)\n\t\tPRINT NOT doors(door)\n\t\tdoors(door) = NOT doors(door)\n\tNEXT door\nNEXT pass\nFOR i = 0 TO 99\n\tPRINT \"Door #\"; i + 1; \" is \";\n\tIF NOT doors(i) THEN\n\t\tPRINT \"closed\"\n\tELSE\n\t\tPRINT \"open\"\n\tEND IF\nNEXT i\n",
        "safe": true
    },
    {
        "filename": "100 doors_97.txt",
        "content": "DIM doors(0 TO 99)\nFOR door = 0 TO 99\n\tIF INT(SQR(door)) = SQR(door) THEN doors(door) = -1\nNEXT door\nFOR i = 0 TO 99\n\tPRINT \"Door #\"; i + 1; \" is \";\n\tIF NOT doors(i) THEN\n\t\tPRINT \"closed\"\n\tELSE\n\t\tPRINT \"open\"\n\tEND IF\nNEXT i\n",
        "safe": true
    },
    {
        "filename": "100 doors_98.txt",
        "content": "100 ARRAY D\n110 FOR P = 1 TO 100\n120  FOR T = P TO 100 STEP P\n130   LET D[T] =  (D[T] <> 1)\n140  NEXT T\n150 NEXT P\n160 FOR I = 1 TO 100\n170  IF D[I] THEN PRINT I;\" \";\n180 NEXT I\n190 END\n",
        "safe": true
    },
    {
        "filename": "100 doors_99.txt",
        "content": "    PRINT \"Open doors are:\"\n\n    LET I = 1\n10  IF I = 100 THEN END \n    rem funcion SQR\n    LET B = I*I\n    rem funcion MODULO\n    LET A = I - (I / B) * B\n    IF A < 11 THEN PRINT B\n    LET I = I + 1\n    GOTO 10",
        "safe": true
    },
    {
        "filename": "100 prisoners_1.txt",
        "content": "F play_random(n)\n   V pardoned = 0\n   V in_drawer = Array(0.<100)\n   V sampler = Array(0.<100)\n   L 0 .< n\n      random:shuffle(&in_drawer)\n      V found = 0B\n      L(prisoner) 100\n         found = 0B\n         L(reveal) random:sample(sampler, 50)\n            V card = in_drawer[reveal]\n            I card == prisoner\n               found = 1B\n               L.break\n         I !found\n            L.break\n      I found\n         pardoned++\n   R Float(pardoned) / n * 100\n\nF play_optimal(n)\n   V pardoned = 0\n   V in_drawer = Array(0.<100)\n   L 0 .< n\n      random:shuffle(&in_drawer)\n      V found = 0B\n      L(prisoner) 100\n         V reveal = prisoner\n         found = 0B\n         L 50\n            V card = in_drawer[reveal]\n            I card == prisoner\n               found = 1B\n               L.break\n            reveal = card\n         I !found\n            L.break\n      I found\n         pardoned++\n   R Float(pardoned) / n * 100\n\nV n = 100'000\nprint(\u2018 Simulation count: \u2019n)\nprint(\u2018 Random play wins: #2.1% of simulations\u2019.format(play_random(n)))\nprint(\u2018Optimal play wins: #2.1% of simulations\u2019.format(play_optimal(n)))",
        "safe": true
    },
    {
        "filename": "100 prisoners_10.txt",
        "content": "Optimal Strategy = 31.80%\nRandom Strategy =  0.00%\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_100.txt",
        "content": "a:=[seq(max(GroupTheory[PermCycleType](Perm(Statistics[Shuffle]([$1..100])))),i=1..100000)]:\nnops(select(n->n<=50,a))/nops(a);\nevalf(%);\n# 31239/100000\n# 0.3123900000",
        "safe": true
    },
    {
        "filename": "100 prisoners_101.txt",
        "content": "1-(harmonic(100)-harmonic(50));\nevalf(%);\n\n# 21740752665556690246055199895649405434183/69720375229712477164533808935312303556800\n# 0.3118278207",
        "safe": true
    },
    {
        "filename": "100 prisoners_102.txt",
        "content": "ClearAll[PlayRandom, PlayOptimal]\nPlayRandom[n_] := \n Module[{pardoned = 0, sampler, indrawer, found, reveal},\n  sampler = indrawer = Range[100];\n  Do[\n   indrawer //= RandomSample;\n   found = 0;\n   Do[\n    reveal = RandomSample[sampler, 50];\n    If[MemberQ[indrawer[[reveal]], p],\n     found++;\n     ]\n    ,\n    {p, 100}\n    ];\n   If[found == 100, pardoned++];\n   ,\n   {n}\n   ];\n  N[pardoned/n]\n  ]\nPlayOptimal[n_] := \n Module[{pardoned = 0, indrawer, reveal, found, card},\n  indrawer = Range[100];\n  Do[\n   indrawer //= RandomSample;\n   Do[\n    reveal = p;\n    found = False;\n    Do[\n     card = indrawer[[reveal]];\n     If[card == p,\n      found = True;\n      Break[];\n      ];\n     reveal = card;\n     ,\n     {g, 50}\n     ];\n    If[! found, Break[]];\n    ,\n    {p, 100}\n    ];\n   If[found, pardoned++];\n   ,\n   {n}\n   ];\n  N[pardoned/n]\n  ];\nPlayRandom[1000]\nPlayOptimal[10000]\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_103.txt",
        "content": "0.\n0.3116",
        "safe": true
    },
    {
        "filename": "100 prisoners_104.txt",
        "content": "function [randSuccess,idealSuccess]=prisoners(numP,numG,numT)\n    %numP is the number of prisoners\n    %numG is the number of guesses\n    %numT is the number of trials\n    randSuccess=0;\n    \n    %Random\n    for trial=1:numT\n        drawers=randperm(numP);\n        won=1;\n        for i=1:numP\n            correct=0;\n            notopened=drawers;\n            for j=1:numG\n                ind=randi(numel(notopened));\n                m=notopened(ind);\n                if m==i\n                    correct=1;\n                    break;\n                end\n                notopened(ind)=[];\n            end\n            if correct==0\n                won=0;\n                break;\n            end\n        end\n        randSuccess=randSuccess*(trial-1)/trial+won/trial;\n    end\n    \n\n    %Ideal\n    idealSuccess=0;\n\n    for trial=1:numT\n        drawers=randperm(numP);\n        won=1;\n        for i=1:numP\n            correct=0;\n            guess=i;\n            for j=1:numG\n                m=drawers(guess);\n                if m==i\n                    correct=1;\n                    break;\n                end\n                guess=m;\n            end\n            if correct==0\n                won=0;\n                break;\n            end\n        end\n        idealSuccess=idealSuccess*(trial-1)/trial+won/trial;\n    end\n    disp(['Probability of success with random strategy: ' num2str(randSuccess*100) '%']);\n    disp(['Probability of success with ideal strategy: ' num2str(idealSuccess*100) '%']);\nend\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_105.txt",
        "content": ">> [randSuccess,idealSuccess]=prisoners(100,50,10000);\nProbability of success with random strategy: 0%\nProbability of success with ideal strategy: 31.93%",
        "safe": true
    },
    {
        "filename": "100 prisoners_106.txt",
        "content": "playRandom = function(n)\n    // using 0-99 instead of 1-100\n    pardoned = 0\n    numInDrawer = range(99)\n    choiceOrder = range(99)\n    for round in range(1, n)\n    \tnumInDrawer.shuffle\n        choiceOrder.shuffle\n        for prisoner in range(99)\n            found = false\n            for card in choiceOrder[:50]\n                if card == prisoner then\n                    found = true\n                    break\n                end if\n            end for\n            if not found then break\n        end for\n        if found then pardoned = pardoned + 1\n    end for\n    return pardoned / n * 100\nend function\n\nplayOptimal = function(n)\n    // using 0-99 instead of 1-100\n    pardoned = 0\n    numInDrawer = range(99)\n    for round in range(1, n)\n    \tnumInDrawer.shuffle\n        for prisoner in range(99)\n            found = false\n\t    drawer = prisoner\n            for i in range(1,50)\n                card = numInDrawer[drawer]\n                if card == prisoner then\n                    found = true\n                    break\n                end if\n                drawer = card\n            end for\n            if not found then break\n        end for\n        if found then pardoned = pardoned + 1\n    end for\n    return pardoned / n * 100\nend function\n\nprint \"Random:  \" + playRandom(10000) + \"%\"\nprint \"Optimal: \" + playOptimal(10000) + \"%\"\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_107.txt",
        "content": "Random:  0%\nOptimal: 31.06%",
        "safe": true
    },
    {
        "filename": "100 prisoners_108.txt",
        "content": "import random, sequtils, strutils\n\ntype\n  Sample = tuple\n    succ: int\n    fail: int\n\nconst\n  numPrisoners = 100\n  numDrawsEachPrisoner = numPrisoners div 2\n  numDrawings: Positive = 1_000_000 div 1\n\nproc `$`(s: Sample): string =\n  \"Succs: $#\\tFails: $#\\tTotal: $#\\tSuccess Rate: $#%.\" % [$s.succ, $s.fail, $(s.succ + s.fail), $(s.succ.float / (s.succ + s.fail).float * 100.0)]\n\nproc prisonersWillBeReleasedSmart(): bool =\n  result = true\n  var drawers = toSeq(0..<numPrisoners)\n  drawers.shuffle\n  for prisoner in 0..<numPrisoners:\n    var drawer = prisoner\n    block inner:\n      for _ in 0..<numDrawsEachPrisoner:\n        if drawers[drawer] == prisoner: break inner\n        drawer = drawers[drawer]\n      return false\n\nproc prisonersWillBeReleasedRandom(): bool =\n  result = true\n  var drawers = toSeq(0..<numPrisoners)\n  drawers.shuffle\n  for prisoner in 0..<numPrisoners:\n    var selectDrawer = toSeq(0..<numPrisoners)\n    selectDrawer.shuffle\n    block inner:\n      for i in 0..<numDrawsEachPrisoner:\n        if drawers[selectDrawer[i]] == prisoner: break inner\n      return false\n\nproc massDrawings(prisonersWillBeReleased: proc(): bool): Sample =\n  var success = 0\n  for i in 1..numDrawings:\n    if prisonersWillBeReleased():\n      inc(success)\n  return (success, numDrawings - success)\n\nrandomize()\necho $massDrawings(prisonersWillBeReleasedSmart)\necho $massDrawings(prisonersWillBeReleasedRandom)\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_109.txt",
        "content": "Succs: 312225   Fails: 687775   Total: 1000000  Success Rate: 31.2225%.\nSuccs: 0        Fails: 1000000  Total: 1000000  Success Rate: 0.0%.",
        "safe": true
    },
    {
        "filename": "100 prisoners_11.txt",
        "content": "\u2207 R \u2190 random Nnc; N; n; c\n  (N n c) \u2190 Nnc\n  R \u2190 \u2227/{\u2228/\u2375=c[n?N]}\u00a8\u2373N\n\u2207\n\n\u2207 R \u2190 follow Nnc; N; n; c; b\n  (N n c) \u2190 Nnc\n  b \u2190 n N\u2374\u2373N\n  R \u2190 \u2227/\u2228\u233fb={\u237a\u22a2c[\u2375]}\u2340n N\u2374c\n\u2207\n\n\u2207 R \u2190 M timesSimPrisoners Nn; N; n; m; c; r; s\n  (N n) \u2190 Nn\n  R \u2190 0 0\n  m \u2190 M\n  LOOP: c\u2190N?N       \n  r \u2190 random N n c\n  s \u2190 follow N n c\n  R \u2190 R + r,s      \n  \u2192((m\u2190m-1)>0)/LOOP\n  R \u2190 R \u00f7 M\n\u2207\n\n\u2395TS\n'>>>>>'\n1000 timesSimPrisoners 100 50\n'>>>>>'\n\u2395TS\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_110.txt",
        "content": "program Prisoners100;\n\nconst\n  rounds  = 100000;\n\ntype\n  tValue = Uint32;\n  tPrisNum = array of tValue;\nvar\n  drawers,\n  PrisonersChoice : tPrisNum;\n\nprocedure shuffle(var N:tPrisNum);\nvar\n  i,j,lmt : nativeInt;\n  tmp: tValue;\nBegin\n  lmt := High(N);\n  For i := lmt downto 1 do\n  begin\n    //take on from index i..limit\n    j := random(i+1);\n    //exchange with i\n    tmp := N[i];N[i]:= N[j];N[j]:= tmp;\n  end;\nend;\n\nfunction PardonedRandom(maxTestNum: NativeInt):boolean;\nvar\n  PrisNum,TestNum,Lmt : NativeUint;\n  Pardoned : boolean;\nBegin\n  IF maxTestNum <=0 then\n  Begin\n    PardonedRandom := false;\n    EXIT;\n  end;\n  Lmt := High(drawers);\n  IF (maxTestNum >= Lmt) then\n  Begin\n    PardonedRandom := true;\n    EXIT;\n  end;\n\n  shuffle(drawers);\n  PrisNum := 0;\n  repeat\n    //every prisoner uses his own list of drawers\n    shuffle(PrisonersChoice);\n    TestNum := 0;\n    repeat\n      Pardoned := drawers[PrisonersChoice[TestNum]] = PrisNum;\n      inc(TestNum);\n    until Pardoned OR (TestNum>=maxTestNum);\n    IF Not(Pardoned) then\n      BREAK;\n    inc(PrisNum);\n  until PrisNum>=Lmt;\n  PardonedRandom:= Pardoned;\nend;\n\nfunction PardonedOptimized(maxTestNum: NativeUint):boolean;\nvar\n  PrisNum,TestNum,NextNum,Cnt,Lmt : NativeUint;\n  Pardoned : boolean;\nBegin\n  IF maxTestNum <=0 then\n  Begin\n    PardonedOptimized := false;\n    EXIT;\n  end;\n  Lmt := High(drawers);\n  IF (maxTestNum >= Lmt) then\n  Begin\n    PardonedOptimized := true;\n    EXIT;\n  end;\n\n  shuffle(drawers);\n  Lmt := High(drawers);\n  IF maxTestNum >= Lmt then\n  Begin\n    PardonedOptimized := true;\n    EXIT;\n  end;\n  PrisNum := 0;\n  repeat\n    Cnt := 0;\n    NextNum := PrisNum;\n    repeat\n      TestNum := NextNum;\n      NextNum := drawers[TestNum];\n      inc(cnt);\n      Pardoned := NextNum = PrisNum;\n    until Pardoned OR (cnt >=maxTestNum);\n\n    IF Not(Pardoned) then\n      BREAK;\n    inc(PrisNum);\n  until PrisNum>Lmt;\n  PardonedOptimized := Pardoned;\nend;\n\nprocedure CheckRandom(testCount : NativeUint);\nvar\n  i,cnt : NativeInt;\nBegin\n  cnt := 0;\n  For i := 1 to rounds do\n    IF PardonedRandom(TestCount) then\n      inc(cnt);\n  writeln('Randomly  ',cnt/rounds*100:7:2,'% get pardoned out of ',rounds,' checking max ',TestCount);\nend;\n\nprocedure CheckOptimized(testCount : NativeUint);\nvar\n  i,cnt : NativeInt;\nBegin\n  cnt := 0;\n  For i := 1 to rounds do\n    IF PardonedOptimized(TestCount) then\n      inc(cnt);\n  writeln('Optimized ',cnt/rounds*100:7:2,'% get pardoned out of ',rounds,' checking max ',TestCount);\nend;\n\nprocedure OneCompareRun(PrisCnt:NativeInt);\nvar\n  i,lmt :nativeInt;\nbegin\n  setlength(drawers,PrisCnt);\n  For i := 0 to PrisCnt-1 do\n    drawers[i] := i;\n  PrisonersChoice := copy(drawers);\n\n  //test\n  writeln('Checking ',PrisCnt,' prisoners');\n\n  lmt := PrisCnt;\n  repeat\n    CheckOptimized(lmt);\n    dec(lmt,PrisCnt DIV 10);\n  until lmt < 0;\n  writeln;\n\n  lmt := PrisCnt;\n  repeat\n    CheckRandom(lmt);\n    dec(lmt,PrisCnt DIV 10);\n  until lmt < 0;\n  writeln;\n  writeln;\nend;\n\nBegin\n  //init\n  randomize;\n  OneCompareRun(20);\n  OneCompareRun(100);\nend.\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_111.txt",
        "content": "Checking 20 prisoners\nOptimized  100.00% get pardoned out of 100000 checking max 20\nOptimized   89.82% get pardoned out of 100000 checking max 18\nOptimized   78.25% get pardoned out of 100000 checking max 16\nOptimized   65.31% get pardoned out of 100000 checking max 14\nOptimized   50.59% get pardoned out of 100000 checking max 12\nOptimized   33.20% get pardoned out of 100000 checking max 10\nOptimized   15.28% get pardoned out of 100000 checking max 8\nOptimized    3.53% get pardoned out of 100000 checking max 6\nOptimized    0.10% get pardoned out of 100000 checking max 4\nOptimized    0.00% get pardoned out of 100000 checking max 2\nOptimized    0.00% get pardoned out of 100000 checking max 0\n\nRandomly   100.00% get pardoned out of 100000 checking max 20\nRandomly    13.55% get pardoned out of 100000 checking max 18\nRandomly     1.38% get pardoned out of 100000 checking max 16\nRandomly     0.12% get pardoned out of 100000 checking max 14\nRandomly     0.00% get pardoned out of 100000 checking max 12\nRandomly     0.00% get pardoned out of 100000 checking max 10\nRandomly     0.00% get pardoned out of 100000 checking max 8\nRandomly     0.00% get pardoned out of 100000 checking max 6\nRandomly     0.00% get pardoned out of 100000 checking max 4\nRandomly     0.00% get pardoned out of 100000 checking max 2\nRandomly     0.00% get pardoned out of 100000 checking max 0\n\n\nChecking 100 prisoners\nOptimized  100.00% get pardoned out of 100000 checking max 100\nOptimized   89.48% get pardoned out of 100000 checking max 90\nOptimized   77.94% get pardoned out of 100000 checking max 80\nOptimized   64.48% get pardoned out of 100000 checking max 70\nOptimized   49.35% get pardoned out of 100000 checking max 60\nOptimized   31.10% get pardoned out of 100000 checking max 50\nOptimized   13.38% get pardoned out of 100000 checking max 40\nOptimized    2.50% get pardoned out of 100000 checking max 30\nOptimized    0.05% get pardoned out of 100000 checking max 20\nOptimized    0.00% get pardoned out of 100000 checking max 10\nOptimized    0.00% get pardoned out of 100000 checking max 0\n\nRandomly   100.00% get pardoned out of 100000 checking max 100\nRandomly     0.01% get pardoned out of 100000 checking max 90\nRandomly     0.00% get pardoned out of 100000 checking max 80\nRandomly     0.00% get pardoned out of 100000 checking max 70\nRandomly     0.00% get pardoned out of 100000 checking max 60\nRandomly     0.00% get pardoned out of 100000 checking max 50\nRandomly     0.00% get pardoned out of 100000 checking max 40\nRandomly     0.00% get pardoned out of 100000 checking max 30\nRandomly     0.00% get pardoned out of 100000 checking max 20\nRandomly     0.00% get pardoned out of 100000 checking max 10\nRandomly     0.00% get pardoned out of 100000 checking max 0",
        "safe": true
    },
    {
        "filename": "100 prisoners_112.txt",
        "content": "program Prisoners100;\n{$IFDEF FPC}\n  {$MODE DELPHI}{$OPTIMIZATION ON,ALL}\n{$ELSE}\n  {$APPTYPE CONSOLE}\n{$ENDIF}\ntype\n  tValue  = NativeUint;\n  tpValue = pNativeUint;\n  tPrisNum = array of tValue;\n\nconst\n  rounds  = 1000000;\n  cAlreadySeen = High(tValue);\nvar\n  drawers,\n  Visited,\n  CntToPardoned : tPrisNum;\n  PrisCount : NativeInt;\n\nprocedure shuffle(var N:tPrisNum;lmt : nativeInt = 0);\nvar\n  pN : tpValue;\n  i,j : nativeInt;\n  tmp: tValue;\nBegin\n  pN := @N[0];\n  if lmt = 0 then\n    lmt := High(N);\n  For i := lmt downto 1 do\n  begin\n    //take one from index [0..i]\n    j := random(i+1);\n    //exchange with i\n    tmp := pN[i];pN[i]:= pN[j];pN[j]:= tmp;\n  end;\nend;\n\nprocedure CopyDrawers2Visited;\n//drawers and Visited are of same size, so only moving values\nBegin\n  Move(drawers[0],Visited[0],SizeOf(tValue)*PrisCount);\nend;\n\nfunction GetMaxCycleLen:NativeUint;\nvar\n  pVisited : tpValue;\n  cycleLen,MaxCycLen,Num,NumBefore : NativeUInt;\nBegin\n  CopyDrawers2Visited;\n  pVisited := @Visited[0];\n  MaxCycLen := 0;\n  cycleLen := MaxCycLen;\n  Num := MaxCycLen;\n  repeat\n    NumBefore := Num;\n    Num := pVisited[Num];\n    pVisited[NumBefore] := cAlreadySeen;\n    inc(cycleLen);\n    IF (Num= NumBefore) or (Num = cAlreadySeen) then\n    begin\n      IF Num = cAlreadySeen then\n        dec(CycleLen);\n      IF MaxCycLen < cycleLen then\n        MaxCycLen := cycleLen;\n      Num := 0;\n      while (Num< PrisCount) AND (pVisited[Num] = cAlreadySeen) do\n        inc(Num);\n      //all cycles found\n      IF Num >= PrisCount then\n        BREAK;\n      cycleLen :=0;\n    end;\n  until false;\n  GetMaxCycleLen := MaxCycLen-1;\nend;\n\nprocedure CheckOptimized(testCount : NativeUint);\nvar\n  factor: extended;\n  i,sum,digit,delta : NativeInt;\nBegin\n  For i := 1 to rounds do\n  begin\n    shuffle(drawers);\n    inc(CntToPardoned[GetMaxCycleLen]);\n  end;\n\n  digit := 0;\n  sum := rounds;\n  while sum > 100 do\n  Begin\n    inc(digit);\n    sum := sum DIV 10;\n  end;\n  factor := 100.0/rounds;\n\n  delta :=0;\n  sum := 0;\n  For i := 0 to High(drawers) do\n  Begin\n    inc(sum,CntToPardoned[i]);\n    dec(delta);\n    IF delta <= 0 then\n    Begin\n      writeln(sum*factor:Digit+5:Digit,'% get pardoned checking max ',i+1);\n      delta := delta+Length(drawers) DIV 10;\n    end;\n  end;\nend;\n\nprocedure OneCompareRun(PrisCnt:NativeInt);\nvar\n  i,lmt :nativeInt;\nbegin\n  PrisCount := PrisCnt;\n  setlength(drawers,PrisCnt);\n  For i := 0 to PrisCnt-1 do\n    drawers[i] := i;\n  setlength(Visited,PrisCnt);\n  setlength(CntToPardoned,PrisCnt);\n  //test\n  writeln('Checking ',PrisCnt,' prisoners for ',rounds,' rounds');\n  lmt := PrisCnt;\n  CheckOptimized(lmt);\n  writeln;\n\n  setlength(CntToPardoned,0);\n  setlength(Visited,0);\n  setlength(drawers,0);\nend;\n\nBegin\n  randomize;\n  OneCompareRun(10);\n  OneCompareRun(100);\n  OneCompareRun(1000);\nend.\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_113.txt",
        "content": "Checking 10 prisoners for 1000000 rounds\n   0.0000% get pardoned checking max 1\n   0.2584% get pardoned checking max 2\n   4.7431% get pardoned checking max 3\n  17.4409% get pardoned checking max 4\n  35.4983% get pardoned checking max 5\n  52.1617% get pardoned checking max 6\n  66.4807% get pardoned checking max 7\n  78.9761% get pardoned checking max 8\n  90.0488% get pardoned checking max 9\n 100.0000% get pardoned checking max 10\n\nChecking 100 prisoners for 1000000 rounds\n   0.0000% get pardoned checking max 1\n   0.0000% get pardoned checking max 10\n   0.0459% get pardoned checking max 20\n   2.5996% get pardoned checking max 30\n  13.5071% get pardoned checking max 40\n  31.2258% get pardoned checking max 50\n  49.3071% get pardoned checking max 60\n  64.6128% get pardoned checking max 70\n  77.8715% get pardoned checking max 80\n  89.5385% get pardoned checking max 90\n 100.0000% get pardoned checking max 100\n\nChecking 1000 prisoners for 1000000 rounds\n   0.0000% get pardoned checking max 1\n   0.0000% get pardoned checking max 100\n   0.0374% get pardoned checking max 200\n   2.3842% get pardoned checking max 300\n  13.1310% get pardoned checking max 400\n  30.7952% get pardoned checking max 500\n  48.9710% get pardoned checking max 600\n  64.3555% get pardoned checking max 700\n  77.6950% get pardoned checking max 800\n  89.4515% get pardoned checking max 900\n 100.0000% get pardoned checking max 1000\n\nreal    0m9,975s",
        "safe": true
    },
    {
        "filename": "100 prisoners_114.txt",
        "content": "use strict;\nuse warnings;\nuse feature 'say';\nuse List::Util 'shuffle';\n\nsub simulation {\n    my($population,$trials,$strategy) = @_;\n    my $optimal   = $strategy =~ /^o/i ? 1 : 0;\n    my @prisoners = 0..$population-1;\n    my $half      = int $population / 2;\n    my $pardoned  = 0;\n\n    for (1..$trials) {\n        my @drawers = shuffle @prisoners;\n        my $total = 0;\n        for my $prisoner (@prisoners) {\n            my $found = 0;\n            if ($optimal) {\n                my $card = $drawers[$prisoner];\n                if ($card == $prisoner) {\n                    $found = 1;\n                } else {\n                    for (1..$half-1) {\n                        $card = $drawers[$card];\n                        ($found = 1, last) if $card == $prisoner\n                    }\n                }\n            } else {\n                for my $card ( (shuffle @drawers)[0..$half]) {\n                    ($found = 1, last) if $card == $prisoner\n                }\n            }\n            last unless $found;\n            $total++;\n        }\n        $pardoned++ if $total == $population;\n    }\n    $pardoned / $trials * 100\n}\n\nmy $population = 100;\nmy $trials     = 10000;\nsay \" Simulation count: $trials\\n\" .\n(sprintf \" Random strategy pardons: %6.3f%% of simulations\\n\", simulation $population, $trials, 'random' ) .\n(sprintf \"Optimal strategy pardons: %6.3f%% of simulations\\n\", simulation $population, $trials, 'optimal');\n\n$population = 10;\n$trials     = 100000;\nsay \" Simulation count: $trials\\n\" .\n(sprintf \" Random strategy pardons: %6.3f%% of simulations\\n\", simulation $population, $trials, 'random' ) .\n(sprintf \"Optimal strategy pardons: %6.3f%% of simulations\\n\", simulation $population, $trials, 'optimal');\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_115.txt",
        "content": " Simulation count: 10000\n Random strategy pardons:  0.000% of simulations\nOptimal strategy pardons: 31.510% of simulations\n\n Simulation count: 1000000\n Random strategy pardons:  0.099% of simulations\nOptimal strategy pardons: 35.420% of simulations",
        "safe": true
    },
    {
        "filename": "100 prisoners_116.txt",
        "content": "(de shuffle (Lst)\n   (by '(NIL (rand)) sort Lst) )\n\n# Extend this class with a `next-guess>` method and a `str>` method.\n(class +Strategy +Entity)\n(dm prev-drawer> (Num)\n   (=: prev Num) )\n\n(class +Random +Strategy)\n(dm T (Prisoner)\n   (=: guesses (nth (shuffle (range 1 100)) 51)) )\n(dm next-guess> ()\n   (pop (:: guesses)) )\n(dm str> ()\n   \"Random\" )\n\n(class +Optimal +Strategy)\n(dm T (Prisoner)\n   (=: prisoner-id Prisoner) )\n(dm next-guess> ()\n   (or (: prev) (: prisoner-id)) )\n(dm str> ()\n   \"Optimal/Wikipedia\" )\n\n\n(de test-strategy (Strategy)\n   \"Simulate one round of 100 prisoners who use `Strategy`\"\n   (let Drawers (shuffle (range 1 100))\n      (for Prisoner (range 1 100)\n         (NIL # Break and return NIL if any prisoner fails their test.\n            (let Strat (new (list Strategy) Prisoner)\n               (do 50 # Try 50 iterations of `Strat`. Break and return T iff success.\n                  (T (= Prisoner (prev-drawer> Strat (get Drawers (next-guess> Strat))))\n                     T ) ) ) )\n         T ) ) )\n\n(de test-strategy-n-times (Strategy N)\n   \"Simulate `N` rounds of 100 prisoners who use `Strategy`\"\n   (let Successes 0\n      (do N\n         (when (test-strategy Strategy)\n            (inc 'Successes) ) )\n      (prinl \"We have a \" (/ (* 100 Successes) N) \"% success rate with \" N \" trials.\")\n      (prinl \"This is using the \" (str> Strategy) \" strategy.\") ) )",
        "safe": true
    },
    {
        "filename": "100 prisoners_117.txt",
        "content": "(test-strategy-n-times '+Random 10000)\n(test-strategy-n-times '+Optimal 10000)",
        "safe": true
    },
    {
        "filename": "100 prisoners_118.txt",
        "content": "We have a 0% success rate with 10000 trials.\nThis is using the Random strategy.\nWe have a 31% success rate with 10000 trials.\nThis is using the Optimal/Wikipedia strategy.",
        "safe": true
    },
    {
        "filename": "100 prisoners_119.txt",
        "content": "function play(integer prisoners, iterations, bool optimal)\n    sequence drawers = shuffle(tagset(prisoners))\n    integer pardoned = 0\n    bool found = false\n    for i=1 to iterations do\n        drawers = shuffle(drawers)\n        for prisoner=1 to prisoners do\n            found = false\n            integer drawer = iff(optimal?prisoner:rand(prisoners))\n            for j=1 to prisoners/2 do\n                drawer = drawers[drawer]\n                if drawer==prisoner then found = true exit end if\n                if not optimal then drawer = rand(prisoners) end if\n            end for\n            if not found then exit end if\n        end for\n        pardoned += found\n    end for\n    return 100*pardoned/iterations\nend function\n \nconstant iterations = 100_000\nprintf(1,\"Simulation count: %d\\n\",iterations)\nfor prisoners in {10,100} do\n    atom random = play(prisoners,iterations,false),\n         optimal = play(prisoners,iterations,true)\n    printf(1,\"Prisoners:%d, random:%g, optimal:%g\\n\",{prisoners,random,optimal})\nend for\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_12.txt",
        "content": "2023 3 26 17 43 32 983\n>>>>>\n0 0.307\n>>>>>\n2023 3 26 17 53 48 531\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_120.txt",
        "content": "Simulation count: 100000\nPrisoners:10, random:0.006, optimal:35.168\nPrisoners:100, random:0, optimal:31.098\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_121.txt",
        "content": "/# Rosetta Code problem: http://rosettacode.org/wiki/100_prisoners\nby Galileo, 05/2022 #/\n\ninclude ..\\Utilitys.pmt\n\ndef random rand * 1 + int enddef\n\ndef shuffle\n    len var l\n    l for var a\n        l random var b\n        b get var p\n        a get b set\n        p a set\n    endfor\nenddef\n\ndef play var optimal var iterations var prisoners\n    0 var pardoned\n\n    ( prisoners for endfor )\n    \n    iterations for drop\n        shuffle\n        prisoners for var prisoner\n            false var found\n            optimal if prisoner else prisoners random endif\n            prisoners 2 / int for drop\n                get dup prisoner == if true var found exitfor\n                else\n                    optimal not if drop prisoners random endif\n                endif\n            endfor\n            found not if exitfor endif\n            drop\n        endfor\n        pardoned found + var pardoned\n    endfor\n    drop\n    pardoned 100 * iterations /\nenddef\n\n\"Please, be patient ...\"\u00a0?\n\n( \"Optimal: \" 100 10000 true play\n  \" Random: \" 100 10000 false play\n  \" Prisoners: \" prisoners ) lprint",
        "safe": true
    },
    {
        "filename": "100 prisoners_122.txt",
        "content": "Please, be patient ...\nOptimal: 31.65 Random: 0 Prisoners: 100\n=== Press any key to exit ===",
        "safe": true
    },
    {
        "filename": "100 prisoners_123.txt",
        "content": "100H:\n/* PARAMETERS */\nDECLARE N$DRAWERS  LITERALLY '100';  /* AMOUNT OF DRAWERS */\nDECLARE N$ATTEMPTS LITERALLY '50';   /* ATTEMPTS PER PRISONER */\nDECLARE N$SIMS     LITERALLY '2000'; /* N. OF SIMULATIONS TO RUN */ \nDECLARE RAND$SEED  LITERALLY '193';  /* RANDOM SEED */\n\n/* CP/M CALLS */\nBDOS: PROCEDURE (FN, ARG); DECLARE FN BYTE, ARG ADDRESS; GO TO 5; END BDOS;\nEXIT: PROCEDURE; CALL BDOS(0, 0); END EXIT;\nPRINT: PROCEDURE (S); DECLARE S ADDRESS; CALL BDOS(9, S); END PRINT;\n\n/* PRINT NUMBER */\nPRINT$NUMBER: PROCEDURE (N);\n    DECLARE S (6) BYTE INITIAL ('.....$');\n    DECLARE (P, N) ADDRESS, C BASED P BYTE;\n    P = .S(5);\nDIGIT:\n    P = P - 1;\n    C = N MOD 10 + '0';\n    N = N / 10;\n    IF N > 0 THEN GO TO DIGIT;\n    CALL PRINT(P);\nEND PRINT$NUMBER;\n\n/* RANDOM NUMBER GENERATOR */\nRAND$BYTE: PROCEDURE BYTE;\n    DECLARE (X, A, B, C) BYTE \n        INITIAL (RAND$SEED, RAND$SEED, RAND$SEED, RAND$SEED);\n    X = X+1;\n    A = A XOR C XOR X;\n    B = B+A;\n    C = C+SHR(B,1)+A;\n    RETURN C;\nEND RAND$BYTE;\n\n/* GENERATE RANDOM NUMBER FROM 0 TO MAX */\nRAND$MAX: PROCEDURE (MAX) BYTE;\n    DECLARE (X, R, MAX) BYTE;\n    X = 1;\n    DO WHILE X < MAX;\n        X = SHL(X,1);\n    END;\n    X = X-1;\n    DO WHILE 1;\n        R = RAND$BYTE AND X;\n        IF R < MAX THEN RETURN R;\n    END;\nEND RAND$MAX;\n\n/* PLACE CARDS RANDOMLY IN DRAWERS */\nINIT$DRAWERS: PROCEDURE (DRAWERS);\n    DECLARE DRAWERS ADDRESS, (D BASED DRAWERS, I, J, K) BYTE;\n    DO I=0 TO N$DRAWERS-1;\n        D(I) = I;\n    END;\n    DO I=0 TO N$DRAWERS-1;\n        J = I + RAND$MAX(N$DRAWERS-I);\n        K = D(I);\n        D(I) = D(J);\n        D(J) = K;\n    END;\nEND INIT$DRAWERS;\n\n/* PRISONER OPENS RANDOM DRAWERS */\nRANDOM$STRATEGY: PROCEDURE (DRAWERS, P) BYTE;\n    DECLARE DRAWERS ADDRESS, D BASED DRAWERS BYTE;\n    DECLARE (P, I, TRIES) BYTE;\n    \n    /* KEEP TRACK OF WHICH DRAWERS HAVE BEEN OPENED */\n    DECLARE OPEN (N$DRAWERS) BYTE;\n    DO I=0 TO N$DRAWERS-1;\n        OPEN(I) = 0;\n    END;\n    \n    /* OPEN RANDOM DRAWERS */\n    TRIES = N$ATTEMPTS;\n    DO WHILE TRIES > 0;\n        IF NOT OPEN(I\u00a0:= RAND$MAX(N$DRAWERS)) THEN DO;\n            /* IF WE FIND OUR NUMBER, SUCCESS */\n            IF D(I) = P THEN RETURN 1;\n            OPEN(I) = 1;    \n            TRIES = TRIES - 1;\n        END;\n    END;\n    \n    RETURN 0; /* WE DID NOT FIND OUR NUMBER */\nEND RANDOM$STRATEGY;\n\n/* PRISONER USES OPTIMAL STRATEGY */\nOPTIMAL$STRATEGY: PROCEDURE (DRAWERS, P) BYTE;\n    DECLARE DRAWERS ADDRESS, D BASED DRAWERS BYTE;\n    DECLARE (P, I, TRIES) BYTE;\n    TRIES = N$ATTEMPTS;\n    I = P;\n    DO WHILE TRIES > 0;\n        I = D(I); /* OPEN DRAWER W/ CURRENT NUMBER */\n        IF I = P THEN RETURN 1; /* DID WE FIND IT? */\n        TRIES = TRIES - 1;\n    END;\n    RETURN 0;\nEND OPTIMAL$STRATEGY;\n\n/* RUN A SIMULATION */\nDECLARE RANDOM LITERALLY '0';\nDECLARE OPTIMAL LITERALLY '1';\nSIMULATE: PROCEDURE (STRAT) BYTE;\n    DECLARE (STRAT, P, R) BYTE;\n    \n    /* PLACE CARDS IN DRAWERS */\n    DECLARE DRAWERS (N$DRAWERS) BYTE;\n    CALL INIT$DRAWERS(.DRAWERS);\n    \n    /* TRY EACH PRISONER */\n    DO P=0 TO N$DRAWERS-1;\n        DO CASE STRAT;\n            R = RANDOM$STRATEGY(.DRAWERS, P);\n            R = OPTIMAL$STRATEGY(.DRAWERS, P);\n        END;\n        \n        /* IF ONE PRISONER FAILS THEY ALL HANG */\n        IF NOT R THEN RETURN 0;\n    END;\n    \n    RETURN 1; /* IF THEY ALL SUCCEED NONE HANG */\nEND SIMULATE;\n\n/* RUN MANY SIMULATIONS AND COUNT THE SUCCESSES */\nRUN$SIMULATIONS: PROCEDURE (N, STRAT) ADDRESS;\n    DECLARE STRAT BYTE, (I, N, SUCC) ADDRESS;\n    SUCC = 0;\n    DO I=1 TO N;\n        SUCC = SUCC + SIMULATE(STRAT);\n    END;\n    RETURN SUCC;\nEND RUN$SIMULATIONS;\n\n/* RUN AND PRINT SIMULATIONS */\nRUN$AND$PRINT: PROCEDURE (NAME, STRAT, N);\n    DECLARE (NAME, N, S) ADDRESS, STRAT BYTE;\n    CALL PRINT(NAME);\n    CALL PRINT(.' STRATEGY: $');\n    S = RUN$SIMULATIONS(N, STRAT);\n    CALL PRINT$NUMBER(S);\n    CALL PRINT(.' OUT OF $');\n    CALL PRINT$NUMBER(N);\n    CALL PRINT(.' - $');\n    CALL PRINT$NUMBER( S*10 / (N/10) );\n    CALL PRINT(.(37,13,10,'$'));\nEND RUN$AND$PRINT;\n\nCALL RUN$AND$PRINT(.'RANDOM$', RANDOM, N$SIMS);\nCALL RUN$AND$PRINT(.'OPTIMAL$', OPTIMAL, N$SIMS);\nCALL EXIT;\nEOF",
        "safe": true
    },
    {
        "filename": "100 prisoners_124.txt",
        "content": "RANDOM STRATEGY: 0 OUT OF 2000 - 0%\nOPTIMAL STRATEGY: 653 OUT OF 2000 - 32%",
        "safe": true
    },
    {
        "filename": "100 prisoners_125.txt",
        "content": "optimalSeq(drawers, n) =\n  iterate(ind => drawers[ind - 1], n)\n  |> takeUntil(ind => drawers[ind - 1] == n)\n\noptimalTrial(drawers) =\n  range(1, 100)\n  |> map(optimalSeq(drawers))\n\nrandomSeq(drawers, n) =\n  iterate(ind => randRange(1, 100), randRange(1, 100))\n  |> takeUntil(ind => drawers[ind - 1] == n)\n\nrandomTrial(drawers) =\n  range(1, 100)\n  |> map(randomSeq(drawers))\n\ncheckLength(seq) =\n  length(take(51, seq)) <= 50\n\nnumTrials = 3000\n\nrunTrials(trialFunc) =\n  for t in range(1, numTrials)\n  yield\n    range(1, 100)\n    |> shuffle\n    |> toArray\n    |> trialFunc\n    |> map(checkLength)\n    |> all\n\ncountSuccess(trialFunc) =\n  runTrials(trialFunc)\n  |> filter(id)\n  |> length\n\noptimalCount = countSuccess(optimalTrial)\nrandomCount = countSuccess(randomTrial)\n\noutput =\n  format(\"optimal: {} / {} = {} prob\\nrandom: {} / {} = {} prob\", [\n    optimalCount, numTrials, optimalCount / numTrials,\n    randomCount, numTrials, randomCount / numTrials,\n  ])\n  |> println\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_126.txt",
        "content": "optimal: 923 / 3000 = 0.30766666666666664 prob\nrandom: 0 / 3000 = 0.0 prob",
        "safe": true
    },
    {
        "filename": "100 prisoners_127.txt",
        "content": "### Clear Screen from old Output\nClear-Host\n\nFunction RandomOpening () \n  {\n    $Prisoners = 1..100 | Sort-Object {Get-Random}\n    $Cupboard = 1..100 | Sort-Object {Get-Random}\n    ## Loop for the Prisoners\n    $Survived = $true\n    for ($I=1;$I -le 100;$i++)\n      {\n          $OpeningListe = 1..100 | Sort-Object {Get-Random}\n          $Gefunden = $false\n          ## Loop for the trys of every prisoner\n          for ($X=1;$X -le 50;$X++)\n            {\n                $OpenNumber = $OpeningListe[$X]\n                IF ($Cupboard[$OpenNumber] -eq $Prisoners[$I])\n                  {\n                      $Gefunden = $true\n                  }\n                ## Cancel loop if prisoner found his number (yeah i know, dirty way ^^ )  \n                IF ($Gefunden)\n                  {\n                    $X = 55\n                  }\n            }\n          IF ($Gefunden -eq $false)\n            {\n              $I = 120\n              $Survived = $false\n            }            \n      }\n    Return $Survived\n  }\n\n  Function StrategyOpening () \n  {\n    $Prisoners = 1..100 | Sort-Object {Get-Random}\n    $Cupboard = 1..100 | Sort-Object {Get-Random}\n    $Survived = $true\n    for ($I=1;$I -le 100;$i++)\n      {\n          $Gefunden = $false\n          $OpeningNumber = $Prisoners[$I-1]\n          for ($X=1;$X -le 50;$X++)\n            {\n                IF ($Cupboard[$OpeningNumber-1] -eq $Prisoners[$I-1])\n                  {\n                      $Gefunden = $true\n                  }\n                else \n                  {\n                    $OpeningNumber = $Cupboard[$OpeningNumber-1]                  \n                  } \n                IF ($Gefunden)\n                  {\n                    $X = 55\n                  }\n            }\n          IF ($Gefunden -eq $false)\n            {\n              $I = 120\n              $Survived = $false\n            }            \n      }\n    Return $Survived\n  }\n\n$MaxRounds = 10000\n\nFunction TestRandom\n  {\n    $WinnerRandom = 0\n    for ($Round = 1; $Round -le $MaxRounds;$Round++)\n      {\n        IF (($Round%1000) -eq 0)\n          {\n            $Time = Get-Date\n            Write-Host \"Currently we are at rount $Round at $Time\"\n          }\n        $Rueckgabewert = RandomOpening\n        IF ($Rueckgabewert)\n          {\n            $WinnerRandom++\n          }\n      }\n    \n    $Prozent = (100/$MaxRounds)*$WinnerRandom\n    Write-Host \"There are $WinnerRandom survivors whit random opening. This is $Prozent percent\"\n  }\n\nFunction TestStrategy\n  {\n    $WinnersStrategy = 0 \n      for ($Round = 1; $Round -le $MaxRounds;$Round++)\n        {\n          IF (($Round%1000) -eq 0)\n            {\n              $Time = Get-Date\n              Write-Host \"Currently we are at $Round at $Time\"\n            }\n          $Rueckgabewert = StrategyOpening\n          IF ($Rueckgabewert)\n            {\n              $WinnersStrategy++\n            }\n        }\n    \n    $Prozent = (100/$MaxRounds)*$WinnersStrategy\n    Write-Host \"There are $WinnersStrategy survivors whit strategic opening. This is $Prozent percent\"\n  }\n\nFunction Main () \n  {\n    Clear-Host\n    TestRandom\n    TestStrategy\n  }\n\nMain\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_128.txt",
        "content": "# of executions: 10000\nThere are 0 survivors whit random opening. This is 0 percent\nThere are 3104 survivors whit strategic opening. This is 31,04 percent\"\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_129.txt",
        "content": "IntList drawers = new IntList();\nint trials = 100000;\nint succes_count;\n\nvoid setup() {\n  for (int i = 0; i < 100; i++) {\n    drawers.append(i);\n  }\n  println(trials + \" trials\\n\");\n\n  //Random strategy\n  println(\"Random strategy\");\n  succes_count = trials;\n  for (int i = 0; i < trials; i++) {\n    drawers.shuffle();\n    for (int prisoner = 0; prisoner < 100; prisoner++) {\n      boolean found = false;\n      for (int attempt = 0; attempt < 50; attempt++) {\n        if (drawers.get(int(random(drawers.size()))) == prisoner) {\n          found = true;\n          break;\n        }\n      }\n      if (!found) {\n        succes_count--;\n        break;\n      }\n    }\n  }\n  println(\" Succeses: \" + succes_count);\n  println(\" Succes rate: \" + 100.0 * succes_count / trials + \"%\\n\");\n\n  //Optimal strategy\n  println(\"Optimal strategy\");\n  succes_count = trials;\n  for (int i = 0; i < trials; i++) {\n    drawers.shuffle();\n    for (int prisoner = 0; prisoner < 100; prisoner++) {\n      boolean found = false;\n      int next = prisoner;\n      for (int attempt = 0; attempt < 50; attempt++) {\n        next = drawers.get(next);\n        if (next == prisoner) {\n          found = true;\n          break;\n        }\n      }\n      if (!found) {\n        succes_count--;\n        break;\n      }\n    }\n  }\n  println(\" Succeses: \" + succes_count);\n  print(\" Succes rate: \" + 100.0 * succes_count / trials + \"%\");\n}",
        "safe": true
    },
    {
        "filename": "100 prisoners_13.txt",
        "content": "0 GOTO 9\n\n1 FOR X = 0 TO N:J(X) = X: NEXT: FOR I = 0 TO N:FOR X = 0 TO N:T = J(X):NP =  INT ( RND (1) * H):J(X) = J(NP):J(NP) = T: NEXT :FOR G = 1 TO W:IF D(J(G)) = I THEN IP = IP + 1: NEXT I: RETURN \n2 NEXT G:RETURN \n\n3 FOR I = 0 TO N:NG = I: FOR G = 0 TO W:CD = D(NG):IF CD = I THEN IP = IP + 1: NEXT I: RETURN \n4 NG = CD:IF CD = I THEN STOP\n5 NEXT G: RETURN \n\n9 H=100:N=H-1:DIM D(99),J(99):FOR I = 0 TO N:D(I) = I: NEXT:W=INT(H/2)-1:M$=CHR$(13):M$(1)=\"RANDOM GUESSING\":M$(2)=\"CHAINED NUMBER PICKING\"\n\n1000 FOR Q = 0 TO 1 STEP 0 : HOME : PRINT \"100 PRISONERS\"M$: INPUT \"HOW MANY TRIALS FOR EACH METHOD? \";  TT\n1010     VTAB 2:CALL-958:PRINT M$\"RESULTS:\"M$\n1020     FOR M = 1 TO 2: SU(M) = 0:FA(M) = 0\n1030         FOR TN = 1 TO TT\n1040             VTAB 4:PRINT M$ \"   OUT OF \" TT \" TRIALS, THE RESULTS ARE\"M$\"   AS FOLLOWS...\";\n1050             IP = 0: X =  RND ( - TI): FOR I = 0 TO N:R =  INT ( RND (1) * N):T = D(I):D(I) = D(R):D(R) = T: NEXT\n1060             ON M GOSUB 1,3 : SU(M) = SU(M) + (IP = H):FA(M) = FA(M) + (IP < H)\n1070             FOR Z = 1 TO 2\n1071                 PRINT M$M$Z\". \"M$(Z)\":\"M$\n1073                 PRINT \"   \"SU(Z)\" SUCCESSES\"TAB(21)\n1074                 PRINT \"   \"FA(Z)\" FAILURES\"M$\n1075                 PRINT \"   \"(SU(Z) / TT) * 100\"% SUCCESS RATE.\";:CALL-868\n1090     NEXT Z,TN,M\n\n1100     PRINT M$M$\"AGAIN?\"\n1110     GET K$\n1120     Q = K$ <> \"Y\" AND K$ <> CHR$(ASC(\"Y\") + 32) : NEXT Q\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_130.txt",
        "content": "100000 trials\n\nRandom strategy\n Succeses: 0\n Succes rate: 0.0%\n\nOptimal strategy\n Succeses: 31134\n Succes rate: 31.134%",
        "safe": true
    },
    {
        "filename": "100 prisoners_131.txt",
        "content": "#PRISONERS=100\n#DRAWERS  =100\n#LOOPS    = 50\n#MAXPROBE = 10000\nOpenConsole()\n\nDim p1(#PRISONERS,#DRAWERS)\nDim p2(#PRISONERS,#DRAWERS)\nDim d(#DRAWERS)\n\nFor i=1 To #DRAWERS : d(i)=i : Next\nStart:\nFor probe=1 To #MAXPROBE\n  RandomizeArray(d(),1,100)\n  c1=0 : c2=0 \n  For m=1 To #PRISONERS\n    p2(m,1)=d(m) : If d(m)=m : p2(m,0)=1 : EndIf\n    For n=1 To #LOOPS\n      p1(m,n)=d(Random(100,1))\n      If p1(m,n)=m : p1(m,0)=1 : EndIf\n      If n>1 : p2(m,n)=d(p2(m,n-1)) : If p2(m,n)=m : p2(m,0)=1 : EndIf : EndIf\n    Next n\n  Next m\n  \n  For m=1 To #PRISONERS\n    If p1(m,0) : c1+1 : p1(m,0)=0 : EndIf \n    If p2(m,0) : c2+1 : p2(m,0)=0 : EndIf\n  Next m\n  \n  If c1=#PRISONERS : w1+1 : EndIf\n  If c2=#PRISONERS : w2+1 : EndIf\nNext probe\nPrint(\"TRIALS: \"+Str(#MAXPROBE))\nPrint(\"  RANDOM= \"+StrF(100*w1/#MAXPROBE,2)+\"%   STATEGY= \"+StrF(100*w2/#MAXPROBE,2)+\"%\")\nPrintN(~\"\\tFIN =q.\") : inp$=Input()\nw1=0 : w2=0\nIf inp$<>\"q\" : Goto Start : EndIf\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_132.txt",
        "content": "TRIALS: 10000  RANDOM= 0.00%   STATEGY= 30.83%\tFIN =q.\n\nTRIALS: 10000  RANDOM= 0.00%   STATEGY= 31.60%\tFIN =q.\n\nTRIALS: 10000  RANDOM= 0.00%   STATEGY= 31.20%\tFIN =q.",
        "safe": true
    },
    {
        "filename": "100 prisoners_133.txt",
        "content": "import random\n\ndef play_random(n):\n    # using 0-99 instead of ranges 1-100\n    pardoned = 0\n    in_drawer = list(range(100))\n    sampler = list(range(100))\n    for _round in range(n):\n        random.shuffle(in_drawer)\n        found = False\n        for prisoner in range(100):\n            found = False\n            for reveal in random.sample(sampler, 50):\n                card = in_drawer[reveal]\n                if card == prisoner:\n                    found = True\n                    break\n            if not found:\n                break\n        if found:\n            pardoned += 1\n    return pardoned / n * 100   #\u00a0%\n\ndef play_optimal(n):\n    # using 0-99 instead of ranges 1-100\n    pardoned = 0\n    in_drawer = list(range(100))\n    for _round in range(n):\n        random.shuffle(in_drawer)\n        for prisoner in range(100):\n            reveal = prisoner\n            found = False\n            for go in range(50):\n                card = in_drawer[reveal]\n                if card == prisoner:\n                    found = True\n                    break\n                reveal = card\n            if not found:\n                break\n        if found:\n            pardoned += 1\n    return pardoned / n * 100   #\u00a0%\n\nif __name__ == '__main__':\n    n = 100_000\n    print(\" Simulation count:\", n)\n    print(f\" Random play wins: {play_random(n):4.1f}% of simulations\")\n    print(f\"Optimal play wins: {play_optimal(n):4.1f}% of simulations\")\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_134.txt",
        "content": " Simulation count: 100000\n Random play wins:  0.0% of simulations\nOptimal play wins: 31.1% of simulations",
        "safe": true
    },
    {
        "filename": "100 prisoners_135.txt",
        "content": "# http://rosettacode.org/wiki/100_prisoners\n\nimport random\n\n\ndef main():\n    NUM_DRAWERS = 10\n    NUM_REPETITIONS = int(1E5)\n\n    print('{:15}: {:5} ({})'.format('approach', 'wins', 'ratio'))\n    for approach in PrisionersGame.approaches:\n        num_victories = 0\n        for _ in range(NUM_REPETITIONS):\n            game = PrisionersGame(NUM_DRAWERS)\n            num_victories += PrisionersGame.victory(game.play(approach))\n\n        print('{:15}: {:5} ({:.2%})'.format(\n            approach.__name__, num_victories, num_victories / NUM_REPETITIONS))\n\n\nclass PrisionersGame:\n    \"\"\"docstring for PrisionersGame\"\"\"\n    def __init__(self, num_drawers):\n        assert num_drawers % 2 == 0\n        self.num_drawers = num_drawers\n        self.max_attempts = int(self.num_drawers / 2)\n        self.drawer_ids = list(range(1, num_drawers + 1))\n        shuffled = self.drawer_ids[:]\n        random.shuffle(shuffled)\n        self.drawers = dict(zip(self.drawer_ids, shuffled))\n\n    def play_naive(self, player_number):\n        \"\"\" Randomly open drawers \"\"\"\n        for attempt in range(self.max_attempts):\n            if self.drawers[random.choice(self.drawer_ids)] == player_number:\n                return True\n\n        return False\n\n    def play_naive_mem(self, player_number):\n        \"\"\" Randomly open drawers but avoiding repetitions \"\"\"\n        not_attemped = self.drawer_ids[:]\n        for attempt in range(self.max_attempts):\n            guess = random.choice(not_attemped)\n            not_attemped.remove(guess)\n\n            if self.drawers[guess] == player_number:\n                return True\n\n        return False\n\n    def play_optimum(self, player_number):\n        \"\"\" Open the drawer that matches the player number and then open the drawer\n        with the revealed number.\n        \"\"\"\n        prev_attempt = player_number\n        for attempt in range(self.max_attempts):\n            if self.drawers[prev_attempt] == player_number:\n                return True\n            else:\n                prev_attempt = self.drawers[prev_attempt]\n\n        return False\n\n    @classmethod\n    def victory(csl, results):\n        \"\"\"Defines a victory of a game: all players won\"\"\"\n        return all(results)\n\n    approaches = [play_naive, play_naive_mem, play_optimum]\n\n    def play(self, approach):\n        \"\"\"Plays this game and returns a list of booleans with\n        True if a player one, False otherwise\"\"\"\n        return [approach(self, player) for player in self.drawer_ids]\n\n\nif __name__ == '__main__':\n    main()\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_136.txt",
        "content": "With 10 drawers (100k runs)\napproach      \u00a0: wins  (ratio)\nplay_naive    \u00a0:    14 (0.01%)\nplay_naive_mem\u00a0:    74 (0.07%)\nplay_optimum  \u00a0: 35410 (35.41%)\n\nWith 100 drawers (10k runs)\napproach      \u00a0: wins  (ratio)\nplay_naive    \u00a0:     0 (0.00%)\nplay_naive_mem\u00a0:     0 (0.00%)\nplay_optimum  \u00a0:  3084 (30.84%)",
        "safe": true
    },
    {
        "filename": "100 prisoners_137.txt",
        "content": "'''100 Prisoners'''\n\nfrom random import randint, sample\n\n\n# allChainedPathsAreShort\u00a0:: Int -> IO (0|1)\ndef allChainedPathsAreShort(n):\n    '''1 if none of the index-chasing cycles in a shuffled\n       sample of [1..n] cards are longer than half the\n       sample size. Otherwise, 0.\n    '''\n    limit = n // 2\n    xs = range(1, 1 + n)\n    shuffled = sample(xs, k=n)\n\n    # A cycle of boxes, drawn from a shuffled\n    # sample, which includes the given target.\n    def cycleIncluding(target):\n        boxChain = [target]\n        v = shuffled[target - 1]\n        while v != target:\n            boxChain.append(v)\n            v = shuffled[v - 1]\n        return boxChain\n\n    # Nothing if the target list is empty, or if the cycle which contains the\n    # first target is larger than half the sample size.\n    # Otherwise, just a cycle of enchained boxes containing the first target\n    # in the list, tupled with the residue of any remaining targets which\n    # fall outside that cycle.\n    def boxCycle(targets):\n        if targets:\n            boxChain = cycleIncluding(targets[0])\n            return Just((\n                difference(targets[1:])(boxChain),\n                boxChain\n            )) if limit >= len(boxChain) else Nothing()\n        else:\n            return Nothing()\n\n    # No cycles longer than half of total box count\u00a0?\n    return int(n == sum(map(len, unfoldr(boxCycle)(xs))))\n\n\n# randomTrialResult\u00a0:: RandomIO (0|1) -> Int -> (0|1)\ndef randomTrialResult(coin):\n    '''1 if every one of the prisoners finds their ticket\n       in an arbitrary half of the sample. Otherwise 0.\n    '''\n    return lambda n: int(all(\n        coin(x) for x in range(1, 1 + n)\n    ))\n\n\n# TEST ----------------------------------------------------\n# main\u00a0:: IO ()\ndef main():\n    '''Two sampling techniques constrasted with 100 drawers\n       and 100 prisoners, over 100,000 trial runs.\n    '''\n    halfOfDrawers = randomRInt(0)(1)\n\n    def optimalDrawerSampling(x):\n        return allChainedPathsAreShort(x)\n\n    def randomDrawerSampling(x):\n        return randomTrialResult(halfOfDrawers)(x)\n\n    # kSamplesWithNBoxes\u00a0:: Int -> Int -> String\n    def kSamplesWithNBoxes(k):\n        tests = range(1, 1 + k)\n        return lambda n: '\\n\\n' + fTable(\n            str(k) + ' tests of optimal vs random drawer-sampling ' +\n            'with ' + str(n) + ' boxes: \\n'\n        )(fName)(lambda r: '{:.2%}'.format(r))(\n            lambda f: sum(f(n) for x in tests) / k\n        )([\n            optimalDrawerSampling,\n            randomDrawerSampling,\n        ])\n\n    print(kSamplesWithNBoxes(10000)(10))\n\n    print(kSamplesWithNBoxes(10000)(100))\n\n    print(kSamplesWithNBoxes(100000)(100))\n\n\n# ------------------------DISPLAY--------------------------\n\n# fTable\u00a0:: String -> (a -> String) ->\n# (b -> String) -> (a -> b) -> [a] -> String\ndef fTable(s):\n    '''Heading -> x display function -> fx display function ->\n       f -> xs -> tabular string.\n    '''\n    def go(xShow, fxShow, f, xs):\n        ys = [xShow(x) for x in xs]\n        w = max(map(len, ys))\n        return s + '\\n' + '\\n'.join(map(\n            lambda x, y: y.rjust(w, ' ') + ' -> ' + fxShow(f(x)),\n            xs, ys\n        ))\n    return lambda xShow: lambda fxShow: lambda f: lambda xs: go(\n        xShow, fxShow, f, xs\n    )\n\n\n# fname\u00a0:: (a -> b) -> String\ndef fName(f):\n    '''Name bound to the given function.'''\n    return f.__name__\n\n\n# ------------------------GENERIC -------------------------\n\n# Just\u00a0:: a -> Maybe a\ndef Just(x):\n    '''Constructor for an inhabited Maybe (option type) value.\n       Wrapper containing the result of a computation.\n    '''\n    return {'type': 'Maybe', 'Nothing': False, 'Just': x}\n\n\n# Nothing\u00a0:: Maybe a\ndef Nothing():\n    '''Constructor for an empty Maybe (option type) value.\n       Empty wrapper returned where a computation is not possible.\n    '''\n    return {'type': 'Maybe', 'Nothing': True}\n\n\n# difference\u00a0:: Eq a => [a] -> [a] -> [a]\ndef difference(xs):\n    '''All elements of xs, except any also found in ys.'''\n    return lambda ys: list(set(xs) - set(ys))\n\n\n# randomRInt\u00a0:: Int -> Int -> IO () -> Int\ndef randomRInt(m):\n    '''The return value of randomRInt is itself\n       a function. The returned function, whenever\n       called, yields a a new pseudo-random integer\n       in the range [m..n].\n    '''\n    return lambda n: lambda _: randint(m, n)\n\n\n# unfoldr(lambda x: Just((x, x - 1)) if 0\u00a0!= x else Nothing())(10)\n# -> [10, 9, 8, 7, 6, 5, 4, 3, 2, 1]\n# unfoldr\u00a0:: (b -> Maybe (a, b)) -> b -> [a]\ndef unfoldr(f):\n    '''Dual to reduce or foldr.\n       Where catamorphism reduces a list to a summary value,\n       the anamorphic unfoldr builds a list from a seed value.\n       As long as f returns Just(a, b), a is prepended to the list,\n       and the residual b is used as the argument for the next\n       application of f.\n       When f returns Nothing, the completed list is returned.\n    '''\n    def go(v):\n        xr = v, v\n        xs = []\n        while True:\n            mb = f(xr[0])\n            if mb.get('Nothing'):\n                return xs\n            else:\n                xr = mb.get('Just')\n                xs.append(xr[1])\n        return xs\n    return lambda x: go(x)\n\n\n# MAIN ---\nif __name__ == '__main__':\n    main()\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_138.txt",
        "content": "10000 tests of optimal vs random drawer-sampling with 10 boxes: \n\noptimalDrawerSampling -> 35.47%\n randomDrawerSampling -> 0.09%\n\n10000 tests of optimal vs random drawer-sampling with 100 boxes: \n\noptimalDrawerSampling -> 30.40%\n randomDrawerSampling -> 0.00%\n\n100000 tests of optimal vs random drawer-sampling with 100 boxes: \n\noptimalDrawerSampling -> 31.17%\n randomDrawerSampling -> 0.00%",
        "safe": true
    },
    {
        "filename": "100 prisoners_139.txt",
        "content": "t = 100000 #number of trials\nsuccess.r = rep(0,t) #this will keep track of how many prisoners find their ticket on each trial for the random method\nsuccess.o = rep(0,t) #this will keep track of how many prisoners find their ticket on each trial for the optimal method\n\n#random method\nfor(i in 1:t){\n  escape = rep(F,100)\n  ticket = sample(1:100)\n  for(j in 1:length(prisoner)){\n    escape[j] = j %in% sample(ticket,50)\n  }\n  success.r[i] = sum(escape)\n}\n\n#optimal method\nfor(i in 1:t){\n  escape = rep(F,100)\n  ticket = sample(1:100)\n  for(j in 1:100){\n    boxes = 0\n    current.box = j\n    while(boxes<50 && !escape[j]){\n      boxes=boxes+1\n      escape[j] = ticket[current.box]==j\n      current.box = ticket[current.box]\n    }\n  }\n  success.o[i] = sum(escape)\n}\n\ncat(\"Random method resulted in a success rate of \",100*mean(success.r==100),\n    \"%.\\nOptimal method resulted in a success rate of \",100*mean(success.o==100),\"%.\",sep=\"\")\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_14.txt",
        "content": "100 PRISONERS\n\nRESULTS:\n\n   OUT OF 4000 TRIALS, THE RESULTS ARE\n   AS FOLLOWS...\n\n1. RANDOM GUESSING:\n\n   0 SUCCESSES         4000 FAILURES\n\n   0% SUCCESS RATE.\n\n2. CHAINED NUMBER PICKING:\n\n   1278 SUCCESSES      2722 FAILURES\n\n   31.95% SUCCESS RATE.\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_140.txt",
        "content": "Random method resulted in a success rate of 0%.\nOptimal method resulted in a success rate of 31.129%.",
        "safe": true
    },
    {
        "filename": "100 prisoners_141.txt",
        "content": "Const Found = -1, Searching = 0, Status = 1, Tries = 2\nConst Attempt = 1, Victories = 2, RandomW = 1, ChainW = 2\nRandomize Timer\n\nDim Shared Prisoners(1 To 100, Status To Tries) As Integer, Drawers(1 To 100) As Integer, Results(1 To 2, 1 To 2) As Integer\nPrint \"100 prisoners\"\nPrint \"Random way to search...\"\nFor a = 1 To 2000\n    Init\n    Results(RandomW, Attempt) = Results(RandomW, Attempt) + 1\n    RandomWay\n    If verify% Then Results(RandomW, Victories) = Results(RandomW, Victories) + 1\nNext\n\nPrint: Print \"Chain way to search...\"\nFor a = 1 To 2000\n    Init\n    Results(ChainW, Attempt) = Results(ChainW, Attempt) + 1\n    ChainWay\n    If verify% Then Results(ChainW, Victories) = Results(ChainW, Victories) + 1\nNext\nPrint: Print \"Results: \"\nPrint \" Attempts \"; Results(RandomW, Attempt); \" \"; \"Victories \"; Results(RandomW, Victories); \" Ratio:\"; Results(RandomW, Victories); \"/\"; Results(RandomW, Attempt)\nPrint\nPrint \" Attempts \"; Results(ChainW, Attempt); \" \"; \"Victories \"; Results(ChainW, Victories); \" Ratio:\"; Results(ChainW, Victories); \"/\"; Results(ChainW, Attempt)\nEnd\n\nFunction verify%\n    Dim In As Integer\n    Print \"veryfing \"\n    verify = 0\n    For In = 1 To 100\n        If Prisoners(In, Status) = Searching Then Exit For\n    Next\n    If In = 101 Then verify% = Found\nEnd Function\n\nSub ChainWay\n    Dim In As Integer, ChainChoice As Integer\n    Print \"Chain search\"\n    For In = 1 To 100\n        ChainChoice = In\n        Do\n            Prisoners(In, Tries) = Prisoners(In, Tries) + 1\n            If Drawers(ChainChoice) = In Then Prisoners(In, Status) = Found: Exit Do\n            ChainChoice = Drawers(ChainChoice)\n        Loop Until Prisoners(In, Tries) = 50\n    Next In\nEnd Sub\n\nSub RandomWay\n    Dim In As Integer, RndChoice As Integer\n    Print \"Random search\"\n    For In = 1 To 100\n        Do\n            Prisoners(In, Tries) = Prisoners(In, Tries) + 1\n            If Drawers(Int(Rnd * 100) + 1) = In Then Prisoners(In, Status) = Found: Exit Do\n        Loop Until Prisoners(In, Tries) = 50\n    Next\n    Print \"Executed \"\nEnd Sub\n\n\nSub Init\n    Dim I As Integer, I2 As Integer\n    Print \"initialization\"\n    For I = 1 To 100\n        Prisoners(I, Status) = Searching\n        Prisoners(I, Tries) = Searching\n        Do\n            Drawers(I) = Int(Rnd * 100) + 1\n            For I2 = 1 To I\n                If Drawers(I2) = Drawers(I) Then Exit For\n            Next\n            If I2 = I Then Exit Do\n        Loop\n    Next I\n    Print \"Done \"\nEnd Sub",
        "safe": true
    },
    {
        "filename": "100 prisoners_142.txt",
        "content": "  [ this ] is 100prisoners.qky\n\n  [ dup size 2 / split ]                          is halve     (   [ --> [ [ )\n\n  [ stack ]                                       is successes (     --> s   )\n\n  [ [] swap times [ i join ] shuffle ]            is drawers   (   n --> [   )\n\n  [ false unrot\n    temp put \n    dup shuffle\n    halve drop\n    witheach\n      [ dip dup peek\n        temp share = if\n        [ dip not\n          conclude ] ]\n    drop\n    temp release ]                                is naive     ( [ n --> b   )\n\n  [ false unrot \n    dup temp put\n    over size 2 / times \n      [ dip dup peek\n        dup temp share = if\n        [ rot not unrot\n          conclude ] ]\n    2drop\n    temp release ]                                is smart     ( [ n --> b   )\n\n  [ ]'[ temp put\n    drawers\n    0 successes put\n    dup size times \n      [ dup i temp share do\n        successes tally ]\n    size successes take = \n    temp release ]                                is prisoners (   n --> b   )\n \n  [ say \"100 naive prisoners were pardoned \"\n    0 10000 times [ 100 prisoners naive + ] echo\n    say \" times out of 10000 simulations.\" cr\n\n    say \"100 smart prisoners were pardoned \"\n    0 10000 times [ 100 prisoners smart + ] echo\n    say \" times out of 10000 simulations.\" cr ]   is simulate  (     -->     )",
        "safe": true
    },
    {
        "filename": "100 prisoners_143.txt",
        "content": "/O>  [ $ '100prisoners.qky' loadfile ] now!\n...  simulate\n... \n100 naive prisoners were pardoned 0 times out of 10000 simulations.\n100 smart prisoners were pardoned 3158 times out of 10000 simulations.\n\nStack empty.",
        "safe": true
    },
    {
        "filename": "100 prisoners_144.txt",
        "content": "#lang racket\n(require srfi/1)\n\n(define current-samples (make-parameter 10000))\n(define *prisoners* 100)\n(define *max-guesses* 50)\n\n(define (evaluate-strategy instance-solved? strategy (s (current-samples)))\n  (/ (for/sum ((_ s) #:when (instance-solved? strategy)) 1) s))\n\n(define (build-drawers)\n  (list->vector (shuffle (range *prisoners*))))\n\n(define (100-prisoners-problem strategy)\n  (every (strategy (build-drawers)) (range *prisoners*)))\n\n(define ((strategy-1 drawers) p)\n  (any (\u03bb (_) (= p (vector-ref drawers (random *prisoners*)))) (range *max-guesses*)))\n\n(define ((strategy-2 drawers) p)\n  (define-values (_ found?)\n    (for/fold ((d p) (found? #f)) ((_ *max-guesses*)) #:break found?\n      (let ((card (vector-ref drawers d))) (values card (= card p)))))\n  found?)\n\n(define (print-sample-percentage caption f (s (current-samples)))\n  (printf \"~a: ~a%~%\" caption (real->decimal-string (* 100 f) (- (order-of-magnitude s) 2))))\n\n(module+ main\n  (print-sample-percentage \"random\" (evaluate-strategy 100-prisoners-problem strategy-1))\n  (print-sample-percentage \"optimal\" (evaluate-strategy 100-prisoners-problem strategy-2)))\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_145.txt",
        "content": "random: 0.00%\noptimal: 31.18%",
        "safe": true
    },
    {
        "filename": "100 prisoners_146.txt",
        "content": "unit sub MAIN (:$prisoners = 100,\u00a0:$simulations = 10000);\nmy @prisoners = ^$prisoners;\nmy $half = floor +@prisoners / 2;\n\nsub random ($n) {\n    ^$n .race.map( {\n        my @drawers = @prisoners.pick: *;\n        @prisoners.map( -> $prisoner {\n            my $found = 0;\n            for @drawers.pick($half) -> $card {\n                $found = 1 and last if $card == $prisoner\n            }\n            last unless $found;\n            $found\n        }\n        ).sum == @prisoners\n    }\n    ).grep( *.so ).elems / $n * 100\n}\n\nsub optimal ($n) {\n    ^$n .race.map( {\n        my @drawers = @prisoners.pick: *;\n        @prisoners.map( -> $prisoner {\n            my $found = 0;\n            my $card = @drawers[$prisoner];\n            if $card == $prisoner {\n                $found = 1\n            } else {\n                for ^($half - 1) {\n                    $card = @drawers[$card];\n                    $found = 1 and last if $card == $prisoner\n                }\n            }\n            last unless $found;\n            $found\n        }\n        ).sum == @prisoners\n    }\n    ).grep( *.so ).elems / $n * 100\n}\n\nsay \"Testing $simulations simulations with $prisoners prisoners.\";\nprintf \" Random play wins:\u00a0%.3f%% of simulations\\n\", random $simulations;\nprintf \"Optimal play wins:\u00a0%.3f%% of simulations\\n\", optimal $simulations;\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_147.txt",
        "content": "Testing 10000 simulations with 100 prisoners.\n Random play wins: 0.000% of simulations\nOptimal play wins: 30.510% of simulations",
        "safe": true
    },
    {
        "filename": "100 prisoners_148.txt",
        "content": "Testing 100000 simulations with 10 prisoners.\n Random play wins: 0.099% of simulations\nOptimal play wins: 35.461% of simulations\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_149.txt",
        "content": "Red []\n\nK_runs: 100000\nrepeat n 100 [append rand_arr: []  n]              ;; define array/series with numbers 1..100\n\n;;-------------------------------\nstrat_optimal: function [pris ][\n;;-------------------------------\n  locker: pris                                    ;; start with locker equal to prisoner number\n  loop 50 [\n    if Board/:locker = pris [ return true ]       ;; locker with prisoner number found\n    locker: Board/:locker\n  ]\n  false                                           ;; number not found - fail\n]\n;;-------------------------------\nstrat_rand: function [pris ][\n;;-------------------------------\n  random rand_arr                                                 ;; define set of  random lockers\n  repeat n 50 [ if Board/(rand_arr/:n) = pris [ return true ]  ]  ;; try first 50, found\u00a0? then return success\n  false \n]\n\n;;------------------------------\ncheck_board: function [ strat][\n;;------------------------------\nrepeat pris 100 [                                                   ;; for each prisoner\n  either  strat = 'optimal [ unless strat_optimal pris [return false ]  ]  \n                            [ unless strat_rand pris [return false ]  ]  \n]  \n  true                                                  ;; all 100 prisoners passed test\n]\n\nsaved: saved_rand: 0                                    ;; count all saved runs per strategy\nloop K_runs [\n  Board: random copy rand_arr                           ;; new board for every run\n  if  check_board 'optimal [saved: saved + 1]           ;; optimal stategy\n  if  check_board 'rand [saved_rand: saved_rand + 1]  ;; random strategy\n]\n\nprint [\"runs\" k_runs newline  \"Percent saved opt.strategy:\" saved * 100.0 / k_runs ]\nprint [\"Percent saved random strategy:\" saved_rand * 100.0 / k_runs ]\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_15.txt",
        "content": "/* ARM assembly Raspberry PI  */\n/*  program prisonniers.s   */ \n\n/* REMARK 1\u00a0: this program use routines in a include file \n   see task Include a file language arm assembly \n   for the routine affichageMess conversion10 \n   see at end of this program the instruction include */\n/* for constantes see task include a file in arm assembly */\n/************************************/\n/* Constantes                       */\n/************************************/\n.include \"../constantes.inc\"\n\n.equ NBDOORS,   100\n.equ NBLOOP, 1000\n\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nsMessResult:        .asciz \"Random strategie \u00a0: @ sur 1000 \\n\"\nsMessResultOPT:     .asciz \"Optimal strategie\u00a0: @ sur 1000 \\n\"\nszCarriageReturn:   .asciz \"\\n\"\n.align 4\niGraine:  .int 123456\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\nsZoneConv:        .skip 24\ntbDoors:          .skip 4 * NBDOORS \ntbTest:           .skip 4 * NBDOORS\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                 @ entry of program \n    \n    ldr r1,iAdrtbDoors\n    mov r2,#0\n1:                                    @ loop init doors table\n    add r3,r2,#1\n    str r3,[r1,r2,lsl #2]\n    add r2,r2,#1\n    cmp r2,#NBDOORS\n    blt 1b\n \n    mov r9,#0                         @ loop counter\n    mov r10,#0                        @ counter successes random strategie\n    mov r11,#0                        @ counter successes optimal strategie\n2:\n    ldr r0,iAdrtbDoors\n    mov r1,#NBDOORS\n    bl knuthShuffle\n    \n    ldr r0,iAdrtbDoors\n    bl aleaStrategie\n    cmp r0,#NBDOORS\n    addeq r10,r10,#1\n    \n    ldr r0,iAdrtbDoors\n    bl optimaStrategie\n    cmp r0,#NBDOORS\n    addeq r11,r11,#1\n    \n    add r9,r9,#1\n    cmp r9,#NBLOOP\n    blt 2b\n    \n    mov r0,r10                        @ result display\n    ldr r1,iAdrsZoneConv\n    bl conversion10                   @ call decimal conversion\n    ldr r0,iAdrsMessResult\n    ldr r1,iAdrsZoneConv              @ insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n    \n    mov r0,r11                        @ result display\n    ldr r1,iAdrsZoneConv\n    bl conversion10                   @ call decimal conversion\n    ldr r0,iAdrsMessResultOPT\n    ldr r1,iAdrsZoneConv              @ insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n    \n100:                                  @ standard end of the program \n    mov r0, #0                        @ return code\n    mov r7, #EXIT                     @ request to exit program\n    svc #0                            @ perform the system call\n \niAdrszCarriageReturn:     .int szCarriageReturn\niAdrsMessResult:          .int sMessResult\niAdrsMessResultOPT:        .int sMessResultOPT\niAdrtbDoors:              .int tbDoors\niAdrtbTest:               .int tbTest\niAdrsZoneConv:            .int sZoneConv\n/******************************************************************/\n/*            random door test strategy                           */ \n/******************************************************************/\n/* r0 contains the address of table */\naleaStrategie:\n    push {r1-r7,lr}              @ save registers\n    ldr r6,iAdrtbTest            @ table doors tests address\n    mov r1,r0                    @ save table doors address\n    mov r4,#0                    @ counter number of successes\n    mov r2,#0                    @ prisonners indice\n1:\n    bl razTable                  @ zero to table doors tests\n    mov r5,#0                    @ counter of door tests \n    add r7,r2,#1\n2:\n    mov r0,#NBDOORS - 1\n    bl genereraleas              @ random test\n    add r0,r0,#1\n    ldr r3,[r6,r0,lsl #2]        @ doors also tested\u00a0?\n    cmp r3,#0 \n    bne 2b                       @ yes\n    ldr r3,[r1,r0,lsl #2]        @ load N\u00b0 door\n    cmp r3,r7                    @ compar N\u00b0 door N\u00b0 prisonner\n    addeq r4,r4,#1               @ succes\n    beq 3f\n    mov r3,#1                    @ top test table item \n    str r3,[r6,r0,lsl #2]\n    add r5,r5,#1\n    cmp r5,#NBDOORS / 2          @ number tests maxi\u00a0?\n    blt 2b                       @ no -> loop\n3:\n    add r2,r2,#1                 @ other prisonner\n    cmp r2,#NBDOORS\n    blt 1b\n    \n    mov r0,r4                    @ return number of successes \n100:\n    pop {r1-r7,lr}\n    bx lr                        @ return \n/******************************************************************/\n/*     raz test table                                             */ \n/******************************************************************/\nrazTable:\n    push {r0-r2,lr}              @ save registers\n    ldr r0,iAdrtbTest\n    mov r1,#0                    @ item indice\n    mov r2,#0\n1:\n    str r2,[r0,r1,lsl #2]        @ store zero \u00e0 item\n    add r1,r1,#1\n    cmp r1,#NBDOORS\n    blt 1b\n100:\n    pop {r0-r2,lr}\n    bx lr                        @ return \n/******************************************************************/\n/*            random door test strategy                           */ \n/******************************************************************/\n/* r0 contains the address of table */\noptimaStrategie:\n    push {r1-r7,lr}              @ save registers\n    mov r4,#0                    @ counter number of successes\n    mov r2,#0                    @ counter prisonner\n1:\n    mov r5,#0                    @ counter test\n    mov r1,r2                    @ first test = N\u00b0 prisonner\n2:\n    ldr r3,[r0,r1,lsl #2]        @ load N\u00b0 door\n    cmp r3,r2\n    addeq r4,r4,#1               @ equal -> succes\n    beq 3f\n    mov r1,r3                    @ new test with N\u00b0 door\n    add r5,r5,#1                 \n    cmp r5,#NBDOORS / 2          @ test number maxi\u00a0?\n    blt 2b\n3:\n    add r2,r2,#1                 @ other prisonner\n    cmp r2,#NBDOORS\n    blt 1b\n    \n    mov r0,r4\n100:\n    pop {r1-r7,lr}\n    bx lr                        @ return \n/******************************************************************/\n/*     knuth Shuffle                                  */ \n/******************************************************************/\n/* r0 contains the address of table */\n/* r1 contains the number of elements */\nknuthShuffle:\n    push {r2-r5,lr}                   @ save registers\n    mov r5,r0                         @ save table address\n    mov r2,#0                         @ start index\n1:\n    mov r0,r2                         @ generate aleas\n    bl genereraleas\n    ldr r3,[r5,r2,lsl #2]             @ swap number on the table\n    ldr r4,[r5,r0,lsl #2]\n    str r4,[r5,r2,lsl #2]\n    str r3,[r5,r0,lsl #2]\n    add r2,#1                         @ next number\n    cmp r2,r1                         @ end\u00a0?\n    blt 1b                            @ no -> loop\n100:\n    pop {r2-r5,lr}\n    bx lr                             @ return \n/***************************************************/\n/*   Generation random number                  */\n/***************************************************/\n/* r0 contains limit  */\ngenereraleas:\n    push {r1-r4,lr}                   @ save registers \n    ldr r4,iAdriGraine\n    ldr r2,[r4]\n    ldr r3,iNbDep1\n    mul r2,r3,r2\n    ldr r3,iNbDep1\n    add r2,r2,r3\n    str r2,[r4]                       @ maj de la graine pour l appel suivant \n    cmp r0,#0\n    beq 100f\n    mov r1,r0                         @ divisor\n    mov r0,r2                         @ dividende\n    bl division\n    mov r0,r3                         @ r\u00e9sult = remainder\n  \n100:                                  @ end function\n    pop {r1-r4,lr}                    @ restaur registers\n    bx lr                             @ return\n/*****************************************************/\niAdriGraine: .int iGraine\niNbDep1:     .int 0x343FD\niNbDep2:     .int 0x269EC3 \n/***************************************************/\n/*      ROUTINES INCLUDE                           */\n/***************************************************/\n.include \"../affichage.inc\"",
        "safe": true
    },
    {
        "filename": "100 prisoners_150.txt",
        "content": "\n\nruns 100000\nPercent saved opt.strategy: 31.165\nPercent saved random strategy: 0.0\n\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_151.txt",
        "content": "/*REXX program to simulate the problem of 100 prisoners:  random,  and optimal strategy.*/\nparse arg men trials seed .                      /*obtain optional arguments from the CL*/\nif    men=='' |    men==\",\"  then    men=    100 /*number of   prisoners   for this run.*/\nif trials=='' | trials==\",\"  then trials= 100000 /*  \"     \"  simulations   \"    \"   \"  */\nif datatype(seed, 'W')  then call random ,,seed  /*seed for the random number generator.*/\ntry= men % 2;                swaps= men * 3      /*number tries for searching for a card*/\n$.1= ' a simple ';           $.2= \"an optimal\"   /*literals used for the SAY instruction*/\nsay center(' running'  commas(trials)   \"trials with\"  commas(men)  'prisoners ', 70, \"\u2550\")\nsay\n    do strategy=1  for 2;    pardons= 0          /*perform the two types of strategies. */\n\n      do trials;             call gCards         /*do trials for a strategy;  gen cards.*/\n        do p=1  for men  until failure           /*have each prisoner go through process*/\n        if strategy==1  then failure= simple()   /*Is 1st strategy?  Use simple strategy*/\n                        else failure= picker()   /* \" 2nd     \"       \"  optimal   \"    */\n        end   /*p*/                              /*FAILURE \u2261 1?  Then a prisoner failed.*/\n      if #==men  then pardons= pardons + 1       /*was there a pardon of all prisoners? */\n      end     /*trials*/                         /*if 1 prisoner fails, then they all do*/\n\n    pc= format( pardons/trials*100, , 3);                           _= left('', pc<10)\n    say right('Using', 9)  $.strategy  \"strategy yields pardons \"   _||pc\"%  of the time.\"\n    end       /*strategy*/\nexit                                             /*stick a fork in it,  we're all done. */\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\ncommas:  parse arg _;  do c=length(_)-3  to 1  by -3; _= insert(',', _, c); end;  return _\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\ngCards: #= 0;                do j=1  for men;  @.j= j             /*define seq. of cards*/\n                             end   /*j*/                          /*same as seq. of men.*/\n               do swaps;             a= random(1, men)            /*get 1st rand number.*/\n                   do until  b\\==a;  b= random(1, men)            /* \"  2nd   \"     \"   */\n                   end   /*until*/                                /* [\u2191] ensure A \u00ac== B */\n               parse value  @.a @.b  with  @.b @.a                /*swap 2 random cards.*/\n               end       /*swaps*/;  return\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nsimple: !.= 0; do try;         do until !.?==0; ?= random(1, men) /*get random card \u00b7\u00b7\u00b7 */\n                               end   /*until*/                    /*\u00b7\u00b7\u00b7 not used before.*/\n               if @.?==p  then do;   #= #+1;  return 0;  end      /*found his own card? */\n               !.?= 1                                             /*flag as being used. */\n               end   /*try*/;        return 1                     /*didn't find his card*/\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\npicker: ?= p;  do try; if @.?==p  then do;   #= #+1;    return 0  /*Found his own card? */\n                                       end       /* [\u2191]  indicate success for prisoner. */\n               ?= @.?                            /*choose next drawer from current card.*/\n               end   /*try*/;        return 1    /*choose half of the number of drawers.*/\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_152.txt",
        "content": "\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550 running 100,000 trials with 100 prisoners \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\n    Using  a simple  strategy yields pardons   0.000%  of the time.\n    Using an optimal strategy yields pardons  31.186%  of the time.\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_153.txt",
        "content": "\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550 running 100,000 trials with 10 prisoners \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\n    Using  a simple  strategy yields pardons   0.086%  of the time.\n    Using an optimal strategy yields pardons  31.204%  of the time.\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_154.txt",
        "content": "prisoners = [*1..100]\nN = 10_000\ngenerate_rooms = ->{ [nil]+[*1..100].shuffle }\n \nres = N.times.count do\n  rooms = generate_rooms[]\n  prisoners.all? {|pr| rooms[1,100].sample(50).include?(pr)}\nend\nputs \"Random strategy\u00a0: %11.4f\u00a0%%\" % (res.fdiv(N) * 100)\n\nres = N.times.count do\n  rooms = generate_rooms[]\n  prisoners.all? do |pr|\n    cur_room = pr\n    50.times.any? do\n      found = (rooms[cur_room] == pr)\n      cur_room = rooms[cur_room]\n      found\n    end\n  end\nend\nputs \"Optimal strategy: %11.4f\u00a0%%\" % (res.fdiv(N) * 100)\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_155.txt",
        "content": "Random strategy\u00a0:      0.0000\u00a0%\nOptimal strategy:     30.7400\u00a0%\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_156.txt",
        "content": "[dependencies]\nrand = '0.7.2'\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_157.txt",
        "content": "extern crate rand;\n\nuse rand::prelude::*;\n\n// Do a full run of checking boxes in a random order for a single prisoner\nfn check_random_boxes(prisoner: u8, boxes: &[u8]) -> bool {\n    let checks = {\n        let mut b: Vec<u8> = (1u8..=100u8).collect();\n        b.shuffle(&mut rand::thread_rng());\n        b\n    };\n    checks.into_iter().take(50).any(|check| boxes[check as usize - 1] == prisoner)\n}\n\n// Do a full run of checking boxes in the optimized order for a single prisoner\nfn check_ordered_boxes(prisoner: u8, boxes: &[u8]) -> bool {\n    let mut next_check = prisoner;\n    (0..50).any(|_| {\n        next_check = boxes[next_check as usize - 1];\n        next_check == prisoner\n    })\n}\n\nfn main() {\n    let mut boxes: Vec<u8> = (1u8..=100u8).collect();\n\n    let trials = 100000;\n\n    let ordered_successes = (0..trials).filter(|_| {\n        boxes.shuffle(&mut rand::thread_rng());\n        (1u8..=100u8).all(|prisoner| check_ordered_boxes(prisoner, &boxes))\n    }).count();\n\n    let random_successes = (0..trials).filter(|_| {\n        boxes.shuffle(&mut rand::thread_rng());\n        (1u8..=100u8).all(|prisoner| check_random_boxes(prisoner, &boxes))\n    }).count();\n\n    println!(\"{} / {} ({:.02}%) successes in ordered\", ordered_successes, trials, ordered_successes as f64 * 100.0 / trials as f64);\n    println!(\"{} / {} ({:.02}%) successes in random\", random_successes, trials, random_successes as f64 * 100.0 / trials as f64);\n\n}\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_158.txt",
        "content": "31106 / 100000 (31.11%) successes in ordered\n0 / 100000 (0.00%) successes in random",
        "safe": true
    },
    {
        "filename": "100 prisoners_159.txt",
        "content": "class MAIN is\n   shuffle (a: ARRAY{INT}) is\n      ARR_PERMUTE_ALG{INT, ARRAY{INT}}::shuffle(a);\n   end;\n\n   try_random (n: INT, drawers: ARRAY{INT}, tries: INT): BOOL is\n      my_tries\u00a0::= drawers.inds; shuffle(my_tries);\n      loop tries.times!;\n         if drawers[my_tries.elt!] = n then return true; end;\n      end;\n      return false;\n   end;\n\n   try_optimal (n: INT, drawers: ARRAY{INT}, tries: INT): BOOL is\n      num\u00a0::= n;\n      loop tries.times!;\n         num\u00a0:= drawers[num];\n         if num = n then return true; end;\n      end;\n      return false;\n   end;\n\n   stats (label: STR, rounds, successes: INT): STR is\n      return #FMT(\"<^###########>: <#######> rounds. Successes: <#######> (<##.###>%%)\\n\",\n                   label, rounds, successes, (successes.flt / rounds.flt)*100.0).str;\n   end;\n\n   try (name: STR, nrounds, ndrawers, npris, ntries: INT,\n        strategy: ROUT{INT,ARRAY{INT},INT}:BOOL)\n   is\n      drawers: ARRAY{INT}\u00a0:= #(ndrawers);\n      loop drawers.set!(drawers.ind!); end;\n      successes\u00a0::= 0;\n      loop nrounds.times!;\n         shuffle(drawers);\n         success\u00a0::= true;\n         loop\n            n\u00a0::= npris.times!;\n            if ~strategy.call(n, drawers, ntries) then\n               success\u00a0:= false;\n               break!;\n            end;\n         end;\n         if success then successes\u00a0:= successes + 1; end;\n      end;\n      #OUT + stats(name, nrounds, successes);\n   end;\n\n   main is\n      RND::seed\u00a0:= #TIMES.wall_time;\n      #OUT +\"100 prisoners, 100 drawers, 50 tries:\\n\";\n      try(\"random\",  100000, 100, 100, 50, bind(try_random(_, _, _)));\n      try(\"optimal\", 100000, 100, 100, 50, bind(try_optimal(_, _, _)));\n\n      #OUT +\"\\n10 prisoners, 10 drawers, 5 tries:\\n\";\n      try(\"random\",  100000, 10, 10, 5, bind(try_random(_, _, _)));\n      try(\"optimal\", 100000, 10, 10, 5, bind(try_optimal(_, _, _)));\n   end;\nend;",
        "safe": true
    },
    {
        "filename": "100 prisoners_16.txt",
        "content": "Random strategie \u00a0: 0           sur 1000\nOptimal strategie\u00a0: 303         sur 1000\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_160.txt",
        "content": "100 prisoners, 100 drawers, 50 tries:\nrandom     \u00a0:  100000 rounds. Successes:       0 ( 0.000%)\noptimal    \u00a0:  100000 rounds. Successes:   31378 (31.378%)\n\n10 prisoners, 10 drawers, 5 tries:\nrandom     \u00a0:  100000 rounds. Successes:     113 ( 0.113%)\noptimal    \u00a0:  100000 rounds. Successes:   35633 (35.633%)",
        "safe": true
    },
    {
        "filename": "100 prisoners_161.txt",
        "content": "import scala.util.Random\nimport scala.util.control.Breaks._\n\nobject Main {\n  def playOptimal(n: Int): Boolean = {\n    val secretList = Random.shuffle((0 until n).toBuffer)\n\n    for (i <- secretList.indices) {\n      var prev = i\n      breakable {\n        for (_ <- 0 until secretList.size / 2) {\n          if (secretList(prev) == i) {\n            break()\n          }\n          prev = secretList(prev)\n        }\n        return false\n      }\n    }\n\n    true\n  }\n\n  def playRandom(n: Int): Boolean = {\n    val secretList = Random.shuffle((0 until n).toBuffer)\n\n    for (i <- secretList.indices) {\n      val trialList = Random.shuffle((0 until n).toBuffer)\n\n      breakable {\n        for (j <- 0 until trialList.size / 2) {\n          if (trialList(j) == i) {\n            break()\n          }\n        }\n        return false\n      }\n    }\n\n    true\n  }\n\n  def exec(n: Int, p: Int, play: Int => Boolean): Double = {\n    var succ = 0.0\n    for (_ <- 0 until n) {\n      if (play(p)) {\n        succ += 1\n      }\n    }\n    (succ * 100.0) / n\n  }\n\n  def main(args: Array[String]): Unit = {\n    val n = 100000\n    val p = 100\n    printf(\"# of executions:\u00a0%,d\\n\", n)\n    printf(\"Optimal play success rate: %f%%\\n\", exec(n, p, playOptimal))\n    printf(\"Random play success rate: %f%%\\n\", exec(n, p, playRandom))\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_162.txt",
        "content": "# of executions: 100,000\nOptimal play success rate: 31.201000%\nRandom play success rate: 0.000000%",
        "safe": true
    },
    {
        "filename": "100 prisoners_163.txt",
        "content": "program prisoners;\n    setrandom(0);\n    \n    strategies\u00a0:= {\n        [\"Optimal\", routine optimal_strategy],\n        [\"Random\", routine random_strategy]\n    };\n    \n    runs\u00a0:= 10000;\n\n    loop for strategy = strategies(name) do\n        successes\u00a0:= run_simulations(strategy, runs);\n        print(rpad(name + \":\", 10), successes * 100 / runs, \"%\");\n    end loop;\n    \n    proc run_simulations(strategy, amount);\n        loop for i in [1..amount] do\n            successes +:= if simulate(strategy) then 1 else 0 end;\n        end loop;\n        return successes; \n    end proc;\n    \n    proc simulate(strategy);\n        drawers\u00a0:= [1..100];\n        shuffle(drawers);\n        loop for prisoner in [1..100] do\n            if not call(strategy, drawers, prisoner) then\n                return false;\n            end if;\n        end loop;\n        return true;\n    end proc;\n    \n    proc optimal_strategy(drawers, prisoner);\n        d\u00a0:= prisoner;\n        loop for s in [1..50] do\n            if (d\u00a0:= drawers(d)) = prisoner then\n                return true;\n            end if;\n        end loop;\n        return false;\n    end proc;\n    \n    proc random_strategy(drawers, prisoner);\n        loop for s in [1..50] do\n            if drawers(1+random(#drawers-1)) = prisoner then\n                return true;\n            end if;\n        end loop;\n        return false;\n    end proc;\n    \n    proc shuffle(rw drawers);\n        loop for i in [1..#drawers] do\n            j\u00a0:= i+random(#drawers-i);\n            [drawers(i), drawers(j)]\u00a0:= [drawers(j), drawers(i)];\n        end loop;\n    end proc;\nend program;",
        "safe": true
    },
    {
        "filename": "100 prisoners_164.txt",
        "content": "Optimal:   31.26\u00a0%\nRandom:    0\u00a0%",
        "safe": true
    },
    {
        "filename": "100 prisoners_165.txt",
        "content": "// ==========================================================================\n// START-SuperCollider solution to Rosetta Code TASK: 100 prisoners\t\t\t\t  ## BY: MusicCoder\u00a0: 2024-06-08 ##\n// ==========================================================================\n\n(\n/* ## BY: MusicCoder\u00a0: 2024-06-08 ##\nhttps://rosettacode.org/wiki/100_prisoners\nTHE TASK: Simulate the 100-prisoners game and compare two strategies\n1: random choice, 2: follow the cards.\n\n*** My preferance - make a function to play the game\n ... and feed it a function for each strategy ***\nUse 0..99 rather than 1..100 for player, card and drawer numbers\n\nWhat can a player possibly know?\n1. Player number\n2. Current turn number\n3. Previous drawer picked \u00a0: -1 means no previous as yet\n4. Previous card value   \u00a0: -1 means no previous as yet\n5. Number of drawers ( PROBABLY == number of players)\n6. Number of turns\n\n--- These parameters should be good for a lot of different strategies ---\n\nStatergy function will get called with values for these six parameters\nStatergy function should return a drawerNumber\n*/\n// =============================================================================\n// *** THE REQUIRED STRATEGY FUNCTIONS ***\n// =============================================================================\n//  strategyRandom: Pick a drawer number at random\nvar strategyRandom = {\n  |turnNumber, previousDrawer, previousCard, playerNumber, numDrawers, numTurns|\n\n  var drawerPicked = numDrawers.rand;\n  drawerPicked;\n};\n// =============================================================================\n//  strategyFollow: Start at drawerNumber = playerNumber, then follow the cardNumbers\nvar strategyFollow = {\n  |turnNumber, previousDrawer, previousCard, playerNumber, numDrawers, numTurns|\n\n  var drawerPicked = if ( (previousCard == -1), {playerNumber}, {previousCard});\n  drawerPicked;\n};\n\n// =============================================================================\n/* ### playGame: Function to play the game ###\n// =============================================================================\nTwo loops: outer loop over players, inner loop over turns for each player\nThe core of the inner loop calls the supplied stratergy function\n ... passing in values for the six parameters:\nturnNumber, previousDrawer, previousCard, playerNumber, numDrawers, numTurns\nThe stratergy function responds with the number of the drawer it has picked\n ... for the current turn\n*/\nvar playGame = {\n  |strategy, strategyName=\"\", numPlayers=100, numDrawers=100, numTurns=50, numSims=10000|\n  var percentWins=0;\n  var countWins=0;\n  var drawers=Array.iota(numPlayers);  // fill array with player numbers 0..99\n\n  numSims.do{\n    var playerWon = true;  // as soon as one player fails - exit this simulation\n    var playerNumber = 0;  // first player\n\n   drawers = drawers.scramble;  // randomly reorder the cards in the drawers\n\n    while(// loop until the last player or until any player fails\n      {playerNumber<numPlayers && playerWon},\n      { // *** call the supplied strategy function numTurns times --- for the current player***\n        var drawerPicked = -1;\n        var cardPicked   = -1;\n        var turnNumber   = 0;\n        var found        = false;\n\n        while ( // loop through numTurns, but exit if player card found\n          {(turnNumber<numTurns) && not(found)},\n          {\n            drawerPicked = strategy.( // call the supplied strategy function\n              turnNumber, drawerPicked, cardPicked, playerNumber, numDrawers, numTurns);\n\n            cardPicked = drawers[drawerPicked];\n\n            found = playerNumber == cardPicked;\n\n            turnNumber = turnNumber + 1;\n          };);\n\n        playerWon = found;  // did this player find his card\n\n        playerNumber = playerNumber + 1;  // move to the next player\n    };); // end of INNER while loop\n\n    if (playerWon) {countWins = countWins + 1};\n  }; // end of OUTER while loop -- end of all simulations\n\n  percentWins = 100 * (countWins / numSims);\n  postf(\"For:\u00a0% number of wins was=% in\u00a0% simulations =\u00a0%\\\\% wins\\n\",\n    strategyName, countWins, numSims, percentWins);\n};\nplayGame.(strategyRandom, \"strategyRandom\");\nplayGame.(strategyFollow, \"strategyFollow\");\n\"\\n\";// interpreter posts the value of the last expression - so make that just a blank line\n// =============================================================================\n)\n\n// ==========================================================================\n// **END-SuperCollider solution to Rosetta Code TASK: 100 prisoners\t\t\t\t  ## BY: MusicCoder\u00a0: 2024-06-08 ##\n// ==========================================================================\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_166.txt",
        "content": "For: strategyRandom number of wins was=0 in 10000 simulations = 0.0% wins\nFor: strategyFollow number of wins was=3051 in 10000 simulations = 30.51% wins\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_167.txt",
        "content": "import Foundation\n\nstruct PrisonersGame {\n  let strategy: Strategy\n  let numPrisoners: Int\n  let drawers: [Int]\n\n  init(numPrisoners: Int, strategy: Strategy) {\n    self.numPrisoners = numPrisoners\n    self.strategy = strategy\n    self.drawers = (1...numPrisoners).shuffled()\n  }\n\n  @discardableResult\n  func play() -> Bool {\n    for num in 1...numPrisoners {\n      guard findNumber(num) else {\n        return false\n      }\n    }\n\n    return true\n  }\n\n  private func findNumber(_ num: Int) -> Bool {\n    var tries = 0\n    var nextDrawer = num - 1\n\n    while tries < 50 {\n      tries += 1\n\n      switch strategy {\n      case .random where drawers.randomElement()! == num:\n        return true\n      case .optimum where drawers[nextDrawer] == num:\n        return true\n      case .optimum:\n        nextDrawer = drawers[nextDrawer] - 1\n      case _:\n        continue\n      }\n    }\n\n    return false\n  }\n\n  enum Strategy {\n    case random, optimum\n  }\n}\n\nlet numGames = 100_000\nlet lock = DispatchSemaphore(value: 1)\nvar done = 0\n\nprint(\"Running \\(numGames) games for each strategy\")\n\nDispatchQueue.concurrentPerform(iterations: 2) {i in\n  let strat = i == 0 ? PrisonersGame.Strategy.random : .optimum\n  var numPardoned = 0\n\n  for _ in 0..<numGames {\n    let game = PrisonersGame(numPrisoners: 100, strategy: strat)\n\n    if game.play() {\n      numPardoned += 1\n    }\n  }\n\n  print(\"Probability of pardon with \\(strat) strategy: \\(Double(numPardoned) / Double(numGames))\")\n\n  lock.wait()\n  done += 1\n  lock.signal()\n\n  if done == 2 {\n    exit(0)\n  }\n}\n\ndispatchMain()\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_168.txt",
        "content": "Running 100000 games for each strategy\nProbability of pardon with optimum strategy: 0.31099\nProbability of pardon with random strategy: 0.0",
        "safe": true
    },
    {
        "filename": "100 prisoners_169.txt",
        "content": "set Samples 10000\nset Prisoners 100\nset MaxGuesses 50\nset Strategies {random optimal}\n\n# returns a random number between 0 and N-1.\nproc random {n} {\n  expr int(rand()*$n)\n}\n\n# Returns a list from 0 to N-1.\nproc range {n} {\n  set res {}\n  for {set i 0} {$i < $n} {incr i} {\n    lappend res $i\n  }\n  return $res\n}\n\n# Returns shuffled LIST.\nproc nshuffle {list} {\n    set len [llength $list]\n    while {$len} {\n        set n [expr {int($len * rand())}]\n        set tmp [lindex $list $n]\n        lset list $n [lindex $list [incr len -1]]\n        lset list $len $tmp\n    }\n    return $list\n}\n\n# Returns a list of shuffled drawers.\nproc buildDrawers {} {\n  global Prisoners\n  nshuffle [range $Prisoners]\n}\n\n# Returns true if P is found in DRAWERS within $MaxGuesses attempts using a\n# random strategy.\nproc randomStrategy {drawers p} {\n  global Prisoners MaxGuesses\n  foreach i [range $MaxGuesses] {\n    if {$p == [lindex $drawers [random $Prisoners]]} {\n      return 1\n    }\n  }\n  return 0\n}\n\n# Returns true if P is found in DRAWERS within $MaxGuesses attempts using an\n# optimal strategy.\nproc optimalStrategy {drawers p} {\n  global Prisoners MaxGuesses\n  set j $p\n  foreach i [range $MaxGuesses] {\n    set k [lindex $drawers $j]\n    if {$k == $p} {\n      return 1\n    }\n    set j $k\n  }\n  return 0\n}\n\n# Returns true if all prisoners find their number using the given STRATEGY.\nproc run100prisonersProblem {strategy} {\n  global Prisoners\n  set drawers [buildDrawers]\n  foreach p [range $Prisoners] {\n    if {![$strategy $drawers $p]} {\n      return 0\n    }\n  }\n  return 1\n}\n\n# Runs the given STRATEGY $Samples times and returns the number of times all\n# prisoners succeed.\nproc sampling {strategy} {\n  global Samples\n  set successes 0\n  foreach s [range $Samples] {\n    if {[run100prisonersProblem $strategy]} {\n      incr successes\n    }\n  }\n  return $successes\n}\n\n# Returns true if the given STRING starts with a vowel.\nproc startsWithVowel {string} {\n  expr [lsearch -exact {a e i o u} [string index $string 0]] >= 0\n}\n\n# Runs each of the STRATEGIES and prints a report on how well they\n# worked.\nproc compareStrategies {strategies} {\n  global Samples\n  set fmt \"Using %s %s strategy, the prisoners were freed in %5.2f%% of the cases.\"\n  foreach strategy $strategies {\n    set article [expr [startsWithVowel $strategy] ? {\"an\"} : {\"a\"}]\n    set pct [expr [sampling ${strategy}Strategy] / $Samples.0 * 100]\n    puts [format $fmt $article $strategy $pct]\n  }\n}\n\ncompareStrategies $Strategies\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_17.txt",
        "content": "unplanned: function [][\n    drawers: shuffle @1..100\n    every? 1..100 'x -> some? 1..50 => [x = sample drawers]\n]\n\nplanned: function [][\n    drawers: shuffle @1..100\n    every? 1..100 'x [\n        next: x\n        some? 1..50 => [x = next: <= drawers\\[next-1]]\n    ]\n]\n\ntest: function [f][\n    count: enumerate 10000 => [call f []]\n    print [f ~\"|mul fdiv count 10000 100|%\"]\n]\n\ntest 'unplanned\ntest 'planned\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_170.txt",
        "content": "Using a random strategy, the prisoners were freed in  0.00% of the cases.\nUsing an optimal strategy, the prisoners were freed in 32.35% of the cases.",
        "safe": true
    },
    {
        "filename": "100 prisoners_171.txt",
        "content": "USE rosettacode;\nGO\n\nSET NOCOUNT ON;\nGO\n\nCREATE TABLE dbo.numbers (n INT PRIMARY KEY);\nGO\n\n-- NOTE If you want to play more than 10000 games, you need to extend the query generating the numbers table by adding\n-- next cross joins. Now the table contains enough values to solve the task and it takes less processing time.\n\nWITH sample100 AS (\n    SELECT TOP(100) object_id\n    FROM master.sys.objects\n)\nINSERT numbers\n    SELECT ROW_NUMBER() OVER (ORDER BY A.object_id) AS n\n    FROM sample100 AS A\n        CROSS JOIN sample100 AS B;\nGO\n\nCREATE TABLE dbo.drawers (drawer INT PRIMARY KEY, card INT);\nGO\n\nCREATE TABLE dbo.results (strategy VARCHAR(10), game INT, result BIT, PRIMARY KEY (game, strategy));\nGO\n\nCREATE PROCEDURE dbo.shuffleDrawers @prisonersCount INT\nAS BEGIN\n    SET NOCOUNT ON;\n\n    IF NOT EXISTS (SELECT * FROM drawers)\n        INSERT drawers (drawer, card)\n        SELECT n AS drawer, n AS card\n        FROM numbers\n        WHERE n <= @prisonersCount;\n\n    DECLARE @randoms TABLE (n INT, random INT);\n    DECLARE @n INT = 1;\n    WHILE @n <= @prisonersCount BEGIN\n        INSERT @randoms VALUES (@n, ROUND(RAND() * (@prisonersCount - 1), 0) + 1);\n\n        SET @n = @n + 1;\n    END;\n\n    WITH ordered AS (\n        SELECT ROW_NUMBER() OVER (ORDER BY random ASC) AS drawer,\n            n AS card\n        FROM @randoms\n    )\n    UPDATE drawers\n    SET card = o.card\n    FROM drawers AS s\n        INNER JOIN ordered AS o\n            ON o.drawer = s.drawer;\nEND\nGO\n\nCREATE PROCEDURE dbo.find @prisoner INT, @strategy VARCHAR(10)\nAS BEGIN\n    -- A prisoner can open no more than 50 drawers.\n    DECLARE @drawersCount INT = (SELECT COUNT(*) FROM drawers);\n    DECLARE @openMax INT = @drawersCount / 2;\n\n    -- Prisoners start outside the room.\n    DECLARE @card INT = NULL;\n    DECLARE @open INT = 1;\n    WHILE @open <= @openMax BEGIN\n        -- A prisoner tries to find his own number.\n        IF @strategy = 'random' BEGIN\n            DECLARE @random INT = ROUND(RAND() * (@drawersCount - 1), 0) + 1;\n            SET @card = (SELECT TOP(1) card FROM drawers WHERE drawer = @random);\n        END\n        IF @strategy = 'optimal' BEGIN\n            IF @card IS NULL BEGIN\n                SET @card = (SELECT TOP(1) card FROM drawers WHERE drawer = @prisoner);\n            END ELSE BEGIN\n                SET @card = (SELECT TOP(1) card FROM drawers WHERE drawer = @card);\n            END\n        END\n\n        -- A prisoner finding his own number is then held apart from the others.\n        IF @card = @prisoner\n            RETURN 1;\n\n        SET @open = @open + 1;\n    END\n\n    RETURN 0;\nEND\nGO\n\nCREATE PROCEDURE dbo.playGame @gamesCount INT, @strategy VARCHAR(10), @prisonersCount INT = 100\nAS BEGIN\n    SET NOCOUNT ON;\n\n    IF @gamesCount <> (SELECT COUNT(*) FROM results WHERE strategy = @strategy) BEGIN\n        DELETE results\n        WHERE strategy = @strategy;\n\n        INSERT results (strategy, game, result)\n        SELECT @strategy AS strategy, n AS game, 0 AS result\n        FROM numbers\n        WHERE n <= @gamesCount;\n    END\n\n    UPDATE results\n    SET result = 0\n    WHERE strategy = @strategy;\n\n    DECLARE @game INT = 1;\n    WHILE @game <= @gamesCount BEGIN\n        -- A room having a cupboard of 100 opaque drawers numbered 1 to 100, that cannot be seen from outside.\n        -- Cards numbered 1 to 100 are placed randomly, one to a drawer, and the drawers all closed; at the start.\n        EXECUTE shuffleDrawers @prisonersCount;\n\n        -- A prisoner tries to find his own number.\n        -- Prisoners start outside the room.\n        -- They can decide some strategy before any enter the room.\n        DECLARE @prisoner INT = 1;\n        DECLARE @found INT = 0;\n        WHILE @prisoner <= @prisonersCount BEGIN\n            EXECUTE @found = find @prisoner, @strategy;\n            IF @found = 1\n                SET @prisoner = @prisoner + 1;\n            ELSE\n                BREAK;\n        END;\n\n        -- If all 100 findings find their own numbers then they will all be pardoned. If any don't then all sentences stand.\n        IF @found = 1\n            UPDATE results SET result = 1 WHERE strategy = @strategy AND game = @game;\n    \n        SET @game = @game + 1;\n    END\nEND\nGO\n\nCREATE FUNCTION dbo.computeProbability(@strategy VARCHAR(10))\nRETURNS decimal (18, 2)\nAS BEGIN\n    RETURN (\n        SELECT (SUM(CAST(result AS INT)) * 10000 / COUNT(*)) / 100\n        FROM results\n        WHERE strategy = @strategy\n    );\nEND\nGO\n\n-- Simulate several thousand instances of the game:\nDECLARE @gamesCount INT = 2000;\n\n-- ...where the prisoners randomly open drawers.\nEXECUTE playGame @gamesCount, 'random';\n\n-- ...where the prisoners use the optimal strategy mentioned in the Wikipedia article.\nEXECUTE playGame @gamesCount, 'optimal';\n\n-- Show and compare the computed probabilities of success for the two strategies.\nDECLARE @log VARCHAR(max);\nSET @log = CONCAT('Games count: ', @gamesCount);\nRAISERROR (@log, 0, 1) WITH NOWAIT;\nSET @log = CONCAT('Probability of success with \"random\" strategy: ', dbo.computeProbability('random'));\nRAISERROR (@log, 0, 1) WITH NOWAIT;\nSET @log = CONCAT('Probability of success with \"optimal\" strategy: ', dbo.computeProbability('optimal'));\nRAISERROR (@log, 0, 1) WITH NOWAIT;\nGO\n\nDROP FUNCTION dbo.computeProbability;\nDROP PROCEDURE dbo.playGame;\nDROP PROCEDURE dbo.find;\nDROP PROCEDURE dbo.shuffleDrawers;\nDROP TABLE dbo.results;\nDROP TABLE dbo.drawers;\nDROP TABLE dbo.numbers;\nGO",
        "safe": true
    },
    {
        "filename": "100 prisoners_172.txt",
        "content": "Games count: 2000\nProbability of success with \"random\" strategy: 0.00 \nProbability of success with \"optimal\" strategy: 31.00",
        "safe": true
    },
    {
        "filename": "100 prisoners_173.txt",
        "content": "#lang transd\n\nMainModule: {\nsimRandom: (\u03bb numPris Int() nRuns Int()\n    locals: nSucc 0.0\n    (for n in Range(nRuns) do\n        (with draws (for i in Range(numPris) project i) succ 1\n            (for prisN in Range(numPris) do\n                (shuffle draws)\n                (if (not (is-el Range(in: draws 0 (/ numPris 2)) prisN))\n                    (= succ 0) break))\n            (+= nSucc succ)\n    )   )\n    (ret (* (/ nSucc nRuns) 100))\n),\n\nsimOptimal: (\u03bb numPris Int() nRuns Int()\n    locals: nSucc 0.0\n    (for n in Range(nRuns) do\n        (with draws (for i in Range(numPris) project i) succ 0 nextDraw 0\n            (shuffle draws)\n            (for prisN in Range(numPris) do (= nextDraw prisN) (= succ 0)\n                (for i in Range( (/ numPris 2)) do\n                    (= nextDraw (get draws nextDraw))\n                    (if (== nextDraw prisN) (= succ 1) break))\n                (if (not succ) break))\n            (+= nSucc succ)\n    )   )\n    (ret (* (/ nSucc nRuns) 100))\n),\n\n_start: (\u03bb\n    (lout prec: 4 :fixed \"Random play:    \" (simRandom 100 10000) \"% of wins\")\n    (lout \"Strategic play: \" (simOptimal 100 10000)  \"% of wins\")\n    (lout \"Check random play:    \" (simRandom 10 100000)  \"% of wins\")\n)\n}\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_174.txt",
        "content": "Random play:    0.0000% of wins\nStrategic play: 31.4500% of wins\nCheck random play:    0.1040% of wins\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_175.txt",
        "content": "Sub HundredPrisoners()\n\n    NumberOfPrisoners = Int(InputBox(\"Number of Prisoners\", \"Prisoners\", 100))\n    Tries = Int(InputBox(\"Numer of Tries\", \"Tries\", 1000))\n    Selections = Int(InputBox(\"Number of Selections\", \"Selections\", NumberOfPrisoners / 2))\n\n    StartTime = Timer\n\n    AllFoundOptimal = 0\n    AllFoundRandom = 0\n    AllFoundRandomMem = 0\n\n    For i = 1 To Tries\n        OptimalCount = HundredPrisoners_Optimal(NumberOfPrisoners, Selections)\n        RandomCount = HundredPrisoners_Random(NumberOfPrisoners, Selections)\n        RandomMemCount = HundredPrisoners_Random_Mem(NumberOfPrisoners, Selections)\n        \n        If OptimalCount = NumberOfPrisoners Then\n            AllFoundOptimal = AllFoundOptimal + 1\n        End If\n        If RandomCount = NumberOfPrisoners Then\n            AllFoundRandom = AllFoundRandom + 1\n        End If\n        If RandomMemCount = NumberOfPrisoners Then\n            AllFoundRandomMem = AllFoundRandomMem + 1\n        End If\n    Next i\n\n\n    ResultString = \"Optimal: \" & AllFoundOptimal & \" of \" & Tries & \": \" & AllFoundOptimal / Tries * 100 & \"%\"\n    ResultString = ResultString & Chr(13) & \"Random: \" & AllFoundRandom & \" of \" & Tries & \": \" & AllFoundRandom / Tries * 100 & \"%\"\n    ResultString = ResultString & Chr(13) & \"RandomMem: \" & AllFoundRandomMem & \" of \" & Tries & \": \" & AllFoundRandomMem / Tries * 100 & \"%\"\n\n    EndTime = Timer\n\n    ResultString = ResultString & Chr(13) & \"Elapsed Time: \" & Round(EndTime - StartTime, 2) & \" s\"\n    ResultString = ResultString & Chr(13) & \"Trials/sec: \" & Tries / Round(EndTime - StartTime, 2)\n\n    MsgBox ResultString, vbOKOnly, \"Results\"\n\nEnd Sub\n\nFunction HundredPrisoners_Optimal(ByVal NrPrisoners, ByVal NrSelections) As Long\n    Dim DrawerArray() As Long\n    \n    ReDim DrawerArray(NrPrisoners - 1)\n    \n    For Counter = LBound(DrawerArray) To UBound(DrawerArray)\n        DrawerArray(Counter) = Counter + 1\n    Next Counter\n\n    FisherYates DrawerArray\n    \n    For i = 1 To NrPrisoners\n        NumberFromDrawer = DrawerArray(i - 1)\n        For j = 1 To NrSelections - 1\n            If NumberFromDrawer = i Then\n                FoundOwnNumber = FoundOwnNumber + 1\n                Exit For\n            End If\n            NumberFromDrawer = DrawerArray(NumberFromDrawer - 1)\n        Next j\n    Next i\n    HundredPrisoners_Optimal = FoundOwnNumber\nEnd Function\n\nFunction HundredPrisoners_Random(ByVal NrPrisoners, ByVal NrSelections) As Long\n    Dim DrawerArray() As Long\n    ReDim DrawerArray(NrPrisoners - 1)\n    \n    FoundOwnNumber = 0\n    \n    For Counter = LBound(DrawerArray) To UBound(DrawerArray)\n        DrawerArray(Counter) = Counter + 1\n    Next Counter\n\n    FisherYates DrawerArray\n    \n    \n    For i = 1 To NrPrisoners\n        For j = 1 To NrSelections\n            RandomDrawer = Int(NrPrisoners * Rnd)\n            NumberFromDrawer = DrawerArray(RandomDrawer)\n            If NumberFromDrawer = i Then\n                FoundOwnNumber = FoundOwnNumber + 1\n                Exit For\n            End If\n        Next j\n    Next i\n    HundredPrisoners_Random = FoundOwnNumber\nEnd Function\n\nFunction HundredPrisoners_Random_Mem(ByVal NrPrisoners, ByVal NrSelections) As Long\n    Dim DrawerArray() As Long\n    Dim SelectionArray() As Long\n    ReDim DrawerArray(NrPrisoners - 1)\n    ReDim SelectionArray(NrPrisoners - 1)\n    \n    HundredPrisoners_Random_Mem = 0\n    FoundOwnNumberMem = 0\n    \n    For Counter = LBound(DrawerArray) To UBound(DrawerArray)\n        DrawerArray(Counter) = Counter + 1\n    Next Counter\n    \n    For Counter = LBound(SelectionArray) To UBound(SelectionArray)\n        SelectionArray(Counter) = Counter + 1\n    Next Counter\n\n    FisherYates DrawerArray\n    \n    For i = 1 To NrPrisoners\n        FisherYates SelectionArray\n        For j = 1 To NrSelections\n            NumberFromDrawer = DrawerArray(SelectionArray(j - 1) - 1)\n            If NumberFromDrawer = i Then\n                FoundOwnNumberMem = FoundOwnNumberMem + 1\n                Exit For\n            End If\n        Next j\n    Next i\n    HundredPrisoners_Random_Mem = FoundOwnNumberMem\nEnd Function\n\nSub FisherYates(ByRef InputArray() As Long)\n \n    Dim Temp As Long\n    Dim PosRandom As Long\n    Dim Counter As Long\n    Dim Upper As Long\n    Dim Lower As Long\n     \n    Lower = LBound(InputArray)\n    Upper = UBound(InputArray)\n     \n    Randomize\n     \n    For Counter = Upper To (Lower + 1) Step -1\n        PosRandom = CLng(Int((Counter - Lower + 1) * Rnd + Lower))\n        Temp = InputArray(Counter)\n        InputArray(Counter) = InputArray(PosRandom)\n        InputArray(PosRandom) = Temp\n    Next Counter\n \nEnd Sub\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_176.txt",
        "content": "Optimal: 29090 of 100000: 29.09%\nRandom: 0 of 100000: 0%\nRandomMem: 0 of 100000: 0%\nElapsed Time: 388.41 s",
        "safe": true
    },
    {
        "filename": "100 prisoners_177.txt",
        "content": "Module Module1\n\n    Function PlayOptimal() As Boolean\n        Dim secrets = Enumerable.Range(0, 100).OrderBy(Function(a) Guid.NewGuid).ToList\n\n        For p = 1 To 100\n            Dim success = False\n\n            Dim choice = p - 1\n            For i = 1 To 50\n                If secrets(choice) = p - 1 Then\n                    success = True\n                    Exit For\n                End If\n                choice = secrets(choice)\n            Next\n\n            If Not success Then\n                Return False\n            End If\n        Next\n\n        Return True\n    End Function\n\n    Function PlayRandom() As Boolean\n        Dim secrets = Enumerable.Range(0, 100).OrderBy(Function(a) Guid.NewGuid).ToList\n\n        For p = 1 To 100\n            Dim choices = Enumerable.Range(0, 100).OrderBy(Function(a) Guid.NewGuid).ToList\n\n            Dim success = False\n            For i = 1 To 50\n                If choices(i - 1) = p Then\n                    success = True\n                    Exit For\n                End If\n            Next\n\n            If Not success Then\n                Return False\n            End If\n        Next\n\n        Return True\n    End Function\n\n    Function Exec(n As UInteger, play As Func(Of Boolean))\n        Dim success As UInteger = 0\n        For i As UInteger = 1 To n\n            If play() Then\n                success += 1\n            End If\n        Next\n        Return 100.0 * success / n\n    End Function\n\n    Sub Main()\n        Dim N = 1_000_000\n        Console.WriteLine(\"# of executions: {0}\", N)\n        Console.WriteLine(\"Optimal play success rate: {0:0.00000000000}%\", Exec(N, AddressOf PlayOptimal))\n        Console.WriteLine(\" Random play success rate: {0:0.00000000000}%\", Exec(N, AddressOf PlayRandom))\n    End Sub\n\nEnd Module\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_178.txt",
        "content": "# of executions: 1000000\nOptimal play success rate: 31.12990000000%\n Random play success rate: 0.00000000000%",
        "safe": true
    },
    {
        "filename": "100 prisoners_179.txt",
        "content": "option explicit\nconst npris=100\nconst ntries=50\nconst ntests=1000.\ndim drawer(100),opened(100),i\nfor i=1 to npris: drawer(i)=i:next\nshuffle drawer\nwscript.echo rf(tests(false)/ntests*100,10,\" \")  &\"\u00a0% success for random\"\nwscript.echo rf(tests(true) /ntests*100,10,\" \")  &\"\u00a0% success for optimal strategy\"\n\nfunction rf(v,n,s) rf=right(string(n,s)& v,n):end function \n\nsub shuffle(d) 'knut's shuffle\ndim i,j,t\nrandomize timer\nfor i=1 to npris\n   j=int(rnd()*i+1)\n   t=d(i):d(i)=d(j):d(j)=t\nnext\nend sub\n\nfunction tests(strat)\ndim cntp,i,j\ntests=0\nfor i=1 to ntests\n  shuffle drawer\n  cntp=0\n  if strat then\n      for j=1 to npris\n\tif not trystrat(j) then exit for\n      next\n  else\t\t\n     for j=1 to npris\n       if not tryrand(j) then exit for\n     next      \n  end if\n  if j>=npris then tests=tests+1\nnext\nend function \n\t   \nfunction tryrand(pris)\n  dim i,r \n\terase opened\n  for i=1 to ntries\n    do \n      r=int(rnd*npris+1)\n    loop until opened(r)=false\n    opened(r)=true\n    if drawer(r)= pris then tryrand=true : exit function\n  next\n  tryrand=false\nend function   \n\nfunction trystrat(pris)\n  dim i,r\n  r=pris\n  for i=1 to ntries\n    if drawer(r)= pris then trystrat=true\t:exit function\n    r=drawer(r)\n  next\n  trystrat=false\nend function\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_18.txt",
        "content": "unplanned 0.0%\nplanned 31.43%",
        "safe": true
    },
    {
        "filename": "100 prisoners_180.txt",
        "content": "         0\u00a0% success for random\n      32.9\u00a0% success for optimal strategy\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_181.txt",
        "content": "import rand\nimport rand.seed\n// Uses 0-based numbering rather than 1-based numbering throughout.\nfn do_trials(trials int, np int, strategy string) {\n    mut pardoned := 0\n    for _ in 0..trials {\n        mut drawers := []int{len: 100, init: it}\n        rand.shuffle<int>(mut drawers) or {panic('shuffle failed')}\n        mut next_trial := false\n        for p in 0..np {\n            mut next_prisoner := false\n            if strategy == \"optimal\" {\n                mut prev := p\n                for _ in 0..50 {\n                    this := drawers[prev]\n                    if this == p {\n                        next_prisoner = true\n                        break\n                    }\n                    prev = this\n                }\n            } else {\n                // Assumes a prisoner remembers previous drawers (s)he opened\n                // and chooses at random from the others.\n                mut opened := [100]bool{}\n                for _ in 0..50 {\n                    mut n := 0\n                    for {\n                        n = rand.intn(100) or {0}\n                        if !opened[n] {\n                            opened[n] = true\n                            break\n                        }\n                    }\n                    if drawers[n] == p {\n                        next_prisoner = true\n                        break\n                    }\n                }\n            }\n            if !next_prisoner {\n                next_trial = true\n                break\n            }\n        }\n        if !next_trial {\n            pardoned++\n        }\n    }\n    rf := f64(pardoned) / f64(trials) * 100\n    println(\"  strategy = ${strategy:-7}  pardoned = ${pardoned:-6} relative frequency = ${rf:-5.2f}%\\n\")\n}\n \nfn main() {\n    rand.seed(seed.time_seed_array(2))\n    trials := 100000\n    for np in [10, 100] {\n        println(\"Results from $trials trials with $np prisoners:\\n\")\n        for strategy in [\"random\", \"optimal\"] {\n            do_trials(trials, np, strategy)\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_182.txt",
        "content": "Results from 100000 trials with 10 prisoners:\n\n  strategy = random   pardoned = 91     relative frequency = 0.09\u00a0%\n\n  strategy = optimal  pardoned = 31321  relative frequency = 31.32%\n\nResults from 100000 trials with 100 prisoners:\n\n  strategy = random   pardoned = 0      relative frequency = 0.00\u00a0%\n\n  strategy = optimal  pardoned = 31318  relative frequency = 31.32%\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_183.txt",
        "content": "import \"random\" for Random\nimport \"./fmt\" for Fmt\n\nvar rand = Random.new()\n\nvar doTrials = Fn.new{ |trials, np, strategy|\n    var pardoned = 0\n    for (t in 0...trials) {\n        var drawers = List.filled(100, 0)\n        for (i in 0..99) drawers[i] = i\n        rand.shuffle(drawers)\n        var nextTrial = false\n        for (p in 0...np) {\n            var nextPrisoner = false\n            if (strategy == \"optimal\") {\n                var prev = p\n                for (d in 0..49) {\n                    var curr = drawers[prev]\n                    if (curr == p) {\n                        nextPrisoner = true\n                        break\n                    }\n                    prev = curr\n                }\n            } else {\n                var opened = List.filled(100, false)\n                for (d in 0..49) {\n                    var n\n                    while (true) {\n                        n = rand.int(100)\n                        if (!opened[n]) {\n                            opened[n] = true\n                            break\n                        }\n                    }\n                    if (drawers[n] == p) {\n                        nextPrisoner = true\n                        break\n                    }\n                }\n            }\n            if (!nextPrisoner) {\n                nextTrial = true\n                break\n            }\n        }\n        if (!nextTrial) pardoned = pardoned + 1\n    }\n    var rf = pardoned/trials * 100\n    Fmt.print(\"  strategy = $-7s  pardoned = $,6d relative frequency = $5.2f\\%\\n\", strategy, pardoned, rf)\n}\n\nvar trials = 1e5\nfor (np in [10, 100]) {\n    Fmt.print(\"Results from $,d trials with $d prisoners:\\n\", trials, np)\n    for (strategy in [\"random\", \"optimal\"]) doTrials.call(trials, np, strategy)\n}\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_184.txt",
        "content": "Results from 100,000 trials with 10 prisoners:\n\n  strategy = random   pardoned =     98 relative frequency =  0.10%\n\n  strategy = optimal  pardoned = 31,212 relative frequency = 31.21%\n\nResults from 100,000 trials with 100 prisoners:\n\n  strategy = random   pardoned =      0 relative frequency =  0.00%\n\n  strategy = optimal  pardoned = 31,139 relative frequency = 31.14%\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_185.txt",
        "content": "int     Drawer(100);\n\nproc KShuffle;          \\Randomly rearrange the cards in the drawers\n\\(Woe unto thee if Stattolo shuffle is used instead of Knuth shuffle.)\nint  I, J, T;\n[for I:= 100-1 downto 1 do\n    [J:= Ran(I+1);      \\range [0..I]\n    T:= Drawer(I);  Drawer(I):= Drawer(J);  Drawer(J):= T;\n    ];\n];\n\nfunc Stategy2;          \\Return 'true' if stragegy succeeds\nint  Prisoner, Card, Try;\n[for Prisoner:= 1 to 100 do\n   [Card:= Drawer(Prisoner-1);\n   Try:= 1;\n   loop [if Card = Prisoner then quit;\n        if Try >= 50 then return false;\n        Card:= Drawer(Card-1);\n        Try:= Try+1;\n        ];\n    ];\nreturn true;\n];\n\nfunc Stategy1;          \\Return 'true' if stragegy succeeds\nint  Prisoner, I, D(100);\n[for Prisoner:= 1 to 100 do\n   loop [for I:= 0 to 100-1 do D(I):= I+1;\n        KShuffle;\n        for I:= 1 to 50 do\n            if Drawer(D(I-1)) = Prisoner then quit;\n        return false;\n        ];\nreturn true;\n];\n\nproc Strategy(S);\nint  S, I, Sample;\nreal Successes;\n[Successes:= 0.;\nfor Sample:= 1 to 100_000 do\n    [for I:= 0 to 100-1 do Drawer(I):= I+1;\n    KShuffle;\n    case S of\n     1: if Stategy1 then Successes:= Successes + 1.;\n     2: if Stategy2 then Successes:= Successes + 1.\n    other [];\n    ];\nRlOut(0, Successes/100_000.*100.);  Text(0, \"%^m^j\");\n];\n\n[Format(3, 12);\nText(0, \"Random strategy success rate:  \");\nStrategy(1);\nText(0, \"Optimal strategy success rate: \");\nStrategy(2);\n]",
        "safe": true
    },
    {
        "filename": "100 prisoners_186.txt",
        "content": "Random strategy success rate:    0.000000000000%\nOptimal strategy success rate:  31.085000000000%\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_187.txt",
        "content": "// Rosetta Code problem: http://rosettacode.org/wiki/100_prisoners\n// by Galileo, 05/2022\n\nsub play(prisoners, iterations, optimal)\n    local prisoner, pardoned, found, drawer, drawers(prisoners), i, j, k, p, x\n\n    for i = 1 to prisoners\u00a0: drawers(i) = i\u00a0: next\n\n    for i = 1 to iterations\n        for k = 1 to prisoners\u00a0: x = ran(prisoners) + 1\u00a0: p = drawers(x)\u00a0: drawers(x) = drawers(k)\u00a0: drawers(k) = p\u00a0: next\n        for prisoner = 1 to prisoners\n            found = false\n            if optimal then drawer = prisoner else drawer = ran(prisoners) + 1 end if\n            for j = 1 to prisoners / 2\n                drawer = drawers(drawer)\n                if drawer = prisoner found = true\u00a0: break\n                if not optimal drawer = ran(prisoners) + 1\n            next\n            if not found break\n        next\n        pardoned = pardoned + found\n    next\n\n    return 100 * pardoned / iterations\nend sub\n \niterations = 10000\nprint \"Simulation count: \", iterations\nfor prisoners = 10 to 100 step 90\n    random = play(prisoners, iterations, false)\n    optimal = play(prisoners, iterations, true)\n    print \"Prisoners: \", prisoners, \", random: \", random, \", optimal: \", optimal\nnext",
        "safe": true
    },
    {
        "filename": "100 prisoners_188.txt",
        "content": "Simulation count: 10000\nPrisoners: 10, random: 0.01, optimal: 35.83\nPrisoners: 100, random: 0, optimal: 31.2\n---Program done, press RETURN---",
        "safe": true
    },
    {
        "filename": "100 prisoners_189.txt",
        "content": "!yamlscript/v0\n\ndefn main(n=5000):\n  :: https://rosettacode.org/wiki/100_prisoners\n\n  random-successes optimal-successes run-count =:\n    simulate-n-runs(n)\n      .slice(q(random-successes optimal-successes run-count))\n\n  say: \"Probability of survival with random search: $F(random-successes / run-count)\"\n\n  say: \"Probability of survival with ordered search: $F(optimal-successes / run-count)\"\n\ndefn simulate-n-runs(n):\n  :: Simulate n runs of the 100 prisoner problem and returns a success count\n     for each search method.\n\n  loop random-successes 0, optimal-successes 0, run-count 0:\n    # If we've done the loop n times\n    if n == run-count:\n      # return results\n      then::\n        random-successes \u00a0:: random-successes\n        optimal-successes\u00a0:: optimal-successes\n        run-count        \u00a0:: run-count\n\n      # Otherwise, run for another batch of prisoners\n      else:\n        next-result =: simulate-100-prisoners()\n        recur:\n          (random-successes + next-result.random)\n          (optimal-successes + next-result.optimal)\n          run-count.++\n\ndefn simulate-100-prisoners():\n  :: Simulates all prisoners searching the same drawers by both strategies,\n     returns map showing whether each was successful.\n\n  # Create 100 drawers with randomly ordered prisoner numbers:\n  drawers =: random-drawers()\n  hash-map:\n    :random   try-luck(drawers search-50-random-drawers)\n    :optimal  try-luck(drawers search-50-optimal-drawers)\n\ndefn try-luck(drawers drawer-searching-function):\n  :: Returns 1 if all prisoners find their number otherwise 0.\n\n  loop prisoners range(100):\n    if prisoners.?:\n      if prisoners.0.drawer-searching-function(drawers):\n        recur: rest(prisoners)\n        else: 0\n      else: 1\n\ndefn search-50-optimal-drawers(prisoner-number drawers):\n  :: Open 50 drawers according to the agreed strategy, returning true if\n     prisoner's number was found.\n\n  loop next-drawer prisoner-number, drawers-opened 0:\n    when drawers-opened\u00a0!= 50:\n      result =: drawers.$next-drawer\n      result == prisoner-number ||:\n        recur: result drawers-opened.++\n\ndefn search-50-random-drawers(prisoner-number drawers):\n  :: Select 50 random drawers and return true if the prisoner's number was\n     found.\n\n  drawers:\n    .shuffle()\n    .take(50)\n    .filter(eq(prisoner-number))\n    .count()\n    .eq(1)\n\ndefn random-drawers():\n  :: Returns a list of shuffled numbers.\n\n  shuffle: range(100)\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_19.txt",
        "content": "NumOfTrials := 20000\nrandomFailTotal := 0, strategyFailTotal := 0\nprisoners := [], drawers := [], Cards := []\nloop, 100\n\tprisoners[A_Index] := A_Index\t\t\t\t; create prisoners\n\t, drawers[A_Index] := true\t\t\t\t; create drawers\n\nloop, % NumOfTrials\n{\n\tloop, 100\n\t\tCards[A_Index] := A_Index\t\t\t; create cards for this iteration\n\tloop, 100\n\t{\n\t\tRandom, rnd, 1, Cards.count()\n\t\tdrawers[A_Index] := Cards.RemoveAt(rnd)\t\t; randomly place cards in drawers\n\t}\n\t;-------------------------------------------\n\t; randomly open drawers\n\tRandomList := []\n\tloop, 100\n\t\tRandomList[A_Index] := A_Index\n\tFail := false\n\twhile (A_Index <=100) && !Fail\n\t{\n\t\tthisPrisoner := A_Index\n\t\tres := \"\"\n\t\twhile (thisCard <> thisPrisoner) && !Fail\n\t\t{\n\t\t\tRandom, rnd, 1, % RandomList.Count()\t; choose random number\n\t\t\tNextDrawer := RandomList.RemoveAt(rnd)\t; remove drawer from random list (don't choose more than once)\n\t\t\tthisCard := drawers[NextDrawer]\t\t; get card from this drawer\n\t\t\tif (A_Index > 50)\n\t\t\t\tFail := true\n\t\t}\n\t\tif Fail\n\t\t\trandomFailTotal++\n\t}\n\t;-------------------------------------------\n\t; use optimal strategy\n\tFail := false\n\twhile (A_Index <=100) && !Fail\n\t{\n\t\tcounter := 1, thisPrisoner := A_Index\n\t\tNextDrawer := drawers[thisPrisoner]\t\t; 1st trial, drawer whose outside number is prisoner number\n\t\twhile (drawers[NextDrawer] <> thisPrisoner) && !Fail\n\t\t{\t\n\t\t\tNextDrawer := drawers[NextDrawer]\t; drawer with the same number as that of the revealed card\n\t\t\tif ++counter > 50\n\t\t\t\tFail := true\n\t\t}\n\t\tif Fail\n\t\t\tstrategyFailTotal++\n\t}\n}\nMsgBox %  \"Number Of Trials = \" NumOfTrials\n\t\t. \"`nOptimal Strategy:`t\" (1 - strategyFailTotal/NumOfTrials) *100 \"\u00a0% success rate\" \n\t\t. \"`nRandom Trials:`t\" (1 - randomFailTotal/NumOfTrials) *100 \"\u00a0% success rate\"\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_190.txt",
        "content": "const std = @import(\"std\");\n\npub const Cupboard = struct {\n    comptime {\n        std.debug.assert(u7 == std.math.IntFittingRange(0, 100));\n    }\n\n    pub const Drawer = packed struct(u8) {\n        already_visited: bool,\n        card: u7,\n    };\n\n    drawers: [100]Drawer,\n    randomizer: std.rand.Random,\n\n    /// Cupboard is not shuffled after initialization,\n    /// it is shuffled during `play` execution.\n    pub fn init(random: std.rand.Random) Cupboard {\n        var drawers: [100]Drawer = undefined;\n        for (&drawers, 0..) |*drawer, i| {\n            drawer.* = .{\n                .already_visited = false,\n                .card = @intCast(i),\n            };\n        }\n\n        return .{\n            .drawers = drawers,\n            .randomizer = random,\n        };\n    }\n\n    pub const Decision = enum {\n        pardoned,\n        sentenced,\n    };\n\n    pub const Strategy = enum {\n        follow_card,\n        random,\n\n        pub fn decisionOfPrisoner(strategy: Strategy, cupboard: *Cupboard, prisoner_id: u7) Decision {\n            switch (strategy) {\n                .random => {\n                    return for (0..50) |_| {\n                        // If randomly chosen drawer was already opened,\n                        // throw dice again.\n                        const drawer = try_throw_random: while (true) {\n                            const random_i = cupboard.randomizer.uintLessThan(u7, 100);\n                            const drawer = &cupboard.drawers[random_i];\n\n                            if (!drawer.already_visited)\n                                break :try_throw_random drawer;\n                        };\n                        std.debug.assert(!drawer.already_visited);\n                        defer drawer.already_visited = true;\n\n                        if (drawer.card == prisoner_id)\n                            break .pardoned;\n                    } else .sentenced;\n                },\n                .follow_card => {\n                    var drawer_i = prisoner_id;\n                    return for (0..50) |_| {\n                        const drawer = &cupboard.drawers[drawer_i];\n                        std.debug.assert(!drawer.already_visited);\n                        defer drawer.already_visited = true;\n\n                        if (drawer.card == prisoner_id)\n                            break .pardoned\n                        else\n                            drawer_i = drawer.card;\n                    } else .sentenced;\n                },\n            }\n        }\n    };\n\n    pub fn play(cupboard: *Cupboard, strategy: Strategy) Decision {\n        cupboard.randomizer.shuffleWithIndex(Drawer, &cupboard.drawers, u7);\n\n        // Decisions for all 100 prisoners.\n        var all_decisions: [100]Decision = undefined;\n        for (&all_decisions, 0..) |*current_decision, prisoner_id| {\n            // Make decision for current prisoner\n            current_decision.* = strategy.decisionOfPrisoner(cupboard, @intCast(prisoner_id));\n\n            // Close all drawers after one step.\n            for (&cupboard.drawers) |*drawer|\n                drawer.already_visited = false;\n        }\n\n        // If there is at least one sentenced person, everyone are sentenced.\n        return for (all_decisions) |decision| {\n            if (decision == .sentenced)\n                break .sentenced;\n        } else .pardoned;\n    }\n\n    pub fn runSimulation(cupboard: *Cupboard, strategy: Cupboard.Strategy, total: u32) void {\n        var success: u32 = 0;\n        for (0..total) |_| {\n            const result = cupboard.play(strategy);\n            if (result == .pardoned) success += 1;\n        }\n\n        const ratio = @as(f32, @floatFromInt(success)) / @as(f32, @floatFromInt(total));\n\n        const stdout = std.io.getStdOut();\n        const stdout_w = stdout.writer();\n\n        stdout_w.print(\n            \\\\\n            \\\\Strategy: {s}\n            \\\\Total runs: {d}\n            \\\\Successful runs: {d}\n            \\\\Failed runs: {d}\n            \\\\Success rate: {d:.4}%.\n            \\\\\n        , .{\n            @tagName(strategy),\n            total,\n            success,\n            total - success,\n            ratio * 100.0,\n        }) catch {}; // Do nothing on error\n    }\n};\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_191.txt",
        "content": "const std = @import(\"std\");\n\npub fn main() std.os.GetRandomError!void {\n    var prnd = std.rand.DefaultPrng.init(seed: {\n        var init_seed: u64 = undefined;\n        try std.os.getrandom(std.mem.asBytes(&init_seed));\n        break :seed init_seed;\n    });\n    const random = prnd.random();\n\n    var cupboard = Cupboard.init(random);\n\n    cupboard.runSimulation(.follow_card, 10_000);\n    cupboard.runSimulation(.random, 10_000);\n}\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_192.txt",
        "content": "\n\nStrategy: follow_card\nTotal runs: 10000\nSuccessful runs: 3049\nFailed runs: 6951\nSuccess rate: 30.4900%.\n\nStrategy: random\nTotal runs: 10000\nSuccessful runs: 0\nFailed runs: 10000\nSuccess rate: 0.0000%.\n\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_193.txt",
        "content": "const SLOTS=100, PRISONERS=100, TRIES=50, N=10_000;\nfcn oneHundredJDI{\t// just do it strategy\n   cupboard,picks\u00a0:= [0..SLOTS-1].walk().shuffle(), cupboard.copy();\n   // if this prisoner can't find their number in TRIES, all fail\n   foreach p in (PRISONERS){ if(picks.shuffle().find(p)>=TRIES) return(False); }\n   True\t\t// all found their number\n}\nfcn oneHundredO{\t// Optimal strategy\n   cupboard\u00a0:= [0..SLOTS-1].walk().shuffle();\n   foreach p in (PRISONERS){\n      d:=p;\n      do(TRIES){ if((d=cupboard[d]) == p) continue(2) }  // found my number\n      return(False);  // this prisoner failed to find their number, all fail\n   }\n   True\t\t// all found their number\n}",
        "safe": true
    },
    {
        "filename": "100 prisoners_194.txt",
        "content": "s:=N.pump(Ref(0).incN,oneHundredJDI).value.toFloat()/N*100;\nprintln(\"Just do it strategy (%,d simulatations):\u00a0%.2f%%\".fmt(N,s));\n\ns:=N.pump(Ref(0).incN,oneHundredO).value.toFloat()/N*100;\nprintln(\"Optimal strategy    (%,d simulatations):\u00a0%.2f%%\".fmt(N,s));",
        "safe": true
    },
    {
        "filename": "100 prisoners_195.txt",
        "content": "Just do it strategy (10,000 simulatations): 0.00%\nOptimal strategy    (10,000 simulatations): 31.16%\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_196.txt",
        "content": "const SLOTS=100, PRISONERS=10, TRIES=50, N=100_000;",
        "safe": true
    },
    {
        "filename": "100 prisoners_197.txt",
        "content": "Just do it strategy (100,000 simulatations): 0.09%\nOptimal strategy    (100,000 simulatations): 31.13%\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_2.txt",
        "content": " Simulation count: 100000\n Random play wins:  0.0% of simulations\nOptimal play wins: 31.1% of simulations\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_20.txt",
        "content": "Number Of Trials = 20000\nOptimal Strategy:\t33.275000\u00a0% success rate\nRandom Trials  \u00a0:\t0.000000\u00a0% success rate",
        "safe": true
    },
    {
        "filename": "100 prisoners_21.txt",
        "content": "O = 50\nN = 2*O\niterations = 10000\n\nREM From the numbers 0 to N-1 inclusive, pick O of them.\nfunction shuffle(N, O)\n dim array(N)\n for i = 0 to N-1\n  array[i] = i\n next i\n for i = 0 to O-1\n  swapindex = i + rand*(N-i)\n  swapvalue = array[swapindex]\n  array[swapindex] = array[i]\n  array[i] = swapvalue\n next i\n return array\nend function\n\nREM given N drawers with O to open, prisoner P chooses randomly: does he choose well?\nfunction chooserandom(drawers, N, O, p)\n  choices = shuffle(N, O)\n  for i = 0 to O-1\n   if drawers[choices[i]] = p then return true\n  next i\n  return false\nend function\n\nREM N prisoners randomly choose O drawers to open: do they all choose well?\nfunction allchooserandom(N, O)\n drawers = shuffle(N, N)\n for p = 0 to N-1\n  goodchoice = chooserandom(drawers, N, O, p)\n  if not goodchoice then return false\n next p\n return true\nend function\n\nREM given N drawers with O to open, prisoner P chooses smartly: does he choose well?\nfunction choosesmart(drawers, N, O, p)\n numopened = 0\n i = p\n while numopened < O\n  numopened += 1\n  if drawers[i] = p then return true\n  i = drawers[i]\n end while\n return false\nend function\n\nREM N prisoners smartly choose O drawers to open: do they all choose well?\nfunction allchoosesmart(N, O)\n drawers = shuffle(N, N)\n for p = 0 to N-1\n  goodchoice = choosesmart(drawers, N, O, p)\n  if not goodchoice then return false\n next p\n return true\nend function\n\ncls\nprint N; \" prisoners choosing \";O;\" drawers, \";iterations;\" iterations:\"\n\ntotal = 0\nfor iteration = 1 to iterations\n if allchooserandom(N, O) then total += 1\nnext iteration\n\nprint \"Random choices: \"; total;\" out of \";iterations\nprint \"Observed ratio: \"; total/iterations; \", expected ratio: \"; (O/N)^N\n\ntotal = 0\nfor iteration = 1 to iterations\n if allchoosesmart(N, O) then total += 1\nnext iteration\n\nprint \"Smart choices: \"; total;\" out of \";iterations\nprint \"Observed ratio: \"; total/iterations; \", expected ratio with N=2*O: greater than about 0.30685\": REM for N=100, O=50 particularly, about 0.3118",
        "safe": true
    },
    {
        "filename": "100 prisoners_22.txt",
        "content": "100 prisoners choosing 50 drawers, 10000 iterations:\nRandom choices: 0 out of 10000\nObserved ratio: 0.0, expected ratio: 0.0\nSmart choices: 3052 out of 10000\nObserved ratio: 0.3052, expected ratio with N=2*O: greater than about 0.30685\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_23.txt",
        "content": "FUNCTION trials(prisoners, iterations, optimal)\n    DIM drawers(100)\n    FOR i = 1 TO prisoners\n        LET drawers(i) = i\n    NEXT i\n    FOR i = 1 TO iterations\n        FOR k = 1 TO prisoners\n            LET x = RND+1\n            LET p = drawers(x)\n            LET drawers(x) = drawers(k)\n            LET drawers(k) = p\n        NEXT k\n        FOR prisoner = 1 TO prisoners\n            LET found = false\n            IF optimal<>0 THEN LET drawer = prisoner ELSE LET drawer = RND+1\n            FOR j = 1 TO prisoners/2\n                LET drawer = drawers(drawer)\n                IF drawer = prisoner THEN\n                   LET found = true\n                   EXIT FOR\n                END IF\n                IF (NOT optimal<>0) THEN LET drawer = RND+1\n            NEXT j\n            IF (NOT found<>0) THEN EXIT FOR\n        NEXT prisoner\n        LET pardoned = pardoned+found\n    NEXT i\n    LET trials = (100*pardoned/iterations)\nEND FUNCTION\n\nLET false = 0\nLET true = 1\nLET iterations = 10000\nPRINT \"Simulation count: \"; iterations\nFOR prisoners = 10 TO 100 STEP 90\n    LET randon = trials(prisoners,iterations,false)\n    LET optimal = trials(prisoners,iterations,true)\n    PRINT \"Prisoners: \"; prisoners; \", random: \"; randon; \", optimal: \"; optimal\nNEXT prisoners\nEND\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_24.txt",
        "content": "get \"libhdr\"\n\nmanifest $( \n    seed = 12345   // for pseudorandom number generator\n    size = 100     // amount of drawers and prisoners\n    tries = 50     // amount of tries each prisoner may make\n    simul = 2000   // amount of simulations to run\n$)\n\nlet randto(n) = valof\n$(  static $( state = seed $)\n    let mask = 1\n    mask\u00a0:= (mask<<1)|1 repeatuntil mask > n\n    state\u00a0:= random(state) repeatuntil ((state >> 8) & mask) < n \n    resultis (state >> 8) & mask\n$)\n\n// initialize drawers\nlet placeCards(d, n) be\n$(  for i=0 to n-1 do d!i\u00a0:= i;\n    for i=0 to n-2 do\n    $(  let j = i+randto(n-i)\n        let k = d!i\n        d!i\u00a0:= d!j\n        d!j\u00a0:= k\n    $)\n$)\n\n// random strategy (prisoner 'p' tries to find his own number)\nlet randoms(d, p, t) = valof\n$(  for n = 1 to t do\n        if d!randto(size) = p then resultis true\n    resultis false \n$)\n\n// optimal strategy\nlet optimal(d, p, t) = valof\n$(  let last = p\n    for n = 1 to t do\n        test d!last = p \n            then resultis true\n            else last\u00a0:= d!last\n    resultis false\n$)\n\n// run a simulation given a strategy\nlet simulate(d, strat, n, t) = valof\n$(  placeCards(d, n)\n    for p = 0 to n-1 do\n        if not strat(d, p, t) then resultis false\n    resultis true\n$)\n\n// run many simulations and count the successes\nlet runSimulations(d, strat, n, amt, t) = valof\n$(  let succ = 0\n    for i = 1 to amt do\n        if simulate(d, strat, n, t) do\n            succ\u00a0:= succ + 1\n    resultis succ\n$)\n\nlet run(d, name, strat, n, amt, t) be\n$(  let s = runSimulations(d, strat, n, amt, t);\n    writef(\"%S: %I5 of %I5, %N percent.*N\", name, s, amt, s*10/(amt/10))\n$)\n\nlet start() be\n$(  let d = vec size-1\n    run(d, \" Random\", randoms, size, simul, tries)\n    run(d, \"Optimal\", optimal, size, simul, tries)\n$)",
        "safe": true
    },
    {
        "filename": "100 prisoners_25.txt",
        "content": " Random:     0 of  2000, 0 percent.\nOptimal:   698 of  2000, 34 percent.",
        "safe": true
    },
    {
        "filename": "100 prisoners_26.txt",
        "content": "#include<stdbool.h>\n#include<stdlib.h>\n#include<stdio.h>\n#include<time.h>\n\n#define LIBERTY false\n#define DEATH true\n\ntypedef struct{\n\tint cardNum;\n\tbool hasBeenOpened;\n}drawer;\n\ndrawer *drawerSet;\n\nvoid initialize(int prisoners){\n\tint i,j,card;\n\tbool unique;\n\n\tdrawerSet = ((drawer*)malloc(prisoners * sizeof(drawer))) -1;\n\n\tcard = rand()%prisoners + 1;\n\tdrawerSet[1] = (drawer){.cardNum = card, .hasBeenOpened = false};\n\n\tfor(i=1 + 1;i<prisoners + 1;i++){\n\t\tunique = false;\n\t\twhile(unique==false){\n\t\t\tfor(j=0;j<i;j++){\n\t\t\t\tif(drawerSet[j].cardNum == card){\n\t\t\t\t\tcard = rand()%prisoners + 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(j==i){\n\t\t\t\tunique = true;\n\t\t\t}\n\t\t}\n\t\tdrawerSet[i] = (drawer){.cardNum = card, .hasBeenOpened = false};\n\t}\n\n}\n\nvoid closeAllDrawers(int prisoners){\n\tint i;\n\tfor(i=1;i<prisoners + 1;i++)\n\t\tdrawerSet[i].hasBeenOpened = false;\n}\n\nbool libertyOrDeathAtRandom(int prisoners,int chances){\n\tint i,j,chosenDrawer;\n\n\tfor(i= 1;i<prisoners + 1;i++){\n\t\tbool foundCard = false;\n\t\tfor(j=0;j<chances;j++){\n\t\t\tdo{\n\t\t\t\tchosenDrawer = rand()%prisoners + 1;\n\t\t\t}while(drawerSet[chosenDrawer].hasBeenOpened==true);\n\t\t\tif(drawerSet[chosenDrawer].cardNum == i){\n\t\t\t\tfoundCard = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tdrawerSet[chosenDrawer].hasBeenOpened = true;\n\t\t}\n\t\tcloseAllDrawers(prisoners);\n\t\tif(foundCard == false)\n\t\t\treturn DEATH;\n\t}\n\n\treturn LIBERTY;\n}\n\nbool libertyOrDeathPlanned(int prisoners,int chances){\n\tint i,j,chosenDrawer;\n\tfor(i=1;i<prisoners + 1;i++){\n\t\tchosenDrawer = i;\n\t\tbool foundCard = false;\n\t\tfor(j=0;j<chances;j++){\n\t\t\tdrawerSet[chosenDrawer].hasBeenOpened = true;\n\n\t\t\tif(drawerSet[chosenDrawer].cardNum == i){\n\t\t\t\tfoundCard = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(chosenDrawer == drawerSet[chosenDrawer].cardNum){\n\t\t\t\tdo{\n                    chosenDrawer = rand()%prisoners + 1;\n\t\t\t\t}while(drawerSet[chosenDrawer].hasBeenOpened==true);\n\t\t\t}\n\t\t\telse{\n\t\t\t\tchosenDrawer = drawerSet[chosenDrawer].cardNum;\n\t\t\t}\n\n\t\t}\n\n\t\tcloseAllDrawers(prisoners);\n\t\tif(foundCard == false)\n\t\t\treturn DEATH;\n\t}\n\n\treturn LIBERTY;\n}\n\nint main(int argc,char** argv)\n{\n\tint prisoners, chances;\n\tunsigned long long int trials,i,count = 0;\n        char* end;\n\n\tif(argc!=4)\n\t\treturn printf(\"Usage\u00a0: %s <Number of prisoners> <Number of chances> <Number of trials>\",argv[0]);\n\n\tprisoners = atoi(argv[1]);\n\tchances = atoi(argv[2]);\n\ttrials = strtoull(argv[3],&end,10);\n\n\tsrand(time(NULL));\n\n\tprintf(\"Running random trials...\");\n\tfor(i=0;i<trials;i+=1L){\n\t\tinitialize(prisoners);\n\n\t\tcount += libertyOrDeathAtRandom(prisoners,chances)==DEATH?0:1;\n\t}\n\n\tprintf(\"\\n\\nGames Played\u00a0: %llu\\nGames Won\u00a0: %llu\\nChances\u00a0: %lf\u00a0%% \\n\\n\",trials,count,(100.0*count)/trials);\n\n        count = 0;\n\n\tprintf(\"Running strategic trials...\");\n\tfor(i=0;i<trials;i+=1L){\n\t\tinitialize(prisoners);\n\n\t\tcount += libertyOrDeathPlanned(prisoners,chances)==DEATH?0:1;\n\t}\n\n\tprintf(\"\\n\\nGames Played\u00a0: %llu\\nGames Won\u00a0: %llu\\nChances\u00a0: %lf\u00a0%% \\n\\n\",trials,count,(100.0*count)/trials);\n\treturn 0;\n}\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_27.txt",
        "content": "$ gcc 100prisoners.c && ./a.out 100 50 10000\nRunning random trials...\n\nGames Played\u00a0: 10000\nGames Won\u00a0: 0\nChances\u00a0: 0.000000\u00a0% \n\nRunning strategic trials...\n\nGames Played\u00a0: 10000\nGames Won\u00a0: 3051\nChances\u00a0: 30.510000\u00a0% \n",
        "safe": true
    },
    {
        "filename": "100 prisoners_28.txt",
        "content": "using System;\nusing System.Linq;\n\nnamespace Prisoners {\n    class Program {\n        static bool PlayOptimal() {\n            var secrets = Enumerable.Range(0, 100).OrderBy(a => Guid.NewGuid()).ToList();\n\n            for (int p = 0; p < 100; p++) {\n                bool success = false;\n\n                var choice = p;\n                for (int i = 0; i < 50; i++) {\n                    if (secrets[choice] == p) {\n                        success = true;\n                        break;\n                    }\n                    choice = secrets[choice];\n                }\n\n                if (!success) {\n                    return false;\n                }\n            }\n\n            return true;\n        }\n\n        static bool PlayRandom() {\n            var secrets = Enumerable.Range(0, 100).OrderBy(a => Guid.NewGuid()).ToList();\n\n            for (int p = 0; p < 100; p++) {\n                var choices = Enumerable.Range(0, 100).OrderBy(a => Guid.NewGuid()).ToList();\n\n                bool success = false;\n                for (int i = 0; i < 50; i++) {\n                    if (choices[i] == p) {\n                        success = true;\n                        break;\n                    }\n                }\n\n                if (!success) {\n                    return false;\n                }\n            }\n\n            return true;\n        }\n\n        static double Exec(uint n, Func<bool> play) {\n            uint success = 0;\n            for (uint i = 0; i < n; i++) {\n                if (play()) {\n                    success++;\n                }\n            }\n            return 100.0 * success / n;\n        }\n\n        static void Main() {\n            const uint N = 1_000_000;\n            Console.WriteLine(\"# of executions: {0}\", N);\n            Console.WriteLine(\"Optimal play success rate: {0:0.00000000000}%\", Exec(N, PlayOptimal));\n            Console.WriteLine(\" Random play success rate: {0:0.00000000000}%\", Exec(N, PlayRandom));\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_29.txt",
        "content": "# of executions: 1000000\nOptimal play success rate: 31.21310000000%\n Random play success rate: 0.00000000000%",
        "safe": true
    },
    {
        "filename": "100 prisoners_3.txt",
        "content": "/* ARM assembly AARCH64 Raspberry PI 3B */\n/*  program prisonniex64.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.equ NBLOOP, 1000\n\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nsMessResult:        .asciz \"Random strategie \u00a0: @ sur 1000 \\n\"\nsMessResultOPT:     .asciz \"Optimal strategie\u00a0: @ sur 1000 \\n\"\nszCarriageReturn:   .asciz \"\\n\"\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\nsZoneConv:        .skip 24\ntbDoors:          .skip 8 * NBDOORS \ntbTest:           .skip 8 * NBDOORS\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                 // entry of program \n    \n    ldr x1,qAdrtbDoors\n    mov x2,#0\n1:                                    // loop init doors table\n    add x3,x2,#1\n    str x3,[x1,x2,lsl #3]\n    add x2,x2,#1\n    cmp x2,#NBDOORS\n    blt 1b\n \n    mov x9,#0                         // loop counter\n    mov x10,#0                        // counter successes random strategie\n    mov x11,#0                        // counter successes optimal strategie\n2:\n    ldr x0,qAdrtbDoors\n    mov x1,#NBDOORS\n    bl knuthShuffle\n    \n    ldr x0,qAdrtbDoors\n    bl aleaStrategie\n    cmp x0,#NBDOORS\n    cinc x10,x10,eq\n    \n    ldr x0,qAdrtbDoors\n    bl optimaStrategie\n    cmp x0,#NBDOORS\n    cinc x11,x11,eq\n   \n    add x9,x9,#1\n    cmp x9,#NBLOOP\n    blt 2b\n    \n    mov x0,x10                        // result display\n    ldr x1,qAdrsZoneConv\n    bl conversion10                   // call decimal conversion\n    ldr x0,qAdrsMessResult\n    ldr x1,qAdrsZoneConv              // insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n    \n    mov x0,x11                        // result display\n    ldr x1,qAdrsZoneConv\n    bl conversion10                   // call decimal conversion\n    ldr x0,qAdrsMessResultOPT\n    ldr x1,qAdrsZoneConv              // insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\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 \nqAdrszCarriageReturn:     .quad szCarriageReturn\nqAdrsMessResult:          .quad sMessResult\nqAdrsMessResultOPT:       .quad sMessResultOPT\nqAdrtbDoors:              .quad tbDoors\nqAdrtbTest:               .quad tbTest\nqAdrsZoneConv:            .quad sZoneConv\n/******************************************************************/\n/*            random door test strategy                           */ \n/******************************************************************/\n/* x0 contains the address of table */\naleaStrategie:\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    ldr x6,qAdrtbTest            // table doors tests address\n    mov x8,x0                    // save table doors address\n    mov x4,#0                    // counter number of successes\n    mov x2,#0                    // prisonners indice\n1:\n    bl razTable                  // zero to table doors tests\n    mov x5,#0                    // counter of door tests \n    add x7,x2,#1\n2:\n    mov x0,#1\n    mov x1,#NBDOORS\n    bl extRandom                 // random test\n    ldr x3,[x6,x0,lsl #3]        // doors also tested\u00a0?\n    cmp x3,#0 \n    bne 2b                       // yes\n    ldr x3,[x8,x0,lsl #3]        // load N\u00b0 door\n    cmp x3,x7                    // compar N\u00b0 door N\u00b0 prisonner\n    cinc x4,x4,eq\n    beq 3f\n    mov x3,#1                    // top test table item \n    str x3,[x6,x0,lsl #3]\n    add x5,x5,#1\n    cmp x5,#NBDOORS / 2          // number tests maxi\u00a0?\n    blt 2b                       // no -> loop\n3:\n    add x2,x2,#1                 // other prisonner\n    cmp x2,#NBDOORS\n    blt 1b\n    \n    mov x0,x4                    // return number of successes \n100:\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*     raz test table                                             */ \n/******************************************************************/\nrazTable:\n    stp x0,lr,[sp,-16]!        // save  registres\n    stp x1,x2,[sp,-16]!        // save  registres\n    ldr x0,qAdrtbTest\n    mov x1,#0                  // item indice\n    mov x2,#0\n1:\n    str x2,[x0,x1,lsl #3]      // store zero \u00e0 item\n    add x1,x1,#1\n    cmp x1,#NBDOORS\n    blt 1b\n100:\n    ldp x1,x2,[sp],16          // restaur des  2 registres\n    ldp x0,lr,[sp],16          // restaur des  2 registres\n    ret\n/******************************************************************/\n/*            random door test strategy                           */ \n/******************************************************************/\n/* x0 contains the address of table */\noptimaStrategie:\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    mov x4,#0                    // counter number of successes\n    mov x2,#0                    // counter prisonner\n1:\n    mov x5,#0                    // counter test\n    mov x1,x2                    // first test = N\u00b0 prisonner\n2:\n    ldr x3,[x0,x1,lsl #3]        // load N\u00b0 door\n    cmp x3,x2\n    cinc x4,x4,eq                // equal -> succes\n    beq 3f\n    mov x1,x3                    // new test with N\u00b0 door\n    add x5,x5,#1                 \n    cmp x5,#NBDOORS / 2          // test number maxi\u00a0?\n    blt 2b\n3:\n    add x2,x2,#1                 // other prisonner\n    cmp x2,#NBDOORS\n    blt 1b\n    \n    mov x0,x4\n100:\n    ldp x4,x5,[sp],16          // restaur des  2 registres\n    ldp x2,x3,[sp],16          // restaur des  2 registres\n    ldp x1,lr,[sp],16          // restaur des  2 registres\n    ret\n/******************************************************************/\n/*     knuth Shuffle                                  */ \n/******************************************************************/\n/* x0 contains the address of table */\n/* x1 contains the number of elements */\nknuthShuffle:\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!         // save  registers\n    mov x5,x0                   // save table address\n    mov x6,x1                   // save number of elements\n    mov x2,0                    // start index\n1:\n    mov x0,0\n    mov x1,x2                   // generate aleas\n    bl extRandom\n    ldr x3,[x5,x2,lsl #3]        // swap number on the table\n    ldr x4,[x5,x0,lsl #3]\n    str x4,[x5,x2,lsl #3]\n    str x3,[x5,x0,lsl #3]\n    add x2,x2,#1                 // next number\n    cmp x2,x6                    // end\u00a0?\n    blt 1b                       // no -> loop\n100:\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n\n/******************************************************************/\n/*     random number                                          */ \n/******************************************************************/\n/*  x0 contains inferior value */\n/*  x1 contains maxi value */\n/*  x0 return random number */\nextRandom:\n    stp x1,lr,[sp,-16]!        // save  registers\n    stp x2,x8,[sp,-16]!        // save  registers\n    stp x3,x4,[sp,-16]!        // save  registers\n    stp x19,x20,[sp,-16]!      // save  registers\n    sub sp,sp,16               // reserve 16 octets on stack\n    mov x19,x0\n    add x20,x1,1\n    mov x0,sp                  // store result on stack\n    mov x1,8                   // length 8 bytes\n    mov x2,0\n    mov x8,278                 //  call system Linux 64 bits Urandom\n    svc 0\n    mov x0,sp                  // load r\u00e9sult on stack\n    ldr x0,[x0]\n    sub x2,x20,x19             // calculation of the range of values \n    udiv x1,x0,x2              // calculation range modulo\n    msub x0,x1,x2,x0\n    add  x0,x0,x19             // and add inferior value\n100:\n    add sp,sp,16               // alignement stack \n    ldp x19,x20,[sp],16        // restaur  2 registers\n    ldp x3,x4,[sp],16          // restaur  2 registers\n    ldp x2,x8,[sp],16          // restaur  2 registers\n    ldp x1,lr,[sp],16          // restaur  2 registers\n    ret                        // return to address lr x30\n/********************************************************/\n/*        File Include fonctions                        */\n/********************************************************/\n/* for this file see task include a file in language AArch64 assembly */\n.include \"../includeARM64.inc\"",
        "safe": true
    },
    {
        "filename": "100 prisoners_30.txt",
        "content": "#include <cstdlib>   // for rand\n#include <algorithm> // for random_shuffle\n#include <iostream>  // for output\n\nusing namespace std;\n\nclass cupboard {\npublic:\n    cupboard() {\n        for (int i = 0; i < 100; i++)\n            drawers[i] = i;\n        random_shuffle(drawers, drawers + 100);\n    }\n\n    bool playRandom();\n    bool playOptimal();\n\nprivate:\n    int drawers[100];\n};\n\nbool cupboard::playRandom() {\n    bool openedDrawers[100] = { 0 };\n    for (int prisonerNum = 0; prisonerNum < 100; prisonerNum++) { // loops through prisoners numbered 0 through 99\n        bool prisonerSuccess = false;\n        for (int i = 0; i < 100 / 2; i++) {  // loops through 50 draws for each prisoner\n            int drawerNum = rand() % 100;\n            if (!openedDrawers[drawerNum]) {\n                openedDrawers[drawerNum] = true;\n                break;\n            }\n            if (drawers[drawerNum] == prisonerNum) {\n                prisonerSuccess = true;\n                break;\n            }\n        }\n        if (!prisonerSuccess)\n            return false;\n    }\n    return true;\n}\n\nbool cupboard::playOptimal() {\n    for (int prisonerNum = 0; prisonerNum < 100; prisonerNum++) {\n        bool prisonerSuccess = false;\n        int checkDrawerNum = prisonerNum;\n        for (int i = 0; i < 100 / 2; i++) {\n            if (drawers[checkDrawerNum] == prisonerNum) {\n                prisonerSuccess = true;\n                break;\n            } else\n                checkDrawerNum = drawers[checkDrawerNum];\n        }\n        if (!prisonerSuccess)\n            return false;\n    }\n    return true;\n}\n\ndouble simulate(char strategy) {\n    int numberOfSuccesses = 0;\n    for (int i = 0; i < 10000; i++) {\n        cupboard d;\n        if ((strategy == 'R' && d.playRandom()) || (strategy == 'O' && d.playOptimal())) // will run playRandom or playOptimal but not both because of short-circuit evaluation\n            numberOfSuccesses++;\n    }\n\n    return numberOfSuccesses * 100.0 / 10000;\n}\n\nint main() {\n    cout << \"Random strategy:  \" << simulate('R') << \"\u00a0%\" << endl;\n    cout << \"Optimal strategy: \" << simulate('O') << \"\u00a0%\" << endl;\n    system(\"PAUSE\"); // for Windows\n    return 0;\n}\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_31.txt",
        "content": "Random strategy:  0\u00a0%\nOptimal strategy: 31.54\u00a0%",
        "safe": true
    },
    {
        "filename": "100 prisoners_32.txt",
        "content": "(ns clojure-sandbox.prisoners)\n\n(defn random-drawers []\n  \"Returns a list of shuffled numbers\"\n  (-> 100\n      range\n      shuffle))\n\n(defn search-50-random-drawers [prisoner-number drawers]\n  \"Select 50 random drawers and return true if the prisoner's number was found\"\n  (->> drawers\n      shuffle ;; Put drawer contents in random order\n      (take 50) ;; Select first 50, equivalent to selecting 50 random drawers\n      (filter (fn [x] (= x prisoner-number))) ;; Filter to include only those that match prisoner number\n      count\n      (= 1))) ;; Returns true if the number of matching numbers is 1\n\n(defn search-50-optimal-drawers [prisoner-number drawers]\n  \"Open 50 drawers according to the agreed strategy, returning true if prisoner's number was found\"\n  (loop [next-drawer prisoner-number ;; The drawer index to start on is the prisoner's number\n         drawers-opened 0] ;; To keep track of how many have been opened as 50 is the maximum\n    (if (= drawers-opened 50)\n      false ;; If 50 drawers have been opened, the prisoner's number has not been found\n      (let [result (nth drawers next-drawer)] ;; Open the drawer given by next number\n        (if (= result prisoner-number) ;; If prisoner number has been found\n          true ;; No need to keep opening drawers - return true\n          (recur result (inc drawers-opened))))))) ;; Restart the loop using the resulting number as the drawer number\n\n(defn try-luck [drawers drawer-searching-function]\n  \"Returns 1 if all prisoners find their number otherwise 0\"\n  (loop [prisoners (range 100)] ;; Start with 100 prisoners\n    (if (empty? prisoners) ;; If they've all gone and found their number\n      1 ;; Return true- they'll all live\n      (let [res (-> prisoners\n                    first\n                    (drawer-searching-function drawers))] ;; Otherwise, have the first prisoner open drawers according to the specified method\n        (if (false? res) ;; If this prisoner didn't find their number\n          0 ;; no prisoners will be freed so we can return false and stop\n          (recur (rest prisoners))))))) ;; Otherwise they've found the number, so we remove them from the queue and repeat with the others\n\n(defn simulate-100-prisoners []\n  \"Simulates all prisoners searching the same drawers by both strategies, returns map showing whether each was successful\"\n  (let [drawers (random-drawers)] ;; Create 100 drawers with randomly ordered prisoner numbers\n    {:random (try-luck drawers search-50-random-drawers) ;; True if all prisoners found their number using random strategy\n     :optimal (try-luck drawers search-50-optimal-drawers)})) ;; True if all prisoners found their number using optimal strategy\n\n(defn simulate-n-runs [n]\n  \"Simulate n runs of the 100 prisoner problem and returns a success count for each search method\"\n  (loop [random-successes 0\n         optimal-successes 0\n         run-count 0]\n    (if (= n run-count) ;; If we've done the loop n times\n      {:random-successes random-successes ;; return results\n       :optimal-successes optimal-successes\n       :run-count run-count}\n      (let [next-result (simulate-100-prisoners)] ;; Otherwise, run for another batch of prisoners\n        (recur (+ random-successes (:random next-result)) ;; Add result of run to the total successs count\n               (+ optimal-successes (:optimal next-result))\n               (inc run-count)))))) ;; increment run count and run again\n\n(defn -main [& args]\n  \"For 5000 runs, print out the success frequency for both search methods\"\n  (let [{:keys [random-successes optimal-successes run-count]} (simulate-n-runs 5000)]\n    (println (str \"Probability of survival with random search: \" (float (/ random-successes run-count))))\n    (println (str \"Probability of survival with ordered search: \" (float (/ optimal-successes run-count))))))\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_33.txt",
        "content": "Probability of survival with random search: 0.0\nProbability of survival with ordered search: 0.3062\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_34.txt",
        "content": "% This program needs to be merged with PCLU's \"misc\" library\n% to use the random number generator.\n%\n% pclu -merge $CLUHOME/lib/misc.lib -compile prisoners.clu\n\n% Seed the random number generator with the current time\ninit_rng = proc ()\n    d: date\u00a0:= now()\n    seed: int\u00a0:= ((d.hour*60) + d.minute)*60 + d.second\n    random$seed(seed)\nend init_rng\n\n% Place cards in drawers randomly\nmake_drawers = proc (n: int) returns (sequence[int])\n    d: array[int]\u00a0:= array[int]$predict(1,n)\n    \n   \u00a0% place each card in its own drawer\n    for i: int in int$from_to(1,n) do\n        array[int]$addh(d,i)\n    end\n    \n   \u00a0% shuffle the cards\n    for i: int in int$from_to_by(n,2,-1) do\n        j: int\u00a0:= random$next(i)+1\n        t: int\u00a0:= d[i]\n        d[i]\u00a0:= d[j]\n        d[j]\u00a0:= t\n    end\n    return(sequence[int]$a2s(d))\nend make_drawers\n\n% Random strategy\nrand_strat = proc (p, tries: int, d: sequence[int]) returns (bool)\n    n: int\u00a0:= sequence[int]$size(d)\n    for i: int in int$from_to(1,tries) do\n        if p = d[random$next(n)+1] then return(true) end\n    end\n    return(false)\nend rand_strat\n\n% Optimal strategy\nopt_strat = proc (p, tries: int, d: sequence[int]) returns (bool)\n    last: int\u00a0:= p\n    for i: int in int$from_to(1,tries) do\n        if d[last]=p then return(true) end\n        last\u00a0:= d[last]\n    end\n    return(false)\nend opt_strat\n\n% Run one simulation given a strategy\nsimulate = proc (n, tries: int,\n                 strat: proctype (int,int,sequence[int]) returns (bool))\n           returns (bool)\n    d: sequence[int]\u00a0:= make_drawers(n)\n    for p: int in int$from_to(1,n) do\n       \u00a0% If one prisoner fails, they all hang\n        if ~strat(p,tries,d) then return(false) end\n    end\n    return(true)\nend simulate\n\n% Run many simulations and count the successes\nrun_simulations = proc (amount, n, tries: int,\n                        strat: proctype (int,int,sequence[int]) returns (bool))\n                  returns (int)\n    ok: int\u00a0:= 0\n    for i: int in int$from_to(1,amount) do\n        if simulate(n,tries,strat) then\n            ok\u00a0:= ok + 1\n        end\n    end\n    return(ok)\nend run_simulations\n\n% Run simulations and show the results\nshow = proc (title: string,\n             amount, n, tries: int,\n             strat: proctype (int,int,sequence[int]) returns (bool))\n    po: stream\u00a0:= stream$primary_output()\n    stream$puts(po, title || \": \")\n    \n    ok: int\u00a0:= run_simulations(amount, n, tries, strat)\n    perc: real\u00a0:= real$i2r(ok)*100.0/real$i2r(amount)\n    \n    stream$putright(po, int$unparse(ok), 7)\n    stream$puts(po, \" out of \")\n    stream$putright(po, int$unparse(amount), 7)\n    stream$putl(po, \", \" || f_form(perc, 3, 2) || \"%\")\nend show \n\nstart_up = proc ()\n    prisoners   = 100\n    tries       = 50\n    simulations = 50000\n    \n    init_rng()\n\n    show(\" Random\", simulations, prisoners, tries, rand_strat)\n    show(\"Optimal\", simulations, prisoners, tries, opt_strat)\nend start_up",
        "safe": true
    },
    {
        "filename": "100 prisoners_35.txt",
        "content": " Random:       0 out of   50000, 0.00%\nOptimal:   15541 out of   50000, 31.08%",
        "safe": true
    },
    {
        "filename": "100 prisoners_36.txt",
        "content": "10 rem 100 prisoners\n20 rem set arrays\n30 rem dr = drawers containing card values\n40 rem ig = a list of numbers 1 through 100, shuffled to become the \n41 rem guess sequence for each inmate - method 1\n50 dim dr(100),ig(100)\n55 rem initialize drawers with own card in each drawer\n60 for i=1 to 100:dr(i)=i:next \n\n1000 print chr$(147);\"how many trials for each method\";:input tt\n1010 for m=1 to 2:su(m)=0:fa(m)=0\n1015 for tn=1 to tt\n1020 on m gosub 2000,3000\n1025 rem ip = number of inmates who passed\n1030 if ip=100 then su(m)=su(m)+1\n1040 if ip<100 then fa(m)=fa(m)+1\n1045 next tn\n1055 next m\n\n1060 print chr$(147);\"Results:\":print\n1070 print \"Out of\";tt;\"trials, the results are\"\n1071 print \"as follows...\":print\n1072 print \"1. Random Guessing:\"\n1073 print \"  \";su(1);\"successes\"\n1074 print \"  \";fa(1);\"failures\"\n1075 print \"  \";su(1)/tn;\"{left-crsr}% success rate.\":print\n1077 print \"2. Chained Number Picking:\"\n1078 print \"  \";su(2);\"successes\"\n1079 print \"  \";fa(2);\"failures\"\n1080 print \"  \";(su(2)/tn)*100;\"{left-crsr}% success rate.\":print\n1100 print:print \"Again?\"\n1110 get k$:if k$=\"\" then 1110\n1120 if k$=\"y\" then 1000\n1500 end\n\n2000 rem random guessing method\n2005 for x=1 to 100:ig(x)=x:next:ip=0:gosub 4000\n2007 for i=1 to 100\n2010 for x=1 to 100:t=ig(x):np=int(rnd(1)*100)+1:ig(x)=ig(np):ig(np)=t:next\n2015 for g=1 to 50\n2020 if dr(ig(g))=i then ip=ip+1:next i:return\n2025 next g\n2030 return\n\n3000 rem chained method\n3005 ip=0:gosub 4000\n3007 rem iterate through each inmate\n3010 fori=1to100\n3015 ng=i:forg=1to50\n3020 cd=dr(ng)\n3025 ifcd=ithenip=ip+1:nexti:return\n3030 ifcd<>ithenng=cd\n3035 nextg:return\n\n4000 rem shuffle the drawer cards randomly\n4010 x=rnd(-ti)\n4020 for i=1 to 100\n4030 r=int(rnd(1)*100)+1:t=dr(i):dr(i)=dr(r):dr(r)=t:next\n4040 return\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_37.txt",
        "content": "Results:\n\nOut of 4000 trials the percentage of\nsuccess is as follows...\n\n1. Random Guessing:\n   0 successes\n   4000 failures\n   0% success rate.\n\n2. Chained Number Picking:\n   1274 successes\n   2726 failures\n   31.85% success rate.\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_38.txt",
        "content": "(defparameter *samples* 10000)\n(defparameter *prisoners* 100)\n(defparameter *max-guesses* 50)\n\n(defun range (n)\n  \"Returns a list from 0 to N.\"\n  (loop\n     for i below n\n     collect i))\n\n(defun nshuffle (list)\n  \"Returns a shuffled LIST.\"\n  (loop\n     for i from (length list) downto 2\n     do (rotatef (nth (random i) list)\n                 (nth (1- i) list)))\n  list)\n\n(defun build-drawers ()\n  \"Returns a list of shuffled drawers.\"\n  (nshuffle (range *prisoners*)))\n\n(defun strategy-1 (drawers p)\n  \"Returns T if P is found in DRAWERS under *MAX-GUESSES* using a random strategy.\"\n  (loop\n     for i below *max-guesses*\n     thereis (= p (nth (random *prisoners*) drawers))))\n\n(defun strategy-2 (drawers p)\n  \"Returns T if P is found in DRAWERS under *MAX-GUESSES* using an optimal strategy.\"\n  (loop\n     for i below *max-guesses*\n     for j = p then (nth j drawers)\n     thereis (= p (nth j drawers))))\n\n(defun 100-prisoners-problem (strategy &aux (drawers (build-drawers)))\n  \"Returns T if all prisoners find their number using the given STRATEGY.\"\n  (every (lambda (e) (eql T e))\n         (mapcar (lambda (p) (funcall strategy drawers p)) (range *prisoners*))))\n\n(defun sampling (strategy)\n  (loop\n     repeat *samples*\n     for result = (100-prisoners-problem strategy) \n     count result))\n\n(defun compare-strategies ()\n  (format t \"Using a random strategy in ~4,2F\u00a0% of the cases the prisoners are free.~%\" (* (/ (sampling #'strategy-1) *samples*) 100))\n  (format t \"Using an optimal strategy in ~4,2F\u00a0% of the cases the prisoners are free.~%\" (* (/ (sampling #'strategy-2) *samples*) 100)))\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_39.txt",
        "content": "CL-USER> (compare-strategies)\nUsing a random strategy in 0.00\u00a0% of the cases the prisoners are free.\nUsing an optimal strategy in 31.34\u00a0% of the cases the prisoners are free.",
        "safe": true
    },
    {
        "filename": "100 prisoners_4.txt",
        "content": "Random strategie \u00a0: 0 sur 1000\nOptimal strategie\u00a0: 305 sur 1000\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_40.txt",
        "content": "include \"cowgol.coh\";\ninclude \"argv.coh\";\n\n# Parameters\nconst Drawers    \u00a0:= 100;   # Amount of drawers (and prisoners)\nconst Attempts   \u00a0:= 50;    # Amount of attempts a prisoner may make\nconst Simulations\u00a0:= 2000;  # Amount of simulations to run\n\ntypedef NSim is int(0, Simulations);\n\n# Random number generator\nrecord RNG is\n    x: uint8;\n    a: uint8;\n    b: uint8;\n    c: uint8;\n    state @at(0): int32;\nend record;\n\nsub RandomByte(r: [RNG]): (byte: uint8) is \n    r.x\u00a0:= r.x + 1;\n    r.a\u00a0:= r.a ^ r.c ^ r.x;\n    r.b\u00a0:= r.b + r.a;\n    r.c\u00a0:= r.c + (r.b >> 1) ^ r.a;\n    byte\u00a0:= r.c;\nend sub;\n\nsub RandomUpTo(r: [RNG], limit: uint8): (rslt: uint8) is\n    var x: uint8\u00a0:= 1;\n    while x < limit loop\n        x\u00a0:= x << 1;\n    end loop;\n    x\u00a0:= x - 1;\n    \n    loop\n        rslt\u00a0:= RandomByte(r) & x;\n        if rslt < limit then\n            break;\n        end if;\n    end loop;\nend sub;\n\n# Drawers (though marked 0..99 instead of 1..100)\nvar drawers: uint8[Drawers];\ntypedef Drawer is @indexof drawers;\ntypedef Prisoner is Drawer;\n\n# Place cards randomly in drawers\nsub InitDrawers(r: [RNG]) is\n    var x: Drawer\u00a0:= 0;\n    while x < Drawers loop\n        drawers[x]\u00a0:= x;\n        x\u00a0:= x + 1;\n    end loop;\n    \n    x\u00a0:= 0;\n    while x < Drawers - 1 loop\n        var y\u00a0:= x + RandomUpTo(r, Drawers-x);\n        var t\u00a0:= drawers[x];\n        drawers[x]\u00a0:= drawers[y];\n        drawers[y]\u00a0:= t;\n        x\u00a0:= x + 1;\n    end loop;\nend sub;\n\n# A prisoner can apply a strategy and either succeed or not\ninterface Strategy(p: Prisoner, r: [RNG]): (success: uint8);\n\n# The stupid strategy: open drawers randomly.\nsub Stupid implements Strategy is\n    # Let's assume the prisoner is smart enough not to reopen an open drawer\n    var opened: Drawer[Drawers];\n    MemZero(&opened[0], @bytesof opened);\n    \n    # Open random drawers\n    success\u00a0:= 0;\n    var triesLeft: uint8\u00a0:= Attempts;\n    while triesLeft\u00a0!= 0 loop\n        var d\u00a0:= RandomUpTo(r, Drawers); # grab a random drawer\n        if opened[d]\u00a0!= 0 then\n            continue; # Ignore it if a drawer was already open\n        else\n            triesLeft\u00a0:= triesLeft - 1;\n            opened[d]\u00a0:= 1;\n            if drawers[d] == p then # found it!\n                success\u00a0:= 1;\n                return;\n            end if;\n        end if;\n    end loop;\nend sub;\n    \n# The optimal strategy: open the drawer for each number\nsub Optimal implements Strategy is\n    var current\u00a0:= p;\n    var triesLeft: uint8\u00a0:= Attempts;\n    success\u00a0:= 0;\n    while triesLeft\u00a0!= 0 loop\n        current\u00a0:= drawers[current];\n        if current == p then\n            success\u00a0:= 1;\n            return;\n        end if;\n        triesLeft\u00a0:= triesLeft - 1;\n    end loop;\nend sub;\n\n# Run a simulation\nsub Simulate(s: Strategy, r: [RNG]): (success: uint8) is\n    InitDrawers(r); # place cards randomly in drawer\n    var p: Prisoner\u00a0:= 0;\n    success\u00a0:= 1; # if they all succeed the simulation succeeds\n    while p < Drawers loop # but for each prisoner... \n        if s(p, r) == 0 then # if he fails, the simulation fails\n            success\u00a0:= 0;\n            return;\n        end if;\n        p\u00a0:= p + 1;\n    end loop;\nend sub;\n\n# Run an amount of simulations and report the amount of successes\nsub Run(n: NSim, s: Strategy, r: [RNG]): (successes: NSim) is\n    successes\u00a0:= 0;\n    while n > 0 loop\n        successes\u00a0:= successes + Simulate(s, r) as NSim;\n        n\u00a0:= n - 1;\n    end loop;\nend sub;\n\n# Initialize RNG with number given on command line (defaults to 0)\nvar rng: RNG; rng.state\u00a0:= 0;\nArgvInit();\nvar arg\u00a0:= ArgvNext();\nif arg\u00a0!= 0 as [uint8] then\n    (rng.state, arg)\u00a0:= AToI(arg);\nend if;\n\nsub RunAndPrint(name: [uint8], strat: Strategy) is\n    print(name);\n    print(\" strategy: \");\n    var succ\u00a0:= Run(Simulations, strat, &rng) as uint32;\n    print_i32(succ);\n    print(\" out of \");\n    print_i32(Simulations);\n    print(\" - \");\n    print_i32(succ * 100 / Simulations);\n    print(\"%\\n\");\nend sub;\n\nRunAndPrint(\"Stupid\", Stupid);\nRunAndPrint(\"Optimal\", Optimal);",
        "safe": true
    },
    {
        "filename": "100 prisoners_41.txt",
        "content": "Stupid strategy: 0 out of 2000 - 0%\nOptimal strategy: 634 out of 2000 - 31%",
        "safe": true
    },
    {
        "filename": "100 prisoners_42.txt",
        "content": "prisoners = (1..100).to_a\nN = 100_000\ngenerate_rooms = ->{ (1..100).to_a.shuffle }\n\nres = N.times.count do\n  rooms = generate_rooms.call\n  prisoners.all? { |pr| rooms[1, 100].sample(50).includes?(pr) }\nend\nputs \"Random strategy\u00a0: %11.4f\u00a0%%\" % (res.fdiv(N) * 100)\n\nres = N.times.count do\n  rooms = generate_rooms.call\n  prisoners.all? do |pr|\n    cur_room = pr\n    50.times.any? do\n      cur_room = rooms[cur_room - 1]\n      found = (cur_room == pr)\n      found\n    end\n  end\nend\nputs \"Optimal strategy: %11.4f\u00a0%%\" % (res.fdiv(N) * 100)\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_43.txt",
        "content": "Random strategy\u00a0:      0.0000\u00a0%\nOptimal strategy:     31.3190\u00a0%",
        "safe": true
    },
    {
        "filename": "100 prisoners_44.txt",
        "content": "import std.array;\nimport std.random;\nimport std.range;\nimport std.stdio;\nimport std.traits;\n\nbool playOptimal() {\n    auto secrets = iota(100).array.randomShuffle();\n\n    prisoner:\n    foreach (p; 0..100) {\n        auto choice = p;\n        foreach (_; 0..50) {\n            if (secrets[choice] == p) continue prisoner;\n            choice = secrets[choice];\n        }\n        return false;\n    }\n\n    return true;\n}\n\nbool playRandom() {\n    auto secrets = iota(100).array.randomShuffle();\n\n    prisoner:\n    foreach (p; 0..100) {\n        auto choices = iota(100).array.randomShuffle();\n        foreach (i; 0..50) {\n            if (choices[i] == p) continue prisoner;\n        }\n        return false;\n    }\n\n    return true;\n}\n\ndouble exec(const size_t n, bool function() play) {\n    size_t success = 0;\n    for (int i = n; i > 0; i--) {\n        if (play()) {\n            success++;\n        }\n    }\n    return 100.0 * success / n;\n}\n\nvoid main() {\n    enum N = 1_000_000;\n    writeln(\"# of executions: \", N);\n    writefln(\"Optimal play success rate: %11.8f%%\", exec(N, &playOptimal));\n    writefln(\" Random play success rate: %11.8f%%\", exec(N, &playRandom));\n}\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_45.txt",
        "content": "# of executions: 1000000\nOptimal play success rate: 31.16100000%\n Random play success rate:  0.00000000%",
        "safe": true
    },
    {
        "filename": "100 prisoners_46.txt",
        "content": "import 'dart:math';\n\nint playRandom(int n) {\n  var rnd = Random();\n  int pardoned = 0;\n  List<int> inDrawer = List<int>.generate(100, (i) => i);\n  List<int> sampler = List<int>.generate(100, (i) => i);\n  for (int round = 0; round < n; round++) {\n    inDrawer.shuffle();\n    bool found = false;\n    for (int prisoner = 0; prisoner < 100; prisoner++) {\n      found = false;\n      sampler.shuffle(rnd);\n      for (int i = 0; i < 50; i++) {\n        int reveal = sampler[i];\n        int card = inDrawer[reveal];\n        if (card == prisoner) {\n          found = true;\n          break;\n        }\n      }\n      if (!found) {\n        break;\n      }\n    }\n    if (found) {\n      pardoned++;\n    }\n  }\n  return (pardoned / n * 100).round();\n}\n\nint playOptimal(int n) {\n  var rnd = Random();\n  int pardoned = 0;\n  bool found = false;\n  List<int> inDrawer = List<int>.generate(100, (i) => i);\n  for (int round = 0; round < n; round++) {\n    inDrawer.shuffle(rnd);\n    for (int prisoner = 0; prisoner < 100; prisoner++) {\n      int reveal = prisoner;\n      found = false;\n      for (int go = 0; go < 50; go++) {\n        int card = inDrawer[reveal];\n        if (card == prisoner) {\n          found = true;\n          break;\n        }\n        reveal = card;\n      }\n      if (!found) {\n        break;\n      }\n    }\n    if (found) {\n      pardoned++;\n    }\n  }\n  return (pardoned / n * 100).round();\n}\n\nvoid main() {\n  int n = 100000;\n  print(\" Simulation count: $n\");\n  print(\" Random play wins: ${playRandom(n).toStringAsFixed(2)}% of simulations\");\n  print(\"Optimal play wins: ${playOptimal(n).toStringAsFixed(2)}% of simulations\");\n}\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_47.txt",
        "content": " Simulation count: 100000\n Random play wins: 0.00% of simulations\nOptimal play wins: 31.00% of simulations\n\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_48.txt",
        "content": "for i = 1 to 100\n   drawer[] &= i\n   sampler[] &= i\n.\nsubr shuffle_drawer\n   for i = len drawer[] downto 2\n      r = random i\n      swap drawer[r] drawer[i]\n   .\n.\nsubr play_random\n   shuffle_drawer\n   for prisoner = 1 to 100\n      found = 0\n      for i = 1 to 50\n         r = random (100 - i)\n         card = drawer[sampler[r]]\n         swap sampler[r] sampler[100 - i - 1]\n         if card = prisoner\n            found = 1\n            break 1\n         .\n      .\n      if found = 0\n         break 1\n      .\n   .\n.\nsubr play_optimal\n   shuffle_drawer\n   for prisoner = 1 to 100\n      reveal = prisoner\n      found = 0\n      for i = 1 to 50\n         card = drawer[reveal]\n         if card = prisoner\n            found = 1\n            break 1\n         .\n         reveal = card\n      .\n      if found = 0\n         break 1\n      .\n   .\n.\nn = 10000\nwin = 0\nfor _ = 1 to n\n   play_random\n   win += found\n.\nprint \"random: \" & 100.0 * win / n & \"%\"\n#\nwin = 0\nfor _ = 1 to n\n   play_optimal\n   win += found\n.\nprint \"optimal: \" & 100.0 * win / n & \"%\"\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_49.txt",
        "content": "random: 0.000%\noptimal: 30.800%\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_5.txt",
        "content": "HOW TO FILL drawers:\n    PUT {} IN drawers\n    FOR i IN {1..100}: PUT i IN drawers[i]\n    FOR i IN {1..100}:\n        PUT choice {i..100} IN j\n        PUT drawers[i], drawers[j] IN drawers[j], drawers[i]\n\nHOW TO REPORT prisoner random.strat drawers:\n    PUT {1..100} IN available\n    FOR turn IN {1..50}:\n        PUT choice available IN drawer\n        IF drawers[drawer] = prisoner: SUCCEED\n        REMOVE drawer FROM available\n    FAIL\n\nHOW TO REPORT prisoner optimal.strat drawers:\n    PUT prisoner IN drawer\n    FOR turn IN {1..50}:\n        IF drawers[drawer] = prisoner: SUCCEED\n        PUT drawers[drawer] IN drawer\n    FAIL\n\nHOW TO REPORT simulate strategy:\n    FILL drawers\n    FOR prisoner IN {1..100}:\n        SELECT:\n            strategy = \"Random\":\n                IF NOT prisoner random.strat drawers: FAIL\n            strategy = \"Optimal\":\n                IF NOT prisoner optimal.strat drawers: FAIL\n    SUCCEED\n\nHOW TO RETURN n.sim chance.of.success strategy:\n    PUT 0 IN success\n    FOR n IN {1..n.sim}:\n        IF simulate strategy: PUT success+1 IN success\n    RETURN success * 100 / n.sim\n\nFOR strategy IN {\"Random\"; \"Optimal\"}:\n    WRITE strategy, \": \", 10000 chance.of.success strategy, '%'/",
        "safe": true
    },
    {
        "filename": "100 prisoners_50.txt",
        "content": "module OneHundredPrisoners {\n    @Inject Console console;\n\n    void run() {\n        console.print($\"# of executions: {attempts}\");\n        console.print($\"Optimal play success rate: {simulate(tryOpt)}%\");\n        console.print($\" Random play success rate: {simulate(tryRnd)}%\");\n    }\n\n    Int attempts = 10000;\n\n    Dec simulate(function Boolean(Int[]) allFoundNumber) {\n        Int[] drawers  = new Int[100](i->i);\n        Int   pardoned = 0;\n        for (Int i\u00a0: 1..attempts) {\n            if (allFoundNumber(drawers.shuffled())) {\n                ++pardoned;\n            }\n        }\n        return (pardoned * 1000000 / attempts).toDec() / 10000;\n    }\n\n    Boolean tryRnd(Int[] drawers) {\n        Inmates: for (Int inmate\u00a0: 0..<100) {\n            Int[] choices = drawers.shuffled();\n            for (Int attempt\u00a0: 0..<50) {\n                if (drawers[choices[attempt]] == inmate) {\n                    continue Inmates;\n                }\n            }\n            return False;\n        }\n        return True;\n    }\n\n    Boolean tryOpt(Int[] drawers) {\n        Inmates: for (Int inmate\u00a0: 0..<100) {\n            Int choice = inmate;\n            for (Int attempt\u00a0: 0..<50) {\n                if (drawers[choice] == inmate) {\n                    continue Inmates;\n                }\n                choice = drawers[choice];\n            }\n            return False;\n        }\n        return True;\n    }\n}",
        "safe": true
    },
    {
        "filename": "100 prisoners_51.txt",
        "content": "# of executions: 10000\nOptimal play success rate: 30.1%\n Random play success rate: 0%\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_52.txt",
        "content": "defmodule HundredPrisoners do\n  def optimal_room(_, _, _, []), do: []\n  def optimal_room(prisoner, current_room, rooms, [_ | tail]) do\n    found = Enum.at(rooms, current_room - 1) == prisoner\n    next_room = Enum.at(rooms, current_room - 1)\n    [found] ++ optimal_room(prisoner, next_room, rooms, tail)\n  end\n\n  def optimal_search(prisoner, rooms) do\n    Enum.any?(optimal_room(prisoner, prisoner, rooms, Enum.to_list(1..50)))\n  end\nend\n\nprisoners = 1..100\nn = 1..10_000\ngenerate_rooms = fn -> Enum.shuffle(1..100) end\n\nrandom_strategy = Enum.count(n, \n  fn _ -> \n  rooms = generate_rooms.()\n  Enum.all?(prisoners, fn pr -> pr in (rooms |> Enum.take_random(50)) end)\nend)\n\nIO.puts \"Random strategy: #{random_strategy} / #{n |> Range.size}\"\n\noptimal_strategy = Enum.count(n,\n  fn _ ->\n  rooms = generate_rooms.()\n  Enum.all?(prisoners, \n    fn pr -> HundredPrisoners.optimal_search(pr, rooms) end)\nend)\n\nIO.puts \"Optimal strategy: #{optimal_strategy} / #{n |> Range.size}\"\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_53.txt",
        "content": "Random strategy: 0 / 10000\nOptimal strategy: 3110 / 10000\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_54.txt",
        "content": "let rnd = System.Random()\nlet shuffled min max =\n    [|min..max|] |> Array.sortBy (fun _ -> rnd.Next(min,max+1))\n\nlet drawers () = shuffled 1 100\n\n// strategy randomizing drawer opening\nlet badChoices (drawers' : int array) =\n    Seq.init 100 (fun _ -> shuffled 1 100 |> Array.take 50) // selections for each prisoner\n    |> Seq.map (fun indexes -> indexes |> Array.map(fun index -> drawers'.[index-1])) // transform to cards\n    |> Seq.mapi (fun i cards -> cards |> Array.contains i) // check if any card matches prisoner number\n    |> Seq.contains false // true means not all prisoners got their cards\nlet outcomeOfRandom runs =\n    let pardons = Seq.init runs (fun _ -> badChoices (drawers ()))\n                  |> Seq.sumBy (fun badChoice -> if badChoice |> not then 1.0 else 0.0)\n    pardons/ float runs\n    \n// strategy optimizing drawer opening\nlet smartChoice max prisoner (drawers' : int array) =\n    prisoner\n    |> Seq.unfold (fun selection ->\n        let card = drawers'.[selection-1]\n        Some (card, card))\n    |> Seq.take max\n    |> Seq.contains prisoner\nlet smartChoices (drawers' : int array) =\n    seq { 1..100 }\n    |> Seq.map (fun prisoner -> smartChoice 50 prisoner drawers')\n    |> Seq.filter (fun result -> result |> not) // remove all but false results\n    |> Seq.isEmpty // empty means all prisoners got their cards\nlet outcomeOfOptimize runs =\n    let pardons = Seq.init runs (fun _ -> smartChoices (drawers()))\n                  |> Seq.sumBy (fun smartChoice' -> if smartChoice' then 1.0 else 0.0)\n    pardons/ float runs\n    \nprintfn $\"Using Random Strategy: {(outcomeOfRandom 20000):p2}\"\nprintfn $\"Using Optimum Strategy: {(outcomeOfOptimize 20000):p2}\"\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_55.txt",
        "content": "Using Random Strategy: 0.00%\nUsing Optimum Strategy: 31.06%\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_56.txt",
        "content": "USING: arrays formatting fry io kernel math random sequences ;\n\n: setup ( -- seq seq ) 100 <iota> dup >array randomize ;\n\n: rand ( -- ? )\n    setup [ 50 sample member? not ] curry find nip >boolean not ;\n\n: trail ( m seq -- n )\n    50 pick '[ [ nth ] keep over _ = ] replicate [ t = ] any?\n    2nip ;\n\n: optimal ( -- ? ) setup [ trail ] curry [ and ] map-reduce ;\n\n: simulate ( m quot -- x )\n    dupd replicate [ t = ] count swap /f 100 * ; inline\n\n\"Simulation count: 10,000\" print\n10,000 [ rand ] simulate \"Random play success: \"\n10,000 [ optimal ] simulate \"Optimal play success: \"\n[ write \"%.2f%%\\n\" printf ] 2bi@\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_57.txt",
        "content": "Simulation count: 10,000\nRandom play success: 0.00%\nOptimal play success: 31.11%\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_58.txt",
        "content": "01.10 T %5.02,\" RANDOM\";S CU=0\n01.20 F Z=1,2000;D 5;S CU=CU+SU\n01.30 T CU/20,!,\"OPTIMAL\";S CU=0\n01.40 F Z=1,2000;D 6;S CU=CU+SU\n01.50 T CU/20,!\n01.60 Q\n\n02.01 C-- PUT CARDS IN RANDOM DRAWERS\n02.10 F X=1,100;S D(X)=X\n02.20 F X=1,99;D 2.3;S B=D(X);S D(X)=D(A);S D(A)=B\n02.30 D 2.4;S A=X+FITR(A*(101-X))\n02.40 S A=FABS(FRAN()*10);S A=A-FITR(A)\n\n03.01 C-- PRISONER X TRIES UP TO 50 RANDOM DRAWERS\n03.10 S TR=50;S SU=0\n03.20 D 2.4;I (X-D(A))3.3,3.4,3.3\n03.30 S TR=TR-1;I (TR),3.5,3.2\n03.40 S SU=1;R\n03.50 S SU=0\n\n04.01 C-- PRISONER X TRIES OPTIMAL METHOD\n04.10 S TR=50;S SU=0;S A=X\n04.20 I (X-D(A))4.3,4.4,4.3\n04.30 S TR=TR-1;S A=D(A);I (TR),4.5,4.2\n04.40 S SU=1;R\n04.50 S SU=0\n\n05.01 C-- PRISONERS TRY RANDOM METHOD UNTIL ONE FAILS\n05.10 D 2;S X=1\n05.20 I (X-101)5.3,5.4\n05.30 D 3;S X=X+1;I (SU),5.4,5.2\n05.40 R\n\n06.01 C-- PRISONERS TRY OPTIMAL METHOD UNTIL ONE FAILS\n06.10 D 2;S X=1\n06.20 I (X-101)6.3,6.4\n06.30 D 4;S X=X+1;I (SU),6.4,6.2\n06.40 R",
        "safe": true
    },
    {
        "filename": "100 prisoners_59.txt",
        "content": " RANDOM=   0.00\nOPTIMAL=  30.10",
        "safe": true
    },
    {
        "filename": "100 prisoners_6.txt",
        "content": "Optimal:  32.01\u00a0%\nRandom:  0\u00a0%",
        "safe": true
    },
    {
        "filename": "100 prisoners_60.txt",
        "content": "INCLUDE ran4.seq\n\n100      CONSTANT #drawers\n#drawers CONSTANT #players\n100000   CONSTANT #tries\n\nCREATE drawers  #drawers CELLS ALLOT                    \\ index 0..#drawers-1\n\n: drawer[]                              ( n -- addr )   \\ return address of drawer n\n    CELLS drawers +\n;\n\n: random_drawer                         ( -- n )        \\ n=0..#drawers-1 random drawer \n    RAN4 ( d ) XOR ( n ) #drawers MOD\n;\n\n: random_drawer[]                       ( -- addr )     \\ return address of random drawer\n    random_drawer drawer[]\n;\n\n: swap_indirect                         ( addr1 addr2 -- )  \\ swaps the values at the two addresses\n    2DUP @ SWAP @                       ( addr1 addr2 n2 n1 )\n    ROT ! SWAP !                        \\ store n1 at addr2 and n2 at addr1\n;\n\n: init_drawers                          ( -- ) \\ shuffle cards into drawers\n    #drawers 0 DO\n        I I drawer[] !                  \\ store cards in order\n    LOOP\n    #drawers 0 DO\n        I drawer[]  random_drawer[]     ( addr-drawer-i addr-drawer-rnd )\n        swap_indirect\n    LOOP\n;\n\n: random_turn                           ( player - f )\n    #drawers 2 / 0 DO\n\t\trandom_drawer \n\t\tdrawer[] @ \n\t\tOVER = IF\n\t\t\tDROP TRUE UNLOOP EXIT\t\\ found his number\n\t\tTHEN\n\tLOOP \n\tDROP FALSE\n;\n\n0 VALUE player\n\n: cycle_turn                            ( player - f )\n\tDUP TO player\t\t\t( next-drawer )\n    #drawers 2 / 0 DO\n\t\tdrawer[] @\n\t\tDUP player = IF \n\t\t\tDROP TRUE UNLOOP EXIT\t\\ found his number\n\t\tTHEN\n\tLOOP \n\tDROP FALSE\n;\n\n: turn                                  ( strategy player - f )\n    SWAP 0= IF                          \\ random play \n        random_turn\n    ELSE\n        cycle_turn\n    THEN\n;\n\n: play                                  ( strategy -- f ) \\ return true if prisioners survived\n    init_drawers\n    #players 0 DO\n        DUP I turn\n        0= IF\n            DROP FALSE UNLOOP EXIT \t\\ this player did not survive, UNLOOP, return false\n        THEN\n    LOOP \n    DROP TRUE                           \\ all survived, return true\n;\n\n: trie\t\t\t\t\t( strategy - nr-saved )\n\t0\t\t\t\t( strategy nr-saved )\n\t#tries 0 DO\n\t\tOVER play IF 1+ THEN\n\tLOOP\n\tNIP\n;\n\n0 trie . CR\t\\ random strategy\n1 trie . CR\t\\ follow the card number strategy\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_61.txt",
        "content": "0 \n30009 \n",
        "safe": true
    },
    {
        "filename": "100 prisoners_62.txt",
        "content": "SUBROUTINE SHUFFLE_ARRAY(INT_ARRAY)\n    ! Takes an input array and shuffles the elements by swapping them\n    ! in pairs in turn 10 times\n    IMPLICIT NONE\n\n    INTEGER, DIMENSION(100), INTENT(INOUT) :: INT_ARRAY\n    INTEGER, PARAMETER :: N_PASSES = 10\n    ! Local Variables\n\n    INTEGER :: TEMP_1, TEMP_2   ! Temporaries for swapping elements\n    INTEGER :: I, J, PASS       ! Indices variables\n    REAL :: R                   ! Randomly generator value\n\n    CALL RANDOM_SEED()  ! Seed the random number generator\n\n    DO PASS=1, N_PASSES\n        DO I=1, SIZE(INT_ARRAY)\n\n            ! Get a random index to swap with\n            CALL RANDOM_NUMBER(R)\n            J = CEILING(R*SIZE(INT_ARRAY))\n\n            ! In case generated index value\n            ! exceeds array size\n            DO WHILE (J > SIZE(INT_ARRAY))\n                J = CEILING(R*SIZE(INT_ARRAY))\n            END DO\n\n            !  Swap the two elements\n            TEMP_1 = INT_ARRAY(I)\n            TEMP_2 = INT_ARRAY(J)\n            INT_ARRAY(I) = TEMP_2\n            INT_ARRAY(J) = TEMP_1\n        ENDDO\n    ENDDO\nEND SUBROUTINE SHUFFLE_ARRAY\n\nSUBROUTINE RUN_RANDOM(N_ROUNDS)\n    ! Run the 100 prisoner puzzle simulation N_ROUNDS times\n    ! in the scenario where each prisoner selects a drawer at random\n    IMPLICIT NONE\n\n    INTEGER, INTENT(IN) :: N_ROUNDS ! Number of simulations to run in total\n\n    INTEGER :: ROUND, PRISONER, CHOICE, I       ! Iteration variables\n    INTEGER :: N_SUCCESSES                      ! Number of successful trials\n    REAL(8) :: TOTAL                            ! Total number of trials as real\n    LOGICAL :: NUM_FOUND = .FALSE.              ! Prisoner has found their number\n\n    INTEGER, DIMENSION(100) :: CARDS, CHOICES   ! Arrays representing card allocations\n                                                ! to draws and drawer choice order\n\n    ! Both cards and choices are randomly assigned.\n    ! This being the drawer (allocation represented by index),\n    ! and what drawer to pick for Nth/50 choice\n    ! (take first 50 elements of 100 element array)\n    CARDS = (/(I, I=1, 100, 1)/)\n    CHOICES = (/(I, I=1, 100, 1)/)\n\n    N_SUCCESSES = 0\n    TOTAL = REAL(N_ROUNDS)\n\n    ! Run the simulation for N_ROUNDS rounds\n    ! when a prisoner fails to find their number\n    ! after 50 trials, set that simulation to fail\n    ! and start the next round\n    ROUNDS_LOOP: DO ROUND=1, N_ROUNDS\n        CALL SHUFFLE_ARRAY(CARDS)\n        PRISONERS_LOOP: DO PRISONER=1, 100\n            NUM_FOUND = .FALSE.\n            CALL SHUFFLE_ARRAY(CHOICES)\n            CHOICE_LOOP: DO CHOICE=1, 50\n                IF(CARDS(CHOICE) == PRISONER) THEN\n                    NUM_FOUND = .TRUE.\n                    EXIT CHOICE_LOOP\n                ENDIF\n            ENDDO CHOICE_LOOP\n            IF(.NOT. NUM_FOUND) THEN\n                EXIT PRISONERS_LOOP\n            ENDIF\n        ENDDO PRISONERS_LOOP\n        IF(NUM_FOUND) THEN\n            N_SUCCESSES = N_SUCCESSES + 1\n        ENDIF\n    ENDDO ROUNDS_LOOP\n\n    WRITE(*, '(A, F0.3, A)') \"Random drawer selection method success rate: \", &\n        100*N_SUCCESSES/TOTAL, \"%\"\n\nEND SUBROUTINE RUN_RANDOM\n\nSUBROUTINE RUN_OPTIMAL(N_ROUNDS)\n    ! Run the 100 prisoner puzzle simulation N_ROUNDS times in the scenario\n    ! where each prisoner selects firstly the drawer with their number and then\n    ! subsequently the drawer matching the number of the card present \n    ! within that current drawer\n    IMPLICIT NONE\n\n    INTEGER, INTENT(IN) :: N_ROUNDS\n\n    INTEGER :: ROUND, PRISONER, CHOICE, I   ! Iteration variables\n    INTEGER :: CURRENT_DRAW                 ! ID of the current draw\n    INTEGER :: N_SUCCESSES                  ! Number of successful trials\n    REAL(8) :: TOTAL                        ! Total number of trials as real\n    LOGICAL :: NUM_FOUND = .FALSE.          ! Prisoner has found their number \n    INTEGER, DIMENSION(100) :: CARDS        ! Array representing card allocations\n\n    ! Cards are randomly assigned to a drawer \n    ! (allocation represented by index),\n    CARDS = (/(I, I=1, 100, 1)/)\n\n    N_SUCCESSES = 0\n    TOTAL = REAL(N_ROUNDS)\n\n    ! Run the simulation for N_ROUNDS rounds\n    ! when a prisoner fails to find their number\n    ! after 50 trials, set that simulation to fail\n    ! and start the next round\n    ROUNDS_LOOP: DO ROUND=1, N_ROUNDS\n        CARDS = (/(I, I=1, 100, 1)/)\n        CALL SHUFFLE_ARRAY(CARDS)\n        PRISONERS_LOOP: DO PRISONER=1, 100\n            CURRENT_DRAW = PRISONER\n            NUM_FOUND = .FALSE.\n            CHOICE_LOOP: DO CHOICE=1, 50\n                IF(CARDS(CURRENT_DRAW) == PRISONER) THEN\n                    NUM_FOUND = .TRUE.\n                    EXIT CHOICE_LOOP\n                ELSE\n                    CURRENT_DRAW = CARDS(CURRENT_DRAW)\n                ENDIF\n            ENDDO CHOICE_LOOP\n            IF(.NOT. NUM_FOUND) THEN\n                EXIT PRISONERS_LOOP\n            ENDIF\n        ENDDO PRISONERS_LOOP\n        IF(NUM_FOUND) THEN\n            N_SUCCESSES = N_SUCCESSES + 1\n        ENDIF\n    ENDDO ROUNDS_LOOP\n    WRITE(*, '(A, F0.3, A)') \"Optimal drawer selection method success rate: \", &\n        100*N_SUCCESSES/TOTAL, \"%\"\n\nEND SUBROUTINE RUN_OPTIMAL\n\nPROGRAM HUNDRED_PRISONERS\n    ! Run the two scenarios for the 100 prisoners puzzle of random choice\n    ! and optimal choice (choice based on drawer contents)\n    IMPLICIT NONE\n    INTEGER, PARAMETER :: N_ROUNDS = 50000\n    WRITE(*,'(A, I0, A)') \"Running simulation for \", N_ROUNDS, \" trials...\"\n    CALL RUN_RANDOM(N_ROUNDS)\n    CALL RUN_OPTIMAL(N_ROUNDS)\nEND PROGRAM HUNDRED_PRISONERS\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_63.txt",
        "content": "Running simulation for 50000 trials...\nRandom drawer selection method success rate: .000%\nOptimal drawer selection method success rate: 31.360%\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_64.txt",
        "content": "#include once \"knuthshuf.bas\"   'use the routines in https://rosettacode.org/wiki/Knuth_shuffle#FreeBASIC\n\nfunction gus( i as long, strat as boolean ) as long\n    if strat then return i\n    return 1+int(rnd*100)\nend function\n\nsub trials( byref c_success as long, byref c_fail as long, byval strat as boolean )\n        dim as long i, j, k, guess, drawer(1 to 100)\n    for i = 1 to 100\n        drawer(i) = i\n    next i\n    for j = 1 to 1000000 'one million trials of prisoners\n        knuth_up( drawer() )  'shuffles the cards in the drawers\n            for i = 1 to 100 'prisoner number\n            guess = gus(i, strat)\n            for k = 1 to 50 'each prisoner gets 50 tries\n                if drawer(guess) = i then goto next_prisoner\n                guess = gus(drawer(guess), strat)\n            next k\n            c_fail += 1\n            goto next_trial\n            next_prisoner:\n        next i\n        c_success += 1\n        next_trial:\n    next j\nend sub\n\nrandomize timer\ndim as long c_fail=0, c_success=0\n\ntrials( c_success, c_fail, false )\n\nprint using \"For prisoners guessing randomly we had ####### successes and ####### failures.\";c_success;c_fail\n\nc_success = 0\nc_fail = 0\n\ntrials( c_success, c_fail, true )\n\nprint using \"For prisoners using the strategy we had ####### successes and ####### failures.\";c_success;c_fail\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_65.txt",
        "content": "include \"Tlbx GameplayKit.incl\"\n\n_prisoners = 100\n_instances = 10000\n\nlocal fn DrawersArray as CFArrayRef\n  long index\n  CFMutableArrayRef temp = fn MutableArrayWithCapacity(100)\n  for index = 0 to 99\n    MutableArrayAddObject( temp, @(index) )\n  next\nend fn = fn ArrayShuffledArray( temp )\n\n\nlocal fn RandomResult( drawers as CFArrayRef ) as BOOL\n  long prisoner, i, drawer, total = 0\n  MutableIndexSetRef set\n  \n  for prisoner = 0 to _prisoners - 1\n    set = fn MutableIndexSetInit\n    for i = 1 to _prisoners/2\n      drawer = rnd(_prisoners)-1\n      while ( fn IndexSetContainsIndex( set, intVal( drawers[drawer] ) ) )\n        drawer = rnd(_prisoners)-1\n      wend\n      MutableIndexSetAddIndex( set, intVal( drawers[drawer] ) )\n      if ( fn IndexSetContainsIndex( set, prisoner ) )\n        total++\n        break\n      end if\n    next\n  next\nend fn = ( total == _prisoners )\n\n\nlocal fn OptimalResult( drawers as CFArrayRef ) as BOOL\n  long prisoner, drawer, i, card, total = 0\n  \n  for prisoner = 0 to _prisoners - 1\n    drawer = prisoner\n    for i = 1 to _prisoners/2\n      card = intVal( drawers[drawer] )\n      if ( card == prisoner )\n        total++\n        break\n      end if\n      drawer = card\n    next\n  next\nend fn = ( total == _prisoners )\n\n\nvoid local fn DoIt\n  static double sTime = 0.0\n  \n  block TimerRef timer = timerbegin , 0.001, YES\n    sTime += 0.001\n    cls\n    printf @\"Compute time:\u00a0%.3f\\n\",sTime\n  timerend\n  \n  dispatchglobal\n    long instance, randomTotal = 0, optimalTotal = 0\n    CFArrayRef drawers\n    \n    for instance = 1 to _instances\n      drawers = fn DrawersArray\n      if ( fn RandomResult( drawers ) ) then randomTotal++\n      if ( fn OptimalResult( drawers ) ) then optimalTotal++\n    next\n    \n    dispatchmain\n      TimerInvalidate( timer )\n      \n      cls\n      print @\"Prisoners: \"_prisoners\n      print @\"Instances: \"_instances\n      printf @\"Random - fail: %ld, success: %ld (%.2f%%)\",_instances-randomTotal,randomTotal,(double)randomTotal/(double)_instances*100.0\n      printf @\"Optimal - fail: %ld, success: %ld (%.2f%%)\\n\",_instances-optimalTotal,optimalTotal,(double)optimalTotal/(double)_instances*100.0\n      \n      printf @\"Compute time:\u00a0%.3f\\n\",sTime\n    dispatchend\n    \n  dispatchend\nend fn\n\nrandom\n\nwindow 1, @\"100 Prisoners\"\n\nfn DoIt\n\nHandleEvents",
        "safe": true
    },
    {
        "filename": "100 prisoners_66.txt",
        "content": "Prisoners: 100\nInstances: 10000\nRandom - fail: 10000, success: 0 (0.00%)\nOptimal - fail: 6896, success: 3104 (31.04%)\n\nCompute time: 7.856\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_67.txt",
        "content": "' Gambas module file\n\nPublic DrawerArray As Long[]\nPublic NumberFromDrawer As Long\nPublic FoundOwnNumber As Long\n\nPublic Sub Main()\n  \n  Dim NumberOfPrisoners As Long\n  Dim Selections As Long\n  Dim Tries As Long\n  \n  Print \"Number of prisoners (default, 100)?\"\n  Try Input NumberOfPrisoners\n  If Error Then NumberOfPrisoners = 100\n  \n  Print \"Number of selections (default, half of prisoners)?\" \n  Try Input Selections\n  If Error Then Selections = NumberOfPrisoners / 2\n  \n  Print \"Number of tries (default, 1000)?\"\n  Try Input Tries\n  If Error Then Tries = 1000\n  \n  Dim AllFoundOptimal As Long = 0\n  Dim AllFoundRandom As Long = 0\n  Dim AllFoundRandomMem As Long = 0\n  \n  Dim i As Long\n  Dim OptimalCount As Long\n  Dim RandomCount As Long\n  Dim RandomMenCount As Long\n  \n  Dim fStart As Float = Timer\n  \n  For i = 1 To Tries\n    OptimalCount = HundredPrisoners_Optimal(NumberOfPrisoners, Selections)\n    RandomCount = HundredPrisoners_Random(NumberOfPrisoners, Selections)\n    RandomMenCount = HundredPrisoners_Random_Mem(NumberOfPrisoners, Selections)\n    \n    If OptimalCount = NumberOfPrisoners Then AllFoundOptimal += 1\n    If RandomCount = NumberOfPrisoners Then AllFoundRandom += 1\n    If RandomMenCount = NumberOfPrisoners Then AllFoundRandomMem += 1\n  Next\n  \n  Dim fTime As Float = Timer - fStart\n  fTime = Round(ftime, -1)\n  \n  Print\n  Print \"Result with \" & NumberOfPrisoners & \" prisoners, \" & Selections & \" selections and \" & Tries & \" tries. \"\n  Print\n  Print \"Optimal: \" & AllFoundOptimal & \" of \" & Tries & \": \" & Str(AllFoundOptimal / Tries * 100) & \"\u00a0%\"\n  Print \"Random: \" & AllFoundRandom & \" of \" & Tries & \": \" & Str(AllFoundRandom / Tries * 100) & \"\u00a0%\"\n  Print \"RandomMem: \" & AllFoundRandomMem & \" of \" & Tries & \": \" & Str(AllFoundRandomMem / Tries * 100) & \"\u00a0%\"\n  Print\n  Print \"Elapsed Time: \" & fTime & \" sec\"\n  Print\n  Print \"Trials/sec: \" & Round(Tries / fTime, -1)\n  \nEnd\n\nFunction HundredPrisoners_Optimal(NrPrisoners As Long, NrSelections As Long) As Long\n  \n  DrawerArray = New Long[NrPrisoners]\n  Dim Counter As Long\n  \n  For Counter = 0 To DrawerArray.Max\n    DrawerArray[Counter] = Counter + 1\n  Next\n  \n  DrawerArray.Shuffle()\n  \n  Dim i As Long\n  Dim j As Long\n  FoundOwnNumber = 0\n  \n  For i = 1 To NrPrisoners\n    For j = 1 To NrSelections\n      If j = 1 Then NumberFromDrawer = DrawerArray[i - 1]\n      \n      If NumberFromDrawer = i Then\n        FoundOwnNumber += 1\n        Break\n      Endif\n      NumberFromDrawer = DrawerArray[NumberFromDrawer - 1]\n    Next\n  Next\n  Return FoundOwnNumber\n  \nEnd\n\nFunction HundredPrisoners_Random(NrPrisoners As Long, NrSelections As Long) As Long\n  \n  Dim RandomDrawer As Long\n  Dim Counter As Long\n  \n  DrawerArray = New Long[NrPrisoners]\n  \n  For Counter = 0 To DrawerArray.Max\n    DrawerArray[Counter] = Counter + 1\n  Next\n  \n  DrawerArray.Shuffle()\n  \n  Dim i As Long\n  Dim j As Long\n  FoundOwnNumber = 0\n  \n  Randomize\n  \n  For i = 1 To NrPrisoners\n    For j = 1 To NrSelections\n      RandomDrawer = CLong(Rand(NrPrisoners - 1))\n      NumberFromDrawer = DrawerArray[RandomDrawer]\n      If NumberFromDrawer = i Then\n        FoundOwnNumber += 1\n        Break\n      Endif\n    Next\n  Next\n  Return FoundOwnNumber\n  \nEnd\n\nFunction HundredPrisoners_Random_Mem(NrPrisoners As Long, NrSelections As Long) As Long\n  \n  Dim SelectionArray As New Long[NrPrisoners]\n  Dim Counter As Long\n  \n  DrawerArray = New Long[NrPrisoners]\n  \n  For Counter = 0 To DrawerArray.Max\n    DrawerArray[Counter] = Counter + 1\n    \n  Next\n  \n  For Counter = 0 To SelectionArray.Max\n    SelectionArray[Counter] = Counter + 1\n    \n  Next\n  \n  DrawerArray.Shuffle()\n  \n  Dim i As Long\n  Dim j As Long\n  FoundOwnNumber = 0\n  \n  For i = 1 To NrPrisoners\n    SelectionArray.Shuffle()\n    For j = 1 To NrSelections\n      NumberFromDrawer = DrawerArray[SelectionArray[j - 1] - 1]\n      If NumberFromDrawer = i Then\n        FoundOwnNumber += 1\n        Break\n      Endif\n      NumberFromDrawer = DrawerArray[NumberFromDrawer - 1]\n    Next\n  Next\n  Return FoundOwnNumber\n  \nEnd\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_68.txt",
        "content": "Number of prisoners (default, 100)?\n100\nNumber of selections (default, half of prisoners)?\n50\nNumber of tries (default, 1000)?\n\n\nResult with 100 prisoners, 50 selections and 1000 tries. \n\nOptimal: 311 of 1000: 31,1\u00a0%\nRandom: 0 of 1000: 0\u00a0%\nRandomMem: 0 of 1000: 0\u00a0%\n\nElapsed Time: 8.7 sec\n\nTrials/sec: 114.9",
        "safe": true
    },
    {
        "filename": "100 prisoners_69.txt",
        "content": "extends MainLoop\n\n\nenum Strategy {Random, Optimal}\n\nconst prisoner_count := 100\n\n\nfunc get_random_drawers() -> Array[int]:\n\tvar drawers: Array[int] = []\n\tdrawers.resize(prisoner_count)\n\tfor i in range(0, prisoner_count):\n\t\tdrawers[i] = i + 1\n\tdrawers.shuffle()\n\treturn drawers\n\n\nvar random_strategy = func(drawers: Array[int], prisoner: int) -> bool:\n\t# Randomly selecting 50 drawers is equivalent to shuffling and picking the first 50\n\tvar drawerCopy: Array[int] = drawers.duplicate()\n\tdrawerCopy.shuffle()\n\tfor i in range(50):\n\t\tif drawers[drawerCopy[i]-1] == prisoner:\n\t\t\treturn true\n\treturn false\n\n\nvar optimal_strategy = func(drawers: Array[int], prisoner: int) -> bool:\n\tvar choice: int = prisoner\n\tfor _i in range(50):\n\t\tvar drawer_value: int = drawers[choice-1]\n\t\tif drawer_value == prisoner:\n\t\t\treturn true\n\t\tchoice = drawer_value\n\treturn false\n\n\nfunc play_all(drawers: Array[int], strategy: Callable) -> bool:\n\tfor prisoner in range(1, prisoner_count+1):\n\t\tif not strategy.call(drawers, prisoner):\n\t\t\treturn false\n\treturn true\n\n\nfunc _process(_delta: float) -> bool:\n\t# Constant seed for reproducibility, call randomize() in real use\n\tseed(1234)\n\n\tconst SAMPLE_SIZE: int = 10_000\n\n\tvar random_successes: int = 0\n\tfor i in range(SAMPLE_SIZE):\n\t\tif play_all(get_random_drawers(), random_strategy):\n\t\t\trandom_successes += 1\n\n\tvar optimal_successes: int = 0\n\tfor i in range(SAMPLE_SIZE):\n\t\tif play_all(get_random_drawers(), optimal_strategy):\n\t\t\toptimal_successes += 1\n\n\tprint(\"Random play: %%%f\" % (100.0 * random_successes/SAMPLE_SIZE))\n\tprint(\"Optimal play: %%%f\" % (100.0 * optimal_successes/SAMPLE_SIZE))\n\n\treturn true # Exit\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_7.txt",
        "content": "package Prisoners is\n\n   type Win_Percentage is digits 2 range 0.0 .. 100.0;\n   type Drawers is array (1 .. 100) of Positive;\n\n   function Play_Game\n     (Repetitions : in Positive;\n      Strategy    :    not null access function\n        (Cupboard     : in Drawers; Max_Prisoners : Integer;\n         Max_Attempts :    Integer; Prisoner_Number : Integer) return Boolean)\n      return Win_Percentage;\n   -- Play the game with a specified number of repetitions, the chosen strategy\n   -- is passed to this function\n\n   function Optimal_Strategy\n     (Cupboard : in Drawers; Max_Prisoners : Integer; Max_Attempts : Integer;\n      Prisoner_Number :    Integer) return Boolean;\n\n   function Random_Strategy\n     (Cupboard : in Drawers; Max_Prisoners : Integer; Max_Attempts : Integer;\n      Prisoner_Number :    Integer) return Boolean;\n\nend Prisoners;\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_70.txt",
        "content": "Random play: %0.000000\nOptimal play: %31.700000\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_71.txt",
        "content": "package main\n\nimport (\n    \"fmt\"\n    \"math/rand\"\n    \"time\"\n)\n\n// Uses 0-based numbering rather than 1-based numbering throughout.\nfunc doTrials(trials, np int, strategy string) {\n    pardoned := 0\ntrial:\n    for t := 0; t < trials; t++ {\n        var drawers [100]int\n        for i := 0; i < 100; i++ {\n            drawers[i] = i\n        }\n        rand.Shuffle(100, func(i, j int) {\n            drawers[i], drawers[j] = drawers[j], drawers[i]\n        })\n    prisoner:\n        for p := 0; p < np; p++ {\n            if strategy == \"optimal\" {\n                prev := p\n                for d := 0; d < 50; d++ {\n                    this := drawers[prev]\n                    if this == p {\n                        continue prisoner\n                    }\n                    prev = this\n                }\n            } else {\n                // Assumes a prisoner remembers previous drawers (s)he opened\n                // and chooses at random from the others.\n                var opened [100]bool\n                for d := 0; d < 50; d++ {\n                    var n int\n                    for {\n                        n = rand.Intn(100)\n                        if !opened[n] {\n                            opened[n] = true\n                            break\n                        }\n                    }\n                    if drawers[n] == p {\n                        continue prisoner\n                    }\n                }\n            }\n            continue trial\n        }\n        pardoned++\n    }\n    rf := float64(pardoned) / float64(trials) * 100\n    fmt.Printf(\"  strategy =\u00a0%-7s  pardoned =\u00a0%-6d relative frequency = %5.2f%%\\n\\n\", strategy, pardoned, rf)\n}\n\nfunc main() {\n    rand.Seed(time.Now().UnixNano())\n    const trials = 100000\n    for _, np := range []int{10, 100} {\n        fmt.Printf(\"Results from %d trials with %d prisoners:\\n\\n\", trials, np)\n        for _, strategy := range [2]string{\"random\", \"optimal\"} {\n            doTrials(trials, np, strategy)\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_72.txt",
        "content": "Results from 100000 trials with 10 prisoners:\n\n  strategy = random   pardoned = 99     relative frequency =  0.10%\n\n  strategy = optimal  pardoned = 31205  relative frequency = 31.20%\n\nResults from 100000 trials with 100 prisoners:\n\n  strategy = random   pardoned = 0      relative frequency =  0.00%\n\n  strategy = optimal  pardoned = 31154  relative frequency = 31.15%\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_73.txt",
        "content": "import java.util.function.Function\nimport java.util.stream.Collectors\nimport java.util.stream.IntStream\n\nclass Prisoners {\n    private static boolean playOptimal(int n) {\n        List<Integer> secretList = IntStream.range(0, n).boxed().collect(Collectors.toList())\n        Collections.shuffle(secretList)\n\n        prisoner:\n        for (int i = 0; i < secretList.size(); ++i) {\n            int prev = i\n            for (int j = 0; j < secretList.size() / 2; ++j) {\n                if (secretList.get(prev) == i) {\n                    continue prisoner\n                }\n                prev = secretList.get(prev)\n            }\n            return false\n        }\n        return true\n    }\n\n    private static boolean playRandom(int n) {\n        List<Integer> secretList = IntStream.range(0, n).boxed().collect(Collectors.toList())\n        Collections.shuffle(secretList)\n\n        prisoner:\n        for (Integer i\u00a0: secretList) {\n            List<Integer> trialList = IntStream.range(0, n).boxed().collect(Collectors.toList())\n            Collections.shuffle(trialList)\n\n            for (int j = 0; j < trialList.size() / 2; ++j) {\n                if (Objects.equals(trialList.get(j), i)) {\n                    continue prisoner\n                }\n            }\n\n            return false\n        }\n        return true\n    }\n\n    private static double exec(int n, int p, Function<Integer, Boolean> play) {\n        int succ = 0\n        for (int i = 0; i < n; ++i) {\n            if (play.apply(p)) {\n                succ++\n            }\n        }\n        return (succ * 100.0) / n\n    }\n\n    static void main(String[] args) {\n        final int n = 100_000\n        final int p = 100\n        System.out.printf(\"# of executions: %d\\n\", n)\n        System.out.printf(\"Optimal play success rate: %f%%\\n\", exec(n, p, Prisoners.&playOptimal))\n        System.out.printf(\"Random play success rate: %f%%\\n\", exec(n, p, Prisoners.&playRandom))\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_74.txt",
        "content": "# of executions: 100000\nOptimal play success rate: 31.215000%\nRandom play success rate: 0.000000%",
        "safe": true
    },
    {
        "filename": "100 prisoners_75.txt",
        "content": "import System.Random\nimport Control.Monad.State\n\nnumRuns        = 10000\nnumPrisoners   = 100\nnumDrawerTries = 50\ntype Drawers   = [Int]\ntype Prisoner  =  Int\ntype Prisoners = [Int]\n\nmain = do\n  gen <- getStdGen\n  putStrLn $ \"Chance of winning when choosing randomly: \"  ++ (show $ evalState runRandomly gen)\n  putStrLn $ \"Chance of winning when choosing optimally: \" ++ (show $ evalState runOptimally gen)\n\n\nrunRandomly :: State StdGen Double\nrunRandomly =\n  let runResults = replicateM numRuns $ do\n         drawers <- state $ shuffle [1..numPrisoners]\n         allM (\\prisoner -> openDrawersRandomly drawers prisoner numDrawerTries) [1..numPrisoners]\n   in  ((/ fromIntegral numRuns) . fromIntegral . sum . map fromEnum) `liftM` runResults\n\nopenDrawersRandomly :: Drawers -> Prisoner -> Int -> State StdGen Bool\nopenDrawersRandomly drawers prisoner triesLeft = go triesLeft []\n  where go 0 _ = return False\n        go triesLeft seenDrawers = do\n          try <- state $ randomR (1, numPrisoners)\n          case try of\n            x | x == prisoner        -> return True\n              | x `elem` seenDrawers -> go triesLeft seenDrawers\n              | otherwise            -> go (triesLeft - 1) (x:seenDrawers)\n\nrunOptimally :: State StdGen Double\nrunOptimally =\n  let runResults = replicateM numRuns $ do\n         drawers <- state $ shuffle [1..numPrisoners]\n         return $ all (\\prisoner -> openDrawersOptimally drawers prisoner numDrawerTries) [1..numPrisoners]\n   in  ((/ fromIntegral numRuns) . fromIntegral . sum . map fromEnum) `liftM` runResults\n\nopenDrawersOptimally :: Drawers -> Prisoner -> Int -> Bool\nopenDrawersOptimally drawers prisoner triesLeft = go triesLeft prisoner\n  where go 0 _ = False\n        go triesLeft drawerToTry =\n          let thisDrawer = drawers !! (drawerToTry - 1)\n           in if thisDrawer == prisoner then True else go (triesLeft - 1) thisDrawer\n\n\n-- Haskel stdlib is lacking big time, so here some necessary 'library' functions\n\n-- make a list of 'len' random values in range 'range' from 'gen'\nrandomLR :: Integral a => Random b => a -> (b, b) -> StdGen -> ([b], StdGen)\nrandomLR 0 range gen = ([], gen)\nrandomLR len range gen =\n  let (x, newGen) = randomR range gen\n      (xs, lastGen) = randomLR (len - 1) range newGen\n  in (x : xs, lastGen)\n\n\n-- shuffle a list by a generator\nshuffle :: [a] -> StdGen -> ([a], StdGen)\nshuffle list gen = (shuffleByNumbers numbers list, finalGen)\n  where\n    n = length list\n    (numbers, finalGen) = randomLR n (0, n-1) gen\n    shuffleByNumbers :: [Int] -> [a] -> [a]\n    shuffleByNumbers [] _ = []\n    shuffleByNumbers _ [] = []\n    shuffleByNumbers (i:is) xs = let (start, x:rest) = splitAt (i `mod` length xs) xs\n                                 in x : shuffleByNumbers is (start ++ rest)\n\n-- short-circuit monadic all\nallM :: Monad m => (a -> m Bool) -> [a] -> m Bool\nallM func [] = return True\nallM func (x:xs) = func x >>= \\res -> if res then allM func xs else return False\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_76.txt",
        "content": "Chance of winning when choosing randomly: 0.0\nChance of winning when choosing optimally: 0.3188",
        "safe": true
    },
    {
        "filename": "100 prisoners_77.txt",
        "content": "NB. game is solvable by optimal strategy when the length (#) of the\nNB. longest (>./) cycle (C.) is at most 50.\nopt=: 50 >: [: >./ [: > [: #&.> C.\n\nNB. for each prisoner randomly open 50 boxes ((50?100){y) and see if \nNB. the right card is there (p&e.). if not return 0.\nrand=: monad define\nfor_p. i.100 do. if. -.p e.(50?100){y do. 0 return. end.\nend. 1\n)\n\nNB. use both strategies on the same shuffles y times.\nsimulate=: monad define\n'o r'=. y %~ 100 * +/ ((rand,opt)@?~)\"0 y # 100\n('strategy';'win rate'),('random';(\":o),'%'),:'optimal';(\":r),'%'\n)\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_78.txt",
        "content": "   simulate 10000000\n\u250c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2510\n\u2502strategy\u2502win rate\u2502\n\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\u2502random  \u25020%      \u2502\n\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\u2502optimal \u250231.1816%\u2502\n\u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2518\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_79.txt",
        "content": "(math/seedrandom (os/cryptorand 8))\n\n(defn drawers\n  \"create list and shuffle it\"\n  [prisoners]\n  (var x (seq [i :range [0 prisoners]] i))\n  (loop [i :down [(- prisoners 1) 0]]\n    (var j (math/floor (* (math/random) (+ i 1))))\n    (var k (get x i))\n    (put x i (get x j))\n    (put x j k))\n  x)\n\n(defn optimal-play\n  \"optimal decision path\"\n  [prisoners drawers]\n  (var result 0)\n  (loop [i :range [0 prisoners]]\n    (var choice i)\n    (loop [j :range [0 50] :until (= (get drawers choice) i)]\n      (set choice (get drawers choice)))\n    (cond\n      (= (get drawers choice) i) (++ result)\n      (break)))\n  result)\n\n(defn random-play\n  \"random decision path\"\n  [prisoners d]\n  (var result 0)\n  (var options (drawers prisoners))\n  (loop [i :range [0 prisoners]]\n    (var choice 0)\n    (loop [j :range [0 (/ prisoners 2)] :until (= (get d j) (get options i))]\n      (set choice j))\n    (cond\n      (= (get d choice) (get options i)) (++ result)\n      (break)))\n  result)\n\n(defn main [& args]\n  (def prisoners 100)\n  (var optimal-success 0)\n  (var random-success 0)\n  (var sims 10000)\n  (for i 0 sims\n    (var d (drawers prisoners))\n    (if (= (optimal-play prisoners d) prisoners)\n      (++ optimal-success))\n    (if (= (random-play prisoners d) prisoners)\n      (++ random-success)))\n  (printf \"Simulation count:  %d\" sims)\n  (printf \"Optimal play wins:\u00a0%.1f%%\" (* (/ optimal-success sims) 100))\n  (printf \"Random play wins: \u00a0%.1f%%\" (* (/ random-success sims) 100)))",
        "safe": true
    },
    {
        "filename": "100 prisoners_8.txt",
        "content": "pragma Ada_2012;\nwith Ada.Numerics.Discrete_Random;\nwith Ada.Text_IO; use Ada.Text_IO;\n\npackage body Prisoners is\n\n   subtype Drawer_Range is Positive range 1 .. 100;\n   package Random_Drawer is new Ada.Numerics.Discrete_Random (Drawer_Range);\n   use Random_Drawer;\n   \n   -- Helper procedures to initialise and shuffle the drawers\n   \n   procedure Swap (A, B : Positive; Cupboard : in out Drawers) is\n      Temp : Positive;\n   begin\n      Temp         := Cupboard (B);\n      Cupboard (B) := Cupboard (A);\n      Cupboard (A) := Temp;\n   end Swap;\n\n   procedure Shuffle (Cupboard : in out Drawers) is\n      G : Generator;\n   begin\n      Reset (G);\n      for I in Cupboard'Range loop\n         Swap (I, Random (G), Cupboard);\n      end loop;\n   end Shuffle;\n\n   procedure Initialise_Drawers (Cupboard : in out Drawers) is\n   begin\n      for I in Cupboard'Range loop\n         Cupboard (I) := I;\n      end loop;\n      Shuffle (Cupboard);\n   end Initialise_Drawers;\n   \n   -- The two strategies for playing the game\n\n   function Optimal_Strategy\n     (Cupboard : in Drawers; Max_Prisoners : Integer; Max_Attempts : Integer;\n      Prisoner_Number :    Integer) return Boolean\n   is\n      Current_Card : Positive;\n   begin\n      Current_Card := Cupboard (Prisoner_Number);\n      if Current_Card = Prisoner_Number then\n         return True;\n      else\n         for I in Integer range 1 .. Max_Attempts loop\n            Current_Card := Cupboard (Current_Card);\n            if Current_Card = Prisoner_Number then\n               return True;\n            end if;\n         end loop;\n      end if;\n      return False;\n   end Optimal_Strategy;\n\n   function Random_Strategy\n     (Cupboard : in Drawers; Max_Prisoners : Integer; Max_Attempts : Integer;\n      Prisoner_Number :    Integer) return Boolean\n   is\n      Current_Card : Positive;\n      G            : Generator;\n   begin\n      Reset (G);\n      Current_Card := Cupboard (Prisoner_Number);\n      if Current_Card = Prisoner_Number then\n         return True;\n      else\n         for I in Integer range 1 .. Max_Attempts loop\n            Current_Card := Cupboard (Random (G));\n            if Current_Card = Prisoner_Number then\n               return True;\n            end if;\n         end loop;\n      end if;\n      return False;\n   end Random_Strategy;\n\n   function Prisoners_Attempts\n     (Cupboard : in Drawers; Max_Prisoners : Integer; Max_Attempts : Integer;\n      Strategy :    not null access function\n        (Cupboard     : in Drawers; Max_Prisoners : Integer;\n         Max_Attempts :    Integer; Prisoner_Number : Integer) return Boolean)\n      return Boolean\n   is\n   begin\n      for Prisoner_Number in Integer range 1 .. Max_Prisoners loop\n         if not Strategy\n             (Cupboard, Max_Prisoners, Max_Attempts, Prisoner_Number)\n         then\n            return False;\n         end if;\n      end loop;\n      return True;\n   end Prisoners_Attempts;\n   \n   -- The function to play the game itself\n\n   function Play_Game\n     (Repetitions : in Positive;\n      Strategy    :    not null access function\n        (Cupboard     : in Drawers; Max_Prisoners : Integer;\n         Max_Attempts :    Integer; Prisoner_Number : Integer) return Boolean)\n      return Win_Percentage\n   is\n      Cupboard            : Drawers;\n      Win, Game_Count     : Natural          := 0;\n      Number_Of_Prisoners : constant Integer := 100;\n      Max_Attempts        : constant Integer := 50;\n   begin\n      loop\n         Initialise_Drawers (Cupboard);\n         if Prisoners_Attempts\n             (Cupboard     => Cupboard, Max_Prisoners => Number_Of_Prisoners,\n              Max_Attempts => Max_Attempts, Strategy => Strategy)\n         then\n            Win := Win + 1;\n         end if;\n         Game_Count := Game_Count + 1;\n         exit when Game_Count = Repetitions;\n      end loop;\n      return Win_Percentage ((Float (Win) / Float (Repetitions)) * 100.0);\n   end Play_Game;\n\nend Prisoners;\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_80.txt",
        "content": "Simulation count:  10000\nOptimal play wins: 33.1%\nRandom play wins:  0.0%\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_81.txt",
        "content": "import java.util.Collections;\nimport java.util.List;\nimport java.util.Objects;\nimport java.util.function.Function;\nimport java.util.function.Supplier;\nimport java.util.stream.Collectors;\nimport java.util.stream.IntStream;\n\npublic class Main {\n    private static boolean playOptimal(int n) {\n        List<Integer> secretList = IntStream.range(0, n).boxed().collect(Collectors.toList());\n        Collections.shuffle(secretList);\n\n        prisoner:\n        for (int i = 0; i < secretList.size(); ++i) {\n            int prev = i;\n            for (int j = 0; j < secretList.size() / 2; ++j) {\n                if (secretList.get(prev) == i) {\n                    continue prisoner;\n                }\n                prev = secretList.get(prev);\n            }\n            return false;\n        }\n        return true;\n    }\n\n    private static boolean playRandom(int n) {\n        List<Integer> secretList = IntStream.range(0, n).boxed().collect(Collectors.toList());\n        Collections.shuffle(secretList);\n\n        prisoner:\n        for (Integer i : secretList) {\n            List<Integer> trialList = IntStream.range(0, n).boxed().collect(Collectors.toList());\n            Collections.shuffle(trialList);\n\n            for (int j = 0; j < trialList.size() / 2; ++j) {\n                if (Objects.equals(trialList.get(j), i)) {\n                    continue prisoner;\n                }\n            }\n\n            return false;\n        }\n        return true;\n    }\n\n    private static double exec(int n, int p, Function<Integer, Boolean> play) {\n        int succ = 0;\n        for (int i = 0; i < n; ++i) {\n            if (play.apply(p)) {\n                succ++;\n            }\n        }\n        return (succ * 100.0) / n;\n    }\n\n    public static void main(String[] args) {\n        final int n = 100_000;\n        final int p = 100;\n        System.out.printf(\"# of executions: %d\\n\", n);\n        System.out.printf(\"Optimal play success rate: %f%%\\n\", exec(n, p, Main::playOptimal));\n        System.out.printf(\"Random play success rate: %f%%\\n\", exec(n, p, Main::playRandom));\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_82.txt",
        "content": "# of executions: 100000\nOptimal play success rate: 31.343000%\nRandom play success rate: 0.000000%",
        "safe": true
    },
    {
        "filename": "100 prisoners_83.txt",
        "content": "const _ = require('lodash');\n\nconst numPlays = 100000;\n\nconst setupSecrets = () => {\n\t// setup the drawers with random cards\n\tlet secrets = [];\n\n\tfor (let i = 0; i < 100; i++) {\n\t\tsecrets.push(i);\n\t}\n\n\treturn _.shuffle(secrets);\n}\n\nconst playOptimal = () => {\n\t\n\tlet secrets = setupSecrets();\n\t\n\n\t// Iterate once per prisoner\n\tloop1:\n\tfor (let p = 0; p < 100; p++) {\n\t\t\n\t\t// whether the prisoner succeedss\n\t\tlet success = false;\n\t\t\n\t\t// the drawer number the prisoner chose\n\t\tlet choice = p;\n\t\t\n\t\t\n\t\t// The prisoner can choose up to 50 cards\n\t\tloop2:\n\t\tfor (let i = 0; i < 50; i++) {\n\t\t\t\n\t\t\t// if the card in the drawer that the prisoner chose is his card\n\t\t\tif (secrets[choice] === p){\n\t\t\t\tsuccess = true;\n\t\t\t\tbreak loop2;\n\t\t\t}\n\n\t\t\t// the next drawer the prisoner chooses will be the number of the card he has.\n\t\t\tchoice = secrets[choice];\n\t\t\n\t\t}\t// each prisoner gets 50 chances\n\n\t\t\n\t\tif (!success) return false;\n\n\t} // iterate for each prisoner \n\n\treturn true;\n}\n\nconst playRandom = () => {\n\n\tlet secrets = setupSecrets();\n\n\t// iterate for each prisoner \n\tfor (let p = 0; p < 100; p++) {\n\n\t\tlet choices = setupSecrets();\n\t\t\n\t\tlet success = false;\n\t\t\n\t\tfor (let i = 0; i < 50; i++) {\n\n\t\t\tif (choices[i] === p) {\n\t\t\t\tsuccess = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (!success) return false;\n\t}\n\n\treturn true;\n}\n\nconst execOptimal = () => {\n\n\tlet success = 0;\n\t\n\tfor (let i = 0; i < numPlays; i++) {\n\n\t\tif (playOptimal()) success++;\n\t\t\t\n\t}\n\n\treturn 100.0 * success / 100000;\n}\n\nconst execRandom = () => {\n\n\tlet success = 0;\n\n\tfor (let i = 0; i < numPlays; i++) {\n\n\t\tif (playRandom()) success++;\n\n\t}\n\n\treturn 100.0 * success / 100000;\n}\n\nconsole.log(\"# of executions: \" + numPlays);\nconsole.log(\"Optimal Play Success Rate: \" + execOptimal());\nconsole.log(\"Random Play Success Rate: \" + execRandom());\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_84.txt",
        "content": "\"use strict\";\n\n// Simulate several thousand instances of the game:\nconst gamesCount = 2000;\n\n// ...where the prisoners randomly open drawers.\nconst randomResults = playGame(gamesCount, randomStrategy);\n\n// ...where the prisoners use the optimal strategy mentioned in the Wikipedia article.\nconst optimalResults = playGame(gamesCount, optimalStrategy);\n\n// Show and compare the computed probabilities of success for the two strategies.\nconsole.log(`Games count: ${gamesCount}`);\nconsole.log(`Probability of success with \"random\" strategy: ${computeProbability(randomResults, gamesCount)}`);\nconsole.log(`Probability of success with \"optimal\" strategy: ${computeProbability(optimalResults, gamesCount)}`);\n\nfunction playGame(gamesCount, strategy, prisonersCount = 100) {\n    const results = new Array();\n\n    for (let game = 1; game <= gamesCount; game++) {\n        // A room having a cupboard of 100 opaque drawers numbered 1 to 100, that cannot be seen from outside.\n        // Cards numbered 1 to 100 are placed randomly, one to a drawer, and the drawers all closed; at the start.\n        const drawers = initDrawers(prisonersCount);\n\n        // A prisoner tries to find his own number.\n        // Prisoners start outside the room.\n        // They can decide some strategy before any enter the room.\n        let found = 0;\n        for (let prisoner = 1; prisoner <= prisonersCount; prisoner++, found++)\n            if (!find(prisoner, drawers, strategy)) break;\n\n        // If all 100 findings find their own numbers then they will all be pardoned. If any don't then all sentences stand.\n        results.push(found == prisonersCount);\n    }\n\n    return results;\n}\n\nfunction find(prisoner, drawers, strategy) {\n    // A prisoner can open no more than 50 drawers.\n    const openMax = Math.floor(drawers.length / 2);\n\n    // Prisoners start outside the room.\n    let card;\n    for (let open = 0; open < openMax; open++) {\n        // A prisoner tries to find his own number.\n        card = strategy(prisoner, drawers, card);\n\n        // A prisoner finding his own number is then held apart from the others.\n        if (card == prisoner)\n            break;\n    }\n\n    return (card == prisoner);\n}\n\nfunction randomStrategy(prisoner, drawers, card) {\n    // Simulate the game where the prisoners randomly open drawers.\n\n    const min = 0;\n    const max = drawers.length - 1;\n\n    return drawers[draw(min, max)];\n}\n\nfunction optimalStrategy(prisoner, drawers, card) {\n    // Simulate the game where the prisoners use the optimal strategy mentioned in the Wikipedia article.\n\n    // First opening the drawer whose outside number is his prisoner number.\n    // If the card within has his number then he succeeds...\n    if (typeof card === \"undefined\")\n        return drawers[prisoner - 1];\n   \n    // ...otherwise he opens the drawer with the same number as that of the revealed card.\n    return drawers[card - 1];\n}\n\nfunction initDrawers(prisonersCount) {\n    const drawers = new Array();\n    for (let card = 1; card <= prisonersCount; card++)\n        drawers.push(card);\n\n    return shuffle(drawers);\n}\n\nfunction shuffle(drawers) {\n    const min = 0;\n    const max = drawers.length - 1;\n    for (let i = min, j; i < max; i++)     {\n        j = draw(min, max);\n        if (i != j)\n            [drawers[i], drawers[j]] = [drawers[j], drawers[i]];\n    }\n\n    return drawers;\n}\n\nfunction draw(min, max) {\n    // See: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Math/random\n    return Math.floor(Math.random() * (max - min + 1)) + min;\n}\n\nfunction computeProbability(results, gamesCount) {\n    return Math.round(results.filter(x => x == true).length * 10000 / gamesCount) / 100;\n}\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_85.txt",
        "content": "Games count: 2000\nProbability of success with \"random\" strategy: 0\nProbability of success with \"optimal\" strategy: 33.2",
        "safe": true
    },
    {
        "filename": "100 prisoners_86.txt",
        "content": "export LC_ALL=C\n< /dev/urandom tr -cd '0-9' | fold -w 1 | jq -MRcnr -f 100-prisoners.jq\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_87.txt",
        "content": "def count(s): reduce s as $x (0; .+1);\n\n# Output: a PRN in range(0;$n) where $n is .\ndef prn:\n  if . == 1 then 0\n  else . as $n\n  | (($n-1)|tostring|length) as $w\n  | [limit($w; inputs)] | join(\"\") | tonumber\n  | if . < $n then . else ($n | prn) end\n  end;\n\ndef knuthShuffle:\n  length as $n\n  | if $n <= 1 then .\n    else {i: $n, a: .}\n    | until(.i ==  0;\n        .i += -1\n        | (.i + 1 | prn) as $j\n        | .a[.i] as $t\n        | .a[.i] = .a[$j]\n        | .a[$j] = $t)\n    | .a \n    end;",
        "safe": true
    },
    {
        "filename": "100 prisoners_88.txt",
        "content": "# Output: if all the prisoners succeed, emit true, otherwise false\ndef optimalStrategy($drawers; np):\n  # Does prisoner $p succeed?\n  def succeeds($p):\n    first( foreach range(0; np/2) as $d ({prev: $p};\n             .curr = ($drawers[.prev])\n             | if .curr == $p\n               then .success = true\n               else .prev = .curr\n               end;\n             select(.success))) // false;\n  \n  all( range(0; np); succeeds(.) );\n  \n# Output: if all the prisoners succeed, emit true, otherwise false\ndef randomStrategy($drawers; np):\n  (np/2) as $maxd\n  # Does prisoner $p succeed?\n  | def succeeds($p):\n      {success: false }\n      | first(.d = 0\n              | .opened = []\n              | until( (.d >= $maxd) or .success;\n                  (np|prn) as $n\n                  | if .opened[$n] then .\n                    else .opened[$n] = true\n                    | .d += 1\n                    | .success = $drawers[$n] == $p\n                    end )\n              | select(.success) ) // false;\n\n  all( range(0; np); succeeds(.) );\n\n\ndef run(strategy; trials; np):\n  count(range(0; trials)\n    | ([range(0;np)] | knuthShuffle) as $drawers\n    | select (if strategy == \"optimal\"\n              then optimalStrategy($drawers; np)\n              else randomStrategy($drawers; np)\n              end ) );\n\ndef task($trials):\n  def percent: \"\\(10000 * . | round / 100)%\";\n  def summary(strategy):\n    \"With \\(strategy) strategy: pardoned = \\(.), relative frequency = \\(./$trials | percent)\";\n\n  (10, 100) as $np\n  | \"Results from \\($trials) trials with \\($np) prisoners:\",\n    (run(\"random\";  $trials; $np) | summary(\"random\")),\n    (run(\"optimal\"; $trials; $np) | summary(\"optimal\")),\n    \"\"\n;\n\ntask(100000)",
        "safe": true
    },
    {
        "filename": "100 prisoners_89.txt",
        "content": "Results from 100000 trials with 10 prisoners:\nWith random strategy: pardoned = 92, relative frequency = 0.09%\nWith optimal strategy: pardoned = 31212, relative frequency = 31.21%\n\nResults from 100000 trials with 100 prisoners:\nWith random strategy: pardoned = 0, relative frequency = 0%\nWith optimal strategy: pardoned = 31026, relative frequency = 31.03%\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_9.txt",
        "content": "with Prisoners;   use Prisoners;\nwith Ada.Text_IO; use Ada.Text_IO;\n\nprocedure Main is\n   Wins : Win_Percentage;\n   package Win_Percentage_IO is new Float_IO (Win_Percentage);\nbegin\n   Wins := Play_Game (100_000, Optimal_Strategy'Access);\n   Put (\"Optimal Strategy = \");\n   Win_Percentage_IO.Put (Wins, 2, 2, 0);\n   Put (\"%\");\n   New_Line;\n   Wins := Play_Game (100_000, Random_Strategy'Access);\n   Put (\"Random Strategy = \");\n   Win_Percentage_IO.Put (Wins, 2, 2, 0);\n   Put (\"%\");\nend Main;\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_90.txt",
        "content": "using Random, Formatting\n\nfunction randomplay(n, numprisoners=100)\n    pardoned, indrawer, found = 0, collect(1:numprisoners), false\n    for i in 1:n\n        shuffle!(indrawer)\n        for prisoner in 1:numprisoners\n            found = false\n            for reveal in randperm(numprisoners)[1:div(numprisoners, 2)]\n                indrawer[reveal] == prisoner && (found = true) && break\n            end\n            !found && break\n        end\n        found && (pardoned += 1)\n    end\n    return 100.0 * pardoned / n\nend\n\nfunction optimalplay(n, numprisoners=100)\n    pardoned, indrawer, found = 0, collect(1:numprisoners), false\n    for i in 1:n\n        shuffle!(indrawer)\n        for prisoner in 1:numprisoners\n            reveal = prisoner\n            found = false\n            for j in 1:div(numprisoners, 2)\n                card = indrawer[reveal]\n                card == prisoner && (found = true) && break\n                reveal = card\n            end\n            !found && break\n        end\n        found && (pardoned += 1)\n    end\n    return 100.0 * pardoned / n\n end\n\nconst N = 100_000\nprintln(\"Simulation count: $N\")\nprintln(\"Random play wins: \", format(randomplay(N), precision=8), \"% of simulations.\")\nprintln(\"Optimal play wins: \", format(optimalplay(N), precision=8), \"% of simulations.\")\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_91.txt",
        "content": "Simulation count: 100000\nRandom play wins: 0.00000000% of simulations.\nOptimal play wins: 31.18100000% of simulations.\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_92.txt",
        "content": "import std/num/random\n\nvalue struct drawer\n  num: int\n  open: bool = False\n\ninline extern unsafe-assign : forall<a> ( v : vector<a>, i : ssize_t, x : a ) -> total ()\n  c \"kk_vector_unsafe_assign\"\n\nfun createDrawers()\n  val drawers = vector(100, Drawer(0,open=True))\n  for(0, 99) fn(i)\n    var found := False\n    while {!found}\n      val r = random-int() % 100\n      if drawers[r].open then\n        drawers.unsafe-assign(r.ssize_t, Drawer(i))\n        found := True\n      else\n        ()\n  drawers\n\nfun closeAll(d:vector<drawer>)\n  for(0,99) fn(i)\n    d.unsafe-assign(i.ssize_t, d[i](open=False))\n\neffect fail\n  final ctl failed(): a \n\nfun open-random(drawers: vector<drawer>)\n  val r = random-int() % 100\n  val opened = drawers[r]\n  if opened.open then\n    open-random(drawers)\n  else\n    drawers.unsafe-assign(r.ssize_t, opened(open=True))\n    opened.num\n\nfun random-approach(drawers: vector<drawer>)\n  for(0, 99) fn(i)\n    var found := False\n    for(0, 49) fn(j)\n      val opened = open-random(drawers)\n      if opened == i then\n        found := True\n      else\n        ()\n    if !found then\n      failed()\n    else\n      drawers.closeAll()\n\nfun optimal-approach(drawers: vector<drawer>)\n  for(0, 99) fn(i)\n    var found := False\n    var drawer := i;\n    for(0, 49) fn(j)\n      val opened = drawers[drawer]\n      if opened.open then\n        failed()\n      if opened.num == i then\n        found := True\n      else\n        drawers.unsafe-assign(drawer.ssize_t, opened(open=True))\n        drawer := opened.num\n    if !found then\n      failed()\n    else\n      drawers.closeAll()\n      ()\n\nfun run-trials(f, num-trials)\n  var num_success := 0\n  for(0,num-trials - 1) fn(i)\n    val drawers = createDrawers()\n    with handler\n      return(x) -> \n        num_success := num_success + 1\n      final ctl failed() -> \n        ()\n    f(drawers)\n  num_success\n\nfun main()\n  val num_trials = 1000\n  val num_success_random = run-trials(random-approach, num_trials)\n  val num_success_optimal = run-trials(optimal-approach, num_trials)\n  println(\"Number of trials: \" ++ num_trials.show)\n  println(\"Random approach: wins \" ++ num_success_random.show ++ \" (\" ++ (num_success_random.float64 * 100.0 / num_trials.float64).show(2) ++ \"%)\")\n  println(\"Optimal approach: wins \" ++ num_success_optimal.show ++ \" (\" ++ (num_success_optimal.float64 * 100.0 / num_trials.float64).show(2) ++ \"%)\")\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_93.txt",
        "content": "Number of trials: 1000\nRandom approach: wins 0 (0.00%)\nOptimal approach: wins 319 (31.90%)\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_94.txt",
        "content": "val playOptimal: () -> Boolean = {\n    val secrets = (0..99).toMutableList()\n    var ret = true\n    secrets.shuffle()\n    prisoner@ for(i in 0 until 100){\n        var prev = i\n        draw@ for(j in 0 until  50){\n            if (secrets[prev] == i) continue@prisoner\n            prev = secrets[prev]\n        }\n        ret = false\n        break@prisoner\n    }\n    ret\n}\n\nval playRandom: ()->Boolean = {\n    var ret = true\n    val secrets = (0..99).toMutableList()\n    secrets.shuffle()\n    prisoner@ for(i in 0 until 100){\n        val opened = mutableListOf<Int>()\n        val genNum : () ->Int = {\n            var r = (0..99).random()\n            while (opened.contains(r)) {\n                r = (0..99).random()\n            }\n            r\n        }\n        for(j in 0 until 50){\n            val draw = genNum()\n            if ( secrets[draw] == i) continue@prisoner\n            opened.add(draw)\n        }\n        ret = false\n        break@prisoner\n    }\n    ret\n}\n\nfun exec(n:Int, play:()->Boolean):Double{\n    var succ = 0\n    for (i in IntRange(0, n-1)){\n        succ += if(play()) 1 else 0\n    }\n    return (succ*100.0)/n\n}\n\nfun main() {\n    val N = 100_000\n    println(\"# of executions: $N\")\n    println(\"Optimal play success rate: ${exec(N, playOptimal)}%\")\n    println(\"Random play success rate: ${exec(N, playRandom)}%\")\n}\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_95.txt",
        "content": "# of executions: 100000\nOptimal play success rate: 31.451%\nRandom play success rate: 0.0%\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_96.txt",
        "content": "function shuffle(tbl)\n  for i = #tbl, 2, -1 do\n    local j = math.random(i)\n    tbl[i], tbl[j] = tbl[j], tbl[i]\n  end\n  return tbl\nend\n\nfunction playOptimal()\n    local secrets = {}\n    for i=1,100 do\n        secrets[i] = i\n    end\n    shuffle(secrets)\n\n    for p=1,100 do\n        local success = false\n\n        local choice = p\n        for i=1,50 do\n            if secrets[choice] == p then\n                success = true\n                break\n            end\n            choice = secrets[choice]\n        end\n\n        if not success then\n            return false\n        end\n    end\n\n    return true\nend\n\nfunction playRandom()\n    local secrets = {}\n    for i=1,100 do\n        secrets[i] = i\n    end\n    shuffle(secrets)\n\n    for p=1,100 do\n        local choices = {}\n        for i=1,100 do\n            choices[i] = i\n        end\n        shuffle(choices)\n\n        local success = false\n        for i=1,50 do\n            if choices[i] == p then\n                success = true\n                break\n            end\n        end\n\n        if not success then\n            return false\n        end\n    end\n\n    return true\nend\n\nfunction exec(n,play)\n    local success = 0\n    for i=1,n do\n        if play() then\n            success = success + 1\n        end\n    end\n    return 100.0 * success / n\nend\n\nfunction main()\n    local N = 1000000\n    print(\"# of executions: \"..N)\n    print(string.format(\"Optimal play success rate: %f\", exec(N, playOptimal)))\n    print(string.format(\"Random play success rate: %f\", exec(N, playRandom)))\nend\n\nmain()\n",
        "safe": true
    },
    {
        "filename": "100 prisoners_97.txt",
        "content": "# of executions: 1000000\nOptimal play success rate: 31.237500\nRandom play success rate: 0.000000",
        "safe": true
    },
    {
        "filename": "100 prisoners_98.txt",
        "content": "p:=simplify(1-product(1-1/(2*n-k),k=0..n-1));\n# p=1/2",
        "safe": true
    },
    {
        "filename": "100 prisoners_99.txt",
        "content": "p^100;\nevalf(%);\n\n# 1/1267650600228229401496703205376\n# 7.888609052e-31",
        "safe": true
    },
    {
        "filename": "100_doors_1.txt",
        "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))",
        "safe": true
    },
    {
        "filename": "100_doors_10.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_100.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_101.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_102.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_103.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_104.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_105.txt",
        "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$)",
        "safe": true
    },
    {
        "filename": "100_doors_106.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100_doors_107.txt",
        "content": ">\"d\">:00p1-:>:::9%\\9/9+g2%!\\:9v\n$.v_^#!$::$_^#`\"c\":+g00p+9/9\\%<\n::<_@#`$:\\*:+55:+1p27g1g+9/9\\%9\n",
        "safe": true
    },
    {
        "filename": "100_doors_108.txt",
        "content": "1+:::*.9`#@_\n",
        "safe": true
    },
    {
        "filename": "100_doors_109.txt",
        "content": "108p0>:18p;;>:9g!18g9p08g]\n*`!0\\|+relet|-1`*aap81::+]\n;::+1<r]!g9;>$08g1+:08paa[\n*`#@_^._aa\n",
        "safe": true
    },
    {
        "filename": "100_doors_11.txt",
        "content": "1001000010000001000000001000000000010000000000001000000000000001000000000000000010000000000000000001",
        "safe": true
    },
    {
        "filename": "100_doors_110.txt",
        "content": "0001000100010101000110100000010110000011001110110010100011010000000000101111111000000101111101011001011001000110100001111100110100101111101111000000001011111111110110011001111111011100000000101111110000001011111010110011011100101011000000101111011001011110011110011110110100000000001011011100111011110000000001000000111001110100000000101101110110",
        "safe": true
    },
    {
        "filename": "100_doors_111.txt",
        "content": "1001000010000001000000001000000000010000000000001000000000000001000000000000000010000000000000000001",
        "safe": true
    },
    {
        "filename": "100_doors_112.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_113.txt",
        "content": "for i in 1..101 {\n  echo 'Door ${i} is ${i ** 0.5\u00a0% 1 > 0\u00a0? \"closed\"\u00a0: \"open\"}'\n}",
        "safe": true
    },
    {
        "filename": "100_doors_114.txt",
        "content": "for i in 1..11 echo 'Door ${i**2} is open'",
        "safe": true
    },
    {
        "filename": "100_doors_115.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_116.txt",
        "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];",
        "safe": true
    },
    {
        "filename": "100_doors_117.txt",
        "content": " > 1   \n > 4   \n > 9   \n > 16   \n > 25   \n > 36   \n > 49   \n > 64   \n > 81   \n > 100   \n",
        "safe": true
    },
    {
        "filename": "100_doors_118.txt",
        "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)",
        "safe": true
    },
    {
        "filename": "100_doors_119.txt",
        "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)",
        "safe": true
    },
    {
        "filename": "100_doors_12.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_120.txt",
        "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)",
        "safe": true
    },
    {
        "filename": "100_doors_121.txt",
        "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)",
        "safe": true
    },
    {
        "filename": "100_doors_122.txt",
        "content": "100doors-tbl$\n& 100doors-var$\n& 100doors-list$\n& 100doors-obj$;",
        "safe": true
    },
    {
        "filename": "100_doors_123.txt",
        "content": "blsq ) 10ro2?^\n{1 4 9 16 25 36 49 64 81 100}",
        "safe": true
    },
    {
        "filename": "100_doors_124.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_125.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_126.txt",
        "content": "swch\n",
        "safe": true
    },
    {
        "filename": "100_doors_127.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_128.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_129.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_13.txt",
        "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\"",
        "safe": true
    },
    {
        "filename": "100_doors_130.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_131.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_132.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_133.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_134.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_135.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_136.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_137.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_138.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_139.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_14.txt",
        "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\"",
        "safe": true
    },
    {
        "filename": "100_doors_140.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_141.txt",
        "content": "100_doors\n",
        "safe": true
    },
    {
        "filename": "100_doors_142.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_143.txt",
        "content": "1: open\n4: open\n9: open\n16: open\n25: open\n36: open\n49: open\n64: open\n81: open\n100: open\n",
        "safe": true
    },
    {
        "filename": "100_doors_144.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_145.txt",
        "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 }",
        "safe": true
    },
    {
        "filename": "100_doors_146.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_147.txt",
        "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 @",
        "safe": true
    },
    {
        "filename": "100_doors_148.txt",
        "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 @",
        "safe": true
    },
    {
        "filename": "100_doors_149.txt",
        "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)",
        "safe": true
    },
    {
        "filename": "100_doors_15.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_150.txt",
        "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)",
        "safe": true
    },
    {
        "filename": "100_doors_151.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_152.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_153.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_154.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_155.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_156.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_157.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100_doors_158.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_159.txt",
        "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'",
        "safe": true
    },
    {
        "filename": "100_doors_16.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_160.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_161.txt",
        "content": "isInteger = (i) -> Math.floor(i) == i\n\nconsole.log door for door in [1..100] when isInteger Math.sqrt door\n",
        "safe": true
    },
    {
        "filename": "100_doors_162.txt",
        "content": "console.log Math.pow(i,2) for i in [1..10]\n",
        "safe": true
    },
    {
        "filename": "100_doors_163.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_164.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_165.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_166.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_167.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_168.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100_doors_169.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_17.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_170.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_171.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_172.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_173.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_174.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_175.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_176.txt",
        "content": "(let  ((i 0))\n    (mapcar (lambda (x)\n                (if (zerop (mod (sqrt (incf i)) 1))\n                    \"_\" \"#\"))\n            (make-list 100)))\n",
        "safe": true
    },
    {
        "filename": "100_doors_177.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_178.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_179.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_18.txt",
        "content": "DO 10 TIMES.\n  DATA(val) = sy-index * sy-index.\n  WRITE: / val.\nENDDO.\n",
        "safe": true
    },
    {
        "filename": "100_doors_180.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_181.txt",
        "content": "Goal prison 100 = prisoo 100. compute. reflexivity. Qed.",
        "safe": true
    },
    {
        "filename": "100_doors_182.txt",
        "content": "Goal forall n, prison n = prisoo n. Abort.",
        "safe": true
    },
    {
        "filename": "100_doors_183.txt",
        "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;",
        "safe": true
    },
    {
        "filename": "100_doors_184.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_185.txt",
        "content": "do\n\n\tlet i = i + 1\n\tprint i * i, \" \",\n\nloop i * i < 100",
        "safe": true
    },
    {
        "filename": "100_doors_186.txt",
        "content": "1 4 9 16 25 36 49 64 81 100 ",
        "safe": true
    },
    {
        "filename": "100_doors_187.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_188.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_189.txt",
        "content": "1 4 9 16 25 36 49 64 81 100 ",
        "safe": true
    },
    {
        "filename": "100_doors_19.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_190.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_191.txt",
        "content": "1 4 9 16 25 36 49 64 81 100 ",
        "safe": true
    },
    {
        "filename": "100_doors_192.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_193.txt",
        "content": "[1, 4, 9, 16, 25, 36, 49, 64, 81, 100]\n[1, 4, 9, 16, 25, 36, 49, 64, 81, 100]",
        "safe": true
    },
    {
        "filename": "100_doors_194.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_195.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_196.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_197.txt",
        "content": "main() {\n  for(int i=1,s=3;i<=100;i+=s,s+=2)\n    print(\"door $i is open\");\n}",
        "safe": true
    },
    {
        "filename": "100_doors_198.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_199.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_2.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_20.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_200.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_201.txt",
        "content": " 1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100_doors_202.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_203.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_204.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100_doors_205.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_206.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_207.txt",
        "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');",
        "safe": true
    },
    {
        "filename": "100_doors_208.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_209.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_21.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_210.txt",
        "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;",
        "safe": true
    },
    {
        "filename": "100_doors_211.txt",
        "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 \" \" )",
        "safe": true
    },
    {
        "filename": "100_doors_212.txt",
        "content": "Open doors: 1 4 9 16 25 36 49 64 81 100 ",
        "safe": true
    },
    {
        "filename": "100_doors_213.txt",
        "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)",
        "safe": true
    },
    {
        "filename": "100_doors_214.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100_doors_215.txt",
        "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\"",
        "safe": true
    },
    {
        "filename": "100_doors_216.txt",
        "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;",
        "safe": true
    },
    {
        "filename": "100_doors_217.txt",
        "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);",
        "safe": true
    },
    {
        "filename": "100_doors_218.txt",
        "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')));",
        "safe": true
    },
    {
        "filename": "100_doors_219.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_22.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_220.txt",
        "content": "open doors: 1, 4, 9, 16, 25, 36, 49, 64, 81, 100\n",
        "safe": true
    },
    {
        "filename": "100_doors_221.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_222.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_223.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_224.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_225.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_226.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_227.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_228.txt",
        "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..]]",
        "safe": true
    },
    {
        "filename": "100_doors_229.txt",
        "content": "open list\nrun n = takeWhile (<n) [& k*k \\\\ k <- [1..]]",
        "safe": true
    },
    {
        "filename": "100_doors_23.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_230.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_231.txt",
        "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}\"",
        "safe": true
    },
    {
        "filename": "100_doors_232.txt",
        "content": "All doors are closed except these: [1, 4, 9, 16, 25, 36, 49, 64, 81, 100]",
        "safe": true
    },
    {
        "filename": "100_doors_233.txt",
        "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)))",
        "safe": true
    },
    {
        "filename": "100_doors_234.txt",
        "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))",
        "safe": true
    },
    {
        "filename": "100_doors_235.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_236.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_237.txt",
        "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).",
        "safe": true
    },
    {
        "filename": "100_doors_238.txt",
        "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)).",
        "safe": true
    },
    {
        "filename": "100_doors_239.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_24.txt",
        "content": "Following doors are open:\n1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100_doors_240.txt",
        "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)].",
        "safe": true
    },
    {
        "filename": "100_doors_241.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_242.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_243.txt",
        "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 ]",
        "safe": true
    },
    {
        "filename": "100_doors_244.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_245.txt",
        "content": "=IF($A2/C$1=INT($A2/C$1),IF(B2=0,1,IF(B2=1,0)),B2)",
        "safe": true
    },
    {
        "filename": "100_doors_246.txt",
        "content": "=IF($A3/C$1=INT($A3/C$1),IF(B3=0,1,IF(B3=1,0)),B3)",
        "safe": true
    },
    {
        "filename": "100_doors_247.txt",
        "content": "=IF($A2/D$1=INT($A2/D$1),IF(C2=0,1,IF(C2=1,0)),C2)",
        "safe": true
    },
    {
        "filename": "100_doors_248.txt",
        "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 \"\"",
        "safe": true
    },
    {
        "filename": "100_doors_249.txt",
        "content": "1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100_doors_25.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_250.txt",
        "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 |]",
        "safe": true
    },
    {
        "filename": "100_doors_251.txt",
        "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))",
        "safe": true
    },
    {
        "filename": "100_doors_252.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_253.txt",
        "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;",
        "safe": true
    },
    {
        "filename": "100_doors_254.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_255.txt",
        "content": "for door in [ 1\u00a0: 101 ]: > \"Door \", $door, \" is: \", fract( door ** 0.5 )\u00a0? \"closed\"\u00a0: \"open\"",
        "safe": true
    },
    {
        "filename": "100_doors_256.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_257.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_258.txt",
        "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 })",
        "safe": true
    },
    {
        "filename": "100_doors_259.txt",
        "content": "    echo(\"Open doors are \" + (1..100).toList.findAll { it.toFloat.pow(0.5f).toInt.pow(2) == it})",
        "safe": true
    },
    {
        "filename": "100_doors_26.txt",
        "content": "Using #HASH-OFF, OPTION OICC =\"^\" , CICC =\"^\"\n",
        "safe": true
    },
    {
        "filename": "100_doors_260.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_261.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_262.txt",
        "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)",
        "safe": true
    },
    {
        "filename": "100_doors_263.txt",
        "content": "; do algorithm iterations sqrt(100) = 10 times\n(repeat i 10 (setcar (nth (- (* i i) 1) doors) 't))",
        "safe": true
    },
    {
        "filename": "100_doors_264.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_265.txt",
        "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^",
        "safe": true
    },
    {
        "filename": "100_doors_266.txt",
        "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,!",
        "safe": true
    },
    {
        "filename": "100_doors_267.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_268.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_269.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_27.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_270.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_271.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_272.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100_doors_273.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_274.txt",
        "content": "doors that are open nr: 1 4 9 16 25 36 49 64 81 100 \n\nThere are 10 doors open",
        "safe": true
    },
    {
        "filename": "100_doors_275.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_276.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_277.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_278.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_279.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_28.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_280.txt",
        "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 \"]",
        "safe": true
    },
    {
        "filename": "100_doors_281.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_282.txt",
        "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') )",
        "safe": true
    },
    {
        "filename": "100_doors_283.txt",
        "content": "import math.sqrt\n\nfor i <- 1..100\n  println( i + ' ' + (if sqrt(i) is Integer then 'open' else 'closed') )",
        "safe": true
    },
    {
        "filename": "100_doors_284.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_285.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_286.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_287.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_288.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_289.txt",
        "content": "1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100_doors_29.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_290.txt",
        "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 ]",
        "safe": true
    },
    {
        "filename": "100_doors_291.txt",
        "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)",
        "safe": true
    },
    {
        "filename": "100_doors_292.txt",
        "content": "Doors open\u00a0: 1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100_doors_293.txt",
        "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)",
        "safe": true
    },
    {
        "filename": "100_doors_294.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_295.txt",
        "content": "Result:\n10010000 10000001 00000000 10000000 00010000 00000000 10000000 00000001 00000000 00000000 10000000 00000000 0001",
        "safe": true
    },
    {
        "filename": "100_doors_296.txt",
        "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();",
        "safe": true
    },
    {
        "filename": "100_doors_297.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_298.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_299.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_3.txt",
        "content": "   1   4   9  16  25  36  49  64  81 100",
        "safe": true
    },
    {
        "filename": "100_doors_30.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_300.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_301.txt",
        "content": "O--O----O------O--------O----------O------------O--------------O----------------O------------------O\n",
        "safe": true
    },
    {
        "filename": "100_doors_302.txt",
        "content": "100:c;[{0}c*]:d;\nc,{.c,>\\)%{.d<\\.d=1^\\)d>++:d;}/}/\n[c,{)\"door \"\\+\" is\"+}%d{{\"open\"}{\"closed\"}if}%]zip\n{\" \"*puts}/",
        "safe": true
    },
    {
        "filename": "100_doors_303.txt",
        "content": "100,{)}%\n{:d.sqrt 2?=\n{\"open\"}{\"close\"}if\"door \"d+\" is \"+\\+puts}/",
        "safe": true
    },
    {
        "filename": "100_doors_304.txt",
        "content": "[{\"close\"}100*]:d;\n10,{)2?(.d<\\[\"open\"]\\)d>++:d;}/\n[100,{)\"door \"\\+\" is\"+}%d]zip\n{\" \"*puts}/",
        "safe": true
    },
    {
        "filename": "100_doors_305.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_306.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_307.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_308.txt",
        "content": "(1..100).each {\n   println(\"Door #${it} is ${Math.sqrt(it).with{it==(int)it}\u00a0? 'open'\u00a0: 'closed'}.\")\n}",
        "safe": true
    },
    {
        "filename": "100_doors_309.txt",
        "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}",
        "safe": true
    },
    {
        "filename": "100_doors_31.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_310.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_311.txt",
        "content": "1\n4\n9\n16\n25\n36\n49\n64\n81\n100\n",
        "safe": true
    },
    {
        "filename": "100_doors_312.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_313.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_314.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_315.txt",
        "content": "data Door\n  = Open\n  | Closed\n  deriving (Eq, Show)\n\ntoggle\u00a0:: Door -> Door\ntoggle Open = Closed\ntoggle Closed = Open\n\ntoggleEvery\u00a0:: Int -> [Door] -> [Door]\ntoggleEvery k = zipWith toggleK [1 ..]\n  where\n    toggleK n door\n      | n `mod` k == 0 = toggle door\n      | otherwise = door\n\nrun\u00a0:: Int -> [Door]\nrun n = foldr toggleEvery (replicate n Closed) [1 .. n]\n\nmain\u00a0:: IO ()\nmain = print $ filter ((== Open) . snd) $ zip [1 ..] (run 100)",
        "safe": true
    },
    {
        "filename": "100_doors_316.txt",
        "content": "[(1,Open),(4,Open),(9,Open),(16,Open),(25,Open),(36,Open),(49,Open),(64,Open),(81,Open),(100,Open)]",
        "safe": true
    },
    {
        "filename": "100_doors_317.txt",
        "content": "run n = findIndices odd $ foldr toggleEvery (replicate n 0) [0..n] where toggleEvery k =  zipWith (+) $ cycle $ 1\u00a0: replicate k 0",
        "safe": true
    },
    {
        "filename": "100_doors_318.txt",
        "content": "gate\u00a0:: Eq a => [a] -> [a] -> [Door]\ngate (x:xs) (y:ys) | x == y  =  Open  \u00a0: gate xs ys\ngate (x:xs) ys               =  Closed\u00a0: gate xs ys\ngate []     _                =  []\n\nrun n = gate [1..n] [k*k | k <- [1..]]",
        "safe": true
    },
    {
        "filename": "100_doors_319.txt",
        "content": "run n = takeWhile (< n) [k*k | k <- [1..]]",
        "safe": true
    },
    {
        "filename": "100_doors_32.txt",
        "content": "var doors = new int [100]\n\nforeach pass 100 {\n    for (var door = pass\u00a0; door < 100\u00a0; door += pass+1) {\n        doors[door] = !doors[door]\n    }\n}\n\nvar d = 1\nforeach door doors {\n    println (\"door \" + d++ + \" is \" + (door\u00a0? \"open\"\u00a0: \"closed\"))\n\n}",
        "safe": true
    },
    {
        "filename": "100_doors_320.txt",
        "content": "class Main\n{\n    static public function main()\n    {\n        findOpenDoors( 100 );\n    }\n\n    static function findOpenDoors( n\u00a0: Int )\n    {\n        var door = [];\n        for( i in 0...n + 1 ){ door[ i ] = false; }\n        for( i in 1...n + 1 ){\n            var j = i;\n            while( j <= n ){ \n                door[ j ] =\u00a0! door[ j ];\n                j += i;\n            }\n        }\n        for( i in 1...n + 1 ){\n            if( door[ i ] ){ Sys.print( ' $i' ); }\n        }\n    }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_321.txt",
        "content": " 1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100_doors_322.txt",
        "content": "class RosettaDemo\n{\n    static public function main()\n    {\n        findOpenLockers(100);\n    }\n\n    static function findOpenLockers(n\u00a0: Int)\n    {\n        var i = 1;\n\n        while((i*i) <= n)\n        {\n            Sys.println(i*i);\n            i++;\n        }\n    }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_323.txt",
        "content": "REAL\u00a0:: n=100, open=1, door(n)\n\ndoor = 1 - open\u00a0! = closed\nDO i = 1, n\n  DO j = i, n, i\n    door(j) = open - door(j)\n  ENDDO\nENDDO\nDLG(Text=door, TItle=SUM(door)//\" doors open\")",
        "safe": true
    },
    {
        "filename": "100_doors_324.txt",
        "content": "door = 1 - open\u00a0! = closed\nDO i = 1, n^0.5\n  door(i*i) = open\nENDDO\nDLG(Text=door, TItle=SUM(door)//\" doors open\")",
        "safe": true
    },
    {
        "filename": "100_doors_325.txt",
        "content": "U8 is_open[100];\nU8 pass = 0, door = 0;\n\n/* do the 100 passes */\nfor (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 */\nfor (door = 0; door < 100; ++door)\n  if (is_open[door])\n    Print(\"Door #%d is open.\\n\", door + 1);\n  else\n    Print(\"Door #%d is closed.\\n\", door + 1);",
        "safe": true
    },
    {
        "filename": "100_doors_326.txt",
        "content": "|^\n=/  doors=(list\u00a0?)  (reap 100\u00a0%.n)\n=/  passes=(list (list\u00a0?))  (turn (gulf 1 100) pass-n)\n|-\n?~  passes  doors\n$(doors (toggle doors i.passes), passes t.passes)\n++  pass-n\n  |=  n=@ud\n  (turn (gulf 1 100) |=(k=@ud =((mod k n) 0)))\n++  toggle\n  |=  [a=(list\u00a0?) b=(list\u00a0?)]\n  =|  c=(list\u00a0?)\n  |-\n \u00a0?:  |(?=(~ a)\u00a0?=(~ b))  (flop c)\n  $(a t.a, b t.b, c [=((mix i.a i.b) 1) c])\n--",
        "safe": true
    },
    {
        "filename": "100_doors_327.txt",
        "content": "#! /bin/sh\nexec huginn --no-argv -E \"${0}\"\n#! huginn\n\nimport Algorithms as algo;\n\nmain() {\n        doorCount = 100;\n        doors = [].resize( doorCount, false );\n\n        for ( pass\u00a0: algo.range( doorCount ) ) {\n                i = 0;\n                step = pass + 1;\n                while ( i < doorCount ) {\n                        doors[i] =\u00a0! doors[i];\n                        i += step;\n                }\n        }\n\n        for ( i\u00a0: algo.range( doorCount ) ) {\n                if ( doors[i] ) {\n                        print( \"door {} is open\\n\".format( i ) );\n                }\n        }\n        return ( 0 );\n}",
        "safe": true
    },
    {
        "filename": "100_doors_328.txt",
        "content": "(setv doors (* [False] 100))\n\n(for [pass (range (len doors))]\n  (for [i (range pass (len doors) (inc pass))]\n    (assoc doors i (not (get doors i)))))\n\n(for [i (range (len doors))]\n  (print (.format \"Door {} is {}.\"\n    (inc i)\n    (if (get doors i) \"open\" \"closed\"))))",
        "safe": true
    },
    {
        "filename": "100_doors_329.txt",
        "content": "software {\n\tvar doors = len(100)\n\t\n\tfor pass over [1, 100]\n\t\tvar door = pass - 1\n\t\tloop door < len(doors) {\n\t\t\tdoors[door] = doors[door]/0\n\t\t\tdoor += pass\n\t\t}\n\tend\n\t\n\tfor door,isopen in doors\n\t\tif isopen\n\t\t\tprint(\"Door \",door+1,\": open\")\n\t\tend\n\tend\n\tprint(\"All other doors are closed\")\n}",
        "safe": true
    },
    {
        "filename": "100_doors_33.txt",
        "content": "begin\n \ncomment - 100 doors problem in ALGOL-60;\n \nboolean array doors[1:100];\ninteger i, j;\nboolean open, closed;\n \nopen\u00a0:= true;\nclosed\u00a0:= not true;\n \noutstring(1,\"100 Doors Problem\\n\");\n \ncomment - all doors are initially closed;\nfor i\u00a0:= 1 step 1 until 100 do\n  doors[i]\u00a0:= closed;\n \ncomment\n  cycle through at increasing intervals\n  and flip each door encountered;\nfor i\u00a0:= 1 step 1 until 100 do\n  for j\u00a0:= i step i until 100 do\n    doors[j]\u00a0:= not doors[j];\n \ncomment - show which doors are open;\noutstring(1,\"The open doors are:\");\nfor i\u00a0:= 1 step 1 until 100 do\n  if doors[i] then\n     outinteger(1,i);\n \nend\n",
        "safe": true
    },
    {
        "filename": "100_doors_330.txt",
        "content": "procedure main()\n    door\u00a0:= table(0)    # default value of entries is 0\n    every pass\u00a0:= 1 to 100 do\n        every door[i\u00a0:= pass to 100 by pass]\u00a0:= 1 - door[i]\n\n    every write(\"Door \", i\u00a0:= 1 to 100, \" is \", if door[i] = 1 then \"open\" else \"closed\")\nend",
        "safe": true
    },
    {
        "filename": "100_doors_331.txt",
        "content": "procedure main()\n    every write(\"Door \", i\u00a0:= 1 to 100, \" is \", if integer(sqrt(i)) = sqrt(i) then \"open\" else \"closed\")\nend",
        "safe": true
    },
    {
        "filename": "100_doors_332.txt",
        "content": "procedure main(args)\n    dMap\u00a0:= table(\"closed\")\n    every dMap[(1 to sqrt(100))^2]\u00a0:= \"open\"\n    every write(\"Door \",i\u00a0:= 1 to 100,\" is \",dMap[i])\nend",
        "safe": true
    },
    {
        "filename": "100_doors_333.txt",
        "content": "import Data.Vect\n\n-- Creates list from 0 to n (not including n) \nupTo\u00a0: (m\u00a0: Nat) -> Vect m (Fin m)\nupTo Z = []\nupTo (S n) = 0\u00a0:: (map FS (upTo n))\n\ndata DoorState = DoorOpen | DoorClosed\n\ntoggleDoor\u00a0: DoorState -> DoorState\ntoggleDoor DoorOpen = DoorClosed\ntoggleDoor DoorClosed = DoorOpen\n\nisOpen\u00a0: DoorState -> Bool\nisOpen DoorOpen = True\nisOpen DoorClosed = False\n\ninitialDoors\u00a0: Vect 100 DoorState\ninitialDoors = fromList $ map (\\_ => DoorClosed) [1..100]\n\niterate\u00a0: (n\u00a0: Fin m) -> Vect m DoorState -> Vect m DoorState\niterate n doors {m} = \n  map (\\(idx, doorState) => \n          if ((S (finToNat idx)) `mod` (S (finToNat n))) == Z \n              then toggleDoor doorState \n              else doorState)  \n      (zip (upTo m) doors)\n\n-- Returns all doors left open at the end\nsolveDoors\u00a0: List (Fin 100)\nsolveDoors = \n  findIndices isOpen $ foldl (\\doors,val => iterate val doors) initialDoors (upTo 100)\n\nmain\u00a0: IO ()\nmain = print $ map (\\n => S (finToNat n)) solveDoors",
        "safe": true
    },
    {
        "filename": "100_doors_334.txt",
        "content": "Hallway is a room.\n\nA toggle door is a kind of thing.\nA toggle door can be open or closed. It is usually closed.\nA toggle door has a number called the door number.\nUnderstand the door number property as referring to a toggle door.\nRule for printing the name of a toggle door: say \"door #[door number]\".\n\nThere are 100 toggle doors.\n\nWhen play begins (this is the initialize doors rule):\n\tlet the next door number be 1;\n\trepeat with D running through toggle doors:\n\t\tnow the door number of D is the next door number;\n\t\tincrement the next door number.\n\nTo toggle (D - open toggle door): now D is closed.\nTo toggle (D - closed toggle door): now D is open.\n\nWhen play begins (this is the solve puzzle rule):\n\tlet the door list be the list of toggle doors;\n\tlet the door count be the number of entries in the door list;\n\trepeat with iteration running from 1 to 100:\n\t\tlet N be the iteration;\n\t\twhile N is less than the door count:\n\t\t\ttoggle entry N in the door list;\n\t\t\tincrease N by the iteration;\n\tsay \"Doors left open: [list of open toggle doors].\";\n\tend the story.",
        "safe": true
    },
    {
        "filename": "100_doors_335.txt",
        "content": "MAIN\n    DEFINE\n        i, pass SMALLINT,\n        doors ARRAY[100] OF SMALLINT\n \n    FOR i = 1 TO 100\n        LET doors[i] = FALSE\n    END FOR\n \n    FOR pass = 1 TO 100\n        FOR i = pass TO 100 STEP pass\n            LET doors[i] = NOT doors[i]\n        END FOR\n    END FOR\n \n    FOR i = 1 TO 100\n        IF doors[i]\n          THEN DISPLAY i USING \"Door <<& is open\"\n          ELSE DISPLAY i USING \"Door <<& is closed\"\n        END IF\n    END FOR\nEND MAIN",
        "safe": true
    },
    {
        "filename": "100_doors_336.txt",
        "content": "(var doors (times 100 false))\n\n(for i  (range 1 101)\n     i2 (range (dec i) 100 i)\n  (var! doors (set-at [i2] (! (i2 doors))))\n  (continue))\n\n(-> (xmap vec doors)\n    (filter 1)\n    (map (comp 0 inc))\n    (join \", \")\n   @(str \"open doors: \"))",
        "safe": true
    },
    {
        "filename": "100_doors_337.txt",
        "content": "open doors: 1, 4, 9, 16, 25, 36, 49, 64, 81, 100\n",
        "safe": true
    },
    {
        "filename": "100_doors_338.txt",
        "content": "doors\u00a0:= List clone\n100 repeat(doors append(false))\nfor(i,1,100,\n    for(x,i,100, i, doors atPut(x - 1, doors at(x - 1) not))\n)\ndoors foreach(i, x, if(x, \"Door #{i + 1} is open\" interpolate println))",
        "safe": true
    },
    {
        "filename": "100_doors_339.txt",
        "content": "(Range 1 to(10) asList) foreach(v, \"Door #{v ** 2} is open.\" interpolate println)",
        "safe": true
    },
    {
        "filename": "100_doors_34.txt",
        "content": "100 Doors Problem\nThe open doors are: 1  4  9  16  25  36  49  64  81  100\n",
        "safe": true
    },
    {
        "filename": "100_doors_340.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100_doors_341.txt",
        "content": "NDoors = Origin mimic\n\nNDoors Toggle = Origin mimic do(\n  initialize = method(toggled?, @toggled? = toggled?)\n  toggle! = method(@toggled? = !toggled?. self)\n)\n\nNDoors Doors = Origin mimic do(\n  initialize = method(n,\n    @n = n\n    @doors = {} addKeysAndValues(1..n, (1..n) map(_, NDoors Toggle mimic(false)))\n  )\n  numsToToggle = method(n, for(x <- (1..@n), (x\u00a0% n) zero?, x))\n  toggleThese = method(nums, nums each(x, @doors[x] = @doors at(x) toggle))\n  show = method(@doors filter:dict(value toggled?) keys sort println)\n)\n\n; Test code\nx = NDoors Doors mimic(100)\n(1..100) each(n, x toggleThese(x numsToToggle(n)))\nx show",
        "safe": true
    },
    {
        "filename": "100_doors_342.txt",
        "content": "theory Scratch\n  imports Main\nbegin\n\nsection\u2039100 Doors\u203a\n\n  datatype doorstate = Open | Closed\n  \n  fun toggle\u00a0:: \"doorstate \u21d2 doorstate\" where\n    \"toggle Open   = Closed\"\n  | \"toggle Closed = Open\"\n  \n  fun walk\u00a0:: \"('a \u21d2 'a) \u21d2 nat \u21d2 nat \u21d2 'a list \u21d2 'a list\" where\n    \"walk f _     _       []     = []\"\n  | \"walk f every 0       (x#xs) = (f x) # walk f every every xs\"\n  | \"walk f every (Suc n) (x#xs) = x # walk f every n xs\"\n  \n  text\u2039Example: \\<^const>\u2039toggle\u203a every second door. (second = 1, because of 0 indexing)\u203a\n  lemma \"walk toggle 1 1 [Open, Open, Open, Open, Open, Open] =\n                         [Open, Closed, Open, Closed, Open, Closed]\" by code_simp\n  \n  text\u2039Example: \\<^const>\u2039toggle\u203a every third door.\u203a\n  lemma \"walk toggle 2 2 [Open, Open, Open, Open, Open, Open] =\n                         [Open, Open, Closed, Open, Open, Closed]\" by code_simp\n  \n  text\u2039Walking each door is essentially the same as the common \\<^const>\u2039map\u203a function.\u203a\n  lemma \"walk f 0 0 xs = map f xs\"\n    by(induction xs) (simp)+\n  \n  lemma walk_beginning:\n    \"walk f every n xs = (walk f every n (take (Suc n) xs)) @ (walk f every every (drop (Suc n) xs))\"\n    by(induction f every n xs rule:walk.induct) (simp)+\n  \n  text\u2039A convenience definition to take the off-by-one into account and setting the starting position.\u203a\n  definition visit_every\u00a0:: \"('a \u21d2 'a) \u21d2 nat \u21d2 'a list \u21d2 'a list\" where\n    \"visit_every f every xs \u2261 walk f (every - 1) (every - 1) xs\"\n  \n  \n  fun iterate\u00a0:: \"nat \u21d2 (nat \u21d2 'a \u21d2 'a) \u21d2 nat \u21d2 'a \u21d2 'a\" where\n    \"iterate 0       _ _ a = a\"\n  | \"iterate (Suc i) f n a = iterate i f (Suc n) (f n a)\"\n  \n  text\u2039The 100 doors problem.\u203a\n  definition \"onehundred_doors \u2261 iterate 100 (visit_every toggle) 1 (replicate 100 Closed)\"\n  \n  lemma \"onehundred_doors =\n    [Open, Closed, Closed, Open, Closed, Closed, Closed,\n     Closed, Open, Closed, Closed, Closed, Closed, Closed,\n     Closed, Open, Closed, Closed, Closed, Closed, Closed,\n     Closed, Closed, Closed, Open, Closed, Closed, Closed,\n     Closed, Closed, Closed, Closed, Closed, Closed, Closed,\n     Open, Closed, Closed, Closed, Closed, Closed, Closed,\n     Closed, Closed, Closed, Closed, Closed, Closed, Open,\n     Closed, Closed, Closed, Closed, Closed, Closed, Closed,\n     Closed, Closed, Closed, Closed, Closed, Closed, Closed,\n     Open, Closed, Closed, Closed, Closed, Closed, Closed,\n     Closed, Closed, Closed, Closed, Closed, Closed, Closed,\n     Closed, Closed, Closed, Open, Closed, Closed, Closed,\n     Closed, Closed, Closed, Closed, Closed, Closed, Closed,\n     Closed, Closed, Closed, Closed, Closed, Closed, Closed,\n     Closed, Open]\" by code_simp\n  \n  text\u2039Filtering for the open doors, we get the same result as the Haskell implementation.\u203a\n  lemma\n    \"[(i, door) \u2190 enumerate 1 onehundred_doors. door = Open] =\n     [(1,Open),(4,Open),(9,Open),(16,Open),(25,Open),(36,Open),(49,Open),(64,Open),(81,Open),(100,Open)]\"\n    by code_simp\n\nsection\u2039Equivalence to Haskell Implementation\u203a\ntext\u2039\nWe will now present an alternative implementation, which is similar to the Haskell implementation\non \ud83c\udf10\u2039https://rosettacode.org/wiki/100_doors#Haskell\u203a. We will prove, that the two behave the same;\nin general, not just for a fixed set of 100 doors.\n\u203a\n\n  definition map_every_start\u00a0:: \"('a \u21d2 'a) \u21d2 nat \u21d2 nat \u21d2 'a list \u21d2 'a list\" where\n    \"map_every_start f every start xs \u2261\n      map (\u03bb(i, x). if i mod every = 0 then f x else x) (enumerate start xs)\"\n\n  definition visit_every_alt\u00a0:: \"('a \u21d2 'a) \u21d2 nat \u21d2 'a list \u21d2 'a list\" where\n    \"visit_every_alt f every xs \u2261 map_every_start f every 1 xs\"\n  \n  text\u2039Essentially, \\<^term>\u2039start\u203a and \\<^term>\u2039start mod every\u203a behave the same.\u203a\n  lemma map_every_start_cycle:\n    \"map_every_start f every (start + k*every) xs = map_every_start f every start xs\"\n    proof(induction xs arbitrary: start)\n      case Nil\n      show \"map_every_start f every (start + k * every) [] = map_every_start f every start []\"\n        by(simp add: map_every_start_def)\n    next\n      case (Cons x xs)\n      from Cons.IH[of \"Suc start\"]\n        show \"map_every_start f every (start + k * every) (x # xs) =\n              map_every_start f every start (x # xs)\"\n        by(simp add: map_every_start_def)\n    qed\n  corollary map_every_start_cycle_zero:\n    \"map_every_start f every every xs = map_every_start f every 0 xs\"\n    using map_every_start_cycle[where k=1 and start=0, simplified] by blast\n  \n  lemma map_every_start_fst_zero:\n    \"map_every_start f every 0 (x # xs) = f x # map_every_start f every (Suc 0) xs\"\n    by(simp add: map_every_start_def)\n  \n  text\u2039\n  The first \\<^term>\u2039n\u203a elements are not processed by \\<^term>\u2039f\u203a,\n  as long as \\<^term>\u2039n\u203a is less than the \\<^term>\u2039every\u203a cycle.\n \u00a0\u203a\n  lemma map_every_start_skip_first: \"Suc n < every \u27f9\n         map_every_start f every (every - (Suc n)) (x # xs) = \n         x # map_every_start f every (every - n) xs\"\n    by(simp add: map_every_start_def Suc_diff_Suc)\n\n  lemma map_every_start_append:\n    \"map_every_start f n s (ds1 @ ds2) =\n     map_every_start f n s ds1 @ map_every_start f n (s + length ds1) ds2\"\n    by(simp add: map_every_start_def enumerate_append_eq)\n\n  text\u2039\n  The \\<^const>\u2039walk\u203a function and \\<^const>\u2039map_every_start\u203a behave the same,\n  as long as the starting \\<^term>\u2039n\u203a is less than the \\<^term>\u2039every\u203a cycle,\n  because \\<^const>\u2039walk\u203a allows pushing the start arbitrarily far and\n  \\<^const>\u2039map_every_start\u203a only allows deferring the start within\n  the \\<^term>\u2039every\u203a cycle.\n  This generalization is needed to strengthen the induction hypothesis\n  for the proof.\n \u00a0\u203a\n  lemma walk_eq_map_every_start:\n    \"n \u2264 every \u27f9 walk f every n xs = map_every_start f (Suc every) (Suc every - n) xs\"\n    proof(induction xs arbitrary: n)\n      case Nil\n      show \"walk f every n [] = map_every_start f (Suc every) (Suc every - n) []\"\n        by(simp add: map_every_start_def)\n    next\n      case (Cons x xs)\n      then show \"walk f every n (x # xs) = map_every_start f (Suc every) (Suc every - n) (x # xs)\"\n      proof(cases n)\n        case 0\n        with Cons.IH show ?thesis \n          by(simp add: map_every_start_cycle_zero map_every_start_fst_zero)\n      next\n        case (Suc n2)\n        with Cons.prems map_every_start_skip_first[of n2 \"Suc every\"] have\n          \"map_every_start f (Suc every) (Suc every - Suc n2) (x # xs) =\n           x # map_every_start f (Suc every) (Suc every - n2) xs\"\n          by fastforce\n        with Suc Cons show ?thesis\n          by(simp)\n      qed\n    qed\n  \n  corollary walk_eq_visit_every_alt:\n    \"walk f every every xs = visit_every_alt f (Suc every) xs\"\n    unfolding visit_every_alt_def\n    using walk_eq_map_every_start by fastforce\n\n  text\u2039\n  Despite their very different implementations, our alternative visit function behaves the same\n  as our original visit function.\n  Text the theorem includes \\<^term>\u2039Suc every\u203a to express that we exclude \\<^term>\u2039every = 0\u203a.\n \u00a0\u203a\n  theorem visit_every_eq_visit_every_alt:\n    \"visit_every f (Suc every) xs = visit_every_alt f (Suc every) xs\"\n    unfolding visit_every_def\n    using walk_eq_visit_every_alt by fastforce\n\n  text\u2039Also, the \\<^const>\u2039iterate\u203a function we implemented above can be implemented by a simple \\<^const>\u2039fold\u203a.\u203a\n  lemma fold_upt_helper: assumes n_geq_1: \"Suc 0 \u2264 n\"\n    shows \"fold f [Suc s..<n + s] (f s xs) = fold f [s..<n + s] xs\"\n  proof -\n    from n_geq_1 have \"[s..<n + s] = s#[Suc s..<n + s]\" by (simp add: Suc_le_lessD upt_rec)\n    from this have \"fold f [s..<n + s] xs = fold f (s#[Suc s..<n + s]) xs\" by simp\n    also have \"fold f (s#[Suc s..<n + s]) xs = fold f [Suc s..<n + s] (f s xs)\" by(simp)\n    ultimately show ?thesis by simp\n  qed\n  \n  theorem iterate_eq_fold: \"iterate n f s xs = fold f [s ..< n+s] xs\"\n  proof(induction n arbitrary: s xs)\n    case 0\n    then show \"iterate 0 f s xs = fold f [s..<0 + s] xs\" by simp\n  next\n    case (Suc n)\n    from Suc show \"iterate (Suc n) f s xs = fold f [s..<Suc n + s] xs\" \n      by(simp add: fold_upt_helper not_less_eq_eq)\n  qed\n\nsection\u2039Efficient Implementation\u203a\ntext \u2039\nAs noted on this page, the only doors that remain open are those whose numbers are perfect squares.\nYet, rosettacode does not want us to take this shortcut, since we want to compare implementations\nacross programming languages. But we can prove that our code computes the same result as reporting\nall doors with a perfect square number as open:\n\u203a\n  theorem \"[(i, door) \u2190 enumerate 1 onehundred_doors. door = Open] =\n           [(i*i, Open). i \u2190 [1..<11]]\"\n    by code_simp\nend",
        "safe": true
    },
    {
        "filename": "100_doors_343.txt",
        "content": "   ~:/ (100 $ - {. 1:)\"0 >:i.100\n1 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 ...\n   ~:/ 0=|/~ >:i.100  NB. alternative\n1 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 ...\n   (*/\"1)2|>:_ q:>:i.100 NB. alternative",
        "safe": true
    },
    {
        "filename": "100_doors_344.txt",
        "content": "   (e. *:) 1+i.100\n1 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 ...\n   1 (<:*:i.10)} 100$0  NB. alternative\n1 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 ...",
        "safe": true
    },
    {
        "filename": "100_doors_345.txt",
        "content": "   'these doors are open: ',\": I. (i.101) e. *: 1+i.10\nthese doors are open: 1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100_doors_346.txt",
        "content": "(def doors (seq [_ :range [0 100]] false))\n\n(loop [pass :range [0 100]\n       door :range [pass 100 (inc pass)]]\n  (put doors door (not (doors door))))\n\n(print \"open doors: \"\u00a0;(seq [i :range [0 100] :when (doors i)] (string (inc i) \" \")))",
        "safe": true
    },
    {
        "filename": "100_doors_347.txt",
        "content": "open doors: 1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100_doors_348.txt",
        "content": "class HundredDoors {\n    public static void main(String[] args) {\n        boolean[] doors = new boolean[101];\n\n        for (int i = 1; i < doors.length; i++) {\n            for (int j = i; j < doors.length; j += i) {\n                doors[j] = !doors[j];\n            }\n        }\n\n        for (int i = 1; i < doors.length; i++) {\n            if (doors[i]) {\n                System.out.printf(\"Door %d is open.%n\", i);\n            }\n        }\n    }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_349.txt",
        "content": "import java.util.BitSet;\n\npublic class HundredDoors {\n    public static void main(String[] args) {\n        final int n = 100;\n        var a = new BitSet(n);\n        for (int i = 1; i <= n; i++) {\n            for (int j = i - 1; j < n; j += i) {\n                a.flip(j);\n            }\n        }\n        a.stream().map(i -> i + 1).forEachOrdered(System.out::println);\n    }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_35.txt",
        "content": "PROC doors = (INT limit)VOID:\n(\n  MODE DOORSTATE = BOOL;\n  BOOL closed = FALSE;\n  BOOL open = NOT closed;\n  MODE DOORLIST = [limit]DOORSTATE;\n\n  DOORLIST the doors;\n  FOR i FROM LWB the doors TO UPB the doors DO the doors[i]:=closed OD;\n\n  FOR i FROM LWB the doors TO UPB the doors DO\n    FOR j FROM LWB the doors BY i TO UPB the doors DO\n      the doors[j]\u00a0:= NOT the doors[j]\n    OD\n  OD;\n  FOR i FROM LWB the doors TO UPB the doors DO\n    print((whole(i,-12),\" is \",(the doors[i]|\"opened\"|\"closed\"),newline))\n  OD\n);\ndoors(100)\n",
        "safe": true
    },
    {
        "filename": "100_doors_350.txt",
        "content": "class HundredDoors {\n    public static void main(String[] args) {\n        for (int i = 1; i <= 10; i++)\n            System.out.printf(\"Door %d is open.%n\", i * i);\n    }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_351.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100_doors_352.txt",
        "content": "import java.util.stream.Collectors;\nimport java.util.stream.IntStream;\n\nclass HundredDoors {\n    public static void main(String args[]) {\n        String openDoors = IntStream.rangeClosed(1, 100)\n                .filter(i -> Math.pow((int) Math.sqrt(i), 2) == i)\n                .mapToObj(Integer::toString)\n                .collect(Collectors.joining(\", \"));\n        System.out.printf(\"Open doors: %s%n\", openDoors);\n    }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_353.txt",
        "content": "Open doors: 1, 4, 9, 16, 25, 36, 49, 64, 81, 100\n",
        "safe": true
    },
    {
        "filename": "100_doors_354.txt",
        "content": "var doors=[];\nfor (var i=0;i<100;i++)\n    doors[i]=false;\nfor (var i=1;i<=100;i++)\n    for (var i2=i-1;i2<100;i2+=i)\n        doors[i2]=!doors[i2];\nfor (var i=1;i<=100;i++)\n    console.log(\"Door %d is %s\",i,doors[i-1]?\"open\":\"closed\")",
        "safe": true
    },
    {
        "filename": "100_doors_355.txt",
        "content": "(function (n) {\n    \"use strict\";\n    function finalDoors(n) {\n        var lstRange = range(1, n);\n        return lstRange\n            .reduce(function (a, _, k) {\n                var m = k + 1;\n                return a.map(function (x, i) {\n                    var j = i + 1;\n                    return [j, j\u00a0% m\u00a0? x[1]\u00a0: !x[1]];\n                });\n            }, zip(\n                lstRange,\n                replicate(n, false)\n            ));\n    };\n    function zip(xs, ys) {\n        return xs.length === ys.length\u00a0? (\n            xs.map(function (x, i) {\n                return [x, ys[i]];\n            })\n        )\u00a0: undefined;\n    }\n    function replicate(n, a) {\n        var v = [a],\n            o = [];\n        if (n < 1) return o;\n        while (n > 1) {\n            if (n & 1) o = o.concat(v);\n            n >>= 1;\n            v = v.concat(v);\n        }\n        return o.concat(v);\n    }\n    function range(m, n, delta) {\n        var d = delta || 1,\n            blnUp = n > m,\n            lng = Math.floor((blnUp\u00a0? n - m\u00a0: m - n) / d) + 1,\n            a = Array(lng),\n            i = lng;\n        if (blnUp)\n            while (i--) a[i] = (d * i) + m;\n        else\n            while (i--) a[i] = m - (d * i);\n        return a;\n    }\n    return finalDoors(n)\n        .filter(function (tuple) {\n            return tuple[1];\n        })\n        .map(function (tuple) {\n            return {\n                door: tuple[0],\n                open: tuple[1]\n            };\n        });\n\n})(100);",
        "safe": true
    },
    {
        "filename": "100_doors_356.txt",
        "content": "for (var door = 1; door <= 100; door++) {\n  var sqrt = Math.sqrt(door);\n  if (sqrt === (sqrt | 0)) {\n    console.log(\"Door %d is open\", door);\n  }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_357.txt",
        "content": "for(var door=1;i<10/*Math.sqrt(100)*/;i++){\n console.log(\"Door %d is open\",i*i);\n}",
        "safe": true
    },
    {
        "filename": "100_doors_358.txt",
        "content": "(function (n) {\n    \"use strict\";\n    return range(1, 100)\n        .filter(function (x) {\n            return integerFactors(x)\n                .length\u00a0% 2;\n        });\n    function integerFactors(n) {\n        var rRoot = Math.sqrt(n),\n            intRoot = Math.floor(rRoot),\n            lows = range(1, intRoot)\n            .filter(function (x) {\n                return (n\u00a0% x) === 0;\n            });\n        return lows.concat(lows.map(function (x) {\n                return n / x;\n            })\n            .reverse()\n            .slice((rRoot === intRoot) | 0));\n    }\n    function range(m, n, delta) {\n        var d = delta || 1,\n            blnUp = n > m,\n            lng = Math.floor((blnUp\u00a0? n - m\u00a0: m - n) / d) + 1,\n            a = Array(lng),\n            i = lng;\n        if (blnUp)\n            while (i--) a[i] = (d * i) + m;\n        else\n            while (i--) a[i] = m - (d * i);\n        return a;\n    }\n})(100);",
        "safe": true
    },
    {
        "filename": "100_doors_359.txt",
        "content": "(function (n) {\n    \"use strict\";\n    return perfectSquaresUpTo(100);\n    function perfectSquaresUpTo(n) {\n        return range(1, Math.floor(Math.sqrt(n)))\n            .map(function (x) {\n                return x * x;\n            });\n    }\n    function range(m, n, delta) {\n        var d = delta || 1,\n            blnUp = n > m,\n            lng = Math.floor((blnUp\u00a0? n - m\u00a0: m - n) / d) + 1,\n            a = Array(lng),\n            i = lng;\n        if (blnUp)\n            while (i--) a[i] = (d * i) + m;\n        else\n            while (i--) a[i] = m - (d * i);\n        return a;\n    }\n})(100);",
        "safe": true
    },
    {
        "filename": "100_doors_36.txt",
        "content": "PROC doors optimised = ( INT limit )VOID:\n  FOR i TO limit DO\n    REAL num\u00a0:= sqrt(i);\n    print((whole(i,0),\" is \",(ENTIER num = num |\"opened\"|\"closed\"),newline))\n  OD\n;\ndoors optimised(100)\n",
        "safe": true
    },
    {
        "filename": "100_doors_360.txt",
        "content": "Array.apply(null, { length: 100 })\n  .map((v, i) => i + 1)\n    .forEach(door => { \n      var sqrt = Math.sqrt(door); \n\n      if (sqrt === (sqrt | 0)) {\n        console.log(\"Door %d is open\", door);\n      } \n    });",
        "safe": true
    },
    {
        "filename": "100_doors_361.txt",
        "content": "// Array comprehension style\n[ for (i of Array.apply(null, { length: 100 })) i ].forEach((_, i) => { \n  var door = i + 1\n  var sqrt = Math.sqrt(door); \n\n  if (sqrt === (sqrt | 0)) {\n    console.log(\"Door \" + door + \" is open\");\n  } \n});",
        "safe": true
    },
    {
        "filename": "100_doors_362.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_363.txt",
        "content": "(function (n) {\n \n \n    // ONLY PERFECT SQUARES HAVE AN ODD NUMBER OF INTEGER FACTORS\n    // (Leaving the door open at the end of the process) \n \n    return perfectSquaresUpTo(n);\n \n \n    // perfectSquaresUpTo\u00a0:: Int -> [Int]\n    function perfectSquaresUpTo(n) {\n        return range(1, Math.floor(Math.sqrt(n)))\n            .map(x => x * x);\n    }\n \n \n    // GENERIC\n \n    // range(intFrom, intTo, optional intStep)\n    // Int -> Int -> Maybe Int -> [Int]\n    function range(m, n, step) {\n        let d = (step || 1) * (n >= m\u00a0? 1\u00a0: -1);\n \n        return Array.from({\n            length: Math.floor((n - m) / d) + 1\n        }, (_, i) => m + (i * d));\n    }\n \n})(100);",
        "safe": true
    },
    {
        "filename": "100_doors_364.txt",
        "content": "[1, 4, 9, 16, 25, 36, 49, 64, 81, 100]",
        "safe": true
    },
    {
        "filename": "100_doors_365.txt",
        "content": "\"use strict\";\n\n// Doors can be open or closed.\nconst open = \"O\";\nconst closed = \"C\";\n\n// There are 100 doors in a row that are all initially closed.\nconst doorsCount = 100;\nconst doors = [];\nfor (let i = 0; i < doorsCount; doors[i] = closed, i++);\n\n// You make 100 passes by the doors, visiting every door and toggle the door (if\n// the door is closed, open it; if it is open, close it), according to the rules\n// of the task.\nfor (let pass = 1; pass <= doorsCount; pass++)\n    for (let i = pass - 1; i < doorsCount; i += pass)\n        doors[i] = doors[i] == open\u00a0? closed\u00a0: open;\n\n// Answer the question: what state are the doors in after the last pass?\ndoors.forEach((v, i) =>\n    console.log(`Doors ${i + 1} are ${v == open\u00a0? 'opened'\u00a0: 'closed'}.`));\n\n// Which are open, which are closed?\nlet openKeyList = [];\nlet closedKeyList = [];\nfor (let door of doors.entries())\n    if (door[1] == open)\n        openKeyList.push(door[0] + 1);\n    else\n        closedKeyList.push(door[0] + 1);\nconsole.log(\"These are open doors: \" + openKeyList.join(\", \") + \".\");\nconsole.log(\"These are closed doors: \" + closedKeyList.join(\", \") + \".\");\n\n// Assert:\nconst expected = [];\nfor (let i = 1; i * i <= doorsCount; expected.push(i * i), i++);\nif (openKeyList.every((v, i) => v === expected[i]))\n    console.log(\"The task is solved.\")\nelse\n    throw \"These aren't the doors you're looking for.\";",
        "safe": true
    },
    {
        "filename": "100_doors_366.txt",
        "content": "# Solution for n doors:\ndef doors(n):\n\n  def print:\n    . as $doors\n    | range(1; length+1)\n    | if $doors[.] then \"Door \\(.) is open\" else empty end;\n\n    [range(n+1)|null] as $doors\n  | reduce range(1; n+1) as $run\n      ( $doors; reduce range($run; n+1; $run ) as $door\n                  ( .; .[$door] = (.[$door] | not) ) )\n  | print\u00a0;",
        "safe": true
    },
    {
        "filename": "100_doors_367.txt",
        "content": "# Solution for 100 doors:\ndef solution:\n  range(1;11) | \"Door \\(. * .) is open\";",
        "safe": true
    },
    {
        "filename": "100_doors_368.txt",
        "content": "doors = falses(100)\nfor a in 1:100, b in a:a:100\n    doors[b] = !doors[b]\nend\nfor a = 1:100\n    println(\"Door $a is \" * (doors[a]\u00a0? \"open.\"\u00a0: \"closed.\")) \nend",
        "safe": true
    },
    {
        "filename": "100_doors_369.txt",
        "content": "for i in 1:10 println(\"Door $(i^2) is open.\") end",
        "safe": true
    },
    {
        "filename": "100_doors_37.txt",
        "content": "begin\n    % find the first few squares via the unoptimised door flipping method  \u00a0%\n \n    integer doorMax;\n    doorMax\u00a0:= 100;\n \n    begin\n        % need to start a new block so the array can have variable bounds  \u00a0%\n \n        % array of doors - door( i ) is true if open, false if closed      \u00a0%\n        logical array door( 1\u00a0:: doorMax );\n \n        % set all doors to closed                                          \u00a0%\n        for i\u00a0:= 1 until doorMax do door( i )\u00a0:= false;\n \n        % repeatedly flip the doors                                        \u00a0%\n        for i\u00a0:= 1 until doorMax\n        do begin\n            for j\u00a0:= i step i until doorMax\n            do begin\n                door( j )\u00a0:= not door( j )\n            end\n        end;\n \n        % display the results                                              \u00a0%\n        i_w\u00a0:= 1; % set integer field width                                \u00a0%\n        s_w\u00a0:= 1; % and separator width                                    \u00a0%\n        for i\u00a0:= 1 until doorMax do if door( i ) then writeon( i )\n \n    end\n \nend.\n",
        "safe": true
    },
    {
        "filename": "100_doors_370.txt",
        "content": "   doors:{`closed`open![;2]@#:'1_=,/&:'0=t!\\:/:t:!101}",
        "safe": true
    },
    {
        "filename": "100_doors_371.txt",
        "content": "   (1+!10)^2\n1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100_doors_372.txt",
        "content": "   {(1+!_ x^%2)^2}100\n1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100_doors_373.txt",
        "content": "include ..\\Utilitys.tlhy\n\n%n 100 !n\n0 $n repeat\n\n$n [dup sqrt int dup * over\n== ( [1 swap set] [drop] ) if] for\n\n$n [ ( \"The door \" over  \" is \" ) lprint get ( [\"OPEN\"] [\"closed\"] ) if print nl] for\n\n( \"Time elapsed: \" msec \" seconds\" ) lprint nl\n\npstack\n\" \" input",
        "safe": true
    },
    {
        "filename": "100_doors_374.txt",
        "content": "flip::{,/{(1-*x),1_x}'x:#y}\ni::0;(100{i::i+1;flip(i;x)}:*100:^0)?1",
        "safe": true
    },
    {
        "filename": "100_doors_375.txt",
        "content": "(1+!9)^2",
        "safe": true
    },
    {
        "filename": "100_doors_376.txt",
        "content": "type state\n  Open\n  Closed\n\nfun toggle(self: state): state\n  match self\n    Open   -> Closed\n    Closed -> Open\n\ninline extern unsafe-assign\u00a0: forall<a> ( v\u00a0: vector<a>, i\u00a0: ssize_t, x\u00a0: a ) -> total ()\n  c \"kk_vector_unsafe_assign\"\n\nfun main()\n  val doors = vector(100, Closed)\n  for(0,99) fn(pass)\n    var door\u00a0:= pass\n    while { door < 99 }\n      doors.unsafe-assign(door.ssize_t, doors[door].toggle)\n      door\u00a0:= door + (pass+1)\n  doors.foreach-indexed fn(idx, it)\n    match it\n      Open   -> println(\"door \" ++ (idx + 1).show ++ \" is open\")\n      Closed -> println(\"door \" ++ (idx + 1).show ++ \" is closed\")",
        "safe": true
    },
    {
        "filename": "100_doors_377.txt",
        "content": "fun main()\n  val doors = list(0,99,1,fn(i) Closed)\n  val transformed = list(1,99).foldl(doors) fn(drs, pass)\n    drs.map-indexed fn(i, door)\n      if ((i + 1)\u00a0% pass) == 0 then door.toggle else door\n  transformed.foreach-indexed fn(idx, it)\n    match it\n      Open   -> println(\"door \" ++ (idx + 1).show ++ \" is open\")\n      Closed -> println(\"door \" ++ (idx + 1).show ++ \" is closed\")",
        "safe": true
    },
    {
        "filename": "100_doors_378.txt",
        "content": "fun oneHundredDoors(): List<Int> {\n    val doors = BooleanArray(100) { false }\n\n    repeat(doors.size) { i ->\n        for (j in i until doors.size step (i + 1)) {\n            doors[j] = !doors[j]\n        }\n    }\n\n    return doors\n        .foldIndexed(emptyList()) { i, acc, door ->\n            if (door) acc + (i + 1) else acc\n        }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_379.txt",
        "content": "range InitialDoor from 1 to 100 step 1\n| extend DoorsVisited=range(InitialDoor, 100, InitialDoor)\n| mvexpand DoorVisited=DoorsVisited to typeof(int)\n| summarize VisitCount=count() by DoorVisited\n| project Door=DoorVisited, IsOpen=(VisitCount\u00a0% 2) == 1",
        "safe": true
    },
    {
        "filename": "100_doors_38.txt",
        "content": " 1 4 9 16 25 36 49 64 81 100 \n",
        "safe": true
    },
    {
        "filename": "100_doors_380.txt",
        "content": "1) unoptimized version\n\n{def doors\n {A.new\n  {S.map {lambda {} false} {S.serie 1 100}}}}\n-> doors\n\n{def toggle\n {lambda {:i :a}\n  {let { {_ {A.set! :i {not {A.get :i :a}} :a} }}}}}\n-> toggle\n\n{S.map {lambda {:b} \n {S.map {lambda {:i} {toggle :i {doors}}} \n  {S.serie :b 99 {+ :b 1}}}}\n   {S.serie 0 99}} \n->\n\n{S.replace \\s by space in \n {S.map {lambda {:i} {if {A.get :i {doors}} then {+ :i 1} else}} \n  {S.serie 0 99}}}\n\n-> 1 4 9 16 25 36 49 64 81 100\n\n2.2) optimized version\n\n{S.replace \\s by space in \n {S.map {lambda {:i}\n         {let { {:root {sqrt :i}} } \n              {if {= :root {round :root}} \n               then {* :root :root}\n               else}}}\n        {S.serie 1 100}}}\n\n-> 1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100_doors_381.txt",
        "content": "&doors = fn.arrayGenerateFrom(fn.inc, 100)\nfp.mapper = ($i) -> {\n\t$n\n\t$open = 0\n\trepeat($[n], 100) {\n\t\t$open $= $i\u00a0% +|$n?!$open:$open\n\t}\n\t\n\treturn $open\n}\nfn.arrayMap(&doors, fp.mapper)\n\nfn.print(Open doors:)\n$i\nrepeat($[i], @&doors) {\n\tif(&doors[$i]) {\n\t\tfn.printf(\\s%03d, parser.op(+|$i))\n\t}\n}\nfn.println()",
        "safe": true
    },
    {
        "filename": "100_doors_382.txt",
        "content": "Open doors: 001 004 009 016 025 036 049 064 081 100\n",
        "safe": true
    },
    {
        "filename": "100_doors_383.txt",
        "content": "var doors = [false] * 100\n\nfor i of doors {\n    for j = i; j <= len(doors); j += i {\n        doors[j] = not doors[j]\n    }\n}\n\nwriteln for[=[]] i of doors { if doors[i]: _for = more(_for, i) }",
        "safe": true
    },
    {
        "filename": "100_doors_384.txt",
        "content": "writeln foldfrom(fn a, b, c: if(b: a~[c]; a), [], doors, series(1..len(doors)))",
        "safe": true
    },
    {
        "filename": "100_doors_385.txt",
        "content": "writeln map(fn{^2}, 1..10)",
        "safe": true
    },
    {
        "filename": "100_doors_386.txt",
        "content": "[1, 4, 9, 16, 25, 36, 49, 64, 81, 100]",
        "safe": true
    },
    {
        "filename": "100_doors_387.txt",
        "content": "loop(100) => {^\n\tlocal(root = math_sqrt(loop_count))\n\tlocal(state = (#root == math_ceil(#root)\u00a0? '<strong>open</strong>' | 'closed'))\n\t#state\u00a0!= 'closed'\u00a0? 'Door ' + loop_count + ': ' + #state + '<br>'\n^}",
        "safe": true
    },
    {
        "filename": "100_doors_388.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_389.txt",
        "content": "use 'format importAllSigils.\n\ndoors\u00a0:= Object clone.\ndoors missing\u00a0:= { False. }.\ndoors check\u00a0:= {\n  self slot ($1 ordinal).\n}.\ndoors toggle\u00a0:= {\n  self slot ($1 ordinal) = self slot ($1 ordinal) not.\n}.\n1 upto 101 do {\n  takes '[i].\n  local 'j = i.\n  while { j <= 100. } do {\n    doors toggle (j).\n    j = j + i.\n  }.\n}.\n$stdout printf: ~fmt \"The open doors are: ~A\", 1 upto 101 filter { doors check. } to (Array).",
        "safe": true
    },
    {
        "filename": "100_doors_39.txt",
        "content": "BEGIN\n\nINTEGER ARRAY DOORS[1:100];\nINTEGER I, J, OPEN, CLOSED;\n\nOPEN\u00a0:= 1;\nCLOSED\u00a0:= 0;\n\n% ALL DOORS ARE INITIALLY CLOSED\u00a0%\nFOR I\u00a0:= 1 STEP 1 UNTIL 100 DO\n  BEGIN\n    DOORS[I]\u00a0:= CLOSED;\n  END;\n\n% PASS THROUGH AT INCREASING INTERVALS AND FLIP\u00a0%\nFOR I\u00a0:= 1 STEP 1 UNTIL 100 DO\n  BEGIN\n     FOR J\u00a0:= I STEP I UNTIL 100 DO\n       BEGIN\n         DOORS[J]\u00a0:= 1 - DOORS[J];\n       END;\n  END;\n\n% SHOW RESULTS\u00a0%\nWRITE(\"THE OPEN DOORS ARE:\");\nWRITE(\"\");\nFOR I\u00a0:= 1 STEP 1 UNTIL 100 DO\n  BEGIN\n    IF DOORS[I] = OPEN THEN\n      WRITEON(I);\n  END;\n\nEND",
        "safe": true
    },
    {
        "filename": "100_doors_390.txt",
        "content": "to doors\n\t;Problem 100 Doors \n\t;Lhogho\n\n\tfor \"p [1 100] \n\t[\n\t\tmake :p \"false\n\t]\n\n\tfor \"a [1 100 1]\n\t[\n\t\tfor \"b [:a 100 :a]\n\t\t[\n\t\t\tif :b < 101 \n\t\t\t[\n\t\t\t\tmake :b not thing :b\n\t\t\t]\n\t\t]\n\t]\n\n\tfor \"c [1 100]\n\t[\n\t\tif thing :c \n\t\t[ \n\t\t\t(print \"door :c \"is \"open) \n\t\t]\n\t] \nend\n\ndoors",
        "safe": true
    },
    {
        "filename": "100_doors_391.txt",
        "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\nprint \"open doors \";\nfor door = 1 to 100\n    if doors(door) then print door;\"  \";\nnext door",
        "safe": true
    },
    {
        "filename": "100_doors_392.txt",
        "content": "var doors = List.fill(100, false)\n\nfor i in 0...99:\n    for j in i...99 by i + 1:\n        doors[j] = !doors[j]\n\n# The type must be specified since the list starts off empty.\nvar open_doors: List[Integer] = []\n\ndoors.each_index{|i|\n    if doors[i]:\n        open_doors.push(i + 1)\n}\n\nprint($\"Open doors: ^(open_doors)\")",
        "safe": true
    },
    {
        "filename": "100_doors_393.txt",
        "content": "Open doors: [1, 4, 9, 16, 25, 36, 49, 64, 81, 100]",
        "safe": true
    },
    {
        "filename": "100_doors_394.txt",
        "content": "on mouseUp   \n   repeat with tStep = 1 to 100\n      repeat with tDoor = tStep to 100 step tStep\n         put not tDoors[tDoor] into tDoors[tDoor]\n      end repeat\n      if tDoors[tStep] then put \"Door \" & tStep & \" is open\" & cr after tList\n   end repeat\n   set the text of field \"Doors\" to tList\nend mouseUp",
        "safe": true
    },
    {
        "filename": "100_doors_395.txt",
        "content": "to doors\n;Problem 100 Doors \n;FMSLogo\n;lrcvs 2010\n\nmake \"door (vector 100 1) \nfor [p 1 100][setitem :p :door 0] \n  \nfor [a 1 100 1][for [b :a 100 :a][make \"x item :b :door \n\t                          ifelse :x  = 0 [setitem :b :door 1][setitem :b :door 0] ] ] \n  \nfor [c 1 100][make \"y item :c :door \n\t      ifelse :y = 0 [pr (list :c \"Close)] [pr (list :c \"Open)] ] \nend",
        "safe": true
    },
    {
        "filename": "100_doors_396.txt",
        "content": "HAI 1.3\n\nI HAS A doors ITZ A BUKKIT\nIM IN YR hallway UPPIN YR door TIL BOTH SAEM door AN 100\n    doors HAS A SRS door ITZ FAIL BTW, INISHULIZE ALL TEH DOORZ AS CLOZD\nIM OUTTA YR hallway\n\nIM IN YR hallway UPPIN YR pass TIL BOTH SAEM pass AN 100\n    I HAS A door ITZ pass\n    IM IN YR passer\n        doors'Z SRS door R NOT doors'Z SRS door\n        door R SUM OF door AN SUM OF pass AN 1\n        DIFFRINT door AN SMALLR OF door AN 99, O RLY?\n            YA RLY, GTFO\n        OIC\n    IM OUTTA YR passer\nIM OUTTA YR hallway\n\nIM IN YR printer UPPIN YR door TIL BOTH SAEM door AN 100\n    VISIBLE \"Door #\" SUM OF door AN 1 \" is \"!\n    doors'Z SRS door, O RLY?\n        YA RLY, VISIBLE \"open.\"\n        NO WAI, VISIBLE \"closed.\"\n    OIC\nIM OUTTA YR printer\n\nKTHXBYE",
        "safe": true
    },
    {
        "filename": "100_doors_397.txt",
        "content": "local is_open = {}\n\nfor pass = 1,100 do\n    for door = pass,100,pass do\n        is_open[door] = not is_open[door]\n    end\nend\n\nfor i,v in next,is_open do\n    print ('Door '..i..':',v and 'open' or 'close')\nend",
        "safe": true
    },
    {
        "filename": "100_doors_398.txt",
        "content": "Module Doors100 {\n      Dim Doors(1 to 100)\n      For i=1 to 100\n            For j=i to 100 step i\n                  Doors(j)~\n            Next j\n      Next i\n      DispAll()\n      ' optimization\n      Dim Doors(1 to 100)=False\n      For i=1 to 10\n            Doors(i**2)=True\n      Next i\n      Print\n      DispAll()\n      Sub DispAll()\n            Local i\n            For i=1 to 100\n                  if Doors(i) then print i,\n            Next i\n            Print\n      End Sub\n}\nDoors100",
        "safe": true
    },
    {
        "filename": "100_doors_399.txt",
        "content": "define(`_set', `define(`$1[$2]', `$3')')dnl\ndefine(`_get', `defn(`$1[$2]')')dnl\ndefine(`for',`ifelse($#,0,``$0'',`ifelse(eval($2<=$3),1,\n`pushdef(`$1',$2)$5`'popdef(`$1')$0(`$1',eval($2+$4),$3,$4,`$5')')')')dnl\ndefine(`opposite',`_set(`door',$1,ifelse(_get(`door',$1),`closed',`open',`closed'))')dnl\ndefine(`upper',`100')dnl\nfor(`x',`1',upper,`1',`_set(`door',x,`closed')')dnl\nfor(`x',`1',upper,`1',`for(`y',x,upper,x,`opposite(y)')')dnl\nfor(`x',`1',upper,`1',`door x is _get(`door',x)\n')dnl",
        "safe": true
    },
    {
        "filename": "100_doors_4.txt",
        "content": "@echo off\nset doors=%@repeat[C,100]\ndo step = 1 to 100\n  do door = %step to 100 by %step\n    set doors=%@left[%@eval[%door-1],%doors]%@if[%@instr[%@eval[%door-1],1,%doors]==C,O,C]%@right[%@eval[100-%door],%doors]\n  enddo\nenddo",
        "safe": true
    },
    {
        "filename": "100_doors_40.txt",
        "content": "THE OPEN DOORS ARE:\n     1     4     9    16    25    36    49    64    81   100\n",
        "safe": true
    },
    {
        "filename": "100_doors_400.txt",
        "content": "        .TITLE  DOORS\n        .MCALL  .TTYOUT,.EXIT\nNDOORS  =       ^D100\nDOORS::\n       \u00a0; CLOSE ALL DOORS\n        MOV     #DOORBF+1,R0\nCLOSE:  CLR     (R0)+\n        CMP     R0,#BUFTOP\n        BLT     CLOSE\n\n       \u00a0; VISIT DOORS\n        MOV     #1,R1                  \u00a0; R1 = PASS\nPASS:   MOV     R1,R2                  \u00a0; R2 = DOOR\nDOOR:   COMB    DOORBF(R2)             \u00a0; VISIT DOOR\n        ADD     R1,R2\n        CMP     R2,#NDOORS             \u00a0; NEXT DOOR\n        BLE     DOOR\n        INC     R1\n        CMP     R1,R2                  \u00a0; NEXT PASS\n        BLE     PASS\n\n       \u00a0; DISPLAY DOORS AS ASCII 0 OR 1\n        MOV     #DOORBF+1,R1\nDISP:   MOVB    (R1)+,R0\n        BICB    #^C1,R0\n        BISB    #^D48,R0\n        .TTYOUT\n        CMP     R1,#BUFTOP\n        BLT     DISP\n\n        .EXIT\nDOORBF: .BLKB   NDOORS+1\nBUFTOP  =       .\n        .END    DOORS",
        "safe": true
    },
    {
        "filename": "100_doors_401.txt",
        "content": "1001000010000001000000001000000000010000000000001000000000000001000000000000000010000000000000000001",
        "safe": true
    },
    {
        "filename": "100_doors_402.txt",
        "content": "            NORMAL MODE IS INTEGER\n            DIMENSION OPEN(100)\n            PRINT COMMENT $ $\n           \n          R MAKE SURE ALL DOORS ARE CLOSED AT BEGINNING\n            THROUGH CLOSE, FOR DOOR=1, 1, DOOR.G.100\nCLOSE       OPEN(DOOR) = 0\n\n          R MAKE 100 PASSES\n            THROUGH TOGGLE, FOR PASS=1, 1, PASS.G.100\n            THROUGH TOGGLE, FOR DOOR=PASS, PASS, DOOR.G.100\nTOGGLE      OPEN(DOOR) = 1 - OPEN(DOOR) \n\n          R PRINT THE DOORS THAT ARE OPEN\n            THROUGH SHOW, FOR DOOR=1, 1, DOOR.G.100\nSHOW        WHENEVER OPEN(DOOR).E.1, PRINT FORMAT ISOPEN, DOOR\n           \n            VECTOR VALUES ISOPEN = $5HDOOR ,I3,S1,8HIS OPEN.*$     \n            END OF PROGRAM",
        "safe": true
    },
    {
        "filename": "100_doors_403.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100_doors_404.txt",
        "content": ".DEFAULT_GOAL:=100\ndigit=1 2 3 4 5 6 7 8 9\ndoors:=$(digit) $(foreach i,$(digit),$(foreach j,0 $(digit),$i$j)) 100\n$(doors):;@: $(if $(filter %1 %3 %5 %7 %9,$(words $^)),$(info $@))\n$(foreach i,$(doors),$(eval $i: $(word $i,0 $(doors))))\n0 $(addprefix pass,$(doors)):\npass:=X\ndep=$(eval count+=$(pass))$(eval $(words $(count)):pass$(words $(pass)))\nloop=$(foreach inner,$(doors),$(if $(word 101,$(count)),,$(dep)))\n$(foreach outer,$(doors),$(eval pass+=X)$(eval count:=)$(loop))",
        "safe": true
    },
    {
        "filename": "100_doors_405.txt",
        "content": "NDoors\u00a0:= proc( N\u00a0:: posint )\n        # Initialise, using 0 to represent \"closed\"\n        local pass, door, doors\u00a0:= Array( 1 .. N, 'datatype' = 'integer'[ 1 ] );\n        # Now do N passes\n        for pass from 1 to N do\n                for door from pass by pass while door <= N do\n                        doors[ door ]\u00a0:= 1 - doors[ door ]\n                end do\n        end do;\n        # Output\n        for door from 1 to N do\n                printf( \"Door %d is %s.\\n\", door, `if`( doors[ door ] = 0, \"closed\", \"open\" ) )\n        end do;\n        # Since this is a printing routine, return nothing.\n        NULL\nend proc:",
        "safe": true
    },
    {
        "filename": "100_doors_406.txt",
        "content": "> NDoors( 100 );",
        "safe": true
    },
    {
        "filename": "100_doors_407.txt",
        "content": "> seq( i^2, i = 1 .. isqrt( 100 ) );\n                  1, 4, 9, 16, 25, 36, 49, 64, 81, 100",
        "safe": true
    },
    {
        "filename": "100_doors_408.txt",
        "content": "> [seq]( 1 .. 10 )^~2;\n                 [1, 4, 9, 16, 25, 36, 49, 64, 81, 100]",
        "safe": true
    },
    {
        "filename": "100_doors_409.txt",
        "content": "n=100;\ntmp=ConstantArray[-1,n];\nDo[tmp[[i;;;;i]]*=-1;,{i,n}];\nDo[Print[\"door \",i,\" is \",If[tmp[[i]]==-1,\"closed\",\"open\"]],{i,1,Length[tmp]}]",
        "safe": true
    },
    {
        "filename": "100_doors_41.txt",
        "content": "PROC main()\n  DEF t[100]: ARRAY,\n      pass, door\n  FOR door\u00a0:= 0 TO 99 DO t[door]\u00a0:= FALSE\n  FOR pass\u00a0:= 0 TO 99\n    door\u00a0:= pass\n    WHILE door <= 99\n      t[door]\u00a0:= Not(t[door])\n      door\u00a0:= door + pass + 1\n    ENDWHILE\n  ENDFOR\n  FOR door\u00a0:= 0 TO 99 DO WriteF('\\d is \\s\\n', door+1,\n                                IF t[door] THEN 'open' ELSE 'closed')\nENDPROC",
        "safe": true
    },
    {
        "filename": "100_doors_410.txt",
        "content": "f[n_] = \"Closed\"; \nDo[Do[If[f[n] == \"Closed\", f[n] = \"Open\", f[n] = \"Closed\"], {n, k, 100, k}], {k, 1, 100}]; \nTable[f[n], {n, 1, 100}]",
        "safe": true
    },
    {
        "filename": "100_doors_411.txt",
        "content": "Fold[\n ReplacePart[#1, (i_ /; Mod[i, #2] == 0)\u00a0:> (-#1[[i]])] &,\n ConstantArray[-1, {100}],\n Range[100]\n] /. {1 -> \"Open\", -1 -> \"Closed\"}",
        "safe": true
    },
    {
        "filename": "100_doors_412.txt",
        "content": "Do[Print[\"door \",i,\" is \",If[IntegerQ[Sqrt[i]],\"open\",\"closed\"]],{i,100}]",
        "safe": true
    },
    {
        "filename": "100_doors_413.txt",
        "content": "n=100;\na=Range[1,Sqrt[n]]^2\nDo[Print[\"door \",i,\" is \",If[MemberQ[a,i],\"open\",\"closed\"]],{i,100}]",
        "safe": true
    },
    {
        "filename": "100_doors_414.txt",
        "content": "n=100\nnn=1\na=0\nFor[i=1,i<=n,i++,\n If[i==nn,\n  Print[\"door \",i,\" is open\"];\n  a++;\n  nn+=2a+1;\n ,\n  Print[\"door \",i,\" is closed\"];\n ];\n]",
        "safe": true
    },
    {
        "filename": "100_doors_415.txt",
        "content": "Pick[Range[100], Xor@@@Array[Divisible[#1,#2]&, {100,100}]]",
        "safe": true
    },
    {
        "filename": "100_doors_416.txt",
        "content": "Range[Sqrt[100]]^2",
        "safe": true
    },
    {
        "filename": "100_doors_417.txt",
        "content": "a = false(1,100);\nfor b=1:100\n  for i = b:b:100\n    a(i) = ~a(i);\n  end\nend\na",
        "safe": true
    },
    {
        "filename": "100_doors_418.txt",
        "content": "for x=1:100;\n  if sqrt(x) == floor(sqrt(x))\n    a(i)=1;\n  end\nend\na",
        "safe": true
    },
    {
        "filename": "100_doors_419.txt",
        "content": "doors   = zeros(1,100); // 0: closed 1: open\nfor i = 1:100\n    doors(i:i:100) = 1-doors(i:i:100)\nend\ndoors",
        "safe": true
    },
    {
        "filename": "100_doors_42.txt",
        "content": "doors\u2190{100\u2374((\u2375-1)\u23740),1}\n\u2260\u233f\u2283doors\u00a8 \u2373100\n",
        "safe": true
    },
    {
        "filename": "100_doors_420.txt",
        "content": "a = zeros(100,1);\nfor counter = 1:sqrt(100);\n  a(counter^2) = 1;\nend\na",
        "safe": true
    },
    {
        "filename": "100_doors_421.txt",
        "content": "function [doors,opened,closed] = hundredDoors()\n\n    %Initialize the doors, make them booleans for easy vectorization\n    doors = logical( (1:1:100) );\n    \n    %Go through the flipping process, ignore the 1 case because the doors\n    %array is already initialized to all open\n    for initialPosition = (2:100)\n        doors(initialPosition:initialPosition:100) = not( doors(initialPosition:initialPosition:100) );\n    end\n    \n    opened = find(doors); %Stores the numbers of the open doors\n    closed = find( not(doors) ); %Stores the numbers of the closed doors\n    \nend",
        "safe": true
    },
    {
        "filename": "100_doors_422.txt",
        "content": "doors((1:10).^2) = 1;\n\ndoors",
        "safe": true
    },
    {
        "filename": "100_doors_423.txt",
        "content": "doors(n)\u00a0:= block([v], local(v),\n  v: makelist(true, n),\n  for i: 2 thru n do\n  for j: i step i thru n do v[j]: not v[j],\n  sublist_indices(v, 'identity));",
        "safe": true
    },
    {
        "filename": "100_doors_424.txt",
        "content": "doors(100);\n/* [1, 4, 9, 16, 25, 36, 49, 64, 81, 100] */",
        "safe": true
    },
    {
        "filename": "100_doors_425.txt",
        "content": "doorsOpen = for i in 1 to 100 collect false\n\nfor pass in 1 to 100 do\n(\n    for door in pass to 100 by pass do\n    (\n        doorsOpen[door] = not doorsOpen[door]\n    )\n)\n\nfor i in 1 to doorsOpen.count do\n(\n    format (\"Door\u00a0% is open?:\u00a0%\\n\") i doorsOpen[i]\n)",
        "safe": true
    },
    {
        "filename": "100_doors_426.txt",
        "content": "for i in 1 to 100 do\n(\n    root = pow i 0.5\n    format (\"Door\u00a0% is open?:\u00a0%\\n\") i (root == (root as integer))\n)",
        "safe": true
    },
    {
        "filename": "100_doors_427.txt",
        "content": ":- module doors.\n:- interface.\n:- import_module io.\n:- pred main(io::di, io::uo) is det.\n:- implementation.\n:- import_module bitmap, bool, list, string, int.\n\n:- func doors = bitmap.\ndoors = bitmap.init(100, no).\n\n:- pred walk(int, bitmap, bitmap).\n:- mode walk(in, bitmap_di, bitmap_uo) is det.\nwalk(Pass, !Doors)\u00a0:-\n    walk(Pass, Pass, !Doors).\n\n:- pred walk(int, int, bitmap, bitmap).\n:- mode walk(in, in, bitmap_di, bitmap_uo) is det.\nwalk(At, By, !Doors)\u00a0:-\n    ( if bitmap.in_range(!.Doors, At - 1) then\n        bitmap.unsafe_flip(At - 1, !Doors),\n        walk(At + By, By, !Doors)\n    else\n        true\n    ).\n\n:- pred report(bitmap, int, io, io).\n:- mode report(bitmap_di, in, di, uo) is det.\nreport(Doors, N, !IO)\u00a0:-\n    ( if is_set(Doors, N - 1) then\n        State = \"open\"\n    else\n        State = \"closed\"\n    ),\n    io.format(\"door #%d is %s\\n\",\n        [i(N), s(State)], !IO).\n\nmain(!IO)\u00a0:-\n    list.foldl(walk, 1 .. 100, doors, Doors),\n    list.foldl(report(Doors), 1 .. 100, !IO).",
        "safe": true
    },
    {
        "filename": "100_doors_428.txt",
        "content": "boolean doors[];\nfor i = 1 upto 100: doors[i]\u00a0:= false; endfor\nfor i = 1 upto 100:\n  for j = 1 step i until 100:\n    doors[j]\u00a0:= not doors[j];\n  endfor\nendfor\nfor i = 1 upto 100:\n  message decimal(i) & \" \" & if doors[i]: \"open\" else: \"close\" fi;\nendfor\nend",
        "safe": true
    },
    {
        "filename": "100_doors_429.txt",
        "content": "For offset = 1 To 100\n  For i = 0 To 100 Step offset\n    a[i] = a[i] + 1\n  EndFor\nEndFor\n' Print \"opened\" doors\nFor i = 1 To 100\n  If math.Remainder(a[i], 2) = 1 Then \n    TextWindow.WriteLine(i)\n  EndIf  \nEndFor",
        "safe": true
    },
    {
        "filename": "100_doors_43.txt",
        "content": "2|+/[1]0=D\u2218.|D\u2190\u2373100\n",
        "safe": true
    },
    {
        "filename": "100_doors_430.txt",
        "content": "1\n4\n9\n16\n25\n36\n49\n64\n81\n100\n",
        "safe": true
    },
    {
        "filename": "100_doors_431.txt",
        "content": "d = {}\nfor p in range(1, 100)\n    for t in range(p, 100, p)\n        if d.hasIndex(t) then d.remove t else d.push t\n    end for\nend for\n\nprint d.indexes.sort",
        "safe": true
    },
    {
        "filename": "100_doors_432.txt",
        "content": "[1, 4, 9, 16, 25, 36, 49, 64, 81, 100]",
        "safe": true
    },
    {
        "filename": "100_doors_433.txt",
        "content": "d = [false] * 101\nopen = []\nfor p in range(1, 100)\n    for t in range(p, 100, p)\n        d[t] = not d[t]\n    end for\n    if d[p] then open.push p\nend for\n\nprint open",
        "safe": true
    },
    {
        "filename": "100_doors_434.txt",
        "content": ".data\n  doors:     .space 100\n  num_str:   .asciiz \"Number \"\n  comma_gap: .asciiz \" is \"\n  newline:   .asciiz \"\\n\"\n\n.text\nmain:\n# Clear all the cells to zero\n  li $t1, 100\n  la $t2, doors\nclear_loop:\n  sb $0, ($t2)\n  add $t2, $t2, 1\n  sub $t1, $t1, 1\n  bnez $t1, clear_loop\n\n# Now start the loops\n  li $t0, 1         # This will the the step size\n  li $t4, 1         # just an arbitrary 1\nloop1:\n  move $t1, $t0      # Counter\n  la $t2, doors      # Current pointer\n  add $t2, $t2, $t0\n  addi $t2, $t2, -1\nloop2:\n  lb $t3, ($t2)\n  sub $t3, $t4, $t3\n  sb $t3, ($t2)\n  add $t1, $t1, $t0\n  add $t2, $t2, $t0\n  ble $t1, 100, loop2\n\n  addi $t0, $t0, 1\n  ble $t0, 100, loop1\n\n  # Now display everything\n  la $t0, doors\n  li $t1, 1\nloop3:\n  li $v0, 4\n  la $a0, num_str\n  syscall\n  \n  li $v0, 1\n  move $a0, $t1\n  syscall\n\n  li $v0, 4\n  la $a0, comma_gap\n  syscall\n\n  li $v0, 1\n  lb $a0, ($t0)\n  syscall\n\n  li $v0, 4,\n  la $a0, newline\n  syscall\n\n  addi $t0, $t0, 1\n  addi $t1, $t1, 1\n  bne $t1, 101 loop3",
        "safe": true
    },
    {
        "filename": "100_doors_435.txt",
        "content": "import java.util.ArrayList\n\nclass Door\n\t:state\n\n\tdef initialize\n\t\t@state=false\n\tend\n \n\tdef closed?;\u00a0!@state; end\n\tdef open?; @state; end\n\n\tdef close; @state=false; end\n\tdef open; @state=true; end\n \n\tdef toggle\n\t\tif closed?\n\t\t\topen\n\t\telse\n\t\t\tclose\n\t\tend\n\tend\n \n\tdef toString; Boolean.toString(@state); end\nend\n \ndoors=ArrayList.new\n1.upto(100) do\n    doors.add(Door.new)\nend \n\n1.upto(100) do |multiplier|\n    index = 0\n    doors.each do |door|\n        Door(door).toggle if (index+1)%multiplier == 0\n        index += 1\n    end\nend\n\ni = 0\ndoors.each do |door| \n    puts \"Door #{i+1} is #{door}.\"\n    i+=1\nend",
        "safe": true
    },
    {
        "filename": "100_doors_436.txt",
        "content": "main\u00a0:: [sys_message]\nmain = [Stdout (show (openDoors 100)), \n        Stdout \"\\n\"]    \n\nopenDoors\u00a0:: num->[num]\nopenDoors doors =\n    map snd (filter fst (zip2 (doorStates doors) [1..]))\n\ndoorStates\u00a0:: num->[bool]\ndoorStates doors =\n    take doors (foldr (zipWith (~=)) (repeat False) (map pass [1..doors]))\n\npass\u00a0:: num->[bool]\npass n = tl (concat (repeat (take n (True:repeat False))))\n\nzipWith f x y = map f' (zip2 x y)\n                where f' (x,y) = f x y",
        "safe": true
    },
    {
        "filename": "100_doors_437.txt",
        "content": "[1,4,9,16,25,36,49,64,81,100]",
        "safe": true
    },
    {
        "filename": "100_doors_438.txt",
        "content": "var %d = $str(0 $+ $chr(32),100), %m = 1\nwhile (%m <= 100) {\n  var %n = 1\n  while ($calc(%n * %m) <= 100) {\n    var %d = $puttok(%d,$iif($gettok(%d,$calc(%n * %m),32),0,1),$calc(%n * %m),32)\n    inc %n\n  }\n  inc %m\n}\necho -ag All Doors (Boolean): %d\nvar %n = 1\nwhile (%n <= $findtok(%d,1,0,32)) {\n  var %t = %t $findtok(%d,1,%n,32)\n  inc %n\n}\necho -ag Open Door Numbers: %t",
        "safe": true
    },
    {
        "filename": "100_doors_439.txt",
        "content": "MCSKIP \"WITH\" NL\n\"\" 100 doors\nMCINS\u00a0%.\nMCSKIP MT,<>\n\"\" Doors represented by P1-P100, 0 is closed\nMCPVAR 100\n\"\" Set P variables to 0\nMCDEF ZEROPS WITHS NL AS <MCSET T1=1\n%L1.MCSET PT1=0\nMCSET T1=T1+1\nMCGO L1 UNLESS T1 EN 101\n>\nZEROPS\n\"\" Generate door state\nMCDEF STATE WITHS () AS <MCSET T1=%A1.\nMCGO L1 UNLESS T1 EN 0\nclosed<>MCGO L0\n%L1.open>\n\"\" Main macro - no arguments\n\"\" T1 is pass number\n\"\" T2 is door number\nMCDEF DOORS WITHS NL\nAS <MCSET T1=1\n\"\" pass loop\n%L1.MCGO L4 IF T1 GR 100\n\"\" door loop\nMCSET T2=T1\n%L2.MCGO L3 IF T2 GR 100\nMCSET PT2=1-PT2\nMCSET T2=T2+T1\nMCGO L2\n%L3.MCSET T1=T1+1\nMCGO L1\n%L4.\"\" now output the result\nMCSET T1=1\n%L5.door %T1. is STATE(%PT1.)\nMCSET T1=T1+1\nMCGO L5 UNLESS T1 GR 100\n>\n\"\" Do it\nDOORS",
        "safe": true
    },
    {
        "filename": "100_doors_44.txt",
        "content": "\u2260\u233f0=(\u2373100)\u2218.|\u2373100\n",
        "safe": true
    },
    {
        "filename": "100_doors_440.txt",
        "content": "MODULE Doors;\nIMPORT InOut;\n\nTYPE State = (Closed, Open);\nTYPE List = ARRAY [1 .. 100] OF State;\n\nVAR\n  Doors: List;\n  I, J:  CARDINAL;\n\nBEGIN\n  FOR I\u00a0:= 1 TO 100 DO\n    FOR J\u00a0:= 1 TO 100 DO\n      IF J MOD I = 0 THEN\n        IF Doors[J] = Closed THEN\n          Doors[J]\u00a0:= Open\n        ELSE\n          Doors[J]\u00a0:= Closed\n        END\n      END\n    END\n  END;\n\n  FOR I\u00a0:= 1 TO 100 DO\n    InOut.WriteCard(I, 3);\n    InOut.WriteString(' is ');\n\n    IF Doors[I] = Closed THEN\n      InOut.WriteString('Closed.')\n    ELSE\n      InOut.WriteString('Open.')\n    END;\n\n    InOut.WriteLn\n  END\nEND Doors.",
        "safe": true
    },
    {
        "filename": "100_doors_441.txt",
        "content": "MODULE DoorsOpt;\nIMPORT InOut;\n\nTYPE State = (Closed, Open);\nTYPE List = ARRAY [1 .. 100] OF State;\n\nVAR\n  Doors: List;\n  I:  CARDINAL;\n\nBEGIN\n  FOR I\u00a0:= 1 TO 10 DO\n    Doors[I*I]\u00a0:= Open\n  END;\n\n  FOR I\u00a0:= 1 TO 100 DO\n    InOut.WriteCard(I, 3);\n    InOut.WriteString(' is ');\n    IF Doors[I] = Closed THEN\n      InOut.WriteString('Closed.')\n    ELSE\n      InOut.WriteString('Open.')\n    END;\n    InOut.WriteLn\n  END\nEND DoorsOpt.",
        "safe": true
    },
    {
        "filename": "100_doors_442.txt",
        "content": "MODULE Doors EXPORTS Main;\n\nIMPORT IO, Fmt;\n\nTYPE State = {Closed, Open};\nTYPE List = ARRAY [1..100] OF State;\n\nVAR doors\u00a0:= List{State.Closed, ..};\n\nBEGIN\n  FOR i\u00a0:= 1 TO 100 DO\n    FOR j\u00a0:= FIRST(doors) TO LAST(doors) DO\n      IF j MOD i = 0 THEN\n        IF doors[j] = State.Closed THEN\n          doors[j]\u00a0:= State.Open;\n        ELSE\n          doors[j]\u00a0:= State.Closed;\n        END;\n      END;\n    END;\n  END;\n\n  FOR i\u00a0:= FIRST(doors) TO LAST(doors) DO\n    IO.Put(Fmt.Int(i) & \" is \");\n    IF doors[i] = State.Closed THEN\n      IO.Put(\"Closed.\\n\");\n    ELSE\n      IO.Put(\"Open.\\n\");\n    END;\n  END;\nEND Doors.",
        "safe": true
    },
    {
        "filename": "100_doors_443.txt",
        "content": "MODULE DoorsOpt EXPORTS Main;\n\nIMPORT IO, Fmt;\n\nTYPE State = {Closed, Open};\nTYPE List = ARRAY [1..100] OF State;\n\nVAR doors\u00a0:= List{State.Closed, ..};\n\nBEGIN\n  FOR i\u00a0:= 1 TO 10 DO\n    doors[i * i]\u00a0:= State.Open;\n  END;\n\n  FOR i\u00a0:= FIRST(doors) TO LAST(doors) DO\n    IO.Put(Fmt.Int(i) & \" is \");\n    IF doors[i] = State.Closed THEN\n      IO.Put(\"Closed.\\n\");\n    ELSE\n      IO.Put(\"Open.\\n\");\n    END;\n  END;\nEND DoorsOpt.",
        "safe": true
    },
    {
        "filename": "100_doors_444.txt",
        "content": "101 var l .\n\nfor l 0 endfor\narr\n\n0 var i .\nfor l\n    i 1 + var i var j .\n    j l < var pass .\n    while pass\n        get j not insert j .\n        j i + var j\n        l < var pass .  \n    endwhile\nendfor\nprint /# show all doors #/\n\n/# show only open doors #/\n|| print .\n0 var i .\nfor l\n    get i\n    if\u00a0: i out | | out . . endif .\n    i 1 + var i .\nendfor\n\ninput . /# pause until ENTER key pressed #/",
        "safe": true
    },
    {
        "filename": "100_doors_445.txt",
        "content": "is_open = make(100);\nfor pass in [1..100]\n  for door in [pass..100]\n    if (door\u00a0% pass)\n      continue;\n    endif\n    is_open[door] = !is_open[door];\n  endfor\nendfor\n\n\"output the result\";\nfor door in [1..100]\n  player:tell(\"door #\", door, \" is \", (is_open[door]\u00a0? \"open\"\u00a0: \"closed\"), \".\");\nendfor",
        "safe": true
    },
    {
        "filename": "100_doors_446.txt",
        "content": "is_open = [false for door = 1,100]\n \nfor pass = 1,100 \n    for door = pass,100,pass\n        is_open[door] = not is_open[door]\n  \nfor i,v in ipairs is_open\n    print \"Door #{i}: \" .. if v then 'open' else 'closed'",
        "safe": true
    },
    {
        "filename": "100_doors_447.txt",
        "content": "doors\tnew door,pass\n\tFor door=1:1:100 Set door(door)=0\n\tFor pass=1:1:100 For door=pass:pass:100 Set door(door)='door(door)\n\tFor door=1:1:100 If door(door) Write\u00a0!,\"Door\",$j(door,4),\" is open\"\n\tWrite\u00a0!,\"All other doors are closed.\"\n\tQuit\nDo doors\nDoor   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\nAll other doors are closed.",
        "safe": true
    },
    {
        "filename": "100_doors_448.txt",
        "content": "use std\n\nconst main = {\n\tvar isopen\t: bool[100]\n\n\tstd.slfill(isopen[:], false)\n\tfor var i = 0; i < isopen.len; i++\n\t\tfor var j = i; j < isopen.len; j += i + 1\n\t\t\tisopen[j] = !isopen[j]\n\t\t;;\n\t;;\n\n\tfor var i = 0; i < isopen.len; i++\n\t\tif isopen[i]\n\t\t\tstd.put(\"door {} is open\\n\", i + 1)\n\t\t;;\n\t;;\n}",
        "safe": true
    },
    {
        "filename": "100_doors_449.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_45.txt",
        "content": "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 \n      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 \n      0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1",
        "safe": true
    },
    {
        "filename": "100_doors_450.txt",
        "content": "DROP PROCEDURE IF EXISTS one_hundred_doors;\n\nDELIMITER |\n\nCREATE PROCEDURE one_hundred_doors (n INT)\nBEGIN\n  DROP TEMPORARY TABLE IF EXISTS doors; \n  CREATE TEMPORARY TABLE doors (\n    id INTEGER NOT NULL,\n    open BOOLEAN DEFAULT FALSE,\n    PRIMARY KEY (id)\n  );\n\n  SET @i = 1;\n  create_doors: LOOP\n    INSERT INTO doors (id, open) values (@i, FALSE);\n    SET @i = @i + 1;\n    IF @i > n THEN\n      LEAVE create_doors;\n    END IF;\n  END LOOP create_doors;\n\n  SET @i = 1;\n  toggle_doors: LOOP\n    UPDATE doors SET open = NOT open WHERE MOD(id, @i) = 0;\n    SET @i = @i + 1;\n    IF @i > n THEN\n      LEAVE toggle_doors;\n    END IF;\n  END LOOP toggle_doors;\n\n  SELECT id FROM doors WHERE open;\nEND|\n\nDELIMITER\u00a0;\n\nCALL one_hundred_doors(100);",
        "safe": true
    },
    {
        "filename": "100_doors_451.txt",
        "content": "+-----+\n| id  |\n+-----+\n|   1 |\n|   4 |\n|   9 |\n|  16 |\n|  25 |\n|  36 |\n|  49 |\n|  64 |\n|  81 |\n| 100 |\n+-----+\n10 rows in set (0.02 sec)\n",
        "safe": true
    },
    {
        "filename": "100_doors_452.txt",
        "content": "// allocate a boolean array with all closed doors (false)\n// we need 101 since there will technically be a door 0\ndoors = {false} * 101\n \n// loop through all the step lengths (1-100)\nfor step in range(1, 100)\n\t// loop through all the doors, stepping by step\n\tfor door in range(0, len(doors) - 1, step)\n\t\t// change the state of the current door\n\t\tdoors[door] = !doors[door]\n\tend for\nend for\n \n// loop through and print the doors that are open, skipping door 0\nfor i in range(1, len(doors) - 1)\n\t// if the door is open, display it\n\tif doors[i]\n\t\tprintln \"Door \" + i + \" is open.\"\n\tend if\nend for",
        "safe": true
    },
    {
        "filename": "100_doors_453.txt",
        "content": "/* NetRexx */\noptions replace format comments java crossref symbols binary\n\nTrue  = Rexx(1 == 1)\nFalse = Rexx(\\True)\n\ndoors = False\n\nloop i_ = 1 to 100\n  loop j_ = 1 to 100\n    if 0 = (j_ // i_) then doors[j_] = \\doors[j_]\n    end j_\n  end i_\n\nloop d_ = 1 to 100\n  if doors[d_] then  state = 'open'\n  else  state = 'closed'\n\n  say 'Door Nr.' Rexx(d_).right(4) 'is' state\n  end d_",
        "safe": true
    },
    {
        "filename": "100_doors_454.txt",
        "content": "/* NetRexx */\noptions replace format comments java crossref symbols binary\n\nTrue  = (1 == 1)\nFalse = \\True\n\ndoors = boolean[100]\n\nloop i_ = 0 to 9\n  doors[(i_ + 1) * (i_ + 1) - 1] = True;\n  end i_\n\nloop i_ = 0 to 99\n  if doors[i_] then  state = 'open'\n  else  state = 'closed'\n\n  say 'Door Nr.' Rexx(i_ + 1).right(4) 'is' state\n  end i_",
        "safe": true
    },
    {
        "filename": "100_doors_455.txt",
        "content": "/* NetRexx */\noptions replace format comments java crossref savelog symbols binary\n\nresultstring = ''\n\nloop i_ = 1 to 10\n  resultstring = resultstring || 'Door Nr.' Rexx(i_ * i_).right(4) 'is open\\n'\n  end i_\n\nsay resultstring",
        "safe": true
    },
    {
        "filename": "100_doors_456.txt",
        "content": "/* NetRexx */\n\nloop i = 1 to 10\n   say 'Door Nr.' i * i 'is open.'\n  end i",
        "safe": true
    },
    {
        "filename": "100_doors_457.txt",
        "content": "(define (status door-num)\n    (let ((x (int (sqrt door-num))))\n     (if\n       (= (* x x) door-num) (string \"Door \" door-num \" Open\")\n       (string \"Door \" door-num \" Closed\"))))\n\n(dolist (n (map status (sequence 1 100)))\n  (println n))",
        "safe": true
    },
    {
        "filename": "100_doors_458.txt",
        "content": "(set 'Doors (array 100)) \u00a0;; Default value: nil (Closed)\n\n(for (x 0 99)\n    (for (y x 99 (+ 1 x))\n        (setf (Doors y) (not (Doors y)))))\n\n(for (x 0 99) \u00a0;; Display open doors\n    (if (Doors x)\n        (println (+ x 1) \"\u00a0: Open\")))",
        "safe": true
    },
    {
        "filename": "100_doors_459.txt",
        "content": "1\u00a0: Open\n4\u00a0: Open\n9\u00a0: Open\n16\u00a0: Open\n25\u00a0: Open\n36\u00a0: Open\n49\u00a0: Open\n64\u00a0: Open\n81\u00a0: Open\n100\u00a0: Open\n",
        "safe": true
    },
    {
        "filename": "100_doors_46.txt",
        "content": "\u2378\u2260\u233f0=(\u2373100)\u2218.|\u2373100\n",
        "safe": true
    },
    {
        "filename": "100_doors_460.txt",
        "content": "     n:=100;reduce xor (count n eachright mod count n eachall<1)\nlooloooolooooooloooooooolooooooooooloooooooooooolooooooooooooooloooooooooooooooo\n\nlooooooooooooooooool",
        "safe": true
    },
    {
        "filename": "100_doors_461.txt",
        "content": "     true findall (n:=100;reduce xor (count n eachright mod count n eachall<1))+1\n1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100_doors_462.txt",
        "content": "     count 10 power 2\n1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100_doors_463.txt",
        "content": "from strutils import `%`\n\nconst numDoors = 100\nvar doors: array[1..numDoors, bool]\n\nfor pass in 1..numDoors:\n  for door in countup(pass, numDoors, pass):\n    doors[door] = not doors[door]\n\nfor door in 1..numDoors:\n  echo \"Door $1 is $2.\"\u00a0% [$door, if doors[door]: \"open\" else: \"closed\"]",
        "safe": true
    },
    {
        "filename": "100_doors_464.txt",
        "content": "from strutils import `%`\n\nconst numDoors = 100\nvar doors {.compileTime.}: array[1..numDoors, bool]\n\nproc calcDoors(): string =\n  for pass in 1..numDoors:\n    for door in countup(pass, numDoors, pass):\n      doors[door] = not doors[door] \n  for door in 1..numDoors:\n    result.add(\"Door $1 is $2.\\n\"\u00a0% [$door, if doors[door]: \"open\" else: \"closed\"])\n\nconst outputString: string = calcDoors()\n\necho outputString",
        "safe": true
    },
    {
        "filename": "100_doors_465.txt",
        "content": "MODULE Doors;\n  IMPORT Out;\n  \n  PROCEDURE Do*;  (* In Oberon an asterisk after an identifier is an export mark *)\n    CONST N = 100; len = N + 1;\n    VAR i, j: INTEGER;\n      closed: ARRAY len OF BOOLEAN;  (* Arrays in Oberon always start with index 0; closed[0] is not used *)\n  BEGIN\n    FOR i\u00a0:= 1 TO N DO closed[i]\u00a0:= TRUE END;\n    FOR i\u00a0:= 1 TO N DO\n      j\u00a0:= 1;\n      WHILE j < len DO\n        IF j MOD i = 0 THEN closed[j]\u00a0:= ~closed[j] END; INC(j)  (* ~ = NOT *)\n      END\n    END;\n    (* Print a state diagram of all doors *)\n    FOR i\u00a0:= 1 TO N DO \n      IF (i - 1) MOD 10 = 0 THEN Out.Ln END;\n      IF closed[i] THEN Out.String(\"- \") ELSE Out.String(\"+ \") END\n    END;  Out.Ln;\n    (* Print the numbers of the open doors *)\n    FOR i\u00a0:= 1 TO N DO \n      IF ~closed[i] THEN Out.Int(i, 0); Out.Char(\" \") END\n    END;  Out.Ln\n  END Do;\n\nEND Doors.\n",
        "safe": true
    },
    {
        "filename": "100_doors_466.txt",
        "content": "+ \u2013 \u2013 + \u2013 \u2013 \u2013 \u2013 + \u2013 \n\u2013 \u2013 \u2013 \u2013 \u2013 + \u2013 \u2013 \u2013 \u2013 \n\u2013 \u2013 \u2013 \u2013 + \u2013 \u2013 \u2013 \u2013 \u2013 \n\u2013 \u2013 \u2013 \u2013 \u2013 + \u2013 \u2013 \u2013 \u2013 \n\u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 + \u2013 \n\u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \n\u2013 \u2013 \u2013 + \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \n\u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \n+ \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \n\u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 \u2013 + \n1 4 9 16 25 36 49 64 81 100 \n",
        "safe": true
    },
    {
        "filename": "100_doors_467.txt",
        "content": "bundle Default {\n  class Doors {\n    function\u00a0: Main(args\u00a0: String[]) ~ Nil {\n      doors\u00a0:= Bool->New[100];\n      \n      for(pass\u00a0:= 0; pass < 10; pass += 1;) {\n        doors[(pass + 1) * (pass + 1) - 1]\u00a0:= true;\n      };\n      \n      for(i\u00a0:= 0; i < 100; i += 1;) {    \n        IO.Console->GetInstance()->Print(\"Door #\")->Print(i + 1)->Print(\" is \");\n        if(doors[i]) {\n          \"open.\"->PrintLine();\n        }\n        else {\n          \"closed.\"->PrintLine();\n        };\n      };\n    }\n  }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_468.txt",
        "content": "@import Foundation;\n\nint main(int argc, const char * argv[]) {\n    @autoreleasepool {\n        \n        // Create a mutable array\n        NSMutableArray *doorArray = [@[] mutableCopy];\n        \n        // Fill the doorArray with 100 closed doors\n        for (NSInteger i = 0; i < 100; ++i) {\n            doorArray[i] = @NO;\n        }\n        \n        // Do the 100 passes\n        for (NSInteger pass = 0; pass < 100; ++pass) {\n            for (NSInteger door = pass; door < 100; door += pass+1) {\n                doorArray[door] = [doorArray[door]  isEqual: @YES]\u00a0? @NO\u00a0: @YES;\n            }\n        }\n        \n        // Print the results\n        [doorArray enumerateObjectsUsingBlock:^(id obj, NSUInteger idx, BOOL *stop) {\n            if ([obj isEqual: @YES]) {\n                NSLog(@\"Door number %lu is open\", idx + 1);\n            }\n        }];\n    }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_469.txt",
        "content": "@import Foundation;\n\n#pragma mark - Classes\n////////////////////////////////////////////////////\n// Model class header - A we are using a category to add a method to MSMutableArray\n@interface NSMutableArray (DoorModelExtension)\n\n- (void)setNumberOfDoors:(NSUInteger)doors;\n\n@end\n\n// Model class implementation\n@implementation NSMutableArray (DoorModelExtension)\n\n- (void)setNumberOfDoors:(NSUInteger)doors {\n    // Fill the doorArray with 100 closed doors\n    for (NSInteger i = 0; i < doors; ++i) {\n        self[i] = @NO;\n    }\n}\n@end\n////////////////////////////////////////////////////\n\n// View class header - A simple class to handle printing our values\n@interface DoorViewClass\u00a0: NSObject\n\n- (void)printResultsOfDoorTask:(NSMutableArray *)doors;\n\n@end\n\n// View class implementation\n@implementation DoorViewClass\n\n- (void)printResultsOfDoorTask:(NSMutableArray *)doors {\n\n    // Print the results, using an enumeration block for easy index tracking\n    [doors enumerateObjectsUsingBlock:^(id obj, NSUInteger idx, BOOL *stop) {\n        if ([obj isEqual: @YES]) {\n            NSLog(@\"Door number %lu is open\", idx + 1);\n        }\n    }];\n}\n\n@end\n////////////////////////////////////////////////////\n\n#pragma mark - main\n// With our classes set we can use them from our controller, in this case main\nint main(int argc, const char * argv[]) {\n    \n    // Init our classes\n    NSMutableArray *doorArray = [NSMutableArray array];\n    DoorViewClass *doorView = [DoorViewClass new];\n    \n    // Use our class category to add the doors\n    [doorArray setNumberOfDoors:100];\n    \n    // Do the 100 passes\n    for (NSUInteger pass = 0; pass < 100; ++pass) {\n        for (NSUInteger door = pass; door < 100; door += pass+1) {\n            doorArray[door] = [doorArray[door]  isEqual: @YES]\u00a0? @NO\u00a0: @YES;\n        }\n    }\n    \n    // Print the results\n    [doorView printResultsOfDoorTask:doorArray];\n   \n}",
        "safe": true
    },
    {
        "filename": "100_doors_47.txt",
        "content": "1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100_doors_470.txt",
        "content": "let max_doors = 100\n\nlet show_doors =\n  Array.iteri (fun i x -> Printf.printf \"Door %d is %s\\n\" (i+1)\n                                        (if x then \"open\" else \"closed\"))\n\nlet flip_doors doors =\n  for i = 1 to max_doors do\n    let rec flip idx =\n      if idx < max_doors then begin\n        doors.(idx) <- not doors.(idx);\n        flip (idx + i)\n      end\n    in flip (i - 1)\n  done;\n  doors\n\nlet () =\n  show_doors (flip_doors (Array.make max_doors false))",
        "safe": true
    },
    {
        "filename": "100_doors_471.txt",
        "content": "let optimised_flip_doors doors =\n  for i = 1 to int_of_float (sqrt (float_of_int max_doors)) do\n    doors.(i*i - 1) <- true\n  done;\n  doors\n\nlet () =\n  show_doors (optimised_flip_doors (Array.make max_doors false))",
        "safe": true
    },
    {
        "filename": "100_doors_472.txt",
        "content": "type door = Open | Closed    (* human readable code *)\n\nlet flipdoor = function Open -> Closed | Closed -> Open\n\nlet string_of_door =       \n  function Open -> \"is open.\" | Closed -> \"is closed.\"\n\nlet printdoors ls =\n  let f i d = Printf.printf \"Door %i %s\\n\" (i + 1) (string_of_door d)\n  in List.iteri f ls\n\nlet outerlim = 100\nlet innerlim = 100\n\nlet rec outer cnt accu =\n  let rec inner i door = match i > innerlim with (* define inner loop *)\n    | true  -> door                         \n    | false -> inner (i + 1) (if (cnt mod i) = 0 then flipdoor door else door)\n  in (* define and do outer loop *)\n  match cnt > outerlim with\n  | true  -> List.rev accu\n  | false -> outer  (cnt + 1)  (inner 1 Closed\u00a0:: accu) (* generate new entries with inner *)\n\nlet () = printdoors (outer 1 [])",
        "safe": true
    },
    {
        "filename": "100_doors_473.txt",
        "content": "doors = false(100,1);\nfor i = 1:100\n  for j = i:i:100\n    doors(j) = !doors(j);\n  endfor\nendfor\nfor i = 1:100\n  if ( doors(i) )\n    s = \"open\";\n  else\n    s = \"closed\";\n  endif\n  printf(\"%d %s\\n\", i, s);\nendfor",
        "safe": true
    },
    {
        "filename": "100_doors_474.txt",
        "content": "package main\n\nimport \"core:fmt\"\n\nmain\u00a0:: proc() {\n using fmt\n  \n  Door_State\u00a0:: enum {Closed, Open}\n  \n  doors\u00a0:= [?]Door_State { 0..<100 = .Closed }\n  \n  for i in  1..=100 {\n    for j\u00a0:= i-1; j < 100; j += i {\n      if doors[j] == .Closed {\n        doors[j] = .Open\n      } else {\n        doors[j] = .Closed\n      }\n    }\n  }\n  for state, i in doors {\n    println(\"Door: \",int(i+1),\" -> \",state)\n  }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_475.txt",
        "content": "package main\n\nimport \"core:fmt\"\nimport \"core:math\"\n\nmain\u00a0:: proc() {\n using fmt\n  \n  Door_State\u00a0:: enum {Closed, Open}\n  \n  doors\u00a0:= [?]Door_State { 0..<100 = .Closed }\n  \n  for i in  1..=100 {\n     res\u00a0:= math.sqrt_f64( f64(i) )\n     if math.mod_f64( res, 1) == 0 {\n        doors[i-1] = .Open\n     } else {\n        doors[i-1] = .Closed\n     }\n     println(\"Door: \", i, \" -> \", doors[i-1])\n  }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_476.txt",
        "content": ": doors\n| i j l |\n   100 false Array newWith dup ->l\n   100 loop: i [ \n      i 100 i step: j [ l put ( j , j l at not ) ] \n      ] \n;",
        "safe": true
    },
    {
        "filename": "100_doors_477.txt",
        "content": "(define (flip doors every)\n   (map (lambda (door num)\n            (mod (+ door (if (eq? (mod num every) 0) 1 0)) 2))\n      doors\n      (iota (length doors) 1)))\n\n(define doors\n   (let loop ((doors (repeat 0 100)) (n 1))\n      (if (eq? n 100)\n         doors\n         (loop (flip doors n) (+ n 1)))))\n\n(print \"100th doors: \" doors)",
        "safe": true
    },
    {
        "filename": "100_doors_478.txt",
        "content": "100th doors: (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 0)\n",
        "safe": true
    },
    {
        "filename": "100_doors_479.txt",
        "content": "process\n  local switch doors size 100\u00a0; all initialised ('1st pass' to false)\n\n  repeat over doors\n    repeat for integer door from #item to 100 by #item\n      do when doors[door] = false\n        activate doors[door]\u00a0; illustrating alternative to set ... to\n      else\n        set doors[door] to false\n      done\n    again\n  again\n\n  repeat over doors\n    do when doors = true\n      put #error '%d(#item)%n'\n    done\n  again",
        "safe": true
    },
    {
        "filename": "100_doors_48.txt",
        "content": "set is_open to {}\nrepeat 100 times\n   set end of is_open to false\nend\nrepeat with pass from 1 to 100\n  repeat with door from pass to 100 by pass\n    set item door of is_open to not item door of is_open\n  end\nend\nset open_doors to {}\nrepeat with door from 1 to 100\n   if item door of is_open then\n     set end of open_doors to door\n   end\nend\nset text item delimiters to \", \"\ndisplay dialog \"Open doors: \" & open_doors\n",
        "safe": true
    },
    {
        "filename": "100_doors_480.txt",
        "content": "1\n4\n9\n16\n25\n36\n49\n64\n81\n100\n",
        "safe": true
    },
    {
        "filename": "100_doors_481.txt",
        "content": "process\n  local integer door initial {1}\n  local integer step initial {3}\n\n  repeat\n    output \"Door %d(door) is open%n\"\n    increment door by step\n    increment step by 2\n    exit when door > 100\n  again",
        "safe": true
    },
    {
        "filename": "100_doors_482.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_483.txt",
        "content": "$Door dict def\n1 1 100 {Door exch false put} for\n$Toggle {dup Door exch get not Door up put} def\n$EveryNthDoor {dup 100 {Toggle} for} def\n$Run {1 1 100 {EveryNthDoor} for} def\n$ShowDoor {dup `Door no. ' exch cvs cat ` is ' cat\n  exch Door exch get {`open.\\n'}{`shut.\\n'} ifelse cat\n  print flush} def\nRun 1 1 100 {ShowDoor} for",
        "safe": true
    },
    {
        "filename": "100_doors_484.txt",
        "content": "Door no. 1 is open.\nDoor no. 2 is shut.\nDoor no. 3 is shut.\nDoor no. 4 is open.\nDoor no. 5 is shut.\nDoor no. 6 is shut.\nDoor no. 7 is shut.\nDoor no. 8 is shut.\nDoor no. 9 is open.\nDoor no. 10 is shut.\nDoor no. 11 is shut.\nDoor no. 12 is shut.\nDoor no. 13 is shut.\nDoor no. 14 is shut.\nDoor no. 15 is shut.\nDoor no. 16 is open.\nDoor no. 17 is shut.\nDoor no. 18 is shut.\nDoor no. 19 is shut.\nDoor no. 20 is shut.\nDoor no. 21 is shut.\nDoor no. 22 is shut.\nDoor no. 23 is shut.\nDoor no. 24 is shut.\nDoor no. 25 is open.\nDoor no. 26 is shut.\nDoor no. 27 is shut.\nDoor no. 28 is shut.\nDoor no. 29 is shut.\nDoor no. 30 is shut.\nDoor no. 31 is shut.\nDoor no. 32 is shut.\nDoor no. 33 is shut.\nDoor no. 34 is shut.\nDoor no. 35 is shut.\nDoor no. 36 is open.\nDoor no. 37 is shut.\nDoor no. 38 is shut.\nDoor no. 39 is shut.\nDoor no. 40 is shut.\nDoor no. 41 is shut.\nDoor no. 42 is shut.\nDoor no. 43 is shut.\nDoor no. 44 is shut.\nDoor no. 45 is shut.\nDoor no. 46 is shut.\nDoor no. 47 is shut.\nDoor no. 48 is shut.\nDoor no. 49 is open.\nDoor no. 50 is shut.\nDoor no. 51 is shut.\nDoor no. 52 is shut.\nDoor no. 53 is shut.\nDoor no. 54 is shut.\nDoor no. 55 is shut.\nDoor no. 56 is shut.\nDoor no. 57 is shut.\nDoor no. 58 is shut.\nDoor no. 59 is shut.\nDoor no. 60 is shut.\nDoor no. 61 is shut.\nDoor no. 62 is shut.\nDoor no. 63 is shut.\nDoor no. 64 is open.\nDoor no. 65 is shut.\nDoor no. 66 is shut.\nDoor no. 67 is shut.\nDoor no. 68 is shut.\nDoor no. 69 is shut.\nDoor no. 70 is shut.\nDoor no. 71 is shut.\nDoor no. 72 is shut.\nDoor no. 73 is shut.\nDoor no. 74 is shut.\nDoor no. 75 is shut.\nDoor no. 76 is shut.\nDoor no. 77 is shut.\nDoor no. 78 is shut.\nDoor no. 79 is shut.\nDoor no. 80 is shut.\nDoor no. 81 is open.\nDoor no. 82 is shut.\nDoor no. 83 is shut.\nDoor no. 84 is shut.\nDoor no. 85 is shut.\nDoor no. 86 is shut.\nDoor no. 87 is shut.\nDoor no. 88 is shut.\nDoor no. 89 is shut.\nDoor no. 90 is shut.\nDoor no. 91 is shut.\nDoor no. 92 is shut.\nDoor no. 93 is shut.\nDoor no. 94 is shut.\nDoor no. 95 is shut.\nDoor no. 96 is shut.\nDoor no. 97 is shut.\nDoor no. 98 is shut.\nDoor no. 99 is shut.\nDoor no. 100 is open.",
        "safe": true
    },
    {
        "filename": "100_doors_485.txt",
        "content": "doors = .array~new(100)    -- array containing all of the doors\ndo i = 1 to doors~size     -- initialize with a collection of closed doors\n   doors[i] = .door~new(i)\nend\n\ndo inc = 1 to doors~size\n  do d = inc to doors~size by inc\n    doors[d]~toggle\n  end\nend\nsay \"The open doors after 100 passes:\"\ndo door over doors\n  if door~isopen then say door\nend\n\n::class door           -- simple class to represent a door\n::method init          -- initialize an instance of a door\n  expose id state      -- instance variables of a door\n  use strict arg id    -- set the id\n  state = .false       -- initial state is closed\n\n::method toggle        -- toggle the state of the door\n  expose state\n  state = \\state\n\n::method isopen        -- test if the door is open\n  expose state\n  return state\n\n::method string        -- return a string value for a door\n  expose state id\n  if state then return \"Door\" id \"is open\"\n  else return \"Door\" id \"is closed\"\n\n::method state         -- return door state as a descriptive string\n  expose state\n  if state then return \"open\"\n  else return \"closed\"",
        "safe": true
    },
    {
        "filename": "100_doors_486.txt",
        "content": "DEFINE VARIABLE lopen   AS LOGICAL     NO-UNDO EXTENT 100.\nDEFINE VARIABLE idoor   AS INTEGER     NO-UNDO.\nDEFINE VARIABLE ipass   AS INTEGER     NO-UNDO.\nDEFINE VARIABLE cresult AS CHARACTER   NO-UNDO.\n\nDO ipass = 1 TO 100:\n   idoor = 0.\n   DO WHILE idoor <= 100:\n      idoor = idoor + ipass.\n      IF idoor <= 100 THEN\n         lopen[ idoor ] = NOT lopen[ idoor ].\n   END.\nEND.\n\nDO idoor = 1 TO 100:\n   cresult = cresult + STRING( lopen[ idoor ], \"1  /0  \" ).\n   IF idoor MODULO 10 = 0 THEN\n      cresult = cresult + \"~r\":U.\nEND.\n\nMESSAGE cresult VIEW-AS ALERT-BOX.",
        "safe": true
    },
    {
        "filename": "100_doors_487.txt",
        "content": "def    doors 100\nint    door[doors],i ,j, c\nstring cr,tab,pr\n'\nfor i=1 to doors\n  for j=i to doors step i\n    door[j]=1-door[j]\n    if door[j] then c++ else c--\n  next\nnext\n'\ncr=chr(13) chr(10)\npr=\"Doors Open: \" c cr cr \n'\nfor i=1 to doors\n   if door[i] then pr+=i cr\nnext\nprint pr\n",
        "safe": true
    },
    {
        "filename": "100_doors_488.txt",
        "content": "declare\n  NumDoors = 100\n  NumPasses = 100\n\n  fun {NewDoor} closed end\n\n  fun {Toggle Door}\n     case Door of closed then open\n     [] open then closed\n     end\n  end\n\n  fun {Pass Doors I}\n     {List.mapInd Doors\n      fun {$ Index Door}\n         if Index mod I == 0 then {Toggle Door}\n         else Door\n         end\n      end}\n  end\n  \n  Doors0 = {MakeList NumDoors}\n  {ForAll Doors0 NewDoor}\n\n  DoorsN = {FoldL {List.number 1 NumPasses 1} Pass Doors0}\nin\n \u00a0%% print open doors\n  {List.forAllInd DoorsN\n   proc {$ Index Door}\n      if Door == open then\n\t {System.showInfo \"Door \"#Index#\" is open.\"}\n      end\n   end\n  }",
        "safe": true
    },
    {
        "filename": "100_doors_489.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_49.txt",
        "content": "on _100doors()\n    script o\n        property doors : {}\n    end script\n    repeat 100 times\n        set end of o's doors to false -- false = \"not open\".\n    end repeat\n    repeat with pass from 1 to 100\n        if (not item pass of o's doors) then set item pass of o's doors to pass\n        repeat with d from (pass + pass) to 100 by pass\n            set item d of o's doors to (not item d of o's doors)\n        end repeat\n    end repeat\n    \n    return o's doors's integers\nend _100doors\n\non join(lst, delim)\n    set astid to AppleScript's text item delimiters\n    set AppleScript's text item delimiters to delim\n    set txt to lst as text\n    set AppleScript's text item delimiters to astid\n    return txt\nend join\n\nreturn \"Open doors:\n\" & join(_100doors(), \", \")\n",
        "safe": true
    },
    {
        "filename": "100_doors_490.txt",
        "content": "v=vector(d=100);/*set 100 closed doors*/\nfor(i=1,d,forstep(j=i,d,i,v[j]=1-v[j]));\nfor(i=1,d,if(v[i],print(\"Door \",i,\" is open.\")))",
        "safe": true
    },
    {
        "filename": "100_doors_491.txt",
        "content": "for(n=1,sqrt(100),print(\"Door \",n^2,\" is open.\"))",
        "safe": true
    },
    {
        "filename": "100_doors_492.txt",
        "content": "doors =vector(100);\nprint(\"open doors are\u00a0: \");\nfor(i=1,100,for(j=i,100,doors[j]=!doors[j];j +=i-1))\nfor(k=1,100,if(doors[k]==1,print1(\" \",k)))",
        "safe": true
    },
    {
        "filename": "100_doors_493.txt",
        "content": "Open doors are:\n 1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100_doors_494.txt",
        "content": "Program OneHundredDoors;\n\nvar\n   doors\u00a0: Array[1..100] of Boolean;\n   i, j\t\u00a0: Integer;\n   \nbegin\n   for i\u00a0:= 1 to 100 do\n      doors[i]\u00a0:= False;\n   for i\u00a0:= 1 to 100 do begin\n      j\u00a0:= i;\n      while j <= 100 do begin\n\t doors[j]\u00a0:= not doors[j];\n\t j\u00a0:= j + i\n      end\n   end;\n   for i\u00a0:= 1 to 100 do begin\n      Write(i, ' ');\n      if doors[i] then\n\t WriteLn('open')\n      else\n\t WriteLn('closed');\n   end\nend.",
        "safe": true
    },
    {
        "filename": "100_doors_495.txt",
        "content": "program OneHundredDoors;\n\n{$APPTYPE CONSOLE}\n\nuses\n  math, sysutils;\n\nvar\n   AOpendoors \u00a0: String;\n   ACloseDoors\u00a0: String;\n   i\t      \u00a0: Integer;\n\nbegin\n   for i\u00a0:= 1 to 100 do\n   begin\n      if (sqrt(i) = floor(sqrt(i))) then\n        AOpenDoors\u00a0:= AOpenDoors + IntToStr(i) + ';'\n      else\n        ACloseDoors\u00a0:= ACloseDoors + IntToStr(i) +';';\n   end;\n\n   WriteLn('Open doors: ' + AOpenDoors);\n   WriteLn('Close doors: ' + ACloseDoors);\nend.",
        "safe": true
    },
    {
        "filename": "100_doors_496.txt",
        "content": "1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100_doors_497.txt",
        "content": ";100 doors example program for x86 DOS\n;Compiles with Pebble to 95 bytes com executable\n\nprogram examples\\100doors\n\ndata\n\n\tint i[0]\n\tint d[0]\n\nbegin\n\n\tlabel loop\n\n\t\t+1 [i]\n\t\t[d] = [i] * [i]\n\t\techo [d]\n\t\tcrlf\n\n\tif [d] < 100 then loop\n\n\tpause\n\tkill\n\nend",
        "safe": true
    },
    {
        "filename": "100_doors_498.txt",
        "content": "my @doors;\nfor my $pass (1 .. 100) {\n    for (1 .. 100) {\n        if (0 == $_\u00a0% $pass) {\n            $doors[$_] = not $doors[$_];\n        };\n    };\n};\n\nprint \"Door $_ is \", $doors[$_]\u00a0? \"open\"\u00a0: \"closed\", \"\\n\" for 1 .. 100;",
        "safe": true
    },
    {
        "filename": "100_doors_499.txt",
        "content": "#!/usr/bin/perl\nuse strict;\nuse warnings;\n\nmy @doors = (1) x 100;\nfor my $N (1 .. 100) {\n   $doors[$_]=1-$doors[$_] for map { $_*$N - 1 } 1 .. int(100/$N);\n}\nprint join(\"\\n\", map { \"Door $_ is Open\" } grep {\u00a0! $doors[$_-1] } 1 .. 100), \"\\n\";\nprint \"The rest are closed\\n\";",
        "safe": true
    },
    {
        "filename": "100_doors_5.txt",
        "content": "%@left[n,string]                      ^: Return n leftmost chars in string\n%@right[n,string]                     ^: Return n rightmost chars in string\n%@if[condition,true-val,false-val]    ^: Evaluate condition; return true-val if true, false-val if false\n",
        "safe": true
    },
    {
        "filename": "100_doors_50.txt",
        "content": "\"Open doors:\n1, 4, 9, 16, 25, 36, 49, 64, 81, 100\"\n",
        "safe": true
    },
    {
        "filename": "100_doors_500.txt",
        "content": "print \"Door $_ is open\\n\" for map $_**2, 1 .. 10;",
        "safe": true
    },
    {
        "filename": "100_doors_501.txt",
        "content": "print \"Door $_ is \", qw\"closed open\"[int sqrt == sqrt], \"\\n\" for 1..100;",
        "safe": true
    },
    {
        "filename": "100_doors_502.txt",
        "content": "while( ++$i <= 100 )\n{\n    $root = sqrt($i);\n    if ( int( $root ) == $root )\n    {\n        print \"Door $i is open\\n\";\n    }\n    else\n    {\n        print \"Door $i is closed\\n\";\n    }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_503.txt",
        "content": "use perl5i::2;\n\npackage doors {\n\n  use perl5i::2;\n  use Const::Fast;\n\n  const my $OPEN   => 1;\n  const my $CLOSED => 0;\n\n  # ----------------------------------------\n  # Constructor: door->new( @args );\n  # input: N - how many doors?\n  # returns: door object\n  #\n  method new($class: @args ) {\n    my $self = bless {}, $class;\n    $self->_init( @args );\n    return $self;\n  }\n\n  # ----------------------------------------\n  # class initializer.\n  # input: how many doors?\n  # sets N, creates N+1 doors ( door zero is not used ).\n  #\n  method _init( $N ) {\n    $self->{N} = $N;\n    $self->{doors} = [ ($CLOSED) x ($N+1) ];\n  }\n\n  # ----------------------------------------\n  # $self->toggle( $door_number );\n  # input: number of door to toggle.\n  # OPEN a CLOSED door; CLOSE an OPEN  door.\n  #\n  method toggle( $which ) {\n    $self->{doors}[$which] = ( $self->{doors}[$which] == $OPEN\n                              \u00a0? $CLOSED\n                              \u00a0: $OPEN\n        \t\t     );\n  }\n\n  # ----------------------------------------\n  # $self->toggle_n( $cycle );\n  # input: number.\n  # Toggle doors 0, $cycle, 2 * $cycle, 3 * $cycle, .. $self->{N}\n  #\n  method toggle_n( $n ) {\n    $self->toggle($_)\n      for map { $n * $_ }\n          ( 1 .. int( $self->{N} / $n) );\n\n  }\n\n  # ----------------------------------------\n  # $self->toggle_all();\n  # Toggle every door, then every other door, every third door, ...\n  #\n  method toggle_all() {\n    $self->toggle_n( $_ ) for ( 1 .. $self->{N} );\n  }\n\n\n  # ----------------------------------------\n  # $self->print_open();\n  # Print list of which doors are open.\n  #\n  method print_open() {\n    say join ', ', grep { $self->{doors}[$_] == $OPEN } ( 1 ... $self->{N} );\n  }\n}\n\n# ----------------------------------------------------------------------\n# Main Thread\n#\nmy $doors = doors->new(100);\n$doors->toggle_all();\n$doors->print_open();",
        "safe": true
    },
    {
        "filename": "100_doors_504.txt",
        "content": "sequence doors = repeat(false,100)\n \nfor i=1 to 100 do\n    for j=i to 100 by i do\n        doors[j] = not doors[j]\n    end for\nend for\n \nfor i=1 to 100 do\n    if doors[i] == true then\n        printf(1,\"Door #%d is open.\\n\", i)\n    end if\nend for\n",
        "safe": true
    },
    {
        "filename": "100_doors_505.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_506.txt",
        "content": "function doors(integer n)\n-- returns the perfect squares<=n\ninteger door = 1, step = 1\nsequence res = {}\n    while door<=n do\n        res &= door\n        step += 2\n        door += step\n    end while\n    return res\nend function\n \n?doors(100)\n",
        "safe": true
    },
    {
        "filename": "100_doors_507.txt",
        "content": "{1,4,9,16,25,36,49,64,81,100}\n",
        "safe": true
    },
    {
        "filename": "100_doors_508.txt",
        "content": "101 var l                           \n0 l repeat                      \n\nl for\n    var s\n    s l s 3 tolist\n    for\n        var i\n        i get not i set\n    endfor\nendfor\n\nl for\n    var i\n    i get\n    if\n        i print \" \" print\n    endif\nendfor",
        "safe": true
    },
    {
        "filename": "100_doors_509.txt",
        "content": "100 var n   /# Number of doors #/\n0 n repeat  /# Make the doors #/\n\nn for\n    dup\n    sqrt int\n    dup * over == if 1 swap set else drop endif\nendfor\n\nn for\n    \"The door \" print dup print \" is \" print\n    get if \"OPEN.\" else \"closed.\" endif print nl\nendfor",
        "safe": true
    },
    {
        "filename": "100_doors_51.txt",
        "content": "-- FINAL DOOR STATES ---------------------------------------------------------\n\n-- finalDoors\u00a0:: Int -> [(Int, Bool)]\non finalDoors(n)\n    \n    -- toggledCorridor\u00a0:: [(Int, Bool)] -> (Int, Bool) -> Int -> [(Int, Bool)]\n    script toggledCorridor\n        on |\u03bb|(a, _, k)\n            \n            -- perhapsToggled\u00a0:: Bool -> Int -> Bool\n            script perhapsToggled\n                on |\u03bb|(x, i)\n                    if i mod k = 0 then\n                        {i, not item 2 of x}\n                    else\n                        {i, item 2 of x}\n                    end if\n                end |\u03bb|\n            end script\n            \n            map(perhapsToggled, a)\n        end |\u03bb|\n    end script\n    \n    set xs to enumFromTo(1, n)\n    \n    foldl(toggledCorridor, \u00ac\n        zip(xs, replicate(n, {false})), xs)\nend finalDoors\n\n-- TEST ----------------------------------------------------------------------\non run\n    -- isOpenAtEnd\u00a0:: (Int, Bool) -> Bool\n    script isOpenAtEnd\n        on |\u03bb|(door)\n            (item 2 of door)\n        end |\u03bb|\n    end script\n    \n    -- doorNumber\u00a0:: (Int, Bool) -> Int\n    script doorNumber\n        on |\u03bb|(door)\n            (item 1 of door)\n        end |\u03bb|\n    end script\n    \n    map(doorNumber, filter(isOpenAtEnd, finalDoors(100)))\n    \n    --> {1, 4, 9, 16, 25, 36, 49, 64, 81, 100}\nend run\n\n\n-- GENERIC FUNCTIONS ---------------------------------------------------------\n\n-- enumFromTo\u00a0:: Int -> Int -> [Int]\non enumFromTo(m, n)\n    if n < m then\n        set d to -1\n    else\n        set d to 1\n    end if\n    set lst to {}\n    repeat with i from m to n by d\n        set end of lst to i\n    end repeat\n    return lst\nend enumFromTo\n\n-- filter\u00a0:: (a -> Bool) -> [a] -> [a]\non filter(f, xs)\n    tell mReturn(f)\n        set lst to {}\n        set lng to length of xs\n        repeat with i from 1 to lng\n            set v to item i of xs\n            if |\u03bb|(v, i, xs) then set end of lst to v\n        end repeat\n        return lst\n    end tell\nend filter\n\n-- foldl\u00a0:: (a -> b -> a) -> a -> [b] -> a\non foldl(f, startValue, xs)\n    tell mReturn(f)\n        set v to startValue\n        set lng to length of xs\n        repeat with i from 1 to lng\n            set v to |\u03bb|(v, item i of xs, i, xs)\n        end repeat\n        return v\n    end tell\nend foldl\n\n-- map\u00a0:: (a -> b) -> [a] -> [b]\non map(f, xs)\n    tell mReturn(f)\n        set lng to length of xs\n        set lst to {}\n        repeat with i from 1 to lng\n            set end of lst to |\u03bb|(item i of xs, i, xs)\n        end repeat\n        return lst\n    end tell\nend map\n\n-- min\u00a0:: Ord a => a -> a -> a\non min(x, y)\n    if y < x then\n        y\n    else\n        x\n    end if\nend min\n\n-- Lift 2nd class handler function into 1st class script wrapper \n-- mReturn\u00a0:: Handler -> Script\non mReturn(f)\n    if class of f is script then\n        f\n    else\n        script\n            property |\u03bb| : f\n        end script\n    end if\nend mReturn\n\n-- replicate\u00a0:: Int -> a -> [a]\non replicate(n, a)\n    set out to {}\n    if n < 1 then return out\n    set dbl to {a}\n    \n    repeat while (n > 1)\n        if (n mod 2) > 0 then set out to out & dbl\n        set n to (n div 2)\n        set dbl to (dbl & dbl)\n    end repeat\n    return out & dbl\nend replicate\n\n-- zip\u00a0:: [a] -> [b] -> [(a, b)]\non zip(xs, ys)\n    set lng to min(length of xs, length of ys)\n    set lst to {}\n    repeat with i from 1 to lng\n        set end of lst to {item i of xs, item i of ys}\n    end repeat\n    return lst\nend zip\n",
        "safe": true
    },
    {
        "filename": "100_doors_510.txt",
        "content": "100 sqrt for dup * print \" \" print endfor",
        "safe": true
    },
    {
        "filename": "100_doors_511.txt",
        "content": "module doors;\n\nextern printf;\n\n@Integer main [\n\t@Array<@Boolean> doors = new @Array<@Boolean>.init(100);\n\tvar i = 1;\n\twhile (i <= 100) {\n\t\tvar j = i-1;\n\t\twhile (j < 100) {\n\t\t\tdoors.set(j, doors.get(j)::not);\n\t\t\tj = j + i;\n\t\t}\n\t\ti = i::inc;\n\t}\n\ti = 0;\n\twhile (i < 100) {\n\t\tprintf(\"%i %s\\n\", i+1, iif(doors.get(i), \"open\", \"closed\"));\n\t\ti = i::inc;\n\t}\n\treturn 0;\n]",
        "safe": true
    },
    {
        "filename": "100_doors_512.txt",
        "content": "module var;\n\nextern printf;\n\n@Integer main [\n\tvar door = 1;\n\tvar incrementer = 0;\n\tvar current = 1;\n        while (current <= 100)\n        {\n\t\tprintf(\"Door %i \", current);\n\t\tif (current == door)\n\t\t{\n\t\t\tprintf(\"open\\n\");\n\t\t\tincrementer = incrementer::inc;\n\t\t\tdoor = door + 2 * incrementer + 1;\n\t\t}\n\t\telse\n\t\t\tprintf(\"closed\\n\");\n\t\t\n\t\tcurrent = current + 1;\n            \n        }\n\t\n\treturn 0;\n]",
        "safe": true
    },
    {
        "filename": "100_doors_513.txt",
        "content": "<?php\nfor ($i = 1; $i <= 100; $i++) {\n\t$root = sqrt($i);\n\t$state = ($root == ceil($root))\u00a0? 'open'\u00a0: 'closed';\n\techo \"Door {$i}: {$state}\\n\";\n}\n?>",
        "safe": true
    },
    {
        "filename": "100_doors_514.txt",
        "content": "<?php\n$doors = array_fill(1, 100, false);\nfor ($pass = 1; $pass <= 100; ++$pass) {\n\tfor ($nr = 1; $nr <= 100; ++$nr) {\n\t\tif ($nr\u00a0% $pass == 0) {\n\t\t\t$doors[$nr] =\u00a0!$doors[$nr];\n\t\t}\n\t}\n}\nfor ($nr = 1; $nr <= 100; ++$nr)\n\tprintf(\"Door %d: %s\\n\", $nr, ($doors[$nr])?'open':'closed');\n?>",
        "safe": true
    },
    {
        "filename": "100_doors_515.txt",
        "content": "doors(N) => \n   Doors = new_array(N),\n   foreach(I in 1..N) Doors[I]\u00a0:= 0 end,\n   foreach(I in 1..N)\n     foreach(J in I..I..N)\n        Doors[J]\u00a0:= 1^Doors[J]\n     end,\n     if N <= 10 then\n        print_open(Doors)\n     end\n   end,\n   println(Doors),\n   print_open(Doors),\n   nl.\n\nprint_open(Doors) => println([I\u00a0: I in 1..Doors.length, Doors[I] == 1]).",
        "safe": true
    },
    {
        "filename": "100_doors_516.txt",
        "content": "doors_opt(N) =>\n  foreach(I in 1..N)\n     Root = sqrt(I),\n     println([I, cond(Root == 1.0*round(Root), open, closed)])\n  end,\n  nl.",
        "safe": true
    },
    {
        "filename": "100_doors_517.txt",
        "content": "doors_opt2(N) => \n  println([I**2\u00a0: I in 1..N, I**2 <= N]).",
        "safe": true
    },
    {
        "filename": "100_doors_518.txt",
        "content": "(let Doors (need 100)\n   (for I 100\n      (for (D (nth Doors I)  D  (cdr (nth D I)))\n         (set D (not (car D))) ) )\n   (println Doors) )",
        "safe": true
    },
    {
        "filename": "100_doors_519.txt",
        "content": "(let Doors (need 100)\n   (for I (sqrt 100)\n      (set (nth Doors (* I I)) T) )\n   (println Doors) )",
        "safe": true
    },
    {
        "filename": "100_doors_52.txt",
        "content": "{1, 4, 9, 16, 25, 36, 49, 64, 81, 100}\n",
        "safe": true
    },
    {
        "filename": "100_doors_520.txt",
        "content": "(T NIL NIL T NIL NIL NIL NIL T NIL NIL NIL NIL NIL NIL T NIL NIL NIL NIL NIL NIL\n NIL NIL T NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL T NIL NIL NIL NIL NIL NIL NIL\n NIL NIL NIL NIL NIL T 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 T NIL NIL NIL N\nIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL T)",
        "safe": true
    },
    {
        "filename": "100_doors_521.txt",
        "content": "(let Doors (need 100)\n   (for I (sqrt 100)\n      (set (nth Doors (* I I)) T) )\n   (make\n      (for (N . D) Doors\n         (when D (link N)) ) ) )",
        "safe": true
    },
    {
        "filename": "100_doors_522.txt",
        "content": "(1 4 9 16 25 36 49 64 81 100)",
        "safe": true
    },
    {
        "filename": "100_doors_523.txt",
        "content": "array onehundreddoors()\n{\n    array doors = allocate(100);\n    foreach(doors; int i;)\n        for(int j=i; j<100; j+=i+1)\n            doors[j] = !doors[j];\n    return doors;\n}",
        "safe": true
    },
    {
        "filename": "100_doors_524.txt",
        "content": "array doors = map(enumerate(100,1,1), lambda(int x)\n                                      {  \n                                          return sqrt((float)x)%1 == 0.0; \n                                      });",
        "safe": true
    },
    {
        "filename": "100_doors_525.txt",
        "content": "write(\"%{%d %d %d %d %d %d %d %d %d %d\\n%}\\n\", doors/10)",
        "safe": true
    },
    {
        "filename": "100_doors_526.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_527.txt",
        "content": "declare door(100) bit (1) aligned;\ndeclare closed bit (1) static initial ('0'b),\n        open   bit (1) static initial ('1'b);\ndeclare (i, inc) fixed binary;\n\ndoor = closed;\ninc = 1;\ndo until (inc >= 100);\n   do i = inc to 100 by inc;\n      door(i) = ^door(i); /* close door if open; open it if closed. */\n   end;\n   inc = inc+1;\nend;\n\ndo i = 1 to 100;\n   put skip edit ('Door ', trim(i), ' is ') (a);\n   if door(i) then put edit (' open.') (a);\n   else put edit (' closed.') (a);\nend;",
        "safe": true
    },
    {
        "filename": "100_doors_528.txt",
        "content": "/* Solution to the 100 doors problem in PLI-80 */\n\nhundred_doors:\n  procedure options (main);\n\n    %replace\n      open_door by '1'b,\n      closed_door by '0'b,\n      numdoors by 100;\n\n    dcl\n      doors(1:numdoors) bit(1),\n      (i, j) fixed bin(15);\n\n    /* all doors are initially closed */\n    do i = 1 to numdoors;\n      doors(i) = closed_door;\n    end;\n\n    /* cycle through at increasing intervals and flip doors */\n    do i = 1 to numdoors;\n      j = i;\n      do while (j <= numdoors);\n        doors(j) = ^doors(j);\n        j = j + i;\n      end;\n    end;\n\n    /* show results - open doors should all be perfect squares */\n    put skip list ('The open doors are:');\n    do i = 1 to numdoors;\n      if doors(i) = open_door then\n        put edit (i) (F(4));\n    end;\n\nend hundred_doors;",
        "safe": true
    },
    {
        "filename": "100_doors_529.txt",
        "content": "The open doors are:   1   4   9  16  25  36  49  64  81 100\n",
        "safe": true
    },
    {
        "filename": "100_doors_53.txt",
        "content": "map(factorCountMod2, enumFromTo(1, 100))\n\non factorCountMod2(n)\n    {n, (length of integerFactors(n)) mod 2 = 1}\nend factorCountMod2\n",
        "safe": true
    },
    {
        "filename": "100_doors_530.txt",
        "content": "100H: /* FIND THE FIRST FEW SQUARES VIA THE UNOPTIMISED DOOR FLIPPING METHOD */\n\n    /* BDOS SYSTEM CALL */\n    BDOS: PROCEDURE( FN, ARG );\n        DECLARE FN BYTE, ARG ADDRESS;\n        GO TO 5;\n    END BDOS;\n\n    /* PRINTS A BYTE AS A CHARACTER */\n    PRINT$CHAR: PROCEDURE( CH );\n        DECLARE CH BYTE;\n        CALL BDOS( 2, CH );\n    END PRINT$CHAR;\n\n    /* PRINTS A BYTE AS A NUMBER */\n    PRINT$BYTE: PROCEDURE( N );\n        DECLARE N BYTE;\n        DECLARE ( V, D3, D2 ) BYTE;\n        V  = N;\n        D3 = V MOD 10;\n        IF ( V\u00a0:= V / 10 ) <> 0 THEN DO;\n            D2 = V MOD 10;\n            IF ( V\u00a0:= V / 10 ) <> 0 THEN CALL PRINT$CHAR( '0' + V );\n            CALL PRINT$CHAR( '0' + D2 );\n        END;\n        CALL PRINT$CHAR( '0' + D3 );\n    END PRINT$BYTE;\n\n    DECLARE DOOR$DCL LITERALLY '101';\n    DECLARE FALSE    LITERALLY '0';\n    DECLARE CR       LITERALLY '0DH';\n    DECLARE LF       LITERALLY '0AH';\n\n    /* ARRAY OF DOORS - DOOR( I ) IS TRUE IF OPEN, FALSE IF CLOSED */\n    DECLARE DOOR( DOOR$DCL ) BYTE;\n    DECLARE ( I, J )         BYTE;\n\n    /* SET ALL DOORS TO CLOSED */\n    DO I = 0 TO LAST( DOOR ); DOOR( I ) = FALSE; END;\n    /* REPEATEDLY FLIP THE DOORS */\n    DO I = 1 TO LAST( DOOR );\n       DO J = I TO LAST( DOOR ) BY I;\n          DOOR( J ) = NOT DOOR( J );\n       END;\n    END;\n    /* DISPLAY THE RESULTS */\n    DO I = 1 TO LAST( DOOR );\n       IF DOOR( I ) THEN DO;\n          CALL PRINT$CHAR( ' ' );\n          CALL PRINT$BYTE( I );\n       END;\n    END;\n    CALL PRINT$CHAR( CR );\n    CALL PRINT$CHAR( LF );\nEOF",
        "safe": true
    },
    {
        "filename": "100_doors_531.txt",
        "content": " 1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100_doors_532.txt",
        "content": "DECLARE\n  TYPE doorsarray IS VARRAY(100) OF BOOLEAN;\n  doors doorsarray\u00a0:= doorsarray();\nBEGIN\n\ndoors.EXTEND(100);  --ACCOMMODATE 100 DOORS\n\nFOR i IN 1 .. doors.COUNT  --MAKE ALL 100 DOORS FALSE TO INITIALISE\n  LOOP\n     doors(i)\u00a0:= FALSE;                    \n  END LOOP;\n\nFOR j IN 1 .. 100 --ITERATE THRU USING MOD LOGIC AND FLIP THE DOOR RIGHT OPEN OR CLOSE\n LOOP\n      FOR k IN 1 .. 100\n        LOOP\n                  IF MOD(k,j)=0 THEN \n                     doors(k)\u00a0:= NOT doors(k); \n                  END IF;\n        END LOOP;\n END LOOP;\n \nFOR l IN 1 .. doors.COUNT  --PRINT THE STATUS IF ALL 100 DOORS AFTER ALL ITERATION\n  LOOP\n       DBMS_OUTPUT.PUT_LINE('DOOR '||l||' IS -->> '||CASE WHEN SYS.DBMS_SQLTCB_INTERNAL.I_CONVERT_FROM_BOOLEAN(doors(l)) = 'TRUE' \n                                                                THEN 'OPEN' \n                                                              ELSE 'CLOSED' \n                                                        END);\n  END LOOP;\n\nEND;",
        "safe": true
    },
    {
        "filename": "100_doors_533.txt",
        "content": "To create some doors given a count:\n  Loop.\n    If a counter is past the count, exit.\n    Allocate memory for a door.\n    Clear the door's flag.\n    Append the door to the doors.\n  Repeat.\n\nA flag thing is a thing with a flag.\nA door is a flag thing.\n\nTo go through some doors given a number and some passes:\n  Put 0 into a counter.\n  Loop.\n    Add the number to the counter.\n    If the counter is greater than the passes, exit.\n    Pick a door from the doors given the number.\n    Invert the door's flag.\n  Repeat.\n\nTo output the states of some doors:\n  Loop.\n    Bump a counter.\n    Get a door from the doors.\n    If the door is nil, exit.\n    If the door's flag is set, \n      Write \"Door \" then the counter then \" is open\" to the output; \n      Repeat.\n    Write \"Door \" then the counter then \" is closed\" to the output.\n  Repeat.\n\nTo pass doors given a count and some passes:\n  Create some doors given the count.\n  Loop.\n    If a counter is past the passes, break.\n    Go through the doors given the counter and the passes.\n  Repeat.\n  Output the states of the doors.\n  Destroy the doors.\n\nA pass is a number.\n\nTo pick a door from some doors given a number:\n  Loop.\n    If a counter is past the number, exit.\n    Get the door from the doors.\n    If the door is nil, exit.\n  Repeat.\n\nTo run:\n  Start up.\n  Pass doors given 100 and 100 passes.\n  Wait for the escape key.\n  Shut down.",
        "safe": true
    },
    {
        "filename": "100_doors_534.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_535.txt",
        "content": "output =\n  range(1, 100)\n  |> map(visit(100))\n  |> println\n\n----------------------------------------------------------\n\ntoggle(state) =\n  if state == Closed then Open else Closed\n\n----------------------------------------------------------\n-- Door state on iteration i is recursively\n-- defined in terms of previous door state\n\nvisit(i, index) = cond {\n  case (i == 0) Closed\n  case (index\u00a0% i == 0) toggle(lastState)\n  else lastState\n} where lastState = visit(i - 1, index)",
        "safe": true
    },
    {
        "filename": "100_doors_536.txt",
        "content": "[Open, Closed, Closed, Open, Closed, Closed, Closed, Closed, Open, Closed, Closed, Closed, Closed, Closed, Closed, Open, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Open, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Open, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Open, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Open, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Open, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Closed, Open]",
        "safe": true
    },
    {
        "filename": "100_doors_537.txt",
        "content": "/* FIND THE FIRST FEW SQUARES VIA THE UNOPTIMISED DOOR FLIPPING METHOD */\ndoors_100H: procedure options                                                   (main);\n\n/* PROGRAM-SPECIFIC %REPLACE STATEMENTS MUST APPEAR BEFORE THE %INCLUDE AS */\n/* E.G. THE CP/M PL/I COMPILER DOESN'T LIKE THEM TO FOLLOW PROCEDURES      */\n   /* PL/I                                                                      */\n      %replace dcldoors by         100;\n   /* PL/M */                                                                   /*\n      DECLARE  DCLDOORS LITERALLY '101';\n   /* */\n\n/* PL/I DEFINITIONS                                                             */\n%include 'pg.inc';\n/* PL/M DEFINITIONS: CP/M BDOS SYSTEM CALL AND CONSOLE I/O ROUTINES, ETC. */    /*\n   DECLARE BINARY LITERALLY 'ADDRESS', CHARACTER LITERALLY 'BYTE';\n   DECLARE FIXED  LITERALLY ' ',       BIT       LITERALLY 'BYTE';\n   DECLARE STATIC LITERALLY ' ',       RETURNS   LITERALLY ' ';\n   DECLARE FALSE  LITERALLY '0',       TRUE LITERALLY '1';\n   DECLARE HBOUND LITERALLY 'LAST',    SADDR  LITERALLY '.';\n   BDOSF: PROCEDURE( FN, ARG )BYTE;\n                               DECLARE FN BYTE, ARG ADDRESS; GOTO 5;   END; \n   BDOS: PROCEDURE( FN, ARG ); DECLARE FN BYTE, ARG ADDRESS; GOTO 5;   END;\n   PRCHAR:   PROCEDURE( C );   DECLARE C BYTE;      CALL BDOS( 2, C ); END;\n   PRSTRING: PROCEDURE( S );   DECLARE S ADDRESS;   CALL BDOS( 9, S ); END;\n   PRNL:     PROCEDURE;        CALL PRCHAR( 0DH ); CALL PRCHAR( 0AH ); END;\n   PRNUMBER: PROCEDURE( N );\n      DECLARE N ADDRESS;\n      DECLARE V ADDRESS, N$STR( 6 ) BYTE, W BYTE;\n      N$STR( W\u00a0:= LAST( N$STR ) ) = '$';\n      N$STR( W\u00a0:= W - 1 ) = '0' + ( ( V\u00a0:= N ) MOD 10 );\n      DO WHILE( ( V\u00a0:= V / 10 ) > 0 );\n         N$STR( W\u00a0:= W - 1 ) = '0' + ( V MOD 10 );\n      END; \n      CALL BDOS( 9, .N$STR( W ) );\n   END PRNUMBER;\n   MODF:     PROCEDURE( A, B )ADDRESS;\n      DECLARE ( A, B ) ADDRESS;\n      RETURN A MOD B;\n   END MODF;\n/* END LANGUAGE DEFINITIONS */\n\n   /* TASK */\n\n   /* ARRAY OF DOORS - DOOR( I ) IS TRUE IF OPEN, FALSE IF CLOSED */\n   DECLARE DOOR( DCLDOORS )  BIT;\n   DECLARE ( I, J, MAXDOOR ) FIXED BINARY;\n\n   MAXDOOR = HBOUND( DOOR                                                       ,1\n                   );\n\n   /* SET ALL DOORS TO CLOSED */\n   DO I = 0 TO MAXDOOR; DOOR( I ) = FALSE; END;\n   /* REPEATEDLY FLIP THE DOORS */\n   DO I = 1 TO MAXDOOR;\n      DO J = I TO MAXDOOR BY I;\n         DOOR( J ) = NOT( DOOR( J ) );\n      END;\n   END;\n   /* DISPLAY THE RESULTS */\n   DO I = 1 TO MAXDOOR;\n      IF DOOR( I ) THEN DO;\n         CALL PRCHAR( ' ' );\n         CALL PRNUMBER( I );\n      END;\n   END;\n   CALL PRNL;\n\nEOF: end doors_100H;",
        "safe": true
    },
    {
        "filename": "100_doors_538.txt",
        "content": " 1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100_doors_539.txt",
        "content": "actor Toggler\n    let doors:Array[Bool]\n    let env: Env\n    new create(count:USize,_env:Env) =>\n        var i:USize=0\n        doors=Array[Bool](count)\n        env=_env\n        while doors.size() < count do\n            doors.push(false)\n        end\n    be togglin(interval\u00a0: USize)=>\n        var i:USize=0\n        try\n            while i < doors.size() do\n                doors.update(i,not doors(i)?)?\n                i=i+interval\n            end\n        else\n            env.out.print(\"Errored while togglin'!\")\n        end\n    be printn(onlyOpen:Bool)=>\n        try\n            for i in doors.keys() do\n                if onlyOpen and not doors(i)? then\n                    continue\n                end\n                env.out.print(\"Door \" + i.string() + \" is \" +\n                    if doors(i)? then\n                        \"Open\"\n                    else\n                        \"closed\"\n                    end)\n            end\n        else\n            env.out.print(\"Error!\")\n        end\n        true\n\nactor OptimizedToggler\n    let doors:Array[Bool]\n    let env:Env\n    new create(count:USize,_env:Env)=>\n        env=_env\n        doors=Array[Bool](count)\n        while doors.size()<count do\n            doors.push(false)\n        end\n    be togglin()=>\n        var i:USize=0\n        if alreadydone then\n            return\n        end\n        try\n            doors.update(0,true)?\n            doors.update(1,true)?\n            while i < doors.size() do\n                i=i+1\n                let z=i*i\n                let x=z*z\n                if z > doors.size() then\n                    break\n                else\n                    doors.update(z,true)?\n                end\n                if x < doors.size() then\n                    doors.update(x,true)?\n                end\n            end\n        end\n    be printn(onlyOpen:Bool)=>\n        try\n            for i in doors.keys() do\n                if onlyOpen and not doors(i)? then\n                    continue\n                end\n                env.out.print(\"Door \" + i.string() + \" is \" +\n                    if doors(i)? then\n                        \"Open\"\n                    else\n                        \"closed\"\n                    end)\n            end\n        else\n            env.out.print(\"Error!\")\n        end\n        true\nactor Main\n    new create(env:Env)=>\n        var count: USize =100\n        try\n            let index=env.args.find(\"-n\",0,0,{(l,r)=>l==r})?\n            try\n            match env.args(index+1)?.read_int[USize]()?\n                | (let x:USize, _)=>count=x\n                end\n            else\n                env.out.print(\"You either neglected to provide an argument after -n or that argument was not an integer greater than zero.\")\n                return\n            end\n        end\n        if env.args.contains(\"optimized\",{(l,r)=>r==l}) then\n            let toggler=OptimizedToggler(count,env)\n            var i:USize = 1\n            toggler.togglin()\n            toggler.printn(env.args.contains(\"onlyopen\", {(l,r)=>l==r}))\n        else\n            let toggler=Toggler(count,env)\n            var i:USize = 1\n            while i < count do\n                toggler.togglin(i)\n                i=i+1\n            end\n            toggler.printn(env.args.contains(\"onlyopen\", {(l,r)=>l==r}))\n        end",
        "safe": true
    },
    {
        "filename": "100_doors_54.txt",
        "content": "-- perfectSquaresUpTo\u00a0:: Int -> [Int]\non perfectSquaresUpTo(n)\n    script squared\n        -- (Int -> Int)\n        on |\u03bb|(x)\n            x * x\n        end |\u03bb|\n    end script\n    \n    set realRoot to n ^ (1 / 2)\n    set intRoot to realRoot as integer\n    set blnNotPerfectSquare to not (intRoot = realRoot)\n    \n    map(squared, enumFromTo(1, intRoot - (blnNotPerfectSquare as integer)))\nend perfectSquaresUpTo\n\non run\n    \n    perfectSquaresUpTo(100)\n    \nend run\n",
        "safe": true
    },
    {
        "filename": "100_doors_540.txt",
        "content": "lvars i;\nlvars doors = {% for i from 1 to 100 do false endfor\u00a0%};\nfor i from 1 to 100 do\n   for j from i by i to 100 do\n      not(doors(j)) -> doors(j);\n   endfor;\nendfor;\n;;; Print state\nfor i from 1 to 100 do\n   printf('Door ' >< i >< ' is ' ><\n            if doors(i) then 'open' else 'closed' endif, '%s\\n');\nendfor;",
        "safe": true
    },
    {
        "filename": "100_doors_541.txt",
        "content": "for i to 100 do\n    lvars root = sqrt(i);\n    i; if root = round(root) then ' open' ><; else ' closed' ><; endif; =>\nendfor;",
        "safe": true
    },
    {
        "filename": "100_doors_542.txt",
        "content": "/doors [ 100 { false } repeat ] def\n\n1 1 100 { dup 1 sub exch 99 {\n        dup doors exch get not doors 3 1 roll put\n} for } for\ndoors pstack",
        "safe": true
    },
    {
        "filename": "100_doors_543.txt",
        "content": "[true false false true false false false false true false ...<90 doors later>... true]",
        "safe": true
    },
    {
        "filename": "100_doors_544.txt",
        "content": "square=1, i=3\n1 to 100(door):\n  if (door == square):\n    (\"door\", door, \"is open\") say\n    square += i\n    i += 2.\n.",
        "safe": true
    },
    {
        "filename": "100_doors_545.txt",
        "content": "$doors = @(0..99)\nfor($i=0; $i -lt 100; $i++) {\n  $doors[$i] = 0  # start with all doors closed\n}\nfor($i=0; $i -lt 100; $i++) {\n  $step = $i + 1\n  for($j=$i; $j -lt 100; $j = $j + $step) {\n    $doors[$j] = $doors[$j] -bxor 1\n  }\n}\nforeach($doornum in 1..100) {\n  if($doors[($doornum-1)] -eq $true) {\"$doornum open\"}\n  else {\"$doornum closed\"}\n}",
        "safe": true
    },
    {
        "filename": "100_doors_546.txt",
        "content": "function Get-DoorState($NumberOfDoors)\n{\n   begin \n   {\n      $Doors = @()\n      $Multiple = 1\n   }\n\n   process\n   {\n      for ($i = 1; $i -le $NumberOfDoors; $i++)\n      {\n         $Door = [pscustomobject]@{\n                    Name = $i\n                    Open = $false\n                 }\n\n         $Doors += $Door   \n      }\n\n      While ($Multiple -le $NumberOfDoors)\n      {\n\t Foreach ($Door in $Doors)\n\t {\n\t    if ($Door.name\u00a0% $Multiple -eq 0)\n               {\n\t          If ($Door.open -eq $False){$Door.open = $True}\n\t          Else {$Door.open = $False}\n\t       }\n\t }\n\t\t\t\n         $Multiple++\n      }\n    }\n\n    end {$Doors}\n}",
        "safe": true
    },
    {
        "filename": "100_doors_547.txt",
        "content": "$doors = 1..100 | ForEach-Object {0}\n1..100 | ForEach-Object { $a=$_;1..100 | Where-Object { -not ( $_\u00a0% $a )  } | ForEach-Object { $doors[$_-1] = $doors[$_-1] -bxor 1 }; if ( $doors[$a-1] ) { \"door opened\" } else { \"door closed\" } }",
        "safe": true
    },
    {
        "filename": "100_doors_548.txt",
        "content": "$doors = 1..100 | ForEach-Object {0}\n$visited = 1..100\n1..100 | ForEach-Object { $a=$_;$visited[0..([math]::floor(100/$a)-1)] | Where-Object { -not ( $_\u00a0% $a )  } | ForEach-Object { $doors[$_-1] = $doors[$_-1] -bxor 1;$visited[$_/$a-1]+=($_/$a) }; if ( $doors[$a-1] ) { \"door opened\" } else { \"door closed\" } }",
        "safe": true
    },
    {
        "filename": "100_doors_549.txt",
        "content": "1..100|foreach-object {$pipe += \"toggle $_ |\"} -begin {$pipe=\"\"}\nfilter toggle($pass) {$_.door = $_.door -xor\u00a0!($_.index\u00a0% $pass);$_}\ninvoke-expression \"1..100| foreach-object {@{index=`$_;door=`$false}} | $pipe  out-host\"",
        "safe": true
    },
    {
        "filename": "100_doors_55.txt",
        "content": "{1, 4, 9, 16, 25, 36, 49, 64, 81, 100}\n",
        "safe": true
    },
    {
        "filename": "100_doors_550.txt",
        "content": "Workflow Calc-Doors {\n    Foreach \u2013parallel ($number in 1..100) {\n        \"Door \" + $number.ToString(\"0000\") + \": \" + @{$true=\"Closed\";$false=\"Open\"}[([Math]::pow($number, 0.5)%1) -ne 0]\n    }\n}\nCalc-Doors | sort",
        "safe": true
    },
    {
        "filename": "100_doors_551.txt",
        "content": "1..10|%{\"Door \"+ $_*$_ + \" is open\"}",
        "safe": true
    },
    {
        "filename": "100_doors_552.txt",
        "content": "boolean[] doors = new boolean[100];\n\nvoid setup() {\n  for (int i = 0; i < 100; i++) {\n    doors[i] = false;\n  }\n  for (int i = 1; i < 100; i++) {\n    for (int j = 0; j < 100; j += i) {\n      doors[j] = !doors[j];\n    }\n  }\n  println(\"Open:\");\n  for (int i = 1; i < 100; i++) {\n    if (doors[i]) {\n      println(i);\n    }\n  }\n  exit();\n}",
        "safe": true
    },
    {
        "filename": "100_doors_553.txt",
        "content": "Open:\n1\n4\n9\n16\n25\n36\n49\n64\n81",
        "safe": true
    },
    {
        "filename": "100_doors_554.txt",
        "content": "setup <- function() {\n  for(door in doors(100, 100)) {\n    stdout$print(paste(door, \"\"))\n  }\n}\n\ndoors <- function(ndoors=100,passes=100) {\n  doors <- rep(FALSE,ndoors)\n  for (ii in seq(1,passes)) {\n      mask <- seq(0,ndoors,ii)\n      doors[mask] <- !doors[mask]  \n  }\n  return (which(doors == TRUE))\n}",
        "safe": true
    },
    {
        "filename": "100_doors_555.txt",
        "content": "1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100_doors_556.txt",
        "content": "enableextensions \nenabledelayedexpansion\neditvar /newvar /value=0 /title=closed\neditvar /newvar /value=1 /title=open\neditvar /newvar /range=1-100 /increment=1 /from=2\neditvar /newvar /value=2 /title=next\n:doors\nfor /alloccurrences (!next!-!102!) do editvar /modify /value=-open-\neditvar /modify /value=-next-=+1\nif -next- /hasvalue=100 goto :cont else goto :doors\n:cont\nprintline !1!-!102!\nstoptask",
        "safe": true
    },
    {
        "filename": "100_doors_557.txt",
        "content": "main\u00a0:-\n    forall(between(1,100,Door), ignore(display(Door))).\n\n% show output if door is open after the 100th pass\ndisplay(Door)\u00a0:-\n    status(Door, 100, open),\n    format(\"Door ~d is open~n\", [Door]).\n\n% true if Door has Status after Pass is done\nstatus(Door, Pass, Status)\u00a0:-\n    Pass > 0,\n    Remainder is Door mod Pass,\n    toggle(Remainder, OldStatus, Status),\n    OldPass is Pass - 1,\n    status(Door, OldPass, OldStatus).\nstatus(_Door, 0, closed).\n\ntoggle(Remainder, Status, Status)\u00a0:-\n    Remainder > 0.\ntoggle(0, open, closed).\ntoggle(0, closed, open).",
        "safe": true
    },
    {
        "filename": "100_doors_558.txt",
        "content": "doors_unoptimized(N)\u00a0:-\n\tlength(L, N),\n\tmaplist(init, L),\n\tdoors(N, N, L, L1),\n\taffiche(N, L1).\n\ninit(close).\n\ndoors(Max, 1, L, L1)\u00a0:-\n\t!,\n       inverse(1, 1, Max, L, L1).\n\ndoors(Max, N, L, L1)\u00a0:-\n\tN1 is N - 1,\n\tdoors(Max, N1, L, L2),\n\tinverse(N, 1, Max, L2, L1).\n\n\ninverse(N, Max, Max, [V], [V1])\u00a0:-\n\t!,\n\t0 =:= Max mod N -> inverse(V, V1); V1 = V.\n\ninverse(N, M, Max, [V|T], [V1|T1])\u00a0:-\n\tM1 is M+1,\n\tinverse(N, M1, Max, T, T1),\n\t(   0 =:= M mod N -> inverse(V, V1); V1 = V).\n\n\ninverse(open, close).\ninverse(close, open).\n\naffiche(N, L)\u00a0:-\n\tforall(between(1, N, I),\n\t       (   nth1(I, L, open) -> format('Door ~w is open.~n', [I]); true)).",
        "safe": true
    },
    {
        "filename": "100_doors_559.txt",
        "content": "doors(Num, Passes)\u00a0:-\n    forall(( everyNth(1,Passes,1,Pass)\n           , forall((everyNth(Pass,Num,Pass,Door), toggle(Door)))\n           ))\n  , show(Num)\n  .\n\n\ntoggle(Door)\u00a0:-\n    Opened = opened(Door)\n  , ( clause(Opened,_) -> retract(Opened)\n                       \u00a0; asserta(Opened)\n    ).\n\n\nshow(Num)\u00a0:-\n    forall(( between(1,Num,Door)\n           , (opened(Door) -> State = opened\u00a0; State = closed)\n           , write(Door), write(' '), write(State), nl\n           )).\n\n\n% utils\nforall(X)\u00a0:- findall(_, X, _).\n\neveryNth(From,To,Step,X)\u00a0:-\n    From =< To\n  , ( X = From\u00a0; From1 is From + Step, everyNth(From1,To,Step,X) )\n  .\n\nmain\u00a0:- doors(100,100), halt.",
        "safe": true
    },
    {
        "filename": "100_doors_56.txt",
        "content": "openshut(n):\n  for x in [1..n]\n    x%n==0\n\npass(n):\n  if n==100\n    openshut(n)\n  else\n    openshut(n) xor pass(n+1)\n\n100doors():\n  pass(1) -> io",
        "safe": true
    },
    {
        "filename": "100_doors_560.txt",
        "content": "doors_optimized(N)\u00a0:-\n\tMax is floor(sqrt(N)),\n\tforall(between(1, Max, I),\n\t       (   J is I*I,format('Door ~w is open.~n',[J]))).",
        "safe": true
    },
    {
        "filename": "100_doors_561.txt",
        "content": ";;; find the first few squares via the unoptimised door flipping method\nPROGRAM hundredDoors\nINCLUDE LIBRARY\nCON INT doorMax = 100\nBYTE door [ doorMax + 1 ]\u00a0; door( i ) is true if open, false if closed\nWORD i\nBYTE j\nBEGIN\nFOR i = 0 TO doorMax           \u00a0; set all doors to closed\n  door[ i ] = false\nFOR i = 1 TO doorMax           \u00a0; repeatedly flip the doors\n  j = i:<\n  WHILE j <= doorMax\n    door[ j ] = not door[ j ]\n    j = j + i:<\nFOR i = 1 TO doorMax           \u00a0; display the results\n  IF door[ i ]\n    OUTPUT \" #W\", i\nOUTPUT \"#C\"\nEND",
        "safe": true
    },
    {
        "filename": "100_doors_562.txt",
        "content": "using system;\n\n// initialize doors as pairs: number, status where 0 means open\nlet doors = zip (1..100) (repeat 1);\n\ntoogle (x,y) = x,~y;\n\ntoogleEvery n d = map (tooglep n) d with\n                    tooglep n d@((x,_)) = toogle d if ~(x mod n);\n                                        = d otherwise; end;\n\n// show description of given doors\nstatus (n,x) = (str n) + (case x of\n                            1 = \" close\";\n                            0 = \" open\"; end);\n\nlet result = foldl (\\a n -> toogleEvery n a) doors (1..100);\n\n// pretty print the result (only open doors)\nshowResult = do (puts.status) final when\n               final = filter open result with\n                         open (_,x) = ~x;\n                       end; end;",
        "safe": true
    },
    {
        "filename": "100_doors_563.txt",
        "content": " \n> showResult;\n1 open\n4 open\n9 open\n16 open\n25 open\n...\n",
        "safe": true
    },
    {
        "filename": "100_doors_564.txt",
        "content": "100Doors.pd\n\n#N canvas 241 375 414 447 10;\n#X obj 63 256 expr doors[$f1] = doors[$f1] ^ 1;\n#X msg 83 118 \\; doors const 0;\n#X msg 44 66 bang;\n#X obj 44 92 t b b b;\n#X obj 43 28 table doors 101;\n#X obj 44 360 sel 0;\n#X obj 44 336 expr if (doors[$f1] == 1 \\, $f1 \\, 0);\n#X obj 63 204 t b f f;\n#X text 81 66 run;\n#X obj 71 384 print -n;\n#X text 132 310 print results (open doors);\n#X obj 63 179 loop 1 100 1;\n#X obj 63 231 loop 1 100 1;\n#X obj 44 310 loop 1 100 1;\n#X text 148 28 create array;\n#X text 151 180 100 passes;\n#X text 179 123 set values to 0;\n#X connect 2 0 3 0;\n#X connect 3 0 13 0;\n#X connect 3 1 11 0;\n#X connect 3 2 1 0;\n#X connect 5 1 9 0;\n#X connect 6 0 5 0;\n#X connect 7 0 12 0;\n#X connect 7 1 12 1;\n#X connect 7 2 12 3;\n#X connect 11 0 7 0;\n#X connect 12 0 0 0;\n#X connect 13 0 6 0;\n\nloop.pd\n\n#N canvas 656 375 427 447 10;\n#X obj 62 179 until;\n#X obj 102 200 f;\n#X obj 62 89 inlet;\n#X obj 303 158 f \\$3;\n#X obj 270 339 outlet;\n#X obj 223 89 inlet;\n#X obj 138 89 inlet;\n#X obj 324 89 inlet;\n#X obj 117 158 f \\$1;\n#X text 323 68 step;\n#X obj 202 158 f \\$2;\n#X obj 62 118 t b b b b;\n#X obj 270 315 spigot;\n#X obj 89 314 sel 0;\n#X obj 137 206 +;\n#X obj 102 237 expr $f1 \\; if ($f3 > 0 \\, if ($f1 > $f2 \\, 0 \\, 1)\n\\, if ($f3 < 0 \\, if ($f1 < $f2 \\, 0 \\, 1) \\, 0)), f 34;\n#X text 63 68 run;\n#X text 136 68 start;\n#X text 227 68 end;\n#X text 58 31 loop (abstraction);\n#X connect 0 0 1 0;\n#X connect 1 0 14 0;\n#X connect 1 0 15 0;\n#X connect 2 0 11 0;\n#X connect 3 0 14 1;\n#X connect 3 0 15 2;\n#X connect 5 0 10 1;\n#X connect 6 0 8 1;\n#X connect 7 0 3 1;\n#X connect 8 0 1 1;\n#X connect 10 0 15 1;\n#X connect 11 0 0 0;\n#X connect 11 1 8 0;\n#X connect 11 2 10 0;\n#X connect 11 3 3 0;\n#X connect 12 0 4 0;\n#X connect 13 0 0 1;\n#X connect 14 0 1 1;\n#X connect 15 0 12 0;\n#X connect 15 1 12 1;\n#X connect 15 1 13 0;",
        "safe": true
    },
    {
        "filename": "100_doors_565.txt",
        "content": "Dim doors.i(100)\n \nFor x = 1 To 100\n  y = x\n  While y <= 100\n    doors(y) = 1 - doors(y)\n    y + x\n  Wend\nNext\n \nOpenConsole()\nPrintN(\"Following Doors are open:\")\nFor x = 1 To 100\n  If doors(x)\n    Print(Str(x) + \", \")\n  EndIf\nNext\nInput()",
        "safe": true
    },
    {
        "filename": "100_doors_566.txt",
        "content": "OpenConsole()\nPrintN(\"Following Doors are open:\")\nFor i = 1 To 100\n    root.f = Sqr(i)\n    If root = Int(root)\n    \tPrint (Str(i) + \", \")\n    EndIf\nNext     \nInput()",
        "safe": true
    },
    {
        "filename": "100_doors_567.txt",
        "content": "Following Doors are open:\n1, 4, 9, 16, 25, 36, 49, 64, 81, 100,",
        "safe": true
    },
    {
        "filename": "100_doors_568.txt",
        "content": "data Door:\n  | open\n  | closed\nend\n \nfun flip-door(d\u00a0:: Door) -> Door:\n  cases(Door) d:\n    | open => closed\n    | closed => open\n  end\nend\n \n\nfun flip-doors(doors\u00a0:: List<Door>) -> List<Door>:\n  doc:```Given a list of door positions, repeatedly switch the positions of\n      every nth door for every nth pass, and return the final list of door\n      positions```\n  for fold(flipped-doors from doors, n from range(1, doors.length() + 1)):\n    for map_n(m from 1, d from flipped-doors):\n      if num-modulo(m, n) == 0:\n        flip-door(d)\n      else:\n        d\n      end\n    end\n  end\nwhere:\n    flip-doors([list: closed, closed, closed]) is\n  [list: open, closed, closed]\n\n  flip-doors([list: closed, closed, closed, closed]) is\n  [list: open, closed, closed, open]\n\n  flip-doors([list: closed, closed, closed, closed, closed, closed]) is\n  [list: open, closed, closed, open, closed, closed]\n\n  closed-100 = for map(_ from range(1, 101)): closed end\n  answer-100 = for map(n from range(1, 101)):\n    if num-is-integer(num-sqrt(n)): open\n    else: closed\n    end\n  end\n\n  flip-doors(closed-100) is answer-100\nend\n\nfun find-indices<A>(pred\u00a0:: (A -> Boolean), xs\u00a0:: List<A>) -> List<Number>:\n    doc:```Given a list and a predicate function, produce a list of index\n      positions where there's a match on the predicate```\n  ps = map_n(lam(n,e): if pred(e): n else: -1 end end, 1, xs)\n  ps.filter(lam(x): x >= 0 end)\nwhere:\n  find-indices((lam(i): i == true end), [list: true,false,true]) is [list:1,3]\nend\n\n\nfun run(n):\n  doc:```Given a list of doors that are closed, make repeated passes \n      over the list, switching the positions of every nth door for \n      each nth pass. Return a list of positions in the list where the\n      door is Open.```\n  doors = repeat(n, closed)\n  ys = flip-doors(doors)\n  find-indices((lam(y): y == open end), ys)\nwhere:\n  run(4) is [list: 1,4]\nend\n \nrun(100)",
        "safe": true
    },
    {
        "filename": "100_doors_569.txt",
        "content": "doors = [False] * 100\nfor i in range(100):\n   for j in range(i, 100, i+1):\n       doors[j] = not doors[j]\n   print(\"Door %d:\"\u00a0% (i+1), 'open' if doors[i] else 'close')",
        "safe": true
    },
    {
        "filename": "100_doors_57.txt",
        "content": "use std, array\n\nclose all doors\nfor each pass from 1 to 100\n  for (door = pass) (door <= 100) (door += pass)\n    toggle door\n\nlet int pass, door.\n\n.: close all doors\u00a0:. {memset doors 0 size of doors}\n.:toggle <int door>:. {   \u00a0!!(doors[door - 1])     }\n\nlet doors be an array of 100 bool\n\nfor each door from 1 to 100\n  printf \"#%.3d %s\\n\" door (doors[door - 1])\u00a0? \"[ ]\", \"[X]\"",
        "safe": true
    },
    {
        "filename": "100_doors_570.txt",
        "content": "for i in xrange(1, 101):\n    root = i ** 0.5\n    print \"Door %d:\"\u00a0% i, 'open' if root == int(root) else 'close'",
        "safe": true
    },
    {
        "filename": "100_doors_571.txt",
        "content": "print '\\n'.join(['Door %s is %s'\u00a0% (i, ('closed', 'open')[(i**0.5).is_integer()]) for i in xrange(1, 101)])",
        "safe": true
    },
    {
        "filename": "100_doors_572.txt",
        "content": "print '\\n'.join('Door %s is %s'\u00a0% (i, 'closed' if i**0.5\u00a0% 1 else 'open') for i in range(1, 101))",
        "safe": true
    },
    {
        "filename": "100_doors_573.txt",
        "content": "for i in range(1, 101):\n    if i**0.5\u00a0% 1:\n        state='closed'\n    else:\n        state='open'\n    print(\"Door {}:{}\".format(i, state))",
        "safe": true
    },
    {
        "filename": "100_doors_574.txt",
        "content": "for i in range(1,11): print(\"Door %s is open\"\u00a0% i**2)",
        "safe": true
    },
    {
        "filename": "100_doors_575.txt",
        "content": "`closed`open(100#0b){@[x;where y;not]}/100#'(til[100]#'0b),'1b",
        "safe": true
    },
    {
        "filename": "100_doors_576.txt",
        "content": "`closed`open (1+til 100) in {x*x} 1+til 10",
        "safe": true
    },
    {
        "filename": "100_doors_577.txt",
        "content": "@[100#`closed; -1+{x*x}1+til 10;\u00a0:; `open]",
        "safe": true
    },
    {
        "filename": "100_doors_578.txt",
        "content": "Const Opened = -1, Closed = 0\nDim Doors(1 To 100) As Integer, Passes As Integer, Index As Integer\nRem Normal implementation\nPrint \"100doors Normal method\"\nFor Passes = 1 To 100 Step 1\n    Doors(Passes) = Closed\nNext Passes\nFor Passes = 1 To 100 Step 1\n    For Index = 0 To 100 Step Passes\n        If Index > 100 Then Exit For\n        If Index > 0 Then If Doors(Index) = Opened Then Doors(Index) = Closed Else Doors(Index) = Opened\n    Next Index\nNext Passes\nPrint \"OPEN DOORS after 100th passes\"\nFor Passes = 1 To 100 Step 1\n    If Doors(Passes) = Opened Then Print Passes; \" \";\nNext\n\nRem Alternative solution of perfect squares\n\nPrint \"Alternative method\"\nPasses = 0\nFor Passes = 1 To 100 Step 1\n    Doors(Passes) = Closed\nNext Passes\nFor Passes = 1 To 100 Step 1\n    If Sqr(Passes) = Int(Sqr(Passes)) Then Doors(Passes) = Opened\nNext\nPrint \"Opened doors found by SQR method\"\nFor Passes = 1 To 100 Step 1\n    If Doors(Passes) = Opened Then Print Passes; \" \";\nNext Passes\nEnd",
        "safe": true
    },
    {
        "filename": "100_doors_579.txt",
        "content": "/O>  [ bit ^ ]                       is toggle      ( f n --> f )\n...   \n...  [ 0\n...    100 times\n...      [ i^ 1+ swap\n...        101 times\n...          [ i^ toggle over step ]\n...      nip ] ]                     is toggledoors (     --> f )\n...   \n...   [ 100 times\n...        [ 1 >> dup 1 &\n...          if [ i^ 1+ echo sp ] ]\n...     drop ]                       is echodoors   (   f -->   )\n...   \n...  toggledoors\n...  say \" These doors are open: \" echodoors cr\n...  say \" The rest are closed.\" cr\n... \n These doors are open: 1 4 9 16 25 36 49 64 81 100 \n The rest are closed.\n\nStack empty.",
        "safe": true
    },
    {
        "filename": "100_doors_58.txt",
        "content": "/* ARM assembly Raspberry PI  */\n/*  program 100doors.s   */\n\n/************************************/\n/* Constantes                       */\n/************************************/\n.equ STDOUT, 1                                 @ Linux output console\n.equ EXIT,   1                                 @ Linux syscall\n.equ WRITE,  4                                 @ Linux syscall\n.equ NBDOORS,   100\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nsMessResult:       .ascii \"The door \"\nsMessValeur:       .fill 11, 1, ' '            @ size => 11\n                      .asciz \"is open.\\n\"\n\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss  \nstTableDoors:\t.skip   4 * NBDOORS\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                         @ entry of program \n    push {fp,lr}                              @ saves 2 registers \n    @ display first line\n    ldr r3,iAdrstTableDoors                   @ table address\n    mov r5,#1            \n1:\n    mov r4,r5\n2:                                            @ begin loop\n    ldr r2,[r3,r4,lsl #2]                     @ read doors index r4\n    cmp r2,#0\n    moveq r2,#1                               @ if r2 = 0   1 -> r2\n    movne r2,#0                               @ if r2 = 1   0 -> r2\n    str r2,[r3,r4,lsl #2]                     @ store value of doors\n    add r4,r5                                 @ increment r4 with  r5 value\n    cmp r4,#NBDOORS                           @ number of doors\u00a0?\n    ble 2b                                    @ no -> loop\n    add r5,#1                                 @ increment the increment\u00a0!!\n    cmp r5,#NBDOORS                           @ number of doors\u00a0?\n    ble 1b                                    @ no -> loop\n\n                                              @ loop display state doors\n    mov r4,#0              \n3:\n    ldr r2,[r3,r4,lsl #2]                     @ read state doors r4 index\n    cmp r2,#0\n    beq 4f\n    mov r0,r4                                 @ open -> display message\n    ldr r1,iAdrsMessValeur                    @ display value index\n    bl conversion10                           @ call function\n    ldr r0,iAdrsMessResult\n    bl affichageMess                          @ display message\n4:\n    add r4,#1\n    cmp r4,#NBDOORS\n    ble 3b                                    @ loop\n \n\n100:                                          @ standard end of the program \n    mov r0, #0                                @ return code\n    pop {fp,lr}                               @restaur 2 registers\n    mov r7, #EXIT                             @ request to exit program\n    svc #0                                    @ perform the system call\n\niAdrsMessValeur:                .int sMessValeur\niAdrstTableDoors:\t\t.int stTableDoors\niAdrsMessResult:\t\t.int sMessResult\n\n/******************************************************************/\n/*     display text with size calculation                         */ \n/******************************************************************/\n/* r0 contains the address of the message */\naffichageMess:\n    push {r0,r1,r2,r7,lr}                     @ save  registres\n    mov r2,#0                                 @ counter length \n1:                                            @ loop length calculation \n    ldrb r1,[r0,r2]                           @ read octet start position + index \n    cmp r1,#0                                 @ if 0 its over \n    addne r2,r2,#1                            @ else add 1 in the length \n    bne 1b                                    @ and loop \n                                              @ so here r2 contains the length of the message \n    mov r1,r0        \t\t\t      @ address message in r1 \n    mov r0,#STDOUT      \t\t      @ code to write to the standard output Linux \n    mov r7, #WRITE                            @ code call system \"write\" \n    svc #0                                    @ call systeme \n    pop {r0,r1,r2,r7,lr}                      @ restaur des  2 registres */ \n    bx lr                                     @ return  \n/******************************************************************/\n/*     Converting a register to a decimal unsigned                */ \n/******************************************************************/\n/* r0 contains value and r1 address area   */\n/* r0 return size of result (no zero final in area) */\n/* area size => 11 bytes          */\n.equ LGZONECAL,   10\nconversion10:\n    push {r1-r4,lr}                            @ save registers \n    mov r3,r1\n    mov r2,#LGZONECAL\n\n1:\t                                       @ start loop\n    bl divisionpar10U                          @unsigned  r0 <- dividende. quotient ->r0 reste -> r1\n    add r1,#48                                 @ digit\t\n    strb r1,[r3,r2]                            @ store digit on area\n    cmp r0,#0                                  @ stop if quotient = 0 \n    subne r2,#1                                @ else previous position\n    bne 1b\t                               @ and loop\n    // and move digit from left of area\n    mov r4,#0\n2:\n    ldrb r1,[r3,r2]\n    strb r1,[r3,r4]\n    add r2,#1\n    add r4,#1\n    cmp r2,#LGZONECAL\n    ble 2b\n    // and move spaces in end on area\n    mov r0,r4                                 @ result length \n    mov r1,#' '                               @ space\t\n3:\n    strb r1,[r3,r4]                           @ store space in area\n    add r4,#1                                 @ next position\n    cmp r4,#LGZONECAL\n    ble 3b                                    @ loop if r4 <= area size\n\n100:\n    pop {r1-r4,lr}                            @ restaur registres \n    bx lr                                     @return\n\n/***************************************************/\n/*   division par 10   unsigned                    */\n/***************************************************/\n/* r0 dividende   */\n/* r0 quotient */\t\n/* r1 remainder  */\ndivisionpar10U:\n    push {r2,r3,r4, lr}\n    mov r4,r0                                        @ save value\n    //mov r3,#0xCCCD                                 @ r3 <- magic_number  lower   @ for Raspberry pi 3\n    //movt r3,#0xCCCC                                @ r3 <- magic_number  upper   @ for Raspberry pi 3\n    ldr r3,iMagicNumber                              @ for Raspberry pi 1 2\n    umull r1, r2, r3, r0                             @ r1<- Lower32Bits(r1*r0) r2<- Upper32Bits(r1*r0) \n    mov r0, r2, LSR #3                               @ r2 <- r2 >> shift 3\n    add r2,r0,r0, lsl #2                             @ r2 <- r0 * 5 \n    sub r1,r4,r2, lsl #1                             @ r1 <- r4 - (r2 * 2)  = r4 - (r0 * 10)\n    pop {r2,r3,r4,lr}\n    bx lr                                            @ leave function \niMagicNumber:            .int 0xCCCCCCCD",
        "safe": true
    },
    {
        "filename": "100_doors_580.txt",
        "content": "doors_puzzle <- function(ndoors, passes = ndoors) {\n    doors <- logical(ndoors)\n    for (ii in seq(passes)) {\n        mask <- seq(ii, ndoors, ii)\n        doors[mask] <- !doors[mask]\t\n    }\n    which(doors)\n}\n\ndoors_puzzle(100)",
        "safe": true
    },
    {
        "filename": "100_doors_581.txt",
        "content": "x <- rep(1, 100)\nfor (i in 1:100-1) {\n    x <- xor(x, rep(c(rep(0,i),1), length.out=100))\n}\nwhich(!x)",
        "safe": true
    },
    {
        "filename": "100_doors_582.txt",
        "content": "doors_puzzle <- function(ndoors=100,passes=100) {\nnames(which(table(unlist(sapply(1:passes, function(X) seq(0, ndoors, by=X))))\u00a0%% 2 == 1))\n}\n\ndoors_puzzle()",
        "safe": true
    },
    {
        "filename": "100_doors_583.txt",
        "content": "H=100\nf=rep(F,H)\nwhich(Reduce(function(d,n) xor(replace(f,seq(n,H,n),T),d), 1:H, f))",
        "safe": true
    },
    {
        "filename": "100_doors_584.txt",
        "content": "1   4   9  16  25  36  49  64  81 100\n",
        "safe": true
    },
    {
        "filename": "100_doors_585.txt",
        "content": "#lang racket\n\n;; Applies fun to every step-th element of seq, leaving the others unchanged.\n(define (map-step fun step seq)\n  (for/list ([elt seq] [i (in-naturals)])\n    ((if (zero? (modulo i step)) fun values) elt)))\n\n(define (toggle-nth n seq)\n  (map-step not n seq))\n\n(define (solve seq)\n  (for/fold ([result seq]) ([_ seq] [pass (in-naturals 1)])\n    (toggle-nth pass result)))\n\n(for ([door (solve (make-vector 101 #f))] [index (in-naturals)]\n      #:when (and door (> index 0)))\n  (printf \"~a is open~%\" index))",
        "safe": true
    },
    {
        "filename": "100_doors_586.txt",
        "content": "#lang racket\n(for ([x (in-range 1 101)] #:when (exact-integer? (sqrt x)))\n  (printf \"~a is open\\n\" x))",
        "safe": true
    },
    {
        "filename": "100_doors_587.txt",
        "content": "#lang slideshow\n(define-syntax-rule (vector-neg! vec pos)\n  (vector-set! vec pos (not (vector-ref vec pos))))\n\n(define (make-doors)\n  (define doors (make-vector 100 #f))\n  (for* ([i 100] [j (in-range i 100 (add1 i))]) (vector-neg! doors j))\n  doors)\n\n(displayln (list->string (for/list ([d (make-doors)]) (if d #\\o #\\-))))\n\n(define closed-door (inset (filled-rectangle 4 20) 2))\n(define open-door (inset (rectangle 4 20) 2))\n\n(for/fold ([doors (rectangle 0 0)]) ([open? (make-doors)])\n  (hc-append doors (if open? open-door closed-door)))",
        "safe": true
    },
    {
        "filename": "100_doors_588.txt",
        "content": "my @doors = False xx 101;\n \n(.=not for @doors[0, $_ ... 100]) for 1..100;\n \nsay \"Door $_ is \", <closed open>[ @doors[$_] ] for 1..100;",
        "safe": true
    },
    {
        "filename": "100_doors_589.txt",
        "content": "say \"Door $_ is open\" for map {$^n ** 2}, 1..10;",
        "safe": true
    },
    {
        "filename": "100_doors_59.txt",
        "content": "/*********************************************/\n/* optimized version                         */\n/*********************************************/\n/* ARM assembly Raspberry PI  */\n/*  program 100doors.s   */\n\n/************************************/\n/* Constantes                       */\n/************************************/\n.equ STDOUT, 1     @ Linux output console\n.equ EXIT,   1     @ Linux syscall\n.equ WRITE,  4     @ Linux syscall\n.equ NBDOORS,   100\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nsMessResult:       .ascii \"The door \"\nsMessValeur:       .fill 11, 1, ' '                 @ size => 11\n                   .asciz \"is open.\\n\"\n\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss  \n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                               @ entry of program \n    push {fp,lr}                                    @ saves 2 registers \n                                                    @ display first line\n    mov r5,#3                                       @ start value of increment\n    mov r4,#1                                       @ start doors\n                                                    @ loop display state doors\n1:\n    mov r0,r4                                       @ open -> display message\n    ldr r1,iAdrsMessValeur                          @ display value index\n    bl conversion10                                 @ call function\n    ldr r0,iAdrsMessResult\n    bl affichageMess                                @ display message\n    add r4,r5                                       @ add increment\n    add r5,#2                                       @ new increment\n    cmp r4,#NBDOORS\n    ble 1b                                          @ loop\n \n\n100:   @ standard end of the program \n    mov r0, #0                                      @ return code\n    pop {fp,lr}                                     @ restaur 2 registers\n    mov r7, #EXIT                                   @ request to exit program\n    svc #0                                          @ perform the system call\n\niAdrsMessValeur:                .int sMessValeur\niAdrsMessResult:\t\t.int sMessResult\n\n/******************************************************************/\n/*     display text with size calculation                         */ \n/******************************************************************/\n/* r0 contains the address of the message */\naffichageMess:\n    push {r0,r1,r2,r7,lr}                           @ save  registres\n    mov r2,#0                                       @ counter length \n1:                                                  @ loop length calculation \n    ldrb r1,[r0,r2]                                 @ read octet start position + index \n    cmp r1,#0                                       @ if 0 its over \n    addne r2,r2,#1                                  @ else add 1 in the length \n    bne 1b                                          @ and loop \n                                                    @ so here r2 contains the length of the message \n    mov r1,r0        \t\t\t            @ address message in r1 \n    mov r0,#STDOUT      \t\t            @ code to write to the standard output Linux \n    mov r7, #WRITE                                  @ code call system \"write\" \n    svc #0                                          @ call systeme \n    pop {r0,r1,r2,r7,lr}                            @ restaur des  2 registres */ \n    bx lr                                           @ return  \n/******************************************************************/\n/*     Converting a register to a decimal unsigned                */ \n/******************************************************************/\n/* r0 contains value and r1 address area   */\n/* r0 return size of result (no zero final in area) */\n/* area size => 11 bytes          */\n.equ LGZONECAL,   10\nconversion10:\n    push {r1-r4,lr}                                 @ save registers \n    mov r3,r1\n    mov r2,#LGZONECAL\n\n1:\t                                            @ start loop\n    bl divisionpar10U                               @ unsigned  r0 <- dividende. quotient ->r0 reste -> r1\n    add r1,#48                                      @ digit\t\n    strb r1,[r3,r2]                                 @ store digit on area\n    cmp r0,#0                                       @ stop if quotient = 0 \n    subne r2,#1                                     @ else previous position\n    bne 1b\t                                    @ and loop\n                                                    @ and move digit from left of area\n    mov r4,#0\n2:\n    ldrb r1,[r3,r2]\n    strb r1,[r3,r4]\n    add r2,#1\n    add r4,#1\n    cmp r2,#LGZONECAL\n    ble 2b\n                                                    @ and move spaces in end on area\n    mov r0,r4                                       @ result length \n    mov r1,#' '                                     @ space\t\n3:\n    strb r1,[r3,r4]                                 @ store space in area\n    add r4,#1                                       @ next position\n    cmp r4,#LGZONECAL\n    ble 3b                                          @ loop if r4 <= area size\n\n100:\n    pop {r1-r4,lr}                                  @ restaur registres \n    bx lr                                           @return\n\n/***************************************************/\n/*   division par 10   unsigned                    */\n/***************************************************/\n/* r0 dividende   */\n/* r0 quotient */\t\n/* r1 remainder  */\ndivisionpar10U:\n    push {r2,r3,r4, lr}\n    mov r4,r0                                       @ save value\n    //mov r3,#0xCCCD                                @ r3 <- magic_number  lower   @ for raspberry 3\n    //movt r3,#0xCCCC                               @ r3 <- magic_number  upper   @ for raspberry 3\n    ldr r3,iMagicNumber                             @ for raspberry 1 2\n    umull r1, r2, r3, r0                            @ r1<- Lower32Bits(r1*r0) r2<- Upper32Bits(r1*r0) \n    mov r0, r2, LSR #3                              @ r2 <- r2 >> shift 3\n    add r2,r0,r0, lsl #2                            @ r2 <- r0 * 5 \n    sub r1,r4,r2, lsl #1                            @ r1 <- r4 - (r2 * 2)  = r4 - (r0 * 10)\n    pop {r2,r3,r4,lr}\n    bx lr                                           @ leave function \niMagicNumber:            .int 0xCCCCCCCD",
        "safe": true
    },
    {
        "filename": "100_doors_590.txt",
        "content": "say 'Door $_ is open' for (1..10)\u00bb\u00b2;",
        "safe": true
    },
    {
        "filename": "100_doors_591.txt",
        "content": " say \"Door $_ is open\" for 1..10 X** 2;",
        "safe": true
    },
    {
        "filename": "100_doors_592.txt",
        "content": "say \"Door $_ is \", <closed open>[.sqrt == .sqrt.floor] for 1..100;",
        "safe": true
    },
    {
        "filename": "100_doors_593.txt",
        "content": "sub  output( @arr, $max ) {\n    my $output = 1;\n    for 1..^$max -> $index {\n\tif @arr[$index] {\n\t    printf \"%4d\", $index;\n\t    say '' if $output++\u00a0%%  10;\n\t}\n    }\n    say '';\n}\n\nsub MAIN ( Int\u00a0:$doors = 100 ) {\n    my $doorcount = $doors + 1;\n    my @door[$doorcount] = 0 xx ($doorcount);\n    \n    INDEX:\n    for 1...^$doorcount -> $index {\n        # flip door $index & its multiples, up to last door.\n        #\n\tfor ($index, * + $index ... *)[^$doors] -> $multiple {\n\t    next INDEX if $multiple > $doors;\n\t    @door[$multiple] =  @door[$multiple]\u00a0?? 0\u00a0!! 1;\n\t}\n    }\n    output @door, $doors+1;\n}",
        "safe": true
    },
    {
        "filename": "100_doors_594.txt",
        "content": "$ ./100_doors.pl6 -doors=100\n   1   4   9  16  25  36  49  64  81\n",
        "safe": true
    },
    {
        "filename": "100_doors_595.txt",
        "content": "dim x as integer, y as integer\ndim door(1 to 100) as byte\n\n'initialize array\nfor x = 1 to 100\u00a0: door(x) = 0\u00a0: next\n\n'set door values\nfor y = 1 to 100\n    for x = y to 100 step y\n        door(x) = not door(x)\n    next x\nnext y\n\n'print result\nfor x = 1 to 100\n    if door(x) then print \"Door \" + str$(x) + \" = open\"\nnext \n\nwhile inkey$=\"\":wend\nend",
        "safe": true
    },
    {
        "filename": "100_doors_596.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_597.txt",
        "content": "doors: array/initial 100 'closed\nrepeat i 100 [\n    door: at doors i\n    forskip door i [change door either 'open = first door ['closed] ['open]]\n]",
        "safe": true
    },
    {
        "filename": "100_doors_598.txt",
        "content": "doors: array/initial 100 'closed\nrepeat i 10 [doors/(i * i): 'open]",
        "safe": true
    },
    {
        "filename": "100_doors_599.txt",
        "content": "Red [\n  Purpose: \"100 Doors Problem (Perfect Squares)\"\n  Author: \"Barry Arthur\"\n  Date: \"07-Oct-2016\"\n]\ndoors: make vector! [char! 8 100]\nrepeat i 100 [change at doors i #\".\"]\n\nrepeat i 100 [\n    j: i\n    while [j <= 100] [\n      door: at doors j\n      change door either #\"O\" = first door [#\".\"] [#\"O\"]\n      j: j + i\n    ]\n]\n\nrepeat i 10 [\n  print copy/part at doors (i - 1 * 10 + 1) 10\n]",
        "safe": true
    },
    {
        "filename": "100_doors_6.txt",
        "content": "; 100 DOORS in  6502 assembly language for: http://www.6502asm.com/beta/index.html\n; Written for the original MOS Technology, Inc. NMOS version of the 6502, but should work with any version.\n; Based on BASIC QB64 unoptimized version: http://rosettacode.org/wiki/100_doors#BASIC\n;\n; Notes:\n;    Doors array[1..100] is at $0201..$0264. On the specified emulator, this is in video memory, so tbe results will \n; be directly shown as pixels in the display.\n;    $0200 (door 0) is cleared for display purposes but is not involved in the open/close loops.\n;    Y register holds Stride\n;    X register holds Index\n;    Zero Page address $01 used to add Stride to Index (via A) because there's no add-to-X or add-Y-to-A instruction.\n\n \u00a0; First, zero door array\n    LDA #00\n    LDX #100\nZ_LOOP:\n    STA 200,X\n    DEX\n    BNE Z_LOOP\n    STA 200,X\n\n \u00a0; Now do doors repeated open/close\n    LDY #01       \u00a0; Initial value of Stride\nS_LOOP:\n    CPY #101\n    BCS S_DONE\n    TYA           \u00a0; Initial value of Index\nI_LOOP:\n    CMP #101\n    BCS I_DONE\n    TAX           \u00a0; Use as Door array index\n    INC $200,X    \u00a0; Toggle bit 0 to reverse state of door\n    STY 01        \u00a0; Add stride (Y) to index (X, via A)\n    ADC 01\n    BCC I_LOOP\nI_DONE:\n    INY\n    BNE S_LOOP\nS_DONE:\n\n \u00a0; Finally, format array values for output: 0 for closed, 1 for open\n    LDX #100\nC_LOOP:\n    LDA $200,X\n    AND #$01\n    STA $200,X\n    DEX\n    BNE C_LOOP",
        "safe": true
    },
    {
        "filename": "100_doors_60.txt",
        "content": "isOpen: map 1..101 => false\n \nloop 1..100 'pass ->\n\tloop (range.step:pass pass 100) 'door [\n\t\tisOpen\\[door]: not? isOpen\\[door]\n\t]\n\nloop 1..100 'x ->\n\tif isOpen\\[x] [\n\t\tprint [\"Door\" x \"is open.\"]\n\t]\n",
        "safe": true
    },
    {
        "filename": "100_doors_600.txt",
        "content": "Red [\"Doors\"]\n\ndoors: make bitset! len: 100\nrepeat step len [\n\trepeat n to-integer len / step [\n\t\tm: step * n \n\t\tdoors/:m: not doors/:m\n\t]\n]\nrepeat n len [if doors/:n [print n]]",
        "safe": true
    },
    {
        "filename": "100_doors_601.txt",
        "content": "$ENTRY Go {\n    = <Show 1 <Walk 1 <Doors>>>;\n};\n\nNDoors { = 100; };\nDoors  { = <Repeat <NDoors> Closed>; };\n\nRepeat {\n    0   s.val =\u00a0;\n    s.N s.val = s.val <Repeat <- s.N 1> s.val>\u00a0;\n};    \n\nToggle {\n    1   Closed e.rest = Open   e.rest;\n    1   Open   e.rest = Closed e.rest;\n    s.N s.door e.rest = s.door <Toggle <- s.N 1> e.rest>;\n};\n    \nPass {\n    s.pass s.door e.doors, <Compare s.door <NDoors>>: '+'\n        = e.doors;\n    s.pass s.door e.doors\n        = <Pass s.pass <+ s.pass s.door> <Toggle s.door e.doors>>;\n};\n\nWalk {\n    s.pass e.doors, <Compare s.pass <NDoors>>: '+' \n        = e.doors;\n    s.pass e.doors\n        = <Walk <+ s.pass 1> <Pass s.pass s.pass e.doors>>;\n};\n\nShow {\n    s.N Open   e.rest = <Prout Door s.N is open> \n                        <Show <+ s.N 1> e.rest>;\n    s.N Closed e.rest = <Show <+ s.N 1> e.rest>;\n    s.N =\u00a0;\n};",
        "safe": true
    },
    {
        "filename": "100_doors_602.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_603.txt",
        "content": "relation door, state\nset i = 1\nwhile i <= 100\ninsert i, 1\nset i = i+1\nend while\nset i = 2\nwhile i <= 100\nupdate state = 1-state where not (door mod i)\nset i = i+1\nend while\nupdate state = \"open\" where state\nupdate state = \"closed\" where state\u00a0!== \"open\"\nprint",
        "safe": true
    },
    {
        "filename": "100_doors_604.txt",
        "content": ":doors (n-) [ #1 repeat dup-pair n:square gt? 0; drop dup n:square n:put sp n:inc again ] do drop-pair\u00a0;\n#100 doors",
        "safe": true
    },
    {
        "filename": "100_doors_605.txt",
        "content": "/*REXX pgm solves the  100 doors puzzle, doing it the hard way by opening/closing doors.*/\nparse arg doors .                                /*obtain the optional argument from CL.*/\nif doors=='' | doors==\",\"  then doors=100        /*not specified?  Then assume 100 doors*/\n                                                 /*        0 =  the door is  closed.    */\n                                                 /*        1 =   \"    \"   \"  open.      */\ndoor.=0                                          /*assume all doors are closed at start.*/\n                do #=1  for doors                /*process a pass\u2500through for all doors.*/\n                    do j=#  by #  to doors       /*  \u00b7\u00b7\u00b7 every Jth door from this point.*/\n                    door.j= \\door.j              /*toggle the  \"openness\"  of the door. */\n                    end   /*j*/\n                end       /*#*/\n\nsay 'After '                doors          \" passes, the following doors are open:\"\nsay\n                do k=1  for doors\n                if door.k  then say right(k, 20) /*add some indentation for the output. */\n                end    /*k*/                     /*stick a fork in it,  we're all done. */",
        "safe": true
    },
    {
        "filename": "100_doors_606.txt",
        "content": "After  100  passes, the following doors are open:\n\n                   1\n                   4\n                   9\n                  16\n                  25\n                  36\n                  49\n                  64\n                  81\n                 100\n",
        "safe": true
    },
    {
        "filename": "100_doors_607.txt",
        "content": "/*REXX pgm solves the  100 doors  puzzle,  doing it the easy way by calculating squares.*/\nparse arg doors .                                /*obtain the optional argument from CL.*/\nif doors=='' | doors==\",\"  then doors=100        /*not specified?  Then assume 100 doors*/\nsay 'After '          doors          \" passes, the following doors are open:\"\nsay\n          do #=1  while  #**2 <= doors           /*process easy pass\u2500through  (squares).*/\n          say right(#**2, 20)                    /*add some indentation for the output. */\n          end   /*#*/                            /*stick a fork in it,  we're all done. */",
        "safe": true
    },
    {
        "filename": "100_doors_608.txt",
        "content": "doors = list(100)\nfor i = 1 to 100\ndoors[i] = false\nnext\n\nFor pass = 1 To 100\n         For door = pass To 100\n             if doors[door] doors[door] = false else doors[door] = true ok\n         door += pass-1\n         Next\nNext\n\nFor door = 1 To 100\n     see \"Door (\" + door + \") is \"\n     If doors[door] see \"Open\" else see \"Closed\" ok\n     see nl\nNext",
        "safe": true
    },
    {
        "filename": "100_doors_609.txt",
        "content": "doors = list(100)\nfor i = 1 to 100\ndoors[i] = false\nnext\n\nFor p = 1 To 10\n        doors[pow(p,2)] = True\nNext\n\nFor door = 1 To 100\n     see \"Door (\" + door + \") is \"\n     If doors[door] see \"Open\" else see \"Closed\" ok\n     see nl\nNext",
        "safe": true
    },
    {
        "filename": "100_doors_61.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100_doors_610.txt",
        "content": " \u226a { }\n   { 100 } 0 CON \n   1 100 FOR ii\n      ii 100 FOR j\n         DUP j GET NOT j SWAP PUT ii STEP    \n   IF DUP ii GET THEN SWAP ii + SWAP END\n   NEXT DROP\n\u226b 'DOORS' STO\n",
        "safe": true
    },
    {
        "filename": "100_doors_611.txt",
        "content": "DOORS ( -- { open_doors } ) \n doors = [False] * 100\nfor i in range(100):\n  for j in range(i, 100, i+1):\n      doors[j] = not doors[j]\n  if doors[i} then print(i)\n// clean stack\n\n",
        "safe": true
    },
    {
        "filename": "100_doors_612.txt",
        "content": "1: { 1 4 9 16 25 36 49 64 81 100 }\n",
        "safe": true
    },
    {
        "filename": "100_doors_613.txt",
        "content": "\u226a { } 1 100 FOR ii IF ii \u221a FP NOT THEN ii + END NEXT \u226b\n",
        "safe": true
    },
    {
        "filename": "100_doors_614.txt",
        "content": "doors = Array.new(101,0)\nprint \"Open doors \"\n(1..100).step(){ |i|\n(i..100).step(i) { |d|\n    doors[d] = doors[d]^= 1\n    if i == d and doors[d] == 1 then\n      print \"#{i} \"\n    end\n  }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_615.txt",
        "content": "Open doors 1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100_doors_616.txt",
        "content": "class Door\n  attr_reader :state\n\n  def initialize\n    @state = :closed\n  end\n  \n  def close\n    @state = :closed\n  end\n\n  def open\n    @state = :open\n  end\n  \n  def closed?\n    @state == :closed\n  end\n  \n  def open?\n    @state == :open\n  end\n  \n  def toggle\n    if closed? then open else close end\n  end\n  \n  def to_s\n    @state.to_s\n  end\nend\n\ndoors = Array.new(100) { Door.new }\n1.upto(100) do |multiplier|\n  doors.each_with_index do |door, i|\n    door.toggle if (i + 1)\u00a0% multiplier == 0\n  end\nend\n\ndoors.each_with_index { |door, i| puts \"Door #{i+1} is #{door}.\" }",
        "safe": true
    },
    {
        "filename": "100_doors_617.txt",
        "content": "n = 100\nOpen = \"open\"\nClosed = \"closed\"\ndef Open.toggle\n  Closed\nend\ndef Closed.toggle\n  Open\nend\ndoors = [Closed] * (n + 1)\nfor mul in 1..n\n  for x in (mul..n).step(mul)\n    doors[x] = doors[x].toggle\n  end\nend\ndoors.each_with_index do |b, i|\n  puts \"Door #{i} is #{b}\" if i > 0\nend",
        "safe": true
    },
    {
        "filename": "100_doors_618.txt",
        "content": "n = 100\n(1..n).each do |i| \n  puts \"Door #{i} is #{i**0.5 == (i**0.5).round\u00a0? \"open\"\u00a0: \"closed\"}\"\nend",
        "safe": true
    },
    {
        "filename": "100_doors_619.txt",
        "content": "doors = [false] * 100\n100.times do |i|\n  (i ... doors.length).step(i + 1) do |j|\n    doors[j] = !doors[j]\n  end\nend\nputs doors.map.with_index(1){|d,i| \"Door #{i} is #{d\u00a0? 'open'\u00a0: 'closed'}.\"}",
        "safe": true
    },
    {
        "filename": "100_doors_62.txt",
        "content": "var doors = falses(100)\n\nfor a in 1..100: for b in a..a..100:\n    doors[b] = not doors[b]\n\nfor a in 1..100:\n    print \"Door $a is ${(doors[a])\u00a0? 'open.': 'closed.'}\"\n",
        "safe": true
    },
    {
        "filename": "100_doors_620.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_621.txt",
        "content": "dim doors(100)\nprint \"Open doors \";\nfor i = 1 to 100 \n    for door = i to 100 step i\n        doors(door) = (doors(door) <> 1)\n        if i = door and doors(door) = 1 then   print i;\" \";\n    next door\nnext i",
        "safe": true
    },
    {
        "filename": "100_doors_622.txt",
        "content": "Open doors 1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100_doors_623.txt",
        "content": "fn main() {\n    let mut door_open = [false; 100];\n    for pass in 1..101 {\n        let mut door = pass;\n        while door <= 100 {\n            door_open[door - 1] = !door_open[door - 1];\n            door += pass;\n        }\n    }\n    for (i, &is_open) in door_open.iter().enumerate() {\n        println!(\n            \"Door {} is {}.\",\n            i + 1,\n            if is_open { \"open\" } else { \"closed\" }\n        );\n    }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_624.txt",
        "content": "fn main() {\n    let doors = vec![false; 100]\n        .iter_mut()\n        .enumerate()\n        .map(|(door, door_state)| {\n            (1..100)\n                .into_iter()\n                .filter(|pass| (door + 1)\u00a0% pass == 0)\n                .map(|_| {\n                    *door_state =\u00a0!*door_state;\n                    *door_state\n                })\n                .last()\n                .unwrap()\n        })\n        .collect::<Vec<_>>();\n\n    println!(\"{:?}\", doors);\n}",
        "safe": true
    },
    {
        "filename": "100_doors_625.txt",
        "content": "fn main() {\n    let squares: Vec<_> = (1..11).map(|n| n * n).collect();\n    let is_square = |num| squares.binary_search(&num).is_ok();\n\n    for i in 1..101 {\n        let state = if is_square(i) { \"open\" } else { \"closed\" };\n        println!(\"Door {} is {}\", i, state);\n    }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_626.txt",
        "content": "fn main() {\n    for i in 1u32..11u32 {\n        println!(\"Door {} is open\", i.pow(2));\n    }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_627.txt",
        "content": "$constant DOOR_OPEN = 1\n$constant DOOR_CLOSED = 0\n$constant MAX_DOORS = 100\n\nvar i, j = integer\ndim integer doors(MAX_DOORS)\n\nrem - all doors are initially closed\nfor i = 1 to MAX_DOORS\n  doors(i) = DOOR_CLOSED\nnext i\n\nrem - cycle through at increasing intervals and flip doors\nfor i = 1 to MAX_DOORS\n  for j = i to MAX_DOORS step i\n    doors(j) = 1 - doors(j)\n  next j\nnext i\n\nrem - report results\nprint \"The open doors are:\"\nfor i = 1 to MAX_DOORS\n  if doors(i) = DOOR_OPEN then\n     print i;\nnext i\n\nend",
        "safe": true
    },
    {
        "filename": "100_doors_628.txt",
        "content": "The open doors are:\n 1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100_doors_629.txt",
        "content": "variable door,\n    isOpen = Char_Type [101],\n    pass;\n \nfor (door = 1; door <= 100; door++) {\n    isOpen[door] = 0;\n}\n \nfor (pass = 1; pass <= 100; pass++) {\n    for (door = pass; door <= 100; door += pass) {\n        isOpen[door] = not isOpen[door];\n    }\n}\n \nfor (door = 1; door <= 100; door++) {\n    if (isOpen[door]) {\n        print(\"Door \" + string(door) + \":open\");\n    } else {\n        print(\"Door \" + string(door) + \":close\");\n    }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_63.txt",
        "content": "for(int i = 1; i < 100; ++i) {\n    if (i % i^2 < 11)  {\n      write(\"Door \", i^2, suffix=none);\n      write(\" is open\");\n    }\n  }\n",
        "safe": true
    },
    {
        "filename": "100_doors_630.txt",
        "content": "variable open\u00a0:= <<(* --> false)>>;\nfor (pass; 1; pass <= 100)\n    for (door_num; pass; door_num <= 100; pass)\n        open[door_num]\u00a0:=\u00a0!(open[door_num]);;;\niterate (door_num; [1...100])\n    print(\"Door \", door_num, \" is \",\n          (open[door_num]\u00a0? \"open.\\n\"\u00a0: \"closed.\\n\"));;",
        "safe": true
    },
    {
        "filename": "100_doors_631.txt",
        "content": "iterate (x; [1...10]) { iterate (y; [(x-1)*(x-1)+1...x*x-1]) { print(\"Door \", y, \" is closed.\\n\"); }; print(\"Door \", x*x, \" is open.\\n\"); };",
        "safe": true
    },
    {
        "filename": "100_doors_632.txt",
        "content": "variable y:=1;for(x;1;x<101)\"Door \"~sprint(x)~\" is \"~(x==y*y?{++y;return\"open\";}:\"closed\")!;",
        "safe": true
    },
    {
        "filename": "100_doors_633.txt",
        "content": "data _null_;\n   open=1;\n   close=0;\n   array Door{100};\n   do Pass = 1 to 100;\n      do Current = Pass to 100 by Pass;\n         if Door{Current} ne open \n            then Door{Current} = open;\n            else Door{Current} = close;\n      end;\n   end;\n   NumberOfOpenDoors = sum(of Door{*});\n   put \"Number of Open Doors:  \" NumberOfOpenDoors; \nrun;",
        "safe": true
    },
    {
        "filename": "100_doors_634.txt",
        "content": "class MAIN is\n  main is\n    doors :ARRAY{BOOL}\u00a0:= #(100);\n    loop\n      pass::= doors.ind!;\n      loop\n        i::= pass.stepto!(doors.size - 1, pass + 1);\n        doors[i]\u00a0:= ~doors[i];\n      end;\n    end;\n    loop\n      #OUT + (doors.ind! + 1) + \" \" + doors.elt! + \"\\n\";\n    end;\n  end;\nend;",
        "safe": true
    },
    {
        "filename": "100_doors_635.txt",
        "content": "for { i <- 1 to 100\n      r = 1 to 100 map (i\u00a0% _ == 0) reduceLeft (_^_)                 \n    } println (i +\" \"+ (if (r) \"open\" else \"closed\"))",
        "safe": true
    },
    {
        "filename": "100_doors_636.txt",
        "content": "def openDoors(length\u00a0: Int = 100) = {\n    var isDoorOpen = new Array[Boolean](length)\n\n    for (i <- 0 until length) {\n        for (j <- i until length by i + 1) {\n            isDoorOpen(j) ^= true\n        }\n    }\n    isDoorOpen\n}\n\nval doorState  = scala.collection.immutable.Map(false -> \"closed\", true -> \"open\")\nval isDoorOpen = openDoors()\n\nfor (doorNo <- 0 until isDoorOpen.length) {\n    println(\"Door %d is %s\".format(doorNo + 1, doorState(isDoorOpen(doorNo))))\n}",
        "safe": true
    },
    {
        "filename": "100_doors_637.txt",
        "content": "val o = 1 to 10 map (i => i * i)\nprintln(\"open: \" + o)\nprintln(\"closed: \" + (1 to 100 filterNot o.contains))",
        "safe": true
    },
    {
        "filename": "100_doors_638.txt",
        "content": "(define *max-doors* 100)\n\n(define (show-doors doors)\n  (let door ((i 0)\n             (l (vector-length doors)))\n    (cond ((= i l) \n           (newline))\n          (else \n           (printf \"~nDoor ~a is ~a\" \n                   (+ i 1) \n                   (if (vector-ref doors i) \"open\" \"closed\"))\n           (door (+ i 1) l)))))\n\n(define (flip-doors doors)\n  (define (flip-all i)\n    (cond ((> i *max-doors*) doors)\n          (else \n           (let flip ((idx (- i 1)))\n             (cond ((>= idx *max-doors*) \n                    (flip-all (+ i 1))) \n                   (else \n                    (vector-set! doors idx (not (vector-ref doors idx)))\n                    (flip (+ idx i))))))))\n  (flip-all 1))\n\n(show-doors (flip-doors (make-vector *max-doors* #f)))",
        "safe": true
    },
    {
        "filename": "100_doors_639.txt",
        "content": "(define (optimised-flip-doors doors)\n  (define (flip-all i)\n    (cond ((> i (floor (sqrt *max-doors*))) doors)\n          (else \n           (vector-set! doors (- (* i i) 1) #t)\n           (flip-all (+ i 1)))))\n  (flip-all 1))\n\n(show-doors (optimised-flip-doors (make-vector *max-doors* #f)))",
        "safe": true
    },
    {
        "filename": "100_doors_64.txt",
        "content": "#include \"share/atspre_staload.hats\"\n\nimplement\nmain0((*void*)) = let\n//\nvar A = @[bool][100](false)\nval A = $UNSAFE.cast{arrayref(bool,100)}(addr@A)\n//\nfnx\nloop\n(\n  pass: intGte(0)\n)\u00a0: void =\n  if pass < 100\n    then loop2 (pass, pass)\n  // end of [if]\nand\nloop2\n(\n  pass: natLt(100), door: intGte(0)\n)\u00a0: void =\n  if door < 100\n    then (A[door]\u00a0:= ~A[door]; loop2(pass, door+pass+1))\n    else loop(pass+1)\n  // end of [if]\n//\nfun\nloop3\n(\n  door: intGte(0)\n)\u00a0: void =\n  if door < 100\n    then (\n      println!(\"door #\", door+1, \" is \", (if A[door] then \"open\" else \"closed\"): string, \".\");\n      loop3(door+1)\n    ) (* end of [then] *)\n  // end of [if]\n//\nin\n  loop(0); loop3 (0)\nend // end of [main0]",
        "safe": true
    },
    {
        "filename": "100_doors_640.txt",
        "content": "(define (N_doors N)\n  (define (init)\n    (define (str n)\n      (if (> n N) '() (cons 0 (str (+ 1 n)))))\n    (str 1))\n  (define (toggle x str)\n    (define (s n lis)\n      (define (revert x)\n        (if (eq? x 0) 1 0))\n      (cond ((null? lis) '())\n          ((zero? (remainder n x)) (cons (revert (car lis)) (s (+ n 1) (cdr lis))))\n          (else (cons (car lis) (s (+ n 1) (cdr lis))))))\n    (s 1 str))\n  (define (iterate x lis)\n    (if (> x N) lis (iterate (+ x 1) (toggle x lis))))\n  (iterate 1 (init)))\n(N_doors 100)",
        "safe": true
    },
    {
        "filename": "100_doors_641.txt",
        "content": "(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)\n",
        "safe": true
    },
    {
        "filename": "100_doors_642.txt",
        "content": "doors=zeros(1,100);\nfor i = 1:100\n  for j = i:i:100\n    doors(j) = ~doors(j);\n  end\nend\nfor i = 1:100\n  if ( doors(i) )\n    s = \"open\";\n  else\n    s = \"closed\";\n  end\n  printf(\"%d %s\\n\", i, s);\nend",
        "safe": true
    },
    {
        "filename": "100_doors_643.txt",
        "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\n13 closed\n14 closed\n15 closed\n16 open\n17 closed\n18 closed\n19 closed\n20 closed\n21 closed\n22 closed\n23 closed\n24 closed\n25 open\n26 closed\n27 closed\n28 closed\n29 closed\n30 closed\n31 closed\n32 closed\n33 closed\n34 closed\n35 closed\n36 open\n37 closed\n38 closed\n39 closed\n40 closed\n41 closed\n42 closed\n43 closed\n44 closed\n45 closed\n46 closed\n47 closed\n48 closed\n49 open\n50 closed\n51 closed\n52 closed\n53 closed\n54 closed\n55 closed\n56 closed\n57 closed\n58 closed\n59 closed\n60 closed\n61 closed\n62 closed\n63 closed\n64 open\n65 closed\n66 closed\n67 closed\n68 closed\n69 closed\n70 closed\n71 closed\n72 closed\n73 closed\n74 closed\n75 closed\n76 closed\n77 closed\n78 closed\n79 closed\n80 closed\n81 open\n82 closed\n83 closed\n84 closed\n85 closed\n86 closed\n87 closed\n88 closed\n89 closed\n90 closed\n91 closed\n92 closed\n93 closed\n94 closed\n95 closed\n96 closed\n97 closed\n98 closed\n99 closed\n100 open\n",
        "safe": true
    },
    {
        "filename": "100_doors_644.txt",
        "content": "$ include \"seed7_05.s7i\";\n \nconst proc: main is func\n  local\n    var array boolean: doorOpen is 100 times FALSE;\n    var integer: pass is 0;\n    var integer: index is 0;\n    var array[boolean] string: closedOrOpen is [boolean] (\"closed\", \"open\");\n  begin\n    for pass range 1 to 100 do\n      for key index range doorOpen do\n        if index rem pass = 0 then\n          doorOpen[index]\u00a0:= not doorOpen[index];\n        end if;\n      end for;\n    end for;\n    for key index range doorOpen do\n      write(index lpad 3 <& \" is \" <& closedOrOpen[doorOpen[index]] rpad 7);\n      if index rem 5 = 0 then\n        writeln;\n      end if;\n    end for;\n  end func;",
        "safe": true
    },
    {
        "filename": "100_doors_645.txt",
        "content": "$ include \"seed7_05.s7i\";\n\nconst proc: main is func\n  local\n    var integer: index is 0;\n    var integer: number is 0;\n    var array[boolean] string: closedOrOpen is [boolean] (\"closed\", \"open\");\n  begin\n    for index range 1 to 100 do\n      number\u00a0:= sqrt(index);\n      write(index lpad 3 <& \" is \" <& closedOrOpen[number**2 = index] rpad 7);\n      if index rem 5 = 0 then\n        writeln;\n      end if;\n    end for;\n  end func;",
        "safe": true
    },
    {
        "filename": "100_doors_646.txt",
        "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 \n 11 is closed  12 is closed  13 is closed  14 is closed  15 is closed \n 16 is open    17 is closed  18 is closed  19 is closed  20 is closed \n 21 is closed  22 is closed  23 is closed  24 is closed  25 is open   \n 26 is closed  27 is closed  28 is closed  29 is closed  30 is closed \n 31 is closed  32 is closed  33 is closed  34 is closed  35 is closed \n 36 is open    37 is closed  38 is closed  39 is closed  40 is closed \n 41 is closed  42 is closed  43 is closed  44 is closed  45 is closed \n 46 is closed  47 is closed  48 is closed  49 is open    50 is closed \n 51 is closed  52 is closed  53 is closed  54 is closed  55 is closed \n 56 is closed  57 is closed  58 is closed  59 is closed  60 is closed \n 61 is closed  62 is closed  63 is closed  64 is open    65 is closed \n 66 is closed  67 is closed  68 is closed  69 is closed  70 is closed \n 71 is closed  72 is closed  73 is closed  74 is closed  75 is closed \n 76 is closed  77 is closed  78 is closed  79 is closed  80 is closed \n 81 is open    82 is closed  83 is closed  84 is closed  85 is closed \n 86 is closed  87 is closed  88 is closed  89 is closed  90 is closed \n 91 is closed  92 is closed  93 is closed  94 is closed  95 is closed \n 96 is closed  97 is closed  98 is closed  99 is closed 100 is open   \n",
        "safe": true
    },
    {
        "filename": "100_doors_647.txt",
        "content": "put false repeated 100 times as a list into Doors100\n\nrepeat 1 to 100\n\tset step to it\n\trepeat step to 100 by step \n\t\tset newValue to not item it of Doors100\n\t\tset item it of Doors100 to newValue\n\tend repeat\nend repeat\n\nput the counter for each item of Doors100 which is true",
        "safe": true
    },
    {
        "filename": "100_doors_648.txt",
        "content": "(1,4,9,16,25,36,49,64,81,100)",
        "safe": true
    },
    {
        "filename": "100_doors_649.txt",
        "content": "import <Utilities/Sequence.sl>;\n\nmain:=\n\tlet\n\t\tdoors\u00a0:= flipDoors(duplicate(false, 100), 1);\n\t\topen[i]\u00a0:= i when doors[i];\n\tin\n\t\topen;\n\t\nflipDoors(doors(1), count)\u00a0:=\n\tlet\n\t\tnewDoors[i]\u00a0:= not doors[i] when i mod count = 0 else doors[i];\n\tin\n\t\tdoors when count >= 100 else flipDoors(newDoors, count + 1);",
        "safe": true
    },
    {
        "filename": "100_doors_65.txt",
        "content": "Loop, 100\n  Door%A_Index% := \"closed\"\n\nLoop, 100 {\n  x := A_Index, y := A_Index\n  While (x <= 100)\n  {\n    CurrentDoor := Door%x%\n    If CurrentDoor contains closed\n    {\n      Door%x% := \"open\"\n      x += y\n    }\n    else if CurrentDoor contains open\n    {\n      Door%x% := \"closed\"\n      x += y\n    }\n  }\n}\n\nLoop, 100 {\n   CurrentDoor := Door%A_Index%\n   If CurrentDoor contains open\n      Res .= \"Door \" A_Index \" is open`n\"\n}\nMsgBox % Res\n",
        "safe": true
    },
    {
        "filename": "100_doors_650.txt",
        "content": "main\u00a0:= flipDoors([1], 2);\n\nflipDoors(openDoors(1), i)\u00a0:=\n\topenDoors when i * i >= 100 else flipDoors(openDoors ++ [i * i], i + 1);",
        "safe": true
    },
    {
        "filename": "100_doors_651.txt",
        "content": "program hundred_doors;\n\nconst toggle\u00a0:= {['open', 'closed'], ['closed', 'open']};\n\ndoorStates\u00a0:= ['closed'] * 100;\n\n(for interval in [1..100])\n  doorStates\u00a0:= [if i mod interval = 0 then\n                    toggle(prevState) else\n                    prevState end:\n                 prevState = doorStates(i)];\nend;\n\n(for finalState = doorStates(i))\n  print('door', i, 'is', finalState);\nend;\n\nend program;",
        "safe": true
    },
    {
        "filename": "100_doors_652.txt",
        "content": "program hundred_doors;\n\ndoorStates\u00a0:= (+/ [['closed'] * oddNum with 'open': oddNum in [1,3..17]]);\n\n(for finalState = doorStates(i))\n  print('door', i, 'is', finalState);\nend;\n\nend program;",
        "safe": true
    },
    {
        "filename": "100_doors_653.txt",
        "content": "!%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n!         I n i t i a l i z a t i o n\n!%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\ndoors% = 100\n\ndim doorArray?(doors%)\n\n!%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n!         M a i n   L o g i c   A r e a\n!%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\n// Initialize Array\nfor index% = 1 to doors%\n  doorArray?(index%) = false\nnext index%\n\n// Execute routine\ntoggle_doors\n\n// Print results\nfor index% = 1 to doors%\n  if doorArray?(index%) = true then print index%, ' is open'\nnext index%\n\n\nstop\n\n\n!%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n!         R o u t i n e s\n!%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\nroutine toggle_doors\n  for index_outer% = 1 to doors%\n    for index_inner% = 1 to doors%\n      if mod(index_inner%, index_outer%) = 0 then\n        doorArray?(index_inner%) = not doorArray?(index_inner%) \n      end if\n    next index_inner%\n  next index_outer%\nend routine\n\n\nend",
        "safe": true
    },
    {
        "filename": "100_doors_654.txt",
        "content": "var doors = []\n\n{ |pass|\n    { |i|\n        if (pass `divides` i) {\n            doors[i]\u00a0:= false -> not!\n        }\n    } << 1..100\n} << 1..100\n\n{ |i|\n    say (\"Door %3d is %s\"\u00a0% (i, doors[i]\u00a0? 'open'\u00a0: 'closed'))\n} << 1..100",
        "safe": true
    },
    {
        "filename": "100_doors_655.txt",
        "content": "{ |i|\n    \"Door\u00a0%3d is\u00a0%s\\n\".printf(i, <closed open>[i.is_sqr])\n} << 1..100",
        "safe": true
    },
    {
        "filename": "100_doors_656.txt",
        "content": "BEGIN\n    INTEGER LIMIT = 100, door, stride;\n    BOOLEAN ARRAY DOORS(1:LIMIT);\n    TEXT intro;\n\n    FOR stride\u00a0:= 1 STEP 1 UNTIL LIMIT DO\n        FOR door\u00a0:= stride STEP stride UNTIL LIMIT DO\n            DOORS(door)\u00a0:= NOT DOORS(door);\n\n    intro\u00a0:- \"All doors closed but \";\n    FOR door\u00a0:= 1 STEP 1 UNTIL LIMIT DO\n        IF DOORS(door) THEN BEGIN\n            OUTTEXT(intro); OUTINT(door, 0); intro\u00a0:- \", \"\n        END;\n    OUTIMAGE\nEND.",
        "safe": true
    },
    {
        "filename": "100_doors_657.txt",
        "content": "All doors closed but 1, 4, 9, 16, 25, 36, 49, 64, 81, 100",
        "safe": true
    },
    {
        "filename": "100_doors_658.txt",
        "content": "define: #a -> (Array newSize: 100).\na infect: [| :_ | False].\n\na keysDo: [| :pass |\n  pass to: a indexLast by: pass do: [| :door |\n    a at: door infect: #not `er]].\n\na keysAndValuesDo: [| :door :isOpen |\n  inform: 'door #'\u00a0; door\u00a0; ' is '\u00a0; (isOpen ifTrue: ['open'] ifFalse: ['closed'])].",
        "safe": true
    },
    {
        "filename": "100_doors_659.txt",
        "content": "define: #a -> (Array newSize: 100).\na infect: [| :_ | False].\n\n0 below: 10 do: [| :door | a at: door squared put: True].\na keysAndValuesDo: [| :door :isOpen |\n  inform: 'door #'\u00a0; door\u00a0; ' is '\u00a0; (isOpen ifTrue: ['open'] ifFalse: ['closed'])].",
        "safe": true
    },
    {
        "filename": "100_doors_66.txt",
        "content": "increment := 3, square := 1 \nLoop, 100 \n    If (A_Index = square) \n        outstring .= \"`nDoor \" A_Index \" is open\" \n        ,square += increment, increment += 2 \nMsgBox,, Succesfull, % SubStr(outstring, 2)\n",
        "safe": true
    },
    {
        "filename": "100_doors_660.txt",
        "content": "|a|\na\u00a0:= Array new: 100 .\n1 to: 100 do: [ :i | a at: i put: false ].\n\n1 to: 100 do: [ :pass |\n  pass to: 100 by: pass do: [ :door |\n    a at: door put: (a at: door) not .\n  ]\n].\n\n\"output\"\n1 to: 100 do: [ :door |\n   ( 'door #%1 is %2'\u00a0%\n     { door . (a at: door) ifTrue: [ 'open' ] ifFalse: [ 'closed' ] } ) displayNl\n]",
        "safe": true
    },
    {
        "filename": "100_doors_661.txt",
        "content": "|a|\na\u00a0:= (1 to: 100) collect: [ :x | false ].\n1 to: 10 do: [ :i | a at: (i squared) put: true ].\n1 to: 100 do: [ :i |\n   ( 'door #%1 is %2'\u00a0% { i . \n           (a at: i) ifTrue: [ 'open' ] \n                     ifFalse: [ 'closed' ] }\n   ) displayNl\n]",
        "safe": true
    },
    {
        "filename": "100_doors_662.txt",
        "content": "| m w h smh smw delay closedDoor border subMorphList |\n\nclosedDoor\u00a0:= Color black.\nborder\u00a0:= Color veryLightGray.\ndelay\u00a0:= Delay forMilliseconds: 50.\nw\u00a0:= World bounds corner x.\nh\u00a0:= (World bounds corner y) / 2.\nsmw\u00a0:= w/100.\nsmh\u00a0:= h/2.\n\nm\u00a0:= BorderedMorph new position: 0@h.\nm height: smh; width: w; borderColor: border.\nm color: Color veryLightGray.\n\n1 to: 100 do: [ :pos || sm |\n\tsm\u00a0:= BorderedMorph new height: smh\u00a0; width: smw\u00a0; \n\t\tborderColor: border; color: closedDoor; \n\t\tposition: (smw*pos)@h.\n\tm addMorph: sm asElementNumber: pos].\n\nm openInWorld.\ndelay wait.\nsubMorphList\u00a0:= m submorphs.\n\"display every step\"\n[1 to: 100 do: [ :step |\n\tstep to: 100 by: step do: [ :pos | | subMorph |\n\t\tsubMorph\u00a0:= subMorphList at: pos.\n\t\tsubMorph color: subMorph color negated.\n\t\tdelay wait]]] fork.",
        "safe": true
    },
    {
        "filename": "100_doors_663.txt",
        "content": "x=1!y=3!z=0\nPRINT \"Open doors: \";x;\" \";\nDO\n    z=x+y\n    PRINT z;\" \";\n    x=z\n    y=y+2\nUNTIL z>=100\nEND",
        "safe": true
    },
    {
        "filename": "100_doors_664.txt",
        "content": "\t\tDEFINE('PASS(A,I),O')\t\t:(PASS.END)\nPASS\t\tO = 0\nPASS.LOOP\tO = O + I\n\t\tEQ(A<O>,1)\t\t\t:S(PASS.1)F(PASS.0)\nPASS.0\t\tA<O> = 1\t\t\t:S(PASS.LOOP)F(RETURN)\nPASS.1\t\tA<O> = 0\t\t\t:S(PASS.LOOP)F(RETURN)\nPASS.END\n \nMAIN\t\tD = ARRAY(100,0)\n\t\tI = 0\n \nMAIN.LOOP\tI = LE(I,100) I + 1\t\t:F(OUTPUT)\n\t\tPASS(D,I)\t\t\t:(MAIN.LOOP)\n \nOUTPUT\t\tI = 1\u00a0; OPEN = 'Opened doors are: '\nOUTPUT.LOOP\tOPEN = OPEN EQ(D<I>,1) \" \" I\n\t\tI = LE(I,100) I + 1\t\t:S(OUTPUT.LOOP)F(OUTPUT.WRITE)\nOUTPUT.WRITE\tOUTPUT = OPEN\n\nEND",
        "safe": true
    },
    {
        "filename": "100_doors_665.txt",
        "content": "$ snobol4 100doors.sno \nThe Macro Implementation of SNOBOL4 in C (CSNOBOL4) Version 1.3+\n    by Philip L. Budne, January 23, 2011\nSNOBOL4 (Version 3.11, May 19, 1975)\n    Bell Telephone Laboratories, Incorporated\n\nNo errors detected in source program\n\nOpened doors are:  1 4 9 16 25 36 49 64 81 100\nNormal termination at level 0\n100doors.sno:18: Last statement executed was 19\n",
        "safe": true
    },
    {
        "filename": "100_doors_666.txt",
        "content": "MAIN\t\tD = ARRAY(100,0)\n\t\tI = 1\n\nMAIN.LOOP\tLE(I, 10)\t\t\t:F(OUTPUT)\n\t\tD<I ** 2> = 1\t\t\n\t\tI = I + 1\t\t\t:(MAIN.LOOP)\n\nOUTPUT\t\tI = 1\u00a0; O = 'Opened doors are: '\nOUTPUT.LOOP\tO = O EQ(D<I>,1) \" \" I\n\t\tI = LE(I,100) I + 1\t\t:S(OUTPUT.LOOP)F(OUTPUT.WRITE)\nOUTPUT.WRITE\tOUTPUT = O\nEND",
        "safe": true
    },
    {
        "filename": "100_doors_667.txt",
        "content": "#!/usr/local/bin/spar\npragma annotate( summary, \"doors\" )\n       @( description, \"Problem: You have 100 doors in a row that are all initially closed. You\" )\n       @( description, \"make 100 passes by the doors. The first time through, you visit every door\" )\n       @( description, \"and toggle the door (if the door is closed, you open it; if it is open, you\" )\n       @( description, \"close it). The second time you only visit every 2nd door (door #2, #4, #6,\" )\n       @( description, \"...). The third time, every 3rd door (door #3, #6, #9, ...), etc, until you\" )\n       @( description, \"only visit the 100th door.\" )\n       @( description, \"Question: What state are the doors in after the last pass? Which are open,\" )\n       @( description, \"which are closed?\" )\n       @( see_also, \"http://rosettacode.org/wiki/100_doors\" )\n       @( author, \"Ken O. Burtch\" );\npragma license( unrestricted );\n\npragma restriction( no_external_commands );\n\nprocedure Doors is\n   type Door_State is (Closed, Open);\n   type Door_List is array(1..100) of Door_State;\n   The_Doors\u00a0: Door_List;\nbegin\n   for I in 1..100 loop\n      The_Doors(I)\u00a0:= Closed;\n   end loop;\n   for I in 1..100 loop\n      for J in arrays.first(The_Doors)..arrays.last(The_Doors) loop\n         if J mod I = 0 then\n            if The_Doors(J) = Closed then\n                The_Doors(J)\u00a0:= Open;\n            else\n               The_Doors(J)\u00a0:= Closed;\n            end if;\n         end if;\n      end loop;\n   end loop;\n   for I in arrays.first(The_Doors)..arrays.last(The_Doors) loop\n      put (I) @ (\" is \") @ (The_Doors(I));\n      new_line;\n   end loop;\nend Doors;",
        "safe": true
    },
    {
        "filename": "100_doors_668.txt",
        "content": "/* declare the variables */\nvar isOpen = {};\nvar pass, door;\n\n/* initialize the doors */\nfor door = 0; door < 100; door++ {\n\tisOpen[door] = true;\n}\n\n/* do the 99 remaining passes */\nfor pass = 1; pass < 100; ++pass {\n\tfor door = pass; door < 100; door += pass+1 {\n  \t\tisOpen[door] = !isOpen[door];\n\t}\n}\n\n/* print the results */\nvar states = { true: \"open\", false: \"closed\" };\nfor door = 0; door < 100; door++ {\n\tprintf(\"Door #%d is %s.\\n\", door+1, states[isOpen[door]]);\n}",
        "safe": true
    },
    {
        "filename": "100_doors_669.txt",
        "content": "/* declare the variables */\nvar door_sqrt = 1;\nvar door;\n\n/* print the perfect square doors as open */\nfor door = 0; door < 100; door++ {\n\tif (door_sqrt*door_sqrt == door+1) {\n\t\tprintf(\"Door #%d is open.\\n\", door+1);\n\t\tdoor_sqrt ++;\n\t} else {\n\t\tprintf(\"Door #%d is closed.\\n\", door+1);\n\t}\n}",
        "safe": true
    },
    {
        "filename": "100_doors_67.txt",
        "content": "While (Door := A_Index ** 2) <= 100\n   Result .= \"Door \" Door \" is open`n\"\nMsgBox, %Result%\n",
        "safe": true
    },
    {
        "filename": "100_doors_670.txt",
        "content": "con\n  _clkmode = xtal1+pll16x\n  _clkfreq = 80_000_000\n\nobj\n  ser\u00a0: \"FullDuplexSerial.spin\"\n\npub init\n  ser.start(31, 30, 0, 115200)\n\n  doors\n\n  waitcnt(_clkfreq + cnt)\n  ser.stop\n  cogstop(0)\n\nvar\n\n  byte door[101] ' waste one byte by using only door[1..100]\n\npri doors | i,j\n\n  repeat i from 1 to 100\n    repeat j from i to 100 step i\n      not door[j]\n\n  ser.str(string(\"Open doors: \"))\n\n  repeat i from 1 to 100\n    if door[i]\n      ser.dec(i)\n      ser.tx(32)\n\n  ser.str(string(13,10))",
        "safe": true
    },
    {
        "filename": "100_doors_671.txt",
        "content": "Open doors: 1 4 9 16 25 36 49 64 81 100 \n",
        "safe": true
    },
    {
        "filename": "100_doors_672.txt",
        "content": "DECLARE\t@sqr int,\n\t\t@i int,\n\t\t@door int;\n\t\t\nSELECT @sqr =1,\n\t@i = 3,\n\t@door = 1;\t\n\t\t\t\t\nWHILE(@door <=100)\nBEGIN\n\tIF(@door = @sqr)\n\tBEGIN\n\t\tPRINT 'Door ' + RTRIM(CAST(@door as char)) + ' is open.';\n\t\tSET @sqr= @sqr+@i;\n\t\tSET @i=@i+2;\n\tEND\n\tELSE\n\tBEGIN\n\t\tPRINT 'Door ' + RTRIM(CONVERT(char,@door)) + ' is closed.';\n\tEND\nSET @door = @door + 1\nEND",
        "safe": true
    },
    {
        "filename": "100_doors_673.txt",
        "content": "with numbers as (\n    select generate_series(1, 100) as n\n),\npasses as (\n    select passes.n pass, doors.n door \n    from numbers doors\n    cross join numbers passes \n    where doors.n\u00a0% passes.n = 0  -- modulo\n),\ncounting as (\n    select door, count(pass) pass_number \n    from passes\n    group by door\n) \nselect door from counting\nwhere pass_number\u00a0% 2 = 1\norder by door",
        "safe": true
    },
    {
        "filename": "100_doors_674.txt",
        "content": "with numbers as (\n    select rownum as n from dual connect by level <= 100\n),\npasses as (\n    select doors.n door, count(passes.n) pass_number\n    from numbers doors\n    cross join numbers passes \n    where MOD(doors.n, passes.n) = 0  -- modulo\n    group by doors.n\n)\nselect door from passes\nwhere MOD(pass_number, 2) = 1\norder by door",
        "safe": true
    },
    {
        "filename": "100_doors_675.txt",
        "content": "door|\n----+\n   1|\n   4|\n   9|\n   ...\n",
        "safe": true
    },
    {
        "filename": "100_doors_676.txt",
        "content": "--#SET TERMINATOR @\n\nSET SERVEROUTPUT ON @\n\nBEGIN\n DECLARE TYPE DOORS_ARRAY AS BOOLEAN ARRAY [100];\n DECLARE DOORS DOORS_ARRAY;\n DECLARE I SMALLINT;\n DECLARE J SMALLINT;\n DECLARE STATUS CHAR(10);\n DECLARE SIZE SMALLINT DEFAULT 100;\n\n -- Initializes the array, with all spaces (doors) as false (closed).\n SET I = 1;\n WHILE (I <= SIZE) DO\n  SET DOORS[I] = FALSE;\n  SET I = I + 1;\n END WHILE;\n\n -- Processes the doors.\n SET I = 1;\n WHILE (I <= SIZE) DO\n  SET J = 1;\n  WHILE (J <= SIZE) DO\n   IF (MOD(J, I) = 0) THEN\n    IF (DOORS[J] = TRUE) THEN\n     SET DOORS[J] = FALSE;\n    ELSE\n     SET DOORS[J] = TRUE;\n    END IF;\n   END IF;\n   SET J = J + 1;\n  END WHILE;\n  SET I = I + 1;\n END WHILE;\n\n -- Prints the final status o the doors.\n SET I = 1;\n WHILE (I <= SIZE) DO\n  SET STATUS = (CASE WHEN (DOORS[I] = TRUE) THEN 'OPEN' ELSE 'CLOSED' END);\n  CALL DBMS_OUTPUT.PUT_LINE('Door ' || I || ' is '|| STATUS);\n  SET I = I + 1;\n END WHILE;\nEND @",
        "safe": true
    },
    {
        "filename": "100_doors_677.txt",
        "content": "db2 -td@\ndb2 => BEGIN\n...\ndb2 (cont.) => END @\nDB20000I  The SQL command completed successfully.\n\nDoor 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",
        "safe": true
    },
    {
        "filename": "100_doors_678.txt",
        "content": "datatype Door = Closed | Opened\n\nfun toggle Closed = Opened\n  | toggle Opened = Closed\n\nfun pass (step, doors) = List.map (fn (index, door) => if (index mod step) = 0\n\t\t\t\t\t\t       then (index, toggle door)\n\t\t\t\t\t\t       else (index, door))\n\t\t\t\t  doors\n\n(* [1..n] *)\nfun runs n = List.tabulate (n, fn k => k+1)\n\nfun run n =\n    let\n\tval initialdoors = List.tabulate (n, fn i => (i+1, Closed))\n\tval counter = runs n\n    in\n\tfoldl pass initialdoors counter\n    end\n\nfun opened_doors n = List.mapPartial (fn (index, Closed) => NONE\n\t\t\t\t       | (index, Opened) => SOME (index))\n\t\t\t\t     (run n)",
        "safe": true
    },
    {
        "filename": "100_doors_679.txt",
        "content": "- opened_doors 100;\nval it = [1,4,9,16,25,36,49,64,81,100]\u00a0: int list\n",
        "safe": true
    },
    {
        "filename": "100_doors_68.txt",
        "content": "#include <array.au3>\n$doors = 100\n\n;door array, 0 = closed, 1 = open\nLocal $door[$doors +1]\n\nFor $ii = 1 To $doors\n\tFor $i = $ii To $doors Step $ii\n\t\t$door[$i] = Not $door[$i]\n\tnext\nNext\n\n;display to screen\nFor $i = 1 To $doors\n\tConsoleWrite (Number($door[$i])& \" \")\n\tIf Mod($i,10) = 0 Then ConsoleWrite(@CRLF)\nNext\n",
        "safe": true
    },
    {
        "filename": "100_doors_680.txt",
        "content": "clear\nset obs 100\ngen doors=0\ngen index=_n\nforvalues i=1/100 {\n\tquietly replace doors=!doors if mod(_n,`i')==0\n}\nlist index if doors, noobs noheader\n\n  +-------+\n  |     1 |\n  |     4 |\n  |     9 |\n  |    16 |\n  |    25 |\n  |-------|\n  |    36 |\n  |    49 |\n  |    64 |\n  |    81 |\n  |   100 |\n  +-------+",
        "safe": true
    },
    {
        "filename": "100_doors_681.txt",
        "content": "d \".\"\n#d\ni d\n#i\np \"door\" #i\n*p *p \".\"\ni d f \"oc\"\ni d #@f #*p\ni d .\\f \"o\" $ #i\ni i d\n#i +101 i \"\"\n#i\nd d \".\"\n#d +101 d \"\"\n#d",
        "safe": true
    },
    {
        "filename": "100_doors_682.txt",
        "content": "1\n4\n9\n16\n25\n36\n49\n64\n81\n100",
        "safe": true
    },
    {
        "filename": "100_doors_683.txt",
        "content": "(\nvar n = 100, doors = false\u00a0! n;\nvar pass = { |j| (0, j .. n-1).do { |i| doors[i] = doors[i].not } };\n(1..n-1).do(pass);\ndoors.selectIndices { |open| open }; // all are closed except [ 0, 1, 4, 9, 16, 25, 36, 49, 64, 81 ]\n)",
        "safe": true
    },
    {
        "filename": "100_doors_684.txt",
        "content": "/* declare enum to identify the state of a door */\nenum DoorState\u00a0: String {\n    case Opened = \"Opened\"\n    case Closed = \"Closed\"\n}\n\n/* declare list of doors state and initialize them */\nvar doorsStateList = [DoorState](count: 100, repeatedValue: DoorState.Closed)\n\n/* do the 100 passes */\nfor i in 1...100 {\n    /* map on a strideTo instance to only visit the needed doors on each iteration */\n    map(stride(from: i - 1, to: 100, by: i)) {\n        doorsStateList[$0] = doorsStateList[$0] == .Opened\u00a0? .Closed\u00a0: .Opened\n    }\n}\n\n/* print the results */\nfor (index, item) in enumerate(doorsStateList) {\n    println(\"Door \\(index+1) is \\(item.rawValue)\")\n}",
        "safe": true
    },
    {
        "filename": "100_doors_685.txt",
        "content": "/* declare enum to identify the state of a door */\nenum DoorState\u00a0: String {\n    case Opened = \"Opened\"\n    case Closed = \"Closed\"\n}\n\n/* declare list of doors state and initialize them */\nvar doorsStateList = [DoorState](count: 100, repeatedValue: DoorState.Closed)\n\n/* set i^2 doors to opened */\nvar i = 1\ndo {\n    doorsStateList[(i*i)-1] = DoorState.Opened\n    ++i\n} while (i*i) <= doorsStateList.count\n\n/* print the results */\nfor (index, item) in enumerate(doorsStateList) {\n    println(\"Door \\(index+1) is \\(item.rawValue)\")\n}",
        "safe": true
    },
    {
        "filename": "100_doors_686.txt",
        "content": "var arr: [Bool] = Array(1...100).map{ remquo(exp(log(Float($0))/2.0),1).0 == 0 }",
        "safe": true
    },
    {
        "filename": "100_doors_687.txt",
        "content": "source hundredDoors\n  @: [ 1..100 -> 0 ];\n  templates toggle\n    def jump: $;\n    $jump..100:$jump -> \\(\n      when <?($@hundredDoors($) <=0>)> do @hundredDoors($): 1;\n      otherwise @hundredDoors($): 0;\n    \\) -> !VOID\n  end toggle\n  1..100 -> toggle -> !VOID\n  $@ -> \\[i](<=1> ' $i;'\u00a0!\\)\u00a0!\nend hundredDoors\n\n$hundredDoors -> 'Open doors:$...;' -> !OUT::write",
        "safe": true
    },
    {
        "filename": "100_doors_688.txt",
        "content": "hundredDoors source\n  @ set [ 1..100 -> 0 ];\n  toggle templates\n    jump is $;\n    $jump..100:$jump -> templates\n      when <|?($@hundredDoors($) matches <|=0>)> do @hundredDoors($) set 1;\n      otherwise @hundredDoors($) set 0;\n    end -> !VOID\n  end toggle\n  1..100 -> toggle -> !VOID\n  $@(.. as i; -> if <|=1> -> ' $i;')\u00a0!\nend hundredDoors\n\n$hundredDoors -> 'Open doors:$...;'\u00a0!",
        "safe": true
    },
    {
        "filename": "100_doors_689.txt",
        "content": "Open doors: 1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100_doors_69.txt",
        "content": "BEGIN {\n  for(i=1; i <= 100; i++)\n  {\n    doors[i] = 0 # close the doors\n  }\n  for(i=1; i <= 100; i++)\n  {\n    for(j=i; j <= 100; j += i)\n    {\n      doors[j] = (doors[j]+1) % 2\n    }\n  }\n  for(i=1; i <= 100; i++)\n  {\n    print i, doors[i] ? \"open\" : \"close\"\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "100_doors_690.txt",
        "content": "package require Tcl 8.5\nset n 100\nset doors [concat - [lrepeat $n 0]]\nfor {set step 1} {$step <= $n} {incr step} {\n    for {set i $step} {$i <= $n} {incr i $step} {\n        lset doors $i [expr {\u00a0! [lindex $doors $i]}]\n    }\n}\nfor {set i 1} {$i <= $n} {incr i} {\n    puts [format \"door %d is %s\" $i [expr {[lindex $doors $i]\u00a0? \"open\"\u00a0: \"closed\"}]]\n}",
        "safe": true
    },
    {
        "filename": "100_doors_691.txt",
        "content": "package require Tcl 8.5\nset doors [lrepeat [expr {$n + 1}] closed]\nfor {set i 1} {$i <= sqrt($n)} {incr i} {\n    lset doors [expr {$i ** 2}] open\n}\nfor {set i 1} {$i <= $n} {incr i} {\n    puts [format \"door %d is %s\" $i [lindex $doors $i]]\n}",
        "safe": true
    },
    {
        "filename": "100_doors_692.txt",
        "content": "package require Tcl 8.5\npackage require Tk\n\narray set door_status {}\n\n# create the gui\nset doors [list x]\nfor {set i 0} {$i < 10} {incr i} {\n    for {set j 0} {$j < 10} {incr j} {\n        set k [expr {1 + $j + 10*$i}]\n        lappend doors [radiobutton .d_$k -text $k -variable door_status($k) \\\n                         -indicatoron no -offrelief flat -width 3 -value open]\n        grid [lindex $doors $k] -column $j -row $i\n    }\n}\n\n# create the controls\nbutton .start -command go -text Start\nlabel .i_label -text \" door:\"\nentry .i -textvariable i -width 4\nlabel .step_label -text \" step:\"\nentry .step -textvariable step -width 4\ngrid .start - .i_label - .i - .step_label - .step - -row $i\ngrid configure .start -sticky ew\ngrid configure .i_label .step_label -sticky e\ngrid configure .i .step -sticky w\n\nproc go {} {\n    global doors door_status i step\n\n    # initialize the door_status (all closed)\n    for {set d 1} {$d <= 100} {incr d} {\n        set door_status($d) closed\n    }\n    \n    # now, begin opening and closing\n    for {set step 1} {$step <= 100} {incr step} {\n        for {set i 1} {$i <= 100} {incr i} {\n            if {$i\u00a0% $step == 0} {\n                [lindex $doors $i] [expr {$door_status($i) eq \"open\"\u00a0? \"deselect\"\u00a0: \"select\"}]\n                update\n                after 50\n            }\n        }\n    }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_693.txt",
        "content": "seq(0,X,1,100\nFor(X,1,100\n0 or Ans-not(fPart(cumSum(1 or Ans)/A\nEnd\nPause Ans\n",
        "safe": true
    },
    {
        "filename": "100_doors_694.txt",
        "content": "Pause not(fPart(\u221a(seq(X,X,1,100\n",
        "safe": true
    },
    {
        "filename": "100_doors_695.txt",
        "content": "Define doors(fast) = Func\n  Local doors,i,j\n  seq(false,x,1,100)\u00a0? doors\n  If fast Then\n    For i,1,10,1\n      true\u00a0? doors[i^2]\n    EndFor\n  Else\n    For i,1,100,1\n      For j,i,100,i\n        not doors[j]\u00a0? doors[j]\n      EndFor\n    EndFor\n  EndIf\n  Return doors\nEndFunc",
        "safe": true
    },
    {
        "filename": "100_doors_696.txt",
        "content": "for(%steps = 1; %a <= 100; %a++)\n\tfor(%current = %steps; %current <= 100; %current += %steps)\n\t\t%door[%current] =\u00a0!%door[%current];\nfor(%a = 1; %a <= 100; %a++)\n\techo(\"Door #\" @ %a @ \" is\" SPC %door[%current]\u00a0? \"Open\"\u00a0: \"Closed\" @ \".\");",
        "safe": true
    },
    {
        "filename": "100_doors_697.txt",
        "content": "WITH    OneToTen (N)\nAS  (   SELECT  N\n        FROM (  VALUES (0), (1), (2), (3), (4), (5), (6), (7), (8), (9)\n                ) V(N)\n        )\n    ,   InitDoors (Num, IsOpen)\nAS  (   SELECT  1\n            +   1 * Units.N\n            +   10 * Tens.N As Num\n            ,   Convert(Bit, 0) As IsOpen\n        FROM    OneToTen As Units\n        CROSS JOIN  OneToTen As Tens\n        ) -- This part could be easier with a tally table or equivalent table-valued function\n    ,   States (NbStep, Num, IsOpen)\nAS  (   SELECT  0 As NbStep\n            ,   Num\n            ,   IsOpen\n        FROM    InitDoors As InitState\n        UNION ALL\n        SELECT  1 + NbStep\n            ,   Num\n            ,   CASE Num\u00a0% (1 + NbStep)\n                    WHEN 0 THEN ~IsOpen\n                    ELSE IsOpen\n                END\n        FROM    States\n        WHERE   NbStep < 100\n        )\nSELECT  Num As DoorNumber\n    ,   Concat( 'Door number ', Num, ' is '\n            ,   CASE IsOpen\n                    WHEN 1 THEN ' open'\n                    ELSE ' closed'\n                END ) As Result -- Concat needs SQL Server 2012\nFROM    States\nWHERE   NbStep = 100\nORDER By Num\n; -- Fortunately, maximum recursion is 100 in SQL Server.\n-- For more doors, the MAXRECURSION hint should be used.\n-- More doors would also need an InitDoors with more rows.",
        "safe": true
    },
    {
        "filename": "100_doors_698.txt",
        "content": "SET NOCOUNT ON;\n\n-- Doors can be open or closed.\nDECLARE @open CHAR(1) = 'O';\nDECLARE @closed CHAR(1) = 'C';\n\n-- There are 100 doors in a row that are all initially closed.\nDECLARE @doorsCount INT = 100;\nDECLARE @doors TABLE (doorKey INT PRIMARY KEY, doorState CHAR(1));\nWITH sample100 AS (\n    SELECT TOP(100) object_id\n    FROM sys.objects\n)\nINSERT @doors\n  SELECT ROW_NUMBER() OVER (ORDER BY A.object_id) AS doorKey,\n    @closed AS doorState\n  FROM sample100 AS A\n      CROSS JOIN sample100 AS B\n      CROSS JOIN sample100 AS C\n      CROSS JOIN sample100 AS D\n  ORDER BY 1\n  OFFSET 0 ROWS\n  FETCH NEXT @doorsCount ROWS ONLY;\n\n-- You make 100 passes by the doors, visiting every door and toggle the door (if\n-- the door is closed, open it; if it is open, close it), according to the rules\n-- of the task.\nDECLARE @pass INT = 1;\nWHILE @pass <= @doorsCount BEGIN\n  UPDATE @doors\n  SET doorState = CASE doorState WHEN @open THEN @closed ELSE @open END\n  WHERE doorKey >= @pass\n    AND doorKey\u00a0% @pass = 0;\n\n  SET @pass = @pass + 1;\nEND;\n\n-- Answer the question: what state are the doors in after the last pass?\n-- The answer as the query result is:\nSELECT doorKey, doorState FROM @doors;\n-- The answer as the console output is:\nDECLARE @log VARCHAR(max);\nDECLARE @doorKey INT = (SELECT MIN(doorKey) FROM @doors);\nWHILE @doorKey <= @doorsCount BEGIN\n  SET @log = (\n      SELECT TOP(1) CONCAT('Doors ', doorKey, ' are ',\n        CASE doorState WHEN @open THEN ' open' ELSE 'closed' END, '.')\n      FROM @doors\n      WHERE doorKey = @doorKey\n    );\n  RAISERROR (@log, 0, 1) WITH NOWAIT;\n\n  SET @doorKey = (SELECT MIN(doorKey) FROM @doors WHERE doorKey > @doorKey);\nEND;\n\n-- Which are open, which are closed?\n-- The answer as the query result is:\nSELECT doorKey, doorState FROM @doors WHERE doorState = @open;\nSELECT doorKey, doorState FROM @doors WHERE doorState = @closed;\n-- The answer as the console output is:\nSET @log = (\n  SELECT CONCAT('These are open doors: ',\n    STRING_AGG(CAST(doorKey AS VARCHAR(max)), ', '), '.')\n  FROM @doors\n  WHERE doorState = @open\n);\nRAISERROR (@log, 0, 1) WITH NOWAIT;\nSET @log = (\n  SELECT CONCAT('These are closed doors: ',\n    STRING_AGG(CAST(doorKey AS VARCHAR(max)), ', '), '.')\n  FROM @doors\n  WHERE doorState = @closed\n);\nRAISERROR (@log, 0, 1) WITH NOWAIT;\n\n-- Assert:\nDECLARE @expected TABLE (doorKey INT PRIMARY KEY);\nSET @doorKey = 1;\nWHILE @doorKey * @doorKey <= @doorsCount BEGIN\n  INSERT @expected VALUES (@doorKey * @doorKey);\n  SET @doorKey = @doorKey + 1;\nEND;\nIF NOT EXISTS (\n    SELECT doorKey FROM @doors WHERE doorState = @open\n    EXCEPT\n    SELECT doorKey FROM @expected\n  )\n  AND NOT EXISTS (\n    SELECT doorKey FROM @expected\n    EXCEPT\n    SELECT doorKey FROM @doors WHERE doorState = @open\n  )\n  PRINT 'The task is solved.';\nELSE\n  THROW 50000, 'These aren''t the doors you''re looking for.', 1;",
        "safe": true
    },
    {
        "filename": "100_doors_699.txt",
        "content": "#lang transd\n\nMainModule: {\n    doors: Vector<Bool>(100),\n    _start: (\u03bb \n        (for i in Seq(100) do\n            (for k in Seq(i 100 (+ i 1)) do\n                (set-el doors k (not (get doors k)))\n        ))\n\n        (for i in Seq(100) do\n            (if (get doors i) (textout (+ i 1) \" \"))\n    ))\n}",
        "safe": true
    },
    {
        "filename": "100_doors_7.txt",
        "content": "\n  \n    \n      \n        \n          \n            \n              n\n              \n                2\n              \n            \n            =\n            1\n            +\n            3\n            +\n            5\n            +\n            \u2026\n            +\n            (\n            2\n            n\n            \u2212\n            1\n            )\n          \n        \n      \n    \n    {\\displaystyle {\\displaystyle n^{2}=1+3+5+\\ldots +(2n-1)}}\n  \n.\n",
        "safe": true
    },
    {
        "filename": "100_doors_70.txt",
        "content": "BEGIN {\n  for(i=1; i <= 100; i++) {\n    doors[i] = 0 # close the doors\n  }\n  for(i=1; i <= 100; i++) {\n    if ( int(sqrt(i)) == sqrt(i) ) {\n      doors[i] = 1\n    }\n  }\n  for(i=1; i <= 100; i++)\n  {\n    print i, doors[i] ? \"open\" : \"close\"\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "100_doors_700.txt",
        "content": "1 4 9 16 25 36 49 64 81 100\n",
        "safe": true
    },
    {
        "filename": "100_doors_701.txt",
        "content": "! Optimized solution with True BASIC\n\nOPTION NOLET\nx = 1 \ny = 3 \nz = 0\nPRINT STR$(x) & \" Open\"\nDO UNTIL z >= 100\nz = x + y\nPRINT STR$(z) & \" Open\"\nx = z \ny = y + 2\nLOOP\n\nEND",
        "safe": true
    },
    {
        "filename": "100_doors_702.txt",
        "content": "// library: math: get: task: door: open: close100 <description></description> <version control></version control> <version>1.0.0.0.11</version> <version control></version control> (filenamemacro=getmaocl.s) [<Program>] [<Research>] [kn, ri, mo, 31-12-2012 22:03:16]\nPROC PROCMathGetTaskDoorOpenClose( INTEGER doorMaxI, INTEGER passMaxI )\n // e.g. PROC Main()\n // e.g.  PROCMathGetTaskDoorOpenClose( 100, 100 )\n // e.g. END\n // e.g.\n // e.g. <F12> Main()\n //\n // ===\n //\n // The output will be:\n //\n // door 1 is open\n // door 4 is open\n // door 9 is open\n // door 16 is open\n // door 25 is open\n // door 36 is open\n // door 49 is open\n // door 64 is open\n // door 81 is open\n // door 100 is open\n // all other doors are closed\n //\n // ===\n //\n INTEGER passMinI = 1\n INTEGER passI = 0\n //\n INTEGER doorminI = 1\n INTEGER doorI = 0\n //\n STRING s[255] = \"\"\n //\n INTEGER bufferI = 0\n //\n PushPosition()\n bufferI = CreateTempBuffer()\n PopPosition()\n //\n FOR doorI = doorMinI TO doorMaxI\n  //\n  SetGlobalInt( Format( \"doorsI\", doorI ), 0 )\n  //\n ENDFOR\n //\n FOR passI = passMinI TO passMaxI\n  //\n  doorI = passI - passI\n  //\n  REPEAT\n   //\n   doorI = doorI + passI\n   //\n   SetGlobalInt( Format( \"doorsI\", doorI ), NOT( GetGlobalInt( Format( \"doorsI\", doorI ) ) ) )\n   //\n  UNTIL ( doorI >= doorMaxI )\n  //\n ENDFOR\n //\n FOR doorI = doorMinI TO doorMaxI\n  //\n  IF ( GetGlobalInt( Format( \"doorsI\", doorI ) ) > 0 )\n   //\n   s = \"open\"\n   //\n   AddLine( Format( \"door\", \" \", doorI, \" \", \"is\", \" \", s ), bufferI )\n   //\n  ELSE\n   //\n   s = \"closed\"\n   //\n  ENDIF\n  //\n ENDFOR\n //\n AddLine( \"all other doors are closed\", bufferI )\n //\n GotoBufferId( bufferI )\n //\nEND\n\nPROC Main()\n PROCMathGetTaskDoorOpenClose( 100, 100 )\nEND",
        "safe": true
    },
    {
        "filename": "100_doors_703.txt",
        "content": "$$ MODE TUSCRIPT\nDICT doors create\nCOMPILE\nLOOP door=1,100\n LOOP pass=1,100\n SET go=MOD (door,pass)\n DICT doors lookup door,num,cnt,status\n   IF (num==0) THEN\n     SET status=\"open\"\n     DICT doors add  door,num,cnt,status\n   ELSE\n    IF (go==0) THEN\n       IF (status==\"closed\") THEN\n         SET status=\"open\"\n       ELSE\n         SET status=\"closed\"\n       ENDIF\n     DICT doors update door,num,cnt,status\n     ENDIF\n   ENDIF\n ENDLOOP\nENDLOOP\nENDCOMPILE\nDICT doors unload door,num,cnt,status",
        "safe": true
    },
    {
        "filename": "100_doors_704.txt",
        "content": " status       = *\n           1 = open\n           2 = closed\n           3 = closed\n           4 = open\n           5 = closed\n           6 = closed\n           7 = closed\n           8 = closed\n           9 = open\n          10 = closed\n          11 = closed\n          12 = closed\n          13 = closed\n          14 = closed\n          15 = closed\n          16 = open\n          17 = closed\n          18 = closed\n          19 = closed\n          20 = closed\n          21 = closed\n          22 = closed\n          23 = closed\n          24 = closed\n          25 = open\n          26 = closed\n          27 = closed\n          28 = closed\n          29 = closed\n          30 = closed\n          31 = closed\n          32 = closed\n          33 = closed\n          34 = closed\n          35 = closed\n          36 = open\n          37 = closed\n          38 = closed\n          39 = closed\n          40 = closed\n          41 = closed\n          42 = closed\n          43 = closed\n          44 = closed\n          45 = closed\n          46 = closed\n          47 = closed\n          48 = closed\n          49 = open\n          50 = closed\n          51 = closed\n          52 = closed\n          53 = closed\n          54 = closed\n          55 = closed\n          56 = closed\n          57 = closed\n          58 = closed\n          59 = closed\n          60 = closed\n          61 = closed\n          62 = closed\n          63 = closed\n          64 = open\n          65 = closed\n          66 = closed\n          67 = closed\n          68 = closed\n          69 = closed\n          70 = closed\n          71 = closed\n          72 = closed\n          73 = closed\n          74 = closed\n          75 = closed\n          76 = closed\n          77 = closed\n          78 = closed\n          79 = closed\n          80 = closed\n          81 = open\n          82 = closed\n          83 = closed\n          84 = closed\n          85 = closed\n          86 = closed\n          87 = closed\n          88 = closed\n          89 = closed\n          90 = closed\n          91 = closed\n          92 = closed\n          93 = closed\n          94 = closed\n          95 = closed\n          96 = closed\n          97 = closed\n          98 = closed\n          99 = closed\n         100 = open\n",
        "safe": true
    },
    {
        "filename": "100_doors_705.txt",
        "content": "interface Door {\n  id: number;\n  open: boolean;\n}\n\nfunction doors(): Door[] {\n  var Doors: Door[] = [];\n\n  for (let i = 1; i <= 100; i++) {\n    Doors.push({id: i, open: false});\n  }\n\n  for (let secuence of Doors) {\n    for (let door of Doors) {\n      if (door.id\u00a0% secuence.id == 0) {\n        door.open = !door.open;\n      }\n    }\n  }\n\n  return Doors.filter(a => a.open);\n}",
        "safe": true
    },
    {
        "filename": "100_doors_706.txt",
        "content": "(defun hyaku-mai-tobira ()\n  (let ((doors (vector 100)))\n    (each ((i (range 0 99)))\n      (each ((j (range i 99 (+ i 1))))\n        (flip [doors j])))\n    doors))\n\n(each ((counter (range 1))\n       (door (hyaku-mai-tobira)))\n  (put-line `door @counter is @(if door \"open\" \"closed\")`))",
        "safe": true
    },
    {
        "filename": "100_doors_707.txt",
        "content": "FOR p = 1 TO 100\n  FOR d = p TO 100 STEP p\n    @(d) = @(d) = 0\n  NEXT d\nNEXT p\n\nFOR d= 1 TO 100\n  IF @(d) PRINT \"Door \";d;\" is open\"\nNEXT d",
        "safe": true
    },
    {
        "filename": "100_doors_708.txt",
        "content": "\u25ff2/+=0\u229e\u25ff.+1\u21e1100\n         +1\u21e1100 # 1-100\n      \u229e\u25ff.       # Mod each with 1-100\n    =0          # Find where mod = 0, aka the divisors\n  /+            # Sum to get num of divisors\n\u25ff2              # Num divisors is odd\n",
        "safe": true
    },
    {
        "filename": "100_doors_709.txt",
        "content": "[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]",
        "safe": true
    },
    {
        "filename": "100_doors_71.txt",
        "content": "(open,closed,change,open?)\u00a0:= (true,false,not,test);\ndoors\u00a0:= bits(100,closed);\nfor i in 1..#doors repeat\n  for j in i..#doors by i repeat\n    doors.j\u00a0:= change doors.j\n[i for i in 1..#doors | open? doors.i]",
        "safe": true
    },
    {
        "filename": "100_doors_710.txt",
        "content": "entry LP_DO_IT\n\n    variables\n        string  V_DOORS\n        boolean V_DOOR_STATE\n        string  V_DOOR_STATE_S\n        numeric V_IDX\n        numeric V_TOTAL_DOORS\n        string  V_DOOR_STATE_LIST\n        numeric V_LOOP_COUNT\n    endvariables\n\n    V_TOTAL_DOORS = 100\n    putitem V_DOORS, V_TOTAL_DOORS, 0\n\n    V_DOORS = $replace (V_DOORS, 1, \"\u00b7;\", \"\u00b7;0\", -1)\n\n    putitem/id V_DOOR_STATE_LIST, \"1\", \"Open\"\n    putitem/id V_DOOR_STATE_LIST, \"0\", \"Close\"\n\n    V_LOOP_COUNT = 1\n    while (V_LOOP_COUNT <= V_TOTAL_DOORS)\n        V_IDX = 0\n        V_IDX = V_IDX + V_LOOP_COUNT\n\n        getitem V_DOOR_STATE, V_DOORS, V_IDX\n        while (V_IDX <= V_TOTAL_DOORS)\n\n            V_DOOR_STATE = !V_DOOR_STATE\n            getitem/id V_DOOR_STATE_S, V_DOOR_STATE_LIST, $number(V_DOOR_STATE)\n            putitem V_DOORS, V_IDX, V_DOOR_STATE\n\n            V_IDX = V_IDX + V_LOOP_COUNT\n            getitem V_DOOR_STATE, V_DOORS, V_IDX\n        endwhile\n\n        V_LOOP_COUNT = V_LOOP_COUNT + 1\n\n    endwhile\n\n    V_IDX = 1\n    getitem V_DOOR_STATE, V_DOORS, V_IDX\n    while (V_IDX <= V_TOTAL_DOORS)\n        getitem/id V_DOOR_STATE_S, V_DOOR_STATE_LIST, $number(V_DOOR_STATE)\n        if (V_DOOR_STATE)\n            putmess \"Door\u00a0%%V_IDX%%% is finally\u00a0%%V_DOOR_STATE_S%%%\"\n        endif\n\n        V_IDX = V_IDX + 1\n        getitem V_DOOR_STATE, V_DOORS, V_IDX\n    endwhile\n\nend\u00a0; LP_DO_IT",
        "safe": true
    },
    {
        "filename": "100_doors_711.txt",
        "content": "\n\nDoor 1 is finally Open\nDoor 4 is finally Open\nDoor 9 is finally Open\nDoor 16 is finally Open\nDoor 25 is finally Open\nDoor 36 is finally Open\nDoor 49 is finally Open\nDoor 64 is finally Open\nDoor 81 is finally Open\nDoor 100 is finally Open\n\n",
        "safe": true
    },
    {
        "filename": "100_doors_712.txt",
        "content": "hundredDoors\u00a0: [Boolean]\nhundredDoors =\n  toggleEachNth\u00a0: Nat -> [Boolean] -> [Boolean]\n  toggleEachNth n doors =\n    go counter = cases\n      [] -> []\n      (d +: ds) -> if counter == n\n        then (not d) +: go 1 ds\n        else d +: go (counter+1) ds\n\n    go 1 doors\n\n  foldr toggleEachNth (replicate 100 'false) (range 1 101)\n\nresults = filterMap (cases (open, ix) -> if open then Some (ix+1) else None)\n                    (indexed hundredDoors)",
        "safe": true
    },
    {
        "filename": "100_doors_713.txt",
        "content": "#! /bin/bash\n\ndeclare -a doors\nfor((i=1; i <= 100; i++)); do\n    doors[$i]=0\ndone\n\nfor((i=1; i <= 100; i++)); do\n    for((j=i; j <= 100; j += i)); do\n\techo $i $j\n\tdoors[$j]=$(( doors[j] ^ 1 ))\n    done\ndone\n\nfor((i=1; i <= 100; i++)); do\n    if [[ ${doors[$i]} -eq 0 ]]; then\n\top=\"closed\"\n    else\n\top=\"open\"\n    fi\n    echo $i $op\ndone",
        "safe": true
    },
    {
        "filename": "100_doors_714.txt",
        "content": "#!/bin/bash\n\nfor i in {1..100}; do\n  door[$i*$i]=1\n  [ -z ${door[$i]} ] && echo \"$i closed\" || echo \"$i open\"\ndone",
        "safe": true
    },
    {
        "filename": "100_doors_715.txt",
        "content": "#\n# 100 doors\n#\n\ndecl int i j\ndecl boolean<> doors\n\n# append 101 boolean values to doors stream\nfor (set i 0) (or (< i 100) (= i 100)) (inc i)\n        append false doors\nend for\n\n# loop through, opening and closing doors\nfor (set i 1) (or (< i 100) (= i 100)) (inc i)\n        for (set j i) (or (< j 100) (= j 100)) (inc j)\n                if (= (mod j i) 0)\n                        set doors<j> (not doors<j>)\n                end if\n        end for\nend for\n\n# loop through and output which doors are open\nfor (set i 1) (or (< i 100) (= i 100)) (inc i)\n        out \"Door \" i \": \" console\n        if doors<i>\n                out \"open\" endl console\n        else\n                out \"closed\" endl console\n        end if\nend if",
        "safe": true
    },
    {
        "filename": "100_doors_716.txt",
        "content": "#import std\n#import nat\n\ndoors = 0!* iota 100\n\npass(\"n\",\"d\") = remainder\\\"n\"?l(~&r,not ~&r)* num \"d\"\n\n#cast %nL\n\nmain = ~&rFlS num pass=>doors nrange(100,1)",
        "safe": true
    },
    {
        "filename": "100_doors_717.txt",
        "content": "#import nat\n\n#cast %nL\n\nmain = product*tiiXS iota10",
        "safe": true
    },
    {
        "filename": "100_doors_718.txt",
        "content": "<1,4,9,16,25,36,49,64,81>\n",
        "safe": true
    },
    {
        "filename": "100_doors_719.txt",
        "content": "\u00b7\u00b7\u00b7\nhttp://rosettacode.org/wiki/100_doors\n\u00b7\u00b7\u00b7\n\u25a0 HundredDoors \n  \u00a7 static\n    \u25b6 main\n    \u2022 args\u2982 String[]\n      open\u2982   boolean: true\n      closed\u2982 boolean: false\n      doors\u2982  boolean[1+100] \u00b7 all initially closed\n      \ud83d\udd01 pass from 1 to 100\n         \u2200 visited \u2208 pass\u2025100 by pass\n         \u00b7 toggle the visited doors\n           if the doors[visited] are closed\n              let the doors[visited] be open\n           else\n              let the doors[visited] be closed\n      for each door #n in doors\u2982 boolean\n        if the door is open\n           System.out.println \"Door #\u2e28n\u2e29 is open.\"",
        "safe": true
    },
    {
        "filename": "100_doors_72.txt",
        "content": "[i for i in 1..100 | perfectSquare? i] -- or\n[i^2 for i in 1..sqrt(100)::Integer]",
        "safe": true
    },
    {
        "filename": "100_doors_720.txt",
        "content": "int main() {\n\tbool doors_open[101];\n\tfor(int i = 1; i < doors_open.length; i++) {\n\t\tfor(int j = 1; i*j < doors_open.length; j++) {\n\t\t\tdoors_open[i*j] = !doors_open[i*j];\n\t\t}\n\t\tstdout.printf(\"%d: %s\\n\", i, (doors_open[i]\u00a0? \"open\"\u00a0: \"closed\"));\n\t}\n\treturn 0;\n}",
        "safe": true
    },
    {
        "filename": "100_doors_721.txt",
        "content": "1: open\n2: closed\n3: closed\n4: open\n5: closed\n6: closed\n7: closed\n8: closed\n9: open\n10: closed\n11: closed\n...",
        "safe": true
    },
    {
        "filename": "100_doors_722.txt",
        "content": "int main() {\n\tint i = 1;\n\twhile(i*i <= 100) {\n\t\tstdout.printf(\"${i*i} open\\n\");\n\t\ti++;\n\t}\n\treturn 0;\n}",
        "safe": true
    },
    {
        "filename": "100_doors_723.txt",
        "content": "1 open\n4 open\n9 open\n16 open\n25 open\n36 open\n49 open\n64 open\n81 open\n100 open",
        "safe": true
    },
    {
        "filename": "100_doors_724.txt",
        "content": "                           00000064  0000     1 n = 100\n                               0000  0000     2 .entry\tdoors, ^m<>\n                         26'AF   9F  0002     3 \tpushab\tb^arr\t\t\t\t; offset signed byte\n                    50   64 8F   9A  0005     4 \tmovzbl\t#n, r0\n                            50   DD  0009     5 \tpushl\tr0\t\t\t\t; (sp) -> .ascid arr\n                                     000B     6 10$:\n                       51   50   D0  000B     7 \tmovl\tr0, r1\t\t\t\t; step = start index\n                                     000E     8 20$:\n                  25'AF41   01   8C  000E     9 \txorb2\t#^a\"0\" \\^a\"1\", b^arr-1[r1]\t; \\ xor toggle \"1\"<->\"0\"\n             FFF5 51   50   6E   F1  0013    10 \tacbl\t(sp), r0, r1, 20$\t\t; limit, step, index\n                         EF 50   F5  0019    11 \tsobgtr\tr0, 10$\t\t\t\t; n..1\n                                     001C    12 \n                            5E   DD  001C    13 \tpushl\tsp\t\t\t\t; descriptor by reference\n              00000000'GF   01   FB  001E    14 \tcalls\t#1, g^lib$put_output\t\t; show result\n                                 04  0025    15 \tret\n                                     0026    16 \n30'30'30'30'30'30'30'30'30'30'30'30' 0026    17 arr:\t.byte\t^a\"0\"[n]\n30'30'30'30'30'30'30'30'30'30'30'30' 0032       \n30'30'30'30'30'30'30'30'30'30'30'30' 003E       \n30'30'30'30'30'30'30'30'30'30'30'30' 004A       \n30'30'30'30'30'30'30'30'30'30'30'30' 0056       \n30'30'30'30'30'30'30'30'30'30'30'30' 0062       \n30'30'30'30'30'30'30'30'30'30'30'30' 006E       \n30'30'30'30'30'30'30'30'30'30'30'30' 007A       \n                        30'30'30'30' 0086       \n                                     008A    18 .end\tdoors\n$ run doors\n1001000010000001000000001000000000010000000000001000000000000001000000000000000010000000000000000001",
        "safe": true
    },
    {
        "filename": "100_doors_725.txt",
        "content": "Sub Rosetta_100Doors()\nDim Door(100) As Boolean, i As Integer, j As Integer\nFor i = 1 To 100 Step 1\n    For j = i To 100 Step i\n        Door(j) = Not Door(j)\n    Next j\n    If Door(i) = True Then\n        Debug.Print \"Door \" & i & \" is Open\"\n    Else\n        Debug.Print \"Door \" & i & \" is Closed\"\n    End If\nNext i\nEnd Sub\n<!-- /lang -->\n\n*** USE THIS ONE, SEE COMMENTED LINES, DONT KNOW WHY EVERYBODY FOLLOWED OTHERS ANSWERS AND CODED THE PROBLEM DIFFERENTLY ***\n*** ALWAYS USE AND TEST A READABLE, EASY TO COMPREHEND CODING BEFORE 'OPTIMIZING' YOUR CODE AND TEST THE 'OPTIMIZED' CODE AGAINST THE 'READABLE' ONE.\nPanikkos Savvides.\n\n\nSub Rosetta_100Doors2()\nDim Door(100) As Boolean, i As Integer, j As Integer\nDim strAns As String\n' There are 100 doors in a row that are all initially closed.\n' You make 100 passes by the doors.\nFor j = 1 To 100\n    ' The first time through, visit every door and toggle the door\n    ' (if the door is closed, open it; if it is open, close it).\n    For i = 1 To 100 Step 1\n      Door(i) = Not Door(i)\n    Next i\n    ' The second time, only visit every 2nd door (door #2, #4, #6, ...), and toggle it.\n    For i = 2 To 100 Step 2\n      Door(i) = Not Door(i)\n    Next i\n    ' The third time, visit every 3rd door (door #3, #6, #9, ...), etc, until you only visit the 100th door.\n    For i = 3 To 100 Step 3\n      Door(i) = Not Door(i)\n    Next i\nNext j\n\nFor j = 1 To 100\n    If Door(j) = True Then\n        strAns = j & strAns & \", \"\n    End If\nNext j\n\nIf Right(strAns, 2) = \", \" Then strAns = Left(strAns, Len(strAns) - 2)\nIf Len(strAns) = 0 Then strAns = \"0\"\nDebug.Print \"Doors [\" & strAns & \"] are open, the rest are closed.\"\n' Doors [0] are open, the rest are closed., AKA ZERO DOORS OPEN\nEnd Sub",
        "safe": true
    },
    {
        "filename": "100_doors_726.txt",
        "content": "Dim doorIsOpen(100), pass, currentDoor, text\n\nFor currentDoor = 0 To 99\n\tdoorIsOpen(currentDoor) = False\nNext\n\nFor pass = 0 To 99\n\tFor currentDoor = pass To 99 Step pass + 1\n\t\tdoorIsOpen(currentDoor) = Not doorIsOpen(currentDoor)\n\tNext\nNext\n\nFor currentDoor = 0 To 99\n\ttext = \"Door #\" & currentDoor + 1 & \" is \"\n\tIf doorIsOpen(currentDoor) Then\n\t\ttext = text & \"open.\"\n\tElse\n\t\ttext = text & \"closed.\"\n\tEnd If\n\tWScript.Echo(text)\nNext",
        "safe": true
    },
    {
        "filename": "100_doors_727.txt",
        "content": "Buf_Switch(Buf_Free)\nIns_Char('-', COUNT, 100)                      // All doors closed\nfor (#1 = 1; #1 <= 100; #1++) {\n    for (#2 = #1; #2 <= 100; #2 += #1) {\n        Goto_Col(#2)\n        Ins_Char((Cur_Char^0x62), OVERWRITE)   // Toggle between '-' and 'O'\n    }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_728.txt",
        "content": "Buf_Switch(Buf_Free)\nIns_Char('-', COUNT, 100)\nfor (#1=1; #1 <= 10; #1++) {\n    Goto_Col(#1*#1)\n    Ins_Char('O', OVERWRITE)\n}",
        "safe": true
    },
    {
        "filename": "100_doors_729.txt",
        "content": "O--O----O------O--------O----------O------------O--------------O----------------O------------------O\n",
        "safe": true
    },
    {
        "filename": "100_doors_73.txt",
        "content": "main()\n{\n  auto doors[100]; /*\u00a0!= 0 means open */\n  auto pass, door;\n\n  door = 0;\n  while( door<100 ) doors[door++] = 0;\n\n  pass = 0;\n  while( pass<100 )\n  {\n    door = pass;\n    while( door<100 )\n    {\n      doors[door] = !doors[door];\n      door =+ pass+1;\n    }\n    ++pass;\n  }\n\n  door = 0;\n  while( door<100 )\n  {\n    printf(\"door #%d is %s.*n\", door+1, doors[door]\u00a0? \"open\"\u00a0: \"closed\");\n    ++door;\n  }\n\n  return(0);\n}",
        "safe": true
    },
    {
        "filename": "100_doors_730.txt",
        "content": "module main;\n  integer i;\n  \n  initial begin\n    $display(\"Las siguientes puertas est\u00e1n abiertas:\");\n    for (i=1; i<=10; i=i+1) if (i%i*i<11) $display(i*i);\n    $finish\u00a0;\n  end\nendmodule",
        "safe": true
    },
    {
        "filename": "100_doors_731.txt",
        "content": "library IEEE;\nuse IEEE.STD_LOGIC_1164.ALL;\n\nentity DOORS is\n\tport (CLK: in std_logic; OUTPUT: out std_logic_vector(1 to 100));\nend DOORS;\n\narchitecture Behavioral of DOORS is\nbegin\n\tprocess (CLK)\n\tvariable TEMP: std_logic_vector(1 to 100);\n\tbegin\n\t\t--setup closed doors\n\t\tTEMP\u00a0:= (others => '0');\n\t\t\n\t\t--looping through\n\t\tfor i in 1 to TEMP'length loop\n\t\t\tfor j in i to TEMP'length loop\n\t\t\t\tif (j mod i) = 0 then\n\t\t\t\t\tTEMP(j)\u00a0:= not TEMP(j);\n\t\t\t\tend if;\n\t\t\tend loop;\n\t\tend loop;\n\t\t\n\t\t--assign output\n\t\tOUTPUT <= TEMP;\n\tend process;\nend Behavioral;",
        "safe": true
    },
    {
        "filename": "100_doors_732.txt",
        "content": "LIBRARY ieee;\nUSE ieee.std_logic_1164.all;\n\n\nentity doors is\n  port (\n        clk  \u00a0: in std_logic;\n        reset\u00a0: in std_logic;\n        door \u00a0: buffer std_logic_vector(1 to 100)\n        );\nend entity doors;\n\n\narchitecture rtl of doors is\n  signal step\u00a0: integer range 1 to 101;\n  signal addr\u00a0: integer range 1 to 201;\nbegin\n  proc_step: process(clk, reset)\n  begin\n    if reset = '1' then\n      step  <= 1;\n      addr  <= 1;\n      door <= (others => '0');\n    elsif rising_edge(clk) then\n      if addr <= 100 then\n        door(addr) <= not door(addr);\n        addr <= addr + step;\n      elsif step <= 100 then\n        addr <= step + 1;\n        step <= step + 1;\n      end if;\n    end if;\n  end process;\nend;",
        "safe": true
    },
    {
        "filename": "100_doors_733.txt",
        "content": "Public Sub Doors100()\n  ' the state of a door is represented by the data type boolean (false = door closed, true = door opened)\n  Dim doorstate(1 To 100) As Boolean ' the doorstate()-array is initialized by VB with value 'false'\n  Dim i As Long, j As Long\n  \n  For i = 1 To 100\n      For j = i To 100 Step i\n          doorstate(j) = Not doorstate(j)\n      Next j\n  Next i\n  \n  Debug.Print \"The following doors are open:\"\n  For i = 1 To 100\n      ' print number if door is openend\n      If doorstate(i) Then Debug.Print CStr(i)\n  Next i\nEnd Sub",
        "safe": true
    },
    {
        "filename": "100_doors_734.txt",
        "content": "The following doors are open:\n1\n4\n9\n16\n25\n36\n49\n64\n81\n100\n",
        "safe": true
    },
    {
        "filename": "100_doors_735.txt",
        "content": "Module Module1\n\n   Sub Main()\n       Dim doors(100) As Boolean 'Door 1 is at index 0\n\n       For pass = 1 To 100\n           For door = pass - 1 To 99 Step pass\n               doors(door) = Not doors(door)\n           Next\n       Next\n\n       For door = 0 To 99\n           Console.WriteLine(\"Door # \" & (door + 1) & \" is \" & If(doors(door), \"Open\", \"Closed\"))\n       Next\n\n       Console.ReadLine()\n   End Sub\n\nEnd Module",
        "safe": true
    },
    {
        "filename": "100_doors_736.txt",
        "content": "Module Module1\n\n   Sub Main()\n       Dim doors(100) As Boolean 'Door 1 is at index 0\n\n       For i = 1 To 10\n           doors(i ^ 2 - 1) = True\n       Next\n\n       For door = 0 To 99\n           Console.WriteLine(\"Door # \" & (door + 1) & \" is \" & If(doors(door), \"Open\", \"Closed\"))\n       Next\n\n       Console.ReadLine()\n   End Sub\n\nEnd Module",
        "safe": true
    },
    {
        "filename": "100_doors_737.txt",
        "content": "const number_doors = 101\n\nfn main() {\n    mut closed_doors\u00a0:= []bool{len: number_doors, init: true} \n    for pass in 0..number_doors {\n        for door\u00a0:= 0; door < number_doors; door += pass + 1 {\n            closed_doors[door] = !closed_doors[door]\n        }\n    }\n    for pass in 1..number_doors {\n        if !closed_doors[pass] {\n            println('Door #$pass Open')\n        }\n    }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_738.txt",
        "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\n",
        "safe": true
    },
    {
        "filename": "100_doors_739.txt",
        "content": "const door_number = 100\n\nfn main(){\n    mut doors\u00a0:= []bool{ len: door_number, init: false } //true open false closed\n\n    mut door_nbr\u00a0:= 1\n    mut increment\u00a0:= 0\n\n    for current in 1..( door_number + 1) {\n        if current == door_nbr {\n            doors[current - 1] = true\n            increment++\n            door_nbr += 2 * increment + 1\n\t\t\tprint('O')\n\t\t} else {\n\t\t\tprint('=')\n\t\t}\n    }\n    println('')\n}",
        "safe": true
    },
    {
        "filename": "100_doors_74.txt",
        "content": "      * NB: the implementation is rather vanilla\n      * besides using the idiomatic buffer overrun.\n      * LOOP is what PERFORM in COBOL is, with defaults.\n      * MOVE in this language acts like OVE CORRESPONDING,\n      * which is actually good here.\n       IDENTIFICATION DIVISION.\n           PROGRAM-ID. ONE HUNDRED DOORS.\n       DATA DIVISION.\n       01 I PICTURE IS 9(3).\n       01 J LIKE I.\n       01 DOOR PICTURE IS 9 OCCURS 100 TIMES.\n       01 STOP LIKE DOOR.\n       PROCEDURE DIVISION.\n      * Initialise the data\n           MOVE HIGH-VALUES TO STOP\n           MOVE SPACES TO DOOR.\n      * Do the main algorithm\n           LOOP VARYING I UNTIL DOOR(I) = 9\n               LOOP VARYING J FROM I TO 100 BY I\n                   SUBTRACT DOOR (J) FROM 1 GIVING DOOR (J)\n               END\n           END.\n      * Print the results\n           LOOP VARYING I UNTIL DOOR(I) = 9\n               DISPLAY \"Door\" I \"is\" WITH NO ADVANCING\n               IF DOOR (I) = 1\n               THEN DISPLAY \"open\"\n               ELSE DISPLAY \"closed\".\n           END.\n",
        "safe": true
    },
    {
        "filename": "100_doors_740.txt",
        "content": "O==O====O======O========O==========O============O==============O================O==================O\n",
        "safe": true
    },
    {
        "filename": "100_doors_741.txt",
        "content": "fn main() {\n\tfor i in 1..11 {\n\t\tprint ( \" Door ${i*i} is open.\\n\" )\n\t}\n}",
        "safe": true
    },
    {
        "filename": "100_doors_742.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_743.txt",
        "content": "10 D=1\n20 :D)=0\n30 D=D+1\n40 #=100>D*20\n50 P=1\n60 D=P\n70 :D)=:D)=0\n80 D=D+P\n90 #=100>D*70\n100 P=P+1\n110 #=100>P*60\n120 D=1\n130 #=:D)*170\n140 D=D+1\n150 #=100>D*130\n160 #=999\n170\u00a0?=\"DOOR \";\n180\u00a0?=D\n190\u00a0?=\" IS OPEN\"\n200 #=!",
        "safe": true
    },
    {
        "filename": "100_doors_744.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_745.txt",
        "content": "def (doors n)\n  let door (table)\n    for step 1 (step <= n) ++step\n      for j 0 (j < n) (j <- j+step)\n        zap! not door.j\n\n    for j 0 (j < n) ++j\n      when door.j\n        pr j\n        pr \" \"",
        "safe": true
    },
    {
        "filename": "100_doors_746.txt",
        "content": "let a => import 'arrays';\nlet s => import 'stream';\nlet io => import 'io';\n\nlet toggle doors m =>\n\ta.stream doors\n\t-> s.enumerate\n\t-> s.map (@ s n => [+ (a.at n 0) 1; a.at n 1])\n\t-> s.map (@ s n => switch n {\n\t\t\t(@ s n => == (% (a.at n 0) m) 0) =>\u00a0! (a.at n 1);\n\t\t\ttrue => a.at n 1;\n\t\t})\n\t-> s.collect\n\t;\n\ns.range 100\n-> s.map false\n-> s.collect\u00a0: doors\n-> s.range 1 100\n-> s.reduce doors toggle\n-> a.stream\n-> s.map (@ s n => switch 0 {\n\t\tn => 'Open';\n\t\ttrue => 'Closed';\n\t} -- io.writeln io.stdout)\n-> s.drain\n;",
        "safe": true
    },
    {
        "filename": "100_doors_747.txt",
        "content": "; unoptimized\n+^[\n  @var doors []\n  \n  @for i rangei [1 100]\n    @for j rangei [i 100 i]\n     \u00a0:!@not `j doors\n  \n  @for i rangei [1 100]\n    @if `i doors\n      !console.log \"door {i} is open\"\n]\n; optimized, map square over 1 to 10\n!*^@sq @to 10",
        "safe": true
    },
    {
        "filename": "100_doors_748.txt",
        "content": "MOD Doors;\n\nIMP Agg.Table;\nIMP Std.String;\nIMP IO.Terminal USE Out;\n\nVAR door <- {}; EVERY door[1:to(100), \"closed\"];\n\nDEF toggle(num) door[num] <- door[num] = \"open\" => \"closed\" // \"open\";\n\nEVERY WITH pass <- 1:to(100), num <- pass:to(100, pass) DO toggle(num);\n\nOut:write('Doors {door @ String.T}.');\n\nEND Doors.",
        "safe": true
    },
    {
        "filename": "100_doors_749.txt",
        "content": "MOD Doors;\n\nIMP IO.Terminal USE Out;\n\nDEF open <- ALL 1:to(100) ^ 2 \\ $ <= 100;\nDEF closed <- ALL 1:to(100) \\ NOT $ IN open;\n\nOut:write('Doors {open} are open.\\n');\nOut:write('Doors {closed} are closed.\\n');\n\nEND Doors.",
        "safe": true
    },
    {
        "filename": "100_doors_75.txt",
        "content": "OPTION BASE 1\n\nDECLARE doors[100]\n\nFOR size = 1 TO 100\n    FOR pass = 0 TO 100 STEP size\n\tdoors[pass] = NOT(doors[pass])\n    NEXT\nNEXT\n\nFOR which = 1 TO 100\n    IF doors[which] THEN PRINT which\nNEXT\n",
        "safe": true
    },
    {
        "filename": "100_doors_750.txt",
        "content": "var doors = [true] * 100\nfor (i in 1..100) {\n    var j = i\n    while (j < 100) {\n        doors[j] = !doors[j]\n        j = j + i + 1\n    }\n}\n\nfor (i in 0...100) {\n    if (doors[i]) System.write(\"%(i + 1) \")\n}\nSystem.print()",
        "safe": true
    },
    {
        "filename": "100_doors_751.txt",
        "content": "var door = 1\nvar increment = 3\nwhile (door <= 100) {\n    System.write(\"%(door) \")\n    door = door + increment\n    increment = increment + 2\n}\nSystem.print()",
        "safe": true
    },
    {
        "filename": "100_doors_752.txt",
        "content": "1 4 9 16 25 36 49 64 81 100 \n",
        "safe": true
    },
    {
        "filename": "100_doors_753.txt",
        "content": "\t\t.NOLIST\n\n; The task can be completed in 48 and \"half\" steps:\n; On the first pass ALL doors are opened.\n; On the second pass every EVEN door is closed.\n; So, instead of all closed, the doors can initially be:\n; Every odd door open, every even door closed and start at pass 3.\n; On 51st and all the next passes, only one door is visited per pass:\n; On 51st pass door 51, on 52nd pass door 52 etc.\n; So, after pass 50, we can make \"half a pass\" starting with door 51\n; and toggling every door up to and including 100.\n; The code uses only volatile registers, so, no string (STOS etc) instructions.\n\n\t\tTITLE\t100 Doors\n\t\tPAGE\t, 132\n\t\t.686\n\t\t.MODEL\tFLAT\n\t\tOPTION\tCASEMAP:NONE\n\n\t\t.SFCOND\n\t\t.LIST\n\n; =============================================================================\n\n\t\t.DATA?\n\nDoors\t\tBYTE\t100 DUP (\u00a0? )\n\n; =============================================================================\n\n\t\t.CODE\n\nPass_Doors\tPROC\n\n\t\tMOV\tEDX, OFFSET Doors\t; Initialize all doors.\n\t\tMOV\tECX, SIZEOF Doors / SIZEOF DWORD\n\t\tMOV\tEAX, 01010101h\t\t; This does first and second pass.\n\nClose_Doors:\tMOV\t[ EDX ], EAX\n\t\tADD\tEDX, SIZEOF DWORD\n\t\tLOOP\tClose_Doors\n\n\t\tMOV\tECX, 2\t\t\t; Pass and step.\n\nPass_Loop:\tMOV\tEDX, OFFSET Doors\n\n\t\tASSUME\tEDX:PTR BYTE\n\nDoors_Loop:\tXOR\t[ EDX ], 1\t\t; Toggle this door.\n\t\tADD\tEDX, ECX               \u00a0; Advance.\n\t\tCMP\tEDX, OFFSET Doors[ SIZEOF Doors ]\n\n\t\tJB\tDoors_Loop\n\n\t\tINC\tECX\n\t\tCMP\tECX, SIZEOF Doors\n\n\t\tJB\tPass_Loop\n\n\t\tXOR\tDoors[ SIZEOF Doors -1 ], 1\u00a0; This is pass 100.\n\t\tRET\n\nPass_Doors\tENDP\n\n; =============================================================================\n\n\t\tEND",
        "safe": true
    },
    {
        "filename": "100_doors_754.txt",
        "content": "PROGRAM \"100doors\"\nVERSION \"0.0001\"\n\nIMPORT \"xma\"\nIMPORT \"xst\"\n\nDECLARE FUNCTION Entry()\n\nFUNCTION Entry()\n  maxpuertas = 100\n  cont = 0\n  DIM puertas[100]\n\n  FOR p = 1 TO maxpuertas\n    IF INT(SQRT(p)) = SQRT(p) THEN puertas[p] = 1\n  NEXT p\n\n  PRINT \"The doors are open: \";\n  FOR p = 1 TO maxpuertas\n    IF puertas[p] = 1 THEN\n       PRINT p; \" \";\n       INC cont\n    END IF\n  NEXT p\n\n  PRINT CHR$(10); \"Are \"; STR$(cont); \" open doors.\"\n\nEND FUNCTION\nEND PROGRAM",
        "safe": true
    },
    {
        "filename": "100_doors_755.txt",
        "content": "// True=Open; False=Closed\nDim doors(100) As Boolean // Booleans default to false\nFor j As Integer = 1 To 100\n  For i As Integer = 1 to 100\n    If i Mod j = 0 Then doors(i) = Not doors(i)\n  Next\nNext",
        "safe": true
    },
    {
        "filename": "100_doors_756.txt",
        "content": "include c:\\cxpl\\codes;          \\intrinsic 'code' declarations\nint     Door(100);              \\You have 100 doors in a row\ndefine  Open, Closed;\nint     D, Pass, Step;\n\n[for D:= 0 to 100-1 do          \\that are all initially closed\n        Door(D):= Closed;\n\nStep:= 1;                       \\The first time through, you visit every door\nfor Pass:= 1 to 100 do          \\You make 100 passes by the doors\n        [D:= Step-1;\n        repeat  \\if the door is closed, you open it; if it is open, you close it\n                if Door(D)=Closed then Door(D):= Open else Door(D):= Closed;\n                D:= D+Step;\n        until   D>=100;\n        Step:= Step+1;          \\The second time you only visit every 2nd door\n        ];                      \\The third time, every 3rd door\n                                \\until you only visit the 100th door\n\\What state are the doors in after the last pass?\nText(0, \"Open: \");              \\Which are open?\nfor D:= 0 to 100-1 do \n        if Door(D)=Open then [IntOut(0, D+1); ChOut(0,^ )];\nCrLf(0);\n\nText(0, \"Closed: \");            \\Which are closed?\nfor D:= 0 to 100-1 do \n        if Door(D)=Closed then [IntOut(0, D+1); ChOut(0,^ )];\nCrLf(0);\n\n\\Optimized: The only doors that remain open are those that are perfect squares\nText(0, \"Open: \");\nD:= 1;\nrepeat  IntOut(0, D*D); ChOut(0,^ );\n        D:= D+1;\nuntil   D*D>100;\nCrLf(0);\n]",
        "safe": true
    },
    {
        "filename": "100_doors_757.txt",
        "content": "<hallway>\n  <door number=\"1\">closed</door>\n  <door number=\"2\">closed</door>\n  <door number=\"3\">closed</door>\n  <door number=\"4\">closed</door>\n  ... etc ...\n  <door number=\"100\">closed</door>\n<hallway>",
        "safe": true
    },
    {
        "filename": "100_doors_758.txt",
        "content": "<xsl:stylesheet version=\"1.0\"\n  xmlns:xsl=\"http://www.w3.org/1999/XSL/Transform\"\n  xmlns:exsl=\"http://exslt.org/common\"\n  exclude-result-prefixes=\"xsl exsl\">\n<xsl:output method=\"xml\" indent=\"yes\" omit-xml-declaration=\"yes\"/>\n\n<xsl:template match=\"/*\">\n  <xsl:copy>\n    <xsl:apply-templates select=\"door\" />\n  </xsl:copy>\n</xsl:template>\n      \n<xsl:template match=\"door\">\n  <xsl:variable name=\"door-num\" select=\"@number\" />\n  <xsl:variable name=\"knocks\">\n    <xsl:for-each select=\"/*/door\">\n      <xsl:if test=\"$door-num mod position() = 0\">\n        <xsl:text>!</xsl:text>\n      </xsl:if>\n    </xsl:for-each>\n  </xsl:variable>\n  <door number=\"{$door-num}\">\n   <xsl:choose>\n     <xsl:when test=\"string-length($knocks) mod 2 = 1\">\n        <xsl:text>open</xsl:text>\n     </xsl:when>\n     <xsl:otherwise>\n        <xsl:text>closed</xsl:text>\n     </xsl:otherwise>\n   </xsl:choose> \n  </door>\n</xsl:template>\n      \n</xsl:stylesheet>",
        "safe": true
    },
    {
        "filename": "100_doors_759.txt",
        "content": "<xsl:stylesheet version=\"2.0\"\n  xmlns:xsl=\"http://www.w3.org/1999/XSL/Transform\">\n<xsl:output method=\"xml\" indent=\"yes\" omit-xml-declaration=\"yes\"/>\n\n<xsl:template match=\"/\">\n  <hallway>\n    <xsl:for-each select=\"1 to 100\">\n      <xsl:variable name=\"door-num\" select=\"position()\" />\n      <door number=\"{$door-num}\">\n        <xsl:value-of select=\"('closed','open')[\n\t    number( sum( for $pass in 1 to 100 return\n\t    number(($door-num mod $pass) = 0)) mod 2 = 1) + 1]\" />\n      </door>\n    </xsl:for-each>\n  </hallway>\n</xsl:template>\n      \n</xsl:stylesheet>",
        "safe": true
    },
    {
        "filename": "100_doors_76.txt",
        "content": "1\n4\n9\n16\n25\n36\n49\n64\n81\n100\n",
        "safe": true
    },
    {
        "filename": "100_doors_760.txt",
        "content": "n = 100\t// doors\nppa = 1\t// next open door\np2 = 1\n\nfor i = 1 to n\n\tprint \"Door \", i, \" is \";\n\tif i < p2 then\n\t\tprint \"closed.\"\n\telse\n\t\tppa = ppa + 1\n\t\tp2 = ppa^2\n\t\tprint \"OPEN.\"\n\tend if\nnext",
        "safe": true
    },
    {
        "filename": "100_doors_761.txt",
        "content": "for i = 1 to sqrt(100)\u00a0: print \"Door \", i**2, \" is open\"\u00a0: next",
        "safe": true
    },
    {
        "filename": "100_doors_762.txt",
        "content": "!yamlscript/v0\n\ndefn main():\n  open =:\n    reduce _ vec([true] * 100) (1 .. 100):\n      fn(doors i):\n        loop j i, doors doors:\n          if j < 100:\n            recur (j + i).++:\n              update-in doors [j]: \\(doors.$j.!)\n            else: doors\n  say: -\"Open doors after 100 passes:\\ \" +\n        (1 .. 100).map(\\(_.--:open && _))\n                  .filter(a).join(', ')",
        "safe": true
    },
    {
        "filename": "100_doors_763.txt",
        "content": "$ ys 100-doors.ys\nOpen doors after 100 passes: 1, 4, 9, 16, 25, 36, 49, 64, 81, 100\n",
        "safe": true
    },
    {
        "filename": "100_doors_764.txt",
        "content": "doors = array(0, 100);\nfor(i = 1; i <= 100; i++)\n    for(j = i; j <= 100; j += i)\n        doors(j) ~= 1;\nprint, where(doors);",
        "safe": true
    },
    {
        "filename": "100_doors_765.txt",
        "content": "doors = array(0, 100);\nfor(i = 1; i <= 100; i++)\n    doors(i::i) ~= 1;\nprint, where(doors);",
        "safe": true
    },
    {
        "filename": "100_doors_766.txt",
        "content": "print, indgen(1:long(sqrt(100)))^2",
        "safe": true
    },
    {
        "filename": "100_doors_767.txt",
        "content": "[1,4,9,16,25,36,49,64,81,100]\n",
        "safe": true
    },
    {
        "filename": "100_doors_768.txt",
        "content": "pub fn main() !void {\n    const stdout = @import(\"std\").io.getStdOut().writer();\n    \n    var doors = [_]bool{false} ** 101;\n    var pass: u8 = 1;\n    var door: u8 = undefined;\n    \n    while (pass <= 100)\u00a0: (pass += 1) {\n        door = pass;\n        while (door <= 100)\u00a0: (door += pass)\n            doors[door] = !doors[door];\n    }\n    \n    for (doors, 0..) |open, num|\n        if (open) \n            try stdout.print(\"Door {d} is open.\\n\", .{num});\n}",
        "safe": true
    },
    {
        "filename": "100_doors_769.txt",
        "content": "pub fn main() !void {\n    const stdout = @import(\"std\").io.getStdOut().writer();\n    \n    var square: u8 = 1;\n    var increment: u8 = 3;\n    var door: u8 = 1;\n    while (door <= 100)\u00a0: (door += 1) {\n        if (door == square) {\n            try stdout.print(\"Door {d} is open\\n\", .{door});\n            square += increment;\n            increment += 2;\n        }\n    }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_77.txt",
        "content": "const NUM_DOORS\u00a0:= 100\n\nfun main() {\n\t// All doors are closed by default (`false`)\n\tmut is_open\u00a0:= []bool{length = NUM_DOORS}\n\n\t// Make 100 passes by the doors\n\tfor pass\u00a0:= 0; pass < 100; pass += 1 {\n\t\t// Only visit every `pass + 1`th door\n\t\tfor door\u00a0:= pass; door < NUM_DOORS; door += pass + 1 {\n\t\t\tis_open[door] = not is_open[door]\n\t\t}\n\t}\n\n\t// Print the doors that are open\n\tfor i, open in is_open {\n\t\tif open {\n\t\t\tprintln(\"Door #${i + 1} is open.\")\n\t\t}\n\t}\n\n}",
        "safe": true
    },
    {
        "filename": "100_doors_770.txt",
        "content": "pub fn main() !void {\n    const stdout = @import(\"std\").io.getStdOut().writer();\n\n    var square: u8 = 1;\n    var increment: u8 = 3;\n    for (1..101) |door| {\n        if (door == square) {\n            try stdout.print(\"Door {d} is open\\n\", .{door});\n            square += increment;\n            increment += 2;\n        }\n    }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_771.txt",
        "content": "pub fn main() !void {\n    const stdout = @import(\"std\").io.getStdOut().writer();\n\n    var door: u8 = 1;\n    while (door * door <= 100)\u00a0: (door += 1) {\n        try stdout.print(\"Door {d} is open\\n\", .{door * door});\n    }\n}",
        "safe": true
    },
    {
        "filename": "100_doors_772.txt",
        "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.",
        "safe": true
    },
    {
        "filename": "100_doors_773.txt",
        "content": "doors:=List.createLong(100,False);\t// list of 100 Falses\nforeach n,m in (100,[n..99,n+1]){ doors[m]=(not doors[m]); } //foreach{ foreach{} }\ndoors.filterNs().apply('+(1)).println();",
        "safe": true
    },
    {
        "filename": "100_doors_774.txt",
        "content": "L(1,4,9,16,25,36,49,64,81,100)",
        "safe": true
    },
    {
        "filename": "100_doors_775.txt",
        "content": " 10 REM 100 doors open/closed?\n 20 DIM d(100)\n 25 LET o=0\n 30 FOR a=1 TO 100\n 40 FOR b=a TO 100 STEP a\n 50 LET d(b)=NOT d(b)\n 55 LET o=o+(d(b)=1)-(d(b)=0)\n 60 NEXT b\n 70 NEXT a\n 80 PRINT o;\" open doors\"\n",
        "safe": true
    },
    {
        "filename": "100_doors_776.txt",
        "content": " 10 REM 100 doors open/closed?\n 20 DIM d(100)\n 25 GO SUB 170\n 30 FOR a=1 TO 100\n 35 PRINT AT 0,0;\"step \";a\n 40 FOR b=a TO 100 STEP a\n 45 PRINT AT 0,10;\"door:\";b;\"  \"\n 50 LET d(b)=NOT d(b)\n 55 GO SUB 150\n 60 NEXT b\n 70 NEXT a\n 80 GO SUB 170\n 90 STOP \n150 REM print door status\n151 LET p=(b-1)/10\n152 LET q=1+10*(p-INT p)\n153 LET p=INT p\n154 LET op=op+(d(b)=1)-(d(b)=0)\n156 PRINT AT 2*p+2,2*q;d(b);AT 0,27;op;\"  \"\n160 RETURN \n165 REM print step status\n170 LET op=0\n175 FOR p=0 TO 9\n180 FOR q=1 TO 10\n185 PRINT AT 2*p+2,2*q;d(p*10+q)\n188 LET op=op+d(p*10+q)\n190 NEXT q\n200 NEXT p\n205 PRINT AT 0,22;\"open:\";op;\"  \"\n210 RETURN\n",
        "safe": true
    },
    {
        "filename": "100_doors_78.txt",
        "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",
        "safe": true
    },
    {
        "filename": "100_doors_79.txt",
        "content": " 100 :\n 110  REM  100 DOORS PROBLEM\n 120 :\n 130  DIM D(100)\n 140  FOR P = 1 TO 100\n 150  FOR T = P TO 100 STEP P\n 160  D(T) =  NOT D(T): NEXT T\n 170  NEXT P\n 180  FOR I = 1 TO 100\n 190  IF D(I) THEN  PRINT I;\" \";\n 200  NEXT I\n",
        "safe": true
    },
    {
        "filename": "100_doors_8.txt",
        "content": "  ;assumes memory at $02xx is initially set to 0 and stack pointer is initialized\n  ;the 1 to 100 door byte array will be at $0200-$0263 (decimal 512 to 611)\n  ;Zero-page location $01 will hold delta\n  ;At end, closed doors = $00, open doors = $01\n\nstart:    ldx #0        ;initialize index - first door will be at $200 + $0\n          stx $1\n          inc $1        ;start out with a delta of 1 (0+1=1)\nopenloop: inc $200,X    ;open X'th door\n          inc $1        ;add 2 to delta\n          inc $1\n          txa           ;add delta to X by transferring X to A, adding delta to A, then transferring back to X\n          clc          \u00a0;  clear carry before adding (6502 has no add-without-carry instruction)\n          adc $1\n          tax\n          cpx #$64      ;check to see if we're at or past the 100th door (at $200 + $63)\n          bmi openloop  ;jump back to openloop if less than 100",
        "safe": true
    },
    {
        "filename": "100_doors_80.txt",
        "content": "                                        \n]RUN\n1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100_doors_81.txt",
        "content": "# 100 doors problem\ndim d(100)\n\n# simple solution\nprint \"simple solution\"\ngosub initialize\nfor t = 1 to 100\n   for j = t to 100 step t\n      d[j-1] = not d[j-1]\n   next j\nnext t\ngosub showopen\n\n# more optimized solution\nprint \"more optimized solution\"\ngosub initialize\nfor t = 1 to 10\n      d[t^2-1] = true\nnext t\ngosub showopen\nend\n\ninitialize:\nfor t = 1 to d[?]\n   d[t-1] = false\t # closed\nnext t\nreturn\n\nshowopen:\nfor t = 1 to d[?]\n   print d[t-1]+ \" \";\n   if t%10 = 0 then print\nnext t\nreturn",
        "safe": true
    },
    {
        "filename": "100_doors_82.txt",
        "content": "for i = 1 to 10 : if i % i^2 < 11 then print \"La puerta \"; int(i^2); \" esta abierta\" : end if : next i : end\n",
        "safe": true
    },
    {
        "filename": "100_doors_83.txt",
        "content": "dim doors%(100)\n\nprint \"Finding solution to the 100 Doors Problem\"\n\nrem - all doors are initially closed\nfor i% = 1 to 100\n  doors%(i%) = 0\nnext i%\n\nrem - pass through at increasing intervals\nfor i% = 1 to 100\n  for j% = i% to 100 step i%\n    rem - flip each door encountered\n    doors%(j%) = 1 - doors%(j%)\n  next j%\nnext i%\n\nrem - show which doors are open\nprint \"The open doors are: \";\nfor i% = 1 to 100\n  if doors%(i%) = 1 then print i%;\nnext i%\n\nprint\nprint \"Thanks for consulting the puzzle guru!\"\n\nend\n",
        "safe": true
    },
    {
        "filename": "100_doors_84.txt",
        "content": "Finding solution to the 100 Doors Problem\nThe open doors are: 1 4 9 15 25 36 47 64 81 100\nThanks for consulting the puzzle guru!\n",
        "safe": true
    },
    {
        "filename": "100_doors_85.txt",
        "content": "100 CLS : REM  10 HOME for Applesoft BASIC\n110 DIM D(100)\n120 FOR P = 1 TO 100\n130   FOR T = P TO 100 STEP P\n140     D(T) = NOT D(T)\n150   NEXT T\n160 NEXT P\n170 ' Print \"opened\" doors\n180 FOR I = 1 TO 100\n190   IF D(I) THEN PRINT I;\" \";\n200 NEXT I\n210 END\n",
        "safe": true
    },
    {
        "filename": "100_doors_86.txt",
        "content": ">RUN\n1  4  9  16  25  36  49  64  81  100  >",
        "safe": true
    },
    {
        "filename": "100_doors_87.txt",
        "content": "10 DIM D(100)\n20 FOR I=1 TO 100\n30 FOR J=I TO 100 STEP I\n40 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",
        "safe": true
    },
    {
        "filename": "100_doors_88.txt",
        "content": "100 CLS : REM  10 HOME for Applesoft BASIC\n110 DIM D(100)\n120 FOR P = 1 TO 100\n130   FOR T = P TO 100 STEP P\n140     D(T) = NOT D(T)\n150   NEXT T\n160 NEXT P\n170 ' Print \"opened\" doors\n180 FOR I = 1 TO 100\n190   IF D(I) THEN PRINT I;\" \";\n200 NEXT I\n210 END\n",
        "safe": true
    },
    {
        "filename": "100_doors_89.txt",
        "content": "  1  4  9  16  25  36  49  64  81  100",
        "safe": true
    },
    {
        "filename": "100_doors_9.txt",
        "content": "*-----------------------------------------------------------\n* Title      : 100Doors.X68\n* Written by : G. A. Tippery\n* Date       : 2014-01-17\n* Description: Solves \"100 Doors\" problem, see: http://rosettacode.org/wiki/100_doors\n* Notes      : Translated from C \"Unoptimized\" version, http://rosettacode.org/wiki/100_doors#unoptimized\n*            : No optimizations done relative to C version; \"for(\"-equivalent loops could be optimized.\n*-----------------------------------------------------------\n\n*\n*   System-specific general console I/O macros (Sim68K, in this case)\n*\nPUTS    MACRO\n    ** Print a null-terminated string w/o CRLF **\n    ** Usage: PUTS stringaddress\n    ** Returns with D0, A1 modified\n        MOVEQ   #14,D0      ; task number 14 (display null string)\n        LEA     \\1,A1       ; address of string\n        TRAP    #15         ; display it\n        ENDM\n*\nPRINTN  MACRO\n    ** Print decimal integer from number in register\n    ** Usage: PRINTN register\n    ** Returns with D0,D1 modified\n        IFNC '\\1','D1'      ;if some register other than D1\n          MOVE.L \\1,D1      ;put number to display in D1\n        ENDC\n        MOVE.B  #3,D0\n        TRAP    #15         ;display number in D1\n*\n*   Generic constants\n*\nCR      EQU     13      ;ASCII Carriage Return\nLF      EQU     10      ;ASCII Line Feed\n\n*\n*   Definitions specific to this program\n*\n*   Register usage:\n*   D3 == pass (index)\n*   D4 == door (index)\n*   A2 == Doors array pointer\n*\nSIZE    EQU     100             ;Define a symbolic constant for # of doors\n\n        ORG     $1000           ;Specify load address for program -- actual address system-specific\nSTART:                          ; Execution starts here\n        LEA     Doors,A2        ; make A2 point to Doors byte array\n        MOVEQ   #0,D3\nPassLoop:\n        CMP     #SIZE,D3\n        BCC     ExitPassLoop    ; Branch on Carry Clear - being used as Branch on Higher or Equal\n        MOVE    D3,D4\nDoorLoop:\n        CMP     #SIZE,D4\n        BCC     ExitDoorLoop\n        NOT.B   0(A2,D4)\n        ADD     D3,D4\n        ADDQ    #1,D4\n        BRA     DoorLoop\nExitDoorLoop:\n        ADDQ    #1,D3\n        BRA     PassLoop\nExitPassLoop:\n\n* $28 = 40. bytes of code to this point. 32626 cycles so far.\n*   At this point, the result exists as the 100 bytes starting at address Doors.\n* To get output, we must use methods specific to the particular hardware, OS, or\n* emulator system that the code is running on.  I use macros to \"hide\" some of the\n* system-specific details; equivalent macros would be written for another system.\n\n        MOVEQ   #0,D4\nPrintLoop:\n        CMP     #SIZE,D4\n        BCC     ExitPrintLoop\n        PUTS    DoorMsg1\n        MOVE    D4,D1\n        ADDQ    #1,D1           ; Convert index to 1-based instead of 0-based\n        PRINTN  D1\n        PUTS    DoorMsg2\n        TST.B   0(A2,D4)        ; Is this door open (!= 0)?\n        BNE     ItsOpen\n        PUTS    DoorMsgC\n        BRA     Next\nItsOpen:\n        PUTS    DoorMsgO\nNext:\n        ADDQ    #1,D4\n        BRA     PrintLoop\nExitPrintLoop:\n\n*  What to do at end of program is also system-specific\n        SIMHALT             ;Halt simulator\n*\n* $78 = 120. bytes of code to this point, but this will depend on how the I/O macros are actually written.\n* Cycle count is nearly meaningless, as the I/O hardware and routines will dominate the timing.\n\n*\n*   Data memory usage\n*\n        ORG     $2000\nDoors   DCB.B   SIZE,0      ;Reserve 100 bytes, prefilled with zeros\n\nDoorMsg1 DC.B   'Door ',0\nDoorMsg2 DC.B   ' is ',0\nDoorMsgC DC.B   'closed',CR,LF,0\nDoorMsgO DC.B   'open',CR,LF,0\n\n        END     START       ;last line of source\n",
        "safe": true
    },
    {
        "filename": "100_doors_90.txt",
        "content": "100 PROGRAM \"100doors.bas\"\n110 NUMERIC D(1 TO 100)\n120 FOR I=1 TO 100\n130   LET D(I)=0\n140 NEXT\n150 FOR I=1 TO 100\n160   FOR J=I TO 100 STEP I\n170     LET D(J)=NOT D(J)\n180   NEXT \n190 NEXT\n200 FOR I=1 TO 100\n210   IF D(I) THEN PRINT I\n220 NEXT",
        "safe": true
    },
    {
        "filename": "100_doors_91.txt",
        "content": "100 PROGRAM \"100doors.bas\"\n110 LET NR=1:LET D=3\n120 DO\n130   PRINT NR\n140   LET NR=NR+D:LET D=D+2\n150 LOOP WHILE NR<=100",
        "safe": true
    },
    {
        "filename": "100_doors_92.txt",
        "content": "10 PRINT \"FOLLOWING DOORS ARE OPEN:\"\n20 LET I = 0\n30 REM LOOP\n40 LET I = I + 1\n50 PRINT I * I; \" \";\n60 IF I * I < 100 THEN 30\n70 END\n",
        "safe": true
    },
    {
        "filename": "100_doors_93.txt",
        "content": "10 DIM D(100)\n20 FOR I=1 TO 100\n30 FOR J=i TO 100 STEP I\n40 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\n100 END\n",
        "safe": true
    },
    {
        "filename": "100_doors_94.txt",
        "content": "                                        \n]RUN\n1 4 9 16 25 36 49 64 81 100",
        "safe": true
    },
    {
        "filename": "100_doors_95.txt",
        "content": "REM \"100 Doors\" program for QB64 BASIC (http://www.qb64.net/), a QuickBASIC-like compiler.\nREM Author: G. A. Tippery\nREM Date: 12-Feb-2014\nREM\nREM   Unoptimized (naive) version, per specifications at http://rosettacode.org/wiki/100_doors\n\nDEFINT A-Z\nCONST N = 100\nDIM door(N)\n\nFOR stride = 1 TO N\n    FOR index = stride TO N STEP stride\n        LET door(index) = NOT (door(index))\n    NEXT index\nNEXT stride\n\nPRINT \"Open doors:\"\nFOR index = 1 TO N\n    IF door(index) THEN PRINT index\nNEXT index\n\nEND\n",
        "safe": true
    },
    {
        "filename": "100_doors_96.txt",
        "content": "DIM doors(0 TO 99)\nFOR pass = 0 TO 99\n\tFOR door = pass TO 99 STEP pass + 1\n\t\tPRINT doors(door)\n\t\tPRINT NOT doors(door)\n\t\tdoors(door) = NOT doors(door)\n\tNEXT door\nNEXT pass\nFOR i = 0 TO 99\n\tPRINT \"Door #\"; i + 1; \" is \";\n\tIF NOT doors(i) THEN\n\t\tPRINT \"closed\"\n\tELSE\n\t\tPRINT \"open\"\n\tEND IF\nNEXT i\n",
        "safe": true
    },
    {
        "filename": "100_doors_97.txt",
        "content": "DIM doors(0 TO 99)\nFOR door = 0 TO 99\n\tIF INT(SQR(door)) = SQR(door) THEN doors(door) = -1\nNEXT door\nFOR i = 0 TO 99\n\tPRINT \"Door #\"; i + 1; \" is \";\n\tIF NOT doors(i) THEN\n\t\tPRINT \"closed\"\n\tELSE\n\t\tPRINT \"open\"\n\tEND IF\nNEXT i\n",
        "safe": true
    },
    {
        "filename": "100_doors_98.txt",
        "content": "100 ARRAY D\n110 FOR P = 1 TO 100\n120  FOR T = P TO 100 STEP P\n130   LET D[T] =  (D[T] <> 1)\n140  NEXT T\n150 NEXT P\n160 FOR I = 1 TO 100\n170  IF D[I] THEN PRINT I;\" \";\n180 NEXT I\n190 END\n",
        "safe": true
    },
    {
        "filename": "100_doors_99.txt",
        "content": "    PRINT \"Open doors are:\"\n\n    LET I = 1\n10  IF I = 100 THEN END \n    rem funcion SQR\n    LET B = I*I\n    rem funcion MODULO\n    LET A = I - (I / B) * B\n    IF A < 11 THEN PRINT B\n    LET I = I + 1\n    GOTO 10",
        "safe": true
    },
    {
        "filename": "100_prisoners_1.txt",
        "content": "F play_random(n)\n   V pardoned = 0\n   V in_drawer = Array(0.<100)\n   V sampler = Array(0.<100)\n   L 0 .< n\n      random:shuffle(&in_drawer)\n      V found = 0B\n      L(prisoner) 100\n         found = 0B\n         L(reveal) random:sample(sampler, 50)\n            V card = in_drawer[reveal]\n            I card == prisoner\n               found = 1B\n               L.break\n         I !found\n            L.break\n      I found\n         pardoned++\n   R Float(pardoned) / n * 100\n\nF play_optimal(n)\n   V pardoned = 0\n   V in_drawer = Array(0.<100)\n   L 0 .< n\n      random:shuffle(&in_drawer)\n      V found = 0B\n      L(prisoner) 100\n         V reveal = prisoner\n         found = 0B\n         L 50\n            V card = in_drawer[reveal]\n            I card == prisoner\n               found = 1B\n               L.break\n            reveal = card\n         I !found\n            L.break\n      I found\n         pardoned++\n   R Float(pardoned) / n * 100\n\nV n = 100'000\nprint(\u2018 Simulation count: \u2019n)\nprint(\u2018 Random play wins: #2.1% of simulations\u2019.format(play_random(n)))\nprint(\u2018Optimal play wins: #2.1% of simulations\u2019.format(play_optimal(n)))",
        "safe": true
    },
    {
        "filename": "100_prisoners_10.txt",
        "content": "Optimal Strategy = 31.80%\nRandom Strategy =  0.00%\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_100.txt",
        "content": "a:=[seq(max(GroupTheory[PermCycleType](Perm(Statistics[Shuffle]([$1..100])))),i=1..100000)]:\nnops(select(n->n<=50,a))/nops(a);\nevalf(%);\n# 31239/100000\n# 0.3123900000",
        "safe": true
    },
    {
        "filename": "100_prisoners_101.txt",
        "content": "1-(harmonic(100)-harmonic(50));\nevalf(%);\n\n# 21740752665556690246055199895649405434183/69720375229712477164533808935312303556800\n# 0.3118278207",
        "safe": true
    },
    {
        "filename": "100_prisoners_102.txt",
        "content": "ClearAll[PlayRandom, PlayOptimal]\nPlayRandom[n_] := \n Module[{pardoned = 0, sampler, indrawer, found, reveal},\n  sampler = indrawer = Range[100];\n  Do[\n   indrawer //= RandomSample;\n   found = 0;\n   Do[\n    reveal = RandomSample[sampler, 50];\n    If[MemberQ[indrawer[[reveal]], p],\n     found++;\n     ]\n    ,\n    {p, 100}\n    ];\n   If[found == 100, pardoned++];\n   ,\n   {n}\n   ];\n  N[pardoned/n]\n  ]\nPlayOptimal[n_] := \n Module[{pardoned = 0, indrawer, reveal, found, card},\n  indrawer = Range[100];\n  Do[\n   indrawer //= RandomSample;\n   Do[\n    reveal = p;\n    found = False;\n    Do[\n     card = indrawer[[reveal]];\n     If[card == p,\n      found = True;\n      Break[];\n      ];\n     reveal = card;\n     ,\n     {g, 50}\n     ];\n    If[! found, Break[]];\n    ,\n    {p, 100}\n    ];\n   If[found, pardoned++];\n   ,\n   {n}\n   ];\n  N[pardoned/n]\n  ];\nPlayRandom[1000]\nPlayOptimal[10000]\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_103.txt",
        "content": "0.\n0.3116",
        "safe": true
    },
    {
        "filename": "100_prisoners_104.txt",
        "content": "function [randSuccess,idealSuccess]=prisoners(numP,numG,numT)\n    %numP is the number of prisoners\n    %numG is the number of guesses\n    %numT is the number of trials\n    randSuccess=0;\n    \n    %Random\n    for trial=1:numT\n        drawers=randperm(numP);\n        won=1;\n        for i=1:numP\n            correct=0;\n            notopened=drawers;\n            for j=1:numG\n                ind=randi(numel(notopened));\n                m=notopened(ind);\n                if m==i\n                    correct=1;\n                    break;\n                end\n                notopened(ind)=[];\n            end\n            if correct==0\n                won=0;\n                break;\n            end\n        end\n        randSuccess=randSuccess*(trial-1)/trial+won/trial;\n    end\n    \n\n    %Ideal\n    idealSuccess=0;\n\n    for trial=1:numT\n        drawers=randperm(numP);\n        won=1;\n        for i=1:numP\n            correct=0;\n            guess=i;\n            for j=1:numG\n                m=drawers(guess);\n                if m==i\n                    correct=1;\n                    break;\n                end\n                guess=m;\n            end\n            if correct==0\n                won=0;\n                break;\n            end\n        end\n        idealSuccess=idealSuccess*(trial-1)/trial+won/trial;\n    end\n    disp(['Probability of success with random strategy: ' num2str(randSuccess*100) '%']);\n    disp(['Probability of success with ideal strategy: ' num2str(idealSuccess*100) '%']);\nend\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_105.txt",
        "content": ">> [randSuccess,idealSuccess]=prisoners(100,50,10000);\nProbability of success with random strategy: 0%\nProbability of success with ideal strategy: 31.93%",
        "safe": true
    },
    {
        "filename": "100_prisoners_106.txt",
        "content": "playRandom = function(n)\n    // using 0-99 instead of 1-100\n    pardoned = 0\n    numInDrawer = range(99)\n    choiceOrder = range(99)\n    for round in range(1, n)\n    \tnumInDrawer.shuffle\n        choiceOrder.shuffle\n        for prisoner in range(99)\n            found = false\n            for card in choiceOrder[:50]\n                if card == prisoner then\n                    found = true\n                    break\n                end if\n            end for\n            if not found then break\n        end for\n        if found then pardoned = pardoned + 1\n    end for\n    return pardoned / n * 100\nend function\n\nplayOptimal = function(n)\n    // using 0-99 instead of 1-100\n    pardoned = 0\n    numInDrawer = range(99)\n    for round in range(1, n)\n    \tnumInDrawer.shuffle\n        for prisoner in range(99)\n            found = false\n\t    drawer = prisoner\n            for i in range(1,50)\n                card = numInDrawer[drawer]\n                if card == prisoner then\n                    found = true\n                    break\n                end if\n                drawer = card\n            end for\n            if not found then break\n        end for\n        if found then pardoned = pardoned + 1\n    end for\n    return pardoned / n * 100\nend function\n\nprint \"Random:  \" + playRandom(10000) + \"%\"\nprint \"Optimal: \" + playOptimal(10000) + \"%\"\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_107.txt",
        "content": "Random:  0%\nOptimal: 31.06%",
        "safe": true
    },
    {
        "filename": "100_prisoners_108.txt",
        "content": "import random, sequtils, strutils\n\ntype\n  Sample = tuple\n    succ: int\n    fail: int\n\nconst\n  numPrisoners = 100\n  numDrawsEachPrisoner = numPrisoners div 2\n  numDrawings: Positive = 1_000_000 div 1\n\nproc `$`(s: Sample): string =\n  \"Succs: $#\\tFails: $#\\tTotal: $#\\tSuccess Rate: $#%.\" % [$s.succ, $s.fail, $(s.succ + s.fail), $(s.succ.float / (s.succ + s.fail).float * 100.0)]\n\nproc prisonersWillBeReleasedSmart(): bool =\n  result = true\n  var drawers = toSeq(0..<numPrisoners)\n  drawers.shuffle\n  for prisoner in 0..<numPrisoners:\n    var drawer = prisoner\n    block inner:\n      for _ in 0..<numDrawsEachPrisoner:\n        if drawers[drawer] == prisoner: break inner\n        drawer = drawers[drawer]\n      return false\n\nproc prisonersWillBeReleasedRandom(): bool =\n  result = true\n  var drawers = toSeq(0..<numPrisoners)\n  drawers.shuffle\n  for prisoner in 0..<numPrisoners:\n    var selectDrawer = toSeq(0..<numPrisoners)\n    selectDrawer.shuffle\n    block inner:\n      for i in 0..<numDrawsEachPrisoner:\n        if drawers[selectDrawer[i]] == prisoner: break inner\n      return false\n\nproc massDrawings(prisonersWillBeReleased: proc(): bool): Sample =\n  var success = 0\n  for i in 1..numDrawings:\n    if prisonersWillBeReleased():\n      inc(success)\n  return (success, numDrawings - success)\n\nrandomize()\necho $massDrawings(prisonersWillBeReleasedSmart)\necho $massDrawings(prisonersWillBeReleasedRandom)\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_109.txt",
        "content": "Succs: 312225   Fails: 687775   Total: 1000000  Success Rate: 31.2225%.\nSuccs: 0        Fails: 1000000  Total: 1000000  Success Rate: 0.0%.",
        "safe": true
    },
    {
        "filename": "100_prisoners_11.txt",
        "content": "\u2207 R \u2190 random Nnc; N; n; c\n  (N n c) \u2190 Nnc\n  R \u2190 \u2227/{\u2228/\u2375=c[n?N]}\u00a8\u2373N\n\u2207\n\n\u2207 R \u2190 follow Nnc; N; n; c; b\n  (N n c) \u2190 Nnc\n  b \u2190 n N\u2374\u2373N\n  R \u2190 \u2227/\u2228\u233fb={\u237a\u22a2c[\u2375]}\u2340n N\u2374c\n\u2207\n\n\u2207 R \u2190 M timesSimPrisoners Nn; N; n; m; c; r; s\n  (N n) \u2190 Nn\n  R \u2190 0 0\n  m \u2190 M\n  LOOP: c\u2190N?N       \n  r \u2190 random N n c\n  s \u2190 follow N n c\n  R \u2190 R + r,s      \n  \u2192((m\u2190m-1)>0)/LOOP\n  R \u2190 R \u00f7 M\n\u2207\n\n\u2395TS\n'>>>>>'\n1000 timesSimPrisoners 100 50\n'>>>>>'\n\u2395TS\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_110.txt",
        "content": "program Prisoners100;\n\nconst\n  rounds  = 100000;\n\ntype\n  tValue = Uint32;\n  tPrisNum = array of tValue;\nvar\n  drawers,\n  PrisonersChoice : tPrisNum;\n\nprocedure shuffle(var N:tPrisNum);\nvar\n  i,j,lmt : nativeInt;\n  tmp: tValue;\nBegin\n  lmt := High(N);\n  For i := lmt downto 1 do\n  begin\n    //take on from index i..limit\n    j := random(i+1);\n    //exchange with i\n    tmp := N[i];N[i]:= N[j];N[j]:= tmp;\n  end;\nend;\n\nfunction PardonedRandom(maxTestNum: NativeInt):boolean;\nvar\n  PrisNum,TestNum,Lmt : NativeUint;\n  Pardoned : boolean;\nBegin\n  IF maxTestNum <=0 then\n  Begin\n    PardonedRandom := false;\n    EXIT;\n  end;\n  Lmt := High(drawers);\n  IF (maxTestNum >= Lmt) then\n  Begin\n    PardonedRandom := true;\n    EXIT;\n  end;\n\n  shuffle(drawers);\n  PrisNum := 0;\n  repeat\n    //every prisoner uses his own list of drawers\n    shuffle(PrisonersChoice);\n    TestNum := 0;\n    repeat\n      Pardoned := drawers[PrisonersChoice[TestNum]] = PrisNum;\n      inc(TestNum);\n    until Pardoned OR (TestNum>=maxTestNum);\n    IF Not(Pardoned) then\n      BREAK;\n    inc(PrisNum);\n  until PrisNum>=Lmt;\n  PardonedRandom:= Pardoned;\nend;\n\nfunction PardonedOptimized(maxTestNum: NativeUint):boolean;\nvar\n  PrisNum,TestNum,NextNum,Cnt,Lmt : NativeUint;\n  Pardoned : boolean;\nBegin\n  IF maxTestNum <=0 then\n  Begin\n    PardonedOptimized := false;\n    EXIT;\n  end;\n  Lmt := High(drawers);\n  IF (maxTestNum >= Lmt) then\n  Begin\n    PardonedOptimized := true;\n    EXIT;\n  end;\n\n  shuffle(drawers);\n  Lmt := High(drawers);\n  IF maxTestNum >= Lmt then\n  Begin\n    PardonedOptimized := true;\n    EXIT;\n  end;\n  PrisNum := 0;\n  repeat\n    Cnt := 0;\n    NextNum := PrisNum;\n    repeat\n      TestNum := NextNum;\n      NextNum := drawers[TestNum];\n      inc(cnt);\n      Pardoned := NextNum = PrisNum;\n    until Pardoned OR (cnt >=maxTestNum);\n\n    IF Not(Pardoned) then\n      BREAK;\n    inc(PrisNum);\n  until PrisNum>Lmt;\n  PardonedOptimized := Pardoned;\nend;\n\nprocedure CheckRandom(testCount : NativeUint);\nvar\n  i,cnt : NativeInt;\nBegin\n  cnt := 0;\n  For i := 1 to rounds do\n    IF PardonedRandom(TestCount) then\n      inc(cnt);\n  writeln('Randomly  ',cnt/rounds*100:7:2,'% get pardoned out of ',rounds,' checking max ',TestCount);\nend;\n\nprocedure CheckOptimized(testCount : NativeUint);\nvar\n  i,cnt : NativeInt;\nBegin\n  cnt := 0;\n  For i := 1 to rounds do\n    IF PardonedOptimized(TestCount) then\n      inc(cnt);\n  writeln('Optimized ',cnt/rounds*100:7:2,'% get pardoned out of ',rounds,' checking max ',TestCount);\nend;\n\nprocedure OneCompareRun(PrisCnt:NativeInt);\nvar\n  i,lmt :nativeInt;\nbegin\n  setlength(drawers,PrisCnt);\n  For i := 0 to PrisCnt-1 do\n    drawers[i] := i;\n  PrisonersChoice := copy(drawers);\n\n  //test\n  writeln('Checking ',PrisCnt,' prisoners');\n\n  lmt := PrisCnt;\n  repeat\n    CheckOptimized(lmt);\n    dec(lmt,PrisCnt DIV 10);\n  until lmt < 0;\n  writeln;\n\n  lmt := PrisCnt;\n  repeat\n    CheckRandom(lmt);\n    dec(lmt,PrisCnt DIV 10);\n  until lmt < 0;\n  writeln;\n  writeln;\nend;\n\nBegin\n  //init\n  randomize;\n  OneCompareRun(20);\n  OneCompareRun(100);\nend.\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_111.txt",
        "content": "Checking 20 prisoners\nOptimized  100.00% get pardoned out of 100000 checking max 20\nOptimized   89.82% get pardoned out of 100000 checking max 18\nOptimized   78.25% get pardoned out of 100000 checking max 16\nOptimized   65.31% get pardoned out of 100000 checking max 14\nOptimized   50.59% get pardoned out of 100000 checking max 12\nOptimized   33.20% get pardoned out of 100000 checking max 10\nOptimized   15.28% get pardoned out of 100000 checking max 8\nOptimized    3.53% get pardoned out of 100000 checking max 6\nOptimized    0.10% get pardoned out of 100000 checking max 4\nOptimized    0.00% get pardoned out of 100000 checking max 2\nOptimized    0.00% get pardoned out of 100000 checking max 0\n\nRandomly   100.00% get pardoned out of 100000 checking max 20\nRandomly    13.55% get pardoned out of 100000 checking max 18\nRandomly     1.38% get pardoned out of 100000 checking max 16\nRandomly     0.12% get pardoned out of 100000 checking max 14\nRandomly     0.00% get pardoned out of 100000 checking max 12\nRandomly     0.00% get pardoned out of 100000 checking max 10\nRandomly     0.00% get pardoned out of 100000 checking max 8\nRandomly     0.00% get pardoned out of 100000 checking max 6\nRandomly     0.00% get pardoned out of 100000 checking max 4\nRandomly     0.00% get pardoned out of 100000 checking max 2\nRandomly     0.00% get pardoned out of 100000 checking max 0\n\n\nChecking 100 prisoners\nOptimized  100.00% get pardoned out of 100000 checking max 100\nOptimized   89.48% get pardoned out of 100000 checking max 90\nOptimized   77.94% get pardoned out of 100000 checking max 80\nOptimized   64.48% get pardoned out of 100000 checking max 70\nOptimized   49.35% get pardoned out of 100000 checking max 60\nOptimized   31.10% get pardoned out of 100000 checking max 50\nOptimized   13.38% get pardoned out of 100000 checking max 40\nOptimized    2.50% get pardoned out of 100000 checking max 30\nOptimized    0.05% get pardoned out of 100000 checking max 20\nOptimized    0.00% get pardoned out of 100000 checking max 10\nOptimized    0.00% get pardoned out of 100000 checking max 0\n\nRandomly   100.00% get pardoned out of 100000 checking max 100\nRandomly     0.01% get pardoned out of 100000 checking max 90\nRandomly     0.00% get pardoned out of 100000 checking max 80\nRandomly     0.00% get pardoned out of 100000 checking max 70\nRandomly     0.00% get pardoned out of 100000 checking max 60\nRandomly     0.00% get pardoned out of 100000 checking max 50\nRandomly     0.00% get pardoned out of 100000 checking max 40\nRandomly     0.00% get pardoned out of 100000 checking max 30\nRandomly     0.00% get pardoned out of 100000 checking max 20\nRandomly     0.00% get pardoned out of 100000 checking max 10\nRandomly     0.00% get pardoned out of 100000 checking max 0",
        "safe": true
    },
    {
        "filename": "100_prisoners_112.txt",
        "content": "program Prisoners100;\n{$IFDEF FPC}\n  {$MODE DELPHI}{$OPTIMIZATION ON,ALL}\n{$ELSE}\n  {$APPTYPE CONSOLE}\n{$ENDIF}\ntype\n  tValue  = NativeUint;\n  tpValue = pNativeUint;\n  tPrisNum = array of tValue;\n\nconst\n  rounds  = 1000000;\n  cAlreadySeen = High(tValue);\nvar\n  drawers,\n  Visited,\n  CntToPardoned : tPrisNum;\n  PrisCount : NativeInt;\n\nprocedure shuffle(var N:tPrisNum;lmt : nativeInt = 0);\nvar\n  pN : tpValue;\n  i,j : nativeInt;\n  tmp: tValue;\nBegin\n  pN := @N[0];\n  if lmt = 0 then\n    lmt := High(N);\n  For i := lmt downto 1 do\n  begin\n    //take one from index [0..i]\n    j := random(i+1);\n    //exchange with i\n    tmp := pN[i];pN[i]:= pN[j];pN[j]:= tmp;\n  end;\nend;\n\nprocedure CopyDrawers2Visited;\n//drawers and Visited are of same size, so only moving values\nBegin\n  Move(drawers[0],Visited[0],SizeOf(tValue)*PrisCount);\nend;\n\nfunction GetMaxCycleLen:NativeUint;\nvar\n  pVisited : tpValue;\n  cycleLen,MaxCycLen,Num,NumBefore : NativeUInt;\nBegin\n  CopyDrawers2Visited;\n  pVisited := @Visited[0];\n  MaxCycLen := 0;\n  cycleLen := MaxCycLen;\n  Num := MaxCycLen;\n  repeat\n    NumBefore := Num;\n    Num := pVisited[Num];\n    pVisited[NumBefore] := cAlreadySeen;\n    inc(cycleLen);\n    IF (Num= NumBefore) or (Num = cAlreadySeen) then\n    begin\n      IF Num = cAlreadySeen then\n        dec(CycleLen);\n      IF MaxCycLen < cycleLen then\n        MaxCycLen := cycleLen;\n      Num := 0;\n      while (Num< PrisCount) AND (pVisited[Num] = cAlreadySeen) do\n        inc(Num);\n      //all cycles found\n      IF Num >= PrisCount then\n        BREAK;\n      cycleLen :=0;\n    end;\n  until false;\n  GetMaxCycleLen := MaxCycLen-1;\nend;\n\nprocedure CheckOptimized(testCount : NativeUint);\nvar\n  factor: extended;\n  i,sum,digit,delta : NativeInt;\nBegin\n  For i := 1 to rounds do\n  begin\n    shuffle(drawers);\n    inc(CntToPardoned[GetMaxCycleLen]);\n  end;\n\n  digit := 0;\n  sum := rounds;\n  while sum > 100 do\n  Begin\n    inc(digit);\n    sum := sum DIV 10;\n  end;\n  factor := 100.0/rounds;\n\n  delta :=0;\n  sum := 0;\n  For i := 0 to High(drawers) do\n  Begin\n    inc(sum,CntToPardoned[i]);\n    dec(delta);\n    IF delta <= 0 then\n    Begin\n      writeln(sum*factor:Digit+5:Digit,'% get pardoned checking max ',i+1);\n      delta := delta+Length(drawers) DIV 10;\n    end;\n  end;\nend;\n\nprocedure OneCompareRun(PrisCnt:NativeInt);\nvar\n  i,lmt :nativeInt;\nbegin\n  PrisCount := PrisCnt;\n  setlength(drawers,PrisCnt);\n  For i := 0 to PrisCnt-1 do\n    drawers[i] := i;\n  setlength(Visited,PrisCnt);\n  setlength(CntToPardoned,PrisCnt);\n  //test\n  writeln('Checking ',PrisCnt,' prisoners for ',rounds,' rounds');\n  lmt := PrisCnt;\n  CheckOptimized(lmt);\n  writeln;\n\n  setlength(CntToPardoned,0);\n  setlength(Visited,0);\n  setlength(drawers,0);\nend;\n\nBegin\n  randomize;\n  OneCompareRun(10);\n  OneCompareRun(100);\n  OneCompareRun(1000);\nend.\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_113.txt",
        "content": "Checking 10 prisoners for 1000000 rounds\n   0.0000% get pardoned checking max 1\n   0.2584% get pardoned checking max 2\n   4.7431% get pardoned checking max 3\n  17.4409% get pardoned checking max 4\n  35.4983% get pardoned checking max 5\n  52.1617% get pardoned checking max 6\n  66.4807% get pardoned checking max 7\n  78.9761% get pardoned checking max 8\n  90.0488% get pardoned checking max 9\n 100.0000% get pardoned checking max 10\n\nChecking 100 prisoners for 1000000 rounds\n   0.0000% get pardoned checking max 1\n   0.0000% get pardoned checking max 10\n   0.0459% get pardoned checking max 20\n   2.5996% get pardoned checking max 30\n  13.5071% get pardoned checking max 40\n  31.2258% get pardoned checking max 50\n  49.3071% get pardoned checking max 60\n  64.6128% get pardoned checking max 70\n  77.8715% get pardoned checking max 80\n  89.5385% get pardoned checking max 90\n 100.0000% get pardoned checking max 100\n\nChecking 1000 prisoners for 1000000 rounds\n   0.0000% get pardoned checking max 1\n   0.0000% get pardoned checking max 100\n   0.0374% get pardoned checking max 200\n   2.3842% get pardoned checking max 300\n  13.1310% get pardoned checking max 400\n  30.7952% get pardoned checking max 500\n  48.9710% get pardoned checking max 600\n  64.3555% get pardoned checking max 700\n  77.6950% get pardoned checking max 800\n  89.4515% get pardoned checking max 900\n 100.0000% get pardoned checking max 1000\n\nreal    0m9,975s",
        "safe": true
    },
    {
        "filename": "100_prisoners_114.txt",
        "content": "use strict;\nuse warnings;\nuse feature 'say';\nuse List::Util 'shuffle';\n\nsub simulation {\n    my($population,$trials,$strategy) = @_;\n    my $optimal   = $strategy =~ /^o/i ? 1 : 0;\n    my @prisoners = 0..$population-1;\n    my $half      = int $population / 2;\n    my $pardoned  = 0;\n\n    for (1..$trials) {\n        my @drawers = shuffle @prisoners;\n        my $total = 0;\n        for my $prisoner (@prisoners) {\n            my $found = 0;\n            if ($optimal) {\n                my $card = $drawers[$prisoner];\n                if ($card == $prisoner) {\n                    $found = 1;\n                } else {\n                    for (1..$half-1) {\n                        $card = $drawers[$card];\n                        ($found = 1, last) if $card == $prisoner\n                    }\n                }\n            } else {\n                for my $card ( (shuffle @drawers)[0..$half]) {\n                    ($found = 1, last) if $card == $prisoner\n                }\n            }\n            last unless $found;\n            $total++;\n        }\n        $pardoned++ if $total == $population;\n    }\n    $pardoned / $trials * 100\n}\n\nmy $population = 100;\nmy $trials     = 10000;\nsay \" Simulation count: $trials\\n\" .\n(sprintf \" Random strategy pardons: %6.3f%% of simulations\\n\", simulation $population, $trials, 'random' ) .\n(sprintf \"Optimal strategy pardons: %6.3f%% of simulations\\n\", simulation $population, $trials, 'optimal');\n\n$population = 10;\n$trials     = 100000;\nsay \" Simulation count: $trials\\n\" .\n(sprintf \" Random strategy pardons: %6.3f%% of simulations\\n\", simulation $population, $trials, 'random' ) .\n(sprintf \"Optimal strategy pardons: %6.3f%% of simulations\\n\", simulation $population, $trials, 'optimal');\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_115.txt",
        "content": " Simulation count: 10000\n Random strategy pardons:  0.000% of simulations\nOptimal strategy pardons: 31.510% of simulations\n\n Simulation count: 1000000\n Random strategy pardons:  0.099% of simulations\nOptimal strategy pardons: 35.420% of simulations",
        "safe": true
    },
    {
        "filename": "100_prisoners_116.txt",
        "content": "(de shuffle (Lst)\n   (by '(NIL (rand)) sort Lst) )\n\n# Extend this class with a `next-guess>` method and a `str>` method.\n(class +Strategy +Entity)\n(dm prev-drawer> (Num)\n   (=: prev Num) )\n\n(class +Random +Strategy)\n(dm T (Prisoner)\n   (=: guesses (nth (shuffle (range 1 100)) 51)) )\n(dm next-guess> ()\n   (pop (:: guesses)) )\n(dm str> ()\n   \"Random\" )\n\n(class +Optimal +Strategy)\n(dm T (Prisoner)\n   (=: prisoner-id Prisoner) )\n(dm next-guess> ()\n   (or (: prev) (: prisoner-id)) )\n(dm str> ()\n   \"Optimal/Wikipedia\" )\n\n\n(de test-strategy (Strategy)\n   \"Simulate one round of 100 prisoners who use `Strategy`\"\n   (let Drawers (shuffle (range 1 100))\n      (for Prisoner (range 1 100)\n         (NIL # Break and return NIL if any prisoner fails their test.\n            (let Strat (new (list Strategy) Prisoner)\n               (do 50 # Try 50 iterations of `Strat`. Break and return T iff success.\n                  (T (= Prisoner (prev-drawer> Strat (get Drawers (next-guess> Strat))))\n                     T ) ) ) )\n         T ) ) )\n\n(de test-strategy-n-times (Strategy N)\n   \"Simulate `N` rounds of 100 prisoners who use `Strategy`\"\n   (let Successes 0\n      (do N\n         (when (test-strategy Strategy)\n            (inc 'Successes) ) )\n      (prinl \"We have a \" (/ (* 100 Successes) N) \"% success rate with \" N \" trials.\")\n      (prinl \"This is using the \" (str> Strategy) \" strategy.\") ) )",
        "safe": true
    },
    {
        "filename": "100_prisoners_117.txt",
        "content": "(test-strategy-n-times '+Random 10000)\n(test-strategy-n-times '+Optimal 10000)",
        "safe": true
    },
    {
        "filename": "100_prisoners_118.txt",
        "content": "We have a 0% success rate with 10000 trials.\nThis is using the Random strategy.\nWe have a 31% success rate with 10000 trials.\nThis is using the Optimal/Wikipedia strategy.",
        "safe": true
    },
    {
        "filename": "100_prisoners_119.txt",
        "content": "function play(integer prisoners, iterations, bool optimal)\n    sequence drawers = shuffle(tagset(prisoners))\n    integer pardoned = 0\n    bool found = false\n    for i=1 to iterations do\n        drawers = shuffle(drawers)\n        for prisoner=1 to prisoners do\n            found = false\n            integer drawer = iff(optimal?prisoner:rand(prisoners))\n            for j=1 to prisoners/2 do\n                drawer = drawers[drawer]\n                if drawer==prisoner then found = true exit end if\n                if not optimal then drawer = rand(prisoners) end if\n            end for\n            if not found then exit end if\n        end for\n        pardoned += found\n    end for\n    return 100*pardoned/iterations\nend function\n \nconstant iterations = 100_000\nprintf(1,\"Simulation count: %d\\n\",iterations)\nfor prisoners in {10,100} do\n    atom random = play(prisoners,iterations,false),\n         optimal = play(prisoners,iterations,true)\n    printf(1,\"Prisoners:%d, random:%g, optimal:%g\\n\",{prisoners,random,optimal})\nend for\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_12.txt",
        "content": "2023 3 26 17 43 32 983\n>>>>>\n0 0.307\n>>>>>\n2023 3 26 17 53 48 531\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_120.txt",
        "content": "Simulation count: 100000\nPrisoners:10, random:0.006, optimal:35.168\nPrisoners:100, random:0, optimal:31.098\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_121.txt",
        "content": "/# Rosetta Code problem: http://rosettacode.org/wiki/100_prisoners\nby Galileo, 05/2022 #/\n\ninclude ..\\Utilitys.pmt\n\ndef random rand * 1 + int enddef\n\ndef shuffle\n    len var l\n    l for var a\n        l random var b\n        b get var p\n        a get b set\n        p a set\n    endfor\nenddef\n\ndef play var optimal var iterations var prisoners\n    0 var pardoned\n\n    ( prisoners for endfor )\n    \n    iterations for drop\n        shuffle\n        prisoners for var prisoner\n            false var found\n            optimal if prisoner else prisoners random endif\n            prisoners 2 / int for drop\n                get dup prisoner == if true var found exitfor\n                else\n                    optimal not if drop prisoners random endif\n                endif\n            endfor\n            found not if exitfor endif\n            drop\n        endfor\n        pardoned found + var pardoned\n    endfor\n    drop\n    pardoned 100 * iterations /\nenddef\n\n\"Please, be patient ...\"\u00a0?\n\n( \"Optimal: \" 100 10000 true play\n  \" Random: \" 100 10000 false play\n  \" Prisoners: \" prisoners ) lprint",
        "safe": true
    },
    {
        "filename": "100_prisoners_122.txt",
        "content": "Please, be patient ...\nOptimal: 31.65 Random: 0 Prisoners: 100\n=== Press any key to exit ===",
        "safe": true
    },
    {
        "filename": "100_prisoners_123.txt",
        "content": "100H:\n/* PARAMETERS */\nDECLARE N$DRAWERS  LITERALLY '100';  /* AMOUNT OF DRAWERS */\nDECLARE N$ATTEMPTS LITERALLY '50';   /* ATTEMPTS PER PRISONER */\nDECLARE N$SIMS     LITERALLY '2000'; /* N. OF SIMULATIONS TO RUN */ \nDECLARE RAND$SEED  LITERALLY '193';  /* RANDOM SEED */\n\n/* CP/M CALLS */\nBDOS: PROCEDURE (FN, ARG); DECLARE FN BYTE, ARG ADDRESS; GO TO 5; END BDOS;\nEXIT: PROCEDURE; CALL BDOS(0, 0); END EXIT;\nPRINT: PROCEDURE (S); DECLARE S ADDRESS; CALL BDOS(9, S); END PRINT;\n\n/* PRINT NUMBER */\nPRINT$NUMBER: PROCEDURE (N);\n    DECLARE S (6) BYTE INITIAL ('.....$');\n    DECLARE (P, N) ADDRESS, C BASED P BYTE;\n    P = .S(5);\nDIGIT:\n    P = P - 1;\n    C = N MOD 10 + '0';\n    N = N / 10;\n    IF N > 0 THEN GO TO DIGIT;\n    CALL PRINT(P);\nEND PRINT$NUMBER;\n\n/* RANDOM NUMBER GENERATOR */\nRAND$BYTE: PROCEDURE BYTE;\n    DECLARE (X, A, B, C) BYTE \n        INITIAL (RAND$SEED, RAND$SEED, RAND$SEED, RAND$SEED);\n    X = X+1;\n    A = A XOR C XOR X;\n    B = B+A;\n    C = C+SHR(B,1)+A;\n    RETURN C;\nEND RAND$BYTE;\n\n/* GENERATE RANDOM NUMBER FROM 0 TO MAX */\nRAND$MAX: PROCEDURE (MAX) BYTE;\n    DECLARE (X, R, MAX) BYTE;\n    X = 1;\n    DO WHILE X < MAX;\n        X = SHL(X,1);\n    END;\n    X = X-1;\n    DO WHILE 1;\n        R = RAND$BYTE AND X;\n        IF R < MAX THEN RETURN R;\n    END;\nEND RAND$MAX;\n\n/* PLACE CARDS RANDOMLY IN DRAWERS */\nINIT$DRAWERS: PROCEDURE (DRAWERS);\n    DECLARE DRAWERS ADDRESS, (D BASED DRAWERS, I, J, K) BYTE;\n    DO I=0 TO N$DRAWERS-1;\n        D(I) = I;\n    END;\n    DO I=0 TO N$DRAWERS-1;\n        J = I + RAND$MAX(N$DRAWERS-I);\n        K = D(I);\n        D(I) = D(J);\n        D(J) = K;\n    END;\nEND INIT$DRAWERS;\n\n/* PRISONER OPENS RANDOM DRAWERS */\nRANDOM$STRATEGY: PROCEDURE (DRAWERS, P) BYTE;\n    DECLARE DRAWERS ADDRESS, D BASED DRAWERS BYTE;\n    DECLARE (P, I, TRIES) BYTE;\n    \n    /* KEEP TRACK OF WHICH DRAWERS HAVE BEEN OPENED */\n    DECLARE OPEN (N$DRAWERS) BYTE;\n    DO I=0 TO N$DRAWERS-1;\n        OPEN(I) = 0;\n    END;\n    \n    /* OPEN RANDOM DRAWERS */\n    TRIES = N$ATTEMPTS;\n    DO WHILE TRIES > 0;\n        IF NOT OPEN(I\u00a0:= RAND$MAX(N$DRAWERS)) THEN DO;\n            /* IF WE FIND OUR NUMBER, SUCCESS */\n            IF D(I) = P THEN RETURN 1;\n            OPEN(I) = 1;    \n            TRIES = TRIES - 1;\n        END;\n    END;\n    \n    RETURN 0; /* WE DID NOT FIND OUR NUMBER */\nEND RANDOM$STRATEGY;\n\n/* PRISONER USES OPTIMAL STRATEGY */\nOPTIMAL$STRATEGY: PROCEDURE (DRAWERS, P) BYTE;\n    DECLARE DRAWERS ADDRESS, D BASED DRAWERS BYTE;\n    DECLARE (P, I, TRIES) BYTE;\n    TRIES = N$ATTEMPTS;\n    I = P;\n    DO WHILE TRIES > 0;\n        I = D(I); /* OPEN DRAWER W/ CURRENT NUMBER */\n        IF I = P THEN RETURN 1; /* DID WE FIND IT? */\n        TRIES = TRIES - 1;\n    END;\n    RETURN 0;\nEND OPTIMAL$STRATEGY;\n\n/* RUN A SIMULATION */\nDECLARE RANDOM LITERALLY '0';\nDECLARE OPTIMAL LITERALLY '1';\nSIMULATE: PROCEDURE (STRAT) BYTE;\n    DECLARE (STRAT, P, R) BYTE;\n    \n    /* PLACE CARDS IN DRAWERS */\n    DECLARE DRAWERS (N$DRAWERS) BYTE;\n    CALL INIT$DRAWERS(.DRAWERS);\n    \n    /* TRY EACH PRISONER */\n    DO P=0 TO N$DRAWERS-1;\n        DO CASE STRAT;\n            R = RANDOM$STRATEGY(.DRAWERS, P);\n            R = OPTIMAL$STRATEGY(.DRAWERS, P);\n        END;\n        \n        /* IF ONE PRISONER FAILS THEY ALL HANG */\n        IF NOT R THEN RETURN 0;\n    END;\n    \n    RETURN 1; /* IF THEY ALL SUCCEED NONE HANG */\nEND SIMULATE;\n\n/* RUN MANY SIMULATIONS AND COUNT THE SUCCESSES */\nRUN$SIMULATIONS: PROCEDURE (N, STRAT) ADDRESS;\n    DECLARE STRAT BYTE, (I, N, SUCC) ADDRESS;\n    SUCC = 0;\n    DO I=1 TO N;\n        SUCC = SUCC + SIMULATE(STRAT);\n    END;\n    RETURN SUCC;\nEND RUN$SIMULATIONS;\n\n/* RUN AND PRINT SIMULATIONS */\nRUN$AND$PRINT: PROCEDURE (NAME, STRAT, N);\n    DECLARE (NAME, N, S) ADDRESS, STRAT BYTE;\n    CALL PRINT(NAME);\n    CALL PRINT(.' STRATEGY: $');\n    S = RUN$SIMULATIONS(N, STRAT);\n    CALL PRINT$NUMBER(S);\n    CALL PRINT(.' OUT OF $');\n    CALL PRINT$NUMBER(N);\n    CALL PRINT(.' - $');\n    CALL PRINT$NUMBER( S*10 / (N/10) );\n    CALL PRINT(.(37,13,10,'$'));\nEND RUN$AND$PRINT;\n\nCALL RUN$AND$PRINT(.'RANDOM$', RANDOM, N$SIMS);\nCALL RUN$AND$PRINT(.'OPTIMAL$', OPTIMAL, N$SIMS);\nCALL EXIT;\nEOF",
        "safe": true
    },
    {
        "filename": "100_prisoners_124.txt",
        "content": "RANDOM STRATEGY: 0 OUT OF 2000 - 0%\nOPTIMAL STRATEGY: 653 OUT OF 2000 - 32%",
        "safe": true
    },
    {
        "filename": "100_prisoners_125.txt",
        "content": "optimalSeq(drawers, n) =\n  iterate(ind => drawers[ind - 1], n)\n  |> takeUntil(ind => drawers[ind - 1] == n)\n\noptimalTrial(drawers) =\n  range(1, 100)\n  |> map(optimalSeq(drawers))\n\nrandomSeq(drawers, n) =\n  iterate(ind => randRange(1, 100), randRange(1, 100))\n  |> takeUntil(ind => drawers[ind - 1] == n)\n\nrandomTrial(drawers) =\n  range(1, 100)\n  |> map(randomSeq(drawers))\n\ncheckLength(seq) =\n  length(take(51, seq)) <= 50\n\nnumTrials = 3000\n\nrunTrials(trialFunc) =\n  for t in range(1, numTrials)\n  yield\n    range(1, 100)\n    |> shuffle\n    |> toArray\n    |> trialFunc\n    |> map(checkLength)\n    |> all\n\ncountSuccess(trialFunc) =\n  runTrials(trialFunc)\n  |> filter(id)\n  |> length\n\noptimalCount = countSuccess(optimalTrial)\nrandomCount = countSuccess(randomTrial)\n\noutput =\n  format(\"optimal: {} / {} = {} prob\\nrandom: {} / {} = {} prob\", [\n    optimalCount, numTrials, optimalCount / numTrials,\n    randomCount, numTrials, randomCount / numTrials,\n  ])\n  |> println\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_126.txt",
        "content": "optimal: 923 / 3000 = 0.30766666666666664 prob\nrandom: 0 / 3000 = 0.0 prob",
        "safe": true
    },
    {
        "filename": "100_prisoners_127.txt",
        "content": "### Clear Screen from old Output\nClear-Host\n\nFunction RandomOpening () \n  {\n    $Prisoners = 1..100 | Sort-Object {Get-Random}\n    $Cupboard = 1..100 | Sort-Object {Get-Random}\n    ## Loop for the Prisoners\n    $Survived = $true\n    for ($I=1;$I -le 100;$i++)\n      {\n          $OpeningListe = 1..100 | Sort-Object {Get-Random}\n          $Gefunden = $false\n          ## Loop for the trys of every prisoner\n          for ($X=1;$X -le 50;$X++)\n            {\n                $OpenNumber = $OpeningListe[$X]\n                IF ($Cupboard[$OpenNumber] -eq $Prisoners[$I])\n                  {\n                      $Gefunden = $true\n                  }\n                ## Cancel loop if prisoner found his number (yeah i know, dirty way ^^ )  \n                IF ($Gefunden)\n                  {\n                    $X = 55\n                  }\n            }\n          IF ($Gefunden -eq $false)\n            {\n              $I = 120\n              $Survived = $false\n            }            \n      }\n    Return $Survived\n  }\n\n  Function StrategyOpening () \n  {\n    $Prisoners = 1..100 | Sort-Object {Get-Random}\n    $Cupboard = 1..100 | Sort-Object {Get-Random}\n    $Survived = $true\n    for ($I=1;$I -le 100;$i++)\n      {\n          $Gefunden = $false\n          $OpeningNumber = $Prisoners[$I-1]\n          for ($X=1;$X -le 50;$X++)\n            {\n                IF ($Cupboard[$OpeningNumber-1] -eq $Prisoners[$I-1])\n                  {\n                      $Gefunden = $true\n                  }\n                else \n                  {\n                    $OpeningNumber = $Cupboard[$OpeningNumber-1]                  \n                  } \n                IF ($Gefunden)\n                  {\n                    $X = 55\n                  }\n            }\n          IF ($Gefunden -eq $false)\n            {\n              $I = 120\n              $Survived = $false\n            }            \n      }\n    Return $Survived\n  }\n\n$MaxRounds = 10000\n\nFunction TestRandom\n  {\n    $WinnerRandom = 0\n    for ($Round = 1; $Round -le $MaxRounds;$Round++)\n      {\n        IF (($Round%1000) -eq 0)\n          {\n            $Time = Get-Date\n            Write-Host \"Currently we are at rount $Round at $Time\"\n          }\n        $Rueckgabewert = RandomOpening\n        IF ($Rueckgabewert)\n          {\n            $WinnerRandom++\n          }\n      }\n    \n    $Prozent = (100/$MaxRounds)*$WinnerRandom\n    Write-Host \"There are $WinnerRandom survivors whit random opening. This is $Prozent percent\"\n  }\n\nFunction TestStrategy\n  {\n    $WinnersStrategy = 0 \n      for ($Round = 1; $Round -le $MaxRounds;$Round++)\n        {\n          IF (($Round%1000) -eq 0)\n            {\n              $Time = Get-Date\n              Write-Host \"Currently we are at $Round at $Time\"\n            }\n          $Rueckgabewert = StrategyOpening\n          IF ($Rueckgabewert)\n            {\n              $WinnersStrategy++\n            }\n        }\n    \n    $Prozent = (100/$MaxRounds)*$WinnersStrategy\n    Write-Host \"There are $WinnersStrategy survivors whit strategic opening. This is $Prozent percent\"\n  }\n\nFunction Main () \n  {\n    Clear-Host\n    TestRandom\n    TestStrategy\n  }\n\nMain\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_128.txt",
        "content": "# of executions: 10000\nThere are 0 survivors whit random opening. This is 0 percent\nThere are 3104 survivors whit strategic opening. This is 31,04 percent\"\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_129.txt",
        "content": "IntList drawers = new IntList();\nint trials = 100000;\nint succes_count;\n\nvoid setup() {\n  for (int i = 0; i < 100; i++) {\n    drawers.append(i);\n  }\n  println(trials + \" trials\\n\");\n\n  //Random strategy\n  println(\"Random strategy\");\n  succes_count = trials;\n  for (int i = 0; i < trials; i++) {\n    drawers.shuffle();\n    for (int prisoner = 0; prisoner < 100; prisoner++) {\n      boolean found = false;\n      for (int attempt = 0; attempt < 50; attempt++) {\n        if (drawers.get(int(random(drawers.size()))) == prisoner) {\n          found = true;\n          break;\n        }\n      }\n      if (!found) {\n        succes_count--;\n        break;\n      }\n    }\n  }\n  println(\" Succeses: \" + succes_count);\n  println(\" Succes rate: \" + 100.0 * succes_count / trials + \"%\\n\");\n\n  //Optimal strategy\n  println(\"Optimal strategy\");\n  succes_count = trials;\n  for (int i = 0; i < trials; i++) {\n    drawers.shuffle();\n    for (int prisoner = 0; prisoner < 100; prisoner++) {\n      boolean found = false;\n      int next = prisoner;\n      for (int attempt = 0; attempt < 50; attempt++) {\n        next = drawers.get(next);\n        if (next == prisoner) {\n          found = true;\n          break;\n        }\n      }\n      if (!found) {\n        succes_count--;\n        break;\n      }\n    }\n  }\n  println(\" Succeses: \" + succes_count);\n  print(\" Succes rate: \" + 100.0 * succes_count / trials + \"%\");\n}",
        "safe": true
    },
    {
        "filename": "100_prisoners_13.txt",
        "content": "0 GOTO 9\n\n1 FOR X = 0 TO N:J(X) = X: NEXT: FOR I = 0 TO N:FOR X = 0 TO N:T = J(X):NP =  INT ( RND (1) * H):J(X) = J(NP):J(NP) = T: NEXT :FOR G = 1 TO W:IF D(J(G)) = I THEN IP = IP + 1: NEXT I: RETURN \n2 NEXT G:RETURN \n\n3 FOR I = 0 TO N:NG = I: FOR G = 0 TO W:CD = D(NG):IF CD = I THEN IP = IP + 1: NEXT I: RETURN \n4 NG = CD:IF CD = I THEN STOP\n5 NEXT G: RETURN \n\n9 H=100:N=H-1:DIM D(99),J(99):FOR I = 0 TO N:D(I) = I: NEXT:W=INT(H/2)-1:M$=CHR$(13):M$(1)=\"RANDOM GUESSING\":M$(2)=\"CHAINED NUMBER PICKING\"\n\n1000 FOR Q = 0 TO 1 STEP 0 : HOME : PRINT \"100 PRISONERS\"M$: INPUT \"HOW MANY TRIALS FOR EACH METHOD? \";  TT\n1010     VTAB 2:CALL-958:PRINT M$\"RESULTS:\"M$\n1020     FOR M = 1 TO 2: SU(M) = 0:FA(M) = 0\n1030         FOR TN = 1 TO TT\n1040             VTAB 4:PRINT M$ \"   OUT OF \" TT \" TRIALS, THE RESULTS ARE\"M$\"   AS FOLLOWS...\";\n1050             IP = 0: X =  RND ( - TI): FOR I = 0 TO N:R =  INT ( RND (1) * N):T = D(I):D(I) = D(R):D(R) = T: NEXT\n1060             ON M GOSUB 1,3 : SU(M) = SU(M) + (IP = H):FA(M) = FA(M) + (IP < H)\n1070             FOR Z = 1 TO 2\n1071                 PRINT M$M$Z\". \"M$(Z)\":\"M$\n1073                 PRINT \"   \"SU(Z)\" SUCCESSES\"TAB(21)\n1074                 PRINT \"   \"FA(Z)\" FAILURES\"M$\n1075                 PRINT \"   \"(SU(Z) / TT) * 100\"% SUCCESS RATE.\";:CALL-868\n1090     NEXT Z,TN,M\n\n1100     PRINT M$M$\"AGAIN?\"\n1110     GET K$\n1120     Q = K$ <> \"Y\" AND K$ <> CHR$(ASC(\"Y\") + 32) : NEXT Q\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_130.txt",
        "content": "100000 trials\n\nRandom strategy\n Succeses: 0\n Succes rate: 0.0%\n\nOptimal strategy\n Succeses: 31134\n Succes rate: 31.134%",
        "safe": true
    },
    {
        "filename": "100_prisoners_131.txt",
        "content": "#PRISONERS=100\n#DRAWERS  =100\n#LOOPS    = 50\n#MAXPROBE = 10000\nOpenConsole()\n\nDim p1(#PRISONERS,#DRAWERS)\nDim p2(#PRISONERS,#DRAWERS)\nDim d(#DRAWERS)\n\nFor i=1 To #DRAWERS : d(i)=i : Next\nStart:\nFor probe=1 To #MAXPROBE\n  RandomizeArray(d(),1,100)\n  c1=0 : c2=0 \n  For m=1 To #PRISONERS\n    p2(m,1)=d(m) : If d(m)=m : p2(m,0)=1 : EndIf\n    For n=1 To #LOOPS\n      p1(m,n)=d(Random(100,1))\n      If p1(m,n)=m : p1(m,0)=1 : EndIf\n      If n>1 : p2(m,n)=d(p2(m,n-1)) : If p2(m,n)=m : p2(m,0)=1 : EndIf : EndIf\n    Next n\n  Next m\n  \n  For m=1 To #PRISONERS\n    If p1(m,0) : c1+1 : p1(m,0)=0 : EndIf \n    If p2(m,0) : c2+1 : p2(m,0)=0 : EndIf\n  Next m\n  \n  If c1=#PRISONERS : w1+1 : EndIf\n  If c2=#PRISONERS : w2+1 : EndIf\nNext probe\nPrint(\"TRIALS: \"+Str(#MAXPROBE))\nPrint(\"  RANDOM= \"+StrF(100*w1/#MAXPROBE,2)+\"%   STATEGY= \"+StrF(100*w2/#MAXPROBE,2)+\"%\")\nPrintN(~\"\\tFIN =q.\") : inp$=Input()\nw1=0 : w2=0\nIf inp$<>\"q\" : Goto Start : EndIf\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_132.txt",
        "content": "TRIALS: 10000  RANDOM= 0.00%   STATEGY= 30.83%\tFIN =q.\n\nTRIALS: 10000  RANDOM= 0.00%   STATEGY= 31.60%\tFIN =q.\n\nTRIALS: 10000  RANDOM= 0.00%   STATEGY= 31.20%\tFIN =q.",
        "safe": true
    },
    {
        "filename": "100_prisoners_133.txt",
        "content": "import random\n\ndef play_random(n):\n    # using 0-99 instead of ranges 1-100\n    pardoned = 0\n    in_drawer = list(range(100))\n    sampler = list(range(100))\n    for _round in range(n):\n        random.shuffle(in_drawer)\n        found = False\n        for prisoner in range(100):\n            found = False\n            for reveal in random.sample(sampler, 50):\n                card = in_drawer[reveal]\n                if card == prisoner:\n                    found = True\n                    break\n            if not found:\n                break\n        if found:\n            pardoned += 1\n    return pardoned / n * 100   #\u00a0%\n\ndef play_optimal(n):\n    # using 0-99 instead of ranges 1-100\n    pardoned = 0\n    in_drawer = list(range(100))\n    for _round in range(n):\n        random.shuffle(in_drawer)\n        for prisoner in range(100):\n            reveal = prisoner\n            found = False\n            for go in range(50):\n                card = in_drawer[reveal]\n                if card == prisoner:\n                    found = True\n                    break\n                reveal = card\n            if not found:\n                break\n        if found:\n            pardoned += 1\n    return pardoned / n * 100   #\u00a0%\n\nif __name__ == '__main__':\n    n = 100_000\n    print(\" Simulation count:\", n)\n    print(f\" Random play wins: {play_random(n):4.1f}% of simulations\")\n    print(f\"Optimal play wins: {play_optimal(n):4.1f}% of simulations\")\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_134.txt",
        "content": " Simulation count: 100000\n Random play wins:  0.0% of simulations\nOptimal play wins: 31.1% of simulations",
        "safe": true
    },
    {
        "filename": "100_prisoners_135.txt",
        "content": "# http://rosettacode.org/wiki/100_prisoners\n\nimport random\n\n\ndef main():\n    NUM_DRAWERS = 10\n    NUM_REPETITIONS = int(1E5)\n\n    print('{:15}: {:5} ({})'.format('approach', 'wins', 'ratio'))\n    for approach in PrisionersGame.approaches:\n        num_victories = 0\n        for _ in range(NUM_REPETITIONS):\n            game = PrisionersGame(NUM_DRAWERS)\n            num_victories += PrisionersGame.victory(game.play(approach))\n\n        print('{:15}: {:5} ({:.2%})'.format(\n            approach.__name__, num_victories, num_victories / NUM_REPETITIONS))\n\n\nclass PrisionersGame:\n    \"\"\"docstring for PrisionersGame\"\"\"\n    def __init__(self, num_drawers):\n        assert num_drawers % 2 == 0\n        self.num_drawers = num_drawers\n        self.max_attempts = int(self.num_drawers / 2)\n        self.drawer_ids = list(range(1, num_drawers + 1))\n        shuffled = self.drawer_ids[:]\n        random.shuffle(shuffled)\n        self.drawers = dict(zip(self.drawer_ids, shuffled))\n\n    def play_naive(self, player_number):\n        \"\"\" Randomly open drawers \"\"\"\n        for attempt in range(self.max_attempts):\n            if self.drawers[random.choice(self.drawer_ids)] == player_number:\n                return True\n\n        return False\n\n    def play_naive_mem(self, player_number):\n        \"\"\" Randomly open drawers but avoiding repetitions \"\"\"\n        not_attemped = self.drawer_ids[:]\n        for attempt in range(self.max_attempts):\n            guess = random.choice(not_attemped)\n            not_attemped.remove(guess)\n\n            if self.drawers[guess] == player_number:\n                return True\n\n        return False\n\n    def play_optimum(self, player_number):\n        \"\"\" Open the drawer that matches the player number and then open the drawer\n        with the revealed number.\n        \"\"\"\n        prev_attempt = player_number\n        for attempt in range(self.max_attempts):\n            if self.drawers[prev_attempt] == player_number:\n                return True\n            else:\n                prev_attempt = self.drawers[prev_attempt]\n\n        return False\n\n    @classmethod\n    def victory(csl, results):\n        \"\"\"Defines a victory of a game: all players won\"\"\"\n        return all(results)\n\n    approaches = [play_naive, play_naive_mem, play_optimum]\n\n    def play(self, approach):\n        \"\"\"Plays this game and returns a list of booleans with\n        True if a player one, False otherwise\"\"\"\n        return [approach(self, player) for player in self.drawer_ids]\n\n\nif __name__ == '__main__':\n    main()\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_136.txt",
        "content": "With 10 drawers (100k runs)\napproach      \u00a0: wins  (ratio)\nplay_naive    \u00a0:    14 (0.01%)\nplay_naive_mem\u00a0:    74 (0.07%)\nplay_optimum  \u00a0: 35410 (35.41%)\n\nWith 100 drawers (10k runs)\napproach      \u00a0: wins  (ratio)\nplay_naive    \u00a0:     0 (0.00%)\nplay_naive_mem\u00a0:     0 (0.00%)\nplay_optimum  \u00a0:  3084 (30.84%)",
        "safe": true
    },
    {
        "filename": "100_prisoners_137.txt",
        "content": "'''100 Prisoners'''\n\nfrom random import randint, sample\n\n\n# allChainedPathsAreShort\u00a0:: Int -> IO (0|1)\ndef allChainedPathsAreShort(n):\n    '''1 if none of the index-chasing cycles in a shuffled\n       sample of [1..n] cards are longer than half the\n       sample size. Otherwise, 0.\n    '''\n    limit = n // 2\n    xs = range(1, 1 + n)\n    shuffled = sample(xs, k=n)\n\n    # A cycle of boxes, drawn from a shuffled\n    # sample, which includes the given target.\n    def cycleIncluding(target):\n        boxChain = [target]\n        v = shuffled[target - 1]\n        while v != target:\n            boxChain.append(v)\n            v = shuffled[v - 1]\n        return boxChain\n\n    # Nothing if the target list is empty, or if the cycle which contains the\n    # first target is larger than half the sample size.\n    # Otherwise, just a cycle of enchained boxes containing the first target\n    # in the list, tupled with the residue of any remaining targets which\n    # fall outside that cycle.\n    def boxCycle(targets):\n        if targets:\n            boxChain = cycleIncluding(targets[0])\n            return Just((\n                difference(targets[1:])(boxChain),\n                boxChain\n            )) if limit >= len(boxChain) else Nothing()\n        else:\n            return Nothing()\n\n    # No cycles longer than half of total box count\u00a0?\n    return int(n == sum(map(len, unfoldr(boxCycle)(xs))))\n\n\n# randomTrialResult\u00a0:: RandomIO (0|1) -> Int -> (0|1)\ndef randomTrialResult(coin):\n    '''1 if every one of the prisoners finds their ticket\n       in an arbitrary half of the sample. Otherwise 0.\n    '''\n    return lambda n: int(all(\n        coin(x) for x in range(1, 1 + n)\n    ))\n\n\n# TEST ----------------------------------------------------\n# main\u00a0:: IO ()\ndef main():\n    '''Two sampling techniques constrasted with 100 drawers\n       and 100 prisoners, over 100,000 trial runs.\n    '''\n    halfOfDrawers = randomRInt(0)(1)\n\n    def optimalDrawerSampling(x):\n        return allChainedPathsAreShort(x)\n\n    def randomDrawerSampling(x):\n        return randomTrialResult(halfOfDrawers)(x)\n\n    # kSamplesWithNBoxes\u00a0:: Int -> Int -> String\n    def kSamplesWithNBoxes(k):\n        tests = range(1, 1 + k)\n        return lambda n: '\\n\\n' + fTable(\n            str(k) + ' tests of optimal vs random drawer-sampling ' +\n            'with ' + str(n) + ' boxes: \\n'\n        )(fName)(lambda r: '{:.2%}'.format(r))(\n            lambda f: sum(f(n) for x in tests) / k\n        )([\n            optimalDrawerSampling,\n            randomDrawerSampling,\n        ])\n\n    print(kSamplesWithNBoxes(10000)(10))\n\n    print(kSamplesWithNBoxes(10000)(100))\n\n    print(kSamplesWithNBoxes(100000)(100))\n\n\n# ------------------------DISPLAY--------------------------\n\n# fTable\u00a0:: String -> (a -> String) ->\n# (b -> String) -> (a -> b) -> [a] -> String\ndef fTable(s):\n    '''Heading -> x display function -> fx display function ->\n       f -> xs -> tabular string.\n    '''\n    def go(xShow, fxShow, f, xs):\n        ys = [xShow(x) for x in xs]\n        w = max(map(len, ys))\n        return s + '\\n' + '\\n'.join(map(\n            lambda x, y: y.rjust(w, ' ') + ' -> ' + fxShow(f(x)),\n            xs, ys\n        ))\n    return lambda xShow: lambda fxShow: lambda f: lambda xs: go(\n        xShow, fxShow, f, xs\n    )\n\n\n# fname\u00a0:: (a -> b) -> String\ndef fName(f):\n    '''Name bound to the given function.'''\n    return f.__name__\n\n\n# ------------------------GENERIC -------------------------\n\n# Just\u00a0:: a -> Maybe a\ndef Just(x):\n    '''Constructor for an inhabited Maybe (option type) value.\n       Wrapper containing the result of a computation.\n    '''\n    return {'type': 'Maybe', 'Nothing': False, 'Just': x}\n\n\n# Nothing\u00a0:: Maybe a\ndef Nothing():\n    '''Constructor for an empty Maybe (option type) value.\n       Empty wrapper returned where a computation is not possible.\n    '''\n    return {'type': 'Maybe', 'Nothing': True}\n\n\n# difference\u00a0:: Eq a => [a] -> [a] -> [a]\ndef difference(xs):\n    '''All elements of xs, except any also found in ys.'''\n    return lambda ys: list(set(xs) - set(ys))\n\n\n# randomRInt\u00a0:: Int -> Int -> IO () -> Int\ndef randomRInt(m):\n    '''The return value of randomRInt is itself\n       a function. The returned function, whenever\n       called, yields a a new pseudo-random integer\n       in the range [m..n].\n    '''\n    return lambda n: lambda _: randint(m, n)\n\n\n# unfoldr(lambda x: Just((x, x - 1)) if 0\u00a0!= x else Nothing())(10)\n# -> [10, 9, 8, 7, 6, 5, 4, 3, 2, 1]\n# unfoldr\u00a0:: (b -> Maybe (a, b)) -> b -> [a]\ndef unfoldr(f):\n    '''Dual to reduce or foldr.\n       Where catamorphism reduces a list to a summary value,\n       the anamorphic unfoldr builds a list from a seed value.\n       As long as f returns Just(a, b), a is prepended to the list,\n       and the residual b is used as the argument for the next\n       application of f.\n       When f returns Nothing, the completed list is returned.\n    '''\n    def go(v):\n        xr = v, v\n        xs = []\n        while True:\n            mb = f(xr[0])\n            if mb.get('Nothing'):\n                return xs\n            else:\n                xr = mb.get('Just')\n                xs.append(xr[1])\n        return xs\n    return lambda x: go(x)\n\n\n# MAIN ---\nif __name__ == '__main__':\n    main()\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_138.txt",
        "content": "10000 tests of optimal vs random drawer-sampling with 10 boxes: \n\noptimalDrawerSampling -> 35.47%\n randomDrawerSampling -> 0.09%\n\n10000 tests of optimal vs random drawer-sampling with 100 boxes: \n\noptimalDrawerSampling -> 30.40%\n randomDrawerSampling -> 0.00%\n\n100000 tests of optimal vs random drawer-sampling with 100 boxes: \n\noptimalDrawerSampling -> 31.17%\n randomDrawerSampling -> 0.00%",
        "safe": true
    },
    {
        "filename": "100_prisoners_139.txt",
        "content": "t = 100000 #number of trials\nsuccess.r = rep(0,t) #this will keep track of how many prisoners find their ticket on each trial for the random method\nsuccess.o = rep(0,t) #this will keep track of how many prisoners find their ticket on each trial for the optimal method\n\n#random method\nfor(i in 1:t){\n  escape = rep(F,100)\n  ticket = sample(1:100)\n  for(j in 1:length(prisoner)){\n    escape[j] = j %in% sample(ticket,50)\n  }\n  success.r[i] = sum(escape)\n}\n\n#optimal method\nfor(i in 1:t){\n  escape = rep(F,100)\n  ticket = sample(1:100)\n  for(j in 1:100){\n    boxes = 0\n    current.box = j\n    while(boxes<50 && !escape[j]){\n      boxes=boxes+1\n      escape[j] = ticket[current.box]==j\n      current.box = ticket[current.box]\n    }\n  }\n  success.o[i] = sum(escape)\n}\n\ncat(\"Random method resulted in a success rate of \",100*mean(success.r==100),\n    \"%.\\nOptimal method resulted in a success rate of \",100*mean(success.o==100),\"%.\",sep=\"\")\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_14.txt",
        "content": "100 PRISONERS\n\nRESULTS:\n\n   OUT OF 4000 TRIALS, THE RESULTS ARE\n   AS FOLLOWS...\n\n1. RANDOM GUESSING:\n\n   0 SUCCESSES         4000 FAILURES\n\n   0% SUCCESS RATE.\n\n2. CHAINED NUMBER PICKING:\n\n   1278 SUCCESSES      2722 FAILURES\n\n   31.95% SUCCESS RATE.\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_140.txt",
        "content": "Random method resulted in a success rate of 0%.\nOptimal method resulted in a success rate of 31.129%.",
        "safe": true
    },
    {
        "filename": "100_prisoners_141.txt",
        "content": "Const Found = -1, Searching = 0, Status = 1, Tries = 2\nConst Attempt = 1, Victories = 2, RandomW = 1, ChainW = 2\nRandomize Timer\n\nDim Shared Prisoners(1 To 100, Status To Tries) As Integer, Drawers(1 To 100) As Integer, Results(1 To 2, 1 To 2) As Integer\nPrint \"100 prisoners\"\nPrint \"Random way to search...\"\nFor a = 1 To 2000\n    Init\n    Results(RandomW, Attempt) = Results(RandomW, Attempt) + 1\n    RandomWay\n    If verify% Then Results(RandomW, Victories) = Results(RandomW, Victories) + 1\nNext\n\nPrint: Print \"Chain way to search...\"\nFor a = 1 To 2000\n    Init\n    Results(ChainW, Attempt) = Results(ChainW, Attempt) + 1\n    ChainWay\n    If verify% Then Results(ChainW, Victories) = Results(ChainW, Victories) + 1\nNext\nPrint: Print \"Results: \"\nPrint \" Attempts \"; Results(RandomW, Attempt); \" \"; \"Victories \"; Results(RandomW, Victories); \" Ratio:\"; Results(RandomW, Victories); \"/\"; Results(RandomW, Attempt)\nPrint\nPrint \" Attempts \"; Results(ChainW, Attempt); \" \"; \"Victories \"; Results(ChainW, Victories); \" Ratio:\"; Results(ChainW, Victories); \"/\"; Results(ChainW, Attempt)\nEnd\n\nFunction verify%\n    Dim In As Integer\n    Print \"veryfing \"\n    verify = 0\n    For In = 1 To 100\n        If Prisoners(In, Status) = Searching Then Exit For\n    Next\n    If In = 101 Then verify% = Found\nEnd Function\n\nSub ChainWay\n    Dim In As Integer, ChainChoice As Integer\n    Print \"Chain search\"\n    For In = 1 To 100\n        ChainChoice = In\n        Do\n            Prisoners(In, Tries) = Prisoners(In, Tries) + 1\n            If Drawers(ChainChoice) = In Then Prisoners(In, Status) = Found: Exit Do\n            ChainChoice = Drawers(ChainChoice)\n        Loop Until Prisoners(In, Tries) = 50\n    Next In\nEnd Sub\n\nSub RandomWay\n    Dim In As Integer, RndChoice As Integer\n    Print \"Random search\"\n    For In = 1 To 100\n        Do\n            Prisoners(In, Tries) = Prisoners(In, Tries) + 1\n            If Drawers(Int(Rnd * 100) + 1) = In Then Prisoners(In, Status) = Found: Exit Do\n        Loop Until Prisoners(In, Tries) = 50\n    Next\n    Print \"Executed \"\nEnd Sub\n\n\nSub Init\n    Dim I As Integer, I2 As Integer\n    Print \"initialization\"\n    For I = 1 To 100\n        Prisoners(I, Status) = Searching\n        Prisoners(I, Tries) = Searching\n        Do\n            Drawers(I) = Int(Rnd * 100) + 1\n            For I2 = 1 To I\n                If Drawers(I2) = Drawers(I) Then Exit For\n            Next\n            If I2 = I Then Exit Do\n        Loop\n    Next I\n    Print \"Done \"\nEnd Sub",
        "safe": true
    },
    {
        "filename": "100_prisoners_142.txt",
        "content": "  [ this ] is 100prisoners.qky\n\n  [ dup size 2 / split ]                          is halve     (   [ --> [ [ )\n\n  [ stack ]                                       is successes (     --> s   )\n\n  [ [] swap times [ i join ] shuffle ]            is drawers   (   n --> [   )\n\n  [ false unrot\n    temp put \n    dup shuffle\n    halve drop\n    witheach\n      [ dip dup peek\n        temp share = if\n        [ dip not\n          conclude ] ]\n    drop\n    temp release ]                                is naive     ( [ n --> b   )\n\n  [ false unrot \n    dup temp put\n    over size 2 / times \n      [ dip dup peek\n        dup temp share = if\n        [ rot not unrot\n          conclude ] ]\n    2drop\n    temp release ]                                is smart     ( [ n --> b   )\n\n  [ ]'[ temp put\n    drawers\n    0 successes put\n    dup size times \n      [ dup i temp share do\n        successes tally ]\n    size successes take = \n    temp release ]                                is prisoners (   n --> b   )\n \n  [ say \"100 naive prisoners were pardoned \"\n    0 10000 times [ 100 prisoners naive + ] echo\n    say \" times out of 10000 simulations.\" cr\n\n    say \"100 smart prisoners were pardoned \"\n    0 10000 times [ 100 prisoners smart + ] echo\n    say \" times out of 10000 simulations.\" cr ]   is simulate  (     -->     )",
        "safe": true
    },
    {
        "filename": "100_prisoners_143.txt",
        "content": "/O>  [ $ '100prisoners.qky' loadfile ] now!\n...  simulate\n... \n100 naive prisoners were pardoned 0 times out of 10000 simulations.\n100 smart prisoners were pardoned 3158 times out of 10000 simulations.\n\nStack empty.",
        "safe": true
    },
    {
        "filename": "100_prisoners_144.txt",
        "content": "#lang racket\n(require srfi/1)\n\n(define current-samples (make-parameter 10000))\n(define *prisoners* 100)\n(define *max-guesses* 50)\n\n(define (evaluate-strategy instance-solved? strategy (s (current-samples)))\n  (/ (for/sum ((_ s) #:when (instance-solved? strategy)) 1) s))\n\n(define (build-drawers)\n  (list->vector (shuffle (range *prisoners*))))\n\n(define (100-prisoners-problem strategy)\n  (every (strategy (build-drawers)) (range *prisoners*)))\n\n(define ((strategy-1 drawers) p)\n  (any (\u03bb (_) (= p (vector-ref drawers (random *prisoners*)))) (range *max-guesses*)))\n\n(define ((strategy-2 drawers) p)\n  (define-values (_ found?)\n    (for/fold ((d p) (found? #f)) ((_ *max-guesses*)) #:break found?\n      (let ((card (vector-ref drawers d))) (values card (= card p)))))\n  found?)\n\n(define (print-sample-percentage caption f (s (current-samples)))\n  (printf \"~a: ~a%~%\" caption (real->decimal-string (* 100 f) (- (order-of-magnitude s) 2))))\n\n(module+ main\n  (print-sample-percentage \"random\" (evaluate-strategy 100-prisoners-problem strategy-1))\n  (print-sample-percentage \"optimal\" (evaluate-strategy 100-prisoners-problem strategy-2)))\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_145.txt",
        "content": "random: 0.00%\noptimal: 31.18%",
        "safe": true
    },
    {
        "filename": "100_prisoners_146.txt",
        "content": "unit sub MAIN (:$prisoners = 100,\u00a0:$simulations = 10000);\nmy @prisoners = ^$prisoners;\nmy $half = floor +@prisoners / 2;\n\nsub random ($n) {\n    ^$n .race.map( {\n        my @drawers = @prisoners.pick: *;\n        @prisoners.map( -> $prisoner {\n            my $found = 0;\n            for @drawers.pick($half) -> $card {\n                $found = 1 and last if $card == $prisoner\n            }\n            last unless $found;\n            $found\n        }\n        ).sum == @prisoners\n    }\n    ).grep( *.so ).elems / $n * 100\n}\n\nsub optimal ($n) {\n    ^$n .race.map( {\n        my @drawers = @prisoners.pick: *;\n        @prisoners.map( -> $prisoner {\n            my $found = 0;\n            my $card = @drawers[$prisoner];\n            if $card == $prisoner {\n                $found = 1\n            } else {\n                for ^($half - 1) {\n                    $card = @drawers[$card];\n                    $found = 1 and last if $card == $prisoner\n                }\n            }\n            last unless $found;\n            $found\n        }\n        ).sum == @prisoners\n    }\n    ).grep( *.so ).elems / $n * 100\n}\n\nsay \"Testing $simulations simulations with $prisoners prisoners.\";\nprintf \" Random play wins:\u00a0%.3f%% of simulations\\n\", random $simulations;\nprintf \"Optimal play wins:\u00a0%.3f%% of simulations\\n\", optimal $simulations;\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_147.txt",
        "content": "Testing 10000 simulations with 100 prisoners.\n Random play wins: 0.000% of simulations\nOptimal play wins: 30.510% of simulations",
        "safe": true
    },
    {
        "filename": "100_prisoners_148.txt",
        "content": "Testing 100000 simulations with 10 prisoners.\n Random play wins: 0.099% of simulations\nOptimal play wins: 35.461% of simulations\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_149.txt",
        "content": "Red []\n\nK_runs: 100000\nrepeat n 100 [append rand_arr: []  n]              ;; define array/series with numbers 1..100\n\n;;-------------------------------\nstrat_optimal: function [pris ][\n;;-------------------------------\n  locker: pris                                    ;; start with locker equal to prisoner number\n  loop 50 [\n    if Board/:locker = pris [ return true ]       ;; locker with prisoner number found\n    locker: Board/:locker\n  ]\n  false                                           ;; number not found - fail\n]\n;;-------------------------------\nstrat_rand: function [pris ][\n;;-------------------------------\n  random rand_arr                                                 ;; define set of  random lockers\n  repeat n 50 [ if Board/(rand_arr/:n) = pris [ return true ]  ]  ;; try first 50, found\u00a0? then return success\n  false \n]\n\n;;------------------------------\ncheck_board: function [ strat][\n;;------------------------------\nrepeat pris 100 [                                                   ;; for each prisoner\n  either  strat = 'optimal [ unless strat_optimal pris [return false ]  ]  \n                            [ unless strat_rand pris [return false ]  ]  \n]  \n  true                                                  ;; all 100 prisoners passed test\n]\n\nsaved: saved_rand: 0                                    ;; count all saved runs per strategy\nloop K_runs [\n  Board: random copy rand_arr                           ;; new board for every run\n  if  check_board 'optimal [saved: saved + 1]           ;; optimal stategy\n  if  check_board 'rand [saved_rand: saved_rand + 1]  ;; random strategy\n]\n\nprint [\"runs\" k_runs newline  \"Percent saved opt.strategy:\" saved * 100.0 / k_runs ]\nprint [\"Percent saved random strategy:\" saved_rand * 100.0 / k_runs ]\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_15.txt",
        "content": "/* ARM assembly Raspberry PI  */\n/*  program prisonniers.s   */ \n\n/* REMARK 1\u00a0: this program use routines in a include file \n   see task Include a file language arm assembly \n   for the routine affichageMess conversion10 \n   see at end of this program the instruction include */\n/* for constantes see task include a file in arm assembly */\n/************************************/\n/* Constantes                       */\n/************************************/\n.include \"../constantes.inc\"\n\n.equ NBDOORS,   100\n.equ NBLOOP, 1000\n\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nsMessResult:        .asciz \"Random strategie \u00a0: @ sur 1000 \\n\"\nsMessResultOPT:     .asciz \"Optimal strategie\u00a0: @ sur 1000 \\n\"\nszCarriageReturn:   .asciz \"\\n\"\n.align 4\niGraine:  .int 123456\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\nsZoneConv:        .skip 24\ntbDoors:          .skip 4 * NBDOORS \ntbTest:           .skip 4 * NBDOORS\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                 @ entry of program \n    \n    ldr r1,iAdrtbDoors\n    mov r2,#0\n1:                                    @ loop init doors table\n    add r3,r2,#1\n    str r3,[r1,r2,lsl #2]\n    add r2,r2,#1\n    cmp r2,#NBDOORS\n    blt 1b\n \n    mov r9,#0                         @ loop counter\n    mov r10,#0                        @ counter successes random strategie\n    mov r11,#0                        @ counter successes optimal strategie\n2:\n    ldr r0,iAdrtbDoors\n    mov r1,#NBDOORS\n    bl knuthShuffle\n    \n    ldr r0,iAdrtbDoors\n    bl aleaStrategie\n    cmp r0,#NBDOORS\n    addeq r10,r10,#1\n    \n    ldr r0,iAdrtbDoors\n    bl optimaStrategie\n    cmp r0,#NBDOORS\n    addeq r11,r11,#1\n    \n    add r9,r9,#1\n    cmp r9,#NBLOOP\n    blt 2b\n    \n    mov r0,r10                        @ result display\n    ldr r1,iAdrsZoneConv\n    bl conversion10                   @ call decimal conversion\n    ldr r0,iAdrsMessResult\n    ldr r1,iAdrsZoneConv              @ insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n    \n    mov r0,r11                        @ result display\n    ldr r1,iAdrsZoneConv\n    bl conversion10                   @ call decimal conversion\n    ldr r0,iAdrsMessResultOPT\n    ldr r1,iAdrsZoneConv              @ insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n    \n100:                                  @ standard end of the program \n    mov r0, #0                        @ return code\n    mov r7, #EXIT                     @ request to exit program\n    svc #0                            @ perform the system call\n \niAdrszCarriageReturn:     .int szCarriageReturn\niAdrsMessResult:          .int sMessResult\niAdrsMessResultOPT:        .int sMessResultOPT\niAdrtbDoors:              .int tbDoors\niAdrtbTest:               .int tbTest\niAdrsZoneConv:            .int sZoneConv\n/******************************************************************/\n/*            random door test strategy                           */ \n/******************************************************************/\n/* r0 contains the address of table */\naleaStrategie:\n    push {r1-r7,lr}              @ save registers\n    ldr r6,iAdrtbTest            @ table doors tests address\n    mov r1,r0                    @ save table doors address\n    mov r4,#0                    @ counter number of successes\n    mov r2,#0                    @ prisonners indice\n1:\n    bl razTable                  @ zero to table doors tests\n    mov r5,#0                    @ counter of door tests \n    add r7,r2,#1\n2:\n    mov r0,#NBDOORS - 1\n    bl genereraleas              @ random test\n    add r0,r0,#1\n    ldr r3,[r6,r0,lsl #2]        @ doors also tested\u00a0?\n    cmp r3,#0 \n    bne 2b                       @ yes\n    ldr r3,[r1,r0,lsl #2]        @ load N\u00b0 door\n    cmp r3,r7                    @ compar N\u00b0 door N\u00b0 prisonner\n    addeq r4,r4,#1               @ succes\n    beq 3f\n    mov r3,#1                    @ top test table item \n    str r3,[r6,r0,lsl #2]\n    add r5,r5,#1\n    cmp r5,#NBDOORS / 2          @ number tests maxi\u00a0?\n    blt 2b                       @ no -> loop\n3:\n    add r2,r2,#1                 @ other prisonner\n    cmp r2,#NBDOORS\n    blt 1b\n    \n    mov r0,r4                    @ return number of successes \n100:\n    pop {r1-r7,lr}\n    bx lr                        @ return \n/******************************************************************/\n/*     raz test table                                             */ \n/******************************************************************/\nrazTable:\n    push {r0-r2,lr}              @ save registers\n    ldr r0,iAdrtbTest\n    mov r1,#0                    @ item indice\n    mov r2,#0\n1:\n    str r2,[r0,r1,lsl #2]        @ store zero \u00e0 item\n    add r1,r1,#1\n    cmp r1,#NBDOORS\n    blt 1b\n100:\n    pop {r0-r2,lr}\n    bx lr                        @ return \n/******************************************************************/\n/*            random door test strategy                           */ \n/******************************************************************/\n/* r0 contains the address of table */\noptimaStrategie:\n    push {r1-r7,lr}              @ save registers\n    mov r4,#0                    @ counter number of successes\n    mov r2,#0                    @ counter prisonner\n1:\n    mov r5,#0                    @ counter test\n    mov r1,r2                    @ first test = N\u00b0 prisonner\n2:\n    ldr r3,[r0,r1,lsl #2]        @ load N\u00b0 door\n    cmp r3,r2\n    addeq r4,r4,#1               @ equal -> succes\n    beq 3f\n    mov r1,r3                    @ new test with N\u00b0 door\n    add r5,r5,#1                 \n    cmp r5,#NBDOORS / 2          @ test number maxi\u00a0?\n    blt 2b\n3:\n    add r2,r2,#1                 @ other prisonner\n    cmp r2,#NBDOORS\n    blt 1b\n    \n    mov r0,r4\n100:\n    pop {r1-r7,lr}\n    bx lr                        @ return \n/******************************************************************/\n/*     knuth Shuffle                                  */ \n/******************************************************************/\n/* r0 contains the address of table */\n/* r1 contains the number of elements */\nknuthShuffle:\n    push {r2-r5,lr}                   @ save registers\n    mov r5,r0                         @ save table address\n    mov r2,#0                         @ start index\n1:\n    mov r0,r2                         @ generate aleas\n    bl genereraleas\n    ldr r3,[r5,r2,lsl #2]             @ swap number on the table\n    ldr r4,[r5,r0,lsl #2]\n    str r4,[r5,r2,lsl #2]\n    str r3,[r5,r0,lsl #2]\n    add r2,#1                         @ next number\n    cmp r2,r1                         @ end\u00a0?\n    blt 1b                            @ no -> loop\n100:\n    pop {r2-r5,lr}\n    bx lr                             @ return \n/***************************************************/\n/*   Generation random number                  */\n/***************************************************/\n/* r0 contains limit  */\ngenereraleas:\n    push {r1-r4,lr}                   @ save registers \n    ldr r4,iAdriGraine\n    ldr r2,[r4]\n    ldr r3,iNbDep1\n    mul r2,r3,r2\n    ldr r3,iNbDep1\n    add r2,r2,r3\n    str r2,[r4]                       @ maj de la graine pour l appel suivant \n    cmp r0,#0\n    beq 100f\n    mov r1,r0                         @ divisor\n    mov r0,r2                         @ dividende\n    bl division\n    mov r0,r3                         @ r\u00e9sult = remainder\n  \n100:                                  @ end function\n    pop {r1-r4,lr}                    @ restaur registers\n    bx lr                             @ return\n/*****************************************************/\niAdriGraine: .int iGraine\niNbDep1:     .int 0x343FD\niNbDep2:     .int 0x269EC3 \n/***************************************************/\n/*      ROUTINES INCLUDE                           */\n/***************************************************/\n.include \"../affichage.inc\"",
        "safe": true
    },
    {
        "filename": "100_prisoners_150.txt",
        "content": "\n\nruns 100000\nPercent saved opt.strategy: 31.165\nPercent saved random strategy: 0.0\n\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_151.txt",
        "content": "/*REXX program to simulate the problem of 100 prisoners:  random,  and optimal strategy.*/\nparse arg men trials seed .                      /*obtain optional arguments from the CL*/\nif    men=='' |    men==\",\"  then    men=    100 /*number of   prisoners   for this run.*/\nif trials=='' | trials==\",\"  then trials= 100000 /*  \"     \"  simulations   \"    \"   \"  */\nif datatype(seed, 'W')  then call random ,,seed  /*seed for the random number generator.*/\ntry= men % 2;                swaps= men * 3      /*number tries for searching for a card*/\n$.1= ' a simple ';           $.2= \"an optimal\"   /*literals used for the SAY instruction*/\nsay center(' running'  commas(trials)   \"trials with\"  commas(men)  'prisoners ', 70, \"\u2550\")\nsay\n    do strategy=1  for 2;    pardons= 0          /*perform the two types of strategies. */\n\n      do trials;             call gCards         /*do trials for a strategy;  gen cards.*/\n        do p=1  for men  until failure           /*have each prisoner go through process*/\n        if strategy==1  then failure= simple()   /*Is 1st strategy?  Use simple strategy*/\n                        else failure= picker()   /* \" 2nd     \"       \"  optimal   \"    */\n        end   /*p*/                              /*FAILURE \u2261 1?  Then a prisoner failed.*/\n      if #==men  then pardons= pardons + 1       /*was there a pardon of all prisoners? */\n      end     /*trials*/                         /*if 1 prisoner fails, then they all do*/\n\n    pc= format( pardons/trials*100, , 3);                           _= left('', pc<10)\n    say right('Using', 9)  $.strategy  \"strategy yields pardons \"   _||pc\"%  of the time.\"\n    end       /*strategy*/\nexit                                             /*stick a fork in it,  we're all done. */\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\ncommas:  parse arg _;  do c=length(_)-3  to 1  by -3; _= insert(',', _, c); end;  return _\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\ngCards: #= 0;                do j=1  for men;  @.j= j             /*define seq. of cards*/\n                             end   /*j*/                          /*same as seq. of men.*/\n               do swaps;             a= random(1, men)            /*get 1st rand number.*/\n                   do until  b\\==a;  b= random(1, men)            /* \"  2nd   \"     \"   */\n                   end   /*until*/                                /* [\u2191] ensure A \u00ac== B */\n               parse value  @.a @.b  with  @.b @.a                /*swap 2 random cards.*/\n               end       /*swaps*/;  return\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nsimple: !.= 0; do try;         do until !.?==0; ?= random(1, men) /*get random card \u00b7\u00b7\u00b7 */\n                               end   /*until*/                    /*\u00b7\u00b7\u00b7 not used before.*/\n               if @.?==p  then do;   #= #+1;  return 0;  end      /*found his own card? */\n               !.?= 1                                             /*flag as being used. */\n               end   /*try*/;        return 1                     /*didn't find his card*/\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\npicker: ?= p;  do try; if @.?==p  then do;   #= #+1;    return 0  /*Found his own card? */\n                                       end       /* [\u2191]  indicate success for prisoner. */\n               ?= @.?                            /*choose next drawer from current card.*/\n               end   /*try*/;        return 1    /*choose half of the number of drawers.*/\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_152.txt",
        "content": "\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550 running 100,000 trials with 100 prisoners \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\n    Using  a simple  strategy yields pardons   0.000%  of the time.\n    Using an optimal strategy yields pardons  31.186%  of the time.\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_153.txt",
        "content": "\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550 running 100,000 trials with 10 prisoners \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\n    Using  a simple  strategy yields pardons   0.086%  of the time.\n    Using an optimal strategy yields pardons  31.204%  of the time.\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_154.txt",
        "content": "prisoners = [*1..100]\nN = 10_000\ngenerate_rooms = ->{ [nil]+[*1..100].shuffle }\n \nres = N.times.count do\n  rooms = generate_rooms[]\n  prisoners.all? {|pr| rooms[1,100].sample(50).include?(pr)}\nend\nputs \"Random strategy\u00a0: %11.4f\u00a0%%\" % (res.fdiv(N) * 100)\n\nres = N.times.count do\n  rooms = generate_rooms[]\n  prisoners.all? do |pr|\n    cur_room = pr\n    50.times.any? do\n      found = (rooms[cur_room] == pr)\n      cur_room = rooms[cur_room]\n      found\n    end\n  end\nend\nputs \"Optimal strategy: %11.4f\u00a0%%\" % (res.fdiv(N) * 100)\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_155.txt",
        "content": "Random strategy\u00a0:      0.0000\u00a0%\nOptimal strategy:     30.7400\u00a0%\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_156.txt",
        "content": "[dependencies]\nrand = '0.7.2'\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_157.txt",
        "content": "extern crate rand;\n\nuse rand::prelude::*;\n\n// Do a full run of checking boxes in a random order for a single prisoner\nfn check_random_boxes(prisoner: u8, boxes: &[u8]) -> bool {\n    let checks = {\n        let mut b: Vec<u8> = (1u8..=100u8).collect();\n        b.shuffle(&mut rand::thread_rng());\n        b\n    };\n    checks.into_iter().take(50).any(|check| boxes[check as usize - 1] == prisoner)\n}\n\n// Do a full run of checking boxes in the optimized order for a single prisoner\nfn check_ordered_boxes(prisoner: u8, boxes: &[u8]) -> bool {\n    let mut next_check = prisoner;\n    (0..50).any(|_| {\n        next_check = boxes[next_check as usize - 1];\n        next_check == prisoner\n    })\n}\n\nfn main() {\n    let mut boxes: Vec<u8> = (1u8..=100u8).collect();\n\n    let trials = 100000;\n\n    let ordered_successes = (0..trials).filter(|_| {\n        boxes.shuffle(&mut rand::thread_rng());\n        (1u8..=100u8).all(|prisoner| check_ordered_boxes(prisoner, &boxes))\n    }).count();\n\n    let random_successes = (0..trials).filter(|_| {\n        boxes.shuffle(&mut rand::thread_rng());\n        (1u8..=100u8).all(|prisoner| check_random_boxes(prisoner, &boxes))\n    }).count();\n\n    println!(\"{} / {} ({:.02}%) successes in ordered\", ordered_successes, trials, ordered_successes as f64 * 100.0 / trials as f64);\n    println!(\"{} / {} ({:.02}%) successes in random\", random_successes, trials, random_successes as f64 * 100.0 / trials as f64);\n\n}\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_158.txt",
        "content": "31106 / 100000 (31.11%) successes in ordered\n0 / 100000 (0.00%) successes in random",
        "safe": true
    },
    {
        "filename": "100_prisoners_159.txt",
        "content": "class MAIN is\n   shuffle (a: ARRAY{INT}) is\n      ARR_PERMUTE_ALG{INT, ARRAY{INT}}::shuffle(a);\n   end;\n\n   try_random (n: INT, drawers: ARRAY{INT}, tries: INT): BOOL is\n      my_tries\u00a0::= drawers.inds; shuffle(my_tries);\n      loop tries.times!;\n         if drawers[my_tries.elt!] = n then return true; end;\n      end;\n      return false;\n   end;\n\n   try_optimal (n: INT, drawers: ARRAY{INT}, tries: INT): BOOL is\n      num\u00a0::= n;\n      loop tries.times!;\n         num\u00a0:= drawers[num];\n         if num = n then return true; end;\n      end;\n      return false;\n   end;\n\n   stats (label: STR, rounds, successes: INT): STR is\n      return #FMT(\"<^###########>: <#######> rounds. Successes: <#######> (<##.###>%%)\\n\",\n                   label, rounds, successes, (successes.flt / rounds.flt)*100.0).str;\n   end;\n\n   try (name: STR, nrounds, ndrawers, npris, ntries: INT,\n        strategy: ROUT{INT,ARRAY{INT},INT}:BOOL)\n   is\n      drawers: ARRAY{INT}\u00a0:= #(ndrawers);\n      loop drawers.set!(drawers.ind!); end;\n      successes\u00a0::= 0;\n      loop nrounds.times!;\n         shuffle(drawers);\n         success\u00a0::= true;\n         loop\n            n\u00a0::= npris.times!;\n            if ~strategy.call(n, drawers, ntries) then\n               success\u00a0:= false;\n               break!;\n            end;\n         end;\n         if success then successes\u00a0:= successes + 1; end;\n      end;\n      #OUT + stats(name, nrounds, successes);\n   end;\n\n   main is\n      RND::seed\u00a0:= #TIMES.wall_time;\n      #OUT +\"100 prisoners, 100 drawers, 50 tries:\\n\";\n      try(\"random\",  100000, 100, 100, 50, bind(try_random(_, _, _)));\n      try(\"optimal\", 100000, 100, 100, 50, bind(try_optimal(_, _, _)));\n\n      #OUT +\"\\n10 prisoners, 10 drawers, 5 tries:\\n\";\n      try(\"random\",  100000, 10, 10, 5, bind(try_random(_, _, _)));\n      try(\"optimal\", 100000, 10, 10, 5, bind(try_optimal(_, _, _)));\n   end;\nend;",
        "safe": true
    },
    {
        "filename": "100_prisoners_16.txt",
        "content": "Random strategie \u00a0: 0           sur 1000\nOptimal strategie\u00a0: 303         sur 1000\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_160.txt",
        "content": "100 prisoners, 100 drawers, 50 tries:\nrandom     \u00a0:  100000 rounds. Successes:       0 ( 0.000%)\noptimal    \u00a0:  100000 rounds. Successes:   31378 (31.378%)\n\n10 prisoners, 10 drawers, 5 tries:\nrandom     \u00a0:  100000 rounds. Successes:     113 ( 0.113%)\noptimal    \u00a0:  100000 rounds. Successes:   35633 (35.633%)",
        "safe": true
    },
    {
        "filename": "100_prisoners_161.txt",
        "content": "import scala.util.Random\nimport scala.util.control.Breaks._\n\nobject Main {\n  def playOptimal(n: Int): Boolean = {\n    val secretList = Random.shuffle((0 until n).toBuffer)\n\n    for (i <- secretList.indices) {\n      var prev = i\n      breakable {\n        for (_ <- 0 until secretList.size / 2) {\n          if (secretList(prev) == i) {\n            break()\n          }\n          prev = secretList(prev)\n        }\n        return false\n      }\n    }\n\n    true\n  }\n\n  def playRandom(n: Int): Boolean = {\n    val secretList = Random.shuffle((0 until n).toBuffer)\n\n    for (i <- secretList.indices) {\n      val trialList = Random.shuffle((0 until n).toBuffer)\n\n      breakable {\n        for (j <- 0 until trialList.size / 2) {\n          if (trialList(j) == i) {\n            break()\n          }\n        }\n        return false\n      }\n    }\n\n    true\n  }\n\n  def exec(n: Int, p: Int, play: Int => Boolean): Double = {\n    var succ = 0.0\n    for (_ <- 0 until n) {\n      if (play(p)) {\n        succ += 1\n      }\n    }\n    (succ * 100.0) / n\n  }\n\n  def main(args: Array[String]): Unit = {\n    val n = 100000\n    val p = 100\n    printf(\"# of executions:\u00a0%,d\\n\", n)\n    printf(\"Optimal play success rate: %f%%\\n\", exec(n, p, playOptimal))\n    printf(\"Random play success rate: %f%%\\n\", exec(n, p, playRandom))\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_162.txt",
        "content": "# of executions: 100,000\nOptimal play success rate: 31.201000%\nRandom play success rate: 0.000000%",
        "safe": true
    },
    {
        "filename": "100_prisoners_163.txt",
        "content": "program prisoners;\n    setrandom(0);\n    \n    strategies\u00a0:= {\n        [\"Optimal\", routine optimal_strategy],\n        [\"Random\", routine random_strategy]\n    };\n    \n    runs\u00a0:= 10000;\n\n    loop for strategy = strategies(name) do\n        successes\u00a0:= run_simulations(strategy, runs);\n        print(rpad(name + \":\", 10), successes * 100 / runs, \"%\");\n    end loop;\n    \n    proc run_simulations(strategy, amount);\n        loop for i in [1..amount] do\n            successes +:= if simulate(strategy) then 1 else 0 end;\n        end loop;\n        return successes; \n    end proc;\n    \n    proc simulate(strategy);\n        drawers\u00a0:= [1..100];\n        shuffle(drawers);\n        loop for prisoner in [1..100] do\n            if not call(strategy, drawers, prisoner) then\n                return false;\n            end if;\n        end loop;\n        return true;\n    end proc;\n    \n    proc optimal_strategy(drawers, prisoner);\n        d\u00a0:= prisoner;\n        loop for s in [1..50] do\n            if (d\u00a0:= drawers(d)) = prisoner then\n                return true;\n            end if;\n        end loop;\n        return false;\n    end proc;\n    \n    proc random_strategy(drawers, prisoner);\n        loop for s in [1..50] do\n            if drawers(1+random(#drawers-1)) = prisoner then\n                return true;\n            end if;\n        end loop;\n        return false;\n    end proc;\n    \n    proc shuffle(rw drawers);\n        loop for i in [1..#drawers] do\n            j\u00a0:= i+random(#drawers-i);\n            [drawers(i), drawers(j)]\u00a0:= [drawers(j), drawers(i)];\n        end loop;\n    end proc;\nend program;",
        "safe": true
    },
    {
        "filename": "100_prisoners_164.txt",
        "content": "Optimal:   31.26\u00a0%\nRandom:    0\u00a0%",
        "safe": true
    },
    {
        "filename": "100_prisoners_165.txt",
        "content": "// ==========================================================================\n// START-SuperCollider solution to Rosetta Code TASK: 100 prisoners\t\t\t\t  ## BY: MusicCoder\u00a0: 2024-06-08 ##\n// ==========================================================================\n\n(\n/* ## BY: MusicCoder\u00a0: 2024-06-08 ##\nhttps://rosettacode.org/wiki/100_prisoners\nTHE TASK: Simulate the 100-prisoners game and compare two strategies\n1: random choice, 2: follow the cards.\n\n*** My preferance - make a function to play the game\n ... and feed it a function for each strategy ***\nUse 0..99 rather than 1..100 for player, card and drawer numbers\n\nWhat can a player possibly know?\n1. Player number\n2. Current turn number\n3. Previous drawer picked \u00a0: -1 means no previous as yet\n4. Previous card value   \u00a0: -1 means no previous as yet\n5. Number of drawers ( PROBABLY == number of players)\n6. Number of turns\n\n--- These parameters should be good for a lot of different strategies ---\n\nStatergy function will get called with values for these six parameters\nStatergy function should return a drawerNumber\n*/\n// =============================================================================\n// *** THE REQUIRED STRATEGY FUNCTIONS ***\n// =============================================================================\n//  strategyRandom: Pick a drawer number at random\nvar strategyRandom = {\n  |turnNumber, previousDrawer, previousCard, playerNumber, numDrawers, numTurns|\n\n  var drawerPicked = numDrawers.rand;\n  drawerPicked;\n};\n// =============================================================================\n//  strategyFollow: Start at drawerNumber = playerNumber, then follow the cardNumbers\nvar strategyFollow = {\n  |turnNumber, previousDrawer, previousCard, playerNumber, numDrawers, numTurns|\n\n  var drawerPicked = if ( (previousCard == -1), {playerNumber}, {previousCard});\n  drawerPicked;\n};\n\n// =============================================================================\n/* ### playGame: Function to play the game ###\n// =============================================================================\nTwo loops: outer loop over players, inner loop over turns for each player\nThe core of the inner loop calls the supplied stratergy function\n ... passing in values for the six parameters:\nturnNumber, previousDrawer, previousCard, playerNumber, numDrawers, numTurns\nThe stratergy function responds with the number of the drawer it has picked\n ... for the current turn\n*/\nvar playGame = {\n  |strategy, strategyName=\"\", numPlayers=100, numDrawers=100, numTurns=50, numSims=10000|\n  var percentWins=0;\n  var countWins=0;\n  var drawers=Array.iota(numPlayers);  // fill array with player numbers 0..99\n\n  numSims.do{\n    var playerWon = true;  // as soon as one player fails - exit this simulation\n    var playerNumber = 0;  // first player\n\n   drawers = drawers.scramble;  // randomly reorder the cards in the drawers\n\n    while(// loop until the last player or until any player fails\n      {playerNumber<numPlayers && playerWon},\n      { // *** call the supplied strategy function numTurns times --- for the current player***\n        var drawerPicked = -1;\n        var cardPicked   = -1;\n        var turnNumber   = 0;\n        var found        = false;\n\n        while ( // loop through numTurns, but exit if player card found\n          {(turnNumber<numTurns) && not(found)},\n          {\n            drawerPicked = strategy.( // call the supplied strategy function\n              turnNumber, drawerPicked, cardPicked, playerNumber, numDrawers, numTurns);\n\n            cardPicked = drawers[drawerPicked];\n\n            found = playerNumber == cardPicked;\n\n            turnNumber = turnNumber + 1;\n          };);\n\n        playerWon = found;  // did this player find his card\n\n        playerNumber = playerNumber + 1;  // move to the next player\n    };); // end of INNER while loop\n\n    if (playerWon) {countWins = countWins + 1};\n  }; // end of OUTER while loop -- end of all simulations\n\n  percentWins = 100 * (countWins / numSims);\n  postf(\"For:\u00a0% number of wins was=% in\u00a0% simulations =\u00a0%\\\\% wins\\n\",\n    strategyName, countWins, numSims, percentWins);\n};\nplayGame.(strategyRandom, \"strategyRandom\");\nplayGame.(strategyFollow, \"strategyFollow\");\n\"\\n\";// interpreter posts the value of the last expression - so make that just a blank line\n// =============================================================================\n)\n\n// ==========================================================================\n// **END-SuperCollider solution to Rosetta Code TASK: 100 prisoners\t\t\t\t  ## BY: MusicCoder\u00a0: 2024-06-08 ##\n// ==========================================================================\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_166.txt",
        "content": "For: strategyRandom number of wins was=0 in 10000 simulations = 0.0% wins\nFor: strategyFollow number of wins was=3051 in 10000 simulations = 30.51% wins\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_167.txt",
        "content": "import Foundation\n\nstruct PrisonersGame {\n  let strategy: Strategy\n  let numPrisoners: Int\n  let drawers: [Int]\n\n  init(numPrisoners: Int, strategy: Strategy) {\n    self.numPrisoners = numPrisoners\n    self.strategy = strategy\n    self.drawers = (1...numPrisoners).shuffled()\n  }\n\n  @discardableResult\n  func play() -> Bool {\n    for num in 1...numPrisoners {\n      guard findNumber(num) else {\n        return false\n      }\n    }\n\n    return true\n  }\n\n  private func findNumber(_ num: Int) -> Bool {\n    var tries = 0\n    var nextDrawer = num - 1\n\n    while tries < 50 {\n      tries += 1\n\n      switch strategy {\n      case .random where drawers.randomElement()! == num:\n        return true\n      case .optimum where drawers[nextDrawer] == num:\n        return true\n      case .optimum:\n        nextDrawer = drawers[nextDrawer] - 1\n      case _:\n        continue\n      }\n    }\n\n    return false\n  }\n\n  enum Strategy {\n    case random, optimum\n  }\n}\n\nlet numGames = 100_000\nlet lock = DispatchSemaphore(value: 1)\nvar done = 0\n\nprint(\"Running \\(numGames) games for each strategy\")\n\nDispatchQueue.concurrentPerform(iterations: 2) {i in\n  let strat = i == 0 ? PrisonersGame.Strategy.random : .optimum\n  var numPardoned = 0\n\n  for _ in 0..<numGames {\n    let game = PrisonersGame(numPrisoners: 100, strategy: strat)\n\n    if game.play() {\n      numPardoned += 1\n    }\n  }\n\n  print(\"Probability of pardon with \\(strat) strategy: \\(Double(numPardoned) / Double(numGames))\")\n\n  lock.wait()\n  done += 1\n  lock.signal()\n\n  if done == 2 {\n    exit(0)\n  }\n}\n\ndispatchMain()\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_168.txt",
        "content": "Running 100000 games for each strategy\nProbability of pardon with optimum strategy: 0.31099\nProbability of pardon with random strategy: 0.0",
        "safe": true
    },
    {
        "filename": "100_prisoners_169.txt",
        "content": "set Samples 10000\nset Prisoners 100\nset MaxGuesses 50\nset Strategies {random optimal}\n\n# returns a random number between 0 and N-1.\nproc random {n} {\n  expr int(rand()*$n)\n}\n\n# Returns a list from 0 to N-1.\nproc range {n} {\n  set res {}\n  for {set i 0} {$i < $n} {incr i} {\n    lappend res $i\n  }\n  return $res\n}\n\n# Returns shuffled LIST.\nproc nshuffle {list} {\n    set len [llength $list]\n    while {$len} {\n        set n [expr {int($len * rand())}]\n        set tmp [lindex $list $n]\n        lset list $n [lindex $list [incr len -1]]\n        lset list $len $tmp\n    }\n    return $list\n}\n\n# Returns a list of shuffled drawers.\nproc buildDrawers {} {\n  global Prisoners\n  nshuffle [range $Prisoners]\n}\n\n# Returns true if P is found in DRAWERS within $MaxGuesses attempts using a\n# random strategy.\nproc randomStrategy {drawers p} {\n  global Prisoners MaxGuesses\n  foreach i [range $MaxGuesses] {\n    if {$p == [lindex $drawers [random $Prisoners]]} {\n      return 1\n    }\n  }\n  return 0\n}\n\n# Returns true if P is found in DRAWERS within $MaxGuesses attempts using an\n# optimal strategy.\nproc optimalStrategy {drawers p} {\n  global Prisoners MaxGuesses\n  set j $p\n  foreach i [range $MaxGuesses] {\n    set k [lindex $drawers $j]\n    if {$k == $p} {\n      return 1\n    }\n    set j $k\n  }\n  return 0\n}\n\n# Returns true if all prisoners find their number using the given STRATEGY.\nproc run100prisonersProblem {strategy} {\n  global Prisoners\n  set drawers [buildDrawers]\n  foreach p [range $Prisoners] {\n    if {![$strategy $drawers $p]} {\n      return 0\n    }\n  }\n  return 1\n}\n\n# Runs the given STRATEGY $Samples times and returns the number of times all\n# prisoners succeed.\nproc sampling {strategy} {\n  global Samples\n  set successes 0\n  foreach s [range $Samples] {\n    if {[run100prisonersProblem $strategy]} {\n      incr successes\n    }\n  }\n  return $successes\n}\n\n# Returns true if the given STRING starts with a vowel.\nproc startsWithVowel {string} {\n  expr [lsearch -exact {a e i o u} [string index $string 0]] >= 0\n}\n\n# Runs each of the STRATEGIES and prints a report on how well they\n# worked.\nproc compareStrategies {strategies} {\n  global Samples\n  set fmt \"Using %s %s strategy, the prisoners were freed in %5.2f%% of the cases.\"\n  foreach strategy $strategies {\n    set article [expr [startsWithVowel $strategy] ? {\"an\"} : {\"a\"}]\n    set pct [expr [sampling ${strategy}Strategy] / $Samples.0 * 100]\n    puts [format $fmt $article $strategy $pct]\n  }\n}\n\ncompareStrategies $Strategies\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_17.txt",
        "content": "unplanned: function [][\n    drawers: shuffle @1..100\n    every? 1..100 'x -> some? 1..50 => [x = sample drawers]\n]\n\nplanned: function [][\n    drawers: shuffle @1..100\n    every? 1..100 'x [\n        next: x\n        some? 1..50 => [x = next: <= drawers\\[next-1]]\n    ]\n]\n\ntest: function [f][\n    count: enumerate 10000 => [call f []]\n    print [f ~\"|mul fdiv count 10000 100|%\"]\n]\n\ntest 'unplanned\ntest 'planned\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_170.txt",
        "content": "Using a random strategy, the prisoners were freed in  0.00% of the cases.\nUsing an optimal strategy, the prisoners were freed in 32.35% of the cases.",
        "safe": true
    },
    {
        "filename": "100_prisoners_171.txt",
        "content": "USE rosettacode;\nGO\n\nSET NOCOUNT ON;\nGO\n\nCREATE TABLE dbo.numbers (n INT PRIMARY KEY);\nGO\n\n-- NOTE If you want to play more than 10000 games, you need to extend the query generating the numbers table by adding\n-- next cross joins. Now the table contains enough values to solve the task and it takes less processing time.\n\nWITH sample100 AS (\n    SELECT TOP(100) object_id\n    FROM master.sys.objects\n)\nINSERT numbers\n    SELECT ROW_NUMBER() OVER (ORDER BY A.object_id) AS n\n    FROM sample100 AS A\n        CROSS JOIN sample100 AS B;\nGO\n\nCREATE TABLE dbo.drawers (drawer INT PRIMARY KEY, card INT);\nGO\n\nCREATE TABLE dbo.results (strategy VARCHAR(10), game INT, result BIT, PRIMARY KEY (game, strategy));\nGO\n\nCREATE PROCEDURE dbo.shuffleDrawers @prisonersCount INT\nAS BEGIN\n    SET NOCOUNT ON;\n\n    IF NOT EXISTS (SELECT * FROM drawers)\n        INSERT drawers (drawer, card)\n        SELECT n AS drawer, n AS card\n        FROM numbers\n        WHERE n <= @prisonersCount;\n\n    DECLARE @randoms TABLE (n INT, random INT);\n    DECLARE @n INT = 1;\n    WHILE @n <= @prisonersCount BEGIN\n        INSERT @randoms VALUES (@n, ROUND(RAND() * (@prisonersCount - 1), 0) + 1);\n\n        SET @n = @n + 1;\n    END;\n\n    WITH ordered AS (\n        SELECT ROW_NUMBER() OVER (ORDER BY random ASC) AS drawer,\n            n AS card\n        FROM @randoms\n    )\n    UPDATE drawers\n    SET card = o.card\n    FROM drawers AS s\n        INNER JOIN ordered AS o\n            ON o.drawer = s.drawer;\nEND\nGO\n\nCREATE PROCEDURE dbo.find @prisoner INT, @strategy VARCHAR(10)\nAS BEGIN\n    -- A prisoner can open no more than 50 drawers.\n    DECLARE @drawersCount INT = (SELECT COUNT(*) FROM drawers);\n    DECLARE @openMax INT = @drawersCount / 2;\n\n    -- Prisoners start outside the room.\n    DECLARE @card INT = NULL;\n    DECLARE @open INT = 1;\n    WHILE @open <= @openMax BEGIN\n        -- A prisoner tries to find his own number.\n        IF @strategy = 'random' BEGIN\n            DECLARE @random INT = ROUND(RAND() * (@drawersCount - 1), 0) + 1;\n            SET @card = (SELECT TOP(1) card FROM drawers WHERE drawer = @random);\n        END\n        IF @strategy = 'optimal' BEGIN\n            IF @card IS NULL BEGIN\n                SET @card = (SELECT TOP(1) card FROM drawers WHERE drawer = @prisoner);\n            END ELSE BEGIN\n                SET @card = (SELECT TOP(1) card FROM drawers WHERE drawer = @card);\n            END\n        END\n\n        -- A prisoner finding his own number is then held apart from the others.\n        IF @card = @prisoner\n            RETURN 1;\n\n        SET @open = @open + 1;\n    END\n\n    RETURN 0;\nEND\nGO\n\nCREATE PROCEDURE dbo.playGame @gamesCount INT, @strategy VARCHAR(10), @prisonersCount INT = 100\nAS BEGIN\n    SET NOCOUNT ON;\n\n    IF @gamesCount <> (SELECT COUNT(*) FROM results WHERE strategy = @strategy) BEGIN\n        DELETE results\n        WHERE strategy = @strategy;\n\n        INSERT results (strategy, game, result)\n        SELECT @strategy AS strategy, n AS game, 0 AS result\n        FROM numbers\n        WHERE n <= @gamesCount;\n    END\n\n    UPDATE results\n    SET result = 0\n    WHERE strategy = @strategy;\n\n    DECLARE @game INT = 1;\n    WHILE @game <= @gamesCount BEGIN\n        -- A room having a cupboard of 100 opaque drawers numbered 1 to 100, that cannot be seen from outside.\n        -- Cards numbered 1 to 100 are placed randomly, one to a drawer, and the drawers all closed; at the start.\n        EXECUTE shuffleDrawers @prisonersCount;\n\n        -- A prisoner tries to find his own number.\n        -- Prisoners start outside the room.\n        -- They can decide some strategy before any enter the room.\n        DECLARE @prisoner INT = 1;\n        DECLARE @found INT = 0;\n        WHILE @prisoner <= @prisonersCount BEGIN\n            EXECUTE @found = find @prisoner, @strategy;\n            IF @found = 1\n                SET @prisoner = @prisoner + 1;\n            ELSE\n                BREAK;\n        END;\n\n        -- If all 100 findings find their own numbers then they will all be pardoned. If any don't then all sentences stand.\n        IF @found = 1\n            UPDATE results SET result = 1 WHERE strategy = @strategy AND game = @game;\n    \n        SET @game = @game + 1;\n    END\nEND\nGO\n\nCREATE FUNCTION dbo.computeProbability(@strategy VARCHAR(10))\nRETURNS decimal (18, 2)\nAS BEGIN\n    RETURN (\n        SELECT (SUM(CAST(result AS INT)) * 10000 / COUNT(*)) / 100\n        FROM results\n        WHERE strategy = @strategy\n    );\nEND\nGO\n\n-- Simulate several thousand instances of the game:\nDECLARE @gamesCount INT = 2000;\n\n-- ...where the prisoners randomly open drawers.\nEXECUTE playGame @gamesCount, 'random';\n\n-- ...where the prisoners use the optimal strategy mentioned in the Wikipedia article.\nEXECUTE playGame @gamesCount, 'optimal';\n\n-- Show and compare the computed probabilities of success for the two strategies.\nDECLARE @log VARCHAR(max);\nSET @log = CONCAT('Games count: ', @gamesCount);\nRAISERROR (@log, 0, 1) WITH NOWAIT;\nSET @log = CONCAT('Probability of success with \"random\" strategy: ', dbo.computeProbability('random'));\nRAISERROR (@log, 0, 1) WITH NOWAIT;\nSET @log = CONCAT('Probability of success with \"optimal\" strategy: ', dbo.computeProbability('optimal'));\nRAISERROR (@log, 0, 1) WITH NOWAIT;\nGO\n\nDROP FUNCTION dbo.computeProbability;\nDROP PROCEDURE dbo.playGame;\nDROP PROCEDURE dbo.find;\nDROP PROCEDURE dbo.shuffleDrawers;\nDROP TABLE dbo.results;\nDROP TABLE dbo.drawers;\nDROP TABLE dbo.numbers;\nGO",
        "safe": true
    },
    {
        "filename": "100_prisoners_172.txt",
        "content": "Games count: 2000\nProbability of success with \"random\" strategy: 0.00 \nProbability of success with \"optimal\" strategy: 31.00",
        "safe": true
    },
    {
        "filename": "100_prisoners_173.txt",
        "content": "#lang transd\n\nMainModule: {\nsimRandom: (\u03bb numPris Int() nRuns Int()\n    locals: nSucc 0.0\n    (for n in Range(nRuns) do\n        (with draws (for i in Range(numPris) project i) succ 1\n            (for prisN in Range(numPris) do\n                (shuffle draws)\n                (if (not (is-el Range(in: draws 0 (/ numPris 2)) prisN))\n                    (= succ 0) break))\n            (+= nSucc succ)\n    )   )\n    (ret (* (/ nSucc nRuns) 100))\n),\n\nsimOptimal: (\u03bb numPris Int() nRuns Int()\n    locals: nSucc 0.0\n    (for n in Range(nRuns) do\n        (with draws (for i in Range(numPris) project i) succ 0 nextDraw 0\n            (shuffle draws)\n            (for prisN in Range(numPris) do (= nextDraw prisN) (= succ 0)\n                (for i in Range( (/ numPris 2)) do\n                    (= nextDraw (get draws nextDraw))\n                    (if (== nextDraw prisN) (= succ 1) break))\n                (if (not succ) break))\n            (+= nSucc succ)\n    )   )\n    (ret (* (/ nSucc nRuns) 100))\n),\n\n_start: (\u03bb\n    (lout prec: 4 :fixed \"Random play:    \" (simRandom 100 10000) \"% of wins\")\n    (lout \"Strategic play: \" (simOptimal 100 10000)  \"% of wins\")\n    (lout \"Check random play:    \" (simRandom 10 100000)  \"% of wins\")\n)\n}\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_174.txt",
        "content": "Random play:    0.0000% of wins\nStrategic play: 31.4500% of wins\nCheck random play:    0.1040% of wins\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_175.txt",
        "content": "Sub HundredPrisoners()\n\n    NumberOfPrisoners = Int(InputBox(\"Number of Prisoners\", \"Prisoners\", 100))\n    Tries = Int(InputBox(\"Numer of Tries\", \"Tries\", 1000))\n    Selections = Int(InputBox(\"Number of Selections\", \"Selections\", NumberOfPrisoners / 2))\n\n    StartTime = Timer\n\n    AllFoundOptimal = 0\n    AllFoundRandom = 0\n    AllFoundRandomMem = 0\n\n    For i = 1 To Tries\n        OptimalCount = HundredPrisoners_Optimal(NumberOfPrisoners, Selections)\n        RandomCount = HundredPrisoners_Random(NumberOfPrisoners, Selections)\n        RandomMemCount = HundredPrisoners_Random_Mem(NumberOfPrisoners, Selections)\n        \n        If OptimalCount = NumberOfPrisoners Then\n            AllFoundOptimal = AllFoundOptimal + 1\n        End If\n        If RandomCount = NumberOfPrisoners Then\n            AllFoundRandom = AllFoundRandom + 1\n        End If\n        If RandomMemCount = NumberOfPrisoners Then\n            AllFoundRandomMem = AllFoundRandomMem + 1\n        End If\n    Next i\n\n\n    ResultString = \"Optimal: \" & AllFoundOptimal & \" of \" & Tries & \": \" & AllFoundOptimal / Tries * 100 & \"%\"\n    ResultString = ResultString & Chr(13) & \"Random: \" & AllFoundRandom & \" of \" & Tries & \": \" & AllFoundRandom / Tries * 100 & \"%\"\n    ResultString = ResultString & Chr(13) & \"RandomMem: \" & AllFoundRandomMem & \" of \" & Tries & \": \" & AllFoundRandomMem / Tries * 100 & \"%\"\n\n    EndTime = Timer\n\n    ResultString = ResultString & Chr(13) & \"Elapsed Time: \" & Round(EndTime - StartTime, 2) & \" s\"\n    ResultString = ResultString & Chr(13) & \"Trials/sec: \" & Tries / Round(EndTime - StartTime, 2)\n\n    MsgBox ResultString, vbOKOnly, \"Results\"\n\nEnd Sub\n\nFunction HundredPrisoners_Optimal(ByVal NrPrisoners, ByVal NrSelections) As Long\n    Dim DrawerArray() As Long\n    \n    ReDim DrawerArray(NrPrisoners - 1)\n    \n    For Counter = LBound(DrawerArray) To UBound(DrawerArray)\n        DrawerArray(Counter) = Counter + 1\n    Next Counter\n\n    FisherYates DrawerArray\n    \n    For i = 1 To NrPrisoners\n        NumberFromDrawer = DrawerArray(i - 1)\n        For j = 1 To NrSelections - 1\n            If NumberFromDrawer = i Then\n                FoundOwnNumber = FoundOwnNumber + 1\n                Exit For\n            End If\n            NumberFromDrawer = DrawerArray(NumberFromDrawer - 1)\n        Next j\n    Next i\n    HundredPrisoners_Optimal = FoundOwnNumber\nEnd Function\n\nFunction HundredPrisoners_Random(ByVal NrPrisoners, ByVal NrSelections) As Long\n    Dim DrawerArray() As Long\n    ReDim DrawerArray(NrPrisoners - 1)\n    \n    FoundOwnNumber = 0\n    \n    For Counter = LBound(DrawerArray) To UBound(DrawerArray)\n        DrawerArray(Counter) = Counter + 1\n    Next Counter\n\n    FisherYates DrawerArray\n    \n    \n    For i = 1 To NrPrisoners\n        For j = 1 To NrSelections\n            RandomDrawer = Int(NrPrisoners * Rnd)\n            NumberFromDrawer = DrawerArray(RandomDrawer)\n            If NumberFromDrawer = i Then\n                FoundOwnNumber = FoundOwnNumber + 1\n                Exit For\n            End If\n        Next j\n    Next i\n    HundredPrisoners_Random = FoundOwnNumber\nEnd Function\n\nFunction HundredPrisoners_Random_Mem(ByVal NrPrisoners, ByVal NrSelections) As Long\n    Dim DrawerArray() As Long\n    Dim SelectionArray() As Long\n    ReDim DrawerArray(NrPrisoners - 1)\n    ReDim SelectionArray(NrPrisoners - 1)\n    \n    HundredPrisoners_Random_Mem = 0\n    FoundOwnNumberMem = 0\n    \n    For Counter = LBound(DrawerArray) To UBound(DrawerArray)\n        DrawerArray(Counter) = Counter + 1\n    Next Counter\n    \n    For Counter = LBound(SelectionArray) To UBound(SelectionArray)\n        SelectionArray(Counter) = Counter + 1\n    Next Counter\n\n    FisherYates DrawerArray\n    \n    For i = 1 To NrPrisoners\n        FisherYates SelectionArray\n        For j = 1 To NrSelections\n            NumberFromDrawer = DrawerArray(SelectionArray(j - 1) - 1)\n            If NumberFromDrawer = i Then\n                FoundOwnNumberMem = FoundOwnNumberMem + 1\n                Exit For\n            End If\n        Next j\n    Next i\n    HundredPrisoners_Random_Mem = FoundOwnNumberMem\nEnd Function\n\nSub FisherYates(ByRef InputArray() As Long)\n \n    Dim Temp As Long\n    Dim PosRandom As Long\n    Dim Counter As Long\n    Dim Upper As Long\n    Dim Lower As Long\n     \n    Lower = LBound(InputArray)\n    Upper = UBound(InputArray)\n     \n    Randomize\n     \n    For Counter = Upper To (Lower + 1) Step -1\n        PosRandom = CLng(Int((Counter - Lower + 1) * Rnd + Lower))\n        Temp = InputArray(Counter)\n        InputArray(Counter) = InputArray(PosRandom)\n        InputArray(PosRandom) = Temp\n    Next Counter\n \nEnd Sub\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_176.txt",
        "content": "Optimal: 29090 of 100000: 29.09%\nRandom: 0 of 100000: 0%\nRandomMem: 0 of 100000: 0%\nElapsed Time: 388.41 s",
        "safe": true
    },
    {
        "filename": "100_prisoners_177.txt",
        "content": "Module Module1\n\n    Function PlayOptimal() As Boolean\n        Dim secrets = Enumerable.Range(0, 100).OrderBy(Function(a) Guid.NewGuid).ToList\n\n        For p = 1 To 100\n            Dim success = False\n\n            Dim choice = p - 1\n            For i = 1 To 50\n                If secrets(choice) = p - 1 Then\n                    success = True\n                    Exit For\n                End If\n                choice = secrets(choice)\n            Next\n\n            If Not success Then\n                Return False\n            End If\n        Next\n\n        Return True\n    End Function\n\n    Function PlayRandom() As Boolean\n        Dim secrets = Enumerable.Range(0, 100).OrderBy(Function(a) Guid.NewGuid).ToList\n\n        For p = 1 To 100\n            Dim choices = Enumerable.Range(0, 100).OrderBy(Function(a) Guid.NewGuid).ToList\n\n            Dim success = False\n            For i = 1 To 50\n                If choices(i - 1) = p Then\n                    success = True\n                    Exit For\n                End If\n            Next\n\n            If Not success Then\n                Return False\n            End If\n        Next\n\n        Return True\n    End Function\n\n    Function Exec(n As UInteger, play As Func(Of Boolean))\n        Dim success As UInteger = 0\n        For i As UInteger = 1 To n\n            If play() Then\n                success += 1\n            End If\n        Next\n        Return 100.0 * success / n\n    End Function\n\n    Sub Main()\n        Dim N = 1_000_000\n        Console.WriteLine(\"# of executions: {0}\", N)\n        Console.WriteLine(\"Optimal play success rate: {0:0.00000000000}%\", Exec(N, AddressOf PlayOptimal))\n        Console.WriteLine(\" Random play success rate: {0:0.00000000000}%\", Exec(N, AddressOf PlayRandom))\n    End Sub\n\nEnd Module\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_178.txt",
        "content": "# of executions: 1000000\nOptimal play success rate: 31.12990000000%\n Random play success rate: 0.00000000000%",
        "safe": true
    },
    {
        "filename": "100_prisoners_179.txt",
        "content": "option explicit\nconst npris=100\nconst ntries=50\nconst ntests=1000.\ndim drawer(100),opened(100),i\nfor i=1 to npris: drawer(i)=i:next\nshuffle drawer\nwscript.echo rf(tests(false)/ntests*100,10,\" \")  &\"\u00a0% success for random\"\nwscript.echo rf(tests(true) /ntests*100,10,\" \")  &\"\u00a0% success for optimal strategy\"\n\nfunction rf(v,n,s) rf=right(string(n,s)& v,n):end function \n\nsub shuffle(d) 'knut's shuffle\ndim i,j,t\nrandomize timer\nfor i=1 to npris\n   j=int(rnd()*i+1)\n   t=d(i):d(i)=d(j):d(j)=t\nnext\nend sub\n\nfunction tests(strat)\ndim cntp,i,j\ntests=0\nfor i=1 to ntests\n  shuffle drawer\n  cntp=0\n  if strat then\n      for j=1 to npris\n\tif not trystrat(j) then exit for\n      next\n  else\t\t\n     for j=1 to npris\n       if not tryrand(j) then exit for\n     next      \n  end if\n  if j>=npris then tests=tests+1\nnext\nend function \n\t   \nfunction tryrand(pris)\n  dim i,r \n\terase opened\n  for i=1 to ntries\n    do \n      r=int(rnd*npris+1)\n    loop until opened(r)=false\n    opened(r)=true\n    if drawer(r)= pris then tryrand=true : exit function\n  next\n  tryrand=false\nend function   \n\nfunction trystrat(pris)\n  dim i,r\n  r=pris\n  for i=1 to ntries\n    if drawer(r)= pris then trystrat=true\t:exit function\n    r=drawer(r)\n  next\n  trystrat=false\nend function\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_18.txt",
        "content": "unplanned 0.0%\nplanned 31.43%",
        "safe": true
    },
    {
        "filename": "100_prisoners_180.txt",
        "content": "         0\u00a0% success for random\n      32.9\u00a0% success for optimal strategy\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_181.txt",
        "content": "import rand\nimport rand.seed\n// Uses 0-based numbering rather than 1-based numbering throughout.\nfn do_trials(trials int, np int, strategy string) {\n    mut pardoned := 0\n    for _ in 0..trials {\n        mut drawers := []int{len: 100, init: it}\n        rand.shuffle<int>(mut drawers) or {panic('shuffle failed')}\n        mut next_trial := false\n        for p in 0..np {\n            mut next_prisoner := false\n            if strategy == \"optimal\" {\n                mut prev := p\n                for _ in 0..50 {\n                    this := drawers[prev]\n                    if this == p {\n                        next_prisoner = true\n                        break\n                    }\n                    prev = this\n                }\n            } else {\n                // Assumes a prisoner remembers previous drawers (s)he opened\n                // and chooses at random from the others.\n                mut opened := [100]bool{}\n                for _ in 0..50 {\n                    mut n := 0\n                    for {\n                        n = rand.intn(100) or {0}\n                        if !opened[n] {\n                            opened[n] = true\n                            break\n                        }\n                    }\n                    if drawers[n] == p {\n                        next_prisoner = true\n                        break\n                    }\n                }\n            }\n            if !next_prisoner {\n                next_trial = true\n                break\n            }\n        }\n        if !next_trial {\n            pardoned++\n        }\n    }\n    rf := f64(pardoned) / f64(trials) * 100\n    println(\"  strategy = ${strategy:-7}  pardoned = ${pardoned:-6} relative frequency = ${rf:-5.2f}%\\n\")\n}\n \nfn main() {\n    rand.seed(seed.time_seed_array(2))\n    trials := 100000\n    for np in [10, 100] {\n        println(\"Results from $trials trials with $np prisoners:\\n\")\n        for strategy in [\"random\", \"optimal\"] {\n            do_trials(trials, np, strategy)\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_182.txt",
        "content": "Results from 100000 trials with 10 prisoners:\n\n  strategy = random   pardoned = 91     relative frequency = 0.09\u00a0%\n\n  strategy = optimal  pardoned = 31321  relative frequency = 31.32%\n\nResults from 100000 trials with 100 prisoners:\n\n  strategy = random   pardoned = 0      relative frequency = 0.00\u00a0%\n\n  strategy = optimal  pardoned = 31318  relative frequency = 31.32%\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_183.txt",
        "content": "import \"random\" for Random\nimport \"./fmt\" for Fmt\n\nvar rand = Random.new()\n\nvar doTrials = Fn.new{ |trials, np, strategy|\n    var pardoned = 0\n    for (t in 0...trials) {\n        var drawers = List.filled(100, 0)\n        for (i in 0..99) drawers[i] = i\n        rand.shuffle(drawers)\n        var nextTrial = false\n        for (p in 0...np) {\n            var nextPrisoner = false\n            if (strategy == \"optimal\") {\n                var prev = p\n                for (d in 0..49) {\n                    var curr = drawers[prev]\n                    if (curr == p) {\n                        nextPrisoner = true\n                        break\n                    }\n                    prev = curr\n                }\n            } else {\n                var opened = List.filled(100, false)\n                for (d in 0..49) {\n                    var n\n                    while (true) {\n                        n = rand.int(100)\n                        if (!opened[n]) {\n                            opened[n] = true\n                            break\n                        }\n                    }\n                    if (drawers[n] == p) {\n                        nextPrisoner = true\n                        break\n                    }\n                }\n            }\n            if (!nextPrisoner) {\n                nextTrial = true\n                break\n            }\n        }\n        if (!nextTrial) pardoned = pardoned + 1\n    }\n    var rf = pardoned/trials * 100\n    Fmt.print(\"  strategy = $-7s  pardoned = $,6d relative frequency = $5.2f\\%\\n\", strategy, pardoned, rf)\n}\n\nvar trials = 1e5\nfor (np in [10, 100]) {\n    Fmt.print(\"Results from $,d trials with $d prisoners:\\n\", trials, np)\n    for (strategy in [\"random\", \"optimal\"]) doTrials.call(trials, np, strategy)\n}\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_184.txt",
        "content": "Results from 100,000 trials with 10 prisoners:\n\n  strategy = random   pardoned =     98 relative frequency =  0.10%\n\n  strategy = optimal  pardoned = 31,212 relative frequency = 31.21%\n\nResults from 100,000 trials with 100 prisoners:\n\n  strategy = random   pardoned =      0 relative frequency =  0.00%\n\n  strategy = optimal  pardoned = 31,139 relative frequency = 31.14%\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_185.txt",
        "content": "int     Drawer(100);\n\nproc KShuffle;          \\Randomly rearrange the cards in the drawers\n\\(Woe unto thee if Stattolo shuffle is used instead of Knuth shuffle.)\nint  I, J, T;\n[for I:= 100-1 downto 1 do\n    [J:= Ran(I+1);      \\range [0..I]\n    T:= Drawer(I);  Drawer(I):= Drawer(J);  Drawer(J):= T;\n    ];\n];\n\nfunc Stategy2;          \\Return 'true' if stragegy succeeds\nint  Prisoner, Card, Try;\n[for Prisoner:= 1 to 100 do\n   [Card:= Drawer(Prisoner-1);\n   Try:= 1;\n   loop [if Card = Prisoner then quit;\n        if Try >= 50 then return false;\n        Card:= Drawer(Card-1);\n        Try:= Try+1;\n        ];\n    ];\nreturn true;\n];\n\nfunc Stategy1;          \\Return 'true' if stragegy succeeds\nint  Prisoner, I, D(100);\n[for Prisoner:= 1 to 100 do\n   loop [for I:= 0 to 100-1 do D(I):= I+1;\n        KShuffle;\n        for I:= 1 to 50 do\n            if Drawer(D(I-1)) = Prisoner then quit;\n        return false;\n        ];\nreturn true;\n];\n\nproc Strategy(S);\nint  S, I, Sample;\nreal Successes;\n[Successes:= 0.;\nfor Sample:= 1 to 100_000 do\n    [for I:= 0 to 100-1 do Drawer(I):= I+1;\n    KShuffle;\n    case S of\n     1: if Stategy1 then Successes:= Successes + 1.;\n     2: if Stategy2 then Successes:= Successes + 1.\n    other [];\n    ];\nRlOut(0, Successes/100_000.*100.);  Text(0, \"%^m^j\");\n];\n\n[Format(3, 12);\nText(0, \"Random strategy success rate:  \");\nStrategy(1);\nText(0, \"Optimal strategy success rate: \");\nStrategy(2);\n]",
        "safe": true
    },
    {
        "filename": "100_prisoners_186.txt",
        "content": "Random strategy success rate:    0.000000000000%\nOptimal strategy success rate:  31.085000000000%\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_187.txt",
        "content": "// Rosetta Code problem: http://rosettacode.org/wiki/100_prisoners\n// by Galileo, 05/2022\n\nsub play(prisoners, iterations, optimal)\n    local prisoner, pardoned, found, drawer, drawers(prisoners), i, j, k, p, x\n\n    for i = 1 to prisoners\u00a0: drawers(i) = i\u00a0: next\n\n    for i = 1 to iterations\n        for k = 1 to prisoners\u00a0: x = ran(prisoners) + 1\u00a0: p = drawers(x)\u00a0: drawers(x) = drawers(k)\u00a0: drawers(k) = p\u00a0: next\n        for prisoner = 1 to prisoners\n            found = false\n            if optimal then drawer = prisoner else drawer = ran(prisoners) + 1 end if\n            for j = 1 to prisoners / 2\n                drawer = drawers(drawer)\n                if drawer = prisoner found = true\u00a0: break\n                if not optimal drawer = ran(prisoners) + 1\n            next\n            if not found break\n        next\n        pardoned = pardoned + found\n    next\n\n    return 100 * pardoned / iterations\nend sub\n \niterations = 10000\nprint \"Simulation count: \", iterations\nfor prisoners = 10 to 100 step 90\n    random = play(prisoners, iterations, false)\n    optimal = play(prisoners, iterations, true)\n    print \"Prisoners: \", prisoners, \", random: \", random, \", optimal: \", optimal\nnext",
        "safe": true
    },
    {
        "filename": "100_prisoners_188.txt",
        "content": "Simulation count: 10000\nPrisoners: 10, random: 0.01, optimal: 35.83\nPrisoners: 100, random: 0, optimal: 31.2\n---Program done, press RETURN---",
        "safe": true
    },
    {
        "filename": "100_prisoners_189.txt",
        "content": "!yamlscript/v0\n\ndefn main(n=5000):\n  :: https://rosettacode.org/wiki/100_prisoners\n\n  random-successes optimal-successes run-count =:\n    simulate-n-runs(n)\n      .slice(q(random-successes optimal-successes run-count))\n\n  say: \"Probability of survival with random search: $F(random-successes / run-count)\"\n\n  say: \"Probability of survival with ordered search: $F(optimal-successes / run-count)\"\n\ndefn simulate-n-runs(n):\n  :: Simulate n runs of the 100 prisoner problem and returns a success count\n     for each search method.\n\n  loop random-successes 0, optimal-successes 0, run-count 0:\n    # If we've done the loop n times\n    if n == run-count:\n      # return results\n      then::\n        random-successes \u00a0:: random-successes\n        optimal-successes\u00a0:: optimal-successes\n        run-count        \u00a0:: run-count\n\n      # Otherwise, run for another batch of prisoners\n      else:\n        next-result =: simulate-100-prisoners()\n        recur:\n          (random-successes + next-result.random)\n          (optimal-successes + next-result.optimal)\n          run-count.++\n\ndefn simulate-100-prisoners():\n  :: Simulates all prisoners searching the same drawers by both strategies,\n     returns map showing whether each was successful.\n\n  # Create 100 drawers with randomly ordered prisoner numbers:\n  drawers =: random-drawers()\n  hash-map:\n    :random   try-luck(drawers search-50-random-drawers)\n    :optimal  try-luck(drawers search-50-optimal-drawers)\n\ndefn try-luck(drawers drawer-searching-function):\n  :: Returns 1 if all prisoners find their number otherwise 0.\n\n  loop prisoners range(100):\n    if prisoners.?:\n      if prisoners.0.drawer-searching-function(drawers):\n        recur: rest(prisoners)\n        else: 0\n      else: 1\n\ndefn search-50-optimal-drawers(prisoner-number drawers):\n  :: Open 50 drawers according to the agreed strategy, returning true if\n     prisoner's number was found.\n\n  loop next-drawer prisoner-number, drawers-opened 0:\n    when drawers-opened\u00a0!= 50:\n      result =: drawers.$next-drawer\n      result == prisoner-number ||:\n        recur: result drawers-opened.++\n\ndefn search-50-random-drawers(prisoner-number drawers):\n  :: Select 50 random drawers and return true if the prisoner's number was\n     found.\n\n  drawers:\n    .shuffle()\n    .take(50)\n    .filter(eq(prisoner-number))\n    .count()\n    .eq(1)\n\ndefn random-drawers():\n  :: Returns a list of shuffled numbers.\n\n  shuffle: range(100)\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_19.txt",
        "content": "NumOfTrials := 20000\nrandomFailTotal := 0, strategyFailTotal := 0\nprisoners := [], drawers := [], Cards := []\nloop, 100\n\tprisoners[A_Index] := A_Index\t\t\t\t; create prisoners\n\t, drawers[A_Index] := true\t\t\t\t; create drawers\n\nloop, % NumOfTrials\n{\n\tloop, 100\n\t\tCards[A_Index] := A_Index\t\t\t; create cards for this iteration\n\tloop, 100\n\t{\n\t\tRandom, rnd, 1, Cards.count()\n\t\tdrawers[A_Index] := Cards.RemoveAt(rnd)\t\t; randomly place cards in drawers\n\t}\n\t;-------------------------------------------\n\t; randomly open drawers\n\tRandomList := []\n\tloop, 100\n\t\tRandomList[A_Index] := A_Index\n\tFail := false\n\twhile (A_Index <=100) && !Fail\n\t{\n\t\tthisPrisoner := A_Index\n\t\tres := \"\"\n\t\twhile (thisCard <> thisPrisoner) && !Fail\n\t\t{\n\t\t\tRandom, rnd, 1, % RandomList.Count()\t; choose random number\n\t\t\tNextDrawer := RandomList.RemoveAt(rnd)\t; remove drawer from random list (don't choose more than once)\n\t\t\tthisCard := drawers[NextDrawer]\t\t; get card from this drawer\n\t\t\tif (A_Index > 50)\n\t\t\t\tFail := true\n\t\t}\n\t\tif Fail\n\t\t\trandomFailTotal++\n\t}\n\t;-------------------------------------------\n\t; use optimal strategy\n\tFail := false\n\twhile (A_Index <=100) && !Fail\n\t{\n\t\tcounter := 1, thisPrisoner := A_Index\n\t\tNextDrawer := drawers[thisPrisoner]\t\t; 1st trial, drawer whose outside number is prisoner number\n\t\twhile (drawers[NextDrawer] <> thisPrisoner) && !Fail\n\t\t{\t\n\t\t\tNextDrawer := drawers[NextDrawer]\t; drawer with the same number as that of the revealed card\n\t\t\tif ++counter > 50\n\t\t\t\tFail := true\n\t\t}\n\t\tif Fail\n\t\t\tstrategyFailTotal++\n\t}\n}\nMsgBox %  \"Number Of Trials = \" NumOfTrials\n\t\t. \"`nOptimal Strategy:`t\" (1 - strategyFailTotal/NumOfTrials) *100 \"\u00a0% success rate\" \n\t\t. \"`nRandom Trials:`t\" (1 - randomFailTotal/NumOfTrials) *100 \"\u00a0% success rate\"\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_190.txt",
        "content": "const std = @import(\"std\");\n\npub const Cupboard = struct {\n    comptime {\n        std.debug.assert(u7 == std.math.IntFittingRange(0, 100));\n    }\n\n    pub const Drawer = packed struct(u8) {\n        already_visited: bool,\n        card: u7,\n    };\n\n    drawers: [100]Drawer,\n    randomizer: std.rand.Random,\n\n    /// Cupboard is not shuffled after initialization,\n    /// it is shuffled during `play` execution.\n    pub fn init(random: std.rand.Random) Cupboard {\n        var drawers: [100]Drawer = undefined;\n        for (&drawers, 0..) |*drawer, i| {\n            drawer.* = .{\n                .already_visited = false,\n                .card = @intCast(i),\n            };\n        }\n\n        return .{\n            .drawers = drawers,\n            .randomizer = random,\n        };\n    }\n\n    pub const Decision = enum {\n        pardoned,\n        sentenced,\n    };\n\n    pub const Strategy = enum {\n        follow_card,\n        random,\n\n        pub fn decisionOfPrisoner(strategy: Strategy, cupboard: *Cupboard, prisoner_id: u7) Decision {\n            switch (strategy) {\n                .random => {\n                    return for (0..50) |_| {\n                        // If randomly chosen drawer was already opened,\n                        // throw dice again.\n                        const drawer = try_throw_random: while (true) {\n                            const random_i = cupboard.randomizer.uintLessThan(u7, 100);\n                            const drawer = &cupboard.drawers[random_i];\n\n                            if (!drawer.already_visited)\n                                break :try_throw_random drawer;\n                        };\n                        std.debug.assert(!drawer.already_visited);\n                        defer drawer.already_visited = true;\n\n                        if (drawer.card == prisoner_id)\n                            break .pardoned;\n                    } else .sentenced;\n                },\n                .follow_card => {\n                    var drawer_i = prisoner_id;\n                    return for (0..50) |_| {\n                        const drawer = &cupboard.drawers[drawer_i];\n                        std.debug.assert(!drawer.already_visited);\n                        defer drawer.already_visited = true;\n\n                        if (drawer.card == prisoner_id)\n                            break .pardoned\n                        else\n                            drawer_i = drawer.card;\n                    } else .sentenced;\n                },\n            }\n        }\n    };\n\n    pub fn play(cupboard: *Cupboard, strategy: Strategy) Decision {\n        cupboard.randomizer.shuffleWithIndex(Drawer, &cupboard.drawers, u7);\n\n        // Decisions for all 100 prisoners.\n        var all_decisions: [100]Decision = undefined;\n        for (&all_decisions, 0..) |*current_decision, prisoner_id| {\n            // Make decision for current prisoner\n            current_decision.* = strategy.decisionOfPrisoner(cupboard, @intCast(prisoner_id));\n\n            // Close all drawers after one step.\n            for (&cupboard.drawers) |*drawer|\n                drawer.already_visited = false;\n        }\n\n        // If there is at least one sentenced person, everyone are sentenced.\n        return for (all_decisions) |decision| {\n            if (decision == .sentenced)\n                break .sentenced;\n        } else .pardoned;\n    }\n\n    pub fn runSimulation(cupboard: *Cupboard, strategy: Cupboard.Strategy, total: u32) void {\n        var success: u32 = 0;\n        for (0..total) |_| {\n            const result = cupboard.play(strategy);\n            if (result == .pardoned) success += 1;\n        }\n\n        const ratio = @as(f32, @floatFromInt(success)) / @as(f32, @floatFromInt(total));\n\n        const stdout = std.io.getStdOut();\n        const stdout_w = stdout.writer();\n\n        stdout_w.print(\n            \\\\\n            \\\\Strategy: {s}\n            \\\\Total runs: {d}\n            \\\\Successful runs: {d}\n            \\\\Failed runs: {d}\n            \\\\Success rate: {d:.4}%.\n            \\\\\n        , .{\n            @tagName(strategy),\n            total,\n            success,\n            total - success,\n            ratio * 100.0,\n        }) catch {}; // Do nothing on error\n    }\n};\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_191.txt",
        "content": "const std = @import(\"std\");\n\npub fn main() std.os.GetRandomError!void {\n    var prnd = std.rand.DefaultPrng.init(seed: {\n        var init_seed: u64 = undefined;\n        try std.os.getrandom(std.mem.asBytes(&init_seed));\n        break :seed init_seed;\n    });\n    const random = prnd.random();\n\n    var cupboard = Cupboard.init(random);\n\n    cupboard.runSimulation(.follow_card, 10_000);\n    cupboard.runSimulation(.random, 10_000);\n}\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_192.txt",
        "content": "\n\nStrategy: follow_card\nTotal runs: 10000\nSuccessful runs: 3049\nFailed runs: 6951\nSuccess rate: 30.4900%.\n\nStrategy: random\nTotal runs: 10000\nSuccessful runs: 0\nFailed runs: 10000\nSuccess rate: 0.0000%.\n\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_193.txt",
        "content": "const SLOTS=100, PRISONERS=100, TRIES=50, N=10_000;\nfcn oneHundredJDI{\t// just do it strategy\n   cupboard,picks\u00a0:= [0..SLOTS-1].walk().shuffle(), cupboard.copy();\n   // if this prisoner can't find their number in TRIES, all fail\n   foreach p in (PRISONERS){ if(picks.shuffle().find(p)>=TRIES) return(False); }\n   True\t\t// all found their number\n}\nfcn oneHundredO{\t// Optimal strategy\n   cupboard\u00a0:= [0..SLOTS-1].walk().shuffle();\n   foreach p in (PRISONERS){\n      d:=p;\n      do(TRIES){ if((d=cupboard[d]) == p) continue(2) }  // found my number\n      return(False);  // this prisoner failed to find their number, all fail\n   }\n   True\t\t// all found their number\n}",
        "safe": true
    },
    {
        "filename": "100_prisoners_194.txt",
        "content": "s:=N.pump(Ref(0).incN,oneHundredJDI).value.toFloat()/N*100;\nprintln(\"Just do it strategy (%,d simulatations):\u00a0%.2f%%\".fmt(N,s));\n\ns:=N.pump(Ref(0).incN,oneHundredO).value.toFloat()/N*100;\nprintln(\"Optimal strategy    (%,d simulatations):\u00a0%.2f%%\".fmt(N,s));",
        "safe": true
    },
    {
        "filename": "100_prisoners_195.txt",
        "content": "Just do it strategy (10,000 simulatations): 0.00%\nOptimal strategy    (10,000 simulatations): 31.16%\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_196.txt",
        "content": "const SLOTS=100, PRISONERS=10, TRIES=50, N=100_000;",
        "safe": true
    },
    {
        "filename": "100_prisoners_197.txt",
        "content": "Just do it strategy (100,000 simulatations): 0.09%\nOptimal strategy    (100,000 simulatations): 31.13%\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_2.txt",
        "content": " Simulation count: 100000\n Random play wins:  0.0% of simulations\nOptimal play wins: 31.1% of simulations\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_20.txt",
        "content": "Number Of Trials = 20000\nOptimal Strategy:\t33.275000\u00a0% success rate\nRandom Trials  \u00a0:\t0.000000\u00a0% success rate",
        "safe": true
    },
    {
        "filename": "100_prisoners_21.txt",
        "content": "O = 50\nN = 2*O\niterations = 10000\n\nREM From the numbers 0 to N-1 inclusive, pick O of them.\nfunction shuffle(N, O)\n dim array(N)\n for i = 0 to N-1\n  array[i] = i\n next i\n for i = 0 to O-1\n  swapindex = i + rand*(N-i)\n  swapvalue = array[swapindex]\n  array[swapindex] = array[i]\n  array[i] = swapvalue\n next i\n return array\nend function\n\nREM given N drawers with O to open, prisoner P chooses randomly: does he choose well?\nfunction chooserandom(drawers, N, O, p)\n  choices = shuffle(N, O)\n  for i = 0 to O-1\n   if drawers[choices[i]] = p then return true\n  next i\n  return false\nend function\n\nREM N prisoners randomly choose O drawers to open: do they all choose well?\nfunction allchooserandom(N, O)\n drawers = shuffle(N, N)\n for p = 0 to N-1\n  goodchoice = chooserandom(drawers, N, O, p)\n  if not goodchoice then return false\n next p\n return true\nend function\n\nREM given N drawers with O to open, prisoner P chooses smartly: does he choose well?\nfunction choosesmart(drawers, N, O, p)\n numopened = 0\n i = p\n while numopened < O\n  numopened += 1\n  if drawers[i] = p then return true\n  i = drawers[i]\n end while\n return false\nend function\n\nREM N prisoners smartly choose O drawers to open: do they all choose well?\nfunction allchoosesmart(N, O)\n drawers = shuffle(N, N)\n for p = 0 to N-1\n  goodchoice = choosesmart(drawers, N, O, p)\n  if not goodchoice then return false\n next p\n return true\nend function\n\ncls\nprint N; \" prisoners choosing \";O;\" drawers, \";iterations;\" iterations:\"\n\ntotal = 0\nfor iteration = 1 to iterations\n if allchooserandom(N, O) then total += 1\nnext iteration\n\nprint \"Random choices: \"; total;\" out of \";iterations\nprint \"Observed ratio: \"; total/iterations; \", expected ratio: \"; (O/N)^N\n\ntotal = 0\nfor iteration = 1 to iterations\n if allchoosesmart(N, O) then total += 1\nnext iteration\n\nprint \"Smart choices: \"; total;\" out of \";iterations\nprint \"Observed ratio: \"; total/iterations; \", expected ratio with N=2*O: greater than about 0.30685\": REM for N=100, O=50 particularly, about 0.3118",
        "safe": true
    },
    {
        "filename": "100_prisoners_22.txt",
        "content": "100 prisoners choosing 50 drawers, 10000 iterations:\nRandom choices: 0 out of 10000\nObserved ratio: 0.0, expected ratio: 0.0\nSmart choices: 3052 out of 10000\nObserved ratio: 0.3052, expected ratio with N=2*O: greater than about 0.30685\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_23.txt",
        "content": "FUNCTION trials(prisoners, iterations, optimal)\n    DIM drawers(100)\n    FOR i = 1 TO prisoners\n        LET drawers(i) = i\n    NEXT i\n    FOR i = 1 TO iterations\n        FOR k = 1 TO prisoners\n            LET x = RND+1\n            LET p = drawers(x)\n            LET drawers(x) = drawers(k)\n            LET drawers(k) = p\n        NEXT k\n        FOR prisoner = 1 TO prisoners\n            LET found = false\n            IF optimal<>0 THEN LET drawer = prisoner ELSE LET drawer = RND+1\n            FOR j = 1 TO prisoners/2\n                LET drawer = drawers(drawer)\n                IF drawer = prisoner THEN\n                   LET found = true\n                   EXIT FOR\n                END IF\n                IF (NOT optimal<>0) THEN LET drawer = RND+1\n            NEXT j\n            IF (NOT found<>0) THEN EXIT FOR\n        NEXT prisoner\n        LET pardoned = pardoned+found\n    NEXT i\n    LET trials = (100*pardoned/iterations)\nEND FUNCTION\n\nLET false = 0\nLET true = 1\nLET iterations = 10000\nPRINT \"Simulation count: \"; iterations\nFOR prisoners = 10 TO 100 STEP 90\n    LET randon = trials(prisoners,iterations,false)\n    LET optimal = trials(prisoners,iterations,true)\n    PRINT \"Prisoners: \"; prisoners; \", random: \"; randon; \", optimal: \"; optimal\nNEXT prisoners\nEND\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_24.txt",
        "content": "get \"libhdr\"\n\nmanifest $( \n    seed = 12345   // for pseudorandom number generator\n    size = 100     // amount of drawers and prisoners\n    tries = 50     // amount of tries each prisoner may make\n    simul = 2000   // amount of simulations to run\n$)\n\nlet randto(n) = valof\n$(  static $( state = seed $)\n    let mask = 1\n    mask\u00a0:= (mask<<1)|1 repeatuntil mask > n\n    state\u00a0:= random(state) repeatuntil ((state >> 8) & mask) < n \n    resultis (state >> 8) & mask\n$)\n\n// initialize drawers\nlet placeCards(d, n) be\n$(  for i=0 to n-1 do d!i\u00a0:= i;\n    for i=0 to n-2 do\n    $(  let j = i+randto(n-i)\n        let k = d!i\n        d!i\u00a0:= d!j\n        d!j\u00a0:= k\n    $)\n$)\n\n// random strategy (prisoner 'p' tries to find his own number)\nlet randoms(d, p, t) = valof\n$(  for n = 1 to t do\n        if d!randto(size) = p then resultis true\n    resultis false \n$)\n\n// optimal strategy\nlet optimal(d, p, t) = valof\n$(  let last = p\n    for n = 1 to t do\n        test d!last = p \n            then resultis true\n            else last\u00a0:= d!last\n    resultis false\n$)\n\n// run a simulation given a strategy\nlet simulate(d, strat, n, t) = valof\n$(  placeCards(d, n)\n    for p = 0 to n-1 do\n        if not strat(d, p, t) then resultis false\n    resultis true\n$)\n\n// run many simulations and count the successes\nlet runSimulations(d, strat, n, amt, t) = valof\n$(  let succ = 0\n    for i = 1 to amt do\n        if simulate(d, strat, n, t) do\n            succ\u00a0:= succ + 1\n    resultis succ\n$)\n\nlet run(d, name, strat, n, amt, t) be\n$(  let s = runSimulations(d, strat, n, amt, t);\n    writef(\"%S: %I5 of %I5, %N percent.*N\", name, s, amt, s*10/(amt/10))\n$)\n\nlet start() be\n$(  let d = vec size-1\n    run(d, \" Random\", randoms, size, simul, tries)\n    run(d, \"Optimal\", optimal, size, simul, tries)\n$)",
        "safe": true
    },
    {
        "filename": "100_prisoners_25.txt",
        "content": " Random:     0 of  2000, 0 percent.\nOptimal:   698 of  2000, 34 percent.",
        "safe": true
    },
    {
        "filename": "100_prisoners_26.txt",
        "content": "#include<stdbool.h>\n#include<stdlib.h>\n#include<stdio.h>\n#include<time.h>\n\n#define LIBERTY false\n#define DEATH true\n\ntypedef struct{\n\tint cardNum;\n\tbool hasBeenOpened;\n}drawer;\n\ndrawer *drawerSet;\n\nvoid initialize(int prisoners){\n\tint i,j,card;\n\tbool unique;\n\n\tdrawerSet = ((drawer*)malloc(prisoners * sizeof(drawer))) -1;\n\n\tcard = rand()%prisoners + 1;\n\tdrawerSet[1] = (drawer){.cardNum = card, .hasBeenOpened = false};\n\n\tfor(i=1 + 1;i<prisoners + 1;i++){\n\t\tunique = false;\n\t\twhile(unique==false){\n\t\t\tfor(j=0;j<i;j++){\n\t\t\t\tif(drawerSet[j].cardNum == card){\n\t\t\t\t\tcard = rand()%prisoners + 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(j==i){\n\t\t\t\tunique = true;\n\t\t\t}\n\t\t}\n\t\tdrawerSet[i] = (drawer){.cardNum = card, .hasBeenOpened = false};\n\t}\n\n}\n\nvoid closeAllDrawers(int prisoners){\n\tint i;\n\tfor(i=1;i<prisoners + 1;i++)\n\t\tdrawerSet[i].hasBeenOpened = false;\n}\n\nbool libertyOrDeathAtRandom(int prisoners,int chances){\n\tint i,j,chosenDrawer;\n\n\tfor(i= 1;i<prisoners + 1;i++){\n\t\tbool foundCard = false;\n\t\tfor(j=0;j<chances;j++){\n\t\t\tdo{\n\t\t\t\tchosenDrawer = rand()%prisoners + 1;\n\t\t\t}while(drawerSet[chosenDrawer].hasBeenOpened==true);\n\t\t\tif(drawerSet[chosenDrawer].cardNum == i){\n\t\t\t\tfoundCard = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tdrawerSet[chosenDrawer].hasBeenOpened = true;\n\t\t}\n\t\tcloseAllDrawers(prisoners);\n\t\tif(foundCard == false)\n\t\t\treturn DEATH;\n\t}\n\n\treturn LIBERTY;\n}\n\nbool libertyOrDeathPlanned(int prisoners,int chances){\n\tint i,j,chosenDrawer;\n\tfor(i=1;i<prisoners + 1;i++){\n\t\tchosenDrawer = i;\n\t\tbool foundCard = false;\n\t\tfor(j=0;j<chances;j++){\n\t\t\tdrawerSet[chosenDrawer].hasBeenOpened = true;\n\n\t\t\tif(drawerSet[chosenDrawer].cardNum == i){\n\t\t\t\tfoundCard = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(chosenDrawer == drawerSet[chosenDrawer].cardNum){\n\t\t\t\tdo{\n                    chosenDrawer = rand()%prisoners + 1;\n\t\t\t\t}while(drawerSet[chosenDrawer].hasBeenOpened==true);\n\t\t\t}\n\t\t\telse{\n\t\t\t\tchosenDrawer = drawerSet[chosenDrawer].cardNum;\n\t\t\t}\n\n\t\t}\n\n\t\tcloseAllDrawers(prisoners);\n\t\tif(foundCard == false)\n\t\t\treturn DEATH;\n\t}\n\n\treturn LIBERTY;\n}\n\nint main(int argc,char** argv)\n{\n\tint prisoners, chances;\n\tunsigned long long int trials,i,count = 0;\n        char* end;\n\n\tif(argc!=4)\n\t\treturn printf(\"Usage\u00a0: %s <Number of prisoners> <Number of chances> <Number of trials>\",argv[0]);\n\n\tprisoners = atoi(argv[1]);\n\tchances = atoi(argv[2]);\n\ttrials = strtoull(argv[3],&end,10);\n\n\tsrand(time(NULL));\n\n\tprintf(\"Running random trials...\");\n\tfor(i=0;i<trials;i+=1L){\n\t\tinitialize(prisoners);\n\n\t\tcount += libertyOrDeathAtRandom(prisoners,chances)==DEATH?0:1;\n\t}\n\n\tprintf(\"\\n\\nGames Played\u00a0: %llu\\nGames Won\u00a0: %llu\\nChances\u00a0: %lf\u00a0%% \\n\\n\",trials,count,(100.0*count)/trials);\n\n        count = 0;\n\n\tprintf(\"Running strategic trials...\");\n\tfor(i=0;i<trials;i+=1L){\n\t\tinitialize(prisoners);\n\n\t\tcount += libertyOrDeathPlanned(prisoners,chances)==DEATH?0:1;\n\t}\n\n\tprintf(\"\\n\\nGames Played\u00a0: %llu\\nGames Won\u00a0: %llu\\nChances\u00a0: %lf\u00a0%% \\n\\n\",trials,count,(100.0*count)/trials);\n\treturn 0;\n}\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_27.txt",
        "content": "$ gcc 100prisoners.c && ./a.out 100 50 10000\nRunning random trials...\n\nGames Played\u00a0: 10000\nGames Won\u00a0: 0\nChances\u00a0: 0.000000\u00a0% \n\nRunning strategic trials...\n\nGames Played\u00a0: 10000\nGames Won\u00a0: 3051\nChances\u00a0: 30.510000\u00a0% \n",
        "safe": true
    },
    {
        "filename": "100_prisoners_28.txt",
        "content": "using System;\nusing System.Linq;\n\nnamespace Prisoners {\n    class Program {\n        static bool PlayOptimal() {\n            var secrets = Enumerable.Range(0, 100).OrderBy(a => Guid.NewGuid()).ToList();\n\n            for (int p = 0; p < 100; p++) {\n                bool success = false;\n\n                var choice = p;\n                for (int i = 0; i < 50; i++) {\n                    if (secrets[choice] == p) {\n                        success = true;\n                        break;\n                    }\n                    choice = secrets[choice];\n                }\n\n                if (!success) {\n                    return false;\n                }\n            }\n\n            return true;\n        }\n\n        static bool PlayRandom() {\n            var secrets = Enumerable.Range(0, 100).OrderBy(a => Guid.NewGuid()).ToList();\n\n            for (int p = 0; p < 100; p++) {\n                var choices = Enumerable.Range(0, 100).OrderBy(a => Guid.NewGuid()).ToList();\n\n                bool success = false;\n                for (int i = 0; i < 50; i++) {\n                    if (choices[i] == p) {\n                        success = true;\n                        break;\n                    }\n                }\n\n                if (!success) {\n                    return false;\n                }\n            }\n\n            return true;\n        }\n\n        static double Exec(uint n, Func<bool> play) {\n            uint success = 0;\n            for (uint i = 0; i < n; i++) {\n                if (play()) {\n                    success++;\n                }\n            }\n            return 100.0 * success / n;\n        }\n\n        static void Main() {\n            const uint N = 1_000_000;\n            Console.WriteLine(\"# of executions: {0}\", N);\n            Console.WriteLine(\"Optimal play success rate: {0:0.00000000000}%\", Exec(N, PlayOptimal));\n            Console.WriteLine(\" Random play success rate: {0:0.00000000000}%\", Exec(N, PlayRandom));\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_29.txt",
        "content": "# of executions: 1000000\nOptimal play success rate: 31.21310000000%\n Random play success rate: 0.00000000000%",
        "safe": true
    },
    {
        "filename": "100_prisoners_3.txt",
        "content": "/* ARM assembly AARCH64 Raspberry PI 3B */\n/*  program prisonniex64.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.equ NBLOOP, 1000\n\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nsMessResult:        .asciz \"Random strategie \u00a0: @ sur 1000 \\n\"\nsMessResultOPT:     .asciz \"Optimal strategie\u00a0: @ sur 1000 \\n\"\nszCarriageReturn:   .asciz \"\\n\"\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\nsZoneConv:        .skip 24\ntbDoors:          .skip 8 * NBDOORS \ntbTest:           .skip 8 * NBDOORS\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                 // entry of program \n    \n    ldr x1,qAdrtbDoors\n    mov x2,#0\n1:                                    // loop init doors table\n    add x3,x2,#1\n    str x3,[x1,x2,lsl #3]\n    add x2,x2,#1\n    cmp x2,#NBDOORS\n    blt 1b\n \n    mov x9,#0                         // loop counter\n    mov x10,#0                        // counter successes random strategie\n    mov x11,#0                        // counter successes optimal strategie\n2:\n    ldr x0,qAdrtbDoors\n    mov x1,#NBDOORS\n    bl knuthShuffle\n    \n    ldr x0,qAdrtbDoors\n    bl aleaStrategie\n    cmp x0,#NBDOORS\n    cinc x10,x10,eq\n    \n    ldr x0,qAdrtbDoors\n    bl optimaStrategie\n    cmp x0,#NBDOORS\n    cinc x11,x11,eq\n   \n    add x9,x9,#1\n    cmp x9,#NBLOOP\n    blt 2b\n    \n    mov x0,x10                        // result display\n    ldr x1,qAdrsZoneConv\n    bl conversion10                   // call decimal conversion\n    ldr x0,qAdrsMessResult\n    ldr x1,qAdrsZoneConv              // insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n    \n    mov x0,x11                        // result display\n    ldr x1,qAdrsZoneConv\n    bl conversion10                   // call decimal conversion\n    ldr x0,qAdrsMessResultOPT\n    ldr x1,qAdrsZoneConv              // insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\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 \nqAdrszCarriageReturn:     .quad szCarriageReturn\nqAdrsMessResult:          .quad sMessResult\nqAdrsMessResultOPT:       .quad sMessResultOPT\nqAdrtbDoors:              .quad tbDoors\nqAdrtbTest:               .quad tbTest\nqAdrsZoneConv:            .quad sZoneConv\n/******************************************************************/\n/*            random door test strategy                           */ \n/******************************************************************/\n/* x0 contains the address of table */\naleaStrategie:\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    ldr x6,qAdrtbTest            // table doors tests address\n    mov x8,x0                    // save table doors address\n    mov x4,#0                    // counter number of successes\n    mov x2,#0                    // prisonners indice\n1:\n    bl razTable                  // zero to table doors tests\n    mov x5,#0                    // counter of door tests \n    add x7,x2,#1\n2:\n    mov x0,#1\n    mov x1,#NBDOORS\n    bl extRandom                 // random test\n    ldr x3,[x6,x0,lsl #3]        // doors also tested\u00a0?\n    cmp x3,#0 \n    bne 2b                       // yes\n    ldr x3,[x8,x0,lsl #3]        // load N\u00b0 door\n    cmp x3,x7                    // compar N\u00b0 door N\u00b0 prisonner\n    cinc x4,x4,eq\n    beq 3f\n    mov x3,#1                    // top test table item \n    str x3,[x6,x0,lsl #3]\n    add x5,x5,#1\n    cmp x5,#NBDOORS / 2          // number tests maxi\u00a0?\n    blt 2b                       // no -> loop\n3:\n    add x2,x2,#1                 // other prisonner\n    cmp x2,#NBDOORS\n    blt 1b\n    \n    mov x0,x4                    // return number of successes \n100:\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*     raz test table                                             */ \n/******************************************************************/\nrazTable:\n    stp x0,lr,[sp,-16]!        // save  registres\n    stp x1,x2,[sp,-16]!        // save  registres\n    ldr x0,qAdrtbTest\n    mov x1,#0                  // item indice\n    mov x2,#0\n1:\n    str x2,[x0,x1,lsl #3]      // store zero \u00e0 item\n    add x1,x1,#1\n    cmp x1,#NBDOORS\n    blt 1b\n100:\n    ldp x1,x2,[sp],16          // restaur des  2 registres\n    ldp x0,lr,[sp],16          // restaur des  2 registres\n    ret\n/******************************************************************/\n/*            random door test strategy                           */ \n/******************************************************************/\n/* x0 contains the address of table */\noptimaStrategie:\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    mov x4,#0                    // counter number of successes\n    mov x2,#0                    // counter prisonner\n1:\n    mov x5,#0                    // counter test\n    mov x1,x2                    // first test = N\u00b0 prisonner\n2:\n    ldr x3,[x0,x1,lsl #3]        // load N\u00b0 door\n    cmp x3,x2\n    cinc x4,x4,eq                // equal -> succes\n    beq 3f\n    mov x1,x3                    // new test with N\u00b0 door\n    add x5,x5,#1                 \n    cmp x5,#NBDOORS / 2          // test number maxi\u00a0?\n    blt 2b\n3:\n    add x2,x2,#1                 // other prisonner\n    cmp x2,#NBDOORS\n    blt 1b\n    \n    mov x0,x4\n100:\n    ldp x4,x5,[sp],16          // restaur des  2 registres\n    ldp x2,x3,[sp],16          // restaur des  2 registres\n    ldp x1,lr,[sp],16          // restaur des  2 registres\n    ret\n/******************************************************************/\n/*     knuth Shuffle                                  */ \n/******************************************************************/\n/* x0 contains the address of table */\n/* x1 contains the number of elements */\nknuthShuffle:\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!         // save  registers\n    mov x5,x0                   // save table address\n    mov x6,x1                   // save number of elements\n    mov x2,0                    // start index\n1:\n    mov x0,0\n    mov x1,x2                   // generate aleas\n    bl extRandom\n    ldr x3,[x5,x2,lsl #3]        // swap number on the table\n    ldr x4,[x5,x0,lsl #3]\n    str x4,[x5,x2,lsl #3]\n    str x3,[x5,x0,lsl #3]\n    add x2,x2,#1                 // next number\n    cmp x2,x6                    // end\u00a0?\n    blt 1b                       // no -> loop\n100:\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n\n/******************************************************************/\n/*     random number                                          */ \n/******************************************************************/\n/*  x0 contains inferior value */\n/*  x1 contains maxi value */\n/*  x0 return random number */\nextRandom:\n    stp x1,lr,[sp,-16]!        // save  registers\n    stp x2,x8,[sp,-16]!        // save  registers\n    stp x3,x4,[sp,-16]!        // save  registers\n    stp x19,x20,[sp,-16]!      // save  registers\n    sub sp,sp,16               // reserve 16 octets on stack\n    mov x19,x0\n    add x20,x1,1\n    mov x0,sp                  // store result on stack\n    mov x1,8                   // length 8 bytes\n    mov x2,0\n    mov x8,278                 //  call system Linux 64 bits Urandom\n    svc 0\n    mov x0,sp                  // load r\u00e9sult on stack\n    ldr x0,[x0]\n    sub x2,x20,x19             // calculation of the range of values \n    udiv x1,x0,x2              // calculation range modulo\n    msub x0,x1,x2,x0\n    add  x0,x0,x19             // and add inferior value\n100:\n    add sp,sp,16               // alignement stack \n    ldp x19,x20,[sp],16        // restaur  2 registers\n    ldp x3,x4,[sp],16          // restaur  2 registers\n    ldp x2,x8,[sp],16          // restaur  2 registers\n    ldp x1,lr,[sp],16          // restaur  2 registers\n    ret                        // return to address lr x30\n/********************************************************/\n/*        File Include fonctions                        */\n/********************************************************/\n/* for this file see task include a file in language AArch64 assembly */\n.include \"../includeARM64.inc\"",
        "safe": true
    },
    {
        "filename": "100_prisoners_30.txt",
        "content": "#include <cstdlib>   // for rand\n#include <algorithm> // for random_shuffle\n#include <iostream>  // for output\n\nusing namespace std;\n\nclass cupboard {\npublic:\n    cupboard() {\n        for (int i = 0; i < 100; i++)\n            drawers[i] = i;\n        random_shuffle(drawers, drawers + 100);\n    }\n\n    bool playRandom();\n    bool playOptimal();\n\nprivate:\n    int drawers[100];\n};\n\nbool cupboard::playRandom() {\n    bool openedDrawers[100] = { 0 };\n    for (int prisonerNum = 0; prisonerNum < 100; prisonerNum++) { // loops through prisoners numbered 0 through 99\n        bool prisonerSuccess = false;\n        for (int i = 0; i < 100 / 2; i++) {  // loops through 50 draws for each prisoner\n            int drawerNum = rand() % 100;\n            if (!openedDrawers[drawerNum]) {\n                openedDrawers[drawerNum] = true;\n                break;\n            }\n            if (drawers[drawerNum] == prisonerNum) {\n                prisonerSuccess = true;\n                break;\n            }\n        }\n        if (!prisonerSuccess)\n            return false;\n    }\n    return true;\n}\n\nbool cupboard::playOptimal() {\n    for (int prisonerNum = 0; prisonerNum < 100; prisonerNum++) {\n        bool prisonerSuccess = false;\n        int checkDrawerNum = prisonerNum;\n        for (int i = 0; i < 100 / 2; i++) {\n            if (drawers[checkDrawerNum] == prisonerNum) {\n                prisonerSuccess = true;\n                break;\n            } else\n                checkDrawerNum = drawers[checkDrawerNum];\n        }\n        if (!prisonerSuccess)\n            return false;\n    }\n    return true;\n}\n\ndouble simulate(char strategy) {\n    int numberOfSuccesses = 0;\n    for (int i = 0; i < 10000; i++) {\n        cupboard d;\n        if ((strategy == 'R' && d.playRandom()) || (strategy == 'O' && d.playOptimal())) // will run playRandom or playOptimal but not both because of short-circuit evaluation\n            numberOfSuccesses++;\n    }\n\n    return numberOfSuccesses * 100.0 / 10000;\n}\n\nint main() {\n    cout << \"Random strategy:  \" << simulate('R') << \"\u00a0%\" << endl;\n    cout << \"Optimal strategy: \" << simulate('O') << \"\u00a0%\" << endl;\n    system(\"PAUSE\"); // for Windows\n    return 0;\n}\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_31.txt",
        "content": "Random strategy:  0\u00a0%\nOptimal strategy: 31.54\u00a0%",
        "safe": true
    },
    {
        "filename": "100_prisoners_32.txt",
        "content": "(ns clojure-sandbox.prisoners)\n\n(defn random-drawers []\n  \"Returns a list of shuffled numbers\"\n  (-> 100\n      range\n      shuffle))\n\n(defn search-50-random-drawers [prisoner-number drawers]\n  \"Select 50 random drawers and return true if the prisoner's number was found\"\n  (->> drawers\n      shuffle ;; Put drawer contents in random order\n      (take 50) ;; Select first 50, equivalent to selecting 50 random drawers\n      (filter (fn [x] (= x prisoner-number))) ;; Filter to include only those that match prisoner number\n      count\n      (= 1))) ;; Returns true if the number of matching numbers is 1\n\n(defn search-50-optimal-drawers [prisoner-number drawers]\n  \"Open 50 drawers according to the agreed strategy, returning true if prisoner's number was found\"\n  (loop [next-drawer prisoner-number ;; The drawer index to start on is the prisoner's number\n         drawers-opened 0] ;; To keep track of how many have been opened as 50 is the maximum\n    (if (= drawers-opened 50)\n      false ;; If 50 drawers have been opened, the prisoner's number has not been found\n      (let [result (nth drawers next-drawer)] ;; Open the drawer given by next number\n        (if (= result prisoner-number) ;; If prisoner number has been found\n          true ;; No need to keep opening drawers - return true\n          (recur result (inc drawers-opened))))))) ;; Restart the loop using the resulting number as the drawer number\n\n(defn try-luck [drawers drawer-searching-function]\n  \"Returns 1 if all prisoners find their number otherwise 0\"\n  (loop [prisoners (range 100)] ;; Start with 100 prisoners\n    (if (empty? prisoners) ;; If they've all gone and found their number\n      1 ;; Return true- they'll all live\n      (let [res (-> prisoners\n                    first\n                    (drawer-searching-function drawers))] ;; Otherwise, have the first prisoner open drawers according to the specified method\n        (if (false? res) ;; If this prisoner didn't find their number\n          0 ;; no prisoners will be freed so we can return false and stop\n          (recur (rest prisoners))))))) ;; Otherwise they've found the number, so we remove them from the queue and repeat with the others\n\n(defn simulate-100-prisoners []\n  \"Simulates all prisoners searching the same drawers by both strategies, returns map showing whether each was successful\"\n  (let [drawers (random-drawers)] ;; Create 100 drawers with randomly ordered prisoner numbers\n    {:random (try-luck drawers search-50-random-drawers) ;; True if all prisoners found their number using random strategy\n     :optimal (try-luck drawers search-50-optimal-drawers)})) ;; True if all prisoners found their number using optimal strategy\n\n(defn simulate-n-runs [n]\n  \"Simulate n runs of the 100 prisoner problem and returns a success count for each search method\"\n  (loop [random-successes 0\n         optimal-successes 0\n         run-count 0]\n    (if (= n run-count) ;; If we've done the loop n times\n      {:random-successes random-successes ;; return results\n       :optimal-successes optimal-successes\n       :run-count run-count}\n      (let [next-result (simulate-100-prisoners)] ;; Otherwise, run for another batch of prisoners\n        (recur (+ random-successes (:random next-result)) ;; Add result of run to the total successs count\n               (+ optimal-successes (:optimal next-result))\n               (inc run-count)))))) ;; increment run count and run again\n\n(defn -main [& args]\n  \"For 5000 runs, print out the success frequency for both search methods\"\n  (let [{:keys [random-successes optimal-successes run-count]} (simulate-n-runs 5000)]\n    (println (str \"Probability of survival with random search: \" (float (/ random-successes run-count))))\n    (println (str \"Probability of survival with ordered search: \" (float (/ optimal-successes run-count))))))\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_33.txt",
        "content": "Probability of survival with random search: 0.0\nProbability of survival with ordered search: 0.3062\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_34.txt",
        "content": "% This program needs to be merged with PCLU's \"misc\" library\n% to use the random number generator.\n%\n% pclu -merge $CLUHOME/lib/misc.lib -compile prisoners.clu\n\n% Seed the random number generator with the current time\ninit_rng = proc ()\n    d: date\u00a0:= now()\n    seed: int\u00a0:= ((d.hour*60) + d.minute)*60 + d.second\n    random$seed(seed)\nend init_rng\n\n% Place cards in drawers randomly\nmake_drawers = proc (n: int) returns (sequence[int])\n    d: array[int]\u00a0:= array[int]$predict(1,n)\n    \n   \u00a0% place each card in its own drawer\n    for i: int in int$from_to(1,n) do\n        array[int]$addh(d,i)\n    end\n    \n   \u00a0% shuffle the cards\n    for i: int in int$from_to_by(n,2,-1) do\n        j: int\u00a0:= random$next(i)+1\n        t: int\u00a0:= d[i]\n        d[i]\u00a0:= d[j]\n        d[j]\u00a0:= t\n    end\n    return(sequence[int]$a2s(d))\nend make_drawers\n\n% Random strategy\nrand_strat = proc (p, tries: int, d: sequence[int]) returns (bool)\n    n: int\u00a0:= sequence[int]$size(d)\n    for i: int in int$from_to(1,tries) do\n        if p = d[random$next(n)+1] then return(true) end\n    end\n    return(false)\nend rand_strat\n\n% Optimal strategy\nopt_strat = proc (p, tries: int, d: sequence[int]) returns (bool)\n    last: int\u00a0:= p\n    for i: int in int$from_to(1,tries) do\n        if d[last]=p then return(true) end\n        last\u00a0:= d[last]\n    end\n    return(false)\nend opt_strat\n\n% Run one simulation given a strategy\nsimulate = proc (n, tries: int,\n                 strat: proctype (int,int,sequence[int]) returns (bool))\n           returns (bool)\n    d: sequence[int]\u00a0:= make_drawers(n)\n    for p: int in int$from_to(1,n) do\n       \u00a0% If one prisoner fails, they all hang\n        if ~strat(p,tries,d) then return(false) end\n    end\n    return(true)\nend simulate\n\n% Run many simulations and count the successes\nrun_simulations = proc (amount, n, tries: int,\n                        strat: proctype (int,int,sequence[int]) returns (bool))\n                  returns (int)\n    ok: int\u00a0:= 0\n    for i: int in int$from_to(1,amount) do\n        if simulate(n,tries,strat) then\n            ok\u00a0:= ok + 1\n        end\n    end\n    return(ok)\nend run_simulations\n\n% Run simulations and show the results\nshow = proc (title: string,\n             amount, n, tries: int,\n             strat: proctype (int,int,sequence[int]) returns (bool))\n    po: stream\u00a0:= stream$primary_output()\n    stream$puts(po, title || \": \")\n    \n    ok: int\u00a0:= run_simulations(amount, n, tries, strat)\n    perc: real\u00a0:= real$i2r(ok)*100.0/real$i2r(amount)\n    \n    stream$putright(po, int$unparse(ok), 7)\n    stream$puts(po, \" out of \")\n    stream$putright(po, int$unparse(amount), 7)\n    stream$putl(po, \", \" || f_form(perc, 3, 2) || \"%\")\nend show \n\nstart_up = proc ()\n    prisoners   = 100\n    tries       = 50\n    simulations = 50000\n    \n    init_rng()\n\n    show(\" Random\", simulations, prisoners, tries, rand_strat)\n    show(\"Optimal\", simulations, prisoners, tries, opt_strat)\nend start_up",
        "safe": true
    },
    {
        "filename": "100_prisoners_35.txt",
        "content": " Random:       0 out of   50000, 0.00%\nOptimal:   15541 out of   50000, 31.08%",
        "safe": true
    },
    {
        "filename": "100_prisoners_36.txt",
        "content": "10 rem 100 prisoners\n20 rem set arrays\n30 rem dr = drawers containing card values\n40 rem ig = a list of numbers 1 through 100, shuffled to become the \n41 rem guess sequence for each inmate - method 1\n50 dim dr(100),ig(100)\n55 rem initialize drawers with own card in each drawer\n60 for i=1 to 100:dr(i)=i:next \n\n1000 print chr$(147);\"how many trials for each method\";:input tt\n1010 for m=1 to 2:su(m)=0:fa(m)=0\n1015 for tn=1 to tt\n1020 on m gosub 2000,3000\n1025 rem ip = number of inmates who passed\n1030 if ip=100 then su(m)=su(m)+1\n1040 if ip<100 then fa(m)=fa(m)+1\n1045 next tn\n1055 next m\n\n1060 print chr$(147);\"Results:\":print\n1070 print \"Out of\";tt;\"trials, the results are\"\n1071 print \"as follows...\":print\n1072 print \"1. Random Guessing:\"\n1073 print \"  \";su(1);\"successes\"\n1074 print \"  \";fa(1);\"failures\"\n1075 print \"  \";su(1)/tn;\"{left-crsr}% success rate.\":print\n1077 print \"2. Chained Number Picking:\"\n1078 print \"  \";su(2);\"successes\"\n1079 print \"  \";fa(2);\"failures\"\n1080 print \"  \";(su(2)/tn)*100;\"{left-crsr}% success rate.\":print\n1100 print:print \"Again?\"\n1110 get k$:if k$=\"\" then 1110\n1120 if k$=\"y\" then 1000\n1500 end\n\n2000 rem random guessing method\n2005 for x=1 to 100:ig(x)=x:next:ip=0:gosub 4000\n2007 for i=1 to 100\n2010 for x=1 to 100:t=ig(x):np=int(rnd(1)*100)+1:ig(x)=ig(np):ig(np)=t:next\n2015 for g=1 to 50\n2020 if dr(ig(g))=i then ip=ip+1:next i:return\n2025 next g\n2030 return\n\n3000 rem chained method\n3005 ip=0:gosub 4000\n3007 rem iterate through each inmate\n3010 fori=1to100\n3015 ng=i:forg=1to50\n3020 cd=dr(ng)\n3025 ifcd=ithenip=ip+1:nexti:return\n3030 ifcd<>ithenng=cd\n3035 nextg:return\n\n4000 rem shuffle the drawer cards randomly\n4010 x=rnd(-ti)\n4020 for i=1 to 100\n4030 r=int(rnd(1)*100)+1:t=dr(i):dr(i)=dr(r):dr(r)=t:next\n4040 return\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_37.txt",
        "content": "Results:\n\nOut of 4000 trials the percentage of\nsuccess is as follows...\n\n1. Random Guessing:\n   0 successes\n   4000 failures\n   0% success rate.\n\n2. Chained Number Picking:\n   1274 successes\n   2726 failures\n   31.85% success rate.\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_38.txt",
        "content": "(defparameter *samples* 10000)\n(defparameter *prisoners* 100)\n(defparameter *max-guesses* 50)\n\n(defun range (n)\n  \"Returns a list from 0 to N.\"\n  (loop\n     for i below n\n     collect i))\n\n(defun nshuffle (list)\n  \"Returns a shuffled LIST.\"\n  (loop\n     for i from (length list) downto 2\n     do (rotatef (nth (random i) list)\n                 (nth (1- i) list)))\n  list)\n\n(defun build-drawers ()\n  \"Returns a list of shuffled drawers.\"\n  (nshuffle (range *prisoners*)))\n\n(defun strategy-1 (drawers p)\n  \"Returns T if P is found in DRAWERS under *MAX-GUESSES* using a random strategy.\"\n  (loop\n     for i below *max-guesses*\n     thereis (= p (nth (random *prisoners*) drawers))))\n\n(defun strategy-2 (drawers p)\n  \"Returns T if P is found in DRAWERS under *MAX-GUESSES* using an optimal strategy.\"\n  (loop\n     for i below *max-guesses*\n     for j = p then (nth j drawers)\n     thereis (= p (nth j drawers))))\n\n(defun 100-prisoners-problem (strategy &aux (drawers (build-drawers)))\n  \"Returns T if all prisoners find their number using the given STRATEGY.\"\n  (every (lambda (e) (eql T e))\n         (mapcar (lambda (p) (funcall strategy drawers p)) (range *prisoners*))))\n\n(defun sampling (strategy)\n  (loop\n     repeat *samples*\n     for result = (100-prisoners-problem strategy) \n     count result))\n\n(defun compare-strategies ()\n  (format t \"Using a random strategy in ~4,2F\u00a0% of the cases the prisoners are free.~%\" (* (/ (sampling #'strategy-1) *samples*) 100))\n  (format t \"Using an optimal strategy in ~4,2F\u00a0% of the cases the prisoners are free.~%\" (* (/ (sampling #'strategy-2) *samples*) 100)))\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_39.txt",
        "content": "CL-USER> (compare-strategies)\nUsing a random strategy in 0.00\u00a0% of the cases the prisoners are free.\nUsing an optimal strategy in 31.34\u00a0% of the cases the prisoners are free.",
        "safe": true
    },
    {
        "filename": "100_prisoners_4.txt",
        "content": "Random strategie \u00a0: 0 sur 1000\nOptimal strategie\u00a0: 305 sur 1000\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_40.txt",
        "content": "include \"cowgol.coh\";\ninclude \"argv.coh\";\n\n# Parameters\nconst Drawers    \u00a0:= 100;   # Amount of drawers (and prisoners)\nconst Attempts   \u00a0:= 50;    # Amount of attempts a prisoner may make\nconst Simulations\u00a0:= 2000;  # Amount of simulations to run\n\ntypedef NSim is int(0, Simulations);\n\n# Random number generator\nrecord RNG is\n    x: uint8;\n    a: uint8;\n    b: uint8;\n    c: uint8;\n    state @at(0): int32;\nend record;\n\nsub RandomByte(r: [RNG]): (byte: uint8) is \n    r.x\u00a0:= r.x + 1;\n    r.a\u00a0:= r.a ^ r.c ^ r.x;\n    r.b\u00a0:= r.b + r.a;\n    r.c\u00a0:= r.c + (r.b >> 1) ^ r.a;\n    byte\u00a0:= r.c;\nend sub;\n\nsub RandomUpTo(r: [RNG], limit: uint8): (rslt: uint8) is\n    var x: uint8\u00a0:= 1;\n    while x < limit loop\n        x\u00a0:= x << 1;\n    end loop;\n    x\u00a0:= x - 1;\n    \n    loop\n        rslt\u00a0:= RandomByte(r) & x;\n        if rslt < limit then\n            break;\n        end if;\n    end loop;\nend sub;\n\n# Drawers (though marked 0..99 instead of 1..100)\nvar drawers: uint8[Drawers];\ntypedef Drawer is @indexof drawers;\ntypedef Prisoner is Drawer;\n\n# Place cards randomly in drawers\nsub InitDrawers(r: [RNG]) is\n    var x: Drawer\u00a0:= 0;\n    while x < Drawers loop\n        drawers[x]\u00a0:= x;\n        x\u00a0:= x + 1;\n    end loop;\n    \n    x\u00a0:= 0;\n    while x < Drawers - 1 loop\n        var y\u00a0:= x + RandomUpTo(r, Drawers-x);\n        var t\u00a0:= drawers[x];\n        drawers[x]\u00a0:= drawers[y];\n        drawers[y]\u00a0:= t;\n        x\u00a0:= x + 1;\n    end loop;\nend sub;\n\n# A prisoner can apply a strategy and either succeed or not\ninterface Strategy(p: Prisoner, r: [RNG]): (success: uint8);\n\n# The stupid strategy: open drawers randomly.\nsub Stupid implements Strategy is\n    # Let's assume the prisoner is smart enough not to reopen an open drawer\n    var opened: Drawer[Drawers];\n    MemZero(&opened[0], @bytesof opened);\n    \n    # Open random drawers\n    success\u00a0:= 0;\n    var triesLeft: uint8\u00a0:= Attempts;\n    while triesLeft\u00a0!= 0 loop\n        var d\u00a0:= RandomUpTo(r, Drawers); # grab a random drawer\n        if opened[d]\u00a0!= 0 then\n            continue; # Ignore it if a drawer was already open\n        else\n            triesLeft\u00a0:= triesLeft - 1;\n            opened[d]\u00a0:= 1;\n            if drawers[d] == p then # found it!\n                success\u00a0:= 1;\n                return;\n            end if;\n        end if;\n    end loop;\nend sub;\n    \n# The optimal strategy: open the drawer for each number\nsub Optimal implements Strategy is\n    var current\u00a0:= p;\n    var triesLeft: uint8\u00a0:= Attempts;\n    success\u00a0:= 0;\n    while triesLeft\u00a0!= 0 loop\n        current\u00a0:= drawers[current];\n        if current == p then\n            success\u00a0:= 1;\n            return;\n        end if;\n        triesLeft\u00a0:= triesLeft - 1;\n    end loop;\nend sub;\n\n# Run a simulation\nsub Simulate(s: Strategy, r: [RNG]): (success: uint8) is\n    InitDrawers(r); # place cards randomly in drawer\n    var p: Prisoner\u00a0:= 0;\n    success\u00a0:= 1; # if they all succeed the simulation succeeds\n    while p < Drawers loop # but for each prisoner... \n        if s(p, r) == 0 then # if he fails, the simulation fails\n            success\u00a0:= 0;\n            return;\n        end if;\n        p\u00a0:= p + 1;\n    end loop;\nend sub;\n\n# Run an amount of simulations and report the amount of successes\nsub Run(n: NSim, s: Strategy, r: [RNG]): (successes: NSim) is\n    successes\u00a0:= 0;\n    while n > 0 loop\n        successes\u00a0:= successes + Simulate(s, r) as NSim;\n        n\u00a0:= n - 1;\n    end loop;\nend sub;\n\n# Initialize RNG with number given on command line (defaults to 0)\nvar rng: RNG; rng.state\u00a0:= 0;\nArgvInit();\nvar arg\u00a0:= ArgvNext();\nif arg\u00a0!= 0 as [uint8] then\n    (rng.state, arg)\u00a0:= AToI(arg);\nend if;\n\nsub RunAndPrint(name: [uint8], strat: Strategy) is\n    print(name);\n    print(\" strategy: \");\n    var succ\u00a0:= Run(Simulations, strat, &rng) as uint32;\n    print_i32(succ);\n    print(\" out of \");\n    print_i32(Simulations);\n    print(\" - \");\n    print_i32(succ * 100 / Simulations);\n    print(\"%\\n\");\nend sub;\n\nRunAndPrint(\"Stupid\", Stupid);\nRunAndPrint(\"Optimal\", Optimal);",
        "safe": true
    },
    {
        "filename": "100_prisoners_41.txt",
        "content": "Stupid strategy: 0 out of 2000 - 0%\nOptimal strategy: 634 out of 2000 - 31%",
        "safe": true
    },
    {
        "filename": "100_prisoners_42.txt",
        "content": "prisoners = (1..100).to_a\nN = 100_000\ngenerate_rooms = ->{ (1..100).to_a.shuffle }\n\nres = N.times.count do\n  rooms = generate_rooms.call\n  prisoners.all? { |pr| rooms[1, 100].sample(50).includes?(pr) }\nend\nputs \"Random strategy\u00a0: %11.4f\u00a0%%\" % (res.fdiv(N) * 100)\n\nres = N.times.count do\n  rooms = generate_rooms.call\n  prisoners.all? do |pr|\n    cur_room = pr\n    50.times.any? do\n      cur_room = rooms[cur_room - 1]\n      found = (cur_room == pr)\n      found\n    end\n  end\nend\nputs \"Optimal strategy: %11.4f\u00a0%%\" % (res.fdiv(N) * 100)\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_43.txt",
        "content": "Random strategy\u00a0:      0.0000\u00a0%\nOptimal strategy:     31.3190\u00a0%",
        "safe": true
    },
    {
        "filename": "100_prisoners_44.txt",
        "content": "import std.array;\nimport std.random;\nimport std.range;\nimport std.stdio;\nimport std.traits;\n\nbool playOptimal() {\n    auto secrets = iota(100).array.randomShuffle();\n\n    prisoner:\n    foreach (p; 0..100) {\n        auto choice = p;\n        foreach (_; 0..50) {\n            if (secrets[choice] == p) continue prisoner;\n            choice = secrets[choice];\n        }\n        return false;\n    }\n\n    return true;\n}\n\nbool playRandom() {\n    auto secrets = iota(100).array.randomShuffle();\n\n    prisoner:\n    foreach (p; 0..100) {\n        auto choices = iota(100).array.randomShuffle();\n        foreach (i; 0..50) {\n            if (choices[i] == p) continue prisoner;\n        }\n        return false;\n    }\n\n    return true;\n}\n\ndouble exec(const size_t n, bool function() play) {\n    size_t success = 0;\n    for (int i = n; i > 0; i--) {\n        if (play()) {\n            success++;\n        }\n    }\n    return 100.0 * success / n;\n}\n\nvoid main() {\n    enum N = 1_000_000;\n    writeln(\"# of executions: \", N);\n    writefln(\"Optimal play success rate: %11.8f%%\", exec(N, &playOptimal));\n    writefln(\" Random play success rate: %11.8f%%\", exec(N, &playRandom));\n}\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_45.txt",
        "content": "# of executions: 1000000\nOptimal play success rate: 31.16100000%\n Random play success rate:  0.00000000%",
        "safe": true
    },
    {
        "filename": "100_prisoners_46.txt",
        "content": "import 'dart:math';\n\nint playRandom(int n) {\n  var rnd = Random();\n  int pardoned = 0;\n  List<int> inDrawer = List<int>.generate(100, (i) => i);\n  List<int> sampler = List<int>.generate(100, (i) => i);\n  for (int round = 0; round < n; round++) {\n    inDrawer.shuffle();\n    bool found = false;\n    for (int prisoner = 0; prisoner < 100; prisoner++) {\n      found = false;\n      sampler.shuffle(rnd);\n      for (int i = 0; i < 50; i++) {\n        int reveal = sampler[i];\n        int card = inDrawer[reveal];\n        if (card == prisoner) {\n          found = true;\n          break;\n        }\n      }\n      if (!found) {\n        break;\n      }\n    }\n    if (found) {\n      pardoned++;\n    }\n  }\n  return (pardoned / n * 100).round();\n}\n\nint playOptimal(int n) {\n  var rnd = Random();\n  int pardoned = 0;\n  bool found = false;\n  List<int> inDrawer = List<int>.generate(100, (i) => i);\n  for (int round = 0; round < n; round++) {\n    inDrawer.shuffle(rnd);\n    for (int prisoner = 0; prisoner < 100; prisoner++) {\n      int reveal = prisoner;\n      found = false;\n      for (int go = 0; go < 50; go++) {\n        int card = inDrawer[reveal];\n        if (card == prisoner) {\n          found = true;\n          break;\n        }\n        reveal = card;\n      }\n      if (!found) {\n        break;\n      }\n    }\n    if (found) {\n      pardoned++;\n    }\n  }\n  return (pardoned / n * 100).round();\n}\n\nvoid main() {\n  int n = 100000;\n  print(\" Simulation count: $n\");\n  print(\" Random play wins: ${playRandom(n).toStringAsFixed(2)}% of simulations\");\n  print(\"Optimal play wins: ${playOptimal(n).toStringAsFixed(2)}% of simulations\");\n}\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_47.txt",
        "content": " Simulation count: 100000\n Random play wins: 0.00% of simulations\nOptimal play wins: 31.00% of simulations\n\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_48.txt",
        "content": "for i = 1 to 100\n   drawer[] &= i\n   sampler[] &= i\n.\nsubr shuffle_drawer\n   for i = len drawer[] downto 2\n      r = random i\n      swap drawer[r] drawer[i]\n   .\n.\nsubr play_random\n   shuffle_drawer\n   for prisoner = 1 to 100\n      found = 0\n      for i = 1 to 50\n         r = random (100 - i)\n         card = drawer[sampler[r]]\n         swap sampler[r] sampler[100 - i - 1]\n         if card = prisoner\n            found = 1\n            break 1\n         .\n      .\n      if found = 0\n         break 1\n      .\n   .\n.\nsubr play_optimal\n   shuffle_drawer\n   for prisoner = 1 to 100\n      reveal = prisoner\n      found = 0\n      for i = 1 to 50\n         card = drawer[reveal]\n         if card = prisoner\n            found = 1\n            break 1\n         .\n         reveal = card\n      .\n      if found = 0\n         break 1\n      .\n   .\n.\nn = 10000\nwin = 0\nfor _ = 1 to n\n   play_random\n   win += found\n.\nprint \"random: \" & 100.0 * win / n & \"%\"\n#\nwin = 0\nfor _ = 1 to n\n   play_optimal\n   win += found\n.\nprint \"optimal: \" & 100.0 * win / n & \"%\"\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_49.txt",
        "content": "random: 0.000%\noptimal: 30.800%\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_5.txt",
        "content": "HOW TO FILL drawers:\n    PUT {} IN drawers\n    FOR i IN {1..100}: PUT i IN drawers[i]\n    FOR i IN {1..100}:\n        PUT choice {i..100} IN j\n        PUT drawers[i], drawers[j] IN drawers[j], drawers[i]\n\nHOW TO REPORT prisoner random.strat drawers:\n    PUT {1..100} IN available\n    FOR turn IN {1..50}:\n        PUT choice available IN drawer\n        IF drawers[drawer] = prisoner: SUCCEED\n        REMOVE drawer FROM available\n    FAIL\n\nHOW TO REPORT prisoner optimal.strat drawers:\n    PUT prisoner IN drawer\n    FOR turn IN {1..50}:\n        IF drawers[drawer] = prisoner: SUCCEED\n        PUT drawers[drawer] IN drawer\n    FAIL\n\nHOW TO REPORT simulate strategy:\n    FILL drawers\n    FOR prisoner IN {1..100}:\n        SELECT:\n            strategy = \"Random\":\n                IF NOT prisoner random.strat drawers: FAIL\n            strategy = \"Optimal\":\n                IF NOT prisoner optimal.strat drawers: FAIL\n    SUCCEED\n\nHOW TO RETURN n.sim chance.of.success strategy:\n    PUT 0 IN success\n    FOR n IN {1..n.sim}:\n        IF simulate strategy: PUT success+1 IN success\n    RETURN success * 100 / n.sim\n\nFOR strategy IN {\"Random\"; \"Optimal\"}:\n    WRITE strategy, \": \", 10000 chance.of.success strategy, '%'/",
        "safe": true
    },
    {
        "filename": "100_prisoners_50.txt",
        "content": "module OneHundredPrisoners {\n    @Inject Console console;\n\n    void run() {\n        console.print($\"# of executions: {attempts}\");\n        console.print($\"Optimal play success rate: {simulate(tryOpt)}%\");\n        console.print($\" Random play success rate: {simulate(tryRnd)}%\");\n    }\n\n    Int attempts = 10000;\n\n    Dec simulate(function Boolean(Int[]) allFoundNumber) {\n        Int[] drawers  = new Int[100](i->i);\n        Int   pardoned = 0;\n        for (Int i\u00a0: 1..attempts) {\n            if (allFoundNumber(drawers.shuffled())) {\n                ++pardoned;\n            }\n        }\n        return (pardoned * 1000000 / attempts).toDec() / 10000;\n    }\n\n    Boolean tryRnd(Int[] drawers) {\n        Inmates: for (Int inmate\u00a0: 0..<100) {\n            Int[] choices = drawers.shuffled();\n            for (Int attempt\u00a0: 0..<50) {\n                if (drawers[choices[attempt]] == inmate) {\n                    continue Inmates;\n                }\n            }\n            return False;\n        }\n        return True;\n    }\n\n    Boolean tryOpt(Int[] drawers) {\n        Inmates: for (Int inmate\u00a0: 0..<100) {\n            Int choice = inmate;\n            for (Int attempt\u00a0: 0..<50) {\n                if (drawers[choice] == inmate) {\n                    continue Inmates;\n                }\n                choice = drawers[choice];\n            }\n            return False;\n        }\n        return True;\n    }\n}",
        "safe": true
    },
    {
        "filename": "100_prisoners_51.txt",
        "content": "# of executions: 10000\nOptimal play success rate: 30.1%\n Random play success rate: 0%\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_52.txt",
        "content": "defmodule HundredPrisoners do\n  def optimal_room(_, _, _, []), do: []\n  def optimal_room(prisoner, current_room, rooms, [_ | tail]) do\n    found = Enum.at(rooms, current_room - 1) == prisoner\n    next_room = Enum.at(rooms, current_room - 1)\n    [found] ++ optimal_room(prisoner, next_room, rooms, tail)\n  end\n\n  def optimal_search(prisoner, rooms) do\n    Enum.any?(optimal_room(prisoner, prisoner, rooms, Enum.to_list(1..50)))\n  end\nend\n\nprisoners = 1..100\nn = 1..10_000\ngenerate_rooms = fn -> Enum.shuffle(1..100) end\n\nrandom_strategy = Enum.count(n, \n  fn _ -> \n  rooms = generate_rooms.()\n  Enum.all?(prisoners, fn pr -> pr in (rooms |> Enum.take_random(50)) end)\nend)\n\nIO.puts \"Random strategy: #{random_strategy} / #{n |> Range.size}\"\n\noptimal_strategy = Enum.count(n,\n  fn _ ->\n  rooms = generate_rooms.()\n  Enum.all?(prisoners, \n    fn pr -> HundredPrisoners.optimal_search(pr, rooms) end)\nend)\n\nIO.puts \"Optimal strategy: #{optimal_strategy} / #{n |> Range.size}\"\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_53.txt",
        "content": "Random strategy: 0 / 10000\nOptimal strategy: 3110 / 10000\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_54.txt",
        "content": "let rnd = System.Random()\nlet shuffled min max =\n    [|min..max|] |> Array.sortBy (fun _ -> rnd.Next(min,max+1))\n\nlet drawers () = shuffled 1 100\n\n// strategy randomizing drawer opening\nlet badChoices (drawers' : int array) =\n    Seq.init 100 (fun _ -> shuffled 1 100 |> Array.take 50) // selections for each prisoner\n    |> Seq.map (fun indexes -> indexes |> Array.map(fun index -> drawers'.[index-1])) // transform to cards\n    |> Seq.mapi (fun i cards -> cards |> Array.contains i) // check if any card matches prisoner number\n    |> Seq.contains false // true means not all prisoners got their cards\nlet outcomeOfRandom runs =\n    let pardons = Seq.init runs (fun _ -> badChoices (drawers ()))\n                  |> Seq.sumBy (fun badChoice -> if badChoice |> not then 1.0 else 0.0)\n    pardons/ float runs\n    \n// strategy optimizing drawer opening\nlet smartChoice max prisoner (drawers' : int array) =\n    prisoner\n    |> Seq.unfold (fun selection ->\n        let card = drawers'.[selection-1]\n        Some (card, card))\n    |> Seq.take max\n    |> Seq.contains prisoner\nlet smartChoices (drawers' : int array) =\n    seq { 1..100 }\n    |> Seq.map (fun prisoner -> smartChoice 50 prisoner drawers')\n    |> Seq.filter (fun result -> result |> not) // remove all but false results\n    |> Seq.isEmpty // empty means all prisoners got their cards\nlet outcomeOfOptimize runs =\n    let pardons = Seq.init runs (fun _ -> smartChoices (drawers()))\n                  |> Seq.sumBy (fun smartChoice' -> if smartChoice' then 1.0 else 0.0)\n    pardons/ float runs\n    \nprintfn $\"Using Random Strategy: {(outcomeOfRandom 20000):p2}\"\nprintfn $\"Using Optimum Strategy: {(outcomeOfOptimize 20000):p2}\"\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_55.txt",
        "content": "Using Random Strategy: 0.00%\nUsing Optimum Strategy: 31.06%\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_56.txt",
        "content": "USING: arrays formatting fry io kernel math random sequences ;\n\n: setup ( -- seq seq ) 100 <iota> dup >array randomize ;\n\n: rand ( -- ? )\n    setup [ 50 sample member? not ] curry find nip >boolean not ;\n\n: trail ( m seq -- n )\n    50 pick '[ [ nth ] keep over _ = ] replicate [ t = ] any?\n    2nip ;\n\n: optimal ( -- ? ) setup [ trail ] curry [ and ] map-reduce ;\n\n: simulate ( m quot -- x )\n    dupd replicate [ t = ] count swap /f 100 * ; inline\n\n\"Simulation count: 10,000\" print\n10,000 [ rand ] simulate \"Random play success: \"\n10,000 [ optimal ] simulate \"Optimal play success: \"\n[ write \"%.2f%%\\n\" printf ] 2bi@\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_57.txt",
        "content": "Simulation count: 10,000\nRandom play success: 0.00%\nOptimal play success: 31.11%\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_58.txt",
        "content": "01.10 T %5.02,\" RANDOM\";S CU=0\n01.20 F Z=1,2000;D 5;S CU=CU+SU\n01.30 T CU/20,!,\"OPTIMAL\";S CU=0\n01.40 F Z=1,2000;D 6;S CU=CU+SU\n01.50 T CU/20,!\n01.60 Q\n\n02.01 C-- PUT CARDS IN RANDOM DRAWERS\n02.10 F X=1,100;S D(X)=X\n02.20 F X=1,99;D 2.3;S B=D(X);S D(X)=D(A);S D(A)=B\n02.30 D 2.4;S A=X+FITR(A*(101-X))\n02.40 S A=FABS(FRAN()*10);S A=A-FITR(A)\n\n03.01 C-- PRISONER X TRIES UP TO 50 RANDOM DRAWERS\n03.10 S TR=50;S SU=0\n03.20 D 2.4;I (X-D(A))3.3,3.4,3.3\n03.30 S TR=TR-1;I (TR),3.5,3.2\n03.40 S SU=1;R\n03.50 S SU=0\n\n04.01 C-- PRISONER X TRIES OPTIMAL METHOD\n04.10 S TR=50;S SU=0;S A=X\n04.20 I (X-D(A))4.3,4.4,4.3\n04.30 S TR=TR-1;S A=D(A);I (TR),4.5,4.2\n04.40 S SU=1;R\n04.50 S SU=0\n\n05.01 C-- PRISONERS TRY RANDOM METHOD UNTIL ONE FAILS\n05.10 D 2;S X=1\n05.20 I (X-101)5.3,5.4\n05.30 D 3;S X=X+1;I (SU),5.4,5.2\n05.40 R\n\n06.01 C-- PRISONERS TRY OPTIMAL METHOD UNTIL ONE FAILS\n06.10 D 2;S X=1\n06.20 I (X-101)6.3,6.4\n06.30 D 4;S X=X+1;I (SU),6.4,6.2\n06.40 R",
        "safe": true
    },
    {
        "filename": "100_prisoners_59.txt",
        "content": " RANDOM=   0.00\nOPTIMAL=  30.10",
        "safe": true
    },
    {
        "filename": "100_prisoners_6.txt",
        "content": "Optimal:  32.01\u00a0%\nRandom:  0\u00a0%",
        "safe": true
    },
    {
        "filename": "100_prisoners_60.txt",
        "content": "INCLUDE ran4.seq\n\n100      CONSTANT #drawers\n#drawers CONSTANT #players\n100000   CONSTANT #tries\n\nCREATE drawers  #drawers CELLS ALLOT                    \\ index 0..#drawers-1\n\n: drawer[]                              ( n -- addr )   \\ return address of drawer n\n    CELLS drawers +\n;\n\n: random_drawer                         ( -- n )        \\ n=0..#drawers-1 random drawer \n    RAN4 ( d ) XOR ( n ) #drawers MOD\n;\n\n: random_drawer[]                       ( -- addr )     \\ return address of random drawer\n    random_drawer drawer[]\n;\n\n: swap_indirect                         ( addr1 addr2 -- )  \\ swaps the values at the two addresses\n    2DUP @ SWAP @                       ( addr1 addr2 n2 n1 )\n    ROT ! SWAP !                        \\ store n1 at addr2 and n2 at addr1\n;\n\n: init_drawers                          ( -- ) \\ shuffle cards into drawers\n    #drawers 0 DO\n        I I drawer[] !                  \\ store cards in order\n    LOOP\n    #drawers 0 DO\n        I drawer[]  random_drawer[]     ( addr-drawer-i addr-drawer-rnd )\n        swap_indirect\n    LOOP\n;\n\n: random_turn                           ( player - f )\n    #drawers 2 / 0 DO\n\t\trandom_drawer \n\t\tdrawer[] @ \n\t\tOVER = IF\n\t\t\tDROP TRUE UNLOOP EXIT\t\\ found his number\n\t\tTHEN\n\tLOOP \n\tDROP FALSE\n;\n\n0 VALUE player\n\n: cycle_turn                            ( player - f )\n\tDUP TO player\t\t\t( next-drawer )\n    #drawers 2 / 0 DO\n\t\tdrawer[] @\n\t\tDUP player = IF \n\t\t\tDROP TRUE UNLOOP EXIT\t\\ found his number\n\t\tTHEN\n\tLOOP \n\tDROP FALSE\n;\n\n: turn                                  ( strategy player - f )\n    SWAP 0= IF                          \\ random play \n        random_turn\n    ELSE\n        cycle_turn\n    THEN\n;\n\n: play                                  ( strategy -- f ) \\ return true if prisioners survived\n    init_drawers\n    #players 0 DO\n        DUP I turn\n        0= IF\n            DROP FALSE UNLOOP EXIT \t\\ this player did not survive, UNLOOP, return false\n        THEN\n    LOOP \n    DROP TRUE                           \\ all survived, return true\n;\n\n: trie\t\t\t\t\t( strategy - nr-saved )\n\t0\t\t\t\t( strategy nr-saved )\n\t#tries 0 DO\n\t\tOVER play IF 1+ THEN\n\tLOOP\n\tNIP\n;\n\n0 trie . CR\t\\ random strategy\n1 trie . CR\t\\ follow the card number strategy\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_61.txt",
        "content": "0 \n30009 \n",
        "safe": true
    },
    {
        "filename": "100_prisoners_62.txt",
        "content": "SUBROUTINE SHUFFLE_ARRAY(INT_ARRAY)\n    ! Takes an input array and shuffles the elements by swapping them\n    ! in pairs in turn 10 times\n    IMPLICIT NONE\n\n    INTEGER, DIMENSION(100), INTENT(INOUT) :: INT_ARRAY\n    INTEGER, PARAMETER :: N_PASSES = 10\n    ! Local Variables\n\n    INTEGER :: TEMP_1, TEMP_2   ! Temporaries for swapping elements\n    INTEGER :: I, J, PASS       ! Indices variables\n    REAL :: R                   ! Randomly generator value\n\n    CALL RANDOM_SEED()  ! Seed the random number generator\n\n    DO PASS=1, N_PASSES\n        DO I=1, SIZE(INT_ARRAY)\n\n            ! Get a random index to swap with\n            CALL RANDOM_NUMBER(R)\n            J = CEILING(R*SIZE(INT_ARRAY))\n\n            ! In case generated index value\n            ! exceeds array size\n            DO WHILE (J > SIZE(INT_ARRAY))\n                J = CEILING(R*SIZE(INT_ARRAY))\n            END DO\n\n            !  Swap the two elements\n            TEMP_1 = INT_ARRAY(I)\n            TEMP_2 = INT_ARRAY(J)\n            INT_ARRAY(I) = TEMP_2\n            INT_ARRAY(J) = TEMP_1\n        ENDDO\n    ENDDO\nEND SUBROUTINE SHUFFLE_ARRAY\n\nSUBROUTINE RUN_RANDOM(N_ROUNDS)\n    ! Run the 100 prisoner puzzle simulation N_ROUNDS times\n    ! in the scenario where each prisoner selects a drawer at random\n    IMPLICIT NONE\n\n    INTEGER, INTENT(IN) :: N_ROUNDS ! Number of simulations to run in total\n\n    INTEGER :: ROUND, PRISONER, CHOICE, I       ! Iteration variables\n    INTEGER :: N_SUCCESSES                      ! Number of successful trials\n    REAL(8) :: TOTAL                            ! Total number of trials as real\n    LOGICAL :: NUM_FOUND = .FALSE.              ! Prisoner has found their number\n\n    INTEGER, DIMENSION(100) :: CARDS, CHOICES   ! Arrays representing card allocations\n                                                ! to draws and drawer choice order\n\n    ! Both cards and choices are randomly assigned.\n    ! This being the drawer (allocation represented by index),\n    ! and what drawer to pick for Nth/50 choice\n    ! (take first 50 elements of 100 element array)\n    CARDS = (/(I, I=1, 100, 1)/)\n    CHOICES = (/(I, I=1, 100, 1)/)\n\n    N_SUCCESSES = 0\n    TOTAL = REAL(N_ROUNDS)\n\n    ! Run the simulation for N_ROUNDS rounds\n    ! when a prisoner fails to find their number\n    ! after 50 trials, set that simulation to fail\n    ! and start the next round\n    ROUNDS_LOOP: DO ROUND=1, N_ROUNDS\n        CALL SHUFFLE_ARRAY(CARDS)\n        PRISONERS_LOOP: DO PRISONER=1, 100\n            NUM_FOUND = .FALSE.\n            CALL SHUFFLE_ARRAY(CHOICES)\n            CHOICE_LOOP: DO CHOICE=1, 50\n                IF(CARDS(CHOICE) == PRISONER) THEN\n                    NUM_FOUND = .TRUE.\n                    EXIT CHOICE_LOOP\n                ENDIF\n            ENDDO CHOICE_LOOP\n            IF(.NOT. NUM_FOUND) THEN\n                EXIT PRISONERS_LOOP\n            ENDIF\n        ENDDO PRISONERS_LOOP\n        IF(NUM_FOUND) THEN\n            N_SUCCESSES = N_SUCCESSES + 1\n        ENDIF\n    ENDDO ROUNDS_LOOP\n\n    WRITE(*, '(A, F0.3, A)') \"Random drawer selection method success rate: \", &\n        100*N_SUCCESSES/TOTAL, \"%\"\n\nEND SUBROUTINE RUN_RANDOM\n\nSUBROUTINE RUN_OPTIMAL(N_ROUNDS)\n    ! Run the 100 prisoner puzzle simulation N_ROUNDS times in the scenario\n    ! where each prisoner selects firstly the drawer with their number and then\n    ! subsequently the drawer matching the number of the card present \n    ! within that current drawer\n    IMPLICIT NONE\n\n    INTEGER, INTENT(IN) :: N_ROUNDS\n\n    INTEGER :: ROUND, PRISONER, CHOICE, I   ! Iteration variables\n    INTEGER :: CURRENT_DRAW                 ! ID of the current draw\n    INTEGER :: N_SUCCESSES                  ! Number of successful trials\n    REAL(8) :: TOTAL                        ! Total number of trials as real\n    LOGICAL :: NUM_FOUND = .FALSE.          ! Prisoner has found their number \n    INTEGER, DIMENSION(100) :: CARDS        ! Array representing card allocations\n\n    ! Cards are randomly assigned to a drawer \n    ! (allocation represented by index),\n    CARDS = (/(I, I=1, 100, 1)/)\n\n    N_SUCCESSES = 0\n    TOTAL = REAL(N_ROUNDS)\n\n    ! Run the simulation for N_ROUNDS rounds\n    ! when a prisoner fails to find their number\n    ! after 50 trials, set that simulation to fail\n    ! and start the next round\n    ROUNDS_LOOP: DO ROUND=1, N_ROUNDS\n        CARDS = (/(I, I=1, 100, 1)/)\n        CALL SHUFFLE_ARRAY(CARDS)\n        PRISONERS_LOOP: DO PRISONER=1, 100\n            CURRENT_DRAW = PRISONER\n            NUM_FOUND = .FALSE.\n            CHOICE_LOOP: DO CHOICE=1, 50\n                IF(CARDS(CURRENT_DRAW) == PRISONER) THEN\n                    NUM_FOUND = .TRUE.\n                    EXIT CHOICE_LOOP\n                ELSE\n                    CURRENT_DRAW = CARDS(CURRENT_DRAW)\n                ENDIF\n            ENDDO CHOICE_LOOP\n            IF(.NOT. NUM_FOUND) THEN\n                EXIT PRISONERS_LOOP\n            ENDIF\n        ENDDO PRISONERS_LOOP\n        IF(NUM_FOUND) THEN\n            N_SUCCESSES = N_SUCCESSES + 1\n        ENDIF\n    ENDDO ROUNDS_LOOP\n    WRITE(*, '(A, F0.3, A)') \"Optimal drawer selection method success rate: \", &\n        100*N_SUCCESSES/TOTAL, \"%\"\n\nEND SUBROUTINE RUN_OPTIMAL\n\nPROGRAM HUNDRED_PRISONERS\n    ! Run the two scenarios for the 100 prisoners puzzle of random choice\n    ! and optimal choice (choice based on drawer contents)\n    IMPLICIT NONE\n    INTEGER, PARAMETER :: N_ROUNDS = 50000\n    WRITE(*,'(A, I0, A)') \"Running simulation for \", N_ROUNDS, \" trials...\"\n    CALL RUN_RANDOM(N_ROUNDS)\n    CALL RUN_OPTIMAL(N_ROUNDS)\nEND PROGRAM HUNDRED_PRISONERS\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_63.txt",
        "content": "Running simulation for 50000 trials...\nRandom drawer selection method success rate: .000%\nOptimal drawer selection method success rate: 31.360%\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_64.txt",
        "content": "#include once \"knuthshuf.bas\"   'use the routines in https://rosettacode.org/wiki/Knuth_shuffle#FreeBASIC\n\nfunction gus( i as long, strat as boolean ) as long\n    if strat then return i\n    return 1+int(rnd*100)\nend function\n\nsub trials( byref c_success as long, byref c_fail as long, byval strat as boolean )\n        dim as long i, j, k, guess, drawer(1 to 100)\n    for i = 1 to 100\n        drawer(i) = i\n    next i\n    for j = 1 to 1000000 'one million trials of prisoners\n        knuth_up( drawer() )  'shuffles the cards in the drawers\n            for i = 1 to 100 'prisoner number\n            guess = gus(i, strat)\n            for k = 1 to 50 'each prisoner gets 50 tries\n                if drawer(guess) = i then goto next_prisoner\n                guess = gus(drawer(guess), strat)\n            next k\n            c_fail += 1\n            goto next_trial\n            next_prisoner:\n        next i\n        c_success += 1\n        next_trial:\n    next j\nend sub\n\nrandomize timer\ndim as long c_fail=0, c_success=0\n\ntrials( c_success, c_fail, false )\n\nprint using \"For prisoners guessing randomly we had ####### successes and ####### failures.\";c_success;c_fail\n\nc_success = 0\nc_fail = 0\n\ntrials( c_success, c_fail, true )\n\nprint using \"For prisoners using the strategy we had ####### successes and ####### failures.\";c_success;c_fail\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_65.txt",
        "content": "include \"Tlbx GameplayKit.incl\"\n\n_prisoners = 100\n_instances = 10000\n\nlocal fn DrawersArray as CFArrayRef\n  long index\n  CFMutableArrayRef temp = fn MutableArrayWithCapacity(100)\n  for index = 0 to 99\n    MutableArrayAddObject( temp, @(index) )\n  next\nend fn = fn ArrayShuffledArray( temp )\n\n\nlocal fn RandomResult( drawers as CFArrayRef ) as BOOL\n  long prisoner, i, drawer, total = 0\n  MutableIndexSetRef set\n  \n  for prisoner = 0 to _prisoners - 1\n    set = fn MutableIndexSetInit\n    for i = 1 to _prisoners/2\n      drawer = rnd(_prisoners)-1\n      while ( fn IndexSetContainsIndex( set, intVal( drawers[drawer] ) ) )\n        drawer = rnd(_prisoners)-1\n      wend\n      MutableIndexSetAddIndex( set, intVal( drawers[drawer] ) )\n      if ( fn IndexSetContainsIndex( set, prisoner ) )\n        total++\n        break\n      end if\n    next\n  next\nend fn = ( total == _prisoners )\n\n\nlocal fn OptimalResult( drawers as CFArrayRef ) as BOOL\n  long prisoner, drawer, i, card, total = 0\n  \n  for prisoner = 0 to _prisoners - 1\n    drawer = prisoner\n    for i = 1 to _prisoners/2\n      card = intVal( drawers[drawer] )\n      if ( card == prisoner )\n        total++\n        break\n      end if\n      drawer = card\n    next\n  next\nend fn = ( total == _prisoners )\n\n\nvoid local fn DoIt\n  static double sTime = 0.0\n  \n  block TimerRef timer = timerbegin , 0.001, YES\n    sTime += 0.001\n    cls\n    printf @\"Compute time:\u00a0%.3f\\n\",sTime\n  timerend\n  \n  dispatchglobal\n    long instance, randomTotal = 0, optimalTotal = 0\n    CFArrayRef drawers\n    \n    for instance = 1 to _instances\n      drawers = fn DrawersArray\n      if ( fn RandomResult( drawers ) ) then randomTotal++\n      if ( fn OptimalResult( drawers ) ) then optimalTotal++\n    next\n    \n    dispatchmain\n      TimerInvalidate( timer )\n      \n      cls\n      print @\"Prisoners: \"_prisoners\n      print @\"Instances: \"_instances\n      printf @\"Random - fail: %ld, success: %ld (%.2f%%)\",_instances-randomTotal,randomTotal,(double)randomTotal/(double)_instances*100.0\n      printf @\"Optimal - fail: %ld, success: %ld (%.2f%%)\\n\",_instances-optimalTotal,optimalTotal,(double)optimalTotal/(double)_instances*100.0\n      \n      printf @\"Compute time:\u00a0%.3f\\n\",sTime\n    dispatchend\n    \n  dispatchend\nend fn\n\nrandom\n\nwindow 1, @\"100 Prisoners\"\n\nfn DoIt\n\nHandleEvents",
        "safe": true
    },
    {
        "filename": "100_prisoners_66.txt",
        "content": "Prisoners: 100\nInstances: 10000\nRandom - fail: 10000, success: 0 (0.00%)\nOptimal - fail: 6896, success: 3104 (31.04%)\n\nCompute time: 7.856\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_67.txt",
        "content": "' Gambas module file\n\nPublic DrawerArray As Long[]\nPublic NumberFromDrawer As Long\nPublic FoundOwnNumber As Long\n\nPublic Sub Main()\n  \n  Dim NumberOfPrisoners As Long\n  Dim Selections As Long\n  Dim Tries As Long\n  \n  Print \"Number of prisoners (default, 100)?\"\n  Try Input NumberOfPrisoners\n  If Error Then NumberOfPrisoners = 100\n  \n  Print \"Number of selections (default, half of prisoners)?\" \n  Try Input Selections\n  If Error Then Selections = NumberOfPrisoners / 2\n  \n  Print \"Number of tries (default, 1000)?\"\n  Try Input Tries\n  If Error Then Tries = 1000\n  \n  Dim AllFoundOptimal As Long = 0\n  Dim AllFoundRandom As Long = 0\n  Dim AllFoundRandomMem As Long = 0\n  \n  Dim i As Long\n  Dim OptimalCount As Long\n  Dim RandomCount As Long\n  Dim RandomMenCount As Long\n  \n  Dim fStart As Float = Timer\n  \n  For i = 1 To Tries\n    OptimalCount = HundredPrisoners_Optimal(NumberOfPrisoners, Selections)\n    RandomCount = HundredPrisoners_Random(NumberOfPrisoners, Selections)\n    RandomMenCount = HundredPrisoners_Random_Mem(NumberOfPrisoners, Selections)\n    \n    If OptimalCount = NumberOfPrisoners Then AllFoundOptimal += 1\n    If RandomCount = NumberOfPrisoners Then AllFoundRandom += 1\n    If RandomMenCount = NumberOfPrisoners Then AllFoundRandomMem += 1\n  Next\n  \n  Dim fTime As Float = Timer - fStart\n  fTime = Round(ftime, -1)\n  \n  Print\n  Print \"Result with \" & NumberOfPrisoners & \" prisoners, \" & Selections & \" selections and \" & Tries & \" tries. \"\n  Print\n  Print \"Optimal: \" & AllFoundOptimal & \" of \" & Tries & \": \" & Str(AllFoundOptimal / Tries * 100) & \"\u00a0%\"\n  Print \"Random: \" & AllFoundRandom & \" of \" & Tries & \": \" & Str(AllFoundRandom / Tries * 100) & \"\u00a0%\"\n  Print \"RandomMem: \" & AllFoundRandomMem & \" of \" & Tries & \": \" & Str(AllFoundRandomMem / Tries * 100) & \"\u00a0%\"\n  Print\n  Print \"Elapsed Time: \" & fTime & \" sec\"\n  Print\n  Print \"Trials/sec: \" & Round(Tries / fTime, -1)\n  \nEnd\n\nFunction HundredPrisoners_Optimal(NrPrisoners As Long, NrSelections As Long) As Long\n  \n  DrawerArray = New Long[NrPrisoners]\n  Dim Counter As Long\n  \n  For Counter = 0 To DrawerArray.Max\n    DrawerArray[Counter] = Counter + 1\n  Next\n  \n  DrawerArray.Shuffle()\n  \n  Dim i As Long\n  Dim j As Long\n  FoundOwnNumber = 0\n  \n  For i = 1 To NrPrisoners\n    For j = 1 To NrSelections\n      If j = 1 Then NumberFromDrawer = DrawerArray[i - 1]\n      \n      If NumberFromDrawer = i Then\n        FoundOwnNumber += 1\n        Break\n      Endif\n      NumberFromDrawer = DrawerArray[NumberFromDrawer - 1]\n    Next\n  Next\n  Return FoundOwnNumber\n  \nEnd\n\nFunction HundredPrisoners_Random(NrPrisoners As Long, NrSelections As Long) As Long\n  \n  Dim RandomDrawer As Long\n  Dim Counter As Long\n  \n  DrawerArray = New Long[NrPrisoners]\n  \n  For Counter = 0 To DrawerArray.Max\n    DrawerArray[Counter] = Counter + 1\n  Next\n  \n  DrawerArray.Shuffle()\n  \n  Dim i As Long\n  Dim j As Long\n  FoundOwnNumber = 0\n  \n  Randomize\n  \n  For i = 1 To NrPrisoners\n    For j = 1 To NrSelections\n      RandomDrawer = CLong(Rand(NrPrisoners - 1))\n      NumberFromDrawer = DrawerArray[RandomDrawer]\n      If NumberFromDrawer = i Then\n        FoundOwnNumber += 1\n        Break\n      Endif\n    Next\n  Next\n  Return FoundOwnNumber\n  \nEnd\n\nFunction HundredPrisoners_Random_Mem(NrPrisoners As Long, NrSelections As Long) As Long\n  \n  Dim SelectionArray As New Long[NrPrisoners]\n  Dim Counter As Long\n  \n  DrawerArray = New Long[NrPrisoners]\n  \n  For Counter = 0 To DrawerArray.Max\n    DrawerArray[Counter] = Counter + 1\n    \n  Next\n  \n  For Counter = 0 To SelectionArray.Max\n    SelectionArray[Counter] = Counter + 1\n    \n  Next\n  \n  DrawerArray.Shuffle()\n  \n  Dim i As Long\n  Dim j As Long\n  FoundOwnNumber = 0\n  \n  For i = 1 To NrPrisoners\n    SelectionArray.Shuffle()\n    For j = 1 To NrSelections\n      NumberFromDrawer = DrawerArray[SelectionArray[j - 1] - 1]\n      If NumberFromDrawer = i Then\n        FoundOwnNumber += 1\n        Break\n      Endif\n      NumberFromDrawer = DrawerArray[NumberFromDrawer - 1]\n    Next\n  Next\n  Return FoundOwnNumber\n  \nEnd\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_68.txt",
        "content": "Number of prisoners (default, 100)?\n100\nNumber of selections (default, half of prisoners)?\n50\nNumber of tries (default, 1000)?\n\n\nResult with 100 prisoners, 50 selections and 1000 tries. \n\nOptimal: 311 of 1000: 31,1\u00a0%\nRandom: 0 of 1000: 0\u00a0%\nRandomMem: 0 of 1000: 0\u00a0%\n\nElapsed Time: 8.7 sec\n\nTrials/sec: 114.9",
        "safe": true
    },
    {
        "filename": "100_prisoners_69.txt",
        "content": "extends MainLoop\n\n\nenum Strategy {Random, Optimal}\n\nconst prisoner_count := 100\n\n\nfunc get_random_drawers() -> Array[int]:\n\tvar drawers: Array[int] = []\n\tdrawers.resize(prisoner_count)\n\tfor i in range(0, prisoner_count):\n\t\tdrawers[i] = i + 1\n\tdrawers.shuffle()\n\treturn drawers\n\n\nvar random_strategy = func(drawers: Array[int], prisoner: int) -> bool:\n\t# Randomly selecting 50 drawers is equivalent to shuffling and picking the first 50\n\tvar drawerCopy: Array[int] = drawers.duplicate()\n\tdrawerCopy.shuffle()\n\tfor i in range(50):\n\t\tif drawers[drawerCopy[i]-1] == prisoner:\n\t\t\treturn true\n\treturn false\n\n\nvar optimal_strategy = func(drawers: Array[int], prisoner: int) -> bool:\n\tvar choice: int = prisoner\n\tfor _i in range(50):\n\t\tvar drawer_value: int = drawers[choice-1]\n\t\tif drawer_value == prisoner:\n\t\t\treturn true\n\t\tchoice = drawer_value\n\treturn false\n\n\nfunc play_all(drawers: Array[int], strategy: Callable) -> bool:\n\tfor prisoner in range(1, prisoner_count+1):\n\t\tif not strategy.call(drawers, prisoner):\n\t\t\treturn false\n\treturn true\n\n\nfunc _process(_delta: float) -> bool:\n\t# Constant seed for reproducibility, call randomize() in real use\n\tseed(1234)\n\n\tconst SAMPLE_SIZE: int = 10_000\n\n\tvar random_successes: int = 0\n\tfor i in range(SAMPLE_SIZE):\n\t\tif play_all(get_random_drawers(), random_strategy):\n\t\t\trandom_successes += 1\n\n\tvar optimal_successes: int = 0\n\tfor i in range(SAMPLE_SIZE):\n\t\tif play_all(get_random_drawers(), optimal_strategy):\n\t\t\toptimal_successes += 1\n\n\tprint(\"Random play: %%%f\" % (100.0 * random_successes/SAMPLE_SIZE))\n\tprint(\"Optimal play: %%%f\" % (100.0 * optimal_successes/SAMPLE_SIZE))\n\n\treturn true # Exit\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_7.txt",
        "content": "package Prisoners is\n\n   type Win_Percentage is digits 2 range 0.0 .. 100.0;\n   type Drawers is array (1 .. 100) of Positive;\n\n   function Play_Game\n     (Repetitions : in Positive;\n      Strategy    :    not null access function\n        (Cupboard     : in Drawers; Max_Prisoners : Integer;\n         Max_Attempts :    Integer; Prisoner_Number : Integer) return Boolean)\n      return Win_Percentage;\n   -- Play the game with a specified number of repetitions, the chosen strategy\n   -- is passed to this function\n\n   function Optimal_Strategy\n     (Cupboard : in Drawers; Max_Prisoners : Integer; Max_Attempts : Integer;\n      Prisoner_Number :    Integer) return Boolean;\n\n   function Random_Strategy\n     (Cupboard : in Drawers; Max_Prisoners : Integer; Max_Attempts : Integer;\n      Prisoner_Number :    Integer) return Boolean;\n\nend Prisoners;\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_70.txt",
        "content": "Random play: %0.000000\nOptimal play: %31.700000\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_71.txt",
        "content": "package main\n\nimport (\n    \"fmt\"\n    \"math/rand\"\n    \"time\"\n)\n\n// Uses 0-based numbering rather than 1-based numbering throughout.\nfunc doTrials(trials, np int, strategy string) {\n    pardoned := 0\ntrial:\n    for t := 0; t < trials; t++ {\n        var drawers [100]int\n        for i := 0; i < 100; i++ {\n            drawers[i] = i\n        }\n        rand.Shuffle(100, func(i, j int) {\n            drawers[i], drawers[j] = drawers[j], drawers[i]\n        })\n    prisoner:\n        for p := 0; p < np; p++ {\n            if strategy == \"optimal\" {\n                prev := p\n                for d := 0; d < 50; d++ {\n                    this := drawers[prev]\n                    if this == p {\n                        continue prisoner\n                    }\n                    prev = this\n                }\n            } else {\n                // Assumes a prisoner remembers previous drawers (s)he opened\n                // and chooses at random from the others.\n                var opened [100]bool\n                for d := 0; d < 50; d++ {\n                    var n int\n                    for {\n                        n = rand.Intn(100)\n                        if !opened[n] {\n                            opened[n] = true\n                            break\n                        }\n                    }\n                    if drawers[n] == p {\n                        continue prisoner\n                    }\n                }\n            }\n            continue trial\n        }\n        pardoned++\n    }\n    rf := float64(pardoned) / float64(trials) * 100\n    fmt.Printf(\"  strategy =\u00a0%-7s  pardoned =\u00a0%-6d relative frequency = %5.2f%%\\n\\n\", strategy, pardoned, rf)\n}\n\nfunc main() {\n    rand.Seed(time.Now().UnixNano())\n    const trials = 100000\n    for _, np := range []int{10, 100} {\n        fmt.Printf(\"Results from %d trials with %d prisoners:\\n\\n\", trials, np)\n        for _, strategy := range [2]string{\"random\", \"optimal\"} {\n            doTrials(trials, np, strategy)\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_72.txt",
        "content": "Results from 100000 trials with 10 prisoners:\n\n  strategy = random   pardoned = 99     relative frequency =  0.10%\n\n  strategy = optimal  pardoned = 31205  relative frequency = 31.20%\n\nResults from 100000 trials with 100 prisoners:\n\n  strategy = random   pardoned = 0      relative frequency =  0.00%\n\n  strategy = optimal  pardoned = 31154  relative frequency = 31.15%\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_73.txt",
        "content": "import java.util.function.Function\nimport java.util.stream.Collectors\nimport java.util.stream.IntStream\n\nclass Prisoners {\n    private static boolean playOptimal(int n) {\n        List<Integer> secretList = IntStream.range(0, n).boxed().collect(Collectors.toList())\n        Collections.shuffle(secretList)\n\n        prisoner:\n        for (int i = 0; i < secretList.size(); ++i) {\n            int prev = i\n            for (int j = 0; j < secretList.size() / 2; ++j) {\n                if (secretList.get(prev) == i) {\n                    continue prisoner\n                }\n                prev = secretList.get(prev)\n            }\n            return false\n        }\n        return true\n    }\n\n    private static boolean playRandom(int n) {\n        List<Integer> secretList = IntStream.range(0, n).boxed().collect(Collectors.toList())\n        Collections.shuffle(secretList)\n\n        prisoner:\n        for (Integer i\u00a0: secretList) {\n            List<Integer> trialList = IntStream.range(0, n).boxed().collect(Collectors.toList())\n            Collections.shuffle(trialList)\n\n            for (int j = 0; j < trialList.size() / 2; ++j) {\n                if (Objects.equals(trialList.get(j), i)) {\n                    continue prisoner\n                }\n            }\n\n            return false\n        }\n        return true\n    }\n\n    private static double exec(int n, int p, Function<Integer, Boolean> play) {\n        int succ = 0\n        for (int i = 0; i < n; ++i) {\n            if (play.apply(p)) {\n                succ++\n            }\n        }\n        return (succ * 100.0) / n\n    }\n\n    static void main(String[] args) {\n        final int n = 100_000\n        final int p = 100\n        System.out.printf(\"# of executions: %d\\n\", n)\n        System.out.printf(\"Optimal play success rate: %f%%\\n\", exec(n, p, Prisoners.&playOptimal))\n        System.out.printf(\"Random play success rate: %f%%\\n\", exec(n, p, Prisoners.&playRandom))\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_74.txt",
        "content": "# of executions: 100000\nOptimal play success rate: 31.215000%\nRandom play success rate: 0.000000%",
        "safe": true
    },
    {
        "filename": "100_prisoners_75.txt",
        "content": "import System.Random\nimport Control.Monad.State\n\nnumRuns        = 10000\nnumPrisoners   = 100\nnumDrawerTries = 50\ntype Drawers   = [Int]\ntype Prisoner  =  Int\ntype Prisoners = [Int]\n\nmain = do\n  gen <- getStdGen\n  putStrLn $ \"Chance of winning when choosing randomly: \"  ++ (show $ evalState runRandomly gen)\n  putStrLn $ \"Chance of winning when choosing optimally: \" ++ (show $ evalState runOptimally gen)\n\n\nrunRandomly :: State StdGen Double\nrunRandomly =\n  let runResults = replicateM numRuns $ do\n         drawers <- state $ shuffle [1..numPrisoners]\n         allM (\\prisoner -> openDrawersRandomly drawers prisoner numDrawerTries) [1..numPrisoners]\n   in  ((/ fromIntegral numRuns) . fromIntegral . sum . map fromEnum) `liftM` runResults\n\nopenDrawersRandomly :: Drawers -> Prisoner -> Int -> State StdGen Bool\nopenDrawersRandomly drawers prisoner triesLeft = go triesLeft []\n  where go 0 _ = return False\n        go triesLeft seenDrawers = do\n          try <- state $ randomR (1, numPrisoners)\n          case try of\n            x | x == prisoner        -> return True\n              | x `elem` seenDrawers -> go triesLeft seenDrawers\n              | otherwise            -> go (triesLeft - 1) (x:seenDrawers)\n\nrunOptimally :: State StdGen Double\nrunOptimally =\n  let runResults = replicateM numRuns $ do\n         drawers <- state $ shuffle [1..numPrisoners]\n         return $ all (\\prisoner -> openDrawersOptimally drawers prisoner numDrawerTries) [1..numPrisoners]\n   in  ((/ fromIntegral numRuns) . fromIntegral . sum . map fromEnum) `liftM` runResults\n\nopenDrawersOptimally :: Drawers -> Prisoner -> Int -> Bool\nopenDrawersOptimally drawers prisoner triesLeft = go triesLeft prisoner\n  where go 0 _ = False\n        go triesLeft drawerToTry =\n          let thisDrawer = drawers !! (drawerToTry - 1)\n           in if thisDrawer == prisoner then True else go (triesLeft - 1) thisDrawer\n\n\n-- Haskel stdlib is lacking big time, so here some necessary 'library' functions\n\n-- make a list of 'len' random values in range 'range' from 'gen'\nrandomLR :: Integral a => Random b => a -> (b, b) -> StdGen -> ([b], StdGen)\nrandomLR 0 range gen = ([], gen)\nrandomLR len range gen =\n  let (x, newGen) = randomR range gen\n      (xs, lastGen) = randomLR (len - 1) range newGen\n  in (x : xs, lastGen)\n\n\n-- shuffle a list by a generator\nshuffle :: [a] -> StdGen -> ([a], StdGen)\nshuffle list gen = (shuffleByNumbers numbers list, finalGen)\n  where\n    n = length list\n    (numbers, finalGen) = randomLR n (0, n-1) gen\n    shuffleByNumbers :: [Int] -> [a] -> [a]\n    shuffleByNumbers [] _ = []\n    shuffleByNumbers _ [] = []\n    shuffleByNumbers (i:is) xs = let (start, x:rest) = splitAt (i `mod` length xs) xs\n                                 in x : shuffleByNumbers is (start ++ rest)\n\n-- short-circuit monadic all\nallM :: Monad m => (a -> m Bool) -> [a] -> m Bool\nallM func [] = return True\nallM func (x:xs) = func x >>= \\res -> if res then allM func xs else return False\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_76.txt",
        "content": "Chance of winning when choosing randomly: 0.0\nChance of winning when choosing optimally: 0.3188",
        "safe": true
    },
    {
        "filename": "100_prisoners_77.txt",
        "content": "NB. game is solvable by optimal strategy when the length (#) of the\nNB. longest (>./) cycle (C.) is at most 50.\nopt=: 50 >: [: >./ [: > [: #&.> C.\n\nNB. for each prisoner randomly open 50 boxes ((50?100){y) and see if \nNB. the right card is there (p&e.). if not return 0.\nrand=: monad define\nfor_p. i.100 do. if. -.p e.(50?100){y do. 0 return. end.\nend. 1\n)\n\nNB. use both strategies on the same shuffles y times.\nsimulate=: monad define\n'o r'=. y %~ 100 * +/ ((rand,opt)@?~)\"0 y # 100\n('strategy';'win rate'),('random';(\":o),'%'),:'optimal';(\":r),'%'\n)\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_78.txt",
        "content": "   simulate 10000000\n\u250c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2510\n\u2502strategy\u2502win rate\u2502\n\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\u2502random  \u25020%      \u2502\n\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\u2502optimal \u250231.1816%\u2502\n\u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2518\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_79.txt",
        "content": "(math/seedrandom (os/cryptorand 8))\n\n(defn drawers\n  \"create list and shuffle it\"\n  [prisoners]\n  (var x (seq [i :range [0 prisoners]] i))\n  (loop [i :down [(- prisoners 1) 0]]\n    (var j (math/floor (* (math/random) (+ i 1))))\n    (var k (get x i))\n    (put x i (get x j))\n    (put x j k))\n  x)\n\n(defn optimal-play\n  \"optimal decision path\"\n  [prisoners drawers]\n  (var result 0)\n  (loop [i :range [0 prisoners]]\n    (var choice i)\n    (loop [j :range [0 50] :until (= (get drawers choice) i)]\n      (set choice (get drawers choice)))\n    (cond\n      (= (get drawers choice) i) (++ result)\n      (break)))\n  result)\n\n(defn random-play\n  \"random decision path\"\n  [prisoners d]\n  (var result 0)\n  (var options (drawers prisoners))\n  (loop [i :range [0 prisoners]]\n    (var choice 0)\n    (loop [j :range [0 (/ prisoners 2)] :until (= (get d j) (get options i))]\n      (set choice j))\n    (cond\n      (= (get d choice) (get options i)) (++ result)\n      (break)))\n  result)\n\n(defn main [& args]\n  (def prisoners 100)\n  (var optimal-success 0)\n  (var random-success 0)\n  (var sims 10000)\n  (for i 0 sims\n    (var d (drawers prisoners))\n    (if (= (optimal-play prisoners d) prisoners)\n      (++ optimal-success))\n    (if (= (random-play prisoners d) prisoners)\n      (++ random-success)))\n  (printf \"Simulation count:  %d\" sims)\n  (printf \"Optimal play wins:\u00a0%.1f%%\" (* (/ optimal-success sims) 100))\n  (printf \"Random play wins: \u00a0%.1f%%\" (* (/ random-success sims) 100)))",
        "safe": true
    },
    {
        "filename": "100_prisoners_8.txt",
        "content": "pragma Ada_2012;\nwith Ada.Numerics.Discrete_Random;\nwith Ada.Text_IO; use Ada.Text_IO;\n\npackage body Prisoners is\n\n   subtype Drawer_Range is Positive range 1 .. 100;\n   package Random_Drawer is new Ada.Numerics.Discrete_Random (Drawer_Range);\n   use Random_Drawer;\n   \n   -- Helper procedures to initialise and shuffle the drawers\n   \n   procedure Swap (A, B : Positive; Cupboard : in out Drawers) is\n      Temp : Positive;\n   begin\n      Temp         := Cupboard (B);\n      Cupboard (B) := Cupboard (A);\n      Cupboard (A) := Temp;\n   end Swap;\n\n   procedure Shuffle (Cupboard : in out Drawers) is\n      G : Generator;\n   begin\n      Reset (G);\n      for I in Cupboard'Range loop\n         Swap (I, Random (G), Cupboard);\n      end loop;\n   end Shuffle;\n\n   procedure Initialise_Drawers (Cupboard : in out Drawers) is\n   begin\n      for I in Cupboard'Range loop\n         Cupboard (I) := I;\n      end loop;\n      Shuffle (Cupboard);\n   end Initialise_Drawers;\n   \n   -- The two strategies for playing the game\n\n   function Optimal_Strategy\n     (Cupboard : in Drawers; Max_Prisoners : Integer; Max_Attempts : Integer;\n      Prisoner_Number :    Integer) return Boolean\n   is\n      Current_Card : Positive;\n   begin\n      Current_Card := Cupboard (Prisoner_Number);\n      if Current_Card = Prisoner_Number then\n         return True;\n      else\n         for I in Integer range 1 .. Max_Attempts loop\n            Current_Card := Cupboard (Current_Card);\n            if Current_Card = Prisoner_Number then\n               return True;\n            end if;\n         end loop;\n      end if;\n      return False;\n   end Optimal_Strategy;\n\n   function Random_Strategy\n     (Cupboard : in Drawers; Max_Prisoners : Integer; Max_Attempts : Integer;\n      Prisoner_Number :    Integer) return Boolean\n   is\n      Current_Card : Positive;\n      G            : Generator;\n   begin\n      Reset (G);\n      Current_Card := Cupboard (Prisoner_Number);\n      if Current_Card = Prisoner_Number then\n         return True;\n      else\n         for I in Integer range 1 .. Max_Attempts loop\n            Current_Card := Cupboard (Random (G));\n            if Current_Card = Prisoner_Number then\n               return True;\n            end if;\n         end loop;\n      end if;\n      return False;\n   end Random_Strategy;\n\n   function Prisoners_Attempts\n     (Cupboard : in Drawers; Max_Prisoners : Integer; Max_Attempts : Integer;\n      Strategy :    not null access function\n        (Cupboard     : in Drawers; Max_Prisoners : Integer;\n         Max_Attempts :    Integer; Prisoner_Number : Integer) return Boolean)\n      return Boolean\n   is\n   begin\n      for Prisoner_Number in Integer range 1 .. Max_Prisoners loop\n         if not Strategy\n             (Cupboard, Max_Prisoners, Max_Attempts, Prisoner_Number)\n         then\n            return False;\n         end if;\n      end loop;\n      return True;\n   end Prisoners_Attempts;\n   \n   -- The function to play the game itself\n\n   function Play_Game\n     (Repetitions : in Positive;\n      Strategy    :    not null access function\n        (Cupboard     : in Drawers; Max_Prisoners : Integer;\n         Max_Attempts :    Integer; Prisoner_Number : Integer) return Boolean)\n      return Win_Percentage\n   is\n      Cupboard            : Drawers;\n      Win, Game_Count     : Natural          := 0;\n      Number_Of_Prisoners : constant Integer := 100;\n      Max_Attempts        : constant Integer := 50;\n   begin\n      loop\n         Initialise_Drawers (Cupboard);\n         if Prisoners_Attempts\n             (Cupboard     => Cupboard, Max_Prisoners => Number_Of_Prisoners,\n              Max_Attempts => Max_Attempts, Strategy => Strategy)\n         then\n            Win := Win + 1;\n         end if;\n         Game_Count := Game_Count + 1;\n         exit when Game_Count = Repetitions;\n      end loop;\n      return Win_Percentage ((Float (Win) / Float (Repetitions)) * 100.0);\n   end Play_Game;\n\nend Prisoners;\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_80.txt",
        "content": "Simulation count:  10000\nOptimal play wins: 33.1%\nRandom play wins:  0.0%\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_81.txt",
        "content": "import java.util.Collections;\nimport java.util.List;\nimport java.util.Objects;\nimport java.util.function.Function;\nimport java.util.function.Supplier;\nimport java.util.stream.Collectors;\nimport java.util.stream.IntStream;\n\npublic class Main {\n    private static boolean playOptimal(int n) {\n        List<Integer> secretList = IntStream.range(0, n).boxed().collect(Collectors.toList());\n        Collections.shuffle(secretList);\n\n        prisoner:\n        for (int i = 0; i < secretList.size(); ++i) {\n            int prev = i;\n            for (int j = 0; j < secretList.size() / 2; ++j) {\n                if (secretList.get(prev) == i) {\n                    continue prisoner;\n                }\n                prev = secretList.get(prev);\n            }\n            return false;\n        }\n        return true;\n    }\n\n    private static boolean playRandom(int n) {\n        List<Integer> secretList = IntStream.range(0, n).boxed().collect(Collectors.toList());\n        Collections.shuffle(secretList);\n\n        prisoner:\n        for (Integer i : secretList) {\n            List<Integer> trialList = IntStream.range(0, n).boxed().collect(Collectors.toList());\n            Collections.shuffle(trialList);\n\n            for (int j = 0; j < trialList.size() / 2; ++j) {\n                if (Objects.equals(trialList.get(j), i)) {\n                    continue prisoner;\n                }\n            }\n\n            return false;\n        }\n        return true;\n    }\n\n    private static double exec(int n, int p, Function<Integer, Boolean> play) {\n        int succ = 0;\n        for (int i = 0; i < n; ++i) {\n            if (play.apply(p)) {\n                succ++;\n            }\n        }\n        return (succ * 100.0) / n;\n    }\n\n    public static void main(String[] args) {\n        final int n = 100_000;\n        final int p = 100;\n        System.out.printf(\"# of executions: %d\\n\", n);\n        System.out.printf(\"Optimal play success rate: %f%%\\n\", exec(n, p, Main::playOptimal));\n        System.out.printf(\"Random play success rate: %f%%\\n\", exec(n, p, Main::playRandom));\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_82.txt",
        "content": "# of executions: 100000\nOptimal play success rate: 31.343000%\nRandom play success rate: 0.000000%",
        "safe": true
    },
    {
        "filename": "100_prisoners_83.txt",
        "content": "const _ = require('lodash');\n\nconst numPlays = 100000;\n\nconst setupSecrets = () => {\n\t// setup the drawers with random cards\n\tlet secrets = [];\n\n\tfor (let i = 0; i < 100; i++) {\n\t\tsecrets.push(i);\n\t}\n\n\treturn _.shuffle(secrets);\n}\n\nconst playOptimal = () => {\n\t\n\tlet secrets = setupSecrets();\n\t\n\n\t// Iterate once per prisoner\n\tloop1:\n\tfor (let p = 0; p < 100; p++) {\n\t\t\n\t\t// whether the prisoner succeedss\n\t\tlet success = false;\n\t\t\n\t\t// the drawer number the prisoner chose\n\t\tlet choice = p;\n\t\t\n\t\t\n\t\t// The prisoner can choose up to 50 cards\n\t\tloop2:\n\t\tfor (let i = 0; i < 50; i++) {\n\t\t\t\n\t\t\t// if the card in the drawer that the prisoner chose is his card\n\t\t\tif (secrets[choice] === p){\n\t\t\t\tsuccess = true;\n\t\t\t\tbreak loop2;\n\t\t\t}\n\n\t\t\t// the next drawer the prisoner chooses will be the number of the card he has.\n\t\t\tchoice = secrets[choice];\n\t\t\n\t\t}\t// each prisoner gets 50 chances\n\n\t\t\n\t\tif (!success) return false;\n\n\t} // iterate for each prisoner \n\n\treturn true;\n}\n\nconst playRandom = () => {\n\n\tlet secrets = setupSecrets();\n\n\t// iterate for each prisoner \n\tfor (let p = 0; p < 100; p++) {\n\n\t\tlet choices = setupSecrets();\n\t\t\n\t\tlet success = false;\n\t\t\n\t\tfor (let i = 0; i < 50; i++) {\n\n\t\t\tif (choices[i] === p) {\n\t\t\t\tsuccess = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (!success) return false;\n\t}\n\n\treturn true;\n}\n\nconst execOptimal = () => {\n\n\tlet success = 0;\n\t\n\tfor (let i = 0; i < numPlays; i++) {\n\n\t\tif (playOptimal()) success++;\n\t\t\t\n\t}\n\n\treturn 100.0 * success / 100000;\n}\n\nconst execRandom = () => {\n\n\tlet success = 0;\n\n\tfor (let i = 0; i < numPlays; i++) {\n\n\t\tif (playRandom()) success++;\n\n\t}\n\n\treturn 100.0 * success / 100000;\n}\n\nconsole.log(\"# of executions: \" + numPlays);\nconsole.log(\"Optimal Play Success Rate: \" + execOptimal());\nconsole.log(\"Random Play Success Rate: \" + execRandom());\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_84.txt",
        "content": "\"use strict\";\n\n// Simulate several thousand instances of the game:\nconst gamesCount = 2000;\n\n// ...where the prisoners randomly open drawers.\nconst randomResults = playGame(gamesCount, randomStrategy);\n\n// ...where the prisoners use the optimal strategy mentioned in the Wikipedia article.\nconst optimalResults = playGame(gamesCount, optimalStrategy);\n\n// Show and compare the computed probabilities of success for the two strategies.\nconsole.log(`Games count: ${gamesCount}`);\nconsole.log(`Probability of success with \"random\" strategy: ${computeProbability(randomResults, gamesCount)}`);\nconsole.log(`Probability of success with \"optimal\" strategy: ${computeProbability(optimalResults, gamesCount)}`);\n\nfunction playGame(gamesCount, strategy, prisonersCount = 100) {\n    const results = new Array();\n\n    for (let game = 1; game <= gamesCount; game++) {\n        // A room having a cupboard of 100 opaque drawers numbered 1 to 100, that cannot be seen from outside.\n        // Cards numbered 1 to 100 are placed randomly, one to a drawer, and the drawers all closed; at the start.\n        const drawers = initDrawers(prisonersCount);\n\n        // A prisoner tries to find his own number.\n        // Prisoners start outside the room.\n        // They can decide some strategy before any enter the room.\n        let found = 0;\n        for (let prisoner = 1; prisoner <= prisonersCount; prisoner++, found++)\n            if (!find(prisoner, drawers, strategy)) break;\n\n        // If all 100 findings find their own numbers then they will all be pardoned. If any don't then all sentences stand.\n        results.push(found == prisonersCount);\n    }\n\n    return results;\n}\n\nfunction find(prisoner, drawers, strategy) {\n    // A prisoner can open no more than 50 drawers.\n    const openMax = Math.floor(drawers.length / 2);\n\n    // Prisoners start outside the room.\n    let card;\n    for (let open = 0; open < openMax; open++) {\n        // A prisoner tries to find his own number.\n        card = strategy(prisoner, drawers, card);\n\n        // A prisoner finding his own number is then held apart from the others.\n        if (card == prisoner)\n            break;\n    }\n\n    return (card == prisoner);\n}\n\nfunction randomStrategy(prisoner, drawers, card) {\n    // Simulate the game where the prisoners randomly open drawers.\n\n    const min = 0;\n    const max = drawers.length - 1;\n\n    return drawers[draw(min, max)];\n}\n\nfunction optimalStrategy(prisoner, drawers, card) {\n    // Simulate the game where the prisoners use the optimal strategy mentioned in the Wikipedia article.\n\n    // First opening the drawer whose outside number is his prisoner number.\n    // If the card within has his number then he succeeds...\n    if (typeof card === \"undefined\")\n        return drawers[prisoner - 1];\n   \n    // ...otherwise he opens the drawer with the same number as that of the revealed card.\n    return drawers[card - 1];\n}\n\nfunction initDrawers(prisonersCount) {\n    const drawers = new Array();\n    for (let card = 1; card <= prisonersCount; card++)\n        drawers.push(card);\n\n    return shuffle(drawers);\n}\n\nfunction shuffle(drawers) {\n    const min = 0;\n    const max = drawers.length - 1;\n    for (let i = min, j; i < max; i++)     {\n        j = draw(min, max);\n        if (i != j)\n            [drawers[i], drawers[j]] = [drawers[j], drawers[i]];\n    }\n\n    return drawers;\n}\n\nfunction draw(min, max) {\n    // See: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Math/random\n    return Math.floor(Math.random() * (max - min + 1)) + min;\n}\n\nfunction computeProbability(results, gamesCount) {\n    return Math.round(results.filter(x => x == true).length * 10000 / gamesCount) / 100;\n}\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_85.txt",
        "content": "Games count: 2000\nProbability of success with \"random\" strategy: 0\nProbability of success with \"optimal\" strategy: 33.2",
        "safe": true
    },
    {
        "filename": "100_prisoners_86.txt",
        "content": "export LC_ALL=C\n< /dev/urandom tr -cd '0-9' | fold -w 1 | jq -MRcnr -f 100-prisoners.jq\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_87.txt",
        "content": "def count(s): reduce s as $x (0; .+1);\n\n# Output: a PRN in range(0;$n) where $n is .\ndef prn:\n  if . == 1 then 0\n  else . as $n\n  | (($n-1)|tostring|length) as $w\n  | [limit($w; inputs)] | join(\"\") | tonumber\n  | if . < $n then . else ($n | prn) end\n  end;\n\ndef knuthShuffle:\n  length as $n\n  | if $n <= 1 then .\n    else {i: $n, a: .}\n    | until(.i ==  0;\n        .i += -1\n        | (.i + 1 | prn) as $j\n        | .a[.i] as $t\n        | .a[.i] = .a[$j]\n        | .a[$j] = $t)\n    | .a \n    end;",
        "safe": true
    },
    {
        "filename": "100_prisoners_88.txt",
        "content": "# Output: if all the prisoners succeed, emit true, otherwise false\ndef optimalStrategy($drawers; np):\n  # Does prisoner $p succeed?\n  def succeeds($p):\n    first( foreach range(0; np/2) as $d ({prev: $p};\n             .curr = ($drawers[.prev])\n             | if .curr == $p\n               then .success = true\n               else .prev = .curr\n               end;\n             select(.success))) // false;\n  \n  all( range(0; np); succeeds(.) );\n  \n# Output: if all the prisoners succeed, emit true, otherwise false\ndef randomStrategy($drawers; np):\n  (np/2) as $maxd\n  # Does prisoner $p succeed?\n  | def succeeds($p):\n      {success: false }\n      | first(.d = 0\n              | .opened = []\n              | until( (.d >= $maxd) or .success;\n                  (np|prn) as $n\n                  | if .opened[$n] then .\n                    else .opened[$n] = true\n                    | .d += 1\n                    | .success = $drawers[$n] == $p\n                    end )\n              | select(.success) ) // false;\n\n  all( range(0; np); succeeds(.) );\n\n\ndef run(strategy; trials; np):\n  count(range(0; trials)\n    | ([range(0;np)] | knuthShuffle) as $drawers\n    | select (if strategy == \"optimal\"\n              then optimalStrategy($drawers; np)\n              else randomStrategy($drawers; np)\n              end ) );\n\ndef task($trials):\n  def percent: \"\\(10000 * . | round / 100)%\";\n  def summary(strategy):\n    \"With \\(strategy) strategy: pardoned = \\(.), relative frequency = \\(./$trials | percent)\";\n\n  (10, 100) as $np\n  | \"Results from \\($trials) trials with \\($np) prisoners:\",\n    (run(\"random\";  $trials; $np) | summary(\"random\")),\n    (run(\"optimal\"; $trials; $np) | summary(\"optimal\")),\n    \"\"\n;\n\ntask(100000)",
        "safe": true
    },
    {
        "filename": "100_prisoners_89.txt",
        "content": "Results from 100000 trials with 10 prisoners:\nWith random strategy: pardoned = 92, relative frequency = 0.09%\nWith optimal strategy: pardoned = 31212, relative frequency = 31.21%\n\nResults from 100000 trials with 100 prisoners:\nWith random strategy: pardoned = 0, relative frequency = 0%\nWith optimal strategy: pardoned = 31026, relative frequency = 31.03%\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_9.txt",
        "content": "with Prisoners;   use Prisoners;\nwith Ada.Text_IO; use Ada.Text_IO;\n\nprocedure Main is\n   Wins : Win_Percentage;\n   package Win_Percentage_IO is new Float_IO (Win_Percentage);\nbegin\n   Wins := Play_Game (100_000, Optimal_Strategy'Access);\n   Put (\"Optimal Strategy = \");\n   Win_Percentage_IO.Put (Wins, 2, 2, 0);\n   Put (\"%\");\n   New_Line;\n   Wins := Play_Game (100_000, Random_Strategy'Access);\n   Put (\"Random Strategy = \");\n   Win_Percentage_IO.Put (Wins, 2, 2, 0);\n   Put (\"%\");\nend Main;\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_90.txt",
        "content": "using Random, Formatting\n\nfunction randomplay(n, numprisoners=100)\n    pardoned, indrawer, found = 0, collect(1:numprisoners), false\n    for i in 1:n\n        shuffle!(indrawer)\n        for prisoner in 1:numprisoners\n            found = false\n            for reveal in randperm(numprisoners)[1:div(numprisoners, 2)]\n                indrawer[reveal] == prisoner && (found = true) && break\n            end\n            !found && break\n        end\n        found && (pardoned += 1)\n    end\n    return 100.0 * pardoned / n\nend\n\nfunction optimalplay(n, numprisoners=100)\n    pardoned, indrawer, found = 0, collect(1:numprisoners), false\n    for i in 1:n\n        shuffle!(indrawer)\n        for prisoner in 1:numprisoners\n            reveal = prisoner\n            found = false\n            for j in 1:div(numprisoners, 2)\n                card = indrawer[reveal]\n                card == prisoner && (found = true) && break\n                reveal = card\n            end\n            !found && break\n        end\n        found && (pardoned += 1)\n    end\n    return 100.0 * pardoned / n\n end\n\nconst N = 100_000\nprintln(\"Simulation count: $N\")\nprintln(\"Random play wins: \", format(randomplay(N), precision=8), \"% of simulations.\")\nprintln(\"Optimal play wins: \", format(optimalplay(N), precision=8), \"% of simulations.\")\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_91.txt",
        "content": "Simulation count: 100000\nRandom play wins: 0.00000000% of simulations.\nOptimal play wins: 31.18100000% of simulations.\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_92.txt",
        "content": "import std/num/random\n\nvalue struct drawer\n  num: int\n  open: bool = False\n\ninline extern unsafe-assign : forall<a> ( v : vector<a>, i : ssize_t, x : a ) -> total ()\n  c \"kk_vector_unsafe_assign\"\n\nfun createDrawers()\n  val drawers = vector(100, Drawer(0,open=True))\n  for(0, 99) fn(i)\n    var found := False\n    while {!found}\n      val r = random-int() % 100\n      if drawers[r].open then\n        drawers.unsafe-assign(r.ssize_t, Drawer(i))\n        found := True\n      else\n        ()\n  drawers\n\nfun closeAll(d:vector<drawer>)\n  for(0,99) fn(i)\n    d.unsafe-assign(i.ssize_t, d[i](open=False))\n\neffect fail\n  final ctl failed(): a \n\nfun open-random(drawers: vector<drawer>)\n  val r = random-int() % 100\n  val opened = drawers[r]\n  if opened.open then\n    open-random(drawers)\n  else\n    drawers.unsafe-assign(r.ssize_t, opened(open=True))\n    opened.num\n\nfun random-approach(drawers: vector<drawer>)\n  for(0, 99) fn(i)\n    var found := False\n    for(0, 49) fn(j)\n      val opened = open-random(drawers)\n      if opened == i then\n        found := True\n      else\n        ()\n    if !found then\n      failed()\n    else\n      drawers.closeAll()\n\nfun optimal-approach(drawers: vector<drawer>)\n  for(0, 99) fn(i)\n    var found := False\n    var drawer := i;\n    for(0, 49) fn(j)\n      val opened = drawers[drawer]\n      if opened.open then\n        failed()\n      if opened.num == i then\n        found := True\n      else\n        drawers.unsafe-assign(drawer.ssize_t, opened(open=True))\n        drawer := opened.num\n    if !found then\n      failed()\n    else\n      drawers.closeAll()\n      ()\n\nfun run-trials(f, num-trials)\n  var num_success := 0\n  for(0,num-trials - 1) fn(i)\n    val drawers = createDrawers()\n    with handler\n      return(x) -> \n        num_success := num_success + 1\n      final ctl failed() -> \n        ()\n    f(drawers)\n  num_success\n\nfun main()\n  val num_trials = 1000\n  val num_success_random = run-trials(random-approach, num_trials)\n  val num_success_optimal = run-trials(optimal-approach, num_trials)\n  println(\"Number of trials: \" ++ num_trials.show)\n  println(\"Random approach: wins \" ++ num_success_random.show ++ \" (\" ++ (num_success_random.float64 * 100.0 / num_trials.float64).show(2) ++ \"%)\")\n  println(\"Optimal approach: wins \" ++ num_success_optimal.show ++ \" (\" ++ (num_success_optimal.float64 * 100.0 / num_trials.float64).show(2) ++ \"%)\")\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_93.txt",
        "content": "Number of trials: 1000\nRandom approach: wins 0 (0.00%)\nOptimal approach: wins 319 (31.90%)\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_94.txt",
        "content": "val playOptimal: () -> Boolean = {\n    val secrets = (0..99).toMutableList()\n    var ret = true\n    secrets.shuffle()\n    prisoner@ for(i in 0 until 100){\n        var prev = i\n        draw@ for(j in 0 until  50){\n            if (secrets[prev] == i) continue@prisoner\n            prev = secrets[prev]\n        }\n        ret = false\n        break@prisoner\n    }\n    ret\n}\n\nval playRandom: ()->Boolean = {\n    var ret = true\n    val secrets = (0..99).toMutableList()\n    secrets.shuffle()\n    prisoner@ for(i in 0 until 100){\n        val opened = mutableListOf<Int>()\n        val genNum : () ->Int = {\n            var r = (0..99).random()\n            while (opened.contains(r)) {\n                r = (0..99).random()\n            }\n            r\n        }\n        for(j in 0 until 50){\n            val draw = genNum()\n            if ( secrets[draw] == i) continue@prisoner\n            opened.add(draw)\n        }\n        ret = false\n        break@prisoner\n    }\n    ret\n}\n\nfun exec(n:Int, play:()->Boolean):Double{\n    var succ = 0\n    for (i in IntRange(0, n-1)){\n        succ += if(play()) 1 else 0\n    }\n    return (succ*100.0)/n\n}\n\nfun main() {\n    val N = 100_000\n    println(\"# of executions: $N\")\n    println(\"Optimal play success rate: ${exec(N, playOptimal)}%\")\n    println(\"Random play success rate: ${exec(N, playRandom)}%\")\n}\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_95.txt",
        "content": "# of executions: 100000\nOptimal play success rate: 31.451%\nRandom play success rate: 0.0%\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_96.txt",
        "content": "function shuffle(tbl)\n  for i = #tbl, 2, -1 do\n    local j = math.random(i)\n    tbl[i], tbl[j] = tbl[j], tbl[i]\n  end\n  return tbl\nend\n\nfunction playOptimal()\n    local secrets = {}\n    for i=1,100 do\n        secrets[i] = i\n    end\n    shuffle(secrets)\n\n    for p=1,100 do\n        local success = false\n\n        local choice = p\n        for i=1,50 do\n            if secrets[choice] == p then\n                success = true\n                break\n            end\n            choice = secrets[choice]\n        end\n\n        if not success then\n            return false\n        end\n    end\n\n    return true\nend\n\nfunction playRandom()\n    local secrets = {}\n    for i=1,100 do\n        secrets[i] = i\n    end\n    shuffle(secrets)\n\n    for p=1,100 do\n        local choices = {}\n        for i=1,100 do\n            choices[i] = i\n        end\n        shuffle(choices)\n\n        local success = false\n        for i=1,50 do\n            if choices[i] == p then\n                success = true\n                break\n            end\n        end\n\n        if not success then\n            return false\n        end\n    end\n\n    return true\nend\n\nfunction exec(n,play)\n    local success = 0\n    for i=1,n do\n        if play() then\n            success = success + 1\n        end\n    end\n    return 100.0 * success / n\nend\n\nfunction main()\n    local N = 1000000\n    print(\"# of executions: \"..N)\n    print(string.format(\"Optimal play success rate: %f\", exec(N, playOptimal)))\n    print(string.format(\"Random play success rate: %f\", exec(N, playRandom)))\nend\n\nmain()\n",
        "safe": true
    },
    {
        "filename": "100_prisoners_97.txt",
        "content": "# of executions: 1000000\nOptimal play success rate: 31.237500\nRandom play success rate: 0.000000",
        "safe": true
    },
    {
        "filename": "100_prisoners_98.txt",
        "content": "p:=simplify(1-product(1-1/(2*n-k),k=0..n-1));\n# p=1/2",
        "safe": true
    },
    {
        "filename": "100_prisoners_99.txt",
        "content": "p^100;\nevalf(%);\n\n# 1/1267650600228229401496703205376\n# 7.888609052e-31",
        "safe": true
    },
    {
        "filename": "15 puzzle game_1.txt",
        "content": "T Puzzle\n   position = 0\n   [Int = String] items\n\n   F main_frame()\n      V& d = .items\n      print(\u2018+-----+-----+-----+-----+\u2019)\n      print(\u2018|#.|#.|#.|#.|\u2019.format(d[1], d[2], d[3], d[4]))\n      print(\u2018+-----+-----+-----+-----+\u2019)\n      print(\u2018|#.|#.|#.|#.|\u2019.format(d[5], d[6], d[7], d[8]))\n      print(\u2018+-----+-----+-----+-----+\u2019)\n      print(\u2018|#.|#.|#.|#.|\u2019.format(d[9], d[10], d[11], d[12]))\n      print(\u2018+-----+-----+-----+-----+\u2019)\n      print(\u2018|#.|#.|#.|#.|\u2019.format(d[13], d[14], d[15], d[16]))\n      print(\u2018+-----+-----+-----+-----+\u2019)\n\n   F format(=ch)\n      ch = ch.trim(\u2018 \u2019)\n      I ch.len == 1\n         R \u2018  \u2019ch\u2018  \u2019\n      E I ch.len == 2\n         R \u2018  \u2019ch\u2018 \u2019\n      E\n         assert(ch.empty)\n         R \u2018     \u2019\n\n   F change(=to)\n      V fro = .position\n      L(a, b) .items\n         I b == .format(String(to))\n            to = a\n            L.break\n      swap(&.items[fro], &.items[to])\n      .position = to\n\n   F build_board(difficulty)\n      L(i) 1..16\n         .items[i] = .format(String(i))\n      V tmp = 0\n      L(a, b) .items\n         I b == \u2018  16 \u2019\n            .items[a] = \u2018     \u2019\n            tmp = a\n            L.break\n      .position = tmp\n      Int diff\n      I difficulty == 0\n         diff = 10\n      E I difficulty == 1\n         diff = 50\n      E\n         diff = 100\n      L 0 .< diff\n         V lst = .valid_moves()\n         [Int] lst1\n         L(j) lst\n            lst1.append(Int(j.trim(\u2018 \u2019)))\n         .change(lst1[random:(lst1.len)])\n\n   F valid_moves()\n      V pos = .position\n      I pos C [6, 7, 10, 11]\n         R [.items[pos - 4], .items[pos - 1], .items[pos + 1], .items[pos + 4]]\n      E I pos C [5, 9]\n         R [.items[pos - 4], .items[pos + 4], .items[pos + 1]]\n      E I pos C [8, 12]\n         R [.items[pos - 4], .items[pos + 4], .items[pos - 1]]\n      E I pos C [2, 3]\n         R [.items[pos - 1], .items[pos + 1], .items[pos + 4]]\n      E I pos C [14, 15]\n         R [.items[pos - 1], .items[pos + 1], .items[pos - 4]]\n      E I pos == 1\n         R [.items[pos + 1], .items[pos + 4]]\n      E I pos == 4\n         R [.items[pos - 1], .items[pos + 4]]\n      E I pos == 13\n         R [.items[pos + 1], .items[pos - 4]]\n      E\n         assert(pos == 16)\n         R [.items[pos - 1], .items[pos - 4]]\n\n   F game_over()\n      V flag = 0B\n      L(a, b) .items\n         I b\u00a0!= \u2018     \u2019\n            I a == Int(b.trim(\u2018 \u2019))\n               flag = 1B\n            E\n               flag = 0B\n      R flag\n\nV g = Puzzle()\ng.build_board(Int(input(\"Enter the difficulty\u00a0: 0 1 2\\n2 => highest 0 => lowest\\n\")))\ng.main_frame()\nprint(\u2018Enter 0 to exit\u2019)\nL\n   print(\"Hello user:\\nTo change the position just enter the no. near it\")\n   V lst = g.valid_moves()\n   [Int] lst1\n   L(i) lst\n      lst1.append(Int(i.trim(\u2018 \u2019)))\n      print(i.trim(\u2018 \u2019)\" \\t\", end' \u2018\u2019)\n   print()\n   V x = Int(input())\n   I x == 0\n      L.break\n   E I x !C lst1\n      print(\u2018Wrong move\u2019)\n   E\n      g.change(x)\n   g.main_frame()\n   I g.game_over()\n      print(\u2018You WON\u2019)\n      L.break",
        "safe": true
    },
    {
        "filename": "15 puzzle game_10.txt",
        "content": "#include <jambo.h>\n\n#define FILATABLA            5\n#define COLUMNATABLA         10\n#define Imprimelamatriz      Gosub 'Pone la matriz'\n#define Imprimelascasillas   Gosub 'Pone las casillas'\n#define Imprimeel\u00edndiceen(_X_,_Y_)  Set '_X_,_Y_',  Gosub 'Pone el \u00edndice'\n\nMain\n   Set break\n\n   Void (casilla, \u00edndice, n\u00fameros)\n   Link gosub( Crea una casilla, Crea el \u00edndice, Crea la matriz de n\u00fameros )\n   \n   Cls\n   x=4, y=4, Tok sep '\"\"', Gosub 'Imprime escenario'\n   \n  /* INICIA EL JUEGO */\n   SW = 1, GANADOR = 0\n   c=0, cero x=4, cero y=4\n   \n   Loop\n       Let ( c:=Getch )\n       Switch ( c )\n           Case 'KRIGHT'  { #( y < 4 ) do{ ++y }, Exit }\n           Case 'KDOWN'   { #( x < 4 ) do{ ++x }, Exit }\n           Case 'KLEFT'   { #( y > 1 ) do{ --y }, Exit }\n           Case 'KUP'     { #( x > 1 ) do{ --x }, Exit }\n           Case 'KRETURN' { If ( Gosub 'Chequear si movimiento es v\u00e1lido' )\n                               Gosub 'Mover las casillas'\n                            End If\n                            Exit\n                          }\n           Case 'KESCAPE' { SW=0 }\n       End switch\n       \n       Gosub 'Imprime escenario'\n       Break if ( Gosub 'Verificar puzzle resuelto' --- Backup to 'GANADOR' )\n   Back if 'SW' is not zero\n\n  /* FIN DEL JUEGO */\n   If ( GANADOR )\n       Locate (18,15), Printnl(\"LO RESOLVISTE!\")\n   End If\n   Locate (19,1), Prnl\nEnd\n\nSubrutines\n\n/* CHEQUEO DE MOVIMIENTO */\n\nDefine ( Verificar puzzle resuelto )\n   ret = 0\n   Clr all marks\n   Tn\u00fameros=n\u00fameros\n   Redim (Tn\u00fameros,0), N = 0, Let ( N\u00a0:= Length(Tn\u00fameros) Minus (1))\n   i=1\n   Iterator ( ++i, Less equal ( i, N ) And( Not(ret) ), \\\n           Let ( ret\u00a0:= Bit xor(i, [i] Get 'Tn\u00fameros') ) )\n   Clr all marks\n   Clear 'Tn\u00fameros'\n\nReturn 'Not (ret); And( Equals(i, Plus one(N)) ) '\n\nDefine ( Chequear si movimiento es v\u00e1lido )\nReturn 'Only one ( Equals (x, cero x), Equals(y, cero y ) )'\n\nDefine ( Mover las casillas )\n   If ( Equals (y, cero y) )\n      If ( Less (x, cero x) )      // mueve hacia abajo\n         Loop for ( i = cero x, #( i >= x ) , --i )\n             If ( Greater ( i, 1 ) )\n                 [{i} Minus(1), y] Get 'n\u00fameros', [i,y] Put 'n\u00fameros'\n             Else\n                 [{i} Plus(1), y] Get 'n\u00fameros', [i,y] Put 'n\u00fameros'\n             End If\n         Next\n      Else                         // por defecto: mueve hacia arriba\n         Loop for ( i = cero x, #( i <= x ) , ++i )\n             If ( Less ( i, 4 ) )\n                 [{i} Plus(1), y] Get 'n\u00fameros', [i,y] Put 'n\u00fameros'\n             Else\n                 [i,y] Get 'n\u00fameros', [{i} Minus(1),y] Put 'n\u00fameros'\n             End If\n         Next\n      End If\n      [x,y] Set '0', Put 'n\u00fameros'\n      Set 'x', Move to 'cero x'\n   Else                           // por defecto: est\u00e1 en la misma fila  \n      If ( Less ( y, cero y ) )   // mueve hacia la derecha\n         Loop for ( i = cero y, #( i >= y ) , --i )\n             If ( Greater ( i, 1) )\n                 [x, {i} Minus(1)] Get 'n\u00fameros', [x,i] Put 'n\u00fameros'\n             Else\n                 [x, y] Get 'n\u00fameros', [x, {i} Plus(1)] Put 'n\u00fameros'\n             End If\n         Next\n      Else                        // por defecto: mueve hacia la izquierda\n         Loop for ( i = cero y, #( i <= y ) , ++i )\n             If ( Less ( i, 4 ) )\n                 [x, {i} Plus(1)] Get 'n\u00fameros', [x,i] Put 'n\u00fameros'\n             Else\n                 [x,i] Get 'n\u00fameros', [x,{i} Minus(1)] Put 'n\u00fameros'\n             End If\n         Next\n      End If\n      [x,y] Set '0', Put 'n\u00fameros'\n      Set 'y', Move to 'cero y'\n   End If\n   Clr all marks\nReturn\n\n/* DESPLIEGUE DE CUADRITOS Y NUMEROS */\n\nDefine ( Imprime escenario )\n   Imprime las casillas\n   Imprime el \u00edndice en 'x,y'\n   Imprime la matriz\nReturn\n\nDefine ( Pone la matriz )\n   i=4, col = COLUMNA TABLA, celda=\"\"\n   Clr all marks\n   py=1\n   Loop\n      j=4, fil = FILA TABLA, px=1\n      Loop\n         Locate 'Plus one(fil), Plus two (col)' \n         Printnl( Get if ([px,py] Get 'n\u00fameros' ---Backup to (celda)---, celda, \"  \") )\n         fil += 3 \n         --j, ++px\n      Back if (j) is not zero\n      col += 6, --i, ++py\n   Back if (i) is not zero\nReturn\n\nDefine ( Pone las casillas )\n   i=4, col = COLUMNA TABLA\n   Clr all marks\n   Loop\n      j=4, fil = FILA TABLA\n      Loop\n         Set 'fil, col', Gosub 'Pone un cuadrito'\n         fil += 3, --j\n      Back if (j) is not zero\n      col += 6, --i\n   Back if (i) is not zero\nReturn\n\nDefine (Pone un cuadrito, fil, col)\n   Locate 'fil, col', Print table 'casilla'\nReturn\n\nDefine ( Pone el \u00edndice, fil, col )\n   /* 5+(fil-1)*3 fila\n      10+(col-1)*6 col */\n   Clr all marks\n   Locate 'Minus one(fil) Mul by (3) Plus (FILA TABLA), Minus one(col) Mulby(6) Plus(COLUMNA TABLA)' \n   Print table '\u00edndice'\nReturn\n\n/* CONFIGURACION DEL JUEGO */\n\nDefine ( Crea la matriz de n\u00fameros )\n   Sequence ( 0, 1, 16, n\u00fameros )\n   Gosub 'Barajar el array'\n   Redim ( n\u00fameros, 4,4 )\nReturn\n\n/* algoritmo de Fisher-Yates */\nDefine ( Barajar el array )\n  N = 0, Let ( N\u00a0:= Length(n\u00fameros) )\n  R = 0, aux = 0\n  Loop\n     Let (R\u00a0:= Ceil(Rand(N)))\n     Let (aux\u00a0:= [R] Get 'n\u00fameros' )\n     [N] Get 'n\u00fameros', [R] Put 'n\u00fameros'\n     Set 'aux', [N] Put 'n\u00fameros'\n     --N\n  Back if 'N' is positive\n  If ( [16] Get 'n\u00fameros' ---Backup to 'aux'---, Not (Is zero?) )\n     [aScan(1,0,n\u00fameros)] Set 'aux', Put 'n\u00fameros'\n     [16] Set '0', Put 'n\u00fameros'\n  End If\nReturn\n\nDefine ( Crea una casilla )\n   Set 'Utf8(Chr(218)),Utf8(Chr(196)),Utf8(Chr(196)),Utf8(Chr(196)),Utf8(Chr(196)),Utf8(Chr(191))', Apnd row 'casilla'\n   Set 'Utf8(Chr(179)),\" \",\" \",\" \",\" \",Utf8(Chr(179))', Apnd row 'casilla'\n   Set 'Utf8(Chr(192)),Utf8(Chr(196)),Utf8(Chr(196)),Utf8(Chr(196)),Utf8(Chr(196)),Utf8(Chr(217))', Apnd row 'casilla'\nReturn\n\nDefine ( Crea el \u00edndice )\n   Set 'Utf8(Chr(220)),Utf8(Chr(220)),Utf8(Chr(220)),Utf8(Chr(220)),Utf8(Chr(220)),Utf8(Chr(220))', Apnd row '\u00edndice'\n   Set 'Utf8(Chr(219)),\" \",\" \",\" \",\" \",Utf8(Chr(219))', Apnd row '\u00edndice'\n   Set 'Utf8(Chr(223)),Utf8(Chr(223)),Utf8(Chr(223)),Utf8(Chr(223)),Utf8(Chr(223)),Utf8(Chr(223))', Apnd row '\u00edndice'\nReturn",
        "safe": true
    },
    {
        "filename": "15 puzzle game_100.txt",
        "content": "> puz15(scramble.length=4)\n+----+----+----+----+ \n|  1 |  2 |  3 |  4 |\n+----+----+----+----+\n|  5 |  6 |  7 |  8 |\n+----+----+----+----+\n|  9 | 10 |    | 12 |\n+----+----+----+----+\n| 13 | 14 | 11 | 15 |\n+----+----+----+----+\nMove:w\n+----+----+----+----+ \n|  1 |  2 |  3 |  4 |\n+----+----+----+----+\n|  5 |  6 |  7 |  8 |\n+----+----+----+----+\n|  9 | 10 | 11 | 12 |\n+----+----+----+----+\n| 13 | 14 |    | 15 |\n+----+----+----+----+\nMove:a\n+----+----+----+----+ \n|  1 |  2 |  3 |  4 |\n+----+----+----+----+\n|  5 |  6 |  7 |  8 |\n+----+----+----+----+\n|  9 | 10 | 11 | 12 |\n+----+----+----+----+\n| 13 | 14 | 15 |    |\n+----+----+----+----+\n\n[1] \"You win!\"\n\n It took you 2 moves. \n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_101.txt",
        "content": "#lang racket/base\n(require 2htdp/universe 2htdp/image racket/list racket/match)\n\n(define ((fifteen->pict (finished? #f)) fifteen)\n  (for/fold ((i (empty-scene 0 0))) ((r 4))\n    (define row\n      (for/fold ((i (empty-scene 0 0))) ((c 4))\n        (define v (list-ref fifteen (+ (* r 4) c)))\n        (define cell\n          (if v\n              (overlay/align\n               \"center\" \"center\"\n               (rectangle 50 50 'outline (if finished? \"white\" \"blue\"))\n               (text (number->string v) 30 \"black\"))\n              (rectangle 50 50 'solid (if finished? \"white\" \"powderblue\"))))\n        (beside i cell)))\n    (above i row)))\n\n(define (move-space fifteen direction)\n  (define idx (for/first ((i (in-naturals)) (x fifteen) #:unless x) i))\n  (define-values (row col) (quotient/remainder idx 4))\n  (define dest (+ idx (match direction\n                        ['l #:when (> col 0) -1]\n                        ['r #:when (< col 3)  1]\n                        ['u #:when (> row 0) -4]\n                        ['d #:when (< row 3)  4]\n                        [else 0])))\n    (list-set (list-set fifteen idx (list-ref fifteen dest)) dest #f))\n\n(define (key-move-space fifteen a-key)\n  (cond [(key=? a-key \"left\") (move-space fifteen 'l)]\n        [(key=? a-key \"right\") (move-space fifteen 'r)]\n        [(key=? a-key \"up\") (move-space fifteen 'u)]\n        [(key=? a-key \"down\") (move-space fifteen 'd)]\n        [else fifteen]))\n\n(define (shuffle-15 fifteen shuffles)\n  (for/fold ((rv fifteen)) ((_ shuffles))\n    (move-space rv (list-ref '(u d l r) (random 4)))))\n\n(define fifteen0 '(1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 #f))\n\n(define (solved-world? w) (equal? w fifteen0))\n\n(big-bang (shuffle-15 fifteen0 200)\n          (name \"Fifteen\")\n          (to-draw (fifteen->pict))\n          (stop-when solved-world? (fifteen->pict #t))\n          (on-key key-move-space))\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_102.txt",
        "content": "use Term::termios;\n\nconstant $saved   = Term::termios.new(fd => 1).getattr;\nconstant $termios = Term::termios.new(fd => 1).getattr;\n# raw mode interferes with carriage returns, so\n# set flags needed to emulate it manually\n$termios.unset_iflags(<BRKINT ICRNL ISTRIP IXON>);\n$termios.unset_lflags(< ECHO ICANON IEXTEN ISIG>);\n$termios.setattr(:DRAIN);\n\n# reset terminal to original setting on exit\nEND { $saved.setattr(:NOW) }\n\nconstant n    = 4; # board size\nconstant cell = 6; # cell width\n\nconstant $top = join '\u2500' x cell, '\u250c', '\u252c' xx n-1, '\u2510';\nconstant $mid = join '\u2500' x cell, '\u251c', '\u253c' xx n-1, '\u2524';\nconstant $bot = join '\u2500' x cell, '\u2514', '\u2534' xx n-1, '\u2518';\n\nmy %dir = (\n   \"\\e[A\" => 'up',\n   \"\\e[B\" => 'down',\n   \"\\e[C\" => 'right',\n   \"\\e[D\" => 'left',\n);\n\nmy @solved = [1,2,3,4],[5,6,7,8],[9,10,11,12],[13,14,15,' '];\nmy @board;\nnew();\n\nsub new () {\n    loop {\n       @board = shuffle();\n       last if parity-ok(@board);\n   }\n}\n\nsub parity-ok (@b) {\n    my $row = @b.first(/' '/,:k);\n    my $col = @b[$row].first(/' '/,:k);\n    so ([3,3] <<->> [$row,$col]).sum\u00a0%% 2;\n}\n\nsub shuffle () {\n    my @c = [1,2,3,4],[5,6,7,8],[9,10,11,12],[13,14,15,' '];\n    for (^16).pick(*) -> $y, $x {\n        my ($yd, $ym, $xd, $xm) = ($y div n, $y mod n, $x div n, $x mod n);\n        @(@c[$ym;$yd],@c[$xm;$xd]) = @(@c[$xm;$xd],@c[$ym;$yd]);\n    }\n    @c;\n}\n\nsub row (@row) { '\u2502' ~ (join '\u2502', @row\u00bb.&center) ~ '\u2502' }\n\nsub center ($s){\n    my $c   = cell - $s.chars;\n    my $pad = ' ' x ceiling($c/2);\n    sprintf \"%{cell}s\", \"$s$pad\";\n}\n\nsub draw-board {\n    run('clear');\n    print qq:to/END/;\n\n\n\tPress direction arrows to move.\n\n\tPress q to quit. Press n for a new puzzle.\n\n\t$top\n\t{ join \"\\n\\t$mid\\n\\t\", map { .&row }, @board }\n\t$bot\n\n\t{ (so @board ~~ @solved)\u00a0?? 'Solved!!'\u00a0!! '' }\nEND\n}\n\nsub slide (@c is copy) {\n    my $t = (grep { /' '/ },\u00a0:k, @c)[0];\n    return @c unless $t and $t > 0;\n    @c[$t,$t-1] = @c[$t-1,$t];\n    @c;\n}\n\nproto sub move (|) {*};\n\nmulti move('up') {\n    map { @board[*;$_] = reverse slide reverse @board[*;$_] }, ^n;\n}\n\nmulti move('down') {\n    map { @board[*;$_] = slide @board[*;$_] }, ^n;\n}\n\nmulti move('left') {\n    map { @board[$_] = reverse slide reverse @board[$_] }, ^n;\n}\n\nmulti move('right') {\n    map { @board[$_] = slide @board[$_] }, ^n;\n}\n\nloop {\n    draw-board;\n\n    # Read up to 4 bytes from keyboard buffer.\n    # Page navigation keys are 3-4 bytes each.\n    # Specifically, arrow keys are 3.\n    my $key = $*IN.read(4).decode;\n\n    move %dir{$key} if so %dir{$key};\n    last if $key eq 'q'; # (q)uit\n    new() if $key eq 'n';\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_103.txt",
        "content": "\tPress direction arrows to move.\n\n\tPress q to quit. Press n for a new puzzle.\n\n\t\u250c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u2510\n\t\u2502  2   \u2502  1   \u2502  10  \u2502  14  \u2502\n\t\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\t\u2502  15  \u2502  11  \u2502  12  \u2502      \u2502\n\t\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\t\u2502  13  \u2502  3   \u2502  6   \u2502  7   \u2502\n\t\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\t\u2502  9   \u2502  4   \u2502  5   \u2502  8   \u2502\n\t\u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2518\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_104.txt",
        "content": "rebol []  random/seed now  g: [style t box red [\n  if not find [0x108 108x0 0x-108 -108x0] face/offset - e/offset [exit]\n  x: face/offset face/offset: e/offset e/offset: x] across\n] x: random repeat i 15 [append x:[] i]  repeat i 15 [\n  repend g ['t mold x/:i random white] if find [4 8 12] i [append g 'return]\n] append g [e: box]  view layout g\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_105.txt",
        "content": "Red [Needs: 'view]\nsystem/view/screens/1/pane/-1/visible?: false ;; suppress console window\n;; because this code is heavily influenced / (copied from ... )\n;; by the rebol version ( which actually works with red as well with\n;; some minimal changes ) i added some comments to make the\n;; code more readable...\n\n;;-----------------------------------------\n;; check, if puzzle is solved, OK button closes program\n;;-----------------------------------------\ncheck: does [\n;; the text on each tile must be equal to its position:\n  repeat pos 15 [ unless pos = to-integer lay/pane/:pos/text  [exit] ]\n  view/flags [  title \"SuCCeSS\" \n                 text \"You solved the puzzle\u00a0! \"  button \"OK\"  [quit]\n    ] [modal popup]    \n]\n;;--------------------------------------\n;; actually only changes text / Number on tile / button\n;;---------------------------------------\nchangeTiles: func [ f ][\n  ;; this is tricky, check if e(mpty) button is one in of the\n  ;; four valid positions , by simply subtracting their offsets...else exit ( no change)\n  unless find  [ 0x52 0x-52 52x0 -52x0 ] f/offset - e/offset [return false]\n  e/text: f/text  ;; empty button gets Number from clicked button\n  e/visible?: true  ;; empty gets visible\n  f/visible?: false ;; clicked button gets invisible\n  e: f    ;; e(mpty) refers now to clicked button\n  return true ;; true - change has happened\n]\n;;-----------------------------------------\n;; function which is executed, when button is clicked\n;; argument is face - button\n;;-------------------------------------\nbClicked: func [f][   if changeTiles f [check] ]\n \n;; define the window:\n;; style is a prototype definition for a button element\nwin:   [ title \"15 Puzzle\"\n\t\tbackdrop silver\n\t\tstyle btn: button 40x40  [bClicked face] font-size 15 bold \n]\n;; generate 1..15 buttons with number \nrepeat nr 15 [\n     repend win  [ 'btn form nr ] ;; repend reduces and then appends..\n     if  0 = mod nr 4  [  append win  'return ] ;; \"carriage return\" in window after 4 buttons\n\t]\n  ;; append empty / hidden button no 16 and return/quit button:\n\tappend win [ e: btn \"16\" hidden return  button \"Quit\" [quit]]\n   \nlay: layout win\n;; define win as layout, so  each button can now be addressed as\n;; layout/pane/index ( 1..15 - redbol is 1 based )\n\nflip: 0 \n;; start random generator, otherwise we always get the same puzzle\nrandom/seed now/time/precise \n;; lets flip random tiles a few times to initialize the puzzle\n;; ( actually numbers < 100 are quite easy to solve )\n\nwhile [ flip < 40 ] [ if changeTiles lay/pane/(random 16)  [ flip:  flip  + 1 ]  ]\n\n;; show the window...      \nview  lay\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_106.txt",
        "content": "/*REXX pgm implements the 15\u2500puzzle (AKA: Gem Puzzle, Boss Puzzle, Mystic Square, 14\u250015)*/\nparse arg N seed .                               /*obtain optional arguments from the CL*/\nif N=='' | N==\",\"  then N=4                      /*Not specified?  Then use the default.*/\nif datatype(seed, 'W')  then call random ,,seed  /*use repeatability seed for RANDOM BIF*/\nnh= N**2;   @.=;    nn= nh - 1;    w= length(nn) /*define/initialize some handy values. */\n$=                                               /*$: will hold the solution for testing*/\n       do i=1  for nn;  $= $  i                  /* [\u25c4]  build a solution for testing.  */\n       end   /*i*/\ndone= $                                          /* [\u2193]  scramble the tiles in puzzle.  */\n       do j=1  for nn;  a= random(1, words($) );    @.j= word($, a);   $= delword($, a, 1)\n       end   /*j*/\n                             /*\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550 play the 15\u2500puzzle 'til done or quit.*/\n   do  until puzz==done & @.nh==''               /*perform moves until puzzle is solved.*/\n   call getmv                                    /*get user's move(s)  and  validate it.*/\n   if errMsg\\==''  then do;  say sep errMsg;       iterate        /*possible error msg? */\n                        end\n   call showGrid 0                               /*don't display puzzle, just find hole.*/\n   if wordpos(x, !)==0  then do;  say sep  'tile '     x     \" can't be moved.\";   iterate\n                             end\n   @.hole= x;    @.tile=\n   call showGrid 0                               /*move specified tile \u2500\u2500\u2500\u25ba puzzle hole.*/\n   end   /*until*/           /*\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550*/\n\ncall showGrid 1;    say;     say sep  'Congratulations!   The'      nn\"-puzzle is solved.\"\nexit 0                                           /*stick a fork in it,  we're all done. */\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\ngetmv: x= 0;   sep= copies('\u2500', 8);     pad= left('', 1 + length(sep) )   /*pad=9 blanks*/\n       prompt= sep    'Please enter a tile number  or  numbers '     sep     \" (or Quit).\"\n       if queued()==0  then do;    say;    call showGrid 1;     say;      say prompt\n                            end\n       parse pull x . 1 ox . 1 . zx;   upper x   /*obtain a number (or numbers) from CL.*/\n       if abbrev('QUIT', x, 1)  then do;   say;   say;    say sep  \"quitting.\";      exit\n                                     end\n       if words(zx)>0  then do;  parse var  zx    xq;     queue xq\n                            end                  /* [\u2191]  Extra moves?  Stack for later. */\n              select                             /* [\u2193]  Check for possible errors/typos*/\n              when x==''              then errMsg= \"nothing entered.\"\n              when \\datatype(x, 'N')  then errMsg= \"tile number isn't numeric: \"        ox\n              when \\datatype(x, 'W')  then errMsg= \"tile number isn't an integer: \"     ox\n              when x=0                then errMsg= \"tile number can't be zero: \"        ox\n              when x<0                then errMsg= \"tile number can't be negative: \"    ox\n              when x>nn               then errMsg= \"tile number can't be greater than\"  nn\n              otherwise                    errMsg=\n              end   /*select*/                   /* [\u2191]  verify the human entered data. */\n       return\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nshowGrid: parse arg show;       !.=;                      x= x/1;       #= 0;        puzz=\n          top= '\u2554'copies( copies(\"\u2550\", w)'\u2566', N);        top= left( top, length(top) -1)\"\u2557\"\n          bar= '\u2560'copies( copies(\"\u2550\", w)'\u256c', N);        bar= left( bar, length(bar) -1)\"\u2563\"\n          bot= '\u255a'copies( copies(\"\u2550\", w)'\u2569', N);        bot= left( bot, length(bot) -1)\"\u255d\"\n          if show  then say pad top\n\n               do   r=1  for N;     z= '\u2551'\n                 do c=1  for N;     #= #+1;     y= @.#;      puzz= puzz y;        !.r.c= y\n                 _= right(@.#, w)\"\u2551\";           z= z || _              /* [\u2193]  find hole*/\n                 if @.# == ''  then do;    hole= #;     holeRow= r;     holeCol= c;    end\n                 if @.# == x   then do;    tile= #;     tileRow= r;     tileCol= c;    end\n                 end   /*c*/                                           /* [\u2191]  find  X. */\n               if show  then do;    say pad z;     if r\\==N  then say pad bar;         end\n               end     /*r*/\n\n          rm=holeRow-1;   rp=holeRow+1;  cm=holeCol-1;  cp=holeCol+1   /*possible moves.*/\n          !=!.rm.holeCol  !.rp.holeCol   !.holeRow.cm   !.holeRow.cp   /* legal   moves.*/\n          if show  then say pad bot;                  return\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_107.txt",
        "content": "           \u2554\u2550\u2550\u2566\u2550\u2550\u2566\u2550\u2550\u2566\u2550\u2550\u2557\n           \u255110\u2551 7\u2551 8\u255111\u2551\n           \u2560\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u2563\n           \u2551 4\u2551 3\u255115\u2551 1\u2551\n           \u2560\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u2563\n           \u2551 9\u255112\u2551 2\u255113\u2551\n           \u2560\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u2563\n           \u255114\u2551 5\u2551 6\u2551  \u2551\n           \u255a\u2550\u2550\u2569\u2550\u2550\u2569\u2550\u2550\u2569\u2550\u2550\u255d\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a tile number  or  numbers  \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500  (or Quit).\n13                           \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input. \n           \u2554\u2550\u2550\u2566\u2550\u2550\u2566\u2550\u2550\u2566\u2550\u2550\u2557\n           \u255110\u2551 7\u2551 8\u255111\u2551\n           \u2560\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u2563\n           \u2551 4\u2551 3\u255115\u2551 1\u2551\n           \u2560\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u2563\n           \u2551 9\u255112\u2551 2\u2551  \u2551\n           \u2560\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u2563\n           \u255114\u2551 5\u2551 6\u255113\u2551\n           \u255a\u2550\u2550\u2569\u2550\u2550\u2569\u2550\u2550\u2569\u2550\u2550\u255d\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a tile number  or  numbers  \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500  (or Quit).\n1  15  3                     \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input. \n           \u2554\u2550\u2550\u2566\u2550\u2550\u2566\u2550\u2550\u2566\u2550\u2550\u2557\n           \u255110\u2551 7\u2551 8\u255111\u2551\n           \u2560\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u2563\n           \u2551 4\u2551  \u2551 3\u255115\u2551\n           \u2560\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u2563\n           \u2551 9\u255112\u2551 2\u2551 1\u2551\n           \u2560\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u2563\n           \u255114\u2551 5\u2551 6\u255113\u2551\n           \u255a\u2550\u2550\u2569\u2550\u2550\u2569\u2550\u2550\u2569\u2550\u2550\u255d\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a tile number  or  numbers  \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500  (or Quit).\nquit                         \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input. \n\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 quitting.\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_108.txt",
        "content": "# Project\u00a0: CalmoSoft Fifteen Puzzle Game \n# Date   \u00a0: 2018/12/01\n# Author \u00a0: Gal Zsolt (CalmoSoft), Bert Mariani\n# Email  \u00a0: calmosoft@gmail.com\n\nload \"guilib.ring\"\n\napp1 = new qapp {\n\n        stylefusionblack()\n        empty = 16  \n        nr_moves = 0\n        nr_sleep = 1\n        button_size = 4 \n        current_button = 4\n        temp = 0\n        flag_init = 0\n        flag_save = 0\n        flag_move = 0\n        button = list(52)   \n        size_button = list(7)\n        table1 = [] \n        table2 = [] \n        table3 = []\n        n_degree = 0\n        nr_degree = [0,90,180,270 ,-90,-180,-270]\n        n_degreeRight = 0\n        n_degreeLeft = 0\n        btn_degree = newlist(52,2)\n        counter_man = 0 \n        t1 = 0\n\n        win1 = new qwidget() {\n                   move(0,0)\n                   resize(380,760)\n                   setwindowtitle(\"CalmoSoft Fifteen Puzzle Game\")\n\n                  for n=1 to 52\n                        for m=1 to 2\n                             btn_degree[n][m] = 0\n                        next\n                  next \n\n                   for n = 4 to 7\n                               size_button[n] = new qpushbutton(win1)   \n                               {\n                                                  col = n%4\n                                                  setgeometry(100+col*40,60,40,40)\n                                                  settext(string(n) + \"x\" + string(n))\n                                                  setclickevent(\"newsize(\" + string(n) + \")\")\n                               } \n                   next    \n\n                  btnMoves = new qpushbutton(win1)\n                  {\n                                 setgeometry(100,260,80,40)\n                                 settext(\"0\")\n                                 show() \n                  }\n\n                   scramblebtn = new qpushbutton(win1)\n                   {\n                                         setgeometry(100,300,160,40)\n                                         settext(\"Scramble\")\n                                         setclickevent(\"scramble()\")                        \n                   }\n\n                   resetbtn = new qpushbutton(win1)   \n                   {\n                                    setgeometry(100,340,160,40)\n                                    settext(\"Reset\")\n                                    setclickevent(\"resettiles()\")\n                   }\n\n                   savebtn = new qpushbutton(win1)   \n                   {\n                                   setgeometry(100,380,160,40)  \n                                   settext(\"Save Game\")  \n                                   setclickevent(\"pSave()\")\n                   }\n\n                   playbtn = new qpushbutton(win1)   \n                   {\n                                   setgeometry(100,420,160,40)  \n                                   settext(\"Resume Game\")  \n                                   setclickevent(\"pPlay()\")\n                   }\n\n                   sleepbtn = new qpushbutton(win1)   \n                   {\n                                   setgeometry(100,460,160,40)  \n                                   settext(\"Sleep Time: \")  \n\n                   }\n\n                  decbtn = new qpushbutton(win1)   \n                  {\n                               setgeometry(220,460,40,40)  \n                               settext(\"<-\")  \n                               setclickevent(\"pDecSleep()\")\n                  }\n\n                  incbtn = new qpushbutton(win1)   \n                  {\n                               setgeometry(260,460,40,40)  \n                               settext(\"->\")  \n                               setclickevent(\"pIncSleep()\")\n                  }\n\n                 rightbtn = new qpushbutton(win1)   \n                 {\n                               setgeometry(100,500,160,40)  \n                               settext(\"In the Right Place\u00a0: \")  \n                 }\n\n                 timebtn = new qpushbutton(win1)   \n                 {\n                               setgeometry(100,540,160,40)  \n                               settext(\"Elapsed Time\u00a0: \")  \n                 }\n\n                TimerMan = new qtimer(win1)\n               {\n                                  setinterval(500)\n                                  settimeoutevent(\"pTime()\")\n                                  stop()\n               }\n              newsize(4) \n              show()\n        }\n        exec()\n}\n\nFunc newlist x, y\n     if isstring(x) x=0+x ok\n     if isstring(y) y=0+y ok\n     alist = list(x)\n     for t in alist\n         t = list(y)\n     next\n     return alist\n\nfunc scramble\n       for n= 1 to 1000   \n            current_button=random(button_size*button_size-1)+1\n            up = (empty = (current_button - button_size))\n            down = (empty = (current_button + button_size))\n            left = ((empty = (current_button - 1)) and ((current_button\u00a0% button_size)\u00a0!= 1))\n            right = ((empty = (current_button + 1)) and ((current_button\u00a0% button_size)\u00a0!= 0))\n            move = up or down or left  or right\n            if move = 1 \n               button[current_button] { temp2 = text() }\n               col = empty%button_size\n               if col = 0 col = button_size ok\n               row = ceil(empty/button_size)\n               button[empty] {\n                       setgeometry(60+col*40,60+row*40,40,40)\n                       rnd = random(6)+1\n                       n_degree = nr_degree[rnd]\n                       button[empty].setbuttoncolor(\"yellow\")\n                       button[empty].settext(temp2)\n                       button[empty].setClickEvent(\"movetile(\" + string(empty) +\")\")\n                       btn_degree[empty] [1] = temp2\n                       btn_degree[empty] [2] = n_degree\n                       }\n               button[current_button].setbuttoncolor(\"yellow\")\n               btn_degree[current_button][2] = 0\n               button[current_button]{settext(\"\")}\n               empty = current_button\n            ok\n       next\n       button[button_size*button_size+2]{settext(\"Here\")}\n       for n=1 to button_size*button_size\n             button[n].setbuttoncolor(\"yellow\")\n       next\n       table1 = []\n       table2 = []\n       table3 = []   \n       for n = 1 to button_size*button_size\n             add(table1, button[n].text())\n             add(table2, button[n].text())\n             add(table3, string(btn_degree[n][2]))\n       next\n       add(table1, string(empty))\n       add(table2, string(empty))\n       add(table3, string(empty))\n       add(table1, \"OK\")\n       add(table2, \"OK\")\n       add(table3, \"OK\")\n       flag_save = 0\n       flag_move = 0\n       nr_moves = 0\n       btnMoves.settext(string(nr_moves))\n       timebtn.settext(\"Elapsed Time\u00a0: \")\n       t1 = clock()\n       rightPlace()\n       return\n\nfunc movetile current_button2\n       if (current_button2 = button_size*button_size-1 and button[current_button2].text() = \"In\")\n           pBack()\n       else\n           see char(7)\n           up = (empty = (current_button2 - button_size))\n           down = (empty = (current_button2 + button_size))\n           left = ((empty = (current_button2- 1)) and ((current_button2\u00a0% button_size)\u00a0!= 1))\n           right = ((empty = (current_button2 + 1)) and ((current_button2\u00a0% button_size)\u00a0!= 0))\n           move = up or down or left  or right\n           if move = 1 \n              temp2 = button[current_button2].text() \n              btn_degree[empty][1] = temp2\n              add(table1, temp2)\n              add(table2, string(current_button2))              \n              col = empty%button_size\n              if col = 0 col = button_size ok\n              row = ceil(empty/button_size)\n              button[empty] {\n                                   setgeometry(60+col*40,60+row*40,40,40)\n                                   n_degree = btn_degree[current_button2][2]\n                                   btn_degree[empty][2] = n_degree\n                                   button[empty].setbuttoncolor(\"orange\")\n                                   button[empty].settext(temp2)                                   \n              }\n              add(table3, string(n_degree))\n              button[current_button2].setbuttoncolor(\"cyan\")\n              button[current_button2]{settext(\"\")}\n              empty = current_button2\n              nr_moves = nr_moves + 1\n              btnMoves.settext(string(nr_moves))\n              isGameOver()\n           ok\n      ok \n      flag_move = 1\n      pElapsedTime()\n      rightPlace()\n      return\n\nfunc resettiles\n        n_degree = 0  \n        empty = button_size*button_size\n        for empty = 1 to button_size*button_size-1\n             btn_degree[empty][2] = 0\n             n_degree = 0\n             btn_degree[empty][1] = string(empty)\n             button[empty].setstylesheet(\"background-color:yellow\")\n             button[empty] {settext(string(empty))}\n        next\n        button[button_size*button_size].setstylesheet(\"background-color:yellow\")\n        button[button_size*button_size] {settext(\"\")}\n        table1 = []\n        table2 = []\n        table3 = []   \n        for n = 1 to button_size*button_size\n             add(table1, button[n].text())\n             add(table2, button[n].text())\n             add(table3, string(btn_degree[n][2]))\n        next\n        add(table1, string(empty))\n        add(table2, string(empty))\n        add(table3, string(empty))\n        add(table1, \"OK\")\n        add(table2, \"OK\")\n        add(table3, \"OK\")\n        flag_save = 0\n        flag_move = 0\n        nr_moves = 0\n        btnMoves.settext(string(nr_moves))\n        timebtn.settext(\"Elapsed Time\u00a0: \")\n        t1 = clock()\n        rightPlace()\n        return\n\nfunc pHere\n        if button[button_size*button_size-1].text()\u00a0!= \"\" and button[button_size*button_size+2].text() = \"Here\"\n           button[button_size*button_size-1] { temp = text() }\n           button[button_size*button_size+2].close()\n           button[button_size*button_size+2] = new ButtonWithRotatedText(win1)\n           button[button_size*button_size+2] {\n           setgeometry(60+(button_size-1)*40,60+(button_size+1)*40,40,40)\n           setstylesheet(\"background-color:yellow\")\n           btn_degree[button_size*button_size+2][2] = btn_degree[button_size*button_size-1][2]\n           n_degree = btn_degree[button_size*button_size+2][2]\n           emptysave = empty\n           empty = button_size*button_size+2\n           btn_degree[empty][1] = temp\n           settext(temp)\n           }\n           n_degree = 0\n           empty = button_size*button_size-1\n           btn_degree[empty][1] = \"In\"\n           button[button_size*button_size-1]{settext(\"In\")}\n           for n = 1 to button_size*button_size\n\t   button[n].setenabled(false)\n           next\n           button[button_size*button_size-1].setenabled(true)\n           scramblebtn.setenabled(false)\n           resetbtn.setenabled(false)\n           savebtn.setenabled(false)\n           playbtn.setenabled(false)\n           empty = emptysave\n        ok\n\nfunc pBack\n        button[button_size*button_size+2] { temp = text() }\n        n_degree = btn_degree[button_size*button_size+2][2]\n        btn_degree[button_size*button_size-1][2] = btn_degree[button_size*button_size+2][2]\n        emptysave = empty\n        empty = button_size*button_size-1\n        btn_degree[empty][1] = temp\n        button[button_size*button_size-1] {settext(temp)}\n        button[button_size*button_size+2].close()\n        button[button_size*button_size+2] = new qpushbutton(win1)\n                {\n                setgeometry(60+(button_size-1)*40,60+(button_size+1)*40,40,40)\n                settext(\"Here\")\n                setclickevent(\"pHere()\")   \n                show() \n                } \n        for n = 1 to button_size*button_size\n              button[n].setenabled(true)\n        next\n        scramblebtn.setenabled(true)\n        resetbtn.setenabled(true)\n        savebtn.setenabled(true)\n        playbtn.setenabled(true)\n        empty = emptysave\n        isGameOver()\n\nfunc rotateleft\n        if button[button_size*button_size+2].text()\u00a0!= \"Here\" \n           button[button_size*button_size+2].close()\n           button[button_size*button_size+2] = new ButtonWithRotatedText(win1)\n                      button[button_size*button_size+2] {\n                      setgeometry(60+(button_size-1)*40,60+(button_size+1)*40,40,40)\n                      setstylesheet(\"background-color:yellow\")\n                      n_degreeLeft = (n_degreeLeft-90)%360\n                      n_degree = n_degreeLeft\n                      btn_degree[button_size*button_size+2][2] = n_degree\n                      emptysave = empty\n                      empty = button_size*button_size+2\n                      btn_degree[empty][1] = temp\n                      button[button_size*button_size+2]{settext(temp)}\n                      } \n                      empty = emptysave\n        ok\n\nfunc rotateright\n        if button[button_size*button_size+2].text()\u00a0!= \"Here\"  \n           button[button_size*button_size+2].close()\n           button[button_size*button_size+2] = new ButtonWithRotatedText(win1)\n                      button[button_size*button_size+2] {\n                      setgeometry(60+(button_size-1)*40,60+(button_size+1)*40,40,40)\n                      setstylesheet(\"background-color:yellow\")\n                      n_degreeRight = (n_degreeRight+90)%360\n                      n_degree = n_degreeRight\n                      btn_degree[button_size*button_size+2][2] = n_degree\n                      emptysave = empty\n                      empty = button_size*button_size+2\n                      btn_degree[empty][1] = temp\n                      button[button_size*button_size+2]{settext(temp)}\n                      }\n                      empty = emptysave\n        ok\n\nfunc newsize current_button\n        win1{ \n                sizenew = current_button%4\n                win1.resize(360+sizenew*40,640+sizenew*40)\n                if flag_init\u00a0!= 0\n                   for nb = 1 to button_size*button_size+3\n                         button[nb] {close()}\n                   next\n                   btnMoves.close()\n                ok\n                scramblebtn.close()\n                resetbtn.close()\n                savebtn.close()\n                playbtn.close()\n                btnMoves.close()\n                sleepbtn.close()\n                decbtn.close()\n                incbtn.close()\n                rightbtn.close()\n                timebtn.close()\n\n                for n = 1 to current_button*current_button\n                     col = n%current_button\n                     if col = 0 col = current_button ok\n                     row = ceil(n/current_button)\n                     button[n] = new ButtonWithRotatedText(win1)\n                                       button[n] {\n                                       setgeometry(60+col*40,60+row*40,40,40)\n                                       button[n].setbuttoncolor(\"yellow\")                                       \n                                       n_degree = 0\n                                       if n < current_button*current_button\n                                          button[n].settext(string(n))\n                                       but n = current_button*current_button\n                                          button[n].settext(\"\")\n                                       ok \n                                       setClickEvent(\"movetile(\" + string(n) +\")\")\n                                       }\n                next\n\n                btnMoves = new qpushbutton(win1)\n                {\n                                        setgeometry(100,60+(current_button+1)*40,(current_button-3)*40,40)\n                                        setStyleSheet(\"text-align:center\")\n                                        settext(\"0\")\n                                        show() \n                }\n\n                button[current_button*current_button+1] = new qpushbutton(win1)\n                {\n                                              setgeometry(60+(current_button-2)*40,60+(current_button+1)*40,40,40)\n                                              settext(\"<-\")\n                                              setclickevent(\"rotateLeft()\")   \n                                              show() \n                } \n\n                button[current_button*current_button+2] = new qpushbutton(win1)\n                {\n                                             setgeometry(60+(current_button-1)*40,60+(current_button+1)*40,40,40)\n                                             settext(\"Here\")\n                                             setclickevent(\"pHere()\")   \n                                             show() \n                }\n\n                button[current_button*current_button+3] = new qpushbutton(win1)\n                {\n                                             setgeometry(60+current_button*40,60+(current_button+1)*40,40,40)\n                                             settext(\"->\")\n                                             setclickevent(\"rotateRight()\")   \n                                             show() \n                 }\n\n                scramblebtn = new qpushbutton(win1)\n                {\n                                      setgeometry(100,100+(current_button+1)*40,current_button*40,40)\n                                      settext(\"Scramble\")\n                                      setclickevent(\"scramble()\")\n                                      show()                        \n                }\n\n                resetbtn = new qpushbutton(win1)   \n                {\n                                 setgeometry(100,100+(current_button+2)*40,current_button*40,40)\n                                 settext(\"Reset\")\n                                 setclickevent(\"resettiles()\")\n                                 show() \n                }\n\n                savebtn = new qpushbutton(win1)   \n                {\n                                 setgeometry(100,100+(current_button+3)*40,current_button*40,40)\n                                 settext(\"Save Game\")\n                                 setclickevent(\"pSave()\")\n                                 show() \n                }\n\n                playbtn = new qpushbutton(win1)   \n                {\n                               setgeometry(100,100+(current_button+4)*40,current_button*40,40)  \n                               settext(\"Resume Game\")  \n                               setclickevent(\"pPlay()\")\n                               show()\n                }\n\n                sleepbtn = new qpushbutton(win1)   \n                {\n                               setgeometry(100,100+(current_button+5)*40,(current_button-2)*40,40)  \n                               settext(\"Sleep Time: \" + string(nr_sleep) + \" s\")  \n                               show()\n                }\n\n                decbtn = new qpushbutton(win1)   \n                {\n                               setgeometry(100+(current_button-2)*40,100+(current_button+5)*40,40,40)  \n                               settext(\"<-\")  \n                               setclickevent(\"pDecSleep()\")\n                               show()\n                }\n\n                incbtn = new qpushbutton(win1)   \n                {\n                               setgeometry(100+(current_button-1)*40,100+(current_button+5)*40,40,40)  \n                               settext(\"->\")  \n                               setclickevent(\"pIncSleep()\")\n                               show()\n                }\n\n               rightbtn = new qpushbutton(win1)   \n                {\n                               setgeometry(100,100+(current_button+6)*40,current_button*40,40)  \n                               settext(\"In the Right Place\u00a0: \")  \n                               show()\n                }\n\n                timebtn = new qpushbutton(win1)   \n                {\n                               setgeometry(100,100+(current_button+7)*40,current_button*40,40)  \n                               settext(\"Elapsed Time\u00a0: \")  \n                               show()\n                }\n\n                table1 = []\n                table2 = []\n                table3 = []   \n                for n = 1 to button_size*button_size\n                      add(table1, button[n].text())\n                      add(table2, button[n].text())\n                      add(table3, string(0))\n                next\n                add(table1, string(empty))\n                add(table2, string(empty))\n                add(table3, string(empty))\n                add(table1, \"OK\")\n                add(table2, \"OK\")\n                add(table3, \"OK\")\n                empty = current_button*current_button\n                button_size = current_button\n                flag_init = 1\n                flag_save = 0\n                flag_move = 0\n                nr_moves = 0\n                timebtn.settext(\"Elapsed Time\u00a0: \")\n                t1 = clock()\n                scramble()\n                }\n\nfunc pSave\n        textedit1 = list2str(table1)\n        textedit2 = list2str(table2)\n        textedit3 = list2str(table3)\n        chdir(currentdir())\n        cName1 = \"CalmoSoftPuzzle1.txt\"\n        cName2 = \"CalmoSoftPuzzle2.txt\"\n        cName3 = \"CalmoSoftPuzzle3.txt\"\n        write(cName1,textedit1)\n        write(cName2,textedit2)\n        write(cName3,textedit3)\n         flag_save = 1   \n         timebtn.settext(\"Elapsed Time\u00a0: \")\n         t1 = clock()\n         return\n\nfunc pPlay\n        if  flag_save = 0 or flag_move = 0\n            warning()  \n        else\n           chdir(currentdir())\n           cName1 = \"CalmoSoftPuzzle1.txt\"\n           textedit1 = read(cName1)\n           table1 = str2list(textedit1)\n           cName2 = \"CalmoSoftPuzzle2.txt\"\n           textedit2 = read(cName2)\n           table2 = str2list(textedit2)\n           cName3 = \"CalmoSoftPuzzle3.txt\"\n           textedit3 = read(cName3)\n           table3 = str2list(textedit3)\n           for empty = 1 to button_size*button_size\n                button[empty].setbuttoncolor(\"yellow\") \n                n_degree = number(table3[empty])\n                btn_degree[empty][1] = table1[empty]\n                button[empty] {settext(table1[empty])}\n           next\n           empty = number(table1[button_size*button_size + 1])\n           counter_man = button_size*button_size+2\n           nr_moves = 0\n           t1 = clock()\n           TimerMan.start()\n       ok\n\nfunc pTime()\n        if flag_save = 0 or flag_move = 0\n           warning()    \n        else\n           counter_man++\n           pPlaySleep()\n           sleep(nr_sleep*1000) \n           pElapsedTime()\n           if counter_man = len(table1)\n              TimerMan.stop()\n           ok\n        ok\n\nfunc pPlaySleep\n        see char(7)\n        value = table1[counter_man]\n        place = table2[counter_man]\n        n_degree = number(table3[counter_man])\n        btn_degree[empty][1] = value\n        button[empty].setbuttoncolor(\"orange\")\n        button[empty] {settext(value)}\n        n_degree = 0\n        button[number(place)].setbuttoncolor(\"cyan\")\n        button[number(place)] {settext(\"\")}\n        empty = number(place)        \n        nr_moves = nr_moves + 1\n        btnMoves.settext(string(nr_moves))\n\nfunc pIncSleep\n        nr_sleep = nr_sleep + 1 \n        sleepbtn.settext(\"Sleep Time: \" + string(nr_sleep) + \" s\")\n\nfunc pDecSleep\n        if nr_sleep > 1 \n           nr_sleep = nr_sleep - 1\n           sleepbtn.settext(\"Sleep Time: \" + string(nr_sleep) + \" s\")\n        ok\n\nfunc sleep(x)\n        nTime = x \n        oTest = new qTest\n        oTest.qsleep(nTime)\n        return\n\nfunc isGameOver\n        flagend = 1\n        for n=1 to button_size*button_size-1\n              if button[n].text()\u00a0!= n or btn_degree[n][2]\u00a0!= 0\n                 flagend = 0\n                 exit\n              ok\n        next\n        if flagend = 1\n           new qmessagebox(win1) {\n                   setwindowtitle(\"Game Over\") \n                   settext(\"Congratulations!\")\n                   show()\n                   }   \n        ok   \n\nfunc rightPlace\n        count = 0\n        for n=1 to button_size*button_size\n             if button[n].text() = n and btn_degree[n][2] = 0\n                count = count + 1\n             ok\n        next   \n        rightbtn.settext(\"In the Right Place\u00a0: \" + count)\n\nfunc warning\n        new qmessagebox(win1) {\n                setwindowtitle(\"Warning!\") \n                settext(\"First you must play and save the game.\")\n                show()\n                }         \n\nfunc pElapsedTime\n        t2 = (clock() - t1)/1000\n        timebtn.settext(\"Elapsed Time\u00a0: \" + t2 + \" s\")\n\nClass ButtonWithRotatedText\n\n         oButton oLabel  cText=\"We are here\"  n_degree = 30  nTransX = 50   nTransY = 0\n\nfunc init( oParent)\n        oButton = new qPushButton(oParent)\n        oLabel  = new qLabel(oParent)\n        oLabel.setAttribute(Qt_WA_TransparentForMouseEvents,True)\n        oLabel.setAttribute(Qt_WA_DeleteOnClose, True)\n        oButton.setAttribute(Qt_WA_DeleteOnClose, True)\n        oButton.Show()\n        return\n    \nfunc close()\n        oLabel.close()\n        oButton.close()\n        return\n\nfunc setstylesheet(x)\n        oButton.setstylesheet(x)\n\nfunc setgeometry( x,y,width,height)\n        oButton.setgeometry(x,y,width,height)\n        oLabel.setgeometry( x,y,width,height)\n        \nfunc setText( cValue)\n        cText = cValue\n        return\n    \nfunc Text() \n         return cText\n\nfunc setTranslate( x,y )    \n         nTransX = x\n         nTransY = y\t\t\n         return\n\nfunc TranslateOffsetX()\n        return nTransX \n\nfunc TranslateOffsetY()\n        return nTransY \n\t\nfunc setRotation_degree( nValue)\n        n_degree = nValue\n        return\n    \nfunc Rotation_degree()\n        return n_degree\n\nfunc setClickEvent( cEvent)\n        oButton.setClickEvent(cEvent)\n        return\n    \nfunc braceend()\n        draw() \n        return\n\nfunc setEnabled(value)        \n        oButton.setenabled(value)\n        return\t\n\n func setButtonColor(color)  \n         colorIt = \"background-color:\" + color  \n         oButton.setstylesheet(colorIt) \n         return\n    \t\nfunc draw()\n         picture = new qpicture()\n         color   = new qcolor() { setrgb(0,0,255,255) }\n         pen     = new qpen()   { setcolor(color) setwidth(10) }\n                    \n         painter = new qpainter() \n         {\n                       begin(picture)        \n                       setpen(pen)\n                       oFont = new qfont(\"Courier New\",12,75,0)\n                       oFont.setpointsize(20)\n                       setfont(oFont)\n                       if n_degree = 0\n                          if btn_degree[empty] [1]=\"In\" p1 = -8 p2=0 \n                          translate(p1,p2) ok ok\n                       if n_degree = 0\n                          if btn_degree[empty] [1]<10 p1 = 10 p2=10 else p1=5 p2=10 ok\n                          translate(p1,p2)\n                       but n_degree = 90\n                             if btn_degree[empty] [1]<10 p=-10 else p=-15 ok\n                             translate(10,p)\n                       but n_degree = 180\n                              if btn_degree[empty] [1]<10 p1= 30 p2=-10 else p1=35 p2=-10 ok\n                              translate(p1,p2)\n                       but n_degree = 270\n                             if btn_degree[empty] [1]<10 p=10 else p=15 ok\n                             translate(30,p)\n                       but n_degree = -90\n                             if btn_degree[empty] [1]<10 p=10 else p=15 ok\n                             translate(30,p)\n                       but n_degree = -180\n                              if btn_degree[empty] [1]<10 p1=30 p2=-10 else p1=35 p2=-10 ok\n                              translate(p1,p2)\n                       but n_degree = -270\n                             if btn_degree[empty] [1]<10 p1=10 p2=-10 else p1=10 p2=-15 ok\n                             translate(p1,p2)\n                       ok\t\t\t\t\t\t\n                       rotate(n_degree)\n\t          drawtext(0,0,this.Text())   \n                       endpaint()\n         }\n         oLabel {\n                    setpicture(picture)  \n                     show() \n                    }\n         return",
        "safe": true
    },
    {
        "filename": "15 puzzle game_109.txt",
        "content": "/*\n**\n**\tGame  \t\t\t\u00a0: CalmoSoft Fifteen Puzzle Game 3D \n**\tDate   \t\t\t\u00a0: 2017/09/01\n**  Author \t\t\t\u00a0: CalmoSoft <calmosoft@gmail.com>, Mahmoud Fayed\n**\n*/\n\n# Load Libraries\nload \"gamelib.ring\"\t\t# RingAllegro Library\nload \"opengl21lib.ring\"\t# RingOpenGL  Library\n\nbutSize = 3\ntexture = list(9)\ncube = list(9)\nrnd = list(9)\nrndok = 0\n\nfor n=1 to 9\n     rnd[n] = 0\nnext \n\nfor n=1 to 9\n     while true\n               rndok = 0\n               ran = random(8) + 1\n               for nr=1 to 9\n                     if rnd[nr] = ran\n                        rndok = 1\n                     ok\n               next  \n               if rndok = 0\n                  rnd[n] = ran\n                  exit\n               ok \n     end\nnext \n\nfor n=1 to 9\n     if rnd[n] = 9\n        empty = n\n     ok\nnext \n\n#==============================================================\n# To Support MacOS X\n\tal_run_main()\t\n\tfunc al_game_start \t# Called by al_run_main()\n\t\tmain()\t\t# Now we call our main function\n#==============================================================\n\nfunc main\n\tnew TicTacToe3D {\n\t\tstart()\n\t}\n\nclass TicTacToe3D from GameLogic\n\n\tFPS = 60\n\tTITLE = \"CalmoSoft Fifteen Puzzle Game 3D\"\n\n\toBackground = new GameBackground\n\toGameSound = new GameSound\n\toGameCube = new GameCube\n\toGameInterface = new GameInterface \n\n\tfunc loadresources\n\t\toGameSound.loadresources()\n\t\toBackGround.loadresources()\n\t\toGameCube.loadresources()\n\n\tfunc drawScene\n\t\toBackground.update()\n\t\toGameInterface.update(self)\n\n\tfunc MouseClickEvent\n\t\toGameInterface.MouseClickEvent(self)\n\nclass GameInterface \n\n\tfunc Update oGame\n\t\tprepare()\n\t\tcubes(oGame)\n\n\tfunc Prepare \n\t\tw = 1024 h = 768\n\t\tratio =  w / h\n\t\tglViewport(0, 0, w, h)\n\t\tglMatrixMode(GL_PROJECTION)\n\t\tglLoadIdentity()\n\t\tgluPerspective(-120,ratio,1,120)\n\t\tglMatrixMode(GL_MODELVIEW)\n\t\tglLoadIdentity()\n\t\tglEnable(GL_TEXTURE_2D)\t\t\t\t\t\t\t\n\t\tglShadeModel(GL_SMOOTH)\t\t\n\t\tglClearColor(0.0, 0.0, 0.0, 0.5)\n\t\tglClearDepth(1.0)\t\t\t\n\t\tglEnable(GL_DEPTH_TEST)\t\n\t\tglEnable(GL_CULL_FACE)\n\t\tglDepthFunc(GL_LEQUAL)\n\t\tglHint(GL_PERSPECTIVE_CORRECTION_HINT, GL_NICEST)\n\n\tfunc Cubes oGame\n\t\toGame.oGameCube {\n\t\taGameMap = oGame.aGameMap \n                cube[1] = cube( 5  , -3 , -5  , texture[rnd[1]] )\n\t\tcube[2] = cube( 0  , -3 , -5  , texture[rnd[2]] )\n\t\tcube[3] = cube( -5 , -3 , -5  , texture[rnd[3]] )\n\t\tcube[4] = cube( 5  , 1  , -5  , texture[rnd[4]] )\n\t\tcube[5] = cube( 0  , 1  , -5  , texture[rnd[5]] )\n\t\tcube[6] = cube( -5 , 1  , -5  , texture[rnd[6]] )\n\t\tcube[7] = cube( 5  , 5  , -5  , texture[rnd[7]] )\n\t\tcube[8] = cube( 0  , 5  , -5  , texture[rnd[8]] )\n\t\tcube[9] = cube( -5 , 5  , -5  , texture[rnd[9]] )\n \t\trotate()\n\t\t}\n\n\tfunc MouseClickEvent oGame\n\t\toGame {\n\t\t\taBtn = Point2Button(Mouse_X,Mouse_Y)\n                        move = 0\n\t\t\tnRow = aBtn[1]\n\t\t\tnCol = aBtn[2]\n                        tile = (nRow-1)*3 + nCol\n                        up = (empty = (tile - butSize))\n                        down = (empty = (tile + butSize))\n                        left = ((empty = (tile- 1)) and ((tile\u00a0% butSize)\u00a0!= 1))\n                        right = ((empty = (tile + 1)) and ((tile\u00a0% butSize)\u00a0!= 0))\n                        move = up or down or left  or right\n                        if move = 1 \n                           temp = rnd[empty]\n                           rnd[empty] = rnd[tile] \n                           rnd[tile] = temp\n                           empty = tile\n                           oGame.oGameCube {\n\t\t                      aGameMap = oGame.aGameMap \n                                      cube[1] = cube( 5  , -3 , -5  , texture[rnd[1]] )\n\t\t                      cube[2] = cube( 0  , -3 , -5  , texture[rnd[2]] )\n\t\t                      cube[3] = cube( -5 , -3 , -5  , texture[rnd[3]] )\n\t\t                      cube[4] = cube( 5  , 1  , -5  , texture[rnd[4]] )\n\t\t                      cube[5] = cube( 0  , 1  , -5  , texture[rnd[5]] )\n\t                              cube[6] = cube( -5 , 1  , -5  , texture[rnd[6]] )\n\t\t                      cube[7] = cube( 5  , 5  , -5  , texture[rnd[7]] )\n\t                              cube[8] = cube( 0  , 5  , -5  , texture[rnd[8]] )\n\t\t                      cube[9] = cube( -5 , 5  , -5  , texture[rnd[9]] )\n \t\t                      rotate()\n\t\t           }\n                        ok\n\t\t}\n\nClass GameLogic from GraphicsAppBase\n\n\taGameMap = [\n\t\t[ :n , :n , :n ] ,\n\t\t[ :n , :n , :n ] ,\n\t\t[ :n , :n , :n ]\n\t]\n\n\taGameButtons = [\t\t\t# x1,y1,x2,y2\n \t\t[176,88,375,261],\t\t# [1,1]\n\t\t[423,88,591,261],\t\t# [1,2]\n\t\t[645,88,876,261],\t\t# [1,3]\n \t\t[176,282,375,428],\t\t# [2,1]\n\t\t[423,282,591,428],\t\t# [2,2]\n\t\t[645,282,876,428],\t\t# [2,3]\n \t\t[176,454,375,678],\t\t# [3,1]\n\t\t[423,454,591,678],\t\t# [3,2]\n\t\t[645,454,876,678]\t\t# [3,3]\n\t]\n\n\tcActivePlayer = :x\n\n\tfunc point2button x,y\n\t\tnRow = 0\n\t\tnCol = 0\n\t\tfor t = 1 to len(aGameButtons) \n\t\t\trect = aGameButtons[t]\n\t\t\tif x >= rect[1] and x <= rect[3] and\n\t\t\t   y >= rect[2] and y <= rect[4] \n\t\t\t\t\tswitch t\n\t\t\t\t\t\ton 1  nRow = 1  nCol = 1\n\t\t\t\t\t\ton 2  nRow = 1  nCol = 2\n\t\t\t\t\t\ton 3  nRow = 1 \tnCol = 3\n\t\t\t\t\t\ton 4  nRow = 2  nCol = 1\n\t\t\t\t\t\ton 5  nRow = 2  nCol = 2\n\t\t\t\t\t\ton 6  nRow = 2  nCol = 3\n\t\t\t\t\t\ton 7  nRow = 3 \tnCol = 1\n\t\t\t\t\t\ton 8  nRow = 3  nCol = 2\n\t\t\t\t\t\ton 9  nRow = 3  nCol = 3\n\t\t\t\t\toff\n\t\t\t\t\texit \n\t\t\tok\n\t\tnext \n\t\treturn [nRow,nCol]\n\nclass GameCube\n\n\tbitmap bitmap2 bitmap3 \n\ttextureX textureO textureN\n\n\txrot = 0.0\n\tyrot = 0.0\n\tzrot = 0.0\n\n\tfunc loadresources\n\t\tbitmp1 = al_load_bitmap(\"image/n1.jpg\")\n\t\ttexture[1] = al_get_opengl_texture(bitmp1)\n\t\tbitmp2 = al_load_bitmap(\"image/n2.jpg\")\n\t\ttexture[2] = al_get_opengl_texture(bitmp2)\n\t\tbitmp3 = al_load_bitmap(\"image/n3.jpg\")\n\t\ttexture[3] = al_get_opengl_texture(bitmp3)\n\t\tbitmp4 = al_load_bitmap(\"image/n4.jpg\")\n\t\ttexture[4] = al_get_opengl_texture(bitmp4)\n\t\tbitmp5 = al_load_bitmap(\"image/n5.jpg\")\n\t\ttexture[5] = al_get_opengl_texture(bitmp5)\n\t\tbitmp6 = al_load_bitmap(\"image/n6.jpg\")\n\t\ttexture[6] = al_get_opengl_texture(bitmp6)\n\t\tbitmp7 = al_load_bitmap(\"image/n7.jpg\")\n\t\ttexture[7] = al_get_opengl_texture(bitmp7)\n\t\tbitmp8 = al_load_bitmap(\"image/n8.jpg\")\n\t\ttexture[8] = al_get_opengl_texture(bitmp8)\n\t\tbitmp9 = al_load_bitmap(\"image/empty.png\")\n\t\ttexture[9] = al_get_opengl_texture(bitmp9)\n\n\tfunc cube(x,y,z,nTexture)\n\t\tglLoadIdentity()\t\t\t\t\t\t\t\t\t\n\t\tglTranslatef(x,y,z)\n\t\tglRotatef(xrot,1.0,0.0,0.0)\n\t\tglRotatef(yrot,0.0,1.0,0.0)\n\t\tglRotatef(zrot,0.0,0.0,1.0)\n\t\tsetCubeTexture(nTexture)\n\t\tdrawCube()\n\n\tfunc setCubeTexture cTexture\n\t\tglBindTexture(GL_TEXTURE_2D, cTexture)\n\n\tfunc Rotate \n\t\txrot += 0.3 * 5\n\t\tyrot += 0.2 * 5\n\t\tzrot += 0.4 * 5\n\n\tfunc drawcube\n\t\tglBegin(GL_QUADS)  \n\t\t\t// Front Face\n\t\t\tglTexCoord2f(0.0, 0.0) glVertex3f(-1.0, -1.0,  1.0)\n\t\t\tglTexCoord2f(1.0, 0.0) glVertex3f( 1.0, -1.0,  1.0)\n\t\t\tglTexCoord2f(1.0, 1.0) glVertex3f( 1.0,  1.0,  1.0)\n\t\t\tglTexCoord2f(0.0, 1.0) glVertex3f(-1.0,  1.0,  1.0)\n\t\t\t// Back Face\n\t\t\tglTexCoord2f(1.0, 0.0) glVertex3f(-1.0, -1.0, -1.0)\n\t\t\tglTexCoord2f(1.0, 1.0) glVertex3f(-1.0,  1.0, -1.0)\n\t\t\tglTexCoord2f(0.0, 1.0) glVertex3f( 1.0,  1.0, -1.0)\n\t\t\tglTexCoord2f(0.0, 0.0) glVertex3f( 1.0, -1.0, -1.0)\n\t\t\t// Top Face\n\t\t\tglTexCoord2f(0.0, 1.0) glVertex3f(-1.0,  1.0, -1.0)\n\t\t\tglTexCoord2f(0.0, 0.0) glVertex3f(-1.0,  1.0,  1.0)\n\t\t\tglTexCoord2f(1.0, 0.0) glVertex3f( 1.0,  1.0,  1.0)\n\t\t\tglTexCoord2f(1.0, 1.0) glVertex3f( 1.0,  1.0, -1.0)\n\t\t\t// Bottom Face\n\t\t\tglTexCoord2f(1.0, 1.0) glVertex3f(-1.0, -1.0, -1.0)\n\t\t\tglTexCoord2f(0.0, 1.0) glVertex3f( 1.0, -1.0, -1.0)\n\t\t\tglTexCoord2f(0.0, 0.0) glVertex3f( 1.0, -1.0,  1.0)\n\t\t\tglTexCoord2f(1.0, 0.0) glVertex3f(-1.0, -1.0,  1.0)\n\t\t \n\t\t\t// Right face\n\t\t\tglTexCoord2f(1.0, 0.0) glVertex3f( 1.0, -1.0, -1.0)\n\t\t\tglTexCoord2f(1.0, 1.0) glVertex3f( 1.0,  1.0, -1.0)\n\t\t\tglTexCoord2f(0.0, 1.0) glVertex3f( 1.0,  1.0,  1.0)\n\t\t\tglTexCoord2f(0.0, 0.0) glVertex3f( 1.0, -1.0,  1.0)\n\t \n\t\t\t// Left Face\n\t\t\tglTexCoord2f(0.0, 0.0) glVertex3f(-1.0, -1.0, -1.0)\n\t\t\tglTexCoord2f(1.0, 0.0) glVertex3f(-1.0, -1.0,  1.0)\n\t\t\tglTexCoord2f(1.0, 1.0) glVertex3f(-1.0,  1.0,  1.0)\n\t\t\tglTexCoord2f(0.0, 1.0) glVertex3f(-1.0,  1.0, -1.0)\n\t\tglEnd()\n\n\nclass GameBackground \n\n\tnBackX = 0\n\tnBackY = 0\n\tnBackDiffx = -1\n\tnBackDiffy = -1\n\tnBackMotion = 1\n\taBackMotionList = [\n\t\t[ -1, -1 ] ,\t\t# Down - Right\n\t\t[ 0 , 1  ] ,\t\t# Up\n\t\t[ -1, -1 ] , \t\t# Down - Right\n\t\t[ 0 , 1  ] ,\t\t# Up\n\t\t[ 1 , -1 ] ,\t\t# Down - Left\n\t\t[ 0 , 1  ] ,\t\t# Up\n\t\t[ 1 , -1 ] , \t\t# Down - Left\n\t\t[ 0 , 1  ]\t\t\t# Up\n\t]\n\n\tbitmap\n\n\tfunc Update \n\t\tdraw()\n\t\tmotion()\n\n\tfunc draw\n\t\tal_draw_bitmap(bitmap,nBackX,nBackY,1)\n\n\tfunc motion\n\t\tnBackX += nBackDiffx\n\t\tnBackY += nBackDiffy\n\t\tif (nBackY = -350) or (nBackY = 0)\n\t\t\tnBackMotion++\n\t\t\tif nBackMotion > len(aBackMotionList)\n\t\t\t\tnBackMotion = 1\n\t\t\tok\n\t\t\tnBackDiffx  = aBackMotionList[nBackMotion][1]\n\t\t\tnBackDiffy  = aBackMotionList[nBackMotion][2]\n\t\tok\n\n\tfunc loadResources\n\t\tbitmap = al_load_bitmap(\"image/back.jpg\")\n\nclass GameSound\n\n\tsample sampleid\n\n\tfunc loadresources\n\t\tsample = al_load_sample( \"sound/music1.wav\" )\n\t\tsampleid = al_new_allegro_sample_id()\n\t\tal_play_sample(sample, 1.0, 0.0,1.0,ALLEGRO_PLAYMODE_LOOP,sampleid)\n\nclass GraphicsAppBase\n\n\tdisplay event_queue ev timeout \n\ttimer  \n\tredraw \t\t\t= true\n\tFPS \t\t\t= 60 \n\tSCREEN_W \t\t= 1024\n\tSCREEN_H \t\t= 700\n\tKEY_UP\t\t\t= 1\n\tKEY_DOWN \t\t= 2\n\tKEY_LEFT \t\t= 3\n\tKEY_RIGHT \t\t= 4\n\tKey \t\t\t= [false,false,false,false]\n\tMouse_X \t\t= 0\n\tMouse_Y\t\t\t= 0\n\tTITLE \t\t\t= \"Graphics Application\"\n\tPRINT_MOUSE_XY \t= False\n\n\tfunc start\n\t\tSetUp()\n\t\tloadResources()\n\t\teventsLoop()\n\t\tdestroy()\n\n\tfunc setup\n\t\tal_init()\n\t\tal_init_font_addon()\n\t\tal_init_ttf_addon()\n\t\tal_init_image_addon()\n\t\tal_install_audio()\n\t\tal_init_acodec_addon()\n\t\tal_reserve_samples(1)\n\t\tal_set_new_display_flags(ALLEGRO_OPENGL) \n\t\tdisplay = al_create_display(SCREEN_W,SCREEN_H)\n\t\tal_set_window_title(display,TITLE)\n\t\tal_clear_to_color(al_map_rgb(0,0,0))\n\t\tevent_queue = al_create_event_queue()\n\t\tal_register_event_source(event_queue, \n\t\tal_get_display_event_source(display))\n\t\tev = al_new_allegro_event()\n\t\ttimeout = al_new_allegro_timeout()\n\t\tal_init_timeout(timeout, 0.06)\n\t\ttimer = al_create_timer(1.0 / FPS)\n\t\tal_register_event_source(event_queue, \n\t\tal_get_timer_event_source(timer))\n\t\tal_start_timer(timer)\n\t\tal_install_mouse()\n\t\tal_register_event_source(event_queue, \n\t\tal_get_mouse_event_source())\n\t\tal_install_keyboard()\n\t\tal_register_event_source(event_queue, \n\t\tal_get_keyboard_event_source())\n\n\tfunc eventsLoop\n\t\twhile true\n\t\t\tal_wait_for_event_until(event_queue, ev, timeout)\n\t\t\tswitch al_get_allegro_event_type(ev)\n\t\t\ton ALLEGRO_EVENT_DISPLAY_CLOSE\n\t\t\t\tCloseEvent()\n\t\t\ton ALLEGRO_EVENT_TIMER\n\t\t\t\tredraw = true\n\t\t\ton ALLEGRO_EVENT_MOUSE_AXES\n\t\t\t\tmouse_x = al_get_allegro_event_mouse_x(ev)\n\t\t\t\tmouse_y = al_get_allegro_event_mouse_y(ev)\n\t\t\t\tif PRINT_MOUSE_XY\n\t\t\t\t\tsee \"x = \" + mouse_x + nl\n\t\t\t\t\tsee \"y = \" + mouse_y + nl\n\t\t\t\tok\n\t\t\ton ALLEGRO_EVENT_MOUSE_ENTER_DISPLAY\n\t\t\t\tmouse_x = al_get_allegro_event_mouse_x(ev)\n\t\t\t\tmouse_y = al_get_allegro_event_mouse_y(ev)\n\t\t\ton ALLEGRO_EVENT_MOUSE_BUTTON_UP\n\t\t\t\tMouseClickEvent()\n\t\t\ton ALLEGRO_EVENT_KEY_DOWN\n\t\t\t\tswitch al_get_allegro_event_keyboard_keycode(ev)\n\t\t\t\t\ton ALLEGRO_KEY_UP\n\t\t\t\t\t\tkey[KEY_UP] = true\n\t\t\t\t\ton ALLEGRO_KEY_DOWN\n\t\t\t\t\t\tkey[KEY_DOWN] = true\n\t\t\t\t\ton ALLEGRO_KEY_LEFT\n\t\t\t\t\t\tkey[KEY_LEFT] = true\n\t\t\t\t\ton ALLEGRO_KEY_RIGHT\n\t\t\t\t\t\tkey[KEY_RIGHT] = true\n\t\t\t\toff\n\t\t\ton ALLEGRO_EVENT_KEY_UP\n\t\t\t\tswitch al_get_allegro_event_keyboard_keycode(ev)\n\t\t\t\t\ton ALLEGRO_KEY_UP\n\t\t\t\t\t\tkey[KEY_UP] = false\n\t\t\t\t\ton ALLEGRO_KEY_DOWN\n\t\t\t\t\t\tkey[KEY_DOWN] = false\n\t\t\t\t\ton ALLEGRO_KEY_LEFT\n\t\t\t\t\t\tkey[KEY_LEFT] = false\n\t\t\t\t\ton ALLEGRO_KEY_RIGHT\n\t\t\t\t\t\tkey[KEY_RIGHT] = false\n\t\t\t\t\ton ALLEGRO_KEY_ESCAPE\n\t\t\t\t\t\texit\n\t\t\t\toff\n\t\t\toff\n\t\t\tif redraw and al_is_event_queue_empty(event_queue)\n\t\t\t\tredraw = false\n\t\t\t\tdrawScene()\n\t\t\t\tal_flip_display()\n\t\t\tok\n\t\t\tcallgc()\n\t\tend\n\n\tfunc destroy\n\t\tal_destroy_timer(timer)\n\t\tal_destroy_allegro_event(ev)\n\t\tal_destroy_allegro_timeout(timeout)\n\t\tal_destroy_event_queue(event_queue)\n\t\tal_destroy_display(display)\n\t\tal_exit()\n\n\tfunc loadresources\n\n\tfunc drawScene\n\n\tfunc MouseClickEvent\n\t\texit \t\t\t# Exit from the Events Loop \n\n\tfunc CloseEvent\n\t\texit \t\t\t# Exit from the Events Loop",
        "safe": true
    },
    {
        "filename": "15 puzzle game_11.txt",
        "content": "$ hopper jm/puzzle.jambo\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\n         \u2502 14 \u2502\u2502 5  \u2502\u2502 3  \u2502\u2502 12 \u2502\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\n         \u2502 13 \u2502\u2502 9  \u2502\u2502 6  \u2502\u2502 11 \u2502\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\n         \u2502 15 \u2502\u2502 10 \u2502\u2502 8  \u2502\u2502 2  \u2502\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u2584\u2584\u2584\u2584\u2584\u2584\n         \u2502 4  \u2502\u2502 1  \u2502\u2502 7  \u2502\u2588    \u2588\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2580\u2580\u2580\u2580\u2580\u2580\n         ..... (muchos click)\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\n         \u2502 7  \u2502\u2502 10 \u2502\u2502 14 \u2502\u2502 12 \u2502\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\n         \u2502 15 \u2502\u2502    \u2502\u2502 4  \u2502\u2502 2  \u2502\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\n         \u250c\u2500\u2500\u2500\u2500\u2510\u2584\u2584\u2584\u2584\u2584\u2584\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\n         \u2502 1  \u2502\u2588 8  \u2588\u2502 6  \u2502\u2502 11 \u2502\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2580\u2580\u2580\u2580\u2580\u2580\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\n         \u2502 3  \u2502\u2502 13 \u2502\u2502 5  \u2502\u2502 9  \u2502\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\n         ....( muy muchos clicks )\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\n         \u2502 1  \u2502\u2502 2  \u2502\u2502 3  \u2502\u2502 4  \u2502\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\n         \u2502 5  \u2502\u2502 6  \u2502\u2502 7  \u2502\u2502 8  \u2502\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\n         \u2502 9  \u2502\u2502 10 \u2502\u2502 11 \u2502\u2502 12 \u2502\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u2584\u2584\u2584\u2584\u2584\u2584\n         \u2502 13 \u2502\u2502 14 \u2502\u2502 15 \u2502\u2588    \u2588\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2580\u2580\u2580\u2580\u2580\u2580\n\n              LO RESOLVISTE!\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_110.txt",
        "content": "require 'io/console'\n\nclass Board\n  SIZE = 4\n  RANGE = 0...SIZE\n  \n  def initialize\n    width = (SIZE*SIZE-1).to_s.size\n    @frame = (\"+\" + \"-\"*(width+2)) * SIZE + \"+\"\n    @form = \"|\u00a0%#{width}d \" * SIZE + \"|\"\n    @step = 0\n    @orign = [*0...SIZE*SIZE].rotate.each_slice(SIZE).to_a.freeze\n    @board = @orign.map{|row | row.dup}\n    randomize\n    draw\n    message\n    play\n  end\n  \n  private\n  \n  def randomize\n    @board[0][0], @board[SIZE-1][SIZE-1] = 0, 1\n    @board[SIZE-1][0], @board[0][SIZE-1] = @board[0][SIZE-1], @board[SIZE-1][0]\n    x, y, dx, dy = 0, 0, 1, 0\n    50.times do\n      nx,ny = [[x+dx,y+dy], [x+dy,y-dx], [x-dy,y+dx]]\n                .select{|nx,ny| RANGE.include?(nx) and RANGE.include?(ny)}\n                .sample\n      @board[nx][ny], @board[x][y] = 0, @board[nx][ny]\n      x, y, dx, dy = nx, ny, nx-x, ny-y\n    end\n    @x, @y = x, y \n  end\n  \n  def draw\n    puts \"\\e[H\\e[2J\"\n    @board.each do |row|\n      puts @frame\n      puts (@form % row).sub(\" 0 \", \"   \")\n    end\n    puts @frame\n    puts \"Step: #{@step}\"\n  end\n  \n  DIR = {up: [-1,0], down: [1,0], left: [0,-1], right: [0,1]}\n  def move(direction)\n    dx, dy = DIR[direction]\n    nx, ny = @x + dx, @y + dy\n    if RANGE.include?(nx) and RANGE.include?(ny)\n      @board[nx][ny], @board[@x][@y] = 0, @board[nx][ny]\n      @x, @y = nx, ny\n      @step += 1\n      draw\n    end\n  end\n  \n  def play\n    until @board == @orign\n      case  key_in\n      when \"\\e[A\", \"w\" then move(:up)\n      when \"\\e[B\", \"s\" then move(:down)\n      when \"\\e[C\", \"d\" then move(:right)\n      when \"\\e[D\", \"a\" then move(:left)\n      \n      when \"q\",\"\\u0003\",\"\\u0004\"  then exit\n      when \"h\"  then message\n      end\n    end\n    \n    puts \"Congratulations, you have won!\"\n  end\n  \n  def key_in\n    input = STDIN.getch\n    if input == \"\\e\" \n      2.times {input << STDIN.getch}\n    end\n    input\n  end\n  \n  def message\n    puts <<~EOM\n      Use the arrow-keys or WASD on your keyboard to push board in the given direction.   \n      PRESS q TO QUIT (or Ctrl-C or Ctrl-D)\n    EOM\n  end\nend\n\nBoard.new\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_111.txt",
        "content": "+----+----+----+----+\n|  5 |  7 |  2 | 13 |\n+----+----+----+----+\n|  6 |    |  8 | 12 |\n+----+----+----+----+\n| 10 |  3 |  1 | 15 |\n+----+----+----+----+\n|  9 |  4 | 14 | 11 |\n+----+----+----+----+\nStep: 0\nUse the arrow-keys or WASD on your keyboard to push board in the given direction.\nPRESS q TO QUIT (or Ctrl-C or Ctrl-D)\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_112.txt",
        "content": "DIM = 100\nSOLUTION = %w[1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 0].freeze\n\nattr_reader :bcolor, :dark, :light, :tcolor, :space, :blank, :list\n\ndef settings\n  size(400, 400)\nend\n\ndef setup\n  sketch_title 'Fifteen Tile Puzzle'\n  labels = SOLUTION.shuffle\n  @list = []\n  grid(width, height, DIM, DIM) do |y, x|\n    list << Tile.new(Vec2D.new(x, y), labels[list.length])\n  end\n  @tcolor = color(255, 175, 0)\n  @bcolor = color(235, 231, 178)\n  @dark = color(206, 141, 0)\n  @light = color(255, 214, 126)\n  text_size(DIM / 2.7)\n  text_align(CENTER)\n  no_loop\nend\n\ndef draw\n  list.each(&:draw)\nend\n\ndef mouse_clicked\n  inside = list.find_index { |tile| tile.include?(Vec2D.new(mouse_x, mouse_y)) }\n  target = list.find_index { |tile| tile.label == '0' }\n  source = list[inside].pos\n  dest = list[target].pos\n  return unless source.dist(dest) == DIM\n\n  list[target].label = list[inside].label\n  list[inside].label = '0'\n  redraw\nend\n\n# Our Tile Boundary Class\nclass Boundary\n  attr_reader :low, :high\n\n  def initialize(low, high)\n    @low = low\n    @high = high\n  end\n\n  def include?(val)\n    return false unless (low.x...high.x).cover? val.x\n\n    return false unless (low.y...high.y).cover? val.y\n\n    true\n  end\nend\n\n# Holds Tile logic and draw (Processing::Proxy give access to Sketch methods)\nclass Tile\n  include Processing::Proxy\n  attr_writer :label\n  attr_reader :boundary, :label, :pos\n\n  def initialize(pos, lbl)\n    @label = lbl\n    @pos = pos\n    @boundary = Boundary.new(pos, pos + Vec2D.new(DIM, DIM))\n  end\n\n  def draw_empty\n    fill(bcolor)\n    rect(pos.x + 1, pos.y + 1, DIM - 1, DIM - 1)\n  end\n\n  def draw_tile\n    rect(pos.x + 1, pos.y + 1, DIM - 1, DIM - 1)\n    fill(0) # Black text shadow\n    text(label, pos.x + DIM / 2 + 1, pos.y + DIM / 2 + text_ascent / 2)\n    fill(255)\n    text(label, pos.x + DIM / 2, pos.y + DIM / 2 + text_ascent / 2)\n    stroke(dark)\n    line(pos.x + DIM - 1, pos.y + 1, pos.x + DIM - 1, pos.y + DIM - 2) # Right side shadow\n    line(pos.x + 2, pos.y + DIM, pos.x + DIM - 1, pos.y + DIM - 2) # Bottom side shadow\n    stroke(light)\n    line(pos.x + 2, pos.y - 1, pos.x + 2, pos.y + DIM - 1) # Left bright\n    line(pos.x + 2, pos.y + 1, pos.x + DIM - 1, pos.y + 1) # Upper bright\n  end\n\n  def include?(vec)\n    boundary.include?(vec)\n  end\n\n  def draw\n    no_stroke\n    return draw_empty if label == '0'\n\n    fill(tcolor)\n    draw_tile\n  end\nend\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_113.txt",
        "content": "call SetCSS\n' ---- fill 15 squares with 1 to 15\ndim sq(16)\nfor i = 1 to 15: sq(i) = i: next \n \n'----- shuffle the squares\n[newGame]\nfor i = 1 to 100\t\t' Shuffle the squares\n\tj\t= rnd(0) * 16 + 1\n\tk\t= rnd(0) * 16 + 1\n\th\t= sq(j)\n\tsq(j)\t= sq(k)\n\tsq(k)\t= h\nnext i\n \n' ---- show the squares\n[loop]\ncls\nhtml \"<CENTER><TABLE><TR align=center>\"\nfor i = 1 to 16\n\thtml \"<TD>\"\n\tif sq(i) <> 0 then\n\t\tbutton\t#pick, str$(sq(i)), [pick]\n\t\t\t#pick setkey(str$(i))\n\t\t\t#pick cssclass(\"lBtn\")\n\tend if\n\thtml \"</TD>\"\n\tif i mod 4 = 0 then html \"</TR><TR align=center>\"\nnext i\nhtml \"</table>\"\nwait\n \n' ---- Find what square they picked\n[pick]\t\t\t\npicked\t= val(EventKey$)\nmove\t= 0             '                0000000001111111\nif picked - 1 > 0 then  ' LEFT           1234567890123456\n\t\t\t\tif mid$(\" *** *** *** ***\",picked,1) = \"*\" and sq(picked -1) = 0 then move = -1 :end if\nif picked + 1 < 17 then ' RIGHT\n\t\t\t\tif mid$(\"*** *** *** *** \",picked,1) = \"*\" and sq(picked +1) = 0 then move =  1 :end if\nif picked - 4 > 0  then ' UP \n\t\t\t\tif mid$(\"    ************\",picked,1) = \"*\" and sq(picked -4) = 0 then move = -4 :end if\nif picked + 4 < 17 then ' DOWN \n\t\t\t\tif mid$(\"************    \",picked,1) = \"*\" and sq(picked +4) = 0 then move =  4 :end if\n' ---- See if they picked a valid square next to the blank square\nif move = 0 then\n\tprint \"Invalid move: \";sq(picked)\n\twait\nend if\n \n' ---- Valid squire, switch it with the blank square\nsq(picked + move) = sq(picked) ' move to the empty square\nsq(picked) = 0\nfor i = 1 to 15  ' ---- If they got them all in a row they are a winner\n\tif sq(i) <> i then goto [loop]\nnext i\n \nprint \"----- You are a winner -----\"\ninput \"Play again (Y/N)\";a$\nif a$ = \"Y\" then goto [newGame]\t\t' set up new game\nend\n \n' ---- Make the squares look nice\nSUB SetCSS\nCSSClass \".lBtn\", \"{\nbackground:wheat;border-width:5px;width:70px;\nText-Align:Center;Font-Size:24pt;Font-Weight:Bold;Font-Family:Arial;\n}\"\nEND SUB",
        "safe": true
    },
    {
        "filename": "15 puzzle game_114.txt",
        "content": "extern crate rand;\nuse clearscreen::clear;\nuse std::collections::HashMap;\nuse std::fmt;\nuse std::io::{self, Write};\n\nuse rand::seq::SliceRandom;\nuse rand::Rng;\n\n#[derive(Copy, Clone, PartialEq, Debug)]\nenum Cell {\n    Card(usize),\n    Empty,\n}\n\n#[derive(Eq, PartialEq, Hash, Debug)]\nenum Direction {\n    Up,\n    Down,\n    Left,\n    Right,\n}\n\nenum Action {\n    Move(Direction),\n    Quit,\n}\n\ntype Board = [Cell; 16];\nconst EMPTY: Board = [Cell::Empty; 16];\n\nstruct P15 {\n    board: Board,\n}\n\nimpl P15 {\n    fn new() -> Self {\n        let mut board = EMPTY;\n        for (i, cell) in board.iter_mut().enumerate().skip(1) {\n            *cell = Cell::Card(i);\n        }\n\n        let mut rng = rand::thread_rng();\n\n        board.shuffle(&mut rng);\n        if !Self::is_valid(board) {\n            // random swap\n            let i = rng.gen_range(0..16);\n            let mut j = rng.gen_range(0..16);\n            while j == i {\n                j = rng.gen_range(0..16);\n            }\n            board.swap(i, j);\n        }\n\n        Self { board }\n    }\n\n    fn is_valid(mut board: Board) -> bool {\n        // TODO: optimize\n        let mut permutations = 0;\n\n        let pos = board.iter().position(|&cell| cell == Cell::Empty).unwrap();\n\n        if pos != 15 {\n            board.swap(pos, 15);\n            permutations += 1;\n        }\n\n        for i in 1..16 {\n            let pos = board\n                .iter()\n                .position(|&cell| matches!(cell, Cell::Card(value) if value == i))\n                .unwrap();\n\n            if pos + 1 != i {\n                board.swap(pos, i - 1);\n                permutations += 1;\n            }\n        }\n\n        permutations % 2 == 0\n    }\n\n    fn get_empty_position(&self) -> usize {\n        self.board.iter().position(|&c| c == Cell::Empty).unwrap()\n    }\n\n    fn get_moves(&self) -> HashMap<Direction, Cell> {\n        let mut moves = HashMap::new();\n        let i = self.get_empty_position();\n\n        if i > 3 {\n            moves.insert(Direction::Up, self.board[i - 4]);\n        }\n        if i % 4 != 0 {\n            moves.insert(Direction::Left, self.board[i - 1]);\n        }\n        if i < 12 {\n            moves.insert(Direction::Down, self.board[i + 4]);\n        }\n        if i % 4 != 3 {\n            moves.insert(Direction::Right, self.board[i + 1]);\n        }\n        moves\n    }\n\n    fn play(&mut self, direction: &Direction) {\n        let i = self.get_empty_position();\n        // This is safe because `ask_action` only returns legal moves\n        match *direction {\n            Direction::Up => self.board.swap(i, i - 4),\n            Direction::Left => self.board.swap(i, i - 1),\n            Direction::Right => self.board.swap(i, i + 1),\n            Direction::Down => self.board.swap(i, i + 4),\n        };\n    }\n\n    fn is_complete(&self) -> bool {\n        self.board.iter().enumerate().all(|(i, &cell)| match cell {\n            Cell::Card(value) => value == i + 1,\n            Cell::Empty => i == 15,\n        })\n    }\n}\n\nimpl fmt::Display for P15 {\n    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n        (writeln!(f, \"+----+----+----+----+\"))?;\n        for (i, &cell) in self.board.iter().enumerate() {\n            match cell {\n                Cell::Card(value) => (write!(f, \"| {value:2} \"))?,\n                Cell::Empty => (write!(f, \"|    \"))?,\n            }\n\n            if i % 4 == 3 {\n                (writeln!(f, \"|\"))?;\n                (writeln!(f, \"+----+----+----+----+\"))?;\n            }\n        }\n        Ok(())\n    }\n}\n\nfn main() {\n    let mut p15 = P15::new();\n\n    for turns in 1.. {\n        println!(\"{p15}\");\n        match ask_action(&p15.get_moves(), true) {\n            Action::Move(direction) => {\n                p15.play(&direction);\n                clear().expect(\"failed to clear screen\");\n            }\n            Action::Quit => {\n                clear().expect(\"failed to clear screen\");\n\n                println!(\"Bye!\");\n                break;\n            }\n        }\n\n        if p15.is_complete() {\n            println!(\"Well done! You won in {turns} turns\");\n            break;\n        }\n    }\n}\n\nfn ask_action(moves: &HashMap<Direction, Cell>, render_list: bool) -> Action {\n    use Action::*;\n    use Direction::*;\n\n    if render_list {\n        println!(\"Possible moves:\");\n\n        if let Some(&Cell::Card(value)) = moves.get(&Up) {\n            println!(\"\\tU) {value}\");\n        }\n        if let Some(&Cell::Card(value)) = moves.get(&Left) {\n            println!(\"\\tL) {value}\");\n        }\n        if let Some(&Cell::Card(value)) = moves.get(&Right) {\n            println!(\"\\tR) {value}\");\n        }\n        if let Some(&Cell::Card(value)) = moves.get(&Down) {\n            println!(\"\\tD) {value}\");\n        }\n        println!(\"\\tQ) Quit\");\n        print!(\"Choose your move: \");\n        io::stdout().flush().unwrap();\n    } else {\n        print!(\"Unknown move, try again: \");\n        io::stdout().flush().unwrap();\n    }\n\n    let mut action = String::new();\n    io::stdin().read_line(&mut action).expect(\"read error\");\n    match action.to_uppercase().trim() {\n        \"U\" if moves.contains_key(&Up) => Move(Up),\n        \"L\" if moves.contains_key(&Left) => Move(Left),\n        \"R\" if moves.contains_key(&Right) => Move(Right),\n        \"D\" if moves.contains_key(&Down) => Move(Down),\n        \"Q\" => Quit,\n        _ => {\n            if unknown_action() {\n                ask_action(moves, true)\n            } else {\n                ask_action(moves, false)\n            }\n        }\n    }\n}\n\nfn unknown_action() -> bool {\n    use crossterm::{\n        cursor::MoveToPreviousLine,\n        terminal::{Clear, ClearType},\n        ExecutableCommand,\n    };\n    std::io::stdout().execute(MoveToPreviousLine(1)).unwrap();\n    std::io::stdout()\n        .execute(Clear(ClearType::CurrentLine))\n        .unwrap();\n    false\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_115.txt",
        "content": "import java.util.Random\n\nimport jline.console._\n\nimport scala.annotation.tailrec\nimport scala.collection.immutable\nimport scala.collection.parallel.immutable.ParVector\n\nobject FifteenPuzzle {\n  def main(args: Array[String]): Unit = play()\n  \n  @tailrec def play(len: Int = 1000): Unit = if(gameLoop(Board.randState(len))) play(len)\n  def gameLoop(board: Board): Boolean = {\n    val read = new ConsoleReader()\n    val km = KeyMap.keyMaps().get(\"vi-insert\")\n    val opMap = immutable.HashMap[Operation, Char](\n      Operation.PREVIOUS_HISTORY -> 'u',\n      Operation.BACKWARD_CHAR -> 'l',\n      Operation.NEXT_HISTORY -> 'd',\n      Operation.FORWARD_CHAR -> 'r')\n    \n    @tailrec\n    def gloop(b: Board): Boolean = {\n      println(s\"\\u001B[2J\\u001B[2;0H$b\\n\u2190\u2191\u2192\u2193q\")\n      if(b.isSolved) println(\"Solved!\\nPlay again? (y/n)\")\n      \n      read.readBinding(km) match{\n        case Operation.SELF_INSERT => read.getLastBinding match{\n          case \"q\" => false\n          case \"y\" if b.isSolved => true\n          case \"n\" if b.isSolved => false\n          case _ => gloop(b)\n        }\n        case op: Operation if opMap.isDefinedAt(op) => gloop(b.move(opMap(op)))\n        case _ => gloop(b)\n      }\n    }\n    \n    gloop(board)\n  }\n  \n  case class Board(mat: immutable.HashMap[(Int, Int), Int], x: Int, y: Int) {\n    def move(mvs: Seq[Char]): Board = mvs.foldLeft(this){case (b, m) => b.move(m)}\n    def move(mov: Char): Board = mov match {\n      case 'r' if x < 3 => Board(mat ++ Seq(((x, y), mat((x + 1, y))), ((x + 1, y), 0)), x + 1, y)\n      case 'l' if x > 0 => Board(mat ++ Seq(((x, y), mat((x - 1, y))), ((x - 1, y), 0)), x - 1, y)\n      case 'd' if y < 3 => Board(mat ++ Seq(((x, y), mat((x, y + 1))), ((x, y + 1), 0)), x, y + 1)\n      case 'u' if y > 0 => Board(mat ++ Seq(((x, y), mat((x, y - 1))), ((x, y - 1), 0)), x, y - 1)\n      case _ => this\n    }\n    \n    def isSolved: Boolean = sumDist == 0\n    def sumDist: Int = mat.to(LazyList).map{ case ((a, b), n) => if(n == 0) 6 - a - b else (a + b - ((n - 1) % 4) - ((n - 1) / 4)).abs }.sum\n  \n    override def toString: String = {\n      val lst = mat.toVector.map { case ((a, b), n) => (4 * b + a, n) }.sortWith(_._1 < _._1).map(_._2)\n      lst.map { n => if (n == 0) \"  \" else f\"$n%2d\" }.grouped(4).map(_.mkString(\" \")).mkString(\"\\n\")\n    }\n  }\n  \n  object Board {\n    val moves: Vector[Char] = Vector('r', 'l', 'd', 'u')\n    \n    def apply(config: Vector[Int]): Board = {\n      val ind = config.indexOf(0)\n      val formed = config.zipWithIndex.map { case (n, i) => ((i % 4, i / 4), n) }\n      val builder = immutable.HashMap.newBuilder[(Int, Int), Int]\n      builder ++= formed\n      Board(builder.result, ind % 4, ind / 4)\n    }\n    \n    def solveState: Board = apply((1 to 15).toVector :+ 0)\n    def randState(len: Int, rand: Random = new Random()): Board = Iterator\n      .fill(len)(moves(rand.nextInt(4)))\n      .foldLeft(Board.solveState) { case (state, mv) => state.move(mv) }\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_116.txt",
        "content": "(import (scheme base)\n        (scheme read)\n        (scheme write)\n        (srfi 27))    ; random numbers\n\n(define *start-position* #(1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 #\\space))\n(random-source-randomize! default-random-source)\n\n;; return a 16-place vector with the tiles randomly shuffled\n(define (create-start-position)\n  (let ((board (vector-copy *start-position*)))\n    (do ((i 0 (+ 1 i))\n         (moves (find-moves board) (find-moves board)))\n      ((and (>= i 100)\n            (not (finished? board)))\n       board)\n      (make-move board\n                 (list-ref moves (random-integer (length moves)))))))\n\n;; return index of space\n(define (find-space board)\n  (do ((i 0 (+ 1 i)))\n    ((equal? #\\space (vector-ref board i)) i)))\n\n;; return a list of symbols indicating available moves\n(define (find-moves board)\n  (let* ((posn (find-space board))\n         (row (quotient posn 4))\n         (col (remainder posn 4))\n         (result '()))\n    (when (> row 0) (set! result (cons 'up result)))\n    (when (< row 3) (set! result (cons 'down result)))\n    (when (> col 0) (set! result (cons 'left result)))\n    (when (< col 3) (set! result (cons 'right result)))\n    result))\n\n;; make given move - assume it is legal\n(define (make-move board move)\n  (define (swap posn-1 posn-2)\n    (let ((tmp (vector-ref board posn-1)))\n      (vector-set! board posn-1 (vector-ref board posn-2))\n      (vector-set! board posn-2 tmp)))\n  ;\n  (let ((posn (find-space board)))\n    (case move\n      ((left)\n       (swap posn (- posn 1)))\n      ((right)\n       (swap posn (+ posn 1)))\n      ((up)\n       (swap posn (- posn 4)))\n      ((down)\n       (swap posn (+ posn 4))))))\n\n(define (finished? board)\n  (equal? board *start-position*))\n\n(define (display-board board)\n  (do ((i 0 (+ 1 i)))\n    ((= i (vector-length board)) (newline))\n    (when (zero? (modulo i 4)) (newline))\n    (let ((curr (vector-ref board i)))\n      (display curr)\n      (display (if (and (number? curr) \n                        (> curr 9)) \n                 \" \"\n                 \"  \")))))\n\n;; the main game loop\n(define (play-game)\n  (let ((board (create-start-position)))\n    (do ((count 1 (+ count 1))\n         (moves (find-moves board) (find-moves board)))\n      ((finished? board) \n       (display (string-append \"\\nCOMPLETED PUZZLE in \"\n                               (number->string count)\n                               \" moves\\n\")))\n      (display-board board)\n      (display \"Enter a move: \") (display moves) (newline)\n      (let ((move (read)))\n        (if (memq move moves)\n          (make-move board move)\n          (display \"Invalid move - try again\"))))))\n\n(play-game)\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_117.txt",
        "content": "1  2     3  \n5  7  6  11 \n13 14 8  4  \n10 9  15 12 \nEnter a move: (right left down)\nright\n\n1  2  3     \n5  7  6  11 \n13 14 8  4  \n10 9  15 12 \nEnter a move: (left down)\ndown\n\n1  2  3  11 \n5  7  6     \n13 14 8  4  \n10 9  15 12 \nEnter a move: (left down up)\ndown\n\n1  2  3  11 \n5  7  6  4  \n13 14 8     \n10 9  15 12 \nEnter a move: (left down up)\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_118.txt",
        "content": "tiles=[1:15,0];\nsolution=[tiles(1:4);...\n          tiles(5:8);...\n          tiles(9:12);...\n          tiles(13:16)];\nsolution=string(solution);\nsolution(16)=\" \";\n          \ninit_pos=grand(1,\"prm\",tiles);\npuzzle=[init_pos(1:4);...\n        init_pos(5:8);...\n        init_pos(9:12);...\n        init_pos(13:16)];\npuzzle=string(puzzle);\n\nblank_pos=[];\nfor i=1:4\n    for j=1:4\n        if puzzle(i,j)==\"0\" then\n            blank_pos=[i,j];\n        end\n    end\nend\n\nclear i j\n\npuzzle(blank_pos(1),blank_pos(2))=\" \";\n\nn_moves=0;\nsolved=%F;\nwhile ~solved\n    disp(puzzle); mprintf(\"\\n\");\n    \n    neighbours=[0 -1;...\n               -1  0;...\n                0 +1;...\n               +1  0];\n    neighbours(:,1)=neighbours(:,1)+blank_pos(1);\n    neighbours(:,2)=neighbours(:,2)+blank_pos(2);\n    neighbours=[neighbours zeros(4,1)]\n    \n    i=0;\n    for i=1:4\n        if ~(neighbours(i,1)<1 | neighbours(i,1)>4 |...\n           neighbours(i,2)<1 | neighbours(i,2)>4) then\n           neighbours(i,3)=evstr(puzzle(neighbours(i,1),neighbours(i,2)));\n       end\n    end\n    \n    valid_move=%F;\n    while ~valid_move\n        move_tile=[];    \n        move_tile=input(\"Enter tile you want to move (0 to exit):\");\n        if sum(move_tile==neighbours(:,3)) & move_tile~=0 then\n            valid_move=%T;\n            n_moves=n_moves+1;\n        elseif move_tile==0 then\n            disp(\"Exit\");\n            abort\n        else\n            disp(puzzle);\n            disp(\"Invalid input\");\n        end\n    end\n    \n    neighb_i=find(neighbours(:,3)'==move_tile);\n    puzzle(neighbours(neighb_i,1),neighbours(neighb_i,2))=\" \";\n    puzzle(blank_pos(1),blank_pos(2))=string(move_tile);\n    blank_pos=neighbours(neighb_i,1:2);\n    \n    if sum(puzzle==solution)==16 then\n        solved=%T;\n        disp(puzzle);\n        mprintf(\"\\n\"+...\n                \"   _____       _               _ _ \\n\"+...\n                \"  / ____|     | |             | | |\\n\"+...\n                \" | (___   ___ | |_   _____  __| | |\\n\"+...\n                \"  \\\\___ \\\\ / _ \\\\| \\\\ \\\\ / / _ \\\\/ _` | |\\n\"+...\n                \"  ____) | (_) | |\\\\ V /  __/ (_| |_|\\n\"+...\n                \" |_____/ \\\\___/|_| \\\\_/ \\\\___|\\\\__,_(_)\\n\")\n    end\nend\n\ndisp(\"Solved in \"+string(n_moves)+\" moves.\");\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_119.txt",
        "content": "!1   2   3   4  \u00a0!\n!               \u00a0!\n!5   6   7   8  \u00a0!\n!               \u00a0!\n!9   14  10  11 \u00a0!\n!               \u00a0!\n!13      15  12 \u00a0!\n\nEnter tile you want to move (0 to exit):\n14\n\n!1   2   3   4  \u00a0!\n!               \u00a0!\n!5   6   7   8  \u00a0!\n!               \u00a0!\n!9       10  11 \u00a0!\n!               \u00a0!\n!13  14  15  12 \u00a0!\n\nEnter tile you want to move (0 to exit):\n10\n\n\n!1   2   3   4  \u00a0!\n!               \u00a0!\n!5   6   7   8  \u00a0!\n!               \u00a0!\n!9   10      11 \u00a0!\n!               \u00a0!\n!13  14  15  12 \u00a0!\n\nEnter tile you want to move (0 to exit):\n11\n\n\n!1   2   3   4  \u00a0!\n!               \u00a0!\n!5   6   7   8  \u00a0!\n!               \u00a0!\n!9   10  11     \u00a0!\n!               \u00a0!\n!13  14  15  12 \u00a0!\n\nEnter tile you want to move (0 to exit):\n12\n\n\n!1   2   3   4  \u00a0!\n!               \u00a0!\n!5   6   7   8  \u00a0!\n!               \u00a0!\n!9   10  11  12 \u00a0!\n!               \u00a0!\n!13  14  15     \u00a0!\n\n   _____       _               _ _ \n  / ____|     | |             | | |\n | (___   ___ | |_   _____  __| | |\n  \\___ \\ / _ \\| \\ \\ / / _ \\/ _` | |\n  ____) | (_) | |\\ V /  __/ (_| |_|\n |_____/ \\___/|_| \\_/ \\___|\\__,_(_)\n\n Solved in 4 moves.",
        "safe": true
    },
    {
        "filename": "15 puzzle game_12.txt",
        "content": "fpg\u2190{\u2395IO\u21900\n    \u237a\u21904 4\n    (s\u2228.<0)\u22282\u2260\u2374s\u2190\u237a:'invalid shape:'s\n    0\u2260\u2374\u2374\u2375:'invalid shuffle count:'\u2375\n    d\u2190d,-d\u2190\u21932 2\u23743\u21911\n    e\u2190\u00af1+\u2374c\u2190'\u2191\u2193\u2190\u2192\u25cb'\n    b\u2190w\u2190s\u2374w\u21901\u233d\u2373\u00d7/s\n    z\u2190\u2283{\n        z p\u2190\u2375\n        n\u2190(?\u2374p)\u2283p\u2190(p\u2261\u00a8(\u2282s)|p)/p\u2190(d~p)+\u2282z\n        b[z n]\u2190b[n z]\n        -\u2368\\n z\n    }\u2363\u2375\u22a2(s-1)0\n    \u2395\u2190b\n    \u236c{\n        b\u2261w:'win'\n        0=\u2374\u237a:\u235e\u2207 \u2375\n        e=i\u2190c\u2373m\u2190\u2283\u237a:'quit'\n        i>e:\u235e\u2207 \u2375\u22a3\u2395\u2190'invalid direction:'m\n        n\u2262s|n\u2190\u2375+i\u2283d:\u235e\u2207 \u2375\u22a3'out of bounds:'m\n        b[\u2375 n]\u2190b[n \u2375]\n        \u2395\u2190(s\u00d70\u2260\u2374\u237a)\u2374b\n        (1\u2193\u237a)\u2207 n\n    }z\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_120.txt",
        "content": "BEGIN\n    CLASS FIFTEENPUZZLE(NUMTILES, SIDE, WIDTH, SEED);\n        INTEGER NUMTILES, SIDE, WIDTH, SEED;\n    BEGIN\n        INTEGER ARRAY TILES(0:NUMTILES);\n        INTEGER BLANKPOS;\n \n        PROCEDURE INVARIANT;\n        BEGIN\n            INTEGER ARRAY UQ(0:NUMTILES);\n            INTEGER I;\n            FOR I\u00a0:= 0 STEP 1 UNTIL NUMTILES DO UQ(I)\u00a0:= -1;\n            FOR I\u00a0:= 0 STEP 1 UNTIL NUMTILES DO\n            BEGIN\n                INTEGER T;\n                T\u00a0:= TILES(I);\n                IF UQ(T) <> -1 THEN ERROR(\"TILES ARE NOT UNIQUE\");\n                UQ(T)\u00a0:= T;\n            END;\n            IF TILES(BLANKPOS) <> 0 THEN ERROR(\"BLANKPOS IS NOT BLANK\");\n        END;\n\n        PROCEDURE SHUFFLE;\n        BEGIN\n            BOOLEAN B;\n            WHILE NOT B DO\n            BEGIN\n                INTEGER N;\n                RESET;\n               \u00a0! DON'T INCLUDE THE BLANK SPACE IN THE SHUFFLE, LEAVE IT\n               \u00a0! IN THE HOME POSITION\u00a0;\n                N\u00a0:= NUMTILES;\n                WHILE N > 1 DO\n                BEGIN\n                    INTEGER R, TMP;\n                    R\u00a0:= UNIFORM(0, N, SEED); N\u00a0:= N - 1;\n                    TMP\u00a0:= TILES(R);\n                    TILES(R)\u00a0:= TILES(N);\n                    TILES(N)\u00a0:= TMP;\n                END;\n                B\u00a0:= ISSOLVABLE;\n            END;\n            INVARIANT;\n        END;\n     \n        PROCEDURE RESET;\n        BEGIN\n            INTEGER I;\n            FOR I\u00a0:= 0 STEP 1 UNTIL NUMTILES DO\n                TILES(I)\u00a0:= MOD((I + 1), NUMTILES + 1);\n            BLANKPOS\u00a0:= NUMTILES;\n            INVARIANT;\n        END;\n     \n       \u00a0! ONLY HALF THE PERMUTATIONS OF THE PUZZLE ARE SOLVABLE.\n       \u00a0! WHENEVER A TILE IS PRECEDED BY A TILE WITH HIGHER VALUE IT COUNTS\n       \u00a0! AS AN INVERSION. IN OUR CASE, WITH THE BLANK SPACE IN THE HOME\n       \u00a0! POSITION, THE NUMBER OF INVERSIONS MUST BE EVEN FOR THE PUZZLE\n       \u00a0! TO BE SOLVABLE.\n       \u00a0! SEE ALSO:\n       \u00a0! WWW.CS.BHAM.AC.UK/~MDR/TEACHING/MODULES04/JAVA2/TILESSOLVABILITY.HTML\n       \u00a0;\n\n        BOOLEAN PROCEDURE ISSOLVABLE;\n        BEGIN\n            INTEGER COUNTINVERSIONS;\n            INTEGER I, J;\n            FOR I\u00a0:= 0 STEP 1 UNTIL NUMTILES - 1 DO\n                FOR J\u00a0:= 0 STEP 1 UNTIL I - 1 DO\n                    IF TILES(J) > TILES(I) THEN\n                        COUNTINVERSIONS\u00a0:= COUNTINVERSIONS + 1;\n            ISSOLVABLE\u00a0:= MOD(COUNTINVERSIONS, 2) = 0;\n        END;\n\n        PROCEDURE PRINTBOARD;\n        BEGIN\n            INTEGER I, J;\n\n            PROCEDURE PRINTLINE;\n            BEGIN\n              INTEGER ROW, COL;\n             \u00a0!      +-----+-----+-----+-----+\u00a0;\n              FOR ROW\u00a0:= 1 STEP 1 UNTIL SIDE DO\n              BEGIN\n                  OUTCHAR('+');\n                  FOR COL\u00a0:= 0 STEP 1 UNTIL WIDTH DO OUTCHAR('-');\n              END;\n              OUTCHAR('+');\n              OUTIMAGE;\n            END;\n\n            PROCEDURE PRINTCELL(T); INTEGER T;\n            BEGIN\n                IF T = 0 THEN\n                BEGIN\n                    INTEGER R;\n                    FOR R\u00a0:= 1 STEP 1 UNTIL WIDTH DO\n                        OUTCHAR(' ');\n                END\n                ELSE OUTINT(T, WIDTH);\n                OUTCHAR(' ');\n            END;\n\n           \u00a0!      +-----+-----+-----+-----+\n           \u00a0!      |  1  |  2  |  3  |  4  |\n           \u00a0!      +-----+-----+-----+-----+\n           \u00a0!      |  5  |  6  |  7  |  8  |\n           \u00a0!      +-----+-----+-----+-----+\n           \u00a0!      |  9  |  10 |  11 |     |\n           \u00a0!      +-----+-----+-----+-----+\n           \u00a0!      |  13 |  14 |  15 |  12 |\n           \u00a0!      +-----+-----+-----+-----+  \u00a0;\n\n            FOR I\u00a0:= 1 STEP 1 UNTIL SIDE DO\n            BEGIN\n                PRINTLINE;\n                OUTCHAR('|');\n                FOR J\u00a0:= 1 STEP 1 UNTIL SIDE DO\n                BEGIN\n                    INTEGER T;\n                    T\u00a0:= TILES((I - 1) * SIDE + (J - 1));\n                    PRINTCELL(T);\n                    OUTCHAR('|');\n                END;\n                OUTIMAGE;\n            END;\n            PRINTLINE;\n        END;\n\n        BOOLEAN PROCEDURE DONE;\n        BEGIN\n            BOOLEAN ORDERED;\n            INTEGER I, EXPECT;\n            ORDERED\u00a0:= TRUE;\n            EXPECT\u00a0:= 1;\n            FOR I\u00a0:= 0 STEP 1 UNTIL NUMTILES - 1 DO\n            BEGIN\n                IF I <> BLANKPOS THEN\n                BEGIN\n                    IF TILES(I) <> EXPECT THEN\n                        ORDERED\u00a0:= FALSE;\n                    EXPECT\u00a0:= EXPECT + 1;\n                END;\n            END;\n            DONE\u00a0:= ORDERED;\n        END;\n\n        PROCEDURE REQUEST;\n        BEGIN\n            INTEGER ARRAY CANDIDATES(1:4);\n            INTEGER I, CANDCOUNT, CHOOSE;\n            BOOLEAN VALIDINPUT;\n\n            PROCEDURE ADDCAND(IDX); INTEGER IDX;\n            BEGIN\n                IF IDX >= 0 AND IDX <= NUMTILES THEN\n                BEGIN\n                    CANDCOUNT\u00a0:= CANDCOUNT + 1;\n                    CANDIDATES(CANDCOUNT)\u00a0:= TILES(IDX);\n                END;\n            END;\n\n            PRINTBOARD;\n\n            IF BLANKPOS <= NUMTILES - SIDE     THEN ADDCAND(BLANKPOS + SIDE);\n            IF BLANKPOS >= SIDE                THEN ADDCAND(BLANKPOS - SIDE);\n            IF MOD(BLANKPOS, SIDE) <> SIDE - 1 THEN ADDCAND(BLANKPOS + 1);\n            IF MOD(BLANKPOS, SIDE) <> 0        THEN ADDCAND(BLANKPOS - 1);\n\n            WHILE NOT VALIDINPUT DO\n            BEGIN\n                OUTTEXT(\"YOUR MOVE: \");\n\n                FOR I\u00a0:= 1 STEP 1 UNTIL CANDCOUNT DO\n                    OUTINT(CANDIDATES(I), SIDE);\n                OUTIMAGE;\n                CHOOSE\u00a0:= ININT;\n\n                FOR I\u00a0:= 1 STEP 1 UNTIL CANDCOUNT DO\n                    IF CHOOSE = CANDIDATES(I) THEN\n                    BEGIN\n                        INTEGER LOOKUP;\n                        FOR LOOKUP\u00a0:= 0 STEP 1 UNTIL NUMTILES DO\n                            IF NOT VALIDINPUT AND TILES(LOOKUP) = CHOOSE THEN\n                            BEGIN\n                                TILES(BLANKPOS)\u00a0:= TILES(LOOKUP);\n                                TILES(LOOKUP)\u00a0:= 0;\n                                BLANKPOS\u00a0:= LOOKUP;\n                                INVARIANT;\n                                VALIDINPUT\u00a0:= TRUE;\n                            END;\n                    END;\n\n                IF NOT VALIDINPUT THEN\n                BEGIN\n                    OUTTEXT(\"INVALID INPUT!\");\n                    OUTIMAGE;\n                END;\n            END;\n        END;\n\n        SHUFFLE;\n    END;\n \n    REF(FIFTEENPUZZLE) P;\n\n    OUTTEXT(\"INPUT RANDOM SEED: \");\n    OUTIMAGE;\n    P\u00a0:- NEW FIFTEENPUZZLE(15, 4, 3, ININT);\u00a0! ININT = RANDOM SEED\u00a0;\n    WHILE NOT P.DONE DO\n        P.REQUEST;\n    P.PRINTBOARD;\nEND.",
        "safe": true
    },
    {
        "filename": "15 puzzle game_121.txt",
        "content": "INPUT RANDOM SEED:\n456\n+----+----+----+----+\n| 15 |  8 | 13 | 14 |\n+----+----+----+----+\n|  1 |  2 |  9 |  4 |\n+----+----+----+----+\n| 12 |  3 |  5 |  7 |\n+----+----+----+----+\n| 11 |  6 | 10 |    |\n+----+----+----+----+\nYOUR MOVE:    7  10\n7\n+----+----+----+----+\n| 15 |  8 | 13 | 14 |\n+----+----+----+----+\n|  1 |  2 |  9 |  4 |\n+----+----+----+----+\n| 12 |  3 |  5 |    |\n+----+----+----+----+\n| 11 |  6 | 10 |  7 |\n+----+----+----+----+\nYOUR MOVE:    7   4   5\n4\n+----+----+----+----+\n| 15 |  8 | 13 | 14 |\n+----+----+----+----+\n|  1 |  2 |  9 |    |\n+----+----+----+----+\n| 12 |  3 |  5 |  4 |\n+----+----+----+----+\n| 11 |  6 | 10 |  7 |\n+----+----+----+----+\nYOUR MOVE:    4  14   9\n...\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_122.txt",
        "content": "(* Load required Modules for Moscow ML *)\nload \"Int\";\nload \"Random\";\n\n\n(* Mutable Matrix *)\nsignature MATRIX =\nsig\n\ttype 'a matrix\n\tval construct : 'a -> int * int -> 'a matrix\n\tval size : 'a matrix -> int * int\n\tval get : 'a matrix -> int * int -> 'a\n\tval set : 'a matrix -> int * int -> 'a -> unit\nend\n\nstructure Matrix :> MATRIX =\nstruct\n\t(* Array of rows, where the rows are a array of 'a *)\n\ttype 'a matrix = 'a Array.array Array.array\n\n\tfun 'a construct (a : 'a) (width, height) : 'a matrix =\n\t\tif width < 1 orelse height < 1\n\t\t\tthen raise Subscript\n\t\t\telse Array.tabulate (height, fn _ => Array.tabulate (width, fn _ => a))\n\t\n\tfun size b =\n\t\tlet\n\t\t\tval firstrow = Array.sub (b, 0)\n\t\tin\n\t\t\t(Array.length firstrow, Array.length b)\n\t\tend\n\n\t\n\tfun get b (x, y) = Array.sub (Array.sub (b, y), x)\n\n\tfun set b (x, y) v = Array.update (Array.sub (b, y), x, v)\nend\n\nsignature P15BOARD =\nsig\n\ttype board\n\tdatatype direction = North | East | South | West\n\n\tval construct : int * int -> board\n\tval emptyField : board -> int * int\n\tval get : board -> int * int -> int option\n\tval size : board -> int * int\n\n\texception IllegalMove\n\tval moves : board -> int list\n\tval move : board -> int -> unit\n\n\tval issolved : board -> bool\nend\n\n(* Game Logic and data *)\n\nstructure Board :> P15BOARD =\nstruct\n\t(* Matrix + empty Field position *)\n\ttype board = int option Matrix.matrix * (int * int) ref\n\t\n\tdatatype direction = North | East | South | West\n\n\texception IllegalMove\n\n\tfun numberat width (x, y) = (y*width + x + 1)\n\n\tfun construct (width, height) =\n\t\tlet\n\t\t\tval emptyBoard : int option Matrix.matrix = Matrix.construct NONE (width, height) \n\t\tin\n\t\t\t(* Fill the board with numbers *)\n\t\t\tList.tabulate (height, fn y => List.tabulate (width, fn x =>\n\t\t\t\t\tMatrix.set emptyBoard (x, y) (SOME (numberat width (x, y)))));\n\t\t\t(* Clear the last field *)\n\t\t\tMatrix.set emptyBoard (width-1, height-1) NONE;\n\t\t\t(* Return the board *)\n\t\t\t(emptyBoard, ref (width-1, height-1))\n\t\tend\n\n\tfun emptyField (_, rfield) = !rfield\n\n\tfun get (mat, _) (x, y) = Matrix.get mat (x, y)\n\n\tfun size (mat, _) = Matrix.size mat\n\n\t(* toggle the empty field with a given field *)\n\tfun toggle (mat, rpos) pos =\n\t\tlet\n\t\t\tval pos' = !rpos\n\t\t\tval value = Matrix.get mat pos\n\t\tin\n\t\t\tMatrix.set mat pos NONE;\n\t\t\tMatrix.set mat pos' value;\n\t\t\trpos := pos\n\t\tend\n\n\t(* Get list of positions of the neighbors of a given field *)\n\tfun neighbors mat (x, y) : (int * int) list =\n\t\tlet\n\t\t\tval (width, height) = Matrix.size mat\n\t\t\tval directions = [(x, y-1), (x+1, y), (x, y+1), (x-1, y)]\n\t\tin\n\t\t\tList.mapPartial (fn pos => SOME (Matrix.get mat pos; pos) handle Subscript => NONE) directions\n\t\tend\n\t\n\tfun moves (mat, rpos) =\n\t\tlet\n\t\t\tval neighbors = neighbors mat (!rpos)\n\t\tin\n\t\t\tmap (fn pos => valOf (Matrix.get mat pos)) neighbors\n\t\tend\n\t\t\n\tfun move (mat, rpos) m =\n\t\tlet\n\t\t\tval (hx, hy) = !rpos\n\t\t\tval neighbors = neighbors mat (hx, hy)\n\t\t\tval optNeighbor = List.find (fn pos => SOME m = Matrix.get mat pos) neighbors\n\t\tin\n\t\t\tif isSome optNeighbor\n\t\t\tthen\n\t\t\t\ttoggle (mat, rpos) (valOf optNeighbor)\n\t\t\telse\n\t\t\t\traise IllegalMove\n\t\tend\n\n\tfun issolved board =\n\t\tlet\n\t\t\tval (width, height) = size board\n\t\t\tval xs = List.tabulate (width,  fn x => x)\n\t\t\tval ys = List.tabulate (height, fn y => y)\n\t\tin\n\t\t\tList.all (fn x => List.all (fn y => (x + 1 = width andalso y + 1 = height) orelse get board (x, y) = SOME (numberat width (x,y))) ys) xs\n\t\tend\nend\n\n(* Board Shuffle *)\nsignature BOARDSHUFFLE =\nsig\n\tval shuffle : Board.board -> int -> unit\nend\n\nstructure Shuffle :> BOARDSHUFFLE =\nstruct\n\t(*\n\t * Note: Random Number Interfaces are different in SML/NJ and Moscow ML. Comment out the corresponding version:\n\t *)\n\n\t(*\n\t(* SML/NJ - Version *)\n\tval time = Time.now ()\n\tval timeInf = Time.toMicroseconds time\n\tval timens = Int.fromLarge (LargeInt.mod (timeInf, 1073741823));\n\tval rand = Random.rand (timens, timens)\n\n\tfun next n = Random.randRange (0, n) rand\n\t*)\n\n\t(* Moscow ML - Version *)\n\tval generator = Random.newgen ()\n\tfun next n = Random.range (0, n) generator\n\n\n\tfun shuffle board 0 = if (Board.issolved board) then shuffle board 1 else ()\n\t  | shuffle board n =\n\t  \tlet\n\t\t\tval moves = Board.moves board\n\t\t\tval move  = List.nth (moves, next (List.length moves - 1))\n\t\tin\n\t\t\tBoard.move board move;\n\t\t\tshuffle board (n-1)\n\t\tend\nend\n\n\n(* Console interface *)\n\nsignature CONSOLEINTERFACE =\nsig\n\tval start : unit -> unit\n\tval printBoard : Board.board -> unit\nend\n\nstructure Console :> CONSOLEINTERFACE =\nstruct\n\tfun cls () = print \"\\^[[1;1H\\^[[2J\"\n\n\tfun promptNumber prompt =\n\t\tlet\n\t\t\tval () = print prompt\n\t\t\t(* Input + \"\\n\" *)\n\t\t\tval line   = valOf (TextIO.inputLine TextIO.stdIn)\n\t\t\tval length = String.size line\n\t\t\tval input  = String.substring (line, 0, length - 1)\n\t\t\tval optnum = Int.fromString input\n\t\tin\n\t\t\tif isSome optnum\n\t\t\t\tthen valOf optnum\n\t\t\t\telse (print \"Input is not a number.\\n\"; promptNumber prompt)\n\t\tend\n\n\tfun fieldToString (SOME x) = Int.toString x\n\t  | fieldToString (NONE  ) = \"\"\n\n\tfun boardToString board =\n\t\tlet\n\t\t\tval (width, height) = Board.size board\n\t\t\tval xs = List.tabulate (width,  fn x => x)\n\t\t\tval ys = List.tabulate (height, fn y => y)\n\t\tin\n\t\t\tfoldl (fn (y, str) => (foldl (fn (x, str') => str' ^ (fieldToString (Board.get board (x, y))) ^ \"\\t\") str xs) ^ \"\\n\") \"\" ys\n\t\tend\n\t\n\tfun printBoard board = print (boardToString board)\n\n\n\tfun loop board =\n\t\tlet\n\t\t\tval rvalidInput = ref false\n\t\t\tval rinput      = ref 42\n\t\t\tval () = cls ()\n\t\t\tval () = printBoard board\n\t\tin\n\t\t\t(* Ask for a move and repeat until it is a valid move *)\n\t\t\twhile (not (!rvalidInput)) do\n\t\t\t\t(\n\t\t\t\t\trinput := promptNumber \"Input the number to move: \";\n\t\t\t\t\tBoard.move board (!rinput);\n\t\t\t\t\trvalidInput := true\n\t\t\t\t) handle Board.IllegalMove => print \"Illegal move!\\n\"\n\t\tend\n\n\t\n\tfun start () =\n\t\tlet\n\t\t\tval () = cls ()\n\t\t\tval () = print \"Welcome to nxm-Puzzle!\\n\"\n\t\t\tval (width, height) = (promptNumber \"Enter the width: \", promptNumber \"Enter the height: \")\n\t\t\tval diff = (promptNumber \"Enter the difficulty (number of shuffles): \")\n\t\t\tval board = Board.construct (width, height)\n\t\tin\n\t\t\tShuffle.shuffle board diff;\n\t\t\twhile (not (Board.issolved board)) do loop board;\n\t\t\tprint \"Solved!\\n\"\n\t\tend\nend\n\n\nval () = Console.start()\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_123.txt",
        "content": " # 15puzzle_21.tcl - HaJo Gurt -  2016-02-16\n # http://wiki.tcl.tk/14403\n\n #: 15-Puzzle - with grid, buttons and colors\n\n  package require Tk\n\n  set progVersion \"15-Puzzle v0.21\";        # 2016-02-20\n\n  global Msg Moves PuzzNr GoalNr\n  set Msg    \" \"\n  set Moves  -1\n  set PuzzNr  0\n  set GoalNr  0\n\n  set Keys   { 11 12 13 14  21 22 23 24  31 32 33 34  41 42 43 44 }\n\n  set Puzz_T {  T  h  e  F   i  f  t  e   e  n  P  u   z  z  l  e }; # Title\n  set Goal_T {  x  x  x  F   i  f  t  e   e  n  x  x   x  x  x  x }; # Title-highlight\n\n  set Puzz_0 {  E  G  P  N   C  A  F  B   D  L  H  I   O  K  M  _ }; # -  / 116\n  set Puzz_1 {  C  A  F  B   E  G  P  N   D  L  H  I   O  K  M  _ }; # E  / 156 from Tk-demo\n  set Puzz_2 {  E  O  N  K   M  I  _  G   B  H  L  P   C  F  A  D }; # L  / 139\n  set Puzz_3 {  P  G  M  _   E  L  N  D   O  K  H  I   B  C  F  A }; # EK / 146\n\n  set Goal_0 {  A  B  C  D   E  F  G  H   I  K  L  M   N  O  P  _ }; # Rows LTR   / 1:E\u00a0: 108\n  set Goal_1 {  A  E  I  N   B  F  K  O   C  G  L  P   D  H  M  _ }; # Cols forw. / 1:M\u00a0: 114\n\n  set Puzz $Puzz_T\n  set Goal $Goal_T\n\n#---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+---\n\n  proc Move {k} {\n  # find the key with the empty tile:\n    set e -1\n    foreach p $::Keys  {\n      set t [.key$p cget -text]\n      if { $t eq \"_\" } { set e $p }\n    }\n    if {$e  <  0} {return 0};   # no key with empty tile found\n    if {$k == $e} {return 0};   # click was on the empty tile\n\n    set t [.key$k cget -text]\n    .key$e config -text $t\n    .key$k config -text \"_\";  \n    return 1\n  }\n\n  proc Check {} {\n    set ok 0\n    set i  0\n    foreach k $::Keys {\n      set t [.key$k cget -text]\n      set g [lindex $::Goal $i]\n      incr i\n\n      .key$k config -background white\n      if { $t eq $g  } { .key$k config -background lightgreen; incr ok }\n      if { $t eq \"_\" } { .key$k config -background gray }\n    }\n\n    # Solved:\n    update\n    if { $ok > 15 && $::Moves > 0} {\n      foreach k $::Keys  {\n        .key$k flash; bell;\n      }\n    }\n  }\n\n  proc Click {k} {\n    set ::Msg \"\"\n    set val [.key$k cget -text]\n    set ok [Move $k]\n\n    incr ::Moves $ok\n    wm title . \"$::Moves moves\"\n    Check\n  }\n\n  proc ShowKeys {} {\n    set i 0\n    foreach k $::Keys  {\n      set t [lindex $::Puzz $i]\n      incr i\n      .key$k config -text $t -background white;  \n    }\n    Check\n  }\n\n  proc NewGame {N} {\n    global Msg Moves PuzzNr GoalNr\n\n    incr  PuzzNr $N\n    if { $PuzzNr > 3} { set PuzzNr 0 }\n\n                         set ::Goal $::Goal_0;\n    if { $GoalNr == 1} { set ::Goal $::Goal_1; }\n\n    if { $PuzzNr == 0} { set ::Puzz $::Puzz_0; }\n    if { $PuzzNr == 1} { set ::Puzz $::Puzz_1; }\n    if { $PuzzNr == 2} { set ::Puzz $::Puzz_2; }\n    if { $PuzzNr == 3} { set ::Puzz $::Puzz_3; }\n\n                  set Msg \"Try again\"\n    if { $N>0 } { set Msg \"New game\" }\n\n    set Moves 0\n    ShowKeys\n    wm title . \"$Msg \"\n  }\n\n#---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+---\n\n  button .reset   -text \"Restart\"  -fg blue -command {NewGame  0}\n  button .newGame -text \"New Game\" -fg red  -command {NewGame +1}\n\n  foreach k $::Keys {\n    button .key$k -text \"$k\" -width 4 -command \"Click $k\"\n  }\n\n  grid .newGame x .reset x -sticky nsew\n\n  grid .key11 .key12 .key13 .key14  -sticky nsew  -padx 2 -pady 2\n  grid .key21 .key22 .key23 .key24  -sticky nsew  -padx 2 -pady 2\n  grid .key31 .key32 .key33 .key34  -sticky nsew  -padx 2 -pady 2\n  grid .key41 .key42 .key43 .key44  -sticky nsew  -padx 2 -pady 2\n\n  grid configure .newGame .reset  -columnspan 2 -padx 4\n\n  ShowKeys; Check\n  wm title . $progVersion\n  focus -force .\n  wm resizable . 0 0\n\n# For some more versions, see:  http://wiki.tcl.tk/15067\u00a0: Classic 15 Puzzle and http://wiki.tcl.tk/15085\u00a0: N-Puzzle\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_124.txt",
        "content": "#!/usr/bin/env bash\nmain() {\n  local puzzle=({1..15} \" \") blank moves_kv i key count total last\n  printf '\\n'\n  show_puzzle \"${puzzle[@]}\"\n  printf '\\nPress return to scramble.'\n  read _\n  IFS= readarray -t puzzle < <(scramble \"${puzzle[@]}\")\n  printf '\\r\\e[A\\e[A\\e[A\\e[A\\e[A\\e[A'\n  show_puzzle \"${puzzle[@]}\"\n  printf '\\nUse hjkl to slide tiles. '\n  printf '\\r\\e[A\\e[A\\e[A\\e[A\\e[A'\n  total=0\n  while ! solved \"${puzzle[@]}\"; do\n    show_puzzle \"${puzzle[@]}\"\n    { read blank; readarray -t moves_kv; } < <(find_moves \"${puzzle[@]}\")\n    local count=${#moves_kv[@]}/2\n    local -A moves\n    for (( i=0; i<count; i++ )); do\n      moves[${moves_kv[i]}]=${moves_kv[i+count]}\n    done\n    read -r -n 1 key\n    printf '\\r '\n    if [[ \"$key\" = u ]]; then\n      (( total -= 2 ))\n      case \"$last\" in\n        h) key=l;;\n        j) key=k;;\n        k) key=j;;\n        l) key=h;;\n      esac\n    fi\n    if [[ -n \"${moves[$key]}\" ]]; then\n      last=$key\n      (( total++ ))\n      i=${moves[$key]}\n      puzzle[$blank]=${puzzle[i]}\n      puzzle[i]=' '\n    fi\n    printf '\\r\\e[A\\e[A\\e[A\\e[A'\n  done\n  show_puzzle \"${puzzle[@]}\"\n  printf '\\nSolved in %d moves.     \\n' \"$total\"\n}\n\n\nsolved() { \n  local solved=({1..15} ' ')\n  [[ \"${puzzle[*]}\" == \"${solved[*]}\" ]]\n}\n\nshow_puzzle() {\n  printf '%2s %2s %2s %2s\\n' \"$@\"\n}\n\nfind_moves() {\n  local puzzle=(\"$@\")\n  local i j blank\n  for (( i=0; i<${#puzzle[@]}; ++i )); do\n    if [[ \"${puzzle[i]}\" == \" \" ]]; then\n      blank=$i\n      break\n    fi\n  done\n  local -A moves=()\n  if (( blank%4 )); then\n    # swapping blank with tile to its left\n    # is sliding that tile right, which is the l key\n    moves['l']=$(( blank-1 )) \n  fi\n  if (( blank%4 != 3 )); then\n    moves['h']=$(( blank+1 )) # left\n  fi\n  if (( blank >= 4 )); then\n    moves['j']=$(( blank-4 )) # down\n  fi\n  if (( blank < 12 )); then\n    moves['k']=$(( blank+4 )) # up\n  fi\n  printf '%s\\n' \"$blank\" \"${!moves[@]}\" \"${moves[@]}\" \n}\n\nscramble() {\n  local puzzle=(\"$@\") i j \n  for (( i=0; i<256; ++i )); do\n    local blank moves\n    { read blank; readarray -t moves; } < <(find_moves \"${puzzle[@]}\")\n    moves=(${moves[@]:${#moves[@]}/2})\n    local dir=$(( RANDOM % ${#moves[@]} ))\n    j=${moves[dir]}\n    puzzle[blank]=${puzzle[j]}\n    puzzle[j]=' '\n  done\n  printf '%s\\n' \"${puzzle[@]}\"\n}\n\nmain \"$@\"\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_125.txt",
        "content": " 1  2  3  4\n 5  6  7  8\n 9 10 11 12\n13 14 15   \n\nPress return to scramble.\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_126.txt",
        "content": "Public iSide As Integer\nPublic iSize As Integer\nPublic iGrid() As Integer\nPublic lMoves As Long\nPublic sMessage As String\nPublic Const sTitle As String = \"Tile Puzzle\"\n\n\nSub PlayGame()\n    Dim iNum As Integer\n    Dim i As Integer\n    Dim vInput As Variant\n\nDefineGrid:\n    vInput = InputBox(\"Enter size of grid, as a whole number\" & String(2, vbCr) & \"(e.g. for a 4 x 4 grid, enter '4')\", sTitle, 4)\n    If vInput = \"\" Then Exit Sub\n    If Not IsNumeric(vInput) Then GoTo DefineGrid\n    iSide = vInput\n    If iSide < 3 Or iNum > 10 Then GoTo DefineGrid\n    iSize = iSide ^ 2\n    ReDim iGrid(1 To iSize)\n    \nInitalize:\n    InitializeGrid\n    If Not IsSolvable Then GoTo Initalize\n      \nGetInput:\n    vInput = InputBox(ShowGrid & vbCr & \"Enter number to move into empty tile\", sTitle)\n    If vInput = \"\" Then\n        If MsgBox(\"Are you sure? This will end the current game.\", vbExclamation + vbYesNo, sTitle) = vbYes Then Exit Sub\n    End If\n    If Not IsNumeric(vInput) Then\n        sMessage = \"'\" & vInput & \"' is not a valid tile\"\n        GoTo GetInput\n    End If\n    iNum = vInput\n    If iNum < 1 Or iNum > iSize - 1 Then\n        sMessage = iNum & \" is not a valid tile\"\n        GoTo GetInput\n    End If\n    i = FindTile(iNum)\n    If Not ValidMove(i) Then GoTo GetInput\n    MoveTile (i)\n    If TestGrid Then\n        MsgBox \"SUCCESS! You solved the puzzle in \" & lMoves & \" moves\", vbInformation + vbOKOnly, sTitle\n    Else\n        GoTo GetInput\n    End If\nEnd Sub\n\nFunction RandomTile() As Integer\n    Randomize\n    RandomTile = Int(Rnd * iSize) + 1\nEnd Function\n\nFunction GetX(ByVal i As Integer) As Integer\n    GetX = Int((i - 1) / iSide) + 1\nEnd Function\n\nFunction GetY(ByVal i As Integer) As Integer\n    GetY = (i - 1) Mod iSide + 1\nEnd Function\n\nFunction GetI(ByVal x As Integer, y As Integer)\n    GetI = (x - 1) * iSide + y\nEnd Function\n\nFunction InitializeGrid()\n    Dim i As Integer\n    Dim x As Integer\n    Dim y As Integer\n    \n    sMessage = \"New \" & iSide & \" x \" & iSide & \" game started\" & vbCr\n    \n    For i = 1 To iSize\n        iGrid(i) = 0\n    Next i\n    For i = 1 To iSize - 1\n        Do\n            x = RandomTile\n            If iGrid(x) = 0 Then iGrid(x) = i\n        Loop Until iGrid(x) = i\n    Next i\n    lMoves = 0\nEnd Function\n\nFunction IsSolvable() As Boolean\n    Dim i As Integer\n    Dim j As Integer\n    Dim iCount As Integer\n    For i = 1 To iSize - 1\n        For j = i + 1 To iSize\n            If iGrid(j) < iGrid(i) And iGrid(j) > 0 Then iCount = iCount + 1\n        Next j\n    Next i\n    If iSide Mod 2 Then\n        IsSolvable = Not iCount Mod 2\n    Else\n        IsSolvable = iCount Mod 2 = GetX(FindTile(0)) Mod 2\n    End If\nEnd Function\n\nFunction TestGrid() As Boolean\n    Dim i As Integer\n    \n    For i = 1 To iSize - 1\n        If Not iGrid(i) = i Then\n            TestGrid = False\n            Exit Function\n        End If\n    Next i\n    TestGrid = True\nEnd Function\n\nFunction FindTile(ByVal iNum As Integer) As Integer\n    Dim i As Integer\n    For i = 1 To iSize\n        If iGrid(i) = iNum Then\n            FindTile = i\n            Exit Function\n        End If\n    Next i\nEnd Function\n\nFunction ValidMove(ByVal i As Integer) As Boolean\n    Dim e As Integer\n    Dim xDiff As Integer\n    Dim yDiff As Integer\n    \n    e = FindTile(0)\n    xDiff = GetX(i) - GetX(e)\n    yDiff = GetY(i) - GetY(e)\n    If xDiff = 0 Then\n        If yDiff = 1 Then\n            sMessage = \"Tile \" & iGrid(i) & \" was moved left\"\n            ValidMove = True\n        ElseIf yDiff = -1 Then\n            sMessage = \"Tile \" & iGrid(i) & \" was moved right\"\n            ValidMove = True\n        End If\n    ElseIf yDiff = 0 Then\n        If xDiff = 1 Then\n            sMessage = \"Tile \" & iGrid(i) & \" was moved up\"\n            ValidMove = True\n        ElseIf xDiff = -1 Then\n            sMessage = \"Tile \" & iGrid(i) & \" was moved down\"\n            ValidMove = True\n        End If\n    End If\n    If Not ValidMove Then sMessage = \"Tile \" & iGrid(i) & \" may not be moved\"\nEnd Function\n\nFunction MoveTile(ByVal i As Integer)\n    Dim e As Integer\n    e = FindTile(0)\n    iGrid(e) = iGrid(i)\n    iGrid(i) = 0\n    lMoves = lMoves + 1\nEnd Function\n\nFunction ShowGrid()\n    Dim x As Integer\n    Dim y As Integer\n    Dim i As Integer\n    Dim sNum As String\n    Dim s As String\n    \n    For x = 1 To iSide\n        For y = 1 To iSide\n            sNum = iGrid(GetI(x, y))\n            If sNum = \"0\" Then sNum = \"\"\n            s = s & sNum & vbTab\n        Next y\n        s = s & vbCr\n    Next x\n    If Not sMessage = \"\" Then\n        s = s & vbCr & sMessage & vbCr\n    End If\n    ShowGrid = s\nEnd Function\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_127.txt",
        "content": "10  4   3   14  \n9   15  1   6   \n12  11  7   8   \n2   5       13  \n\nNew 4 x 4 game started\n\nEnter number to move into empty tile\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_128.txt",
        "content": "Public Class Board\n    Inherits System.Windows.Forms.Form\n\n    Const XbyX = 4\n    Const XSize = 60\n\n    Private Empty As New Panel\n    Private Tiles As New List(Of Tile)\n    Private Moves As Integer\n\n    Public Sub New()\n        Me.Text = XbyX ^ 2 - 1 & \" Puzzle Game\"\n        Me.ClientSize = New Size(XbyX * XSize, XbyX * XSize)\n        Me.FormBorderStyle = FormBorderStyle.FixedToolWindow\n        Restart()\n    End Sub\n\n    Public Sub Restart()\n        Dim Start As List(Of Integer) = MakeCompleteable(GetRandamStartOrder())\n\n        Empty.SetBounds(((XbyX ^ 2 - 1) Mod XbyX) * XSize, ((XbyX ^ 2 - 1) \\ XbyX) * XSize, XSize, XSize)\n\n        Me.Moves = 0\n        Me.Tiles.Clear()\n        Me.Controls.Clear()\n        For No = 0 To XbyX ^ 2 - 2\n            Dim Tile As New Tile\n            Tile.Text = Start(No)\n            Tile.Board = Me\n            Tile.SetBounds((No Mod XbyX) * XSize, (No \\ XbyX) * XSize, XSize, XSize)\n            Me.Tiles.Add(Tile)\n            Me.Controls.Add(Tile)\n        Next\n\n    End Sub\n\n    Public Sub IsComplete()\n        Me.Moves += 1\n        If Empty.Left = ((XbyX ^ 2 - 1) Mod XbyX) * XSize AndAlso Empty.Top = ((XbyX ^ 2 - 1) \\ XbyX) * XSize Then\n            Me.Tiles.Sort()\n            For x = 1 To XbyX ^ 2 - 1\n                If Not Tiles(x - 1).Text = x Then\n                    Exit Sub\n                End If\n            Next\n            MsgBox($\"Completed in {Me.Moves} Moves!\", MsgBoxStyle.Information, \"Winner\")\n            Restart()\n        End If\n    End Sub\n\n    Public Class Tile\n        Inherits Button\n        Implements IComparable(Of Tile)\n        Public Board As Board\n        Private Sub Tile_Click(sender As Object, e As EventArgs) Handles Me.Click\n            With Board.Empty\n                If Me.Left = .Left AndAlso (Me.Top + Me.Height = .Top OrElse .Top + .Height = Me.Top) Then\n                    Swap()\n                ElseIf Me.Top = .Top AndAlso (Me.Left + Me.Width = .Left OrElse .Left + .Width = Me.Left) Then\n                    Swap()\n                End If\n            End With\n        End Sub\n        Private Sub Swap()\n            Dim p = Board.Empty.Location\n            Board.Empty.Location = Me.Location\n            Me.Location = p\n            Board.IsComplete()\n        End Sub\n        Public Function CompareTo(other As Tile) As Integer Implements IComparable(Of Tile).CompareTo\n            Dim Result = Me.Top.CompareTo(other.Top)\n            If Result = 0 Then\n                Return Me.Left.CompareTo(other.Left)\n            End If\n            Return Result\n        End Function\n    End Class\n\n    Public Function GetRandamStartOrder() As List(Of Integer)\n        Dim List As New List(Of Integer)\n        Dim Random As New Random()\n        Do While List.Count < XbyX ^ 2 - 1\n            Dim Value As Integer = Random.Next(1, XbyX ^ 2)\n            If Not List.Contains(Value) Then\n                List.Add(Value)\n            End If\n        Loop\n        Return List\n    End Function\n\n    Public Function MakeCompleteable(List As List(Of Integer)) As List(Of Integer)\n        'ToDo\n        Return List\n    End Function\n\nEnd Class\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_129.txt",
        "content": "/* ------------------------------------------------------------------------------------------------------\n\n                                               Copyright (c) 2004 - Gal Zsolt (CalmoSoft)\n\n   ------------------------------------------------------------------------------------------------------ */\n\nimplement playDialog\n    open core, vpiDomains, vpiOldDomains, resourceIdentifiers\n\n    facts\n        thisWin\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n\n    clauses\n        show(Parent):-\n            _ = vpi::winCreateDynDialog(Parent, controlList, eventHandler, gui_api::lNull).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        eventHandler\u00a0: vpiDomains::ehandler.\n    clauses\n        eventHandler(Win, Event) = Result\u00a0:-\n            Result = generatedEventHandler(Win, Event).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n\n    predicates\n        onDestroy\u00a0: vpiOldDomains::destroyHandler.\n    clauses\n        onDestroy() = vpiOldDomains::defaultHandling()\u00a0:-\n            thisWin\u00a0:= erroneous.\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlCancel\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlCancel(_Ctrl, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull)\u00a0:-\n            file::save(\"game.dba\",gameDB),\n            retractall(table(_,_)),\n            retractall(gameplay(_,_)),\n            retractall(empty_cell(_)),\n            retractall(cell(_,_)),\n            retractall(cellnr(_,_)),\n            retractall(good(_,_,_)),\n            vpi::winDestroy(thisWin).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n predicates\n        onUpdate\u00a0: vpiOldDomains::updateHandler.\n    clauses\n        onUpdate(Rectangle) = vpiOldDomains::defaultHandling():-\n            vpi::winClear( thisWin,Rectangle,0x808040),\n           \u00a0!.\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    class facts - gameDB\n        table:(integer,string).\n        gameplay:(integer,integer).\n        empty_cell:(integer).\n\n    class facts\n        cell:(integer,vpiDomains::windowHandle).\n        cellnr:(integer,integer).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    class facts\n        step_nr:integer:=0.\n\n    predicates\n        onCreate\u00a0: vpiOldDomains::createHandler.\n    clauses\n        onCreate(_CreationData) = vpiOldDomains::defaultHandling():-\n            retractall(table(_,_)),\n            retractall(gameplay(_,_)),\n            retractall(empty_cell(_)),\n            retractall(cell(_,_)),\n            retractall(cellnr(_,_)),\n            retractall(good(_,_,_)),\n\n            scrollbars_init(),\n            cellhandle_init(),\n            empty:=16,\n            good_cell(0),\n            table_save(),\n            step_nr:=0,\n            fail.\n        onCreate(_CreationData) = vpiOldDomains::defaultHandling().\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    facts\n        vsbarr\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        vsbarl\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        hsbart\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        hsbarb\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n\n    predicates\n        scrollbars_init:().\n    clauses\n        scrollbars_init():-\n            vsbarr\u00a0:= vpi::winGetCtlHandle(thisWin,idc_sbvr),\n            vsbarl\u00a0:= vpi::winGetCtlHandle(thisWin,idc_sbvl),\n            hsbart\u00a0:= vpi::winGetCtlHandle(thisWin,idc_sbht),\n            hsbarb\u00a0:= vpi::winGetCtlHandle(thisWin,idc_sbhb),\n\n\n            vpi::winSetScrollRange(vsbarr,sb_Ctl,1,4),\n            vpi::winSetScrollProportion(vsbarr,sb_Ctl,1),\n            vpi::winSetScrollPos(vsbarr,sb_Ctl,4),\n\n            vpi::winSetScrollRange(vsbarl,sb_Ctl,1,4),\n            vpi::winSetScrollProportion(vsbarl,sb_Ctl,1),\n            vpi::winSetScrollPos(vsbarl,sb_Ctl,4),\n\n            vpi::winSetScrollRange(hsbart,sb_Ctl,1,4),\n            vpi::winSetScrollProportion(hsbart,sb_Ctl,1),\n            vpi::winSetScrollPos(hsbart,sb_Ctl,4),\n\n            vpi::winSetScrollRange(hsbarb,sb_Ctl,1,4),\n            vpi::winSetScrollProportion(hsbarb,sb_Ctl,1),\n            vpi::winSetScrollPos(hsbarb,sb_Ctl,4).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    class facts\n        cell1\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell2\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell3\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell4\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell5\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell6\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell7\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell8\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell9\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell10\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell11\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell12\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell13\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell14\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell15\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell16\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n\n    predicates\n        cell_handle:().\n    clauses\n        cell_handle():-\n            cell1:=vpi::winGetCtlHandle(thisWin,idc_cell1),\n            cell2:=vpi::winGetCtlHandle(thisWin,idc_cell2),\n            cell3:=vpi::winGetCtlHandle(thisWin,idc_cell3),\n            cell4:=vpi::winGetCtlHandle(thisWin,idc_cell4),\n            cell5:=vpi::winGetCtlHandle(thisWin,idc_cell5),\n            cell6:=vpi::winGetCtlHandle(thisWin,idc_cell6),\n            cell7:=vpi::winGetCtlHandle(thisWin,idc_cell7),\n            cell8:=vpi::winGetCtlHandle(thisWin,idc_cell8),\n            cell9:=vpi::winGetCtlHandle(thisWin,idc_cell9),\n            cell10:=vpi::winGetCtlHandle(thisWin,idc_cell10),\n            cell11:=vpi::winGetCtlHandle(thisWin,idc_cell11),\n            cell12:=vpi::winGetCtlHandle(thisWin,idc_cell12),\n            cell13:=vpi::winGetCtlHandle(thisWin,idc_cell13),\n            cell14:=vpi::winGetCtlHandle(thisWin,idc_cell14),\n            cell15:=vpi::winGetCtlHandle(thisWin,idc_cell15),\n            cell16:=vpi::winGetCtlHandle(thisWin,idc_cell16).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        cellhandle_init:().\n    clauses\n        cellhandle_init():-\n            retractall(cell(_,_)),\n            cell_handle(),\n\n            assert(cell(1,cell1)),\n            assert(cell(2,cell2)),\n            assert(cell(3,cell3)),\n            assert(cell(4,cell4)),\n            assert(cell(5,cell5)),\n            assert(cell(6,cell6)),\n            assert(cell(7,cell7)),\n            assert(cell(8,cell8)),\n            assert(cell(9,cell9)),\n            assert(cell(10,cell10)),\n            assert(cell(11,cell11)),\n            assert(cell(12,cell12)),\n            assert(cell(13,cell13)),\n            assert(cell(14,cell14)),\n            assert(cell(15,cell15)),\n            assert(cell(16,cell16)).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    class facts\n        good_nr:integer:=0.\n        good:(integer,integer,integer) nondeterm.\n        empty:integer:=16.\n\n    predicates\n        good_cell:(integer) multi.\n    clauses\n        good_cell(16):-!.\n        good_cell(Number):-\n            NumberNew = Number+1,\n            good_nr:=0,\n            good_above(NumberNew),                   \u00a0% movable cells above empty cell\n            good_before(NumberNew),                   \u00a0% movable cells before empty cell\n            good_after(NumberNew),                      \u00a0% movable cells after empty cell\n            good_under(NumberNew),                     \u00a0% movable cells under empty cell\n            assert(cellnr(NumberNew,good_nr)),      \u00a0% number of movable cells around the empty cell\n            good_cell(NumberNew).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        good_above:(integer).\n    clauses\n        good_above(Number):-\n            Number > 4,                                            \u00a0% movable cells above empty cell\n            good_nr:= good_nr+1,\n            assert(good(Number,good_nr,Number-4)),\n            fail.\n        good_above(_).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        good_before:(integer).\n    clauses\n        good_before(Number):-\n            (Number mod 4) <> 1,                              \u00a0% movable cells before empty cell\n            good_nr:= good_nr+1,\n            assert(good(Number,good_nr,Number-1)),\n            fail.\n        good_before(_).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        good_after:(integer).\n    clauses\n        good_after(Number):-\n            (Number mod 4) > 0,                                  \u00a0% movable cells after empty cell\n            good_nr:= good_nr+1,\n            assert(good(Number,good_nr,Number+1)),\n            fail.\n        good_after(_).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        good_under:(integer).\n    clauses\n        good_under(Number):-\n            Number < 13,                                              \u00a0% movable cells under empty cell\n            good_nr:= good_nr+1,\n            assert(good(Number,good_nr,Number+4)),\n            fail.\n        good_under(_).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        cell_click:(integer).\n\n    clauses\n        cell_click(NrCell):-\n            good(empty,_,NrCell),\n            cell(empty,EmptyHandle),\n            cell(NrCell,NrCellHandle),\n            EmptyNr = vpi::winGetText(NrCellHandle),\n            vpi::winSetText(EmptyHandle,EmptyNr),\n            vpi::winSetText(NrCellHandle,\"\"),\n            empty:=NrCell,\n            step_nr\u00a0:= step_nr + 1,\n            Bingo = vpi::winGetCtlHandle(thisWin,idc_bingo),\n            vpi::winSetText(  Bingo, \"\"),\n            vpi::winSetState(Bingo,[wsf_Invisible]),\n            bingo(),\n\n           \u00a0% VerVal = uncheckedConvert(integer, math::floor((empty-1)/4)+1),\n           \u00a0% HorVal = uncheckedConvert(integer, math::floor((empty-1) mod 4)+1),\n\n            VerVal = math::floor((empty-1)/4)+1,\n            HorVal = math::floor((empty-1) mod 4)+1,\n\n            vpi::winSetScrollPos(vsbarr,sb_Ctl,VerVal),\n            vpi::winSetScrollPos(vsbarl,sb_Ctl,VerVal),\n            vpi::winSetScrollPos(hsbart,sb_Ctl,HorVal),\n            vpi::winSetScrollPos(hsbarb,sb_Ctl,HorVal),\n\n            Step = vpi::winGetCtlHandle(thisWin,idc_step),\n            vpi::winSetText(Step,toString(step_nr)),\n\n            assert(gameplay(step_nr,NrCell)),\n\n            fail.\n        cell_click(_).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        cell_click_play:(integer).\n\n    clauses\n        cell_click_play(NrCell):-\n            good(empty,_,NrCell),\n            cell(empty,EmptyHandle),\n            cell(NrCell,NrCellHandle),\n            EmptyNr = vpi::winGetText(NrCellHandle),\n            vpi::winSetText(EmptyHandle,EmptyNr),\n            vpi::winSetText(NrCellHandle,\"\"),\n            empty:=NrCell,\n            Bingo = vpi::winGetCtlHandle(thisWin,idc_bingo),\n            vpi::winSetText(Bingo, \"\"),\n            vpi::winSetState(Bingo,[wsf_Invisible]),\n            bingo(),\n\n           \u00a0% VerVal = uncheckedConvert(integer,math::floor((empty-1)/4)+1),\n           \u00a0% HorVal = uncheckedConvert(integer,math::floor((empty-1) mod 4)+1),\n\n            VerVal = math::floor((empty-1)/4)+1,\n            HorVal = math::floor((empty-1) mod 4)+1,\n\n            vpi::winSetScrollPos(vsbarr,sb_Ctl,VerVal),\n            vpi::winSetScrollPos(vsbarl,sb_Ctl,VerVal),\n            vpi::winSetScrollPos(hsbart,sb_Ctl,HorVal),\n            vpi::winSetScrollPos(hsbarb,sb_Ctl,HorVal),\n\n            programControl::sleep(1000),\n\n            fail.\n        cell_click_play(_).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlmix\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlmix(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            step_nr:=0,\n            cell_reset(),\n            mix_cells(0),\n            Play = vpi::winGetCtlHandle(thisWin,idc_play),\n            vpi::winSetState(Play,[wsf_Disabled]),\n            Bingo = vpi::winGetCtlHandle(thisWin,idc_bingo),\n            vpi::winSetText(Bingo, \"\"),\n            vpi::winSetState(Bingo,[wsf_Invisible]),\n            step_nr:=0,\n            Step = vpi::winGetCtlHandle(thisWin,idc_step),\n            vpi::winSetText(Step,toString(step_nr)),\n            table_save(),\n            retractall(gameplay(_,_)),\n            fail.\n\n        onControlmix(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    class facts\n        rand_nr:integer:=0.\n        mix_nr:integer:=300.\n\n    predicates\n        mix_cells:(integer) multi.\n\n    clauses\n        mix_cells(mix_nr):-!.\n        mix_cells(Number):-\n            NumberNew = Number+1,\n            cellnr(empty,CellNr),\n            RandomNr = (math::random(1315) mod CellNr) + 1,\n            rand_nr\u00a0:= RandomNr,\n            good(empty,rand_nr, I),\n            cell_click(I),\n            mix_cells(NumberNew).\n        mix_cells(_).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        table_save:().\n    clauses\n        table_save():-\n            retractall(table(_,_)),\n            retractall(empty_cell(_)),\n            assert(empty_cell(empty)),\n\n            assert(table(1,vpi::winGetText(cell1))),\n            assert(table(2,vpi::winGetText(cell2))),\n            assert(table(3,vpi::winGetText(cell3))),\n            assert(table(4,vpi::winGetText(cell4))),\n            assert(table(5,vpi::winGetText(cell5))),\n            assert(table(6,vpi::winGetText(cell6))),\n            assert(table(7,vpi::winGetText(cell7))),\n            assert(table(8,vpi::winGetText(cell8))),\n            assert(table(9,vpi::winGetText(cell9))),\n            assert(table(10,vpi::winGetText(cell10))),\n            assert(table(11,vpi::winGetText(cell11))),\n            assert(table(12,vpi::winGetText(cell12))),\n            assert(table(13,vpi::winGetText(cell13))),\n            assert(table(14,vpi::winGetText(cell14))),\n            assert(table(15,vpi::winGetText(cell15))),\n            assert(table(16,vpi::winGetText(cell16))).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlreset\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlreset(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n                              cell_reset().\n\n/* ------------------------------------------------------------------------------------------------------ */\n    predicates\n        cell_reset:().\n    clauses\n        cell_reset():-\n            vpi::winSetText(cell1,\"1\"),\n            vpi::winSetText(cell2,\"2\"),\n            vpi::winSetText(cell3,\"3\"),\n            vpi::winSetText(cell4,\"4\"),\n            vpi::winSetText(cell5,\"5\"),\n            vpi::winSetText(cell6,\"6\"),\n            vpi::winSetText(cell7,\"7\"),\n            vpi::winSetText(cell8,\"8\"),\n            vpi::winSetText(cell9,\"9\"),\n            vpi::winSetText(cell10,\"10\"),\n            vpi::winSetText(cell11,\"11\"),\n            vpi::winSetText(cell12,\"12\"),\n            vpi::winSetText(cell13,\"13\"),\n            vpi::winSetText(cell14,\"14\"),\n            vpi::winSetText(cell15,\"15\"),\n            vpi::winSetText(cell16,\"\"),\n\n            vpi::winSetScrollPos(vsbarr,sb_Ctl,4),\n            vpi::winSetScrollPos(vsbarl,sb_Ctl,4),\n            vpi::winSetScrollPos(hsbart,sb_Ctl,4),\n            vpi::winSetScrollPos(hsbarb,sb_Ctl,4),\n\n            empty:=16,\n            step_nr:=0,\n            Step = vpi::winGetCtlHandle(thisWin,idc_step),\n            vpi::winSetText(Step,toString(step_nr)),\n            Bingo = vpi::winGetCtlHandle(thisWin,idc_bingo),\n            vpi::winSetText(Bingo, \"\"),\n            vpi::winSetState(Bingo,[wsf_Invisible]),\n            Play = vpi::winGetCtlHandle(thisWin,idc_play),\n            vpi::winSetState(Play,[wsf_Disabled]),\n            retractall(gameplay(_,_)),\n            table_save().\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        bingo:().\n\n    clauses\n        bingo():-\n            toString(1) = vpi::winGetText(cell1),\n            toString(2) = vpi::winGetText(cell2),\n            toString(3) = vpi::winGetText(cell3),\n            toString(4) = vpi::winGetText(cell4),\n            toString(5) = vpi::winGetText(cell5),\n            toString(6) = vpi::winGetText(cell6),\n            toString(7) = vpi::winGetText(cell7),\n            toString(8) = vpi::winGetText(cell8),\n            toString(9) = vpi::winGetText(cell9),\n            toString(10) = vpi::winGetText(cell10),\n            toString(11) = vpi::winGetText(cell11),\n            toString(12) = vpi::winGetText(cell12),\n            toString(13) = vpi::winGetText(cell13),\n            toString(14) = vpi::winGetText(cell14),\n            toString(15) = vpi::winGetText(cell15),\n            \"\" = vpi::winGetText(cell16),\n\n            Bingo = vpi::winGetCtlHandle(thisWin,idc_bingo),\n            vpi::winSetState(Bingo,[wsf_Visible]),\n            vpi::winSetText(Bingo, \"BINGO\u00a0!\"),\n\n            Step = vpi::winGetCtlHandle(thisWin,idc_step),\n            vpi::winSetText(Step,toString(step_nr)),\n\n            fail.\n bingo().\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    facts\n        fileName:string:=\"\".\n\n    predicates\n        onControlsave\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlsave(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            try\n            \tFileName = vpiCommonDialogs::getFileName(fileName, [\"All files\", \"*.game\"], \"Save game as\", [dlgfn_Save], \"\", _)\n            catch _ do\n            \tfail\n            end try,\n           \u00a0!,\n            file::save(FileName,gameDB).\n\n        onControlsave(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo)= vpiOldDomains::handled(gui_api::rNull).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlopen\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlopen(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            try\n            \tFileName = vpiCommonDialogs::getFileName(\"game_\", [\"All files\", \"*.game\"], \"Open game file\", [], \"\", _)\n            catch _ do\n            \tfail\n            end try,\n           \u00a0!,\n            retractall(table(_,_)),\n            retractall(gameplay(_,_)),\n            retractall(empty_cell(_)),\n            file::consult(FileName,gameDB),\n            play_display(),\n            Play = vpi::winGetCtlHandle(thisWin,idc_play),\n            vpi::winSetState(Play,[wsf_Enabled]),\n            Bingo = vpi::winGetCtlHandle(thisWin,idc_bingo),\n            vpi::winSetState(Bingo,[wsf_Invisible]),\n            vpi::winSetText(Bingo, \"\"),\n            step_nr:=0,\n            Step = vpi::winGetCtlHandle(thisWin,idc_step),\n            vpi::winSetText(Step,toString(step_nr)).\n\n        onControlopen(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        play_display:().\n    clauses\n        play_display():-\n\n            table(1,Cell1),\n            table(2,Cell2),\n            table(3,Cell3),\n            table(4,Cell4),\n            table(5,Cell5),\n            table(6,Cell6),\n            table(7,Cell7),\n            table(8,Cell8),\n            table(9,Cell9),\n            table(10,Cell10),\n            table(11,Cell11),\n            table(12,Cell12),\n            table(13,Cell13),\n            table(14,Cell14),\n            table(15,Cell15),\n            table(16,Cell16),\n\n            vpi::winSetText(cell1,Cell1),\n            vpi::winSetText(cell2,Cell2),\n            vpi::winSetText(cell3,Cell3),\n            vpi::winSetText(cell4,Cell4),\n            vpi::winSetText(cell5,Cell5),\n            vpi::winSetText(cell6,Cell6),\n            vpi::winSetText(cell7,Cell7),\n            vpi::winSetText(cell8,Cell8),\n            vpi::winSetText(cell9,Cell9),\n            vpi::winSetText(cell10,Cell10),\n            vpi::winSetText(cell11,Cell11),\n            vpi::winSetText(cell12,Cell12),\n            vpi::winSetText(cell13,Cell13),\n            vpi::winSetText(cell14,Cell14),\n            vpi::winSetText(cell15,Cell15),\n            vpi::winSetText(cell16,Cell16),\n\n            empty_cell(Empty_Cell),\n            empty:=Empty_Cell,\n\n            fail.\n        play_display().\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlplay\u00a0: vpiOldDomains::controlHandler.\n    clauses\n\n        onControlplay(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            Play = vpi::winGetCtlHandle(thisWin,idc_play),\n            vpi::winSetState(Play,[wsf_Disabled]),\n            gameplay(Nr,Nr_cell),\n            cell_click_play(Nr_cell),\n            Step = vpi::winGetCtlHandle(thisWin,idc_step),\n            vpi::winSetText(Step,toString(Nr)),\n            fail.\n\n        onControlplay(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlsbvr\u00a0: vpiOldDomains::controlHandler.              \u00a0% Sets the right vertical scrollbar\n    clauses\n        onControlsbvr(_CtrlID, _CtrlType, _CtrlWin,scroll(sc_LineDown,_)) = vpiOldDomains::handled(gui_api::rNull):-\n            Sbarvalr = vpi::winGetScrollPos(vsbarr,sb_Ctl)+1,\n            Sbarvalr < 5,\n            cell_click(empty+4),\n            vpi::winSetScrollPos(vsbarr,sb_Ctl, Sbarvalr),\n            vpi::winSetScrollPos(vsbarl,sb_Ctl, Sbarvalr),\n            fail.\n\n        onControlsbvr(_CtrlID, _CtrlType, _CtrlWin,scroll(sc_LineUp,_)) = vpiOldDomains::handled(gui_api::rNull):-\n            Sbarvalr = vpi::winGetScrollPos(vsbarr,sb_Ctl)-1,\n            Sbarvalr > 0,\n            cell_click(empty-4),\n            vpi::winSetScrollPos(vsbarr,sb_Ctl, Sbarvalr),\n            vpi::winSetScrollPos(vsbarl,sb_Ctl, Sbarvalr),\n            fail.\n\n        onControlsbvr(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull).\n\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlsbvl\u00a0: vpiOldDomains::controlHandler.                 \u00a0% Sets the left vertical scrollbar\n    clauses\n        onControlsbvl(_CtrlID, _CtrlType, _CtrlWin,scroll(sc_LineDown,_)) = vpiOldDomains::handled(gui_api::rNull):-\n            Sbarvall = vpi::winGetScrollPos(vsbarl,sb_Ctl)+1,\n            Sbarvall < 5,\n            cell_click(empty+4),\n            vpi::winSetScrollPos(vsbarl,sb_Ctl, Sbarvall),\n            vpi::winSetScrollPos(vsbarr,sb_Ctl, Sbarvall),\n            fail.\n\n        onControlsbvl(_CtrlID, _CtrlType, _CtrlWin,scroll(sc_LineUp,_)) = vpiOldDomains::handled(gui_api::rNull):-\n            Sbarvall = vpi::winGetScrollPos(vsbarl,sb_Ctl)-1,\n            Sbarvall > 0,\n            cell_click(empty-4),\n            vpi::winSetScrollPos(vsbarl,sb_Ctl, Sbarvall),\n            vpi::winSetScrollPos(vsbarr,sb_Ctl, Sbarvall),\n            fail.\n\n        onControlsbvl(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlsbht\u00a0: vpiOldDomains::controlHandler.            \u00a0% Sets the top horizontal scrollbar\n    clauses\n        onControlsbht(_CtrlID, _CtrlType, _CtrlWin,scroll(sc_LineDown,_)) = vpiOldDomains::handled(gui_api::rNull):-\n            Sbarvalt = vpi::winGetScrollPos(hsbart,sb_Ctl)+1,\n            Sbarvalt < 5,\n            cell_click(empty+1),\n            vpi::winSetScrollPos(hsbart,sb_Ctl, Sbarvalt),\n            vpi::winSetScrollPos(hsbarb,sb_Ctl, Sbarvalt),\n            fail.\n\n        onControlsbht(_CtrlID, _CtrlType, _CtrlWin,scroll(sc_LineUp,_)) = vpiOldDomains::handled(gui_api::rNull):-\n            Sbarvalt = vpi::winGetScrollPos(hsbart,sb_Ctl)-1,\n            Sbarvalt > 0,\n            cell_click(empty-1),\n            vpi::winSetScrollPos(hsbart,sb_Ctl, Sbarvalt),\n            vpi::winSetScrollPos(hsbarb,sb_Ctl, Sbarvalt),\n            fail.\n\n        onControlsbht(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlsbhb\u00a0: vpiOldDomains::controlHandler.      \u00a0% Sets the bottom horizontal scrollbar\n    clauses\n        onControlsbhb(_CtrlID, _CtrlType, _CtrlWin,scroll(sc_LineDown,_)) = vpiOldDomains::handled(gui_api::rNull):-\n            Sbarvalb = vpi::winGetScrollPos(hsbarb,sb_Ctl)+1,\n            Sbarvalb < 5,\n            cell_click(empty+1),\n            vpi::winSetScrollPos(hsbarb,sb_Ctl, Sbarvalb),\n            vpi::winSetScrollPos(hsbart,sb_Ctl, Sbarvalb),\n            fail.\n\n        onControlsbhb(_CtrlID, _CtrlType, _CtrlWin,scroll(sc_LineUp,_)) = vpiOldDomains::handled(gui_api::rNull):-\n            Sbarvalb = vpi::winGetScrollPos(hsbarb,sb_Ctl)-1,\n            Sbarvalb > 0,\n            cell_click(empty-1),\n            vpi::winSetScrollPos(hsbarb,sb_Ctl, Sbarvalb),\n            vpi::winSetScrollPos(hsbart,sb_Ctl, Sbarvalb),\n            fail.\n\n        onControlsbhb(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell1\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell1(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(1).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n\n    predicates\n        onControlcell2\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell2(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(2).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell3\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell3(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(3).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell4\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell4(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(4).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell5\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell5(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(5).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell6\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell6(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(6).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell7\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell7(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(7).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell8\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell8(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(8).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell9\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell9(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(9).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell10\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell10(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(10).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell11\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell11(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(11).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell12\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell12(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(12).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell13\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell13(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(13).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell14\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell14(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(14).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell15\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell15(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(15).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell16\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell16(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(16).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n   \u00a0% This code is maintained by the VDE do not update it manually, 22:12:35-14.3.2004\n    constants\n        dialogType\u00a0: vpiDomains::wintype = wd_Modal.\n        title\u00a0: string = \"playDialog\".\n        rectangle\u00a0: vpiDomains::rct = rct(200,40,359,263).\n        dialogFlags\u00a0: vpiDomains::wsflags = [wsf_Close,wsf_TitleBar].\n        dialogFont = \"MS Sans Serif\".\n        dialogFontSize = 8.\n\n    constants\n        controlList\u00a0: vpiDomains::windef_list =\n            [\n            dlgFont(wdef(dialogType, rectangle, title, u_DlgBase),\n                    dialogFont, dialogFontSize, dialogFlags),\n            ctl(wdef(wc_PushButton,rct(40,166,67,178),\"&Mix\",u_DlgBase),idc_mix,[wsf_Group,wsf_TabStop]),\n            ctl(wdef(wc_PushButton,rct(67,166,94,178),\"&Reset\",u_DlgBase),idc_reset,[wsf_Group,wsf_TabStop]),\n            ctl(wdef(wc_PushButton,rct(40,178,67,190),\"&Save\",u_DlgBase),idc_save,[wsf_Group,wsf_TabStop]),\n            ctl(wdef(wc_PushButton,rct(94,178,121,190),\"&Open\",u_DlgBase),idc_open,[wsf_Group,wsf_TabStop]),\n            ctl(wdef(wc_PushButton,rct(40,190,121,202),\"&Play\",u_DlgBase),idc_play,[wsf_Group,wsf_TabStop,wsf_Disabled]),\n            ctl(wdef(wc_PushButton,rct(94,166,121,178),\"&Exit\",u_DlgBase),idc_cancel,[wsf_Group,wsf_TabStop]),\n            ctl(wdef(wc_PushButton,rct(40,40,60,60),\"1\",u_DlgBase),idc_cell1,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(60,40,80,60),\"2\",u_DlgBase),idc_cell2,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(80,40,100,60),\"3\",u_DlgBase),idc_cell3,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(100,40,120,60),\"4\",u_DlgBase),idc_cell4,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(40,60,60,80),\"5\",u_DlgBase),idc_cell5,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(60,60,80,80),\"6\",u_DlgBase),idc_cell6,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(80,60,100,80),\"7\",u_DlgBase),idc_cell7,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(100,60,120,80),\"8\",u_DlgBase),idc_cell8,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(40,80,60,100),\"9\",u_DlgBase),idc_cell9,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(60,80,80,100),\"10\",u_DlgBase),idc_cell10,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(80,80,100,100),\"11\",u_DlgBase),idc_cell11,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(100,80,120,100),\"12\",u_DlgBase),idc_cell12,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(40,100,60,120),\"13\",u_DlgBase),idc_cell13,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(60,100,80,120),\"14\",u_DlgBase),idc_cell14,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(80,100,100,120),\"15\",u_DlgBase),idc_cell15,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(100,100,120,120),\"\",u_DlgBase),idc_cell16,[wsf_Group]),\n            ctl(wdef(wc_HScroll,rct(30,18,130,30),\"\",u_DlgBase),idc_sbht,[]),\n            ctl(wdef(wc_VScroll,rct(130,30,142,130),\"\",u_DlgBase),idc_sbvr,[]),\n            ctl(wdef(wc_HScroll,rct(30,130,130,142),\"\",u_DlgBase),idc_sbhb,[]),\n            ctl(wdef(wc_VScroll,rct(18,30,30,130),\"\",u_DlgBase),idc_sbvl,[]),\n            ctl(wdef(wc_PushButton,rct(67,178,94,190),\"\",u_DlgBase),idc_step,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(40,154,121,166),\"\",u_DlgBase),idc_bingo,[wsf_Group,wsf_Invisible])\n            ].\n\n    predicates\n        generatedEventHandler\u00a0: vpiDomains::ehandler.\n    clauses\n        generatedEventHandler(Win, e_create(_)) = _\u00a0:-\n            thisWin\u00a0:= Win,\n            fail.\n        generatedEventHandler(_Win, e_Create(CreationData)) = Result\u00a0:-\n            handled(Result) = onCreate(CreationData).\n        generatedEventHandler(_Win, e_Update(Rectangle)) = Result\u00a0:-\n            handled(Result) = onUpdate(Rectangle).\n        generatedEventHandler(_Win, e_Control(idc_cancel, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlCancel(idc_cancel, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_mix, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlmix(idc_mix, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_reset, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlreset(idc_reset, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_sbvr, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlsbvr(idc_sbvr, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_sbvl, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlsbvl(idc_sbvl, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_sbhb, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlsbhb(idc_sbhb, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_sbht, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlsbht(idc_sbht, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_save, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlsave(idc_save, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_open, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlopen(idc_open, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_play, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlplay(idc_play, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell1, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell1(idc_cell1, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell10, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell10(idc_cell10, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell11, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell11(idc_cell11, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell12, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell12(idc_cell12, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell13, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell13(idc_cell13, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell14, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell14(idc_cell14, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell15, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell15(idc_cell15, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell16, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell16(idc_cell16, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell2, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell2(idc_cell2, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell3, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell3(idc_cell3, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell4, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell4(idc_cell4, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell5, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell5(idc_cell5, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell6, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell6(idc_cell6, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell7, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell7(idc_cell7, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell8, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell8(idc_cell8, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell9, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell9(idc_cell9, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Destroy()) = Result\u00a0:-\n            handled(Result) = onDestroy().\n   \u00a0% end of automatic code\nend implement playDialog",
        "safe": true
    },
    {
        "filename": "15 puzzle game_13.txt",
        "content": "      fpg 10\n 1  3  0  4\n 5  2  6  8\n 9 10  7 12\n13 14 11 15\n\u2190\n 1  0  3  4\n 5  2  6  8\n 9 10  7 12\n13 14 11 15\n\u2193\n 1  2  3  4\n 5  0  6  8\n 9 10  7 12\n13 14 11 15\n\u2192\n 1  2  3  4\n 5  6  0  8\n 9 10  7 12\n13 14 11 15\n\u2193\u2193\n 1  2  3  4\n 5  6  7  8\n 9 10 11 12\n13 14  0 15\n\u2192\n 1  2  3  4\n 5  6  7  8\n 9 10 11 12\n13 14 15  0\nwin\n\n\n      2 5 fpg 2\n1 2 3 0 4\n6 7 8 9 5\n\u2192\n1 2 3 4 0\n6 7 8 9 5\n\u2193\n1 2 3 4 5\n6 7 8 9 0\nwin\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_130.txt",
        "content": "'----------------15 game-------------------------------------\n'WARNING: this script uses ANSI escape codes to position items on console so \n'it won't work in Windows from XP to 8.1 where Microsoft removed ANSI support...\n'Windows 10, 11 or 98 are ok!!!\n\noption explicit\nconst maxshuffle=100 'level \n\ndim ans0:ans0=chr(27)&\"[\"\ndim anscls:anscls=ans0 & \"2J\"\n\ndim dirs:dirs=array(6,-1,-6,1)\ndim a:a=array(-1,-1,-1,-1,-1,-1,_\n              -1, 1, 2, 3, 4,-1,_\n              -1, 5, 6, 7, 8,-1,_\n              -1, 9,10,11,12,-1,_\n              -1,13,14,15, 0,-1,_\n              -1,-1,-1,-1,-1,-1)\ndim b(35)\ndim pos0\ndim s:s=Array(\"W+Enter: up   Z+Enter: down  A+Enter: left   S+Enter right \",_\n              \"Bad move!!                                                 \",_\n\t      \"You did it! Another game? [y/n]+Enter                      \",_\n\t      \"Bye!                                                       \")\n\n\ndo\n  shuffle\n  draw\n  toxy 10,1,s(0)\n  do \n   if usr(wait()) then \n     draw  \n     toxy 10,1,s(0)\n   else \t\n     toxy 10,1,s(1)\n   end if\n  loop until checkend\n  toxy 10,1,s(2)\nloop until wait()=\"n\"\ntoxy 10,1,s(3)\n\nfunction wait():\n toxy 11,1,\"\":\n wait=left(lcase(wscript.stdin.readline),1):\t\nend function\n\nsub toxy(x,y,s)\n wscript.StdOut.Write ans0 & x & \";\" & y & \"H\"& \" \"& s  \nend sub\n\nsub draw\n  dim i,j \n  wscript.stdout.write anscls\n  for i=0 to 3 'row\n    for j=0 to 3  'col\n      toxy (j*2)+2,(i*3)+3,iif(b(j*6+i+7)<>0,b(j*6+i+7),\" \")\n    next\n  next\n  toxy 10,1,\"\"\nend sub\n\n\nfunction checkend\n  dim i\n  for i=0 to ubound(a)\n   if (b(i)<>a(i)) then checkend=false : exit function\n  next\n  checkend=true\nend function\t\n\nfunction move(d) \n dim p1 \n p1=pos0+d\n if b(p1) <>-1 then \n    b(pos0)=b(p1):\n    b(p1)=0:\n    pos0=p1:\n    move=true\n else\n   move=false\n end if \nend function \n\nsub shuffle\n  dim cnt,r,i\n   randomize timer\n   for i=0 to ubound(a):b(i)=a(i):next\n   pos0=28\n   cnt=0\n   do\n     r=int(rnd*4)\n     if move(dirs(r))=true then cnt=cnt+1\n   loop until cnt=maxshuffle\nend sub\t \n\nfunction iif(a,b,c): if a then iif=b else iif=c end if:end function\t\t\t \n\nfunction usr(a)\n  dim d \n  select case lcase(a)\n  case \"w\" :d=-6\n  case \"z\" :d=6\n  case \"a\" :d=-1\n  case \"s\" :d=1\n  end select\n  usr= move(d) \nend function\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_131.txt",
        "content": "import \"random\" for Random\nimport \"./dynamic\" for Enum\nimport \"./ioutil\" for Input\nimport \"./fmt\" for Fmt\n\nvar Move = Enum.create(\"Move\", [\"up\", \"down\", \"right\", \"left\"])\n\nvar Rand = Random.new()\nvar RandMove = Fn.new { Rand.int(4) }\n\nvar SolvedBoard = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 0]\n\nvar AreEqual = Fn.new { |l1, l2|\n    if (l1.count != l2.count) return false\n    for (i in 0...l1.count) {\n        if (l1[i] != l2[i]) return false\n    }\n    return true\n}\n\nclass Puzzle {\n    construct new() {\n        _board = SolvedBoard.toList\n        _empty = 15 // _board[empty] == 0\n        _moves = 0\n        _quit  = false\n        // Could make this configurable, 10 == easy, 50 == normal, 100 == hard\n        shuffle(50)\n    }\n\n    shuffle(moves) {\n        // we use some number of random moves to \"shuffle\" the board\n        var i = 0\n        while (i < moves || AreEqual.call(_board, SolvedBoard)) {\n            if (doMove(RandMove.call())) i = i + 1\n        }\n    }\n\n    isValidMove(m) {\n        if (m == Move.up)    return [_empty - 4, (_empty/4).floor > 0]\n        if (m == Move.down)  return [_empty + 4, (_empty/4).floor < 3]  \n        if (m == Move.right) return [_empty + 1, _empty % 4 < 3]\n        if (m == Move.left)  return [_empty - 1, _empty % 4 > 0]\n        Fiber.abort(\"not reached\")\n    }\n\n    doMove(m) {\n        var i = _empty\n        var res = isValidMove(m)\n        var j  = res[0]\n        var ok = res[1]\n        if (ok) {\n            _board.swap(i, j)\n            _empty = j\n            _moves = _moves + 1\n        }\n        return ok\n    }\n\n    play() {\n        var instructions = \"\"\"\nPlease enter \"U\", \"D\", \"L\", or \"R\" to move the empty cell\nup, down, left, or right. You can also enter \"Q\" to quit.\nUpper or lowercase is accepted and only the first character\nis important (i.e. you may enter \"up\" if you like).\n\"\"\"\n        System.print(instructions)\n        System.write(\"\\nStarting board:\")\n        while (!AreEqual.call(_board, SolvedBoard) && !_quit) {\n            System.print(\"\\n%(this)\")\n            playOneMove()\n        }\n        if (AreEqual.call(_board, SolvedBoard)) {\n            System.print(\"\\n%(this)\")\n            System.print(\"You solved the puzzle in %(_moves) moves.\")\n        }\n    }\n\n    playOneMove() {\n        while (true) {\n            var s = Input.option(\"Enter move #%(_moves + 1) (U, D, L, R or Q): \", \"UuDdLlRrQq\")\n            var m\n            if (s == \"U\" || s == \"u\") {\n                m = Move.up\n            } else if (s == \"D\" || s == \"d\") {\n                m = Move.down\n            } else if (s == \"L\" || s == \"l\") {\n                m = Move.left\n            } else if (s == \"R\" || s == \"r\") {\n                m = Move.right\n            } else if (s == \"Q\" || s == \"q\") {\n                System.print(\"Quiting after %(_moves).\")\n                _quit = true\n                return\n            }\n            if (!doMove(m)) {\n                System.print(\"That is not a valid move at the moment.\")\n                continue\n            }\n            return\n        }\n    }\n\n    toString {\n        var buf = \"\"\n        var i = 0\n        for (c in _board) {\n            if (c == 0) {\n                buf = buf + \"  .\"\n            } else {\n                buf = buf + Fmt.swrite(\"$3d\", c)\n            }\n            if (i % 4 == 3) buf = buf + \"\\n\"\n            i = i + 1\n        }\n        return buf\n    }\n}\n\nvar p = Puzzle.new()\np.play()\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_132.txt",
        "content": "Please enter \"U\", \"D\", \"L\", or \"R\" to move the empty cell\nup, down, left, or right. You can also enter \"Q\" to quit.\nUpper or lowercase is accepted and only the first character\nis important (i.e. you may enter \"up\" if you like).\n\nStarting board:\n  1  2  3  4\n  6  .  7  8\n  5  9 11 12\n 13 10 14 15\n\nEnter move #51 (U, D, L, R or Q): l\n\n  1  2  3  4\n  .  6  7  8\n  5  9 11 12\n 13 10 14 15\n\nEnter move #52 (U, D, L, R or Q): d\n\n  1  2  3  4\n  5  6  7  8\n  .  9 11 12\n 13 10 14 15\n\nEnter move #53 (U, D, L, R or Q): r\n\n  1  2  3  4\n  5  6  7  8\n  9  . 11 12\n 13 10 14 15\n\nEnter move #54 (U, D, L, R or Q): d\n\n  1  2  3  4\n  5  6  7  8\n  9 10 11 12\n 13  . 14 15\n\nEnter move #55 (U, D, L, R or Q): r\n\n  1  2  3  4\n  5  6  7  8\n  9 10 11 12\n 13 14  . 15\n\nEnter move #56 (U, D, L, R or Q): r\n\n  1  2  3  4\n  5  6  7  8\n  9 10 11 12\n 13 14 15  .\n\nYou solved the puzzle in 56 moves.\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_133.txt",
        "content": "       \u00a0; Puzzle15 by grosged (march 2019)\n       \u00a0; How to play\u00a0?.. Just press one of the arrow keys then [enter] to valid\n       \u00a0; ( press [Ctrl+C] to escape )\n\n        segment\t.data\ncheck:\tdb\t\"1   2   3   4\",10,\"  5   6   7   8\",10,\"  9  10  11  12\",10,\" 13  14  1\"\npuzzle:\tdb\t27,\"c\",10,\"  1   2   3   4\",10,\"  5   6   7   8\",10,\"  9  10  11  12\",10,\" 13  14  15    \",10,10\n\tdb\t\" Direction\u00a0?\",13             \n\tdb\t\" Well done\u00a0!  \",10,10\ninKey:\tdw\t0,0,0,0\n\t\n\tsegment\t.text\n\tglobal\t_start\n\n_start:\tmov\trax,100\n\tsyscall\n\tmov\trcx,rax\n\tshr\trcx,3\n\tand\trcx,255\n\tand\trax,31\n\tlea\trsi,[_start+rax]\n\tmov\trbx,15\n\nMixing:\tpush\trcx\n\tmov\tdi,word[rsi+rcx*2]\n\tmov\trcx,8\nquatre:\tmov\tax,di\n\tshr\tdi,2\n\tand\tax,3\n\tadd\tax,65\n\tcall\tSWAPPIN\n\tloop\tquatre\n\tpop\trcx\n\tloop\tMixing\n\tcmp\tcx,ax\n\nMainLp:\tmov\trdx,80\t\nSucces:\tlea\trsi,[puzzle]\n\tmov\trdi,1\n\tmov\trax,1\nEnd?:\tsyscall\n\tmov\trax,60\n\tje\tEnd?\n\tmov\trdx,8\n\tlea\trsi,[inKey]\n\tmov\trdi,0\n\tmov\trax,0\n\tsyscall\n\tmov\tal,byte [rsi+rax-2]\n\tcall\tSWAPPIN\n\tlea \trsi,[check]\n\tlea\trdi,[puzzle+5]\n\tmov\trcx,7\n\trepe\tcmpsq\n\tjne\tMainLp\n\tmov\trdx,95\n\tjmp\tSucces\n\nSWAPPIN:mov\trdx,rbx\n\tcmp\tal,\"A\"\n\tjne\tNotUp\n\tadd\trbx,4\n\tcmp\trbx,16\n\tcmovae\trbx,rdx\nNotUp:\tcmp\tal,\"B\"\n\tjne\tNotDwn\t\n\tsub\trbx,4\n\tcmovc\trbx,rdx\t\nNotDwn:\tcmp\tal,\"C\"\n\tjne\tNotLft\n\ttest\trbx,3\n\tjz\tEndcll\n\tdec\trbx\nNotLft:\tcmp\tal,\"D\"\n\tjne\tEndcll\n\tinc\trbx\n\ttest\trbx,3\n\tcmovz\trbx,rdx\nEndcll:\tmov\tax,\"  \"\n\txchg\tax,word[puzzle+4+rbx*4]\n\tmov\tword[puzzle+4+rdx*4],ax\n\tret",
        "safe": true
    },
    {
        "filename": "15 puzzle game_134.txt",
        "content": "PROGRAM \"fifteenpuzzlegame\"\nVERSION \"0.0001\"\n\nIMPORT \"xst\"\n\nDECLARE FUNCTION Entry()\nINTERNAL FUNCTION PrintPuzzle(d%[])\nINTERNAL FUNCTION IntroAndLevel(shCnt%[])\nINTERNAL FUNCTION BuildBoard(d%[], shCnt%[], level%)\nINTERNAL FUNCTION IsMoveValid(d%[], piece%, piecePos%, emptyPos%)\nINTERNAL FUNCTION IsPuzzleComplete(d%[])\nINTERNAL FUNCTION PiecePosition(d%[], piece%)\n\n' Pseudo-random number generator\n' Based on the rand, srand functions from Kernighan & Ritchie's book\n' 'The C Programming Language'\nDECLARE FUNCTION Rand()\nDECLARE FUNCTION SRand(seed%%)\n\nFUNCTION Entry()\n  DIM d%[15]\n  DIM shCnt%[2]\n  BuildBoard(@d%[], @shCnt%[], IntroAndLevel(@shCnt%[]))\n  PrintPuzzle(@d%[])\n  DO\n    x% = SSHORT(INLINE$(\"To move a piece, enter its number: \"))\n    DO WHILE IsMoveValid(@d%[], x%, @y%, @z%) = 0\n      PRINT \"Wrong move.\"\n      PrintPuzzle(@d%[])\n      x% = SSHORT(INLINE$(\"To move a piece, enter its number: \"))\n    LOOP\n    d%[z% - 1] = x%\n    d%[y% - 1] = 0\n    PrintPuzzle(@d%[])\n  LOOP UNTIL IsPuzzleComplete(@d%[])\n  PRINT \"YOU WON!\"\nEND FUNCTION\n\nFUNCTION PrintPuzzle(d%[])\n  DIM ds$[15] ' Board pieces\n  FOR p%% = 0 TO 15\n    IF d%[p%%] = 0 THEN\n      ds$[p%%] = \"     \"\n    ELSE\n      ds$[p%%] = FORMAT$(\"###  \", d%[p%%])\n    END IF\n  NEXT p%%\n  PRINT \"+-----+-----+-----+-----+\"\n  PRINT \"|\"; ds$[0]; \"|\"; ds$[1]; \"|\"; ds$[2]; \"|\"; ds$[3]; \"|\"\n  PRINT \"+-----+-----+-----+-----+\"\n  PRINT \"|\"; ds$[4]; \"|\"; ds$[5]; \"|\"; ds$[6]; \"|\"; ds$[7]; \"|\"\n  PRINT \"+-----+-----+-----+-----+\"\n  PRINT \"|\"; ds$[8]; \"|\"; ds$[9]; \"|\"; ds$[10]; \"|\"; ds$[11]; \"|\"\n  PRINT \"+-----+-----+-----+-----+\"\n  PRINT \"|\"; ds$[12]; \"|\"; ds$[13]; \"|\"; ds$[14]; \"|\"; ds$[15]; \"|\"\n  PRINT \"+-----+-----+-----+-----+\"\nEND FUNCTION\n\nFUNCTION IntroAndLevel(shCnt%[])\n  XstClearConsole()\n  shCnt%[0] = 10\n  shCnt%[1] = 50\n  shCnt%[2] = 100\n  PRINT \"15 PUZZLE GAME\"\n  PRINT\n  PRINT\n  PRINT \"Please enter level of difficulty,\"\n  DO\n    level% = SSHORT(INLINE$(\"1 (easy), 2 (medium) or 3 (hard): \"))\n  LOOP UNTIL (level% >= 1) && (level% <= 3)\nEND FUNCTION level%\n\nFUNCTION BuildBoard(d%[], shCnt%[], level%)\n  ' Set pieces in correct order first\n  FOR p%% = 1 TO 15\n    d%[p%% - 1] = p%%\n  NEXT p%%\n  d%[15] = 0 ' 0 = empty piece/slot\n  z% = 16 ' z% = empty position\n  PRINT\n  PRINT \"Shuffling pieces\";\n  XstGetSystemTime (@msec)\n  SRand(INT(msec) MOD 32768)\n  FOR n% = 1 TO shCnt%[level% - 1]\n    PRINT \".\";\n    DO\n      x% = INT(Rand() / 32768.0 * 4.0) + 1\n      PRINT x%\n      SELECT CASE x%\n        CASE 1:\n          r% = z% - 4\n        CASE 2:\n          r% = z% + 4\n        CASE 3:\n          IF (z% - 1) MOD 4 <> 0 THEN\n            r% = z% - 1\n          END IF\n        CASE 4:\n          IF z% MOD 4 <> 0 THEN\n            r% = z% + 1\n          END IF\n      END SELECT\n    LOOP UNTIL (r% >= 1) && (r% <= 16)\n    d%[z% - 1] = d%[r% - 1]\n    z% = r%\n    d%[z% - 1] = 0\n  NEXT n%\n  XstClearConsole()\nEND FUNCTION\n\nFUNCTION IsMoveValid(d%[], piece%, piecePos%, emptyPos%)\n  mv% = 0\n  IF (piece% >= 1) && (piece% <= 15) THEN\n    piecePos% = PiecePosition(@d%[], piece%)\n    emptyPos% = PiecePosition(@d%[], 0)\n    ' Check if empty piece is above, below, left or right to piece\n    IF (piecePos% - 4 = emptyPos%) || (piecePos% + 4 = emptyPos%) || ((piecePos% - 1 = emptyPos%) && (emptyPos% MOD 4 <> 0)) || ((piecePos% + 1 = emptyPos%) && (piecePos% MOD 4 <> 0)) THEN\n      mv% = 1\n    END IF\n  END IF\nEND FUNCTION mv%\n\nFUNCTION PiecePosition(d%[], piece%)\n  p%% = 0\n  DO WHILE d%[p%%] <> piece%\n    INC p%%\n    IF p%% > 15 THEN\n      PRINT \"UH OH!\"\n      QUIT(1)\n    END IF\n  LOOP\nEND FUNCTION p%% + 1\n\nFUNCTION IsPuzzleComplete(d%[])\n  pc% = 0\n  p%% = 1\n  DO WHILE (p%% < 16) && (d%[p%% - 1] = p%%)\n    INC p%%\n  LOOP\n  IF p%% = 16 THEN\n    pc% = 1\n  END IF\nEND FUNCTION pc%\n\n' Return pseudo-random integer on 0..32767\nFUNCTION Rand() \n  #next&& = #next&& * 1103515245 + 12345\nEND FUNCTION USHORT(#next&& / 65536) MOD 32768\n\n' Set seed for Rand()\nFUNCTION SRand(seed%%) \n  #next&& = seed%%\nEND FUNCTION\n\nEND PROGRAM\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_135.txt",
        "content": "int Box, Hole, I;\n[Box:= [^ ,^F,^E,^D,    \\starting configuration\n        ^C,^B,^A,^9,    \\slide digits into ascending order\n        ^8,^7,^6,^5,    \\with blank in lower-right corner\n        ^4,^3,^2,^1];\nHole:= 0;               \\index for hole position\nloop    [Clear;         \\erase screen and move to start\n        for I:= 0 to 15 do \\show puzzle\n                [ChOut(0, Box(I));  ChOut(0, ^ );\n                if (I & 3) = 3 then CrLf(0)];\n        case ChIn(1) of                 \\get move\n          $1B:  quit;                   \\Esc\n          $48:  if Hole < 12 then       \\UpArrow scan code\n                        [Box(Hole):= Box(Hole+4);\n                        Hole:= Hole+4;\n                        Box(Hole):= ^ ];\n          $50:  if Hole > 3 then        \\DnArrow\n                        [Box(Hole):= Box(Hole-4);\n                        Hole:= Hole-4;\n                        Box(Hole):= ^ ];\n          $4B:  if (Hole & 3) < 3 then  \\LfArrow\n                        [Box(Hole):= Box(Hole+1);\n                        Hole:= Hole+1;\n                        Box(Hole):= ^ ];\n          $4D:  if (Hole & 3) > 0 then  \\RtArrow\n                        [Box(Hole):= Box(Hole-1);\n                        Hole:= Hole-1;\n                        Box(Hole):= ^ ]\n        other   [];     \\ignore 0 scan code prefix etc.\n        ];\n]",
        "safe": true
    },
    {
        "filename": "15 puzzle game_136.txt",
        "content": "  F E D \nC B A 9 \n8 7 6 5 \n4 3 2 1 \n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_137.txt",
        "content": "dx = 4\u00a0: dy = 4\u00a0: dxy = dx * dy\ndim grid(dx, dy)\n\ndim t(dxy)\n\nfor x = 1 to dx\n\tfor y = 1 to dy\n\t\tfin = false\n\t\trepeat\n\t\t\ti = int(ran(dxy) + 1)\n\t\t\tif t(i) = 0 then\n\t\t\t\tt(i) = 1\n\t\t\t\tfin = true\n\t\t\t\tif i < dxy then\n\t\t\t\t\tgrid(x, y) = i\n\t\t\t\telse\n\t\t\t\t\tex = x\u00a0: ey = y\n\t\t\t\tend if\n\t\t\tend if\n\t\tuntil(fin = true)\n\tnext y\nnext x\n\ndrawTable()\n\nrepeat\n\tmoveTile()\n\tdrawTable()\nuntil(finish())\n\nprint \"\\n\\n\\nNumber of movements: \",mov,\"\\nEnd\\n\"\n\nsub finish()\n\tlocal x, y, v\n\t\n\tfor y = 1 to dy\n\t\tfor x = 1 to dx\n\t\t\tv = v + 1\n\t\t\tif (v < dxy) and (grid(x, y) <> v) return false\n\t\tnext x\n\tnext y\n\treturn true\nend sub\n\nsub moveTile()\n\tlocal direction$\n\t\n\tdirection$ = inkey$\n\t\n\tswitch direction$\n\t\tcase \"up\": if (ey + 1) < (dy + 1) then grid(ex, ey) = grid(ex, ey + 1)\u00a0: ey = ey + 1  end if\u00a0: break\n\t\tcase \"down\": if (ey - 1) > 0 then grid(ex, ey) = grid(ex, ey - 1)\u00a0: ey = ey - 1  end if\u00a0: break\n\t\tcase \"right\": if (ex - 1) > 0 then grid(ex, ey) = grid(ex - 1, ey)\u00a0: ex = ex - 1  end if\u00a0: break\n\t\tcase \"left\": if (ex + 1) < (dx + 1) then grid(ex, ey) = grid(ex + 1, ey)\u00a0: ex = ex + 1  end if\u00a0: break\n\t\tdefault: return\u00a0: break\n\tend switch\n\tmov = mov + 1\n\tgrid(ex, ey) = 0\nend sub\n\nsub drawTable()\n\tlocal x, y\n\t\n\tclear screen\n\t\n\tprint \"   Use the cursor keys\"\n\t\n\tfor x = 1 to dx\n\t\tfor y = 1 to dy\n\t\t\tprint at(x * 3, y * 2);\n\t\t\tif grid(x, y) then\n\t\t\t\tprint color(\"yellow\",\"magenta\") grid(x, y) using \"##\"\n\t\t\telse\n\t\t\t\tprint \"  \"\n\t\t\tend if\n\t\tnext y\n\tnext x\nend sub",
        "safe": true
    },
    {
        "filename": "15 puzzle game_138.txt",
        "content": "board$ = \"123456789ABCDEF0\"\nsolve$ = board$\npos = 16\n \nsub print_board()\n    local i, n$\n\t\n    clear screen\n    for i = 1 to len(board$)\n    \tif i = pos then\n            print \"   \";\n    \telse\n    \t    n$ = str$(dec(mid$(board$, i, 1)), \"###\")\n    \t    print n$; \n        end if\n        if mod(i, 4) = 0 print\n    next\n    print\nend sub\n \nsub move(d)\n    local new_pos, delta(4)\n    \n    delta(1) = 4\u00a0: delta(2) = 1\u00a0: delta(3) = -1\u00a0: delta(4) = -4\n    \n    new_pos = pos + delta(d)\n    if new_pos >= 1 and new_pos <= 16 and (mod(pos, 4) = mod(new_pos, 4) or floor((pos - 1) / 4) = floor((new_pos - 1) / 4)) then\n    \tmid$(board$, pos, 1) = mid$(board$, new_pos, 1)\n    \tmid$(board$, new_pos, 1) = \"0\"\n        pos = new_pos\n    end if\nend sub\n \nfor i = 1 to 100\u00a0: move(int(ran(4))+1)\u00a0: next\ndo\n    print_board()\n    if board$ = solve$ break\n    c = ((instr(\"esc  up   left rightdown \", inkey$) - 1) / 5)\n    if c < 1 break\n    move(c)\nloop\nprint \"solved!\\n\"",
        "safe": true
    },
    {
        "filename": "15 puzzle game_139.txt",
        "content": "const std = @import(\"std\");\nconst stdout = std.io.getStdOut().writer();\n\nconst tokens = [16][]const u8{ \" 1\", \" 2\", \" 3\", \" 4\", \" 5\", \" 6\", \" 7\", \" 8\", \" 9\", \"10\", \"11\", \"12\", \"13\", \"14\", \"15\", \"  \" };\n\nconst empty_token = 15;\nvar empty: u8 = empty_token;\nvar cells: [16]u8 = undefined;\nvar invalid: bool = false;\n\nconst Move = enum { no, up, down, left, right };\n\nfn showBoard() !void {\n    try stdout.writeAll(\"\\n\");\n\n    var solved = true;\n    var i: u8 = 0;\n    while (i < 16) : (i += 1) {\n        try stdout.print(\" {s} \", .{tokens[cells[i]]});\n        if ((i + 1) % 4 == 0) try stdout.writeAll(\"\\n\");\n        if (i != cells[i]) solved = false;\n    }\n\n    try stdout.writeAll(\"\\n\");\n\n    if (solved) {\n        try stdout.writeAll(\"\\n\\n** You did it! **\\n\\n\");\n        std.posix.exit(0);\n    }\n}\n\nfn updateToken(move: Move) !void {\n    const newEmpty = switch (move) {\n        Move.up => if (empty / 4 < 3) empty + 4 else empty,\n        Move.down => if (empty / 4 > 0) empty - 4 else empty,\n        Move.left => if (empty % 4 < 3) empty + 1 else empty,\n        Move.right => if (empty % 4 > 0) empty - 1 else empty,\n        else => empty,\n    };\n\n    if (empty == newEmpty) {\n        invalid = true;\n    } else {\n        invalid = false;\n        cells[empty] = cells[newEmpty];\n        cells[newEmpty] = empty_token;\n        empty = newEmpty;\n    }\n}\n\nfn waitForMove() !Move {\n    const reader = std.io.getStdIn().reader();\n    if (invalid) try stdout.writeAll(\"(invalid) \");\n    try stdout.writeAll(\"enter u/d/l/r or q: \");\n    const input = try reader.readBytesNoEof(2);\n    switch (std.ascii.toLower(input[0])) {\n        'q' => std.posix.exit(0),\n        'u' => return Move.up,\n        'd' => return Move.down,\n        'l' => return Move.left,\n        'r' => return Move.right,\n        else => return Move.no,\n    }\n}\n\nfn shuffle(moves: u8) !void {\n    var random = std.Random.DefaultPrng.init(@intCast(std.time.microTimestamp()));\n    const rand = random.random();\n    var n: u8 = 0;\n    while (n < moves) {\n        const move: Move = rand.enumValue(Move);\n        try updateToken(move);\n        if (!invalid) n += 1;\n    }\n    invalid = false;\n}\n\npub fn main() !void {\n    var n: u8 = 0;\n    while (n < 16) : (n += 1) {\n        cells[n] = n;\n    }\n\n    try shuffle(50);\n    try showBoard();\n\n    while (true) {\n        try updateToken(try waitForMove());\n        try showBoard();\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_14.txt",
        "content": "/* ARM assembly Raspberry PI  */\n/*  program puzzle15.s   */\n \n/************************************/\n/* Constantes                       */\n/************************************/\n.equ STDIN,  0     @ Linux input console\n.equ STDOUT, 1     @ Linux output console\n.equ EXIT,   1     @ Linux syscall\n.equ READ,   3     @ Linux syscall\n.equ WRITE,  4     @ Linux syscall\n\n.equ IOCTL,     0x36  @ Linux syscall\n.equ SIGACTION, 0x43  @ Linux syscall\n.equ SYSPOLL,   0xA8  @ Linux syscall\n\n.equ TCGETS,    0x5401\n.equ TCSETS,    0x5402\n.equ ICANON,    2\n.equ ECHO,     10\n.equ POLLIN,    1\n\n.equ SIGINT,   2    @ Issued if the user sends an interrupt signal (Ctrl + C)\n.equ SIGQUIT,  3    @ Issued if the user sends a quit signal (Ctrl + D)\n.equ SIGTERM, 15    @ Software termination signal (sent by kill by default)\n.equ SIGTTOU, 22    @ \n\n.equ NBBOX,  16\n.equ TAILLEBUFFER,   10\n\n/*******************************************/\n/* Structures                               */\n/********************************************/\n/* structure termios see doc linux*/\n    .struct  0\nterm_c_iflag:                    @ input modes\n    .struct  term_c_iflag + 4 \nterm_c_oflag:                    @ output modes\n    .struct  term_c_oflag + 4 \nterm_c_cflag:                    @ control modes\n    .struct  term_c_cflag + 4 \nterm_c_lflag:                    @ local modes\n    .struct  term_c_lflag + 4 \nterm_c_cc:                       @ special characters\n    .struct  term_c_cc + 20      @ see length if necessary \nterm_fin:\n\n/* structure sigaction see doc linux */\n    .struct  0\nsa_handler:\n    .struct  sa_handler + 4 \nsa_mask:\n    .struct  sa_mask + 4 \nsa_flags:\n    .struct  sa_flags + 4 \nsa_sigaction:\n    .struct  sa_sigaction + 4 \nsa_fin:\n\n/* structure poll see doc linux */\n    .struct  0\npoll_fd:                            @   File Descriptor\n    .struct  poll_fd + 4 \npoll_events:                        @  events mask\n    .struct  poll_events + 4 \npoll_revents:                       @ events returned\n    .struct  poll_revents + 4 \npoll_fin:\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nsMessResult:           .ascii \" \"\nsMessValeur:           .fill 11, 1, ' '             @ size => 11\nszCarriageReturn:      .asciz \"\\n\"\nszMessGameWin:         .ascii \"You win in \"\nsMessCounter:           .fill 11, 1, ' '            @ size => 11\n                       .asciz \" move number\u00a0!!!!\\n\"\nszMessMoveError:       .asciz \"Huh... Impossible move\u00a0!!!!\\n\"\nszMessErreur:          .asciz \"Error detected.\\n\"\nszMessSpaces:          .asciz \"    \"\niGraine:               .int 123456\n/*************************************************/\nszMessErr: .ascii\t\"Error code hexa\u00a0: \"\nsHexa: .space 9,' '\n         .ascii \"  decimal\u00a0:  \"\nsDeci: .space 15,' '\n         .asciz \"\\n\"\nszClear:     .byte 0x1B \n\t\t     .byte 'c'                         @ console clear\n\t\t     .byte 0\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\n.align 4\niCodeError:     .skip 4\nibox:          .skip 4 * NBBOX                 @ game boxes\niEnd:           .skip 4                        @ 0 loop  1 = end loop\niTouche:        .skip 4                        @ value key pressed\nstOldtio:       .skip term_fin                 @ old terminal state\nstCurtio:       .skip term_fin                 @ current terminal state\nstSigAction:    .skip sa_fin                   @ area signal structure\nstSigAction1:   .skip sa_fin\nstPoll1:        .skip poll_fin                 @ area poll structure\nstPoll2:        .skip poll_fin\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                @ entry of program \n    mov r0,#0\n    ldr r2,iAdribox\n    mov r9,#0                        @ move counter \n1:                                   @ loop init boxs\n    add r1,r0,#1                     @ box value\n    str r1,[r2,r0, lsl #2]           @ store value\n    add r0,#1                        @ increment counter\n    cmp r0,#NBBOX - 2                @ end\u00a0?\n    ble 1b\n    mov r10,#15                      @ empty box location \n    ldr r0,iAdribox\n    bl shuffleGame\n2:                                   @ loop moves\n    ldr r0,iAdribox\n    bl displayGame\n    //ldr r0,iAdribox\n    //bl gameOK                      @ end game\u00a0?\n    //cmp r0,#1\n    //beq 50f\n    bl readKey                       @ read key \n    cmp r0,#-1\n    beq 100f                         @ error or control-c\n    mov r1,r0                        @ key\n    ldr r0,iAdribox\n    bl keyMove\n    ldr r0,iAdribox\n    bl gameOK                        @ end game\u00a0?\n    cmp r0,#1\n    bne 2b                           @ no -> loop\n50:                                  @ win\n    mov r0,r9                        @ move counter\n    ldr r1,iAdrsMessCounter\n    bl conversion10\n    ldr r0,iAdrszMessGameWin\n    bl affichageMess\n\n100:                                 @ standard end of the program \n    mov r0, #0                       @ return code\n    mov r7, #EXIT                    @ request to exit program\n    svc #0                           @ perform the system call\n \niAdrsMessValeur:          .int sMessValeur\niAdrszCarriageReturn:     .int szCarriageReturn\niAdrsMessResult:          .int sMessResult\niAdribox:                 .int ibox\niAdrszMessGameWin:        .int szMessGameWin\niAdrsMessCounter:         .int sMessCounter\n/******************************************************************/\n/*     key move                                                   */ \n/******************************************************************/\n/* r0 contains boxs address           */\n/* r1 contains key value               */\n/* r9 move counter                     */\n/* r10 contains location empty box    */\nkeyMove:\n    push {r1-r8,lr}                  @ save  registers\n    mov r8,r0\n    cmp r1,#0x42                     @ down arrow \n    bne 1f\n    cmp r10,#4                       @ if r10 < 4   error\n    blt 80f\n    sub r2,r10,#4                    @ compute location\n    b 90f\n1:\n    cmp r1,#0x41                     @ high arrow\n    bne 2f\n    cmp r10,#11                      @ if r10 > 11   error\n    bgt 80f\n    add r2,r10,#4                    @ compute location\n    b 90f\n2:\n    cmp r1,#0x43                     @ right arrow\n    bne 3f\n    tst r10,#0b11                    @ if r10 = 0,4,8,12   error\n    beq 80f\n    sub r2,r10,#1                    @ compute location\n    b 90f\n3:\n    cmp r1,#0x44                     @ left arrow\n    bne 100f\n    and r3,r10,#0b11                 @ error if r10 = 3 7 11 and 15\n    cmp r3,#3\n    beq 80f\n    add r2,r10,#1                    @ compute location\n    b 90f\n\n80:                                  @ move error\n    ldr r0,iAdriCodeError\n    mov r1,#1\n    str r1,[r0]\n    b 100f\n90:                                  @ white box and move box inversion\n    ldr r3,[r8,r2,lsl #2]\n    str r3,[r8,r10,lsl #2]\n    mov r10,r2\n    mov r3,#0\n    str r3,[r8,r10,lsl #2]\n    add r9,#1                        @ increment move counter\n100:\n    pop {r1-r8,lr}                   @ restaur registers \n    bx lr                            @return\niAdriCodeError:             .int iCodeError\n/******************************************************************/\n/*     shuffle game                                       */ \n/******************************************************************/\n/* r0 contains boxs address           */\nshuffleGame:\n    push {r1-r6,lr}                     @ save  registers\n    mov r1,r0\n    mov r0,#4\n    bl genereraleas\n    lsl r4,r0,#1\n    mov r0,r8\n1:\n    mov r0,#14\n    bl genereraleas\n    add r6,r0,#1\n    mov r0,#14\n    bl genereraleas\n    add r5,r0,#1\n    ldr r2,[r1,r6,lsl #2]\n    ldr r3,[r1,r5,lsl #2]\n    str r2,[r1,r5,lsl #2]\n    str r3,[r1,r6,lsl #2]\n    subs r4,#1\n    bgt 1b\n\n100:\n    pop {r1-r6,lr}                      @ restaur registers \n    bx lr                               @return\n/******************************************************************/\n/*     game Ok\u00a0?                                      */ \n/******************************************************************/\n/* r0 contains boxs address           */\ngameOK:\n    push {r1-r8,lr}                     @ save  registers\n    mov r8,r0\n    mov r2,#0\n    ldr r3,[r8,r2,lsl #2]\n    add r2,#1\n1:\n    ldr r4,[r8,r2,lsl #2]\n    cmp r4,r3\n    movlt r0,#0                         @ game mot Ok\n    blt 100f\n    mov r3,r4\n    add r2,#1\n    cmp r2,#NBBOX -2\n    ble 1b\n    mov r0,#1                           @ game Ok\n\n100:\n    pop {r1-r8,lr}                      @ restaur registers \n    bx lr                               @return\n/******************************************************************/\n/*     display game                                       */ \n/******************************************************************/\n/* r0 contains boxs address           */\ndisplayGame:\n    push {r1-r5,lr}                     @ save  registers\n    @ clear\u00a0!\n    mov r4,r0\n    ldr r0,iAdrszClear\n    bl affichageMess \n    mov r2,#0\n    ldr r1,iAdrsMessValeur\n1:\n    ldr r0,[r4,r2,lsl #2]\n    cmp r0,#0\n    ldreq r0,iSpaces                    @ store spaces\n    streq r0,[r1]\n    beq 2f\n    bl conversion10                     @ call conversion decimal\n    mov r0,#0\n    strb r0,[r1,#3]                     @ z\u00e9ro final\n2:\n\n    ldr r0,iAdrsMessResult\n    bl affichageMess                    @ display message\n    add r0,r2,#1\n    tst r0,#0b11\n    bne 3f\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess                    @ display message\n3:\n    add r2,#1\n    cmp r2,#NBBOX - 1\n    ble 1b\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess                    @ display line return\n    ldr r0,iAdriCodeError               @ error detected\u00a0?\n    ldr r1,[r0]\n    cmp r1,#0\n    beq 100f\n    mov r1,#0                           @ raz error code\n    str r1,[r0]\n    ldr r0,iAdrszMessMoveError          @ display error message\n    bl affichageMess\n100:\n    pop {r1-r5,lr}                      @ restaur registers \n    bx lr                               @return\niSpaces:                       .int 0x00202020       @ spaces\niAdrszClear:                   .int szClear          \niAdrszMessMoveError:           .int szMessMoveError\n/******************************************************************/\n/*     display text with size calculation                         */ \n/******************************************************************/\n/* r0 contains the address of the message */\naffichageMess:\n    push {r0,r1,r2,r7,lr}                          @ save  registres\n    mov r2,#0                                      @ counter length \n1:                                                 @ loop length calculation \n    ldrb r1,[r0,r2]                                @ read octet start position + index \n    cmp r1,#0                                      @ if 0 its over \n    addne r2,r2,#1                                 @ else add 1 in the length \n    bne 1b                                         @ and loop \n                                                   @ so here r2 contains the length of the message \n    mov r1,r0                                      @ address message in r1 \n    mov r0,#STDOUT                                 @ code to write to the standard output Linux \n    mov r7, #WRITE                                 @ code call system \"write\" \n    svc #0                                         @ call systeme \n    pop {r0,r1,r2,r7,lr}                           @ restaur des  2 registres */ \n    bx lr                                          @ return  \n/******************************************************************/\n/*     Converting a register to a decimal unsigned                */ \n/******************************************************************/\n/* r0 contains value and r1 address area   */\n/* r0 return size of result (no zero final in area) */\n/* area size => 11 bytes          */\n.equ LGZONECAL,   10\nconversion10:\n    push {r1-r4,lr}                                 @ save registers \n    mov r3,r1\n    mov r2,#LGZONECAL\n1:                                                  @ start loop\n    bl divisionpar10U                               @ unsigned  r0 <- dividende. quotient ->r0 reste -> r1\n    add r1,#48                                      @ digit\n    strb r1,[r3,r2]                                 @ store digit on area\n    cmp r0,#0                                       @ stop if quotient = 0 \n    subne r2,#1                                     @ else previous position\n    bne 1b                                          @ and loop\n                                                    @ and move digit from left of area\n    mov r4,#0\n2:\n    ldrb r1,[r3,r2]\n    strb r1,[r3,r4]\n    add r2,#1\n    add r4,#1\n    cmp r2,#LGZONECAL\n    ble 2b\n                                                      @ and move spaces in end on area\n    mov r0,r4                                         @ result length \n    mov r1,#' '                                       @ space\n3:\n    strb r1,[r3,r4]                                   @ store space in area\n    add r4,#1                                         @ next position\n    cmp r4,#LGZONECAL\n    ble 3b                                            @ loop if r4 <= area size\n \n100:\n    pop {r1-r4,lr}                                    @ restaur registres \n    bx lr                                             @return\n \n/***************************************************/\n/*   division par 10   unsigned                    */\n/***************************************************/\n/* r0 dividende   */\n/* r0 quotient    */\n/* r1 remainder   */\ndivisionpar10U:\n    push {r2,r3,r4, lr}\n    mov r4,r0                                          @ save value\n    ldr r3,iMagicNumber                                @ r3 <- magic_number    raspberry 1 2\n    umull r1, r2, r3, r0                               @ r1<- Lower32Bits(r1*r0) r2<- Upper32Bits(r1*r0) \n    mov r0, r2, LSR #3                                 @ r2 <- r2 >> shift 3\n    add r2,r0,r0, lsl #2                               @ r2 <- r0 * 5 \n    sub r1,r4,r2, lsl #1                               @ r1 <- r4 - (r2 * 2)  = r4 - (r0 * 10)\n    pop {r2,r3,r4,lr}\n    bx lr                                              @ leave function \niMagicNumber:  \t.int 0xCCCCCCCD\n/***************************************************/\n/*   Generation random number                  */\n/***************************************************/\n/* r0 contains limit  */\ngenereraleas:\n    push {r1-r4,lr}                                    @ save registers \n    ldr r4,iAdriGraine\n    ldr r2,[r4]\n    ldr r3,iNbDep1\n    mul r2,r3,r2\n    ldr r3,iNbDep1\n    add r2,r2,r3\n    str r2,[r4]                                        @ maj de la graine pour l appel suivant \n    cmp r0,#0\n    beq 100f\n    mov r1,r0                                          @ divisor\n    mov r0,r2                                          @ dividende\n    bl division\n    mov r0,r3                                          @ r\u00e9sult = remainder\n  \n100:                                                   @ end function\n    pop {r1-r4,lr}                                     @ restaur registers\n    bx lr                                              @ return\n/*****************************************************/\niAdriGraine: .int iGraine\niNbDep1: .int 0x343FD\niNbDep2: .int 0x269EC3 \n/***************************************************/\n/* integer division unsigned                       */\n/***************************************************/\ndivision:\n    /* r0 contains dividend */\n    /* r1 contains divisor */\n    /* r2 returns quotient */\n    /* r3 returns remainder */\n    push {r4, lr}\n    mov r2, #0                                         @ init quotient\n    mov r3, #0                                         @ init remainder\n    mov r4, #32                                        @ init counter bits\n    b 2f\n1:                                                     @ loop \n    movs r0, r0, LSL #1                                @ r0 <- r0 << 1 updating cpsr (sets C if 31st bit of r0 was 1)\n    adc r3, r3, r3                                     @ r3 <- r3 + r3 + C. This is equivalent to r3\u00a0? (r3 << 1) + C \n    cmp r3, r1                                         @ compute r3 - r1 and update cpsr \n    subhs r3, r3, r1                                   @ if r3 >= r1 (C=1) then r3 <- r3 - r1 \n    adc r2, r2, r2                                     @ r2 <- r2 + r2 + C. This is equivalent to r2 <- (r2 << 1) + C \n2:\n    subs r4, r4, #1                                    @ r4 <- r4 - 1 \n    bpl 1b                                             @ if r4 >= 0 (N=0) then loop\n    pop {r4, lr}\n    bx lr\n/***************************************************/\n/* read touch                                      */\n/***************************************************/\nreadKey:\n    push {r1-r7,lr}\n    mov r5,#0\n    /* read terminal state */\n    mov r0,#STDIN                                @ input console\n    mov r1,#TCGETS\n    ldr r2,iAdrstOldtio\n    mov r7, #IOCTL                               @ call system Linux\n    svc #0 \n    cmp r0,#0                                    @ error\u00a0?\n    beq 1f\n    ldr r1,iAdrszMessErreur                      @ error message\n    bl   displayError\n    mov r0,#-1\n    b 100f\n1:\n    adr r0,sighandler                            @ adresse routine traitement signal\n    ldr r1,iAdrstSigAction                       @ adresse structure sigaction\n    str r0,[r1,#sa_handler]                      @ maj handler\n    mov r0,#SIGINT                               @ signal type\n    ldr r1,iAdrstSigAction\n    mov r2,#0                                    @ NULL\n    mov r7, #SIGACTION                           @ call system\n    svc #0 \n    cmp r0,#0                                    @ error\u00a0?\n    bne 97f\n    mov r0,#SIGQUIT\n    ldr r1,iAdrstSigAction\n    mov r2,#0                                    @ NULL\n    mov r7, #SIGACTION                           @ call system \n    svc #0 \n    cmp r0,#0                                    @ error\u00a0?\n    bne 97f\n    mov r0,#SIGTERM\n    ldr r1,iAdrstSigAction\n    mov r2,#0                                    @ NULL\n    mov r7, #SIGACTION                           @ appel systeme \n    svc #0 \n    cmp r0,#0\n    bne 97f\n    @\n    adr r0,iSIG_IGN                              @ address signal ignore function\n    ldr r1,iAdrstSigAction1\n    str r0,[r1,#sa_handler]\n    mov r0,#SIGTTOU                              @invalidate other process signal\n    ldr r1,iAdrstSigAction1\n    mov r2,#0                                    @ NULL\n    mov r7,#SIGACTION                            @ call system \n    svc #0 \n    cmp r0,#0\n    bne 97f\n    @\n    /* read terminal current state  */\n    mov r0,#STDIN\n    mov r1,#TCGETS\n    ldr r2,iAdrstCurtio                          @ address current termio\n    mov r7,#IOCTL                                @ call systeme \n    svc #0 \n    cmp r0,#0                                    @ error\u00a0?\n    bne 97f\n    mov r2,#ICANON | ECHO                        @ no key pressed echo on display\n    mvn r2,r2                                    @ and one key \n    ldr r1,iAdrstCurtio\n    ldr r3,[r1,#term_c_lflag]\n    and r3,r2                                    @ add flags \n    str r3,[r1,#term_c_lflag]                    @ and store\n    mov r0,#STDIN                                @ maj terminal current state \n    mov r1,#TCSETS\n    ldr r2,iAdrstCurtio\n    mov r7, #IOCTL                               @ call system\n    svc #0 \n    cmp r0,#0\n    bne 97f\n    @\n2:                                               @ loop waiting key\n    ldr r0,iAdriEnd                              @ if signal ctrl-c  -> end\n    ldr r0,[r0]\n    cmp r0,#0\n    movne r5,#-1\n    bne 98f\n    ldr r0,iAdrstPoll1                            @ address structure poll\n    mov r1,#STDIN\n    str r1,[r0,#poll_fd]                          @ maj FD\n    mov r1,#POLLIN                                @ action code\n    str r1,[r0,#poll_events]\n    mov r1,#1                                     @ items number structure poll\n    mov r2,#0                                     @ timeout = 0 \n    mov r7,#SYSPOLL                               @ call system POLL\n    svc #0 \n    cmp r0,#0                                     @ key pressed\u00a0?\n    ble 2b                                        @ no key pressed -> loop\n                                                  @ read key\n    mov r0,#STDIN                                 @ File Descriptor\n    ldr r1,iAdriTouche                            @ buffer address\n    mov r2,#TAILLEBUFFER                          @ buffer size\n    mov r7,#READ                                  @ read key\n    svc #0\n    cmp r0,#0                                     @ error\u00a0?\n    bgt 98f\n\n97:                                               @ error detected\n    ldr r1,iAdrszMessErreur                       @ error message\n    bl   displayError\n    mov r5,#-1\n98:                                               @ end then restaur begin state terminal\n    mov r0,#STDIN\n    mov r1,#TCSETS\n    ldr r2,iAdrstOldtio\n    mov r7,#IOCTL                                 @ call system  \n    svc #0\n    cmp r0,#0\n    beq 99f                                       @ restaur ok\n    ldr r1,iAdrszMessErreur                       @ error message\n    bl   displayError\n    mov r0,#-1\n    b 100f\n99:\n    cmp r5,#0                                     @ error or control-c\n    ldreq r2,iAdriTouche                          @ key address\n    ldreqb r0,[r2,#2]                             @ return key byte\n    movne r0,r5                                   @ or error\n100:\n    pop {r1-r7, lr}\n    bx lr\niSIG_IGN:                 .int 1\niAdriEnd:                 .int iEnd\niAdrstPoll1:              .int stPoll1\niAdriTouche:              .int iTouche\niAdrstOldtio:             .int stOldtio\niAdrstCurtio:             .int stCurtio\niAdrstSigAction:          .int stSigAction\niAdrstSigAction1:         .int stSigAction1\niAdrszMessErreur\u00a0:        .int szMessErreur \n/******************************************************************/\n/*     traitement du signal                                       */ \n/******************************************************************/\nsighandler:\n    push {r0,r1}\n    ldr r0,iAdriEnd\n    mov r1,#1                 @ maj zone end\n    str r1,[r0]\n    pop {r0,r1}\n    bx lr\n/***************************************************/\n/*   display error message                         */\n/***************************************************/\n/* r0 contains error code  r1\u00a0: message address */\ndisplayError:\n    push {r0-r2,lr}                         @ save registers\n    mov r2,r0                               @ save error code\n    mov r0,r1\n    bl affichageMess\n    mov r0,r2                               @ error code\n    ldr r1,iAdrsHexa\n    bl conversion16                         @ conversion hexa\n    mov r0,r2                               @ error code\n    ldr r1,iAdrsDeci                        @ result address\n    bl conversion10                         @ conversion decimale\n    ldr r0,iAdrszMessErr                    @ display error message\n    bl affichageMess\n100:\n    pop {r0-r2,lr}                          @ restaur registers\n    bx lr                                   @ return \niAdrszMessErr:                 .int szMessErr\niAdrsHexa:                     .int sHexa\niAdrsDeci:                     .int sDeci\n/******************************************************************/\n/*     Converting a register to hexadecimal                      */ \n/******************************************************************/\n/* r0 contains value and r1 address area   */\nconversion16:\n    push {r1-r4,lr}                                    @ save registers\n    mov r2,#28                                         @ start bit position\n    mov r4,#0xF0000000                                 @ mask\n    mov r3,r0                                          @ save entry value\n1:                                                     @ start loop\n    and r0,r3,r4                                       @value register and mask\n    lsr r0,r2                                          @ move right \n    cmp r0,#10                                         @ compare value\n    addlt r0,#48                                       @ <10  ->digit\t\n    addge r0,#55                                       @ >10  ->letter A-F\n    strb r0,[r1],#1                                    @ store digit on area and + 1 in area address\n    lsr r4,#4                                          @ shift mask 4 positions\n    subs r2,#4                                         @  counter bits - 4 <= zero \u00a0?\n    bge 1b                                             @  no -> loop\n\n100:\n    pop {r1-r4,lr}                                     @ restaur registers \n    bx lr                                              @return",
        "safe": true
    },
    {
        "filename": "15 puzzle game_140.txt",
        "content": "  1   2   3   4 \n  5   6   7   8 \n  9  10  12     \n 13  14  11  15 \n\nenter u/d/l/r or q: r\n\n  1   2   3   4 \n  5   6   7   8 \n  9  10      12 \n 13  14  11  15 \n\nenter u/d/l/r or q: u\n\n  1   2   3   4 \n  5   6   7   8 \n  9  10  11  12 \n 13  14      15 \n\nenter u/d/l/r or q: l\n\n  1   2   3   4 \n  5   6   7   8 \n  9  10  11  12 \n 13  14  15     \n\n\n** You did it! **\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_15.txt",
        "content": ";; ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~\n;; ===>> ~~ Game's functions ~~ <<===\n;; --->> ~~ Init functions ~~ <<---\n\n;; This is a solved sample that is used to\n;; init and finish the game\nsolvedTable: @[ \"  1  \" \"  2  \" \"  3  \" \"  4  \"\n                \"  5  \" \"  6  \" \"  7  \" \"  8  \"\n                \"  9  \" \"  10 \" \"  11 \" \"  12 \"\n                \"  13 \" \"  14 \" \"  15 \" \"     \" ]\n\n;; Use this once in :game's init, to get a player position\n;; Q: Why use it once?\n;; A: This algorithm is slower than just get a stored varible\n;; yet this searches for a string for every value from :game\ngetPlayerPosition: $[table :block][\n    return index table \"     \"\n]\n\n;; This is the object that represents the game\n;; 'table\u00a0\u00bb The sample table to generate the game\ndefine :game [\n    table :block\n][\n\n    init: [\n        ; checks if 'table has 16 elements\n        ensure [16 = size this\\table]\n\n        ;; The game's table itself\n        this\\table: (shuffle this\\table) ; creates a random game\n        ;; The current movement. When less, better is your punctuation\n        this\\movements: 0\n        ;; The current 'playerPosition in table\n        ;; Used to evaluate if certain movement is possible or not\n        this\\playerPosition: getPlayerPosition this\\table\n        ;; Defines it the gameLoop still running\n        this\\running?: true\n    ]\n\n    ;; A builtin print function that simplifies the use\n    print: [\n        render {\n            Movements: |this\\movements|, Position: |this\\playerPosition|\n            *-----*-----*-----*-----*\n             |this\\table\\0| |this\\table\\1| |this\\table\\2| |this\\table\\3|\n            *-----*-----*-----*-----*\n             |this\\table\\4| |this\\table\\5| |this\\table\\6| |this\\table\\7|\n            *-----*-----*-----*-----*\n             |this\\table\\8| |this\\table\\9| |this\\table\\10| |this\\table\\11|\n            *-----*-----*-----*-----*\n             |this\\table\\12| |this\\table\\13| |this\\table\\14| |this\\table\\15|\n            *-----*-----*-----*-----*\n        }\n    ]\n\n    ;; Compares the internal's 'table with another :block\n    compare: [\n        if this\\table = that\n            -> return true\n    ]\n\n]\n\n;; These are the commands used internally on game\n;; To avoid ambiguity, User's input'll to be translated to this\ngameActions: ['up, 'left, 'down, 'right, 'quit]\n\n\n;; ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~\n;; -->> Print funnctions <<---\n\n;; A template for print instructions\nprintInstructions: [\n    color #cyan \"Type (WASD) to move and (Q) to quit.\"\n]\n\n;; A template for print input warning\n;; 'input: the wrong input itself that will be printed\nprintWrongInput: $[inp :string][\n    print color #red\n    ~\"Wrong input: '|inp|'\"\n]\n\n;; A template for print input warning\n;; 'action: could be 'up, 'down, 'left or 'right\nprintWrongMovement: $[action :literal][\n    print color #red\n    ~\"Wrong movement. Can't go |action|\"\n]\n\n\n;; ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~\n;; --->> Validators/Checkers functions <<---\n\n;; Checks if a 'input is in 'gameActions\n;; Valids for: 'up, 'down, 'left, 'right and 'quit\nvalidInput?: $[inp :any][\n    return (in? inp gameActions)\n]\n\n;; Checks if the current movement tried is possible\n;; 'game\u00a0\u00bb is the current game\n;; 'movement\u00a0\u00bb must be in 'gameActions, but can't be 'quit\nvalidMovement?: $[\n    game     :game\n    movement :literal\n][\n    pos: game\\playerPosition\n    case [movement]\n        when? [='up]\n            -> return (not? in? pos [0..3])\n        when? [='down]\n            -> return (not? in? pos [12..15])\n        when? [='left]\n            -> return (not? in? pos [0 4 8 12])\n        when? [='right]\n            -> return (not? in? pos [3 7 11 15])\n    else\n        -> return false\n]\n\n\n;; ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~\n;; --->> Action functions <<---\n\n;; Gets user input from terminal\n;; returning a :literal from 'gameActions\n;; Raises: In case of wrong input,\n;; will be returned the same input as a :string\nparseInput: $[inp :string][\n    lowerInp: lower inp\n    case [lowerInp]\n        when? [=\"w\"] -> return 'up\n        when? [=\"a\"] -> return 'left\n        when? [=\"s\"] -> return 'down\n        when? [=\"d\"] -> return 'right\n        when? [=\"q\"] -> return 'quit\n    else -> return inp\n]\n\n;; Moves the player in Game's Table\n;; Note that this's a unsafe function,\n;; use 'validMovement? to check a 'movement given a game,\n;; and then use this\nmovePlayer: $[\n    game     :game\n    movement :literal\n][\n\n    position: game\\playerPosition\n\n    updateGame: $[\n        game             :game\n        playerPosition   :integer\n        relativePosition :integer\n    ][\n        try [\n\n            ; 'otherPosition is the real index of the 'relativePosition\n            otherPosition: + playerPosition relativePosition\n\n            ; -- Updates the table, swaping the positions\n            temp: game\\table\\[playerPosition]\n            game\\table\\[playerPosition]: game\\table\\[otherPosition]\n            game\\table\\[otherPosition]: temp\n\n            ; -- Updates player's status\n            game\\playerPosition: otherPosition\n            game\\movements: inc game\\movements\n        ] else -> panic \"'movement didn't checked.\"\n    ]\n\n    case [movement]\n    when? [='up]\n        -> (updateGame game position (neg 4))\n    when? [='down]\n        -> (updateGame game position (4))\n    when? [='left]\n        -> (updateGame game position (neg 1))\n    when? [='right]\n        -> (updateGame game position (1))\n    else -> panic \"'movement didn't checked.\"\n\n]\n\nendGame: $[\n    message :string\n][\n    print message\n    exit\n]\n\n\n;; ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~\n;; --->> Run function <<---\n\n;; Inits ans runs the game\n;; 'sampleTable must be already solved\nrunGame: $[sampleTable :block][\n    game: to :game [sampleTable]\n\n    while [game\\running?] [\n        print game\n        print printInstructions\n        command: parseInput input \">> \"\n\n        if command = 'quit\n            -> endGame \"Exiting game...\"\n\n        validInp: validInput? command\n        if? validInp [\n            validMov: validMovement? game command\n            (validMov)?\n                -> movePlayer game command\n                -> printWrongMovement command\n        ] else\n            -> printWrongInput command\n\n        if sampleTable = game\n            -> endGame \"Congratulations! You won!\"\n        print \"\"\n    ]\n]\n\n\nrunGame solvedTable\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_16.txt",
        "content": "type Puzzle(var items: {}, var position: -1)\n\nfun mainframe(puz):\n    let d = puz.items\n    print('+-----+-----+-----+-----+')\n    print(d[1], d[2], d[3], d[4], first: '|', sep: '|', last: '|')\n    print('+-----+-----+-----+-----+')\n    print(d[5], d[6], d[7], d[8], first: '|', sep: '|', last: '|')\n    print('+-----+-----+-----+-----+')\n    print(d[9], d[10], d[11], d[12], first: '|', sep: '|', last: '|')\n    print('+-----+-----+-----+-----+')\n    print(d[13], d[14], d[15], d[16], first: '|', sep: '|', last: '|')\n    print('+-----+-----+-----+-----+')\n\nfun format(puz, ch):\n    match ch.trim().length:\n        1 => '  $ch  '\n        2 => '  $ch '\n        0 => '     '\n\nfun change(puz, to):\n    let fro = puz.position\n    for a, b in puz.items where b == puz.format(str i):\n        to = a\n        break\n\n    swap(puz.items[fro], :[to])\n    puz.position = to;\n\nfun buildboard(puz, difficulty):\n    for i in 1..16:\n        puz.items[i] = puz.format(str i)\n\n    var tmp = a\n    for a, b in puz.items where b == '  16 ':\n        puz.items[a] = '     '\n            tmp = a\n            break\n\n    puz.position = tmp\n    let diff = match difficulty:\n        0 => 10\n        1 => 50\n        _ => 100\n\n    for i in 1..diff:\n        let lst = puz.validmoves()\n        let lst1 = []\n        for j in lst:\n            lst1.push! j.trim().int()\n        puz.change(lst1[random(1, lst1.length - 1)])\n\nfun validmoves(puz):\n    match puz.position:\n        6 | 7 | 10 | 11 =>\n            puz.items[pos - 4], :[pos - 1], :[pos + 1], :[pos + 4]\n        5 | 9 =>\n            puz.items[pos - 4], :[pos + 4], :[pos + 1]\n        8 | 12 =>\n            puz.items[pos - 4], :[pos + 4], :[pos - 1]\n        2 | 3 =>\n            puz.items[pos - 1], :[pos + 1], :[pos + 4]\n        14 | 15 =>\n            puz.items[pos - 1], :[pos + 1], :[pos - 4]\n        1 =>\n            puz.items[pos + 1], :[pos + 4]\n        4 =>\n            puz.items[pos - 1], :[pos + 4]\n        13 =>\n            puz.items[pos + 1], :[pos - 4]\n        16 =>\n            puz.items[pos - 1], :[pos - 4]\n\nfun mainframe(puz):\n    var flag = false\n    for a, b in puz.items:\n        if b == '     ':\n            pass\n        else:\n            flag = (a == b.trim().int())\n    ..\n    return flag\n\nlet game = Puzzle()\ngame.buildboard(\n    int(input('Enter the difficulty\u00a0: 0 1 2\\n2 => highest 0=> lowest\\n'))\n)\ngame.mainframe()\n\nprint 'Enter 0 to exit'\n\nloop:\n    print 'Hello user:\\nTo change the position just enter the no. near it'\n\n    var lst = game.validmoves()\n    var lst1 = []\n    for i in lst:\n        lst1.push! i.trim().int()\n        print(i.strip(), '\\t', last: '')\n\n    print()\n\n    let value = int(input())\n    if value == 0:\n        break\n    elif x not in lst1:\n        print('Wrong move')\n    else:\n        game.change(x)\n\n    game.mainframe()\n    if g.gameover():\n        print 'You WON'\n        break\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_17.txt",
        "content": "Size := 20\nGrid := [], Deltas := [\"-1,0\",\"1,0\",\"0,-1\",\"0,1\"], Width := Size * 2.5\nGui, font, S%Size%\nGui, add, text, y1\nloop, 4\n{\n\tRow := A_Index\n\tloop, 4\n\t{\n\t\tCol := A_Index\n\t\tGui, add, button, % (Col=1 ? \"xs y+1\" : \"x+1 yp\") \" v\" Row \"_\" Col \" w\" Width \" gButton -TabStop\", % Grid[Row,Col] := Col + (Row-1)*4\u00a0; 1-16\n\t}\n}\nGuiControl, Hide, % Row \"_\" Col\t; 4_4\nGui, add, Button, % \"xs gShuffle w\" 4 * Width + 3, Shuffle\nGui, show,, 15 Puzzle\nreturn\n;------------------------------\nGuiClose:\nExitApp\nreturn\n;------------------------------\nShuffle:\nShuffle := true\nloop, 1000\n{\n\tRandom, Rnd, 1,4\n\tMove(StrSplit(Deltas[Rnd], \",\").1, StrSplit(Deltas[Rnd], \",\").2)\n}\nShuffle := false\nreturn\n;------------------------------\nButton:\nbuttonRow := SubStr(A_GuiControl, 1, 1), ButtonCol := SubStr(A_GuiControl, 3, 1)\nif Abs(buttonRow-Row) > 1 || Abs(ButtonCol-Col) > 1 || Abs(buttonRow-Row) = Abs(ButtonCol-Col)\n\treturn\nMove(buttonRow-Row, ButtonCol-Col)\nreturn\n;------------------------------\n#IfWinActive, 15 Puzzle\n;------------------------------\nDown::\nMove(-1, 0)\nreturn\n;------------------------------\nUp::\nMove(1, 0)\nreturn\n;------------------------------\nRight::\nMove(0, -1)\nreturn\n;------------------------------\nLeft::\nMove(0, 1)\nreturn\n;------------------------------\n#IfWinActive\n;------------------------------\nMove(deltaRow, deltaCol){\n\tglobal\n\tif (Row+deltaRow=0) || (Row+deltaRow=5) || (Col+deltaCol=0) || (Col+deltaCol=5)\n\t\treturn\n\tGuiControl, Hide, % Row+deltaRow \"_\" Col+deltaCol\n\tGuiControl, Show, % Row \"_\" Col\n\tGuiControl,, %Row%_%Col%, % Grid[Row+deltaRow, Col+deltaCol]\n\tGrid[Row, Col] := Grid[Row+deltaRow, Col+deltaCol]\n\tGrid[Row+=deltaRow, Col+=deltaCol] := 16\n\tif Shuffle\n\t\treturn\n\tgridCont := \"\"\n\tfor m, obj in grid\n\t\tfor n, val in obj\n\t\t\tgridCont .= val \",\"\n\tif (Trim(gridCont, \",\") = \"1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16\")\n\t\tMsgBox, 262208, 15 Puzzle, You solved 15 Puzzle\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_18.txt",
        "content": " 100  GOSUB 500INITIALIZE\n 110  FOR Q = 1 TO 1\n 120      IF I <> X  OR J <> Y THEN GOSUB 200MOVE\n 130      ON W GOSUB 330,450\n 140      LET I = K(0, K) + X\n 150      LET J = K(1, K) + Y\n 160      LET Q = K(2, K) OR W = 3\n 170  NEXT Q\n 180  VTAB T + 3\n 190  END\n\n REM MOVE\n 200  IF I < 0 THEN RETURN\n 210  IF I > 3 THEN RETURN\n 220  IF J < 0 THEN RETURN\n 230  IF J > 3 THEN RETURN\n 240  LET M = (I + J * 4) * 3\n 250  LET N = (X + Y * 4) * 3\n 260  IF N > M GOTO 290SWAP\n 270      LET N = M\n 280      LET M = (X + Y * 4) * 3\n REM SWAP\n 290  LET A$ = MID$(A$, 1, M) + MID$(A$, N + 1, 2) + MID$(A$,M + 3, N - M - 2) + MID$(A$, M + 1, 2) + MID$(A$, N + 3)\n 300  LET X = I\n 310  LET Y = J\n 320  ON W GOTO 440,400\n\n REM RANDOM MOVE\n 330  VTAB T + 3\n 340  HTAB 2\n 350  PRINT MID$(S$, S + 1, 10);\n 360  LET S = NOT S\n 370  LET K = INT(RND(1) * 4) + 1\n 380  IF PEEK(49152) < 128 OR A$ = W$ THEN RETURN\n 390  LET K = PEEK(49168) * 0\n REM SHOW\n 400  VTAB T\n 410  HTAB 1\n 420  PRINT A$;\n 430  LET W = (A$ = W$) + 2\n REM DON'T SHOW\n 440  RETURN\n\n REM GET KEY\n 450  VTAB T + Y\n 460  HTAB X * 3 + 2\n 470  GET K$\n 480  LET K =  ASC (K$)\n 490  RETURN\n\n REM INITIALIZE\n 500  PRINT \" 15-PUZZLE\"\n\n REM KEYBOARD\n\n REM ARROW KEYS  TWO HANDED  CLASSIC T  REVERSE T  SEQUENCED\n REM    ^K           A           I          G         ^C\n REM ^H ^J ^U     ,  Z  .     J  K  L    H  T  F   ^B ^D ^A\n\n REM RIGHT    ,  J      H   ^A\n 510  DATA8,44,74,106,72,104,1\n\n REM LEFT    .  L      F     ^B\n 520  DATA21,46,76,108,70,102,2\n\n REM DOWN    A     I      G     ^C\n 530  DATA11,65,97,73,105,71,103,3\n\n REM UP      Z      K      T     ^D\n 540  DATA10,90,122,75,107,84,116,4\n\n REM QUIT   ^Q ESC\n 550  DATA0,17,27,0\n \n 560  DIM K(2,127)\n 570  FOR V = 0 TO 2\n 580      FOR D =  - 1 TO 1 STEP 2\n 590          FOR R = 1 TO 1\n 600              READ K\n 610              LET K(V,K) = D\n 620              LET R = K < 5\n 630  NEXT R,D,V\n 640  LET A$ = \" 1  2  3  4\"\n 650  LET M$ =  CHR$ (13)\n 660  LET L$ = \" 5  6  7  8\"\n 670  LET A$ = A$ + M$ + L$\n 680  LET L$ = \" 9 10 11 12\"\n 690  LET A$ = A$ + M$ + L$\n 700  LET L$ = \"13 14 15   \"\n 710  LET A$ = A$ + M$ + L$\n 720  LET W$ = A$\n 730  DATA3,3,3,3,1,0\n 740  READ X,Y,I,J,W,k(2, 0)\n 750  PRINT \"PRESS A KEY\"\n 760  PRINT \" TO STOP\"\n 770  LET S$ = \" SHUFFLING \"\n 780  LET T = PEEK(37) - 2\n 790  RETURN\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_19.txt",
        "content": "10 REM 15-PUZZLE GAME\n20 REM COMMODORE BASIC 2.0\n30 REM ********************************\n40 GOSUB 400 : REM INTRO AND LEVEL\n50 GOSUB 510 : REM SETUP BOARD\n60 GOSUB 210 : REM PRINT PUZZLE\n70 PRINT \"TO MOVE A PIECE, ENTER ITS NUMBER:\"\n80 INPUT X\n90 GOSUB 760 : REM CHECK IF MOVE IS VALID\n100 IF MV=0 THEN PRINT \"WRONG MOVE\" : GOSUB 1130 : GOTO 60\n110 D(Z)=X : D(Y)=0\n120 GOSUB 210 : REM PRINT PUZZLE\n130 GOSUB 1030: REM CHECK IF PUZZLE COMPLETE\n140 IF PC THEN 160\n150 GOTO 70\n160 PRINT\"YOU WON!\"\n170 END\n180 REM\n190 REM *******************************\n200 REM PRINT/DRAW THE PUZZLE\n210 FOR P=1 TO 16\n220   IF D(P)=0 THEN D$(P)=\"     \" : GOTO 260\n230   S$=STR$(D(P))\n240   N=LEN(S$)\n250   D$(P) = LEFT$(\"   \",3-N)+S$+\"  \"\n260 NEXT\n270 PRINT \"+-----+-----+-----+-----+\"\n280 PRINT \"!\"D$(1)\"!\"D$(2)\"!\"D$(3)\"!\"D$(4)\"!\"\n290 PRINT \"+-----+-----+-----+-----+\"\n300 PRINT \"!\"D$(5)\"!\"D$(6)\"!\"D$(7)\"!\"D$(8)\"!\"\n310 PRINT \"+-----+-----+-----+-----+\"\n320 PRINT \"!\"D$(9)\"!\"D$(10)\"!\"D$(11)\"!\"D$(12)\"!\"\n330 PRINT \"+-----+-----+-----+-----+\"\n340 PRINT \"!\"D$(13)\"!\"D$(14)\"!\"D$(15)\"!\"D$(16)\"!\"\n350 PRINT \"+-----+-----+-----+-----+\"\n360 RETURN\n370 REM\n380 REM *******************************\n390 REM INTRO AND LEVEL OF DIFFICULTY\n400 PRINT CHR$(147)\n410 DIM SH(3) : SH(1)=10 : SH(2)=50 : SH(3)=100\n420 PRINT \"15 PUZZLE GAME FOR COMMODORE BASIC 2.0\" : PRINT : PRINT\n430 PRINT \"PLEASE ENTER LEVEL OF DIFFICULTY,\"\n440 PRINT \"1(EASY), 2(MEDIUM) OR 3(HARD):\";\n450 INPUT V\n460 IF V<1 OR V>3 THEN 440\n470 RETURN\n480 REM\n490 REM *******************************\n500 REM BUILD THE BOARD\n510 DIM D(16) : DIM D$(16) : REM BOARD PIECES\n520 REM SET PIECES IN CORRECT ORDER FIRST\n530 FOR P=1 TO 15\n540   D(P) = P\n550 NEXT\n560 D(16) = 0 : REM 0 = EMPTY PIECE/SLOT\n570 Z=16      : REM Z = EMPTY POSITION\n580 PRINT: PRINT \"SHUFFLING PIECES\";\n590 FOR N=1 TO SH(V)\n600   PRINT\".\";\n610   X = INT(RND(0)*4)+1\n620   IF X=1 THEN R=Z-4\n630   IF X=2 THEN R=Z+4\n640   IF (X=3) AND (INT((Z-1)/4)<>(Z-1)/4) THEN R=Z-1\n650   IF (X=4) AND (INT(Z/4)<>Z/4) THEN R=Z+1\n660   IF R<1 OR R>16 THEN 610\n670   D(Z)=D(R)\n680   Z=R\n690   D(Z)=0\n700 NEXT\n710 PRINT CHR$(147)\n720 RETURN\n730 REM\n740 REM *******************************\n750 REM CHECK IF MOVE IS VALID\n760 MV = 0\n770 IF X<1 OR X>15 THEN RETURN\n780 REM FIND POSITION OF PIECE X AND OF EMPTY PIECE\n790 AX=X\n800 GOSUB 940 : REM FIND POSITION OF PIECE AX\n810 Y=P\n820 AX=0\n830 GOSUB 940 : REM FIND POSITION OF PIECE AX\n840 Z=P\n850 REM CHECK IF EMPTY PIECE IS ABOVE, BELOW, LEFT OR RIGHT TO PIECE X\n860 IF Y-4=Z THEN MV=1 : RETURN\n870 IF Y+4=Z THEN MV=1 : RETURN\n880 IF (Y-1=Z) AND (INT(Z/4)<>Z/4) THEN MV=1 : RETURN\n890 IF (Y+1=Z) AND (INT(Y/4)<>Y/4) THEN MV=1 : RETURN\n900 RETURN\n910 REM\n920 REM *******************************\n930 REM FIND POSITION OF PIECE AX\n940 P=1\n950 IF D(P)=AX THEN 990\n960   P=P+1\n970   IF P>16 THEN PRINT \"UH OH!\" : STOP\n980 GOTO 950\n990 RETURN\n1000 REM\n1010 REM *******************************\n1020 REM CHECK IF PUZZLE IS COMPLETE / GAME OVER\n1030 PC = 0\n1040 P=1\n1050 IF (P>=16) OR (D(P)<>P) THEN 1080\n1060   P=P+1\n1070 GOTO 1050\n1080 IF P=16 THEN PC=1\n1090 RETURN\n1100 REM\n1110 REM ******************************\n1120 REM A SMALL DELAY\n1130 FOR T=0 TO 400\n1140 NEXT\n1150 RETURN\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_2.txt",
        "content": ";15 PUZZLE GAME\n;Ram Variables\nCursor_X equ $00FF0000\t\t;Ram for Cursor Xpos\nCursor_Y equ $00FF0000+1\t;Ram for Cursor Ypos\njoypad1 equ $00FF0002\n\nGameRam equ $00FF1000\t\t;Ram for where the pieces are\nGameRam_End equ $00FF100F\t;the last valid slot in the array\n;Video Ports\nVDP_data\tEQU\t$C00000\t; VDP data, R/W word or longword access only\nVDP_ctrl\tEQU\t$C00004\t; VDP control, word or longword writes only\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n; \t\t\t\t\tVECTOR TABLE\n;org $00000000\n\tDC.L\t$00FFFFFE\t\t;SP register value\n\tDC.L\tProgramStart\t;Start of Program Code\n\tDC.L\tIntReturn\t\t; bus err\n\tDC.L\tIntReturn\t\t; addr err\n\tDC.L\tIntReturn\t\t; illegal inst\n\tDC.L\tIntReturn\t\t; divzero\n\tDC.L\tIntReturn\t\t; CHK\n\tDC.L\tIntReturn\t\t; TRAPV\n\tDC.L\tIntReturn\t\t; privilege viol\n\tDC.L\tIntReturn\t\t; TRACE\n\tDC.L\tIntReturn\t\t; Line A (1010) emulator\n\tDC.L\tIntReturn\t\t; Line F (1111) emulator\n\tDC.L\tIntReturn,IntReturn,IntReturn,IntReturn\t\t; Reserved /Coprocessor/Format err/ Uninit Interrupt\n\tDC.L\tIntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn\n\tDC.L\tIntReturn\t\t; spurious interrupt\n\tDC.L\tIntReturn\t\t; IRQ level 1\n\tDC.L\tIntReturn\t\t; IRQ level 2 EXT\n\tDC.L\tIntReturn\t\t; IRQ level 3\n\tDC.L\tIntReturn\t\t; IRQ level 4 Hsync\n\tDC.L\tIntReturn\t\t; IRQ level 5\n\tDC.L\tIntReturn\t\t; IRQ level 6 Vsync\n\tDC.L\tIntReturn\t\t; IRQ level 7 (NMI)\n;org $00000080\n;TRAPS\n\tDC.L\tIntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn\n\tDC.L\tIntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn\n;org $000000C0\n;FP/MMU\n\tDC.L\tIntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn\n\tDC.L\tIntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn\n\n\t\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;\t\t\t\t\tHeader\nHEADER:\n\tDC.B\t\"SEGA GENESIS    \"\t        ;System Name\tMUST TAKE UP 16 BYTES, USE PADDING IF NECESSARY\n\tDC.B\t\"(C)PDS  \"\t\t\t;Copyright\tMUST TAKE UP 8 BYTES, USE PADDING IF NECESSARY\n \tDC.B\t\"2022.JUN\"\t\t\t;Date\t\tMUST TAKE UP 8 BYTES, USE PADDING IF NECESSARY\nCARTNAME:\n\tDC.B \t\"15 PUZZLE\"\nCARTNAME_END:\n\tDS.B 48-(CARTNAME_END-CARTNAME)\t;ENSURES PROPER SPACING\nCARTNAMEALT:\n\tDC.B\t\"15 PUZZLE\"\nCARTNAMEALT_END:\n\tDS.B 48-(CARTNAMEALT_END-CARTNAMEALT)\t;ENSURES PROPER SPACING\ngameID:\n\tDC.B\t\"GM PUPPY001-00\"\t        ;TT NNNNNNNN-RR T=Type (GM=Game) N=game Num  R=Revision\n\tDC.W\t$0000\t\t\t\t;16-bit Checksum (Address $000200+)\nCTRLDATA:\n\tDC.B\t\"J               \"\t        ;Control Data (J=3button K=Keyboard 6=6button C=cdrom) \n                                                ;(MUST TAKE UP 16 BYTES, USE PADDING IF NECESSARY)\nROMSTART:\n\tDC.L\t$00000000\t\t\t;ROM Start\nROMLEN:\n\tDC.L\t$003FFFFF\t\t\t;ROM Length\nRAMSTART:\n\tDC.L\t$00FF0000\nRAMEND:\n\tDC.L\t$00FFFFFF\t;RAM start/end (fixed)\n\n\tDC.B\t\"            \"\t\t;External RAM Data\t(MUST TAKE UP 12 BYTES, USE PADDING IF NECESSARY)\n\tDC.B\t\"            \"\t\t;Modem Data\t\t(MUST TAKE UP 12 BYTES, USE PADDING IF NECESSARY)\nMEMO:\n\tDC.B\t\"                                        \"      ;(MUST TAKE UP 40 BYTES, USE PADDING IF NECESSARY)\nREGION:\n\tDC.B\t\"JUE             \"\t;Regions Allowed        (MUST TAKE UP 16 BYTES, USE PADDING IF NECESSARY)\n\teven\nHEADER_END:\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;\t\t\t\t\tGeneric Interrupt Handler\nIntReturn:\n\trte                            ;immediately return to game\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;\t\t\t\t\tProgram Start\nProgramStart:\n\t;initialize TMSS (TradeMark Security System)\n\tmove.b ($A10001),D0\t\t;A10001 test the hardware version\n\tand.b #$0F,D0\n\tbeq\tNoTmss\t\t\t\t;branch if no TMSS chip\n\tmove.l #'SEGA',($A14000);A14000 disable TMSS \nNoTmss:\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;\t\t\t\t\tSet Up Graphics\n\n\tlea VDPSettings,A5\t\t      ;Initialize Screen Registers\n\tmove.l #VDPSettingsEnd-VDPSettings,D1 ;length of Settings\n\t\n\tmove.w (VDP_ctrl),D0\t              ;C00004 read VDP status (interrupt acknowledge?)\n\tmove.l #$00008000,d5\t              ;VDP Reg command (%8rvv)\n\t\nNextInitByte:\n\tmove.b (A5)+,D5\t\t\t      ;get next video control byte\n\tmove.w D5,(VDP_ctrl)\t              ;C00004 send write register command to VDP\n\t\t;   8RVV - R=Reg V=Value\n\tadd.w #$0100,D5\t\t\t      ;point to next VDP register\n\tdbra D1,NextInitByte\t              ;loop for rest of block\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;       Set up palette\n\t\n\t;Define palette\n\tmove.l #$C0000000,d0\t;Color 0 (background)\n\tmove.l d0,VDP_Ctrl\n\t;        ----BBB-GGG-RRR-\n\tmove.w #%0000011000000000,VDP_data\n\t\n\tmove.l #$C01E0000,d0\t;Color 15 (Font)\n\tmove.l d0,VDP_Ctrl\n\tmove.w #%0000000011101110,VDP_data\n\t\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;\t\t\t\t\tSet up Font\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n; FONT IS 1BPP, THIS ROUTINE CONVERTS IT TO A 4BPP FORMAT.\n\tlea Font,A1\t\t\t\t\t ;Font Address in ROM\n\tmove.l #Font_End-Font,d6\t                 ;Our font contains 96 letters 8 lines each\n\t\n\tmove.l #$40000000,(VDP_Ctrl);Start writes to VRAM address $0000\nNextFont:\n\tmove.b (A1)+,d0\t\t;Get byte from font\n\tmoveq.l #7,d5\t\t;Bit Count (8 bits)\n\tclr.l d1\t\t;Reset BuildUp Byte\n\t\nFont_NextBit:\t\t\t;1 color per nibble = 4 bytes\n\n\trol.l #3,d1\t\t;Shift BuildUp 3 bits left\n\troxl.b #1,d0\t\t;Shift a Bit from the 1bpp font into the Pattern\n\troxl.l #1,d1\t\t;Shift bit into BuildUp\n\tdbra D5,Font_NextBit    ;Next Bit from Font\n\t\n\tmove.l d1,d0\t\t; Make fontfrom Color 1 to color 15\n\trol.l #1,d1\t\t;Bit 1\n\tor.l d0,d1\n\trol.l #1,d1\t\t;Bit 2\n\tor.l d0,d1\n\trol.l #1,d1\t\t;Bit 3\n\tor.l d0,d1\n\t\n\tmove.l d1,(VDP_Data);Write next Long of char (one line) to VDP\n\tdbra d6,NextFont\t;Loop until done\n\n\t\n\n\tclr.b Cursor_X\t\t;Clear Cursor XY\n\tclr.b Cursor_Y\n\t\n\t;Turn on screen\n\tmove.w\t#$8144,(VDP_Ctrl);C00004 reg 1 = 0x44 unblank display\n\t\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n; all of the above was just the prep work to boot the Sega Genesis, and had nothing to do with a 15 Puzzle.\n; That's hardware for you!\n\n\tLEA GameRam,A0        \n        ;load the initial state of the puzzle. There is no randomization here unfortunately, as creating a sufficient pseudo-RNG\n        ;to make the game \"believable\" is more difficult than programming the game itself!\n        ;so instead we'll start in such a manner that the player has to do quite a bit of work to win.\n\tMOVE.B #'F',(A0)+\n\tMOVE.B #'E',(A0)+\n\tMOVE.B #'D',(A0)+\n\tMOVE.B #'C',(A0)+\n\tMOVE.B #'B',(A0)+\n\tMOVE.B #'A',(A0)+\n\tMOVE.B #'9',(A0)+\n\tMOVE.B #'8',(A0)+\n\tMOVE.B #'7',(A0)+\n\tMOVE.B #'6',(A0)+\n\tMOVE.B #'5',(A0)+\n\tMOVE.B #'4',(A0)+\n\tMOVE.B #'3',(A0)+\n\tMOVE.B #'2',(A0)+\n\tMOVE.B #'1',(A0)+\n\tMOVE.B #' ',(A0)+\n\n       ;puzzle will look like:\n       ;FEDC\n       ;BA98\n       ;7654\n       ;321 \n\nmain:\n\tJSR Player_ReadControlsDual     ;get controller input\n\tmove.w d0,(joypad1)\n\n\n\t;adjust the number of these as you see fit.\n\t;this affects the game's overall speed.\n\tJSR waitVBlank\n\tJSR waitVBlank\n\tJSR waitVBlank\n\tJSR waitVBlank\n\tJSR waitVBlank\n\tJSR waitVBlank\n\tJSR waitVBlank\n\tJSR waitVBlank\n\tJSR waitVBlank\n\tJSR waitVBlank\n\n        ;find where the blank space is among GameRAM\n\tLEA GameRAM,a0\n\tMOVE.B #' ',D0\n\tJSR REPNE_SCASB\n\tMOVE.L A0,A1\t\n\t\n;;;;;;;;;;;;;;;;;;; check controller presses\nJOYPAD_BITFLAG_M equ 2048\nJOYPAD_BITFLAG_Z equ 1024\nJOYPAD_BITFLAG_Y equ 512\nJOYPAD_BITFLAG_X equ 256\nJOYPAD_BITFLAG_S equ 128\nJOYPAD_BITFLAG_C equ 64\nJOYPAD_BITFLAG_B equ 32\nJOYPAD_BITFLAG_A equ 16\nJOYPAD_BITFLAG_R equ 8\nJOYPAD_BITFLAG_L equ 4\nJOYPAD_BITFLAG_D equ 2\nJOYPAD_BITFLAG_U equ 1\n\nJOYPAD_BITNUM_M equ 11\nJOYPAD_BITNUM_Z equ 10\nJOYPAD_BITNUM_Y equ 9\nJOYPAD_BITNUM_X equ 8\nJOYPAD_BITNUM_S equ 7\nJOYPAD_BITNUM_C equ 6\nJOYPAD_BITNUM_B equ 5\nJOYPAD_BITNUM_A equ 4\nJOYPAD_BITNUM_R equ 3\nJOYPAD_BITNUM_L equ 2\nJOYPAD_BITNUM_D equ 1\nJOYPAD_BITNUM_U equ 0\n\n\n\n\n\tmove.w (joypad1),D0\n\n\tBTST #JOYPAD_BITNUM_U,D0\n\tBNE JoyNotUp\n\t\tMOVEM.L D0/A1,-(SP)\n\t\t\tADDA.L #4,A1\n\t\t\tCMPA.L #GameRam_End,A1\n\t\t\tBHI .doNothing\n\t\t\t;OTHERWISE SWAP THE EMPTY SPACE WITH THE BYTE BELOW IT.\n\t\t\t\tMOVE.B (A1),D7\n\t\t\t\tMOVE.B (A0),(A1)\n\t\t\t\tMOVE.B D7,(A0)\t\n.doNothing\n\t\tMOVEM.L (SP)+,D0/A1\n\t\tbra vdraw\t\nJoyNotUp:\n\tBTST #JOYPAD_BITNUM_D,D0\n\tBNE JoyNotDown\n\t\tMOVEM.L D0/A1,-(SP)\n\n\t\t\tSUBA.L #4,A1\t\t;CHECK ONE ROW ABOVE WHERE WE ARE\n\t\t\tCMPA.L #GameRam,A1\n\t\t\tBCS .doNothing\t\t;if A1-4 IS BELOW THE START OF GAME RAM, DON'T MOVE\n\t\t\t;OTHERWISE SWAP THE EMPTY SPACE WITH THE BYTE ABOVE IT.\n\t\t\t\tMOVE.B (A1),D7\n\t\t\t\tMOVE.B (A0),(A1)\n\t\t\t\tMOVE.B D7,(A0)\t\t\t\t\n.doNothing:\n\t\tMOVEM.L (SP)+,D0/A1\n\t\tbra vdraw\nJoyNotDown:\n\tBTST #JOYPAD_BITNUM_L,D0\n\tBNE JoyNotLeft\n\t\tMOVEM.L D0/A1,-(SP)\n\t\t\tADDA.L #1,A1\n\t\t\tMOVE.L A1,D4\n\t\t\tMOVE.L A0,D3\n\t\t\tAND.L #3,D4\n\t\t\tAND.L #3,D3\n\t\t\tCMP.L D3,D4\t\n\t\t\tBCS .doNothing\n\t\t\t;OTHERWISE SWAP THE EMPTY SPACE WITH THE BYTE TO THE LEFT\n\t\t\t\tMOVE.B (A1),D7\n\t\t\t\tMOVE.B (A0),(A1)\n\t\t\t\tMOVE.B D7,(A0)\t\t\t\t\n.doNothing:\n\t\tMOVEM.L (SP)+,D0/A1\n\t\tbra vdraw\nJoyNotLeft:\n\tBTST #JOYPAD_BITNUM_R,D0\n\tBNE JoyNotRight\n\t\tMOVEM.L D0/A1,-(SP)\n\t\t\tSUBA.L #1,A1\n\t\t\tMOVE.L A1,D4\n\t\t\tMOVE.L A0,D3\n\t\t\tAND.L #3,D4\n\t\t\tAND.L #3,D3\n\t\t\tCMP.L D3,D4\t\n\t\t\tBHI .doNothing\n\t\t\t;OTHERWISE SWAP THE EMPTY SPACE WITH THE BYTE TO THE RIGHT\n\t\t\t\tMOVE.B (A1),D7\n\t\t\t\tMOVE.B (A0),(A1)\n\t\t\t\tMOVE.B D7,(A0)\t\t\t\t\n.doNothing:\n\t\tMOVEM.L (SP)+,D0/A1\n\t\tbra vdraw\nJoyNotRight:\n\nvdraw:\n\t;this actually draws the current state of the puzzle to the screen.\n\tLEA GameRam,A0\n\tCLR.B (Cursor_X)   ;reset text cursors to top left of screen\n\tCLR.B (Cursor_Y)\n\t\n;draw the puzzle\n\n;anything insize a REPT N...ENDR block is in-lined N times, back to back.\n       rept 4\n\n\t      MOVE.B (A0)+,D0      \n\t      JSR PrintChar\n\n\t      MOVE.B (A0)+,D0\n\t      JSR PrintChar\n\n\t      MOVE.B (A0)+,D0\n\t      JSR PrintChar\n\n\t      MOVE.B (A0)+,D0\n\t      JSR PrintChar         ;we just finished drawing one row of the puzzle. Now, begin a new line and continue drawing.\n\n              jsr newline\n       endr\n\t\n\t\ncheckIfWin:\n\t;YES THIS IS MESSY, I TRIED IT WITH A LOOP BUT IT WOULDN'T WORK SO I JUST UNROLLED THE LOOP.\n\tLEA GameRam,a4\n\tMOVE.B (A4)+,D5\n\tCMP.B #'1',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'2',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'3',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'4',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'5',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'6',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'7',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'8',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'9',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'A',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'B',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'C',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'D',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'E',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'F',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #' ',D5\n\tBNE .keepGoing\n\t\n\tclr.b (Cursor_X)\n\tmove.b #7,(Cursor_Y)\n\tLEA victoryMessage,a3\n\tjsr PrintString\n\tjmp *  ;game freezes after you win.\n\n.keepGoing:\n;it's unlikely that the label \"main\" is in range of here so I didn't bother checking and just assumed it was out of range.\n;Otherwise I would have said \"BEQ main\" instead of BNE .keepGoing\n\tjmp main\n\t\t\n\nVictoryMessage:\n\tDC.B \"A WINNER IS YOU\",255\n\tEVEN\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\nREPNE_SCASB:\n\t;INPUT: \n\t;A0 = POINTER TO START OF MEMORY\n\t;D0 = THE BYTE TO SEARCH FOR\n\t;OUTPUT = A0 POINTS TO THE BYTE THAT CONTAINED D0\n\tMOVE.B (A0),D1\n\tCMP.B D0,D1\n\tBEQ .done\n\tADDA.L #1,A0\n\tBRA REPNE_SCASB\n.done:\n\tRTS\n\t\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\n\nPlayer_ReadControlsDual:\n\t\n\tmove.b #%01000000,($A1000B)\t; Set direction IOIIIIII (I=In O=Out)\n\tmove.l #$A10003,a0\t\t;RW port for player 1\n\n\tmove.b  #$40,(a0)\t; TH = 1\n\tnop\t\t;Delay\n\tnop\n\tmove.b  (a0),d2\t\t; d0.b = --CBRLDU\tStore in D2\n\t\n\tmove.b\t#$0,(a0)\t; TH = 0\n\tnop\t\t;Delay\n\tnop\n\tmove.b\t(a0),d1\t\t; d1.b = --SA--DU\tStore in D1\n\t\n\tmove.b  #$40,(a0)\t; TH = 1\n\tnop\t\t;Delay\n\tnop\n\tmove.b\t#$0,(a0)\t; TH = 0\n\tnop\t\t;Delay\n\tnop\n\tmove.b  #$40,(a0)\t; TH = 1\n\tnop\t\t;Delay\n\tnop\n\tmove.b\t(a0),d3\t\t; d1.b = --CBXYZM\tStore in D3\n\tmove.b\t#$0,(a0)\t; TH = 0\n\t\n\tclr.l d0\t\t\t;Clear buildup byte\n\troxr.b d2\n\troxr.b d0\t\t\t;U\n\troxr.b d2\n\troxr.b d0\t\t\t;D\n\troxr.b d2\n\troxr.b d0\t\t\t;L\n\troxr.b d2\n\troxr.b d0\t\t\t;R\n\troxr.b #5,d1\n\troxr.b d0\t\t\t;A\n\troxr.b d2\n\troxr.b d0\t\t\t;B\n\troxr.b d2\n\troxr.b d0\t\t\t;C\n\troxr.b d1\n\troxr.b d0\t\t\t;S\n\t\n\tmove.l d3,d1\n\troxl.l #7,d1\t\t;XYZ\n\tand.l #%0000011100000000,d1\n\tor.l d1,d0\t\t\t\n\t\n\tmove.l d3,d1\n\troxl.l #8,d1\t\t;M\n\troxl.l #3,d1\t\t\n\tand.l #%0000100000000000,d1\n\tor.l d1,d0\n\t\n\tor.l #$FFFFF000,d0\t;Set unused bits to 1\n\n\t\n\t\n\t;this returns player 1's buttons into D0 as the following:\n\t;----MZYXSCBARLDU\n\trts\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\nwaitVBlank:\t\t\t\t\t\t\t;Bit 3 defines if we're in Vblank\n\tMOVE.L d0,-(sp)\n.wait:\n\t\tmove.w VDP_ctrl,d0\n\t\tand.w #%0000000000001000,d0\t\t;See if vblank is running\n\t\tbne .wait\t\t\t\t\t;wait until it is\n\t\t\nwaitVBlank2:\n\t\tmove.w VDP_ctrl,d0\n\t\tand.w #%0000000000001000,d0\t\t;See if vblank is running\n\t\tbeq waitVBlank2\t\t\t\t\t;wait until it isnt\n\tMOVE.L (SP)+,d0\n\trts\t\t\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\t\nPrintChar:\t\t\t\t;Show D0 to screen\n\tmoveM.l d0-d7/a0-a7,-(sp)\n\t\tand.l #$FF,d0\t\t\t;Keep only 1 byte\n\t\tsub #32,d0\t\t\t\t;No Characters in our font below 32\nPrintCharAlt:\t\t\n\t\tMove.L  #$40000003,d5\t;top 4=write, bottom $3=Cxxx range\n\t\tclr.l d4\t\t\t\t\t;Tilemap at $C000+\n\n\t\tMove.B (Cursor_Y),D4\t\n\t\trol.L #8,D4\t\t\t\t;move $-FFF to $-FFF----\n\t\trol.L #8,D4\n\t\trol.L #7,D4\t\t\t\t;2 bytes per tile * 64 tiles per line\n\t\tadd.L D4,D5\t\t\t\t;add $4------3\n\t\t\n\t\tMove.B (Cursor_X),D4\n\t\trol.L #8,D4\t\t\t\t;move $-FFF to $-FFF----\n\t\trol.L #8,D4\n\t\trol.L #1,D4\t\t\t\t;2 bytes per tile\n\t\tadd.L D4,D5\t\t\t\t;add $4------3\n\t\t\n\t\tMOVE.L\tD5,(VDP_ctrl)\t; C00004 write next character to VDP\n\t\tMOVE.W\tD0,(VDP_data)\t; C00000 store next word of name data\n\n\t\taddq.b #1,(Cursor_X)\t;INC Xpos\n\t\tmove.b (Cursor_X),d0\n\t\tcmp.b #39,d0\n\t\tbls nextpixel_Xok\n\t\tjsr NewLine\t\t\t;If we're at end of line, start newline\nnextpixel_Xok:\n\tmoveM.l (sp)+,d0-d7/a0-a7\n\trts\n\t\nPrintString:\n\t\tmove.b (a3)+,d0\t\t\t;Read a character in from A3\n\t\tcmp.b #255,d0\n\t\tbeq PrintString_Done\t;return on 255\n\t\tjsr PrintChar\t\t\t;Print the Character\n\t\tbra PrintString\nPrintString_Done:\t\t\n\trts\n\t\nNewLine:\n\taddq.b #1,(Cursor_Y)\t\t;INC Y\n\tclr.b (Cursor_X)\t\t\t;Zero X\n\trts\t\n\t\nFont:\t\t\t\t\t\t\t\n;1bpp font - 8x8 96 characters\n;looks just like your typical \"8-bit\" font. You'll just have to take my word for it.\n     DC.B $00,$00,$00,$00,$00,$00,$00,$00,$18,$3c,$3c,$18,$18,$00,$18,$18\n     DC.B $36,$36,$12,$24,$00,$00,$00,$00,$00,$12,$7f,$24,$24,$fe,$48,$00\n     DC.B $00,$04,$1e,$28,$1c,$0a,$3c,$10,$00,$62,$64,$08,$10,$26,$46,$00\n     DC.B $00,$18,$24,$20,$12,$2c,$44,$3a,$18,$18,$08,$10,$00,$00,$00,$00\n     DC.B $08,$10,$20,$20,$20,$20,$10,$08,$10,$08,$04,$04,$04,$04,$08,$10\n     DC.B $00,$10,$38,$10,$28,$00,$00,$00,$00,$00,$10,$10,$7c,$10,$10,$00\n     DC.B $00,$00,$00,$00,$0c,$0c,$04,$08,$00,$00,$00,$00,$7e,$00,$00,$00\n     DC.B $00,$00,$00,$00,$00,$18,$18,$00,$01,$02,$04,$08,$10,$20,$40,$00\n     DC.B $1c,$26,$63,$63,$63,$32,$1c,$00,$0c,$1c,$0c,$0c,$0c,$0c,$3f,$00\n     DC.B $3e,$63,$07,$1e,$3c,$70,$7f,$00,$3f,$06,$0c,$1e,$03,$63,$3e,$00\n     DC.B $0e,$1e,$36,$66,$7f,$06,$06,$00,$7e,$60,$7e,$03,$03,$63,$3e,$00\n     DC.B $1e,$30,$60,$7e,$63,$63,$3e,$00,$7f,$63,$06,$0c,$18,$18,$18,$00\n     DC.B $3c,$62,$72,$3c,$4f,$43,$3e,$00,$3e,$63,$63,$3f,$03,$06,$3c,$00\n     DC.B $00,$18,$18,$00,$18,$18,$00,$00,$00,$0c,$0c,$00,$0c,$0c,$04,$08\n     DC.B $00,$00,$06,$18,$60,$18,$06,$00,$00,$00,$00,$7e,$00,$7e,$00,$00\n     DC.B $00,$00,$60,$18,$06,$18,$60,$00,$1c,$36,$36,$06,$0c,$00,$0c,$0c\n     DC.B $3c,$42,$99,$a1,$a1,$99,$42,$3c,$1c,$36,$63,$63,$7f,$63,$63,$00\n     DC.B $7e,$63,$63,$7e,$63,$63,$7e,$00,$1e,$33,$60,$60,$60,$33,$1e,$00\n     DC.B $7c,$66,$63,$63,$63,$66,$7c,$00,$3f,$30,$30,$3e,$30,$30,$3f,$00\n     DC.B $7f,$60,$60,$7e,$60,$60,$60,$00,$1f,$30,$60,$67,$63,$33,$1f,$00\n     DC.B $63,$63,$63,$7f,$63,$63,$63,$00,$3f,$0c,$0c,$0c,$0c,$0c,$3f,$00\n     DC.B $03,$03,$03,$03,$03,$63,$3e,$00,$63,$66,$6c,$78,$7c,$6e,$67,$00\n     DC.B $30,$30,$30,$30,$30,$30,$3f,$00,$63,$77,$7f,$7f,$6b,$63,$63,$00\n     DC.B $63,$73,$7b,$7f,$6f,$67,$63,$00,$3e,$63,$63,$63,$63,$63,$3e,$00\n     DC.B $7e,$63,$63,$63,$7e,$60,$60,$00,$3e,$63,$63,$63,$6f,$66,$3d,$00\n     DC.B $7e,$63,$63,$67,$7c,$6e,$67,$00,$3c,$66,$60,$3e,$03,$63,$3e,$00\n     DC.B $3f,$0c,$0c,$0c,$0c,$0c,$0c,$00,$63,$63,$63,$63,$63,$63,$3e,$00\n     DC.B $63,$63,$63,$77,$3e,$1c,$08,$00,$63,$63,$6b,$7f,$7f,$77,$63,$00\n     DC.B $63,$77,$3e,$1c,$3e,$77,$63,$00,$33,$33,$33,$1e,$0c,$0c,$0c,$00\n     DC.B $7f,$07,$0e,$1c,$38,$70,$7f,$00,$00,$38,$20,$20,$20,$20,$38,$00\n     DC.B $80,$40,$20,$10,$08,$04,$02,$00,$00,$1c,$04,$04,$04,$04,$1c,$00\n     DC.B $10,$28,$44,$00,$00,$00,$00,$00,$00,$00,$00,$00,$00,$00,$7e,$00\n     DC.B $00,$20,$10,$00,$00,$00,$00,$00,$00,$18,$04,$1c,$24,$2c,$1c,$00\n     DC.B $00,$20,$20,$38,$24,$24,$38,$00,$00,$00,$1c,$20,$20,$20,$1c,$00\n     DC.B $00,$04,$04,$1c,$24,$24,$1c,$00,$00,$00,$1c,$24,$3c,$20,$1c,$00\n     DC.B $00,$18,$24,$20,$30,$20,$20,$00,$00,$1c,$24,$24,$1c,$04,$3c,$00\n     DC.B $00,$20,$20,$38,$24,$24,$24,$00,$00,$10,$00,$10,$10,$10,$10,$00\n     DC.B $08,$00,$08,$08,$08,$08,$28,$10,$20,$20,$24,$28,$30,$28,$24,$00\n     DC.B $10,$10,$10,$10,$10,$10,$18,$00,$00,$00,$40,$68,$54,$54,$54,$00\n     DC.B $00,$00,$28,$34,$24,$24,$24,$00,$00,$00,$1c,$22,$22,$22,$1c,$00\n     DC.B $00,$00,$38,$24,$24,$38,$20,$20,$00,$00,$1c,$24,$24,$1c,$04,$04\n     DC.B $00,$00,$2c,$30,$20,$20,$20,$00,$00,$00,$1c,$20,$1c,$02,$3c,$00\n     DC.B $00,$10,$3c,$10,$10,$14,$08,$00,$00,$00,$24,$24,$24,$24,$1a,$00\n     DC.B $00,$00,$24,$24,$24,$14,$18,$00,$00,$00,$92,$92,$92,$5a,$6c,$00\n     DC.B $00,$00,$22,$14,$08,$14,$22,$00,$00,$00,$24,$24,$1c,$04,$18,$00\n     DC.B $00,$00,$3c,$04,$18,$20,$3c,$00,$00,$08,$10,$10,$20,$10,$10,$08\n     DC.B $18,$18,$18,$18,$18,$18,$18,$18,$00,$10,$08,$08,$04,$08,$08,$10\n     DC.B $00,$00,$00,$30,$4a,$04,$00,$00,$1c,$7f,$00,$7f,$55,$55,$55,$00\nFont_End:\n\nVDPSettings:\n\tDC.B $04 ; 0 mode register 1\t\t\t\t\t\t\t\t\t\t\t---H-1M-\n\tDC.B $04 ; 1 mode register 2\t\t\t\t\t\t\t\t\t\t\t-DVdP---\n\tDC.B $30 ; 2 name table base for scroll A (A=top 3 bits)\t\t\t\t--AAA--- = $C000\n\tDC.B $3C ; 3 name table base for window (A=top 4 bits / 5 in H40 Mode)\t--AAAAA- = $F000\n\tDC.B $07 ; 4 name table base for scroll B (A=top 3 bits)\t\t\t\t-----AAA = $E000\n\tDC.B $6C ; 5 sprite attribute table base (A=top 7 bits / 6 in H40)\t\t-AAAAAAA = $D800\n\tDC.B $00 ; 6 unused register\t\t\t\t\t\t\t\t\t\t\t--------\n\tDC.B $00 ; 7 background color (P=Palette C=Color)\t\t\t\t\t\t--PPCCCC\n\tDC.B $00 ; 8 unused register\t\t\t\t\t\t\t\t\t\t\t--------\n\tDC.B $00 ; 9 unused register\t\t\t\t\t\t\t\t\t\t\t--------\n\tDC.B $FF ;10 H interrupt register (L=Number of lines)\t\t\t\t\tLLLLLLLL\n\tDC.B $00 ;11 mode register 3\t\t\t\t\t\t\t\t\t\t\t----IVHL\n\tDC.B $81 ;12 mode register 4 (C bits both1 = H40 Cell)\t\t\t\t\tC---SIIC\n\tDC.B $37 ;13 H scroll table base (A=Top 6 bits)\t\t\t\t\t\t\t--AAAAAA = $FC00\n\tDC.B $00 ;14 unused register\t\t\t\t\t\t\t\t\t\t\t--------\n\tDC.B $02 ;15 auto increment (After each Read/Write)\t\t\t\t\t\tNNNNNNNN\n\tDC.B $01 ;16 scroll size (Horiz & Vert size of ScrollA & B)\t\t\t\t--VV--HH = 64x32 tiles\n\tDC.B $00 ;17 window H position (D=Direction C=Cells)\t\t\t\t\tD--CCCCC\n\tDC.B $00 ;18 window V position (D=Direction C=Cells)\t\t\t\t\tD--CCCCC\n\tDC.B $FF ;19 DMA length count low\t\t\t\t\t\t\t\t\t\tLLLLLLLL\n\tDC.B $FF ;20 DMA length count high\t\t\t\t\t\t\t\t\t\tHHHHHHHH\n\tDC.B $00 ;21 DMA source address low\t\t\t\t\t\t\t\t\t\tLLLLLLLL\n\tDC.B $00 ;22 DMA source address mid\t\t\t\t\t\t\t\t\t\tMMMMMMMM\n\tDC.B $80 ;23 DMA source address high (C=CMD)\t\t\t\t\t\t\tCCHHHHHH\nVDPSettingsEnd:\n\teven\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_20.txt",
        "content": "      IF INKEY(-256)=77 OR (INKEY(-256) AND &F0)=&A0 THEN MODE 1: COLOUR 0: COLOUR 143: *FX4,1\n\n      SIZE=4 : DIFFICULTY=3\n\n      MAX=SIZE * SIZE - 1\n      DIM Board(MAX)\n      FOR I%=1 TO MAX : Board(I% - 1)=I% : NEXT\n      Gap=MAX\n      WHILE N% < DIFFICULTY ^ 2 PROCSlide(RND(4)) : ENDWHILE : REM Shuffle\n      N%=0\n\n      @%=2 + LOG(MAX + 1)\n      PROCShowAndTest\n      WHILE NOT Solved\n        PRINT \"Use arrow keys to move the gap around. Moves taken: \";N%\n        PROCSlide(GET - 135)\n        PROCShowAndTest\n      ENDWHILE\n      PRINT \"Solved after \";N% LEFT$(\" moves\", 6 + (N% = 1)) \".\"\n      END\n\n      DEF PROCSlide(dir%)\n      NewGap=Gap\n      CASE dir% OF\n        WHEN 1: IF Gap MOD SIZE > 0        NewGap=Gap - 1    : N%+=1 : REM Left\n        WHEN 2: IF Gap MOD SIZE < SIZE - 1 NewGap=Gap + 1    : N%+=1 : REM Right\n        WHEN 3: IF Gap < MAX - SIZE + 1    NewGap=Gap + SIZE : N%+=1 : REM Down\n        WHEN 4: IF Gap > SIZE - 1          NewGap=Gap - SIZE : N%+=1 : REM Up\n      ENDCASE\n      SWAP Board(Gap), Board(NewGap)\n      Gap=NewGap\n      ENDPROC\n\n      DEF PROCShowAndTest\n      CLS\n      Solved=TRUE\n      FOR I%=0 TO MAX\n        COLOUR 12 : COLOUR 135\n        IF I% = Gap COLOUR 1 : COLOUR 129\n        IF I% MOD SIZE = SIZE - 1 PRINT Board(I%) ELSE PRINT Board(I%),;\n        IF Solved IF I% < MAX - 1 IF Board(I%) > Board(I% + 1) OR I% = Gap Solved=FALSE\n      NEXT\n      COLOUR 0 : COLOUR 143\n      PRINT\n      ENDPROC\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_21.txt",
        "content": "_while_ \u2190 {\ud835\udd3d\u235f\ud835\udd3e\u2218\ud835\udd3d_\ud835\udd63_\ud835\udd3e\u2218\ud835\udd3d\u235f\ud835\udd3e\ud835\udd69}\nFPG\u2190{\n  \ud835\udd4a\ud835\udd69: 4\u203f4\ud835\udd4a\ud835\udd69;\n  (\u2227\u00b4\ud835\udd68<0)\u22282\u2260\u2260\ud835\udd68 ? \u2022Out \"Invalid shape: \"\u223e\u2022Fmt \ud835\udd68;\n  0\u2260=\ud835\udd69 ? \u2022Out \"Invalid shuffle count: \"\u223e\u2022Fmt \ud835\udd69;\n  s\ud835\udd4a\ud835\udd69:\n  d\u2190\u27e81\u203f0\u22c4\u00af1\u203f0\u22c40\u203f1\u22c40\u203f\u00af1\u27e9 # Directions\n  w\u2190\ud835\udd68\u294a1\u233d\u2195\u00d7\u00b4\ud835\udd68 # Solved grid\n  b\u2190w        # Board\n  z\u2190\u2291{\n    z\u203fp\u2190\ud835\udd69\n    p\u21a9(\u22a2\u2261s\u22b8|)\u00a8\u22b8/(<z)+d(\u00ac\u2218\u220a/\u22a3)p # filter out invalid\n    n\u2190(\u2022rand.Range \u2260p)\u2291p\n    b\u233d\u233e(z\u203fn\u22b8\u2291)\u21a9 # switch places\n    -`n\u203fz\n  }\u235f\ud835\udd69 \u27e8\ud835\udd68-1,\u27e80\u27e9\u27e9\n  {\n    \ud835\udd4a:\n    b\u2261w ? \u2022Show b, \u2022Out \"You win\", 0;\n    \u2022Show b\n    inp\u2190\u2291{\n      Check \ud835\udd69:\n      \u2022Out \"Enter move: \"\n      x\u2190\u2022GetLine@\n      i\u2190\u2291\"\u2191\u2193\u2190\u2192q\"\u2290x\n      {\n        i=4 ? i; # quit\n        i>4 ? \u2022Out \"Invalid direction: \"\u223ex, Check x;\n        (\u22a2\u2262s\u22b8|)z+i\u2291d ? \u2022Out \"Out of bounds: \"\u223ex, Check x;\n        i\n      }\n    } @\n    {\n      \ud835\udd69=4 ? \u2022Out \"Quitting\", 0;\n      mv\u2190z+\ud835\udd69\u2291d\n      b\u233d\u233e(mv\u203fz\u22b8\u2291)\u21a9\n      z\u21a9mv\n      1\n    } inp\n  } _while_ \u22a2 1\n  @\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_22.txt",
        "content": "   )ex 15_puzzle.bqn\n   FPG 10\n\u250c\u2500             \n\u2575  1  2  0  3  \n   5  6  7  4  \n   9 10 11  8  \n  13 14 15 12  \n              \u2518\nEnter move: \na\nInvalid direction: a\nEnter move: \n\u2191\n\u250c\u2500             \n\u2575  1  2  7  3  \n   5  6  0  4  \n   9 10 11  8  \n  13 14 15 12  \n              \u2518\nEnter move: \n\u2193\n\u250c\u2500             \n\u2575  1  2  0  3  \n   5  6  7  4  \n   9 10 11  8  \n  13 14 15 12  \n              \u2518\nEnter move: \n\u2193\nOut of bounds: \u2193\n...\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_23.txt",
        "content": "/* RosettaCode: Fifteen puzle game, C89, plain vanillia TTY, MVC, \u00a7 22 */\n#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n#define N 4\n#define M 4\nenum Move{UP,DOWN,LEFT,RIGHT};int hR;int hC;int cc[N][M];const int nS=100;int\nupdate(enum Move m){const int dx[]={0,0,-1,1};const int dy[]={-1,1,0,0};int i=hR\n+dy[m];int j=hC+dx[m];if(i>= 0&&i<N&&j>=0&&j<M){cc[hR][hC]=cc[i][j];cc[i][j]=0;\nhR=i;hC=j;return 1;}return 0;}void setup(void){int i,j,k;for(i=0;i<N;i++)for(j=0\n;j<M;j++)cc[i][j]=i*M+j+1;cc[N-1][M-1]=0;hR=N-1;hC=M-1;k=0;while(k<nS)k+=update(\n(enum Move)(rand()%4));}int isEnd(void){int i,j; int k=1;for(i=0;i<N;i++)for(j=0\n;j<M;j++)if((k<N*M)&&(cc[i][j]!=k++))return 0;return 1;}void show(){int i,j;\nputchar('\\n');for(i=0;i<N;i++)for(j=0;j<M;j++){if(cc[i][j])printf(j!=M-1?\" %2d \"\n:\" %2d \\n\",cc[i][j]);else printf(j!=M-1?\" %2s \":\" %2s \\n\", \"\");}putchar('\\n');}\nvoid disp(char* s){printf(\"\\n%s\\n\", s);}enum Move get(void){int c;for(;;){printf\n(\"%s\",\"enter u/d/l/r\u00a0: \");c=getchar();while(getchar()!='\\n');switch(c){case 27:\nexit(0);case'd':return UP;case'u':return DOWN;case'r':return LEFT;case'l':return\nRIGHT;}}}void pause(void){getchar();}int main(void){srand((unsigned)time(NULL));\ndo setup();while(isEnd());show();while(!isEnd()){update(get());show();}disp(\n\"You win\"); pause();return 0;}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_24.txt",
        "content": "/*\n * RosettaCode: Fifteen puzle game, C89, plain vanillia TTY, MVC\n */\n\n#define _CRT_SECURE_NO_WARNINGS /* unlocks printf etc. in MSVC */\n#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n\nenum Move { MOVE_UP = 0, MOVE_DOWN = 1, MOVE_LEFT = 2, MOVE_RIGHT = 3 };\n\n/* *****************************************************************************\n * Model\n */\n\n#define NROWS     4\n#define NCOLLUMNS 4\nint holeRow;       \nint holeCollumn;   \nint cells[NROWS][NCOLLUMNS];\nconst int nShuffles = 100;\n\nint Game_update(enum Move move){\n    const int dx[] = {  0,  0, -1, +1 };\n    const int dy[] = { -1, +1,  0,  0 };\n    int i = holeRow     + dy[move];\n    int j = holeCollumn + dx[move];    \n    if ( i >= 0 && i < NROWS && j >= 0 && j < NCOLLUMNS ){\n        cells[holeRow][holeCollumn] = cells[i][j];\n        cells[i][j] = 0; holeRow = i; holeCollumn = j;\n        return 1;\n    }\n    return 0;\n}\n\nvoid Game_setup(void){\n    int i,j,k;\n    for ( i = 0; i < NROWS; i++ )\n        for ( j = 0; j < NCOLLUMNS; j++ )\n            cells[i][j] = i * NCOLLUMNS + j + 1;\n    cells[NROWS-1][NCOLLUMNS-1] = 0;\n    holeRow = NROWS - 1;\n    holeCollumn = NCOLLUMNS - 1;\n    k = 0;\n    while ( k < nShuffles )\n        k += Game_update((enum Move)(rand() % 4));\n}\n\nint Game_isFinished(void){\n    int i,j; int k = 1;\n    for ( i = 0; i < NROWS; i++ )\n        for ( j = 0; j < NCOLLUMNS; j++ ) \n            if ( (k < NROWS*NCOLLUMNS) && (cells[i][j] != k++ ) )\n                return 0;\n    return 1;        \n}\n\n\n/* *****************************************************************************\n * View \n */\n\nvoid View_showBoard(){\n    int i,j;\n    putchar('\\n');\n    for ( i = 0; i < NROWS; i++ )\n        for ( j = 0; j < NCOLLUMNS; j++ ){\n            if ( cells[i][j] )\n                printf(j != NCOLLUMNS-1 ? \" %2d \" : \" %2d \\n\", cells[i][j]);\n            else\n                printf(j != NCOLLUMNS-1 ? \" %2s \" : \" %2s \\n\", \"\");\n        }\n    putchar('\\n');\n}\n\nvoid View_displayMessage(char* text){\n    printf(\"\\n%s\\n\", text);\n}\n\n\n/* *****************************************************************************\n * Controller\n */\n\nenum Move Controller_getMove(void){\n    int c;\n    for(;;){\n        printf(\"%s\", \"enter u/d/l/r\u00a0: \");\n        c = getchar();\n        while( getchar() != '\\n' )\n            ;\n        switch ( c ){\n            case 27: exit(EXIT_SUCCESS);\n            case 'd' : return MOVE_UP;   \n            case 'u' : return MOVE_DOWN;\n            case 'r' : return MOVE_LEFT;\n            case 'l' : return MOVE_RIGHT;\n        }\n    }\n}\n\nvoid Controller_pause(void){\n    getchar();\n}\n\nint main(void){\n\n    srand((unsigned)time(NULL));\n\n    do Game_setup(); while ( Game_isFinished() );\n\n    View_showBoard();\n    while( !Game_isFinished() ){ \n        Game_update( Controller_getMove() ); \n        View_showBoard(); \n    }\n\n    View_displayMessage(\"You win\");\n    Controller_pause();\n\n    return EXIT_SUCCESS;\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_25.txt",
        "content": "  9   1   4   7\n  6   5   3   2\n 13  10       8\n 14  15  11  12\n\nenter u/d/l/r\u00a0: u\n\n  9   1   4   7\n  6   5   3   2\n 13  10  11   8\n 14  15      12\n\nenter u/d/l/r\u00a0: l\n\n  9   1   4   7\n  6   5   3   2\n 13  10  11   8\n 14  15  12\n\nenter u/d/l/r\u00a0: d\n\n  9   1   4   7\n  6   5   3   2\n 13  10  11\n 14  15  12   8\n\nenter u/d/l/r\u00a0:",
        "safe": true
    },
    {
        "filename": "15 puzzle game_26.txt",
        "content": "/**\n * RosettaCode: Fifteen puzle game, C89, MS Windows Console API, MVC\n *\n * @version 0.2 (added TTY and ncurses modes)\n */\n\n#define UNDEFINED_WIN32API_CONSOLE\n#define UNDEFINED_NCURSES_CONSOLE\n#if !defined (TTY_CONSOLE) && !defined(WIN32API_CONSOLE) && !defined(NCURSES_CONSOLE)\n#define TTY_CONSOLE\n#endif\n\n#define _CRT_SECURE_NO_WARNINGS    /* enable printf etc. */\n#define _CRT_NONSTDC_NO_DEPRECATE  /* POSIX functions enabled */\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <time.h>\n#if defined(NCURSES_CONSOLE)\n#include \"curses.h\"  /* see http://pdcurses.sourceforge.net/ */\n#elif defined(WIN32API_CONSOLE)\n#define NOGDI                   /* we don't need GDI */\n#define WIN32_LEAN_AND_MEAN     /* we don't need OLE etc. */\n#include <windows.h>            /* MS Windows stuff */\n#include <conio.h>              /* kbhit() and getch() */\n#endif\n\nenum Move { MOVE_UP = 0, MOVE_DOWN = 1, MOVE_LEFT = 2, MOVE_RIGHT = 3 };\n\n/* *****************************************************************************\n * Model\n */\n\n#define NROWS     4\n#define NCOLLUMNS 4\nint holeRow;       \nint holeCollumn;   \nint cells[NROWS][NCOLLUMNS];\nconst int nShuffles = 100;\n\nint Game_update(enum Move move){\n    const int dx[] = {  0,  0, -1, +1 };\n    const int dy[] = { -1, +1,  0,  0 };\n    int i = holeRow     + dy[move];\n    int j = holeCollumn + dx[move];    \n    if ( i >= 0 && i < NROWS && j >= 0 && j < NCOLLUMNS ){\n        cells[holeRow][holeCollumn] = cells[i][j];\n        cells[i][j] = 0; holeRow = i; holeCollumn = j;\n        return 1;\n    }\n    return 0;\n}\n\nvoid Game_setup(void){\n    int i,j,k;\n    for ( i = 0; i < NROWS; i++ )\n        for ( j = 0; j < NCOLLUMNS; j++ )\n            cells[i][j] = i * NCOLLUMNS + j + 1;\n    cells[NROWS-1][NCOLLUMNS-1] = 0;\n    holeRow = NROWS - 1;\n    holeCollumn = NCOLLUMNS - 1;\n    k = 0;\n    while ( k < nShuffles )\n        k += Game_update((enum Move)(rand() % 4));\n}\n\nint Game_isFinished(void){\n    int i,j; int k = 1;\n    for ( i = 0; i < NROWS; i++ )\n        for ( j = 0; j < NCOLLUMNS; j++ ) \n            if ( (k < NROWS*NCOLLUMNS) && (cells[i][j] != k++ ) )\n                return 0;\n    return 1;        \n}\n\n\n/* *****************************************************************************\n * View \n */\n\nint fieldWidth;\n#ifdef WIN32API_CONSOLE\nHANDLE hConsole;\nCONSOLE_SCREEN_BUFFER_INFO csbi; \n#endif\n\nvoid View_setup_base(void)\n{\n    int i;\n    fieldWidth = 0;\n    for ( i = NROWS * NCOLLUMNS - 1; i > 0; i /= 10 )\n        fieldWidth++;\n}\n\n#if defined(TTY_CONSOLE)\n\nvoid View_setup(void) {\n    View_setup_base();\n}\n\nvoid View_showBoard()\n{\n    int i,j;\n    putchar('\\n');\n    for ( i = 0; i < NROWS; i++ )\n        for ( j = 0; j < NCOLLUMNS; j++ ){\n            if ( cells[i][j] )\n                printf(j != NCOLLUMNS-1 ? \"\u00a0%*d \" : \"\u00a0%*d \\n\", fieldWidth, cells[i][j]);\n            else\n                printf(j != NCOLLUMNS-1 ? \"\u00a0%*s \" : \"\u00a0%*s \\n\", fieldWidth, \"\");\n        }\n    putchar('\\n');\n}\n\nvoid View_displayMessage(char* text)\n{\n    printf(\"\\n%s\\n\", text);\n}\n\n#elif defined(NCURSES_CONSOLE)\n\nvoid View_setup(void) {\n    View_setup_base();\n    initscr();        \n    clear();\n}\n\nvoid View_showBoard()\n{\n    int i,j;\n    for ( i = 0; i < NROWS; i++ )\n        for ( j = 0; j < NCOLLUMNS; j++ ){\n            int x = (fieldWidth+1)*j;\n            int y = 2*i;\n            if ( cells[i][j] ){\n                attron(A_REVERSE);\n                mvprintw(y,x,\"%*d\", fieldWidth, cells[i][j]);\n            }else{\n                attroff(A_REVERSE);\n                mvprintw(y,x,\"%*s\", fieldWidth, \" \");\n            }\n        }\n    attrset(A_NORMAL);\n}\n\nvoid View_displayMessage(char* text)\n{\n    mvprintw(2*NROWS,0, \"%s\", text);\n}\n\n#elif defined(WIN32API_CONSOLE)\n\nvoid View_setup(void) {\n    const COORD coordHome = { 0, 0 }; \n    CONSOLE_CURSOR_INFO cci;\n    DWORD size, nWritten;\n    View_setup_base();\n    hConsole = GetStdHandle(STD_OUTPUT_HANDLE);\n    cci.bVisible = FALSE; \n    cci.dwSize = 1;\n    SetConsoleCursorInfo(hConsole,&cci);    \n    GetConsoleScreenBufferInfo(hConsole,&(csbi));\n    size = csbi.dwSize.X*csbi.dwSize.Y;\n    FillConsoleOutputCharacter(hConsole,' ',size,coordHome,&nWritten);\n    FillConsoleOutputAttribute(hConsole,csbi.wAttributes,size,coordHome,&nWritten);\n\n}\n\nvoid View_showBoard()\n{\n    int i,j;\n    char labelString[32];\n    WORD attributes;\n    DWORD nWritten;\n    for ( i = 0; i < NROWS; i++ )\n        for ( j = 0; j < NCOLLUMNS; j++ ){\n            COORD coord = { ((SHORT)fieldWidth+1)*j, coord.Y = 2*i };\n            if ( cells[i][j] ){\n                sprintf(labelString,\"%*d\", fieldWidth, cells[i][j]);                \n                attributes = BACKGROUND_BLUE | BACKGROUND_GREEN | BACKGROUND_RED;\n            }else{\n                sprintf(labelString,\"%*s\", fieldWidth, \" \");\n                attributes = csbi.wAttributes;\n            }\n            WriteConsoleOutputCharacter(hConsole,labelString,fieldWidth,coord,&nWritten);\n            FillConsoleOutputAttribute (hConsole,attributes,fieldWidth,coord,&nWritten);\n        }\n}\n\nvoid View_displayMessage(char* text)\n{\n    DWORD nWritten;\n    COORD coord = { 0, 2 * NROWS };\n    WriteConsoleOutputCharacter(hConsole,text,strlen(text),coord,&nWritten);\n}\n\n#endif\n\n\n/* *****************************************************************************\n * Controller\n */\n\n#if defined(TTY_CONSOLE)\n\nvoid Controller_setup(void){\n}\n\nenum Move Controller_getMove(void){\n    int c;\n    for(;;){\n        printf(\"%s\", \"enter u/d/l/r\u00a0: \");\n        c = getchar();\n        while( getchar() != '\\n' )\n            ;\n        switch ( c ){\n            case 27: exit(EXIT_SUCCESS);\n            case 'd' : return MOVE_UP;   \n            case 'u' : return MOVE_DOWN;\n            case 'r' : return MOVE_LEFT;\n            case 'l' : return MOVE_RIGHT;\n        }\n    }\n}\n\nvoid Controller_pause(void)\n{\n    getchar();\n}\n\n#elif defined(NCURSES_CONSOLE)\n\nvoid Controller_setup(void){\n    noecho();\n    cbreak();\n    curs_set(0);\n    keypad(stdscr,TRUE);\n}\n\nenum Move Controller_getMove(void){\n    for(;;){\n        switch ( wgetch(stdscr) ){\n            case  27: exit(EXIT_SUCCESS);\n            case KEY_DOWN  : return MOVE_UP;   \n            case KEY_UP    : return MOVE_DOWN;\n            case KEY_RIGHT : return MOVE_LEFT;\n            case KEY_LEFT  : return MOVE_RIGHT;\n            case ERR: /* NOP */;\n        }\n    }\n}\n\nvoid Controller_pause(void){\n    while ( wgetch(stdscr) == ERR )\n        ;\n}\n\n\n#elif defined(WIN32API_CONSOLE)\n\nvoid Controller_setup(void){\n}\n\nenum Move Controller_getMove(void){\n    for(;;){\n        switch ( getch() ){\n            case  27: exit(EXIT_SUCCESS);\n            case   0:\n            case 224: switch ( getch() ){\n                case 80 : return MOVE_UP;   \n                case 72 : return MOVE_DOWN;\n                case 77 : return MOVE_LEFT;\n                case 75 : return MOVE_RIGHT;\n            }\n        }\n    }\n}\n\nvoid Controller_pause(void){\n    while(  kbhit() ) getch();\n    while( !kbhit() )   ;\n    while(  kbhit() ) getch();\n}\n\n#endif\n\n\n/* *****************************************************************************\n * Main function: create model, view and controller. Run main loop.\n */\nint main(void) {\n\n    srand((unsigned)time(NULL));\n\n    do Game_setup(); while ( Game_isFinished() );\n    View_setup(); \n    Controller_setup();\n\n    View_showBoard();\n    while( !Game_isFinished() ){ \n        Game_update( Controller_getMove() ); \n        View_showBoard(); \n    }\n\n    View_displayMessage(\"You win\");\n    Controller_pause();\n\n    return EXIT_SUCCESS;\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_27.txt",
        "content": "using System;\nusing System.Collections.Generic;\nusing System.Drawing;\nusing System.Windows.Forms;\n\npublic class FifteenPuzzle\n{\n    const int GridSize = 4; //Standard 15 puzzle is 4x4\n    const int BlockCount = 16;\n\n    static readonly Random R = new Random();\n\n    private List<Button> Puzzles = new List<Button>();\n    private int Moves = 0;\n    private DateTime Start;\n\n    public class Puzzle\n    {\n        private int mOrderedNumer;\n\n        public int CurrentNumber;\n\n        public int X;\n        public int Y;\n\n        public int InvX\n        {\n            get { return (GridSize - 1) - X; }\n        }\n        public int InvY\n        {\n            get { return (GridSize - 1) - Y; }\n        }\n\n        public Puzzle(int OrderedNumer)\n        {\n            mOrderedNumer = OrderedNumer;\n\n            CurrentNumber = OrderedNumer;\n\n            X = OrderedNumer % GridSize;\n            Y = OrderedNumer / GridSize;\n        }\n        public Puzzle(int OrderedNumer, int CurrentNumber)\n            : this(OrderedNumer)\n        {\n            this.CurrentNumber = CurrentNumber;\n        }\n\n        public bool IsEmptyPuzzle\n        {\n            get { return CurrentNumber >= (BlockCount - 1); }\n        }\n        public bool IsTruePlace\n        {\n            get { return (CurrentNumber == mOrderedNumer); }\n        }\n        public bool NearestWith(Puzzle OtherPz)\n        {\n            int dx = (X - OtherPz.X);\n            int dy = (Y - OtherPz.Y);\n\n            if ((dx == 0) && (dy <= 1) && (dy >= -1)) return true;\n            if ((dy == 0) && (dx <= 1) && (dx >= -1)) return true;\n\n            return false;\n        }\n\n        public override string ToString()\n        {\n            return (CurrentNumber + 1).ToString();\n        }\n    }\n\n    public static void Main(string[] args)\n    {\n        FifteenPuzzle Game = new FifteenPuzzle();\n        Application.Run(Game.CreateForm());\n    }\n\n    private Form CreateForm()\n    {\n        int ButtonSize = 50;\n        int ButtonMargin = 3;\n        int FormEdge = 9;\n\n        Font ButtonFont = new Font(\"Arial\", 15.75F, FontStyle.Regular);\n\n        Button StartButton = new Button();\n        StartButton.Location = new Point(FormEdge, (GridSize * (ButtonMargin + ButtonSize)) + FormEdge);\n        StartButton.Size = new Size(86, 23);\n        StartButton.Font = new Font(\"Arial\", 9.75F, FontStyle.Regular);\n        StartButton.Text = \"New Game\";\n        StartButton.UseVisualStyleBackColor = true;\n        StartButton.TabStop = false;\n\n        StartButton.Click += new EventHandler(NewGame);\n\n        int FormWidth = (GridSize * ButtonSize) + ((GridSize - 1) * ButtonMargin) + (FormEdge * 2);\n        int FormHeigth = FormWidth + StartButton.Height;\n\n        Form Form = new Form();\n        Form.Text = \"Fifteen\";\n        Form.ClientSize = new Size(FormWidth, FormHeigth);\n        Form.FormBorderStyle = FormBorderStyle.FixedSingle;\n        Form.MaximizeBox = false;\n        Form.SuspendLayout();\n\n        for (int i = 0; i < BlockCount; i++)\n        {\n            Button Bt = new Button();\n            Puzzle Pz = new Puzzle(i);\n\n            int PosX = FormEdge + (Pz.X) * (ButtonSize + ButtonMargin);\n            int PosY = FormEdge + (Pz.Y) * (ButtonSize + ButtonMargin);\n            Bt.Location = new Point(PosX, PosY);\n\n            Bt.Size = new Size(ButtonSize, ButtonSize);\n            Bt.Font = ButtonFont;\n\n            Bt.Text = Pz.ToString();\n            Bt.Tag = Pz;\n            Bt.UseVisualStyleBackColor = true;\n            Bt.TabStop = false;\n\n            Bt.Enabled = false;\n            if (Pz.IsEmptyPuzzle) Bt.Visible = false;\n\n            Bt.Click += new EventHandler(MovePuzzle);\n\n            Puzzles.Add(Bt);\n            Form.Controls.Add(Bt);\n        }\n\n        Form.Controls.Add(StartButton);\n        Form.ResumeLayout();\n\n        return Form;\n    }\n\n    private void NewGame(object Sender, EventArgs E)\n    {\n        do\n        {\n            for (int i = 0; i < Puzzles.Count; i++)\n            {\n                Button Bt1 = Puzzles[R.Next(i, Puzzles.Count)];\n                Button Bt2 = Puzzles[i];\n                Swap(Bt1, Bt2);\n            }\n        }\n        while (!IsSolvable());\n\n        for (int i = 0; i < Puzzles.Count; i++)\n        {\n            Puzzles[i].Enabled = true;\n        }\n\n        Moves = 0;\n        Start = DateTime.Now;\n    }\n\n    private void MovePuzzle(object Sender, EventArgs E)\n    {\n        Button Bt1 = (Button)Sender;\n        Puzzle Pz1 = (Puzzle)Bt1.Tag;\n\n        Button Bt2 = Puzzles.Find(Bt => ((Puzzle)Bt.Tag).IsEmptyPuzzle);\n        Puzzle Pz2 = (Puzzle)Bt2.Tag;\n\n        if (Pz1.NearestWith(Pz2))\n        {\n            Swap(Bt1, Bt2);\n            Moves++;\n        }\n\n        CheckWin();\n    }\n\n    private void CheckWin()\n    {\n        Button WrongPuzzle = Puzzles.Find(Bt => !((Puzzle)Bt.Tag).IsTruePlace);\n        bool UWin = (WrongPuzzle == null);\n\n        if (UWin)\n        {\n            for (int i = 0; i < Puzzles.Count; i++)\n            {\n                Puzzles[i].Enabled = false;\n            }\n\n            TimeSpan Elapsed = DateTime.Now - Start;\n            Elapsed = TimeSpan.FromSeconds(Math.Round(Elapsed.TotalSeconds, 0));\n            MessageBox.Show(String.Format(\"Solved in {0} moves. Time: {1}\", Moves, Elapsed));\n        }\n    }\n\n    private void Swap(Button Bt1, Button Bt2)\n    {\n        if (Bt1 == Bt2) return;\n\n        Puzzle Pz1 = (Puzzle)Bt1.Tag;\n        Puzzle Pz2 = (Puzzle)Bt2.Tag;\n\n        int g = Pz1.CurrentNumber;\n        Pz1.CurrentNumber = Pz2.CurrentNumber;\n        Pz2.CurrentNumber = g;\n\n        Bt1.Visible = true;\n        Bt1.Text = Pz1.ToString();\n        if (Pz1.IsEmptyPuzzle) Bt1.Visible = false;\n\n        Bt2.Visible = true;\n        Bt2.Text = Pz2.ToString();\n        if (Pz2.IsEmptyPuzzle) Bt2.Visible = false;\n    }\n\n    private bool IsSolvable()\n    {\n        // WARNING: size of puzzle board MUST be even(like 4)!\n        // For explain see: https://www.geeksforgeeks.org/check-instance-15-puzzle-solvable/\n\n        int InvCount = 0;\n        for (int i = 0; i < Puzzles.Count - 1; i++)\n        {\n            for (int j = i + 1; j < Puzzles.Count; j++)\n            {\n                Puzzle Pz1 = (Puzzle)Puzzles[i].Tag;\n                if (Pz1.IsEmptyPuzzle) continue;\n\n                Puzzle Pz2 = (Puzzle)Puzzles[j].Tag;\n                if (Pz2.IsEmptyPuzzle) continue;\n\n                if (Pz1.CurrentNumber > Pz2.CurrentNumber) InvCount++;\n            }\n        }\n\n        Button EmptyBt = Puzzles.Find(Bt => ((Puzzle)Bt.Tag).IsEmptyPuzzle);\n        Puzzle EmptyPz = (Puzzle)EmptyBt.Tag;\n\n        bool Result = false;\n        if ((EmptyPz.InvY + 1) % 2 == 0) // is even\n        {\n            // is odd\n            if (InvCount % 2 != 0) Result = true;\n        }\n        else // is odd\n        {\n            // is even\n            if (InvCount % 2 == 0) Result = true;\n        }\n        return Result;\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_28.txt",
        "content": "#include <time.h>\n#include <stdlib.h>\n#include <vector>\n#include <string>\n#include <iostream>\nclass p15 {\npublic :\n    void play() {\n        bool p = true;\n        std::string a;\n        while( p ) {\n            createBrd();\n            while( !isDone() ) { drawBrd();getMove(); }\n            drawBrd();\n            std::cout << \"\\n\\nCongratulations!\\nPlay again (Y/N)?\";\n            std::cin >> a; if( a != \"Y\" && a != \"y\" ) break;\n        }\n    }\nprivate:\n    void createBrd() {\n        int i = 1; std::vector<int> v;\n        for( ; i < 16; i++ ) { brd[i - 1] = i; }\n        brd[15] = 0; x = y = 3;\n        for( i = 0; i < 1000; i++ ) {\n            getCandidates( v );\n            move( v[rand() % v.size()] );\n            v.clear();\n        }\n    }\n    void move( int d ) {\n        int t = x + y * 4;\n        switch( d ) {\n            case 1: y--; break;\n            case 2: x++; break;\n            case 4: y++; break;\n            case 8: x--;\n        }\n        brd[t] = brd[x + y * 4];\n        brd[x + y * 4] = 0;\n    }\n    void getCandidates( std::vector<int>& v ) {\n        if( x < 3 ) v.push_back( 2 ); if( x > 0 ) v.push_back( 8 );\n        if( y < 3 ) v.push_back( 4 ); if( y > 0 ) v.push_back( 1 );\n    }\n    void drawBrd() {\n        int r; std::cout << \"\\n\\n\";\n        for( int y = 0; y < 4; y++ ) {\n            std::cout << \"+----+----+----+----+\\n\";\n            for( int x = 0; x < 4; x++ ) {\n                r = brd[x + y * 4];\n                std::cout << \"| \";\n                if( r < 10 ) std::cout << \" \";\n                if( !r ) std::cout << \"  \";\n                else std::cout << r << \" \";\n            }\n            std::cout << \"|\\n\";\n        }\n        std::cout << \"+----+----+----+----+\\n\";\n    }\n    void getMove() {\n        std::vector<int> v; getCandidates( v );\n        std::vector<int> p; getTiles( p, v ); unsigned int i;\n        while( true ) {\n            std::cout << \"\\nPossible moves: \";\n            for( i = 0; i < p.size(); i++ ) std::cout << p[i] << \" \";\n            int z; std::cin >> z;\n            for( i = 0; i < p.size(); i++ )\n                if( z == p[i] ) { move( v[i] ); return; }\n        }\n    }\n    void getTiles( std::vector<int>& p, std::vector<int>& v ) {\n        for( unsigned int t = 0; t < v.size(); t++ ) {\n            int xx = x, yy = y;\n            switch( v[t] ) {\n                case 1: yy--; break;\n                case 2: xx++; break;\n                case 4: yy++; break;\n                case 8: xx--;\n            }\n            p.push_back( brd[xx + yy * 4] );\n        }\n    }\n    bool isDone() {\n        for( int i = 0; i < 15; i++ ) {\n            if( brd[i] != i + 1 ) return false;\n        }\n        return true;\n    }\n    int brd[16], x, y;\n};\nint main( int argc, char* argv[] ) {\n    srand( ( unsigned )time( 0 ) );\n    p15 p; p.play(); return 0;\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_29.txt",
        "content": "+----+----+----+----+\n| 11 |  5 | 12 |  3 |\n+----+----+----+----+\n| 10 |  7 |  6 |  4 |\n+----+----+----+----+\n| 13 |    |  2 |  1 |\n+----+----+----+----+\n| 15 | 14 |  8 |  9 |\n+----+----+----+----+\n\nPossible moves: 2 13 14 7\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_3.txt",
        "content": "/* ARM assembly AARCH64 Raspberry PI 3B */\n/*  program puzzle15_64.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 NBBOX,  16\n.equ GRAINE,  123456      // change for other game\n.equ NBSHUFFLE, 4         \n.equ KEYSIZE,  8\n \n.equ IOCTL,     0x1D  // Linux syscall\n.equ SIGACTION, 0x86   // Linux syscall\n.equ SYSPOLL,   0x16  // Linux syscall\n.equ CREATPOLL, 0x14  // Linux syscall\n.equ CTLPOLL,   0x15  // Linux syscall\n \n.equ TCGETS,    0x5401\n.equ TCSETS,    0x5402\n.equ ICANON,    2\n.equ ECHO,     10\n.equ POLLIN,    1\n.equ EPOLL_CTL_ADD,    1\n\n.equ SIGINT,   2    // Issued if the user sends an interrupt signal (Ctrl + C)\n.equ SIGQUIT,  3    // Issued if the user sends a quit signal (Ctrl + D)\n.equ SIGTERM, 15    // Software termination signal (sent by kill by default)\n.equ SIGTTOU, 22    // \n\n/*******************************************/\n/* Structures                               */\n/********************************************/\n/* structure termios see doc linux*/\n    .struct  0\nterm_c_iflag:                    // input modes\n    .struct  term_c_iflag + 4 \nterm_c_oflag:                    // output modes\n    .struct  term_c_oflag + 4 \nterm_c_cflag:                    // control modes\n    .struct  term_c_cflag + 4 \nterm_c_lflag:                    // local modes\n    .struct  term_c_lflag + 4 \nterm_c_cc:                       // special characters\n    .struct  term_c_cc + 20      // see length if necessary \nterm_fin:\n \n/* structure sigaction see doc linux */\n    .struct  0\nsa_handler:\n    .struct  sa_handler + 8\nsa_mask:\n    .struct  sa_mask + 8\nsa_flags:\n    .struct  sa_flags + 8\nsa_sigaction:\n    .struct  sa_sigaction + 8\nsa_fin:\n\n/* structure poll see doc linux */\n    .struct  0\npoll_event:\n    .struct  poll_event + 8\npoll_fd:                            //   File Descriptor\n    .struct  poll_fd + 8 \npoll_fin:\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nsMessResult:           .ascii \" \"\nsMessValeur:           .fill 11, 1, ' '             // size => 11\nszCarriageReturn:      .asciz \"\\n\"\nszMessGameWin:         .asciz \"You win in @ move number\u00a0!!!!\\n\"\nszMessMoveError:       .asciz \"Huh... Impossible move\u00a0!!!!\\n\"\nszMessErreur:          .asciz \"Error detected.\\n\"\nszMessErrInitTerm:     .asciz \"Error terminal init.\\n\"\nszMessErrInitPoll:     .asciz \"Error poll init.\\n\"\nszMessErreurKey:       .asciz \"Error read key.\\n\"\nszMessSpaces:          .asciz \"    \"\nqGraine:               .quad GRAINE\nszMessErr:             .asciz    \"Error code hexa\u00a0: @ d\u00e9cimal\u00a0: @ \\n\"\n\nszClear:     .byte 0x1B \n             .byte 'c'                         // console clear\n             .byte 0\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\n.align 4\nsZoneConv:      .skip 24\nqCodeError:     .skip 8\nibox:           .skip 4 * NBBOX                // game boxes\nqEnd:           .skip 8                        // 0 loop  1 = end loop\nqTouche:        .skip KEYSIZE                  // value key pressed\nstOldtio:       .skip term_fin                 // old terminal state\nstCurtio:       .skip term_fin                 // current terminal state\nstSigAction:    .skip sa_fin                   // area signal structure\nstSigAction1:   .skip sa_fin\nstSigAction2:   .skip sa_fin\nstSigAction3:   .skip sa_fin\nstPoll1:        .skip poll_fin                 // area poll structure\nstPoll2:        .skip poll_fin\nstevents:       .skip 16\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                // entry of program \n    mov x0,#0\n    bl initTerm                      // terminal init\n    cmp x0,0                         // error\u00a0?\n    blt 100f\n    bl initPoll                      // epoll instance init\n    cmp x0,0\n    blt 99f\n    mov x22,x0                       // save epfd\n    ldr x2,qAdribox\n    mov x9,#0                        // init counter \n    mov x0,0\n1:                                   // loop init boxs\n    add x1,x0,#1                     // box value\n    str w1,[x2,x0, lsl #2]           // store value\n    add x0,x0,#1                     // increment counter\n    cmp x0,#NBBOX - 2                // end\u00a0?\n    ble 1b\n    mov x10,#15                      // empty box location \n    ldr x0,qAdribox\n    bl shuffleGame\n2:                                   // loop moves\n    ldr x0,qAdribox\n    bl displayGame\n3:\n    mov x0,x22                       // epfd\n    bl waitKey\n    cmp x0,0\n    beq 3b                           // no ket pressed -> loop\n    blt 99f                          // error\u00a0?\n    bl readKey                       // read key \n    cmp x0,#-1\n    beq 99f                          // error  \n    cmp x0,3                         // <ctrl_C>\n    beq 5f\n    cmp x0,113                       // saisie q (quit)\u00a0?\n    beq 5f\n    cmp x0,81                        // saisie Q  (Quit)?\n    beq 5f\n    mov x1,x0                        // key\n    ldr x0,qAdribox\n    bl keyMove                       // analyze key move \n    ldr x0,qAdribox\n    bl gameOK                        // end game\u00a0?\n    cmp x0,#1\n    bne 2b                           // no -> loop\n                                     // win\n    mov x0,x9                        // move counter\n    ldr x1,qAdrsZoneConv\n    bl conversion10\n    ldr x0,qAdrszMessGameWin\n    ldr x1,qAdrsZoneConv\n    bl strInsertAtCharInc            // insert result at @ character\n    bl affichageMess\n5:\n    bl restauTerm                    // terminal restaur\n    mov x0, #0                       // return code\n    b 100f\n99:\n    bl restauTerm                    // terminal restaur\n    mov x0,1                         // return code error\n    b 100f\n100:                                 // standard end of the program \n    mov x8, #EXIT                    // request to exit program\n    svc #0                           // perform the system call\n \nqAdrsMessValeur:          .quad sMessValeur\nqAdrszCarriageReturn:     .quad szCarriageReturn\nqAdrsMessResult:          .quad sMessResult\nqAdribox:                 .quad ibox\nqAdrszMessGameWin:        .quad szMessGameWin\nqAdrstevents:             .quad stevents\nqAdrszMessErreur:         .quad szMessErreur\nqAdrstOldtio:             .quad stOldtio\nqAdrstCurtio:             .quad stCurtio\nqAdrstSigAction:          .quad stSigAction\nqAdrstSigAction1:         .quad stSigAction1\nqAdrSIG_IGN:              .quad 1\nqAdrqEnd:                 .quad qEnd\nqAdrqTouche:              .quad qTouche\nqAdrszMessErrInitTerm:    .quad szMessErrInitTerm\nqAdrszMessErrInitPoll:    .quad szMessErrInitPoll\nqAdrszMessErreurKey:      .quad szMessErreurKey\n/******************************************************************/\n/*     key move                                                   */ \n/******************************************************************/\n/* x0 contains boxs address           */\n/* x1 contains key value               */\n/* x9 move counter                     */\n/* x10 contains location empty box    */\nkeyMove:\n    stp x1,lr,[sp,-16]!              // save  registers\n    mov x7,x0\n    lsr x1,x1,16           \n    cmp x1,#0x42                     // down arrow \n    bne 1f\n    cmp x10,#4                       // if x10 < 4   error\n    blt 80f\n    sub x2,x10,#4                    // compute location\n    b 90f\n1:\n    cmp x1,#0x41                     // high arrow\n    bne 2f\n    cmp x10,#11                      // if x10 > 11   error\n    bgt 80f\n    add x2,x10,#4                    // compute location\n    b 90f\n2:\n    cmp x1,#0x43                     // right arrow\n    bne 3f\n    tst x10,#0b11                    // if x10 = 0,4,8,12   error\n    beq 80f\n    sub x2,x10,#1                    // compute location\n    b 90f\n3:\n    cmp x1,#0x44                     // left arrow\n    bne 100f\n    and x3,x10,#0b11                 // error if x10 = 3 7 11 and 15\n    cmp x3,#3\n    beq 80f\n    add x2,x10,#1                    // compute location\n    b 90f\n \n80:                                  // move error\n    ldr x0,qAdrqCodeError\n    mov x1,#1\n    str x1,[x0]\n    b 100f\n90:                                  // white box and move box inversion\n    ldr w3,[x7,x2,lsl #2]\n    str w3,[x7,x10,lsl #2]\n    mov x10,x2\n    mov x3,#0\n    str w3,[x7,x10,lsl #2]\n    add x9,x9,#1                        // increment move counter\n100:\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\nqAdrqCodeError:             .quad qCodeError\n/******************************************************************/\n/*     shuffle game                                       */ \n/******************************************************************/\n/* x0 contains boxs address           */\nshuffleGame:\n    stp x1,lr,[sp,-16]!            // save  registers\n    stp x2,x3,[sp,-16]!            // save  registers\n    stp x4,x5,[sp,-16]!            // save  registers\n    mov x1,x0\n    mov x0,NBSHUFFLE\n    bl genereraleas\n    lsl x4,x0,#1\n1:\n    mov x0,#14\n    bl genereraleas\n    add x3,x0,#1\n    mov x0,#14\n    bl genereraleas\n    add x5,x0,#1\n    ldr w2,[x1,x3,lsl #2]\n    ldr w0,[x1,x5,lsl #2]\n    str w2,[x1,x5,lsl #2]\n    str w0,[x1,x3,lsl #2]\n    subs x4,x4,#1\n    bgt 1b\n \n100:\n    ldp x4,x5,[sp],16              // restaur  2 registers\n    ldp x2,x3,[sp],16              // restaur  2 registers\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n/******************************************************************/\n/*     game Ok\u00a0?                                      */ \n/******************************************************************/\n/* x0 contains boxs address           */\ngameOK:\n    stp x1,lr,[sp,-16]!            // save  registers\n    stp x2,x3,[sp,-16]!            // save  registers\n    mov x2,#0\n    ldr w3,[x0,x2,lsl #2]\n    add x2,x2,#1\n1:\n    ldr w1,[x0,x2,lsl #2]\n    cmp w1,w3\n    bge 2f\n    mov x0,#0                      // game not Ok\n    b 100f\n2:\n    mov x3,x1\n    add x2,x2,#1\n    cmp x2,#NBBOX -2\n    ble 1b\n    mov x0,#1                      // game Ok\n \n100:\n    ldp x2,x3,[sp],16              // restaur  2 registers\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n/******************************************************************/\n/*     display game                                       */ \n/******************************************************************/\n/* x0 contains boxs address           */\ndisplayGame:\n    stp x1,lr,[sp,-16]!            // save  registers\n                                   // clear screen\u00a0!\n    mov x4,x0\n    ldr x0,qAdrszClear\n    bl affichageMess \n    mov x2,#0\n    ldr x1,qAdrsMessValeur\n1:\n    ldr w0,[x4,x2,lsl #2]\n    cmp w0,#0\n    bne 2f\n    ldr w0,iSpaces                    // store spaces\n    str w0,[x1]\n    b 3f\n2:\n    bl conversion10                     // call conversion decimal\n    cmp x0,1\n    beq 21f\n    mov x0,0x20\n    strh w0,[x1,#2]\n    b 3f\n21:\n    mov w0,0x2020\n    str w0,[x1,#1]\n3:\n    ldr x0,qAdrsMessResult\n    bl affichageMess                    // display message\n    add x0,x2,#1\n    tst x0,#0b11\n    bne 4f\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess                    // display message\n4:\n    add x2,x2,#1\n    cmp x2,#NBBOX - 1\n    ble 1b\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess                    // display line return\n    ldr x0,qAdrqCodeError               // error detected\u00a0?\n    ldr x1,[x0]\n    cmp x1,#0\n    beq 100f\n    mov x1,#0                           // raz error code\n    str x1,[x0]\n    ldr x0,qAdrszMessMoveError          // display error message\n    bl affichageMess\n100:\n    ldp x1,lr,[sp],16                   // restaur  2 registers\n    ret                                 // return to address lr x30\niSpaces:              .int 0x00202020   // spaces\nqAdrszClear:          .quad szClear          \nqAdrszMessMoveError:  .quad szMessMoveError\n\n/***************************************************/\n/*   Generation random number                  */\n/***************************************************/\n/* x0 contains limit  */\ngenereraleas:\n    stp x1,lr,[sp,-16]!            // save  registers\n    stp x2,x3,[sp,-16]!            // save  registers\n    ldr x1,qAdrqGraine\n    ldr x2,[x1]\n    ldr x3,qNbDep1\n    mul x2,x3,x2\n    ldr x3,qNbDep2\n    add x2,x2,x3\n    str x2,[x1]                    // maj de la graine pour l appel suivant \n    cmp x0,#0\n    beq 100f\n    udiv x3,x2,x0\n    msub x0,x3,x0,x2               // r\u00e9sult = remainder\n \n100:                               // end function\n    ldp x2,x3,[sp],16              // restaur  2 registers\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n/*****************************************************/\nqAdrqGraine: .quad qGraine\nqNbDep1:     .quad 0x0019660d\nqNbDep2:     .quad 0x3c6ef35f\n\n/******************************************************************/\n/*     traitement du signal                                       */ \n/******************************************************************/\nsighandler:\n    stp x0,lr,[sp,-16]!            // save  registers\n    str x1,[sp,-16]! \n    ldr x0,qAdrqEnd\n    mov x1,#1                      // maj zone end\n    str x1,[x0]\n    ldr x1,[sp],16\n    ldp x0,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n/***************************************************/\n/*   display error message                         */\n/***************************************************/\n/* x0 contains error code  x1\u00a0: message address */\ndisplayError:\n    stp x2,lr,[sp,-16]!            // save  registers\n    mov x2,x0                      // save error code\n    mov x0,x1\n    bl affichageMess\n    mov x0,x2                      // error code\n    ldr x1,qAdrsZoneConv\n    bl conversion16                // conversion hexa\n    ldr x0,qAdrszMessErr           // display error message\n    ldr x1,qAdrsZoneConv\n    bl strInsertAtCharInc               // insert result at @ character\n    mov x3,x0\n    mov x0,x2                      // error code\n    ldr x1,qAdrsZoneConv               // result address\n    bl conversion10S                // conversion decimale\n    mov x0,x3\n    ldr x1,qAdrsZoneConv\n    bl strInsertAtCharInc               // insert result at @ character\n    bl affichageMess\n100:\n    ldp x2,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\nqAdrszMessErr:                 .quad szMessErr\nqAdrsZoneConv:                 .quad sZoneConv\n/*********************************/\n/* init terminal state            */\n/*********************************/\ninitTerm:\n    stp x1,lr,[sp,-16]!            // save  registers\n    /* read terminal state */\n    mov x0,STDIN                   // input console\n    mov x1,TCGETS\n    ldr x2,qAdrstOldtio\n    mov x8,IOCTL                   // call system Linux\n    svc 0 \n    cbnz x0,98f                    // error\u00a0?\n\n    adr x0,sighandler              // adresse routine traitement signal\n    ldr x1,qAdrstSigAction         // adresse structure sigaction\n    str x0,[x1,sa_handler]         // maj handler\n    mov x0,SIGINT                  // signal type\n    ldr x1,qAdrstSigAction\n    mov x2,0\n    mov x3,8\n    mov x8,SIGACTION               // call system\n    svc 0 \n\n    cmp x0,0                       // error\u00a0?\n    bne 98f\n    mov x0,SIGQUIT\n    ldr x1,qAdrstSigAction\n    mov x2,0                       // NULL\n    mov x8,SIGACTION               // call system \n    svc 0 \n    cmp x0,0                       // error\u00a0?\n    bne 98f\n    mov x0,SIGTERM\n    ldr x1,qAdrstSigAction\n    mov x2,0                       // NULL\n    mov x8,SIGACTION               // appel systeme \n    svc 0 \n    cmp x0,0\n    bne 98f\n    //\n    adr x0,qAdrSIG_IGN             // address signal igonre function\n    ldr x1,qAdrstSigAction1\n    str x0,[x1,sa_handler]\n    mov x0,SIGTTOU                 //invalidate other process signal\n    ldr x1,qAdrstSigAction1\n    mov x2,0                       // NULL\n    mov x8,SIGACTION               // call system \n    svc 0 \n    cmp x0,0\n    bne 98f\n    //\n    /* read terminal current state  */\n    mov x0,STDIN\n    mov x1,TCGETS\n    ldr x2,qAdrstCurtio            // address current termio\n    mov x8,IOCTL                   // call systeme \n    svc 0 \n    cmp x0,0                       // error\u00a0?\n    bne 98f\n    mov x2,ICANON | ECHO           // no key pressed echo on display\n    mvn x2,x2                      // and one key \n    ldr x1,qAdrstCurtio\n    ldr x3,[x1,#term_c_lflag]\n    and x3,x2,x2                   // add flags \n    str x3,[x1,#term_c_lflag]      // and store\n    mov x0,STDIN                   // maj terminal current state \n    mov x1,TCSETS\n    ldr x2,qAdrstCurtio\n    mov x8,IOCTL                   // call system\n    svc 0 \n    cbz x0,100f\n98:                                // error display\n    ldr x1,qAdrszMessErrInitTerm\n    bl   displayError\n    mov x0,-1\n100:\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\nqAdrstSigAction2:    .quad stSigAction2\nqAdrstSigAction3:    .quad stSigAction3\n/*********************************/\n/* init instance epool            */\n/*********************************/\ninitPoll:\n    stp x1,lr,[sp,-16]!            // save  registers\n    ldr x0,qAdrstevents\n    mov x1,STDIN                   // maj structure events\n    str x1,[x0,#poll_fd]           // maj FD\n    mov x1,POLLIN                  // action code\n    str x1,[x0,#poll_event]\n    mov x0,0\n    mov x8,CREATPOLL               // create epoll instance\n    svc 0\n    cmp x0,0                       // error\u00a0?\n    ble 98f\n    mov x10,x0                     // return FD epoll instance\n    mov x1,EPOLL_CTL_ADD\n    mov x2,STDIN                   // Fd to we want add\n    ldr x3,qAdrstevents            // structure events address\n    mov x8,CTLPOLL                 // call system control epoll\n    svc 0\n    cmp x0,0                       // error\u00a0?\n    blt 98f                       // no\n    mov x0,x10                     // return FD epoll instance\n    b 100f\n98:                                // error display\n    ldr x1,qAdrszMessErrInitPoll   // error message\n    bl   displayError\n    mov x0,-1\n100:\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n/*********************************/\n/* wait key                      */\n/*********************************/\n/* x0 contains FD poll    */\nwaitKey:\n    stp x1,lr,[sp,-16]!            // save  registers\n    ldr x11,qAdrqTouche            // key address\n    str xzr,[x11]                  // raz key\n1:\n    ldr x1,qAdrqEnd                // if signal ctrl-c  -> end\n    ldr x1,[x1]\n    cbnz x1,100f\n\n    ldr x1,qAdrstevents\n    mov x2,12                      // size events\n    mov x3,1                       // timeout = 1  TODO:\u00a0??\n    mov x4,0\n    mov x8,SYSPOLL                 // call system wait POLL\n    svc 0 \n    cmp x0,0                       // key pressed\u00a0?\n    bge 100f\n98:                                // error display\n    ldr x1,qAdrszMessErreurKey        // error message\n    bl   displayError\n    mov x0,-1\n100:\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n/*********************************/\n/* read key                      */\n/*********************************/\n/* x0 returns key value */\nreadKey:\n    stp x1,lr,[sp,-16]!            // save  registers\n    mov x0,STDIN                   // File Descriptor\n    ldr x1,qAdrqTouche             // buffer address\n    mov x2,KEYSIZE                 // key size\n    mov x8,READ                    // read key\n    svc #0\n    cmp x0,0                       // error\u00a0?\n    ble 98f\n    ldr x2,qAdrqTouche             // key address\n    ldr x0,[x2]\n    b 100f\n98:                                // error display\n    ldr x1,qAdrszMessErreur        // error message\n    bl   displayError\n    mov x0,-1\n100:\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n/*********************************/\n/* restaur terminal state        */\n/*********************************/\nrestauTerm:\n    stp x1,lr,[sp,-16]!            // save  registers\n    mov x0,STDIN                   // end then restaur begin state terminal\n    mov x1,TCSETS\n    ldr x2,qAdrstOldtio\n    mov x8,IOCTL                   // call system  \n    svc 0\n    cbz x0,100f\n    ldr x1,qAdrszMessErreur        // error message\n    bl   displayError\n100:\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n\n/********************************************************/\n/*        File Include fonctions                        */\n/********************************************************/\n/* for this file see task include a file in language AArch64 assembly */\n.include \"../includeARM64.inc\"",
        "safe": true
    },
    {
        "filename": "15 puzzle game_30.txt",
        "content": "         >>SOURCE FORMAT FREE\n*> This code is dedicated to the public domain\n*> This is GNUCOBOL 2.0\nidentification division.\nprogram-id. fifteen.\nenvironment division.\nconfiguration section.\nrepository. function all intrinsic.\ndata division.\nworking-storage section.\n\n01  r pic 9.\n01  r-empty pic 9.\n01  r-to pic 9.\n01  r-from pic 9.\n\n01  c pic 9.\n01  c-empty pic 9.\n01  c-to pic 9.\n01  c-from pic 9.\n\n01  display-table.\n    03  display-row occurs 4.\n        05  display-cell occurs 4 pic 99.\n\n01  tile-number pic 99.\n01  tile-flags pic x(16).\n\n01  display-move value spaces.\n    03  tile-id pic 99.\n\n01  row-separator pic x(21) value all '.'.\n01  column-separator pic x(3) value ' . '.\n\n01  inversions pic 99.\n01  current-tile pic 99.\n\n01  winning-display pic x(32) value\n        '01020304'\n    &   '05060708'\n    &   '09101112'\n    &   '13141500'.\n\nprocedure division.\nstart-fifteen.\n    display 'start fifteen puzzle'\n    display '    enter a two-digit tile number and press <enter> to move'\n    display '    press <enter> only to exit'\n\n    *> tables with an odd number of inversions are not solvable\n    perform initialize-table with test after until inversions = 0\n    perform show-table\n    accept display-move\n    perform until display-move = spaces\n        perform move-tile\n        perform show-table\n        move spaces to display-move\n        accept display-move\n    end-perform\n    stop run\n    .\ninitialize-table.\n    compute tile-number = random(seconds-past-midnight) *> seed only\n    move spaces to tile-flags\n    move 0 to current-tile inversions\n    perform varying r from 1 by 1 until r > 4\n    after c from 1 by 1 until c > 4\n        perform with test after\n        until tile-flags(tile-number + 1:1) = space\n            compute tile-number = random() * 100\n            compute tile-number = mod(tile-number, 16)\n        end-perform\n        move 'x' to tile-flags(tile-number + 1:1)\n        if tile-number > 0 and < current-tile\n            add 1 to inversions\n        end-if\n        move tile-number to display-cell(r,c) current-tile\n    end-perform\n    compute inversions = mod(inversions,2)\n    .\nshow-table.\n    if display-table = winning-display\n        display 'winning'\n    end-if\n    display space row-separator\n    perform varying r from 1 by 1 until r > 4\n        perform varying c from 1 by 1 until c > 4\n            display column-separator with no advancing\n            if display-cell(r,c) = 00\n                display '  ' with no advancing\n                move r to r-empty\n                move c to c-empty\n            else\n                display display-cell(r,c) with no advancing\n            end-if\n        end-perform\n        display column-separator\n    end-perform\n    display space row-separator\n    .\nmove-tile.\n    if not (tile-id numeric and tile-id >= 01 and <= 15)\n        display 'invalid tile number'\n        exit paragraph\n    end-if\n\n    *> find the entered tile-id row and column (r,c)\n    perform varying r from 1 by 1 until r > 4\n    after c from 1 by 1 until c > 4\n        if display-cell(r,c) = tile-id\n            exit perform\n        end-if\n    end-perform\n\n    *> show-table filled (r-empty,c-empty)\n    evaluate true\n    when r = r-empty\n        if c-empty < c\n            *> shift left\n            perform varying c-to from c-empty by 1 until c-to > c\n                compute c-from = c-to + 1\n                move display-cell(r-empty,c-from) to display-cell(r-empty,c-to)\n            end-perform\n        else\n           *> shift right\n           perform varying c-to from c-empty by -1 until c-to < c\n               compute c-from = c-to - 1\n               move display-cell(r-empty,c-from) to display-cell(r-empty,c-to)\n           end-perform\n       end-if\n       move 00 to display-cell(r,c)\n    when c = c-empty\n        if r-empty < r\n            *>shift up\n            perform varying r-to from r-empty by 1 until r-to > r\n                compute r-from = r-to + 1\n                move display-cell(r-from,c-empty) to display-cell(r-to,c-empty)\n            end-perform\n        else\n            *> shift down\n            perform varying r-to from r-empty by -1 until r-to < r\n                compute r-from = r-to - 1\n                move display-cell(r-from,c-empty) to display-cell(r-to,c-empty)\n            end-perform\n        end-if\n        move 00 to display-cell(r,c)\n    when other\n         display 'invalid move'\n    end-evaluate\n    .\nend program fifteen.\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_31.txt",
        "content": "prompt$ cobc -xj fifteen.cbl\nstart fifteen puzzle\n    enter a two-digit tile number and press <enter> to move\n    press <enter> only to exit\n .....................\n . 05 . 14 . 08 . 12 .\n . 01 . 10 . 03 . 09 .\n . 02 . 15 . 13 . 11 .\n . 06 .    . 07 . 04 .\n .....................\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_32.txt",
        "content": "|15|::main\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_33.txt",
        "content": "(defpackage :15\n  (:use :common-lisp))\n(in-package :15)\n\n(defvar +side+ 4)\n(defvar +max+ (1- (* +side+ +side+))) ; 15\n\n(defun make-board ()\n  (make-array (list +side+ +side+)\n              :initial-contents\n              (loop :for i :below +side+ :collecting\n                 (loop :for j :below +side+ :collecting\n                    (mod (1+ (+ j (* i +side+))) (1+ +max+))))))\n(defvar *board* (make-board))\n\n(defun shuffle-board (board)\n  (loop for i from (array-total-size board) downto 2\n     do (rotatef (row-major-aref board (random i))\n                 (row-major-aref board (1- i))))\n  board)\n\n(defun pb (stream object &rest args)\n  (declare (ignorable args))\n  (loop for i below (car (array-dimensions object)) do\n       (loop for j below (cadr (array-dimensions object)) do\n            (let ((cell (aref object i j)))\n              (format stream \"(~[  ~:;~:*~2d~])\" cell)))\n       (format stream \"~%\")))\n\n(defun sortedp (board)\n  (declare (ignorable board))\n  (loop for i upto +max+\n     when (eq (row-major-aref board i) (mod (1+ i) 16)) do\n       (return-from sortedp nil))\n  t)\n\n(defun inversions (lst)\n  (if (or (null lst) (null (cdr lst)))\n      0\n      (let* ((half (ceiling (/ (length lst) 2)))\n             (left-list (subseq lst 0 half))\n             (right-list (subseq lst half)))\n        (+ (loop for a in left-list\n              summing (loop for b in right-list\n                         counting (not (< a b))))\n           (inversions left-list)\n           (inversions right-list)))))\n\n(defun solvablep (board)\n  (let ((inv (inversions (loop for i upto +max+ collecting\n                              (row-major-aref board i))))\n        (row (- +side+ (first (board-position board 0)))))\n    (or (and (oddp +side+)\n             (evenp inv))\n        (and (evenp +side+)\n             (evenp row)\n             (oddp inv))\n        (and (evenp +side+)\n             (oddp row)\n             (evenp inv)))))\n\n(defun board-position (board dig)\n  (loop for i below (car (array-dimensions board)) do\n       (loop for j below (cadr (array-dimensions board))\n          when (eq dig (aref board i j)) do\n          (return-from board-position (list i j)))))\n\n(defun in-bounds (y x)\n  (and (< -1 y +side+)\n       (< -1 x +side+)))\n\n(defun get-adjacents (board pos)\n  (let ((adjacents ()) (y (first pos)) (x (second pos)))\n    (if (in-bounds y (1+ x))\n        (push (aref board y (1+ x)) adjacents))\n    (if (in-bounds (1+ y) x)\n        (push (aref board (1+ y) x) adjacents))\n    (if (in-bounds y (1- x))\n        (push (aref board y (1- x)) adjacents))\n    (if (in-bounds (1- y) x)\n        (push (aref board (1- y) x) adjacents))\n    adjacents))\n\n(defun main (&rest argv)\n  (declare (ignorable argv))\n  (setf *random-state* (make-random-state t))\n  (loop until (solvablep *board*) do\n       (shuffle-board *board*))\n  (loop until (sortedp *board*) do\n       (format t \"~/15:pb/~%\" *board*)\n       (format t \"Which number do you want to swap the blank with?~%> \")\n       (let* ((in (read))\n              (zpos (board-position *board* 0))\n              (pos (board-position *board* in))\n              (adj (get-adjacents *board* zpos)))\n         (if (find in adj)\n             (rotatef (aref *board* (first pos) (second pos))\n                      (aref *board* (first zpos) (second zpos))))))\n  (format t \"You win!~%\"))\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_34.txt",
        "content": "rem 15 Puzzle example game\nrem written in Craft Basic\nrem by Gemino Smothers 2023\nrem www.lucidapogee.com\n\ndefine size = 16, correct = 0, moves = 0\ndefine click = 0, start = 0\n\ndim list[size]\n\ngosub setup\ngosub game\n\nend\n\nsub setup\n\n\ttitle \"15 Puzzle\"\n\n\tbgcolor 0,128,0\n\tcls graphics\n\n\tresize 0, 0, 170, 270\n\tcenter\n\n\tlet x = 0\n\tlet y = 30\n\n\tfor i = 0 to size - 1\n\n\t\tif x = 112 then\n\n\t\t\tlet x = 0\n\t\t\tlet y = y + 25\n\n\t\tendif\n\n\t\tlet x = x + 28\n\n\t\tformid i + 1\n\t\tformtext \"\"\n\t\tbuttonform x, y, 25, 20\n\n\tnext i\n\n\tformid 17\n\tformtext \"\n\tstaticform 40, 130, 100, 20\n\tbgcolor 0, 128, 0\n\tfgcolor 255, 255, 0\n\tcolorform\n\n\tformid 18\n\tformtext \"\"\n\tstaticform 40, 150, 100, 20\n\tbgcolor 0, 128, 0\n\tfgcolor 255, 255, 0\n\tcolorform\n\n\tformid 19\n\tformtext \"New\"\n\tbuttonform 1, 1, 50, 20\n\n\tformid 20\n\tformtext \"Help\"\n\tbuttonform 55, 1, 50, 20\n\n\tformid 21\n\tformtext \"About\"\n\tbuttonform 110, 1, 50, 20\n\n\tformid 22\n\tformtext \"Welcome.\"\n\tstaticform 40, 170, 120, 20\n\tbgcolor 0, 128, 0\n\tfgcolor 255, 255, 0\n\tcolorform\n\nreturn\n\nsub shuffle\n\n\tlet start = 1\n\n\tformid 22\n\tformtext \"shuffling...\"\n\tupdateform\n\n\tfor i = 0 to size - 1\n\n\t\tformid i + 1\n\t\tformtext \"\"\n\t\tupdateform\n\n\t\tlet list[i] = 0\n\n\tnext i\n\n\tlet t = 0\n\tlet i = 0\n\n\tdo\n\n\t\tif i = 14 then\n\n\t\t\tlet n = 120 - t\n\n\t\t\tformid i + 1\n\t\t\tformtext n\n\t\t\tupdateform\n\n\t\t\tlet list[i] = n\n\n\t\t\tbreak\n\n\t\tendif\n\n\t\tfor f = 0 to size - 1\n\n\t\t\tlet n = int(rnd * 15) + 1\n\t\t\tlet s = 0\n\n\t\t\tfor c = 0 to i - 1\n\n\t\t\t\tif n = list[c] then\n\n\t\t\t\t\tlet s = 1\n\t\t\t\t\tbreak c\n\n\t\t\t\tendif\n\n\t\t\tnext c\n\n\t\t\tif s = 0 and list[i] = 0 then\n\n\t\t\t\tformid i + 1\n\t\t\t\tformtext n\n\t\t\t\tupdateform\n\n\t\t\t\tlet list[i] = n\n\t\t\t\tlet t = t + n\n\t\t\t\tlet i = i + 1\n\n\t\t\tendif\n\n\t\t\twait\n\n\t\tnext f\n\n\tloop i < size - 1\n\n\tformid 22\n\tformtext \"\"\n\tupdateform\n\nreturn\n\nsub game\n\n\tdo\n\n\t\tlet click = forms\n\n\t\tif click > 0 and click < 17 and start = 1 then\n\n\t\t\tlet moves = moves + 1\n\n\t\t\tformid 17\n\t\t\tformtext \"Moves: \", moves\n\t\t\tupdateform\n\n\t\t\tgosub checkspaces\n\t\t\tgosub checkorder\n\n\t\tendif\n\n\t\tif click = 19 then\n\n\t\t\tgosub shuffle\n\n\t\t\tlet moves = 0\n\t\t\tlet correct = 0\n\n\t\t\tformid 17\n\t\t\tformtext \"Moves:\"\n\t\t\tupdateform\n\n\t\t\tformid 18\n\t\t\tformtext \"Correct:\"\n\t\t\tupdateform\n\n\t\tendif\n\n\t\tif click = 20 then\n\n\t\t\talert \"Click the numbers to move them in the correct order.\"\n\n\t\tendif\n\n\t\tif click =  21 then\n\n\t\t\talert \"15 Puzzle\", newline, \"by Gemino Smothers 2023 \", newline, \" www.lucidapogee.com\"\n\n\t\tendif\n\n\t\tbutton k, 27\n\n\t\twait\n\n\tloop k = 0\n\nreturn\n\nsub checkspaces\n\n\tlet click = click - 1\n\tlet top = click - 4\n\tlet right = click + 1\n\tlet bottom = click + 4\n\tlet left = click - 1\n\n\tif top >= 0 then\n\n\t\tif list[top] = 0 then\n\n\t\t\tlet n = top\n\t\t\tgosub swap\n\n\t\tendif\n\n\tendif\n\n\tif right <= size - 1 then\n\n\t\tif list[right] = 0 then\n\n\t\t\tlet n = right\n\t\t\tgosub swap\n\n\t\tendif\n\n\tendif\n\n\tif bottom <= size - 1 then\n\n\t\tif list[bottom] = 0 then\n\n\t\t\tlet n = bottom\n\t\t\tgosub swap\n\n\t\tendif\n\n\tendif\n\n\tif left >= 0 then\n\n\t\tif list[left] = 0 then\n\n\t\t\tlet n = left\n\t\t\tgosub swap\n\n\t\tendif\n\n\tendif\n\nreturn\n\nsub swap\n\n\tlet t = list[click]\n\tlet list[n] = list[click]\n\tlet list[click] = 0\n\n\tlet click = click + 1\n\tformid click\n\tformtext \"\"\n\tupdateform\n\n\tlet n = n + 1\n\tformid n\n\tformtext t\n\tupdateform\n\nreturn\n\nsub checkorder\n\n\tlet correct = 0\n\n\tfor i = 0 to size - 2\n\n\t\tif list[i] = i + 1 then\n\n\t\t\tlet correct = correct + 1\n\n\t\tendif\n\n\tnext i\n\n\tformid 18\n\tformtext \"Correct: \", correct\n\tupdateform\n\n\tif correct = size - 1 then \n\n\t\twait\n\t\talert \"You win! Moves: \", moves\n\n\tendif\n\nreturn\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_35.txt",
        "content": "const BoardWidth = 4; BoardHeight = 4;\nconst CellCount = BoardWidth * BoardHeight;\n\nvar GameBoard: array [0..BoardWidth-1,0..BoardHeight-1] of integer;\n\n\nprocedure BuildBoard;\n{Put all number in the game board}\nvar I,X,Y: integer;\nbegin\nfor I:=0 to CellCount-1 do\n\tbegin\n\tY:=I div BoardHeight;\n\tX:=I mod BoardWidth;\n\tGameBoard[X,Y]:=I;\n\tend;\nend;\n\n\nfunction IsWinner: boolean;\n{Check to see if tiles are winning in order}\nvar I,X,Y: integer;\nbegin\nResult:=False;\nfor I:=1 to CellCount-1 do\n\tbegin\n\tY:=(I-1) div BoardHeight;\n\tX:=(I-1) mod BoardWidth;\n\tif GameBoard[X,Y]<>I then exit;\n\tend;\nResult:=True;\nend;\n\n\nprocedure DisplayGameBoard(Grid: TStringGrid);\n{Display game on TStringGrid component}\nvar Tile,X,Y: integer;\nvar S: string;\nbegin\nfor Y:=0 to High(GameBoard) do\n\tbegin\n\tS:='';\n\tfor X:=0 to High(GameBoard[0]) do\n\t\tbegin\n\t\tTile:=GameBoard[X,Y];\n\t\tif Tile=0 then Form1.GameGrid.Cells[X,Y]:=''\n\t\telse Grid.Cells[X,Y]:=IntToStr(GameBoard[X,Y]);\n\t\tend;\n\tend;\nend;\n\n\n\nprocedure ExchangePieces(P1,P2: TPoint);\n{Exchange the pieces specified by P1 and P2}\nvar T: integer;\nbegin\nT:=GameBoard[P1.X,P1.Y];\nGameBoard[P1.X,P1.Y]:=GameBoard[P2.X,P2.Y];\nGameBoard[P2.X,P2.Y]:=T;\nend;\n\n\nprocedure Randomize;\n{Scramble piece by exchanging random pieces}\nvar I: integer;\nvar P1,P2: TPoint;\nbegin\nfor I:=0 to 100 do\n\tbegin\n\tP1:=Point(Random(BoardWidth),Random(BoardHeight));\n\tP2:=Point(Random(BoardWidth),Random(BoardHeight));\n\tExchangePieces(P1,P2);\n\tend;\nend;\n\n\nprocedure NewGame;\n{Initiate new game by randomizing tiles}\nbegin\nBuildBoard;\nRandomize;\nDisplayGameBoard(Form1.GameGrid);\nend;\n\n\n\nfunction FindEmptyNeighbor(P: TPoint): TPoint;\n{Find the empty neighbor cell if any}\n{Returns Point(-1,-1) if none found}\nbegin\nResult:=Point(-1,-1);\nif (P.X>0) and (GameBoard[P.X-1,P.Y]=0) then Result:=Point(P.X-1,P.Y)\nelse if (P.X<(BoardWidth-1)) and (GameBoard[P.X+1,P.Y]=0) then Result:=Point(P.X+1,P.Y)\nelse if (P.Y>0) and (GameBoard[P.X,P.Y-1]=0) then Result:=Point(P.X,P.Y-1)\nelse if (P.Y<(BoardHeight-1)) and (GameBoard[P.X,P.Y+1]=0) then Result:=Point(P.X,P.Y+1);\nend;\n\n\n\nprocedure ShowStatus(S: string; BellCount: integer);\n{Display status string and ring bell specified number of times}\nvar I: integer;\nbegin\nForm1.StatusMemo.Lines.Add(S);\nfor I:=1 to BellCount do PlaySound('DeviceFail', 0, SND_SYNC);\nend;\n\n\n\nprocedure HandleMouseClick(X,Y: integer; Grid: TStringGrid);\n{Handle mouse click on specified grid}\nvar Pos,Empty: TPoint;\nvar Item: integer;\nbegin\nGrid.MouseToCell(X, Y,Pos.X, Pos.Y);\nItem:=GameBoard[Pos.X,Pos.Y];\nEmpty:=FindEmptyNeighbor(Pos);\nif (Item>0) and (Empty.X>=0) then\n\tbegin\n\tExchangePieces(Empty,Pos);\n\tDisplayGameBoard(Grid);\n\tif IsWinner then ShowStatus('Winner', 5);\n\tend\nelse ShowStatus('Invalid Command.', 1);\nend;\n\n\n\nprocedure TForm1.NewGameBtnClick(Sender: TObject);\n{Create new game when button pressed}\nbegin\nNewGame;\nend;\n\n\nprocedure TForm1.GameGridMouseDown(Sender: TObject; Button: TMouseButton;\n  Shift: TShiftState; X, Y: Integer);\n{Use the mouse click event to select a move}\nbegin\nHandleMouseClick(X,Y,GameGrid);\nend;\n\nprocedure TForm1.FormCreate(Sender: TObject);\n{Start new game when the program starts running}\nbegin\nNewGame;\nend;\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_36.txt",
        "content": "sysconf topleft\nbackground 432\ntextsize 13\nlen f[] 16\nproc draw . .\n   clear\n   for i = 1 to 16\n      h = f[i]\n      if h < 16\n         x = (i - 1) mod 4 * 24 + 3\n         y = (i - 1) div 4 * 24 + 3\n         color 210\n         move x y\n         rect 22 22\n         move x + 4 y + 6\n         if h < 10\n            move x + 6 y + 6\n         .\n         color 885\n         text h\n      .\n   .\n.\nglobal done .\nproc smiley . .\n   s = 3.5\n   x = 86\n   y = 86\n   move x y\n   color 983\n   circle 2.8 * s\n   color 000\n   move x - s y - s\n   circle s / 3\n   move x + 3.5 y - 3.5\n   circle s / 3\n   linewidth s / 3\n   curve [ x - s y + s x y + 2 * s x + s y + s ]\n.\nproc init . .\n   done = 0\n   for i = 1 to 16\n      f[i] = i\n   .\n   # shuffle\n   for i = 15 downto 2\n      r = random i\n      swap f[r] f[i]\n   .\n   # make it solvable\n   inv = 0\n   for i = 1 to 15\n      for j = 1 to i - 1\n         if f[j] > f[i]\n            inv += 1\n         .\n      .\n   .\n   if inv mod 2 <> 0\n      swap f[1] f[2]\n   .\n   textsize 12\n   draw\n.\nproc move_tile . .\n   c = mouse_x div 25\n   r = mouse_y div 25\n   i = r * 4 + c + 1\n   if c > 0 and f[i - 1] = 16\n      swap f[i] f[i - 1]\n   elif r > 0 and f[i - 4] = 16\n      swap f[i] f[i - 4]\n   elif r < 3 and f[i + 4] = 16\n      swap f[i] f[i + 4]\n   elif c < 3 and f[i + 1] = 16\n      swap f[i] f[i + 1]\n   .\n   draw\n   for i = 1 to 15\n      if f[i] > f[i + 1]\n         return\n      .\n   .\n   done = 1\n   timer 0.5\n.\non mouse_down\n   if done = 0\n      move_tile\n   elif done = 3\n      init\n   .\n.\non timer\n   if done = 1\n      smiley\n      done = 2\n      timer 2\n   else\n      done = 3\n   .\n.\ninit\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_37.txt",
        "content": "// 15 Puzzle Game. Nigel Galloway: August 9th., 2020\nlet Nr,Nc,RA,rnd=[|3;0;0;0;0;1;1;1;1;2;2;2;2;3;3;3|],[|3;0;1;2;3;0;1;2;3;0;1;2;3;0;1;2|],[|for n in [1..16]->n%16|],System.Random()\nlet rec fN g \u03a3=function h::t->fN g (\u03a3+List.sumBy(fun n->if h>n then 1 else 0)t) t|_->(\u03a3-g/4)%2=1\nlet rec fI g=match if System.Console.IsInputRedirected then char(System.Console.Read()) else System.Console.ReadKey(true).KeyChar with\n               n when Seq.contains n g->printf \"%c\" n; (match n with 'l'-> -1|'r'->1|'d'->4|_-> -4)|_->System.Console.Beep(); fI g \nlet rec fG n \u03a3=function 0->(List.findIndex((=)0)\u03a3,\u03a3)|g->let i=List.item(rnd.Next(g)) n in fG(List.except [i] n)(i::\u03a3)(g-1)\nlet rec fE()=let n,g=fG [0..15] [] 16 in if fN n 0 (List.except [0] g) then (n,Array.ofList g) else fE()\nlet rec fL(n,g) \u03a3=let fa=printfn \"\";Array.chunkBySize 4 g|>Array.iter(fun n->Array.iter(printf \"%3d\")n;printfn \"\")\n                  match g=RA with true->printfn \"Solved in %d moves\" \u03a3; fa; 0\n                                 |_->let vM=match n/4,n%4 with (0,0)->\"rd\"|(0,3)->\"ld\"|(0,_)->\"lrd\"|(3,0)->\"ru\"|(3,3)->\"lu\"|(3,_)->\"lru\"|(_,0)->\"rud\"|(_,3)->\"lud\"|_->\"lrud\"\n                                     fa; printf \"Move Number: %2d; Manhatten Distance: %2d; Choose move from %4s: \" \u03a3\n                                         ([0..15]|>List.sumBy(fun n->match g.[n] with 0->0 |i->(abs(n/4-Nr.[i]))+(abs(n%4-Nc.[i])))) vM\n                                     let v=fI vM in g.[n]<-g.[n+v];g.[n+v]<-0;fL(n+v,g)(\u03a3+1)\n[<EntryPoint>]\nlet main n = fL(match n with [|n|]->let g=[|let g=uint64 n in for n in 60..-4..0->int((g>>>n)&&&15UL)|] in (Array.findIndex((=)0)g,g) |_->fE()) 0\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_38.txt",
        "content": "15 game with no parameters will generate a random game which may be solved.\nA solution in the form suggested in 15_puzzle_solver may be piped into 15game. \"dddrurdruuulllddrulddrrruuullddruulldddrrurulldrruulldlddrurullddrrruullulddrdrr\" | .\\15game 0x0c9dfbae37254861 produces the output here: 15_puzzle_solver/extra_credit/solution.\nOptionally a start position may be supplied. 15game 0x123450689a7bdefc may be solved:\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_39.txt",
        "content": "  1  2  3  4\n  5  0  6  8\n  9 10  7 11\n 13 14 15 12\nMove Number:  0; Manhatten Distance:  4; Choose move from lrud: r\n  1  2  3  4\n  5  6  0  8\n  9 10  7 11\n 13 14 15 12\nMove Number:  1; Manhatten Distance:  3; Choose move from lrud: d\n  1  2  3  4\n  5  6  7  8\n  9 10  0 11\n 13 14 15 12\nMove Number:  2; Manhatten Distance:  2; Choose move from lrud: r\n  1  2  3  4\n  5  6  7  8\n  9 10 11  0\n 13 14 15 12\nMove Number:  3; Manhatten Distance:  1; Choose move from  lud: d\n  1  2  3  4\n  5  6  7  8\n  9 10 11 12\n 13 14 15  0\nSolved in 4 moves\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_4.txt",
        "content": "DEFINE BOARDSIZE=\"16\"\nDEFINE X0=\"13\"\nDEFINE Y0=\"6\"\nDEFINE ITEMW=\"3\"\nDEFINE ITEMH=\"2\"\n\nBYTE ARRAY board(BOARDSIZE)\nBYTE emptyX,emptyY,solved,first=[1]\n\nBYTE FUNC Index(BYTE x,y)\nRETURN (x+y*4)\n\nPROC UpdateItem(BYTE x,y)\n  BYTE item\n\n  Position(X0+x*ITEMW+1,Y0+y*ITEMH+1)\n  item=board(Index(x,y))\n  IF item=0 THEN\n    Print(\"  \")\n  ELSEIF item<10 THEN\n    Put(160) Put(item+176)\n  ELSE\n    Put(item/10+176)\n    Put(item MOD 10+176)\n  FI\nRETURN\n\nPROC UpdateBoard()\n  BYTE x,y\n\n  FOR y=0 TO 3\n  DO\n    FOR x=0 TO 3\n    DO\n      UpdateItem(x,y)     \n    OD\n  OD\nRETURN\n\nPROC DrawGrid()\n  CHAR ARRAY\n    top=[13 17 18 18 23 18 18 23 18 18 23 18 18 5],\n    row=[13 124 32 32 124 32 32 124 32 32 124 32 32 124],\n    mid=[13 1 18 18 19 18 18 19 18 18 19 18 18 4],\n    bot=[13 26 18 18 24 18 18 24 18 18 24 18 18 3]\n  BYTE y,i\n\n  y=Y0\n  Position(X0,y) Print(top) y==+1\n  Position(X0,y) Print(row) y==+1\n  FOR i=0 TO 2\n  DO\n    Position(X0,y) Print(mid) y==+1\n    Position(X0,y) Print(row) y==+1\n  OD\n  Position(X0,y) Print(bot)\nRETURN\n\nPROC DrawBoard()\n  DrawGrid()\n  UpdateBoard()\nRETURN\n\nPROC FindEmpty()\n  BYTE i\n\n  FOR i=0 TO BOARDSIZE-1\n  DO\n    IF board(i)=0 THEN\n      emptyX=i MOD 4\n      emptyY=i/4\n    FI\n  OD\nRETURN\n\nPROC Wait(BYTE frames)\n  BYTE RTCLOK=$14\n  frames==+RTCLOK\n  WHILE frames#RTCLOK DO OD\nRETURN\n\nPROC UpdateStatus()\n  Position(9,3) Print(\"Game status: \")\n  IF solved THEN\n    Print(\"SOLVED\u00a0!\")\n    IF first=0 THEN\n      Sound(0,100,10,5) Wait(5)\n      Sound(0,60,10,5) Wait(5)\n      Sound(0,40,10,5) Wait(5)\n      Sound(0,0,0,0)\n    FI\n    first=0\n  ELSE\n    Print(\"Shuffled\")\n  FI\nRETURN\n\nPROC InitBoard()\n  BYTE i\n  \n  FOR i=1 TO BOARDSIZE\n  DO\n    board(i-1)=i MOD 16\n  OD\n  FindEmpty()\n  solved=1\n  UpdateStatus()\nRETURN\n\nBYTE FUNC IsSolved()\n  BYTE i\n\n  FOR i=1 TO BOARDSIZE\n  DO\n    IF board(i-1)#i MOD 16 THEN\n      RETURN (0)\n    FI\n  OD\nRETURN (1)\n\nPROC CheckStatus()\n  BYTE tmp\n\n  tmp=IsSolved()\n  IF solved#tmp THEN\n    solved=tmp\n    UpdateStatus()\n  FI\nRETURN\n\nPROC Swap(BYTE x1,y1,x2,y2)\n  BYTE tmp,i1,i2\n\n  i1=Index(x1,y1)\n  i2=Index(x2,y2)\n  tmp=board(i1)\n  board(i1)=board(i2)\n  board(i2)=tmp\n  UpdateItem(x1,y1)\n  UpdateItem(x2,y2)\n  CheckStatus()\nRETURN\n\nPROC Shuffle()\n  BYTE i,j,tmp\n\n  i=BOARDSIZE-1\n  WHILE i>0\n  DO\n    j=Rand(i)\n    tmp=board(i)\n    board(i)=board(j)\n    board(j)=tmp\n    i==-1\n  OD\n  FindEmpty()\n  UpdateBoard()\n  CheckStatus()\nRETURN\n\nPROC MoveLeft()\n  IF emptyX=0 THEN RETURN FI\n  Swap(emptyX,emptyY,emptyX-1,emptyY)\n  emptyX==-1\nRETURN\n\nPROC MoveRight()\n  IF emptyX=3 THEN RETURN FI\n  Swap(emptyX,emptyY,emptyX+1,emptyY)\n  emptyX==+1\nRETURN\n\nPROC MoveUp()\n  IF emptyY=0 THEN RETURN FI\n  Swap(emptyX,emptyY,emptyX,emptyY-1)\n  emptyY==-1\nRETURN\n\nPROC MoveDown()\n  IF emptyY=3 THEN RETURN FI\n  Swap(emptyX,emptyY,emptyX,emptyY+1)\n  emptyY==+1\nRETURN\n\nPROC Main()\n  BYTE k,lastStick=[255],currStick,\n    CH=$02FC, ;Internal hardware value for last key pressed\n    CRSINH=$02F0 ;Controls visibility of cursor\n\n  Graphics(0)\n  SetColor(2,0,2)\n  CRSINH=1 ;hide cursor\n  Position(10,18) Print(\"Joystick - move tiles\")\n  Position(9,19) Print(\"Space bar - shuffle\")\n  Position(15,20) Print(\"ESC - exit\")\n  InitBoard()\n  DrawBoard()\n  DO\n    currStick=Stick(0)\n    IF currStick#lastStick THEN\n      IF currStick=11 THEN MoveRight()\n      ELSEIF currStick=7 THEN MoveLeft()\n      ELSEIF currStick=13 THEN MoveUp()\n      ELSEIF currStick=14 THEN MoveDown()\n      FI\n    FI\n    lastStick=currStick\n    k=CH\n    IF k#$FF THEN CH=$FF FI\n    IF k=33 THEN Shuffle()\n    ELSEIF k=28 THEN EXIT\n    FI\n  OD\nRETURN",
        "safe": true
    },
    {
        "filename": "15 puzzle game_40.txt",
        "content": "USING: accessors combinators combinators.extras\ncombinators.short-circuit grouping io kernel literals math\nmath.matrices math.order math.parser math.vectors prettyprint qw\nrandom sequences sequences.extras ;\nIN: rosetta-code.15-puzzle-game\n\n<<\n\nTUPLE: board matrix zero ;\n\n: <board> ( -- board )\n    16 <iota> 1 rotate 4 group { 3 3 } board boa ;\n\n>>\n\nCONSTANT: winning $[ <board> matrix>> ]\n\n: input>dir ( str -- pair )\n    {\n        { \"u\" [ { 1 0 } ] }\n        { \"d\" [ { -1 0 } ] }\n        { \"l\" [ { 0 1 } ] }\n        { \"r\" [ { 0 -1 } ] }\n    } case ;\n\n: get-index ( loc matrix -- elt ) [ first2 swap ] dip nth nth ;\n\n: mexchange ( loc1 loc2 matrix -- )\n    tuck [ [ [ get-index ] keepd ] 2bi@ ] keep [ spin ] 2dip\n    [ set-index ] keep set-index ;\n\n: vclamp+ ( seq1 seq2 -- seq ) v+ { 0 0 } { 3 3 } vclamp ;\n\n: slide-piece ( board str -- )\n    over zero>> [ vclamp+ ] keep rot matrix>> mexchange ;\n\n: move-zero ( board str -- )\n    [ vclamp+ ] curry change-zero drop ;\n\n: move ( board str -- )\n    input>dir [ slide-piece ] [ move-zero ] 2bi ;\n\n: rand-move ( board -- ) qw{ u d l r } random move ;\n\n: shuffle-board ( board n -- board' ) [ dup rand-move ] times ;\n\n: .board ( board -- ) matrix>> simple-table. ;\n\n: get-input ( -- str )\n    \"Your move? (u/d/l/r/q) \" write flush readln dup\n    qw{ u d l r q } member? [ drop get-input ] unless ;\n\n: won? ( board -- ? ) matrix>> winning = ;\n\nDEFER: game\n: process-input ( board -- board' )\n    get-input dup \"q\" = [ drop ] [ game ] if ;\n\n: check-win ( board -- board' )\n    dup won? [ \"You won!\" print ] [ process-input ] if ;\n\n: game ( board str -- board' )\n    [ move ] keepd dup .board check-win ;\n\n: valid-difficulty? ( obj -- ? )\n    { [ fixnum? ] [ 3 100 between? ] } 1&& ;\n\n: choose-difficulty ( -- n )\n    \"How many shuffles? (3-100) \" write flush readln\n    string>number dup valid-difficulty?\n    [ drop choose-difficulty ] unless ;\n\n: main ( -- )\n    <board> choose-difficulty shuffle-board dup .board check-win\n    drop ;\n\nMAIN: main\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_41.txt",
        "content": "How many shuffles? (3-100) 5\n1  2  3  4\n5  6  7  8\n9  0  10 12\n13 14 11 15\nYour move? (u/d/l/r/q) apple\nYour move? (u/d/l/r/q) l\n1  2  3  4\n5  6  7  8\n9  10 0  12\n13 14 11 15\nYour move? (u/d/l/r/q) u\n1  2  3  4\n5  6  7  8\n9  10 11 12\n13 14 0  15\nYour move? (u/d/l/r/q) l\n1  2  3  4\n5  6  7  8\n9  10 11 12\n13 14 15 0\nYou won!\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_42.txt",
        "content": "#! /usr/bin/gforth\n\ncell 8 <> [if] s\" 64-bit system required\" exception throw [then]\n\n\\ In the stack comments below,\n\\ \"h\" stands for the hole position (0..15),\n\\ \"s\" for a 64-bit integer representing a board state,\n\\ \"t\" a tile value (0..15, 0 is the hole),\n\\ \"b\" for a bit offset of a position within a state,\n\\ \"m\" for a masked value (4 bits selected out of a 64-bit state),\n\\ \"w\" for a weight of a current path,\n\\ \"d\" for a direction constant (0..3)\n\n\\ Utility\n: 3dup   2 pick 2 pick 2 pick ;\n: 4dup   2over 2over ;\n: shift   dup 0 > if lshift else negate rshift then ;\n\nhex 123456789abcdef0 decimal constant solution\n: row   2 rshift ;   : col   3 and ;\n\n: up-valid?    ( h -- f ) row 0 > ;\n: down-valid?  ( h -- f ) row 3 < ;\n: left-valid?  ( h -- f ) col 0 > ;\n: right-valid? ( h -- f ) col 3 < ;\n\n\\ To iterate over all possible directions, put direction-related functions into arrays:\n: ith ( u addr -- w ) swap cells + @ ;\ncreate valid? ' up-valid? , ' left-valid? , ' right-valid? , ' down-valid? , does> ith execute ;\ncreate step -4 , -1 , 1 , 4 , does> ith ;\n\n\\ Advance from a single state to another:\n: bits ( h -- b ) 15 swap - 4 * ;\n: tile ( s b -- t ) rshift 15 and ;\n: new-state ( s h d -- s' ) step dup >r + bits 2dup tile ( s b t ) swap lshift tuck - swap r> 4 * shift + ;\n\n: hole? ( s u -- f ) bits tile 0= ;\n: hole ( s -- h ) 16 0 do dup i hole? if drop i unloop exit then loop drop ;\n\n0 constant up 1 constant left 2 constant right 3 constant down\n\n\\ Print a board:\n: .hole   space space space ;\n: .tile ( u -- ) ?dup-0=-if .hole else dup 10 < if space then . then ;\n: .board ( s -- ) 4 0 do cr 4 0 do dup j 4 * i + bits tile .tile loop loop drop ;\n: .help   cr .\" ijkl move, q quit\" ;\n\n\\ Pseudorandom number generator:\ncreate (rnd)   utime drop ,\n: rnd   (rnd) @ dup 13 lshift xor dup 17 rshift xor dup dup 5 lshift xor (rnd) ! ;\n\n: move ( s u -- s' ) >r dup hole r> new-state ;\n: ?move ( s u -- s' ) >r dup hole r@ valid? if r> move else rdrop then ;\n: shuffle ( s u -- s' ) 0 do rnd 3 and ?move loop ;\n\n: win   cr .\" you won!\" bye ;\n: turn ( s -- )\n\tpage dup .board .help\n\tkey case\n\t\t[char] q of bye endof\n\t\t[char] i of down ?move endof\n\t\t[char] j of right ?move endof\n\t\t[char] k of up ?move endof\n\t\t[char] l of left ?move endof\n\tendcase ;\n\n: play  begin dup solution <> while turn repeat win ;\n\nsolution 1000 shuffle play\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_43.txt",
        "content": "LOCZ = MINLOC(BOARD)\t!Find the zero. 0 = BOARD(LOCZ(1),LOCZ(2)) == BOARD(ZC,ZR)\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_44.txt",
        "content": "      SUBROUTINE SWAP(I,J)\t!Alas, furrytran does not provide this.\n       INTEGER I,J,T\t\t!So, we're stuck with supplying the obvious.\n        T = I\t\t\t!And, only for one type at a go.\n        I = J\t\t\t!One could define a MODULE containing a collection\n        J = T\t\t\t!And thence a \"generic\" routine,\n      END SUBROUTINE SWAP\t!But this will do for now.\n\n      SUBROUTINE SHOW(NR,NC,BOARD)\t!The layout won't work for NC > 99...\n       INTEGER NR,NC\t\t!Number of rows and columns.\n       INTEGER BOARD(NC,NR)\t!The board is stored transposed!\n       INTEGER I\t\t!A stepper.\n       COMMON/IODEV/ MSG\t!I talk to the trees...\n        WRITE (MSG,1) (I,I = 1,NC)\t!Prepare a heading.\n    1   FORMAT (\"Row|\",9(\"__\",I1,:),90(\"_\",I2,:))\t!This should suffice.\n        DO I = 1,NR\t\t!Chug down the rows.\n          WRITE (MSG,2) I,BOARD(1:NC,I)\t!The columns of the row. Usage is BOARD(column,row).\n    2     FORMAT (I3,\"|\",99I3)\t!Could use parameters, but enough.\n        END DO\t\t\t!On to the next row.\n      END SUBROUTINE SHOW\t!That was nice.\n\n      PROGRAM PUZZLE\n      INTEGER LOCN(2),NR,NC,N\t!Describes the shape of the board.\n      INTEGER LOCZ(2),ZC,ZR\t!Fingers the location of the \"blank\" square.\n      INTEGER LOCI(2),IC,IR\t!Fingers a location.\nCan't EQUIVALENCE (LOCN(1),NC),(LOCN(2),NR)\t!This usage and a PARAMETER statement is too scary.\n      EQUIVALENCE (LOCZ(1),ZC),(LOCZ(2),ZR)\t!Annotate my (column,row) usage.\n      EQUIVALENCE (LOCI(1),IC),(LOCI(2),IR)\t!Rather than the displayed (row,column) style.\n      PARAMETER (NR = 4, NC = 4, N = NR*NC)\t!Determine the shape of the board.\n      INTEGER BOARD(NC,NR)\t\t!Thus transpose furrytran's column-major usage. Beware!!!\n      INTEGER BORED(N)\t\t\t!This allows for consecutive comparisons.\n      EQUIVALENCE (BOARD,BORED)\t\t!Because the arrays are in the same place.\n      INTEGER WAYS\t\t\t!Now define adjacency.\n      PARAMETER (WAYS = 4)\t\t!Just orthogonal neghbours.\n      INTEGER WAY(2,WAYS)\t\t!Now list the allowed adjacencies.\n      PARAMETER (WAY = (/1,0, 0,1, -1,0, 0,-1/))\t!W(1,1), W(2,1), W(1,2), W(2,2), W(1,3), ...\n      INTEGER M,MOVE(WAYS),LOCM(2,WAYS)\t!Move possibilities.\n      INTEGER SPACE\t\t\t!Document the empty square's code number.\n      PARAMETER (SPACE = 0)\t\t!Zero will do.\n      INTEGER I,IT,PARITY,TRY\t\t!Odds and ends.\n      REAL VALUE\t\t\t!Humph. Yet another interface to a \"random\" number generator.\n      COMMON/IODEV/ MSG,KBD\t!Pass the word.\n\n      KBD = 5\t!Standard input. (Keyboard -> Display screen)\n      MSG = 6\t!Standard output. (Display screen)\n      WRITE (MSG,1) NR,NC\t!Announce.\n    1 FORMAT (\"To play 'slide-square' with \",I0,\" rows and \",\n     1 I0,\" columns.\",/,\"The game is to slide a square into the space\",/\n     2 \"(thus leaving a space behind) until you attain\"/\n     3 \"the nice orderly layout as follows:\",/)\nConcoct a board layout.\n   10 FOR ALL (I = 1:N - 1) BORED(I) = I\t!Prepare the board. Definitely unique values.\n      BORED(N) = SPACE\t        !The empty square is not at the start! Oh well.\n      CALL SHOW(NR,NC,BOARD)\t!Reveal the nice layout.\n   11 DO I = 1,N - 1\t\t!Now shuffle the squares a bit.\n        CALL RANDOM(VALUE)\t\t!0 <= VALUE < 1.\n        IT = VALUE*(N - 1) + 1\t\t!1 <= IT < N. Don't round up!\n        IF (I.NE.IT) CALL SWAP(BORED(I),BORED(IT))\t!Whee!\n      END DO\t\t\t!On to the next victim, leaving the last cell alone.\nCalculate the parity, knowing the space is at the end. The target state has even parity, with zero inversions.\n      PARITY = 0\t!There are two classes of arrangements, that can't mix.\n      DO I = 1,N - 2\t!Skipping the blank cell still at BORED(N).\n        PARITY = PARITY + COUNT(BORED(I) > BORED(I + 1:N - 1))\t!For each square,\n      END DO\t\t!Count the inversions following.\n      IF (MOD(PARITY,2).NE.0) GO TO 11\t!No transition can change the parity, so, try for another arrangement.\nChoose a new position for the space. Using approved moves will not change the parity.\n      CALL RANDOM(VALUE)\t\t!0 <= VALUE < 1.\n      ZC = VALUE*(NC - 2) + 1\t\t!1 <= ZC < NC: Choose a random column other than the last.\n      BOARD(ZC + 1:NC,NR) = BOARD(ZC:NC - 1,NR)\t!Shift the end of the last row back one place.\n      BOARD(ZC,NR) = SPACE\t\t\t!Put the space in the hole.\n      CALL RANDOM(VALUE)\t\t\t!So the parity doesn't change.\n      ZR = VALUE*(NR - 2) + 1\t\t!1 <= ZR < NR: Choose a random row, other than the last.\n      BOARD(ZC,ZR + 1:NR) = BOARD(ZC,ZR:NR - 1)\t!Shift the end of column ZC up one.\n      BOARD(ZC,ZR) = SPACE\t\t\t!Revive the space again.\nCast forth the starting position.\n      WRITE (MSG,12)\t\t!Announce the result.\n   12 FORMAT (/,\"But, your board looks like this...\")\t!Alas. Almost certainly not in order.\n      CALL SHOW(NR,NC,BOARD)\t!Just so.\n      TRY = 0\t\t!No moves made yet.\n\nConsider possible moves.\n   20 TRY = TRY + 1\t!Here we go again.\n      M = 0\t\t!No moveable pieces are known.\n      DO I = 1,WAYS\t!So scan the possible ways away from LOCZ.\n        LOCI = LOCZ + WAY(1:2,I)\t!Finger an adjacent location, via the adjacency offsets in array WAY.\n        IF (ALL(LOCI > 0) .AND. ALL(LOCI <= (/NC,NR/))) THEN\t!Within bounds?\n          M = M + 1\t\t\t!Yes. We have a candidate.\n          MOVE(M) = BOARD(IC,IR)\t!Record the piece's name.\n          LOCM(:,M) = LOCI\t\t!And, remember where it is...\n        END IF\t\t\t!So much for that location.\n      END DO\t\t!Try another offset.\n   21 WRITE (MSG,22,ADVANCE=\"no\") MOVE(1:M)\t!Two-stage output.\n   22 FORMAT (\"Moveable pieces: \",<WAYS>(I0:\",\"))\t!Since M is not necessarily WAYS, a trailing $ may not be reached..\n      WRITE (MSG,23)\t\t!Now for the question. Always at least two moveable squares.\n   23 FORMAT(\". Choose one: \",$)\t!Continue the line, presuming screen and keyboard->screen.\n      READ (KBD,*) IT\t\t!Now request the answer. Rather doggedly: blank lines won't do.\n      DO I = M,1,-1\t\t!There are at least two possible moves.\n        IF (MOVE(I) .EQ. IT) EXIT\t!Perhaps this piece was selected.\n      END DO\t\t\t!The INDEX function is alas, only for CHARACTER variables. Grr.\n      IF (I .LE. 0) THEN\t!I'm suspicious.\n        WRITE (MSG,*) \"Huh? That is not a moveable piece!\"\t!Justified!\n        IF (IT.GT.0) GO TO 21\t\t!Try again.\n        STOP \"Oh well.\"\t\t\t!Or quit, on negative vibrations.\n      END IF\t\t\t!So much for selecting a piece.\nComplete the selected move.\n   30 BOARD(ZC,ZR) = IT\t\t!Place the named piece where the space was.\n      LOCZ = LOCM(:,I)\t\t!The space is now where that piece came from.\n      BOARD(ZC,ZR) = SPACE\t\t!And now holds a space.\nc      write (6,*)\nc     1 \"disorder=\",COUNT(BORED(1:N - 2) + 1 .NE. BORED(2:N - 1))\n      IF (TRY.LE.6) WRITE (MSG,31)\t!Set off with a nice heading.\n   31 FORMAT (/\"The new layout...\")\t!Just for clarity.\n      CALL SHOW(NR,NC,BOARD)\t\t!Perhaps it will be good.\nCheck for success.\n      IF (BORED(N).NE.SPACE) GO TO 20\t!Is the space at the end?\n      IF (ANY(BORED(1:N - 2) + 1 .NE. BORED(2:N - 1))) GO TO 20\t!Are we there yet?\n      WRITE (MSG,*) TRY,\"Steps to success!\"\t!Yes!\n      END\t!That was fun.\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_45.txt",
        "content": "To play 'slide-square' with 4 rows and 4 columns.\nThe game is to slide a square into the space\n(thus leaving a space behind) until you attain\nthe nice orderly layout as follows:\n\nRow|__1__2__3__4\n  1|  1  2  3  4\n  2|  5  6  7  8\n  3|  9 10 11 12\n  4| 13 14 15  0\n\nBut, your board looks like this...\nRow|__1__2__3__4\n  1| 15  0 14 11\n  2|  8 13  5  3\n  3|  4  1  7  9\n  4| 10  6  2 12\nMoveable pieces: 14,13,15. Choose one: 15\n\nThe new layout...\nRow|__1__2__3__4\n  1|  0 15 14 11\n  2|  8 13  5  3\n  3|  4  1  7  9\n  4| 10  6  2 12\nMoveable pieces: 15,8. Choose one:\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_46.txt",
        "content": "sub drawboard( B() as ubyte )\n    dim as string outstr = \"\"\n    for i as ubyte = 0 to 15\n        if B(i) = 0 then \n            outstr = outstr + \" XX \"\n        elseif B(i) < 10 then\n            outstr = outstr + \"  \"+str(B(i))+\" \"\n        else\n            outstr = outstr + \" \" +str(B(i))+\" \"\n        end if\n        if i mod 4 = 3 then \n            print outstr\n            print\n            outstr = \"\"\n        end if\n    next i\n    print\nend sub\n\nfunction move( B() as ubyte, byref gap as ubyte, direction as ubyte ) as ubyte\n    dim as integer targ = gap\n    select case direction\n        case 1  'UP\n            targ = gap - 4\n        case 2  'RIGHT\n            if gap mod 4 = 3 then return gap\n            targ = gap + 1\n        case 3  'DOWN\n            targ = gap + 4\n        case 4\n            if gap mod 4 = 0 then return gap\n            targ = gap - 1\n        case else\n            return gap\n    end select\n    if targ > 15 or targ < 0 then return gap\n    swap B(targ), B(gap)\n    return targ\nend function\n\nsub shuffle( B() as ubyte, byref gap as ubyte )\n    for i as ubyte = 0 to 100\n        gap = move(B(), gap, int(rnd*4) + 1)\n    next i\nend sub\n\nfunction solved( B() as ubyte ) as boolean\n    dim as integer i\n    for i = 0 to 14\n        if B(i)>B(i+1) then return false\n    next i\n    return true\nend function\n\ndim as ubyte i, B(15), direction, gap\nfor i = 0 to 15\n    B(i) = i\nnext i\nshuffle B(), gap\n\n\nwhile not solved( B() )\n    cls\n    drawboard B()\n    print gap\n    print \"1 = up, 2=right, 3=down, 4=left\"\n    input direction\n    gap = move( B(), gap, direction )\nwend\n\ncls\nprint \"Congratulations! You win!\"\nprint\ndrawboard B()\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_47.txt",
        "content": "// 15 Puzzle // 26 september 2023 //\n\nbegin globals\nCFMutableStringRef board\u00a0: board = fn MutableStringNew\nend globals\n\n\nvoid local fn buildUI\n  Long i, j, k = 1 // k is button number\n  window 1, @\"15 Puzzle\", ( 0, 0, 200, 200 ), 3\n  for j = 3 to 0 step -1\u00a0: for i = 0 to 3 // Top to bottom, left to right\n    button k, Yes, 1, @\"\",  ( 20 + 40 * i, 20 + 40 * j , 40, 40 ), , NSBezelStyleShadowlessSquare\n    ControlSetFont(k, fn FontSystemFontOfSize( 21 ) )\n    ControlSetAlignment( k, NSTextAlignmentCenter )\n    k ++\n  next\u00a0: next\n  menu 1, , 1, @\"File\": menu 1, 1, , @\"Close\", @\"w\"\u00a0: MenuItemSetAction( 1, 1, @\"performClose:\" )\n  editmenu 2\u00a0: menu 2, 0, No\u00a0: menu 3, , , @\"Level\"\n  for i = 1 to 8\u00a0: menu 3, i, , str( i )\u00a0: next\n  MenuSetOneItemOnState( 3, 3 )\nend fn\n\n\nvoid local fn newGame\n  CFStringRef s\n  Long i, m, n = 16, p = 0 // n is empty starting tile, p holds previous move\n  Bool ok\n  MutableStringSetString (board, @\" 123456789ABCDEF \" )\n  for i = 1 to fn MenuSelectedItem( 3 )^2 // Number of shuffles is square of level\n    do\u00a0: ok = Yes\n      m = n + int( 2.6 * rnd( 4 ) - 6.5 )       // Choose a random move, but\n      if m < 1 or m > 16 or m == p then ok = No // not of bounds or previous,\n      if n mod 4 = 0 and m = n + 1 then ok = No // and don't exchange eg tile 4 and 5\n      if n mod 4 = 1 and m = n - 1 then ok = No // or 9 and 8\n    until ok = Yes // Found a move, swap in board string\n    s = mid( board, m, 1 )\u00a0: mid( board, m, 1 ) = @\" \"\u00a0: mid( board, n, 1 ) = s\n    p = n\u00a0: n = m\n  next\n  for i = 1 to 16 // Stamp the buttons, p is unicode of board char, s is button title\n    p = (Long) fn StringCharacterAtIndex( board, i )\n    if p > 64 then s = fn StringWithFormat ( @\"%d\", p - 55 ) else s = mid( board, i, 1 )\n    button i, Yes, 1, s\n    if fn StringIsEqual( s, @\" \") == Yes then button i, No\n  next\nend fn\n\n\nvoid local fn move ( n as Long )\n  CFStringRef s\n  Long i, m, x = -1 // x is empty plot\n  Bool ok\n  for i = 1 to 4 // see if clicked button is next to empty plot\n    m = n + int( 2.6 * i - 6.5 ) // -4. -1, +1, +4\n    ok = Yes\n    if m < 1 or m > 16 then ok = No // Not out of bounds etc\n    if n mod 4 = 0 and m = n + 1 then ok = No\n    if n mod 4 = 1 and m = n - 1 then ok = No\n    if ok == Yes\n      if fn StringIsEqual( mid( board, m, 1 ), @\" \" ) then x = m\n    end if    \n  next\n  if x > -1 // Swap places in board string and button titles\n    s = mid( board, n, 1 )\u00a0: mid( board, n, 1 ) = @\" \"\u00a0: mid( board, x, 1 ) = s\n    button x, Yes, 1 , fn ButtonTitle( n )\u00a0: button n, No, 1, @\" \"\n  end if\n  if fn StringIsEqual( board, @\" 123456789ABCDEF \" )\n    alert 112, , @\"Well done.\", @\"Another game?\", @\"Yes;No\", Yes\n  end if\nend fn\n\n\nvoid local fn doMenu( mnu as Long, itm as Long )\n  if mnu == 3 then MenuSetOneItemOnState( 3, itm )\u00a0: fn newGame\nend fn\n\n\nvoid local fn DoDialog( evt as Long, tag as Long )\n  select evt\n    case _btnClick\u00a0: fn move( tag )\n    case _alertDidEnd\u00a0: if tag == NSAlertFirstButtonReturn then fn newGame else end\n  end select\nend fn\n\nfn buildUI\nfn newGame\n\non dialog fn doDialog\non menu fn doMenu\nhandleevents",
        "safe": true
    },
    {
        "filename": "15 puzzle game_48.txt",
        "content": "'Charlie Ogier (C) 15PuzzleGame 24/04/2017 V0.1.0 Licenced under MIT\n'Inspiration came from: -\n''http://rosettacode.org/wiki/15_Puzzle_Game\n''Bugs or comments to bugs@cogier.com\n'Written in Gambas 3.9.2 - Updated on the Gambas Farm 01/05/2017\n'Updated so that the message and the Title show the same amount of moves 01/06/2017\n'Form now expandable. Font height automated. Form size and position saved 06/06/2107\n\n'Simulate playing the 15 - game(puzzle)         Yes in GUI\n'Generate a random start position               Yes\n'Prompt the user for which piece To move        No\n'Validate if the move is legal(possible)        Yes\n'Display the game(puzzle) as pieces are moved   Yes in GUI\n'Announce when the puzzle is solved             Yes\n'Possibly keep track of the number of moves     Yes\n\nbyPos As New Byte[]                                             'Stores the position of the 'Tiles'\nsiMoves As Short                                                'Stores the amount of moves\nhTimer As Timer                                                 'Timer\ndTimerStart As Date                                             'Stores the start time \ndTimerDiff As Date                                              'Stores the time from the start to now\nbTimerOn As Boolean                                             'To know if the Timer is running\n\nPublic Sub Form_Open()                                          'Form opens\n\nSettings.read(Me, \"Window\")                                     'Get details of the last window position and size\nWith Me                                                         'With the Form..\n  .Padding = 5                                                  'Pad the edges\n  .Arrangement = Arrange.Row                                    'Arrange the Form\n  .Title = \"15PuzzleGame v0.3.0\"                                'Set the Form Title\nEnd With\n\nBuildForm                                                       'Go to the BuildForm routine\n\nEnd\n\nPublic Sub BuildForm()                                          'To add items to the Form\nDim hButton As Button                                           'We need some Buttons\nDim byRand, byTest As Byte                                      'Various variables\nDim bOK As Boolean                                              'Used to stop duplicate numbers being added\nDim bSolvable As Boolean\n\nRepeat                                                          'Repeat until the puzzle is solvable    \n  Do                                                            'Start of a Do loop to create 0 to 15 in random order\n    byRand = Rand(0, 15)                                        'Get a random number between 0 and 15\n    If byRand = 0 Then byRand = 99                              'Change 0 to 99 for the Blank space\n    bOK = True                                                  'Set bOK to True\n    For Each byTest In byPos                                    'For each number stored in the array byPos\n      If byRand = byTest Then bOK = False                       'Check to see if it already exists, if it does set bOK to False\n    Next\n    If bOK Then byPos.Add(byRand)                               'If not a duplicate then add it to the array\n    If byPos.max = 15 Then Break                                'Once the array has 16 numbers get out of here. 99 is used for the blank space\n  Loop\n  bSolvable = IsItSolvable()                                    'Go to the 'check if puzzle is solvable' routine\n  If Not bSolvable Then byPos.clear                             'If it's not solvable then clear byPos\nUntil bSolvable = True                                          'Repeat until the puzzle is solvable\n\nFor byRand = 0 To 15                                            'Loop\n  If byPos[byRand] = 99 Then                                    'Check if value is 99 as this is where the blank space will go\n    AddPanel                                                    'Go to the AddPanel routine to add the blank space\n    Continue                                                    'Skip to the end of the loop\n  Endif\n  hButton = New Button(Me) As \"AllButtons\"                      'Add a new button to the Form, all buttons grouped as 'AllButtons'\n  With hButton                                                  'With the following properties\n    .Text = Str(byPos[byRand])                                  'Add Button text \n    .Tag = Str(byPos[byRand])                                   'Add a Tag\n    .Height = (Me.Height - 10) / 4                              'Set the Button height\n    .Width = (Me.Width - 10) / 4                                'Set the Button width\n    .Font.Bold = True                                           'Set the font to Bold\n    .Font.Size = 16                                             'Set Font size\n  End With\nNext\n\nAddTimer                                                        'Go to the AddTimer routine\n\nEnd\n\n\nPublic Sub AddPanel()                                           'Routine to add an invisible panel that is the blank area\nDim hPanel As Panel                                             'We need a Panel\n\nHPanel = New Panel(Me)                                          'Add the Panel to the Form\nWith HPanel                                                     'With the following Properties\n  .Tag = 99                                                     'Set a Tag to 99\n  .Height = (Me.Height - 10) / 4                                'Set the height\n  .Width = (Me.Width - 10) / 4                                  'Set the width\nEnd With\n\nEnd\n\nPublic Sub AddTimer()                                           'To add a Timer\n\nhTimer = New Timer As \"MyTimer\"                                 'Add a Timer\nhTimer.Delay = 1000                                             'Set the timer delay \n\nEnd\n\nPublic Sub MyTimer_Timer()                                      'Timer\n\nMe.Title = siMoves & \" Moves \"                                  'Set the Form Title to show the amount of moves taken\n\nIf dTimerStart Then                                             'If a start time has been set then\n  dTimerDiff = Time(Now) - dTimerStart                          'Calculate the time difference between StartTime and Now\n  Me.Title &= \" - \" & Str(dTimerDiff)                           'Add the time taken to the Form Title\nEnd If\n\nEnd\n\nPublic Sub AllButtons_Click()                                   'What to do when a Button is clicked\nDim byLast As Byte = Last.Tag                                   'Get the Tag of the Button clicked\nDim byTemp, byCount As Byte                                     'Various variables\nDim byCheck As Byte[] = [88, 88, 88, 88]                        'Used for checking for the blank space\nDim byWChgeck As New Byte[16, 4]\nDim oObj As Object                                              'We need to enumerate Objects\n\nFor Each oObj In Me.Children                                    'For each Object (Buttons in this case) that are Children of the Form..\n  If oObj.Tag = byLast Then Break                               'If the Tag of the Button matches then we know the position of the Button on the form so get out of here\n  Inc byCount                                                   'Increase the value of byCount\nNext\n\nSelect Case byCount                                             'Depending on the position of the Button\n  Case 0                                                        'e.g 0 then we need to check positions 1 & 4 for the blank\n    byCheck[0] = 1\n    byCheck[1] = 4\n  Case 1\n    byCheck[0] = 0\n    byCheck[1] = 2\n    byCheck[2] = 5\n  Case 2\n    byCheck[0] = 1\n    byCheck[1] = 3\n    byCheck[2] = 6\n  Case 3\n    byCheck[0] = 2\n    byCheck[1] = 7\n  Case 4\n    byCheck[0] = 0\n    byCheck[1] = 5\n    byCheck[2] = 8\n  Case 5                                                        'e.g 5 then we need to check positions 1, 4, 6 & 9 for the blank\n    byCheck[0] = 1\n    byCheck[1] = 4\n    byCheck[2] = 6\n    byCheck[3] = 9\n  Case 6\n    byCheck[0] = 2\n    byCheck[1] = 5\n    byCheck[2] = 7\n    byCheck[3] = 10\n  Case 7\n    byCheck[0] = 3\n    byCheck[1] = 6\n    byCheck[2] = 11\n  Case 8\n    byCheck[0] = 4\n    byCheck[1] = 9\n    byCheck[2] = 12\n  Case 9\n    byCheck[0] = 5\n    byCheck[1] = 8\n    byCheck[2] = 10\n    byCheck[3] = 13\n  Case 10\n    byCheck[0] = 6\n    byCheck[1] = 9\n    byCheck[2] = 11\n    byCheck[3] = 14\n  Case 11\n    byCheck[0] = 7\n    byCheck[1] = 10\n    byCheck[2] = 15\n  Case 12\n    byCheck[0] = 8\n    byCheck[1] = 13\n  Case 13\n    byCheck[0] = 9\n    byCheck[1] = 12\n    byCheck[2] = 14\n  Case 14\n    byCheck[0] = 10\n    byCheck[1] = 13\n    byCheck[2] = 15\n  Case 15\n    byCheck[0] = 11\n    byCheck[1] = 14\nEnd Select\n\nFor Each byTemp In byCheck                                      'For each value in byCheck\n  If byTemp = 88 Then Break                                     'If byTemp = 88 then get out of here\n  If byPos[byTemp] = 99 Then                                    'If the position checked is 99 (the blank) then..\n    byPos[byTemp] = Last.Text                                   'Set the new position of the Tile in byPos\n    byPos[byCount] = 99                                         'Set the existing Tile position to = 99 (blank)\n    Inc siMoves                                                 'Inc the amount of moves made\n    If Not bTimerOn Then                                        'If the Timer is now needed then \n      dTimerStart = Time(Now)                                   'Set the Start time to NOW\n      hTimer.start                                              'Start the Timer\n      bTimerOn = True                                           'Set bTimerOn to True \n    Endif\n    Break                                                       'Get out of here\n  End If\nNext\n\nRebuildForm                                                     'Go to the RebuilForm routine\nCheckIfPuzzleCompleted                                          'Check to see if the puzzle has been solved\n\nEnd\n\nPublic Sub CheckIfPuzzleCompleted()                             'Is the puzzle is complete\nDim byTest As Byte[] = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 99] 'byPos will equal this if it is completed\nDim siCount As Short                                            'Counter\nDim bCompleted As Boolean = True                                'Completed?\nDim sMessage As String                                          'String to store the display message\n\nFor siCount = 0 To 15                                           'Loop through the byPos\n  If byPos[siCount] <> byTest[siCount] Then                     'If the position does not match the completed position then..\n    bCompleted = False                                          'Set bCompleted to False\n    Break                                                       'Get out of here\n  Endif\nNext\n\nIf bCompleted Then                                              'If the puzzle is completed then\n  hTimer.Stop                                                   'Stop the timer\n  Me.Title = siMoves & \" Moves \"                                'Set the Form Title to show the amount of moves taken\n  sMessage = \"Congratulations!!\\n\"                              'Build sMessage\n  sMessage &= Str(siMoves) & \" Moves\\n\"                         'Build sMessage\n  sMessage &= \"Time = \" & Str(dTimerDiff)                       'Build sMessage\n  Message(sMessage, \"OK\")                                       'Put up a congratulatory message\n  Me.Close                                                      'Close the form\nEndif\n\nEnd\n\nPublic Sub RebuildForm()                                        'To clear the Form and rebuild with the Tiles in the new postion\nDim hButton As Button                                           'We need Buttons\nDim byCount, byTemp As Byte                                     'Various variables\nDim siFontH As Short\n\nMe.Children.clear                                               'Clear the Form of all Objects\n\nFor Each byTemp In byPos                                        'For each 'Position'\n  If byTemp = 99 Then                                           'If the Position's value is 99 then it's the space\n    AddPanel                                                    'Go to the AddPanel routine\n  Else                                                          'If the Position's value is NOT 99 then \n    hButton = New Button(Me) As \"AllButtons\"                    'Create a new Button\n  With hButton                                                  'With the following properties\n    .Text = Str(byPos[byCount])                                 'Text as stored in byPos\n    .Tag = Str(byPos[byCount])                                  'Tag as stored in byPos\n    .Height = (Me.Height - 10) / 4                              'Set the Button height\n    .Width = (Me.Width - 10) / 4                                'Set the Button width\n    .Font.Bold = True                                           'Set the Font to Bold\n      End With\n    If Me.Width > Me.Height Then                                'If Form Width is greater than Form Width then..\n      siFontH = Me.Height                                       'siFontH = Form Height\n    Else                                                        'Else..\n      siFontH = Me.Width                                        'siFontH = Form Width\n    End If\n  hButton.Font.size = siFontH / 16                              'Set Font height\n  Endif\n  \n  Inc byCount                                                   'Increase counter\nNext\n\nEnd\n\nPublic Sub Form_Resize()                                        'If the form is resized\n\nRebuildForm                                                     'Rebuild the Form\n\nEnd\n\nPublic Sub IsItSolvable() As Boolean                            'To check if the puzzle is solvable\nDim bSolvable, bBlankOnEven As Boolean                          'Triggers\nDim siCount0, siCount1, siInversion As Short                    'Counters\n\nFor siCount0 = 0 To byPos.Max                                   'Loop through the positions\n  If byPos[siCount0] = 99 Then                                  'The blank\n    If InStr(\"0,1,2,3,8,9,10,11,\", Str(siCount0 & \",\")) Then    'Is the blank on an even row (counting from the bottom) if so..\n      bBlankOnEven = True                                       'bBlankOnEven = True\n    End If\n    Continue                                                    'Go to the end of the loop\n  End If\n  For siCount1 = siCount0 + 1 To byPos.Max                      'Loop through the positions \n    If byPos[siCount0] > byPos[siCount1] Then Inc siInversion   'Counts the inversions\n  Next                                                          'See https://www.cs.bham.ac.uk/~mdr/teaching/modules04/java2/TilesSolvability.html\nNext\n\nIf bBlankOnEven And Odd(siInversion) Then bSolvable = True      'Blank is on an even row (counting from the bottom) then the number of inversions in a solvable situation is odd\nIf Not bBlankOnEven And Even(siInversion) Then bSolvable = True 'Blank is on an odd row (counting from the bottom) then the number of inversions in a solvable situation is even\n\nReturn bSolvable                                                'Return the value\n\nEnd\n\nPublic Sub Form_Close()\n\nSettings.Write(Me, \"Window\")                                    'Store the window position and size\n\nEnd\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_49.txt",
        "content": "package main\n\nimport (\n\t\"fmt\"\n\t\"math/rand\"\n\t\"strings\"\n\t\"time\"\n)\n\nfunc main() {\n\trand.Seed(time.Now().UnixNano())\n\tp := newPuzzle()\n\tp.play()\n}\n\ntype board [16]cell\ntype cell uint8\ntype move uint8\n\nconst (\n\tup move = iota\n\tdown\n\tright\n\tleft\n)\n\nfunc randMove() move { return move(rand.Intn(4)) }\n\nvar solvedBoard = board{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 0}\n\nfunc (b *board) String() string {\n\tvar buf strings.Builder\n\tfor i, c := range b {\n\t\tif c == 0 {\n\t\t\tbuf.WriteString(\"  .\")\n\t\t} else {\n\t\t\t_, _ = fmt.Fprintf(&buf, \"%3d\", c)\n\t\t}\n\t\tif i%4 == 3 {\n\t\t\tbuf.WriteString(\"\\n\")\n\t\t}\n\t}\n\treturn buf.String()\n}\n\ntype puzzle struct {\n\tboard board\n\tempty int // board[empty] == 0\n\tmoves int\n\tquit  bool\n}\n\nfunc newPuzzle() *puzzle {\n\tp := &puzzle{\n\t\tboard: solvedBoard,\n\t\tempty: 15,\n\t}\n\t// Could make this configurable, 10==easy, 50==normal, 100==hard\n\tp.shuffle(50)\n\treturn p\n}\n\nfunc (p *puzzle) shuffle(moves int) {\n\t// As with other Rosetta solutions, we use some number\n\t// of random moves to \"shuffle\" the board.\n\tfor i := 0; i < moves || p.board == solvedBoard; {\n\t\tif p.doMove(randMove()) {\n\t\t\ti++\n\t\t}\n\t}\n}\n\nfunc (p *puzzle) isValidMove(m move) (newIndex int, ok bool) {\n\tswitch m {\n\tcase up:\n\t\treturn p.empty - 4, p.empty/4 > 0\n\tcase down:\n\t\treturn p.empty + 4, p.empty/4 < 3\n\tcase right:\n\t\treturn p.empty + 1, p.empty%4 < 3\n\tcase left:\n\t\treturn p.empty - 1, p.empty%4 > 0\n\tdefault:\n\t\tpanic(\"not reached\")\n\t}\n}\n\nfunc (p *puzzle) doMove(m move) bool {\n\ti := p.empty\n\tj, ok := p.isValidMove(m)\n\tif ok {\n\t\tp.board[i], p.board[j] = p.board[j], p.board[i]\n\t\tp.empty = j\n\t\tp.moves++\n\t}\n\treturn ok\n}\n\nfunc (p *puzzle) play() {\n\tfmt.Printf(\"Starting board:\")\n\tfor p.board != solvedBoard && !p.quit {\n\t\tfmt.Printf(\"\\n%v\\n\", &p.board)\n\t\tp.playOneMove()\n\t}\n\tif p.board == solvedBoard {\n\t\tfmt.Printf(\"You solved the puzzle in %d moves.\\n\", p.moves)\n\t}\n}\n\nfunc (p *puzzle) playOneMove() {\n\tfor {\n\t\tfmt.Printf(\"Enter move #%d (U, D, L, R, or Q): \", p.moves+1)\n\t\tvar s string\n\t\tif n, err := fmt.Scanln(&s); err != nil || n != 1 {\n\t\t\tcontinue\n\t\t}\n\n\t\ts = strings.TrimSpace(s)\n\t\tif s == \"\" {\n\t\t\tcontinue\n\t\t}\n\n\t\tvar m move\n\t\tswitch s[0] {\n\t\tcase 'U', 'u':\n\t\t\tm = up\n\t\tcase 'D', 'd':\n\t\t\tm = down\n\t\tcase 'L', 'l':\n\t\t\tm = left\n\t\tcase 'R', 'r':\n\t\t\tm = right\n\t\tcase 'Q', 'q':\n\t\t\tfmt.Printf(\"Quiting after %d moves.\\n\", p.moves)\n\t\t\tp.quit = true\n\t\t\treturn\n\t\tdefault:\n\t\t\tfmt.Println(`\nPlease enter \"U\", \"D\", \"L\", or \"R\" to move the empty cell\nup, down, left, or right. You can also enter \"Q\" to quit.\nUpper or lowercase is accepted and only the first non-blank\ncharacter is important (i.e. you may enter \"up\" if you like).\n`)\n\t\t\tcontinue\n\t\t}\n\n\t\tif !p.doMove(m) {\n\t\t\tfmt.Println(\"That is not a valid move at the moment.\")\n\t\t\tcontinue\n\t\t}\n\n\t\treturn\n\t}\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_5.txt",
        "content": "generic\n   Rows, Cols: Positive;\n   with function Name(N: Natural) return String; -- with Pre => (N < Rows*Cols);\n   -- Name(0) shall return the name for the empty tile\npackage Generic_Puzzle is\n\n   subtype Row_Type is Positive range 1 .. Rows;\n   subtype Col_Type is Positive range 1 .. Cols;\n   type Moves is (Up, Down, Left, Right);\n   type Move_Arr is array(Moves) of Boolean;\n   \n   function Get_Point(Row: Row_Type; Col: Col_Type) return String;\n   function Possible return Move_Arr;\n   procedure Move(The_Move: Moves);\n\nend Generic_Puzzle;\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_50.txt",
        "content": "#include \"inkey.ch\"\n#include \"Box.ch\"\n\n\nprocedure Main()\n    // console init\n    SET SCOREBOARD OFF\n    SetMode(30,80) \n    ret\u00a0:= 0\n\n    // main loop\n    yn\u00a0:= .F.  \n    DO WHILE yn == .F.\n        // draw console\n        cls\n        @ 0, 0 TO MaxRow(), MaxCol() DOUBLE\n        SetColor(\"BG+/B,W/N\")\n        @ 0, 4 SAY \"  Slidng puzzle game  \"\n        SetColor()\n\n        // input size of grid\n        tam\u00a0:= 0           \n        @ MaxRow() - 2, 4 SAY \"Size of grid: \" GET tam PICTURE \"9\"\n        READ \n\n        // Initialize numbers\n        lista\u00a0:= ARRAY (tam * tam)\n        FOR z\u00a0:= 1 TO tam * tam\n            lista[z]\u00a0:= z\n        NEXT\n        lista1\u00a0:= lista\n        grid\u00a0:= ARRAY (tam,tam)\n\n        // populate grid with numbers\n        FOR i\u00a0:= 1 TO tam \n            FOR j\u00a0:= 1 TO tam \n                grid[i,j]\u00a0:= lista1[ (i-1) * tam + j] \n            NEXT \n        NEXT\n        Mostra(@grid)\n        InKey(0)\n\n        // initialize the game\n        n\u00a0:= 0\n        t\u00a0:= 0\n        lista\u00a0:= lista1     // lista for scrambling, lista1 preserve numbers in order\n        DO WHILE .T.\n            // scrambling numbers\n            FOR i\u00a0:= 1 TO tam*tam\n                n\u00a0:= Int ( ft_Rand1(tam * tam - 1) + 1 )\n                t\u00a0:= lista[n]\n                lista[n]\u00a0:= lista[i]\n                lista[i]\u00a0:= t\n            NEXT\n            // have solution?\n            possp\u00a0:= 0\n            invct\u00a0:= 0  // change counter\n            FOR i\u00a0:= 1 TO tam * tam -1\n                IF lista[i]\u00a0!= tam*tam \n                    FOR j\u00a0:= i + 1 TO tam * tam \n                        IF lista[j]\u00a0!= tam*tam\n                            IF lista[i] > lista[j]\n                                invct++ \n                            ENDIF \n                        ENDIF\n                    NEXT\n                ELSE\n                    possp\u00a0:= i\n                ENDIF\n            NEXT\n            linv\u00a0:= If( ( (invct\u00a0% 2) == 0 ), .T., .F.)\n            lkin\u00a0:= If( ( (tam - Int( (possp -1) / tam ))\u00a0% 2) == 0, .T., .F. )\n            \n            IF ( (tam\u00a0% 2)\u00a0!= 0)    // if grid size is odd\n                IF linv                 // if number of positions changes is even, solvable\n                    EXIT\n                ELSE \n                    LOOP                // if is odd, not solvable, scramble more\n                ENDIF               // if grid size is even\n            ELSE                    \n                                        // If changes is even and space position is in odd line\n                                        // or changes is odd and space position is in even line\n                                        // (XOR condition) is solvable \n                IF (linv .AND. !lkin) .OR. (!linv .AND. lkin) // XOR\u00a0!!! \n                    EXIT\n                ElSE                    // else scramble more\n                    LOOP    \n                ENDIF\n            ENDIF\n\n        ENDDO\n\n        // populate the grid with scrambled numbers\n        FOR i\u00a0:= 1 TO tam \n            FOR j\u00a0:= 1 TO tam \n                grid[i,j]\u00a0:= lista[ (i-1) * tam + j] \n            NEXT \n        NEXT\n        ret\u00a0:= Mostra(@grid)\n\n    // play\n        key\u00a0:= 0\n        DO WHILE LastKey()\u00a0!= K_ESC\n            key\u00a0:= 0 \n            // find the space coords\n            xe\u00a0:= 0\n            ye\u00a0:= 0\n            lv\u00a0:= tam*tam\n            FOR i\u00a0:= 1 TO tam \n                FOR j\u00a0:= 1 TO tam \n                    IF grid[i,j] == lv \n                        xe\u00a0:=i\n                        ye\u00a0:=j\n                    ENDIF\n                NEXT\n            NEXT\n            // the direction keys\n            key\u00a0:= inkey(0)\n            DO CASE \n                CASE key == K_UP\n                    IF xe > 1\n                        grid[xe,ye]\u00a0:= grid[xe-1,ye]\n                        grid[xe-1,ye]\u00a0:= lv\n                    ENDIF\n                    ret\u00a0:= Mostra(@grid)            \n                CASE key == K_DOWN\n                    IF xe < tam\n                        grid[xe,ye]\u00a0:= grid[xe+1,ye]\n                        grid[xe+1,ye]\u00a0:= lv\n                    ENDIF\n                    ret\u00a0:= Mostra(@grid)   \n                CASE key == K_LEFT\n                    IF ye > 1\n                        grid[xe,ye]\u00a0:= grid[xe,ye-1]\n                        grid[xe,ye-1]\u00a0:= lv\n                    ENDIF\n                    ret\u00a0:= Mostra(@grid)   \n                CASE key == K_RIGHT\n                    IF ye < tam\n                        grid[xe,ye]\u00a0:= grid[xe,ye+1]\n                        grid[xe,ye+1]\u00a0:= lv\n                    ENDIF\n                    ret\u00a0:= Mostra(@grid)   \n            ENDCASE  \n            IF ret == tam*tam-1                             // ret is qtty numbers in position\n                @ MaxRow() - 3, 4 SAY \"Fim de jogo!\"        // if ret == (size*size) -1\n                key\u00a0:= K_ESC                                // all numbers in position\n                EXIT                                        // game solved\n            ENDIF\n        ENDDO\n        @ MaxRow() - 2, 4 SAY \"Deseja sair? (yn): \" GET yn PICTURE \"Y\"\n        READ \n        @ MaxRow() - 3, 4 SAY \"              \"\n    ENDDO\nreturn NIL\n\nFUNCTION Mostra(grid)\n    // Show the gris\n    fim\u00a0:= 0                                                    // how many numbers in position?\n    SetColor(\"BG+/B,W/N\") \n    @ 5,10 , 5 + tam * 2, 9 + tam * 4 BOX B_SINGLE + Space(1)\n    i\u00a0:= 0\n    FOR y\u00a0:= 1 TO tam\n        FOR x\u00a0:= 1 TO tam\n            IF grid[x,y] == tam * tam                           // show space\n                SetColor(\" B/GR+, W/N\")\n                @ x*2 + 4, i + 11 SAY \"  \" \n                SetColor(\"BG+/B,W/N\")\n            ELSE \n                IF ( (x-1) * tam + y ) == grid[x,y]             // show number in position\n                    SetColor(\"W/G,W/N\")\n                    @ x*2 + 4, i + 11 SAY grid[x,y] PICTURE \"99\" \n                    fim++\n                ELSE                                            // show number out position\n                    SetColor(\"BG+/B,W/N\")\n                    @ x*2 + 4, i + 11 SAY grid[x,y] PICTURE \"99\"\n                ENDIF\n            ENDIF\n        NEXT\n        i = i + 4\n    NEXT\n    SetColor(\" W/N, BG+/B\")\nRETURN fim",
        "safe": true
    },
    {
        "filename": "15 puzzle game_51.txt",
        "content": "import Data.Array\nimport System.Random\n\ntype Puzzle = Array (Int, Int) Int\n\nmain :: IO ()\nmain = do\n    putStrLn \"Please enter the difficulty level: 0, 1 or 2\"\n    userInput <- getLine\n    let diffLevel = read userInput\n    if userInput == \"\" || any (\\c -> c < '0' || c > '9') userInput || diffLevel > 2 || diffLevel < 0\n        then putStrLn \"That is not a valid difficulty level.\" >> main\n        else shufflePuzzle ([10, 50, 100] !! diffLevel) solvedPuzzle >>= gameLoop\n\ngameLoop :: Puzzle -> IO ()\ngameLoop puzzle\n    | puzzle == solvedPuzzle = putStrLn \"You solved the puzzle!\" >> printPuzzle puzzle\n    | otherwise = do\n    printPuzzle puzzle\n    putStrLn \"Please enter number to move\"\n    userInput <- getLine\n    if any (\\c -> c < '0' || c > '9') userInput\n        then putStrLn \"That is not a valid number.\" >> gameLoop puzzle\n        else let move = read userInput in\n            if move `notElem` validMoves puzzle\n                then putStrLn \"This move is not available.\" >> gameLoop puzzle\n                else gameLoop (applyMove move puzzle)\n\nvalidMoves :: Puzzle -> [Int]\nvalidMoves puzzle = [puzzle ! (row', column') |\n                     row' <- [rowEmpty-1..rowEmpty+1], column' <- [columnEmpty-1..columnEmpty+1],\n                     row' < 4, row' >= 0, column' < 4, column' >= 0,\n                     (row' == rowEmpty) /= (column' == columnEmpty)]\n    where (rowEmpty, columnEmpty) = findIndexOfNumber 16 puzzle\n\napplyMove :: Int -> Puzzle -> Puzzle\napplyMove numberToMove puzzle = puzzle // [(indexToMove, 16), (emptyIndex, numberToMove)]\n    where indexToMove = findIndexOfNumber numberToMove puzzle\n          emptyIndex = findIndexOfNumber 16 puzzle\n\nfindIndexOfNumber :: Int -> Puzzle -> (Int, Int)\nfindIndexOfNumber number puzzle = case filter (\\idx -> number == puzzle ! idx)\n                                              (indices puzzle) of\n                                      [idx] -> idx\n                                      _ -> error \"BUG: number not in puzzle\"\n\nprintPuzzle :: Puzzle -> IO ()\nprintPuzzle puzzle = do\n    putStrLn \"+--+--+--+--+\"\n    putStrLn $ \"|\" ++ formatCell (0, 0) ++ \"|\" ++ formatCell (0, 1) ++ \"|\" ++ formatCell (0, 2) ++ \"|\" ++ formatCell (0, 3) ++ \"|\"\n    putStrLn \"+--+--+--+--+\"\n    putStrLn $ \"|\" ++ formatCell (1, 0) ++ \"|\" ++ formatCell (1, 1) ++ \"|\" ++ formatCell (1, 2) ++ \"|\" ++ formatCell (1, 3) ++ \"|\"\n    putStrLn \"+--+--+--+--+\"\n    putStrLn $ \"|\" ++ formatCell (2, 0) ++ \"|\" ++ formatCell (2, 1) ++ \"|\" ++ formatCell (2, 2) ++ \"|\" ++ formatCell (2, 3) ++ \"|\"\n    putStrLn \"+--+--+--+--+\"\n    putStrLn $ \"|\" ++ formatCell (3, 0) ++ \"|\" ++ formatCell (3, 1) ++ \"|\" ++ formatCell (3, 2) ++ \"|\" ++ formatCell (3, 3) ++ \"|\"\n    putStrLn \"+--+--+--+--+\"\n    where formatCell idx\n              | i == 16 = \"  \"\n              | i > 9 = show i\n              | otherwise = \" \" ++ show i\n              where i = puzzle ! idx\n\nsolvedPuzzle :: Puzzle\nsolvedPuzzle = listArray ((0, 0), (3, 3)) [1..16]\n\nshufflePuzzle :: Int -> Puzzle -> IO Puzzle\nshufflePuzzle 0 puzzle = return puzzle\nshufflePuzzle numOfShuffels puzzle = do\n    let moves = validMoves puzzle\n    randomIndex <- randomRIO (0, length moves - 1)\n    let move = moves !! randomIndex\n    shufflePuzzle (numOfShuffels - 1) (applyMove move puzzle)\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_52.txt",
        "content": "Please enter the difficulty level: 0, 1 or 2\n0\n+--+--+--+--+\n| 1| 6| 2| 4|\n+--+--+--+--+\n| 5|10| 3| 8|\n+--+--+--+--+\n| 9|14| 7|11|\n+--+--+--+--+\n|13|  |15|12|\n+--+--+--+--+\nPlease enter number to move\n14\n+--+--+--+--+\n| 1| 6| 2| 4|\n+--+--+--+--+\n| 5|10| 3| 8|\n+--+--+--+--+\n| 9|  | 7|11|\n+--+--+--+--+\n|13|14|15|12|\n+--+--+--+--+\nPlease enter number to move",
        "safe": true
    },
    {
        "filename": "15 puzzle game_53.txt",
        "content": "require'general/misc/prompt'\n\ngenboard=:3 :0\n  b=. ?~16\n  if. 0<C.!.2 b do.\n    b=. (<0 _1)C. b\n  end.\n  a: (b i.0)} <\"0 b\n)\n\ndone=: (<\"0]1+i.15),a:\n\nshift=: |.!._\"0 2\ntaxi=: |:,/\"2(_1 1 shift i.4 4),_1 1 shift\"0 1/ i.4 4\n\nshowboard=:3 :0\n  echo 'current board:'\n  echo 4 4$y\n)\n\nhelp=:0 :0\n\n  Slide a number block into the empty space\n  until you get:\n\u250c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u2510\n\u25021 \u25022 \u25023 \u25024 \u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u25025 \u25026 \u25027 \u25028 \u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u25029 \u250210\u250211\u250212\u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u250213\u250214\u250215\u2502  \u2502\n\u2514\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2518\n  Or type 'q' to quit.\n)\n\ngetmove=:3 :0\n  showboard y\n  blank=. y i. a:\n  options=. /:~ ;y {~ _ -.~ blank { taxi\n  whilst. -. n e. options do.\n    echo 'Valid moves: ',\":options\n    t=. prompt 'move which number? '\n    if. 'q' e. t do.\n      echo 'giving up'\n      throw.\n    elseif. 'h' e. t do.\n      echo help\n      showboard y\n    end.\n    n=. {._\".t\n  end.\n  (<blank,y i.<n) C. y\n)\n\ngame=: 3 :0\n  echo '15 puzzle'\n  echo 'h for help, q to quit'\n  board=. genboard''\n  whilst. -. done-:board do.\n    board=. getmove board\n  end.\n  showboard board\n  echo 'You win.'\n)\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_54.txt",
        "content": "   game''\n15 puzzle\nh for help, q to quit\ncurrent board:\n\u250c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u2510\n\u25021 \u25022 \u25023 \u25024 \u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u25025 \u25026 \u25027 \u25028 \u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u25029 \u250210\u2502  \u250211\u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u250213\u250214\u250215\u250212\u2502\n\u2514\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2518\nValid moves: 7 10 11 15\nmove which number? 11\ncurrent board:\n\u250c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u2510\n\u25021 \u25022 \u25023 \u25024 \u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u25025 \u25026 \u25027 \u25028 \u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u25029 \u250210\u250211\u2502  \u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u250213\u250214\u250215\u250212\u2502\n\u2514\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2518\nValid moves: 8 11 12\nmove which number? 12\ncurrent board:\n\u250c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u2510\n\u25021 \u25022 \u25023 \u25024 \u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u25025 \u25026 \u25027 \u25028 \u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u25029 \u250210\u250211\u250212\u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u250213\u250214\u250215\u2502  \u2502\n\u2514\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2518\nYou win.\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_55.txt",
        "content": "package fifteenpuzzle;\n\nimport java.awt.*;\nimport java.awt.event.*;\nimport java.util.Random;\nimport javax.swing.*;\n\nclass FifteenPuzzle extends JPanel {\n\n    private final int side = 4;\n    private final int numTiles = side * side - 1;\n\n    private final Random rand = new Random();\n    private final int[] tiles = new int[numTiles + 1];\n    private final int tileSize;\n    private int blankPos;\n    private final int margin;\n    private final int gridSize;\n    private boolean gameOver;\n\n    private FifteenPuzzle() {\n        final int dim = 640;\n\n        margin = 80;\n        tileSize = (dim - 2 * margin) / side;\n        gridSize = tileSize * side;\n\n        setPreferredSize(new Dimension(dim, dim + margin));\n        setBackground(Color.WHITE);\n        setForeground(new Color(0x6495ED)); // cornflowerblue\n        setFont(new Font(\"SansSerif\", Font.BOLD, 60));\n\n        gameOver = true;\n\n        addMouseListener(new MouseAdapter() {\n            @Override\n            public void mousePressed(MouseEvent e) {\n                if (gameOver) {\n                    newGame();\n\n                } else {\n\n                    int ex = e.getX() - margin;\n                    int ey = e.getY() - margin;\n\n                    if (ex < 0 || ex > gridSize || ey < 0 || ey > gridSize) {\n                        return;\n                    }\n\n                    int c1 = ex / tileSize;\n                    int r1 = ey / tileSize;\n                    int c2 = blankPos % side;\n                    int r2 = blankPos / side;\n\n                    int clickPos = r1 * side + c1;\n\n                    int dir = 0;\n                    if (c1 == c2 && Math.abs(r1 - r2) > 0) {\n                        dir = (r1 - r2) > 0 ? 4 : -4;\n                        \n                    } else if (r1 == r2 && Math.abs(c1 - c2) > 0) {\n                        dir = (c1 - c2) > 0 ? 1 : -1;\n                    }\n\n                    if (dir != 0) {\n                        do {\n                            int newBlankPos = blankPos + dir;\n                            tiles[blankPos] = tiles[newBlankPos];\n                            blankPos = newBlankPos;\n                        } while (blankPos != clickPos);\n                        tiles[blankPos] = 0;\n                    }\n                    \n                    gameOver = isSolved();\n                }\n                repaint();\n            }\n        });\n\n        newGame();\n    }\n\n    private void newGame() {\n        do {\n            reset();\n            shuffle();\n        } while (!isSolvable());\n        gameOver = false;\n    }\n\n    private void reset() {\n        for (int i = 0; i < tiles.length; i++) {\n            tiles[i] = (i + 1) % tiles.length;\n        }\n        blankPos = tiles.length - 1;\n    }\n\n    private void shuffle() {\n        // don't include the blank space in the shuffle, leave it\n        // in the home position\n        int n = numTiles;\n        while (n > 1) {\n            int r = rand.nextInt(n--);\n            int tmp = tiles[r];\n            tiles[r] = tiles[n];\n            tiles[n] = tmp;\n        }\n    }\n\n    /*  Only half the permutations of the puzzle are solvable.\n\n        Whenever a tile is preceded by a tile with higher value it counts\n        as an inversion. In our case, with the blank space in the home\n        position, the number of inversions must be even for the puzzle\n        to be solvable.\n\n        See also:\n        www.cs.bham.ac.uk/~mdr/teaching/modules04/java2/TilesSolvability.html\n     */\n    private boolean isSolvable() {\n        int countInversions = 0;\n        for (int i = 0; i < numTiles; i++) {\n            for (int j = 0; j < i; j++) {\n                if (tiles[j] > tiles[i]) {\n                    countInversions++;\n                }\n            }\n        }\n        return countInversions % 2 == 0;\n    }\n\n    private boolean isSolved() {\n        if (tiles[tiles.length - 1] != 0) {\n            return false;\n        }\n        for (int i = numTiles - 1; i >= 0; i--) {\n            if (tiles[i] != i + 1) {\n                return false;\n            }\n        }\n        return true;\n    }\n\n    private void drawGrid(Graphics2D g) {\n        for (int i = 0; i < tiles.length; i++) {\n            int r = i / side;\n            int c = i % side;\n            int x = margin + c * tileSize;\n            int y = margin + r * tileSize;\n\n            if (tiles[i] == 0) {\n                if (gameOver) {\n                    g.setColor(Color.GREEN);\n                    drawCenteredString(g, \"\\u2713\", x, y);\n                }\n                continue;\n            }\n\n            g.setColor(getForeground());\n            g.fillRoundRect(x, y, tileSize, tileSize, 25, 25);\n            g.setColor(Color.blue.darker());\n            g.drawRoundRect(x, y, tileSize, tileSize, 25, 25);\n            g.setColor(Color.WHITE);\n\n            drawCenteredString(g, String.valueOf(tiles[i]), x, y);\n        }\n    }\n\n    private void drawStartMessage(Graphics2D g) {\n        if (gameOver) {\n            g.setFont(getFont().deriveFont(Font.BOLD, 18));\n            g.setColor(getForeground());\n            String s = \"click to start a new game\";\n            int x = (getWidth() - g.getFontMetrics().stringWidth(s)) / 2;\n            int y = getHeight() - margin;\n            g.drawString(s, x, y);\n        }\n    }\n\n    private void drawCenteredString(Graphics2D g, String s, int x, int y) {\n        FontMetrics fm = g.getFontMetrics();\n        int asc = fm.getAscent();\n        int des = fm.getDescent();\n\n        x = x + (tileSize - fm.stringWidth(s)) / 2;\n        y = y + (asc + (tileSize - (asc + des)) / 2);\n\n        g.drawString(s, x, y);\n    }\n\n    @Override\n    public void paintComponent(Graphics gg) {\n        super.paintComponent(gg);\n        Graphics2D g = (Graphics2D) gg;\n        g.setRenderingHint(RenderingHints.KEY_ANTIALIASING,\n                RenderingHints.VALUE_ANTIALIAS_ON);\n\n        drawGrid(g);\n        drawStartMessage(g);\n    }\n\n    public static void main(String[] args) {\n        SwingUtilities.invokeLater(() -> {\n            JFrame f = new JFrame();\n            f.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);\n            f.setTitle(\"Fifteen Puzzle\");\n            f.setResizable(false);\n            f.add(new FifteenPuzzle(), BorderLayout.CENTER);\n            f.pack();\n            f.setLocationRelativeTo(null);\n            f.setVisible(true);\n        });\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_56.txt",
        "content": "var board, zx, zy, clicks, possibles, clickCounter, oldzx = -1, oldzy = -1;\nfunction getPossibles() {\n    var ii, jj, cx = [-1, 0, 1, 0], cy = [0, -1, 0, 1];\n    possibles = [];\n    for( var i = 0; i < 4; i++ ) {\n        ii = zx + cx[i]; jj = zy + cy[i];\n        if( ii < 0 || ii > 3 || jj < 0 || jj > 3 ) continue;\n        possibles.push( { x: ii, y: jj } );\n    }\n}\nfunction updateBtns() {\n    var b, v, id;\n    for( var j = 0; j < 4; j++ ) {\n        for( var i = 0; i < 4; i++ ) {\n            id = \"btn\" + ( i + j * 4 );\n            b = document.getElementById( id );\n            v = board[i][j];\n            if( v < 16 ) {\n                b.innerHTML = ( \"\" + v );\n                b.className = \"button\"\n            }\n            else {\n                b.innerHTML = ( \"\" );\n                b.className = \"empty\";\n            }\n        }\n    }\n    clickCounter.innerHTML = \"Clicks: \" + clicks;\n}\nfunction shuffle() {\n    var v = 0, t; \n    do {\n        getPossibles();\n        while( true ) {\n            t = possibles[Math.floor( Math.random() * possibles.length )];\n            console.log( t.x, oldzx, t.y, oldzy )\n            if( t.x != oldzx || t.y != oldzy ) break;\n        }\n        oldzx = zx; oldzy = zy;\n        board[zx][zy] = board[t.x][t.y];\n        zx = t.x; zy = t.y;\n        board[zx][zy] = 16; \n    } while( ++v < 200 );\n}\nfunction restart() {\n    shuffle();\n    clicks = 0;\n    updateBtns();\n}\nfunction checkFinished() {\n    var a = 0;\n    for( var j = 0; j < 4; j++ ) {\n        for( var i = 0; i < 4; i++ ) {\n            if( board[i][j] < a ) return false;\n            a = board[i][j];\n        }\n    }\n    return true;\n}\nfunction btnHandle( e ) {\n    getPossibles();\n    var c = e.target.i, r = e.target.j, p = -1;\n    for( var i = 0; i < possibles.length; i++ ) {\n        if( possibles[i].x == c && possibles[i].y == r ) {\n            p = i;\n            break;\n        }\n    }\n    if( p > -1 ) {\n        clicks++;\n        var t = possibles[p];\n        board[zx][zy] = board[t.x][t.y];\n        zx = t.x; zy = t.y;\n        board[zx][zy] = 16;\n        updateBtns();\n        if( checkFinished() ) {\n            setTimeout(function(){ \n                alert( \"WELL DONE!\" );\n                restart();\n            }, 1);\n        }\n    }\n}\nfunction createBoard() {\n    board = new Array( 4 );\n    for( var i = 0; i < 4; i++ ) {\n        board[i] = new Array( 4 );\n    }\n    for( var j = 0; j < 4; j++ ) {\n        for( var i = 0; i < 4; i++ ) {\n            board[i][j] = ( i + j * 4 ) + 1;\n        }\n    }\n    zx = zy = 3; board[zx][zy] = 16;\n}\nfunction createBtns() {\n    var b, d = document.createElement( \"div\" );\n    d.className += \"board\";\n    document.body.appendChild( d );\n    for( var j = 0; j < 4; j++ ) {\n        for( var i = 0; i < 4; i++ ) {\n            b = document.createElement( \"button\" );\n            b.id = \"btn\" + ( i + j * 4 );\n            b.i = i; b.j = j;\n            b.addEventListener( \"click\", btnHandle, false );\n            b.appendChild( document.createTextNode( \"\" ) );\n            d.appendChild( b );\n        }\n    }\n    clickCounter = document.createElement( \"p\" );\n    clickCounter.className += \"txt\";\n    document.body.appendChild( clickCounter );\n}\nfunction start() {\n    createBtns();\n    createBoard();\n    restart();\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_57.txt",
        "content": "<!DOCTYPE html>\n<html><head><meta charset=\"UTF-8\">\n<title>15 Puzzle</title>\n<script src=\"p15.js\"></script>\n<style>\n    html,body{padding:0; margin:0;padding-top:8vh;background:#222;color:#111}\n    .txt{color:#fff;text-align:center;font-size:5vh}\n    .board{padding:0;margin:auto;width:33vh;height:33vh}\n    .button, .empty{border:0;font-size:3.5vh;margin:0.5vh;padding:0;height:6vh;width:7.25vh;line-height:5vh;\n    vertical-align:middle;background:#fff;text-align:center;border-radius:3px;cursor:pointer;float:left}\n    .empty{background:#333;border:1px solid #111}\n</style>\n</head><body onload=\"start()\"></body></html>\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_58.txt",
        "content": "include \"MRG32k3a\" {search: \".\"};  # see above\n\n# The following may be omitted if using the C implementation of jq\ndef _nwise($n):\n  def n: if length <= $n then . else .[0:$n] , (.[$n:] | n) end;\n  n;\n\n### Generic utilities \n\ndef lpad($len): tostring | ($len - length) as $l | (\" \" * $l) + .;\n\n# tabular print\ndef tprint($columns; $width):\n  reduce _nwise($columns) as $row (\"\";\n     . + ($row|map(lpad($width)) | join(\" \")) + \"\\n\" );\n\ndef array_swap($i; $j):\n  if $j < $i then array_swap($j;$i)\n  elif $i == $j then .\n  else .[:$i] + [.[$j]] + .[$i+1:$j] + [.[$i]] + .[$j+1:]\n  end\u00a0;\n\n### Pre-requisite: MRG32k3a\n# Input: an array to be shuffled\n# Output: the shuffled array using a seed based on `now`\ndef shuffle:\n  { prng: (seed(now | tostring | sub(\"^.*[.]\";\"\") | tonumber)),\n    array: . }\n  | knuthShuffle\n  | .array;\n\n### 15-Puzzle\n\n# Pretty-print the board\ndef pp:\n  .board | map(if . == 0 then \"\" end) | tprint(4;3);\n\ndef row: ./4 | floor;\ndef col: .\u00a0% 4;\n\ndef move($p):\n  .zero as $zero\n  | (.board |= array_swap($zero; $p))\n  | .zero = $p\n  | .n += 1\u00a0;\n\ndef SolvedBoard: [range(1;16), 0];\n\n# Output: {goal, n, board, zero}\ndef init($easy):\n  SolvedBoard as $init\n  | { goal: $init,\n      n: 0,          # number of moves so far\n      board: ($init | if $easy then array_swap(14;15) else shuffle end)\n    }\n  | .zero = (.board|index(0))\u00a0;\n\n# If $m is a valid single-letter move, then emit the corresponding\n# index of the proposed new position.\n# Input must include .zero\ndef isValidMove($m):\n  if   ($m == \"u\") then if (.zero|row)\u00a0!= 0 then .zero - 4 else false end\n  elif ($m == \"d\") then if (.zero|row)\u00a0!= 3 then .zero + 4 else false end\n  elif ($m == \"r\") then if (.zero|col)\u00a0!= 3 then .zero + 1 else false end\n  elif ($m == \"l\") then if (.zero|col)\u00a0!= 0 then .zero - 1 else false end\n  else false\n  end;\n\ndef instructions:\n  \"Please enter \\\"u\\\", \\\"d\\\", \\\"l\\\", or \\\"r\\\" to move the empty cell\",\n  \"up, down, left, or right. You can also enter \\\"q\\\" to quit.\",\n  \"Upper or lowercase is accepted and only the first character\",\n  \"is important, so for example you could enter `up` instead of `u`.\";\n\ndef play($easy):\n  def prompt:\n    pp,\n    if .board == .goal then \"Congratulations. You solved the puzzle in \\(.n) moves.\"\n    else\n      \"Enter move #\\(.n + 1) (u, d, l, r or q): \",\n      ( (limit(1;inputs)[:1]|ascii_downcase) as $m\n        | if $m == \"q\" then halt\n          else isValidMove($m) as $p\n          | if $p then move($p) | prompt\n            else \"Invalid move.\", prompt\n            end\n          end)\n    end;\n    \n  instructions,\n  (init($easy) | prompt);\n\nplay(ARGS.named.easy)",
        "safe": true
    },
    {
        "filename": "15 puzzle game_59.txt",
        "content": "Please enter \"u\", \"d\", \"l\", or \"r\" to move the empty cell\nup, down, left, or right. You can also enter \"q\" to quit.\nUpper or lowercase is accepted and only the first character\nis important, so for example you could enter `up` instead of `u`.\n  1   2   3   4\n  5   6   7   8\n  9  10  11  12\n 13  14      15\n\nEnter move #1 (u, d, l, r or q): \nu\n  1   2   3   4\n  5   6   7   8\n  9  10      12\n 13  14  11  15\n\nEnter move #2 (u, d, l, r or q): \nd\n  1   2   3   4\n  5   6   7   8\n  9  10  11  12\n 13  14      15\n\nEnter move #3 (u, d, l, r or q): \nr\n  1   2   3   4\n  5   6   7   8\n  9  10  11  12\n 13  14  15    \n\nCongratulations. You solved the puzzle in 3 moves.\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_6.txt",
        "content": "package body Generic_Puzzle is\n   \n   Field: array(Row_Type, Col_Type) of Natural;\n   Current_R: Row_Type := Rows;\n   Current_C: Col_Type := Cols;\n   -- invariant: Field(Current_R, Current_C=0) \n   -- and for all R, C: Field(R, C) < R*C\n   -- and for all (R, C) /= (RR, CC): Field(R, C) /= Field(RR, CC)\n   \n   function Get_Point(Row: Row_Type; Col: Col_Type) return String is\n      (Name(Field(Row, Col)));\n      \n   function Possible return Move_Arr is\n      (Up => Current_R > 1, Down => Current_R < Rows,\n       Left => Current_C > 1, Right => Current_C < Cols);\n      \n   procedure Move(The_Move: Moves) is\n      Old_R: Row_Type; Old_C: Col_Type; N: Natural;\n   begin\n      if not Possible(The_Move) then\n\t raise Constraint_Error with \"attempt to make impossible move\";\n      else\n\t -- remember current row and column\n\t Old_R := Current_R;\n\t Old_C := Current_C;\n\t \n\t -- move the virtual cursor to a new position\n\t case The_Move is \n\t   when Up    => Current_R := Current_R - 1;\n\t   when Down  => Current_R := Current_R + 1;\n\t   when Left  => Current_C := Current_C - 1;\n\t   when Right => Current_C := Current_C + 1;\n\t end case;\n\t \n\t -- swap the tiles on the board\n\t N := Field(Old_R, Old_C);\n\t Field(Old_R, Old_C) := Field(Current_R, Current_C);\n\t Field(Current_R, Current_C) := N;\n      end if;\n   end Move;\n\nbegin\n   declare   -- set field to its basic setting\n      N: Positive := 1;\n   begin\n      for R in Row_Type loop\n\t for C in Col_Type loop\n\t    if (R /= Current_R) or else (C /= Current_C) then \n\t       Field(R, C) := N;\n\t       N := N + 1;\n\t    else\n\t       Field(R, C) := 0;\n\t    end if;\n\t end loop;\n      end loop;\n   end;\nend Generic_Puzzle;\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_60.txt",
        "content": "using Random\n\nconst size = 4\nconst puzzle = string.(reshape(1:16, size, size))\npuzzle[16] = \" \"\nrng = MersenneTwister(Int64(round(time())))\nshufflepuzzle() = (puzzle .= shuffle(rng, puzzle))\nfindtile(t) = findfirst(x->x == t, puzzle)\nfindhole() = findtile(\" \")\n\nfunction issolvable()\n    inversioncount = 1\n    asint(x) = (puzzle[x] == \" \") ? 0 : parse(Int64, puzzle[x])\n    for i in 1:size^2-1, j in i:size^2\n        if puzzle[i] == \" \" || puzzle[j] == \" \"\n            continue\n        end\n        if parse(Int, puzzle[i]) < parse(Int, puzzle[j])\n            inversioncount += 1\n        end\n    end\n    if size % 2 == 1\n        return inversioncount % 2 == 0\n    end\n    pos = findhole()\n    inversioncount += pos[2]\n    return inversioncount & 1 == 0\nend\n\nfunction nexttohole()\n    holepos = findhole()\n    row = holepos[1]\n    col = holepos[2]\n    if row == 1\n        if col == 1\n            return [[row, col + 1], [row + 1, col]]\n        elseif col == size\n            return [[row, col - 1], [row + 1, col]]\n        else\n            return [[row, col - 1], [row, col + 1], [row + 1, col]]\n        end\n    elseif row == size\n        if col == 1\n            return [[row - 1, col], [row, col + 1]]\n        elseif col == size\n            return [[row - 1, col], [row, col - 1]]\n        else\n            return [[row - 1, col], [row, col - 1], [row, col + 1]]\n        end\n    else\n        if col == 1\n            return [[row - 1, col], [row, col + 1], [row + 1, col]]\n        elseif col == size\n            return [[row - 1, col], [row, col - 1], [row + 1, col]]\n        else\n            return [[row - 1, col], [row, col - 1], [row, col + 1], [row + 1, col]]\n        end\n    end\nend\n\npossiblemoves() = map(pos->puzzle[pos[1], pos[2]], nexttohole())\n\nfunction movehole(tiletofill)\n    if tiletofill in possiblemoves()\n        curpos = findtile(tiletofill)\n        holepos = findhole()\n        puzzle[holepos] = tiletofill\n        puzzle[curpos] = \" \"\n    else\n        println(\"Bad tile move $tiletofill.\\nPossible moves are $(possiblemoves()).\")\n    end\nend\n\nfunction printboard()\n    ppuz(x,y) = print(lpad(rpad(puzzle[x,y], 3), 4), \"|\")\n    print(\"+----+----+----+----+\\n|\")\n    for j in 1:size, i in 1:size\n        ppuz(i,j)\n        if i == size\n            print(\"\\n\")\n            if j < size\n                 print(\"|\")\n            end\n        end\n    end\n    println(\"+----+----+----+----+\")\n\nend\n\nfunction puzzle15play()\n    solved() = (puzzle[1:15] == string.(1:15))\n    shufflepuzzle()\n    println(\"This puzzle is\", issolvable() ? \" \" : \" not \", \"solvable.\")\n    while !solved()\n        printboard()\n        print(\"Possible moves are: $(possiblemoves()), 0 to exit. Your move? =>  \")\n        s = readline()\n        if s == \"0\"\n            exit(0)\n        end\n        movehole(s)\n    end\n    printboard()\n    println(\"Puzzle solved.\")\nend\n\npuzzle15play()\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_61.txt",
        "content": "\n\nThis puzzle is solvable.\n+----+----+----+----+\n| 5  | 7  | 14 |    |\n| 4  | 3  | 13 | 12 |\n| 10 | 1  | 6  | 9  |\n| 8  | 15 | 11 | 2  |\n+----+----+----+----+\nPossible moves are: [\"14\", \"12\"], 0 to exit. Your move? =>  12\n+----+----+----+----+\n| 5  | 7  | 14 | 12 |\n| 4  | 3  | 13 |    |\n| 10 | 1  | 6  | 9  |\n| 8  | 15 | 11 | 2  |\n+----+----+----+----+\nPossible moves are: [\"13\", \"12\", \"9\"], 0 to exit. Your move? =>\n\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_62.txt",
        "content": "import std/num/random\nimport std/os/readline\nstruct board\n  cells: vector<vector<int>>\n  hole-pos: (int, int)\n  size: (int, int)\n\ntype move\n  MUp\n  MDown\n  MLeft\n  MRight\n\nfun delta(move: move): (int, int)\n  match move\n    MUp -> (0, 1)\n    MDown -> (0, -1)\n    MLeft -> (1, 0)\n    MRight -> (-1, 0)\n\ninline extern unsafe-assign : forall<a> ( v : vector<a>, i : ssize_t, x : a ) -> total ()\n  c \"kk_vector_unsafe_assign\"\n\nfun update(game: board, move: move): exn board\n  val (dx, dy) = move.delta\n  val (hx, hy) = game.hole-pos\n  val (nx, ny) = (hx + dx, hy + dy)\n  val (w, h) = game.size\n  if nx >= 0 && nx < w && ny >= 0 && ny < h then\n    game.cells[hx].unsafe-assign(hy.ssize_t, game.cells[nx][ny])\n    game.cells[nx].unsafe-assign(ny.ssize_t, 0)\n    game(hole-pos=(nx, ny))\n  else \n    game\n\nval num_shuffles = 100\n\nfun random-move(): random move\n  match random-int() % 4\n    0 -> MUp\n    1 -> MDown\n    2 -> MLeft\n    _ -> MRight\n\nfun setup(size: (int, int)): <exn,random> board\n  val (w, h) = size\n  val cells = vector-init(w, fn(x) vector-init(h, fn(y) x*h + y + 1))\n  var game := Board(cells, (w - 1, h - 1), size)\n  for(0,num_shuffles) fn(_)\n    game := game.update(random-move())\n  game\n\neffect break<a>\n  final ctl break(a: a) : b\n\nfun finished(game: board): exn bool\n  val (w, h) = game.size\n  var i := 1\n  with final ctl break(a:bool)\n    a\n  for(0,w - 1) fn(x)\n    for(0,h - 1) fn(y)\n      if game.cells[x][y] != i then\n        break(False)\n      else\n        i := i + 1\n  True\n\nfun display(game: board): <console,exn> ()\n  println(\"\")\n  val (w, h) = game.size\n  for(0, h - 1) fn(y)\n    for(0, w - 1) fn(x)\n      val c = game.cells[x][y]\n      if c == 0 then\n        print(\"    \")\n      else\n        print(\" \" ++ c.show ++ \" \")\n    println(\"\")\n  println(\"\")\n\nfun get_move(): <div,console,exn,break<string>> move\n  val c = readline()\n  match c.trim()\n    \"w\" -> MUp\n    \"s\" -> MDown\n    \"a\" -> MLeft\n    \"d\" -> MRight\n    \"q\" -> break(\"Finished\")\n    _ -> get_move()\n\nfun main()\n  var game := setup((4, 4))\n  with final ctl break(a:string)\n    a.println\n  while {!game.finished}\n    game.display\n    val move = get_move()\n    game := game.update(move)\n  println(\"You won!\")\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_63.txt",
        "content": "// version 1.1.3\n\nimport java.awt.BorderLayout\nimport java.awt.Color\nimport java.awt.Dimension\nimport java.awt.Font\nimport java.awt.Graphics\nimport java.awt.Graphics2D\nimport java.awt.RenderingHints\nimport java.awt.event.MouseAdapter\nimport java.awt.event.MouseEvent\nimport java.util.Random\nimport javax.swing.JFrame\nimport javax.swing.JPanel\nimport javax.swing.SwingUtilities\n\nclass FifteenPuzzle(dim: Int, val margin: Int) : JPanel() {\n\n    private val rand = Random()\n    private val tiles = IntArray(16)\n    private val tileSize = (dim - 2 * margin) / 4\n    private val gridSize = tileSize * 4\n    private var blankPos = 0\n\n    init {\n        preferredSize = Dimension(dim, dim)\n        background = Color.white\n        val cornflowerBlue = 0x6495ED\n        foreground = Color(cornflowerBlue)\n        font = Font(\"SansSerif\", Font.BOLD, 60)\n\n        addMouseListener(object : MouseAdapter() {\n            override fun mousePressed(e: MouseEvent) {\n                val ex = e.x - margin\n                val ey = e.y - margin\n                if (ex !in 0..gridSize || ey !in 0..gridSize) return\n\n                val c1 = ex / tileSize\n                val r1 = ey / tileSize\n                val c2 = blankPos % 4\n                val r2 = blankPos / 4\n                if ((c1 == c2 && Math.abs(r1 - r2) == 1) ||\n                    (r1 == r2 && Math.abs(c1 - c2) == 1)) {\n                    val clickPos = r1 * 4 + c1\n                    tiles[blankPos] = tiles[clickPos]\n                    tiles[clickPos] = 0\n                    blankPos = clickPos\n                }\n                repaint()\n            }\n        })\n\n        shuffle()\n    }\n\n    private fun shuffle() {\n        do {\n            reset()\n            // don't include the blank space in the shuffle,\n            // leave it in the home position\n            var n = 15\n            while (n > 1) {\n                val r = rand.nextInt(n--)\n                val tmp = tiles[r]\n                tiles[r] = tiles[n]\n                tiles[n] = tmp\n            }\n        } while (!isSolvable())\n    }\n\n    private fun reset() {\n        for (i in 0 until tiles.size) {\n            tiles[i] = (i + 1) % tiles.size\n        }\n        blankPos = 15\n    }\n\n    /*  Only half the permutations of the puzzle are solvable.\n\n        Whenever a tile is preceded by a tile with higher value it counts\n        as an inversion. In our case, with the blank space in the home\n        position, the number of inversions must be even for the puzzle\n        to be solvable.\n    */\n\n    private fun isSolvable(): Boolean {\n        var countInversions = 0\n        for (i in 0 until 15) {\n            (0 until i)\n                .filter { tiles[it] > tiles[i] }\n                .forEach { countInversions++ }\n        }\n        return countInversions % 2 == 0\n    }\n\n    private fun drawGrid(g: Graphics2D) {\n        for (i in 0 until tiles.size) {\n            if (tiles[i] == 0) continue\n\n            val r = i / 4\n            val c = i % 4\n            val x = margin + c * tileSize\n            val y = margin + r * tileSize\n\n            with(g) {\n                color = foreground\n                fillRoundRect(x, y, tileSize, tileSize, 25, 25)\n                color = Color.black\n                drawRoundRect(x, y, tileSize, tileSize, 25, 25)\n                color = Color.white\n            }\n            drawCenteredString(g, tiles[i].toString(), x, y)\n        }\n    }\n\n    private fun drawCenteredString(g: Graphics2D, s: String, x: Int, y: Int) {\n        val fm = g.fontMetrics\n        val asc = fm.ascent\n        val des = fm.descent\n\n        val xx = x + (tileSize - fm.stringWidth(s)) / 2\n        val yy = y + (asc + (tileSize - (asc + des)) / 2)\n\n        g.drawString(s, xx, yy)\n    }\n\n    override fun paintComponent(gg: Graphics) {\n        super.paintComponent(gg)\n        val g = gg as Graphics2D\n        g.setRenderingHint(RenderingHints.KEY_ANTIALIASING,\n            RenderingHints.VALUE_ANTIALIAS_ON)\n        drawGrid(g)\n    }\n}\n\nfun main(args: Array<String>) {\n    SwingUtilities.invokeLater {\n        val f = JFrame()\n        with(f) {\n            defaultCloseOperation = JFrame.EXIT_ON_CLOSE\n            title = \"Fifteen Puzzle\"\n            isResizable = false\n            add(FifteenPuzzle(640, 80), BorderLayout.CENTER)\n            pack()\n            setLocationRelativeTo(null)\n            isVisible = true\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_64.txt",
        "content": "' 15-PUZZLE GAME\n' ********************************\ndim d(16)\ndim ds$(16) ' Board pieces\ndim sh(3)\n\ncall buildBoard introAndLevel()\ncall printPuzzle\ndo\n  print \"To move a piece, enter its number: \"\n  input x\n  while isMoveValid(x, y, z) = 0\n    print \"Wrong move.\"\n    call printPuzzle\n    print \"To move a piece, enter its number: \"\n    input x\n  wend\n  d(z) = x\n  d(y) = 0\n  call printPuzzle\nloop until isPuzzleComplete()\nprint \"YOU WON!\"\nend\n\nsub printPuzzle\n  for p = 1 to 16\n    if d(p) = 0 then\n      ds$(p) = \"     \"\n    else\n      ds$(p) = using(\"###\", d(p)) + \"  \"\n    end if\n  next p\n  print \"+-----+-----+-----+-----+\"\n  print \"|\"; ds$(1); \"|\"; ds$(2); \"|\"; ds$(3); \"|\"; ds$(4); \"|\"\n  print \"+-----+-----+-----+-----+\"\n  print \"|\"; ds$(5); \"|\"; ds$(6); \"|\"; ds$(7); \"|\"; ds$(8); \"|\"\n  print \"+-----+-----+-----+-----+\"\n  print \"|\"; ds$(9); \"|\"; ds$(10); \"|\";ds$(11); \"|\"; ds$(12); \"|\"\n  print \"+-----+-----+-----+-----+\"\n  print \"|\"; ds$(13); \"|\"; ds$(14); \"|\"; ds$(15); \"|\"; ds$(16); \"|\"\n  print \"+-----+-----+-----+-----+\"\nend sub\n\nfunction introAndLevel()\n  cls\n  sh(1) = 10\n  sh(2) = 50\n  sh(3) = 100\n  print \"15 PUZZLE GAME\"\n  print\n  print\n  print \"Please enter level of difficulty,\"\n  do\n    print \"1 (easy), 2 (medium) or 3 (hard): \";\n    input level\n  loop while (level < 1) or (level > 3)\n  introAndLevel = level\nend function\n\nsub buildBoard level\n  ' Set pieces in correct order first\n  for p = 1 to 15\n    d(p) = p\n  next p\n  d(16) = 0 ' 0 = empty piece/slot\n  z = 16 ' z = empty position\n  print\n  print \"Shuffling pieces\";\n  for n = 1 to sh(level)\n    print \".\";\n    do\n      x = int(rnd(0) * 4) + 1\n      select case x\n        case 1\n          r = z - 4\n        case 2\n          r = z + 4\n        case 3\n          if (z - 1) mod 4 <> 0 then\n            r = z - 1\n          end if\n        case 4\n          if z mod 4 <> 0 then\n            r = z + 1\n          end if\n      end select\n    loop while (r < 1) or (r > 16)\n    d(z) = d(r)\n    z = r\n    d(z) = 0\n  next n\n  cls\nend sub\n\nfunction isMoveValid(piece, byref piecePos, byref emptyPos)\n  mv = 0\n  if (piece >= 1) and (piece <= 15) then\n    piecePos = piecePosition(piece)\n    emptyPos = piecePosition(0)\n    ' Check if empty piece is above, below, left or right to piece\n    if (piecePos - 4 = emptyPos) or _\n      (piecePos + 4 = emptyPos) or _\n      ((piecePos - 1 = emptyPos) and (emptyPos mod 4 <> 0)) or _\n      ((piecePos + 1 = emptyPos) and (piecePos mod 4 <> 0)) then\n      mv = 1\n    end if\n  end if\n  isMoveValid = mv\nend function\n\nfunction piecePosition(piece)\n  p = 1\n  while d(p) <> piece\n    p = p + 1\n    if p > 16 then\n      print \"UH OH!\"\n      stop\n    end if\n  wend\n  piecePosition = p\nend function\n\nfunction isPuzzleComplete()\n  pc = 0\n  p = 1\n  while (p < 16) and (d(p) = p)\n    p = p + 1\n  wend\n  if p = 16 then\n    pc = 1\n  end if\n  isPuzzleComplete = pc\nend function",
        "safe": true
    },
    {
        "filename": "15 puzzle game_65.txt",
        "content": "#Please note that all this code can be performed in livecode with just few mouse clicks\n#This is just a pure script exampe\non OpenStack\n   show me  #Usually not necessary\n   #tile creation\n   set the width of the templateButton to 50\n   set the height of the templateButton to 50\n   repeat with i=1 to 16\n      create button \n      set the label of  button i to i\n      if i =1 then\n         set the top of button 1 to 0\n         set the left of button 1 to 0\n      end if\n      if i > 1 and 1 <=4  then\n         set the left of button i to the right of button (i-1)\n         set the top of button i to the top of button 1\n      end if\n      if i >= 5 and i <= 8 then\n         set the top of button i to the bottom of button 1\n         if i = 5 then \n            set the left of button i to the left of button 1\n         else\n            set the left of button i to the right of button (i - 1)\n         end if\n      end if   \n      if i >= 9 and i <= 12 then\n         set the top of button i to the bottom of button 5\n         if i = 9 then \n            set the left of button i to the left of button 1\n         else \n            set the left of button i to the right of button (i - 1)\n         end if\n      end if   \n      if i >= 13 and i <= 16 then\n         set the top of button i to the bottom of button 9\n         if i = 13 then \n            set the left of button i to the left of button 1\n         else \n            set the left of button i to the right of button (i - 1)\n         end if\n      end if   \n      #this is usally the script directly wirtten in the objects, it's really weird this way\n      put \"on MouseUp\" &CR& \"if checkDistance(the label of me) then\" & CR &\"put the loc of me into temp\" into ts\n      put CR& \"set the loc of me to the loc of button 16\" after ts\n      put CR& \"set the loc of button 16 to temp\" & Cr & \"end if \" &CR &\"End MouseUp\" after ts\n      set the script of button i to ts\n   end repeat\n   #graphic adjustements\n   set the visible of button 16 to false   \n   set the width of this stack to the right of button 16\n   set the height of this stack to the bottom of button 16\nend openStack\n\nfunction checkDistance i\n   if (((the top of button i - the bottom of button 16) = 0 OR (the top of button 16 - the bottom of button i) = 0) AND the left of button i = the left of button 16) OR (((the left of button i - the right of button 16) = 0 OR (the right of button i - the left of button 16) = 0) AND the top of button i = the top of button 16) then\n      return true\n   else \n      return false\n   end if\nend checkDistance",
        "safe": true
    },
    {
        "filename": "15 puzzle game_66.txt",
        "content": "math.randomseed( os.time() )\nlocal puz = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 0 }\nlocal dir = { { 1, 0 }, { -1, 0 }, { 0, 1 }, { 0, -1 } }\nlocal sx, sy = 4, 4 \n\nfunction isValid( tx, ty )\n    return tx > 0 and tx < 5 and ty > 0 and ty < 5  \nend\nfunction display()\n    io.write( \"\\n\\n\" )\n    for j = 1, 4 do\n        io.write( \"+----+----+----+----+\\n\" )\n        for i = 1, 4 do\n            local d = puz[i + j * 4 - 4]\n            io.write( \": \" )\n            if d < 10 then io.write( \" \" ) end\n            if d < 1  then\n                io.write( \"  \" )\n            else\n                io.write( string.format( \"%d \", d ) )\n            end\n        end\n        io.write( \":\\n\" )\n    end\n    io.write( \"+----+----+----+----+\\n\\n\" )\nend\nfunction getUserNove()\n    local moves, r, tx, ty = {}\n    for d = 1, 4 do\n        tx = sx; ty = sy\n        tx = tx + dir[d][1]; ty = ty + dir[d][2]\n        \n        if isValid( tx, ty ) then \n            table.insert( moves, puz[tx + ty * 4 - 4] )\n        end\n    end\n    \n    io.write( \"Your possible moves are: \" )\n    for i = 1, #moves do \n        io.write( string.format( \"%d \", moves[i] ) )\n    end\n    \n    io.write ( \"\\nYour move: \" ); r = tonumber( io.read() )\n    if r ~= nil then\n        for i = 1, #moves do\n            if moves[i] == r then return r end\n        end\n    end\n    print( \"Invalid move!\" )\n    return -1\nend\nfunction checked( r )\n    for i = 1, #puz do\n        if puz[i] == r then \n            puz[i] = 0\n            sx = 1 + ( i - 1 ) % 4; sy = math.floor( ( i + 3 ) / 4 )\n        elseif puz[i] == 0 then\n            puz[i] = r\n        end\n    end\n    for i = 2, #puz - 1 do\n        if puz[i - 1] + 1 ~= puz[i] then return false end\n    end\n    return true\nend\nfunction beginGame()\n    local r, d, tx, ty\n    while( true ) do\n        for i = 1, 100 do\n            while( true ) do\n                tx = sx; ty = sy; d = math.random( 4 )\n                tx = tx + dir[d][1]; ty = ty + dir[d][2]\n                if isValid( tx, ty ) then break end\n            end\n            puz[sx + sy * 4 - 4] = puz[tx + ty * 4 - 4]\n            puz[tx + ty * 4 - 4] = 0; sx = tx; sy = ty\n        end\n        while( true ) do\n            display(); r = getUserNove()\n            if r > 0 then\n                if checked( r ) then\n                    display()\n                    io.write( \"\\nDone!\\n\\nPlay again (Y/N)?\" )\n                    r = io.read()\n                    if r ~= \"Y\" and r ~= \"y\" then \n                        return\n                    else\n                        break\n                    end\n                end\n            end\n        end\n    end\nend\n-- [ entry point ] --\nbeginGame()\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_67.txt",
        "content": "+----+----+----+----+\n:  1\u00a0: 15\u00a0:  7\u00a0:  3\u00a0:\n+----+----+----+----+\n: 14\u00a0:  9\u00a0:  2\u00a0:  4\u00a0:\n+----+----+----+----+\n:  5\u00a0: 13\u00a0:   \u00a0: 10\u00a0:\n+----+----+----+----+\n:  6\u00a0: 12\u00a0:  8\u00a0: 11\u00a0:\n+----+----+----+----+\n\nYour possible moves are: 10 13 8 2\nYour move:\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_68.txt",
        "content": "Module Puzzle15 {\n      \n      00 BASE 1\u00a0: DEF RND(X)=RND\n      10 REM 15-PUZZLE GAME\n      20 REM COMMODORE BASIC 2.0\n      30 REM ********************************\n      40 GOSUB 400\u00a0: REM INTRO AND LEVEL\n      50 GOSUB 510\u00a0: REM SETUP BOARD\n      60 GOSUB 210\u00a0: REM PRINT PUZZLE\n      70 PRINT \"TO MOVE A PIECE, ENTER ITS NUMBER:\"\n      80 INPUT X\n      90 GOSUB 730\u00a0: REM CHECK IF MOVE IS VALID\n      100 IF MV=0 THEN PRINT \"WRONG MOVE\"\u00a0: GOSUB 1050\u00a0: GOTO 60\n      110 D(Z)=X\u00a0: D(Y)=0\n      120 GOSUB 210\u00a0: REM PRINT PUZZLE\n      130 GOSUB 950\u00a0: REM CHECK IF PUZZLE COMPLETE\n      140 IF PC THEN 160\n      150 GOTO 70\n      160 PRINT\"YOU WON!\"\n      170 END\n      180 REM\n      190 REM *******************************\n      200 REM PRINT/DRAW THE PUZZLE\n      210 FOR P=1 TO 16\n      220   IF D(P)=0 THEN D$(P)=\"     \"\u00a0: GOTO 260\n      230   S$=STR$(D(P))\n      240   N=LEN(S$)\n      250   D$(P) = LEFT$(\"   \",3-N)+S$+\"  \"\n      260 NEXT P\n      270 PRINT \"+-----+-----+-----+-----+\"\n      280 PRINT \"!\";D$(1);\"!\";D$(2);\"!\";D$(3);\"!\";D$(4);\"!\"\n      290 PRINT \"+-----+-----+-----+-----+\"\n      300 PRINT \"!\";D$(5);\"!\";D$(6);\"!\";D$(7);\"!\";D$(8);\"!\"\n      310 PRINT \"+-----+-----+-----+-----+\"\n      320 PRINT \"!\";D$(9);\"!\";D$(10);\"!\";D$(11);\"!\";D$(12);\"!\"\n      330 PRINT \"+-----+-----+-----+-----+\"\n      340 PRINT \"!\";D$(13);\"!\";D$(14);\"!\";D$(15);\"!\";D$(16);\"!\"\n      350 PRINT \"+-----+-----+-----+-----+\"\n      360 RETURN\n      370 REM\n      380 REM *******************************\n      390 REM INTRO AND LEVEL OF DIFFICULTY\n      400 PRINT CHR$(147)\n      410 DIM SH(3)\u00a0: SH(1)=10\u00a0: SH(2)=50\u00a0: SH(3)=100\n      420 PRINT \"15 PUZZLE GAME FOR COMMODORE BASIC 2.0\"\u00a0: PRINT\u00a0: PRINT\n      430 PRINT \"PLEASE ENTER LEVEL OF DIFFICULTY,\"\n      440 PRINT \"1(EASY), 2(MEDIUM) OR 3(HARD):\";\n      450 INPUT V\n      460 IF V<1 OR V>3 THEN 440\n      470 RETURN\n      480 REM\n      490 REM *******************************\n      500 REM BUILD THE BOARD\n      510 DIM D(16)\u00a0: DIM D$(16)\u00a0: REM BOARD PIECES\n      520 REM SET PIECES IN CORRECT ORDER FIRST\n      530 FOR P=1 TO 15\n      540   D(P) = P\n      550 NEXT P\n      560 D(16) = 0\u00a0: REM 0 = EMPTY PIECE/SLOT\n      570 Z=16     \u00a0: REM Z = EMPTY POSITION\n      580 PRINT: PRINT \"SHUFFLING PIECES\";\n      590 FOR N=1 TO SH(V)\n      600   PRINT\".\";\n      610   X = INT(RND(0)*4)+1\n      620   R = Z+(X=1)*4-(X=2)*4+(X=3)-(X=4)\n      630   IF R<1 OR R>16 THEN 610\n      640   D(Z)=D(R)\n      650   Z=R\n      660   D(Z)=0\n      670 NEXT N\n      680 PRINT CHR$(147)\n      690 RETURN\n      700 REM\n      710 REM *******************************\n      720 REM CHECK IF MOVE IS VALID\n      730 MV = 0\n      740 IF X<1 OR X>15 THEN RETURN\n      750 REM FIND POSITION OF PIECE X\n      760 P=1\n      770 IF D(P)=X THEN Y=P\u00a0: GOTO 810\n      780 P=P+1\u00a0: IF P>16 THEN PRINT \"UH OH!\"\u00a0: STOP\n      790 GOTO 770\n      800 REM FIND POSITION OF EMPTY PIECE\n      810 P=1\n      820 IF D(P)=0 THEN Z=P\u00a0: GOTO 860\n      830 P=P+1\u00a0: IF P>16 THEN PRINT \"UH OH!\"\u00a0: STOP\n      840 GOTO 820\n      850 PRINT Y;Z\n      860 REM CHECK IF EMPTY PIECE IS ABOVE, BELOW, LEFT OR RIGHT TO PIECE X\n      870 IF Y-4=Z THEN MV=1\u00a0: RETURN\n      880 IF Y+4=Z THEN MV=1\u00a0: RETURN\n      890 IF Y-1=Z THEN MV=1\u00a0: RETURN\n      900 IF Y+1=Z THEN MV=1\u00a0: RETURN\n      910 RETURN\n      920 REM\n      930 REM *******************************\n      940 REM CHECK IF PUZZLE IS COMPLETE / GAME OVER\n      950 PC = 0\n      960 P=1\n      970 IF D(P)<>P THEN RETURN\n      980 P=P+1\n      990 IF P<16 THEN 970\n      1000 PC = 1\n      1010 RETURN\n      1020 REM\n      1030 REM ******************************\n      1040 REM A SMALL DELAY\n      1050 FOR T=0 TO 400\n      1060 NEXT T\n      1070 RETURN\n}\nPuzzle15",
        "safe": true
    },
    {
        "filename": "15 puzzle game_69.txt",
        "content": "grid = MapThread[{#1,#2} &, {Range @ 16, Range @ 16}]\n\nMove[x_] := (empty = Select[grid, #[[1]]==16 &][[1,2]];\n             If[(empty == x+4) || (empty == x-4) ||\n                (Mod[empty,4] != 0 && empty == x-1) ||\n                (Mod[empty,4] != 1 && empty == x+1),\n             oldEmpty = grid[[empty]][[1]];\n             grid[[empty]][[1]] = grid[[x]][[1]];\n             grid[[x]][[1]] = oldEmpty])\n\nCButton[{x_,loc_}] := If[x==16, Null, Button[x,Move @ loc]]\n\nDynamic @ Grid @ Partition[CButton /@ grid,4]\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_7.txt",
        "content": "with Generic_Puzzle, Ada.Text_IO, \n     Ada.Numerics.Discrete_Random, Ada.Command_Line;\n\nprocedure Puzzle_15 is\n   \n   function Image(N: Natural) return String is\n      (if N=0 then \"   \" elsif N < 10 then \" \" & Integer'Image(N)\n\telse Integer'Image(N));\n\t\n   package Puzzle is new Generic_Puzzle(Rows => 4, Cols => 4, Name => Image);\n    \n   package Rnd is new Ada.Numerics.Discrete_Random(Puzzle.Moves);\n   Rand_Gen: Rnd.Generator;\n    \n   Level: Natural := (if Ada.Command_Line.Argument_Count = 0 then 10 \n                      else Natural'Value(Ada.Command_Line.Argument(1)));\n   Initial_Moves: Natural := (2**(Level/2) + 2**((1+Level)/2))/2;\n   Texts: constant array(Puzzle.Moves) of String(1..9) :=\n       (\"u,U,^,8: \", \"d,D,v,2: \", \"l,L,<,4: \", \"r,R,>,6: \");\n   Move_Counter: Natural := 0;    \n   Command: Character;\n       \n begin\n    -- randomize board\n    for I in 1 .. Initial_Moves loop\n       declare\n\t  M: Puzzle.Moves := Rnd.Random(Rand_Gen);\n       begin\n\t  if Puzzle.Possible(M) then\n\t     Puzzle.Move(M);\n\t  end if;\n       end;\n    end loop;\n    \n    -- read command and perform move\t  \n    loop\n      -- Print board\n      for R in Puzzle.Row_Type loop\n\t for C in Puzzle.Col_Type loop\n\t    Ada.Text_IO.Put(Puzzle.Get_Point(R, C));\n\t end loop;\n\t Ada.Text_IO.New_Line;\n      end loop;\n      Ada.Text_IO.Get(Command);\n      begin\n\t case Command is\n\t    when 'u' | 'U' | '^' | '8' =>\n\t       Ada.Text_IO.Put_Line(\"Up!\"); Puzzle.Move(Puzzle.Up);\n\t    when 'd' | 'D' | 'v' | '2' =>\n\t       Ada.Text_IO.Put_Line(\"Down!\"); Puzzle.Move(Puzzle.Down);\n\t    when 'l' | 'L' | '<' | '4' =>\n\t       Ada.Text_IO.Put_Line(\"Left!\"); Puzzle.Move(Puzzle.Left);\n\t    when 'r' | 'R' | '>' | '6' =>\n\t       Ada.Text_IO.Put_Line(\"Right!\"); Puzzle.Move(Puzzle.Right);\n\t    when '!' => \n\t       Ada.Text_IO.Put_Line(Natural'Image(Move_Counter) & \" moves!\"); \n\t       exit;\n\t    when others => \n\t       raise Constraint_Error with \"wrong input\";\n\t end case;\n\t Move_Counter := Move_Counter + 1;\n      exception when Constraint_Error => \n\t Ada.Text_IO.Put_Line(\"Possible Moves and Commands:\");\n\t for M in Puzzle.Moves loop\n\t    if Puzzle.Possible(M) then\n\t       Ada.Text_IO.Put(Texts(M) & Puzzle.Moves'Image(M) & \"   \");\n\t    end if;\n\t end loop;\n\t Ada.Text_IO.Put_Line(\"!: Quit\");\n      end;\n   end loop;\nend Puzzle_15;\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_70.txt",
        "content": ":- module fifteen.\n:- interface.\n:- use_module random, io.\n\n:- type board.\n:- type invalid_board\n    --->    invalid_board(board).\n:- type move\n    --->    up\n   \u00a0;       down\n   \u00a0;       left\n   \u00a0;       right.\n\n   \u00a0% init(Board):\n   \u00a0% Board is fifteen game in its initial state\n   \u00a0%\n:- pred init(board::out) is det.\n\n   \u00a0% print(Board, !IO)\n:- pred print(board::in, io.io::di, io.io::uo) is det.\n\n   \u00a0% Shuffled(Board, !RS):\n   \u00a0% Board is a fifteen game in a random (but valid) state.\n   \u00a0%\n:- pred shuffled(board::out, random.supply::mdi, random.supply::muo) is det.\n\n   \u00a0% space(Board) = I:\n   \u00a0% I is the index of the blank space in the board.\n   \u00a0% Throws invalid_board iff there is no blank.\n   \u00a0%\n:- func space(board) = int.\n\n   \u00a0% move(Move, !Board):\n   \u00a0% Move the blank space in a board in the given direction.\n   \u00a0% Fails if this is an invalid move to make.\n   \u00a0%\n:- pred move(move::in, board::in, board::out) is semidet.\n\n:- implementation.\n:- import_module bt_array, int, list, string.\n:- use_module array, exception.\n\n:- type board == bt_array(int).\n\ninit(B)\u00a0:- from_list(0, (1 .. 15) ++ [0], B).\n\nprint(B, !IO)\u00a0:-\n    Tile = (func(N) = ( if N = 0 then s(\"  \") else s(string.format(\"%2d\", [i(N)])) )),\n    io.format(\"\\\n|----+----+----+----|\n| %s | %s | %s | %s |\n| %s | %s | %s | %s |\n| %s | %s | %s | %s |\n| %s | %s | %s | %s |\n|----+----+----+----|\n\",\n        map(Tile, to_list(B)), !IO).\n\nshuffled(!:B, !RS)\u00a0:-\n    init(!:B),\n    some [!A] (\n        array.from_list(to_list(!.B),\u00a0!:A),\n        array.random_permutation(!A, !RS),\n        from_list(0, array.to_list(!.A),\u00a0!:B)\n    ).\n\nspace(Board) = I\u00a0:- space(0, Board, I).\n\n:- pred space(int::in, board::in, int::out) is det.\nspace(N, Board, I)\u00a0:-\n    ( if semidet_lookup(Board, N, X) then\n        ( if X = 0 then\n            N = I\n        else\n            space(N + 1, Board, I)\n        )\n    else\n        exception.throw(invalid_board(Board))\n    ).\n\n:- pred swap(int::in, int::in, board::in, board::out) is det.\nswap(I, J, !B)\u00a0:-\n    X =\u00a0!.B ^ elem(I),\n    Y =\u00a0!.B ^ elem(J),\n    !B ^ elem(I)\u00a0:= Y,\n    !B ^ elem(J)\u00a0:= X.\n\nmove(M, !B)\u00a0:- move(space(!.B), M, !B).\n\n:- pred move(int::in, move::in, board::in, board::out) is semidet.\nmove(I, up, !B)\u00a0:-\n    I >= 4,\n    swap(I, I - 4, !B).\nmove(I, down, !B)\u00a0:-\n    I < 12,\n    swap(I, I + 4, !B).\nmove(I, left, !B)\u00a0:-\n    not (I = 0\u00a0; I = 4\u00a0; I = 8\u00a0; I = 12),\n    swap(I, I - 1, !B).\nmove(I, right, !B)\u00a0:-\n    not (I = 3\u00a0; I = 7\u00a0; I = 11\u00a0; I = 15),\n    swap(I, I + 1, !B).",
        "safe": true
    },
    {
        "filename": "15 puzzle game_71.txt",
        "content": ":- module play_fifteen.\n:- interface.\n:- import_module io.\n:- pred main(io::di, io::uo) is det.\n:- implementation.\n:- import_module string.\n:- use_module random, fifteen, exception.\n\nmain(!IO)\u00a0:-\n    seed(Seed, !IO),\n    random.init(Seed, RS),\n    fifteen.shuffled(Board, RS, _),\n    fifteen.print(Board, !IO),\n    play(Board, !IO).\n\n:- type input_command\n    --->    up\u00a0; down\u00a0; left\u00a0; right\n   \u00a0;       quit.\n\n:- type command\n    --->    move(fifteen.move)\n   \u00a0;       quit.\n\n:- pred input(input_command::in, command::out) is det.\ninput(up, move(fifteen.up)).\ninput(down, move(fifteen.down)).\ninput(left, move(fifteen.left)).\ninput(right, move(fifteen.right)).\ninput(quit, quit).\n\n:- pred command(string::in, command::out) is semidet.\ncommand(String, C)\u00a0:-\n    Term = chomp(String) ++ \".\",\n    io.read_from_string(\"play_fifteen\", Term, length(Term),\n        ok(I), io.posn(0, 0, 0), _),\n    input(I, C).\n\n:- pred play(fifteen.board::in, io::di, io::uo) is det.\nplay(!.B, !IO)\u00a0:-\n    io.write_string(\"Move? \", !IO),\n    io.read_line_as_string(Res, !IO),\n    (\n        Res = eof\n   \u00a0;\n        Res = error(_),\n        exception.throw(Res)\n   \u00a0;\n        Res = ok(String),\n        ( if command(String, Command) then\n            (\n                Command = quit,\n                io.write_string(\"Bye\u00a0:(\\n\", !IO)\n           \u00a0;\n                Command = move(Move),\n                ( if fifteen.move(Move, !B) then\n                    ( if fifteen.init(!.B) then\n                        fifteen.print(!.B, !IO),\n                        io.write_string(\"You win!\\n\", !IO)\n                    else\n                        fifteen.print(!.B, !IO),\n                        play(!.B, !IO)\n                    )\n                else\n                    io.write_string(\"Invalid move.\\n\", !IO),\n                    play(!.B, !IO)\n                )\n            )\n        else\n            io.write_string(\"I didn't understand that.\\n\", !IO),\n            play(!.B, !IO)\n        )\n    ).\n\n:- pragma foreign_decl(\"C\", \"#include <time.h>\").\n:- pred seed(int::out, io::di, io::uo) is det.\n:- pragma foreign_proc(\"C\",\n    seed(Seed::out, _IO0::di, _IO::uo),\n    [promise_pure, will_not_call_mercury],\n\"\n    Seed = time(NULL);\n\").",
        "safe": true
    },
    {
        "filename": "15 puzzle game_72.txt",
        "content": "isMiniMicro = version.hostName == \"Mini Micro\"\n\n// These coordinates are [row,col] not [x,y]\nDirections = {\"up\": [-1,0], \"right\": [0,1], \"down\": [1, 0], \"left\": [0,-1]}\nTileNum = range(1, 15)\nPuzzle15 = {\"grid\":[[1,2,3,4],[5,6,7,8],[9,10,11,12],[13,14,15,16]],\n            \"blankPos\": [3,3]}\n\nPuzzle15.__setTile = function(position, value)\n\trow = position[0]; col = position[1]\n\tself.grid[row][col] = value\nend function\n\nPuzzle15.__getTile = function(position)\n\trow = position[0]; col = position[1]\n\treturn self.grid[row][col]\nend function\n\nPuzzle15.__getOppositeDirection = function(direction)\n\tdirections = Directions.indexes\n\toppix = (directions.indexOf(direction) + 2) % 4\n\treturn directions[oppix]\nend function\n\nPuzzle15.getState = function\n\treturn self.grid\nend function\n\nPuzzle15.getBlankPos = function\n\treturn self.blankPos\nend function\n\nPuzzle15.hasWon = function\n\tcount = 1\n\tfor r in range(0, 3)\n\t\tfor c in range(0, 3)\n\t\t\tif self.grid[r][c] != count then return false\n\t\t\tcount += 1\n\t\tend for\n\tend for\n\treturn true\nend function\n\nPuzzle15.move = function(direction)\n\tif not Directions.hasIndex(direction) then return false\n\tmove = Directions[direction]\n\tcurPos = self.blankPos[:]\n\tnewPos = [curPos[0] + move[0], curPos[1] + move[1]]\n\tif (-1 < newPos[0] < 4) and (-1 < newPos[1] < 4) then\n\t\tvalue = self.__getTile(newPos)\n\t\tself.__setTile(curPos, value)\n\t\tself.__setTile(newPos, 16) // 16 is the blank tile\n\t\tself.blankPos = newPos\n\t\treturn true\n\telse\n\t\treturn false\n\tend if\nend function\n\nPuzzle15.shuffle = function(n)\n\tlastMove = \"\"\n\tdirections = Directions.indexes\n\tfor i in range(1, 50)\n\t\twhile true\n\t\t\tmoveTo = directions[floor(rnd * 4)]\n\t\t\toppMove = self.__getOppositeDirection(moveTo)\n\t\t\t\n\t\t\tif self.__getOppositeDirection(moveTo) != lastMove and self.move(moveTo) then\n\t\t\t\tlastMove = moveTo\n\t\t\t\tif isMiniMicro then\n\t\t\t\t\tself.displayBoard\n\t\t\t\t\twait 1/33\n\t\t\t\tend if\n\t\t\t\tbreak\n\t\t\tend if\n\t\tend while\n\tend for\nend function\n\nPuzzle15.displayBoard = function\n\tif isMiniMicro then clear\n\tfor r in range(0, 3)\n\t\tfor c in range(0, 3)\n\t\t\tgrid = self.getState\n\t\t\tif grid[r][c] == 16 then\n\t\t\t\ts = \"   \"\n\t\t\telse\n\t\t\t\ts = (\"  \" + grid[r][c])[-3:]\n\t\t\tend if\n\t\t\tprint s, \"\"\n\t\tend for\n\t\tprint\n\tend for \nend function\n\nPuzzle15.shuffle\n\nwhile not Puzzle15.hasWon\n\tif isMiniMicro then \n\t\tclear\n\telse\n\t\tprint\n\tend if\n\t\n\tPuzzle15.displayBoard\n\twhile true\n\t\tprint\n\t\tmove = input(\"Enter the direction to move the blank in (up, down, left, right): \")\n\t\tmove = move.lower\n\t\tif Directions.hasIndex(move) and Puzzle15.move(move) then break\n\t\tprint \"Please enter a valid move.\"\n\tend while\nend while\nprint \"Congratulations! You solved the puzzle!\"\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_73.txt",
        "content": "woodSound = file.loadSound(\"small_wooden_bricks_movement.mp3\")\npuzzleTiles = function\n\tgfx.scale = 2\n\twoodImg = file.loadImage(\"/sys/pics/textures/Wood.png\")\n\t\n\tgfx.drawImage woodImg,0,0\n\tgfx.color = color.black\n\tgfx.drawRect 6,6, 244,244\n\t\n\tbgBoard = new Sprite\n\tbgBoard.image = gfx.getImage(0, 0, 256, 256)\n\tbgBoard.scale = 1.6\n\tbgBoard.x = (960 - 1.6 * 256) / 2 + 128 * 1.6\n\tbgBoard.y = (640 - 1.6 * 256) / 2 + 128 * 1.6\n\tbgBoard.tint = color.rgb(102,51,0)\n\tsprites = [bgBoard]\n\t\n\tgfx.clear\n\tgfx.drawImage woodImg,0,0\n\tpositions = range(1,15)\n\tpositions.shuffle\n\t\n\tspriteScale = 1.5\n\tspriteSize = 64\n\ttileXOffset = (960 - 3 * spriteSize * spriteScale) / 2\n\ttileYOffset = (640 - 3 * spriteSize * spriteScale) / 2\n\tfor i in range(0,14)\n\t\ts = str(i+1)\n\t\tpos = positions[i]\n\t\tx = pos % 4\n\t\ty = floor(pos / 4)\n\t\txp = x * spriteSize + (spriteSize - (s.len * 14 + 2)) / 2\n\t\typ = y * spriteSize + 20\n\t\tgfx.print s, xp, yp, color.black, \"normal\"\n\t\t\n\t\tsprite = new Sprite\n\t\tsprite.image = gfx.getImage(x * spriteSize, y * spriteSize, spriteSize, spriteSize)\n\t\tsprite.scale = spriteScale\n\t\txs = i % 4; ys = 3 - floor(i / 4)\n\t\tsprite.x = spriteSize * (xs) * spriteScale + tileXOffset\n\t\tsprite.y = spriteSize * ys * spriteScale + tileYOffset\n\t\tsprite.localBounds = new Bounds\n\t\tsprite.localBounds.width = spriteSize\n\t\tsprite.localBounds.height = spriteSize\n\t\t\n\t\t// tint the blocks with different shades of brown\n\t\tsat = floor(rnd * 47 - 10) * 3\n\t\tsprite.tint = color.rgb(153 + sat, 102 + sat, 51 + sat)\n\t\tsprites.push(sprite)\n\tend for\n\t\n\treturn sprites\nend function\n\nmoveTiles = function(sprites, instructions, t = 6, mute = false)\n\tdirection = instructions[0]\n\tdelta = Directions[direction]\n\tif not mute and woodSound and direction then woodSound.play 0.1\n\tfor i in range(96, 1, -t)\n\t\tfor tile in instructions[1:]\n\t\t\tsprites[tile].x += delta[1] * t\n\t\t\tsprites[tile].y += -delta[0] * t\n\t\tend for\n\t\twait 1/3200\n\tend for\nend function\n// These coordinates are [row,col] not [x,y]\nDirections = {\"up\": [-1,0], \"right\": [0,1], \"down\": [1, 0], \"left\": [0,-1]}\nTileNum = range(1, 15)\nPuzzle15 = {\"grid\":[[1,2,3,4],[5,6,7,8],[9,10,11,12],[13,14,15,16]],\n\"blankPos\": [3,3], \"movesToShuffled\": [], \"movesMade\": [], \"moveCount\": 0}\n\nPuzzle15.__setTile = function(position, value)\n\trow = position[0]; col = position[1]\n\tself.grid[row][col] = value\nend function\n\nPuzzle15.__getTile = function(position)\n\trow = position[0]; col = position[1]\n\treturn self.grid[row][col]\nend function\n\nPuzzle15.__getOppositeDirection = function(direction)\n\tdirections = Directions.indexes\n\toppix = (directions.indexOf(direction) + 2) % 4\n\treturn directions[oppix]\nend function\n\nPuzzle15.__getDirectionToTile = function(n)\n\tfor row in range(0, 3)\n\t\tfor col in range(0, 3)\n\t\t\tif self.grid[row][col] == n then\n\t\t\t\tdr = row - self.getBlankPos[0]\n\t\t\t\tdc = col - self.getBlankPos[1]\n\t\t\t\treturn Directions.indexOf([sign(dr), sign(dc)])\n\t\t\tend if\n\t\tend for\n\tend for\n\treturn null\nend function\n\nPuzzle15.getState = function\n\treturn self.grid\nend function\n\nPuzzle15.getBlankPos = function\n\treturn self.blankPos\nend function\n\nPuzzle15.hasWon = function\n\tcount = 1\n\tfor r in range(0, 3)\n\t\tfor c in range(0, 3)\n\t\t\tif self.grid[r][c] != count then return false\n\t\t\tcount += 1\n\t\tend for\n\tend for\n\treturn true\nend function\n\nPuzzle15.move = function(direction)\n\tif not Directions.hasIndex(direction) then return false\n\tmove = Directions[direction]\n\tcurPos = self.blankPos[:]\n\tnewPos = [curPos[0] + move[0], curPos[1] + move[1]]\n\tif (-1 < newPos[0] < 4) and (-1 < newPos[1] < 4) then\n\t\tvalue = self.__getTile(newPos)\n\t\tself.__setTile(curPos, value)\n\t\tself.__setTile(newPos, 16) // 16 is the blank tile\n\t\tself.blankPos = newPos\n\t\tif self.movesMade.len > 0 then\n\t\t\tlastMove = self.movesMade[-1]\n\t\telse\n\t\t\tlastMove = \"\"\n\t\tend if\n\t\tif lastMove != \"\" and self.__getOppositeDirection(lastMove) == direction then\n\t\t\tself.movesMade.pop\n\t\telse\n\t\t\tself.movesMade.push(direction)\n\t\tend if\n\t\tself.moveCount += 1\n\t\treturn value // return tile that was moved\n\telse\n\t\treturn false\n\tend if\nend function\n\nPuzzle15.moveNumber = function(n)\n\tdirection = Puzzle15.__getDirectionToTile(n)\n\torigDir = direction\n\t\n\tif direction == null then return 0\n\ttiles = [self.__getOppositeDirection(direction)]\n\twhile origDir == direction\n\t\ttileNum = self.move(origDir)\n\t\ttiles.insert(1, tileNum)\n\t\tdirection = self.__getDirectionToTile(n)\n\tend while\n\treturn tiles\nend function\n\nPuzzle15.shuffle = function(n, sprites)\n\tlastMove = \"\"\n\tdirections = Directions.indexes\n\tcnt = 0\n\tinstructions = []\n\twhile self.movesToShuffled.len < n\n\t\tif self.movesToShuffled.len == 0 then\n\t\t\tlastMove = \"\"\n\t\telse\n\t\t\tlastMove = self.movesToShuffled[-1]\n\t\tend if\n\t\tmoveTo = directions[floor(rnd * 4)]\n\t\tcnt += 1\n\t\toppMove = self.__getOppositeDirection(moveTo)\n\t\ttileMoved = self.move(moveTo)\n\t\t\n\t\tif oppMove != lastMove and tileMoved then\n\t\t\tinstructions.push([oppMove, tileMoved])\n\t\t\tlastMove = moveTo\n\t\t\tself.movesToShuffled.push(moveTo)\n\t\telse if oppMove == lastMove then\n\t\t\tself.movesToShuffled.pop\n\t\t\tinstructions.pop\n\t\tend if\n\tend while\n\tfor i in instructions\n\t\tmoveTiles(sprites, i, 96, true)\n\tend for\nend function\n\nclear\ndisplay(4).sprites = puzzleTiles\ngfx.clear\nPuzzle15.shuffle(200, display(4).sprites)\n\nwhile not Puzzle15.hasWon\n\tif mouse.button and not wasPressed then\n\t\ttile = 16\n\t\tfor i in range(1, 15)\n\t\t\tsprite = display(4).sprites[i]\n\t\t\t//print sprite.localBounds\n\t\t\tif sprite.contains(mouse) then tile = i\n\t\t\t\n\t\tend for\n\t\tif tile != 16 then\n\t\t\tinstructions = Puzzle15.moveNumber(tile)\n\t\t\tif instructions then moveTiles(display(4).sprites, instructions)\n\t\tend if\n\tend if\n\twasPressed = mouse.button\n\tyield\nend while\nfanfare = file.loadSound(\"/sys/sounds/fanfare.wav\")\nfanfare.play 0.25\nwhile fanfare.isPlaying\nend while\nkey.get\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_74.txt",
        "content": "15Game\u00a0;\n\t; setting the layout\n\tf i=1:1:15 s box(i)=16-i\n\t; no number for box 16\n\ts box(16)=\"\"\n\tf  {\n\t; initialise i for incrementation\n\t\ts i=0\n\t; write out the 4-by-4 box\n\t\tf row=1:1:4 {\n\t\t\tw\u00a0!?20\n\t\t\tf column=1:1:4 {\n\t\t\t\ts i=$i(i)\n\t\t\t\tw $j(box(i),2),\" \"\n\t\t\t}\n\t\t}\n\t\tr\u00a0!!,\"Enter number to move (q to quit): \",number\n\t\tq:number=\"q\"\n\t\tf i=1:1:16 q:box(i)=\"\"\n\t\tif box(i)=\"\" {\n\t\t\tif i>4,number=box(i-4) {\n\t\t\t\ts box(i)=number,box(i-4)=\"\"\n\t\t\t\tw\u00a0!!\n\t\t\t}\n\t\t\telseif i>1,i'=5,i'=9,i'=13,number=box(i-1) {\n\t\t\t\ts box(i)=number,box(i-1)=\"\"\n\t\t\t\tw\u00a0!!\n\t\t\t}\n\t\t\telseif i<16,i'=4,i'=8,i'=12,number=box(i+1) {\n\t\t\t\ts box(i)=number,box(i+1)=\"\"\n\t\t\t\tw\u00a0!!\n\t\t\t}\n\t\t\telseif i<13,number=box(i+4) {\n\t\t\t\ts box(i)=number,box(i+4)=\"\"\n\t\t\t\tw\u00a0!!\n\t\t\t}\n\t\t\telse {\n\t\t\t\tw\u00a0!,\"You have to enter a number either above, below, left or right of the empty space.\"\n\t\t\t}\n\t\t}\n\t}\n\tq\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_75.txt",
        "content": "import random, terminal\n\ntype\n  Tile = uint8\n  Board = array[16, Tile]\n\ntype\n  Operation = enum\n    opInvalid\n    opUp\n    opDown\n    opLeft\n    opRight\n    opQuit\n    opRestart\n\nfunc charToOperation(c: char): Operation =\n  case c\n  of 'w', 'W': opUp\n  of 'a', 'A': opLeft\n  of 's', 'S': opDown\n  of 'd', 'D': opRight\n  of 'q', 'Q': opQuit\n  of 'r', 'R': opRestart\n  else: opInvalid\n\nproc getKey(): Operation =\n  var c = getch()\n  if c == '\\e':\n    c = getch()\n    if c == '[':\n      case getch()\n      of 'A': opUp\n      of 'D': opLeft\n      of 'B': opDown\n      of 'C': opRight\n      else: opInvalid\n    else: charToOperation c\n  else: charToOperation c\n\nfunc isSolved(board: Board): bool =\n  for i in 0..<board.high:\n    if i != board[i].int - 1:\n      return false\n  true\n\nfunc findTile(b: Board, n: Tile): int =\n  for i in 0..b.high:\n    if b[i] == n:\n      return i\n\nfunc canSwap(a, b: int): bool =\n  let dist = a - b\n  dist == 4 or dist == -4 or\n    (dist == 1 and a mod 4 != 0) or\n    (dist == -1 and b mod 4 != 0)\n\nfunc pad(i: Tile): string =\n  if i == 0:\n    \"\u2502  \"\n  elif i < 10:\n    \"\u2502 \" & $i\n  else:\n    \"\u2502\" & $i\n\nproc draw(b: Board) =\n  echo \"\u250c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u2510\\n\",\n     b[0].pad, b[1].pad, b[2].pad, b[3].pad,\n     \"\u2502\\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\\n\",\n     b[4].pad, b[5].pad, b[6].pad, b[7].pad,\n     \"\u2502\\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\\n\",\n     b[8].pad, b[9].pad, b[10].pad, b[11].pad,\n     \"\u2502\\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\\n\",\n     b[12].pad, b[13].pad, b[14].pad, b[15].pad,\n     \"\u2502\\n\u2514\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2518\"\n\nproc clearScreen ()=\n  for i in 1..10:\n    eraseLine()\n    cursorUp()\n\nfunc calcPosMove(b: var Board; o: Operation; ): int =\n  var posEmpty = b.findTile 0\n  case o\n  of opUp:    return posEmpty + 4\n  of opDown:  return posEmpty - 4\n  of opLeft:  return posEmpty + 1\n  of opRight: return posEmpty - 1\n  else: return -1\n\nproc moveTile (b : var Board, op : Operation) : bool =\n  let posMove = b.calcPosMove op\n  let posEmpty = b.findTile 0\n  if posMove < 16 and posMove >= 0 and canSwap(posEmpty, posMove):\n    swap b[posEmpty], b[posMove]\n    return true\n  return false\n\nproc shuffleBoard ( b: var Board, nSteps : int = 2000 ) =\n  var opMove = @[opUp, opLeft, opDown, opRight]\n  for i in 0 ..< nSteps:\n    let op = opMove[rand(3)]\n    discard b.moveTile op\n\nproc generateBoard: Board =\n  for i in 0..15:\n    if i == 15 :\n      result[i] = 0\n    else:\n      result[i] = (i + 1).Tile\n  shuffleBoard result\n\nwhen isMainModule:\n  randomize()\n  var\n    board = generateBoard()\n    empty = board.findTile 0\n\n  block gameLoop:\n    while not isSolved board:\n      # draw\n      draw board\n      echo \"Press arrow keys or WASD to move, R to Restart, Q to Quit\"\n\n      # handle input\n      while true:\n        let op = getKey()\n        case op\n        of opRestart:\n          board = generateBoard()\n          empty = board.findTile 0\n          break\n        of opQuit: break gameLoop\n        of opInvalid: continue\n        else:\n          if board.moveTile op:\n            empty = board.findTile 0\n            break\n\n      clearScreen()\n\n    draw board\n    echo \"You win!\"\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_76.txt",
        "content": "\u250c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u2510\n\u250212\u250211\u250215\u2502 2\u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u2502 6\u250214\u2502 3\u2502 7\u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u2502 5\u2502  \u2502 9\u250210\u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u2502 1\u2502 4\u2502 8\u250213\u2502\n\u2514\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2518\nPress arrow keys or WASD to move, R to Restart, Q to Quit",
        "safe": true
    },
    {
        "filename": "15 puzzle game_77.txt",
        "content": "module Puzzle =\nstruct\n  type t = int array\n  let make () =\n    [| 15; (* 0: the empty space *)\n        0;  1;  2;  3;\n        4;  5;  6;  7;\n        8;  9; 10; 11;\n       12; 13; 14;  |]\n\n  let move p n =\n    let hole, i = p.(0), p.(n) in\n    p.(0) <- i;\n    p.(n) <- hole\n\n  let print p =\n    let out = Array.make 16 \"   \" in\n    for i = 1 to 15 do\n      out.(p.(i)) <- Printf.sprintf \" %2d\" i\n    done;\n    for i = 0 to 15 do\n      if (i mod 4) = 0 then print_newline ();\n      print_string out.(i);\n    done\n\n  let shuffle p n =\n    for i = 1 to n do\n      move p (1 + Random.int 15)\n    done\nend\n\nlet play () =\n  let p = Puzzle.make () in\n  Puzzle.shuffle p 20;\n  while true do\n    Puzzle.print p;\n    print_string \" > \";\n    Puzzle.move p (read_line () |> int_of_string)\n  done\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_78.txt",
        "content": "# play ();;\n\n  8 11  7 13\n  3  6    15\n  9 10 12  4\n  1  5 14  2 > 6\n\n  8 11  7 13\n  3     6 15\n  9 10 12  4\n  1  5 14  2 > 11\n\n  8     7 13\n  3 11  6 15\n  9 10 12  4\n  1  5 14  2 > 8\n\n     8  7 13\n  3 11  6 15\n  9 10 12  4\n  1  5 14  2 > 3\n\n  3  8  7 13\n    11  6 15\n  9 10 12  4\n  1  5 14  2 > 11\n\n  3  8  7 13\n 11     6 15\n  9 10 12  4\n  1  5 14  2 > 8\n\n  3     7 13\n 11  8  6 15\n  9 10 12  4\n  1  5 14  2 > 3\n\n     3  7 13\n 11  8  6 15\n  9 10 12  4\n  1  5 14  2 > \n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_79.txt",
        "content": "program fifteen;\n{$mode objfpc}\n{$modeswitch advancedrecords}\n{$coperators on}\nuses\n  SysUtils, crt;\ntype\n  TPuzzle = record\n  private\n  const\n    ROW_COUNT  = 4;\n    COL_COUNT  = 4;\n    CELL_COUNT = ROW_COUNT * COL_COUNT;\n    RAND_RANGE = 101;\n  type\n    TTile          = 0..Pred(CELL_COUNT);\n    TAdjacentCell  = (acLeft, acTop, acRight, acBottom);\n    TPossibleMoves = set of TTile;\n    TCellAdjacency = set of TAdjacentCell;\n    TBoard         = array[0..Pred(CELL_COUNT)] of TTile;\n  class var\n    HBar: string;\n  var\n    FBoard: TBoard;\n    FZeroPos,\n    FMoveCount: Integer;\n    FZeroAdjacency: TCellAdjacency;\n    FPossibleMoves: TPossibleMoves;\n    FSolved: Boolean;\n    procedure DoMove(aTile: TTile);\n    procedure CheckPossibleMoves;\n    procedure PrintBoard;\n    procedure PrintPossibleMoves;\n    procedure TestSolved;\n    procedure GenerateBoard;\n    class constructor Init;\n  public\n    procedure New;\n    function  UserMoved: Boolean;\n    property  MoveCount: Integer read FMoveCount;\n    property  Solved: Boolean read FSolved;\n  end;\n\nprocedure TPuzzle.DoMove(aTile: TTile);\nvar\n  Pos: Integer = -1;\n  Adj: TAdjacentCell;\nbegin\n  for Adj in FZeroAdjacency do\n    begin\n      case Adj of\n        acLeft:   Pos := Pred(FZeroPos);\n        acTop:    Pos := FZeroPos - COL_COUNT;\n        acRight:  Pos := Succ(FZeroPos);\n        acBottom: Pos := FZeroPos + COL_COUNT;\n      end;\n      if FBoard[Pos] = aTile then\n        break;\n    end;\n  FBoard[FZeroPos] := aTile;\n  FZeroPos := Pos;\n  FBoard[Pos] := 0;\nend;\n\nprocedure TPuzzle.CheckPossibleMoves;\nvar\n  Row, Col: Integer;\nbegin\n  Row := FZeroPos div COL_COUNT;\n  Col := FZeroPos mod COL_COUNT;\n  FPossibleMoves := [];\n  FZeroAdjacency := [];\n  if Row > 0 then\n    begin\n      FPossibleMoves += [FBoard[FZeroPos - COL_COUNT]];\n      FZeroAdjacency += [acTop];\n    end;\n  if Row < Pred(ROW_COUNT) then\n    begin\n      FPossibleMoves += [FBoard[FZeroPos + COL_COUNT]];\n      FZeroAdjacency += [acBottom];\n    end;\n  if Col > 0 then\n    begin\n      FPossibleMoves += [FBoard[Pred(FZeroPos)]];\n      FZeroAdjacency += [acLeft];\n    end;\n  if Col < Pred(COL_COUNT) then\n    begin\n      FPossibleMoves += [FBoard[Succ(FZeroPos)]];\n      FZeroAdjacency += [acRight];\n    end;\nend;\n\nprocedure TPuzzle.PrintBoard;\nconst\n  Space = ' ';\n  VBar  = '|';\n  VBar1 = '| ';\n  VBar2 = '|  ';\n  VBar3 = '|    ';\nvar\n  I, J, Pos, Tile: Integer;\n  Row: string;\nbegin\n  ClrScr;\n  Pos := 0;\n  WriteLn(HBar);\n  for I := 1 to ROW_COUNT do\n    begin\n      Row := '';\n      for J := 1 to COL_COUNT do\n        begin\n          Tile := Integer(FBoard[Pos]);\n          case Tile of\n            0:    Row += VBar3;\n            1..9: Row += VBar2 + Tile.ToString + Space;\n          else\n            Row += VBar1 + Tile.ToString + Space;\n          end;\n          Inc(Pos);\n        end;\n      WriteLn(Row + VBar);\n      WriteLn(HBar);\n    end;\n  if not Solved then\n    PrintPossibleMoves;\nend;\n\nprocedure TPuzzle.PrintPossibleMoves;\nvar\n  pm: TTile;\n  spm: string = '';\nbegin\n  for pm in FPossibleMoves do\n    spm += Integer(pm).ToString + ' ';\n  WriteLn('possible moves: ', spm);\nend;\n\nprocedure TPuzzle.TestSolved;\n  function IsSolved: Boolean;\n  var\n    I: Integer;\n  begin\n    for I := 0 to CELL_COUNT - 3 do\n      if FBoard[I] <> Pred(FBoard[Succ(I)]) then\n        exit(False);\n    Result := True;\n  end;\nbegin\n  FSolved := IsSolved;\n  if not Solved then\n    CheckPossibleMoves;\nend;\n\nprocedure TPuzzle.GenerateBoard;\nvar\n  I, CurrMove, SelMove: Integer;\n  Tile: TTile;\nbegin\n  FZeroPos := Pred(CELL_COUNT);\n  FBoard[FZeroPos] := 0;\n  for I := 0 to CELL_COUNT - 2 do\n    FBoard[I] := Succ(I);\n  for I := 1 to Random(RAND_RANGE) do\n    begin\n      CheckPossibleMoves;\n      SelMove := 0;\n      for Tile in FPossibleMoves do\n        Inc(SelMove);\n      SelMove := Random(SelMove);\n      CurrMove := 0;\n      for Tile in FPossibleMoves do\n        begin\n          if CurrMove = SelMove then\n            begin\n              DoMove(Tile);\n              break;\n            end;\n          Inc(CurrMove);\n        end;\n    end;\nend;\n\nclass constructor TPuzzle.Init;\nvar\n  I: Integer;\nbegin\n  HBar := '';\n  for I := 1 to COL_COUNT do\n    HBar += '+----';\n  HBar += '+';\nend;\n\nprocedure TPuzzle.New;\nbegin\n  FSolved := False;\n  FMoveCount := 0;\n  GenerateBoard;\n  CheckPossibleMoves;\n  PrintBoard;\nend;\n\nfunction TPuzzle.UserMoved: Boolean;\nconst\n  Sorry          = 'sorry, ';\n  InvalidInput   = ' is invalid input';\n  ImpossibleMove = ' is impossible move';\nvar\n  UserInput: string;\n  Tile: Integer = 0;\nbegin\n  ReadLn(UserInput);\n  case LowerCase(UserInput) of\n    'c', 'cancel': exit(False);\n  end;\n  Result := True;\n  if not Tile.TryParse(UserInput, Tile) then\n    begin\n      WriteLn(Sorry, UserInput, InvalidInput);\n      exit;\n    end;\n  if not (Tile in [1..Pred(CELL_COUNT)]) then\n    begin\n      WriteLn(Sorry, Tile, InvalidInput);\n      exit;\n    end;\n  if not (Tile in FPossibleMoves) then\n    begin\n      WriteLn(Sorry, Tile, ImpossibleMove);\n      PrintPossibleMoves;\n      exit;\n    end;\n  DoMove(Tile);\n  Inc(FMoveCount);\n  TestSolved;\n  PrintBoard;\nend;\n\nprocedure PrintStart;\nbegin\n  ClrScr;\n  WriteLn('Fifteen puzzle start:');\n  WriteLn('  enter a tile number and press <enter> to move' );\n  WriteLn('  enter Cancel(C) and press <enter> to exit' );\n  Window(10, 4, 58, 21);\nend;\n\nprocedure Terminate;\nbegin\n  ClrScr;\n  Window(1, 1, 80, 25);\n  ClrScr;\n  WriteLn('Fifteen puzzle exit.');\n  Halt;\nend;\n\nfunction UserWantContinue(aMoveCount: Integer): Boolean;\nvar\n  UserInput: string;\nbegin\n  WriteLn('Congratulations! Puzzle solved in ', aMoveCount, ' moves.');\n  WriteLn('Play again(Yes(Y)/<any button>)?');\n  ReadLn(UserInput);\n  case LowerCase(UserInput) of\n    'y', 'yes': exit(True);\n  end;\n  Result := False;\nend;\n\nprocedure Run;\nvar\n  Puzzle: TPuzzle;\nbegin\n  Randomize;\n  PrintStart;\n  repeat\n    Puzzle.New;\n    while not Puzzle.Solved do\n      if not Puzzle.UserMoved then\n        Terminate;\n    if not UserWantContinue(Puzzle.MoveCount) then\n      Terminate;\n  until False;\nend;\n\nbegin\n  Run;\nend.\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_8.txt",
        "content": ">./puzzle_15 4\n  1  2  3  4\n  5  6  7  8\n  9 14 10 11\n 13    15 12\n8\nUp!\n  1  2  3  4\n  5  6  7  8\n  9    10 11\n 13 14 15 12\n6\nRight!\n  1  2  3  4\n  5  6  7  8\n  9 10    11\n 13 14 15 12\n5\nPossible Moves and Commands:\nu,U,^,8: UP   d,D,v,2: DOWN   l,L,<,4: LEFT   r,R,>,6: RIGHT  \u00a0!: Quit\n  1  2  3  4\n  5  6  7  8\n  9 10    11\n 13 14 15 12\n6\nRight!\n  1  2  3  4\n  5  6  7  8\n  9 10 11   \n 13 14 15 12\n2\nDown!\n  1  2  3  4\n  5  6  7  8\n  9 10 11 12\n 13 14 15   \n!\n 4 moves!",
        "safe": true
    },
    {
        "filename": "15 puzzle game_80.txt",
        "content": "// \u0418\u0433\u0440\u0430 \u0432 15 PABCWork.NET\\Samples\\Games\\15.pas\nuses GraphABC,ABCObjects,ABCButtons;\n\nconst\n/// \u0440\u0430\u0437\u043c\u0435\u0440 \u043f\u043e\u043b\u044f\n  n = 4;\n/// \u0440\u0430\u0437\u043c\u0435\u0440 \u0444\u0438\u0448\u043a\u0438\n  sz = 100;\n/// \u0437\u0430\u0437\u043e\u0440 \u043c\u0435\u0436\u0434\u0443 \u0444\u0438\u0448\u043a\u0430\u043c\u0438\n  zz = 10;\n/// \u043e\u0442\u0441\u0442\u0443\u043f \u043e\u0442 \u043b\u0435\u0432\u043e\u0433\u043e \u0438 \u043f\u0440\u0430\u0432\u043e\u0433\u043e \u043a\u0440\u0430\u0435\u0432\n  x0 = 20;\n/// \u043e\u0442\u0441\u0442\u0443\u043f \u043e\u0442 \u0432\u0435\u0440\u0445\u043d\u0435\u0433\u043e \u0438 \u043d\u0438\u0436\u043d\u0435\u0433\u043e \u043a\u0440\u0430\u0435\u0432\n  y0 = 20;\n\nvar\n  p: array [1..n,1..n] of SquareABC;\n  digits: array [1..n*n-1] of integer;\n\n  MeshButton: ButtonABC;\n  StatusRect: RectangleABC;\n\n  EmptyCellX,EmptyCellY: integer;\n  MovesCount: integer;\n  EndOfGame: boolean;  // True \u0435\u0441\u043b\u0438 \u0432\u0441\u0435 \u0444\u0438\u0448\u043a\u0438 \u0441\u0442\u043e\u044f\u0442 \u043d\u0430 \u0441\u0432\u043e\u0438\u0445 \u043c\u0435\u0441\u0442\u0430\u0445\n\n// \u041f\u043e\u043c\u0435\u043d\u044f\u0442\u044c \u043c\u0435\u0441\u0442\u0430\u043c\u0438 \u0434\u0432\u0435 \u0444\u0438\u0448\u043a\u0438\nprocedure Swap(var p,p1: SquareABC);\nbegin\n  PABCSystem.Swap(p,p1);\n  var i := p.Left;\n  p.Left := p1.Left;\n  p1.Left := i;\n  i := p.Top;\n  p.Top := p1.Top;\n  p1.Top := i;\nend;\n\n// \u041e\u043f\u0440\u0435\u0434\u0435\u043b\u0438\u0442\u044c, \u044f\u0432\u043b\u044f\u044e\u0442\u0441\u044f \u043b\u0438 \u043a\u043b\u0435\u0442\u043a\u0438 \u0441\u043e\u0441\u0435\u0434\u044f\u043c\u0438\nfunction Neighbours(x1,y1,x2,y2: integer): boolean;\nbegin\n  Result := (Abs(x1-x2)=1) and (y1=y2) or (Abs(y1-y2)=1) and (x1=x2)\nend;\n\n// \u0417\u0430\u043f\u043e\u043b\u043d\u0438\u0442\u044c \u0432\u0441\u043f\u043e\u043c\u043e\u0433\u0430\u0442\u0435\u043b\u044c\u043d\u044b\u0439 \u043c\u0430\u0441\u0441\u0438\u0432 \u0446\u0438\u0444\u0440\nprocedure FillDigitsArr;\nbegin\n  for var i:=1 to n*n-1 do\n    digits[i] := i;\nend;\n\n// \u041f\u0435\u0440\u0435\u043c\u0435\u0448\u0430\u0442\u044c \u0432\u0441\u043f\u043e\u043c\u043e\u0433\u0430\u0442\u0435\u043b\u044c\u043d\u044b\u0439 \u043c\u0430\u0441\u0441\u0438\u0432 \u0446\u0438\u0444\u0440. \u041a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u043e\u0431\u043c\u0435\u043d\u043e\u0432 \u0434\u043e\u043b\u0436\u043d\u043e \u0431\u044b\u0442\u044c \u0447\u0435\u0442\u043d\u044b\u043c\nprocedure MixDigitsArr;\nvar x: integer;\nbegin\n  for var i:=1 to n*n-1 do\n  begin\n    repeat\n      x := Random(15)+1;\n    until x<>i;\n    Swap(digits[i],digits[x]);\n  end;\n  if n mod 2=0 then\n    Swap(digits[1],digits[2]); // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u043e\u0431\u043c\u0435\u043d\u043e\u0432 \u0434\u043e\u043b\u0436\u043d\u043e \u0431\u044b\u0442\u044c \u0447\u0435\u0442\u043d\u044b\u043c\nend;\n\n// \u0417\u0430\u043f\u043e\u043b\u043d\u0438\u0442\u044c \u0434\u0432\u0443\u043c\u0435\u0440\u043d\u044b\u0439 \u043c\u0430\u0441\u0441\u0438\u0432 \u0444\u0438\u0448\u0435\u043a. \u0412\u043c\u0435\u0441\u0442\u043e \u043f\u0443\u0441\u0442\u043e\u0439 \u044f\u0447\u0435\u0439\u043a\u0438 - \u0431\u0435\u043b\u0430\u044f \u0444\u0438\u0448\u043a\u0430 \u0441 \u0447\u0438\u0441\u043b\u043e\u043c 0\nprocedure Fill15ByDigitsArr;\nbegin\n  Swap(p[EmptyCellY,EmptyCellX],p[n,n]); // \u041f\u0435\u0440\u0435\u043c\u0435\u0441\u0442\u0438\u0442\u044c \u043f\u0443\u0441\u0442\u0443\u044e \u0444\u0438\u0448\u043a\u0443 \u0432 \u043f\u0440\u0430\u0432\u044b\u0439 \u043d\u0438\u0436\u043d\u0438\u0439 \u0443\u0433\u043e\u043b\n  EmptyCellX := n;\n  EmptyCellY := n;\n  var i := 1;\n  for var y:=1 to n do\n  for var x:=1 to n do\n  begin\n    if x*y=n*n then exit;\n    p[y,x].Number := digits[i];\n    i += 1;\n  end;\nend;\n\n// \u041f\u0435\u0440\u0435\u043c\u0435\u0448\u0430\u0442\u044c \u043c\u0430\u0441\u0441\u0438\u0432 \u0444\u0438\u0448\u0435\u043a\nprocedure Mix15;\nbegin\n  MixDigitsArr;\n  Fill15ByDigitsArr;\n  MovesCount := 0;\n  EndOfGame := False;\n  StatusRect.Text := '\u041a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432: '+IntToStr(MovesCount);\n  StatusRect.Color := RGB(200,200,255);\nend;\n\n// \u0421\u043e\u0437\u0434\u0430\u0442\u044c \u043c\u0430\u0441\u0441\u0438\u0432 \u0444\u0438\u0448\u0435\u043a\nprocedure Create15;\nbegin\n  EmptyCellX := n;\n  EmptyCellY := n;\n  for var x:=1 to n do\n  for var y:=1 to n do\n  begin\n    p[y,x] := new SquareABC(x0+(x-1)*(sz+zz),y0+(y-1)*(sz+zz),sz,clMoneyGreen);\n    p[y,x].BorderColor := clGreen;\n    p[y,x].BorderWidth := 2;\n    p[y,x].TextScale := 0.7;\n  end;\n  p[EmptyCellY,EmptyCellX].Color := clWhite;\n  p[EmptyCellY,EmptyCellX].BorderColor := clWhite;\n  FillDigitsArr;\n  MixDigitsArr;\n  Fill15ByDigitsArr;\nend;\n\n// \u041f\u0440\u043e\u0432\u0435\u0440\u0438\u0442\u044c, \u0432\u0441\u0435 \u043b\u0438 \u0444\u0438\u0448\u043a\u0438 \u0441\u0442\u043e\u044f\u0442 \u043d\u0430 \u0441\u0432\u043e\u0438\u0445 \u043c\u0435\u0441\u0442\u0430\u0445\nfunction IsSolution: boolean;\nbegin\n  Result:=True;\n  var i:=1;\n  for var y:=1 to n do\n  for var x:=1 to n do\n  begin\n    if p[y,x].Number<>i then\n    begin\n      Result:=False;\n      break;\n    end;\n    i += 1;\n    if i=n*n then i:=0;\n  end;\nend;\n\nprocedure MouseDown(x,y,mb: integer);\nbegin\n  if EndOfGame then // \u0415\u0441\u043b\u0438 \u0432\u0441\u0435 \u0444\u0438\u0448\u043a\u0438 \u043d\u0430 \u0441\u0432\u043e\u0438\u0445 \u043c\u0435\u0441\u0442\u0430\u0445, \u0442\u043e \u043d\u0435 \u0440\u0435\u0430\u0433\u0438\u0440\u043e\u0432\u0430\u0442\u044c \u043d\u0430 \u043c\u044b\u0448\u044c \u0438 \u0436\u0434\u0430\u0442\u044c \u043d\u0430\u0436\u0430\u0442\u0438\u044f \u043a\u043d\u043e\u043f\u043a\u0438 \"\u041f\u0435\u0440\u0435\u043c\u0435\u0448\u0430\u0442\u044c\"\n    exit;\n  if ObjectUnderPoint(x,y)=nil then // E\u0441\u043b\u0438 \u043c\u044b \u0449\u0435\u043b\u043a\u043d\u0443\u043b\u0438 \u043d\u0435 \u043d\u0430 \u043e\u0431\u044a\u0435\u043a\u0442\u0435, \u0442\u043e \u043d\u0435 \u0440\u0435\u0430\u0433\u0438\u0440\u043e\u0432\u0430\u0442\u044c \u043d\u0430 \u043c\u044b\u0448\u044c\n    exit;\n  var fx := (x-x0) div (sz+zz) + 1; // \u0412\u044b\u0447\u0438\u0441\u043b\u0438\u0442\u044c \u043a\u043e\u043e\u0440\u0434\u0438\u043d\u0430\u0442\u044b \u043d\u0430 \u0434\u043e\u0441\u043a\u0435 \u0434\u043b\u044f \u044f\u0447\u0435\u0439\u043a\u0438, \u043d\u0430 \u043a\u043e\u0442\u043e\u0440\u043e\u0439 \u043c\u044b \u0449\u0435\u043b\u043a\u043d\u0443\u043b\u0438 \u043c\u044b\u0448\u044c\u044e\n  var fy := (y-y0) div (sz+zz) + 1;\n  if (fx>n) or (fy>n) then\n    exit;\n  if Neighbours(fx,fy,EmptyCellX,EmptyCellY) then // \u0415\u0441\u043b\u0438 \u044f\u0447\u0435\u0439\u043a\u0430 \u0441\u043e\u0441\u0435\u0434\u0441\u0442\u0432\u0443\u0435\u0442 \u0441 \u043f\u0443\u0441\u0442\u043e\u0439, \u0442\u043e \u043f\u043e\u043c\u0435\u043d\u044f\u0442\u044c \u0438\u0445 \u043c\u0435\u0441\u0442\u0430\u043c\u0438\n  begin\n    Swap(p[EmptyCellY,EmptyCellX],p[fy,fx]);\n    EmptyCellX := fx;\n    EmptyCellY := fy;\n    Inc(MovesCount);\n    StatusRect.Text := '\u041a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432: ' + MovesCount;\n    if IsSolution then\n    begin\n      StatusRect.Text := '\u041f\u043e\u0431\u0435\u0434\u0430! \u0421\u0434\u0435\u043b\u0430\u043d\u043e \u0445\u043e\u0434\u043e\u0432: ' + MovesCount;\n      StatusRect.Color := RGB(255,200,200);\n      EndOfGame := True;\n    end\n  end;\nend;\n\nbegin\n  SetSmoothingOff;\n  Window.Title := '\u0418\u0433\u0440\u0430 \u0432 15';\n  Window.IsFixedSize := True;\n  SetWindowSize(2*x0+(sz+zz)*n-zz,2*y0+(sz+zz)*n-zz+90);\n  \n  EndOfGame := False;\n  Create15;\n\n  MeshButton := ButtonABC.Create((WindowWidth-200) div 2,2*y0+(sz+zz)*n-zz,200,'\u041f\u0435\u0440\u0435\u043c\u0435\u0448\u0430\u0442\u044c',clLightGray);\n  MeshButton.OnClick := Mix15;\n  StatusRect := new RectangleABC(0,WindowHeight-40,WindowWidth,40,RGB(200,200,255));\n  StatusRect.TextVisible := True;\n  StatusRect.Text := '\u041a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432: '+IntToStr(MovesCount);\n  StatusRect.BorderWidth := 2;\n  StatusRect.BorderColor := RGB(80,80,255);\n\n  MovesCount := 0;\n\n  OnMouseDown := MouseDown;\nend.\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_81.txt",
        "content": "use strict;\nuse warnings;\n\nuse Getopt::Long;\nuse List::Util 1.29 qw(shuffle pairmap first all);\nuse Tk;\n    # 5 options                                 1 label text\nmy ($verbose,@fixed,$nocolor,$charsize,$extreme,$solvability);\n\nunless (GetOptions (\n                     'verbose!' => \\$verbose,\n                     'tiles|positions=i{16}' => \\@fixed,\n                     'nocolor' => \\$nocolor,\n                     'charsize|size|c|s=i' => \\$charsize,\n                     'extreme|x|perl' => \\$extreme,\n                    )\n        ) { die \"invalid arguments!\";}\n\n@fixed = &check_req_pos(@fixed) if @fixed;\n\nmy $mw = Tk::MainWindow->new(-bg=>'black',-title=>'Giuoco del 15');\n\nif ($nocolor){ $mw->optionAdd( '*Button.background',   'ivory' );}\n\n$mw->optionAdd('*Button.font', 'Courier '.($charsize or 16).' bold' );\n$mw->bind('<Control-s>', sub{#&init_board;\n                             &shuffle_board});\n\nmy $top_frame = $mw->Frame( -borderwidth => 2, -relief => 'groove',\n                           )->pack(-expand => 1, -fill => 'both');\n\n$top_frame->Label( -textvariable=>\\$solvability,\n                  )->pack(-expand => 1, -fill => 'both');\n\nmy $game_frame = $mw->Frame(  -background=>'saddlebrown',\n                              -borderwidth => 10, -relief => 'groove',\n                            )->pack(-expand => 1, -fill => 'both');\n\n# set victory conditions in pairs of coordinates\nmy @vic_cond =  pairmap {\n       [$a,$b]\n    } qw(0 0 0 1 0 2 0 3\n         1 0 1 1 1 2 1 3\n         2 0 2 1 2 2 2 3\n         3 0 3 1 3 2 3 3);\n\nmy $board = [];\n\nmy $victorious = 0;\n\n&init_board;\n\nif ( $extreme ){ &extreme_perl}\n\n&shuffle_board;\n\nMainLoop;\n\n################################################################################\nsub init_board{\n  # tiles from 1 to 15\n  for (0..14){\n     $$board[$_]={\n          btn=>$game_frame->Button(\n                            -text => $_+1,\n                            -relief => 'raised',\n                            -borderwidth => 3,\n                            -height => 2,\n                            -width =>  4,\n                                  -background=>$nocolor?'ivory':'gold1',\n                                  -activebackground => $nocolor?'ivory':'gold1',\n                                  -foreground=> $nocolor?'black':'DarkRed',\n                                  -activeforeground=>$nocolor?'black':'DarkRed'\n          ),\n          name => $_+1,     # x and y set by shuffle_board\n     };\n     if (($_+1) =~ /^(2|4|5|7|10|12|13|15)$/ and !$nocolor){\n         $$board[$_]{btn}->configure(\n                                  -background=>'DarkRed',\n                                  -activebackground => 'DarkRed',\n                                  -foreground=> 'gold1',\n                                  -activeforeground=>'gold1'\n         );\n     }\n   }\n   # empty tile\n   $$board[15]={\n          btn=>$game_frame->Button(\n                            -relief => 'sunken',\n                            -borderwidth => 3,\n                            -background => 'lavender',\n                            -height => 2,\n                            -width =>  4,\n          ),\n          name => 16,      # x and y set by shuffle_board\n     };\n}\n################################################################################\nsub shuffle_board{\n    if ($victorious){\n        $victorious=0;\n        &init_board;\n    }\n    if (@fixed){\n          my $index = 0;\n\n          foreach my $tile(@$board[@fixed]){\n                  my $xy = $vic_cond[$index];\n                  ($$tile{x},$$tile{y}) = @$xy;\n                  $$tile{btn}->grid(-row=>$$xy[0], -column=> $$xy[1]);\n                  $$tile{btn}->configure(-command =>[\\&move,$$xy[0],$$xy[1]]);\n                  $index++;\n          }\n          undef @fixed;\n    }\n    else{\n        my @valid = shuffle (0..15);\n        foreach my $tile ( @$board ){\n            my $xy = $vic_cond[shift @valid];\n            ($$tile{x},$$tile{y}) = @$xy;\n            $$tile{btn}->grid(-row=>$$xy[0], -column=> $$xy[1]);\n            $$tile{btn}->configure(-command => [ \\&move, $$xy[0], $$xy[1] ]);\n        }\n    }\n    my @appear =  map {$_->{name}==16?'X':$_->{name}}\n                  sort{$$a{x}<=>$$b{x}||$$a{y}<=>$$b{y}}@$board;\n    print \"\\n\".('-' x 57).\"\\n\".\n          \"Appearence of the board:\\n[@appear]\\n\".\n          ('-' x 57).\"\\n\".\n          \"current\\tfollowers\\t               less than current\\n\".\n          ('-' x 57).\"\\n\" if $verbose;\n    # remove the, from now on inutile, 'X' for the empty space\n    @appear = grep{$_ ne 'X'} @appear;\n    my $permutation;\n    foreach my $num (0..$#appear){\n        last if $num == $#appear;\n         my $perm;\n          $perm += grep {$_ < $appear[$num]} @appear[$num+1..$#appear];\n          if ($verbose){\n            print \"[$appear[$num]]\\t@appear[$num+1..$#appear]\".\n            (\" \" x (37 - length \"@appear[$num+1..$#appear]\")).\n            \"\\t   $perm \".($num == $#appear  - 1 ? '=' : '+').\"\\n\";\n          }\n          $permutation+=$perm;\n    }\n    print +(' ' x 50).\"----\\n\" if $verbose;\n    if ($permutation % 2){\n        print \"Impossible game with odd permutations!\".(' ' x 13).\n              \"$permutation\\n\"if $verbose;\n        $solvability = \"Impossible game with odd permutations [$permutation]\\n\".\n                        \"(ctrl-s to shuffle)\".\n                        (($verbose or $extreme) ? '' :\n                           \" run with --verbose to see more info\");\n        return;\n    }\n    # 105 is the max permutation\n    my $diff =  $permutation == 0 ? 'SOLVED' :\n                $permutation < 35 ? 'EASY  ' :\n                $permutation < 70 ? 'MEDIUM' : 'HARD  ';\n    print \"$diff game with even permutations\".(' ' x 17).\n          \"$permutation\\n\" if $verbose;\n    $solvability = \"$diff game with permutation parity of [$permutation]\\n\".\n                    \"(ctrl-s to shuffle)\";\n}\n################################################################################\nsub move{\n    # original x and y\n    my ($ox, $oy) = @_;\n    my $self = first{$_->{x} == $ox and $_->{y} == $oy} @$board;\n    return if $$self{name}==16;\n    # check if one in n,s,e,o is the empty one\n    my $empty = first {$_->{name} == 16 and\n                          ( ($_->{x}==$ox-1 and $_->{y}==$oy) or\n                            ($_->{x}==$ox+1 and $_->{y}==$oy) or\n                            ($_->{x}==$ox and $_->{y}==$oy-1) or\n                            ($_->{x}==$ox and $_->{y}==$oy+1)\n                           )\n                      } @$board;\n    return unless $empty;\n    # empty x and y\n    my ($ex,$ey) = ($$empty{x},$$empty{y});\n    # reconfigure emtpy tile\n    $$empty{btn}->grid(-row => $ox, -column => $oy);\n    $$empty{x}=$ox;    $$empty{y}=$oy;\n    # reconfigure pressed tile\n    $$self{btn}->grid(-row => $ex, -column => $ey);\n    $$self{btn}->configure(-command => [ \\&move, $ex, $ey ]);\n    $$self{x}=$ex;    $$self{y}=$ey;\n    # check for victory if the empty one is at the bottom rigth tile (3,3)\n    &check_win if $$empty{x} == 3 and $$empty{y} == 3;\n}\n################################################################################\nsub check_win{\n     foreach my $pos (0..$#$board){\n        return unless ( $$board[$pos]->{'x'} == $vic_cond[$pos]->[0] and\n                        $$board[$pos]->{'y'} == $vic_cond[$pos]->[1]);\n     }\n     # victory!\n     $victorious = 1;\n     my @text =  ('Dis','ci','pu','lus','15th','','','at',\n                  'P','e','r','l','M','o','n','ks*');\n     foreach my $tile(@$board){\n            $$tile{btn}->configure( -text=> shift @text,\n                                    -command=>sub{return});\n            $mw->update;\n            sleep 1;\n     }\n}\n################################################################################\nsub check_req_pos{\n    my @wanted = @_;\n    # fix @wanted: seems GetOptions does not die if more elements are passed\n    @wanted = @wanted[0..15];\n    my @check = (1..16);\n    unless ( all {$_ == shift @check} sort {$a<=>$b} @wanted ){\n        die \"tiles must be from 1 to 16 (empty tile)\\nyou passed [@wanted]\\n\";\n    }\n    return map {$_-1} @wanted;\n}\n################################################################################\nsub extreme_perl {\n  $verbose = 0;\n  $mw->optionAdd('*font', 'Courier 20 bold');\n  my @extreme = (\n    'if $0',                               #1\n    \"\\$_=\\n()=\\n\\\"foo\\\"=~/o/g\",            #2\n    \"use warnings;\\n\\$^W\u00a0?\\nint((length\\n'Discipulus')/3)\\n:'15'\",   #3\n    \"length \\$1\\nif \\$^X=~\\n\\/(?:\\\\W)(\\\\w*)\\n(?:\\\\.exe)\\$\\/\", #4\n    \"use Config;\\n\\$Config{baserev}\",                   #5.\n    \"(split '',\\nvec('JAPH'\\n,1,8))[0]\",       #6\n    \"scalar map\\n{ord(\\$_)=~/1/g}\\nqw(p e r l)\", #7\n    \"\\$_ = () =\\n'J A P H'\\n=~\\/\\\\b\\/g\",   # 8\n    \"eval join '+',\\nsplit '',\\n(substr\\n'12345',3,2)\",  #9\n    'printf \\'%b\\',2',                     #10\n    \"int(((1+sqrt(5))\\n/ 2)** 7 /\\nsqrt(5)+0.5)-2\",    #11\n    \"split '',\\nunpack('V',\\n01234567))\\n[6,4]\",  # 12\n    'J','A','P','H'                               # 13..16\n  );\n  foreach (0..15){\n      $$board[$_]{btn}->configure(-text=> $extreme[$_],\n                                 -height => 8,\n                                  -width =>  16, ) if $extreme[$_];\n\n  }\n  @fixed = qw(0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15);\n  $mw->after(5000,\\&shuffle_board);#\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_82.txt",
        "content": "use strict; \nuse warnings;\n\nuse List::Util qw(shuffle first);\nmy @tbl = ([1,2,3,4],[5,6,7,8],[9,10,11,12],[13,14,15,16]);\nmy $e = [3,3];\nfor (1..$ARGV[0]||1000) {\n  my $new = (shuffle &ad($e))[0];\n  $tbl[$e->[0]][$e->[1]] = $tbl[$new->[0]][$new->[1]];\n  $tbl[$new->[0]]->[$new->[1]] = 16;\n  $e = [$new->[0],$new->[1]];\n}\nwhile(1){\n  print +(join ' ',map{$_==16?'  ':sprintf '%02s',$_}@{$tbl[$_]}),\"\\n\" for 0..3;\n  my $m = <STDIN>;\n  chomp $m;  \n  die \"Enter a number to move!\" unless $m;\n  if ($m > 15){\n\twarn \"$m not in the board! Enter a tile from 1 to 15\\n\";\n\tnext;\n  }\n  my $tile=first{$tbl[$$_[0]]->[$$_[1]]==$m}map{[$_,0],[$_,1],[$_,2],[$_,3]}0..3;\n  my $new=first{$tbl[$$_[0]]->[$$_[1]]==16}&ad(grep{$tbl[$$_[0]]->[$$_[1]]==$m}\n          map {[$_,0],[$_,1],[$_,2],[$_,3]}0..3);\n  if ($new){$tbl[$$new[0]][$$new[1]]=$m;$tbl[$$tile[0]][$$tile[1]]=16;}\n  system ($^O eq 'MSWin32' ? 'cls' : 'clear');\n}\nsub ad{\n      my $e = shift; grep {$_->[0]<4 && $_->[1]<4 && $_->[0]>-1 && $_->[1]>-1}\n      [$$e[0]-1,$$e[1]],[$$e[0]+1,$$e[1]],[$$e[0],$$e[1]-1],[$$e[0],$$e[1]+1]\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_83.txt",
        "content": "constant ESC=27, UP=328, LEFT=331, RIGHT=333, DOWN=336\nsequence board = tagset(15)&0, solve = board\ninteger pos = 16\n \nprocedure print_board()\n    for i=1 to length(board) do\n        puts(1,iff(i=pos?\"   \":sprintf(\"%3d\",{board[i]})))\n        if mod(i,4)=0 then puts(1,\"\\n\") end if\n    end for\n    puts(1,\"\\n\")\nend procedure\n \nprocedure move(integer d)\n    integer new_pos = pos+{+4,+1,-1,-4}[d]\n    if new_pos>=1 and new_pos<=16\n    and (mod(pos,4)=mod(new_pos,4) -- same col, or row:\n     or floor((pos-1)/4)=floor((new_pos-1)/4)) then\n        {board[pos],board[new_pos]} = {board[new_pos],0}\n        pos = new_pos\n    end if\nend procedure\n \nfor i=1 to 5 do move(rand(4)) end for\nwhile 1 do\n    print_board()\n    if board=solve then exit end if\n    integer c = find(wait_key(),{ESC,UP,LEFT,RIGHT,DOWN})-1\n    if c=0 then exit end if\n    move(c)\nend while\nputs(1,\"solved!\\n\")\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_84.txt",
        "content": "  1  2  3  4\n  5     6  8\n  9 10  7 11\n 13 14 15 12\n\n  1  2  3  4\n  5  6     8\n  9 10  7 11\n 13 14 15 12\n\n  1  2  3  4\n  5  6  7  8\n  9 10    11\n 13 14 15 12\n\n  1  2  3  4\n  5  6  7  8\n  9 10 11\n 13 14 15 12\n\n  1  2  3  4\n  5  6  7  8\n  9 10 11 12\n 13 14 15\n\nsolved!\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_85.txt",
        "content": "--\n-- demo\\rosetta\\15_puzzle_game.exw\n-- ===============================\n--\nwith javascript_semantics\ninclude pGUI.e\n\nconstant title = \"15 puzzle\",\n         help_text = \"\"\"\nPut the tiles back into order 1..15 and the hole last.\nRightarrow moves the tile to the left of the hole (rightwards) into it.\nLeftarrow moves the tile to the right of the hole (leftwards) into it.\nUparrow moves the tile below the hole (upwards) into it.\nDownarrow moves the tile above the hole (downwards) into it.\nPress 'N' to start a new game.\n\"\"\"\n\nfunction show_help()\n    IupMessage(title,help_text,bWrap:=false)\n    return IUP_IGNORE -- (don't open browser help!)\nend function\n\nIhandle canvas, dialog\ncdCanvas cddbuffer, cdcanvas\n\nsequence solved = tagset(15)&0, board\ninteger pos\n\nprocedure move(integer d)\n    if d=5 then -- new game\n        board = deep_copy(solved)\n        pos = 16\n        for i=1 to 1000 do move(rand(4)) end for\n    elsif d then\n        integer new_pos = pos+{+4,+1,-1,-4}[d]\n        if new_pos>=1 and new_pos<=16\n        and (mod(pos,4)=mod(new_pos,4) -- same col, or row:\n         or floor((pos-1)/4)=floor((new_pos-1)/4)) then\n            board[pos] = board[new_pos]\n            board[new_pos] = 0\n            pos = new_pos\n        end if\n    end if\nend procedure\nmove(5) -- new game\n\nfunction redraw_cb(Ihandle /*ih*/)\n    integer {dw,dh} = IupGetIntInt(canvas, \"DRAWSIZE\"),\n            ox,oy,              -- top right coords\n            os,ts,              -- overall and tile size\n            ht                  -- half tile, for number positioning\n            \n    if dw>=dh then\n        ox = floor((dw-dh)/2)\n        oy = 0\n        os = dh\n    else\n        ox = 0\n        oy = floor((dh-dw)/2)\n        os = dw\n    end if\n    ts = floor((os-10)/4-7)\n    ht = floor(ts/2+5)-10\n\n    cdCanvasActivate(cddbuffer)\n    cdCanvasSetBackground(cddbuffer, #FAF8EF)\n    cdCanvasClear(cddbuffer)\n    cdCanvasSetForeground(cddbuffer, #BBADA0)\n    cdCanvasRoundedBox(cddbuffer, ox+5, ox+os-5, oy+5, oy+os-5, 10, 10)\n\n    integer tx = ox+15\n    for y=1 to 4 do\n        integer ty = oy+15\n        for x=1 to 4 do\n            integer bxy = board[(4-x)*4+y]\n            cdCanvasSetForeground(cddbuffer, #EEE4DA)\n            cdCanvasRoundedBox(cddbuffer, tx, tx+ts-10, ty, ty+ts-10, 5, 5)\n            if bxy then\n                cdCanvasSetForeground(cddbuffer, #776E65)\n                cdCanvasFont(cddbuffer, \"Calibri\", CD_BOLD, 32)\n                cdCanvasText(cddbuffer, tx+ht, ty+ht, sprint(bxy)) \n            end if\n            ty += ts+5\n        end for\n        tx += ts+5\n    end for\n    cdCanvasFlush(cddbuffer)\n    string fmt = iff(board==solved?\"%s - solved\":\"%s\")\n    IupSetStrAttribute(dialog,\"TITLE\",fmt,{title})\n    return IUP_DEFAULT\nend function\n\nfunction map_cb(Ihandle ih)\n    cdcanvas = cdCreateCanvas(CD_IUP, ih)\n    cddbuffer = cdCreateCanvas(CD_DBUFFER, cdcanvas)\n    cdCanvasSetTextAlignment(cddbuffer, CD_CENTER) \n    return IUP_DEFAULT\nend function\n\nfunction key_cb(Ihandle /*ih*/, atom c)\n    if c=K_ESC then return IUP_CLOSE end if -- (standard practice for me)\n    if c=K_F5 then return IUP_DEFAULT end if -- (let browser reload work)\n    if c=K_F1 then return show_help() end if\n    move(find(upper(c),{K_UP,K_LEFT,K_RIGHT,K_DOWN,'N'}))\n    IupUpdate(canvas)\n    return IUP_IGNORE\nend function\n\nIupOpen()\n\ncanvas = IupCanvas(\"RASTERSIZE=520x540\")\nIupSetCallbacks(canvas, {\"MAP_CB\", Icallback(\"map_cb\"),\n                         \"ACTION\", Icallback(\"redraw_cb\")})\n\ndialog = IupDialog(canvas,`TITLE=\"%s\",MINSIZE=440x450`,{title})\nIupSetCallback(dialog, \"KEY_CB\", Icallback(\"key_cb\"));\n\nIupShow(dialog)\nIupSetAttribute(canvas, \"RASTERSIZE\", NULL)\nIupSetAttributeHandle(NULL,\"PARENTDIALOG\",dialog)\nif platform()!=JS then\n    IupMainLoop()\n    IupClose()\nend if\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_86.txt",
        "content": "<?php\n// Puzzle 15 Game - Rosseta Code - PHP 7 as the server-side script language.\n\n// This program DOES NOT use cookies.\n\nsession_start([\n  \"use_only_cookies\" => 0,\n  \"use_cookies\" => 0,\n  \"use_trans_sid\" => 1,\n]);\n\nclass Location\n{\n  protected $column, $row;\n\n  function __construct($column, $row){\n    $this->column = $column;\n    $this->row = $row;\n  }\n  function create_neighbor($direction){\n    $dx = 0; $dy = 0;\n    switch ($direction){\n      case 0: case 'left':  $dx = -1; break;\n      case 1: case 'right': $dx = +1; break;\n      case 2: case 'up':    $dy = -1; break;\n      case 3: case 'down':  $dy = +1; break;\n    }\n    return new Location($this->column + $dx, $this->row + $dy);\n  }\n  function equals($that){\n    return $this->column == $that->column && $this->row == $that->row;\n  }\n  function is_inside_rectangle($left, $top, $right, $bottom){\n    return $left <= $this->column && $this->column <= $right\n        && $top <= $this->row && $this->row <= $bottom;\n  }\n  function is_nearest_neighbor($that){\n    $s = abs($this->column - $that->column) + abs($this->row - $that->row);\n    return $s == 1;\n  }\n}\n\nclass Tile\n{\n  protected $index;\n  protected $content;\n  protected $target_location;\n  protected $current_location;\n\n  function __construct($index, $content, $row, $column){\n    $this->index = $index;\n    $this->content = $content;\n    $this->target_location = new Location($row, $column);\n    $this->current_location = $this->target_location;\n  }\n  function get_content(){\n    return $this->content;\n  }\n  function get_index(){\n    return $this->index;\n  }\n  function get_location(){\n    return $this->current_location;\n  }\n  function is_completed(){\n    return $this->current_location->equals($this->target_location);\n  }\n  function is_empty(){\n    return $this->content == NULL;\n  }\n  function is_nearest_neighbor($that){\n    $a = $this->current_location;\n    $b = $that->current_location;\n    return $a->is_nearest_neighbor($b);\n  }\n  function swap_locations($that){\n    $a = $this->current_location;\n    $b = $that->current_location;\n    $this->current_location = $b;\n    $that->current_location = $a;\n  }\n}\n\nclass Model\n{\n  protected $N;\n  protected $M;\n  protected $tiles;\n\n  function __construct($N, $M){\n    $this->N = $N;\n    $this->M = $M;\n    $this->tiles[0] = new Tile(0, NULL, $N, $M);\n    for ($k = 1; $k < $N * $M; $k++ ){\n      $i = 1 + intdiv($k - 1, $M);\n      $j = 1 + ($k - 1) % $M;\n      $this->tiles[$k] = new Tile($k, (string)$k, $i, $j);\n    }\n    $number_of_shuffles = 1000;\n    $i = 0;\n    while ($i < $number_of_shuffles)\n      if ($this->move_in_direction(random_int(0, 3)))\n        $i++;\n  }\n  function get_N(){\n    return $this->N;\n  }\n  function get_M(){\n    return $this->M;\n  }\n  function get_tile_by_index($index){\n    return $this->tiles[$index];\n  }\n  function get_tile_at_location($location){\n    foreach($this->tiles as $tile)\n      if ($location->equals($tile->get_location()))\n        return $tile;\n    return NULL;\n  }\n  function is_completed(){\n    foreach($this->tiles as $tile)\n      if (!$tile->is_completed())\n        return FALSE;\n    return TRUE;\n  }\n  function move($tile){\n    if ($tile != NULL)\n      foreach($this->tiles as $target){\n        if ($target->is_empty() && $target->is_nearest_neighbor($tile)){\n          $tile->swap_locations($target);\n          break;\n        }\n      }\n  }\n  function move_in_direction($direction){\n    foreach($this->tiles as $tile)\n      if ($tile->is_empty())\n        break;   \n    $location = $tile->get_location()->create_neighbor($direction);\n    if ($location->is_inside_rectangle(0, 0, $this->M, $this->N)){\n      $tile = $this->get_tile_at_location($location);\n      $this->move($tile);\n      return TRUE;\n    }\n    return FALSE;\n  }\n}\n\nclass View\n{\n  protected $model;\n\n  function __construct($model){\n      $this->model = $model;\n  }\n  function show(){\n    $N = $this->model->get_N();\n    $M = $this->model->get_M();\n    echo \"<form>\";\n    for ($i = 1; $i <= $N; $i++){\n      for ($j = 1; $j <= $M; $j++){\n        $tile = $this->model->get_tile_at_location(new Location($i, $j));\n        $content = $tile->get_content();\n        if ($content != NULL)\n          echo \"<span class='puzzle'>\"\n          .    \"<input type='submit' class='puzzle' name='index'\"\n          .    \"value='$content'>\"\n          .    \"</span>\";\n        else\n          echo \"<span class='puzzle'></span>\";\n      }\n      echo \"<br>\";\n    }\n    echo \"</form>\";\n    if ($this->model->is_completed()){\n      echo \"<p class='end-game'>\";\n      echo \"You win!\";\n      echo \"</p>\";\n    }\n  }\n}\n\nclass Controller\n{\n  protected $model;\n  protected $view;\n\n  function __construct($model, $view){\n    $this->model = $model;\n    $this->view = $view;\n  }\n  function run(){\n    if (isset($_GET['index'])){\n      $index = $_GET['index'];\n      $this->model->move($this->model->get_tile_by_index($index));\n    }\n    $this->view->show();\n  }\n}\n?>\n\n<!DOCTYPE html>\n<html lang=\"en\"><meta charset=\"UTF-8\">\n<head>\n  <title>15 puzzle game</title>\n  <style>\n    .puzzle{width: 4ch; display: inline-block; margin: 0; padding: 0.25ch;}\n    span.puzzle{padding: 0.1ch;}\n    .end-game{font-size: 400%; color: red;}\n  </style>\n</head>\n<body>\n  <p><?php\n    if (!isset($_SESSION['model'])){\n      $width = 4; $height = 4;\n      $model = new Model($width, $height);\n    }\n    else\n      $model = unserialize($_SESSION['model']);\n    $view = new View($model);\n    $controller = new Controller($model, $view);\n    $controller->run();\n    $_SESSION['model'] = serialize($model);\n  ?></p>\n</body>\n</html>\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_87.txt",
        "content": " import util.\n\nmain =>\n    Board = {{1,2,3,4},\n             {5,6,7,8},\n             {9,10,11,12},\n             {13,14,15,0}},\n    Goal = copy_term(Board),\n    shuffle(Board),\n    play(Board,Goal).\n\nshuffle(Board) =>\n    foreach (_ in 1..1000)\n        R1 = random() mod 4 + 1,\n        C1 = random() mod 4 + 1,\n        R2 = random() mod 4 + 1,\n        C2 = random() mod 4 + 1,\n        T\u00a0:= Board[R1,C1],\n        Board[R1,C1]\u00a0:= Board[R2,C2],\n        Board[R2,C2]\u00a0:= T\n    end.\n\nplay(Board,Goal) =>\n    while (Board\u00a0!= Goal)\n        print_board(Board),\n        possible_moves(Board,R0,C0,Moves),\n        printf(\"Possible moves are: %w, 0 to exit. Your move? =>  \", Moves),\n        S = read_line().strip(),\n        if S == \"0\" || S == \"\" then\n            halt\n        else\n            move_hole(Board,R0,C0,to_int(S))\n        end\n    end,\n    print_board(Board),\n    println(\"Puzzle solved.\").\n\nprint_board(Board) =>\n    N = len(Board),\n    print(\"+----+----+----+----+\\n\"),\n    foreach (R in 1..N)\n        print(\"|\"),\n        foreach (C in 1..N)\n            printf(\"%4d|\", Board[R,C])\n        end,\n        nl\n    end,\n    println(\"+----+----+----+----+\").\n\npossible_moves(Board,R0,C0,Moves) =>\n    N = len(Board),\n    between(1,N,R0),\n    between(1,N,C0),\n    Board[R0,C0] == 0,\u00a0!,\n    NeibsOfHole = [(R1,C1)\u00a0: (R1,C1) in [(R0-1,C0), (R0+1,C0), (R0,C0-1), (R0,C0+1)], R1 >= 1, R1 =< N, C1 >= 1, C1 =< N],\n    Moves = sort([Board[R,C]\u00a0: (R,C) in NeibsOfHole]).\n\nmove_hole(Board,R0,C0,S) =>\n    N = len(Board),\n    between(1,N,R),\n    between(1,N,C),\n    Board[R,C] == S,\u00a0!,\n    Board[R0,C0]\u00a0:= S,\n    Board[R,C]\u00a0:= 0.",
        "safe": true
    },
    {
        "filename": "15 puzzle game_88.txt",
        "content": "#15 Puzzle Game\n$Script:Neighbours = @{\n    \"1\" = @(\"2\",\"5\")\n    \"2\" = @(\"1\",\"3\",\"6\")\n    \"3\" = @(\"2\",\"4\",\"7\")\n    \"4\" = @(\"3\",\"8\")\n    \"5\" = @(\"1\",\"6\",\"9\")\n    \"6\" = @(\"2\",\"5\",\"7\",\"10\")\n    \"7\" = @(\"3\",\"6\",\"8\",\"11\")\n    \"8\" = @(\"4\",\"7\",\"12\")\n    \"9\" = @(\"5\",\"10\",\"13\")\n    \"10\" = @(\"6\",\"9\",\"11\",\"14\")\n    \"11\" = @(\"7\",\"10\",\"12\",\"15\")\n    \"12\" = @(\"8\",\"11\",\"0\")\n    \"13\" = @(\"9\",\"14\")\n    \"14\" = @(\"10\",\"13\",\"15\")\n    \"15\" = @(\"11\",\"14\",\"0\")\n    \"0\" = @(\"12\",\"15\")\n}\n$script:blank = ''\n#region XAML window definition\n$xaml = @'\n<Window\n   xmlns=\"http://schemas.microsoft.com/winfx/2006/xaml/presentation\"\n   xmlns:x=\"http://schemas.microsoft.com/winfx/2006/xaml\"\n   xmlns:d=\"http://schemas.microsoft.com/expression/blend/2008\" xmlns:mc=\"http://schemas.openxmlformats.org/markup-compatibility/2006\" mc:Ignorable=\"d\"\n   MinWidth=\"200\"\n   Width =\"333.333\"\n   Title=\"15 Game\"\n   Topmost=\"True\" Height=\"398.001\" VerticalAlignment=\"Center\" HorizontalAlignment=\"Center\">\n    <Grid HorizontalAlignment=\"Center\" Height=\"285\" Margin=\"0\" VerticalAlignment=\"Center\" Width=\"300\">\n        <Grid.ColumnDefinitions>\n            <ColumnDefinition/>\n            <ColumnDefinition/>\n            <ColumnDefinition/>\n            <ColumnDefinition/>\n        </Grid.ColumnDefinitions>\n        <Grid.RowDefinitions>\n            <RowDefinition/>\n            <RowDefinition/>\n            <RowDefinition/>\n            <RowDefinition/>\n        </Grid.RowDefinitions>\n        <Button x:Name=\"B_1\" Content=\"01\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\"/>\n        <Button x:Name=\"B_2\" Content=\"02\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"1\"/>\n        <Button x:Name=\"B_3\" Content=\"03\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"2\"/>\n        <Button x:Name=\"B_4\" Content=\"04\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"3\"/>\n        <Button x:Name=\"B_5\" Content=\"05\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Row=\"1\"/>\n        <Button x:Name=\"B_6\" Content=\"06\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"1\" Grid.Row=\"1\"/>\n        <Button x:Name=\"B_7\" Content=\"07\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"2\" Grid.Row=\"1\"/>\n        <Button x:Name=\"B_8\" Content=\"08\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"3\" Grid.Row=\"1\"/>\n        <Button x:Name=\"B_9\" Content=\"09\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Margin=\"0,71,0,0\" Grid.Row=\"1\" Grid.RowSpan=\"2\"/>\n        <Button x:Name=\"B_10\" Content=\"10\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"1\" Grid.Row=\"1\" Margin=\"0,71,0,0\" Grid.RowSpan=\"2\"/>\n        <Button x:Name=\"B_11\" Content=\"11\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"2\" Grid.Row=\"1\" Margin=\"0,71,0,0\" Grid.RowSpan=\"2\"/>\n        <Button x:Name=\"B_12\" Content=\"12\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"3\" Grid.Row=\"1\" Margin=\"0,71,0,0\" Grid.RowSpan=\"2\"/>\n        <Button x:Name=\"B_13\" Content=\"13\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Margin=\"0,71,0,0\" Grid.Row=\"2\" Grid.RowSpan=\"2\"/>\n        <Button x:Name=\"B_14\" Content=\"14\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"1\" Grid.Row=\"2\" Margin=\"0,71,0,0\" Grid.RowSpan=\"2\"/>\n        <Button x:Name=\"B_15\" Content=\"15\" HorizontalAlignment=\"Center\" VerticalAlignment=\"Center\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"2\" Grid.Row=\"2\" Margin=\"0,71,0,0\" Grid.RowSpan=\"2\"/>\n        <Button x:Name=\"B_0\" Content=\"00\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"3\" Grid.Row=\"2\" Margin=\"0,71,0,0\" Grid.RowSpan=\"2\"/>\n        <Button x:Name=\"B_Jumble\" Grid.ColumnSpan=\"2\" Content=\"Jumble Tiles\" Grid.Column=\"1\" HorizontalAlignment=\"Left\" Height=\"23\" Margin=\"0,81,0,-33\" Grid.Row=\"3\" VerticalAlignment=\"Top\" Width=\"150\"/>\n    </Grid>\n</Window>\n'@\n#endregion\n\n#region Code Behind\nfunction Convert-XAMLtoWindow\n{\n    param\n    (\n        [Parameter(Mandatory=$true)]\n        [string]\n        $XAML\n    )\n  \n    Add-Type -AssemblyName PresentationFramework\n  \n    $reader = [XML.XMLReader]::Create([IO.StringReader]$XAML)\n    $result = [Windows.Markup.XAMLReader]::Load($reader)\n    $reader.Close()\n    $reader = [XML.XMLReader]::Create([IO.StringReader]$XAML)\n    while ($reader.Read())\n    {\n        $name=$reader.GetAttribute('Name')\n        if (!$name) { $name=$reader.GetAttribute('x:Name') }\n        if($name)\n        {$result | Add-Member NoteProperty -Name $name -Value $result.FindName($name) -Force}\n    }\n    $reader.Close()\n    $result\n}\nfunction Show-WPFWindow\n{\n    param\n    (\n        [Parameter(Mandatory=$true)]\n        [Windows.Window]\n        $Window\n    )\n  \n    $result = $null\n    $null = $window.Dispatcher.InvokeAsync{\n        $result = $window.ShowDialog()\n        Set-Variable -Name result -Value $result -Scope 1\n    }.Wait()\n    $result\n}\n#endregion Code Behind\n\n#region Convert XAML to Window\n$window = Convert-XAMLtoWindow -XAML $xaml \n\n#endregion\n\n#region Define Event Handlers\nfunction Test-Victory{\n    #Evaluate if all the labels are in the correct position\n    $victory = $true\n    foreach($num in 1..15){\n        if([int]$window.\"b_$num\".Content -ne $num){$victory = $false;break}\n    }\n    return($victory)\n}\nfunction Test-Move($Number){\n    #Number is a string of the pressed button number.\n    if($Script:Neighbours[$Number] -contains $script:blank){\n        return($true)\n    } else {\n        return($false)\n    }\n}\nFunction Move-Tile($Number,$Bypass){\n    if((!(Test-Victory)) -or $Bypass){\n        if(Test-Move $Number){\n            #Set the new window label\n            $window.\"B_$script:blank\".content = $window.\"B_$Number\".content\n            $window.\"B_$script:blank\".background = $window.\"B_$Number\".background\n            $window.\"B_$Number\".background = \"#FFDDDDDD\"\n            #Set the new blank window label\n            $window.\"B_$Number\".content = ''\n            #Enable the old blank tile\n            $window.\"B_$script:blank\".isenabled = $true\n            #disable the new blank tile\n            $window.\"B_$Number\".isenabled = $false\n            #set the new blank\n            $script:blank = $Number\n        }\n    }\n}\nfunction Move-TileRandom{\n    $lastmove = \"1\"\n    for($i=0;$i -lt 500;$i++){\n        $move = $Script:Neighbours[$script:blank] | Where-Object {$_ -ne $lastmove} | Get-Random\n        $lastmove = $move\n        Move-Tile $move $true\n    }\n}\nfunction Set-TileColour($Tile){\n    #I was curious about setting tiles to a checkerboard pattern at this stage. It's probably far better to just define it in the xaml\n    #Ignore the blank tile\n    if($Tile -ne 0){\n        #check if the row of the tile is odd or even\n        if((([math]::floor(($Tile - 1)/4)) % 2 -eq 0)){\n            #check if the tile is odd or even\n            if($Tile % 2 -eq 0){\n                $window.\"B_$Tile\".Background = \"#FFFF7878\"\n            } else {\n                $window.\"B_$Tile\".Background = \"#FF9696FF\"\n            }\n        }else{\n            if($Tile % 2 -eq 0){\n                $window.\"B_$Tile\".Background = \"#FF9696FF\"\n            } else {\n                $window.\"B_$Tile\".Background = \"#FFFF7878\"\n            }\n        }\n    } else {\n        $window.B_0.Background = \"#FFDDDDDD\"\n    }\n}\n$window.B_1.add_Click{\n    $n = \"1\"\n    move-tile $n\n}\n$window.B_2.add_Click{\n    $n = \"2\"\n    move-tile $n\n}\n$window.B_3.add_Click{\n    $n = \"3\"\n    move-tile $n\n}\n$window.B_4.add_Click{\n    $n = \"4\"\n    move-tile $n\n}\n$window.B_5.add_Click{\n    $n = \"5\"\n    move-tile $n\n}\n$window.B_6.add_Click{\n    $n = \"6\"\n    move-tile $n\n}\n$window.B_7.add_Click{\n    $n = \"7\"\n    move-tile $n\n}\n$window.B_8.add_Click{\n    $n = \"8\"\n    move-tile $n\n}\n$window.B_9.add_Click{\n    $n = \"9\"\n    move-tile $n\n}\n$window.B_10.add_Click{\n    $n = \"10\"\n    move-tile $n\n}\n$window.B_11.add_Click{\n    $n = \"11\"\n    move-tile $n\n}\n$window.B_12.add_Click{\n    $n = \"12\"\n    move-tile $n\n}\n$window.B_13.add_Click{\n    $n = \"13\"\n    move-tile $n\n}\n$window.B_14.add_Click{\n    $n = \"14\"\n    move-tile $n\n}\n$window.B_15.add_Click{\n    $n = \"15\"\n    move-tile $n\n}\n$window.B_0.add_Click{\n    $n = \"0\"\n    move-tile $n\n}\n\n$window.B_Jumble.add_Click{\n    Move-TileRandom\n}\n#endregion Event Handlers\n(([math]::floor((\"9\" - 1)/4)) % 2 -eq 0)\n#region Manipulate Window Content\n#initial processing of tiles\n$array = 0..15 | ForEach-Object {\"{0:00}\" -f $_}\n0..15 | ForEach-Object {if($array[$_] -ne '00'){$window.\"B_$_\".content = $array[$_]} else {$window.\"B_$_\".content = '';$script:blank = \"$_\";$window.\"B_$_\".isenabled = $false};Set-TileColour $_}\n#Shove them around a bit\nMove-TileRandom\n#endregion\n# Show Window\n$result = Show-WPFWindow -Window $window\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_89.txt",
        "content": "int number_of_grid_cells = 16;  //   Set the number of cells of the board here 9, 16, 25 etc  \ncolor piece_color = color(255, 175, 0);\ncolor background_color = color(235, 231, 178);\ncolor piece_shadow_dark = color(206, 141, 0);\ncolor piece_shadow_light = color(255, 214, 126);\nint z, t, p, piece_number, row_length, piece_side_length;\n\nPuzzlePiece[] piece = new PuzzlePiece[number_of_grid_cells]; //  Number of puzzle pieces objects array\n\nvoid setup() { \n  size(400, 400);  // Window size width and height must be egual\n\tbackground(200, 50, 0);\n  row_length = int(sqrt(number_of_grid_cells));\n  piece_side_length = width/row_length;\n  textSize(piece_side_length/2.7);\n  textAlign(CENTER);\n\n  PVector[] xy_values = new PVector[number_of_grid_cells]; //  Setting the x and y values for each cell on grid\n  for (int i = 0; i < number_of_grid_cells; i += row_length) { // Values are the top left pixel of the cell\n    for (int j = 0; j < row_length; j++) {\n      xy_values[z] = new PVector();\n      xy_values[z].x = j*piece_side_length;\n      xy_values[z].y = t*piece_side_length; \n      z++;\n    }\n    t++;\n  } \n\n  int[] place = new int[number_of_grid_cells]; // This array is  to help placing the pieces randomly and store values in piece objects array\n  for (int i = 0; i < number_of_grid_cells; i++) place[i] = 0;\n  piece_number = 0;\n\n  while (piece_number < number_of_grid_cells) {  // Placing pieces randomly in grid\n    p = int(random(0, number_of_grid_cells));\n    if (place[p] == 0) { // Once placed will be set to 1 to avoid designing again at this location\n      piece[piece_number] = new PuzzlePiece(piece_number, xy_values[p].x, xy_values[p].y); // Creating the piece objects array \n      place[p] = 1;\n      piece[piece_number].design(); // Design newly create piece object\n      piece_number++;\n    }\n  }\n}\n\nvoid draw() {  \n  for (int i = 0; i < number_of_grid_cells; i++) {   // Search all piece object indexes and verify which one is mouse pressed in this loop\n    if (mousePressed == true && mouseX >= piece[i].xPosition() && mouseX <= piece[i].xPosition()+piece_side_length && mouseY >= piece[i].yPosition() && mouseY <= piece[i].yPosition()+piece_side_length && piece[i].pieceNumber() != 15) {  \n      if (pieceMove(piece[number_of_grid_cells-1].xPosition(), piece[number_of_grid_cells-1].yPosition(), piece[i].xPosition(), piece[i].yPosition())) {\n        float temp_x = piece[number_of_grid_cells-1].xPosition(); // Remember x and y value of final piece index (white piece) \n        float temp_y = piece[number_of_grid_cells-1].yPosition();\n        piece[number_of_grid_cells-1].storePos(piece[i].xPosition(), piece[i].yPosition()); // Store clicked x and y value in final index of piece array\n        piece[i].storePos(temp_x, temp_y); // Store temp x and y value (the last/previous final index values) in current clicked piece index  \n        piece[number_of_grid_cells-1].design(); // draw the final index piece index (only final piece index is painted white)\n        piece[i].design(); // Draw a numbered piece of current index\n      }\n    }\n  }\n}\n\nboolean pieceMove(float final_index_piece_x, float final_index_piece_y, float current_index_x, float current_index_y) {\n  // If both x values from clicked and white piece have same value meaning in same horizontal column \n  // AND   current clicked y value is equal to white piece y value - piece side lenght  OR  current clicked y value + piece side lenght is egual to white piece y \n  if (current_index_x == final_index_piece_x && (current_index_y == final_index_piece_y-piece_side_length || (current_index_y == final_index_piece_y+piece_side_length))) return true;\n  // If both y values from clicked and white piece have same value meaning in same vertical column \n  // AND   current clicked x value is equal to white piece x value - piece side lenght  OR  current clicked x value + piece side lenght is egual to white piece x \n  else if (current_index_y == final_index_piece_y && (current_index_x == final_index_piece_x-piece_side_length || (current_index_x == final_index_piece_x+piece_side_length))) return true;\n  else return false;\n}\n\nclass PuzzlePiece {   \n  int piece_number;\n  float x_pos, y_pos;\n\n  PuzzlePiece(int _piece_nr, float _xp, float _yp) {\n    piece_number = _piece_nr;\n    x_pos = _xp;\n    y_pos = _yp;\n  }  \n\n  void storePos(float _xp, float _yp) {\n    x_pos = _xp;\n    y_pos = _yp;\n  }\n\n  int pieceNumber() {\n    return piece_number;\n  }\n\n  float xPosition() {\n    return x_pos;\n  }\n\n  float yPosition() {\n    return y_pos;\n  }\n\n  void design() {\n    noStroke();\n    fill(piece_color);\n    if (piece_number == number_of_grid_cells-1) fill(background_color);   \n    rect(x_pos+1, y_pos+1, piece_side_length-1, piece_side_length-1);\n    if (piece_number != number_of_grid_cells-1) {\n      fill(0); // Black text shadow\n      text(piece_number+1, x_pos+piece_side_length/2+1, y_pos+piece_side_length/2+textAscent()/2);\n      fill(255);\n      text(piece_number+1, x_pos+piece_side_length/2, y_pos+piece_side_length/2+textAscent()/2);\n      stroke(piece_shadow_dark);\n      line(x_pos+piece_side_length-1, y_pos+1, x_pos+piece_side_length-1, y_pos+piece_side_length-1); // Right side shadow\n      line(x_pos+2, y_pos+piece_side_length, x_pos+piece_side_length-1, y_pos+piece_side_length); // Bottom side shadow\n      stroke(piece_shadow_light);\n      line(x_pos+2, y_pos-1, x_pos+2, y_pos+piece_side_length); // Left bright\n      line(x_pos+2, y_pos+1, x_pos+piece_side_length-1, y_pos+1); // Upper bright\n    }\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_9.txt",
        "content": "   package Puzzle is new Generic_Puzzle(Rows => 3, Cols => 3, Name => Image);\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_90.txt",
        "content": "# Set the number of cells of the board here 9, 16, 25 etc\nnum_grid_cells = 16\npiece_color = color(255, 175, 0)\nbackground_color = color(235, 231, 178)\npiece_shadow_dark = color(206, 141, 0)\npiece_shadow_light = color(255, 214, 126)\n\ndef setup():\n    global piece, piece_number, row_length, piece_side_length\n    size(400, 400)  # Window size width and height must be egual\n    background(200, 50, 0)\n    row_length = int(sqrt(num_grid_cells))\n    piece_side_length = width / row_length\n    textSize(piece_side_length / 2.7)\n    textAlign(CENTER)\n    # Setting the x and y values for each cell on grid\n    xy_val = []\n    t = 0\n    for i in range(0, num_grid_cells, row_length):\n        for j in range(row_length):\n            xy_val.append((j * piece_side_length,\n                           t * piece_side_length))\n        t += 1\n    piece = []  # Puzzle piece objects\n    placed = [False] * num_grid_cells  # to help placing the pieces randomly\n    piece_number = 0\n    # Placing pieces randomly in grid\n    while (piece_number < num_grid_cells):\n        p = int(random(0, num_grid_cells))\n        # Once placed will be set to True to avoid adding again at this location\n        if not placed[p]:\n            # Creating the piece objects list\n            piece.append(PuzzlePiece(piece_number, xy_val[p][0], xy_val[p][1]))\n            placed[p] = True\n            piece[piece_number].design()  # Draw newly create piece object\n            piece_number += 1\n\ndef draw():\n    # Search all piece object indexes and verify which one is mouse pressed\n    for i in range(num_grid_cells):\n        if (mousePressed and\n                piece[i].x <= mouseX <= piece[i].x + piece_side_length and\n                piece[i].y <= mouseY <= piece[i].y + piece_side_length and\n                piece[i].piece_number != 15):\n            if (pieceMove(piece[num_grid_cells - 1].x, piece[num_grid_cells - 1].y, piece[i].x, piece[i].y)):\n                # Remember x and y value of final piece index (white piece)\n                temp_x = int(piece[num_grid_cells - 1].x)\n                temp_y = int(piece[num_grid_cells - 1].y)\n                # Store clicked x and y value in final index of piece list\n                piece[num_grid_cells - 1].set_pos(piece[i].x, piece[i].y)\n                # Store temp x and y value (the last/previous final index\n                # values) in current clicked piece\n                piece[i].set_pos(temp_x, temp_y)\n                # draw the final index piece index (only final piece index is\n                # painted white)\n                piece[num_grid_cells - 1].design()\n                piece[i].design()  # Draw a numbered piece of current index\n\ndef pieceMove(final_index_piece_x, final_index_piece_y, current_index_x, current_index_y):\n    # If both x's from clicked and white piece have same value meaning in same horizontal column\n    # AND current clicked y value is equal to white piece y value - piece side lenght OR\n    # current clicked y value + piece side lenght is egual to white piece y\n    if (current_index_x == final_index_piece_x and (current_index_y == final_index_piece_y - piece_side_length or\n                                                    (current_index_y == final_index_piece_y + piece_side_length))):\n        return True\n    # If both y's from clicked and white piece have same value meaning in same vertical column AND current clicked x value\n    # is equal to white piece x value - piece side lenght OR current clicked x value + piece side lenght is\n    # egual to white piece x\n    elif (current_index_y == final_index_piece_y and (current_index_x == final_index_piece_x - piece_side_length or\n                                                      (current_index_x == final_index_piece_x + piece_side_length))):\n        return True\n    else:\n        return False\n\nclass PuzzlePiece:\n\n    def __init__(self, pn, xp, yp):\n        self.piece_number = pn\n        self.x = xp\n        self.y = yp\n\n    def set_pos(self, xp, yp):\n        self.x = xp\n        self.y = yp\n\n    def design(self):\n        noStroke()\n        fill(piece_color)\n        if (self.piece_number == num_grid_cells - 1):\n            fill(background_color)\n        rect(self.x + 1, self.y + 1,\n             piece_side_length - 1, piece_side_length - 1)\n        if (self.piece_number != num_grid_cells - 1):\n            fill(0)  # Black text shadow\n            text(self.piece_number + 1, self.x + piece_side_length / 2 + 2,\n                 self.y + piece_side_length / 2 + textAscent() / 2)\n            fill(255)\n            text(self.piece_number + 1, self.x + piece_side_length / 2,\n                 self.y + piece_side_length / 2 + textAscent() / 2)\n            stroke(piece_shadow_dark)\n            line(self.x + piece_side_length - 1, self.y + 1, self.x +\n                 piece_side_length - 1, self.y + piece_side_length - 1)  # Right side shadow\n            line(self.x + 2, self.y + piece_side_length, self.x +\n                 piece_side_length - 1, self.y + piece_side_length)  # Bottom side shadow\n            stroke(piece_shadow_light)\n            # Left bright\n            line(self.x + 2, self.y - 1, self.x + 2,\n                 self.y + piece_side_length)\n            # Upper bright\n            line(self.x + 2, self.y + 1, self.x +\n                 piece_side_length - 1, self.y + 1)\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_91.txt",
        "content": "% map the sequence of cells\nnext_cell(1,Y,2,Y).\nnext_cell(2,Y,3,Y).\nnext_cell(3,Y,4,Y).\nnext_cell(4,1,1,2).\nnext_cell(4,2,1,3).\nnext_cell(4,3,1,4).\n\n% map the game items, and how to print\t\nitem(1,2,   '  1 ').\nitem(2,3,   '  2 ').\nitem(3,4,   '  3 ').\nitem(4,5,   '  4 ').\nitem(5,6,   '  5 ').\nitem(6,7,   '  6 ').\nitem(7,8,   '  7 ').\nitem(8,9,   '  8 ').\nitem(9,10,  '  9 ').\nitem(10,11, ' 10 ').\nitem(11,12, ' 11 ').\nitem(12,13, ' 12 ').\nitem(13,14, ' 13 ').\nitem(14,15, ' 14 ').\nitem(15,0,  ' 15 ').\n\n% Move - find the current blank space, and the new place and swap them\nmove_1(1,2).\nmove_1(2,3).\nmove_1(3,4).\n\nmove(up, X, Y, X, Y1) :- move_1(Y1,Y). \nmove(down, X, Y, X, Y1) :- move_1(Y, Y1).\nmove(left, X, Y, X1, Y) :- move_1(X1, X).\nmove(right, X, Y, X1, Y) :- move_1(X, X1).\n\nmove(Dir, Board, [p(X1,Y1,0),p(X,Y,P)|B2]) :-\n    select(p(X, Y, 0), Board, B1),\n    move(Dir, X,Y,X1,Y1),\n    select(p(X1, Y1, P), B1, B2).\n\n% Solved - the game is solved if running through the next_cell sequence produces the item sequence.\nsolved(Board) :-\n    select(p(1,1,1),Board,Remaining),\n    solved(Remaining,p(1,1,1)).\nsolved([p(4,4,0)], p(_,_,15)).\nsolved(Board,p(Xp,Yp,Prev)) :- \n    item(Prev,P,_),\n    select(p(X,Y,P),Board,Remaining),\n    next_cell(Xp,Yp,X,Y),\n    solved(Remaining, p(X,Y,P)).   \n\n% Print - run through the next_cell sequence printing the found items.\nprint(Board) :-\n    select(p(1,1,P),Board,Remaining),\n    nl, write_cell(P), \n    print(Remaining,p(1,1)).\nprint([],_) :- nl.\nprint(Board,p(X,Y)) :-\n    next_cell(X,Y,X1,Y1),\n    select(p(X1,Y1,P),Board,Remaining),\n    write_cell(P),\n    end_line_or_not(X1),\n    print(Remaining,p(X1,Y1)).\n\nwrite_cell(0) :- write('    ').\t\nwrite_cell(P) :- item(P,_,W), write(W).\n\nend_line_or_not(1).\nend_line_or_not(2).\nend_line_or_not(3).\nend_line_or_not(4) :- nl.\n\n% Next Move - get the player input.\nnext_move_by_player(Move) :- \n    repeat, \n    get_single_char(Char), \n    key_move(Char, Move).\n\nkey_move(119, up).    % 'w' \nkey_move(115, down).  % 'd'\t\nkey_move(97, left).   % 'a'\nkey_move(100, right). % 'd' \n\n% Play - loop over the player moves until solved.\nplay(Board) :-\n    solved(Board) -> (\n        print(Board),\n        write('You Win!\\n'))\n    ; (\n        print(Board),\n        next_move_by_player(Move),\n        move(Move, Board, NewBoard),\n        play(NewBoard)).\n\nplay :-\n   test_board(Board),\n   play(Board),\n   !.\n    \ntest_board(\n   [p(1,1,9),p(2,1,1),p(3,1,4),p(4,1,7),\n    p(1,2,6),p(2,2,5),p(3,2,3),p(4,2,2),\n    p(1,3,13),p(2,3,10),p(3,3,0),p(4,3,8),\n    p(1,4,14),p(2,4,15),p(3,4,11),p(4,4,12)]).\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_92.txt",
        "content": "#difficulty=10 ;higher is harder\n#up=\"u\"\n#down=\"d\"\n#left=\"l\"\n#right=\"r\"\nOpenConsole(\"15 game\"):EnableGraphicalConsole(1)\nGlobal Dim Game.i(3,3)\nGlobal hole.point\n\nProcedure NewBoard()\n    num.i=0\n    For j=0 To 3\n        For i=0 To 3\n            Game(i,j)=num\n            num+1\n        Next i\n    Next j\nEndProcedure\nProcedure.s displayBoard()\n    For j=0 To 3\n        For i=0 To 3\n            ConsoleLocate(i,j)\n            If Game(i,j)=0:Print(\" \"):Continue:EndIf\n            Print(Hex(Game(i,j)))\n        Next i\n    Next j\n    PrintN(\"\")\n    Print(\"Your Choice Up\u00a0:\"+#up+\", Down\u00a0:\"+#down+\", Left\u00a0:\"+#left+\" Or Right\u00a0:\"+#right+\" \")\n    Repeat\n        keypress$=Inkey()\n    Until keypress$<>\"\"\n    keypress$=LCase(keypress$)\n    ProcedureReturn keypress$\nEndProcedure\nProcedure UpdateBoard(key$)\n    If key$=#up And hole\\y<3\n        Swap game(hole\\x,hole\\y),game(hole\\x,hole\\y+1):hole\\y+1\n    ElseIf key$=#down And hole\\y\n        Swap game(hole\\x,hole\\y),game(hole\\x,hole\\y-1):hole\\y-1\n    ElseIf key$=#left And hole\\x<3\n        Swap game(hole\\x,hole\\y),game(hole\\x+1,hole\\y):hole\\x+1\n    ElseIf key$=#right And hole\\x\n        Swap game(hole\\x,hole\\y),game(hole\\x-1,hole\\y):hole\\x-1\n    EndIf\nEndProcedure\nProcedure TestGameWin()\n    For j=0 To 3\n        For i=0 To 3\n            num+1\n            If game(i,j)=num:win+1:EndIf\n        Next i\n    Next j\n    If win=15:ProcedureReturn 1:EndIf\nEndProcedure\nProcedure ShuffleBoard(difficulty.i)\n    Dim randomKey$(3)\n    randomkey$(0)=#up:randomkey$(1)=#down:randomkey$(2)=#left:randomkey$(3)=#right\n    For i=1 To difficulty\n       UpdateBoard(randomKey$(Random(3))) \n    Next i\nEndProcedure\nNewBoard()\nShuffleBoard(#difficulty)\nRepeat\n    choice$=displayBoard()\n    UpdateBoard(choice$)\nUntil TestGameWin()\nPrint(\"Won\u00a0!\")\nCloseConsole()\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_93.txt",
        "content": "1234\n5678\n9ABC\nDEF\n\nYour Choice Up :u, Down :d, Left :l Or Right :r\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_94.txt",
        "content": "''' Structural Game for 15 - Puzzle with different difficulty levels'''\nfrom random import randint\n\n\nclass Puzzle:\n    def __init__(self):\n        self.items = {}\n        self.position = None\n\n    def main_frame(self):\n        d = self.items\n        print('+-----+-----+-----+-----+')\n        print('|%s|%s|%s|%s|' % (d[1], d[2], d[3], d[4]))\n        print('+-----+-----+-----+-----+')\n        print('|%s|%s|%s|%s|' % (d[5], d[6], d[7], d[8]))\n        print('+-----+-----+-----+-----+')\n        print('|%s|%s|%s|%s|' % (d[9], d[10], d[11], d[12]))\n        print('+-----+-----+-----+-----+')\n        print('|%s|%s|%s|%s|' % (d[13], d[14], d[15], d[16]))\n        print('+-----+-----+-----+-----+')\n\n    def format(self, ch):\n        ch = ch.strip()\n        if len(ch) == 1:\n            return '  ' + ch + '  '\n        elif len(ch) == 2:\n            return '  ' + ch + ' '\n        elif len(ch) == 0:\n            return '     '\n\n    def change(self, to):\n        fro = self.position\n        for a, b in self.items.items():\n            if b == self.format(str(to)):\n                to = a\n                break\n        self.items[fro], self.items[to] = self.items[to], self.items[fro]\n        self.position = to\n\n    def build_board(self, difficulty):\n        for i in range(1, 17):\n            self.items[i] = self.format(str(i))\n        tmp = 0\n        for a, b in self.items.items():\n            if b == '  16 ':\n                self.items[a] = '     '\n                tmp = a\n                break\n        self.position = tmp\n        if difficulty == 0:\n            diff = 10\n        elif difficulty == 1:\n            diff = 50\n        else:\n            diff = 100\n        for _ in range(diff):\n            lst = self.valid_moves()\n            lst1 = []\n            for j in lst:\n                lst1.append(int(j.strip()))\n            self.change(lst1[randint(0, len(lst1)-1)])\n\n    def valid_moves(self):\n        pos = self.position\n        if pos in [6, 7, 10, 11]:\n            return self.items[pos - 4], self.items[pos - 1],\\\n                   self.items[pos + 1], self.items[pos + 4]\n        elif pos in [5, 9]:\n            return self.items[pos - 4], self.items[pos + 4],\\\n                   self.items[pos + 1]\n        elif pos in [8, 12]:\n            return self.items[pos - 4], self.items[pos + 4],\\\n                   self.items[pos - 1]\n        elif pos in [2, 3]:\n            return self.items[pos - 1], self.items[pos + 1], self.items[pos + 4]\n        elif pos in [14, 15]:\n            return self.items[pos - 1], self.items[pos + 1],\\\n                  self.items[pos - 4]\n        elif pos == 1:\n            return self.items[pos + 1], self.items[pos + 4]\n        elif pos == 4:\n            return self.items[pos - 1], self.items[pos + 4]\n        elif pos == 13:\n            return self.items[pos + 1], self.items[pos - 4]\n        elif pos == 16:\n            return self.items[pos - 1], self.items[pos - 4]\n\n    def game_over(self):\n        flag = False\n        for a, b in self.items.items():\n            if b == '     ':\n                pass\n            else:\n                if a == int(b.strip()):\n                    flag = True\n                else:\n                    flag = False\n        return flag\n\n\ng = Puzzle()\ng.build_board(int(input('Enter the difficulty\u00a0: 0 1 2\\n2 '\n                        '=> highest 0=> lowest\\n')))\ng.main_frame()\nprint('Enter 0 to exit')\nwhile True:\n    print('Hello user:\\nTo change the position just enter the no. near it')\n    lst = g.valid_moves()\n    lst1 = []\n    for i in lst:\n        lst1.append(int(i.strip()))\n        print(i.strip(), '\\t', end='')\n    print()\n    x = int(input())\n    if x == 0:\n        break\n    elif x not in lst1:\n        print('Wrong move')\n    else:\n        g.change(x)\n    g.main_frame()\n    if g.game_over():\n        print('You WON')\n        break\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_95.txt",
        "content": "Enter the difficulty\u00a0: 0 1 2\n2 => highest 0=> lowest\n1\n+-----+-----+-----+-----+\n|  1  |  7  |  2  |  4  |\n+-----+-----+-----+-----+\n|  5  |  6  |  3  |  12 |\n+-----+-----+-----+-----+\n|  9  |  8  |  11 |  15 |\n+-----+-----+-----+-----+\n|  13 |  10 |  14 |     |\n+-----+-----+-----+-----+\nEnter 0 to exit\nHello user:\nTo change the position just enter the no. near it\n14 \t15 \t\n14\n+-----+-----+-----+-----+\n|  1  |  7  |  2  |  4  |\n+-----+-----+-----+-----+\n|  5  |  6  |  3  |  12 |\n+-----+-----+-----+-----+\n|  9  |  8  |  11 |  15 |\n+-----+-----+-----+-----+\n|  13 |  10 |     |  14 |\n+-----+-----+-----+-----+\nHello user:\nTo change the position just enter the no. near it\n10 \t14 \t11 \t\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_96.txt",
        "content": "''' Python 3.6.5 code using Tkinter graphical user interface.''' \n\nfrom tkinter import *\nfrom tkinter import messagebox\nimport random\n\n# ************************************************\n\nclass Board:\n    def __init__(self, playable=True):\n        while True:\n            # list of text for game squares:\n            self.lot = [str(i) for i in range(1,16)] + ['']\n            if not playable:\n                break\n            # list of text for game squares randomized:\n            random.shuffle(self.lot)\n            if self.is_solvable():\n                break\n            \n        # game board is 2D array of game squares:\n        self.bd = []\n        i = 0\n        for r in range(4):\n            row = []\n            for c in range(4):\n                row.append(Square(r,c,self.lot[i]))\n                i += 1\n            self.bd.append(row)\n            \n    # How to check if an instance of a 15 puzzle\n    # is solvable is explained here:\n    # https://www.geeksforgeeks.org/check-instance-15-puzzle-solvable/\n    # I only coded for the case where N is even.\n    def is_solvable(self):\n        inv = self.get_inversions()\n        odd = self.is_odd_row()\n        if inv % 2 == 0 and odd:\n            return True\n        if inv % 2 == 1 and not odd:\n            return True\n        return False\n        \n    def get_inversions(self):\n        cnt = 0\n        for i, x in enumerate(self.lot[:-1]):\n            if x != '':\n                for y in self.lot[i+1:]:\n                    if y != '' and int(x) > int(y):\n                        cnt += 1\n        return cnt\n\n    # returns True if open square is in odd row from bottom:\n    def is_odd_row(self):\n        idx = self.lot.index('')\n        return idx in [4,5,6,7,12,13,14,15]           \n\n    # returns name, text, and button object at row & col:\n    def get_item(self, r, c):\n        return self.bd[r][c].get()\n\n    def get_square(self, r, c):\n        return self.bd[r][c]\n\n    def game_won(self):\n        goal = [str(i) for i in range(1,16)] + ['']\n        i = 0\n        for r in range(4):\n            for c in range(4):\n                nm, txt, btn = self.get_item(r,c)\n                if txt != goal[i]:\n                    return False\n                i += 1\n        return True\n                \n# ************************************************\n\nclass Square:       # ['btn00', '0', None]\n    def __init__(self, row, col, txt):\n        self.row = row\n        self.col = col\n        self.name = 'btn' + str(row) + str(col)\n        self.txt = txt\n        self.btn = None\n        \n    def get(self):\n            return [self.name, self.txt, self.btn]\n\n    def set_btn(self, btn):\n        self.btn = btn\n\n    def set_txt(self, txt):\n        self.txt = txt\n\n# ************************************************\n\nclass Game:\n    def __init__(self, gw):\n        self.window = gw\n\n        # game data:\n        self.bd = None\n        self.playable = False\n\n        # top frame:\n        self.top_fr = Frame(gw,\n                            width=600,\n                            height=100,\n                            bg='light green')\n        self.top_fr.pack(fill=X)\n\n        self.hdg = Label(self.top_fr,\n                         text='  15 PUZZLE GAME  ',\n                         font='arial 22 bold',\n                         fg='Navy Blue',\n                         bg='white')\n        self.hdg.place(relx=0.5, rely=0.4,\n                       anchor=CENTER)\n\n        self.dir = Label(self.top_fr,\n                 text=\"(Click 'New Game' to begin)\",\n                 font='arial 12 ',\n                 fg='Navy Blue',\n                 bg='light green')\n        self.dir.place(relx=0.5, rely=0.8,\n                       anchor=CENTER)\n\n        self.play_btn = Button(self.top_fr,\n                               text='New \\nGame',\n                               bd=5,\n                               bg='PaleGreen4',\n                               fg='White',\n                               font='times 12 bold',\n                               command=self.new_game)\n        self.play_btn.place(relx=0.92, rely=0.5,\n                       anchor=E)\n\n        # bottom frame:\n        self.btm_fr = Frame(gw,\n                            width=600,\n                            height=500,\n                            bg='light steel blue')\n        self.btm_fr.pack(fill=X)\n\n        # board frame:\n        self.bd_fr = Frame(self.btm_fr,\n                           width=400+2,\n                           height=400+2,\n                           relief='solid',\n                           bd=1,\n                           bg='lemon chiffon')\n        self.bd_fr.place(relx=0.5, rely=0.5,\n                         anchor=CENTER)\n\n        self.play_game()\n\n# ************************************************\n\n    def new_game(self):\n        self.playable = True\n        self.dir.config(text='(Click on a square to move it)')\n        self.play_game()\n\n    def play_game(self):\n        # place squares on board:\n        if self.playable:\n            btn_state = 'normal'\n        else:\n            btn_state = 'disable'\n        self.bd = Board(self.playable)               \n        objh = 100  # widget height\n        objw = 100  # widget width\n        objx = 0    # x-position of widget in frame\n        objy = 0    # y-position of widget in frame\n\n        for r in range(4):\n            for c in range(4):\n                nm, txt, btn = self.bd.get_item(r,c)\n                bg_color = 'RosyBrown1'\n                if txt == '':\n                    bg_color = 'White'           \n                game_btn = Button(self.bd_fr,\n                                  text=txt,\n                                  relief='solid',\n                                  bd=1,\n                                  bg=bg_color,\n                                  font='times 12 bold',\n                                  state=btn_state,\n                                  command=lambda x=nm: self.clicked(x))\n                game_btn.place(x=objx, y=objy,\n                               height=objh, width=objw)\n                \n                sq = self.bd.get_square(r,c)\n                sq.set_btn(game_btn)\n                \n                objx = objx + objw\n            objx = 0\n            objy = objy + objh\n\n    # processing when a square is clicked:\n    def clicked(self, nm):\n        r, c = int(nm[3]), int(nm[4])\n        nm_fr, txt_fr, btn_fr = self.bd.get_item(r,c)\n        \n        # cannot 'move' open square to itself:\n        if not txt_fr:\n            messagebox.showerror(\n                'Error Message',\n                'Please select \"square\" to be moved')\n            return\n\n        # 'move' square to open square if 'adjacent' to it:            \n        adjs = [(r-1,c), (r, c-1), (r, c+1), (r+1, c)]\n        for x, y in adjs:\n            if 0 <= x <= 3 and 0 <= y <= 3:\n                nm_to, txt_to, btn_to = self.bd.get_item(x,y)\n                if not txt_to:\n                    sq = self.bd.get_square(x,y)\n                    sq.set_txt(txt_fr)\n                    sq = self.bd.get_square(r,c)\n                    sq.set_txt(txt_to)\n                    btn_to.config(text=txt_fr,\n                                  bg='RosyBrown1')\n                    btn_fr.config(text=txt_to,\n                                  bg='White')\n                    # check if game is won:              \n                    if self.bd.game_won():\n                        ans = messagebox.askquestion(\n                            'You won!!!   Play again?')\n                        if ans == 'no':\n                            self.window.destroy()\n                        else:\n                            self.new_game()\n                    return\n                \n        # cannot move 'non-adjacent' square to open square:\n        messagebox.showerror(\n            'Error Message',\n            'Illigal move, Try again')\n        return\n\n# ************************************************\n\nroot = Tk()\nroot.title('15 Puzzle Game')\nroot.geometry('600x600+100+50')\nroot.resizable(False, False)\ng = Game(root)\nroot.mainloop()\n",
        "safe": true
    },
    {
        "filename": "15 puzzle game_97.txt",
        "content": "_TITLE \"GUI Sliding Blocks Game \"\nRANDOMIZE TIMER\n\n' get from user the desired board size = s\nDO\n    LOCATE CSRLIN, 3: INPUT \"(0 quits) Enter your number of blocks per side 3 - 9 you want > \", s\n    IF s = 0 THEN END\nLOOP UNTIL s > 2 AND s < 10\n\n' screen setup: based on the square blocks q pixels a sides\nq = 540 / s 'square size, shoot for 540 x 540 pixel board display\nSCREEN _NEWIMAGE(q * s + 1, q * s + 1, 32): _SCREENMOVE 360, 60\n\n'initialize board = solution\nDIM board(s, s)\nFOR r = 1 TO s\n    FOR c = 1 TO s\n        board(c, r) = c + (r - 1) * s\n    NEXT\nNEXT\nboard(s, s) = 0: c0 = s: r0 = s\n\n'scramble board for puzzle\nFOR i = 0 TO s ^ 5 ' mix blocks\n    SELECT CASE INT(RND * 4) + 1\n        CASE 1: IF c0 < s THEN board(c0, r0) = board(c0 + 1, r0): board(c0 + 1, r0) = 0: c0 = c0 + 1\n        CASE 2: IF c0 > 1 THEN board(c0, r0) = board(c0 - 1, r0): board(c0 - 1, r0) = 0: c0 = c0 - 1\n        CASE 3: IF r0 < s THEN board(c0, r0) = board(c0, r0 + 1): board(c0, r0 + 1) = 0: r0 = r0 + 1\n        CASE 4: IF r0 > 1 THEN board(c0, r0) = board(c0, r0 - 1): board(c0, r0 - 1) = 0: r0 = r0 - 1\n    END SELECT\nNEXT\n\nt = TIMER: update = -1 'OK user here you go!\nDO\n    IF update THEN 'display status and determine if solved\n        solved = -1: update = 0\n        FOR r = 1 TO s\n            FOR c = 1 TO s\n                IF board(c, r) THEN\n                    IF board(c, r) <> (r - 1) * s + c THEN solved = 0\n                    COLOR _RGB32(255, 255, 255), _RGB32(0, 0, 255)\n                    LINE ((c - 1) * q + 1, (r - 1) * q + 2)-(c * q - 2, r * q - 2), _RGB32(0, 0, 255), BF\n                    _PRINTSTRING ((c - 1) * q + .4 * q, (r - 1) * q + .4 * q), RIGHT$(\" \" + STR$(board(c, r)), 2)\n                ELSE\n                    IF board(s, s) <> 0 THEN solved = 0\n                    COLOR _RGB32(0, 0, 0), _RGB32(0, 0, 0)\n                    LINE ((c - 1) * q, (r - 1) * q)-(c * q, r * q), , BF\n                END IF\n            NEXT\n        NEXT\n        IF solved THEN 'flash the Solved Report until user closes window else report status\n            _DISPLAY\n            flash$ = \"Solved!\" + STR$(mc) + \" Moves in \" + STR$(INT(TIMER - t)) + \" secs.\"\n            WHILE 1: _TITLE flash$: _DELAY .2: _TITLE \"  \": _DELAY .2: WEND\n        ELSE\n            _TITLE STR$(mc) + \" Moves in \" + STR$(INT(TIMER - t)) + \" secs.\" + STR$(test)\n        END IF\n        _DISPLAY\n    END IF\n\n    'get next mouse click, check if on block next to empty space make move or beep\n    m = _MOUSEINPUT: mb = _MOUSEBUTTON(1): mx = _MOUSEX: my = _MOUSEY\n    IF mb AND solved = 0 THEN 'get last place mouse button was down\n        mb = _MOUSEBUTTON(1): mx = _MOUSEX: my = _MOUSEY\n        WHILE mb 'left button down, wait for mouse button release\n            m = _MOUSEINPUT: mb = _MOUSEBUTTON(1): mx = _MOUSEX: my = _MOUSEY\n        WEND\n\n        'convert mouse position to board array (x, y) are we near empty space?\n        bx = INT(mx / q) + 1: by = INT(my / q) + 1: update = -1\n        IF bx = c0 + 1 AND by = r0 THEN\n            board(c0, r0) = board(c0 + 1, r0): board(c0 + 1, r0) = 0: c0 = c0 + 1: mc = mc + 1\n        ELSEIF bx = c0 - 1 AND by = r0 THEN\n            board(c0, r0) = board(c0 - 1, r0): board(c0 - 1, r0) = 0: c0 = c0 - 1: mc = mc + 1\n        ELSEIF bx = c0 AND by = r0 + 1 THEN\n            board(c0, r0) = board(c0, r0 + 1): board(c0, r0 + 1) = 0: r0 = r0 + 1: mc = mc + 1\n        ELSEIF bx = c0 AND by = r0 - 1 THEN\n            board(c0, r0) = board(c0, r0 - 1): board(c0, r0 - 1) = 0: r0 = r0 - 1: mc = mc + 1\n        ELSE\n            BEEP\n        END IF\n    END IF\nLOOP",
        "safe": true
    },
    {
        "filename": "15 puzzle game_98.txt",
        "content": "( moves: 0 - up, 1 - down, 2 - left, 3 - right )\n\n[ stack ]                            is 15.solver ( --> [ )\n\n[ 0 swap find ]                      is find-empty ( board --> n )\n\n[ over + dup -1 >\n  over 4 < and iff\n  [ nip true ] else\n  [ drop false ] ] is try-nudge ( coord delta --> coord\u00a0? )\n\n[ dip [ dup find-empty 4 /mod ]\n  2 /mod 2 * 1 -\n  swap iff try-nudge else\n  [ dip swap\n    try-nudge\n    dip swap ]\n  dip [ swap 4 * + ] ]               is try-move-target ( board move --> board target\u00a0? )\n\n[ 2dup peek dip\n  [ -1 unrot poke\n    0 over find ]\n  unrot poke\n  0 swap -1 over find poke ]         is move-to ( board target --> board )\n\n[ try-move-target\n  iff [ move-to true ]\n  else [ drop false ] ]              is try-move ( board move --> board\u00a0? )\n\n[ [] 15 times\n  [ i^ 1+ join ]\n  0 join ]                  constant is <board> ( --> board )\n\n[ <board>\n  410 times ( 2 * the upper bound on the maximum moves required to solve )\n  [ 4 random\n    try-move drop ] ]                is <random-board> ( --> board )\n\n[ peek dup iff\n  [ number$\n    dup size 1 =\n    if [ space swap join ] ]\n  else [ drop $ '  ' ]\n  echo$ ]                            is echo-cell ( board n --> )\n\n[ 4 * 4 times\n  [ say '| '\n    2dup i^ +\n    echo-cell\n    say ' ' ]\n  say '|'\n  2drop ]                            is echo-row ( board n --> )\n\n[ 4 times\n  [ say '+----+----+----+----+' cr\n    dup i^ echo-row cr ]\n  say '+----+----+----+----+' cr\n  drop ]                             is echo-board ( board --> )\n\n[ <board> = ]                        is solved? ( board -->\u00a0? )\n\n[ $ 'Moves: ' input ]                is input-moves ( --> $ )\n\n[ dup char w = iff\n  [ drop 0 true ] done\n  dup char s = iff\n  [ drop 1 true ] done\n  dup char a = iff\n  [ drop 2 true ] done\n  dup char d = iff\n  [ drop 3 true ] done\n  false ]                            is char-to-move ( c --> move true | c false )\n\n[ input-moves witheach\n  [ char-to-move\n    if try-move\n    drop ] ]                         is player-move ( board --> board )\n\n[ ]'[ 15.solver put\n  [ cr dup echo-board\n    dup solved? not while\n    15.solver share do\n    again ]\n  15.solver release drop ]           is 15-solve-with ( board 'solver --> board )\n\n[ <random-board>\n  15-solve-with player-move ]        is 15-puzzle ( --> )\n\n15-puzzle",
        "safe": true
    },
    {
        "filename": "15 puzzle game_99.txt",
        "content": "puz15<-function(scramble.length=100){\n  m=matrix(c(1:15,0),byrow=T,ncol=4)\n  scramble=sample(c(\"w\",\"a\",\"s\",\"d\"),scramble.length,replace=T)\n  for(i in 1:scramble.length){\n    m=move(m,scramble[i])\n  }\n  win=F\n  turn=0\n  while(!win){\n    print.puz(m)\n    newmove=getmove()\n    if(newmove==\"w\"|newmove==\"a\"|newmove==\"s\"|newmove==\"d\"){\n      m=move(m,newmove)\n      turn=turn+1\n    }\n    else{\n      cat(\"Input not recognized\",\"\\n\")\n    }\n    if(!(F %in% m==matrix(c(1:15,0),byrow=T,ncol=4))){\n      win=T\n    }\n  }\n  print.puz(m)\n  cat(\"\\n\")\n  print(\"You win!\")\n  cat(\"\\n\",\"It took you\",turn,\"moves.\",\"\\n\")\n}\n\ngetmove<-function(){\n  direction<-readline(prompt=\"Move:\")\n  return(direction)\n}\nmove<-function(m,direction){\n  if(direction==\"w\"){\n    m=move.u(m)\n  }\n  else if(direction==\"s\"){\n    m=move.d(m)\n  }\n  else if(direction==\"a\"){\n    m=move.l(m)\n  }\n  else if(direction==\"d\"){\n    m=move.r(m)\n  }\n  return(m)\n}\nmove.u<-function(m){\n  if(0 %in% m[4,]){}\n  else{\n    pos=which(m==0)\n    m[pos]=m[pos+1]\n    m[pos+1]=0\n  }\n  return(m)\n}\nmove.d<-function(m){\n  if(0 %in% m[1,]){}\n  else{\n    pos=which(m==0)\n    m[pos]=m[pos-1]\n    m[pos-1]=0\n  }  \n  return(m)\n}\nmove.l<-function(m){\n  if(0 %in% m[,4]){return(m)}\n  else{return(t(move.u(t(m))))}\n}\nmove.r<-function(m){\n  if(0 %in% m[,1]){return(m)}\n  else{return(t(move.d(t(m))))}\n}\nprint.puz<-function(m){\n  cat(\"+----+----+----+----+\",\"\\n\")\n  for(r in 1:4){\n    string=\"|\"\n    for(c in 1:4){\n      if(m[r,c]==0)\n        string=paste(string,\"    |\",sep=\"\")\n      else if(m[r,c]<10)\n        string=paste(string,\"  \",m[r,c],\" |\",sep=\"\")\n      else\n        string=paste(string,\" \",m[r,c],\" |\",sep=\"\")\n    }\n    cat(string,\"\\n\",\"+----+----+----+----+\",\"\\n\",sep=\"\")\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_1.txt",
        "content": "15 14  1  6\n 9 11  4 12\n 0 10  7  3\n13  8  5  2",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_10.txt",
        "content": "/* ARM assembly Raspberry PI  */\n/*  program puzzle15solver.s   */\n/* my first other program find \u00e0 solution in 134 moves\u00a0!!! */\n/* this second program is a adaptation algorithme C++ and go rosetta code */\n/* thanck for the creators */ \n/* 1 byte by box on game board */\n\n/* create a file with nano  */\n/*  15,  2,   3,   4\n    5,   6,   7,   1\n    9,   10,  8,   11\n   13,  14,  12, 0     */\n   \n/*   Run this programm\u00a0: puzzle15solver <file name> */\n/*   wait several minutes for r\u00e9sult */\n\n/* REMARK 1\u00a0: this program use routines in a include file \n   see task Include a file language arm assembly \n   for the routine affichageMess conversion10 \n   see at end of this program the instruction include */\n/* for constantes see task include a file in arm assembly */\n/************************************/\n/* Constantes                       */\n/************************************/\n.include \"../constantes.inc\"\n\n.equ STDIN,  0     @ Linux input console\n.equ STDOUT, 1     @ Linux output console\n.equ EXIT,   1     @ Linux syscall\n.equ READ,   3     @ Linux syscall\n.equ WRITE,  4     @ Linux syscall\n.equ OPEN,   5     @ Linux syscall\n.equ CLOSE,  6     @ Linux syscall\n\n.equ TRUE, 1\n.equ FALSE, 0\n\n.equ O_RDWR,    0x0002        @ open for reading and writing\n\n.equ SIZE,           4\n.equ NBBOX,          SIZE * SIZE\n.equ TAILLEBUFFER,   100\n.equ NBMAXIELEMENTS, 100\n\n.equ CONST_I,    1\n.equ CONST_G,    8\n.equ CONST_E,    2\n.equ CONST_L,    4\n\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nszMessTitre:            .asciz \"Nom du fichier\u00a0: \"\nsMessResult:           .ascii \" \"\nsMessValeur:           .fill 11, 1, ' '             @ size => 11\nszCarriageReturn:      .asciz \"\\n\"\nszMessCounterSolution: .asciz \"Solution in @ moves\u00a0: \\n\"\n\n//szMessMoveError:       .asciz \"Huh... Impossible move\u00a0!!!!\\n\"\nszMessErreur:          .asciz \"Error detected.\\n\"\nszMessImpossible:      .asciz \"!!! Impossible solution\u00a0!!!\\n\"\nszMessErrBuffer:       .asciz \"buffer size too less\u00a0!!\"\nszMessSpaces:          .asciz \"    \"\n\niTabNr:  .int 3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3\niTabNc:  .int 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\n.align 4\nsZoneConv:      .skip 24\niAdrHeap:       .skip 4\nibox:           .skip SIZE * SIZE           @ game boxes\niAdrFicName:    .skip 4\niTabN0:         .skip 4 * NBMAXIELEMENTS    @ empty box\niTabN3:         .skip 4 * NBMAXIELEMENTS    @ moves\niTabN4:         .skip 4 * NBMAXIELEMENTS    @\u00a0????\niTabN2:         .skip 4 * NBMAXIELEMENTS    @ table game address\nsBuffer:        .skip TAILLEBUFFER\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                            @ INFO: main\n    mov r0,sp                    @ stack address for load parameter\n    bl traitFic                  @ read file and store value in array\n    cmp r0,#-1\n    beq 100f                     @ error\u00a0?\n\n    ldr r0,iAdribox\n    bl displayGame               @ display array game\n    \n    ldr r0,iAdribox              @ control if solution exists\n    bl controlSolution\n    cmp r0,#TRUE\n    beq 1f\n    ldr r0,iAdrszMessImpossible  @ no solution\u00a0!!!\n    bl affichageMess\n    b 100f\n\n1:\n    ldr r0,iAdribox\n    ldr r9,iAdriTabN2\n    str r0,[r9]                  @ N2 address global\n    \n    mov r10,#0                   @ variable _n global\n    mov r12,#0                   @ variable n global \n    bl searchSolution\n    cmp r0,#TRUE\n    bne 100f                     @ no solution\u00a0?\n    ldr r3,iAdriTabN2\n    ldr r0,[r3,r12,lsl #2]       @ visual solution control\n    bl displayGame\n    mov r0,r12                   @ move counter\n    ldr r1,iAdrsZoneConv\n    bl conversion10              @ conversion counter\n    mov r2,#0\n    strb r2,[r1,r0]              @ and display\n    ldr r0,iAdrszMessCounterSolution\n    bl strInsertAtCharInc\n    ldr r1,iAdrsZoneConv\n    bl affichageMess\n    ldr r5,iAdriTabN3\n    ldr r3,iAdrsBuffer\n    mov r2,#1\n    mov r4,#0\n2:                                @ loop solution display \n    ldrb r1,[r5,r2,lsl #2]\n    cmp r2,#TAILLEBUFFER\n    bge 99f\n    strb r1,[r3,r4]\n    add r4,r4,#1\n    add r2,r2,#1\n    cmp r2,r12\n    ble 2b\n    mov r1,#0\n    str r1,[r3,r4]                 @ z\u00e9ro final\n    mov r0,r3\n    bl affichageMess\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess\n    \n    b 100f\n\n99:\n    ldr r0,iAdrszMessErrBuffer\n    bl affichageMess\n100:                                 @ standard end of the program \n    mov r0, #0                       @ return code\n    mov r7, #EXIT                    @ request to exit program\n    svc #0                           @ perform the system call\n \niAdribox:                  .int ibox\niAdriTabN0:                .int iTabN0\niAdriTabN2:                .int iTabN2\niAdriTabN3:                .int iTabN3\niAdriTabN4:                .int iTabN4\niAdrszMessCounterSolution: .int szMessCounterSolution\niAdrszMessImpossible:      .int szMessImpossible\niAdrszMessErrBuffer:       .int szMessErrBuffer\niAdrsZoneConv:             .int sZoneConv\n/******************************************************************/\n/*      search    Solution                                        */ \n/******************************************************************/\nsearchSolution:                      @ INFO: searchSolution\n    push {r1-r8,lr}                  @ save  registers\n                                     @ address allocation place on the heap\n    mov r0,#0                        @ allocation place heap\n    mov r7,#0x2D                     @ call system 'brk'\n    svc #0\n    cmp r0,#-1                       @ allocation error\n    beq 99f\n    ldr r1,iAdriAdrHeap\n    str r0,[r1]                      @ store heap address\n    bl functionFN\n    ldr r3,iAdriTabN2\n    ldr r0,[r3,r12,lsl #2]           @ last current game\n    bl gameOK                        @ it is Ok\u00a0?\n    cmp r0,#TRUE\n    beq 100f                         @ yes --> end\n\n    ldr r1,iAdriAdrHeap              @ free up resources\n    ldr r0,[r1]                      @ restaur start address heap\n    mov r7,#0x2D                     @ call system 'brk'\n    svc #0\n    cmp r0,#-1                       @ allocation error\n    beq 99f\n    add r10,r10,#1                   @ _n\n    mov r12,#0                       @ n\n    bl searchSolution                @ next recursif call\n    b 100f\n99:\n    ldr r0,iAdrszMessErreur\n    bl affichageMess\n100:\n    pop {r1-r8,lr}                   @ restaur registers \n    bx lr                            @return\niAdrszMessErreur:           .int szMessErreur\niAdriAdrHeap:               .int iAdrHeap\n/******************************************************************/\n/*     Fonction FN                                                */ \n/******************************************************************/\nfunctionFN:                          @ INFO: functionFN\n    push {lr}                        @ save  register\n    ldr r4,iAdriTabN3\n    ldr r3,[r4,r12,lsl #2]\n    ldr r5,iAdriTabN0                @ load position empty box\n    ldr r6,[r5,r12,lsl #2]\n    cmp r6,#15                       @ last box\n    bne 2f\n    cmp r3,#'R'\n    bne 11f\n    mov r0,#CONST_G\n    bl functionFZ\n    b 100f\n11:\n    cmp r3,#'D'\n    bne 12f\n    mov r0,#CONST_L\n    bl functionFZ\n    b 100f\n12:\n    mov r0,#CONST_G + CONST_L\n    bl functionFZ\n    b 100f\n    \n2:\n    cmp r6,#12\n    bne 3f\n    cmp r3,#'L'\n    bne 21f\n    mov r0,#CONST_G\n    bl functionFZ\n    b 100f\n21:\n    cmp r3,#'D'\n    bne 22f\n    mov r0,#CONST_E\n    bl functionFZ\n    b 100f\n22:\n    mov r0,#CONST_E + CONST_G\n    bl functionFZ\n    b 100f\n3:\n    cmp r6,#13\n    beq 30f\n    cmp r6,#14\n    bne 4f\n30:\n    cmp r3,#'L'\n    bne 31f\n    mov r0,#CONST_G + CONST_L\n    bl functionFZ\n    b 100f\n31:\n    cmp r3,#'R'\n    bne 32f\n    mov r0,#CONST_G + CONST_E\n    bl functionFZ\n    b 100f\n32:\n    cmp r3,#'D'\n    bne 33f\n    mov r0,#CONST_E + CONST_L\n    bl functionFZ\n    b 100f\n33:\n    mov r0,#CONST_L + CONST_E + CONST_G\n    bl functionFZ\n    b 100f\n4:\n    cmp r6,#3\n    bne 5f\n    cmp r3,#'R'\n    bne 41f\n    mov r0,#CONST_I\n    bl functionFZ\n    b 100f\n41:\n    cmp r3,#'U'\n    bne 42f\n    mov r0,#CONST_L\n    bl functionFZ\n    b 100f\n42:\n    mov r0,#CONST_I + CONST_L\n    bl functionFZ\n    b 100f\n5:\n    cmp r6,#0\n    bne 6f\n    cmp r3,#'L'\n    bne 51f\n    mov r0,#CONST_I\n    bl functionFZ\n    b 100f\n51:\n    cmp r3,#'U'\n    bne 52f\n    mov r0,#CONST_E\n    bl functionFZ\n    b 100f\n52:\n    mov r0,#CONST_I + CONST_E\n    bl functionFZ\n    b 100f\n6:\n    cmp r6,#1\n    beq 60f\n    cmp r6,#2\n    bne 7f\n60:\n    cmp r3,#'L'\n    bne 61f\n    mov r0,#CONST_I + CONST_L\n    bl functionFZ\n    b 100f\n61:\n    cmp r3,#'R'\n    bne 62f\n    mov r0,#CONST_E + CONST_I\n    bl functionFZ\n    b 100f\n62:\n    cmp r3,#'U'\n    bne 63f\n    mov r0,#CONST_E + CONST_L\n    bl functionFZ\n    b 100f\n63:\n    mov r0,#CONST_I + CONST_E + CONST_L\n    bl functionFZ\n    b 100f\n7:\n    cmp r6,#7\n    beq 70f\n    cmp r6,#11\n    bne 8f\n70:\n    cmp r3,#'R'\n    bne 71f\n    mov r0,#CONST_I + CONST_G\n    bl functionFZ\n    b 100f\n71:\n    cmp r3,#'U'\n    bne 72f\n    mov r0,#CONST_G + CONST_L\n    bl functionFZ\n    b 100f\n72:\n    cmp r3,#'D'\n    bne 73f\n    mov r0,#CONST_I + CONST_L\n    bl functionFZ\n    b 100f\n73:\n    mov r0,#CONST_I + CONST_G + CONST_L\n    bl functionFZ\n    b 100f\n8:\n    cmp r6,#4\n    beq 80f\n    cmp r6,#8\n    bne 9f\n80:\n    cmp r3,#'D'\n    bne 81f\n    mov r0,#CONST_I + CONST_E\n    bl functionFZ\n    b 100f\n81:\n    cmp r3,#'U'\n    bne 82f\n    mov r0,#CONST_G + CONST_E\n    bl functionFZ\n    b 100f\n82:\n    cmp r3,#'L'\n    bne 83f\n    mov r0,#CONST_I + CONST_G\n    bl functionFZ\n    b 100f\n83:\n    mov r0,#CONST_G + CONST_E + CONST_I\n    bl functionFZ\n    b 100f\n9:\n    cmp r3,#'D'\n    bne 91f\n    mov r0,#CONST_I + CONST_E + CONST_L\n    bl functionFZ\n    b 100f\n91:\n    cmp r3,#'L'\n    bne 92f\n    mov r0,#CONST_I + CONST_G + CONST_L\n    bl functionFZ\n    b 100f\n92:\n    cmp r3,#'R'\n    bne 93f\n    mov r0,#CONST_I + CONST_G + CONST_E\n    bl functionFZ\n    b 100f\n93:\n    cmp r3,#'U'\n    bne 94f\n    mov r0,#CONST_G + CONST_E +  CONST_L\n    bl functionFZ\n    b 100f\n94:\n    mov r0,#CONST_G + CONST_L + CONST_I + CONST_E\n    bl functionFZ\n    b 100f\n\n99:                                  @ error\n    ldr r0,iAdrszMessErreur\n    bl affichageMess\n100:\n    pop {lr}                         @ restaur registers \n    bx lr                            @return\n\n/******************************************************************/\n/*     function FZ                           */ \n/*                                                 */\n/***************************************************************/\n/* r0 contains variable w           */\nfunctionFZ:                    @ INFO: functionFZ\n    push {r1,r2,lr}            @ save  registers \n    mov r2,r0 \n    and r1,r2,#CONST_I\n    cmp r1,#0\n    ble 1f\n    bl functionFI\n    bl functionFY\n    cmp r0,#TRUE\n    beq 100f\n    sub r12,r12,#1              @ variable n\n1:\n    ands r1,r2,#CONST_G\n    ble 2f\n    bl functionFG\n    bl functionFY\n    cmp r0,#TRUE\n    beq 100f\n    sub r12,r12,#1              @ variable n\n2:\n    ands r1,r2,#CONST_E\n    ble 3f\n    bl functionFE\n    bl functionFY\n    cmp r0,#TRUE\n    beq 100f\n    sub r12,r12,#1              @ variable n\n3:\n    ands r1,r2,#CONST_L\n    ble 4f\n    bl functionFL\n    bl functionFY\n    cmp r0,#TRUE\n    beq 100f\n    sub r12,r12,#1              @ variable n\n4:\n    mov r0,#FALSE\n100:\n    pop {r1,r2,lr}              @ restaur registers \n    bx lr                       @return\n/******************************************************************/\n/*               function FY                                 */ \n/******************************************************************/\nfunctionFY:                    @ INFO: functionFY\n    push {lr}                  @ save  registers\n    ldr r1,iAdriTabN2\n    ldr r0,[r1,r12,lsl #2]\n    bl gameOK                  @ game OK\u00a0?\n    cmp r0,#TRUE\n    beq 100f\n    ldr r1,iAdriTabN4\n    ldr r0,[r1,r12,lsl #2]\n    cmp r0,r10\n    bgt 1f\n    bl functionFN\n    b 100f\n1:\n    mov r0,#FALSE\n100:\n    pop {lr}                     @ restaur registers \n    bx lr                        @return\n\n/******************************************************************/\n/*     the empty box is down                                     */ \n/******************************************************************/\nfunctionFI:                       @ INFO: functionFI\n    push {r0-r8,lr}               @ save  registers\n    ldr r0,iAdriTabN0\n    ldr r1,[r0,r12,lsl #2]        @ empty box\n    add r2,r1,#4\n    ldr r3,[r9,r12,lsl #2]        @ load game current\n    ldrb r4,[r3,r2]               @ load box down empty box\n    add r5,r12,#1                 @ n+1\n    add r8,r1,#4                  @ new position empty case\n    str r8,[r0,r5,lsl #2]         @ store new position empty case\n    ldr r6,iAdriTabN3\n    \n    mov r7,#'D'                   @ down\n    str r7,[r6,r5,lsl #2]         @ store move\n    ldr r6,iAdriTabN4\n    ldr r7,[r6,r12,lsl #2]\n    str r7,[r6,r5,lsl #2]         @ N4 (n+1) = n4(n)\n    mov r0,r3\n    bl createGame                 @ create copy game\n    ldrb r3,[r0,r1]               @ and inversion box\n    ldrb r8,[r0,r2]\n    strb r8,[r0,r1]\n    strb r3,[r0,r2]\n    str r0,[r9,r5,lsl #2]         @ store new game in table\n    lsr r1,r1,#2                  @ line position empty case = N\u00b0/ 4\n    ldr r0,iAdriTabNr\n    ldr r2,[r0,r4,lsl #2]         @ load N\u00b0 line box moved\n    cmp r2,r1                     @ compare\u00a0????\n    ble 1f\n    add r7,r7,#1                  @ and increment\u00a0????\n    str r7,[r6,r5,lsl #2]\n1:\n    add r12,r12,#1                @ increment N\n    pop {r0-r8,lr} \n    bx lr                         @return\niAdriTabNr:        .int iTabNr\niAdriTabNc:        .int iTabNc\n/******************************************************************/\n/*     empty case UP   see explain in english in function FI      */ \n/******************************************************************/\nfunctionFG:                      @ INFO: functionFG\n    push {r0-r8,lr}              @ save  registers\n    ldr r0,iAdriTabN0\n    ldr r1,[r0,r12,lsl #2]       @ case vide\n    sub r2,r1,#4                 @ position case au dessus\n    ldr r3,[r9,r12,lsl #2]       @ extrait jeu courant\n    ldrb r4,[r3,r2]              @ extrait le contenu case au dessus\n    add r5,r12,#1                @ N+1 = N\n    sub r8,r1,#4                 @ nouvelle position case vide\n    str r8,[r0,r5,lsl #2]        @ et on la stocke\n    ldr r6,iAdriTabN3\n    mov r7,#'U'                  @ puis on stocke le code mouvement\n    str r7,[r6,r5,lsl #2]\n    ldr r6,iAdriTabN4\n    ldr r7,[r6,r12,lsl #2]\n    str r7,[r6,r5,lsl #2]        @ N4 (N+1) = N4 (N)\n    mov r0,r3                    @ jeu courant\n    bl createGame                @ cr\u00e9ation nouveau jeu\n    ldrb r3,[r0,r1]              @ et echange les 2 cases\n    ldrb r8,[r0,r2]\n    strb r8,[r0,r1]\n    strb r3,[r0,r2]\n    str r0,[r9,r5,lsl #2]        @ stocke la nouvelle situation \n    lsr r1,r1,#2                 @ ligne case vide = position /4\n    ldr r0,iAdriTabNr\n    ldr r2,[r0,r4,lsl #2]        @ extrait table \u00e0 la position case\n    cmp r2,r1                    @ et comparaison\u00a0???\n    bge 1f\n    add r7,r7,#1                 @ puis increment N4 de 1 \u00a0???\n    str r7,[r6,r5,lsl #2]\n1:\n    add r12,r12,#1               @ increment de N\n    pop {r0-r8,lr} \n    bx lr                        @return\n/******************************************************************/\n/*    empty case go right see explain finction FI ou FG en fran\u00e7ais */ \n/******************************************************************/\nfunctionFE:                       @ INFO: functionFE\n    push {r0-r8,lr}               @ save  registers\n    ldr r0,iAdriTabN0\n    ldr r1,[r0,r12,lsl #2]\n    add r2,r1,#1\n    ldr r3,[r9,r12,lsl #2]\n    ldrb r4,[r3,r2]               @ extrait le contenu case \n    add r5,r12,#1\n    add r8,r1,#1\n    str r8,[r0,r5,lsl #2]         @ nouvelle case vide\n    ldr r6,iAdriTabN3\n    mov r7,#'R'\n    str r7,[r6,r5,lsl #2]         @ mouvement\n    ldr r6,iAdriTabN4\n    ldr r7,[r6,r12,lsl #2]\n    str r7,[r6,r5,lsl #2]         @ N4\u00a0??\n    mov r0,r3\n    bl createGame\n    ldrb r3,[r0,r1]               @ exchange two boxes\n    ldrb r8,[r0,r2]\n    strb r8,[r0,r1]\n    strb r3,[r0,r2]\n    str r0,[r9,r5,lsl #2]         @ stocke la nouvelle situation \n    lsr r3,r1,#2\n    sub r1,r1,r3,lsl #2\n    ldr r0,iAdriTabNc\n    ldr r2,[r0,r4,lsl #2]         @ extrait table \u00e0 la position case\n    cmp r2,r1\n    ble 1f\n    add r7,r7,#1\n    str r7,[r6,r5,lsl #2]\n1:\n    add r12,r12,#1\n    pop {r0-r8,lr} \n    bx lr                        @return\n/******************************************************************/\n/*     empty box go left see explain function FI ou FG en fran\u00e7ais */ \n/******************************************************************/\nfunctionFL:                       @ INFO: functionFL\n    push {r0-r8,lr}               @ save  registers\n    ldr r0,iAdriTabN0\n    ldr r1,[r0,r12,lsl #2]        @ case vide\n    sub r2,r1,#1\n    ldr r3,[r9,r12,lsl #2]       @ extrait jeu courant\n    ldrb r4,[r3,r2]              @ extrait le contenu case \n    add r5,r12,#1\n    sub r8,r1,#1\n    str r8,[r0,r5,lsl #2]         @ nouvelle case vide\n    ldr r6,iAdriTabN3\n    mov r7,#'L'\n    str r7,[r6,r5,lsl #2]         @ mouvement\n    ldr r6,iAdriTabN4\n    ldr r7,[r6,r12,lsl #2]\n    str r7,[r6,r5,lsl #2]         @ N4\u00a0??\n    mov r0,r3\n    bl createGame\n    ldrb r3,[r0,r1]               @ exchange two boxes\n    ldrb r8,[r0,r2]\n    strb r8,[r0,r1]\n    strb r3,[r0,r2]\n    str r0,[r9,r5,lsl #2]         @ stocke la nouvelle situation \n    lsr r3,r1,#2\n    sub r1,r1,r3,lsl #2           @ compute remainder\n    ldr r0,iAdriTabNc\n    ldr r2,[r0,r4,lsl #2]         @ extrait table colonne \u00e0 la position case\n    cmp r2,r1\n    bge 1f\n    add r7,r7,#1\n    str r7,[r6,r5,lsl #2]\n1:\n    add r12,r12,#1\n    pop {r0-r8,lr} \n    bx lr                         @return\n/******************************************************************/\n/*     create new Game                                            */ \n/******************************************************************/\n/* r0 contains box address            */\n/* r0 return address new game  */\ncreateGame:                          @ INFO: createGame\n    push {r1-r8,lr}                  @ save  registers\n    mov r4,r0                        @ save value\n    mov r0,#0                        @ allocation place heap\n    mov r7,#0x2D                     @ call system 'brk'\n    svc #0\n    cmp r0,#-1                       @ allocation error\n    beq 99f\n    mov r5,r0                        @ save address heap for output string\n    add r0,#SIZE * SIZE              @ reservation place one element\n    mov r7,#0x2D                     @ call system 'brk'\n    svc #0\n    cmp r0,#-1                       @ allocation error\n    beq 99f\n    mov r2,#0\n1:                                   @ loop copy boxes\n    ldrb r3,[r4,r2]\n    strb r3,[r5,r2]\n    add r2,r2,#1\n    cmp r2,#NBBOX\n    blt 1b\n    add r11,r11,#1\n    mov r0,r5\n    b 100f\n99:                                  @ error\n    ldr r0,iAdrszMessErreur\n    bl affichageMess\n100:\n    pop {r1-r8,lr}                   @ restaur registers \n    bx lr                            @return\n/******************************************************************/\n/*     read file                                                   */ \n/******************************************************************/\n/* r0 contains address stack begin           */\ntraitFic:                             @ INFO: traitFic\n    push {r1-r8,fp,lr}                @ save  registers\n    mov fp,r0                         @  fp <- start address\n    ldr r4,[fp]                       @ number of Command line arguments\n    cmp r4,#1\n    movle r0,#-1\n    ble 99f\n    add r5,fp,#8                      @ second parameter address \n    ldr r5,[r5]\n    ldr r0,iAdriAdrFicName\n    str r5,[r0]\n    ldr r0,iAdrszMessTitre\n    bl affichageMess                  @ display string\n    mov r0,r5\n    bl affichageMess \n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess                  @ display carriage return\n\n    mov r0,r5                         @ file name\n    mov r1,#O_RDWR                    @ flags    \n    mov r2,#0                         @ mode \n    mov r7, #OPEN                     @ call system OPEN \n    svc 0 \n    cmp r0,#0                         @ error\u00a0?\n    ble 99f\n    mov r8,r0                         @ File Descriptor\n    ldr r1,iAdrsBuffer                @ buffer address\n    mov r2,#TAILLEBUFFER              @ buffer size\n    mov r7,#READ                      @ read file\n    svc #0\n    cmp r0,#0                         @ error\u00a0?\n    blt 99f\n    @ extraction datas\n    ldr r1,iAdrsBuffer                @ buffer address\n    add r1,r0\n    mov r0,#0                         @ store z\u00e9ro final\n    strb r0,[r1] \n    ldr r0,iAdribox                   @ game box address\n    ldr r1,iAdrsBuffer                @ buffer address\n    bl extracDatas\n                                      @ close file\n    mov r0,r8\n    mov r7, #CLOSE \n    svc 0 \n    mov r0,#0\n    b 100f\n99:                                   @ error\n    ldr r1,iAdrszMessErreur           @ error message\n    bl   displayError\n    mov r0,#-1\n100:\n    pop {r1-r8,fp,lr}                 @ restaur registers \n    bx lr                             @return\niAdriAdrFicName:              .int iAdrFicName\niAdrszMessTitre:              .int szMessTitre\niAdrsBuffer:                  .int sBuffer\n/******************************************************************/\n/*     extrac digit file buffer                                   */ \n/******************************************************************/\n/* r0 contains boxs address           */\n/* r1 contains buffer address         */\nextracDatas:                     @ INFO: extracDatas\n    push {r1-r8,lr}              @ save  registers\n    mov r7,r0\n    mov r6,r1\n    mov r2,#0                    @ string buffer indice\n    mov r4,r1                    @ start digit ascii\n    mov r5,#0                    @ box index\n1:\n    ldrb r3,[r6,r2]\n    cmp r3,#0\n    beq 4f                       @ end\n    cmp r3,#0xA\n    beq 2f\n    cmp r3,#','\n    beq 3f\n    add r2,#1\n    b 1b\n2:\n    mov r3,#0\n    strb r3,[r6,r2]\n    ldrb r3,[r6,r2]\n    cmp r3,#0xD\n    addeq r2,#2\n    addne r2,#1\n    b 4f\n \n3:\n    mov r3,#0\n    strb r3,[r6,r2]\n    add r2,#1\n4:  \n    mov r0,r4\n    bl conversionAtoD\n    strb r0,[r7,r5]\n    cmp r0,#0\n    ldreq r0,iAdriTabN0\n    streq r5,[r0]                @ empty box in item z\u00e9ro\n    add r5,#1\n    cmp r5,#NBBOX                @ number box = maxi\u00a0?\n    bge 100f \n    add r4,r6,r2                 @ new start address digit ascii\n    b 1b\n100:\n    pop {r1-r8,lr}               @ restaur registers \n    bx lr                        @return\n/******************************************************************/\n/*     control of the game solution                                      */ \n/******************************************************************/\n/* r0 contains boxs address           */\n/* r0 returns 0 if not possible       */\n/* r0 returns 1 if possible           */\ncontrolSolution:                 @ INFO: controlSolution\n    push {r1-r8,lr}              @ save  registers\n    mov r5,r0\n    ldr r8,iAdriTabN0\n    ldr r8,[r8]                  @ empty box\n    @ empty box\n    mov r7,#0\n    cmp r8,#1\n    moveq r7,#1\n    beq 1f\n    cmp r8,#3\n    moveq r7,#1\n    beq 1f\n    cmp r8,#4\n    moveq r7,#1\n    beq 1f\n    cmp r8,#6\n    moveq r7,#1\n    beq 1f\n    cmp r8,#9\n    moveq r7,#1\n    beq 1f\n    cmp r8,#11\n    moveq r7,#1\n    beq 1f\n    cmp r8,#12\n    moveq r7,#1\n    beq 1f\n    cmp r8,#14\n    moveq r7,#1\n1:\n    rsb r6,r8,#NBBOX - 1\n    add r7,r6\n                                 @ count permutations\n    mov r1,#-1\n    mov r6,#0\n2:\n    add r1,#1\n    cmp r1,#NBBOX\n    bge 80f\n    cmp r1,r8\n    beq 2b\n    ldrb r3,[r5,r1]\n    mov r2,r1\n3:\n    add r2,#1\n    cmp r2,#NBBOX\n    bge 2b\n    cmp r2,r8\n    beq 3b\n    ldrb r4,[r5,r2]\n    cmp r4,r3\n    addlt r6,#1\n    b 3b\n80:\n    add r6,r7\n    tst r6,#1\n    movne r0,#0                  @ impossible\n    moveq r0,#1                  @ OK\n\n100:\n    pop {r1-r8,lr}               @ restaur registers \n    bx lr                        @return\n/******************************************************************/\n/*     game Ok\u00a0?                                      */ \n/******************************************************************/\n/* r0 contains boxs address           */\ngameOK:                          @ INFO: gameOK\n    push {r1-r4,lr}              @ save  registers\n    mov r2,#0\n    ldrb r3,[r0,r2]\n    cmp r3,#0\n    moveq r3,#0xF\n    add r2,#1\n1:\n    ldrb r4,[r0,r2]\n    cmp r4,#0\n    moveq r3,#0xF\n    cmp r4,r3\n    movle  r0,#FALSE              @ game not Ok\n    ble 100f\n    mov r3,r4\n    add r2,#1\n    cmp r2,#NBBOX -2\n    ble 1b\n    mov r0,#TRUE                  @ game Ok\n\n100:\n    pop {r1-r4,lr}                @ restaur registers \n    bx lr                         @return\n/******************************************************************/\n/*     display game                                       */ \n/******************************************************************/\n/* r0 contains boxs address           */\ndisplayGame:                            @ INFO: displayGame\n    push {r0-r5,lr}                     @ save  registers\n    mov r4,r0\n    ldr r0,iAdrszMessTitre\n    bl affichageMess                    @ display string\n    ldr r0,iAdriAdrFicName\n    ldr r0,[r0]\n    bl affichageMess                    @ display string\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess                    @ display line return\n    mov r2,#0\n    ldr r1,iAdrsMessValeur\n1:\n    ldrb r0,[r4,r2]\n    cmp r0,#0\n    ldreq r0,iSpaces                    @ store spaces\n    streq r0,[r1]\n    beq 2f\n    bl conversion10                     @ call conversion decimal\n    mov r0,#0\n    strb r0,[r1,#3]                     @ z\u00e9ro final\n2:\n\n    ldr r0,iAdrsMessResult\n    bl affichageMess                    @ display message\n    add r0,r2,#1\n    tst r0,#0b11\n    bne 3f\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess                    @ display message\n3:\n    add r2,#1\n    cmp r2,#NBBOX - 1\n    ble 1b\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess                    @ display line return\n\n100:\n    pop {r0-r5,lr}                      @ restaur registers \n    bx lr                               @return\niSpaces:                       .int 0x00202020       @ spaces\n//iAdrszMessMoveError:           .int szMessMoveError\niAdrszCarriageReturn:          .int szCarriageReturn\niAdrsMessValeur:               .int sMessValeur\niAdrsMessResult:               .int sMessResult\n/***************************************************/\n/*      ROUTINES INCLUDE                           */\n/***************************************************/\n.include \"../affichage.inc\"",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_11.txt",
        "content": "Nom du fichier\u00a0: casR1.txt\nNom du fichier\u00a0: casR1.txt\n 15  14  1   6\n 9   11  4   12\n     10  7   3\n 13  8   5   2\n\nNom du fichier\u00a0: casR1.txt\n 1   2   3   4\n 5   6   7   8\n 9   10  11  12\n 13  14  15\n\nSolution in 52 moves\u00a0:\nRRRULDDLUUULDRURDDDRULLULURRRDDLDLUURDDLULURRULDRDRD\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_12.txt",
        "content": "/**@file  HybridIDA.c\n * @brief solve 4x4 sliding puzzle with IDA* algorithm\n * by RMM 2021-feb-22\n \n * The Interative Deepening A* is relatively easy to code in 'C' since\n * it does not need Queues and Lists to manage memory. Instead the\n * search space state is held on the LIFO stack frame of recursive\n * search function calls. Millions of nodes may be created but they\n * are automatically deleted during backtracking.\n\n * Run-time is a disadvantage with complex puzzles. Also it struggles\n * to solve puzzles with depth g>50. I provided a test puzzle of g=52\n * that works with ordinary search but the Rosetta challenge puzzle\n * cycles forever. The HybridIDA solves it in 18 seconds.\n \n * The HybridIDA solution has two phases.\n * 1. It stops searching when a permutation begins with 1234.\n * 2. Phase2 begins a regular search with the output of phase 1.\n\n * (But an regular one time search can be done with phase 2\n * only). Phase 1 is optional.)\n \n * Pros: Hybrid IDA* is faster and solves more puzzles.\n * Cons: May not find shortest path.\n */ \n#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n\ntypedef unsigned char u8t;\ntypedef unsigned short u16t;\nenum { NR=4, NC=4, NCELLS = NR*NC };\nenum { UP, DOWN, LEFT, RIGHT, NDIRS };\nenum { OK = 1<<8, XX = 1<<9, FOUND = 1<<10, zz=0x80 };\nenum { MAX_INT=0x7E, MAX_NODES=(16*65536)*90};\nenum { BIT_HDR=1<<0, BIT_GRID=1<<1, BIT_OTHER=1<<2 };\nenum { PHASE1,PHASE2 };  // solution phase\n\ntypedef struct { u16t dn; u16t hn; }HSORT_T;\n\ntypedef struct {\n   u8t data[NCELLS]; unsigned id; unsigned src;\n   u8t h; u8t g; u8t udlr;\n}NODE_T;  // contains puzzle data and metadata\n\nNODE_T goal44={\n   {1,2,3,4, 5,6,7,8, 9,10,11,12, 13,14,15,0},0,0,0,0,0};\nNODE_T work; // copy of puzzle with run-time changes\n\nNODE_T G34={ //g=34; n=248,055; (1phase)\n {13,9,5,4, 15,6,1,8, 0,10,2,11, 14,3,7,12},0,0,0,0,0};\n\nNODE_T G52={ // g=52; n=34,296,567; (1phase)\n   {15,13,9,5, 14,6,1,4,  10,12,0,8, 3,7,11,2},0,0,0,0,0};\n\nNODE_T G99={ // formidable Rosetta challenge (2phases)\n   {15,14,1,6, 9,11,4,12, 0,10,7,3, 13,8,5,2},0,0,0,0,0};\n\nstruct {\n   unsigned nodes;\n   unsigned gfound;\n   unsigned root_visits;\n   unsigned verbose;\n   unsigned locks;\n   unsigned phase;\n}my;\n\nu16t  HybridIDA_star(NODE_T *pNode);\nu16t  make_node(NODE_T *pNode, NODE_T *pNew, u8t udlr );\nu16t  search(NODE_T *pNode, u16t bound);\nu16t  taxi_dist( NODE_T *pNode);\nu16t  tile_home( NODE_T *p44);\nvoid  print_node( NODE_T *pN, const char *pMsg, short force );\nu16t  goal_found(NODE_T *pNode);\nchar  udlr_to_char( char udlr );\nvoid  idx_to_rc( u16t idx, u16t *row, u16t *col );\nvoid  sort_nodes(HSORT_T *p);\n\nint main( )\n{\n   my.verbose = 0;\t\t// minimal print node\n   // my.verbose |= BIT_HDR;\t// node header\n   // my.verbose |= BIT_GRID;\t// node 4x4 data\n   \n   memcpy(&work,  &G99, sizeof(NODE_T));  // select puzzle here\n   if(1){   // phase1 can skipped for easy puzzles\n      printf(\"Phase1: IDA* search for 1234 permutation..\\n\");\n      my.phase = PHASE1;\n      (void) HybridIDA_star(&work);\n   }\n   printf(\"Phase2: IDA* search phase1 seed..\\n\");\n   my.phase = PHASE2;\n   (void)HybridIDA_star(&work);\n   return 0;\n}\n\n/// \\brief driver for Iterative Deepining A*\nu16t HybridIDA_star(NODE_T *pN){\n   my.nodes = 1;\n   my.gfound = 0;\n   my.root_visits = 0;\n   pN->udlr = NDIRS;\n   pN->g = 0;\n   pN->h = taxi_dist(pN);\n   pN->id = my.nodes;\n   pN->src = 0;\n   const char *pr = {\"Start\"}; // for g++\n   print_node( pN,pr,1 );\n   u16t depth = pN->h;\n   while(1){\n      depth = search(pN,depth);\n      if( depth & FOUND){\n         return FOUND;  // goodbye\n      }\n      if( depth & 0xFF00 ){\n\t printf(\"..error %x\\n\",depth);\n\t return XX;\n      }\n      my.root_visits++;\n      printf(\"[root visits: %u, depth %u]\\n\",my.root_visits,depth);\n   }\n   return 0;\n}\n\n/// \\brief search is recursive. nodes are instance variables\nu16t search(NODE_T *pN, u16t bound){ \n   if(bound & 0xff00){ return bound; }\n   u16t f = pN->g + pN->h;\n   if( f > bound){ return f; }\n   if(goal_found(pN)){\n      my.gfound = pN->g;\n      memcpy(&work,pN,sizeof(NODE_T));\n      printf(\"total nodes=%d, g=%u \\n\", my.nodes, my.gfound);\n      const char *pr = {\"Found..\"}; // for g++\n      print_node( &work,pr,1 );\n      return FOUND;\n   }\n   NODE_T news;\n   // Sort successor nodes so that the lowest heuristic is visited\n   // before the less promising at the same level. This reduces the\n   // number of searches and finds more solutions\n   HSORT_T hlist[NDIRS];\n   for( short i=0; i<NDIRS; i++ ){\n      u16t rv = make_node(pN,&news, i );\n      hlist[i].dn = i;\n      if( rv & OK ){\n\t hlist[i].hn = news.h;\n\t continue;\n      }\n      hlist[i].hn = XX;\n   }\n   sort_nodes(&hlist[0]);\n   \n   u16t temp, min = MAX_INT; \n   for( short i=0; i<NDIRS; i++ ){\n      if( hlist[i].hn > 0xff ) continue;\n      temp = make_node(pN,&news, hlist[i].dn );\n      if( temp & XX ) return XX;\n      if( temp & OK ){\n\t news.id = my.nodes++;\n\t print_node(&news,\" succ\",0 );\n\t temp = search(&news, bound);\n\t if(temp & 0xff00){  return temp;}\n\t if(temp < min){ min = temp; }\n      }\n   }\n   return min;\n}\n\n/// \\brief sort nodes to prioitize heuristic low\nvoid sort_nodes(HSORT_T *p){\n   for( short s=0; s<NDIRS-1; s++ ){\n      HSORT_T tmp = p[0];\n      if( p[1].hn < p[0].hn ){tmp=p[0]; p[0]=p[1]; p[1]=tmp; }\n      if( p[2].hn < p[1].hn ){tmp=p[1]; p[1]=p[2]; p[2]=tmp; }\n      if( p[3].hn < p[2].hn ){tmp=p[2]; p[2]=p[3]; p[3]=tmp; }\n   }\n}\n\n/// \\brief return index of blank tile\nu16t tile_home(NODE_T *pN ){\n   for( short i=0; i<NCELLS; i++ ){\n      if( pN->data[i] == 0 ) return i;\n   }\n   return XX;\n}\n\n/// \\brief print node (or not) depending upon flags\nvoid print_node( NODE_T *pN, const char *pMsg, short force ){\n   const int tp1 = 0;\n   if( my.verbose & BIT_HDR || force || tp1){\n      char ch = udlr_to_char(pN->udlr);\n      printf(\"id:%u src:%u; h=%d, g=%u, udlr=%c, %s\\n\",\n\t     pN->id, pN->src, pN->h, pN->g, ch, pMsg);\n   }\n   if(my.verbose & BIT_GRID || force || tp1){\n      for(u16t i=0; i<NR; i++ ){\n\t for( u16t j=0; j<NC; j++ ){\n\t    printf(\"%3d\",pN->data[i*NR+j]);\n\t }\n\t printf(\"\\n\");\n      }\n      printf(\"\\n\");\n   }\n   //putchar('>');  getchar();\n}\n\n/// \\brief return true if selected tiles are settled\nu16t goal_found(NODE_T *pN) {\n   if(my.phase==PHASE1){\n      short tags = 0;\n      for( short i=0; i<(NC); i++ ){\n\t if( pN->data[i] == i+1 ) tags++;\n      }\n      if( tags==4 ) return 1;  // Permutation starts with 1234\n   }\n   \n   for( short i=0; i<(NR*NC); i++ ){\n      if( pN->data[i] != goal44.data[i] ) return 0;\n   }\n   return 1;\n}\n\n/// \\brief convert UDLR index to printable char\nchar udlr_to_char( char udlr ){\n   char ch = '?';\n   switch(udlr){\n   case UP:    ch = 'U'; break;\n   case DOWN:  ch = 'D'; break;\n   case LEFT:  ch = 'L'; break;\n   case RIGHT: ch = 'R'; break;\n   default: break;\n   }\n   return ch;\n}\n\n/// \\brief convert 1-D array index to 2-D row-column\nvoid idx_to_rc( u16t idx, u16t *row, u16t *col ){\n   *row = idx/NR; *col = abs( idx - (*row * NR));\n}\n\n/// \\brief make successor node with blank tile moved UDRL\n/// \\return success or error\nu16t make_node(NODE_T *pSrc, NODE_T *pNew, u8t udlr ){\n   u16t row,col,home_idx,idx2;\n   if(udlr>=NDIRS||udlr<0 ){ printf(\"invalid udlr %u\\n\",udlr); return XX; }\n   if(my.nodes > MAX_NODES ){ printf(\"excessive nodes %u\\n\",my.nodes);\n      return XX; }\n   memcpy(pNew,pSrc,sizeof(NODE_T));\n   home_idx = tile_home(pNew);\n   idx_to_rc(home_idx, &row, &col );\n\n   if( udlr == LEFT)  { if( col < 1 ) return 0; col--; }\n   if( udlr == RIGHT ){ if( col >= (NC-1) ) return 0; col++; }\n   if( udlr == DOWN ) { if(row >= (NR-1)) return 0; row++; }\n   if( udlr == UP ){\t if(row < 1) return 0; row--; }\n   idx2 = row * NR + col;\n   if( idx2 < NCELLS ){\n      u8t *p = &pNew->data[0];\n      p[home_idx] = p[idx2];\n      p[idx2]     = 0; // swap\n      pNew->src   = pSrc->id;\n      pNew->g     = pSrc->g + 1;\n      pNew->h     = taxi_dist(pNew);\n      pNew->udlr  = udlr; // latest move;\n      return OK;\n   }\n   return 0;\n}\n\n/// \\brief sum of 'manhattan taxi' distance between tile locations\nu16t taxi_dist( NODE_T *pN){\n   u16t tile,sum = 0, r1,c1,r2,c2;\n   u8t *p44 = &pN->data[0];\n   for( short i=0; i<(NR*NC); i++ ){\n      tile = p44[i];\n      if( tile==0 ) continue;\n      idx_to_rc(i, &r2, &c2 );\n      idx_to_rc(tile-1, &r1, &c1 );\n      sum += abs(r1-r2) + abs(c1-c2);\n   }\n   }\n   return sum;\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_13.txt",
        "content": "Phase1: IDA* search for 1234 permutation..\nid:1 src:0; h=36, g=0, udlr=?, Start\n 15 14  1  6\n  9 11  4 12\n  0 10  7  3\n 13  8  5  2\n\ntotal nodes=838133, g=32 \nid:838132 src:838131; h=12, g=32, udlr=D, Found..\n  1  2  3  4\n 15  0  7  6\n  9 10  5 12\n 13 14 11  8\n\nPhase2: IDA* search phase1 seed..\nid:1 src:0; h=12, g=0, udlr=?, Start\n  1  2  3  4\n 15  0  7  6\n  9 10  5 12\n 13 14 11  8\n\ntotal nodes=8598744, g=26 \nid:8598743 src:8598742; h=0, g=26, udlr=D, Found..\n  1  2  3  4\n  5  6  7  8\n  9 10 11 12\n 13 14 15  0\n\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_14.txt",
        "content": "using System;\nusing System.IO;\nusing System.IO.Compression;\nusing System.Runtime.InteropServices;\nusing System.Text;\n\npublic static class Program\n{\n    public static void Main(string[] args)\n    {\n        byte[] t = new byte[]    \n        {                   \n            15, 14, 1, 6,\n            9, 11, 4, 12,\n            0, 10, 7, 3,\n            13, 8, 5, 2,\n        };\n\n        Ultimate.SolvePuzzle15(t);\n    }\n}\n\npublic static class NativeLibraryHelper\n{\n    [DllImport(\"kernel32.dll\")]\n    public static extern IntPtr LoadLibrary(string DllToLoad);\n\n    [DllImport(\"kernel32.dll\")]\n    public static extern IntPtr GetProcAddress(IntPtr DllHandle, string ProcedureName);\n\n    [DllImport(\"kernel32.dll\")]\n    public static extern bool FreeLibrary(IntPtr DllHandle);\n\n    public static T GetMethod<T>(IntPtr DllHandle, string MethodName) where T\u00a0: class\n    {\n        T Method = null;\n\n        IntPtr MethodHandle = NativeLibraryHelper.GetProcAddress(DllHandle, MethodName);\n        if (MethodHandle\u00a0!= IntPtr.Zero)\n        {\n            Method = (T)((Object)Marshal.GetDelegateForFunctionPointer(MethodHandle, typeof(T)));\n        }\n\n        return Method;\n    }\n}\n\npublic static class Ultimate\n{\n    [UnmanagedFunctionPointer(CallingConvention.StdCall)]\n    [return: MarshalAs(UnmanagedType.LPWStr)]\n    private delegate string GetSolverName();\n\n    [UnmanagedFunctionPointer(CallingConvention.StdCall)]\n    [return: MarshalAs(UnmanagedType.LPWStr)]\n    private delegate string CallSolver([In] [Out] byte[] Array, int Len);\n\n    public static void SolvePuzzle15(byte[] t)\n    {\n        string LibPath = \"Solver.dll\";       \n\n        byte[] ZipedData = Convert.FromBase64String(Data.ToString());\n        byte[] UnzipedData = DecompressGZipArhive(new MemoryStream(ZipedData));\n        File.WriteAllBytes(LibPath, UnzipedData);\n\n        IntPtr DllHandle = NativeLibraryHelper.LoadLibrary(LibPath);\n\n        GetSolverName GetSolverName = NativeLibraryHelper.GetMethod<GetSolverName>(DllHandle, \"GetSolverName\");\n        Console.WriteLine(\"Hi! My name is {0}.\", GetSolverName());\n        Console.WriteLine();\n\n        Console.WriteLine(\"And I try solve puzzle15 with board:\");\n        for (int i = 0; i < t.Length; i += 4) Console.WriteLine(\"{0} {1} {2} {3}\", t[i], t[i + 1], t[i + 2], t[i + 3]);\n        Console.WriteLine();\n\n        CallSolver SolveThis = NativeLibraryHelper.GetMethod<CallSolver>(DllHandle, \"SolvePuzzle15\");\n\n        DateTime StartTime = DateTime.Now;\n        string Path = SolveThis(t, t.Length);\n\n        if (!String.IsNullOrEmpty(Path))\n        {\n            Path = Path.Trim();\n            Console.WriteLine(\"Ready! Solution path is\u00a0: {0}\", Path);\n            Console.WriteLine(\"Moves {0} and Time: {1}\", Path.Length, (DateTime.Now - StartTime).ToString());\n            Console.WriteLine();\n            Console.WriteLine(\"Bye bye\u00a0:)\");\n        }\n        else\n        {\n            Console.WriteLine(\"Sorry! I do know a solution\u00a0:(\");\n        }\n\n        NativeLibraryHelper.FreeLibrary(DllHandle);\n        File.Delete(LibPath);\n\n        Console.ReadKey();\n    }\n\n    private static byte[] DecompressGZipArhive(Stream FStream)\n    {\n        if (FStream == null) return new byte[0];\n\n        FStream.Seek(0, SeekOrigin.Begin);\n        MemoryStream OutStream = new MemoryStream();\n\n        using (GZipStream DecompressedStream = new GZipStream(FStream, CompressionMode.Decompress))\n        {\n            byte[] Buffer = new byte[1024];\n            int CountReadingBytes = 0;\n\n            while ((CountReadingBytes = DecompressedStream.Read(Buffer, 0, Buffer.Length)) > 0)\n            {\n                OutStream.Write(Buffer, 0, CountReadingBytes);\n            }\n        }\n        return OutStream.ToArray();\n    }\n\n    // no way make normal long string literal\n    private delegate StringBuilder AppendDelegate(string v);\n    private static StringBuilder Data = new StringBuilder(100000);\n    static Ultimate()\n    {\n        AppendDelegate a = Data.Append;\n        a(\"H4sICB6/w2MCAFBhc2NhbFNvbHZlci54ODYtNjQuZGxsAOxaZ3QbRRC+kyVHFg7nBAdCaDYYiKg21ab6ggR7cKL3HgJHDcWRqK\");\n        a(\"5RDDof4on26I/OAx79QTDVkmwcOTTboTgxxYQm+yimOcYU8c2eZORLaP/xi253dmdnZmdnZmd3EzgxJhQIguDEL5MRhHbB+qsV\");\n        a(\"/vmvGb/1t3hxfeHZojfL20X1zfKjzzl3UdnFdRedXTd/YdmC+RdeeFGw7IyzyupCF5ade2GZ77CjyhZedOZZO02f7qnI0jjcLw\");\n        a(\"hnXl00he6osNOW6zkKNozf7hC6thGE448RhJINBXzww1cUsnWHJTfBztzgIWcO4PPi3Tn8/AqKKS1POYVzqLzHKRw+RZgC4avd\");\n        a(\"8uC4Uzh9tvCf/8653ynMLvjr/p2CZ10eRIk5WwLdSZObilMmCKfvdOb84HzUoRfIDJy5JLNjCl4tyOxUR4jg6xGhE/QXo0ythV\");\n        a(\"e708UcD3O05irsgfIdlHa8MxYtQpWvhVDpXLc9EN8Djjya6m76xIBHLD0o7fKda/HdfTrXOQwJZfE68M7KzoOvUZbeHJR2+erO\");\n        a(\"uuCiBQLWhq8RcFBuuhbePOH/vyl/ma3PuNE5BT7RBh9pgw+2wfNs8F42eBcbvJ0N3tIGz7HBM22wxwY7bPDEDVPh723wiA1ebY\");\n        a(\"NX2eB+G7zcBidt8Is2+Bkb/KgNvs8G326Db7DBbTZ4sQ2+0gbX2eDzbPAZNvhEG3ykDT7YBs+zwXvZ4F1s8HY2eEsbPMcGz7TB\");\n        a(\"HhvssMET19vW3waP2ODVNniVDe63wcttcNIGv2iDn7HBj9rg+2zw7Tb4BhvcZoMX2+ArbXCdDT7PBp9hg0+0wUfa4INt8DwbvJ\");\n        a(\"cN3sUGb2eDt7TBc2zwTBvsscEOGzwRs62/DR6xwatt8Cob3G+Dl/8DnLTBL/4D/IwNftQG32eDb7fBN9jgNhu82AZfOQVuc213\");\n        a(\"h0OIuHZD3tEJmEXPrBhgeqrb1YIMRGS6a9XGTkGfVbqTU1B112Yo0qlMJsOi0/tucwhp9S1s8zRoLkbz8a6Nl4NUjv4xTH+Tuo\");\n        a(\"dYdFYZOlg0MJ5+/qrsoLJTcoh5+J9TT5zpp6SZHhpl+us+vZst84/zjEKNulb2ZMnEThOEqvjZ0WMzrf31e8ntGfzJ4bioGoFx\");\n        a(\"ZUHKLy0tLQosSCmJTxwv7IPBqrdHWbE6oK9Q9ZWsKIFZ+mqSTW/GGEA9KbdT2pVe7ytRQMtweh7N0oAQBoSIniVA1KnzgQSbVw\");\n        a(\"okymh6llVJp+9keVOzzWdI1ntzE0E5mi3TKIjlck7yl9+J7THjnOyFmkMAMMpJlx8sAPCnWWs8NA16TuzgFJjeyYU9i4TVByDv\");\n        a(\"0J+yCrn1TD/Ukr9K+X8s/NXcTH+MhbusrrPYve5sF8FgMDRlCDOcFfkNqh5n3j5pyfWoLypiYkpavBCZphIed0vXLkDjWHJacM\");\n        a(\"+xpBgsbnPOUDKpiIOFk+JY0hGUNAMt4bRD06nNMZZ0BqdbTU7e4gzoCSUx7ApVW5WC4KwYAwLjvW4l0xMaVcJD0wKt8cZSaYtm\");\n        a(\"kgdMwCGTBKfQD51Ky8+UNdcVMVRKIOGuGFjGDN+MIdU4egYMbN6Qqh+ZBilqHKXGcTSOonE8tALEtzDD7aAgSFsswRflbOcMab\");\n        a(\"ZvRi1rSRJDsPmKtYwQ8fZawKBfqxrqjDiRSqlS58FxfI5MUVsvtQ1QWy+1DWSoNSsJtQ5RaxptWUGobRQfiPKw0pImHkrLOBVS\");\n        a(\"+GwsuPTE6PBKmIsqJknf9fNJ13uQrtdjmeU5dXNVs/CII0/dXNVoc06qO6fqfXOqLkW3m7QN3UDhf2p6jqZpOW1osTxGdn2PZj\");\n        a(\"J1u4EK1/dsmlEJVDsbqi3J6tutGqUz0OZW9Zmhd0nbww2YF1d4dj2h2+Z8tVv6Tubpe4Tru5roV5LGqkljldQ2l9rKqG0utZVx\");\n        a(\"fWclodbZ1FqCNksQanLjMzP0qF3b52W1/R603WnznwkYep1AyEMZKl4Qs38B6cnEWGJasGosgRXxRUQWTuA3Io4lHMFizadTg4\");\n        a(\"NWZizhBAKHnbQqDHEivHp/lkgXhra3gGkACoLTYyrHcjPo4UfW2t/I6WYSWIbQT51sX9L+or3zVgjItaoux/FL4deL3wAGoxjC\");\n        a(\"L43fKH7joffNW6QtfBY+dIAB+KToQ7ZKYzgwRJ80fcgwMe5tUssJmUm1aLJ0YUrRU5p0eg8LfzIKGakanAfCJZp0cY+gSRdhsD\");\n        a(\"ehSUH83o+vGNqarh5WpM1Z0hY0/iKnm5Bz/Yh2Hlaz/LLPWTiV6ZRejrOoTxxlNclLv+nM5zc/x49zCR5BNHK85LG4GDpak0JT\");\n        a(\"OfYNm+U5XXGTq7X4M1IxsNfNvy9NEoyTBF91alLTck265Ds3Pv34mIBs82Jiv7+q39yE9Gubn5wYKSHcviFfUa+sJ/vSvvLerY\");\n        a(\"/BGdvi2bf2nFnfeL4FKmsGgptghqo3yenPk5Y6xXl7OR0hxMd4aLQq3ommYgfzpviw8L7n3oQjdNA1mikyHZki6aZ4Pjn0K7y/\");\n        a(\"cJQBoYDZMNDvnewXqV+0+YOeepH2YXbDqJRwZDhTe7+IMtsft/dfM0PvzW9j1/QB0aODUBaewfIxpCfSBOTBozbYUpc9vxhd2T\");\n        a(\"CuGf7xrenSy9oyp/ZLT5wyjn6rK1/+jZl+LgLW/BJVPxfB7JIyVb9iLtMvqWX6FQzrVOFmulxJ+yTK6h+kpksOx+eK03/wSU3y\");\n        a(\"xfTVKaJR5fpYtnLbPdnKvU9lK4/Es5Wne7OVF4b4dG4bRbHyhR/xxdoK4Qkx3C8gRBgbMwNyGZDLgFwG5DIglwG5DMhlzK/8Qb\");\n        a(\"qIRLmIi3IRRMGXi0IViGJVIIpVgShWBaJYFYhiVbKiXE+iDK5e+QgJk5lfTWo67thcBsmi++5cQRlK9wseGsceZMbhs5k+61y0\");\n        a(\"olqC6oVWtQzVRRw3kTbfzKUqp54GgkfxZEtPhcc3qDsknN7i0s3DaTFYFU4fHqwIp8uD24bT2wS3DKc3Cm5tbo/4IT2fcIUpDu\");\n        a(\"md5haAtZfOEswNtZj2kksw16eyQDALUeqvI5dwPb4LuLbGgx5j+rxyp5DpNSmz2h9VTZ9t5XEnTbEfanqYRdWKMn9V/MVKyhh/\");\n        a(\"/jmT4S3pb7/NZAxfRS0feHznZP7VvG/F9eQ0c9INv2Uymu7SAKavR113nY8q5ExvINhSNJu9aoarEqia7h83XHugpvt/Hfz0jp\");\n        a(\"ULx6UnjvnVMtMcP9naitKnQbJ8mvb+wyZy/fZ88Rd7R+4P8VW67k4eLGnv20K67lIAsvR8XNYRzj4pkYsS/vIeFeufGCpTixCb\");\n        a(\"EwwAkgeGwOlNsr4hZImmlN3fJ7fBmtRlPyh6v9K3WgmvHleiTo/pAQ9VL6JgTN0/wvExOkdKB6nVjPDWA94UOnlCHxWo6kdyBD\");\n        a(\"mfAAQKNFx+wQ1A8SaU8CfTlL7hgDel9H2iiD1mtU96fmPp+TmKdzCgrwq0DgY3D7T2NxSzZXGKasNdGNcu4jP8Yk4HSQfxVWp6\");\n        a(\"LusM6J1K36dK+NPxQLR4vUkILMyAPmBuS/MhP80jv57cTscxs8Si5abJEq33AWcJiK8rNa/XFSl9Q6DqNvdVliVgORlzN9qvIK\");\n        a(\"+I35yAdyCgJwMw5VkkcFFWYHNDLq0p5cv5elV80qiPyvnr66qeqG2rqpWWdrOa3saC2sh7VFejtSLTV6VLf8xkaiO7Zj0Tw3Pj\");\n        a(\"jztWPlo+hnspJ9Kt6m/7pKXb4LezsqBLWfAmlpsozgKE0icdtho1WIKsv4v8UQfv79Ee2tYfSZ8tI36KLHqYmDXRrenDoqUF6R\");\n        a(\"t/gPqbAPEREzRi77wRh6w9Yj5G+CM4Dx2F/kNz/emD0WzWrKOjCh1/L4MEjLMPiDp3iBRYsUE+RT751NP+1EYuXklLN5aWOryd\");\n        a(\"odlQgxhYEIf6efqXVsfh9J1aTB+wRZd8/2OtPcFSxBeGrZT/NaUfGIPUjqq43SuxzlTQiBKKawznX61lHxkZxI+d1vrQiF64Vi\");\n        a(\"B6oqjqg0BtmNldsCMLd4rkmWsG4KJmgaIjzf+E6W9pPI9QcRxtf/MN64+tWc0SIwVMf5+Fu0V2/vse8m9vL5hVRgoV/WfWmgm9\");\n        a(\"yfRRZBkwFtW7iom9qjeO08ImDJMXEzFzpkW3rTBSwDmHvxFZzXd136reQTkyh2SsJE1m5X1K0fsC0SNEHNaZ/inTP+KM1y0Tyc\");\n        a(\"Py5GH58gxYYmzGxYDezQ1ycsiRAmVSkB/qvgl4V/gjGxPzw0kQu39gYitg3QGqrKKNyvEdHbm/Qw+l5gyRBPcNBTL3N2XFkFqU\");\n        a(\"jJQW5PmLPZ7rgXFNn36y4aAtdGEu0QA5nDrI4hrdcjuVWswXESbH/ylNn6onIQ1cvqEwUBW34rHYWEgnDFhKPyyvSKnpa3Ch05\");\n        a(\"zNIW9foCbRUJytYzCnrUYPhrkfnjN3ueUTKlSxJ73F6FrbgLQ0EU7PD4/PWeTm1TLTEUlxD7FQfJFJOuFxsb7Sp8fJImPYtcE2\");\n        a(\"jmVFzJXU6KzwtQ7hoLZiz4GRYhEL6QR20yotlmO0zv3q7sxa8nSLJe0zUK5Ff6t10e+c1F+kpGW15ddMlPmBM50Yt1PP+c8DFU\");\n        a(\"OIuDkboAiHmKXo42QGd/yKo+HSQlYz0HAQSjIObzJH+9qKMhGUr4HcanQJBxT9uxep08oYXplAD+JNGbekifRCwLEYcSxDwjBp\");\n        a(\"h/9Bnpf+hTxrfv8reXa0yfPhz/9GHpgzMxxwgzJjl4BRoiRGymSjmukVFbLe6YOM0pODBOk/+Mv7FenJVQSUI2OYAJDkwFh5hk\");\n        a(\"lPrmGJb8rKx2TaXJtV8T1ZX8W/SUX8nsiXx1VxgCXMsvJBJg4QHxBUxV6mi1LHkW5Z6qh1i73heK2my27/kp7gpswQaeDWRDC0\");\n        a(\"PkEi4uO5blHQ+FqX2OaUiz9Mf0/qcO3XhuSsY9ZFcNKzfVFniSbXpOpdWtWgeYgqdfQoUkccWQRrr7nu02r8W19ZM4zLk/1Vcb\");\n        a(\"mGwCV1JNn58ZkBYKlinGEAspOgS2vpBPeWX6qERpf2UpUQQ08nu41nyWzNz+TZ1NB+tmb9KWvSLDHhUBJpEE7yIPytQ0OE2xnJ\");\n        a(\"rnp+fDauVlt1h3Cw4XQwvfBgw+fAEeRAN1VKUCkZvkjkuQocmw475/dhxPSjMMK6TMNq88sYqs2lWgnVKsFBuk4XBIj6rYi8eh\");\n        a(\"mzWHm4TkBa6ji6olLs1cBBa6mvQC4c3OtPtE9BX41CoujR2CefFsm+qtNvkt0iRa6GoFTWkqDDz4ILH9mLka5HuGTFkGJ9oJS4\");\n        a(\"OcpjQIGeltH+hi1L05fxk1uW2UP6X8u055+UmyyZSqbKVLMumcytWr60GLxNDPyWtjwWiofLhBP9853oOwF9bU7HEpwimPQqtp\");\n        a(\"lC6Dpm30jy4z/cqfd3cuC7yjJUvDKXF89VolD1B6t58XgtL55jvHjlcBSarL+t6e9rkrfXp7/ODH8l01vPQQeq1aheTDgtmQGh\");\n        a(\"0al1DAia3JIRm5umaXIHkoeNNX9rpqFQ81dlzOnUlYH9UZegr4JuCq7B4cIoRmKCKY1dDcBnnLkYl4a7f01ADfKCw76zSECMN8\");\n        a(\"1tZawGrg5RvOPtRdNroPmbQ2gAzVdodM2w5pPUYaYvbP5emtF6OWRra23Ct6JZutkfl55vbQSQSDu3zkwT6FyD8xjHymU9ksDK\");\n        a(\"4dn+CH6IL+jH2UdraRiHsbTew++2GkZRvZm2Af+tAgy23qctg+mKAhVziWp9Ra3mw7eaRf23Zm39ZlKZry2AO1quMrpAfxYngi\");\n        a(\"VxqXUrp8AHVws5Gnw4w/dMTuqCisp/IHWbC8eDwQKMhKyZaZasXHObQ7V3tOLoNiB1FC+mr2+xQ0yF407ob1lMWurHTRC/HvEm\");\n        a(\"EUD4/EJVXIC5WKJmDJ3CV+p4PY/vdwXguwAfxKfJMSf//ZhXaMzOWVnhLJswA7p+Mff/YlhRLylfe2k9wdwW0x7FamKZ4Imv9I\");\n        a(\"ZcfN9o3x8fBgtAVtviHxcFBg5sxVmjiGGuDCiH47tpXiycgd++nZn6zbTWeNNs4gPSQwzNKNPaMv8AzimHSR3HjMvtnVnx3nLQ\");\n        a(\"GiZY9JgUomf6NOxOEBSIoZl2AmapGvWngEmPJUP+yp70fOxd3Zg5SRRIszUr8S40pKwYBs6tSK6J/jfrccvrgvBoAek0bCvqxg\");\n        a(\"pA3HRunPySldPhLGciIwWdU3B52qOWr0RGau7N80lEbYZ3JiYux3lSc3E1pDBW0VcoK0zp+UCXL3Ly9FsxjJX3YRh01QUz3ffT\");\n        a(\"TMNGQH2LDgcI+6d0qTUrG104ZYcep2Y1eoJIYnThCNi0AZqlmxNWfibrKfN0LebXl+NVydzfpyfAXhZTct9IHntZf92vd/v0lf\");\n        a(\"KKb3yR73BSPKVrXkTd7Faf3ucrT4CIJYidV6PLj3vPR7UYiuC2aO3mgRerQ2e4plloCMcdpDrq6/a5bkOOp+0d6mrYnFQu+jg9\");\n        a(\"9ELXpGh/EVRK+Tc56WF5bqkZpH042qRTgccAbIcsCq68bhcrdFneGuL5sebbe2FXw2Z8rf1Sx5v5jN9wc8axtb34bzgjmaSe6n\");\n        a(\"Uzf0GkZzArdBtW6Das0G1YoduwQrdhhW6Dh24rvbfyWdhrcQUEjUsd/bK3V0bte2k7/E5wNYQdwvdM2iGuQfGNG0odvejBlfLO\");\n        a(\"iSsdwWlYWNrHgU9k3J1554l78L4Ik25AShjCJf9ZA6q+EEYaSjOcM3iamMS031KNhZUI7GdVa7K0tAEhcyxE4Xzc9FA0j4uox0\");\n        a(\"meF8jEvAkI+RmBsrcLAf0TCuifQLLPsL/4xaEACaKvTLMfaGt6VRR419ZZjxwFh24WLS5QsENkU+xTvwamX/yC7GAs6MOn0UNo\");\n        a(\"3c6C7U13trYjNpJuys/MrbQYuHdLHe+LtCb8mIFLiffntZVuh8MVT0xgUE2rmIHJG5i8gckbmLyByRuYPNf6uvZfrBDtv5fzoq\");\n        a(\"EZWotAazFoDT4aukfVGx62NHdMXIUDRd4GOdLcwmpSXy0+AQYLOhwu0K4ZpxyPqffI0p3LaHdcs1KL5YyxB4bYS9HGwNvux24e\");\n        a(\"bp7Savzt9dNAw99uuqh4CtPsgvqtf5osxqGDX0WcAVHGSRe0CjzeepOIrwR5E7jD1GpWaZK6SmsdpL1cHIhhTYhXHAeC9FPfQd\");\n        a(\"tYFurdNrsqKX7BYxwTx8o44LsrsivTZQJX/ChWuyQTXD+H0+107GgW50FlGq0M5vp1YylWqxDnbfS+Rb0Rp2cKaiVHzU5jBjre\");\n        a(\"gwToKNnJ6sA2Z1ZoMen5JAg5C8+OskofRhPSvEixQEj4JIlEzbuNhfi+09RPaoLT8N2GZuX961nxq9lvRvis4DN5kvk5bT9NNE\");\n        a(\"8sTDQP2p7jIB63Sx3+p7yc2dw8ZoRHzErymLVYzLQYYuhT4WFRa+2pr9ReymTono4n/cgXpaU+V+/Z0cPzJluanWzNyqaV2Fwt\");\n        a(\"mzRgkwZs0oBNGrBJAzZpwCZzBm235zLLng+38snjrXzydCufPMfKJy+28snLeQHylnm3B/Quf+RNnkzCNGHLtZrRkLPte7r9cS\");\n        a(\"RXDwuYJjRxD6XW3XDbBjc2bORI5kEI+tUNMrZOQI2zVCBVw/6eIrNPf/wxTV7gvpDdEaqpgzvDLgU8MoO4CBxSsNuiEloPOeoY\");\n        a(\"MlNYyJba3qdUN5bCR0LVlgjVSI1k/X3Tje9HlMxiZMN0OkLxY4E/YhZCtAjfwSNwtHsa3KjdQz2I79UUTyi5OiYG6B7Qi5FD+S\");\n        a(\"O87VaY4mvAeE9MUnZLk01Cpnsws42wqBFCF1Oo3SqmyE/FJKgks7ES8qQoakvXliJrwXCpY7k3BUOF6Q4g3KoDNMcCTVzFMEjR\");\n        a(\"yU3bVX11uuibP910B5tBt5NB88npyaynzklnbRom/HVwg6wxtpMJa1bcRP7X5n8Y55FTzLk5k6ObsUQON1JckvWvTu6i33CfHm\");\n        a(\"vqN6uAD7ZPwSUduSEkB4Y41jnkbXwzjTuuS2wFOoDYWe9Y8CXE9om/Q26+HlDUki/RkRsBx7QiAxQegcK3+wtNHBPJEpxJBAtC\");\n        a(\"ES1mTVYztwPtfBej0MSnW+rOk71lYYwzwYNXU59ZnX2HmDpvGkk8EdT+YuTbKG+FmNv+lZi3ZsU8/wvuA/Ajsc2PNbdc1LBc1L\");\n        a(\"Bc1LBc1LBc1LBcFBHA7u15+/1Q7v9HkRu3nVKpIX31GyWaX3fjMaantm03z5LBkFLb/LszdIACU2Th4QJsDispv9yFGprrPb+7\");\n        a(\"67aVUQ0PY3GHeajtCa6HJHHlvOZ95hQFR6gh5KxdWhQDIZe0+F7Kt6x662LUlwxKS66kNj/dWINqj2aoHuTon4g4mJ2OnspBc4\");\n        a(\"b1rt4yIgoQbXnbph5CpGyTxECy2eBcMhj8COLuYh5g7qRl38lJIJpKs9Mj8nIfj2dRiYyh4QTlKW5zQ+iVODf1dzvQskzADNpF\");\n        a(\"So/s/29rbf3FoL8Udv5e6HAAO/8Qdv60mtUnLn+QqPvaQpX0/1iW3773Io+/qsdf9bX+tqkpdAu98yHnLlz86tBMZc1qVexnfa\");\n        a(\"twxbgZPV+dmyR85k3obystE3ysm8bq75o7qHrfnyPZmk9wWMiOlJGN66lz44Qve5PA5jETmziStk5KFXnIvFsgxSBeLxkLzqRk\");\n        a(\"K1QMu+12FqL1ZSv9km6OR3gq20kHc35pRcNBya8PcyInciJi1yTmIO2qhFmQxZT1nzlmZRaT+qFRZFdQlwF1GVCXAXXZNPyX9s\");\n        a(\"kwPdgolipE9w/9Zo0svZIIufj9dnmcHy3Ojffh6I27umLMMJl9lp+17+UOwbd38eI6XGJQMhDzw1Qk1CeKhAa0vVgEe4TRrzDV\");\n        a(\"nN2QnZE57uDTl/PXgjWr8U6gr9AHzo970OZN0rUdft8zcTRSKsr6SlPKNvXj3aLbyTXZ3/SsDC3aLSm335LfYooRmFAM07wVJn\");\n        a(\"QPTOhhmNBT2F3brWm/H9BfU/UAaawSx9LPrJjw4gYUGI5cDQp0QZPJhFwdG/MrWISScLVQL/Ga4aZDqr83+4ZHVatdwE7H9ASd\");\n        a(\"WGMydIenmz/fRRTYFebb7qEh0pO9uOhXojLu4ZMR36xP1/2E0kfnzed8OrGLG6F4oPXrYGG4m/ZlVBv2D3e7WDjjbijscPNX6g\");\n        a(\"XdzDuOGwuq1IxL6hraA0r035Ff+bwTei/FQ/NMJDe8cpLh7xW7zVl8fUCVhREL0YlT46eVKMPjrvo0fwVVvWlQ9elpGmf4Uzh7\");\n        a(\"boIiPO5sXI8jULsWA4EUyebz/u6nS8pb0VM1eLY/epkD5Hw1ow1FkAQWXSfGlAXdzfWuT3av28aqra5ZtL6y4D16JGmGPkRzOt\");\n        a(\"ohyepKfsiPhX8RQ4dkUStDsrlBdn/w6aNcXhkTQB3dn9YER1CTlqI5HEfj96TgrADu3DwnVYSKWjPUuAHdA3kI8A7J4rKYT/8i\");\n        a(\"pgLHgJEgF/jtczwPfgelS9GX8ywi5MSV8zTQPjt6/C+tg/WlZ0eP+D17qW/4ByhhNees1bYjW0BJkd5J5W0yNwllDQgmKftMEB\");\n        a(\"Zln0hV1QV/ed+8NrZDWtqX5eDHWJzTSrXYn22VaJPDy0RMtH4Yj6nHiT4ILtf01h8k6+/JeG6j/UDmClqYEvkyh0r+HL8TpwmW\");\n        a(\"PdBu29GuT7Oc3Wj314w2vRaDPeE1J7Tln2N2tOQoyZejDG3YG75hBrzUgJca8FIDXmrASw14qQEvXWt/kOl0L3Q7BLlb8DTX4K\");\n        a(\"IJT530buix4ouCzQeyzQjULK/fyA9uB+LVb4YcnigKfoZvWfCj4Ae8uQ2tzRPb120uN49sHyzF1xGaqcWwUxEJcxrslyogpdYs\");\n        a(\"l64lG5YxDsOaJyqkxRHAzSMVwS2aR8TgdvSpah7xBKubR+YG12seKZNaNb4XQ8wSojN8HEDQBOzgDA7mfW5e30+LWXwad1PwqG\");\n        a(\"oZCckdnjg+OC08cXnQEZoDTAdRw1zXnzrf7FgPyde8z4zK4AjpZK33f7j961bIC1R9VjWGZ1j+kkSX7RXpB3Dfreh+cJ2m7I3i\");\n        a(\"2rtFLi9o+oXmfabhnlMx/ALDwkrXhdHHcgd+dFZKrRejSVnmB0yXnHwsaKkgb/1Hh6p+tua75vqKMk9oI2kpOLIXcm/n2GaHX+\");\n        a(\"NP5UmCh18gPwffgNBWLC3pkZY8R1yGK6XFJ/FK0aUbNg+7645oHnZdWtY8vEndQVTbzqylMWBaLIWHK+VIytwVMky2Ib/akxo3\");\n        a(\"12L5bcdRmwf6PArtT5XE8NzGxUZofguP7b69oKFFdJZOUfbgRTr0fZ1LrUkt8kCJwzy3ilEvE99Swn4BayEpe4N6dG9MJacQRf\");\n        a(\"8RU68Qgi5lzQdajNdDMtdGcC+GkFa/G8PVZXB9/i3F1xGcY5Yp0qtdit5lbkS2KHXw+npUX0BVDZchQzH+MJ/7bw78PRzWTx7g\");\n        a(\"wVNyQFL7AlKgt2rQ+q+tSdE8JPf/sMXatl1qq7uDOwF3QA6b8+XwL3MWOXco47790WRLYW3zN2gDaqgUvHOEGJ7mlZpVTc/j01\");\n        a(\"jCDaHlC/oy76hZGPCmVD2OZ/W8fCP3Jq7SSdaYqSK5EhPpk/vwgGm5ed77efSIja33zq9PIkuDooSgnxk+Mie8IAIvB5QIOUAz\");\n        a(\"ZmXSBYKml1jgslqHiLGozuYN3dwmeTXvFfkoS7hwjRCEVCKLHp9my8CA2F7lFuo3oTHRQ/7g7DrAm6qi8EvTphMTaauIiqhVW2\");\n        a(\"dxEmtHsMX3NEHcuP0cce/E2aVFbXxG87n93Ip7T9xSCi24KM4qqJWqvBpHnBQpjf859+UtUxx+n80b995z7rnnnHvWfRRoHR+n\");\n        a(\"0/BiiimgNvdIHstWIeLM/8PCEfS6KCU1F6GpnNKOxRgGbGd9D4xauWaXyFbYPxF7K5U7WlNSawkKYFLaNuiHsQh0kO0as87Hft\");\n        a(\"7hvU31Yw4LxUVKe23T7Ocd7nHa1wIDEYZcYjkFoVlPQyR4zFMmSRI0dQqmKAObhXu4VhqhEIoNaC9tRu9xDRrkhlRlGEnuRsry\");\n        a(\"4Vm6/Lw/3eIARwBTcZqtFk6w6a/AoYHD9DqZJdBhCPnBqHwXqGrhWthnhai+y1nphiySPw+zpCy8g0uKoq5QOx2nYfCQZDysbv\");\n        a(\"r5twAOA3Y5VaB40H8wWQxFqJ1UJknUNUZBgMh47l2m7WTre6/e9wusj9n3Z60qa99fe619T6K+aEE5OMYXRki4ydv4bbjJ/1uU\");\n        a(\"omcLIihWXd3knfuOEktRav/AUSqocoHohGspXlLM8B10HzpV6FfgIZ6j9fP0/AD9eWwYXSK5stoA0iM0kUJLcavEFio19dHTZf\");\n        a(\"9owHtjz77xsu0wACxV7SCkWshv2TqI4PtkRfWCg+kYy7g/V7tR6Yaen055X9thBGCWkUqLN7k4KI9XIAIAcON30Vi0dFPLZ6hl\");\n        a(\"zR7RwyyAvisyetvgXG+Fs3ANsflRYnhRL0RtzqI2UxajwRw0SB5iGfYGDJulx15Gj/PQYwysNzSwDqERBoQ/+2FT9TxtdLwk6S\");\n        a(\"r22MAxzmoy53mjlDZjoi5/TRNNscuaXz5H+CcJiOCtMge0T3oY/gl8kyiCTi2wzEMQyUP6grCowerv/P08EgwzOmk0HlI1AMyf\");\n        a(\"A+ZD+7hFvgX5BYrsgtOKIRnaIKnFpn7KLBfr+p8sQOWET2T/IYuaizEWarP26pMimnJCr1zTtKi1VB/2KBo2lcN8hdhjfxjGGw\");\n        a(\"lYKbN5eUIrXmjl85ZB5vOj+xvmumgolYKJJfO1PNQA6aJZzj1pT9OWLLD2DQzq8gWjdH+XGl3kf897zYmcSns30PGDC/YO4b0Q\");\n        a(\"Ay/EwITxfClShzsDzF2+DBhDDk+3wfh8BWBA+H6NeBqq00lPotH/Y9tjwAVxde8V10lCa2Lez2MBoZsa/Wuag/Bczk4bdHPA35\");\n        a(\"rvQoBf1sVLvy9cRexxGpqkmCkewVCAk2zrBhydrHlUx6OGUoaKROsB6MimfhlP0+Wh393S0MUQZ30ZC7Cm0X70z2jmxtgoVm2A\");\n        a(\"nA/v7JPxANQ20KAXNb5oPi0y+ujzaBxrHqCc6FIQnUB4yCrqKCi+gARtILYqWYAxCP+3+Xc0WqxPogHvRfsccKKhb6a8r4YW+X\");\n        a(\"9u3h4e3llWeCHAA6fNUHPnhah9CO3hwaASoW2AhiQxfsfD7hHufcF4xUS1BainmxUd9QY73rvOJ8VWYVVwgB+M7+2Cr0aqeRQK\");\n        a(\"XHEtZ7x/MugP6f6YpHuyV+J779xD+gNPuzQf7nkbXbkqneYtatIIb1EQNkgph/ghpSqkVIWUqpBSx3blPH9Yt4FdDZj779MQ/j\");\n        a(\"4Ifz+EfwDCr0H4UzA4sblB3BcY5ykxC1D6YyDk1OpXLPNe24MmaP4NuGOAokuWfe/8Lq5HWZgsBL+rO3z9pZtafk+b3UXj0Auv\");\n        a(\"bHK8t73989ze/32kQN+ydgQm2MdpjSqR3SXq9nnoF6Hyfhr1+l6iFe2Lx2nJauxJTIG9QAEKwVoZhIvhPsVWt0BYBMf9olsEb4\");\n        a(\"4yubGyoIsaHQC5NZBbD+7Y7aX3UA8NLorm9XiQqBIWlwnBjyB+EGUzh7qAnbaqJ53unGTWejrtC4sJBvR7w5RU3wDz1nRabjOP\");\n        a(\"dEiv0CG1t30BdKmEGvYY+IwosgGCHyHkVjeV1VIqWSYr6HIARQvv3E+I154vyRwfsO8hgJ+pzW7oNKGX6dDLtMfetMLelGBjVA\");\n        a(\"DlOhTtDjfR1505cxoCKRs6q024e2XgTiaojnpwk93AWHnt9SKOUS7zjqq7Y9ppS2ge3ebyVxFI5EKCVs4z9O2aN2x8dMbnOt+p\");\n        a(\"G+h8ctpCrsvNbLG3F1tsafsO65QXdG8B0lEN8pKCvAyLCSBBRsbg1U3VsM+rMrPYSoFf6xJT0R58j+cAVysdLVHiR1W4knn8Y8\");\n        a(\"7qoBwxqxmELRmWlEW1yNOWYl4LxLy2unG5myUPAMTUtOsXZOb1Ec2ru0j3N4C2CrRVoK0CbdUoJc6iL85Cpp73jJNwYSqOsc9f\");\n        a(\"f+A4r2yeU74fI2BqPNotYthhKLlXhtaCa7YGcvTGeFCOB0GIqaGXafdC1JEk6sBhPkTcBwISm5WjTauP36uAs/FiJi3L707GKW\");\n        a(\"eR2Xfym3By/F9EC6ekh+aL86kwmfPIDltP7u1l9/9R8Ry+Tl+BCKfb9NTtr9nWoWSZm3XRnIIsOu3s12y8OPAZ67RvonthvQBY\");\n        a(\"zNS6e8D9kauohJMCrhU00c2grAiXXRfR1HoRe9EfnD/KD6CVx2Jdp34R0tYIKlJQdEOOodQhDkBCkcfF6h7yTBx+xGOv2ua7Ce\");\n        a(\"ZArgdp2tgsbegNwMA1uZmu6FF8pU1gE5eKjX8M4i0AxveZQBXksv+D5s0gBJO9116ZOanRJaMglo6ALB2WEQM8V/jd5SHdq0bs\");\n        a(\"H8N5EslZhOYxKUITjwmQejA53Q1aODZNw72p4RFtZR28JujdvzfonYEg/XrcWjuri2VEuxLj8PAYmrq6hnvENGIXDScLqMWJaP\");\n        a(\"EP+pLUnnrOMLXu+UkshlocjE93kT+Uy5AuHEYjgeM+Gq3aOJ4A+rgtStH4z4wHqBtRSIDPs7uYtpEi7bI0czp40zwckoW/g7He\");\n        a(\"UOyd0JQfUAbswlK35CIHnrBxmX+guRCuyzY4MNo63voGYXtEdmgn2SUY+0r7CZlneGxE2S2Rt6wLxr6jnaUS29F+OOUCmoViJ6\");\n        a(\"Fyb7oGDmniCW4PSgRj243Fk058EQZkURDgAUhwRoguWsSBLIhCBm3kzk/hh5/oD9uGbd2rekPx49Iz4mfkpJN7ZuKTC1yBq5uk\");\n        a(\"Pd3RCqvUYSqE7udQmqRUcGDzWzpzhvYLXUH/ypZeXIMyznngTKVC5xZmKJwUEbYzIl3NtWg/Ix7MSZtKyz+/eSsFUUqBB5gysG\");\n        a(\"dhNB+6rFuP7aJF20pc0zlNZ/0+pFscl5qSttJAruWjHzi+5ZEgwNhl8JIkhmt/tGNW0YKluH6Zptf6nUVJzOF6fppHFn/waVFv\");\n        a(\"LOC+oPFPH6kjFbljFFfIvW6h5lEQJ44DxCXmR8BGXgzVhKg6nq/VfsBGhxy/id7SvrbxKn6im7w75JKcCTAqgxGKekx7CNwcVL\");\n        a(\"cER0byQipK4xT/b95r6Dg2eNZ77aW4YG1GB+xZZ782Qvw3gCgg0iot48Sl0Ai9xvPm3ehUj35bpSsMDkWX1UGGMxGB9iFyy/sV\");\n        a(\"CPgLSagDMuqr/hTWj3b/n9kUhPP7H9+b2+i/zi8vUWIfBi2fNLEZ3lQWcY6Lp9+W/4aL9yoFZ4lt9q3/1xbgfz75XjRR6wCY4g\");\n        a(\"RCjaYwAP/J3hcX1YpaUqF95DK3M2GDIF+g3f2Cvp/V8n7mw3fgkjuTXn5QNO9x+Ndni/Y9Yu/YbeADtll+JxOFcCCG2CSH59K6\");\n        a(\"pRyLVEwm2Bnq5yCYGkR+S0RPdv3O6YFgvSxxlg8RfcNCUQe09nDrflpe7KF7iEvugvZCcQTjJXtYwd2wUoCjIFfvEMc7oQLpSy\");\n        a(\"ta/3e6O7YZ+HXdiW7TPyBzGvKjc0t0mHqWGsoBXEYFXtqZ0D+mX5Cd/yn8oosfRsPmQgNWYEDcZazYj4RERHwAosR4T7r8FRA/\");\n        a(\"4WRR8lI8YTWgJfMRmZnxvlviVHp3dv/xmCGTf8f+/k449rHBrE2wgScBCcQSengIFZYFUZGE8zoMl/TSVTlYj7bG2DkaU/aKbB\");\n        a(\"/Tce4XAlRjJw551CDqcAPBy+yv/h7v7MulLPZa8lmb/XLUUje1+T0cS6FMzWJfdz9rs9V2RTuqdSwmgy2SB0M16QahMb1oKWAK\");\n        a(\"e6dQn0KyWGg47QswiH3LMPIP2gp8f4i9Ve3ld0hX59QD/b/HmzOZsvbadnIJIpvEPpuyWHvhBd3woc1qH+3BNK1tso4YeymWaq\");\n        a(\"ZHmE11exvpik2FfbN0MDYhk4/IpZe4zE3maSdiBDMXUW2eZ8xQmmgc2SbRXrv6QEKjCByr1QOLZIncsV0u3U0BMMGXZibC5H8x\");\n        a(\"gB8NmeVUZUReOqRtyntGj/AY8bQBTzU6Q6xgGmgK4XtrLjVxniTOzp9vfPvP/KmLUZfBoj1uSbjrGfhCR/h74LL3ZNTB7EHSJ1\");\n        a(\"1g47yqJegQPwSBgru/whXV9ws1kfpJ1wsnZ+deJ/+aHr7Mwd52YI/UHMltQRM2txFl6fdke9WDD9eGY8MoXTb5eMunbfx543ts\");\n        a(\"h/8EFysU+4qyG5D5dPnaAfjn63IInPpFYPIt65ZVwES3qlCvcQgpkXfXCOmx5zRuecomUwUClxXYKy1B7WkriIKrkUyGfkmXnw\");\n        a(\"7MoFOd+si0p01sZunKrAbtMaAlFrDjK2zPCDWozcSuQ5iWCqUHFiKUr6ZNJ+E0r8fKd3lnNwt/D+bE7FMpv1tbMJMYvlIRdnF+\");\n        a(\"k9qAhSHjltY8SGoCMqhoW4ywDDbgKbXzqAeCl9iopG/kjsHhpYSh9jzEqIBaXjtiUf8O/MJMDhFlCYsRw7FqvbVTXv1vRfMQdN\");\n        a(\"g1oQjONrEm29FAwz8vAtMRp2cIAU16kx0KizthrofwFtm2GpR0T9FHW/2RnBnxwE0mWi2fAVpF95A7dszF7sy6aJYH7pb2Wx06\");\n        a(\"+bsvKMVjXUXR1GtZ6XV4codOQ38ar5jH6xYOnFUiA45HZKT5h1vzsNLJ8r+/Q8Es4DIPfKZd+RytDQHcnoefpGPhRu0v413BeJ\");\n        a(\"fRMEtXxi4aSQivbxRGnZ1zeDW0K+eN9b2LdnhpHq6/6mYzvmO1O0LZwN/ecku8xRa/bdtizf3g/Wft+8EvU9e5HxiqfqJQ9QfV\");\n        a(\"Gqp+mu7KzvI5UtQiK33xW/asdI41K830GGM/+E/56cG5Zn56w9r/l59+c66DzOvWnw1fGfpTOAekPOtM5WnEMFY+atOdsxZn1Z\");\n        a(\"2HL8+iO7Pryw1cY+jLO//Ipi9PftSmL/sXZdOX4z+36csPlmXRlw79ZZqTIPo06BKhs4SHa+qbi7B1ZNtOs41n1WM+7O0OLWgO\");\n        a(\"uqVt0LHHGy8KCYq5kOAL1s009py1jl3emW+328BEJJ+u9m+jKF2O0P3RUl0vz6aHP4gaJxtPKLG1aAeSIPAJfR89QPavotTzfv\");\n        a(\"Gy7QmR7XJE3nkTeHf0wRh3KeyQUIxmqtU/hUGp8sp4F0ICF29IcW1BL9kBramJ7pEZbrkrS2sYS789yQ4Awif6NjWIB8l6wU69\");\n        a(\"MBszA9yOAWwNX0HDbPDvw3NBPjMz7LSPdgQ7/uf8T8iS/oGPDKGyJn1aAxQZeuFXIVF2Pm97yCZnqYVuiXw9dEC+hZyrdPmJ/W\");\n        a(\"6RjzG1twgQuuiLBHly/FhXAnLBc/yFA7yvPAHKoUpQrvqMaBAvOYb8nzlP67ZXcXpdORvH/riTvj8KCbEGVhxb4zdznVujPf7X\");\n        a(\"l9EGqzgO8Qfrwxp9i5T/pM7uIVLrhq9wEK5ssdH398BbqmA5ePxERD7P2wC1bZO9V96CTiAKnngvV43vLuRNtcVD3Ymhs/X9c9\");\n        a(\"lqIyTqtjryrQHrA7F7plrzENNKlto8URRTgRDgUeygILsIlDY9DvISO46sNiKlbnnpt7J7l3CvR0xLxErRph9txLbxD/YmIjns\");\n        a(\"FUwLJzJ0iexuCaN6eS69iKHqYkPi/spjIpJKkM7iBjVKbASMaVeN2et1UkGQpgDhRIrv51ZQi6GhPDA23dFah6YsC035Q+nt1Z\");\n        a(\"1j7+yX89BmhCsOGmmiR1UUTL+6YuPGzsH2wfZoTaB9BCWEdDxyeXhabJNzFRSq0o0S+zJZnvUxfUVm6DEM2Ng5QN9aKac8More\");\n        a(\"lg5eNjgKqJ39FBzs7Kbhtf3im4AwScQG374gX3wsJqHEL0qjvtp1Xh0+VqXnsxUsG9piKSMVBVdvMqmh84uG9m/bcfSiPZofvm\");\n        a(\"ywQYoUhGJ9nDsP+j+5cAl+A6/T1hLkPJTLe7kLKBGoyC78109/vbPbMLi4ynPpV5d/Iq5yvFcuxNXQIpeEseqJlq/jMsE4hKep\");\n        a(\"m0wCYDp+uqxr0COfsEyJfZ55ddQkF97VSzJeBguTeKN0rG3zXtViDAX8Mt+hsI3nFeOVZB3PhIVBba9znOCQRM6XpAu2xMUoqH\");\n        a(\"D+RFxI/YB3+WpAp9df4uaq76UMQuHEEJ78DZ98AXP8OvApyYbPutF1/x1dSXLhQ6mEWNonXVAgkErur1z2A72R40ekg/5fL9gh\");\n        a(\"GEvKXcki+bJumo3Be/T4skE6X09vlksSBk2OD7m6wYGUy83MEaJxgTcU+yk8PbY9d8R80Sro/+WCwpD/U+9Va8isQB5bjpVVDD\");\n        a(\"2Zgz66XBzMcjGxsXNF+4r26DYsF+N0tv9QwQm8YssNy8Cxpgys732xb+mKy1Yw//cx/8+nYTRsg24qvkdBsYX/ZfD/6jH4/2Di\");\n        a(\"/4mdn6F7+5/t0aJw7LPwZSvs/L/Uxv+oWf8TXN2FwQEK/M9//fhr8D9d5Yn3aHmLuAL/X0H832nyf4vg/4N5GUsm4mAT8f/irq\");\n        a(\"+wyIuV2LuZV8GJLrzjFV4cLBzCG8H/tTb+30nwv208rxivJOt4JiwManud4wQ3Nv+/bOX/x638f7f0d3zyBczx68CnJBs+60bX\");\n        a(\"7UB3TP73ElMlC238mw/+pcfgW2bZ49BF4TwcYtsq/qfv+GQtoHPaS+v9+i/jSYaBJAw4z+/pNEcQovRMRATE9srD9iIHYi9CQT\");\n        a(\"JUYdNfZJCElY3kUDyvGIFHsnsygag1fW7ky7Hv0Z6+ETqmeciISKtwfLrzN90W2skZh7LUP7fX9tXRpjb7QbZK8j5AgQ3hM04d\");\n        a(\"1w8HMd0HXzQJgOXv4w547HJ2joTAY/NJ3PoBs/WjeuuuJKE3B3faVSdyo3az0RW2IdvEkJPFkFViyAPN1ofZhjyAhtwVQ2pP3W\");\n        a(\"+4yN9JuF9SZXORTf98g7TTcbS//2N07Pd5n3JMMm/Fu266e0zcnfEe3639ie/eE++8Kb5bJO7WF3f7oqU5KhmXebIaGO7WDx7Y\");\n        a(\"ATr5qSUFnhoWPCWi2udlZM4txy9C5qoeuRTtwfvssYKeSuJ9etlaR0Zg+GF2vndGwRFO34Dz47vmwO8qkyIbyuo+BfyRRnU6wh\");\n        a(\"0+8kWmbiZMx3N2MAK4gmuAjRrVy0Mc+PYB32Ga3M6AGz88BWQJsXEOxHaoJBmll62FZLD98BARXkVXsx7Dnqsmu+8W0El37paP\");\n        a(\"sl9oD8KMXb96K0h4D0j4MFyYp+HCoHY1Oi/In7kIDXChdhOyayENB1KoVLFlgnbkvQbGiwnjS7dhesPDAOXghbiQ8szhs3Qqvj\");\n        a(\"uuTpU7LgEZC3FXFlQrk25KrHN1pQ9HNFAfGz/e11T9R6YWMnosvaQr6AJQlnKGXAIzZzuu9UvpBVvfgLPpFF0l9sf8juFxEfzx\");\n        a(\"4ZSN+O5NXPbRMEFVCoIkhVRCH3jRNZSA/GaGF3W3RLFHqfK6kGBlaiE7NLgh4hsbpHXQHLvZ15gsBsngU6bjQ4VcPqLDQcCIW6\");\n        a(\"szCxhIja9lffGgoUBkSHuS+WLq1fAiMPsmKskRCM8khAG8gCqRCu4h/dtYkYJL1zqJGqC/D57bBKqJQsaVC55W3EexACJCjRw/\");\n        a(\"Jg3XsnlnubeHZIbWA/ocepRpbBkhB3l7bREKWpHjbFuGdhkqzIGZwvajgTJUrD4P7+xDXWQxjPia8VH7lj6pddOg/6S+1g21GX\");\n        a(\"fbmeGsrUiuDKJdMSn7gK0zCO2pVj4QfQSOJhnFGlbND8anuQjzNzbG+IInqL51W1gQTwGulcxYRIDI8cZvxotMSw9a8qagBhgP\");\n        a(\"ATIeMMAF0VtHB+Bgq4gmROdL7hWspjhYzU97BzE52I1ahzDgNB/OxDjQV6r6qIqBOLFtoq6bBHOBnRKgZ7+r9XDCWrCeS4QJmq\");\n        a(\"cba0n2mlhPFM0C0MfW9WQgcZmA9UNNpQnMBKwl1pfqfTk0s5PRgRg8lsO3dJpbsLANdqCA1g96QYVeUKEXVOgFFXpBhV5ANe86\");\n        a(\"ziMv0urvZHbwvjhu66k5ErhCO3pLY8dxxC/hP0+g7QsWaBH6aM/xJ4ciuUgU5lQbn2G160/xRUbqWgE9TL1auFe0XFtwh8GJy4\");\n        a(\"gTv96C66MM1Zk9P1eOYdh/ltKQQKHKwwkjZOGItwJiFzcFjXQE/x6vK6KQpOpBowSDWM8KIpywxuwc+xlWIgaOgm0dLaclohI9\");\n        a(\"QEwfeAoxC8t0S0qKzAJsHCIg3qBfrKL+oh4/wxKJFUZCfwKZ6JSoykW8KaWVtr6deVxCUy+g/Mh6WCZ66gygO+f3R+t6bDW504\");\n        a(\"mEUf/nxXPMWzyfeU7CmKCDfl7MhvMxOuxsFkXyAP37uOrhM5uQlorvjU8FYu4dF02GzkaIJaTKPsW1FPEn+CckP/MqAxBXOlCO\");\n        a(\"U3IX+7DXBNWAL6RKtNdgL+vifA5ezZSij3Tb49FqqQgPTd8qkwwQWXByLCfjLeSf9tcLma8nIWI/U4qM0yOmB2IBxPz3l9X9Gg\");\n        a(\"jKdO3d8aJgD4ztV90nI/CAU7o7BV6j1dLPPyxwoeQWH++GIdvoLoEMe/T79MHu3Eb/yrblVDfFMSNrhMbJv9r8XK5n0L6rMPPH\");\n        a(\"2eO/Qyea/95HUD2/MoTlqg+oHtT3n5J+M83zwEmD2DBhoahBTy7N77xeUdo1TjxHMNhTktwq4F974QfMi5f6eFvf24fVpC8nC7\");\n        a(\"0VvQvnKhFcskdW/zE+PXQqo9hg4LdPBj9Bu4SFbkpNs6ckOgl3Aq9G4Kt/ZFWLz0H4sRL4oergwrfXhefNqDt3IpnlvBoXaMEB\");\n        a(\"D7TD+7ryerTgAF9Q3WKomXyVkIpPndH2cIQSjxYhWtskQY/GuqHB5Tct+hv0hWpGEL9I26hHEBYIecRg8V19yVrSDWQJFFFE0f\");\n        a(\"tiQxEZof41OI+tgDMxiSIFPJGZhSgz9F7RzDG4P4KxVPZzTiiakNotIoYdcCrdZvvesdowQVBxn/sNc1+8V5UJ2vELGW3vjbZv\");\n        a(\"ZJPKq0pukNBFD8MbdBaSl0ex46/wBx27q81KvezxxnlMbzl2cEWlmsOfSdXJvfNQm/BX1dbJIeQj1lPibQUBNZ/aTE3mAxxdoO\");\n        a(\"3UkxHZAfXr3mC+oW3zhB5iFLyrrinLj26u3wfVM/JhoEJuCEQlguzBmJbuS/oT2DoXKR2tNB9FnW5SvAeM6b3iEgzLPVhE9S0h\");\n        a(\"0Z6p4miwroB9fjC757F5Lj4TLMdurKjEr70E8e17afgbuQVN+x7hz2Des2jeGwbgtETW55nPrqhGIyJEsggE0O9V8YMvGRAZ9m\");\n        a(\"cyhC10wAmjfKH1noYFCT6stBNkjkBOFcgZZGkIE11eGpsuRwBOppcMJGiUDHX+ou1a4KKssvgMMDoIOOODQtMaFQ1MDCoNQmpG\");\n        a(\"wQaFwtXssWvauo6WbRrMoG2K4mAxflJTmWuvrX202267ZZkJPQVKqLby0cOsLSWrD2czMsO3s/9z7jffnRlG2Mdv/RVzz73nnv\");\n        a(\"s6332ce+45G6h32CwcIsM7KFIf+OJAjlOpsjtJbwPn3Y6+ROE46zulEAFRtlOWjT01nfvflscdxZgf5xmHrV0C9owJisGBY9Yo\");\n        a(\"gGZUhez/o7OVRAdeSvXDypGAGOAgR/xGIzGnvJ+Q56sWiH3E08QMFlHsZK6HYR7a8SqTbZjqx5LPjFL8sdTUIJKgC+jPDRzl06\");\n        a(\"LS2n8txpIbYMRX17t9NXeMgNEmiipnPuc4LE/G7RwNTqOeUEqgPYrvIVDmVGYiPT4sXU8EkUA25e+abRDT7YJOdQJbwWJN9DVE\");\n        a(\"bP1ovnZJ2TEWTjbWnuaTM7r3PMcLxsAMTQlpJPP1m8U+TVGY7RM4at8Aal+HUmSDyZFyHPPPC7xfVLPffS6i0I+0s47HztriVP\");\n        a(\"Bfb7HVQt0g8+yqktNd/ZBHq8es6HoM6a4eFxV7lxuYu4sMIQ4jGymR1UsOr153dZPyk5lnkq/EXq9XRqzXZcVKrxKshHjPsmyG\");\n        a(\"tqYYxHq9cGtGad0vesEKxYR0rjeEdbLe50VEmxH9FvXJJydpyDw5fqzlK7Z0s0a6k3jHY1m9BGXGXtZj17/mjPW/Lnb9aYVL01\");\n        a(\"a4tLAWDItMkG34ETsypIs2bPp32lBxxjZEjlfejgiHTFgaI9+bSe1yPosoZlYWV1+APimHNIXVX+BZja4zjjKi/L/wELgTIMk3\");\n        a(\"1cfZDSt15uB0clKiXrRe8kys/ThrjXz7IOzZbMMkfh7AZPU0QDLd0i+k+cQ78jnoH19HLA2Gnvf3LZPMhNYyKZl+hLRWhZS3h3\");\n        a(\"1/1/0FzqjqF+tkk6LSvUvNGGYhBFuQKl31iP6afJhKxA0zqeZwvSLSIQ0thNBTczT055fjQ46G/ogg2EGWqeMPlPh3SPxKxgcz\");\n        a(\"FezKJCW2kYSC3YfTVqjYh4hDvTmYugWJDZ/wfnMAqgr0wgyge5JF5O6BOMfAcljKFYhVbxkgWyP7WzHd/5ZegyMv6TU4jKBTSU\");\n        a(\"P3ghrrro1G/sC13jvTDB4Tlkiwdidyz5C5G2TuFzn3dMzwVrA9VJuScTSxqS1w2q3Zn5gwiGSWpvvOjxPdH8kXsn8Ot+r0r5f0\");\n        a(\"ZxL9FkYEznaJM1LiDJc4stkx5Ml0h//599EMwekkVEujtp++N2Y6OzwqmJPBirV0RE69BuHI82RXfHsY/rh/A98Whp/aLb6j/m\");\n        a(\"QQ/1Jfb4g3xOLvYOrm6JSo9Loe0mf1kL68h/R5XdJjv3feJe9vusqv6e5GXtwQ/jN7dOX0YKqxQXsG/JS4RpGqvDH615LR+IPl\");\n        a(\"hlbu3CfqZeW0dHoNQ4n4AcIKiRBqb33s9sTOf2WX/Ju39DAePaQv7yF9dQ/pv+whfSTSD1lukEetqHRTD/l/fLH79He7pEfLFz\");\n        a(\"CeI+Ngoz9eShei0velc7pRpjP9abgHcBjFxrQ5Ap5rN5P8RZ6ra8m7Cs7hfJJaY5iQaFmVjDlvTJ9K2xijOwP/Z+P/GfjfOibO\");\n        a(\"nTvG5DaPibesVlEOW8pr/5rXgtfTKLxH2zeDrlpJHAipwrawuHIt7nmO42MlBLaoHHnnGQjZ8WUG9yDIQYWp8hedxpC+UByScX\");\n        a(\"iaaEZuvs2wPNhr5eWQFC0g/VXSBJlNAaiA9Kc/Q+lPBv25OFDsp3sPyMIpT4D1sRleauaI0aiHgK0MD9bhNIb7ABavaukRU5e9\");\n        a(\"eWz/YM66KWjURDRqAizDzR/i9LbYHN6TxmXpMLDpJ/sLdKVFtwm8ibViCQhuB5IV1gJWRG1mo8bTntwcud+LKtHYCNEbaQu5C0\");\n        a(\"nX9SEYw0OfkUwAVz/0tBAii2WZxUKwrb0v5HuKo/BTs42qhF0616c07/CK/XKjFlt/cwaYJo6Y5mUDM835Y3Da+hPCYBiE3Vfg\");\n        a(\"/wFgnEvBOEnEOA+I85cm6OVtagn8oWgHehufDwC0L5R6K+CRyWgc9DcgpIEWN/NIL41HyiSPkLAGtGaF05qDVY6uDfkMQUzgTk\");\n        a(\"U0xQStPLbAST4WqQYq9ZVl8/ibSHRfguaUURMPA0/7Lm4luBUwmjlnjEkLx+Os+bFoA+uXvYA2tUh4wS7AWyTsfBfwnwSMNtwR\");\n        a(\"3obk00hTRNp//M2Al4WIn3d3yaBHUSw/Rzn9wsu5BLdwgVGiT65TER7MYU5Xe7chIlHo0x0J6cp1ww+9RYddzDyADvpOdNh0/L\");\n        a(\"+Q4F2iw2ZTh70sOuz89p3avJCkHt2ENjeH9dffAW8SMKUv3Qn497H76zO6R7v7v+afrHBatpOSfy7lScKdrTEQ3yUEhov6bthH\");\n        a(\"jghFuOQbhDXeMhyRvBXjPC9lHCGPVOKxxPVQvxTixRW9V7KC/FjtKTTe47a8KeRJ/M7Xp+K7fYOnEpzJbqKnozDTsj/KqJ3812\");\n        a(\"P5cVT+J8f+u/Ib//fy47n9/2X5t5/6N8r3pTy8Md6QQ07boNhxD8LOua2FSuGak+RhpP3cwpzGm9+a5+t9KzmKMLbiBZUvYU3B\");\n        a(\"InTMsr+3mN6Gl7DFCEui9aHzNJlC3Q6pTD5IKiX3JfiawE5jARQpCX7f2942uHXaU932xUbzQ3D3RgsWuasKrnAkwqWJWpjThH\");\n        a(\"ogx8lnoXN88braS3qhro2ICFCEb2BtQZsBddhQTz/h5b2DdL281wD8Z+Wt1cpzY/C4vDtD5d0WR+UpqbdQASk2bC592717yTnV\");\n        a(\"SCJavY9pthHNxB072nNaLzYt2gwk04/Y7bWYHj9PnHBi7m+UoTVI9pqW469RMS3ZEG/IN+UMjTN4zNUnbkfG8hFKyk2IVUsw/x\");\n        a(\"1JnYmgYirbQOT7AO1lGgR/9Qn80PuIJUDK+bTFdAGRE/0DB2p1pmefQbaBG3zbG9WknO2+psa23tVtK2eOeSynybejcZ+F2rDt\");\n        a(\"u5wdvtZGtX9Oq9xHxTqfs7093zb1MvpphDMcm7NeN8E5rNGZ+D2dyVPo7PKQ88gJCPRJWAIwYgrAusyPUXqXKMZiBfoVEk4sVU\");\n        a(\"hMCraOA2pM/RXF9NlL+pnv9j/rZ77bEHRV5+K4dJ5li9W3i1/FqNkrQneymIymm7hfIi9kpT6LenEtkJWhP3sa9JV8Vte9IKfT\");\n        a(\"L/QYOlhw7Z0Qz+cxhoLQc/RVmPEaYQnrMXgLDIPYcXYw9WhanLSZE2v/u810GCjGbaZ/0I+6VErnNP5ARXb9BQ+QMlH+QjMqsJ\");\n        a(\"vP/o1tqMQyKwRSVhmFeztrmp9f8yzZETWE8jz9hwa93449pPdbJ4LVS83PY7H2jARWVYOu07ULSVKn611A6uIJfOy+XpI6d71O\");\n        a(\"6pz1ktQoYF0sSR19MJzUIUDqSJDyAytF0lr1hE5rxRORtL6p12n9DEmS1kxA6if5glZjvU5r2+91Ws0IhtN6RNJ6AkmS1sOA1D\");\n        a(\"rQijhnT2dzDrvxgQUKcD/I7ZflHPyjXk4AQWY7jN2fzoojIcej+KF/GCva4RbcS7Dn1ZUF488mThlO7Ze16a/VpjmQ6awbmgwo\");\n        a(\"YANGYIte2pzH9dJmIQhUEJ1CRC01r3A5n2MCO3BlHEKHoKi3Es+46AFsLlBETJWdd5wf6yizCqjCqb2AIe5k1q7VHURSekGBMN\");\n        a(\"U1bwKTB+qnqRpqMHU7coXh9tNw84DLr2xNzwIXWRaAy9Xfx3HR6yYjip9Etwk0tQ9+8fZkOlYv9TRmYbSpE32JNi2mCw7THgDa\");\n        a(\"ZdIUvkwK2RkH5feQhtsjYUkvAxGvigg25jctldv2Fy2qJaHJIOZG3CPhrWHKfUhQxwAJQ1WNMP3De/PB2lVRBhnbOIM8/Wuq7L\");\n        a(\"RpwIx5PvalPHg/aG+X33Us+e07oscHK+hxCqEz0EGT0EHiJq76ri4iXDlfhbYO6K3rUomb+rLZgEMkCHEiwuUb6hhIXT1uNP8U\");\n        a(\"fElDrJge3ayz0/eSeYmP+YBgBRUxmhfP4L6CFPHYAAwfPbboMqfp5wVt91si3G0hRE3LUC1spZDiFMRhrC8Pyt1zjPkdi8yyO+\");\n        a(\"Sczf5g5YQdiQ/funOoYlM5A3uuO6p5hzuqrudXLxRpugBIQuHJtBf9gvZkUrYZpyPtBse2p8IedDqghKj6QX93S9F+g67uZVat\");\n        a(\"Y6H8XvRB+1KOY3d1u1EFlRX0BlAVvMtV8LFIp/i6D0A2mPrrAfThrAbA0iv09od5hIKan8wNqdMU+b1F+42ob3H/OINyzX7n3C\");\n        a(\"YnvPv2Wrn8A4Mno/o4rfQrbFxuftHuyrPUYVhHEOyoTGq/DaWo/cjmSXQbEYrtbwSMdB6qhTuMYOrZA4TP+u+W6EpNu4gjLdGd\");\n        a(\"Fq0PiqedK3HheQ3N/5v0mS33N+HKxBcBAp/PncTKxJ+hvcA2Sew+SJezcgIgteVSejkBtM+f19G+fCyc6D8AQXURBBVB8AWJ2Y\");\n        a(\"A0SXATILXyUka6VyKtiyB3DyCaJydyHXMFyZsktisCew4X3gHMvgLzUok5IQJzvKB7t6C7V9QiUWL3jcA2E/bcFmDOvIwxv3hO\");\n        a(\"x9z/aDjm54BA9wpBt1bQfU5iv4h02QUbAakPjGektRLpvgiSiiC5384kxwmSN0rsuREkZxFJO0g2fEmM0hn9DrurfE8dvohl8D\");\n        a(\"RqO9WRAOTeJSb+odvC8E094mP/GUwdz3NffAhTyh+zkNCt/LOH9K8GdJ/+YQ/pr/aQvryH9HlnSr82tF9/34n191l9sl/3N32y\");\n        a(\"vw9BZ93GreL6xamQ7q89je3WzbQ1mBD9g/NJbdM+m8jH7l+cRyT5cZL8RUTeJKhDF3sKqP8E1OEU02lTytJ805OVMptvulWxW3\");\n        a(\"3xLZMSiKp+yzdQ/KSJnyHixyZ+0uknetCh92ODt4FbRZIjlwSK1W17YYmVDhjevXuLja3QgC1RijPYhWc77DYmv+XyC5FQv2IY\");\n        a(\"AVWmmfGGw1rqm2LleKseb0W8GfHmAI4nTtgYS4QYsjhva0VjbPvrtPtZGKR5v4qIhPeub2JaIAmSE4S8wrdtVZqOkgYUK1C4/C\");\n        a(\"qbYVmi9+l1QDICJm1O6Iq0wdbVA9sRpx4ItzkRXj401/hV5l6jO8V7l5/yO70jTgcmKAzkm/amxBkqrAIH1npNhr5xhsoU7Mao\");\n        a(\"3hfTw9l+LBuaZIayoUZBltTlPrUVfcVtIJv8E9MwzFBUK7NxH9r0eBsNP+LTAhY+sHBnrHqKWmLvuj8Cz0zLoDENeoaL8fRRHi\");\n        a(\"dEV/sSPBbQFuG9sDgY+DLiPQLuwp97QrM8MsyvtepvYjRwd4l2HQkkIX9lWqDN5c8ha1QxpigSFkPLkzin1NdIznW8xzLKF5TU\");\n        a(\"DQRPNBd7v0zwmK+qGwILrUl+LaI08Z1S3w3I1b9EYxf07znsWhe0SEHbRM0tbpnIjMxK9lPSeLuVCKDEN81GOuVggO3NsC7X3f\");\n        a(\"04lGfE+IqL6tc7WfaiRaNPSPlgJsJtCaRxOtWaAHOTxg66kWUOQhnMdv0l29nAdjbQIL7T+dGms6wF9MygHxozyQ4R80H2p+g3\");\n        a(\"qkOC51wttJcFtMpECsd5zMxfm4z+WvkgO1q+8Bzv9iZRBrNnBNiUDhyZ21C6oGHVxrSdt2Y/SDuKVJ/Y+nzMF6VQECOr//D4dj\");\n        a(\"k53RBzhdKbexJy8fNPwwSEGeI23G/7Lg+UFcOTrDlQ7GIcmkHg4ykvsCSnNO9g+ZhS34WEmch3GL5eAQ4U0yNl7zP8wdDDnPlk\");\n        a(\"XD4F/HGSKJOZA7/ObVEKkrH1UXGmAifgAVEuGxdy4HRnhTmS4pY3xJvnbxWv+KRT+sQZys/m4wMsDmjKakfRQai0n9wMrT4iHk\");\n        a(\"n9gnf49RsB4d0PQvUcSvHWEyGolr7PeClj/oSF/E/9OJyNPOojZg6nU/i8RBy8Cp5CkHVROSEJUFj56p2icDZ0t4h9l8zKgFoT\");\n        a(\"zYeQV0bOh9BzQsi0ACSAkiZQouZDxfsEUwGm92UKGtxJWmSJb4EVLlKsBg4/TVF+1Ohmqmo6msDtv8IoX97nOk3sdwza1ro5rk\");\n        a(\"43nIwqpCCozjkiq07aniiG4hmx/TbdaUi+aYs5zrAEHJryDAJqpp7NXYJV8WHEcRZ/oCCUYT1lGI4MdZThaKee4RxkuCOUIZAi\");\n        a(\"bgp3i3RU3zNGxGzTc3gGryzY8msMgLs3bOA+hsY1vEN1f+EQMNDVof7oqd+ov3gAvbxSs8jfiLHRluz8PpXgbIIxBtwKUDKw/i\");\n        a(\"EtQijFZmDyncWNX5sYoSSzA4ZJKzUdmnTUx1Gfi+DUugkZ4H7ha0XqZUGFz/u2kdTj6cFp4tsoqZSmqhlE6RBMa5b3u6ouObvE\");\n        a(\"58Tn5UB9WwOwP5D8A0WUku0viqU5YMIPXi8vltUv008tczNbmKx+GcOHfwm86omxNOKH9Yo4j4HDgeupPUH8K65bnou6iu7wHs\");\n        a(\"ilWRPVxM0RPc/QFqjrzDQRVTfRfIhWcUfwIxJnGl9ImRlw2FC3OBCTt4g93wdgrGmeajxoAl98/6S+2f5Ikw210A6rYDugEiX9\");\n        a(\"CFn2GMnKdfCqV+r7qjjzTXxGeKdwdbG31GD0PssTEtp3BU1K/cUDl/6Co2qEMdr25awjJ2Q4hHXrCb58QLlsBfum0rpb01vh9s\");\n        a(\"JmSTOQxWtzMZDRAQlHnHWikxIsaXGsGxUaYTT47nCmShNMlebMn2KuBA9SBOtVwuGRjWSbPd6XhOZGLNrVJ+jbrUxbWfDcOpqG\");\n        a(\"Vp+DT0Cw3HNszk0xNfxB77ff/E702zbqt3EbANECsgF7TiwETuUuGkL2IxUYH3rnlH+ddclw6lmqqbU4f0a6taI/eoQS3IP8DX\");\n        a(\"2EDIkmMTgg4xfBq99a0kqLwjk4mwh7+6OOh3pR85+JN/BQJNS0CS1QAgxffimaFl8RLRff/oiI2jOB88h8y0yacrwl6Vbc263n\");\n        a(\"vjZOTGMrIE50s9NcSSsvETFLBhSdK+3f0wNl02tG/lBOQ0JnWDIYd4XnO0fS5hldRj114ynmkgAu8U+3ViQh/VJe2jkV98ucGr\");\n        a(\"4MR+1X6lI+IwnttUnEDTMzWGh9P61BxAEiZhWDOJcT4m1AlLQizhtA8RNKElA04Tdo1QtaaQSCFoFAnE+Iw5O6nhai9ovx9OHo\");\n        a(\"u4wMkvtXf8PNz2uFwRfvbcSeR4FkYrcYLZPE1OqbbhbmV7Drc/qGNDozG3YjnrdQK87nn+VJgieHwiE62zGbcRhMlqTZ/v4YHd\");\n        a(\"d1+xnbvp9Shd3PN9iu32h29yVKB3iBPRn4KZ8NvDdZT/GrQpOYjhzadISKTdP3mACm2GiuNKtrO/kUrW3SkmGzJtnTWx2F2iE9\");\n        a(\"82VqR0zrLLHrV1dB5s8xNZC+oBnfVOAa/jZM436rf4ODHw+fuwYCwvxA5VA2pRdqQfqiddNVmn5OcePeYCvpBJcK+Mz1kfwWGC\");\n        a(\"bk85uIoTCc4AcvB0Wfx4MSVkKxAfpEZzKZX08027M7A6PQDnDSUBI/bTALSbUfEwXiEinuDcTZXzTaa6X+4pnqw0wpTn71sj4D\");\n        a(\"RH3qo+oj+V1Lw1kGZT5IUiurVo8Noh7VFDfBHEs/CuzJ9pIS/erU07EtIcnzDoawCQsdzKHytw0bR81iEkDQHPv8r24WVv9oiA\");\n        a(\"dRlTZTlXRruS0uPpd0KbPLfheWIoqy9wt196Wox1Hek1+KgFaD6uM0M1nuTjMCqJtyPh/98hotd5OKBRT+24OkSHOc52TCtiK6\");\n        a(\"Igk0278Wcfzt1GEurLsOluu/ROYTSwbAXBUCuyv6EIVXNb0LU/VvdHGG61FdnAE5F82GVMeSusVqcX6l2bLax3lgmqwEH+SxQ6\");\n        a(\"xMnVKsHcPA6qCX90UF7nHuEnKQ4yWZB6JXQmdoJcQ+EbWq6Ie5ncj9ik358xsCkb0k8zuncWlE3kQ9L1pQWBtDpTy2fJb44lxp\");\n        a(\"fZcUNi6AOCGkkLRCmsFCRXawsaZ4fhqnvTm8nF9beG6gjE2nuJ5wcWuLQ6cPDBmKdNqced9XmEEhEE8zVN77TsuVx1QvU9tGHW\");\n        a(\"wRjyNw1aA+dhPmR4Dsj4vfpiqRlvUFv7mqCxofpjpWjQDj1yKoxpswBNWmvyBspC+1giLHmrSx3PyoPv88jAS+V6PhHLoOkOb/\");\n        a(\"RKUJeggMJwL/w5NGRHs3REqYZPktJgeXD9QbJOkrIkjnRZFunMukfyVJ03qIO3wd43FgyOKkfAXN3fkQFbeiDCW3IMhN9COgvh\");\n        a(\"PPtfjgESnffihCvg0IPjzULw/yVVpF0Chk+gsR0O0RNnfhD1i67HccjpEL3gFvjDAaEPo7QoMQov6cJ4ub8lB4owsBobojuLpV\");\n        a(\"Q1GBA6S2MC9eTFWzsBGi36/w6yft8YzQPkupModm/xRtStwIa+sB3HCPOu30naZ3VXs0xmzBaZf/UVH1GyjOck8V91aqgsMQZf\");\n        a(\"7hW52/Lib9+g0UPTkNXWBGkN9Bm4KMu9iKfhBHIUCmA4iEb5zqrNnAM1IJM0UJ65rRmiHUmo/B4OSXGnAywfMBg4Zk1Jjybfh8\");\n        a(\"VwtO8Sj8zccntmDqkwj41bN3IOlQFg9k0sP6rPNErT7rPFYrbpO5abl2+m2m+4+HdOQHJLK/lpqVpmbfiMIY70WJt1DiLSC8C9\");\n        a(\"KQvl6m58v0XEEH7wvQSKZzm8QbUanj2RD0pXWZ2iX/osXNoMV89zICdJf0gOiJT09q/LgLAYr/6Rf8lSTIkho88j0BguLYhaxL\");\n        a(\"USvWr1i8IVJfG65V8d+OFpxiRBXo2SZdRb6ENZpuL3qHPuvcZv3+EF5ES5RrclnUQs89g6m3gxHk7VakvN3z6x70qXtIn9dD+q\");\n        a(\"we0ot6SM/qIT21h/RT62OmR9gT3mTEIExar41rPgK1zX58FunY1o0E1DBCXB0AK5WxkoKpKYyFca7dLb+WGOU/ub4Hffge0j09\");\n        a(\"pM/qIb2oh/SsHtJTe0g/9WD36V/1kP7ugz3py7P/dV7Slel4InQJMsDHbjIv5wdi2IdWht5xF7TD8qHotGxwTif0KUj0W9gMka\");\n        a(\"WZ7dPnHVlxoIsdbpkfJY4Vdo4UM+q3jndJgCBmM5MNyLmTzNoevuH6YFCvyvsRBCPq0776jPW568z1kfMtP4EpWUfyS96NDt1I\");\n        a(\"4aePyjVWvKdTUrYgwWc2pj6L39j2xdXDZcEgT4FTjxoN1blE25PU0AYM9Y4vhJwhBymo20tloYXHM15J/RlINtgJreknenwfkd\");\n        a(\"EuprpjRygfbacWAQV9iCn+wbKY1nil/tYbR/RqDFHPJtJK6kbE+eKwKF3L9qdPS38RXfW/avT8bitAD9dB/Xwa8vD6DrjFQMmS\");\n        a(\"QJS+ibrvatL/A3KuyNwIGCNNDRymvnGa2zZUJP1RJDWQ/EltpxHAfvI5RJJaYkK+HES9fvs79fqNof1YJ9O5EVlYtkSPtaqnaf\");\n        a(\"IdToOUJXtaLP0awFuFdyftnTEYkRYDBKwUyKb17359tZm6SF9tnAiSaaYkEpFlqznMORic2jZNKZriM9Q/z9SKtaP+PfuDkU6d\");\n        a(\"3i1U5mHR8eSqo9BbLaZXOozc5Q1p7E+CSvHlsp+bReLbudbaUnRSjGLRSW5EoQ8dh2v5VGSDsWmq3WXMf804gCexPdl9zFNK0U\");\n        a(\"mHr5dvdw/uTri/eHQnobWk344e72J/BkvoQJRyxvdnw95SE3pIP3x1t+niEesXV/PxordaWRoM0htamSOa3iVXdUMPp5x42GQB\");\n        a(\"2mOy2Mj867qvj1rTXbo6uTQqtau/QU13qKVot8GqqwftheYQlIlaiv4prDPXle6GPuYPRoOjvhciwNOPlqDlvdRrWqTuzhnkoW\");\n        a(\"zrufo0Twkp6v6rmAtw8g2kOnwd2TsbDAlgqn+IaJwSxd1QMPXpe+MN9Na8DyD4d4v2MRPln+O3PdpTjDKniPuUXHXJVcKWPOuj\");\n        a(\"8X0dvVHNRskG92BEMu2f/05oPwHjfNbqE4/37uxiA7Gb94JVq/6r+n1cyvU7B1XBWYwpzfitXps8rb4r76H69hGNqEFkT/WT/P\");\n        a(\"FibP6Q7697SF//P6a7Snt47x/mM7SwlvzNNbARuap/8D1ThNVw8pEKH04BC6LIwuXIzCpytL3Pbg46YLEByvUkg3Ec2W03d1oe\");\n        a(\"bKpuI/DIHmKvFSUsFaJLPZ816mVXV32SJHX2FHFaPPsf4ZNQ7PexWB2yS2QrY6XbZHr0+q49nk+CCa9fTeWn/MOz6FzqHpC1in\");\n        a(\"7SskgS6R4UOB98+VocG7Hy53QGbCwwhx2L1/ipxntOTJqwEJUoYODGfM+M7gOf5ezEPHrrVFmnsPEq7n48Z07tPn1U9+kvsfOV\");\n        a(\"+6ZIpKj8lV2SosYH7xmUeIJZr1kE2b4mu7EyrUcMoGePMeQX0D4BrRHQDwKqEZDpOENVAvq1SFspoEEi7RYBXSCgWwVUICCXgK\");\n        a(\"4W0BwB3SSgGwQ0/QRDMwT0lYCuEtC1JxlyCuhmAU0U0J0CmiCgOgGNF9DjAsoW0HM/MjRaQLs6GUoX0GaRdq6Azj7CUJqA7hBU\");\n        a(\"+gvohICSBTT0FEO9BHShgAwCcgjo+BqGfi+gwwLaLKCDAmoRkCqgTwTUJqCAgD4T0CkBfcRQyuuQTqh9DoFXir7Xtr+3+vSd0j\");\n        a(\"CXvlM6F0EIHGajlci2HQ8f1IrJfLFAuJCvpv6d4r7gOFMuaIQ+Z2wnSXmowL2GDwwNvcSZkRTNJD+GbOe+fgfqs2ay5M0u/vke\");\n        a(\"6eG9+NuR78UPAj/cOO+NVEDmZOmB9jHdA602uWv12UnoqRcSep+I+nC68PmhdhTJlCh9caSYt2K2lMmx37+vi9ke6CM/Ifw7qv\");\n        a(\"yzuYN/3tMbpxYVspd6IiKUxw//msS62O1Suu70USkSjvd4Kqruz88DWgstr8PnegNtU9RSVBRyZniEFO/rQaUEmZgm1JdJs0S9\");\n        a(\"HpWE9jKFdbtnD16rLY9jeHkU9VS4njHs/aLnBwaM0C8+1Z2/mO1ifaKFofM6cdQIiXgcvpPwGW1ZW8nWroP4J94VD4Brd5eSMN\");\n        a(\"EFN5sVM0ZS1Sy/N2V8YzRUTLbXdHrGCSN7nix2SLGjTWjgt35IDbpS81kgnnwmTJV+EzS6LQkTf2agR8oPYJ4/0521Mz+l/Wsj\");\n        a(\"VKwQ6KBAIgJHEJAmns6g39oU5M2veHeqzpjEtrGS1YUT6bmV+gGOfGd+n9UKAoW+bXr/lJD6PbaBbJ9vIlPqpw4TlNaAUvs1QM\");\n        a(\"p3p2dY7pmKEO2+2XnJ5w5eCy/L/lSdiwoUbMQesjw96zn8VA7KunA0oLNgSqoyJav3+wj3QXiJyb/J6CI5UIIPBEnbX4japP3F\");\n        a(\"1sh6qQtEjQaq9zqoRt5jv3Sb1R+m8R5Q5g9bH5E9XWRHwNEQJ7bKDmoPCBfwFvgs1SEqn6LmMln1t6AYbscw0j/jU9qT3Vz0W2\");\n        a(\"Ht+74OKAUZoU8wHUg4MhZsxIOhZcOy6Mc9Ee1clupV41aw/WUnvQYa6/KL9/Om4hp9ivy8XJ8iPy1nCa7L0H7MSFt9BU2y1x4n\");\n        a(\"jstVzwLjk37ufiOpJ2NvAPH779ogfB5pheAdulIz1qTeD7h2e3qHOxnm8G2QSx8H45qFSf3AJchwO2fIRoZsTuBdyjlIuI4T7E\");\n        a(\"iwGzx9ChVTC8rhvYl3b/yyAuojtgdGf0YEssjGznNo5ktsReBcF8HPa7A90JfhTRq8lfrJSrJsUZypXtyKoFGu6jzSx1gIWJlq\");\n        a(\"rj5GJC1rTwKsbqewm/QlLGsDiECgajD+uEe2f8bZUzZ/ST2R1P4uT9USflWDnxSwqBm1JfT+GaxhTxNTHE6gYs5z0kCHz320sy\");\n        a(\"NOIfazc2VVt50vt6q/NhjpjlXztTIIulqDUZSbx3klRkkr0a8hJALhGLrXM0DdeTlzWf7VjER8UpKPMXaniAJ2QcYfmieuE7NE\");\n        a(\"l/1u8ASzwVNtzAbd67MXsmWp6dmU70+0Z5iLI86kDKemHh3KLOmz/Z1CZLOFsm0/IbLlT7K5R6Bcf7W0n7NY2s9ZzIw7DySjaE\");\n        a(\"feb9NHQuO6bEwW/QiesuIjcQ+g/TF9TbBl+JrRit8c/Brxm0nfyyBZ7DNS+PI0guJ7WS2KnL4UMxLmsKLst9TJaDBwXuclZ1IZ\");\n        a(\"KsZjXH0nM64nhfZfIs0eKAbQqQEo7emVeml2WVoBgvxg1DOYembycT4Q9kXKyyKrE2Mnd/IxxoMu8UDaoO65kgfxy708iBorsK\");\n        a(\"6IkfXrluFDAcFsWf9cxfQjsEPf4UC21xcY53e1eJcC2diH+qlOoTBEPQ9b4wziYXg2OBzfo46X0sVHm/Q/DdbVHZ6pqCG5FuOl\");\n        a(\"Wix5mx+kDr1zqbMOJgIa7GITBrqVoKu9f7MhyFzbzfn7dPm/ba8ndNB+Z5n0J4tPR+wa/hhlsSf2e4O9VfpQen6pD2U5gjyUun\");\n        a(\"0N5kyefW5ERBZ9v1W9wZien7j8YBmCPb1JGDLdzt91vmn8F0bMTwgUUMCCQCEFejFSmRxTfA78m0G/fDak+V9W6/Nb5fyPIPh5\");\n        a(\"Pu4WY38/vo/0ZWa4WGYm0TJzFi0z/YT9hGDEOrNvuV5OpSynAkHx3bDvCjxJjq6nS/Eui8cPu3fWfeo9kB8MIopsNbiUcaYbsE\");\n        a(\"V3+TYRIjc6FwUulgWaZIFxCIq31r1Fx8jvJGq8smX+Nxfq+ZsQFJ/eWcK+hVjSXsKwQF51Wm5zuo7/Mjn+kl75Qn3854nx18bY\");\n        a(\"PT00P6Qj8+9l5lyZedxC7r2bDQGSOq+QOAMlTj8EeSQDsBsi2EZWMbb/figX+iBuXUC6zjaoZQbyhcpaNsFwUTClLnkUfNSpv8\");\n        a(\"EqBPWOUuM/S4wLbYK2wLQyZibe3n1YnHdq2dau+Ul94kZaxYx32rrKVqLl98xwTGSpRrolcAX1v6TL5tznfuyoJ+5RH4BIIvO0\");\n        a(\"c24LXhXErJnv47wjqFd0/o+0/NOLabHpdBorbFLcH27fbKnTwHL9YJmca5sjxrvjV/pwrL5ZH45VN+vjfW/0934DIsRqdCG+Jc\");\n        a(\"9VLj+8dGOypHIfuCNOXKcXs+bVnSj+J9wuZ2CK0P+RxZ0lixuAoOAQ4qJZEufQAh3nuwWxvvXY73Wx/kkaz0gaTy/Qm7WODbuG\");\n        a(\"2vRzvU2XUptmuvyWF892zoWX+Kbl/eASwLcns4nUdfqjWdze3ny4QQz50dHa9uQdepmXyTIvRVC2rVrinCVxBsi2yXE803pw8N\");\n        a(\"bu/BVi3JdjaD0q7kc6urgqJP2MpfK92nz5Xm2+3jOjjaTfo1wZ6pvOUN9YalqElVvL6jYEXBGOD33NcKjf13cocw9dkBxgv78w\");\n        a(\"oHsP7T1Jm/apVTwVRvpCrBgfPj9+NYPmx/wtND+6L8ep+W6EdPcO891iTQvJCXqDZ+jYXAqK7KmQyt2J3Rd0qTgXqsaIny8AIo\");\n        a(\"YSyZuQDF7WxuvHJXpPrJFil7td4eO1Q+K4JM5clxwvWlp/Knze4ytF3yvoe2WeXGblfgFYYSxaKUknSdJmV2jmHu3X3v0fczTw\");\n        a(\"pkLz7/wMC3wPcSK+tODJsBfsgm9il9dLlvfIPL28DfN6Ku+9yPLujVme/P4Ka6mwhyr1wsbKwi6Yp3PZBtpaVmlrCAIbQ2vIbJ\");\n        a(\"nz8C/0nN8jKNaHnwMnX+JslzjvIihG7nKXH977qizz66YH6SP96XEe99DDq/wy67LeiA/OtPs5Tsyt9toJcJAx2Wbs5j6eOxMz\");\n        a(\"GvhqrAnSt9tZIpmPHQEqUPOD2DpXnxZfzgJq40GeVszeg3QOvN5P8k6BZmfTn8FU6h+Xj7cPgSJKfyyUHsfpfWU68XDwoLhXAa\");\n        a(\"JbIDppv9rgArLaf2ssv96+1pFB5BYStMa2PonbpbNl+pcjJSY9wXK+gW5PzlbB5NHp/284JN/8xW4jyzeTuso3Wd8Eyd3qE50p\");\n        a(\"XTEWmHAMt6wKAsjiYM0HPPWlWWqaObDIUrNGmwxrHgoFFmuBVaF58q67Qkm/DAXcIuCeT38u46ibQ2krOTDfne9VCyw1t1Dhvz\");\n        a(\"KS97klIXo0yDy/+etb8bfZ5a/PxjdKv29p8Nva78Va/EXab472+7GWnqHBuzX4E+13j/Zr1NKDvP5LZmF+8u4zYmcaxzQhXNoX\");\n        a(\"R9BFISiBoOwQZCbo4hBk1TG9e206jZY4Lu6M7wuhevYRyZB8b5XmBKtzJ5VN3kvPA+1QOEgLDMA94tEdJGJwBVM7EICgeVhnib\");\n        a(\"FT6UVuGlpg06vU8Yr008D+OeAFLKF47hsldWOaHNXLDZTqHuiAAvKUuoHZtIPp/bi4X0VcwlV1E7Jx/0SOO0jPqiT2O8Mu+te6\");\n        a(\"WZucTtzorLopnlOlCt0MCNrqE4wGticwNhhEtbduK4QHVge9v3di1bwfidiGCN9kpkJQwEMDOl2mqy3jMDfHjWXhf/52owEm+t\");\n        a(\"v7AJ3Wtz7S7iIcGlEvwG1ueYeDLVp+x2u3PTtY6jsM9XX4mXWs6TXBWJ4zxlaZCIt5/fjMZa8JurPgkJJkVY6VVcbh7kRE2S3r\");\n        a(\"WgLJRDfQy+VHsp/CRNfzEr1bA79T5X2HqPIfAuBivoYeTe0cthBTooxpap+h+QER5eZp5Q4KXKiVW4AER22RgeyvBUZ1KX8gl4\");\n        a(\"85T6KF1eMvjm1F+D4EiIXmBK2C447N5uLZL1RjWzyE40cQo07cyXKFAKdikBI6UDVpmuYMD8oi7JuyQQ6WgOYvti37GYeU62zz\");\n        a(\"62aavW1HGcSDbf51zkVAlH4Hlf4GxFd6AoYZG35OVlJuQDJF1CU3kq7/p9gniXOwQ9QUCR3OuezyWa3aEe5ZOEo+QPcLOIRuM3\");\n        a(\"3zrpGsoN2H/D6TsguaSEWHCRf2qBBFb6jatJkplf4s5gnpEZpuBvN+UN1yAfrR9P1tfIk1ZTGqP+4yFjGP9gdTnwcNEAziX/sB\");\n        a(\"1t+CjxatBPXbJ1HB9l1EvmDvFHwEML4+ki+wd/uKDre/ZGD638DFoNBlGvoBa7Fe8z4KFnVAj6g3xmMtnIg4lz9kexFIdkJy9w\");\n        a(\"VCCyPkAPaT/tcO1m1aNVroNl2vtoJoALIJb0EWmmBwTxNvT6oXoSG35nFDbKC3/b0QvSVMrxGwX/3pZu5/ddMefHN98afFtP+X\");\n        a(\"2tdsumyn0DBSig5ryiRS/tD+pNh1TycrUyPd6DuYWC0grZGqgfgoBiCmniBnJj+gw066AphTs5F2pIIvD/cuokxNkCypH+bQQX\");\n        a(\"Tc50hA+scifSvStyVYDU5o7yOGiHkuXFmQ9ncjy93qUh8HQlHOWxByvXrKSDPNa2Npj0D2wQmf65eJUkmUabl3WjBCR66rPW7K\");\n        a(\"UzUKdK/U6c4TdF2gC6r5hCHGB1CWgCLXWZACgY9YUFdmR/AdEXQi6A9ysAx5vy8XeaW8Fen1J3CndeKfLKp8IShEfTRdqwelUE\");\n        a(\"PXj+ZO6NfQCTz12gyeKjciDkn1nNS/4UdKmiCSnkScH2l/1dIOU5pNpD1EaXgP+Tbx5GrwMtu/WSjfB8yMeB8ASJ2M7GT/RiIl\");\n        a(\"TA9HOv0TIA0TSLdIpNenhiM1AEKrm46j1aZ/Mu7lEnfE1eG4QwEBdz3hfhJg3P4S9+Mrw3F3AALuLYT7N+C2/yiatO8WPcO2q8\");\n        a(\"IzbAVUgvuQd4yGl2hHq35zmEvYKDOYImoenMIZypBBiJ1eFBlWyAyFEVW6HBAyXKhnWC0yXCUzNE8Lz/AqIGQ4+HYowwyRYajM\");\n        a(\"MPya8AxDACHDu3qGEcggOTOW/s5WIW9yFfpIgYcuPnIJI+LWlyNCq3qRb59ly/vCgI47E5KnuSpOGjB5TPP4AwvZzWDV+K6ECn\");\n        a(\"23pmeErMaGE7kQRBDv8i1VhUKkXJKi9xv6NaULxxSusMvX4SoYbSgvcmWNhmzDlRX3Rnke/hoqL3BlxcP3AYXd5/HfQa4sz+Dy\");\n        a(\"c1xZiTBY4soad165hQ7qSxL9sCkdSGLf0MIvQ+xGv4f6FsJ/420Z1OoOnFXw/lztWEFN7qw6v9Dnpgb25gZGZChABiS4Wuzqxg\");\n        a(\"RxLykX3qj722VCeentlfiN8uU/LMJjv5IU0j/4/DqyX4he1OVGkl65Ru9X/wG9e4jeQ+H0uun/6tPtpzwm6sBeove677uLzg/v\");\n        a(\"u3VLRN+dd+a+MyKDP7rPZPsuqtTb1Uuxn3TuUKllI0TLEPUTRB0Ia9vz18ZjPsiQbYvq/zbPf0bv50Tvl7Hpwb5Af7qfHER/bP\");\n        a(\"jjGUFr7NWjWMsiQPKh6Vq4D8KXpnPYsqVZkoqWv2L+guBcySX99vE5n3qb2X4hokiAekkTaGr6+33J5Io6kFrj3cYmmz0H8r5Y\");\n        a(\"8Z7LT/o6J4S+zgxeYM87zdB2Af1WQG8L6EsBvSGgN0W+8dcwNF/TYxJQ3imGRgvoTgGlC+hbQWUUIHXaSGqlaY+DRBmmffjZmI\");\n        a(\"CAikD7KRfsbyKA9AP4kad8VsUrwzKYGveW0YCgHcGPibhid4Ly37EKdNHvXVnwQTPtdUYrpmXI5T0aVzEAI7YY8idhIvrrbLIy\");\n        a(\"3WI6DrEK/XPR+tfM69/L2vr3C7n+RaxEmwCpf/xKrH8SKaEkYv2bCqRqgXSLRLrQEY6UCUj9mUAqkkijneFI6YDUSwWSTSJ5Cs\");\n        a(\"ORFgFS+wPJ5cf+2g7gSVvU7N9V3wOvlPUPVX0T+KBGgrAMvCN1CHXO1xFL2+dXxJ4nZ6fjeWP7b7m/fNvXlCRkuOCoYqTF4Kjd\");\n        a(\"Wtua3uGobazBfnSMzd1vjNWdMibbPWyM353TTrIirDJbXSN7Q6egl8FhWdfUfi3T1OKTEZ/A8Xxms7y4dfXWY24c7uIwdg7L/U\");\n        a(\"2BC2iOXnnU4hnknAsHrYUJmZor2zR4tDLhJXVgMD27Ti3K3umH/8Gimp3uRO9xi2XtdOxC+JW11CmJtR7iVDTnOCtFscUfGMV+\");\n        a(\"hd3QNdyjPUqiq3+6s90NWB01GueOwvTJRsx+OZ3FLTjXauc+9CCpCKxNz+BLA+FOTr1reOipg7tEro91wtMdz3wE2DQgm4A0Dc\");\n        a(\"goUWqYGKnrK6AnztSFoAizCkhrJUQFuALN6RVRMCL1CkdAGaQwP+uDRqNh+VTMAfmPpm9Hcnki3FlZ7ilF7xTmHVwxEFMF7l7o\");\n        a(\"iEYS7fXPsY1wZWA6FJf01viSmxx0Hm0/m3L5VD8rlkGGpC9o0v4/68dCvWHtt5qSjZH1zJWplwhV/XXY0+qqNdld7p/LMN9Id2\");\n        a(\"185XzRMIp6Id3PfkMfTd+A3xJ01FMMHxdIWadZRYE64wlOX8v4jnr8Ed9+AwlYVM9QTdK7MSHylprirkPh1AJ9PQPpbM24SiN0\");\n        a(\"cUux3fnAJghw8VH6sPX4Vt1zdDHuJ9N0Me5HCGKshLUJfhBipd8MHJKHUCAbKTYK5LawVgo7IpJmYoShpC6NeWqI9rE7m2P4/8\");\n        a(\"Ry+kGp703oKJUolTayU0GmeAqVqmyEc5n5qi8nOpaahcI0Dxe5DY3nCwrImM9Hr7Kx4Fmv07R6NqQgnxzZbSnGIB8KphYjkkj6\");\n        a(\"2fuch2QZlpoHQQLlWcFNLF3Hbu8+rBoOiKw+Xd5LLcpClRuod9Upz7L6JD/i94H7Ksya3twkW6HvziGaMT906bDZepfeVaZ3qR\");\n        a(\"dBZn9SbzGdulHH+bnEmU04vjRqknEN/sRyNdpVPifVJrFd/RhdWOp7T7kywbvX5ZlTfQWJTj2DipW6o9SIJ4UCSGIR7IN5ybY6\");\n        a(\"OwI5hqajnOeM6jzQwft+O3/RCGRwv+MKFgcVB/BLfMdKyb7yuTiuFADmcmyWmpw4bvoo2Szlar1ZtQhqX34ZxoXdtKz+s5FzHJ\");\n        a(\"6l57i5SM/hQpDQ7UASNVSnniSNzSN7LMVNviZy6ZnLBB4VONBD+NaoGVy+/UvawNUwgogJYskBSquOchVQnApXh5lcaKstvYjQ\");\n        a(\"MOsJpMwvxcZ0GmT2oYK6ZILc5RWjISzXD20i1zltsgjv0iF4yH0Hs8c6jlEmDiG56LbVncvmsXV5aq2TO0f8GruWSPIpDUkZ2K\");\n        a(\"SVfklk6R6t9Mf2YdoSyHnbVvzF5Q/rqWOBUDdcqWEvArZL4R6jnU0HvlllLUPqQKisBGbgkxr9CkC3PVQd8tUWCgufbbJjZBgv\");\n        a(\"Jn942aj5cHuLZFAi+BqCWD9BErlh84SXtSiXpd36r91Y7HtfsyBnB7uzZgV7pi2huyS6ujdDkufwfVikuJwO8TVYVo8DWvu5LE\");\n        a(\"sDb+dCEpkQ8hFdNyGuMH+RuTwdf5MrzlWwYhvdJqzqlf3VjfcJL2obasD15PUcOAmWVTtEyGzx0uRHfj1rXkPAoX1zOLvwElvL\");\n        a(\"H96YI/zhJWsOdNtzjJQlrjKP1HDtJWDwW47pDF6o9C7G5hixDhR7uxqyQeJJJbF5YDbLl8keX/xkM1JAB1uSRkFJ+5jVR/hLF4\");\n        a(\"5qgN/1oy6Fr056/6dZG3x6MMvXqADqm8J8m2UV2e9hQV+JuLXTutW3i+8/eB8fux8Tyq+knqmA+1x829SNnvH5sxPK++XPNlck\");\n        a(\"i/GwebJR3nwHamt0+CY7Q931hIGmlWRqW3C7P6w+5Q8AI5fnxLIIRpHnmX/RdiXwURVnfDcX4dxFCARFCQoaBDF4JgZ1Q7K6kQ\");\n        a(\"2NAooWlTY1YuuBklWsIQmGaJY1uPWqtrXiVW3VitaD4pUETKJVDIgaATUq6ksXNaJCuLL9f9/Me/P2vc2GXvx+ZOfN+c3MN9/M\");\n        a(\"fPMdwOl3R/FoIfQGhco809nlq2dB7JXFV9vl7vqggd7g1PdXlu/d8lvV3yjYoyujugWCky406FfX2Qb9+hJBslRw/eF6viEqX5\");\n        a(\"PK9yqCwlLBjnlG+m9U+kpRD9nToPP1rVCHrDl91YvMG0MPv8pg/dhFxZQrifVbiyWpTZ2JEGzib/cRs3kYPrCGr8dV0AFZaxde\");\n        a(\"YrRB8EZE7/+3I/zHG/EnjxQiinbgz2tf4s9pzBlPna0A084yAPsCQeF8YgRgGN+IBrdcIvRRqvkmtQOQm0ccNb3hY9jWmfULMx\");\n        a(\"Pr+5zSZ7rir+MRlPFZG5OprHbL8qMS119ArlLQh+hoWzbpP9GaYNV36Cf9/X7SW/pJ/1PidODFHJBX7ZrPVDa7/arQ4e8QGoXw\");\n        a(\"5rEoWrfL5i892KN7yYdXahhpW58VGR4uxvZCusfLoTFFUSqT24+l2JnXW73erE8p4L0lmmi+lGNuJSnPjl3v7kas9uHNxFGuEz\");\n        a(\"of3h4IzHSn8FmypBscw8XvOHGWlHbPutDpLRc6HWwnG/yPr8mvilf4kfonfQLSuenaBT8YGHEQ7V+YsP0Rpva/0tD+Rf23/8H3\");\n        a(\"RvvKH6fS9o3nvzhhOgBnIULccNnddybCMrOejqufNcmsH++MhnscKiWu/JxqIpnrofd9Fl9Mskazg2q2BKQibebe4srLBnqk1O\");\n        a(\"6yXiTWVA5EgBzsVE3GUD++WQ31L3Ig4eG6gIeaBIlYwlfTloJWhblxbrmbZxIVh1BxzHwvEvpEj/PPK6uFWtEa/PiDjzbyz1Nt\");\n        a(\"/PN8O/+80iFO0jg6lHuD66FAtIs1KEdDybkncliYxZ9qfy18IM9QPpC9iF3aA+lwei/6DuDme3sCm0TciewAcLUYnn2+BtQQSv\");\n        a(\"KLCJzYaXNFV/LaA4Nkc8AjUuA9wut6cX1x2Xs4/qIGMb509r2bpIoiF5pw2AUc1giH765mHEaYnUUAhzWJwxoG9p1/qIE96kvg\");\n        a(\"8D3n6wP7tBzYCVCIC9V1sjCVGLWQGLWQGLWQGLWQGLWQGLUQj5oY+INf711VidZbmQnWG74ArP+c2+96u7xbrXeTfjSQeinrSE\");\n        a(\"Mer8dw4GBDvSlo9bhNqtUucOS1u+ZYUS+pm8+uwR5oBNPuobDQzZICWAtoMYQWQ2gxhBYtwt6J5QVhT0HBiGuapNOQkSou24xX\");\n        a(\"SDTsndSpN5lOh+bg617nDghGVKSCV1L9HkLcF6dpBF8hitU229qXU76lvljF5mA7QQFtk38MlXRqK29MoI9e0k1rhSwBFJCynQ\");\n        a(\"HDQCwLmBzXloWpO95OXktc3Zl/5xiNBfnu4Oc4fCgQzPLkbRgZ40mAeBPSG/g6JlGEQJq4DO8sous52zPEd3z77rBjrl23gDiv\");\n        a(\"UdgRbFTyuab0mxOkA5qyTWxm0mEhrH3Ru9BMtojyNiqFEtxxmKYtbWqaNkwDyo0/zzpNt38tZA8UqnUoghcfvxT8Oy+1i1gp+F\");\n        a(\"ZhvjoxX5ofS7C8CJMHmgXx2xGYgk5MENKaouct5PlCSqdDiE+Fw1iuHXSOoIX9gpM1LGndenlGcXC4CbkoD/WMC1acyW5iKnIp\");\n        a(\"A9XOg1bPKuciZQTa6zCnli7A+wP6rk2twwxSrESKWHnc1dolBX3hY42tfwCK7V/228+7nKqfsnlY/XMT1mpXocFyYHj5REf0+s\");\n        a(\"NcL87tLsI5lD3bfAY8EBXOSI9kUBJH/9QUzVXBMUPUVdfBxt7gBycauIKJpNPQX/U2ou01gwmjP17oBOXnriYjiPTVSG9Hettg\");\n        a(\"QTLX0DvveoVJUz7Fgn+xVMekByUmeSPYOS7vu6GAauh3l/fZ0ABTQ09QQ7NsDW37p1R5mY3F97/Ag5mAXDu61oIHB+1fnxaedu\");\n        a(\"rFABPO+4bR7jpQOdSPo//EhKYUV3CPe53uL0Gl83dmfPus2MGhwkZvcrPRaCZM7Fadg7e4Si+E5yiFIyeBcGxA0lKXKQqi2WF8\");\n        a(\"pvMnfPyWtWiXuaJRkplKLswE5zAT7xnd8aBFD72s81KwTHPC45r8HRQZS+Zx6R2PDeE6yVVDZmQA0RLnuZmqD2Z+uIWm8hgSM5\");\n        a(\"/dXABWENRPMKcG81Nxxs3/+tl/6blvKSxpp7GCkYelc4LthEJNe4AfnybD74WvqScJ/ASMThqp8lXBB2FrVTJcF1BEatTFBu67\");\n        a(\"idSnYdQgUpwWSPOHytIjZ/saQGVDo7Qb7jOMfJ9ILVYRvT22WSHvER8BeZ/xW+ntOI3pLWTr+9jL+8c3tmeIEH5BDI+A/hgh3n\");\n        a(\"BCvCEG4tl07+znfd3YuE8y2gEo6ptl7Gjx90eeOS2b90GyCV+YiRF0Vw1iZGM8SuCvVvm4IpwaAKmkTMfSAfR+Xgh9g7Kv/Mll\");\n        a(\"mf78MnfVaPzNqhoK5ju1thYPqkgPlpH6Zjq36WyGWydiLv1xSDSKlMyC4AG8x9i1eGLpuaatzO/LPkCNOM+vEef5RnGebxPn+X\");\n        a(\"Zxnu8Q53nd+ZwuB1C04qocOg+zKJR0IgHQvh9A2YA+eECs24Q07/KvWYhSiQcY4vh+cbKWUvn8noG7jzx7M+DvFSEqByZQ+Our\");\n        a(\"c8VRRj/eDlbH2wmNCgu7O4GFg2fqWLhcYuF94FpHCk1QLOVK0lQln7xmosNUScs5eiWvy0rmoBJeXehqtuhqNnf13X+rq68cZu\");\n        a(\"vqPwvNXd1f2mdX80xQphKUWedYu/rX7f119YdXVSWNn6CSrcXWrl6BSsJ6X/1p9IjTAlKarZWm6UabSyDCd+ReuTMFWTldoFJI\");\n        a(\"oFJIoFJIoFJIoFKIUUms/MTnJ79xfBppP1aU6+eK22LOT/K4NP8qfqnNIn2abujTkAWi1MdOTsZ3SY5xUN6137qZzhBbZr5tM3\");\n        a(\"WNS7yf7vsc0/r+Tf/FfpqtnQrPjxzoTUGAKd1JVwlK5yJKN8igdIreqP0zK8R7q/1+oWlVd6r1b6cPHdrVpybSv2KZWxomSqDu\");\n        a(\"gWz7cgDciyhGhzGK4oGiHHxPJumB93X3hhBaPX0RclJkE6PcXA3FurXdAaeDDogYMOGp03Ub6dDAXaLy1wlfhuQDMeSF34WUZr\");\n        a(\"xFkLJUyrTGSDIu/TW5rsDF1Lo/RE1pobnINbKdK7+oSnINphspKe1grU/GuuNO3wglSJ5J2SFc32jUP8USOIzObl2fYlDyL97u\");\n        a(\"uv0Gk52xh3WDXmuFglS7mOnY+YXiPC2a33KF6obBQjnHEfc3mwYlG87o2JkL6jbfefXi81DcNM8J9UfUbrWR9kejZMx5pFO8zx\");\n        a(\"fBvA2em7R5qfygZ7tvgcUcgx/t2iwI5vOYeUWgR5uOgMIYtZ+E+9pPfKy4Byxqp+w6NiktPvJXliaGSRqI/xniiLnD90/B+ZmF\");\n        a(\"YUJUBw+VJvALvaaLROrOgUl86RWl2rVfohSS2xkfG4hy7IFsr+C6aV/ngkCOh9AUKDDRJu1JrDMZ5oyN2kVnyIn+rrcPuqbWuB\");\n        a(\"r/2iXZjsAwDKmdpRj3PpmlbUpWOazpbJ8YlcEgEYF0zNlGVp4fLK5WDz2m980Padf5B1g2VaPEcqQb1CFESO8QtEfWQ0SQw8IP\");\n        a(\"20BeRSkYLh6FENYAJwJzcH/CB5KBarVFuuPRTDFHwylB5HTIM5kaKFv/yPMImBi0FbFvFF4B9vFQ+GjtAknSKETsix8U6DTGIU\");\n        a(\"je35/SnHQA1yaW86seqzmZ4eYTephH4FlOAsrfh40Oj4MRJzwK58IUI99ia707nJxtcpTNtobm7uDMYxmRmnW07iS7ORfvqG7n\");\n        a(\"sTw+Sn6+aBfioo2QvBA8I4Aph4pQCVOCkL3/PVTyIPvPtJs2B/ZPODGsyLXqJMA93CGn+a6oevSJby94lJQ3nJmlHcMEpEl7p5\");\n        a(\"w9sHEb1V9YZBnt66MqrXZhNmz/8FoZRBW8ut9sg9a+X8JJOTb6XyC+9qZsCDuQvjYdpocXsC0a/nty5Gx6l8WAB7cY7HXth0KH\");\n        a(\"g2whmOKTKX4bxY+yx69HvKK5cd4Lgu1ouDKtKN/jrjwEVLyEGJQZX+ANUVuYpDBXwS9MaZCuFt1Fx+/CNmS/c8bkz1/srkxnJu\");\n        a(\"qAKpw1BuPiiiYeoiZSqYn8xSMryAaCFNyi25m2LQTkXDzSqNhcX90uo7qRRnWzn0N1L/DbPdqrOhWVVg0S9vQXISvFHeUrK2Tp\");\n        a(\"MNbhSSLwQzPd0NNpI2I0aBDNGa5D9s4c5H1uiXGfm/WLg7zPxa8ft7D8wpGBwVTpbKEvxsDOxuXspHak1ha6nX34B2Lcqhgr4G\");\n        a(\"jBKInQlRSS7kUtCG25HxrXQ7KXV/srt9PPo9ZSPKmxuKkzmS5vrKXlb06XCNAwslvb1tsbDRWOPN0BcKuOaNKS6D45auOvRvrK\");\n        a(\"Zo80ZjVthVoXgDw+fTOZyaLtr0FdGtzyvF8cbNfP+i9vJvtpp5tZ/yk4Isfy/a/pUETANt5isJemwf9R5ALYRRmJ1PSqAaTy5I\");\n        a(\"zk8neNo2oQOtekJcMp8EREgeWuRyUh6pDam0ZSETebglpLTOZk9Bpj+CMIASr22dgy0xqL4Gs1klzb6CzIa8IlGd5XC4KNM/NH\");\n        a(\"NgciiKlOW8P0GNnj6jdjDaQSTqv1dAItgOfpNCfRJ50AGClwf+nkPmZxDmYRrK9gN+mxwR5XL+ZHTmtwejfhWSL/xbU3uh3sH8\");\n        a(\"0F9tHlDaVRbbN0iBPs27+lM0r2s2t7oxVifbJ9KcsAmfnr++xvxnZ66gY9nSepqIvp53j+eyL0ta001JMcn4ZmJ8enoW78jXM/\");\n        a(\"SVf3k3jvG7V7nYEMfXc3rnndrnF8vAC4lfo9D9wk4/hRcWk0quP2om2Y0TJEcA3gC1NepMnzyZnifJKr9nkzn7RH3Os0lSrudU\");\n        a(\"e9j9NhL06HfDSSq6J/+ibIylDz6Z/isAcfLsYKYn/iYVj7FH+x2t1adp7Twct+HAKCDJ18qSCMbiKMgw3CaKEJdnuPHfxj5tk0\");\n        a(\"eHv4ZJyxqRejdPhCNhpofvMcpr95PvjzRG+ehz2lGAeXvouqHsqzvnnmQC+R+xrI0HO+t4Xeyy6mGpk9K7j+p+6luRLAWrgCB9\");\n        a(\"+fJOpPyeV992fjzxL1Z+aTqj+3b0JVm3Kt/VnwruxPxXgD9Pn7hdNZOvIEBvH0XXEq62nau2P3XyUuQ3gPh3F34fT5THJXiwWC\");\n        a(\"NYjjxTScM9c5Sa4cx01faJY7uEX7C7sLhUvaLi8z2+DzqRhHS3fd1uot5WGrJydF/8zPZC1krL2VcGlErKhBO+GnWdRAnfcO5f\");\n        a(\"Me819ZZBQG0ukDV2TeZPnM96kiXnb6K5pH69ouloaXX2t7CLWjFRnoi0FrDGAUJP/dfvfW25jS6CmJ97vqjQn2Oz9zvdJJW/Ux\");\n        a(\"iBTS4B1iGzxF7/5z+nZXPPp210Xi2iXZ1ly+wZep7b9P0b15HejjE3v/t3RvMvkaSrtCp3uJ3q+7tVfNoC27T7EG/sP7KKqcad\");\n        a(\"xG4UFdu+oiY0SORJCvKjdilEQPR4l+uGJvnmEz0LMlsBdCP6IpUzsAX3imPVed77kH4+6zbKEqvWbJFJiVafFMPbLFc/yUFk/O\");\n        a(\"6aGMBb9xOqD02+KZ4kRx0vj96x7MyH0TUIusRre37SRfqtAVl9F9789ZuE/THQvyl/yyPZg/yuEShX27ay9zNFmaW5wVGcdIKe\");\n        a(\"+aLMNAHPiIsOhmQc4E7xuZjHYzqQNf96ADa3IEf2oYTj8+arT1KNxbS0KFHoqk08Lh9GdK5DSGifSfqdiDyMX2FkTcQxTXQHEj\");\n        a(\"jLgNFHcj4sJ9ne93FxQRkYbp43X6d7rlO0l9W/HxYyyWvvmd4Ice2b+8BT9t6Pfj47BeuOY5VHPsSsJwR46kXMTX1Mqg3G9dT2\");\n        a(\"GS3uZ6vBXsTHcjI7AP482x394qb9/n22/f6v0Uqk2ptb6ipHW1C4oOqPT4+JMp8CdTu3OkwB/+OPoCHX8qRxr4kxnJioc/mZGB\");\n        a(\"2tFuJwfVLMW33zV1/EHb7xIQmvl+Whh6ZmYBnGBr7bdOWDg5UbdwUiTsm2DfE/y/Hs5KFdBeTFUcB2YzmTLpYPtlL8vhRG/7sm\");\n        a(\"Gl5Pd8zgTye6sl27K2GgM6FT7bM1ngKuPtD2h9XEiHDiKfF2RSu5kusbrXRTL+5owMN48nWN8PrKufPyGL7NvzQYQV7iom5LBp\");\n        a(\"Y6k/yaLsFOuRKgh7SE/+R5IbGGDaZkotlwsL/qr9sUjuiw77vviHVnTgq+MT74uXv2mgoxqvdMt42fnRdvwYNg6dAwBaKgLife\");\n        a(\"uIWIwx+8NZA3xBPwJtwJd2yG91+MG/i8UbvVfGKgVWsNXqCbj9sI/mpd04XFA/qnvMuAXd9eLar53QWK+cXtzaQvhl2JXxsuFr\");\n        a(\"WsUm/PJqhga139npb5iQW5L3Y3U7vwcL5Z+U4kn7CY/xbkt8kZunENKdEr9R120PoFajYY/eLhoVYKp2e4x2xZN7hRunDiIXeG\");\n        a(\"vV7v+mNxr2O79UrQhROdBjf1539RACL7iHz8QT2T1qj7NyLMYlXIx1RDvujBVzjozWY+NsQYHOag2dct1+jemdI188b0CnDXMR\");\n        a(\"wlyEMBchzAWYlAn9y+g37lg5PvRBRYQRAU8gUIPiOM0Fi/IWP712e0nQzmwpIS2VDlyIpEo7YkLHwCheVao/78ulI/zsRHs8lA\");\n        a(\"Rgo6crJB6mv2D5DBjUQUe/qTxkBpRIJ0drewaREulQKJF+UZx/RGC0nw0aFK+Jin/V2q/ApI14Ea2di2dp/MLuZsmkznMa5hwV\");\n        a(\"xTuCNhPKTVThsBk1lZOjQwNp1EJ5mKJcHDUoMICi0HZJ8HjPi3D5m8DCkk1/j/Vx3sXZ00/6h35ilOcCoauGx/Q/r2cpyDZ1eg\");\n        a(\"q9nefs6nqK0Cv0Ex+cMfOb/Bbgo+FuKz+mMFgpFJ9/RMVVxcEf/Zjzy/EqjV/Mi7mnP5tG5iB9NEpoC6d10yh5pyJtKhG/ySiL\");\n        a(\"X0vZiShbHDrbp6wQOFsNR/nBpIIX4IW2266WZ32/HDYw0X7eqf310AT7T4lG+3lRPV/9OplahLnW+nSwquj8eAh90lI3NvSw8S\");\n        a(\"rMsXyo+/BbkMxHYJyAhnIO34ukCJosrbZ6/kgnN024p3byhXHyAV6N70RO7LucuQBD+KUotIlXZJf+8uhQp4SE5zkfudngFVaw\");\n        a(\"2qn90yy1Gf/8Z+SHHIK2Nia/zP2mcEmj3T9FbQIHx+/lI+0YPsU6hvCRZIivAR8nZrONeT6ycHqm1jlYT8fHCE6X7JBR8CSQgE\");\n        a(\"/8392/wvHuXyOhKa2Ng9doebfK5BqkWq64mBWNlcEWz3GO2KuXR1xM8mxXr3DCu9fT69Doip/a7159+WeOPT3FfJGZJT2iDRFW\");\n        a(\"fQJ7fSA6eoFSrg81BPcq0bU4dVjX6yV4GEokb9A7qq/1ukr4wwu0W9atkD3gyjemINTnulUx+q7YYXrzUjulc11MVoeMzltXNd\");\n        a(\"1WR3CdrYrLG0Ymx+TLEe8Otoz6i2E5STUoPSHIM4D+Br3bg80xRdxCP6QI6fJK0SHTjANvh6ldTE00PA9lIKdQ/YS+d1+jU4pb\");\n        a(\"EBCe/DCgdn8qtMxrLaJvlvXTSWb0j0eExML48utkfiyx/EgnzSXxa4rqgetUZlCyPo0jYoVt+E1KRak546VS24xL9li3nm6dvB\");\n        a(\"MTFnQ2q2Q1Z/DKhgk6udW7jSaoXMqdbHMyGS7zboNISWy5Uh7wbcR342H+NkYURI0vkd2jrL5q4r/ndvsbZqBjGVc+43Sw/YSf\");\n        a(\"ybth4SLLUok7vkv5jRvnZQ0LWA41C7MLrswSWAj8KpnUvjdfwyKc2Kaljv/s7b1RlMPnp8gLMDwExhersdfVCyfrqAwJWP+k0D\");\n        a(\"5BR638qOxzaCk/XON8qMn+2+/jszBgCe7b6l0+8KZ4l284S7zLb1BC1RrXtNkR7/4NIClCW+GZUj9jivqaWj9jqvo6vn7G8eor\");\n        a(\"p35Gjv4V8niCMzxiTZX6JCfLp31wSDSqshQFZxTJLJkMSz2EZWVEFkecCuMWtrs/6WHL/Tvm1f/NiWpRmd4ja286CfbdMNrPOp\");\n        a(\"neegSO1hae5FTcKvN7+kn8nn4Szp4IC9mTHCF74lE3NUXf+T6LkR78Bmb4aC/fYFxSdpNss9SvA4zi83GIW9avq+/ox343+jJ1\");\n        a(\"uBQLmjjchq12+t4IfGUaD7zrwP0OeBvQjPtdd4xcEBxTWjc3davO6wn8HGMjuAVzC16JsYf6Ou5VmhQh4hJUoR9LAtHimtdtum\");\n        a(\"5BKJL444eL090Q2EX9tvol1A0PmDx5Q8j0ST3JLzcC45mgAuNxGwL0oYDC/Pjyd7N6E8vffePi8WvXvnDZx89+nqVtMai2Rfy2\");\n        a(\"q+3xWSI4QDJjl1DbircT+4rcU1QijwCw3FYAcjmWenj3Rx2cl6SsYuoAmWi3Fshycnyntf5sEd9hjc/SV8tLOqHZRIEE48v+xo\");\n        a(\"b140+kzcRwaiKMMISzzG7dbh2cDH/IexEp3brdY3XrZj8v8V1XuzgiWEFy5Wxo430H1USGy6h/tOpRqFCtqPj9+XiovT92+X8r\");\n        a(\"L21aNJIM/WO1XmiFVE2Ghls8tpk6FzILjNC+ObZoII01m6U9eIRQkZLfN42I3b/eQcLPxKgIQ6J3AUZisswr3LkOMcOmbQ1HBs\");\n        a(\"p9eZ0zhgJ0UP861DI3969H5lT9iy0aSHtJ9S+f+tdxkP07Y4jkZ52MgOrowe7Pdj4Wy8Pc+xW0laFORHwhTJqVJ+R6YSZLLstn\");\n        a(\"41+CVhG/pyC4Hj7tKqeWlL2lUhm4DlzJxda90zLTFZk2PKlu4MnmsXDxXCfY3a33D0At58eOfyPU3YGpUF53YEt8PDNfK1T9bb\");\n        a(\"TC3qEurDPfYyTzSF1KVFn7fK0cdLD86fg4mWHDyWTgpL/scyNe8d+K89ZXjjXHIw50QI6PuAz8Gzi7gWfkOMbO+Lzs2PP8iXZ1\");\n        a(\"dPt5/YgzE6xPde+ik1fB37McSuf0QIvQOR0KP9Os21e0gi/UYpsboBPvlYpDEbf9P57Rb/v+YLz2l8r2G1pk+4TfNl5Ktw7HLT\");\n        a(\"Y4bPef2f2PF/Rn8HKdiP80NT3BfdbOf+JrT2ACdY+qh10xdAEzOghH34Lobwj8rt1C54Cb/+RHrp4VGwrRlL7xY993Svtz2Hqb\");\n        a(\"OgcFvW/5yua+5UvGDo/sxKn5HvZEGMbfjZbi7nyDmuOOYh9/S9095TUq6N3sK0O809uxbGk7hu/MpSkbL2uHiP7mfO9bFfdSIt\");\n        a(\"cyqRlBUqDWG1qBhmwzQTaPZAbAfnmGJDB/FLLZ2m5PkdtBPuCoUA74O2zLkLP8Xm379vno/SHBfGRkTU7iRrXLz5Vi6yvTEumz\");\n        a(\"SnxT8xPLb/gZNwaNTopC9U3HJrHiJjUhafElkIbXT2FQ7aQ4457fxvOy3leG/8ksjo6SGZX2SsagEqnm0o5xxfSsjzM9b3FFTm\");\n        a(\"/7sqVtPD2pGy9rKw9jLvO96yvCnIoKMD9iHvUGB9sbfPwkMQt+yF2L4zDG7PseaqWRAcFGka6zioFXjTDpTZZhikIljX6ky4Nk\");\n        a(\"t+b63uEwT+chtUsbHa4Hmnn4ZnwudOJRP32OgFaFaTArJtnAGn6SQFQbIjFefH9A4tAghSA2/Ph4Z+LzdlWKSk98vlZocNHO/+\");\n        a(\"xcrZa46ehrrSeMOD+G33Qk1vb0yJ5mRWXgVEXOLPeLPCT0e7+G+YCoIqUnNAlSOqOJSakWtt1c3brs/+1oNyH/Z0PuQdPzWCCe\");\n        a(\"ahRAvNKYiJ5nJh08PS9U9DyB//8keX4LJP1X91X7Oc4LxvVhfsjCq0MXg9/1kqTn8p2yErqxCR4pO4trdzhLyFVx7X/yXvg6hd\");\n        a(\"246Orv4x+9jH4meiyc/xG/NLgLgsyNojJ/pjIleT9Uh3S+4otYcv3egO30ODwxycHD/gGcI+O7Bt88+q38Dfz9xiE3qS8cieeD\");\n        a(\"34dXYz7WYD4aMR9tmA/MS6DDUE3t64nY2Hwx5AGM002Z1O/nuN8VRTyg0i5MllMNqKJ/UEA/QnfOlV5Cw4xYfXyXvsRwz9Wozl\");\n        a(\"Xb+Nytibneo+V87XDQcY0ciw0sgUPfHnqF7euB+B7zhJvmu1PNt66sOJWosIRce3MH6ukLvo/W9jf/W8X8Q8bCmH8qg3fhWP23\");\n        a(\"owQOrAYOrAEONKJjbcAB4ALmQOKA/f0/2nuw/j7JFslgLjQwAsEaDuLo4EcNAExHerUf3BnfBehsf6i4NNhORrZKQmOd6qs4NN\");\n        a(\"+JSS0oLQhuLG76NMWLF5Kmz1JmhUa6ZwVHcsr4TRDAR0IT0pHgT0/HI6wbSeeWwmoxVeIPjk2inN7xjcX4PCc435EeK5IRWkbP\");\n        a(\"POylJsl1RyPkKYMYJl8p1LlQKUAaqL4A0kDU7rODNBwgDUSKDaSBBNJwKgSQmpFGIA0HrsYHSfELQ6Xzl+2lk0TlOF/Zm8XBth\");\n        a(\"LUCRsBxbARUOJsK4aNAL+zKfhmZBj5pGPR/EgylD90JcEcq/RHXH33DRBurV+fXzXP1UC+FmtevYXyVJSGzpp3eVHDwmhB3gHX\");\n        a(\"bdc66Bnl0qhxrw+dXxrsoOElj5CY83mQrjdH+pPStRS8HRbkfVT9DunjnmCqr3Ii1RWOV48b9VCZz1EmWDUPNHp7wMXP5rhpyS\");\n        a(\"5Zdejt9nTxDA/VSfEgny0esENAgho2kQyVUVoXec2BYf6G06sPEAGAh9zISGHWIeT2h9ZSRo4lRYKyd3GYIrGM6ry8j10rh7Ld\");\n        a(\"oW5Ihof8lJ8c77dDaGgluZuB8AGnwUdTtJ18WH/CewkKbCsKflUQ/LEoGCku+6G47G14f/JNatKq/YDF2Q3vSWW6XUnT/Tyvt2\");\n        a(\"os1bc3tq3qAZHPwEOOOPM+XpoRB5bq7QxHR3Avw5G3O5ACDZDUvO9dRbvz9lX/mXoFfCerSnntlaMxL2dhEDBWRcHPuCaNzF9J\");\n        a(\"h0UwL43Bqh4Dl0JOzoS9SmSq7WVa04epXhs+4z2a8dKndK9s8ihtuskCEwshF/lDhfPyC+cLvY9t+0nvY97SE6H3Mc/Q+8A2Mb\");\n        a(\"sUXwKZ5iSR6HppsJs/nU3a6H/0EqzIpEe2kr6kQ8UwCoIDqN22l3C5sBR6Ik1fYrH+Iie9tnCesQnkJMVKwKj3AEj9uZBrLWti\");\n        a(\"pKVhJgeJt/C9qUozyfp+MBHP6QtgrwTgLoQMSHT2AkPpgK5qnwxh/OnrPSFwCDRAFzlAhkO+JbiSKn3zePzPNmHbAugkpAgeAl\");\n        a(\"zc0yjenDCAI3NpM7ltT2/UzKEJFcyPpZcF88zfNv05P2pV4wekzElXT/7x/RlqS4R8Fnkl8laxRgV1flMH3UeE4NEu0DeFEeYW\");\n        a(\"MG85NG+be3qjtklSnNt44yGln+Rw3Nl3E8HKnPT4dSt/XExL66JLR/DBLOP+avQDwzm0g3TTq+a7VpL1A3jfpS1A2kufTXzByg\");\n        a(\"lZmEdRaKEs1PEBpVSVOipgAXY+kJPetWeVwpEokzPN14a+lp01H9VJt12CAiDdyT67RoMXTyVAvbTIebxOpdmas0qDVfO7qgEL\");\n        a(\"AdVwPQI4ZU2qrZrnqHKjbbyEAmU/2MNlqAou72s9q5QN1niBPZxJew5ZYrpThnwCylZekAzpH1sFINqjnKpACAu6YZ8f83oaZp\");\n        a(\"6PyBD7FKDwQegvsrEOLXmPrjK4Z1v/ujrx5XVrX6LDQlLFQFAkumBHCkj+03yFKE1iueFJoVriKuCEdzI5zE+LZEam0N06I/VG\");\n        a(\"A793vkf4De6+kLHq0HduD6qgkVLQ2MeHCcA8R8WksIVUGt0diUtpvAGLow95n9OM+VaiiLqW/NgbrXlJHA1Gi1S10R+W4uR3z1\");\n        a(\"/Ncyaky5zdbV64I3O0qtdZL88Mp+q1fb0Wmdbr50gENpI+p6NP+ENDktSXPwR4CQDUAbTFmiMIZ4VSsHGnmCBDrUgGArvJCQCW\");\n        a(\"PmqQZmCDqM8gmThg5PZFF+LrC/+tnobw0NrepIBLLzgPBem8Q2mq94n0meeRPnPGYTcJAYQnoPSk7POZ91PdA3PNq8t56k4g2j\");\n        a(\"K/XTyAsVTBHu3+p4wHsEIZdc6TRhRbtzg2tsTvVYnhMupeowTQ2Lw7Hsz93B9c2s0W/N8nSzLenCjd6FrZqx3VPf8Hvu+QXcfi\");\n        a(\"G5UG2P1AWq3baTVgdcn9tKZgPVJcEQ2+PkxFRi7jcxXMivLhq9lHZ/quM33ON30b94L9RjT2Anke9YdSkvDMrFfiE7I+RF0G4L\");\n        a(\"hU5oyMwc+voogIuApedNa+RovdWeTyfh725n2x9PfUhaJgVlF9T1+3cH9oqfUmZKc3vKH+9HsegOGCyGh/AJeOSc+R8UlPYFAr\");\n        a(\"olk+JmynIvb9V5K0AG2+bdcbxGkutIoiU4Qy7rwq7E/dSH98CadruUiMedbx2JE/Pv28aZ6zqqDmpTpKCQzUyenxlsMeBteDBr\");\n        a(\"4T5PrQH2IpmYlOx9qnoCuVXNFOdRfz4XYmSatdhUCVBxI9g0HTcy5IsuaM//77bfz7MvyWHGB9SI1/nu/Gj1WhApvPBKH92EPa\");\n        a(\"j+/CU5UMU9U0CTU4i0Xc9AXoICfh0L5Be1Yjhp3E/hzM34OpAjSl3cKV1SFsVaUEBqY6rlMLyU8mpW+NOuRCekAupIzfSVbmEL\");\n        a(\"62i36EuB8Sbe32bEge6ICSUounb3CQ+rh23dv38JdVbp88oNsiaD6qP1sE/55+6s/XkT/CKX3rp047JpF+6hPXqkH99reo6oRe\");\n        a(\"h0U/tRHKbNw/pW972QPIOY+9DxWywjrLILe++j/Qt72jGVV/NLnv/vzs6ET92bpI9Wcc9efnB6z96f6t7E/FeAP0HY3Cfoahb5\");\n        a(\"uu7dnn6EffVvEjpK/D2ipUOh2qtumGqu1UVrUNCz3bdMjLz3iZoHgd+gksOLGTBOKhGMOKth9a+QT28yX47MTCGm4yrNTmULe2\");\n        a(\"k/Yrn54J1n+kr/XfKOZHE/PT3Wtf/1itcul3TDCWPqaOVv4tOHEplXQhClDMDEQJqoZIIZh8gkEGGlJ/Cy69kMBLU9aUvlPWlB\");\n        a(\"4A+dD5gyfKhS0mpdtu6S3++0C3X5j87ha23ohxrRlC2hrbetPYBIyU0e6krUhm7CHLohQnBa81ofPaTTqv6hlB6byyzKnlkYHl\");\n        a(\"rk+9B6N2yFTMkMVg8r9rn7Jq3H9hzyS02B05XNiZvD6dLUy2eqCpII0EJO9BAAeEj/uyZ4IVI5zdXXgEmyp08+hA7V6hnWqPbb\");\n        a(\"Ff646kUFtKL1yKWTh4599ugdlGn4Hufh/bF/L68n1uLE8Y50Cr7sgkXwh/B/Cd7zz0BarJ5L/El9cU+MaXf056gPit6aSy7MVR\");\n        a(\"cIB2yxEWO0Dx1sfQzv2w6vzSc2qJ2OwdSdY/8j5Heas5b+3p9+CDkSK1ASEfaAChc8TF8Hm7EZFOEQJDhskoNxuR+0TH78UC75\");\n        a(\"RUvh0+D7V5WAL4tFmoRNrJC1yLEsOoxId/E1B27wOUgWNhr/D2F0z2KP/mxE/qI/jhmSGfJK3IybAPfQUhTWzLzch8PgpqNx4m\");\n        a(\"GpErxM3gz7GAH5/+/HFXAvn9oQuosfy/9d0/5JlOeQZQHmmWfOihFFOnv97eFpWBhy1Pevb3xVT3XpqsjIH8cwhThRzVtEVeHQ\");\n        a(\"P4NDLChGMYRd/bw0U37FFFs8P6kGaSRaUTeZSatHwdoJsVQPHtsaGFEm5hHNubatSre4OqewQJVN0OED47P1KREFaEeWwUMrNq\");\n        a(\"VoHr7vUVk7Fas3E5ID7IbYfGJLmRlCmkg7QmeLANQxY15kbEvkp9+ee6A8mrnety1OnIZH+F4w7eHmWmtvtQnbfx1KH98zYS6X\");\n        a(\"9+0RtFIEdLRcA6dYnlG/k24QdS+YNvaKOonhDqGUr1sM5QYCIWStUzaqHcvJoXyk2r1UIpzBT9+WCvvkBKUECbl8m2d0gNic8Y\");\n        a(\"GkTh8ZGNjxxtK30E6ZFwsVg5x9LK6VNCEO/7tTdmMs+UDEHPcAM3+tCv0dqFqbjICcjD+sq8QbcyrcbnRlb6wt4BkEGNCRtW7h\");\n        a(\"V6271E+d/C8PP6AXLAlEDcC5LFfuPKz3v7knew2VuVYiz/rt3VMOWUpCYTv93c8Ml/YMG2dt3Yu7YckEh50v+NHfNayJpplxzd\");\n        a(\"tz37EMCYmplIHqRNu/qz3gT6SGabAG2GTQAaOC1VHHI7DBHsLuKJyP1EKgp0aJfu5xm9lCN5ozwGwQ6kZ3HzLmEzoE0UwiidgQ\");\n        a(\"MV7Q3HoePtjsAoHbdX3gm0XTaK22wP03Bw9759lnk13NaI/QIilOyApbwKDDNXgnMeiWd73MLSauVpOJbH6CNprI+kBZu5yunP\");\n        a(\"8FIRI+3LJCQcCNZf/sVa9WYR6cnkrgTyZK/S4Ztfh/PLO8hfe4aySGJY8kAE/FMIeA179i0wosgf5fhY4d3B3A21tuLbAwxk6q\");\n        a(\"0todZ+lSEuO6hXt3bT8Uzf9lMVPVYk0GUmgahH3EFOp2sHj9uSKNQMpgqjBGSPgNrB45bmXi3HaugpPyQ5aKg+hrwgzBHgvsA3\");\n        a(\"lZ98qx8ML8tIREclMbf3F1ThpX2MQ4PF+Yz3l9XKpp08/4EG5QgDY0NgCyxHu/5pm3Ux+U/kTMY1GgQrB/RqXWJ7Ejmm8U7/Dc\");\n        a(\"Z73wge7xwx3jk03gt5HC6xWIuw3Y82ag8Ukl/EQo8OlDW9WqTPiJveOoMNtzNMFROobe2dZ/lymMP4OJyjpo9k+305cez32ez/\");\n        a(\"5ToqpqBQrnarqCeX6xnDUT+M4HrYce+ystIobetx62P3tR3iPuaplyY48kgSaG0U6eIx44WveqPsC4C3I98oYV9lhGf5LhyKg/\");\n        a(\"AkIP2+Mj48wj5/MYyW87brxVKPtmOJYiTZ02dob/WV3gDzrdGPeqMy0WbvQspz446cSbAlh5Z4ykOzPcGe8rxmWFupL2IbFldF\");\n        a(\"DRsW85UNi9G9IjYXsdKGheAZnI9TK7+1t1PnQoUzmr51L4O0Oz7yelStp8at9dMDfdSaJWu1W8aw84fQdT3COl5EhrUd29SQ2P\");\n        a(\"1RcPnaBaW968zfvlJnHP9whrV/eGwPDJHL9f40QChQ9vwwoSoRlKKGBVH4vdbtqeYQLVn/BNlZ7+FiTYaSSgGkwahUUf4Cd6Vb\");\n        a(\"lhey/1h/EP9f+pqZgNj5Z29PV+hghxf4uhzHx9qZpbgJ1paVfisgPZMuZadRa4r8TRbkj/1I6jC7ATOg9dTzWeWhqKB9H8XQNL\");\n        a(\"O8Pcvaq2MwkY4SrVfYB38OsBFtvABTjBcnyAQ/ezffQs8yWbMPWE3iH32pOv89WwvqNDTisFiz/z1c3hh65odjXfIalKYL4VzB\");\n        a(\"0NWLZFCiziYGfRbR+AIwGdhd5ZT+BUFW09McCPGxUInBSfzwrIvFn9ds95VVdv0Q5WKBBuKX8jEkdCe/+/3Ul39JZmCu9BHxQr\");\n        a(\"Lg4XiNwUEV1sF5Y74anLtvpveNLuvgVC2n8+XuwlIW3z1KDNJYGiA208HoqMaI6FMC5RDLfamdHJ1AyIjKLrIxyvvi916nMv43\");\n        a(\"/KIlNn5Rq2eO02ByDaVirGbrx0jGspA8gg2QZ2MhhRPykL6vxXl0w2EWHpLt/YxsebiEroc6b2CbL2KfxVW5gP0qxJKrbiw+oU\");\n        a(\"Jynng7zwWT8v7HWI1Xfl3zZ8ZKqPAKtnZxKGUCCIesShwIDqGq8ue5qwZynfPcLOsDTZanfA2zcrUnv3Rw+xUOLpTJYzMrk9bm\");\n        a(\"M/xmwVZG7tGEAbzhJLY6RICv+FqK/Kj53O0pJd5VYDBdii9HyMjbF/8+MonkXHkTb/0LX5Tkgtuzm/mYjMrc7gJxLtmszhtx71\");\n        a(\"tAawbBA/qWLijbyQZRYw+eR7P+kaG/hKYh+XHanwRj4FkkwTvnl+VhddOync+26FPZCOhYEVBFtSNqtTOSlNOoAFXyZaZqilvX\");\n        a(\"OyT5KxVwFodjqW9eATj40q9wi6C/mKDwo8yxLg6VMC392e1EKQKpJcEdkfSivN3V7wrfO1YTkWgqsT24DpxipTfjtxFU0MfZX3\");\n        a(\"Ma+6lPjcdClnWfJd8YIRmvaKy0b/sjTzQo65/QrE6VhgoJEcR6IHJh95SpwOujP2JtGPlRHQh60S6DoN+HZkUbiN/WQyJ8ZxlA\");\n        a(\"vqEDGZ+DG+99HMvIx1bYZvmEexwsPB+TiVwsZrdymeMeSoblY5+4/w38arPjVwJ4RtvhcQOcwxQ4TW6+aRDRSH0pyeOoiYXMQq\");\n        a(\"9rl6BSN5vICXlE99IjqWuiynNtv/ndtvz281q884N2K2dsoZuycnaDDNYd8Na5ageM3EDvnZ9Zd8DKpTT53byN96PPPXTVF+Bk\");\n        a(\"/uMpxVIwv8/GeT8rIfbnr6jQ9SgEZOTXgn/+ic06f+MEAfqZdCdAejw7+B6+g/3raBOZCHnZEaC8RzTQ1U+7cmsvve1QmFVwhg\");\n        a(\"zmSXML/yXkLFCbtJRkxAI72C4ImJY924lpeZ5kx0bwBQbpdvzwzvY4xgfN4kUsh30YDH1TZFjHP0rVpVu0MIZaaK0kWmRWYu3S\");\n        a(\"3mWIkM3yMJdgPEtpaG560jKedv8NBPYEynv8k2oYH35UDeN5PIwMk2UcP3qEQPGkMy//KHSQIttEZKbq1Tjq1Xc3yXF7ydq3sy\");\n        a(\"Xz3OKswdqfGgyZ9sQTqj92+zZL29GnDhzWuF90nkE5H5Wb/YTqW+sjqm+zYvk1tTAzhPMXO1HDGYb3R7DScQTAKsaSIrlHYquY\");\n        a(\"/NmMEf3SqtehX0gTfSqM6iwXsJ8AFsT4UafqWrz7zbQo0OnvnxM6zQTcqxHSDqPBLOv2AVofwD2RLMuhHfouDm4L7kS+eso3W0\");\n        a(\"AZbZc2yQaUh5G/+gM+//TYCI2dPyzHCxAcQxAEDl8jV/a5y4TtkAcfZo/pg5BabvD6JzyIZX92stAyQi7xujnDLbmW3fRIFgb6\");\n        a(\"sDhiWrn06zH09c8AsgcV5nt3VE0QC+MZirvtIUKFUi7PLLsnBvACbEWGMGUYLAudKQpVUtwFXGhup3hVmuEOHCkSL6XE05CoQ8\");\n        a(\"JKVTcC2sgkUvEQufIo1y8eQ+RITr8Q6dpy8jR/KVnd6FvftkObmpxIP7VHnqe1Fjhb4qMtfNqHLhOUh85rTFsHOVhFjY3B6KP6\");\n        a(\"/kqMasFdguMYFsdgN7c4PYhIRswkRrMro4DbTWxLNAJ5CDc+neEV3u12fbbUrE5+tBnT2f97j8IHlNM+4XKf4kc99gj1STdg4P\");\n        a(\"fZeu8O+f7EaC9bt9ozueStft7fOwV91/AjAHjXIBSenF3gt2HR3UeSdHntFeX4JKKLGe+uuFDcQdnfNXuqdEcgCin8ywAkTz3b\");\n        a(\"3pIenUenonoRxkmHIVv/Hr+AsCodbPWQasw0JHvSW7hbJ3MdSBUQhgChnfja7eFeDUF21r+6TARg3xwBNQI2ewasb6XUxFHgJh\");\n        a(\"Swq1rhlkXXj12Rn5K7iHPoDeN7Fh8ArFcIpXcBwZDl+JCErBOSWXJbzxSGRjLm0vLN7mAmgc9V9L2ouSKV3kOe5J5PjuobONOw\");\n        a(\"OPRL6XFguqReRqm0l/D3qUQhR2/rpYY9LzpQbQlnqVmCi97RltzA/O2rANAx2ISDLXWNHtfdrZhXFMqUOT1KG4+Ux6A1UrahuL\");\n        a(\"bLaVRknEe1E7aQ1PUusMP4wJJyhsjT4OsRz/ifASizVLN9fbdpsyz6Vbb3j2g/7xuKBvjxrNHi3eaQasfSOjfw2FW3X/eEdPtv\");\n        a(\"6MDK547lCOatc9V16mmLEYGJG4w6nF1vIlbR4HlBjNk6iHIRGTBiZ1DsUyK2LezHfPuFSax2mtb1gup0Sr3QNopbLdpqpwcNPp\");\n        a(\"pw4wxQG+LaVFzeusBJtpx4shW5QGcRz/bFD39YPLikEdiRFPwVu+PduhWaJ/llYpv9ZSIuvX31QOL3NqkPi7HWaJxj/Xqfe73Q\");\n        a(\"iX3jfHwSXZVMig56MzIEiqTnOo03MUwSt3v0xfKkcpXlEVvaHy8/nbfG6JYkno+t2FBqoYuP8FgKP5YPovNQGEid+iSy6AB5QM\");\n        a(\"i0yQ9y0ZO2ctGLKfsSyp78IGW/mGpsTb0D0fhHwd9yUPVq369RyZeruJJLt6rKP6f4DSL+bFGLf0ts0UWb+UX3CvzIvmP/Zleq\");\n        a(\"y5o7RZavPwQ82fuoKxmf4nqIqEMxjNrru23W1+znz3a0p+17UG2RlnQPpW+1pSt5FGo8cppKt79nBzTsT74PeX8q+NC0P6H6c6\");\n        a(\"n6+Q+qY1/779Sx75hW73469oW8+/k8u1+cZ4f+TjAn5qLL+YH91Z0868cgIyp0UIX5SEH4hw46L4twD4WPQnjaJphmPfYTHqY7\");\n        a(\"CfgNeVQw9cWNScxOHBQauh/R0fbIAIz7HoY3Xevay7XcQQU+QhiFz6LwtZt5Cn6J2rEbPbynl06HIaRAHgj5b6Y8B+5TvtNy0C\");\n        a(\"WD32LqF/KeT3mn3Sf6diPayL94f/U2JJxOCQsRAfQ4DmH6R+9tFH2uiD5aRrekXgp3D046b1J/k1epgb3hPjWwUwkKdZ62jO9T\");\n        a(\"9woYftxjHt+vDvCQ5VC9N73LEDz3AY2vmPuhH9DHQ7kk4ozR/DO+hPyNJwfI/Tt8yqfSbPDDmHqWZ9GdD8NViURH4E10oxoh48\");\n        a(\"Jxj2jwaap37e96ibAOw/c19H1oLpW1XFit/rbV+4RExn/w8xPvPsQU0+bcJV6ksumhUvf3gzjehMpJ98/1Gv5MdNSQsf3migHl\");\n        a(\"y7CYotWcVI7b4tH4UzGw/LhodYUrMiZsXMMjF4fLEc6ODojMxt5YvuzKCdmO6aLY6W9HK8eiXPVon+s1euTZ/aHv3SvRHhVA0S\");\n        a(\"yVLa389N4BVYN2utypH0I2PzLPt/EXyBh2vYgc9CqUA8H6k2QAVeDd048gb6ED2zgeTxtjEIHYtXIwanwD2zmpHLOGH9Qu2Doe\");\n        a(\"ucEqfoUcriYxNIZZh3JqgGDIktTFnj/FnD+kcvZVf7o5v89agIJtMfkHqfz68+JoXegod11c+Y6ig/Kn2xjPn+6QXcAJPs2Rz+\");\n        a(\"8XihRD5c1fgM6+0u6wqExMvpLv4dSGvGul+4QdOMiHGL7/y+Z2a8vGWiVBCgQH/jSbJEh5OKEsyA1oUzsvRcmCHLz8Zmj2WLz6\");\n        a(\"TAIRomXglM5tFOODj+zD4JwNsEMK82tm8POT/h2Qqe1f1tM+307z/LleUPNteZ+WsrrQhBqrLECa/BfMs7+p2O1fvZbg/JdIf0\");\n        a(\"a9RUHDJMcQMhZ+5mVf+fl1Qvf0blfdsyqWYS6obykvCnaXT3Q5XK81BtP+zD47loes2YKtUJO/biZ02mx+RTibNNX6amNwQOTc\");\n        a(\"sNkGAKpF3OlGnAdxiCC9nnMLFZJO/DmQNHODFUlvuYJoqNk63gJhTZTMoWodr/ZG46d1aS8jTdgfwJrrXxvHNF8L1Hwlsues/W\");\n        a(\"Uf+2oqa5d8Xunv9ny4vYsx/WGX/1LnvRaLLzhr+lnUBjDve5fbTm+Qfj7SfVc0uo+hgVM5jPRTkM4JO80V2Nabl152/8hWObUB\");\n        a(\"FWPZ0dwv6a9reYWITak4q6uBOqO2J545ZfsO0VKIfTzdNEOjinjNmEciMkv3Q/MnkpMa8wrUXPINnzPnUVwqxSnfNJdQ3Hcv95\");\n        a(\"p909xBcR8hLvzvrN9X447fCziKAkNVgnV+9iSen/fjp9vt37+U6L7BsmvGnVznckm5AzY3jyxkgjiUxAbIJKIjwbjDInBpWNBy\");\n        a(\"kJNrdhGveFttTzQwGQtNO1MttJcvweg9/aZ1oR1ejo64XvBucz3h3RFZwYefKwaQv1UkaA/09korjBP5qLvDTLrj2/PEotyvP+\");\n        a(\"ukmDEllDp+itOR791fQTTg6zMUaOMJtJE20G6+jGmAMiFifz+Sk74uMV4G26DOSnrX14+Ki54Kn8z8CH6dKajtGXJdJtbBkIo0\");\n        a(\"/E0PDGH7u7vp0BwBL0A0oredZtozgusAe9m70md1GkCo21qFt97RwsKgkdnKQbDTm9OotVbxBPTNe6gnyv0AtSnY2Gnph53i2O\");\n        a(\"v75y5V36vbEtXXv33hDWt6haGg1xHo194mAWFzEINT4InCVxxGjd+FoNHEWCRB0cT5Yli54e/OlxK7x+H0rZm3rQje0JWh5hqn\");\n        a(\"Lfdn5twGftORPaE9W/iverE3gf1UzazjELY54K/tyXDd6sBOO74RaB7B25evLOVmqKJGccbr+krYk46Mlv00l653WiJkP7bY2u\");\n        a(\"gC+0suLPTqaSdiVjqZ15Mk435Pcb8WcSky7laKKxdxg2TcYoo7j+Okwftu2ZKkQzz/L/RGu44zvFXf/gM/mG5hfSMqf4hRXlss\");\n        a(\"0zZ+RqkZlPqDzpu6gNKaRco+6sUWh1GO2BWSX9V1vbLfZxsOnFFqe5IXj7AOHMoZ4/EAIccwY3y1aB/j+pllXOPmctUtAdLYck\");\n        a(\"bGq3E9nr6Hh9emy+9xUs6C9SsOMMbJC6JVXhH7t7RsE8lneJftc6DWqgGv0k8kKfix5Fj6eqCryxdFxeHUN79J30M1rkVILKaw\");\n        a(\"xGIC+6o4X/YYInLFwR+67hLn78Kx+YVZlXNICL6IRY1msrtkZfmwMKtO6GvvyVM0vQSnX82z3krT/3op0fTWwrG8QnCwx/F+Uj\");\n        a(\"u0tWHWu8jl/5ZagXPrsWSIoKTsdUhTaTPreqNFzl+NhWWaYuf6oknf1kVdt5fHcSCGw12PZTDt9o+fO1h7V/bDJ+v//U3p6dXr\");\n        a(\"lq7ui2vpKr7+zt8Oun2J5zYwzAblEKj+WPBD+4Lhv7hvtsW7b/7hK/N986xT1JRfdD75e222TvlLF/N9sygkFJ7U1VAiqWh8Rr\");\n        a(\"a8epZqa4+2XjtniKtlvu3aiXoT3jujaFvb8mOv/d558Po2DTNLtbMBEhA/W6tC76W+KEJ0u3TR7XKQcbtUZwkbvwJdu32pEmaN\");\n        a(\"l16dID3kwxB5sg0+s5m/QfbHlAu5DwOYiLu+tZ5Q4+JboEd3BIuaC7MN8pbXzce0P52s5vfXc1DtVY3W+d0KhZHIcKMCRTBRfS\");\n        a(\"igVmR8/ZfVvcIQbN3qBOcHm/85MVsrvDnFIebkFQsFwZ7ikJMwuDhUQJ+aVP5QZmOFeKDfF7qT7ERww1OuIFhJzHMnQzSWv0va\");\n        a(\"ycZQ6Svi8eEwJvIw10TKMyEqKszm5tBdU/F3lU+2+PIHaO0Mk5qVfTwe16qe5vFYrQUQSDgeNRiPVfY3C9qkk+jBhnU68Zwj33\");\n        a(\"6RC9DxKDViOB6Xw7JaH5Y2rPdJ+u0ixGY0GI6hC3kqV9PSZQj3X87j8zh5MMt5WQgH133rkCWBpOLXo1CJXLqVxk2tlw221LgR\");\n        a(\"cgLfTjlR4dsgHD60A69Y8e1XFwLfxtjqk3hnlF5+NfnT/6xXvICr7CAS5iKOWBB45pEnOreNJ/YMMBEEYapX0573sn4rOpOTMQ\");\n        a(\"9qvu3rVR0YlHvZuPK4Ldi/QfHW0Oom37mh+nZ+eeSH0Wa56leo++zB+RcPWgSU/vGCSUBpmDaW1elAmwk+7w7w05Y4Ko7wNSAY\");\n        a(\"5PNEqMaQ1/LyIpi9pGbpDkfFsSS/NU1N109LMeCzXrZO18sXJBA7stt/xXMeACVjGtp1IqwR0OUI25eDuf8eYX9jEf+8skSY4a\");\n        a(\"jBjz/4aD3/PBXmn+fv5Z9XVh0gAN9SVknrqFUZpEZ5aRTDYJcHa+MATqElIYSLQze4u7YlGedQP+uCn5/N4J8JMItrX57Ay6si\");\n        a(\"szh024TVPHpe8upTEL2LU4CNs9hZOUnlT+/UvQC6lr/PyHgWuzKtewPP85sisPQ1vOa0YYEj0AZJLOZA6JtN08KI6Dyct3E2Pi\");\n        a(\"NJL+WGsilKvUGlBtXkjXLVXeOMm6ad/5V4mG0oHON6YfYY3EHoNRyPmxhwkmpgjNHCt/aaxRzkXGx5jk4Ar/AQBX6hxPvsgPvI\");\n        a(\"dVKwjiYcY0rTL+xNNFAQ6NM2VaHP2Fm0Xtfq6POoRJ+lc7GNYfy6JRwkcb8HTUOiZ5Q+JPQErW2noaA7h8lciguF1hAqXf45da\");\n        a(\"SOwoCnUcCzRsKDBFFzXbtIaFOArhGARqcoQBeXANCzDEAbJKCbocDd9TfKoiZKe/o7APVHEZmtBBpQHnwhnHpp0qvxTfm165oY\");\n        a(\"iMfZRuWs7JK6Nypgj7S4hw6+k5rwl11AoSJ9In7zd+K3Ma7yWi0pe5tEGVRb+kpaiIz+EIf9PEvnA/0aqCHt8PUYXxZRZ+3mV1\");\n        a(\"+jtbELZxpX3ZG0QEB8PFr2GnnS/QkrVIhFFhKLLCQWWUgsspBYZCGxyEK0yNRaT0wfJVGLm96j0s33F9bJkAcPtaEohKxNF6KR\");\n        a(\"VrHTRSa8e2QmpvOGNfp0viqnM3W27XYW976/VD9D2Q5AeM/sHRhIhYPRyEm1vekI5UQjRDTPMyHT0dT6mBetRPPW80haqIcBCC\");\n        a(\"01naOs9HLWY/3wIwIxdwppnVq7IMt6kYDB08BAivKsyGEon5ysoKw5B1AufsEK5afnShmMhYjwuF5oAbwW9WubP+rX/iN4jxmv\");\n        a(\"4E0Lefb7NmoK4vKQgHjvsQriDcWAuOl5K8TH6xDT/dH1oh1gO7+MOXVsGp4AOaKHzesUI147oYLuspHTFV9qFXCMUtZcxzSdOA\");\n        a(\"34Zpt1XpfIcmA/S+F0Ufg3g0XcG7tZQvEVvbEc2di1SE/kz5EZMhi3GbnSeybOx6Uk5Xev9v4W+34Zz97+sEd7hX+r1EdVgbj7\");\n        a(\"aylGDFNUo9jWVh9XDd52JkNSozhbOk0ljvB2jpOrmRl6MiKXzqMy7EZ4Daq7l6vTncvx+fIDJ2J2QwiSX6mS8KM0tkfL9mhHbd\");\n        a(\"dO3yCM5kfSdQajUDiqu8uhF1qzhnfnUwymIwoKdwml40kIqUlUWN8oPWfJgYY/xzV6dUAARWXYdQRdk+sliakHMl51tELGgrOJ\");\n        a(\"v/2cjoxNEhkfmgX8ifWLea90mUdzKnuYC9jfd8honOkpqet1EwPVgP6OLCZ2q2Uve7iXE2RnHE7d0BMyGB3q4Tu07FMJaqHCq6\");\n        a(\"OlxAdYhfFOkT5AvKuWQaeSbbFRQT8EJ5B5la+1mTkDSFfkFx8ozX0iRczIWGF9vUs7JJn1BdO0K9DxsFb4JTDO0Ad7j3WZZBnD\");\n        a(\"Dshc0h+/gWf0XuE/olmJq5S0et9SfiHhZ4PlRN4KNnPO5c1c7PHdnjnci9Ho9eO8Nn79awb5cWqpPJx/8Vssd61jV93vCfuklY\");\n        a(\"BYM0Uep4FCjKMVR8nBXSXmvd2PnGpwKQ/6B6y0+SNl2b8ZmwBHvlcLHEtpGGAHjYEar8+ccrzySmi8RnyhxiswXIiPk26AtsXP\");\n        a(\"eMRuPriOCpekBxrRA/RNjmsSd3/w9WoIj5VDiDym8eNsRYFolMrQ+HzOddgdxYmKF5Qe4BLPBlTFk/S5CVvr3QGqSUW4XjHuSa\");\n        a(\"ax9OWCUdTGsEsKYXgZKdcpQGCoubNjZEEfFdKuWkz01dVA1h64vbEmqE41uuux9XdOBdsK0CvTTro2GgWMLP8e08JhSGC+kw7N\");\n        a(\"ACHyOojR7uL3MEvarfCfoP38cwTDQj9hr9x3qhAQIwhKypuO5D/p4q8QUtbue4kNlz+73MniXf/s6GWXm9fp4ie7PaJhN8hDj4\");\n        a(\"M2wcHaF5uJfrcmE17qjGCmwjmb9E9FgGsIbU5EKyxqKfnI3SqfTqQh9ByG0LJiacn9g3BBijjmSFTrBKrlYuuw+zeJZPD6FDxy\");\n        a(\"imrWcsEPZ5L1TjfvfJ/zx80pxraQwxREbRGdsY8pPZIe6u1jHHIEVnRTjwBKTmwBh4muRtwMj3QjffgeqadTJEDR+GN3sjzwDp\");\n        a(\"OKJYaKyhBOv/U73Qar3d8+M9fKXdWwJ6+OhWZuSGpgHO3u62BIKCY1nXDcNaklMpySaVXs9LmObaQo/O8Ol7uuQZ38XIipOPj2\");\n        a(\"XIFjbIdTFSHlaFzZMLfF9kbx8T2aRYQru8XeqIGvG3BpQfmzzE250ZSMVU2pCOnBA0+nGXRMmibcXUg5BmUOg3Ht4Ps3PJCduH\");\n        a(\"+Z+sC6qYPk72Vnn+Pa9/k++L79iN9a17inwgXZCbw8XYc/aXsqnD2Lx3DG4E68qFJ2g1ryKXVOljoYZON9XjvsCespNQgfu/aj\");\n        a(\"fwL+rQ0w8m1x80XiUaxiKEl1ZNGfEyPFYVNeJbzTEplvjpcCPBRfpOLlDojI44H76EpwnOrKxWegK6V/sXblVS/bdO+Ozw3uF5\");\n        a(\"9G9IdPPolPwwifPmU3Bo02RLLLbzDU2neajUUu00EYNlsS4/Ovr14j+dev3ycVNfzPyhfxhz9SJ+o45+kF4jx9L1BsFabxcYFi\");\n        a(\"sRxrpbDBNU77SNihW5MK8AOETAMOVzOwdTrJaz9unYHpRbqRybWZ1On9V/ILhlbRTVIA/BL991NNL9Hc0tlg2fAxBKOa/5EoMG\");\n        a(\"IUeBlH8hmQ8xSa8oyWeb7NQJ5ep253sfQAPety7okfqdxdEDro6pCXnP3EIZCZPKZM6ynT3/hNnPNtNuXr2aby/YHyhaQv5mi6\");\n        a(\"626RJcNU1Y3bBHTnEnQLZLsn7TPVZ8rsp/ryVbt/wI7tym7jfGFTvgmUb4TKl4J8ICdNnPFWU8Z9W5Hxn4Ytyin7TPkeMOV7l/\");\n        a(\"I16/kQ26nlHGJSxKk1dfoxynuPKW+HttwtrgKc91RT3puQN3KVzIf3jRGcr53zXWPKN5vyeZWcMEQPgX2NDnG2bQS23WjCtqtO\");\n        a(\"o/fdx3Rsa5HYtqHA8BP4rjC+gXM7EDwEBOelb9FvWnkPr5Y1Wp0IPK5VisC92mIRWKX9EgFjIan1g8Vu3EWVehPf7UwPHPfK31\");\n        a(\"VCxEq/m3KnzXfSbtOds5NSjAcBvoIGSN7eeWcS633o54eOtczL+90yvne1E3PibJoCrDXuwYPgyeP7Xr9QdOkAF6+kTBo45p61\");\n        a(\"P8oZVjEk/MKA9Xk3pmGSuZqLZDXmXO8jV9dOcf1k1i0AkA8b6doVG1BAv8aGOf/1GxnGNurKxGedND/rsJTpWPlEkn4HbMNZko\");\n        a(\"839+7gU0+bwTVuJHZuUk2uKzBCmEMDoVu8jatsjKTraIIkQDz0DuK9XNZGh9aA1xhw/Ma8+wCfJo1R+HR4Lgq5H7FSr6oz5d2m\");\n        a(\"keal61ZMut7L2rdtvQy3G72sGOUX9wjh5/6WZCz9JuRRUytvNOrBGKXN6U5Rcw3VbH5wd628ETE5m2gMq51iDC93qjF01V2IL8\");\n        a(\"FPiIAnPFPwIMOE5uL9aA80c8TRNJ38Pxai52lvM0v7EBFdmsVr4rs7xcP1GnPzgaONoneHiQscgkqkDMsmtNz7pdVwug5wBcG6\");\n        a(\"eVHmbRMbh22Hgw95qNOBhIUiYYGR4NUQu0TELlKxYfl8WI/prhGcjgaqDRPZOVpN5JxTSP/uYX0iA3Iinz8doJa+D9w+IxzJRz\");\n        a(\"W8FGvW8ExUHC7qL02PcXOoCTO3qVruGSg8ggo7BW15UYjPqvvTGro/5da/63mBNflyAStd0zsczDCagkZUNJDF+G7wPa6tuKM3\");\n        a(\"yl8tntUOGXjOUT9/QpbIU6v5WSdB/yqlr2xTffWdDlP9flqi8huMkk6ZUNpt5BDnGP6sWbLaUTG/ZslzjsD58SEMAcI2qIIRDp\");\n        a(\"yoZ+EFcPObvACsxbQVb1PZOYgMzmgLczI1UDHJlNOn4I9Zlbh+Ao/1O58PxyeL/FtY8gvfC0vq/PJmScFn/5kDjdpF4g27TXsm\");\n        a(\"rAi37fyTFeX3OsFWfGUe/zwPJKT3uoX889Qi/nmeUNHsRLDbzHZkGDIBg6L9ghgpk5C11W4HyyfdmKHQ9KkTgaarHrDSm2H5gt\");\n        a(\"6MNtM92PMpWJEyYYpzeqbrVg9uqROjwkeq43jTwQnjFudyMiCwQPcs+RAcOyC8n0lD3WvCBZK/zLtfmvd4dhNo1KQUJo1TRypQ\");\n        a(\"kwjUH/9oBbXsNBCXvcniNPMl6vaXNcqaFlJNnyQbZxMfLLpB7FVPLqbkRlnyrdi04yjtEZm2QKO0F/W04ZRWL9LQkTatfSfrkr\");\n        a(\"eRTP4Pb5Do8X6IHvNYXzXCxP88AR04ydaBh/JorE0D8MxG1J8t236um89JzTLtPQ1pQ0TaWqI+2olwEEkNh94kdPcNND88xkxE\");\n        a(\"KcBQY+OnRmjviz9fQ+NcJmHH9gXMuKxgXwQV3IwKWBlXzm3LdxgJdm8BaobThXebJBLebv0ZPcwarnvYu/+W6J2UtWbpNmwXpw\");\n        a(\"gXNunYsAzH/4Tj4iRSyJIsUiJrcBJBg2gByiICZTfvPcacVKYJk6W8Sp9u6CWwMpnIjjdx6ENZzhho+IocJm63rPqLLagavABZ\");\n        a(\"b6O2PZ254fowZnyO9EojfY22fACnr5Hpl32C9PlG+iotBRgK0FfJ9Lk7kI4bS9w5uO6SWm1oxUC6smZHzisP22ZEVFKCrW7pO1\");\n        a(\"KOtI882lukDih0B8d/iRXTJkxUeoR94g0XKjT97ALWZt16gck+sYfa9minPiRdD3xTHLw+hyalOHiWuzhYlakP++vfiqVQ3DAr\");\n        a(\"W8u9DVvVz8V5f+x3VFQftmHAvojPOGMXuF5ImQDeNohVWB60w1g83cMVVCmgMdoHv7c+Hlx2CnZAYa+XWYqCkIYEIQ0JQhoShD\");\n        a(\"QkCGkIhDSxvReQpas/jPatr56a81tdDRV+LAw11J8j6KvNBT/SYJ5egCd2nW/a6vFRPXqtFvmvFXKvqBOBRq0SASbqi1ckvj8L\");\n        a(\"eZd7Y68B7QbpV1uBOv7HPYx2moXRsUTarI9Y7UDb7ZjkbfZHLJaDzGVu/g8vRKNASClq3CS2U166wArbA0DXd8qfC3Gy3fz0sE\");\n        a(\"2cSjkrPIbWtiUHZ5RKDgBVwwO0NdgrOJYPfYC5ivzasDvT6eQzO948MCl1C5ziMagM7rv/LiwY1JGMkHyz0Tb/slcIddyNWDHi\");\n        a(\"Tpw32ZkYf41AvHzMWYPeP06NK88S3gZKpfn6e1TIgN2EWukGYO2r1Ndn+/LqWSLdFHaTPfi7DNQadL+BWgMQBGpB2AhZnlVZvv\");\n        a(\"qDkWU7guIkj/7O8EXGGHrteWRPCqJanIqksM4fNtDU81N6LFiaaUs49ULm75oZynq49pzSZJPN5G6dO6zeRGSEeBdJ3X+nAfU0\");\n        a(\"BfVUBHnN+GR2nzIAfTJmXL1r0bzK9thE8/QLWAHa4BjnX9xZvRWwGvIZ2gooVkfAN2P3vB/hQ6CpeJ94hWTXtK9OQL7mNxEU7/\");\n        a(\"coJqaM15OiEXZ7JA/0Sv/cj0p7JG/dksgeibSfaTC3NLMDaPXMb2esgpdaMQTKNxXgqo6sSAqU2HmqbK+uNjrSVfc8r49RDNi2\");\n        a(\"Z8SMA7cZPj8A1Z0trwKsXfVUf09tzyGo9WjUyrwAo85FTrEEperQBvQ3ciFlzzBl7zayL5EPCzL7J4/0ChmPqwcpCj5jEhDx5L\");\n        a(\"utx5+Hc+Sb0O8w5GarnWr47fITl9RJ7uLcOjkROx7ue/zNYy/H2joHvEcthINEDMgeWJrVRoJ3vHg+xRKvD4MfyKNeF6wZgtwx\");\n        a(\"Q7VQDhWDcdlqMezM38ModF2J7HLOYgY3cr4u1LGJxYcQrttEt9vzeIqGiruxkkyBmEflUdM2hWubIR86DK6R/Ugt90LHKj1a7g\");\n        a(\"0WFffmtVd/JnlO74ihNA2jVf5/uRy/R/8gx2/I8sT4e7BjOGFrvDH82CHGcErMGHZbx5CH7cinMWx1yJEIKbVtD9PZQh/Dlfvj\");\n        a(\"jGHXn3ppFBC5lSJ/2lO7z1l5/DRlRxN5fnysl9x5skxn2TvlOIj4MZ5Bf2lv3j5FT15LgJqJ5Lk6lLyWRT61nX9esYipqrGlA2\");\n        a(\"lDQ48hgng4jlJ0OCZonE59yz2CTTQBRTJ8+YXpFS7kcFMO4X9ZZppI/TzwtBCvDO7B0ls1DSvx9y8xq2UA5rbHyDsep2RN93cZ\");\n        a(\"6hZHsR79dKycL40kskp2s6mmc7mmQIlxnJOOn6T8qOSRaEKE8A8piiI4jkHp5Dt0ivCypAi/gS8yaRYL48THOZvIrM0+KXuCPr\");\n        a(\"Rrpe5P2h9anFNStws8KbY3e30SLnBTC+DD3lv3deX5MfZUiZQWtST5Q1nSslEY4853qgvW8hiNQxjwXZEDcH8hooZwVn9wQU9k\");\n        a(\"ahjevatftNrNcsBuViPLlqbmoKAvr8NVdzlatVk5Ndu/2OkaXmQy/wQH9wyowzeefMMP4cuUSGrSTvJNjOKyUa7zZLKU+Qhkd9\");\n        a(\"3dVB5CSjnOJLddSixy2nxhBmNAhY/vEhDozcZVaiEltSKjc3rEJe1gAFxYsRAtZcfUWtEp08ORE8rDXC5aHTmGyyHsmC6KbNRs\");\n        a(\"piyykWf5GxXp5cv8yFcT5owMIVkKJUvq0uBHWSlRJGA64nLkKesniOvD/kV5ELqn/CeOJYx0p02eknLG5k6Jk9u0njlzbIn0OC\");\n        a(\"XE+ywWMS7rQglbmwQskoU6hEUMWzn1gv2/toex/1mzflKLU626h44ke1YN1n34sEkHaw/j2g97/0f2MC5Hm9qMpt7/wB6G/uUw\");\n        a(\"jF8MNYxfdHfo2kn3PNu/7Qvze+gwwrZzB5vwII6/zJ99g8++MCe+vuxfK/v0lxl/P2D+H5FMQxXRG3zL2Ggh+H5qsGcofdR79z\");\n        a(\"Mzzaz5zfDsbmV5Ihf83etj5eP9c5huve/C53ut1vvSbpHHF+ypvx7E8tpZFL4aYaUfbCfLfMtWpvxi35edKNzn+/L2gbZEla7t\");\n        a(\"sqb27d9dqL+z2q52+0DdR3KqsIevTFLw2NgVuu3+7AeyfDr+RobSJ9OmUweanXUkkHdpAxXYICFKpZIHUB5x3xFMG8G1twqUyP\");\n        a(\"Io+b1rOPYyWdZFZZtQln1lo+zJVJZL9W8fe62bSteitG/NzAtvyX3/9atO8u3+0tf0z8FU1aGoylgFqv2d5vaHUw0FVIMOwPa9\");\n        a(\"dgDs5/NXb+xXvtniFhKTxCUfOQGNicNF8bkgVJtvEbpnhxA4QwmcZ7HpddG7pl7kWlXkfVK+eVAVkfNWTUUCpiJnqCLrqMjVso\");\n        a(\"iaeT+KRLx6/mEq/2zKf4bMP0SQmXGUOZPKIoD3uwHcEs/XALlwtmFxWMSsE/mz6a2pPAl/q6unUq28Ca5NI0m0CrkR2Rd81zX0\");\n        a(\"tazXURONVh6FQBQqFdWHUvlkKv9rlHe9yKYPXuvB1bgQWWiDrjwSASzr6uoxlDeF8s5CXtGB9cgqujaCEk5OM7q2pceEPzb4q2\");\n        a(\"+YbEDu6AfyyMUS2hsUtG+lGtAOJxBOk0DeoID8c6oO5DgDyFGUEE5V428GMoG/6W5sEMbbYtWhxlR6VVW/TCVaYKDhZHyqmq34\");\n        a(\"f30s/ifQN9cdUquVoHP230AvC1427OmvdxYFO4M7a3vGXZ/cE0l2Pdy8+AgvG0XnJreuFsZ/eH5RksvsH1fZIlD0SUQJf1Z2lX\");\n        a(\"GFkHZ7pPoA7ZYDVN2zjFXCqnl60wjO8Sk0vZV9T+9oyjqEsu5K1gnzlbC+ARcTI4UvGUWcDT/XOf3Y71h7CFX4KCqUwKWFqqEQ\");\n        a(\"8a2ofihXf32Gbs1jp53891d/Bs8/1686L2p/+keufbS9dobfVr9d/6NB4Yddv5dtXVnoYyhtYtSFWb2NbFSQvtRixLKFoioZuO\");\n        a(\"0qpwisrNSTPtcDu/TA83ogxSkDozmQrNeTWsHWjqYjrWL2cRF+N6Z3hS6XeF9R+J+EyBncX+mvnCKm8fDiwjlkLZ3Bms1Hj66R\");\n        a(\"+ENp7X+PSSulNPSS035AWr2RlElJHzlknUti68ylxEZZbizSIJ+kp2VT2iMyLQtpLGskE7Mo8Vbl08RjSc8hpP1lubEnrQJMvL\");\n        a(\"Q4XXC72FawvPCCUKVJR9IO5Uj6vD1KC3fqaNJvqtXP3Ovkmfuxw5Wfua3CDgbb6FLr0X4+kQYoyPlNuvan46JRtiKhziV9+3uK\");\n        a(\"XEo0IbifzslsXGJSc3HZel9e89JhMGjBFiiEvybD+oSzuQQZMEIbZsD4xKSvipxlY6mIs4XNYWQGhqpjOB9Lq1dZDKTbzs/1MT\");\n        a(\"cpZx8n6P7pT1Xaa/QTTkR4Doq+/J/uX5WPxtiH+EHhwpEZwIXjaqz3r98f1rd9CM1iH6LFk+P8X/im/Aptas1/+0/uXzXk/mUQ\");\n        a(\"G4O4Fl2VNODoR/u9byXilzmciew5XHsqnQe7E9pzUPNXJP2F9j9/iyzzR5feHnqaUab33f8j+4+Hkv3HZ/sdbwyrD1wkn7E0Co\");\n        a(\"KNcPilD0RnAQZiMONNI9/QzNnn2V3A2PXdjrg6gb1F8/6zYm7/tiU6dPtVs8Xo+LmJl65ijqUHzEM8l3GU7xqmox0x7xzdQkNF\");\n        a(\"Y7sSnTJJqbsK+wJRK2209GfWVf+P/lwg+lPKTUSutPVnydV99YctyH+oPYawrUeSR59v7VNifrKVSsbzh/T446gS7oDV9Md/34\");\n        a(\"Y8+oP92+MLtgt7GfjhkerQ0W/aFKDfH8DIpvEKC8Pfc7Wo0u8y3pOD3u38rd4Us0HfYrUg3frT6EXKJHhf/c9U/bfo//7qoO0J\");\n        a(\"LfuM9g39WezugLG1a8EsCckqMTUJ9Hevrv132kODXGrNLaqx6XpjD1sbi79/x6BRm/TCdQ7tzQ/hERMPhd862f+W+b7A8uK4ps\");\n        a(\"AHImWcdAqLerP+bpqQLnofqeQLcWOYvtrwZd+/7f5IfWw75jyD7ij/PM21e6NQymstZBeorYWlBE1knMooJ5w9kwRnZwKzgoWl\");\n        a(\"8f2VUmSb4d91nqNijnD7N5JcjQMNt2SSvcz7mR2fx97/mBPewCxl5uMX5kqG+cwF5M9LPmPMnsfGlsnrtr4v5cb3D058UDxf78\");\n        a(\"O0WPW9Mg19L/WG34Fwbt/rSTnw75ThTIt6Vwe7osfLegoHhP8C3HqNj6/ER7dS6pJabHElOjSdfOboruNPVUts7myJ0B1chr1e\");\n        a(\"/VQp+HE1av/RNQfzIFoi9Blrve2m9/h2o4TyxNSkzbufDKS3s383IbUNmYLPr9eR7KcK3WPGt4OkFGwyElK3jsKhuZuDpXNE6K\");\n        a(\"1gaalZ3y5sHW+rCp0BKcabq/DMCXo3i1Ap9CDDZmkdCsMhowoyQtPQKx1TAK0zzJWsBCFo3ih6L/qd0FrEeU/ZEchCwr6SqCGS\");\n        a(\"oeODXukwoxb02NA15r7jxLiR/QySlrsXRAy/Yhoy9VrUNiTnBy7pSq7EzOsVpcuK5h2wVGRGq26JPfw+zYELew3ssZxXQE3F2s\");\n        a(\"wKnVX6Z9GFP2cx+1mQC2myOjJ891nUQ45I4b1QpGeECufkF5YGBnA1AdgYbUsqDxeFZs5Rb+dKNE6USa0tnOMMS+ZMiVRnScVv\");\n        a(\"zU1ZsF8vE7YfiM8AYugFo5b3GL7/hTxKPe9g7I95VL6Y9LJNRhafrSp7ffEyx02f1096pyNxuuaw75+sxND7WmJ+lVxT0hhvDy\");\n        a(\"mvbn1I+mOrmk9O4aTQTpH0AhZm/198lMbqGwn6QPvfKvYNmCnj/aGUdoO0kQwlOW8nPzWG/32EbeSuXRhVszrQUf3hFutyUVzS\");\n        a(\"aQ10B4JFdxMZ1B4p642aOmovby2wGAUoTpJXzW6MBVVZ/fW/+nMWq6jXvDdxoEabzoGGJVTlKk5tWEThu0R4IYWzl3F4AYXHij\");\n        a(\"CDsEjkyabwL0S4vRfh+ns43EbhShEmezOaR+RZReEJf+LwGsqTLeIbKTwWYQW9zX5UDf+UaLpVNZMsYb38rRG/rCIhg4tUcKEK\");\n        a(\"LlDBHBXMVkF0Rg+2qSC6wkG9J6fhbonoNSpHowyGDQ//ruWrRgm6Z9HZ0am9j12nz6JdBmo8rrprkT2s45j2GKsN1nkAmlBKud\");\n        a(\"4NSn2tJOFerppThTUFNDdNlPdqqBj0bzIHpZI0m+TQJEVmRGc/ReTDZzv78NnuIDhWOCBRP9p165cZSqJ+lMMkUa/guxWC+tis\");\n        a(\"apZuh100iZSZlKpdxSntkUFiI5uAMISY872bA4NPJya/q+5WVK9P/jhIjYo9oHQyaLeOH+m/JPtIPMLy2O7BVUcvtOJnVOhuhG\");\n        a(\"3rQe043J/pTtfN6AD6VZE9RdpQp982+k1yLa+n3yHi4t31Af4Y+yaJCOrWudK1e1ey7YpGRFZkkXhxqGRzdG4jKwhJaVLtX7Rd\");\n        a(\"C3xT1Rlv0geFFlKBQgGBIoWCPGx9QSlqAw2mkkyePgBxs1rYg+mwUaYtrYRuDbEY3XROh7KNaTenq9NhcQotdW15iEXYrOKjzt\");\n        a(\"etAa3KpOJo9v++c27uzU2atJvj96O55/Wd73Xe53zfjTiP6vwZYGBSwBG3UsQmHlssO2Xcp18g7oci7jkZtxC2duEDhM0RXvkw\");\n        a(\"T0kHksYkOkllYGpcJRKAJZ3aXSV/FtYxR3nOJ3m36pcE4n76ZvAHv4rMJtXWSOepYfwblO1K2BXC2ZutnqWbESLdy2RanX+MJl\");\n        a(\"+hzg1ZX1hWiETYuLfVl1jOs9XdMco1ksBYqu5FLXeVtwkV2IyAiu/Zq40qwEJOXMsq0GBQAVnop9ezCtRHUwFg4axnFvyyu3cW\");\n        a(\"gP6hTL9D7nfxXds1uDXC5I+UlWdQMpJ8igNJ/jTdS0Yf/TZXvUl9gGyAa+NK59prOEquBWw+XgHgYzuvCSQ6tzi80o6fvGUMUy\");\n        a(\"/ApfJFKgqurRwqDbjk23yWzU4Kucu3x5WqZKRBOx1IV+2qVcAhTeWL+EThn4wbqnF556qIXH60JBqXJ6yOyWWJz9Je8PkUN5jl\");\n        a(\"t655Ty2JDpedy49Rk3JfDUuMqs/ZZxnkKSrd8ZjWLuTwNwFMYSmP1ktZHRBvRQG9mst48WSw+btMAiLwI6A9s5aPYlWF356mU/\");\n        a(\"ifpWmimLYyoiiG3xRNFA+sii0KqXwbqPev4dFQp2rVNEqGa9sGH6BSVm4oaWkxeHvAYmwr1Ur+E720lUolE0n+dI2FFAnm7bqN\");\n        a(\"tx8q7V4UX4WAjm3ftejYtsqise3ktRHZ9lZxNLZdv7IvbFtezdSfb4lCva/zlSEG2sVc6eCTQDVcieTs6Smk+jM0Dsh4smdQxq\");\n        a(\"ghhB8B6kdlIaxYPUTHisVDNFZ0XhORFa/eEI0Vy1bEZgXS16q6UDgkhi7sGcy/ZP/gpTjV/sGb2uKyCV4QlUNrwuwfwMOqxkMx\");\n        a(\"o3rwOZ7Q0DdmPXHIiVCtCCWLUJ0IpSHE3C40cJvhLAqBo/To4XT16OF0I+QfLg03Bm0x3DKNuyuKQxLhYa3nhNdmIIEOO/enam\");\n        a(\"K44eqIYlj4nWhiePma2GIACnGqGMo/jzZ25aeGjt03PxKcN7IObaYt5JAR3ClyiPede8nOZxL5+90iZpbPCiWg8kgyUdJ0mfRL\");\n        a(\"TuKCao68vZbNmzjaKWaX+dbZlqpbOGYehZJdJXKeym+oJQuu4Ha2jb4ZoEyV7JvOqfxNJo2vKxZtYqwEJHHH+UaKvYU/hU25Fy\");\n        a(\"kRjWYnQmrWfE63bE5P0YT25PKIQnvg+mhCy7g6ttDUBHL5DQcMIekFscasW/mKm26+//ZAsP6urYL1y42paxOQWixTHeZgqmZb\");\n        a(\"jaVh67ZsnolU1txJ+NB4aMePkU2fDOQcdgEomV9AvYE4XvFxn9W1jPggCnv46XrnQXHPmUVAuWCrGHykL1mM2Zi+kd5cHF7OB0\");\n        a(\"5cEMrIOsPenSdTpNSDsNLKQyjWeadksfAIzbldmZFqemEaalqDIv6Fvqhg5yOPzMCIMEFqDM30UzCYZoIH5yAM6igaj8sk/bTM\");\n        a(\"Qp8XpDoT+hFaAV4zLiJcji2Tb+8YgVDLBXcma5o5bGlEzfz3qmiauXFZbM2UmInzlhP46H2M8w8QXJYMmR3QKlX3AI4vgRBlng\");\n        a(\"LkwfGLAW1e+ttWMXfxzTZ0uUdN3JDNFg7qEJLv3NRNDu0hW9lV2qRM12/dj/4HH7zl7eMOSFL05gm5K+j+BDH6VvL5AHD/Eq9o\");\n        a(\"JWeBMgY7OwTspQArrMxhF8jOaWJfsobgKIGfBqh01ZEkTU7fXxxRTstWRpPTP5bElpOR05tQkU9jEE07r0Q3pSf++g8l8c3gAv\");\n        a(\"yxTEsKHQ8sD3Bvj7f9kXj62f2cmoFUv4VJKi7IoggGL37yuTDuF8rV+75EjRPfWRSRE1esiMaJg4v7pLGZKomr/DHWr7MSQ2n2\");\n        a(\"bxU93v1V7/dIsseGkL0/mKGjR5qu73JvyIqTEdpkbQtDmMOxrsHBqVhzgsaC1VdGZMHl10Zjwb5FsVmw5X7ULThwx3tR2+ysBO\");\n        a(\"O8lPfk3n+A+2T6xjxgKOO8rRUh2ox+bRPsorPv9RezaKwSRT67TlhP+SCeh+BWMUDTD98boB7BHpxZ7DbOLL643zCz2HsGzfnE\");\n        a(\"XaL9PRQyfbCr0wd32PThR/rpwxrqbQ3Th5QB0aYPJ5JCpg/jVorpwzgJSCIIfhnnD/aQ+YNdPzD+3awJfJ0zosCvujqawNu/1a\");\n        a(\"/5w+tZ/Z0/XGAWWEeeA6Src4BUczhx3YAdHO79Jv1wb3KGDfcvsz+82OP91gnoe991/lfj/R+c/RnvD04ke+HO2OP9Uuf/fbz/\");\n        a(\"NuHid/Q+3nvjNE2auDCiJqUuj6ZJWx39G+8PfRCt7+Ch48BH/JKiUrMMH/t86JYY5z8bYqRX6tLdndeQu8/tKEP/KNzZchu1Sy\");\n        a(\"38kSE84HZ9OKMzOzM0/JEh/PgEfTitc83K0HD2qtDwRwjr6Vc+vCuKf0k+n+pQznfzqsm7ygz7XuXsYX0PTKAjqhV7hko89ubC\");\n        a(\"DZSGvR88UELHmF/uIbPH/tUlvqLiZrwLJYcQhxXcioSBwMaOBIB+/wW0xELvdHNJYd4nrgm4ki0TDrzAryTMyejo6Q30E0vRNr\");\n        a(\"J8Jda8f92avMZWU5pl8ietsdaUZQUK806VPyouzKUX9YS/CAy/bzJkTdT7Jp4jutvj+7nEmyhB4zI648Yb2Tgka93vuFNpN1w4\");\n        a(\"CffPVRLr/QbqLPQ0h1V7k6wWzthQ8+O6mh+WNRvfQBjlYb1avWni9DTbPK+wPcXLAdWdj+HvR1QZrDPhXqFqjm59oRmVtHCMbP\");\n        a(\"QQGO6+m8oW2HJPSLsQVvffTJadA6yW3ybdOrFg85euEQR4Mq8wh8GphL2mzBwo2El5Ck3d1TiIbjHZ8o7zeaTghPV6TURSP627\");\n        a(\"yEIBeqC3b0IPlBd83amdj+eyS/OqfeIBMo7K5Qvl27rteW87LI5mh8XZxP7xQM14+9QvcHuyfAC/+/QPwffGAbyvg7ekr3raQv\");\n        a(\"xzCi7l7cdxyTH/AOWPZ/eQW8F2eZcG98OKPK1csRMMKfIcRsXCj4Yzr9FpcRx2WpxtucecVa9uXORfUOLbYirYcn7B7ObSmbCC\");\n        a(\"1G51+79jdX89+taE6fBljpi3gzFJBZWfIA5ZXcN5H6rRZHfvxf8mU1HeG/wOFr8bLXyUddeH9Hdql3+8c2qrs6ohSBq+Q0gDUR\");\n        a(\"H6v0D6YCsJdy+QLx9QL7kClAfUy6KqJyE1/wcFfcxP/NlnV32LWN1fmcqTcxo6t5F+QQ1snv1W92lcqr+bL4sd81lBH9SmNKuo\");\n        a(\"+Jhl56pRAbef2LE+1f31OHrs7s9EyHJfA3TTb8fdwbHIV1k2KjDTNcyGA6uLbHmvWx5tAGSaA2VrQHLcXw9aP9ztPysSMBRMRX\");\n        a(\"5b3huWe+4U8yfJKKP/i0JDe438fh/vTRT4N+wKXgkPtt+qgCtxD/EInZ7swFZg7bSmsGZNwFb1vuXuDdSGXtTscVB74vsV6OZQ\");\n        a(\"pqj4ZfvU/eS5wf2uBQ2ivBFZtqQmVzvSAvbGTxKoKR30X0x36nFo1WFBh7kCWSw7h5vVq3iDeLaG42ZvPGOwT8mw9XBhXHVztX\");\n        a(\"AnkhQIfYjv8IIg7zpDb2K4/2mwX/AGuSHaxS+IsmkvwtNc4i3vLsGbyvm6F+zX8XX+FO06//xD2h6r5RI09yuWqnusf5N7rO0n\");\n        a(\"0Aa7wg0FaO8DPUfQUTpqUItA4DHsI5R46QVz1asWW5P2sM5433BetPutTFvk53R/QUFPu7sbmnxaPP0oTac/q/jtB/kB7fwn/q\");\n        a(\"hvGTRrPEbyE17WyE8jE7sLlxhtMb0OX1rsLTMWrO59GqyX8gErsNgIq+Y4zSyh77FgHT+gwdpAsJ4Jg2U9rhp4eTzcLkak8a9e\");\n        a(\"6SmQ/uf+xR81lSio/Pha/q7m8w+RwaccLTBIxmjfr0fY9+sR9v16hH2/HmHfj0MHQj3XuXJ0JvzqxG8V1S8/qXr9Eai8eX+wwG\");\n        a(\"AwRHq462De8O11zVpgZ0Wqup7wp6jrCmTlS3b5yxsqUghUZVlaYJLrQ3wi0ta+MceBq0LSgKsDP9RYmQdpoA4RPoyksuWutkKv\");\n        a(\"fbIk3BCYUR8J4EP8WqtfmjvJsmkYhDh9kmXz14PwO770SrogcHu8uChwXoL4/Yh+kyybr04S4XsSxQWChQPxiydLgSQRbjGJcA\");\n        a(\"XiO58fRPrMBpzY/m4KXzpaJO/ptfJ0rdhhTg6ag/LpzEH9LVMIHp2Salj0c7uIYohKwlVQ8hYURBAPbAVZN0eqw1uIuaA3cjWr\");\n        a(\"w6vxhlSzjXZSi+GK6vmzZB0poo4r+1zH6fFhdWSH1JFH+8Le5Ts8bafaLUVtnuU77MVshLdOUyIyPLi8luIqZ88onQYp1z6fg7\");\n        a(\"pY7rVLucf2OZDMYCH5Gy8Df+idtB1ZyVMXZ1ebzW1cAt9sArJO7j1WLkaZ+IG8pg7KbcygcHq9vYltSDit+ZfraXUuQxWtBrHV\");\n        a(\"D+yn2GaFV3N0gb6aD2nSf6NebMv6W8eRcWF13BJSxybUUWKUm207KqjTzN9MbSMDaHgfoknr9OJwae28BGzx0Btl4kuqxHl7Mu\");\n        a(\"O8IGg611OaNSUCAWmFcH6Dm51qDRnZ+EAN3HPmzwXomQBN3IiXkBcki62uEYiPDh3XSOJCwdMNTeVfk3VVtOejigNi71WPf8cA\");\n        a(\"xv9y3Iigk/he0bfusgBjKKFKwNV66HcQ9HVJoQRUATSfDSE+KnjgnxwGf5Ye/mjAx95xSjj+mQL/+X3iP/SEYT88SQd79xzg/n\");\n        a(\"RiKO77UBMfKSb2gfnJetgVetg3zGG8lyaG4b02qX98j1f58k6WDr6ZcP9XQijugyXubyX0ne8a/D16+L/JY/x/lqDiH6ykNpHx\");\n        a(\"t/e5ggS1gtX6Cqx5IOBCSYDKG0eiIOBsxMfkjxH8nok68P+czfgfiVfxD7pZVxIY/3P0MHlLQjWInT0PmDWbRC9olqX+HKGUZa\");\n        a(\"eu1I+olE+WSpKlymLV9QSVWiFLDVLbvyh1UXgpOceqEgc29K0CWkKjw1kS0EAJ6Ex8OCDLczpAjqVhgAYu1o0BFgno2fgYdBxZ\");\n        a(\"hFL3yVIpstRGUersiKWUgllkm4zyD5X5vyXyj++tFj4f959HCjNYFhkjioyJXMWJMqNNdOrvoVgwPFw6jLx/5NtqywfxwIAEsm\");\n        a(\"nrrAWoelIh0acq1y4AZXebhJ4mymp3QC3CqrTWp4lBnIejCSP1ltbr2D4gjfpWgNLmXSvNjP9YPTDWb1511qbxPhtyB0fKc0WB\");\n        a(\"cRFaxGwqMZ5KTAeuwfGb9tCj5WbqwYeN07GDYauFpQSVhCEjwkhIIRI2Sq8JvFswkPxj2d0I0VyG1hSN75rFWuPIP+15p29Pss\");\n        a(\"PVT9lbajXlA5ANDuN8VNt2XW3b08Nq23Yp5D0M7ZcisFb5+1IsXZIv6gm4y3cExClP6ESsGKN8XpulZgfbS/5VnOtKijJO1vDY\");\n        a(\"TCeoVq1etSefdGn4JOBpVOt3xgb343Bw/7hEnfkvD4K7AeBK5FoAaRz3LREnjXh28G1sdXGw9SdfyNPUDXzpBmslYcKXf7BWEi\");\n        a(\"Z8DQY5xXqa7b7lHBPmz9wbagMui+rHC2n2Vv9gNVhLQTXQSrtWiGjTIvLtSsUQsgMPISfY84cnl06ykWFymWNR9y42S1JFz49l\");\n        a(\"dWvbTH7zM6bqdoM9HCN+tAvfUlBLszsu2VKwQ/e9nb4xHE+hXwm5AGxS6yUz95VlZqzEEp6Z5M+DwzuFDCbQb3ec+N0uf6fgN6\");\n        a(\"QcrBmaA4ppGEwqNFl2Nunx1JvNs4ZUNNM1XwIpUFFBLuUJkwTu3jAFB9MSe1QpjQPRg0COxGGDZ9524669Vp/yHT0k9LzhpXeo\");\n        a(\"0MVbs97ez6DPS80yoj+D3NQnZBH2zQW/MvG3Sok/VZfEIJIJanR+zClNFRz4PXUKBsIFn0Lzu5ZqfMoIybKLlzvWT4I6VFwwRS\");\n        a(\"PfM69WT3eoEAw8MNij/VZOtP16tDendA4jvbsQbpYqJ9ChkESP3te1+4eVaH7q1MpDMuUvaqhIow5iS2FaYG7e7Qlzc249bMyx\");\n        a(\"caQWA7p5vCk6Ie06Gjl2rqVqlkmrUjTkIVrOa9r8o3ShWh1utUbc2iuS7PnXKJHq33dcX3/NUhPobdNl68LxhBhGEszoBcWeJz\");\n        a(\"7oEZuSBr8RtHF2uf8mX8Qyzm4afTzWKf5VEdORSBsm3jjYcPDnaTC4y3mPMmToMmSEoz/oOLWFELl0euNCJNgOBnSU/1CNwdWa\");\n        a(\"DvzSfk0wCkE9aNaeRWJQUMi/uNiXHFLAMd1ApQRnpbAdedvEcIw2+LG/zltFrLKyF79BGDLRNtiM51Wt2Korx9aj7BwblTYSTK\");\n        a(\"/7cdLL9/dnaCre9/019p/RI/xn8M+LlZylppZ/+DIUWYqweV722nJwOP0gRXhds/XO70FhwZaC+GrbSZAKfZgmbOokSgs6MwbK\");\n        a(\"j5OD5McsTOI6t46gfahCTxd2X9dnIt41ht9lnwmUJuHvsI2Z1heHCZsRI0p8wXjLxmTri5Y4raxl07/jJNyH5Rbut+DPzlL1gc\");\n        a(\"BtW628XVI0HYMsjSTEWnbbwrfEaCXNB1yLBlhZbkUtDbzT8EuIvfNrROhgJPYGY0Uc3pk0CDhJztx9KpBlBGSnuA8hU2UZ3rkN\");\n        a(\"COOvJxGWJehhz80TSb1YBmKbg9IVz0VaLO90PIglhP+6Ej2NN02LQWNyCI3wtwOt8Y8CDAFYTH2FXcKprPb3UzR7dcosfQPgRD\");\n        a(\"BN76V++1zyUt9CVznODEfFApTSiYVqUfFrW5wn+ZTDWNRGRW9CUZQMWLZWoOSamtvNOK07B7z6/oFBWgl7cTMMOZsDpla3koO3\");\n        a(\"1s0mLS24p4NMZKunWV+shXxeiVEPc/0m+6l2TxPOrhFffARn1ziY4Umjm0xYf33asvUOfFCk+2OTxn/lFqwoq45Z7u4ExjjxKa\");\n        a(\"YTn7JLd3OLBi4qvV/lEb2vSJbhhRSIp6M/65ZlaYHqZckBK85MrXknKw6APrXQS3l6Jln5jEmjAJgK7MdSWf9Iwv21EFEpbnAw\");\n        a(\"rECOpYoVN5xLhGDefsvWN0OTa6ymLWDwHNtJy+ZGGsd/4Sg+UHRKtRhUk77KbsIPK6qyaCCqhFIK9qgd0MfnEyL87SxuKUI7lJ\");\n        a(\"xQGoCiSu/R2cwk4v/Uw0FWDQJZjuImx9S9YD0x7CxmmFro0dl6Jrm/DpRmqkmbQ+C5O03NMPidA30OJ93zD3+Cz/2JCcZ6hofo\");\n        a(\"FnOs9IOQOMkNVzwXKB3u7jG5srUclXNmuDIkDuDOanLd/d0paOr1Z5EG/UOnPedfjOhfIxrzBqN2SRnuQUuBgQqD5iomgdjBsH\");\n        a(\"gVuXERof1IQAMPIrWEaa4xCKEnMJTKRyn/OaRlY2ldFzHPSOQxApVIvkL3vf6axv3cN9BXb5vcv776xGwwORDaV187uZ99dS0B\");\n        a(\"eb6ffXXT2Eh99VvnGfrq43PB3u+E9NW7JvWvrx44m/rqsXL+Gd5f/xjpeg1Ff63vvme4snTBDeaZruFqI7oMI8uW5SerF5n9E/\");\n        a(\"V5TDidV/OMUfOYfJG78ocuDo4Cz+CRDjoss5enC+7uhI2pvFkn5w8Ru6UWOksp5nT6qplnIlMs91OYwbC77qdIBMU1FNR3Th/N\");\n        a(\"1zqnZxIidU7OmfrOSe2YskngSUA2Qr86bVZPb4hilMks4pZnlmXkQc0pauo7Bwu7DU8SlqYg7lsfQXykjvonNBkqp7Gk807xdk\");\n        a(\"llGyb5DFeyzT9STRgKfg7VEtS2dVxtW/fItnUFt62/G9qWdWKveucQAhB6R/ahIfTOw4bypolR25WEgXYFAMsJgA8AZGwv7Sn3\");\n        a(\"VWpKG0ZHakr3TTc0pV/noSldBj7pcFp3Tp9p2nshsvpCGoprVITmdC7vyUSe8Tx1QVDXW1K0Gc+pXB6M0EwwekGeT6T0TZ4WyN\");\n        a(\"PyX8vzRxP6THvzBRHkmTuh7/KsuqAf8qzNiCTPveca5Hl4Vrg8t2X2mabPz++bPFdc0Ls8386V8izNUGU5LUc/5/CP1vpFbQcQ\");\n        a(\"ox9KWd2fxvtX8j06QwtXx/AZ/LyjAJ1uXOlM+rLsXGTW9U7nnRupd/IAYR8Bt7oDporHOq8j69qaLg2TgBI8bapCjdY6CIu+gw\");\n        a(\"Bv+6lTY8f3mf/rcyPo1Fvj+q5Tubn90KllIyLp1A+nGHSq/KJwnSoa12eaHskx6tQMy8+bXKMjqFU8sEc9kfXqJ+eF6dWRGQa9\");\n        a(\"Ch9jMPgF9Wq+1Kuo+vNpdiT9KcrV68/uSBXhCt/GUZuPlabLMrQ/sYlPV0Gub/MxSxUdLPH6HnGlI2CxYg7+r6bLJo/RRRk6M1\");\n        a(\"X55PByTrZmp0pon3IruN75myQeE5HKz5g0TLR8CynfHcF8wjRVVZt4oTV5Lr/Qag+dPHju7xBPtiiXBkoOxvszAXAq4ac1XQ3i\");\n        a(\"0XwNolZdNHh3ZPK54muJkiEFprkWy09bEzWrJEpcqJ9PVFMjqqkLraYewRCkGgRSFSJ3q8CizoAFb7CfRMPks2UBf50o0RYKv9\");\n        a(\"0APypdvyGIJkCMwPch+f3n+xKC93SCAZ4Ro3ZRwZPwDx4DPzPB+w7BQ/5LRP46I7h6HQM0fp43JyY/d5DaxSeo/ByLEmHo9k9P\");\n        a(\"lowj+gHcF8IyydEX8vqrd+ZxRH84PKPIGfx1eTH5+eexdF4cL/g5Q+SvMwq4XoB7ajYnN+jqisHPZQT9GbPKz5dn96r/eIcqoR\");\n        a(\"srj6r/Z5P+S/h6CdUJmP/GTnmv+nDZ7Jj68HOC/4WJ4asANOiPSOhGjCX8d2bFhH8hwf9Zb/Av1eAj5JvVf/4cHQP4F5h65c/c\");\n        a(\"kBoOXdxf+ZYS/CNxqnyfjAIg8RYkRmn7916s19UGQ228z56E2vxrkdd2cTRWJCaJ5MhtYmrseh4ZTX07Hfx0w7Z76ZzexsoJoQ\");\n        a(\"vqobphcyHgqLbZrleiHtSyr1X+EZvu3hcrDae3hvc3D8qjgCO2nBPy7Kw7wSXfByQ+b9YdtRUUbNmAVekFuBOuvqP4R1mJo+YG\");\n        a(\"eS+9CHZPHUim7DiHLzhp3ZWJ4mQh3I5zh0kXYSOr4+SZALmXsiNDi5Y+RWlBwnzsxE4OWH6LeZTVct/fbh2AuxN5H1Y8Dtptm0\");\n        a(\"+Ujg/iVzocky79TOl1zFJ8hdUKn1Ks1R6LGO/jt9KFX+/yHJwZzabpGhUWXqYcZJa0kZzaKWd/pJ2JGO57s81CWZ4MP3UTkIRI\");\n        a(\"QF77UGW73r9BQTXuibcQUHoHM5mmjpd+Do6Y2v0TcBYh+Fgw58J8V5K9JiHfn0pvYSrn5se5Ps5tMPg2CD3fpe3AZ9CdGw8rtf\");\n        a(\"vvB9xNCezvi/xjsTlo4OwZbXeDqQnMWuNherh/Bok82RnPrcyPK51OFJR9RjK9xQQ7t/cG2NcdLWPOcmDTXPhsSIElSLb3362R\");\n        a(\"YMQfjenZbDPee6h3RBuVox+ekeRE848B/x140QJXeyQKAS59DnoiBzk2w6sIuefympXehAEFe1VALLHEPbDPixAFZRLHanQhRj\");\n        a(\"NRb3zvBvkXevbhdl6OvXifswa7wUBTs+4oxW30NzE0hr1i6CTec+0nsNobguJXi0xtUpf0dnsIV2UlQOLX8lz6r0+b6HKU0olF\");\n        a(\"CncPldHtJw9um2yG/8G3zmgo6fBBeh2lf5/T3ZfcgUCcK1O9479qLHunXo4f6WfWk3gNsnDFv+CKE+0c5soN/qQuxpdRmuH45V\");\n        a(\"D9X7+p4Wc8T0eeVMrTwnm8gz+dhMBDlxJDmugghfZ+W2wnA/jntp00AaWXkQM3bE7avak4ck7fzUEbggl7g+9CwcqrvjLFwULg\");\n        a(\"EmR5WJ/Fg567/GRc6VQkbOIEJxISb8cnO/xN2I+E7yIkXkmYscZgl4W72H/UXyGX/OtOWu65WbwhgivExOPdmkc43wjmqQc/wv\");\n        a(\"kF1QfwGQBIrShZ3Qyg/0hTAPnnc038BAPFP8syx0kF/xI8AD/eQYyyBUdvVBpjythDiEB8C8WvRzyw/StHwUfT8CZU9SRCQrPS\");\n        a(\"WJLrxEjXrR0kR5FXJYFdeKxXffo2pY85JvTpnKwQfXp2FNP+5CidPsVlhepT10SDPhnqp/zKgTd6rb9jIun7G6L+5yeG1H90JN\");\n        a(\"f/8khd/Q9ODK2/Okb9lQR/oaF+4/0P5LuG8g2jfFI5ae/OdhJC9dhOQqbd55iBS+pe5bKxcXHQt8T170JoQ6nUi/lSuctmwgkd\");\n        a(\"l1X9bXeRfp9AUXIOSPqtfHs+2X3uqngP8NVrJ+Q3b05QZXafE1SZprmy1zgXQDVxc3ut196bAUm2brCMKmpJOMx1dyeu/4joR5\");\n        a(\"zivStk3OHySPvBUAz4n0KbiH7K59bn0/7lNjT1Ot5U7bNsvhFx9Xq6JT4vTSDFvfCwPe8L14CC50x+a4mP8HoHnGufQPXhTKmq\");\n        a(\"oSz7eaZF+O9N3E2livcXeS9spYJJVDDZBw++HQU5gYJq4xCl2UNXJ0oOvL11Y+ybhHt29J5sCt3/akU+MptyF37VgaizlJj8Cb\");\n        a(\"vB2xvM+QjnLB2k/J0T4v2LlTtPh2a5U81yw2mRZaYy5UxolmvULJYzIguMLl+gVuzFr2ZcXa+v6ZnoY9jd4JqrIj+eCtdfl8I6\");\n        a(\"7GlzeJo0f8NwIawOfpnSCnpIf+WJF32IPRMypOgiRDeavLggu9ee11g2EE9DE/Em0x+PZ5v0unOqo1gWWZRJZon5fe0zJn+K4n\");\n        a(\"j3DHoz2jYqqH5bnQdnBwKQFr34Y1davfsLeGpQH/zhQbiGN9WCNITIAYj1Ljw2pk3EQ9LrcSD9siSokf7Rl3xrXQG8en9qHel9\");\n        a(\"+aC++ytjPG2elxyeV/BYLQa2zuKDQWzvTQzDNu8Ly5Vv45Uz5mlNmKexIZkb0EFJHxlXMx1h3spi0/N29v/Ibw/uvkpu41aUwP\");\n        a(\"/1hMjcvisCt43vc7O/Sf4ydpK7QezyE3rl7jBwt+hwh8pg0+tnAv3mr9eaFsXf46EBfZhfRiWFwazZHQg6yBiTLceF+wyzycj+\");\n        a(\"FXj96kqXrgK6gm5+uoRv6644YYIfdEsL5fJdKU+G3vnUFEfN3Ub79dISsfAvRrnxI0CUWoX36zmUl7IZ/f50C78/ipYu/P5UwO\");\n        a(\"WPsuIKEESxhqE8nB4F9HTRrTSqVfguUhisSpTCvosU0FSm0tQRQhN3YU5FpUfR09Mh6VEEPV2CHoWyGenpEvR0aOmCnj89DXq2\");\n        a(\"FAl6lFj0SH9MffanVRvqjwmZQI5nXpr46vLM48JYAMMxMVIuqcPat2z8DNqS3Zg6Y9ZXCJ2Fk5+KVOEqKznOPwiwxbfBbVaB4E\");\n        a(\"NemCOn6H6c/lRH9NsNfpzC18Nea4aH9iG8RcML0YDUOV9mCs/5RuGHpGJYkkT0N5MQw79ROdqZqx39Rwfe9ytyUSqdBstW56hZ\");\n        a(\"1+1AezoHsPDLnt1O08nEBGwOYe3xxnETt0Jayo3DvpTw3hXeSvECQ+kZHfbamD1KLJjCU7wubcn7/vmGnOxf04EYJ8U4KcY7gv\");\n        a(\"ul7x5V+6VAj+obCXR5QZcXdHnXyQFWv3/ELNKTW+T5FxF5SbyByLmjiKL2SF0PkCWazwVN+AQn2mCPiajMGK1y3eCsnQq3UcAY\");\n        a(\"Nu53iI5PXylrq2VTIz5n0GfpEj6tLKfw7K+QVPWY9h4/XkycuybzToLOxZ1Sk0tsjW+O+5T+Fpj+yj/mPZ13q+/vzaLss+FlF6\");\n        a(\"tlA6Jsj38F6tOVqQwvM1Yt0yPKBPyTZRk5uXeEl+mkS+nqdo42/va5vy4N6a+pT7XWK2f4/PLQaWEwDi3a0EXPE91wflgXDbhR\");\n        a(\"++hjf0Sb3lkYuY+W7VltwHuSuQHXJ/OiLWIDXlOTsMTdYG7qTT++IX50Cn7s/uob58eBJ8CPx+b3iR+WgcyP5IHR+dHUx/ai1/\");\n        a(\"2TE8P06t6ZkXU/ZOew0NNwuIM/w+cj6K0OF3qaHJ79uPN9+L28JsuV7ZgmJWOapLz/yhkxJeoOpbioGJLaC9/Zl7FNqG6REAs+\");\n        a(\"BmJs0x3jRwAKSjbZD39dmNdkRYViTqaU9lJfPXUOvfqPXd1z5puYb516VptvPTE2+nyr//q6IUxfoak3YjyQmipdKsE63jc1zx\");\n        a(\"r5e+js5wVGnQ1vvwNE+x1g1Nfe+L11TIz1RCuvyRuDLHcW76OZOQYT9weoJH0btttCh8HDHXLMHDpBjJmagtdNYwUPWcrSsDke\");\n        a(\"pnGcFMkmnSjSO4xHzvNePhP0IztfiE+OlWH25IAk4QaEoZBFpsaiw1/RDPit9wnLT0+ZVFZ42kKaTxxWzEb9j95+5VhyYWZY+z\");\n        a(\"18rmH86cWf/Adow9iPPtyR12q5stFe3Oow7fNPk/svQNpsbVSSbdWmIizpHXn7bksu3GJGEHcdhU0qMyJvf03yQcITDbKBH3N2\");\n        a(\"gpRWkFKY14AG2YAKimpSi/xZ4hzJ02az7EyzNv4zGb8FJpuprcTmYbAAz6Df1LO4/ulo7fWp099Ie738aa29fj0qSns16Ht2Eu\");\n        a(\"t7ZlKf9D29cpxJ1PdRdpT9mVj2pcLnnzOyAVi54WOcTHrexZEH7QzoDy8EaZ85PYqyDmcJ0oPXetVB5LWxjT9FpqdurKTn1Pz+\");\n        a(\"0xORFjyQcA0GqujQln51JuC/xge3yLI9zxsr2zNqlBr/DvjIU9GviESlch+dVQkx/pzSr+xk4/zkqRicAUtCPbDlRCBcEB27/T\");\n        a(\"17dvj8L9swl4v8ftVrNuz9KyYcjPkvFPux/Kah1brl7IEO71B8ObyjnRR2DDLNr05NkcnVqwaarJgGoYlVvIwK/qf5z0uG8YS4\");\n        a(\"Xb2dKLoH7j+Vc3FmIIpuag06v6umT+VmJPFgU9kuqxehN2UI9/SwAvizCeuEwh8EoTxIRW88BFmFDE4FYgDKCxucoo9Nd/4GOF\");\n        a(\"41J9LYZFzPaE6XB+udLqOMl8lt+B7h6GXSljG+Xsa1FmzYI/f1cWTrgSm1HzRleLqhD03skNOf5nN6jju96+Ic2L4duARaWXXC\");\n        a(\"ddwdsJS9QsepQ+hUfWDQbXPktU/E8a8cDHN1A3HspgLNdn5vefAMLSLhffBm9qLfouJfAPxxWurApqsblqg2zlJL3I4SMB7Xna\");\n        a(\"6dTZGjeiWQYHRnsQ43G4P8aINXGO/VqTgPg1P8CW2uqwmqazCSScCKFVB9Ko926Hh3DfjlHyr0WY27EXGyIBr3xSiKa6W3v6s4\");\n        a(\"8OVN/HJ9XJzp8lSx56ugPeLXZZi5RezfmTc5ryo3mYmSZrvqwd97FdBuWE9ol5Z4Ex/A19QFqUrPAdS7EUQMV4lYhRjlI/yBbF\");\n        a(\"V22REEH1NV2hTwQeXJv9f2CAhzZDeaHy/m/OeCwS3DNQZPjAeDH4k3Mjj1UeLTdf2iD5KuMjF9VLOl6o/Ip+L/wn7gPxIIs4nh\");\n        a(\"Ep+Sgm81sQKJ/M5WCuHR78o7pz8junbx65BpiMNVXne3+dZpIKFQR8K3zWTv32wkoegR6IhaxVyq/xf4w8xj4V7LtcL0NYH/AQ\");\n        a(\"LuBakmA82x5Hl/nCrP0qUsy/dvYVkucP8w1cT8L1ExeGgf65JrrBJHdf2Vu6LbgjQ/sZZpltKqoUGPZdU0TCP0dhMI/dxkJPTb\");\n        a(\"24yyCutP0NTovLjHxAe6g7yDpx/DXKDNP4DuD+HTOxtrFE+3mOKl5p4WE6TM3P3iIwsfjUpOrpyMWD1HrY3HE6y5R63u9y2wgc\");\n        a(\"sdjf9s4G/12pLzE3ffjDPOBPQFPupsFAtIR0+DN1P55WmuN/FpqfqFuH9SekWweB7eZcnyG6l8ZlGNM9mbfgO+lW2tWCY15190\");\n        a(\"EyUMsHrK0/wWAfuZVobtai7x0c/8Xew5xukkS+t/o4zWFlsqsRrn2TcT6rZkpwflHkY524T3r6hxvJfh8HysrES4yGNjm+4exd\");\n        a(\"D1af6Pj9CFqREt89NYKa9qpV6hDa7lPPOTfZofY7395mR7C2uQUjRZO3nU0nEwlSZH/DRyflcHoxI5DTJf5PGS94cdfdofLtX2\");\n        a(\"h6Vtaih+R1aP6gEimSck93SdCYTuDF8mxrrZYTvDUfeFf/Ewxrj1Fxj3hY3z4TblkU8N8+Hw/WKH9N+v2iyMvW/885B9Yx9t2o\");\n        a(\"LYLyb2sOMjB5YSRCzX/8NGnki3MTRwQakhhNheG4p+I3vE3ofAi5LzDXvE/6s8N0SSZ9pEvTwBxpumvPCJUaQFQnB5YSKNvtff\");\n        a(\"9EvQ8UiuQaYGeR468X+Q54MR5TnxHCFPSSiJlVF4eI9BpM+fkCJdHCZSq+DInDCRlkSX6XMPghf35RhlatTvDmX38cj82JFVJ+\");\n        a(\"wVtAlDBe38Iy23dkhjAyn2Gr6ArtTjAaX8xsybAd/0JcSKusUtnMS3B9PVT2LG/GT8QrlJaz7TLkP/rksyYRWri6jXy/Vq2Ov7\");\n        a(\"q0pyYzoI0lA+BqM12yvafU0QQcWLPIeEDWGn52DlJXOvBgyy5ZI4rFuMMYO9gzPeozEG10b8U+01Y4ci5M9Ejs9OBUehkneCo1\");\n        a(\"AxPpEVwxAGvSGgC903+mVMye8tB9cPzuUFobg5uIfniVjkiAy3UIYnkMFaPwdoiMhjlYh8AJEOstdVhoCHAwAx+Po2ej8xjl3H\");\n        a(\"X1/keavIOwQXQAF4QVaPHvBIArwExYDSb1NNErKJYuci1uldkCyiPqGoqbKys6iysxHoJA0WNaZvpvmmViMArggCrKMCftywCe\");\n        a(\"Kxe2IIHvdQhv35jEd+sNiPKfbZfFHpr+5E4HEE/JMF+AuC+RZTvrtlvlLKV4EAcqn8DKS/vRyIavWNpxIrZIl5VMKJQFVg42JY\");\n        a(\"MAhUfVlWJJcZBbTOIEh4EO8d/pKE5guFdpgApEpoJ+9AIIBlUF5PRRPGWmD6dApJ/g3kfJxy/hOJNAXaTzn/joAPKse3ZPVXap\");\n        a(\"+X6xyyP+Bpc36/IcNRM/incHt3uWVnqslR3Agz564RWtIPkLSwJsHURGVOjytrMVz4Yf3mKzbqep/NJpeRrY/SITP2k3oP4G8/\");\n        a(\"fN9Neitgiut8CTjh+136pqU12aeQvidGO9grpz1ZXA0ecpoazEud9yEE/7IE2my5OxUhTGlLbya4t/E50I/V52tl6kcFfwyEyz\");\n        a(\"f+WG7ZXKUmVasf/yHuusOjKoL4vcu95JIQLpBEo4LGDoKaKGpE0BwkkkBi7/WzECsWSLAFOIloHkf07FhQbFiwYCGCSkzRJEiL\");\n        a(\"IIrYAgK+4yxBWgrh/M3s3r13zxyI+un9cW9md3a2zc622V1vCLg/BDwYAh4JATTe8j/JOg5lvvJWYNOAAS4YC9gj4AWlgEsE3O\");\n        a(\"sWwNcKeD3RXCLg+YADZ4u6O/JWwCMEXAv6wEkCPpfcjxawRvDBAp5B8N6y3glOFPCn4Omjtc29QmPdd79EuX3ZxuUWOD681YSD\");\n        a(\"bZlhK1s2r0Xow5HqULi7KNzEdg7nBnU6NM6kzWGNk7o2rHF6ASymsRlb3/5OU+K9HpJDtGwpZxb70VNdSEGtfrTFjNSi/1fp1R\");\n        a(\"ui9Yc+sV9bClNo6pNY5WPmfQZnkLJA02nZF2irmZnSUzyszAoetk/y9muMmtVfxxoZX70BGZ+7jTqUhsB+8DyzxPBcQJ7ztrKn\");\n        a(\"dlk6Jg/tPHmg3kLPeFAuJZ4QDO27ljaL7iGafc36riBbcK1cb8mo9f5reqoVWZ6JJYJXkO05WFKbF75+vshYUjOMurTV6OyY+e\");\n        a(\"0YlPHIhA4ipNlvkqugaxBnwAU6wkCrnwE6seZl3BPeBIY1VFK0Lw64mQ3kJ8iy5QKsQRlVjjHKKH4Nnf/gMqot0lqKpqwrUYtw\");\n        a(\"X5ivUFtLiLMAxupOyKv+2wOywDZwd4rceZE7L3LnRe4M+0UI2ZaFbNK5BH0esCrIM7BlZ5DiUM+41Yi85Cu6f2ILe3s6FVtDTj\");\n        a(\"qRJN1ikFxHkr1lM5OMkSTgCZEll1HgCWxQJ2N9CWtUe7cjrFVYDXlG00gVjBSYK8YD1F+kfXLEazjbybkSzmYmcj6krzyUjXz5\");\n        a(\"EQqn3kiYNx19uHkqJO0XZYx9l1/NSWvEh36BVLn+Ms5JWn/LKaT96RmM0p/N712waqZKzrRJ60aPzbjGVms+lKSnVnccWAN98A\");\n        a(\"B453kdnvK1MSiSW4F5U32YadF7IUnDWhRa8NNHviFFN3uX/Fmo7l7L7Dc6DlwOhplgmOt1hDm2/sAcPwBJjb75dYOt8TP4Z4QV\");\n        a(\"l54NUmilWDKVDKhsXSpDdk/fNnvX9KvyMI+kQyDU+R7iBaBvRRANTIYScWlvfetrzCK+EQRyVA1fo2Yt+m4Wgls8LfXJTVm+GH\");\n        a(\"E7Py/WWuoCrnsRNB6vvdUY01nUZCR/1MIhc0wxRLdPtO3h+xZLta9gQlcEHqEl+1xtrdaOgXEREvrWmyiVemz5Dsa9OnTBDEcy\");\n        a(\"34EVpk5lYiotxbu1rzmEXs60PuhJmj1SNhUkJpAIB1o2OGeNHGCP2uXuhFyfz62o54GRW1yzth0iiH292KlwCtgrVvFBW/NqfN\");\n        a(\"T935auXd/3N0HaOC4K5z8rmLWNxj4NitZK73VuUzAZKqtrs5VmCpXLjLdu7OIdJqJJmk40lYW1sD9CfDzkCziJx864svc508Vw\");\n        a(\"0thIH9k2mz9a979++KfpLURayssm7wiWZpmSeyont6gN88Knng4Geah9ECi13Ad3/P306vrO77t2995G+D7FrG94HFyv8MN+V2\");\n        a(\"/lMqujJGUj1+z4ABwbc5F4/Mo748pwH/3r8GrAFvEWWErNp37qg8RkSMT62SwRo30NNBzAdG4Lz+USQMAJU0WGdTGsfPmpIGSz\");\n        a(\"XI8pb4sZl4W8Y3YYdGMh73chYNx+4YzuKuQcw/sls4394pig9U0Mq7xVtiG4Hog4r2Odz4qJ7IIWMa3Vxf17rYxhasvvPnNhaY\");\n        a(\"uygqzv5f5EYUM2bhwbkevGGFVbHYrrgB18opJg2iUEkf4zoqcA0xpoUkVhsiPDBDojwgg6fS6ClQd7lEGcikPxinud1Pwn5sdR\");\n        a(\"sW5vx3KmYN1GrPPQQLMMvg9b+DKRfmk4OZmKDHOEEeZySxgm0vtzWuJc00hP0m7c0VTtffl+DgSoOFWlt2mS6nbS3d98f7Fklx\");\n        a(\"xmh8o8LVlvwbEjJn2fSTNMpOs7zKTp+lyQUlSDKar9KapxHFUshz99B4XvZwr/UkT4DL00FFUuk/Y3kd4ZQdpPHxkizeok0kNN\");\n        a(\"pKczKcNoFpumB2nbIrG4kd8cV64NpIOQwEKMl7pobkcJ3XdeV1A+yU3NXbK6en2XKdZM8QDgDwikb/y2O/pBEfTZgn4Z0X/A6S\");\n        a(\"2i5pVqSusL7eZsOfVx38hsXdRB2drPRHp7uzlb+yJbFaJcj2bSPibSogjS3x6nOlCoYgZSxbgov6vbydFOjkeRY09y/JQdY5jr\");\n        a(\"1+3EdR8T1+1tZq5PMFdHmGsPYnAPM4jjpt6Pm5Voq17RVr2irXq5rcrmb+7/X0bmaathySjwciK8+b2tJl6sQCd+M8gyl7uq6n\");\n        a(\"KnFjoOwxefwwOFpBcrmnKzm8b2z6tocnuwgVxRF3qPzVOn5FEI12w1uQjjqezm2wLQSZ46u6ejx7hkCzMfOcbn3YP3uu5ZWPqa\");\n        a(\"ZYBljEfTOMH6zlldWI9poPsHMb4o1urnH8H6Er70Aq26+hfFNn8kn4cPOTXBqVF9G//xDhug2QTZCHoJEKvb6bN48JQZsskoxl\");\n        a(\"bAwZp6N/wxAA1CtWrq7UDYF6PFBC1tDFCf6/1F+keQZn5/yDP0ErjZSmL1V1E14T2DyP5y/+1R+x/jPMwi83tPCCWazeZOCLx5\");\n        a(\"HBuUk6LQe3nDVtJyCw9CbA7aEIFZ1nwbdT79nucdqokDqEvlffmrmml0VHx32Zk7k2x0Iw+7MZ5gw92Buh0op7iskzd7Q2Ok77\");\n        a(\"bJYRGNMo3zMVb5Kp4ZbXxJfUs+L9yqlb+ivORgnJYzxBrgUy9i6wXZ1NS3YbgM6BBNfV9A/TR1gYAGamo9IBJgfCjgIPc8D++P\");\n        a(\"ot4Z14fN7QpWqK+zf9KCdvh5ZlJe1P6/ilWDPpgE9QUMLm+S9xrh3YFqxHmuoW6EjB2XCDkZKZIOtyPJbWxK+dBBAJSxCY3qdH\");\n        a(\"jayZMyNg+AJcPh+WKBjc8fOxR5/hjHlhH/d3AOTTfuXqHY2F+/7wVIex2cqkUofda6aOVpka8v5fw9DUDU+TvLm/l8Chu5LfVO\");\n        a(\"yLTM2nnpZnx6kVZLtmQPVis2Mm8JpsV9rtB+GqwKxu9XoG0izxLh2cpnVn5qZn9okDHPdAmLDimkM5ZLIZWO4dPS/Qohm0Whd/\");\n        a(\"vYjpyCQKlfjyBaB8u0fj8kmcy8SEDlKZ1OUnDGYRdDHi357W4+UYj9XuOgt7Y41zsmE4meN4MEoQQG/ho94Km1423nXG2jSMJJ\");\n        a(\"SELhVa0F5b/a9UkgRB5OoLWDcYDL224v3TdXu/GQjCI2hJKbvhW8rN7g008X9HH6vfy+eKHW2t3MotC8TS3P3y+XZxTpfCLeuq\");\n        a(\"wZl+LWagsr+87AkuwIbx9vXvzqYt+UmrEtuTRPlM9CxuV5C3YUfO6XL0YCzQGqw4vqIq0XajEkeypgnTYRrFJ2tmG50oyAhq3/\");\n        a(\"MZSzo2DaT9+qH6maU4xLJ7yJIc6zm8H5y+ewtJMgXjTrWAHRlNpxd/yXgpa+50XnP4r4P2bi/6SZv+jPUACCPcvgPs1SBsPsUG\");\n        a(\"b9IOTy5EJBWPR+W6bAoEDUe8rMsOgZvVS3/Ocv+6v8H1gmbQBEFHOetUZh8A+/JABe0PAEhlJ2RzfB5G+X4U0xHx+VBYdH2jlc\");\n        a(\"roblCjALxRx8xhqse3pTTIufiRKTVd70d5Am84qT1X9sN/67bS9jzoreXkTdmJ9XDbWUn5YYLeUbwPqszmDU/k0t4LO3qn2xQt\");\n        a(\"iHAushsKQuxmIFdrnAbAJ7W2AdixiL2cnYFoEdJ7BfBXaNwHSBaQJbK7APBfatwJYI7EuB/QBMxlcfeR66BjpQ92wQmxx7R25y\");\n        a(\"9F9DoeoD2eFlK2+sltvNcn36hcai5os1CLlMhOQl3aTX5sLlyBjeKoMN113p81NAujn/JV+oFnOs5mjGe9HrRcpi6YYcXuTPBf\");\n        a(\"9u34+429+Cj/8T186gGf/Cgq+z4I5vgpH+VnxVJL7la8Zl+g6D3YGu0ND9Wz/f3fOSKOlnBrNEnBBkbCYw/aktoDpsK/42bSP6\");\n        a(\"7Uz/6c9Msf8wI1fW97Af2gjyvvTXVkNh0h7cxCWdkAOuW3FlJeCJbsD7LO0ieDLBSQKeRbAi4NcInrKB4LSTf2cWL6+FTL/DLN\");\n        a(\"IGCKcXyelZwXU6hahfwiFKOth7JXl7RIjrdrDTsHVwGiOc7hVOl9Ps4iLB5CqCJ4KJ3F637Cf42nm9YTp/Fszkz9xX2nm9YQ7v\");\n        a(\"+nw2NS+zsHJGDSMp7obhThv+4vHu5PCEvIrhofcuK6cQReGJq8ZnNEyZBxC7pTAWn0vg/IVC4vyz7Xx3LmzxT1KvPw2mR5JW6Y\");\n        a(\"Z2EtO6PXclYHCfN3iUc0JsQXkgOfBoUeXwZLerangCMjwaTKY67O6KnHj31OFOfJ3wyomH10XwclXDz1V9dmL/5toWUH2S76pu\");\n        a(\"ElenrmgpODgGjcQ9NSd+CJ5zjUN0uKrwgIFyb4++LkV8J+Hr36BQesBteGJ5jQMxJSKmMxIhRM1FHFMydCucE9yeGxIUymP/Vd\");\n        a(\"QCa9cmw8S/QLMVuKpzEtkirAPmQGtj4Jpf22aH82KiW7ERtTUarJDG1F50z/wD4xSa2OGUJe4RvEbc0SXi1yPiPyMcvxKK326K\");\n        a(\"f+MexL++0BT/tM02I/6fbKb4axQZPxhWpjUXipIu152h+B3m/DtM8WOVyCFWiTheDCBX6PR+hYjXoeCyZLzNbIr3ZnO8ekS8F4\");\n        a(\"TjdYTidZrz/RfiVU3xlsXJOAvK65P9A/jZDdEwvKJheEXD8HLDMLUmqc+N5rSIVyn3gUhBNiugvMN4rqu6hx1/6o1AsAl3KH14\");\n        a(\"M+IG9Fcgu64mP5YNzQesUfAZYs+vxKt2oUZhJkgAgWcIbvh0VvS9DGyKfbhNircI4Q+NHn39v1W/CQaE4n35hXs2X+HHdXEcSy\");\n        a(\"9DQGOPke3AkvJxfYL+MDyQsSGA5X3bWFfroPswBwBGDVaot8CvQdXwj89D4vMUPkGxSOtVgyqVyhlOXqt1ggcn+sIviDOAOVh8\");\n        a(\"oLFMbUsGrCgzqH9GABk4rQ4wB4wLBcwIBbzNFDBGnQ9ChH2ewqqd+Kdxi0fdBEjhcPmwRnRVqbWcmrSRI2nen1rHXm/Ai5a7jW\");\n        a(\"vTyndCiSwlS1i246A7vmiuNTU3G7PhpcQCtT4LX0hirJDEirTxwBHDW/jgpQpXVdpojivpe1w+UOHo5apKOocd1O/gMDXtfBXO\");\n        a(\"qU5wShsiCKdASvUM2IIgbH/htPx7zNscDyK2bGJbgwI/GsAQdeLhlISDI5IA1s+D3tvD90FwEirpXLDy5Z+40/XASWIc5xmqII\");\n        a(\"BtQjLDK5GMSa5pX6GXbVBfARL0qM/ho4DPYHyRiof5k7SYEpyaPDjVWZaOHE5wcBkez3FN1pfS4wH7wX20cN9fuIs0fA5Pz9CR\");\n        a(\"8FHLZjaoborG51FPpHgQ5Bh8jVbg+F60AmGrAe+UCO/13yn48DN56tcxdhJV9XN8ga7GR3YVp+RjMMVXR6UNcnAhHulgIdLXN9\");\n        a(\"KWuToDtMkIOouCem3ovV4fgd7rHQSIEQF2wEcshm7cjjy8gXA+z9ApcFVd004J8o3CoF4JB/2WBrmYcw3afJQJNI9vjCGJMR5B\");\n        a(\"cn3buVVpSIJekswd/xvCaRY5XQEnwB/YEdWUT7sIvoyivQOwL8KemSMJWw+Q6cKjaLEw9PCc3Lv0BK1tSrDsYDr5v3+xLwdX+1\");\n        a(\"F/WygbASaHr4JfwA25kPM/oLD3yyzA2n0vN3ZLlf5fBbDuiN6njp41wUwNr0xMCU76GX2Q3OHcsDS0vmKxD/mzfVxoZ1Q0OTlb\");\n        a(\"Le3Bu1L8CAP0NjxpLUss3A0Gb0pmnY2zlJf1C9N6Tupdmk0LBN6k6TQ0Ongir57HZQXZTkf43Es+8ezjmnIpnPmdlcB5RVDGvQ\");\n        a(\"JZbNO8SZiWba5DNGCQ4Mb6mHLNsMoh/dA/xRYqrXTKB8sP9LJ/OTaLY92ek22ljQT2lAsU9+GZU63Rp7V1a5Jl/Fiyz0Qjc9vR\");\n        a(\"pdVHKx+csTPnf0mXyBKPzyi6eWyiQi9F9Ibg9wYrSiKZ21dOtGMx6Xg3lFjZiXlZ6+j9pE8Q3+kDRCZ7ikyWHA2xbcOoYwACDg\");\n        a(\"iHb8zDhY5LaV3Fr6ceTHHVk73BtCwkKkrW5P6tq2rYETAyKG+JKdmXrKomS1us8f3wV7K3f7w4u+8dlo6jhVPT/cWMA+Wd8Ir6\");\n        a(\"wAUGBzoLkMikGm3/4iCAkh8DzCsXBWhOLKhjy1uUkmR+IQ9uQWQQnHqaENSv8Qph1PNEKNHineJqRNfH5ydjoBODJkRi/dujXa\");\n        a(\"F7rYgqR1BZyp3M6V3v52HB+JOC8k/tgRO5nsipX375kAZbaQ+GC7WBDSxv0A6i3F1VNhOL8p8VnJ6bhNbbrj9+IBc+ieN9Fot7\");\n        a(\"pN+SdlguBJHw25PzYYjYB9c6yAzoa/qQ1cleRBMLicG0r5F6i8irHsP2+/pZHdTOajHk4vvVLOsCFvuYeL0+aEzho9s3vYIhxx\");\n        a(\"wMOeZhybAGS4ZNhTDxKsQyIsxks75BDiihTZgUk/RlrnMvoMHd1LghEKEGOXgv5m/JSL5/3F5y0cB41+TX2G38EcBPhvtRRDdR\");\n        a(\"0k8W38n3iu995I52sMCJr/9W/AFWCB4tYDvBFxJMRX8JVHnu1Ozcijbwjx1oH58QSBb0ASdoBS/oUDoCCGPFEoirw+165JPAvq\");\n        a(\"E43O8pgSQJI0uo82LvqUcUHxpjc00bS3MhBN2n+EgF6FVAGbq/nRJxDtC8e9aJ0wm5mk4X90+7D47UiPaiv0PJLHIQxsklw/03\");\n        a(\"2UWbOtVJOspVTRLjvxCOhtvH7JZndruKnY6JCOtNx/j8ALsRZ0q0ODsUUzhXFfPaEOH2PrstJzdLnNXKn+KcDSdT+RQPVWylCU\");\n        a(\"RBttuBngXe2PwYIF4b4ZAcqKxTRbtHPZebCul7+ahBGv31owSfRAk+zf8p1av3vAzauQme20qGJJyYN6zuQeH+aKQ7BpnkOknM\");\n        a(\"XQx3OAL3X2NKwsUyCb3p70BKQiYl4aRAns8SeeBYhLVEHDgAbhGRQoaMyIp9LBd3meK7WcaXQH+9AlchPISgnkKez/DHBPsCIy\");\n        a(\"PuIzl1AIqSjf0chrVkTq6x7rQuSPsnS4JBcZSqVh6lSsMpLJ/YJoBBH5q0F03aiybtRZP2oknTGrz1OJzVvhPZmsA2nlAGcrhS\");\n        a(\"KIYrDX2oZ0R+eqJNjY0t11U0q3FO90dOanix7o8otUQ4ozvCsYPJa3IfsTP0JDZ/p5J2SB1ovy0j/+6f+GTWR3bi1MtHuI1wRd\");\n        a(\"SpkCg79Vzp3HORLwH3jgXg3yRMpFq4yAciDPdn9HcQVfGRVMXZ/hQhx5BcvKiWmp5TMdhvg1MIL9YG+1ttBg50DfFlXEFJZKMt\");\n        a(\"LLOkh/vBBCbhxkAXH8QAEY2BbtNwl+9wlh4ZbhIQPSmgBRqJjX8COBKKLoHQm4CaiF0gdmttUsYCZ2sdITB/d/LS6jbk5T0yGT\");\n        a(\"h/kVVe1o/mwyCoci+qnAUEVR7tPii9od3SmVj8q7oM/2jyZdz3JGXLULtoN6x2ewu1eyNQgib2DlxNykaBWGf7n2HdHkUXyeJ3\");\n        a(\"morfXJZmzdAYON8Ej0Kd7q48a3KM8rx6B8oz7jNreT56Nbe/NvPtT1yce1AeaGsmae/N0j5GjtNSA8XFvrA4yrLYA1m0FIYhhY\");\n        a(\"HzDBH8K7rokVOMsrigE2XR2WQtC+0qlEW0gmB5IVvGlAjzXqt9Jq7L1Gu72OybDnjvQ5MRnLnqSaOfJzZ1YY29VGU7O0xUzEaa\");\n        a(\"Uh4fM3b69qj8xQwr+2fMsLwjpHDeK4UzTQjnbSHh7Ou/kRvwCAgo+stkhNV3BjAXmEE5Q3iznIJKVg31mUBk1XCfOSI8Vs71js\");\n        a(\"hAFkMt/TwDttTNiO7qJv1ko24+oh3/yxutdfPLFVHq5q+Wzyb9g70wArQN6ema3IeWbXuWJA90uu5ZR9o4UbHq7FSW4rukFO8v\");\n        a(\"xndCz/ZIh9TpizeixFbssW6NrlXvi9SqtwPdbfseYpTbPW0ot8MbrOVGrwT4AkfxGZQ17Qb5kidBnv4pyCNONt8L8uLuylnK57\");\n        a(\"Yo+2uW83i8PwwA8S/ZzXkFn7BnbOLPAusxPa47eYIgbAAqhH0UzEhoYP1jKldrnGvymbRCH1dy6UC7657rFB7cx6Oa+/uz7aEz\");\n        a(\"J5ymW1W++kSXawxXLkVNpoHEJ2g4A985maZF0kxcAZpNCmiM9lUV2b5eNtrX0wDRcNAlZ8rw+1cj/NvK321f/dG+WFbk6UQIiI\");\n        a(\"Qk/+oF4H8m+O+K6AkiorGGtT3yeQ0pV82Qq4rBhqAM3Eb7hfVWubr0MsiV/wch/39V50SoHO+7SA33B/+JzrHm8cUTjTzmb0Ue\");\n        a(\"A3XWPN5x6U55P+IBYq2/SRjydXOm03oeaWkzy3+LPvezPZH/uc0mwc9rCx1YMs6qQo1t7hWS9yKTvI8xy/sgu7jbh1OQQmc3cY\");\n        a(\"JVLinlogz8KfzeDdNwcg/4nGlWSZo5caD5LYpOfFfqxIP8r1KSpEpEaGkP9+MHqNd3lOj9vG7Rizrd8GDSiwMkLza7pELWfWBZ\");\n        a(\"WDmFYKEzW4Pn6v7TEMefSEeDFFJPcIjuME6LVZc2o1CbpDw0QR5KTjDkIXsz8vFNjVUerruYZP4rW/flclu4rxhjKhc+7j9zDo\");\n        a(\"rkWRHu75VJssw35Rd5CpxLCHgzkr+7vE0/3sjbJb+TfcjH1rxVXhSS9WPNsg6BlEK+a33//RKp7497azf7RR7kbB765xo056bd\");\n        a(\"6fjzPxM6PtgzJPNZCst8LyzQJEHeCyDvh/r7KBH6/TkM+qV+19MWouh3gKNJtysxYd2uzyXl/y38/964qWqhHDf9LzqsZZCp/2\");\n        a(\"+l/r/6T/3/BaF6HcUVirL3ouy9KHuu1Sj12XOxrM/Rb/xb9blJPzEpVItHi1pMQS26UIunoxYH+PfldsrXx9Zw3AsbWCvpUit9\");\n        a(\"BqN2/1bBrINT+Qd7VxnjRBCFt6UNxdLC4RYCxa24BooXL+6kBAnuxaVoIAfkgAQLrgf8oLgEOQiB4sWdKxa6HFLcKW92vrLtQP\");\n        a(\"HAHybZ++abeTO7M/Pe7t7s64ztRMSt7Y2W+ZNI0jdtU3yPe35Ytc2/8X+JOIbvS6pjmPCIxrDzbnEMn7QMjWGraGMojl+Vgxi/\");\n        a(\"Vev/pD3mP87tsV+qKPZYkEaylmiPaV+q9sieh6I93nxH+bBH57HfssfJx/6lPdpLqGP5/AGN5dxd4ljmbfFL9tj3AMbz/No/Z4\");\n        a(\"9rU0Sxx+I0ivW/tMfhngh7rPhKtMfuRyLs8TKN60/b48Ej/9YeexdXx9CSRGN4doc4hp2a/Yg94v3Owb9XzKPhWNrNONaZwMeE\");\n        a(\"NoktM5VURJ1LSo4p/KxczV9rQlP4y6k2WdZg0J4n57ORqe8Eg5/3UM1NRzHspdpI1mNenk1A0ea4Fvk5FQan81rkOwI/F8Ztxk\");\n        a(\"IS7Xd2SN7H3/+Qnljgegc/CdeiPx31F5MkRYjy5blc7sfnt1griqEVtW+jFdnpym3sK0t/9nVFyxejkSvxutXBdZpgjtSugHKf\");\n        a(\"wWCHklKwfvqKvNKkBxLk1aTL0jfkd38pv1aQz49MapwvsY/vegcf6yQf66RN9yXek86IapjOJfa5dL3DJSZ5iUlOgWRSo26YV/\");\n        a(\"/2+5y/iKqj0/yko8W3iTq6x046SnXSjZF0L5bpXj9nAvRTvF8oH9LClJPKXfhi/jpRg/lrRR9Ph/Sxi56P5KibYfqYj46SdFSh\");\n        a(\"o6n8UAMbV/St7aFnxrSSfIkSP6eltcgege8Im+cmpSxC28pp5RWR8+GsfU+NbfQ2WZJIpmgCkxmr+dl7hzL/r+PN2OpDM7LRpd\");\n        a(\"dhCtkPCjmXUM7NrDJCX6hBJzGyso7rIyVdCCU9+Zp+0XU/YZnnuGIg6SlL2v8t+ZVfys8U5LMqmegXi5/3i5fd+3qiZCgzhmU2\");\n        a(\"oE5jmQ1/6HuOvZCqd+nZAhfbN4t6V6sRn6dTPuSE6dyPfK85nIw/osiBNOIFYBFeADLzO+OM0AtAaXmCBH2oY2gw3WyhRSOME7\");\n        a(\"ezlwtaRYL2R6pLHhd0G6phIJnQM+VfzG+WL6j227U7bP3FTWK/pWkY9bvGT86/Z1SsdTSesGZ5kBRhM7bY5GQlvN3VDfxd6def\");\n        a(\"s/SMDeuTt4j/iC7pCqh94rlNfdJro9gnb+pHm/MV13/nm4Y5C7Pnt1mt1z+J6i3lFic5l6He16hP3H8M6hibZkd+Kj+b+2bx99\");\n        a(\"VghpWUJuwWFrX8FFa+GZXnhZWfYA2OUt42vYnBNqGi5ExGCyWxffpitchF/oQKoby0lEeg38l818Qlg5NScH9ritIuaOmpR2Yx\");\n        a(\"sc5e5mdbt1Jqk/Nu2PeGbUG+97+uxJmkGLribiTLHSB15NijIR3xYro33B/srOIo5d9Jf7AWZ7u4BrH52JotKRrGdjG/ZpvC1i\");\n        a(\"XHk6QK1M8ZaalmpcJYxc2upplbEvtN4eHWim+VURWKraxlvkUPFI8oPTmujN479bXgAfZd/zfrbWX4L+dl/m+y4uB2ncXnLWbx\");\n        a(\"DJ3uKNkjrmnIn5Gyo+8nQ9sHxhQlMjgL9U1Kivm7dmdurfq3RbiUul4bvjcKzitR19dY/J31ydV1GaizuJ/sTrPy++IN3J0sM/\");\n        a(\"32ja/Hc4SatPgdZbVZQv52qbFOj78wnYLv79U2GMRv8oZi/ylh8fLv7m9DLhIB+PbSBl5KrQsX0TKgJV4yh7DmJYKhz95WZU5R\");\n        a(\"Xfo6Iy3mwdaV0zymtULHxNBK48oPZ5W8rG7mD8hUxdb5UIMKvlF6knHuoz8NjI1f8fXQF9I/FFMDX9uapoGw0VoQQZIE/j/8kS\");\n        a(\"D2pcOtNWkIA0DJxzHXRnAEXyYJHCEkb9EpaIK8QTif421kucB7cCG4PkSm51rL63MP42gazjEunuNSoO+Dhpf7yDFuHPKBWha/\");\n        a(\"y+OtiyT74twhbr3AZL4f+qO9OnbNiLuS0fWVVuNLy6lxSyU1nlBFjdurUxzX50DcwOoPi7sQ17F2hcWXhsVNtVT5XGFxixKHfB\");\n        a(\"Me94uNgezvBK30b4M4ZiVjhIQsorwQjh33HLl4ynPi5NVLVy4fvXb9RqLv5u1zd+7K95MesH5fBL38weBYCvlfDCaBP1+Q/fLs\");\n        a(\"ysbqK5Ltaxdf+EOen61PJya4vidhAgplhIw/dX/WSL8Xkv2kvKVEyVKly5QtV75Cteo1ataqnZI0OC3VkkHSKUcMOyjNTKjUX7\");\n        a(\"dvt4jzNerUN6K+YYM85uMdx8/5yPnqIPSw6fVcvVMVuHUa6TuQ3jCnc2Vbb4GDacCPAs/OGtRjvtm8ri74NWDyDjlmzXg0a/Yk\");\n        a(\"8EdABNd+cDVYh1TslerGe6SnQ+rmDMmPjDw5N6E8uBnYtHej1dbKqdcMBi8LrF8xx/29xjtxbnAbsP2SeSsGLjj0MiMMfwvSJ4\");\n        a(\"5/MO9evVsPe0OdumNgK1U9dCbxnGdirw+cN8B1jR9b0lpg4L6pGd5xPu9jpE5ogpJGQ3+IqC2kKFgQcqCRISUdXejws/tyfrr/\");\n        a(\"TdZI1upGyTWHZqNuvtBLRxdU+lzj8CX2mJpnq4b4AG0Uu3Rzu7Zv4hjYDL4F9r6NYy7waMG+EuVXfF1uSkwfazh3H4U80HqMow\");\n        a(\"PoAiaE8AZHL9AHDAClRI4mYC6gBWgF2oEOYLT3h6XveL4b6AUGgKb3qB9oB/YHxgHdQC8wFBzt1GdaQI2TIqrx8NDcXtsSzn3Z\");\n        a(\"8MzPzjEX0Ap0AF3A7wWNvkgxbdGKRfq34vJxQDfQB5Ra43xAK7A7cAowHugB+oGGNhwLAG3A7sApwHigB+gHGtpytADtwP7AOK\");\n        a(\"Ab6AUGgJnbcSwPdACnAOOBHqAfaGiP6wbagN2BU4DxQA8wAMzcAecFlhSfr0j/W8H1k+fLC4xDua0oPA/8OfhS8INazuPBveA7\");\n        a(\"wG+CJ4AnxwPPA94U3AveHPwSeCtwH3hrcD94G/AAeFvw1+DtwQ0dOe8AbgLv+Im9u4xxIorCMDy4u0tgcAlSHIK7BtcQ3N2h+O\");\n        a(\"DuVrxYcCjuUNyCuxd3ggYnwLlvA5xgP/jJTdiP59zpdK5Md7c0AcfH9bCN6+O0uAF24YY4N26CC+GmuBRuiSviVrg+no/b40XY\");\n        a(\"wevwWLwee3HI0KwHjod9uDP24y74OO6KA7gbford2Kpn3B1Hxz2wjXtiF+6FC+HeuCL24fp4FW6Pb2AH38Rj8S3sxbexD9/Bfn\");\n        a(\"wXH8f3cADfx0/xA2zVN64UhvHjI5HYTzh6GuYDx8AuHBMXwrFwfRwbt8dxsIPj4rE4Hvbi+NiHE+LjOBkO4FT4Kc6IrQbcHzg6\");\n        a(\"boBt3BC7cCAT48PXcSlsl2e8yu1xMuzg5HisshenwD6cEvtxKnwcD8MBPBw/xSOw1dB4JI6OZ2Mbp6rA+HFGXAhnwRVxDlwT58\");\n        a(\"T1cW7cHOfD7XF+7MZFsINL46F4Dx6L92MPPoC9uEEl5hM3xQdwf3weD8EBPBbfw4vxU7wVv8F7cPhGXA+Ojs9gGyerzHzjFLgQ\");\n        a(\"blmN+cYr2zG/2Ifb41XYwavxWLwGe/Fa7MPrsB+vx8fxBhzAG/FTvAlbjY234Oh4K7bxNuzC23EhXLoD48f7JjN+nGEP48cZsY\");\n        a(\"Mz4bE4C/bibNiHc2A/fr6P8eMXOIBfYauJ8WscHr/F0fF7HB9fPsR84ABOix9jFz5wlPnBnrPMD15ylfnBS3F7vAw7eDkei1dg\");\n        a(\"L16JfdiH/XgVPo5X4wBeg5/iex+Zr6bG93F4rN8fSEu9FNmc/O73ob5/+Q4Hx+t+Hk87QNbMzPweDyl5kHohl6m7T5v6Ier+gh\");\n        a(\"xP/UjwfNl5HaR+lLovBz8PnjH1Y9TfZDX18ydN/Tj1QDZTf8PxJ6lXLMbxp0z9FHV3Ec5/zNRPU2+fm+MZ11nqT/Pz/Zb6Oepp\");\n        a(\"s3CfnzD18xaN4z2c/wLlRYUYL+e5SP18Aa6HebhE3ZWX52W8l6nHz0edcV1R9dzUr6q6m+e9puobmbeAqp+nfl3VPdRvUq9flP\");\n        a(\"lnvLeohy/JeZif28HxluJ5Ge9d6mMLczz1e9QPlGZ+GNd96nYJzkP9AfWNZbhO6g+pLyrLPFB/RD13ca6f51VNv9tYyAph+fVd\");\n        a(\"FFK93yd15adXt05zV88e04jjQ3xpIb+0UF+aFSLk93/CRIkSIVy0aJG+/gkbNWpEK4Q5LDTNihQr6s/e+PR0ZV7I8+QbMtjid2\");\n        a(\"O/kDVJN+khN5LnyTdkfDePJ2uSbtJDbiTPk2+C9e6Sv2x2D173u5Nk3Qntw8t+ob+mytGdB0WR+cZ+lXvSrZHHN+9pnFZl1rc5\");\n        a(\"ZWne4EUq1yTtGEleL3oZu1RWWfEhojw/XqQyZtJSkeV1qDePUxmzQnrpd/VhnqgH84z/slyfh/7mKlenuyTjC9/X+Dj1YDZyV5\");\n        a(\"Trd9NfSOWElRPMz3V4kcqToRLI9VV0jG2VVedGlmX1Y0dll5YJpN/uZ/zUIcn4c+eZ1wP6a6q8MNuR9bX6Gx+gHswkVc1vfg79\");\n        a(\"uVXODCyKLOuDN6rc/dC8g1xzAPtC5dxlO+X6N+KhKhc/SxRWxjeQcVEPZughD6Tfob+iysZh9oaT/Yc3qmz8IryMr/0g9o3KSD\");\n        a(\"nfRJD1w4tUxt4SyoxvMOumMmW9PDK/B/BYlXtfXZP94xpibKlcXfKInN+Lm6vcMyVKGHn9GWp8nnowJ+aZEVHWn/76KlcP3GTW\");\n        a(\"f5ixn3owq+aaIfPnpr+QyvKfroWR9ccbVbaN4JXrTzvCuBTZnPzbNvQPx3tH/eF8o9nXo0hyQOLWZv3pz63y6O4Ncv3n8SKVod\");\n        a(\"3Xosr6jTEOr3L+oGwhZP5xfZWZlg6LaG5Qrot6MLO2eSL7uzn9uVW2iOZI/wHsUZmyYy05f6FxzI/KeRMWy/V7cHuVsc+3N+uL\");\n        a(\"D6jMMO50BNn/441tlYsmJYgm9zceqrLghwzy+PgTjO9RD+aCzSNkfdz0l/qWnD+U7M8A9qks5h8YRcY/0Ti+ypeJysn8eXB7lS\");\n        a(\"tiNJH78w0+oHJtnTNhZH0mGbtUTox+Web3OPaqzJEqpHx/yT2ZfaOyW+nX0u/BzVXuybhQ1jf8FK6LejCL3HfJ/Lanv5DKlL7j\");\n        a(\"oeX6sFflnv6f5PEuj7Gl8tXh8+b+w81VZv3YXM7/Bh9X2fhMdpn/+lON06q8US2yjO889qhccWVkNFnfacybyqPNm5nfg7Bb5c\");\n        a(\"sH5h+A7ensO+rBbHv6k6zfIvorqsw0arqsf6kZxgHqwUzSoqFc/z36HZWj4/WW668509hWOfrBLZmfjXioyg+pd8hypJ1l/JR6\");\n        a(\"ME+drS/736G/psrSVT7J4wPYp/J1/IGhZH5nG0dXWTfrKfP9CbdXmfxNHRn/G3xc5cI0q8z6e1l3lVXfJTI//2CPyqwFQ8n9EX\");\n        a(\"8O4/aSZMzYu+X63fSXUlnl9dqosj7Yp3LtkZ2RZH3msi4qzy0KLY8/gIeqHD0mt7l/5hm/oR7MXdU+yPp46W+uMnTaxtIff77x\");\n        a(\"eerBTNC2nMyvQ38plX2LPpL9qZuf/l+1+mf5PZnj/tTiL/j9cSUqFrWzZcqaKatdO6sra9bMrjyZs2avYzdt19F2585ZL2d2O6\");\n        a(\"Ndo0XbnNmt/+1ftDBk/OHsV9I9yqRDelhfL3mAPE6WYl0rkr7QIX/4PFAUnqei1cDqZDX68rW1ZVtVvnxtZ3W1mlgd6Y8ToUi7\");\n        a(\"Bh0bF+neuUkISs4ts8ViiEwLW6Vd665Nvv5np4EfP2f4Rn3+yHNd+n/dbtP/h+bvxecTepus2Mek45iM7v192v1MWv1N+oaY9J\");\n        a(\"PHyWALV7VCw5ZNGnU+wPiCzc9tsohxpe7pomX89qUof6Nlz9nb8nN8fM5zj3nyUvd/5u5KY5opwnDL54GIUm+84nrjgRZBKZ6F\");\n        a(\"shUUZIWixCN2LatUy3btFuXTGBs1indj1KAxpj+MIWpijZr4wx/9oQne9YrXD+sV8cYzeNYp+wxtt9t30SiubjI8zPHu7PPOO7\");\n        a(\"Oz7850P6D1MFVHT8smucycC/N+Wk8u5AvAv6qnHUKDalJJXCBHlElDY/Dj/YzrAEpALvskeL+F6/dwvSB9jZ8p3hOaiurC+VFV\");\n        a(\"TmwWpmRdUOOCnkxE1QuFSFxlJqlH46qgz2haPJFkSdNaNKZMClEV7+kuHFWQKCSnFEHWtFg0IidLQpdFk1OCLMyo0STLk5NMSE\");\n        a(\"/KsZhuJEbikwpqmpZV+UIlwQqsnkRLxC9MyNPCjK7oQiQmMzzChWP70Rk1GZ1WBCWRYGOoa0uBnfgA5gcT2N8S715dVxKr9V8g\");\n        a(\"ly4Vcg1Cm2GHhwuxqKoILp5+iHHqi5WEqsQ6j+LpY0oyNJVQ5Ml+RY8kolrpjKvltzMeW8RS9QzdW6BrY6mWhs7tbhybYhpjje\");\n        a(\"lKVfrQ55C/05Ys65iurZCcgvletYD8Hbfui8djiqy6q72Ai8jfpqlX1aNjq/pbbWekt1h2NIwxm/WkMl09TmzfODiuXqzGL1N5\");\n        a(\"Mbe5a67JbWKjnxdyLbWGyk2rDUWqauT9zf8oQ9SS/bLBdcblRlHhwd+LbSzEWEixcAcLCyw8hSAgFFjoeogh4v3s/y9YaH749+\");\n        a(\"KvDH99kAXEWxkm2Q9ESM/9XpxnyMO1z7JvNzxnpDc/awT2fzlA5hyW3sXCwyy8zsJTiwa2sbyP2P9cW5nDN7meeMzgwePPPG7E\");\n        a(\"m19hcix8z0Lo1d+LGgtPsTD3Wjm4XmdcWOh6wwj+11lA/C0ml2FhrzdYQD7PK7xm5K+uoy2yOhDy7qKBDWw83KIcft2yWGxsLB\");\n        a(\"af3sUI6R2KxZu3Kf1vlE97isV7W0oBZRBWtioWzeNsqh3z1SV6nJ3dZ5Mj7kfZs6qvs1lkfUeRp3k/nvjE+n7iAz/PpzTPrEN5\");\n        a(\"bicGA4xnUgFR/xLNc8WG55JDeW4rBkc0RQVLZpef0jwLn9E8BcGxPNldLbHG0/OZNc9lpC9+TvOccCjPJnGU3XxBkx0rNjyzX9\");\n        a(\"A85xzKc1vxzESU9052FD6nec5/SfPMOZTn9mIgJuv6afFkMD6jTroW0V717iupr2ieKw7l2czstsyyNMeheU59TfP07utMnk3i\");\n        a(\"UFRPlvvn/Fc0T2mZ5hl2KE+PaMyxq9my+r6m+fq/ofnOO5Rvixhgj3NxVVENutoyfy4/5pjOwDHezkB7Z5D96QoEjm73HcX+6w\");\n        a(\"34vN09wZ7uHvHoK10T39B6mfiW1kveoXrZRhw5X1cS7IEY95NvrP003P+Q+Y7m6drPGTzzwLTbvYqF31G+aKAfKAD5eTNFIMrn\");\n        a(\"gB6X28AGnG+T2+QHMubdGuygDelvmfX3vc246DD95a4xeAqQMyM/tgqtzt9c2e/A3w3+vxv8F8A79wPNfwH8wzZ6kO50byj/5b\");\n        a(\"vQ3vOIo/783bCLe4AoV7jPbB+leZ+SyEIPc0ifLVbrJ/+jzfx9f7wvsNFP+M2N0Y/rXaMe6W3YyTsG5lB/geM7Zn2szg8TedhD\");\n        a(\"GOkZ6GPuN8wLV2zGVehDAvJj0SQnxa314dXdlvz9mvsv6SM1AfuIgu/FBnrPhh4uqj5vDvE8T0d5gcsB18ojLsXqXPc08oE8PY\");\n        a(\"y4XzWdD/w1pKeBwiXABK4DmEJ5fjSF1u6rq3H/b6gfGAZqwAaTX3cB7TRRx6/btsMmy3ITSOdH4Ufab77yk8087YD1jbv+VvcG\");\n        a(\"v18ISqU5WhuuX+B8zfx+pvml6/Br/aVaTth7Y/jx8vk9YU8C6gXyY8tQiT2r/zfkAzPAGk7gw+0gZZqvNkJPfsRzJj0Kv9o8h6\");\n        a(\"7TTqT9NtZOtg0Zbn1DW6y+X+j+4P3NZh6/vzXPCZNcdmJjeGJcLc/TEOfjahpY1oekJHSmDAxMWdhLDpivYz9+8PPUsR8f7MOH\");\n        a(\"+KLpfpX/ndar/0CsFzDZUcEkl9vp39Vrbmfod0f0tx0MzALzQC7H/hrn2wm4K3AXA6Vdze0TiMdiSoS/f+JHGnqUEM+a9Cu46f\");\n        a(\"7nOQjrFaFnfnjdpvgRf69+80e7Sf26DoYeEQ93Vdtt4aDqebanrTruRVwDeg+1vv9n25EOfkIP6j0S8xJgoQPXdZSB/k6UAxba\");\n        a(\"ref96W7w9OH6cX7pWJznOMgdXy1fQDx7AniciHo4+nF9fTh/AOfrhxwwHYT+BtzV43rI8Gfo5vfe6FdpxDXuL4c9ZDfR9uQ/yD\");\n        a(\"o/Z5Y73aH2dBrygRowBeT2lEXcO4J8ILenvAS7CuF8p/81e1qGnHcU6UBuT/lx2p68Z7j/UXuSBpE/DHlgZgjnAWZCON+ZiJ9h\");\n        a(\"Ht/K/rUqe4Ldebh98uc/7lfZkrbH2YOc5R9Yr39F2wL6BnqBEtDjAm5p7V/ZLjQgq5MxxfCysPrR/8zzGw/0N7AVracV6DFrp8\");\n        a(\"9G9/9Kj9syP01Zi0x/0Jf5uYLbY3prWj/eg51pjxrajesxzOKUvy+FfLO/z7WNtR53CgVm9GR8eliZjic2l/UZht2Z/X8L0ONS\");\n        a(\"I60vbZ361JrcjtSna1t3lT79LE7pM72NuZ9XazQLvXmRnzfp09tE62thnfqUWpypz79qny3M36jHZxIR3te32UT69Qvb0noqOK\");\n        a(\"yfr5X/jyM/dgn1nq8nE3IkaSw6M7zF7D7WZD2erKC95rej20VoW1+75a/bWL9P6nrct4AZYIGn34Dx43b0F8RzwAJQuBF2D/QD\");\n        a(\"PTchDgwDU8AcMH0z5G9BOWAB6L3VwCwwfZv5PtC3usa0utXY0Uz3t4EWG/99m7P625+3b2f103r9zHgLwfwF21n3szDaacVjs1\");\n        a(\"9xne1VeHZj+pn0HOwcqAEzzyMdWADy8y+/jn71Buz8BfRHYBqY5+kvQh6YBeZfQvmXEX8V/TGPcsDwKwYuA6VXqf6F1mLHFNrl\");\n        a(\"/cWvTnJ9dMApTz28j/vkyZ5HW3fYhPf6nUFRDPjEjnaxi62y7+o9qqu9L9AbaO8Ieju6uo/p6uzp67jS5d3B9Dxm9pPuaONvOs\");\n        a(\"RZ/bR8/x+Kqhcrq/7gwaQyHd6BHo+EnWgeAw7jae7XO1bwPSOqR5NY0TLA2o/yg7fuTPNKrZO359yN6dfhc8zPc+ANP4N/J+v5\");\n        a(\"sp/b8S40n9ZD4T8t8XZAO/Nj59C4mlD00m6iyVHlAiWhqBGlxBPtZ/bHt4Lnsg3fiUOdZdf82D00FI/IsXF11Ewa87pdrJ/beT\");\n        a(\"sv7Urzml8n74K8Ye+xMN6XKQ+W9tWAceuu1uO0D/Ze2I3m89Z6+V7g/lfGrx1CfTPRWM3w5WrczZr3CtLfaqV5eQ5zFu/UhdXj\");\n        a(\"V2sIrb1m35w+L2CyczP/3Wl+C+AvldAB/F1KNf/dGP/puAX93en71uIeNJ+lw5w5rjWHBtVo0vDlltp4xYZndk+ah3C4M3luF5\");\n        a(\"LiesXSmMJaexl/izg2obw4EixBTf5WSB3bPH1+PEbkY8ecOX9r5Jc2tbGtiDX5WyI/GIvLSYv6m5B/ZnRSQR2W18m5HwE86Iq+\");\n        a(\"QHdn9zFib3tHT09pXe1Rve2+Y3xd7cEun/fooPeYno5A75U152ng+mui62HZZP52wHr6wNvCuu1xWjRWbkyL5wyz3BYoN6RckH\");\n        a(\"QR7RyKayWo2w4jZ54mjjKsp5f2E12kfFCO6QrDetcXSswo1PWplbyJ85w2E4tR+j/PTn58aIjk0Ts0JlI8RsdFisdpg0O0ni9T\");\n        a(\"lQTR345AgZaqDXV8N91cjPfmrVe3fyi6eV9gS/UGNb49bWGfOoJZLle54avtU0IK4yWXq9xA5fnMVk4QIFexIWkFYpJQKzbBy1\");\n        a(\"du7Cl8Xl8AxxyXM22UWfyCFs1xuaqNJ9kv7fS/wuUqNnLMf1VfyrsvytdsiEh9TdUV5nK1GwvIS5zncuWF93PfEBJ5Xr5mgfnH\");\n        a(\"DZYq2A/lsSA7+x1d3MvL8wXK1AeGVh1h2JDd6K72V/LzmBc6TyDDVPECL4+FwOuu12+a15vPk/+BrFfYH+VNC1fXU7VQkS7x81\");\n        a(\"QuNPP9SinbaH+L+vna1UXkNayJNdTU7a072fFtcZo8reRQvg2pHN01vLybQvKFrjy/nvJCU5JD+ACUNxZmNv5swzjNy1cuUJR+\");\n        a(\"sdVTjsvVLhSzbyhvOXnF6jxYZAaFW9bP1+lt3zKIqULvpKwx+wrjmt1dR96rfzGa3+G+B1zCIydc/U75FA3sbjIL+ZbywiTi4h\");\n        a(\"tYyELChzROZqCq5JM1513+nSLjOQjlKxek+N2o6qD6/Llc9cILvuyibb86krNczrTQYF3t5iknZ63OwxcrLNS/7hUuZ/WCPrwV\");\n        a(\"ffVYzwDelZL8NfTUwXUkNS5X++KVlFzgctYvANnrP7qnFLi85YuoZjxctdWfB7RB3vrFCHstQtcf5vJWjnrupJ+vX38GWc1rnX\");\n        a(\"Yrk/27M8Y/4Mvrq3Vwk1fqOQRyFo5i+IgtRQe4XKWjFU5WavxKcTlrxyU9FtSM+jzeVh4HyPNzr6j/EAvFw88L+fqORu5ilA61\");\n        a(\"OMkEl7dy2MFZR1TvmufytY4v7vKatZJ+i8vVdxzBY9R4mOV4iNSWeo6XPztW4ZBsz7s7dVmuBS5f5SCBd4QwtCUuV+1wKOxBCp\");\n        a(\"b9JtknjQIHFNnvx7DwOgsHsPtXkoXXWTjAzf5n4WkWDmgoFq9l4SMW+jcVi/ezsMUWxWKMhXr+G63d5j13DENUCR21L3Y2omjl\");\n        a(\"SUeG64u3t3n/7xH09adjzvBT1fIUZ9lIrcoxPK+1W/OcAj//kTbt5Fieg3hAw/36CGueEvi1eWkeyw7l2ST2Ry/t23yWkojjex\");\n        a(\"Q0T08HzaNt2pk8txVHZfVCZa1F/V6a54oNz7BDeTaX7HaEeQkuiMUvw3c1qP5ZOIrmMe9Qnk3isJycKndQz1HWPJeRvthJ88g7\");\n        a(\"luegeqkci06OaPhuC80z20XzaFSdyXNbsTQEsbGIvTfAd2hInvNH0zz8DuW5jcg7J/9uD80zdQzNQ3MozyZxXJ2sIJo92vRe1v\");\n        a(\"z7P900jwWH8tyW9c+RmfJMYf4Ymqfko3kU/irPsxv+4d//GVBkzXBxVP3+T7fN/K+H5tMad2a77rg2z62e2Gs+6/adQrr3WJrP\");\n        a(\"RNyZ7dvC7zNSPKoy4uEemmfrcTSPtEN5Noust45cYBgyiw+w9qJ+p8l1PM1j0aH228zbMyDrSXz/jBqXlmx4ujRn8txOPENORG\");\n        a(\"U8q+G7asR4lD+B5uFzKE+P2BuJKLp+RjQekyvfbZxgzXcJ6bkTaT6aQ/luI/bN6GhTfDeQbNeFk2geGYfybBKlBJv0xthiG3y/\");\n        a(\"kOaZ9tusW3Qoz+3Z63I5cvHa5Dd3Es1ztpfm4bnEmTy3EQNxNZmIxwL8O5X0/SXcR/PwO5TndiWerDH5uJvupXkOBGgesw7lub\");\n        a(\"2I11wgOttH8/T20zyyDuXpEdc+GBCs/F5AOEDzFUSaz5JD+TaLxovHwJQSuRjft6V4NgZpHkLCqTyNZRT8VuoTaZ7LNjwnHMqz\");\n        a(\"URyLXnj6TDSJuBCkeb51Ms1jzqE8ty/5dy9gk3qMR40n0/P63ADNI+dQno3iyFiln2H5ZLo9FwZpHssO5bmjOCZfoETkmMnP8N\");\n        a(\"YAzXf+FJqPV3cmX494WtwYkcaMb+mUv0tN8p07leYz5VC+OzO+5bXw4IzvalN8Z4ds/KEO5bsD49u/WR2Knq+DLP9eOL1vdnGY\");\n        a(\"5jOQdAZfen/7+lE6toHM58c2IVGNxCfX9lHMD1mP929Bf20jNvNsh+kxdzx+z/cEA70nGpgDugLAfgO1kwzMcOwzMIX8NDADdP\");\n        a(\"kNzAMzvQ3m34/pC4yVdVwYttavD3qdk2zm9/8z/WpBxIFZHu9HXLTT73go2F3Wr3/EWr/z0OvS6TbPE/8z/aZOhh6BOWCex4Pr\");\n        a(\"0K+vrN+MZD3O8vHBN0brT5hxln6FAegVqAHTwNQpyD/VwALSPYNIR34Y+RowzeODpvlJaNz4JN+aSnGMWutVgj7TIZvnJofqtc\");\n        a(\"D1wPU8BL0OGyidBn0hPQcUhq316hmx1uvubLnvhaI6GZVVSwVPQI+jN3uuuG3vd4fufe/MwiW7n3DSkyH++xzdfR1eX+Doo9o7\");\n        a(\"+n1Btj+wv6+9J9AfbD+6W/R2d3T0dPZ3Bq905VF+ib9fRDsJH+K7kOM2613qtJPvjOr0vNSwId/DzEGf/DggNDwTS0ZX92DNRm\");\n        a(\"IzevRSZXXx9NhmNTKViKvRy5VE6bpm0X7AMFADpoBpYAbI61rk9gzeBaSvmO18nJ7H+s+0Gc8d0i9qnrNDw6PimeVnMg16qLd/\");\n        a(\"8QAXvc9y8sjpIzdb5Ht4/uR+wn7T7GCwmR1Irruvs3eYzpeG6euZmjpWVS3yGyvzj9V1ROvumzxFVsn8oHI+mT8sJ8j8Xi1hI7\");\n        a(\"+Zvr4/aDuXXadhIAx3AQuWvAEbJFgYOU6cy5LboiAuUkEsK8dxG9M2qZyECh4ekcSTuplSV0LCm9Hn+W3PeOI0PTo5p6vu+Pf+\");\n        a(\"9but179SR6//k2y9/o/1D6//jZI330uG/e+E+XldR7f/ZhR4rk+ogyxv+KEOev8PdXjg6qD8/v3PW++zQx26pr32P3J1aNUhV8\");\n        a(\"bzHjfUo7YqtF+uHvNpsM7VZdL5r48719+H2u//0imv/5sq/OPLzn8+jfbHL1r/3xnoqsKWHvun/MCP6+Hya6wA1dXlV40KTz0g\");\n        a(\"TwOym/FCvqBC87h8OwMK3/X6Qm62C+/nwbzp/EDDZLTRYJevPnBKFwvRHGqS0HTSvfm0Igmjgy4BfZLw0aacgmXj+JT3/fKY8n\");\n        a(\"gB/VZPacphPquLYVwc2PnTmNn+EPwRWDtfPM0XZ7Y/6cefdFXUp4akSdR7R10flmtNqTft+rtugLc5CwPm/LtmLdc8pgEJsrSP\");\n        a(\"M9dbDvsSUBaPcQc0SkBuOYjoRR4DB4gZ4hBxhObjiGPECRqfIs4m7toNCcbRwPahdrPZqJGn/QoYp4gDxAxxiDhCzBHHiBPEYw\");\n        a(\"7v6lLkw3lcvh/jOwipq7ZuyunnQqTvId/FUVSqURPLUg/YGlFMic70u9ooUTkWRuRaOi5VbtTJ8dYotbsYL38avd9ridZr9OH4\");\n        a(\"1/VMfRCVFtXE3c4IPXQAt6XQl3qp5uO1VHtRFVpO+s7sdFM6valF209n6xuyyb56u7iK57WNdf3642pkiJ3IqrF8ZJTSYNKvQU\");\n        a(\"/etqq61CvLoA9BP3GEmJ95+ZLP4tGCk60y/Qad/WR1UsWYH/DH2pzUdkiwa4hopNaL2fwsDhBn7nywJASbgE2tTSlYex9hKbc2\");\n        a(\"o2CtPmIUrL3vRCy6jP/tq9dvlq/J+/GSGn75sipUMehtVaHtap0SY+9PSWAtrJ9Ruy6lmZv57dfX5N3nKZ8shCM78flAy2NAGQ\");\n        a(\"eY/H1Xcrlu5/y6qUma8owEiBniEHGEmCOOESeIU8QZjociDhCHiCPEHHE81acz9VFc5Z8SPTGjjJHv9uTKZrn6NHT0m4/8c96Z\");\n        a(\"837znm26jl19spDOrneVy0K7W5aoiq6RohKFmPQhWA42ATvMqTrZh2KtrEZrQ4FW/iLbnLjPsG0epBQigPM2HB9SqDnniFuBGP\");\n        a(\"lFM+fazHmHxh8Qb7s5H4X7fErApp7nFAn2ln9zx/9kcd1+w+MdNO/4p2Af0qHd1lGwD0Dmjcfjf3bH//yOn8z/18NV/v/re/vj\");\n        a(\"8/cOUexruXtSqFbJVhU31vvDyPkzpw0DUJzL0GZISzL0jrsOVZdeh15CL+2VS/8BDSRN27tcQ5qMuKAUl8T22SYHW8aMGTNmZG\");\n        a(\"RkZGTsyMjIyEcoJnpYkm0JT5H1fpJO5ECW39NzfP9Z9fn2EAleMdM6+U3PbJeSIv1jWvOKBP6A3S0anlkrXVLLPzFMv2y75Gxu\");\n        a(\"DyKmRZbZitqc9+TONPH9PAvHGTQUN8zgfuJ87RC23i5YpGU1DKse4BT7NsSu1VquO7tl+CRYk68wYKMUSuZGINbOU2J6xLJ9Yp\");\n        a(\"+RWpCAJgvhZlD/QuagN8jcbn0PBVL1c8jFVn2r04nWr6F+dpH6K4K9oJVGQ/mctmNZyv6wm9OkrkXPtxfr5j3q75pes+xSeuQY\");\n        a(\"NVpqF+59Q+nKD9vyG8EZMQXXNTpVGIqUxy2k8n/Z+QyPKyeUNhc4FtIP1XjqivGP0pWy7V4Y/hH1ff44lDbEfAiHP2dI6mBdKm\");\n        a(\"dQ1hyZgHJWKucwDjbQvFS+Y+U+K2NHFeWcOP4Bu/1EGDhA/L161PGOffPcS/WaTP+gUuz41ENrV0y5gYYFKpUaMy6NoPqSp+PI\");\n        a(\"9ZnzSDuIuuPsAKHjKvRhcByRcZxfJehvoA8D2Ihe9+P0A+i5IDMyzJMYANcUHB8Mzme1IPLNaSFo+/K1DqyC44KryKz2FeO8Bc\");\n        a(\"cFQZEBHV4kc//A8cHK8bYWXLUYFwYVh28UVB56LvDXe6sfnwOOD9AhPHedPCFdcJFA2tU7FTwGFxPscnL6zyFjMz4pKLVux8Kn\");\n        a(\"4ITg0f6OAkJ+ChwX5Mm+103QEJwYjMl80IEO46JBk4+q2cmBCwMbiGo0nBjAgZ4LPow+6ef/DpwUJBh8VrMjcKExv5tXIMgVpE\");\n        a(\"WD+01BM395cJJhvF1Ug21wEQN29YuK7IETjMyHu7qPeQJOMAbnSjqOuIxbGG1JWcWcQi8ZVlf31D1dg1sYQKdKYgB9jJFytJ9M\");\n        a(\"4pqCjxgTh19VdNZjXKzBr3+g67kBPmqY635TwF1wkjEsUCnP6/bkdcZ64KRhK8XoiiHjR/q5/a74nd+HXjRUwU7l+AkT0QYnGo\");\n        a(\"VgE+omcT2By4GD/WWcxE3ARY0eP1VDJS3GJRsZYGE4bMU0cAp+uRf4x8zlG51qyaeQll5UO7/U/3kTxq2llluRk0vosZBekfVj\");\n        a(\"Xn94qX5PXtc8X7c09a6m/j9zV87rRAyEEYIOEOK+ZQFB3AIEEqLilpC4xCGgoDBZByw23ijeBUJFzdFT8l+oaBAlJT+BkhKPPZ\");\n        a(\"MlXnvechQI3ntJ1t/32eNrdux1yiXuv08e59frTkMC/jrLf5rjB/0TafwKwmMC7jqbvxPH/0v95XN91j7Av9R13v54mYkj9Ypn\");\n        a(\"rZrfCK5k+8fZGfWPVzSusuknmD633nnrztULN67fvnM7k8/dFEcyQ2XraopBipF7tXtgd/tQxAiOPj6axm+nflSXw8rY2h61Eq\");\n        a(\"kc1CNZ3AVpQMJp6sdGSDGwoq7836NJ3KauXsAqmNu76TeQDhQrKlKKf0uX31skKkwHt4906AS8oFVUynpBPZ6Uakyfd/F7ErpE\");\n        a(\"BSSmnjMk9U9RPK+ZlHooayWMHKsz4pyY0/hPipAvWYJnMhPqhXZa/exQEDXw5OwwWDjfXpSOvjWCLJ2HLeY8Kd1tjK5lzv8/SO\");\n        a(\"uqZakey1Jc16Ww/gBU35bxUGjhOafNEA9a7FUPajypZ4FLB/apJ/ujfMDU/M/y8dyTJfEP5/tPxLNw3yZscAd9PibTagI3B8oe\");\n        a(\"FTdLJa0SjfupnyhKbkVjdA1h2VnVeICPTkpTiKmCNqVLldDdlcj3dGoqZMU8dHGbEedbJ4VAjajwjPJO+q0ZnZoQcJHJ310jH5\");\n        a(\"UKxpqhPyVfjLR7C+pnxMAijtcbBaQfeNSLjN6Ojp4zvInV0vaI9QCJatnx5wrEEEZyqKLx54l8psCgV65cdF0zmc9YTxOVqbQu\");\n        a(\"LKC6uI2Iw6BC29Yh1tqvXDpA9Vg+Vtn5CUoThcajkS1t/01ZPcTw5aGOMhMTF2Vj23vMT0gA5sc50nG/G+W7JuGY9Q1WzzNl8w\");\n        a(\"nn3DrDNc5o+wfFAVE1fmniEcxt9mivdg9jumfAKTeZz0O0Py7wj32YSjx/Au1evZhIA3c49LGlU7p7tcsAChifBW4e97f8wiX1\");\n        a(\"egML/7DP9dUjw84Xgbj1tHDothcUnH02dHUAAxC2n92k9qitFzlSmXLG+FcRP6RuGxjTP+kQ8chl4vsX6bTeUpbf+Xe3lXq66B\");\n        a(\"upLv/OLr91OAdbRMW4vdT+XFF92LF1QFQh3FtbTR3SOyjL+vkhAQEArKUUTqTHw2qeDSz4b7S/QIG9HArP6d7Clj6aVmOnhUMm\");\n        a(\"zv1oKra8sa6psPPw8yn4NaBbVxnV/nrg1WT1ti70axsW88jKVr/MrT9vyek5CoSx88dd89TlzMxH5zORH8+UqwlQQvL5i3WEm0\");\n        a(\"CUGGTrbdeSekCQ6h+kN6+kVhOdNdJO6R5I6LZUxIREwJPJ/7rFcdN7tILpXxu7uh6DkFy/oPvMxoKnZ/wI0JhoDGD2PUR+JlAY\");\n        a(\"pYpfxgS2fkgfy1dXra2hGR3l/f9Wd+hZPEldEQXXn0kX+nBXM2UvRhdI4lb8/RM+9/N5Ofvczo/XSzwn+PY/fW7nEs64eErlfi\");\n        a(\"zH337/Gf/9dcz+9gc3r1y/fKNz/dhifVtVi1vn7om5Dx8mhCs4vLSfpw8r+Xi2b3z2+xuMG0eGAjtFXyp1Zza5YkbVYn2vXn3n\");\n        a(\"UpjGz5VaWqJd23cPwX3k2bhugcfvESGS95AGbUWvKTcfKB8Ob5oxzNKq8BRqycx8BWy0UPKN8rO5w7eYqf3v2kz514smOoYffc\");\n        a(\"F+9d3/ZZ4zeHDbx/nwbdqPIv9fm0K9SPj/zLxkZ9aPB8H99wQ45DJ+DOkN5UQOdT0LkuBHq0IVR5m4YKRHBCjJzNO0WCrGqn5S\");\n        a(\"4f4vxg9tdSQiUSNKv5r4/WK2KJTRqkjnI+b1CATkntcj3mftcYy8/xPzt0D+vvGathY8Jjl93PhwpDZ4s44OzZJ6hBwHJpLLlG\");\n        a(\"tgXaXbw6LURglX+7lybezqwPI11gZjN1rkxn2Ev2E3QiKQj8Odb2xwS4T774ouS4g5F6KQtRShClj/ptV91Ni2UNl2hpsLjlwQ\");\n        a(\"T3Tdi3cYEEPiTa8HwOY8cRm/PLMXb+EQIwBw7aqNMy70POHAE1kPn/Tof5QUjZOpb9h4ZKG6H82EW9iscvW9PsH/7NEMIGz7u+\");\n        a(\"UdJWlrocBLHPlIXS9+l74aQWqWnzYL/bKldPCi1zioEDkHsvt6L0OgpV1ZUUXvfgFFcMAlcGtincz9/qYcfyb96pgXgp6MPTu8\");\n        a(\"mfSbU7w+3qbNT8auWCeOGIhenYQ2Shc3SCmSbeiiNChFRBGhcJf0m9072AK82Bzo/p5n+xmL9XmYCgF+M7bXM/M8M3s37x/qeC\");\n        a(\"nJB4yoOl429SDSAiLc40R9RDfsouQbgGJ9Rvu8mVgoQNGeznH3uIGFT4OxbJlS+nNQzowQnk/JXy8SCPX4Wv5u6H0jfp8u9olR\");\n        a(\"jFyoioL6fYOgKGIl99lTb7pSh2mq4yD1ENPcN8of3YREv5+3w7QD4VDYI+VHYOO5L86XSW3xjbqucL4E3OeFHj6NvBBnmHBRnA\");\n        a(\"PqiwKa/oV6svXr94mA1n2bdYpQaiEAP/NXn6v4NWEFpcozwqz6mAqbLZAl36iPj9RrZ9FvUF9Ss3WVIvX6KAD/UukjuZDsR9YH\");\n        a(\"AQWm1vfm+j4K+uxcj//B8ak1cJEm7cxVLq2GZM21Cxkx+FvzEEbTuF2n8+uQHFGU3pj/ZeZVBzj/aQBP/++w9K12ZuMr3KFMsb\");\n        a(\"KPen7AAuap5Pj8fpfv/2f93+CN1B6WkdjNI8h7qKw2J9jP+HV2E+7hGdkJ/qfMj/ebp6SV0OZ5W1/8+vP3YmNAmsDRQol8i40Y\");\n        a(\"oUqOC0UfkPf8vFnBz6fmXMjPX5I5+dBjoNhvG5FDaOtliJT88PqASHpr4siv5svl2vy0Y7zBfT95d+oV67Feqn+dHKsPquIhmJ\");\n        a(\"DdcbzA8xb+kMxDcd/JQ2V7f2k2h39nKwechMbPzhkpnov4EomJT0uuI1byXUAS0ubtsem9bIsirvqAyIBmvqe8zgZK5dlBzSuh\");\n        a(\"ji9kkHzPec+/TkA9cod0+xMRzf358Mo/U7DqXCZvS0DzHGysDW7oUNpAfCN/X8m3NgADjjCxv4WJ3qv93bfNdMuaikHp+6w7G1\");\n        a(\"eK+w7LSA6FfuBb6/p03N72+d0dPf8oEInvnN8xJAddPjmpcFqY/ulWKjvh+uiipP3/Rx7Qh9wt06SGKB3/ABGIYKZYhfxcrS/V\");\n        a(\"XfD2KruUxpVeX0LI/LHoiz2Gz7RdS6vTQBT+JjYmk8ZHfWHEggUfwW5qra9CQa8PFBUl6koUxW50JdqVuBMEQVDci+JO3Ii/QP\");\n        a(\"D+ANGiuHPRjTsXBcGNfqYTJ53EIQouDie5mXO+b85rQi7cu220iU5Gl9m6fH9NvVT/XkdcctVGxv7K62RofM6pkLdfy4bq//rp\");\n        a(\"7+IrP1Bbfu9y8sDZo1TYpNbtV3oTpYMd6GInetiF3diDvdiHA1jAQRzCYRwBbN/dzybnzh47cQYAqvz9nusK96HSwhVwF6ilA9\");\n        a(\"kVpxuNpWgMKT0X8oY4/fkbkPl4uQ5Yx8F8aV1u/bIalvVqhbX3uO4NpUPJMKKaQI3661TZrxKnf2tvCbwF55K4DoilDpZ2RSe1\");\n        a(\"e5bZa5vsvqCFgOgAma/0OlyKsOu9dV8vueRcFx3tW9n4NfjJ7Fl6/Wh2rX1UwK27qItDmFma9wpjVQnGoIHBdCUGkxUYjJdjsL\");\n        a(\"gMg2GIwaiOQS9AKLZCnFY4DnVrOVoTidbYR2vRQ4t5ao1ctBh/+Yr82g20p8vQnoRoj+toLwZoDyXaIx/tnkd/62f++g30pyH6\");\n        a(\"kzr64wD9RYn+0Ed/5KHfY7zExtm6tBYc1oJIcz3DD4lfJ35AfEl8cqFv+Y7PzfVxA/G0jngSIB5LxIs+4qGHeLQUcc8lzhriqB\");\n        a(\"wluRw5Dn5FXtWYjruZO50jXY9RgIg4EXEi4kTEka/ma/MBO/EjZRNFrPSxMql/lZ9z+JmvlH9A/pL8ffL3yJ/cRy7518h/Vco/\");\n        a(\"7zs6Adw6BTw9nuPUDNGkfZP2Tdo3ad+kvXw0zwv09YXy8pSxt8BFsEB2+XrqKq5mfadYklg+sTxiEa/npljzPVvs7x1ngeeUz2\");\n        a(\"eKfWPloPJi2pj3s77YrPtig4cNQ0pac9vTWBo4OobW2pvfx53zgLwAdKgtcaw08zoXgSuUrxeKMcns0/0nOg4asxrG+0tA6zLw\");\n        a(\"kLp63A2c/LXiodfqninnrJ/b8TWO9Xq5h+UL+Y76+174cRV4fI29cNXYT1LGS/XxKqOPK8R+003WPOXzDc2xMN/X+ljLOl3LXl\");\n        a(\"qrfIishxJe5+Nsn3lqZhSx8v5scy6ind7DTM7dBu5SXlD0Ws3fjFXm38xTee7KZ+R8jNSaG8aa1RKrRQz9U7OGjZxa54fGrMxb\");\n        a(\"LoHkvMnHohjT8pjZtcXmf2jzXSuZr+FP94GvlKeU/83FPIuVtubRzE3pvEqMeWa8E9jvy2fvn3r0j+8TQQ2B2AJaG/Vt1FLel+\");\n        a(\"I+hyWdVEfhkt/nWr5fjz0BvlPwVOe2eJ4W9b/mquzd2l7/lnOmYK96v6u63JJzM2f2s8V+npm2dl92v4Yu5W7NTzFm5Tn7yap5\");\n        a(\"hv4UhXH8eey9R4SQn+y9905GRNmrv1227E1WZEYoI1FSyi6RTVmFvEIo8YJIVrwQn64r7nPPPa5x69tzzv0959xznvOsc84vCx\");\n        a(\"rqxr/an0uf/w91ydtTDnl9/jDR9qZR9+Z18Vj4r5T4Gck1gOy8JHISnAF/kyNOvixyCNQDafgLXxHpCW5fTjtuzz42dVxKv+7h\");\n        a(\"/mtK2viT94ZITXD7eooYFuT8+cj58+Iba8X2T8/pZ8JNXCP0R1uvr8/6Za5ZJufZG895DHX6NrN//+38V98T2Qt6A0+/zn2StS\");\n        a(\"efDfr2uDZ/Pnhf5MsDkRFQu++y9UTbzqHB+lh9CKnb7xfNI0WJoeG7WI6H/UXkB0SeiRQDVYBLf517lGkm1mQZf21knobHt2+K\");\n        a(\"6Frh3FJYj0usrz4/dGfrL7LNJnl0y/e5LI3k0iZPrmXy5JB3k+H15gT/Lb5YP/jzfZDTVEMvTPlv4lbgI3NK0dCmvp+HcQZGPG\");\n        a(\"hNPGhNPGhNPGhNPGgdnF81iH83sIXc2AJ2wF6yTHgWmeocBGp98/HsKlfBCJDGl9o5ROLM0aieT+W3s+Ap+DGGgO/td75s4Riy\");\n        a(\"cqlsya3yBj6lPpD6VeovgTeXQf+S5OGai/uc1PiaJoWlCevRhPVowno0YT2asB5NgvWoF/PfdQuo1C2kcj6/OmVwhN9KFVZpCV\");\n        a(\"znJDFfuykqm4mcWpcsSv+0F56y1CtQf0Ld5zt+niORX6APldCHSsF+vE5sDlOKqeQuTg2auO6hb0SHYvHgE20LllDZA/Wdr1uf\");\n        a(\"nbOkykCwgbY/+F39v4DnPdgArB/wr/OflxPPtDYZnUqRE6Y5y9heTuU1KF7erGeQN+Qhb8gd5g3ud2lz98g7M5+ksc2ppPIc5K\");\n        a(\"/sX58V/L4bVAT+/NXK3dqD9VVRWyifwU+Bw1W+fzkf5WngNnXTV+q8YVxVlQugIvgxxsidRTiO8DdzPpuPPB774hu/2pg9nz1c\");\n        a(\"TeVLdZV2UBNnnDmFK2a65GN9xeNaKutrqyyGCs8j6Dbqe6BuuafX0891VLLqqqwEzvzJjtHa/tHoWPfUUzlVX6UeVHi2Qi9S7w\");\n        a(\"21srY+0q7h2AYq1RuyhtDYOtn44Gifl/ub8mAEffhi5U54ejVmHaFWz515q/f+Ktr3qiYqBZoyB2iatT4H74JmjAUqPCegK6iP\");\n        a(\"gP72/Ay+bM3RC6hz3MH5L2e/jLUk7WM5A20LtlCZAk3bZhb8r0A98CdrM6WlymdQBHj0LrW952+tsgacb2V1xb3m1dqotAC3ae\");\n        a(\"PjOwDPRdAbJOov1NrBprYqg9rRC1R4hkEXUK8IdbW3uVOR9uROHYiNtBGeXNR3UT/cLp0ele6osgocpo3wFKS8Edzu4J/vO3jy\");\n        a(\"dkKHoD6+2fBsAhWBkcsf2UezzipFuzAu+knT3vrgB7Qt2RV7gf7OPubAtx+0A+Ede0jt+YTfZ/vvI/znaUm5RuJdQthX+rzG87\");\n        a(\"2kcWeKSIb74QwyzyDzDDLPIPMMMs+Ea/ZH/Vt9iOQ33WJ56qn+KkMG4HegYdu/yJk8Z0uRceSiTc5w32XGMVil8RDGAXXFyp38\");\n        a(\"dh98BSnWw8rFm2vdHYYeD8feoT6+2fDcA/WA0w/0ifqB7iOQLXgDv/B0ozwaFAGRdg2i33nI7x/BYuDSGzPv1PFiX5ZKoZHYIN\");\n        a(\"Tl68s4fFmDUSpDwXnaKfXqlNeBYyApl7D+uNlo5j2GPmgjPBWoT6P+hLrnbt2ztuZdAvXcxdi81O9b3O/DfXtucrFcgdy+75vz\");\n        a(\"EivzECuJl7xHFvYcxanftyaxB52s0hEkfT+NH/Ddk5lyStl75BFSKwe3zdeI2fywGdj8TOwBmmZvux/eorPIx6B/8l+dJbR5Bu\");\n        a(\"oBMxfnWnyYTbyfo3IURGzD6HWjuSo9wHn4DjzLJgUp9wNjgC9+X+P3h2AKiMoqJ7LK4fSPLeZhc+DNr21+OTeysuoyX+UQeEKb\");\n        a(\"SExLabOzF6pkX0QusuB7j1nUC1A/v8DMzXx3LTynQT2QlLM5xx/KKPuP7y9ROQKeLP7e852lrP0yyrwL/BLlpaAi9fAeyH+/k+\");\n        a(\"W6twErVHaAc8B79mPjiD9ux3SwwiqVzGrkt1JT3b/9y51Mkj9X8GCNyrC1+F8gPPepT6e8B6o/c7d4ztHHf4cX1adcMb24s06l\");\n        a(\"73piGvR3/yE7CN+VjdgH9LsPXx74cP95rD//HL+ZfTyo9419swrBIoii8PnHLuxE7O7u7u7u7tYXxcbAwsDu7m7sBLuwu1FUDG\");\n        a(\"yszxjz2i8+uHA4Z3ZnZqd28i74md+b+Ik8kvk7bLWZ9jyLNCqgrMCol1/f5/Xp+Mo26Ot5du4xrB/AltE/GHO/WsNkGRdQC7CU\");\n        a(\"cOKqNDagAbgP4f4qXfZ8zsf/bj89LPvpYdhPZy+d8S03fnMzvuV+Z3NX7Zu+qu2EgDpP5l3jjXe9S2+Id2Vq2UT9ytln7qnM1Y\");\n        a(\"DAr/i/g78C0ygL+Ed7KzEjBFOEd3mKJp+nYCIe8Hw648HMgA4A3GoyK6DL4BXArbPcHzgnoCVAXDfwvwwtWFzj4HW488Gftxm/\");\n        a(\"B2yNE0/mUofz+GbgQFjGhWbv9+e9/sre5Qs/Vtl+3f5+af0QI5RiNALs18d41z6ifFPfWszabinpXOTrw9utZJL3G0RSu+tOtZ\");\n        a(\"YFtGpFQNtX4h93Htw70VoFRN3iDqC3LP1QTr3fp+/LswTOEWiLWWiLWWiLWWiLWbzN8VdpS7+GfZUN9CWrA98dh2JGDqbI5O3z\");\n        a(\"9Ab15+ybGHdBOeIQV87N9AlbiA83d1RnY0DJcJcF4sqFuxx6C8/NebkxVh/F/4GtxAn/yjyo3DbSsJ25wNZff8dI/DffQf8Hf6\");\n        a(\"zjd+cYrPMpv/iU3w/2v386xvqzI6u/jLg7oPngIPilNpcszNd20ub88eUexq69jF2wlS7bnuar78ewG/P3fqVvObQ/oIUH6I/g\");\n        a(\"H8+zf38f/fQh5seHiRv+9THYp5czdMOu+d6RgPYfpS+EfXnY8/vPx327XocfDyjFCdo++FG9WmHLn2TeBTaDH9o6G/P54acCug\");\n        a(\"nSgV/xX/90QBuBgDGf+uF8dsAZvk2QDvyqLUv2swFVAwI/8zsPPztBO/B1PVg2Kn688GyeWZynT7rAOgkW13E4Pe52cCB0EN7h\");\n        a(\"0n0Tx5Ev48h8iXUMyEc4cdW4GFBb3IcuGHX9t/aoRtsfciWgcyAf+O764V2/HfKLOYhfPzx6GFDfR6wtr76Pse5j1gug3Ad3uO\");\n        a(\"u0iRd8W7h/Na1Gv/jT+o3xOqCM4OKrX5urDMXvIlAOWOdYRvv9yubK6KP9/d+0ny8bxOkBEHg/nwCMFVH9vobvJ41+5+tvMG4w\");\n        a(\"p/T4vxjUfdXPY99OmGTEm+zdGJTrm34+dAinQ5GdyhHev9OzWWfOu3/+j1mO6E6jYxIA9nYvvzb3tdPaKpZT5/TkkzjftZdtRn\");\n        a(\"vx65XlP7ApJm/WM3st/+M22DCz01gQD/xof/M6zyNmcVoK/2r5DcT/mazUDfyjuLNkc6oPBH7kbzXPL4Ge4GfvzpPd6QAQ+OG4\");\n        a(\"/6n/NPdOvo43aC6nXmBpTvdL3+wV/MbM7TQV/p3xfThhLoF84FfeUzGPU38QAfzOe+7jP39e0gf/rK1swN910BNY43b2fE4jwB\");\n        a(\"pgPQ+X36kB6A+s55fePi/Ac/BNG7PW98Z4nqGg0ylwkTjMcwe+HWtf72ZhpyxFnGqCH+3FPuN5kaJOLYH3Z9nof65/Vq6pijtV\");\n        a(\"AfeKOfOd83j2HMQtYX179j7JFPxGLelUD/46nV/PE36WvrOlCFeaNgL7uH53vFhO+LugHPid8+juZZxugHjAp9+fDZr1U5Y+u5\");\n        a(\"zTevBV/f/CuvcX3L9kJ22nLXVVpy5gCvjRuUqCak6VwFL8BURc6H5gAbDifcn9MtWdOoIfxfuA50lr8P3C79o8XAN3D2DsNZvr\");\n        a(\"qlP4TVXTaRjs82rY5L5fNzQw1g2/sA7ZV8+pfH3eAX/0HzuMYjPGxiZMbMbY2Iyx1v+xpwjXu4FTO9hYh9pngA1+zD/ea/39by\");\n        a(\"F9E6ch4GJj36Z/3RYkfVPyB+4R/lfDXMJ/hmZ8v/CvzMcG4rdwc75V+LP52Nf/GprtYw3h0rWm34G/3mP35f9lGkKRhpDfpCF8\");\n        a(\"W6eZ4FAbH4+3dY7u3V/lPxT5h438DG3vlLoD6YLf/w8SBhuG0NgwfLbH8dV5nGkzQB5+kX9sc9DB3tf3+Qm8K+uglHUQytpR1g\");\n        a(\"HK+gBl/cG2Hv0+hl8vg9zdndr3os11+7YP/2ptaX7P1j3fdu3/Dez+8f3/q+GUDJvfZEff5jM0+QxFPmlbpNt/0+Z56RHD7vzr\");\n        a(\"fOPHumd8v38exydb38//JzJtfQeNcHo2kvELNuwuzDB9RzldG0MY+Lv1++Crf4TGOm0cx/wP/tUwecczl51Amxj362Fe47/0JP\");\n        a(\"oS+FfDHMR/xCn0yXAgJnXaLPj7ev1szzgQLaSiNQuqaPQv0ahr4jDPzO26+cH/0l7/yhm+/X/2z+2X5jltBflA4Ed2qnyT+n/9\");\n        a(\"k1eEaFJJUG1WENWDe4F66GFwquhSM3Q6uBYYhq4HnwRj0Rfh+2ADWjGksGAH+l4cKUxc6RA6ApwEnESXiydNBhfRU+FE8aXb6H\");\n        a(\"RwLfAQXQ8eCV6gp8L7QdDZQXQIvgHCou/BIRNIUdAR4PggNvoi/Cwh8aKVSMoGUqHzwUUS40aXg3uDYuhh8BpQDn0RHpaEckDD\");\n        a(\"iplUaoSOBzcD7dDt4KGgK3opnCyZ1Ac9FV4LBqPvwdGSkwd0PHgamIheCqdPIS1E54ODpaTc0BHgBqmlXeh2cJuM0tG3Gt4IXq\");\n        a(\"C3wFczUQ5ziB9elZXsobfAM3JKpdBL4au5pE7oe3CRPKQNXQ5Ok1eaiU4HBy0orUTnKySlLiKdRaeDN4Pb6C3wLfAQfQ+uVZQ0\");\n        a(\"oOvBM0HQubwLPgnCoi/C8YpRF2hYpUA8dDn4EUiGVnHKoyRli54Kbwet0IfgmWVJM3opvAesRB+Cw5SnfNAR4ErgHroefBK8QF\");\n        a(\"+Ey1QgDfN4F/wYxECronQaJENfhINUkgqhI8CbQCn0FnhZZer0rYZDVpV6oiPADcEwdDt4CpiIngoXrkZa0eXgcNVJJ7odfAzs\");\n        a(\"QF+Em9ag7tDt4OQ1aa/odHAJ8BRdDk5bW9J87sOtQDZ0uzcM3Xl0HVMAgPFBUU4x59hqf/ateAiKYFAEwaAogociKAZFUIy9Kh\");\n        a(\"gURfHsRfEQVBtMq6gqXq0Rxdhjf4i9lt8f3/m+pmky986997VNOuU5GKYbvPjhxqxDPhttOuXoCPdUR3wMxuuEv8ZE3eCNK65T\");\n        a(\"l/kiTNYZP4gpusZbeSZKriOegT5d57ajXKeu8AwMfMjb+cSj3V+d8M0o6Sr/gCG6wfM9wqxJB8f4u3NEOuYz0KJT/hOxDo41Vo\");\n        a(\"zQMXegolP+F+06OM5+QofOeC7G6oLXaTd2XeZ2VHXCjxxvvLrGs5HrOj9/gv2lc17sRNeqQ95slPU82Tzw/Qh1jd85zRh1wX+h\");\n        a(\"SQen+zho1jlPGO180FV+DKN0znMxWsdnGC/G6OBMaxWZjvlCTNQZv3uO7+nWBS9+rjNTh7w9enTEV6DQGXfjO53zx+jXBa88xr\");\n        a(\"h0iZ/CwIe9D/+D9XRwXhCsiSad8e7nG4uO+WS06oQHXmDt6ZAfRruu8ZgUuso5Mp3zB5igSxe6d6hq/wdPsNrF9ogucYI5usbP\");\n        a(\"XGJcOucDLnVm6Qr/hH4dXGb9YMAjfi1/jEG64Lsvd190nRcdayw65I0R6TLvghYd8/WIdZV/RZsOrnBOoF2XeAckOuIj0KEr3I\");\n        a(\"lUZ7zEOGtPh/wQMl3jAVe6jzrk9XGPLvPumKxjPh1dOuW70a1r/BZm6oL/wBwddPqncXhbl3gzzNMR74fPdYVPw3c65evQr6s8\");\n        a(\"FfN1zgte5foedW28CdbTZY5R1jEfhaE64QyRzvgutOgaz0Cs6/wpRugGL3i1PatDXgPtusy7ItExH4UOnfBFSHXGd2GsrvEcZL\");\n        a(\"rO32GCDq+xNjJrSVf4OUzWdW691hzqmDe6zn7RZW673lzpCl8x3lzpjBe8wWuHDvkiBDVv5wVvtN91dpN1NMG60hF3Yj2d84o3\");\n        a(\"+zld4osQ6YwfRauu8e8YroNbfB/Era5DR7zjbc4HHfOxSHTCl6NDZzwbqa7zgbf73LrCt2CCrvKrqOo6r3mHedBlXrRqXekSj0\");\n        a(\"CPrvAldzkrdMZP4Dud82fo1w1e4m7rRIe8BgY85mPyThikYz4Ky+iEL8LKOuO7sJau8QwM0XX+FE26wTve42zRMfegRVfutZcR\");\n        a(\"64J3v89c6ZjvR7sueN37zZXOecQkZ46u8C0Yq6vch0w3+LYH7EFd5esednt1lR9/xP7SOS9Vs6d0yKfgc53wNDR0zos8Zk50yP\");\n        a(\"dhwOPGyLs8bp3omN9BSRdcesI+0hyciGadcA0tmoPvMFw3eOku49UxX46ROuPfnvTaoYOn/H4Pqc55m6etBx3xAxiva7z8FOPV\");\n        a(\"JT72GWeOTvioqT63TvhjTNEFh9Oc1zrkLTFLR7wf6rrCp6FHp3wdCl3lx9Gnc34TDV3wz/hDB93OKwRPuB7eDAN1xOMR6io/jp\");\n        a(\"V1zm9iLV3wzxiig2d9HDTpEm+GZh3xfhimK3waWnXK12G4rvLjaNM5v4mRuuAlnzO3OuQ9MFrHfCtSXeVedOqCl3jevtNl7kJV\");\n        a(\"5/w7Jusgd16iS0d8B7p1lb/CLN3gI6abW13hVWeYW13iZvyhI94fQZf34dMxUKd8PUJd5RcxWNf5M5R0gxd/wRmlQ14TZV3mnT\");\n        a(\"FUx3wkIp3wC2jRdS7PtNc0B3ugQ8f8AlJd528wSTf46BetK53whejRGd+JQtd4Ovp0nT9BQzd4gZeMV4c8AcGTxsXTEeo6f4XB\");\n        a(\"usGLvmyMOuRzsZ5O+VY06So/hmad81wM0wX/hFYdzPLnLwzXJd4UbTribLa1oTN+EKN0jV/DaF3nbzBGNzh61XmqIz4Mk3SFz0\");\n        a(\"JNp3wjpugqT0Wucx47x6XojCehX9f42NecM7rKb2PQU66fz3vdeatTnoaSznnQG+ZBh9w51/3TGT+BSOfcQIvmoPVNZ6yOeZe3\");\n        a(\"nKE65j6M1A3e6W1j1zGfgDE64S5conPufMd164xPetd4dcLT0K1zPvw9Z6yucD/m6KAnCK7GPJ3xo+jTNe5437XqlA/stTZ0hc\");\n        a(\"/BgKe9nVeaZ8y6xFejWWf8L1p18KE9izZd8C0fWc+6wcHH7qNOeBzG6IzvwiW6xjPQqeNP/Bn8U+eUDvmzz4xXN7jzc2PUGYdf\");\n        a(\"uo865B706YI3+MqYdYUzzNcZz/zaWKZYS3zmN8aiU2771hmoK1xDWbMXCXtWB5wh0hnPw3Bd8JDv/Xpd5rMwUqec/uA+6hrP+N\");\n        a(\"H86jrPbfg5XfBGPxuPLnM7qjrhPkzSDV7nF2tYl/lR5LrGX/Ubu27wm7+7Jl3w338auw7+Mg8Y+Ixx8cS/zZeu8XQM1nX+BCXd\");\n        a(\"4CXnW8865NVR1mVuwVAd85GIdMIXokVnfCdiXePpGKHr/AkqusED/zFOHXKKRKd8LVJd5dK/9qfmoIrxmoMnUNU5v4VJuuDgP/\");\n        a(\"dMB7wSpugSb4FcR3wDZukqh4F/E6dDvsLXbD/XGYcL+nrGVG/nOzFY1/hAz0Qp6wqfg1ad8vsYrgte39esR+sy74NUx3wKxuqE\");\n        a(\"r0amM/Z3uMEEHfLamKTL/ANqusGLe/5JXYf8m2eg9GhfaAp2wcBproF/wTI6Wsz3iqGkMz5pcd9PpxOejkjX+U+06sBzSrbGcB\");\n        a(\"3xVFR0zr1IdMHHeW5Jh054V88a6dIxP4C3dc69KHTBf6FPB6E583yShubgWqzVbT75FZR1nf/DUB145sgQRLrMG3iGSIsu8/7o\");\n        a(\"0BU+A6lOuYqxmoPHkOmc91/G3OoKX4opOuMnkeucz/cMkVk64yfR0DkvtNwCwR865J0x+Fnj5XNR0ikvvLy51SHvgCYd8XFo1g\");\n        a(\"nnaNE5Nw02zzria1HRVf4Ao3TBy6xgjLrENyDVVR644gJBpw55HMbrnIetZPw65nMwWaf8ELp0jV9Eruu8+8rGqyu86irunS7x\");\n        a(\"A+jXNT5v1QX8Yc7H4dbVXJOOOcd6mm1OY9QBb4UWHfE4xDrjP9Cmg9WtMYzUES+3hnWlS7wbMh3zq5ig6/wDpugGD1zT59Yh74\");\n        a(\"NZOuZjUdcJv4seXfCpa9nLusaz0dB1/gZ/6AZfuLYxPO99ePl1rENd4m3QrCP+GMN0wb9itA7WdSZgjK5xuJ61p0NeG5mOeBQm\");\n        a(\"6ITX3MA90mU+Dz065eM2tEd0wud7Jsd8nfItCHP3nadisM75/o2sPV3jjxHrgpfa2DzrkDdAuy7zM0h0ztdt4pp1lb/ARN3g9c\");\n        a(\"vOHF3mPdClYz4B3TrhHs/hmKkL7sd8HWzmujBgunnjbTBIR7zt5taMjng4huoK34BIV3nbJmtGR3wIOnSFT9rCmtcJT0RVV/kN\");\n        a(\"TNJ1Xm5LZ6Mu8c7o1jFvsZXr1BEfgvm6whdjwAxrkm8Y6jp1laeiWee8/NbutS5xO9p1wuMwWme8/jbmUJd5D0zSMS+2revRIW\");\n        a(\"+OeTriFZqtQ13iFMu84P5yN0o6514M0QU/tJ0zQtd4JkbqOn+DUbrBu2/venTMJ2C8TnguJuqC+9GtA8+MWBEzdYm3wRwdcWdk\");\n        a(\"7+uMH8SAmT4v92KQLvjhnVyzrvFsDNN1/gatusHVnd1jzcFUXKJzHjzM59Al3gaTdcR3okvXeCbe1nX+BfN0sIvzZFfzpiO+GC\");\n        a(\"u/6Dp52xavHTriQ9CmK/w0Ruqcm3a3H3XMLyPTdV5zD/tRl/lfVHWwp33R6t7pKk/DTJ3zBXuZK53yI5ina/wdPtcNXn5vP9Yl\");\n        a(\"Phz9OuXJCF7y/rzGPuZTl/l8DNYpz4iNRdf5P5R1sO8CwQEYqiv8GYbpBpf3s981B+9jhC74xv2NXVf5PSS64KWGW6s65Ntwia\");\n        a(\"7y9AOsGV3n9Q90xuoyX4+Zusr/oK6Dg1wL5umIj8LnOuFx+E5n3DHC2HXKt6D0srHzKgd7vdAl/h5NusHdh9j7Oud1DnUfdZlH\");\n        a(\"YpROeBxG64z3bTMWXeHFD7PvdMhHYpZO+CG8rWv8AQpd8LKHO2N1iS9Gv874YczXNV7vCOt/lmvgvbCWjvkrDNENXrxizeuQN8\");\n        a(\"JwXebRaNMpT0KnrvHCR5pnHfKe6NIxP4puXfCmR1ljOuKj0aMT3vBo169j7sKgV8wV92KwLvi5keZZ59yLWBf8F0bo4BjPZvKc\");\n        a(\"gorOeC7G64LHHGf965QfRU3XuAfdOmj3e0vM1DGfhLpO+Cr06IzfRqELXut486zL3ImGzvghzNc1fhUDZlt73IdBusHTTnDO6I\");\n        a(\"L/RkmXT/RvHLCezrkXQ3XB8SivIzrm7U/yY13hLU82Xh3xkejQCY9DqjPe+xTng465OXHPdMRHY4pO+EnkOudVT3WPdIkPR4+u\");\n        a(\"8Gf4XDd45dP8vkJHPA0DXvVrec3TvY7rMqdYWaf8HIbonFccbVy6xHuiRcd8LmKd8cJnuKc65I3Qrst8wJn2u67weZioU97Qsw\");\n        a(\"Lu0WXeC3N0zIt0uGc65IsxYI6Pz8+cbf51zr1o0gUn55gjnfAEjNJV/gGjdYMXP9e60iG/iYm64EFj7E0d8kuo6zpPOM9c6SpP\");\n        a(\"xYDXfF7uxSBd8OoXuB5d5j3QomOejVjX+c3U9emC/0GHDi505iDVJd4OY3XET13stUDX+c9L3EcdXOpcRaE5OAR9usJXoqEzzv\");\n        a(\"GHznn2Zc72130c3utya1XHfC6G6JRvR5Ou8pNo1jn3YpgueJ8rnCc65mMwVifchUznPBcTdcF/4x4djDNGTNYlbkaXjniJK+1f\");\n        a(\"HfK2mKUjHo66rvCp6NEpX4tCV3kq+nTOl3Yau874L5Te8Hmv8iwVDNEV7sVQXfA6VxuXLvOZiHXKd6NN1/iYa5zvOuFxGKszfu\");\n        a(\"9a49UFb3+dseiI17revOsy74F5Ov6fYrsMlSKKAyg+dhfYhYKFCDY2dtfY3S12K7aiomJ3C3aLLWI3drfPbjGx4zcfDucg+9y7\");\n        a(\"996dh8KfV+Kp3sZnkfCSs+Ccc3zXdAGuMNf+65DXo6HexqfRVl/il+iqP3DKee6SjlwYQ3Q53o3R+jA/wQz9gTfOd4/1Nj6L4/\");\n        a(\"oSf8Y5HZhXX7zQd02v4BNIeNlrOMki76dT8jmk15c49mJ7q1Py3mXWrw9zDAboyMFyz24deSDG69H8FzN0sMLzBKt0Nt6ATXob\");\n        a(\"n8U1fYlbrLSfui3/QNwrftZsdyGk1OW4A9LrPnxprTugIw9f5+z0aF6GOXoFz17vrkbNCTa4hzolD8dpPZpf4pr+wG02+my6Lf\");\n        a(\"/AWx1sspcIrnovLrjZenQ5bozMui33Rw49mnchnz7Mh7bZt6j5LzrqYLu/Y5dnl2az1H7f6ch7cEAf5soHvLcOuTuCa17Dh5FQ\");\n        a(\"R/6KlDowJ93tsP3RfXgJ+ugV/PKI+6M/cOajzkJn4/zHnIUuwC1xTbflccedhZ7B25DwuvPifye8lw5O+n8S5NGX+Mcp33kdnP\");\n        a(\"bsQiUduTVq6bY8Aw115DNoqS/xnTP2RMdw9bPujw65M2boPrwgQq/g/VihD/NSs8rr9ArejXv6MF/FUx3DH/FWB+f8ux5fdMhj\");\n        a(\"ENywHj6PhPoSxznvOa9Tcl1k1iGPRx49gzeggN7GRy945uhLPP2i77KewUUuOV9djqdhiJ7BGzBeb+MGZpGn6rb8HAf0B65yxf\");\n        a(\"3UIa/BNb2NzyJGX+In15yr/sAZrjuXm86UVyG93sZ3kEfHcJUb1qxDbn7Teem2vA8t9WGOQVcdOc4t90en5LMYoi9xrtvOQhfg\");\n        a(\"GlilQ/6HTTq44/uOazobX8U9HcPBXd/rW17DOZFUF+AaSK9Dvo9sOoajed9yOnJGVNPZuDtC3YcnY4CewTcxXMdwx/vuie7D17\");\n        a(\"BNx3C9B55lui33wnHdhxfhnF7B0YzuNR35JOLe9tk5eYx91il55CNr1qO56GNr0+W4KxrqPjwDLXXkHeioD3MMeujIwRPr15Gz\");\n        a(\"YbiOXA7jdeTmmKrbcoKnnm86JVfEXh3yNBzWM7jWM/dHh3zlt2eljuHgjzXficPeK0JHLoc8OoY/ooAO/rrDKK7L8V2U0zH8Ew\");\n        a(\"118M/nRksdcneM1n34JCbpSzwyMJejR/MyHNcr+A/OaQO1QTbc0pGvIEbHcIrYZpl0Si6LD7oc/8J3Hc3SZkRw189y6rjmHaLm\");\n        a(\"TSitt/F9hDqGf6KpjgZbq8Y3d6FDnoNJegX/NB87Qwep/TmO6xVcOo0163K8Ftf0Nv6MezpIGzuojqc65G94q4N01okvOhuvM8\");\n        a(\"/6W2/jm8h2z9r4D/LowNzr3oLmL/Rh3lgotvvu9fwG4/UHzl84djBVF+CxmKNn8Cqs0Nv4EdbpD1y5iLPQIffHAT2aX+G4/sBZ\");\n        a(\"i5oh0dm4JG7pcrwBMXobn0fc+86Xc5tVTaoLcHnk0yH3RBHdhz8Ws3c6mlfNgrY6Gw9GVz2al2KSXsHfMEMHJbwe23Q2jsFeHT\");\n        a(\"lzSXuus3ElPNVt+SXe6g+8pZR7orfxZcR94Gd5UWlr1it4P4row1ywjHXqctwcHXVbjmXWs4dOyXmxRBfg5VilV/B+nNOHuV1Z\");\n        a(\"d0OP5kWI+9Br+DuSapc4OIoC+hLPKu9+6hU8q4KzjpqvYYaO4Z9YoIOK7j9WRF0pdjAI1/QK3lbZPujInavYB92H5yJpjLXxoK\");\n        a(\"q+J3o0r0YRfYkzVfPZdQHuikp6Bt9CqD9wYjOVLXVK7oqOug/nreHsdAFuhHW6LQ/DNj2ac9d0droAt8U9PYOv4amO4fy1rFkX\");\n        a(\"4Mn4olfwfvzWhzl9bfv5yLlzZeTRIfdFAT2aU5l9LK6zcXn00CHHN+s4QKfkhlil2/IubNKH+aQ5yJ36EverZ316NM+qb516Bf\");\n        a(\"dr4Cz1aO7c0DPnsX3grI2sT2fjno2tTffhJSiuV/BBlNOH+Tmq6Q+8oYl91tv4LProS7zbrOIQfZhHNrO3ejQvwmm9gic3953V\");\n        a(\"M3gDgif+Hq7Wwtp0yL1RRPfhv62ctQ5bW39b76v78CS01TN4A7rqbdylnfXoPjwbC/QKXtEeOnLRDvZKl+NhuKdH81o81dv4Hd\");\n        a(\"7qD1y7oz3UIa9C8NRr+AES6hhO3sl8jk7JDZFet+W+yKZH8x7k0Yf5KoroGP6J0jow97cVlfQ2fowh+gMn7mK2U6fkZZikV/B+\");\n        a(\"7NSHuU5Xz0kdcne81H24RTe/j3RbHoH0z6yHm/e0Nt2WR6GhHs3xevnu6JR8CR115NfooT/w/t7upz7Ml7FEx/DRPvZIX+Lsfd\");\n        a(\"1VXYAbYKduyzX6WacOOVl/69QpeSISPnem/B4p9QeuM8CadcgbkU1v4+QD7adOyZVRQIc8CcX1DD6Ecvowf0I1HQwya4tQZ+MS\");\n        a(\"aKrL8Xa01X0Ge5YOca90Si6MAXobJxoaOxiuU/IrjNcfuNgIv+N0Ob6KdTqG44z0PNEpeYo5vcN6Bi/BW72C3+OL/sATxnqG6B\");\n        a(\"k8c5zn4Qvvyz3+s1v3vAxFcQDG6+UDGMQgTdyhG0OFUaJJV0MtImLoILFWYjJVgkjjpQiplrjES5n6EYiRoYsQi8tUYiAxivj1\");\n        a(\"e/QmT55naXL/555z0iWz6xz3Lts/OuAXjOiIkyvtsTHd9DgmdZbnkdV5XiyYSxf5ZM29rWt8g6qu8ytq+ou/172/jm3Yq7hv9q\");\n        a(\"a7GZEOeBoNneU5/Og87xXNokP+2/JNG3677d5DQgecxoDOcHzXXDrgNGZ0httK5tddPISSTvHjvnOtI+4oezfdxZWKM65DvkXs\");\n        a(\"3Vw8e2iP6RzvYFiH3H9kDXWS746tj67z6Klzp1O8cOZ/i85z4dze1kV+xrWOuOfCO+iAJ/Ck6xyrult006v41EU+wK8O+Q2dH9\");\n        a(\"ac+y59dx3wILp1iqcQ11l+QEJHXL6yt3XraT3/7MitSwMBAMbhQw6DGBYWRNRkGgYxiJhMi7JgEDEaLl0WkWEyH5dFjg38OD8Q\");\n        a(\"kywtikFMC8ZhWhCjXPLgHlzZn7C3PC+/6cxaWfj/aw9hEHXD4Lczbstlq12FwUJ33BplWy/bpJ3pCTt8Yp8fHPKHM9eVdTa4wz\");\n        a(\"1GbDPlJXO+8I2fHLHg/E3lIte4zRYPGfOE50x5wZw9vnLAIUcsOHdbucQNNnnAmKdMmPGRPQ74zdm8coVb3OURY7aZ8p59vvOL\");\n        a(\"Bet3lavcZJP7jHjMhBmf/wSlj0DpG1D6FZT+A6U51kDjE0rrgGkEcILyw6B0Gpp8DZTfBaXnQOl1UHoPlD4Hpe9A6XdQmmkty2\");\n        a(\"i+GM0Xo/kCR75AAPfUkuCSFI/EvJScVCjfOT+vGEA31e62DcPAvJrnuliAeDFqY/6t2NdUgywZFFXUe/pJFoUlQfpLvCPFj6Pk\");\n        a(\"DFo378xgfCR/KxOQ/SfluSFylLz9A35T2qP5mrCydjYxzZfmjtwE70s9RRzWo313Vam4LLGDk7YoTCCCLfeO8x07fBDUHMlnsa\");\n        a(\"mH6BXUYnG05bg4UDB41Qa/1BIL3bK7AJkbSfMeJZnEPNTGeYnLcydH57RlFCUaO5/fE12U3TxjSYNGfHIqTnghRdso/tRkNc+U\");\n        a(\"2z68EiARCTlaFLfRp67Yb9QElVsb7zZ1DrwGrjvJem7aYhdRfkKtiUlnZYybxE4VZcc7LbbQ0erL5kv1rH3Zq6B9ukkZySFIsv\");\n        a(\"QGWNMZ/Ao7y5WkrQ/LTb4BtGh7W2JUmqMKvbbXOOTlDybOOueIjrQjzbLde+7xvUiN8wr7Hx39Cy7hegV1BA/LZUo0nxFVh9wl\");\n        a(\"eIdlx8U+Ws1aGf0XNUUrDtxjkkf/AgN+wjeWQY900gvqE0/4gbZvrrTBsP6xMQY36hn1h6LIFnNwxS9/tqq7+9+d8Rv/I6OMeh\");\n        a(\"UGYSjsX8PtmtyEp+udeybamUUF0o3M/XuPtCTiHs9HCxR6em9cnBMT8EzPWZgN4ZbiIfl8Gm7Aq0afRljX3Tu/jP4iTMXPM9eX\");\n        a(\"HnixkPhM/2ukyexqmq23pdb5a3JXXTlgu7Jiao3RYtRLheR/wS+EoRDtwFvRxVuqizt7bBuWqR0Zrxp4NcpPxBPKlpMwmqJjOs\");\n        a(\"6MLiwRub1JBphW0gD4i2OFdV6/yVMC077VZwdLDMixJhLTTcQtDQ6/a5vfNte+inflKEs+s+xhQaL/aBOls2UfpFL0TRcj8T4N\");\n        a(\"Q79TYsNSEY1BwleGqTIqJevVTHzJNxXojuRiBiRXgEqJ7NSivNQcYyO9lJwcBmAqTSwtgXJKgR6HMocp0NjAAj7bhwmKTYB8Gy\");\n        a(\"B2AeJgf58w1yCw78FnwASIActvoHgYSA80XPNzylKLQNmLAcwMKK2qykk1NGUYBQBm7I7vcSAKw/iDweJgMVgMFgMLxWBhIVgM\");\n        a(\"LBSDhYXgmZfMnJnMSzCwUFgYLAYWisHCAwMLO9vffog9X+H6H7n/45vzrpkD7oDAHkqooIYTNHCBKwyAMMMCd4jwgBWesMEn/A\");\n        a(\"ZCj/QLbehXeqHfaE+/U6CWLvQnfdBfdKOf9MDPvFJHVauTatRZXVWvZrWou4rqoVb1VJt6qaQ+sMAdEtxjiQc8YYNnbPGCHV6x\");\n        a(\"xxsOCDjjD4z4woQfutA7TXStT7rRZ93qi+70Vff6pgcNGvWsF33XUT/0qp960y+d9IcpzM4QszelOZjKHE1tTqYxZ9Oai+nM1f\");\n        a(\"TmZgYDBs3dHKZ26qZ+GiaclilO67RNaSossaWtbG0b29rO9nawaBcb7Wo3m2zhiCtd5WrXuNZ1rneDQ7e46Fa3ueQKT3zpK1/7\");\n        a(\"xre+870fPPrFR7/6zSdfBBLKUIU6NKENXejDEDAsIYY1bCGF3Omed9f8lAWQf5UaaKGD/l1pgQhrrpOgoISWtKJ17tPSLtcZKO\");\n        a(\"Y2ka65TKIFI6xkFatZw1rWsZ4NDNnCIlvZxhIrOOElr3jNG97yjvd84MgXHvnKN554IYgoRSVq0YhWdKIXg0CxiChWsYkkipGM\");\n        a(\"h7EajyOO83gf47iOz/E1prGQO7mXpazkUZ5kI1t5kVfZy0GCnOUio3zIp9xkkh9qp4gq1eGvoLefi+qyoJsChW9F2dBbUPbz1n\");\n        a(\"PACuvsJ+t52/lDmd3yyAmGURgmqaEOuRKJRK5EIpErkUjkJDUkNUjkypev7bvDpxyJRCJHIpHIyp59OJmk2512+w/Iw3XumcxQ\");\n        a(\"yCd8iAy6EBWHCYoYzxeYWM7X83rezz/PRmM1D43duM1j4zVB89SETQwvSZNBjGpGmJmaBWrWZocbo7Ugx25d2PHaAHrCNoafpM\");\n        a(\"0gSLUjDE3tAkVru8OR0VmQZHcuLHldAE1hF8NT0mUQpboRpqZugaq12+HK6C3IsnsXtrw+gK6wj+Er6TMIU/3S770FW/bgQpc3\");\n        a(\"BPAVDjGEJUMGY2oYoWwaFjhbh/1N2oLf/d+Cro4iuLDmSRFCFcNbojKIU0cXWIUd7ozcgjw7d2HPywPoC/MY/pI8g0CVjzA45Q\");\n        a(\"sUrvkOh0ZhQaJduLDoFQE0hkUMj0mRQaQqRpicigUq12KHS6O0INMuXdj0ygA6wzKGz6TMIFSVI4xO5QKla7nDqVFZkGpXLqx6\");\n        a(\"VQCtYRXDa1JlEKuqEWanaoHatdrh1qgtyLVpN6if6rCO61Od1Fn9XCtYvkDzctNsvNhw7MMwbrXifw3czFSs6HE1KWmJK624js\");\n        a(\"PL+LxNxOukucJlNtzDLJzbJSLeIuU1dDHKJTZewi6TSuH5Vzz519rBs36rv8tzRthK9pfSPkplT+iqRlkvekJbF33Vq97YWPv1\");\n        a(\"8dXDdu6vxpSW+u/rybXM5wVbMbEUV/YRcSEpN6JlJVfZxwNW4XMXEZeRchuTrMLoHK7B5x4iLiLtNLYwo6/HBhyuwOcOIiwhQ2\");\n        a(\"XHfkFhjcEcjiU43IIvazjJDi7Qvx3+d/wfj84a6v3bjGA/VZrmN6o36R7vF282EetTvtG4SeUOnftFJG9VU/ZG2yZ1O/TtU3hE\");\n        a(\"4ymUa/ie0eDDtUPZPm1H1J3Ct4aMudrg+jDtULVP1xFlp7StoXuG600a7UqhfWl0KJU+SaczKbWWVk8v15cdpX74YbPSgXQ6kl\");\n        a(\"In0upnqfU/P/Uh0tP+H5/91Ck2N3FpfUKmITX30PHonk7WfEPL34w6KLkvSlPWe2a/NxbcRMNdURq3qcjU7PbMcm9st8l6i1V+\");\n        a(\"D1CdhtHl1muzv6OV3U6PcovbSz/1m8iF2Vu9I/Y7ZcE1Gz6z4nRs4L/eLx859lnziD1PWfTbd70PhD9KtU55Bt2aLZ9Z87vW77\");\n        a(\"WMbZ//dwMs/VyuWIF5zz/7rln4mY2XNcgSsIHf9bPtM+u+se+/2juz0JnCMIwfBh1ZGkVOpCypIcufLCdLja1EMrZMoZALW7IU\");\n        a(\"QvYsyXYhU8I5M2dmzpnvnBmKsu9ZUxPRlCXhYkppkCX7872+rN98thsX5mbu3+f3PO/zfk0N94LBGws5Ik4+SIB83lNK1FQq1F\");\n        a(\"V0aiutqa+YEi+4nH+Qryae2u73qQzued81/6DrRqnLrPyRe9FjdNFkIqLLDGUxRVqTK+AG3mZMSVb/xBGKDN9H7qgEv+OJi0j0\");\n        a(\"Uv4evFGRJPtkcof1vR/C/Leof+eHMFI+Tns7oeA/StSvVHJuEtuLQbMrmstF0V3Kor3oToToBtcKoj917biC5jDxG5NluCBZI3\");\n        a(\"qjyux+RfSaKl4/sxpV0QpKOaE1RKc8o0tEqKFg8hRbV9iC3DtZuAB9nxfe8fuodUg7AH0Nq7PVE4pOs2ZDyx3WbusQ6Vex6tmN\");\n        a(\"oV8/ezA0nG8vQZZ59n6oeMt+AP3qJ5vwu4jU24iU2p88DN1qIZE6pLohi5YhfdKpADrdTj2EQhGkzgxnHvJmp7MXulx1bkCP9l\");\n        a(\"BjRHoc9utG6HA//RQbtUWmLfJjRGYcEmR9ZiumfwfJUTfbCIkxJDsCc1+RXY95H86exo58mf2QNdyebn+kwyJ3BWZ80D2OJHjq\");\n        a(\"vnF1r43XAfOd6E3DdDd7OzDVx9573DBdcr1wvSzILcUkg9xBeP1R7hk6WEfWHVPciJmdZpew016w9+hcXf3e1LngWe5WhU9X0t\");\n        a(\"VxKihX3V7TyZ+uwpEx2ljbZDuqJqRN/KprmeTExYpd1Jo69GS0ZlwV0l2k0wYaqtg5lSR3YI1stwg3lsiDhmK7nCIHaopm5ZIH\");\n        a(\"y2mxQyStahv5sKjYIYvJiYcUvWm66ErfNnh6JUFbing1XpycmPirTREhL06XbATRk7AXIuhIMcVOeOVzwsyvs1/ctK64asvEV0\");\n        a(\"SR/UXiKyzau6wNHSK+6L0kGtIWg63qOW9xwsCWaPCSC20DEXZR0W/mEmH7FD0mToQlZAkvLtShxNcGSbrzq1THXVpDfM1VtBVD\");\n        a(\"dJRqGX/vF1K+THxFFL2kSISFKePlb3CniDBN8dK2T9yH1buHxekCV7p4O+Fkmd/ciduIraKyYcgpK1GOGX/cMUxxM1Zv3VospA\");\n        a(\"3+hZ6RoIQrfbkgFS8EkqwDkZxG84/6dYxyb1uV3qG+L/eB0Fd0V5pgUn5LEp/fNmjKPrz5EaGuokHHspjd5JBm4WtKbiaosXIe\");\n        a(\"culJrhZrwtqwbmwAG8WmsHlsFduOLDrCzrMSJdAg0DHLX4D82eWnkDxX/OvooW/9OqCjZ9AfVMwJFoIGJ/DROW8HD5E3zfKtsM\");\n        a(\"eG58eAg2X5tdD/YP44dH+af42c6VToAb1nFOYhXfYUMlD7ZuEuV3luSDvH/6vFag5th1mjoelSaw009a0DVpG2lW63tNtBz5H2\");\n        a(\"eOgIDaHfGfsydtQL+71tJLskeyE/piZnQjmoBsUuJ69BqzqphlBoYGoYttPy1DrspKOps1Ao7LSFGmOcCdBhvbMVbfCkcwE58d\");\n        a(\"L5gBbYPd0HaixIL4UKJ9LnkQu4YDD77pm+mPvUzCz0v9HeBLh1tbcJPuU/SAppY/GFDUBOnay4lHVW22/gG+TDmL8e6X6MXr6b\");\n        a(\"wnWjgknCaZz5kNYUX9iQlGM8tbT/n3/68xHeVZKEADYEAA==\");\n    }\n}",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_15.txt",
        "content": "Hi! My name is Pascal Slover.\n\nAnd I try solve puzzle15 with board:\n15 14 1 6\n9 11 4 12\n0 10 7 3\n13 8 5 2\n\nReady! Solution path is\u00a0: rrruldluuldrurdddluulurrrdlddruldluurddlulurruldrrdd\nMoves 52 and Time: 00:00:00.7509766\n\nBye bye\u00a0:)\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_16.txt",
        "content": "// Solve Random 15 Puzzles\u00a0: Nigel Galloway - October 18th., 2017\nclass fifteenSolver{\n  const int Nr[16]{3,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3}, Nc[16]{3,0,1,2,3,0,1,2,3,0,1,2,3,0,1,2};\n  int n{},_n{}, N0[100]{},N3[100]{},N4[100]{};\n  unsigned long N2[100]{};\n  const bool fY(){\n    if (N4[n]<_n) return fN();\n    if (N2[n]==0x123456789abcdef0) {std::cout<<\"Solution found in \"<<n<<\" moves\u00a0:\"; for (int g{1};g<=n;++g) std::cout<<(char)N3[g]; std::cout<<std::endl; return true;};\n    if (N4[n]==_n) return fN(); else return false;\n  }\n  const bool                     fN(){\n    if (N3[n]!='u' && N0[n]/4<3){fI(); ++n; if (fY()) return true; --n;}\n    if (N3[n]!='d' && N0[n]/4>0){fG(); ++n; if (fY()) return true; --n;}\n    if (N3[n]!='l' && N0[n]%4<3){fE(); ++n; if (fY()) return true; --n;}\n    if (N3[n]!='r' && N0[n]%4>0){fL(); ++n; if (fY()) return true; --n;}\n    return false;\n  }\n  void fI(){\n    const int           g = (11-N0[n])*4;\n    const unsigned long a = N2[n]&((unsigned long)15<<g);\n    N0[n+1]=N0[n]+4; N2[n+1]=N2[n]-a+(a<<16); N3[n+1]='d'; N4[n+1]=N4[n]+(Nr[a>>g]<=N0[n]/4?0:1);\n  } \n  void fG(){\n    const int           g = (19-N0[n])*4;\n    const unsigned long a = N2[n]&((unsigned long)15<<g);\n    N0[n+1]=N0[n]-4; N2[n+1]=N2[n]-a+(a>>16); N3[n+1]='u'; N4[n+1]=N4[n]+(Nr[a>>g]>=N0[n]/4?0:1);\n  } \n  void fE(){\n    const int           g = (14-N0[n])*4;\n    const unsigned long a = N2[n]&((unsigned long)15<<g);\n    N0[n+1]=N0[n]+1; N2[n+1]=N2[n]-a+(a<<4); N3[n+1]='r'; N4[n+1]=N4[n]+(Nc[a>>g]<=N0[n]%4?0:1);\n  } \n  void fL(){\n    const int           g = (16-N0[n])*4;\n    const unsigned long a = N2[n]&((unsigned long)15<<g);\n    N0[n+1]=N0[n]-1; N2[n+1]=N2[n]-a+(a>>4); N3[n+1]='l'; N4[n+1]=N4[n]+(Nc[a>>g]>=N0[n]%4?0:1);\n  }\npublic:\n  fifteenSolver(int n, unsigned long g){N0[0]=n; N2[0]=g;}\n  void Solve(){for(;not fY();++_n);}\n};\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_17.txt",
        "content": "int main (){\n  fifteenSolver start(8,0xfe169b4c0a73d852);\n  start.Solve();\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_18.txt",
        "content": "Solution found in 52 moves: rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n\nreal    0m0.517s\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_19.txt",
        "content": "int main (){\n  fifteenSolver start(0,0x0c9dfbae37254861);\n  start.Solve();\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_2.txt",
        "content": " 1  2  3  4\n 5  6  7  8\n 9 10 11 12\n13 14 15  0\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_20.txt",
        "content": "Solution found in 80 moves :dddrurdruuulllddrulddrrruuullddruulldddrrurulldrruulldlddrurullddrrruullulddrdrr\n\nreal    249m18.464s\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_21.txt",
        "content": ";;; Using a priority queue for the A* search\n(eval-when (:load-toplevel :compile-toplevel :execute)\n  (ql:quickload \"pileup\"))\n\n;; * The package definition\n(defpackage :15-solver\n  (:use :common-lisp :pileup)\n  (:export \"15-puzzle-solver\" \"*initial-state*\" \"*goal-state*\"))\n(in-package :15-solver)\n\n;; * Data types\n(defstruct (posn (:constructor posn))\n  \"A posn is a pair struct containing two integer for the row/col indices.\"\n  (row 0 :type fixnum)\n  (col 0 :type fixnum))\n\n(defstruct (state (:constructor state))\n  \"A state contains a vector and a posn describing the position of the empty slot.\"\n  (matrix '#(1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 0) :type simple-vector)\n  (empty-slot (posn :row 3 :col 3) :type posn))\n \n(defparameter directions '(up down left right)\n  \"The possible directions shifting the empty slot.\")\n \n(defstruct (node (:constructor node))\n  \"A node contains a state, a reference to the previous node, a g value (actual\ncosts until this node, and a f value (g value + heuristics).\"\n  (state (state) :type state)\n  (prev nil)\n  (cost 0 :type fixnum)\n  (f-value 0 :type fixnum))\n\n;; * Some constants\n(defparameter *side-size* 4 \"The size of the puzzle.\")\n\n(defvar *initial-state*\n  (state :matrix #(15  14  1  6\n                    9  11  4 12\n                    0  10  7  3\n                   13   8  5  2)\n         :empty-slot (posn :row 2 :col 0)))\n\n(defvar *initial-state-2*\n  (state :matrix #( 0 12  9 13\n                   15 11 10 14\n                    3  7  2  5\n                    4  8  6  1)\n         :empty-slot (posn :row 0 :col 0)))\n\n(defvar *goal-state*\n  (state :matrix #( 1  2  3  4\n                    5  6  7  8\n                    9 10 11 12\n                   13 14 15  0)\n          :empty-slot (posn :row 3 :col 3)))\n\n;; * The functions\n\n;; ** Accessing the elements of the puzzle\n(defun matrix-ref (matrix row col)\n  \"Matrices are simple vectors, abstracted by following functions.\"\n  (svref matrix (+ (* row *side-size*) col)))\n\n(defun (setf matrix-ref) (val matrix row col)\n  (setf (svref matrix (+ (* row *side-size*) col)) val))\n\n;; ** The final predicate\n(defun target-state-p (state goal-state)\n  \"Returns T if STATE is the goal state.\"\n  (equalp state goal-state))\n\n(defun valid-movement-p (direction empty-slot)\n  \"Returns T if direction is allowed for the current empty slot position.\"\n  (case direction\n    (up (< (posn-row empty-slot) (1- *side-size*)))\n    (down (> (posn-row empty-slot) 0))\n    (left (< (posn-col empty-slot) (1- *side-size*)))\n    (right (> (posn-col empty-slot) 0))))\n\n;; ** Pretty print the state\n(defun print-state (state)\n  \"Helper function to pretty-print a state.\"\n  (format t \" ====================~%\")\n  (loop\n     with matrix = (state-matrix state)\n     for i from 0 below *side-size*\n     do\n       (loop\n          for j from 0 below *side-size*\n          do (format t \"| ~2,D \" (matrix-ref matrix i j)))\n       (format t \" |~%\"))\n  (format t \" ====================~%\"))\n\n;; ** Move the empty slot\n(defun move (state direction)\n  \"Returns a new state after moving STATE's empty-slot in DIRECTION assuming a\n  valid direction.\"\n  (let* ((matrix (copy-seq (state-matrix state)))\n         (empty-slot (state-empty-slot state))\n         (r (posn-row empty-slot))\n         (c (posn-col empty-slot))\n         (new-empty-slot\n          (ccase direction\n            (up (setf (matrix-ref matrix r c) (matrix-ref matrix (1+ r) c)\n                      (matrix-ref matrix (1+ r) c) 0)\n                (posn :row (1+ r) :col c))\n            (down (setf (matrix-ref matrix r c) (matrix-ref matrix (1- r) c)\n                        (matrix-ref matrix (1- r) c) 0)\n                  (posn :row (1- r) :col c))\n            (left (setf (matrix-ref matrix r c) (matrix-ref matrix r (1+ c))\n                        (matrix-ref matrix r (1+ c)) 0)\n                  (posn :row r :col (1+ c)))\n            (right (setf (matrix-ref matrix r c) (matrix-ref matrix r (1- c))\n                         (matrix-ref matrix r (1- c)) 0)\n                   (posn :row r :col (1- c))))))\n    (state :matrix matrix :empty-slot new-empty-slot)))\n\n;; ** The heuristics\n(defun l1-distance (posn0 posn1)\n  \"Returns the L1 distance between two positions.\"\n  (+ (abs (- (posn-row posn0) (posn-row posn1)))\n     (abs (- (posn-col posn0) (posn-col posn1)))))\n\n(defun element-cost (val current-posn)\n  \"Returns the L1 distance between the current position and the goal-position\nfor VAL.\"\n  (if (zerop val)\n      (l1-distance current-posn (posn :row 3 :col 3))\n      (multiple-value-bind (target-row target-col)\n          (floor (1- val) *side-size*)\n        (l1-distance current-posn (posn :row target-row :col target-col)))))\n\n(defun distance-to-goal (state)\n  \"Returns the L1 distance from STATE to the goal state.\"\n  (loop\n     with matrix = (state-matrix state)\n     with sum = 0\n     for i below *side-size*\n     do (loop\n           for j below *side-size*\n           for val = (matrix-ref matrix i j)\n           for cost = (element-cost val (posn :row i :col j))\n           unless (zerop val)\n           do (incf sum cost))\n     finally (return sum)))\n\n(defun out-of-order-values (list)\n  \"Returns the number of values out of order.\"\n  (flet ((count-values (list)\n           (loop\n              with a = (first list)\n              with rest = (rest list)\n              for b in rest\n              when (> b a)\n              count b)))\n    (loop\n       for candidates = list then (rest candidates)\n       while candidates\n       summing (count-values candidates) into result\n       finally (return (* 2 result)))))\n\n(defun row-conflicts (row state0 state1)\n  \"Returns the number of conflicts in the given row, i.e. value in the right row\n  but in the wrong order. For each conflicted pair add 2 to the value, but a\n  maximum of 6 to avoid over-estimation.\"\n  (let* ((goal-row (loop\n                      with matrix1 = (state-matrix state1)\n                      for j below *side-size*\n                      collect (matrix-ref matrix1 row j)))\n         (in-goal-row (loop\n                         with matrix0 = (state-matrix state0)\n                         for j below *side-size*\n                         for val = (matrix-ref matrix0 row j)\n                         when (member val goal-row)\n                         collect val)))\n    (min 6 (out-of-order-values\n            ;; 0 does not lead to a linear conflict\n            (remove 0 (nreverse in-goal-row))))))\n\n(defun col-conflicts (col state0 state1)\n  \"Returns the number of conflicts in the given column, i.e. value in the right\n  row but in the wrong order. For each conflicted pair add 2 to the value, but a\n  maximum of 6 to avoid over-estimation.\"\n  (let* ((goal-col (loop\n                      with matrix1 = (state-matrix state1)\n                      for i below *side-size*\n                      collect (matrix-ref matrix1 i col)))\n         (in-goal-col (loop\n                         with matrix0 = (state-matrix state0)\n                         for i below *side-size*\n                         for val = (matrix-ref matrix0 i col)\n                         when (member val goal-col)\n                         collect val)))\n    (min 6 (out-of-order-values\n            ;; 0 does not lead to a linear conflict\n            (remove 0 (nreverse in-goal-col))))))\n\n(defun linear-conflicts (state0 state1)\n  \"Returns the linear conflicts for state1 with respect to state0.\"\n  (loop\n     for i below *side-size*\n     for row-conflicts = (row-conflicts i state0 state1)\n     for col-conflicts = (col-conflicts i state0 state1)\n     summing row-conflicts into all-row-conflicts\n     summing col-conflicts into all-col-conflicts\n     finally (return (+ all-row-conflicts all-col-conflicts))))\n\n(defun state-heuristics (state)\n  \"Using the L1 distance and the number of linear conflicts as heuristics.\"\n  (+ (distance-to-goal state)\n     (linear-conflicts state *goal-state*)))\n\n;; ** Generate the next possible states. \n(defun next-state-dir-pairs (current-node)\n  \"Returns a list of pairs containing the next states and the direction for the\n  movement of the empty slot.\"\n  (let* ((state (node-state current-node))\n         (empty-slot (state-empty-slot state))\n         (valid-movements (remove-if-not (lambda (dir) (valid-movement-p dir empty-slot))\n                                         directions)))\n    (map 'list (lambda (dir) (cons (move state dir) dir)) valid-movements)))\n\n;; ** Searching the shortest paths and reconstructing the movements\n(defun reconstruct-movements (leaf-node)\n  \"Traverse all nodes until the initial state and return a list of symbols\ndescribing the path.\"\n  (labels ((posn-diff (p0 p1)\n             ;; Compute a pair describing the last move\n             (posn :row (- (posn-row p1) (posn-row p0))\n                        :col (- (posn-col p1) (posn-col p0))))\n           (find-movement (prev-state state)\n             ;; Describe the last movement of the empty slot with R, L, U or D.\n             (let* ((prev-empty-slot (state-empty-slot prev-state))\n                    (this-empty-slot (state-empty-slot state))\n                    (delta (posn-diff prev-empty-slot this-empty-slot)))\n               (cond ((equalp delta (posn :row  1 :col  0)) 'u)\n                     ((equalp delta (posn :row -1 :col  0)) 'd)\n                     ((equalp delta (posn :row  0 :col  1)) 'l)\n                     ((equalp delta (posn :row  0 :col -1)) 'r))))\n           (iter (node path)\n             (if (or (not node) (not (node-prev node)))\n                 path\n                 (iter (node-prev node)\n                       (cons (find-movement (node-state node)\n                                            (node-state (node-prev node)))\n                             path)))))\n    (iter leaf-node '())))\n\n(defun A* (initial-state\n           &key (goal-state *goal-state*) (heuristics #'state-heuristics)\n             (information 0))\n  \"An A* search for the shortest path to *GOAL-STATE*\"\n  (let ((visited (make-hash-table :test #'equalp))) ; All states visited so far\n    ;; Some internal helper functions\n    (flet ((pick-next-node (queue)\n             ;; Get the next node from the queue\n             (heap-pop queue))\n           (expand-node (node queue)\n             ;; Expand the next possible nodes from node and add them to the\n             ;; queue if not already visited.\n             (loop\n                with costs = (node-cost node)\n                with successors = (next-state-dir-pairs node)\n                for (state . dir) in successors\n                for succ-cost = (1+ costs)\n                for f-value = (+ succ-cost (funcall heuristics state))\n                ;; Check if this state was already looked at\n                unless (gethash state visited)\n                do\n                ;; Insert the next node into the queue\n                  (heap-insert\n                   (node :state state :prev node :cost succ-cost\n                              :f-value f-value)\n                   queue))))\n      \n      ;; The actual A* search\n      (loop\n         ;; The priority queue\n         with queue = (make-heap #'<= :name \"queue\" :size 1000 :key #'node-f-value)\n         with initial-state-cost = (funcall heuristics initial-state)\n         initially (heap-insert (node :state initial-state :prev nil :cost 0\n                                           :f-value initial-state-cost)\n                                queue)\n         for counter from 1\n         for current-node = (pick-next-node queue)\n         for current-state = (node-state current-node)\n         ;; Output some information each counter or nothing if information\n         ;; equals 0.\n         when (and (not (zerop information)) \n                   (zerop (mod counter information))) \n         do (format t \"~Dth State, heap size: ~D, current costs: ~D~%\"\n                    counter (heap-count queue)\n                    (node-cost current-node))\n           \n         ;; If the target is not reached continue\n         until (target-state-p current-state goal-state)\n         do\n         ;; Add the current state to the hash of visited states\n           (setf (gethash current-state visited) t)\n         ;; Expand the current node and continue\n           (expand-node current-node queue)\n         finally (return (values (reconstruct-movements current-node) counter))))))\n\n;; ** Pretty print the path\n(defun print-path (path)\n  \"Prints the directions of PATH and its length.\"\n  (format t \"~{~A~} ~D moves~%\" path (length path)))\n\n;; ** Get some timing information\n(defmacro timing (&body forms)\n  \"Return both how much real time was spend in body and its result\"\n  (let ((start (gensym))\n\t(end (gensym))\n\t(result (gensym)))\n    `(let* ((,start (get-internal-real-time))\n\t    (,result (progn ,@forms))\n\t    (,end (get-internal-real-time)))\n       (values ,result (/ (- ,end ,start) internal-time-units-per-second)))))\n\n;; ** The main function\n(defun 15-puzzle-solver (initial-state &key (goal-state *goal-state*))\n  \"Solves a given and valid 15 puzzle and returns the shortest path to reach the\n  goal state.\"\n  (print-state initial-state)\n  (multiple-value-bind (result time)\n      (timing (multiple-value-bind (path steps)\n                      (a* initial-state :goal-state goal-state)\n                (print-path path)\n                steps))\n   (format t \"Found the shortest path in ~D steps and ~3,2F seconds~%\" result time)) \n  (print-state goal-state))\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_22.txt",
        "content": "15-SOLVER> (15-puzzle-solver *initial-state*)\n ====================\n| 15 | 14 |  1 |  6  |\n|  9 | 11 |  4 | 12  |\n|  0 | 10 |  7 |  3  |\n| 13 |  8 |  5 |  2  |\n ====================\nRRRULDDLUUULDRURDDDRULLULURRRDDLDLUURDDLULURRULDRDRD 52 moves\nFound the shortest path in 1130063 steps and 17.61 seconds\n ====================\n|  1 |  2 |  3 |  4  |\n|  5 |  6 |  7 |  8  |\n|  9 | 10 | 11 | 12  |\n| 13 | 14 | 15 |  0  |\n ====================",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_23.txt",
        "content": "import 'package:collection/collection.dart';\n\ntypedef OffsetFunction = int Function(int a, int b);\nFunction eq = const ListEquality().equals;\n\n/// Solve Random 15 Puzzles\nclass FifteenSolver {\n  static const target = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 0];\n  static const trN = [3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3];\n  static const tcN = [3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2];\n  var pos0 = List.filled(100, 0);\n  var moves = List.filled(100, 0);\n  var dirs = List.filled(100, '');\n  int step = 0, best = 0;\n  var board = List.generate(100, (int i) => List.filled(16, 0));\n\n  bool isFinished() {\n    if (moves[step] < best) return nextMove();\n    if (eq(board[step], target)) {\n      print(\"Solution found in $step moves\u00a0:${dirs.join('')}\");\n      return true;\n    }\n    return (moves[step] == best) ? nextMove() : false;\n  }\n\n  var passNumber = 0;\n\n  /// Try all valid moves from here, but don't retrace your steps.\n  /// Return true if a solution is found.\n  bool nextMove() {\n    // if (passNumber++ ~/ 100000 == 0) print(\"${dirs.join('')}\");\n    return (dirs[step] != 'u' && pos0[step] ~/ 4 < 3 && down()) ||\n        (dirs[step] != 'd' && pos0[step] ~/ 4 > 0 && up()) ||\n        (dirs[step] != 'l' && pos0[step] % 4 < 3 && right()) ||\n        (dirs[step] != 'r' && pos0[step] % 4 > 0 && left()) ||\n        false;\n  }\n\n  bool move(int offset, String dir, List<int> rcArray, OffsetFunction rcFunc) {\n    final int ix = pos0[step] + offset;\n    final n = board[step][ix];\n    pos0[step + 1] = pos0[step] + offset;\n    board[step + 1] = board[step].toList()\n      ..[pos0[step]] = n\n      ..[ix] = 0;\n    dirs[step + 1] = dir;\n    moves[step + 1] = moves[step] + rcFunc(rcArray[n], pos0[step]);\n    step++;\n    if (isFinished()) return true;\n    step--;\n    return false;\n  }\n\n  bool right() => move(1, 'r', tcN, (a, b) => (a <= b % 4 ? 0 : 1));\n  bool left() => move(-1, 'l', tcN, (a, b) => (a >= b % 4 ? 0 : 1));\n  bool down() => move(4, 'd', trN, (a, b) => (a <= b ~/ 4 ? 0 : 1));\n  bool up() => move(-4, 'u', trN, (a, b) => (a >= b ~/ 4 ? 0 : 1));\n\n  void solve(List<int> initBoard) {\n    pos0[0] = initBoard.indexOf(0);\n    board[0] = initBoard;\n    while (!isFinished()) best++;\n  }\n}\n\nvoid main(List<String> args) {\n  print(\"running\");\n  // test values\n  // final start = [5, 1, 2, 3, 6, 10, 7, 4, 13, 9, 11, 8, 14, 0, 15, 12];\n  // final start = [9, 1, 2, 4, 13, 6, 5, 7, 3, 11, 14, 15, 10, 0, 8, 12];\n  // final start = [10, 3, 1, 4, 13, 5, 8, 7, 9, 6, 0, 11, 14, 15, 12, 2];\n  // required solution\n  final start = [15, 14, 1, 6, 9, 11, 4, 12, 0, 10, 7, 3, 13, 8, 5, 2];\n  // Extra credit\n  // final start = [0, 12, 9, 13, 15, 11, 10, 14, 3, 7, 2, 5, 4, 8, 6, 1];\n  print(start);\n  FifteenSolver().solve(start);\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_24.txt",
        "content": "running\nSolution found in 52 moves :rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_25.txt",
        "content": "// A Naive 15 puzzle solver using no memory. Nigel Galloway: October 6th., 2017\nlet Nr,Nc = [|3;0;0;0;0;1;1;1;1;2;2;2;2;3;3;3|],[|3;0;1;2;3;0;1;2;3;0;1;2;3;0;1;2|]\ntype G= |N |I |G |E |L \ntype N={i:uint64;g:G list;e:int;l:int}\nlet fN     n=let g=(11-n.e)*4 in let a=n.i&&&(15UL<<<g)\n             {i=n.i-a+(a<<<16);g=N::n.g;e=n.e+4;l=n.l+(if Nr.[int(a>>>g)]<=n.e/4 then 0 else 1)}\nlet fI     i=let g=(19-i.e)*4 in let a=i.i&&&(15UL<<<g)\n             {i=i.i-a+(a>>>16);g=I::i.g;e=i.e-4;l=i.l+(if Nr.[int(a>>>g)]>=i.e/4 then 0 else 1)}\nlet fG     g=let l=(14-g.e)*4 in let a=g.i&&&(15UL<<<l)\n             {i=g.i-a+(a<<<4) ;g=G::g.g;e=g.e+1;l=g.l+(if Nc.[int(a>>>l)]<=g.e%4 then 0 else 1)}\nlet fE     e=let l=(16-e.e)*4 in let a=e.i&&&(15UL<<<l)\n             {i=e.i-a+(a>>>4) ;g=E::e.g;e=e.e-1;l=e.l+(if Nc.[int(a>>>l)]>=e.e%4 then 0 else 1)}\nlet fL=let l=[|[I;E];[I;G;E];[I;G;E];[I;G];[N;I;E];[N;I;G;E];[N;I;G;E];[N;I;G];[N;I;E];[N;I;G;E];[N;I;G;E];[N;I;G];[N;E];[N;G;E];[N;G;E];[N;G];|]\n       (fun n g->List.except [g] l.[n] |> List.map(fun n->match n with N->fI |I->fN |G->fE |E->fG))\nlet solve n g l=let rec solve n=match n with // n is board, g is pos of 0, l is max depth\n                                |n when n.i =0x123456789abcdef0UL->Some(n.g)\n                                |n when n.l>l                    ->None\n                                |g->let rec fN=function h::t->match solve h with None->fN t |n->n\n                                                       |_->None\n                                    fN (fL g.e (List.head n.g)|>List.map(fun n->n g))\n                solve {i=n;g=[L];e=g;l=0}\n  let n = Seq.collect fN n\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_26.txt",
        "content": "let test n g=match [1..15]|>Seq.tryPick(solve n g) with\n               Some n->n|>List.rev|>List.iter(fun n->printf \"%c\" (match n with N->'d'|I->'u'|G->'r'|E->'l'|L->'\\u0000'));printfn \" (%n moves)\" (List.length n)\n              |_     ->printfn \"No solution found\"\ntest 0xfe169b4c0a73d852UL 8\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_27.txt",
        "content": "rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd (52 moves)\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_28.txt",
        "content": "#! /usr/bin/gforth\n\ncell 8 <> [if] s\" 64-bit system required\" exception throw [then]\n\n\\ In the stack comments below,\n\\ \"h\" stands for the hole position (0..15),\n\\ \"s\" for a 64-bit integer representing a board state,\n\\ \"t\" a tile value (0..15, 0 is the hole),\n\\ \"b\" for a bit offset of a position within a state,\n\\ \"m\" for a masked value (4 bits selected out of a 64-bit state),\n\\ \"w\" for a weight of a current path,\n\\ \"d\" for a direction constant (0..3)\n\n\\ Utility\n: 3dup   2 pick 2 pick 2 pick ;\n: 4dup   2over 2over ;\n: shift   dup 0 > if lshift else negate rshift then ;\n\nhex 123456789abcdef0 decimal constant solution\n: row   2 rshift ;   : col   3 and ;\n\n: up-valid?    ( h -- f ) row 0 > ;\n: down-valid?  ( h -- f ) row 3 < ;\n: left-valid?  ( h -- f ) col 0 > ;\n: right-valid? ( h -- f ) col 3 < ;\n\n: up-cost    ( h t -- 0|1 ) 1 - row swap row < 1 and ;\n: down-cost  ( h t -- 0|1 ) 1 - row swap row > 1 and ;\n: left-cost  ( h t -- 0|1 ) 1 - col swap col < 1 and ;\n: right-cost ( h t -- 0|1 ) 1 - col swap col > 1 and ;\n\n\\ To iterate over all possible directions, put direction-related functions into arrays:\n: ith ( u addr -- w ) swap cells + @ ;\ncreate valid? ' up-valid? , ' left-valid? , ' right-valid? , ' down-valid? , does> ith execute ;\ncreate cost ' up-cost , ' left-cost , ' right-cost , ' down-cost , does> ith execute ;\ncreate step -4 , -1 , 1 , 4 , does> ith ;\n\n\\ Advance from a single state to another:\n: bits ( h -- b ) 15 swap - 4 * ;\n: tile ( s b -- t ) rshift 15 and ;\n: new-state ( s h d -- s' ) step dup >r + bits 2dup tile ( s b t ) swap lshift tuck - swap r> 4 * shift + ;\n: new-weight ( w s h d -- w' ) >r tuck r@ step + bits tile r> cost + ;\n: advance ( w s h d -- w s h w' s' h' ) 4dup new-weight >r  3dup new-state >r  step over + 2r> rot ;\n\n\\ Print a solution:\n: rollback   2drop drop ;\n: .dir ( u -- ) s\" d..r.l..u\" drop 4 + swap + c@ emit ;\n: .dirs ( .. -- ) 0 begin >r 3 pick -1 <> while 3 pick over - .dir rollback r> 1+ repeat r> ;\n: win   cr .\" solved (read right-to-left!): \" .dirs .\"  - \" . .\" moves\" bye ;\n\n\\ The main recursive function for depth-first search:\ncreate limit 1 ,   : deeper  1 limit +! ;\n: u-turn ( .. h2 w1 s1 h1 ) 4 pick 2 pick - ;\n: search ( .. h2 w1 s1 h1 )\n\tover solution = if win then\n\t2 pick limit @ > if exit then\n\t4 0 do dup i valid? if i step u-turn <> if i advance recurse rollback then then loop ;\n\n\\ Iterative-deepening search:\n: solve   1 limit !  begin search deeper again ;\n\n\\ -1 0 hex 0c9dfbae37254861 decimal 0 solve    \\ uhm.\n -1 0 hex fe169b4c0a73d852 decimal 8 solve     \\ the 52 moves case\n\\ -1 0 hex 123456789afbde0c decimal 14 solve   \\ some trivial case, 3 moves\nbye\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_29.txt",
        "content": "time ./15_puzzle_solver.fs \nredefined search \nsolved (read right-to-left!): ddrrdlurrululddruuldlurddldrrruluuldddrurdluuldlurrr - 52 moves\nreal\t1m14.605s\nuser\t1m5.212s\nsys\t0m0.048s\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_3.txt",
        "content": "  0 12  9 13\n 15 11 10 14\n  3  7  2  5\n  4  8  6  1\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_30.txt",
        "content": "59:         H = MOD(ABS(PRODUCT(BRD)),APRIME)\n004016E3   mov         esi,1\n004016E8   mov         ecx,1\n004016ED   cmp         ecx,2\n004016F0   jg          MAIN$SLIDESOLVE+490h (0040171e)\n004016F2   cmp         ecx,1\n004016F5   jl          MAIN$SLIDESOLVE+46Eh (004016fc)\n004016F7   cmp         ecx,2\n004016FA   jle         MAIN$SLIDESOLVE+477h (00401705)\n004016FC   xor         eax,eax\n004016FE   mov         dword ptr [ebp-54h],eax\n00401701   dec         eax\n00401702   bound       eax,qword ptr [ebp-54h]\n00401705   imul        edx,ecx,4\n00401708   mov         edx,dword ptr H (00473714)[edx]\n0040170E   imul        edx,esi\n00401711   mov         esi,edx\n00401713   mov         eax,ecx\n00401715   add         eax,1\n0040171A   mov         ecx,eax\n0040171C   jmp         MAIN$SLIDESOLVE+45Fh (004016ed)\n0040171E   mov         eax,esi\n00401720   cmp         eax,0\n00401725   jge         MAIN$SLIDESOLVE+49Bh (00401729)\n00401727   neg         eax\n00401729   mov         edx,10549h\n0040172E   mov         dword ptr [ebp-54h],edx\n00401731   cdq\n00401732   idiv        eax,dword ptr [ebp-54h]\n00401735   mov         eax,edx\n00401737   mov         dword ptr [H (00473714)],eax\n60:         write (6,*) H,bored\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_31.txt",
        "content": "59:         H = MOD(ABS(BRD(1)*BRD(2)),APRIME)\n004016E3   mov         eax,dword ptr [BRD (00473718)]\n004016E9   imul        eax,dword ptr [BRD+4 (0047371c)]\n004016F0   cmp         eax,0\n004016F5   jge         MAIN$SLIDESOLVE+46Bh (004016f9)\n004016F7   neg         eax\n004016F9   mov         esi,10549h\n004016FE   cdq\n004016FF   idiv        eax,esi\n00401701   mov         eax,edx\n00401703   mov         dword ptr [H (00473714)],eax\n60:         write (6,*) H,bored\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_32.txt",
        "content": "IF (NR.EQ.4) THEN\n code specialised for NR = 4\nELSE IF (NR.EQ.3) THEN\n code specialised for NR = 3\nEND IF\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_33.txt",
        "content": "      SUBROUTINE PROUST(T)\t!Remembrance of time passed.\n       DOUBLE PRECISION T\t!The time, in seconds. Positive only, please.\n       DOUBLE PRECISION S\t!A copy I can mess with.\n       TYPE TIMEWARP\t\t!Now prepare a whole lot of trickery for expressing the wait time.\n        INTEGER LIMIT\t\t!The upper limit for the usage.\n        INTEGER STEP\t\t!Conversion to the next unit.\n        CHARACTER*4 NAME\t!A suitable abbreviated name for the accepted unit.\n       END TYPE TIMEWARP\t!Enough of this.\n       INTEGER CLOCKCRACK\t!How many different units might I play with?\n       PARAMETER (CLOCKCRACK = 5)\t!This should so.\n       TYPE(TIMEWARP) TIME(CLOCKCRACK)\t!One set, please.\n       PARAMETER (TIME = (/\t\t!The mention of times lost has multiple registers.\n     1  TIMEWARP(99, 60,\"secs\"),\t!Beware 99.5+ rounding up to 100.\n     2  TIMEWARP(99, 60,\"mins\"),\t!Likewise with minutes.\n     3  TIMEWARP(66, 24,\"hrs!\"),\t!More than a few days might as well be in days.\n     4  TIMEWARP(99,365,\"days\"),\t!Too many days, and we will speak of years.\n     5  TIMEWARP(99,100,\"yrs!\")/))\t!And the last gasp converts to centuries.\n       INTEGER CC\t\t!A stepper for these selections.\n       CHARACTER*4 U\t\t!The selected unit.\n       INTEGER MSG\t\t!The mouthpiece.\n       COMMON/IODEV/ MSG\t!Used in common.\n        S = T\t\t\t!A working copy.\n        DO CC = 1,CLOCKCRACK\t!Now re-assess DT, with a view to announcing a small number.\n          IF (S.LE.TIME(CC).LIMIT) THEN\t!Too big a number?\n            U = TIME(CC).NAME\t\t\t!No, this unit will suffice.\n            GO TO 10\t\t\t\t!Make off to use it.\n          END IF\t\t\t!But if the number is too big,\n          S = S/TIME(CC).STEP\t\t!Escalate to the next larger unit.\n        END DO \t\t\t!And see if that will suffice.\n        U = \"Cys!!\"\t\t!In case there are too many years, this is the last gasp.\n   10   WRITE (MSG,11) S,U\t!Say it.\n   11   FORMAT (F7.1,A4,$)\t!But don't finish the line.\n       END SUBROUTINE PROUST\t!A sigh.\n\n       CHARACTER*15 FUNCTION HMS(T)\t!Report the time of day.\nCareful! Finite precision and binary/decimal/sexagesimal conversion could cause 2:30:00am. to appear as 2:29:60am.\n        DOUBLE PRECISION S,T\t!Seconds (completed) into the day.\n        INTEGER H,M\t\t!More traditional units are to be extracted.\n        INTEGER SECONDSINDAY\t!A canonical day.\n        PARAMETER (SECONDSINDAY = 24*60*60)\t!Of nominal seconds.\n        CHARACTER*15 TEXT\t!A scratchpad.\n         H = T\t\t\t!Truncate into an integer.\n         S = T - (H - 1)/SECONDSINDAY*SECONDSINDAY\t!Thus allow for midnight = hour 24.\n         IF (S.EQ.SECONDSINDAY/2) THEN\t!This might happen.\n           TEXT = \"High Noon!\"\t!Though the chances are thin.\n         ELSE IF (S.EQ.SECONDSINDAY) THEN\t!This is synonymous with the start of the next day.\n           TEXT = \"Midnight!\"\t!So this presumably won't happen.\n         ELSE\t\t!But more likely are miscellaneous values.\n           H = S/3600\t\t!Convert seconds into whole hours completed.\n           S = S - H*3600\t!The remaining time.\n           M = S/60\t\t!Seconds into minutes completed.\n           S = S - M*60\t\t!Remove them.\n           IF (S .GE. 59.9995D0) THEN\t!Via format F6.3, will this round up to 60?\n             S = 0\t\t!Yes. Curse recurring binary sequences for decimal.\n             M = M + 1\t\t!So, up the minute count.\n             IF (M.GE.60) THEN\t!Is there an overflow here too?\n               M = 0\t\t!Yes.\n               H = H + 1\t!So might appear 24:00:00.000 though it not be Midnight!\n             END IF\t\t!So much for twiddling the minutes.\n           END IF\t\t!And twiddling the hours.\n           IF (H.LT.12) THEN\t!A plague on the machine mentality.\n             WRITE (TEXT,1) H,M,S,\"am.\"\t!Ante-meridian.\n    1        FORMAT (I2,\":\",I2,\":\",F6.3,A3)\t!Thus.\n            ELSE\t\t!For the post-meridian, H >= 12.\n             IF (H.GT.12) H = H - 12\t!Adjust to civil usage. NB! 12 appears.\n             WRITE (TEXT,1) H,M,S,\"pm.\"\t!Thus. Post-meridian.\n           END IF\t!So much for those fiddles.\n           IF (TEXT(4:4).EQ.\" \") TEXT(4:4) = \"0\"\t!Now help hint that the\n           IF (TEXT(7:7).EQ.\" \") TEXT(7:7) = \"0\"\t! character string is one entity.\n         END IF\t\t!So much for preparation.\n         HMS = TEXT\t!The result.\n       END FUNCTION HMS\t!Possible compiler confusion if HMS is invoked in a WRITE statement.\n\n       DOUBLE PRECISION FUNCTION NOWWAS(WOT)\t!Ascertain the local time for interval assessment.\nCompute with whole day numbers, to avoid day rollover annoyances.\nCan't use single precision and expect much discrimination within a day.\nC I'd prefer a TIMESTAMP(Local) and a TIMESTAMP(GMT) system function.\nC Quite likely, the system separates its data to deliver the parameters, which I then re-glue.\n        INTEGER WOT\t!What sort of time do I want?\n        REAL*8 TIME\t!A real good time.\n        INTEGER MARK(8)\t!The computer's clock time will appear here, but fragmented.\n         IF (WOT.LE.0) THEN\t!Just the CPU time for this.\n           CALL CPU_TIME(TIME)\t!Apparently in seconds since starting.\n          ELSE\t\t\t!But normally, I want a time-of-day now.\n           CALL DATE_AND_TIME(VALUES = MARK)\t!Unpack info that I will repack.\nc           WRITE (6,1) MARK\nc    1      FORMAT (\"The computer clock system reports:\",\nc     1      /\"Year\",I5,\", Month\",I3,\", Day\",I3,\nc     2      /\" Minutes from GMT\",I5,\nc     3      /\" Hour\",I3,\", Minute\",I3,\",Seconds\",I3,\".\",I3)\n           TIME = (MARK(5)*60 + MARK(6))*60 + MARK(7) + MARK(8)/1000D0\t!By the millisecond, to seconds.\n           IF (WOT.GT.1) TIME = TIME - MARK(4)*60\t!Shift back to GMT, which may cross a day boundary.\nc          TIME = DAYNUM(MARK(1),MARK(2),MARK(3)) + TIME/SECONDSINDAY\t!The fraction of a day is always less than 1 as MARK(5) is declared < 24.\n           TIME = MARK(3)*24*60*60 + TIME\t!Not bothering with DAYNUM, and converting to use seconds rather than days as the unit.\n         END IF\t\t\t!A simple number, but, multiple trickeries. The GMT shift includes daylight saving's shift...\n         NOWWAS = TIME\t\t!Thus is the finger of time found.\n       END FUNCTION NOWWAS\t!But the Hand of Time has already moved on.\n\n      MODULE SLIDESOLVE\t\t!Collect the details for messing with the game board.\n       INTEGER NR,NC,N\t\t\t\t!Give names to some sizes.\n       PARAMETER (NR = 4, NC = 4, N = NR*NC)\t!The shape of the board.\n       INTEGER*1 BOARD(N),TARGET(N),ZERO(N)\t!Some scratchpads.\n       INTEGER BORED(4)\t\t\t\t!A re-interpretation of the storage containing the BOARD.\n       CHARACTER*(N) BOAR\t\t\t!Another, since the INDEX function only accepts these.\n       EQUIVALENCE (BORED,BOARD,BOAR)\t\t!All together now!\n       CHARACTER*1 DIGIT(0:35)\t\t\t!This will help to translate numbers to characters.\n       PARAMETER (DIGIT = (/\"0\",\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\",\n     1  \"A\",\"B\",\"C\",\"D\",\"E\",\"F\",\"G\",\"H\",\"I\",\"J\",\t!I don't anticipate going beyond 15.\n     2  \"K\",\"L\",\"M\",\"N\",\"O\",\"P\",\"Q\",\"R\",\"S\",\"T\",\t!But, for completeness...\n     3  \"U\",\"V\",\"W\",\"X\",\"Y\",\"Z\"/))\t\t\t!Add a few more.\n      CONTAINS\n       SUBROUTINE SHOW(NR,NC,BOARD)\t!The layout won't work for NC > 99...\n        INTEGER NR,NC\t\t!Number of rows and columns.\n        INTEGER*1 BOARD(NC,NR)\t!The board is stored transposed, in Furrytran!\n        INTEGER R,C\t\t!Steppers.\n        INTEGER MSG\t\t!Keep the compiler quiet.\n        COMMON/IODEV/ MSG\t!I talk to the trees...\n         WRITE (MSG,1) (C,C = 1,NC)\t!Prepare a heading.\n    1    FORMAT (\"Row|\",9(\"__\",I1,:),90(\"_\",I2,:))\t!This should suffice.\n         DO R = 1,NR\t\t!Chug down the rows, for each showing a succession of columns.\n           WRITE (MSG,2) R,BOARD(1:NC,R)\t!Thus, successive elements of storage. Storage style is BOARD(column,row).\n    2      FORMAT (I3,\"|\",99I3)\t\t!Could use parameters, but enough.\n         END DO\t\t\t!Show columns across and rows down, despite the storage order.\n       END SUBROUTINE SHOW\t!Remember to transpose the array an odd number of times.\n\n       SUBROUTINE UNCRAM(IT,BOARD)\t!Recover the board layout..\n        INTEGER IT(2)\t\t!Two 32-bit integers hold 16 four-bit fields in a peculiar order.\n        INTEGER*1 BOARD(*)\t!This is just a simple, orderly sequence of integers.\n        INTEGER I,HIT\t\t!Assistants.\n         DO I = 0,8,8\t\t!Unpack into the work BOARD.\n           HIT = IT(I/8 + 1)\t\t!Grab eight positions, in four bits each..\n                                BOARD(I + 5) = IAND(HIT,15)\t!The first is position 5.\n           HIT = ISHFT(HIT,-4); BOARD(I + 1) = IAND(HIT,15)\t!Hex 48372615\n           HIT = ISHFT(HIT,-4); BOARD(I + 6) = IAND(HIT,15)\t!and C0BFAE9D\n           HIT = ISHFT(HIT,-4); BOARD(I + 2) = IAND(HIT,15)\t!For BOARD(1) = 1, BOARD(2) = 2,...\n           HIT = ISHFT(HIT,-4); BOARD(I + 7) = IAND(HIT,15)\t!This computer is (sigh) little-endian.\n           HIT = ISHFT(HIT,-4); BOARD(I + 3) = IAND(HIT,15)\t!Rather than mess with more loops,\n           HIT = ISHFT(HIT,-4); BOARD(I + 8) = IAND(HIT,15)\t!Explicit code is less of a brain strain.\n           HIT = ISHFT(HIT,-4); BOARD(I + 4) = IAND(HIT,15)\t!And it should run swiftly, too...\n         END DO\t\t\t\t!Only two of them.\n       END SUBROUTINE UNCRAM\t!A different-sized board would be a problem too.\n\n       INTEGER*8 FUNCTION ZDIST(BOARD)\t!Encode the board's positions against the ZERO sequence.\n        INTEGER*1 BOARD(N)\t!The values of the squares.\n        LOGICAL*1 AVAIL(N)\t!The numbers will be used one-by-one to produce ZC.\n        INTEGER BASE\t\t!This is not a constant, such as ten.\n        INTEGER M,IT\t\t!Assistants.\n         AVAIL = .TRUE.\t\t\t!All numbers are available.\n         BASE = N\t\t\t!The first square has all choices.\n         ZDIST = 0\t\t\t!Start the encodement of choices.\n         DO M = 1,N\t\t\t!Step through the board's squares.\n           IT = BOARD(M)\t\t\t!Grab the square's number. It is the index into ZERO.\n           IF (IT.EQ.0) IT = N\t\t\t!But in ZERO, the zero is at the end, damnit.\n           AVAIL(IT) = .FALSE.\t\t\t!This number is now used.\n           ZDIST = ZDIST*BASE + COUNT(AVAIL(1:IT - 1))\t!The number of available values to skip to reach it.\n           BASE = BASE - 1\t\t\t!Option count for the next time around.\n         END DO\t\t\t\t!On to the next square.\n       END FUNCTION ZDIST\t!ZDIST(ZERO) = 0.\n\n       SUBROUTINE REPORT(R,WHICH,MOVE,BRD)\t!Since this is invoked in two places.\n        INTEGER R\t\t!The record number of the position.\n        CHARACTER*(*) WHICH\t!In which stash.\n        CHARACTER*1 MOVE\t!The move code.\n        INTEGER BRD(2)\t\t!The crammed board position.\n        INTEGER*1 BOARD(N)\t!Uncrammed for nicer presentation.\n        INTEGER*8 ZC\t\t!Encodes the position in a mixed base.\n        INTEGER ZM,ZS\t\t!Alternate forms of distance.\n        DOUBLE PRECISION ZE\t!This is Euclidean.\n        INTEGER MSG\t\t!Being polite about usage,\n        COMMON/IODEV/MSG\t!Rather than mysterious constants.\n         CALL UNCRAM(BRD,BOARD)\t\t!Isolate the details.\n         ZM = MAXVAL(ABS(BOARD - ZERO))\t\t\t!A norm. |(x,y)| = r gives a square shape.\n         ZS = SUM(ABS(BOARD - ZERO))\t\t\t!A norm. |(x,y)| = r gives a diamond shape.\n         ZE = SQRT(DFLOAT(SUM((BOARD - ZERO)**2)))\t!A norm. |(x,y)| = r gives a circle.\n         ZC = ZDIST(BOARD)\t\t\t\t!Encodement against ZERO.\n         WRITE (MSG,1) R,WHICH,MOVE,DIGIT(BOARD),ZM,ZS,ZE,ZC\t!After all that,\n    1    FORMAT (I11,A6,A5,1X,\"|\",<NR - 1>(<NC>A1,\"/\"),<NC>A1,\"|\",\t!Show the move and the board\n     1    2I8,F12.3,I18)\t\t\t\t\t!Plus four assorted distances.\n       END SUBROUTINE REPORT\t!Just one line is produced.\n\n       SUBROUTINE PURPLE HAZE(BNAME)\t!Spreads a red and a blue tide.\n        CHARACTER*(*) BNAME\t\t!Base name for the work files.\n        CHARACTER*(N) BRAND\t\t!Name part based on the board sequence.\n        CHARACTER*(LEN(BNAME) + 1 + N + 4) FNAME\t!The full name.\nCollect the details for messing with the game board.\n        CHARACTER*4 TIDE(2)\t\t\t!Two tides will spread forth.\n        PARAMETER (TIDE = (/\" Red\",\"Blue\"/))\t!With these names.\n        INTEGER LZ,LOCZ(2),LOCI(2),ZR,ZC\t!Location via row and column.\n        EQUIVALENCE(LOCZ(1),ZR),(LOCZ(2),ZC)\t!Sometimes separate, sometimes together.\n        INTEGER WAY(4),HENCE,W,M,D,WAYS(2,4)\t!Direction codes.\n        PARAMETER (WAY = (/   +1,  -NC,   -1,  +NC/))\t!Directions for the zero square, in one dimension.\n        PARAMETER (WAYS = (/0,+1, -1,0, 0,-1, +1,0/))\t!The same, but in (row,column) style.\n        CHARACTER*1 WNAMEZ(0:4),WNAMEF(0:4)\t!Names for the directions.\n        PARAMETER (WNAMEZ = (/\" \",\"R\",\"U\",\"L\",\"D\"/))\t!The zero square's WAYS.\n        PARAMETER (WNAMEF = (/\" \",\"L\",\"D\",\"R\",\"U\"/))\t!The moved square's ways are opposite.\nCreate two hashed stashes. A stash file and its index file, twice over.\n        INTEGER APRIME\t\t\t\t!Determines the size of the index.\n        PARAMETER (APRIME = 199 999 991)\t!Prime 11078917. Prime 6666666 = 116 743 349. Perhaps 1999999973?\n        INTEGER HCOUNT(2),NINDEX(2)\t\t!Counts the entries in the stashes and their indices.\n        INTEGER P,HIT\t\t\t\t!Fingers to entries in the stash.\n        INTEGER SLOSH,HNEXT\t\t\t!Advances from one surge to the next.\n        INTEGER IST(2),LST(2),SURGE(2)\t\t!Define the perimeter of a surge.\n        INTEGER HEAD,LOOK\t\t\t!For chasing along a linked-list of records.\n        TYPE AREC\t\t\t\t!Stores the board position, and helpful stuff.\n         INTEGER NEXT\t\t\t\t\t!Links to the next entry that has the same hash value.\n         INTEGER PREV\t\t\t\t\t!The entry from which this position was reached.\n         INTEGER MOVE\t\t\t\t\t!By moving the zero in this WAY.\n         INTEGER BRD(2)\t\t\t\t\t!Squeezed representation of the board position.\n        END TYPE AREC\t\t\t\t!Greater compaction (especially of MOVE) would require extra crunching.\n        INTEGER LREC\t\t\t\t!Record length, in INTEGER-size units. I do some counting.\n        PARAMETER (LREC = 5)\t\t\t!For the OPEN statement.\n        TYPE(AREC) ASTASH,APROBE\t\t!I need two scratchpads.\n        INTEGER NCHECK\t\t\t\t!Number of new positions considered.\n        INTEGER NLOOK(2),PROBES(2),NP(2),MAXP(2)!Statistics for the primary and secondary searches resulting.\n        LOGICAL SURGED(2)\t\t\t!A SLOSH might not result in a SURGE.\nCatch   the red/blue meetings, if any.\n        INTEGER MANY,LONG\t\t\t!They may be many, and, long.\n        PARAMETER (MANY = 666,LONG = 66)\t!This should do.\n        INTEGER NMET,MET(2,MANY)\t\t!Identify the meeting positions, in their own stash.\n        INTEGER NTRAIL,TRAIL(LONG)\t\t!Needed to follow the moves.\n        INTEGER NS,LS(MANY)\t\t\t!Count the shove sequences.\n        CHARACTER*128 SHOVE(MANY)\t\t!Record them.\nConglomeration of support stuff.\n        LOGICAL EXIST\t\t\t\t!For testing the presence of a disc file.\n        INTEGER I,IT\t\t\t\t!Assistants.\n        DOUBLE PRECISION T1,T2,E1,E2,NOWWAS\t!Time details.\n        CHARACTER*15 HMS\t\t\t!A clock.\n        INTEGER MSG,KBD,WRK(2),NDX(2)\t!I/O unit numbers.\n        COMMON/IODEV/ MSG,KBD,WRK,NDX\t!I talk to the trees...\n         NS = 0\t!No shove sequences have been found.\nConcoct some disc files for storage areas, reserving the first record of each as a header.\n   10    BOARD = ZERO\t!The red tide spreads from \"zero\".\n         DO W = 1,2\t!Two work files are required.\n           WRITE(MSG,11) TIDE(W)\t!Which one this time?\n   11      FORMAT (/,\"Tide \",A)\t\t!Might as well supply a name.\n           DO I = 1,N\t\t!Produce a text sequence for the board layout.\n             BRAND(I:I) = DIGIT(BOARD(I))\t!One by one...\n           END DO\t\t!BRAND = DIGIT(BOARD)\n           FNAME = BNAME//\".\"//BRAND//\".dat\"\t!It contains binary stuff, so what else but data?\n           INQUIRE (FILE = FNAME, EXIST = EXIST)\t!Perhaps it is lying about.\n   20      IF (EXIST) THEN\t\t\t\t!Well?\n             WRITE (MSG,*) \"Restarting from file \",FNAME\t!One hopes its content is good.\n             OPEN (WRK(W),FILE = FNAME,STATUS = \"OLD\",ACCESS = \"DIRECT\",\t!Random access is intended.\n     1        FORM = \"UNFORMATTED\",BUFFERED = \"YES\",RECL = LREC)\t\t!Using record numbers as the key.\n             FNAME = BNAME//\".\"//BRAND//\".ndx\"\t\t!Now go for the accomplice.\n             INQUIRE (FILE = FNAME, EXIST = EXIST)\t!That contains the index.\n             IF (.NOT.EXIST) THEN\t\t\t!Well?\n               WRITE (MSG,*) \" ... except, no file \",FNAME\t!Oh dear.\n               CLOSE(WRK(W))\t\t\t\t!So, no index for the work file. Abandon it.\n               GO TO 20\t\t\t\t\t!And thus jump into the ELSE clause below.\n             END IF\t\t\t\t!Seeing as an explicit GO TO would be regarded as improper...\n             READ (WRK(W),REC = 1) HCOUNT(W),SURGE(W),IST(W),LST(W)!Get the header information.\n             WRITE (MSG,22) HCOUNT(W),SURGE(W),IST(W),LST(W)\t!Reveal.\n   22        FORMAT (\" Stashed \",I0,\". At surge \",I0,\t\t!Perhaps it will be corrupt.\n     1        \" with the boundary stashed in elements \",I0,\" to \",I0)\t!If so, this might help the reader.\n             OPEN (NDX(W),FILE = FNAME,STATUS = \"OLD\",ACCESS=\"DIRECT\",\t!Now for the accomplice.\n     1        FORM = \"UNFORMATTED\",BUFFERED = \"YES\",RECL = 1)\t\t!One INTEGER per record.\n             READ(NDX(W), REC = 1) NINDEX(W)\t\t\t!This count is maintained, to avoid a mass scan.\n             WRITE (MSG,23) NINDEX(W),APRIME\t\t\t!Exhibit the count.\n   23        FORMAT (\" Its index uses \",I0,\" of \",I0,\" entries.\")\t!Simple enough.\n            ELSE\t\t\t!But, if there is no stash, create a new one.\n             WRITE (MSG,*) \"Preparing a stash in file \",FNAME\t!Start from scratch.\n             OPEN (WRK(W),FILE = FNAME,STATUS=\"REPLACE\",ACCESS=\"DIRECT\",\t!I intend non-sequential access...\n     1        FORM = \"UNFORMATTED\",BUFFERED = \"YES\",RECL = LREC)\t\t!And, not text.\n             HCOUNT(W) = 1\t\t!Just one position is known, the final position.\n             SURGE(W) = 0\t\t!It has not been clambered away from.\n             IST(W) = 1\t\t\t!The first to inspect at the current level.\n             LST(W) = 1\t\t\t!The last.\n             WRITE (WRK(W),REC = 1) HCOUNT(W),SURGE(W),IST(W),LST(W),0\t!The header.\n             FNAME = BNAME//\".\"//BRAND//\".ndx\"\t!Now for the associated index file..\n             WRITE (MSG,*) \"... with an index in file \",FNAME\t!Announce before attempting access.\n             OPEN (NDX(W),FILE = FNAME,STATUS = \"REPLACE\",ACCESS=\t!Lest there be a mishap.\n     1        \"DIRECT\",FORM = \"UNFORMATTED\",BUFFERED = \"YES\",RECL = 1)\t!Yep. Just one value per record.\n             WRITE (MSG,*) APRIME,\" zero values for an empty index.\"\t!This may cause a pause.\n             NINDEX(W) = 1\t\t\t\t!The index will start off holding one used entry.\n             WRITE (NDX(W),REC = 1) NINDEX(W)\t!Save this count in the header record.\n             WRITE (NDX(W),REC = 1 + APRIME) 0\t!Zero values will also appear in the gap!\n             ASTASH.NEXT = 0\t\t!The first index emtry can never collide with another in an empty index.\n             ASTASH.PREV = 0\t\t!And it is created sufficient unto itself.\n             ASTASH.MOVE = 0\t\t!Thus, it is not a descendant, but immaculate.\n             ASTASH.BRD(1) = BORED(1)*16 + BORED(2)\t!Only four bits of the eight supplied are used.\n             ASTASH.BRD(2) = BORED(3)*16 + BORED(4)\t!So interleave them, pairwise.\n             SLOSH = ASTASH.BRD(1)*ASTASH.BRD(2)\t!Mash the bits together.\n             HIT = ABS(MOD(SLOSH,APRIME)) + 2\t\t!Make a hash. Add one since MOD starts with zero.\n             WRITE (NDX(W),REC = HIT) HCOUNT(W)\t\t!Adding another one to dodge the header as well.\n             WRITE (MSG,24) BOARD,BORED,ASTASH.BRD,\t!Reveal the stages.\n     1        SLOSH,SLOSH,SLOSH,APRIME,HIT\t\t\t\t!Of the mostly in-place reinterpretations.\n   24        FORMAT (<N>Z2,\" is the board layout in INTEGER*1\",/,\t!Across the columns and down the rows.\n     1        4Z8,\" is the board layout in INTEGER*4\",/,\t\t!Reinterpret as four integers.\n     2        2(8X,Z8),\" ..interleaved into two INTEGER*4\",/,\t\t!Action: Interleaved into two.\n     3        Z32,\" multiplied together in INTEGER*4\",/,\t\t!Action: Their product.\n     4        I32,\" as a decimal integer.\",/,\t\t\t\t!Abandoning hexadecimal.\n     5        \"ABS(MOD(\",I0,\",\",I0,\")) + 2 = \",I0,\t\t\t!The final step.\n     6        \" is the record number for the first index entry.\")\t!The result.\n             WRITE (WRK(W),REC = HCOUNT(W) + 1) ASTASH\t!Record one is reserved as a header...\n           END IF\t\t\t\t!Either way, a workfile should be ready now.\n           IF (W.EQ.1) BOARD = TARGET\t!Thus go for the other work file.\n         END DO\t\t!Only two iterations, but a lot of blather.\n         SLOSH = MINVAL(SURGE,DIM = 1)\t!Find the laggard.\n\nCast forth a heading for the progress table to follow..\n         WRITE (MSG,99)\n   99    FORMAT (/,7X,\"|\",3X,\"Tidewrack Boundary Positions  |\",\n     1    6X,\"Positions\",5X,\"|\",7X,\"Primary Probes\",9X,\"Index Use\",\n     2    4X,\"|\",5X,\"Secondary Probes\",3X,\"|\",\" Memory of Time Passed\",/,\n     3    \"Surge\",2X,\"|\",6X,\"First\",7X,\"Last\",6X,\"Count|\",\n     4    4X,\"Checked Deja vu%|\",7X,\"Made Max.L  Avg.L|   Used%\",\n     5    5X,\"Load%|\",7X,\"Made Max.L  Avg.L|\",6X,\"CPU\",8X,\"Clock\")\n\nChase along the boundaries of the red and the blue tides, each taking turns as primary and secondary interests.\n  100    SLOSH = SLOSH + 1\t!Another advance begins.\n      WW:DO W = 1,2\t!The advance is made in two waves, each with its own statistics.\n           M = 3 - W\t\t!Finger the other one.\n           NMET = 0\t\t!No meetings have happened yet.\n           IF (SURGE(W).GE.SLOSH) CYCLE WW\t!Prefer to proceed with matched surges.\n           WRITE (MSG,101) SLOSH,TIDE(W),IST(W),LST(W),LST(W)-IST(W)+1\t!The boundary to be searched.\n  101      FORMAT (I2,1X,A4,\"|\",3I11,\"|\",$)\t\t\t\t!This line will be continued.\n           NCHECK = 0\t\t!No new positions have been prepared.\n           NLOOK = 0\t\t!So the stashes have not been searched for any of them.\n           PROBES = 0\t\t!And no probes have been made in any such searches.\n           MAXP = 0\t\t!So the maximum length of all probe chains is zero so far.\n           HNEXT = LST(W) + 1\t!This will be where the first new position will be stashed.\n           T1 = NOWWAS(0)\t!Note the accumulated CPU time at the start of the boundary ride..\n           E1 = NOWWAS(2)\t!Time of day, in seconds. GMT style (thus not shifted by daylight saving)\n        PP:DO P = IST(W),LST(W)\t!These are on the edge of the tide. Spreading proceeds.\n             READ (WRK(W),REC = P + 1) ASTASH\t!Obtain a position, remembering to dodge the header record.\n             HENCE = ASTASH.MOVE\t\t!The move (from ASTASH.PREV) that reached this position.\n             IF (HENCE.NE.0) HENCE = MOD(HENCE + 1,4) + 1\t!The reverse of that direction. Only once zero. Sigh.\n             CALL UNCRAM(ASTASH.BRD,BOARD)\t!Unpack into the work BOARD.\n             LZ = INDEX(BOAR,CHAR(0))\t!Find the BOARD square with zero.\n             ZR =    (LZ - 1)/NC + 1\t!Convert to row and column in LOCZ to facilitate bound checking.\n             ZC = MOD(LZ - 1,NC) + 1\t!Two divisions, sigh. Add a special /\\ syntax? (ZR,ZC) = (LZ - 1)/\\NC + 1\nConsider all possible moves from position P, If a new position is unknown, add it to the stash.\n          DD:DO D = 1,4\t\t\t!Step through the possible directions in which the zero square might move.\n               IF (D.EQ.HENCE) CYCLE DD\t\t!Don't try going back whence this came.\n               LOCI = LOCZ + WAYS(1:2,D)\t!Finger the destination of the zero square, (row,column) style.\n               IF (ANY(LOCI.LE.0)) CYCLE DD\t!No wrapping left/right or top/bottom.\n               IF (ANY(LOCI.GT.(/NR,NC/))) CYCLE DD\t!No .OR. to avoid the possibility of non-shortcut full evaluation.\n               NCHECK = NCHECK + 1\t\t!So, here is another position to inspect.\n               NP = 0\t\t\t\t!No probes of stashes W or M for it have been made.\n               IT = WAY(D) + LZ\t\t\t!Finger the square that is to move to the adjacent zero.\n               BOARD(LZ) = BOARD(IT)\t\t!Move that square's content to the square holding the zero.\n               BOARD(IT) = 0\t\t\t!It having departed.\n               ASTASH.BRD(1) = BORED(1)*16 + BORED(2)\t!Pack the position list\n               ASTASH.BRD(2) = BORED(3)*16 + BORED(4)\t!Without fussing over adjacency,\n               HIT = ABS(MOD(ASTASH.BRD(1)*ASTASH.BRD(2),APRIME)) + 2\t!Crunch the hash index.\n               READ (NDX(W),REC = HIT) HEAD\t!Refer to the index, which fingers the first place to look.\n               LOOK = HEAD\t\t\t!This may be the start of a linked-list.\n               IF (LOOK.EQ.0) NINDEX(W) = NINDEX(W) + 1\t!Or, a new index entry will be made.\n               IF (LOOK.NE.0) NLOOK(1) = NLOOK(1) + 1\t!Otherwise, we're looking at a linked-list, hopefully short.\n               DO WHILE (LOOK.NE.0)\t\t!Is there a stash entry to look at?\n                 NP(1) = NP(1) + 1\t\t\t!Yes. Count a probe of the W stash.\n                 READ (WRK(W),REC = LOOK + 1) APROBE\t!Do it. (Dodging the header record)\n                 IF (ALL(ASTASH.BRD.EQ.APROBE.BRD)) GO TO 109\t!Already seen? Ignore all such as previously dealt with.\n                 LOOK = APROBE.NEXT\t\t\t!Perhaps there follows another entry having the same index.\n               END DO\t\t\t\t!And eventually, if there was no matching entry,\n               HCOUNT(W) = HCOUNT(W) + 1\t!A new entry is to be added to stash W, linked from its index.\n               IF (HCOUNT(W).LE.0) STOP \"HCOUNT overflows!\"\t!Presuming the usual two's complement style.\n               WRITE (NDX(W),REC = HIT) HCOUNT(W)\t!The index now fingers the new entry in ASTASH.\n               ASTASH.NEXT = HEAD\t\t\t!Its follower is whatever the index had fingered before.\n               ASTASH.PREV = P\t\t\t!This is the position that led to it.\n               ASTASH.MOVE = D\t\t\t!Via this move.\n               WRITE (WRK(W),REC = HCOUNT(W) + 1) ASTASH\t!Place the new entry, dodging the header.\nCheck the other stash for this new position. Perhaps there, a meeting will be found!\n               READ (NDX(M),REC = HIT) LOOK\t!The other stash uses the same hash function but has its own index.\n               IF (LOOK.NE.0) NLOOK(2) = NLOOK(2) + 1\t!Perhaps stash M has something to look at.\n               DO WHILE(LOOK.NE.0)\t\t!Somewhere along a linked-list.\n                 NP(2) = NP(2) + 1\t\t\t!A thorough look may involve multiple probes.\n                 READ(WRK(M),REC = LOOK + 1) APROBE\t!Make one.\n                 IF (ALL(ASTASH.BRD.EQ.APROBE.BRD)) THEN!A match?\n                   IF (NMET.LT.MANY) THEN\t\t\t!Yes! Hopefully, not too many already.\n                     NMET = NMET + 1\t\t\t\t\t!Count another.\n                     MET(W,NMET) = HCOUNT(W)\t\t\t\t!Save a finger to the new entry.\n                     MET(M,NMET) = LOOK\t\t\t\t\t!And to its matching counterparty.\n                    ELSE\t\t\t\t\t\t!But if too numerous for my list,\n                     WRITE (MSG,108) TIDE(W),HCOUNT(W),TIDE(M),LOOK\t!Announce each.\n  108                FORMAT (\"Can't save \",A,1X,I0,\" matching \",A,1X,I0)!Also wrecking my tabular layout.\n                   END IF\t\t\t\t\t\t!So much for recording a match.\n                   GO TO 109\t\t\t\t\t!Look no further for the new position; it is found..\n                 END IF\t\t\t\t\t!So much for a possible match.\n                 LOOK = APROBE.NEXT\t\t\t!Chase along the linked-list.\n               END DO\t\t\t\t!Thus checking all those hashing to the same index.\nCompleted the probe.\n  109          MAXP = MAX(MAXP,NP)\t\t!Track the maximum number of probes in any search..\n               PROBES = PROBES + NP\t\t!As well as their count.\n               BOARD(IT) = BOARD(LZ)\t\t!Finally, undo the move.\n               BOARD(LZ) = 0\t\t\t!To be ready for the next direction.\n             END DO DD\t\t\t!Consider another direction.\n           END DO PP\t\t!Advance P to the next spreading possibility.\nCompleted one perimeter sequence. Cast forth some statistics.\n  110      T2 = NOWWAS(0)\t!A boundary patrol has been completed.\n           E2 = NOWWAS(2)\t!And time has passed.\n           HIT = HCOUNT(W) - HNEXT + 1\t!The number of new positions to work from in the next layer.\n           WRITE (MSG,111) NCHECK,100.0*(NCHECK - HIT)/NCHECK,\t!Tested, and %already seen\n     1      NLOOK(1),MAXP(1),FLOAT(PROBES(1))/MAX(NLOOK(1),1),\t!Search statistics.\n     2      100.0*NINDEX(W)/APRIME,100.0*HCOUNT(W)/APRIME,\t!Index occupancy: used entries, and load.\n     3      NLOOK(2),MAXP(2),FLOAT(PROBES(2))/MAX(NLOOK(2),1)\t!Other stash's search statistics.\n  111      FORMAT (I11,F9.2,\"|\",I11,I6,F7.3,\"|\",F8.3,F10.3,\"|\",\t!Attempt to produce regular columns.\n     1      I11,I6,F7.3,\"|\"$)\t\t\t\t\t!To be continued...\n           T1 = T2 - T1\t\t\t!Thus, how much CPU time was used perusing the perimeter.\n           E1 = E2 - E1\t\t\t!Over the elapsed time.\n           CALL PROUST(T1)\t\t!Muse over the elapsed CPU time, in seconds.\n           CALL PROUST(E1)\t\t!And likewise the elapsed clock time.\n           E2 = NOWWAS(1)\t\t!Civil clock, possibly adjusted for daylight saving.\n           IF (E1.LE.0) THEN\t\t!The offered timing may be too coarse.\n             WRITE (MSG,112) HMS(E2)\t\t!So, just finish the line.\n  112        FORMAT (8X,A)\t\t\t!With a time of day.\n            ELSE\t\t\t!But if some (positive) clock time was measured as elapsing,\n             WRITE (MSG,113) T1/E1*100,HMS(E2)\t!Offer a ratio as well.\n  113        FORMAT (F6.2,\"%\",1X,A)\t\t!Percentages are usual.\n           END IF\t\t\t!Enough annotation.\nCould there be new positions to check? HCOUNT will have been increased if so.\n           SURGED(W) = HCOUNT(W).GE.HNEXT\t!The boundary has been extended to new positions.\n           IF (SURGED(W)) THEN\t\t!But, are there any new positions?\n             IST(W) = HNEXT\t\t\t!Yes. The first new position would have been placed here.\n             LST(W) = HCOUNT(W)\t\t\t!This is where the last position was placed.\n             SURGE(W) = SLOSH\t\t\t!The new surge is ready.\n             WRITE (WRK(W),REC = 1) HCOUNT(W),SURGE(W),IST(W),LST(W)\t!Update the headers correspondingly..\n             WRITE (NDX(W), REC = 1) NINDEX(W)\t!Otherwise, a rescan would be needed on a restart.\n           ELSE IF (SURGE(W) + 1 .EQ. SLOSH) THEN\t!No new positions. First encounter?\n             LOOK = LST(W) - IST(W) + 1\t\t!Yes. How many dead ends are there?\n             WRITE (MSG,114) LOOK\t\t!Announce.\n  114        FORMAT (/,\"The boundary has not surged to new positions!\",/\n     1       \"The now-static boundary has \",I0)\n             LOOK = LOOK/666 + 1\t\t!If there are many, don't pour forth every one.\n             IF (LOOK.GT.1) WRITE (MSG,115) LOOK!Some restraint.\n  115        FORMAT (6X,\"... Listing step: \",I0)!Rather than rolling forth a horde.\n             WRITE (MSG,121)\t\t\t!Re-use the heading for the REPORT.\n             DO P = IST(W),LST(W),LOOK\t\t!Step through the dead ends, possibly sampling every one.\n               READ (WRK(W),REC = P + 1) ASTASH\t\t!Grab a position.\n               CALL REPORT(P,TIDE(W),WNAMEF(ASTASH.MOVE),ASTASH.BRD)\t!Describe it.\n             END DO\t\t\t\t!On to the next dead end.\n           END IF\t\t\t!Perhaps the universe has been filled.\nCould the clouds have touched? If so, two trails have met.\n  120   ML:DO P = 1,NMET\t\t!Step through the meeting list.\n             IF (NS.LT.MANY) NS = NS + 1!Note another shove sequence.\n             LS(NS) = 0\t\t\t!Details to be determined.\n             WRITE (MSG,121)\t\t!Announce, via a heading.\n  121         FORMAT (/,5X,\"Record Stash Move |Board layout by row|\",\t!Various details\n     1         2X,\"Max|d|  Sum|d|   Euclidean   Encoded vs Zero\")\t!Will be attached.\n             NTRAIL = 1\t\t\t!Every trail starts with its first step.\n             TRAIL(1) = MET(2,P)\t!This is the blue trail's position that met the red tide..\n  122        READ(WRK(2),REC = TRAIL(NTRAIL) + 1) ASTASH\t!Obtain details\n             IF (ASTASH.PREV.NE.0) THEN\t!Had this step arrived from somewhere?\n               IF (NTRAIL.GE.LONG) STOP \"The trail is too long!\"\t!Yes.\n               NTRAIL = NTRAIL + 1\t\t!Count another step.\n               TRAIL(NTRAIL) = ASTASH.PREV\t!Finger the preceding step.\n               GO TO 122\t\t\t!And investigate it in turn.\n             END IF\t\t\t!Thus follow the blue trail back to its origin.\n  130        DO LOOK = NTRAIL,1,-1\t!The end of the blue trail is the position in TARGET, the start position.\n               READ(WRK(2),REC = TRAIL(LOOK) + 1) ASTASH\t!Grab a position, dodging the header.\n               CALL REPORT(TRAIL(LOOK),\"Blue\",WNAMEF(ASTASH.MOVE),\t!Backwards*backwards = forwards.\n     1          ASTASH.BRD)\t\t\t\t\t\t!The board layout is always straightforward...\n               IF (LOOK.NE.NTRAIL) THEN\t\t!The start position has no move leading to it.\n                 IF (LS(NS).LT.LEN(SHOVE(1))) LS(NS) = LS(NS) + 1\t!But count all subsequent ssociated moves.\n                 SHOVE(NS)(LS(NS):LS(NS)) = WNAMEF(ASTASH.MOVE)\t!Place it.\n               END IF\t\t\t\t!So much for that move.\n             END DO\t\t\t!On to the next move away from the start position.\n  140        HEAD = 0\t\t\t!Syncopation. Prevent the first position of the red trail from being listed.\n             LOOK = MET(1,P)\t\t!It is the same position as the first in the TRAIL, but in the primary stash.\n             DO WHILE(LOOK.NE.0)\t!The red chain runs back to its starting position, which is the \"solution\" state..\n               READ(WRK(1),REC = LOOK + 1) ASTASH\t!Which is in the direction I want to list.\n               IF (HEAD.NE.0) THEN\t\t\t!Except that the moves are one step behind for this list.\n                 CALL REPORT(LOOK,\"Red\",WNAMEZ(HEAD),ASTASH.BRD)\t!As this sequence is not being reversed.\n                 IF (LS(NS).LT.LEN(SHOVE(1))) LS(NS) = LS(NS) + 1\t!This lists the moves in forwards order.\n                 SHOVE(NS)(LS(NS):LS(NS)) = WNAMEZ(HEAD)\t!But the directions are reversed....\n               END IF\t\t\t\t!This test avoids listing the \"Red\" position that is the same as the last \"Blue\" position.\n               HEAD = ASTASH.MOVE\t\t!This is the move that led to this position.\n               LOOK = ASTASH.PREV\t\t!From the next position, which will be listed next.\n             END DO\t\t\t!Thus, the listed position was led to by the previous position's move.\n  150        DO I = 1,NS - 1\t\t!Perhaps the move sequence has been found already.\n               IF (SHOVE(I)(1:LS(I)).EQ.SHOVE(NS)(1:LS(NS))) THEN\t!So, compare agains previous shoves.\n                 WRITE (MSG,151) I\t\t\t\t!It has been seen.\n  151            FORMAT (6X,\"... same as for sequence \",I0)\t!Humm.\n                 NS = NS - 1\t\t\t\t\t!Eject the arriviste.\n                 GO TO 159\t\t\t\t\t!And carry on.\n               END IF\t\t\t\t!This shouldn't happen...\n             END DO\t\t\t!On to the next comparison.\n             WRITE (MSG,152) LS(NS),SHOVE(NS)(1:LS(NS))\t!Show the moves along a line.\n  152        FORMAT (I4,\" moves: \",A)\t!Surely plural? One-steps wouldn't be tried?\n  159      END DO ML\t\t!Perhaps another pair of snakes have met.\n         END DO WW\t!Advance W to the other one. M will be swapped correspondingly.\n\nCould there be an end to it all?\n         IF (.NOT.ANY(SURGED)) STOP \"No progress!\"\t!Oh dear.\n         IF (NMET.LE.0) GO TO 100\t\t\t!Keep right on to the end of the road...\n       END SUBROUTINE PURPLE HAZE\t!That was fun!\n      END MODULE SLIDESOLVE\n\n      PROGRAM POKE\n      USE SLIDESOLVE\n      CHARACTER*(19) FNAME\t\t!A base name for some files.\n      INTEGER I,R,C\t\t\t!Some steppers.\n      INTEGER MSG,KBD,WRK(2),NDX(2)\t!I/O unit numbers.\n      COMMON/IODEV/ MSG,KBD,WRK,NDX\t!I talk to the trees..\n      KBD = 5\t\t\t!Standard input. (Keyboard)\n      MSG = 6\t\t\t!Standard output.(Display screen)\n      WRK = (/10,12/)\t\t!I need two work files,\n      NDX = WRK + 1\t\t!Each with its associated index.\n      WRITE (FNAME,1) NR,NC\t!Now prepare the file name.\n    1 FORMAT (\"SlideSolveR\",I1,\"C\",I1,\".txt\")\t!Allowing for variation, somewhat.\n      WRITE (MSG,2) NR,NC,FNAME\t\t\t!Announce.\n    2 FORMAT (\"To play 'slide-square' with \",I0,\" rows and \",\n     1 I0,\" columns.\",/,\"An initial layout will be read from file \",\n     2 A,/,\"The objective is to attain the nice orderly layout\"\n     3 \" as follows:\",/)\n      FORALL(I = 1:N - 1) ZERO(I) = I\t!Regard the final or \"solution\" state as ZERO.\n      ZERO(N) = 0\t\t\t!The zero sqiuare is at the end, damnit!\n      CALL SHOW(NR,NC,ZERO)\t\t!Show the squares in their \"solved\" arrangement: the \"Red\" stash.\n      OPEN(WRK(1),FILE=FNAME,STATUS=\"OLD\",ACTION=\"READ\")\t!For formatted input.\n      DO R = 1,NR\t\t\t!Chug down the rows, reading successive columns across a row..\n        READ (WRK(1),*) (TARGET((R - 1)*NC + C), C = 1,NC)\t!Into successive storage locations.\n      END DO\t\t\t\t!Furrytran's storage order is (column,row) for that, alas.\n      CLOSE (WRK(1))\t\t\t!A small input, but much effort follows.\n      WRITE (MSG,3)\t\t\t!Now show the supplied layout.\n    3 FORMAT (/,\"The starting position:\")\t!The target, working backwards.\n      CALL SHOW(NR,NC,TARGET)\t\t!This will be the starting point for the \"Blue\" stash.\n      IF (ALL(TARGET.EQ.BOARD)) STOP \"Huh? They're the same!\"\t!Surely not.\n      WRITE (MSG,4)\n    4 FORMAT (/'The plan is to spread a red tide from the \"solved\" ',\n     1 \"layout and a blue tide from the specified starting position.\",/\n     2 \"The hope is that these floods will meet at some position,\",\n     3 \" and the blue moves plus the red moves in reverse order,\",/\n     4 \"will be the shortest sequence from the given starting\",\n     5 \" position to the solution.\")\n\n      CALL PURPLE HAZE(FNAME(1:14))\n\n      END\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_34.txt",
        "content": "To play 'slide-square' with 4 rows and 4 columns.\nAn initial layout will be read from file SlideSolveR4C4.txt\nThe objective is to attain the nice orderly layout as follows:\n\nRow|__1__2__3__4\n  1|  1  2  3  4\n  2|  5  6  7  8\n  3|  9 10 11 12\n  4| 13 14 15  0\n\nThe starting position:\nRow|__1__2__3__4\n  1| 15 14  1  6\n  2|  9 11  4 12\n  3|  0 10  7  3\n  4| 13  8  5  2\n\nThe plan is to spread a red tide from the \"solved\" layout and a blue tide from the specified starting position.\nThe hope is that these floods will meet at some position, and the blue moves plus the red moves in reverse order,\nwill be the shortest sequence from the given starting position to the solution.\n\nTide  Red\n Preparing a stash in file SlideSolveR4C4.123456789ABCDEF0.dat\n ... with an index in file SlideSolveR4C4.123456789ABCDEF0.ndx\n   199999991  zero values for an empty index.\n 1 2 3 4 5 6 7 8 9 A B C D E F 0 is the board layout in INTEGER*1\n 4030201 8070605 C0B0A09   F0E0D is the board layout in INTEGER*4\n        48372615        C0BFAE9D ..interleaved into two INTEGER*4\n                        EF5FA0E1 multiplied together in INTEGER*4\n                      -278945567 as a decimal integer.\nABS(MOD(-278945567,199999991)) + 2 = 78945578 is the record number for the first index entry.\n\nTide Blue\n Preparing a stash in file SlideSolveR4C4.FE169B4C0A73D852.dat\n ... with an index in file SlideSolveR4C4.FE169B4C0A73D852.ndx\n   199999991  zero values for an empty index.\n F E 1 6 9 B 4 C 0 A 7 3 D 8 5 2 is the board layout in INTEGER*1\n 6010E0F C040B09 3070A00 205080D is the board layout in INTEGER*4\n        6C14EBF9        3275A80D ..interleaved into two INTEGER*4\n                        B2B863A5 multiplied together in INTEGER*4\n                     -1296538715 as a decimal integer.\nABS(MOD(-1296538715,199999991)) + 2 = 96538771 is the record number for the first index entry.\n\n       |   Tidewrack Boundary Positions  |      Positions     |       Primary Probes         Index Use    |     Secondary Probes   | Memory of Time Passed\nSurge  |      First       Last      Count|    Checked Deja vu%|       Made Max.L  Avg.L|   Used%     Load%|       Made Max.L  Avg.L|      CPU        Clock\n 1  Red|          1          1          1|          2     0.00|          0     0  0.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.5secs  2.94%  1:07:03.093am.\n 1 Blue|          1          1          1|          3     0.00|          0     0  0.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.5secs  3.22%  1:07:03.578am.\n 2  Red|          2          3          2|          4     0.00|          0     0  0.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.0secs  0.00%  1:07:03.593am.\n 2 Blue|          2          4          3|          6     0.00|          0     0  0.000|   0.000     0.000|          0     0  0.000|    0.1secs    0.5secs 11.75%  1:07:04.125am.\n 3  Red|          4          7          4|         10     0.00|          0     0  0.000|   0.000     0.000|          0     0  0.000|    0.1secs    0.7secs 11.63%  1:07:04.812am.\n 3 Blue|          5         10          6|         14     0.00|          0     0  0.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.0secs         1:07:04.812am.\n 4  Red|          8         17         10|         24     0.00|          0     0  0.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.0secs  0.00%  1:07:04.875am.\n 4 Blue|         11         24         14|         32     0.00|          0     0  0.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.1secs  0.00%  1:07:04.953am.\n 5  Red|         18         41         24|         54     0.00|          0     0  0.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.0secs  0.00%  1:07:05.015am.\n 5 Blue|         25         56         32|         66     0.00|          0     0  0.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.0secs 50.40%  1:07:05.046am.\n 6  Red|         42         95         54|        108     0.93|          1     1  1.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.0secs 33.24%  1:07:05.093am.\n 6 Blue|         57        122         66|        136     1.47|          2     1  1.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.1secs  0.00%  1:07:05.171am.\n 7  Red|         96        202        107|        215     1.40|          3     1  1.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.1secs  0.00%  1:07:05.265am.\n 7 Blue|        123        256        134|        285     1.75|          5     1  1.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.1secs  0.00%  1:07:05.375am.\n 8  Red|        203        414        212|        456     2.19|         10     1  1.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.2secs  8.36%  1:07:05.578am.\n 8 Blue|        257        536        280|        601     2.66|         16     1  1.000|   0.001     0.001|          0     0  0.000|    0.0secs    0.2secs 20.03%  1:07:05.812am.\n 9  Red|        415        860        446|        974     2.87|         28     1  1.000|   0.001     0.001|          0     0  0.000|    0.2secs    0.5secs 37.50%  1:07:06.312am.\n 9 Blue|        537       1121        585|       1254     3.19|         41     1  1.000|   0.001     0.001|          0     0  0.000|    0.2secs    0.5secs 34.38%  1:07:06.812am.\n10  Red|        861       1806        946|       2032     4.13|         88     1  1.000|   0.002     0.002|          0     0  0.000|    0.3secs    0.9secs 37.28%  1:07:07.734am.\n10 Blue|       1122       2335       1214|       2578     4.50|        117     1  1.000|   0.002     0.002|          0     0  0.000|    0.3secs    1.1secs 25.00%  1:07:08.859am.\n11  Red|       1807       3754       1948|       4124     4.51|        189     1  1.000|   0.004     0.004|          0     0  0.000|    0.5secs    1.8secs 29.66%  1:07:10.703am.\n11 Blue|       2336       4797       2462|       5188     4.66|        249     1  1.000|   0.005     0.005|          0     0  0.000|    0.6secs    2.2secs 27.54%  1:07:12.859am.\n12  Red|       3755       7692       3938|       8244     5.29|        440     1  1.000|   0.008     0.008|          0     0  0.000|    1.0secs    3.6secs 28.51%  1:07:16.421am.\n12 Blue|       4798       9743       4946|      10442     5.56|        588     1  1.000|   0.010     0.010|          1     1  1.000|    1.6secs    4.2secs 38.20%  1:07:20.593am.\n13  Red|       7693      15500       7808|      16470     5.62|        943     1  1.000|   0.016     0.016|          0     0  0.000|    2.2secs    6.5secs 33.65%  1:07:27.093am.\n13 Blue|       9744      19604       9861|      20858     6.03|       1285     2  1.001|   0.020     0.020|          4     1  1.000|    2.8secs    7.5secs 37.00%  1:07:34.625am.\n14  Red|      15501      31044      15544|      32950     6.46|       2175     2  1.000|   0.031     0.031|          5     1  1.000|    3.8secs   11.2secs 34.12%  1:07:45.843am.\n14 Blue|      19605      39204      19600|      41448     6.66|       2813     2  1.001|   0.039     0.039|         14     1  1.000|    4.6secs   12.7secs 36.19%  1:07:58.578am.\n15  Red|      31045      61865      30821|      65311     6.84|       4611     2  1.001|   0.061     0.061|         23     1  1.000|    6.8secs   17.2secs 39.62%  1:08:15.734am.\n15 Blue|      39205      77892      38688|      81703     6.87|       5803     2  1.000|   0.077     0.077|         47     1  1.000|    7.2secs   18.2secs 39.64%  1:08:33.906am.\n16  Red|      61866     122707      60842|     128412     7.33|       9742     2  1.002|   0.121     0.121|         77     2  1.013|   11.9secs   23.2secs 51.21%  1:08:57.093am.\n16 Blue|      77893     153978      76086|     160446     7.49|      12421     2  1.001|   0.151     0.151|        172     1  1.000|   13.6secs   23.2secs 58.57%  1:09:20.250am.\n17  Red|     122708     241707     119000|     250818     7.56|      20063     3  1.002|   0.236     0.237|        303     1  1.000|   20.5secs   30.5secs 67.33%  1:09:50.765am.\n17 Blue|     153979     302413     148435|     312766     7.89|      26220     2  1.002|   0.294     0.295|        678     2  1.001|   24.3secs   32.3secs 75.17%  1:10:23.109am.\n18  Red|     241708     473551     231844|     487982     8.33|      43582     3  1.003|   0.458     0.460|       1229     2  1.002|   38.0secs   46.2secs 82.36%  1:11:09.265am.\n18 Blue|     302414     590511     288098|     606919     8.56|      56018     3  1.003|   0.570     0.573|       2440     2  1.004|   47.5secs   59.4secs 80.02%  1:12:08.687am.\n19  Red|     473552     920893     447342|     942552     8.79|      93152     3  1.005|   0.883     0.890|       4672     2  1.005|   73.1secs   91.3secs 80.07%  1:13:40.046am.\n19 Blue|     590512    1145481     554970|    1168265     9.04|     120435     3  1.006|   1.093     1.104|       8999     3  1.009|   90.6secs    1.9mins 81.12%  1:15:31.765am.\n20  Red|     920894    1780637     859744|    1809752     9.52|     202081     3  1.007|   1.687     1.709|      17194     2  1.008|    2.4mins    3.0mins 79.31%  1:18:30.265am.\n20 Blue|    1145482    2208109    1062628|    2235235     9.77|     262047     3  1.008|   2.080     2.112|      33025     3  1.014|    3.0mins    3.7mins 79.82%  1:22:14.375am.\n21  Red|    1780638    3418020    1637383|    3444691    10.06|     451483     4  1.014|   3.183     3.258|      62538     3  1.015|    4.5mins    5.7mins 79.80%  1:27:56.468am.\n21 Blue|    2208110    4224923    2016814|    4238343    10.33|     588823     4  1.017|   3.905     4.013|     118609     5  1.024|    5.7mins    7.1mins 80.08%  1:35:03.140am.\n22  Red|    3418021    6516290    3098270|    6506982    10.83|    1022051     4  1.023|   5.926     6.159|     219923     4  1.025|    8.7mins   10.7mins 81.12%  1:45:44.328am.\n22 Blue|    4224924    8025605    3800682|    7979315    11.11|    1353159     5  1.029|   7.218     7.559|     414055     4  1.039|   10.9mins   13.8mins 79.04%  1:59:31.875am.\n23  Red|    6516291   12318701    5802411|   12178635    11.45|    2470087     6  1.048|  10.780    11.551|     765853     5  1.046|   17.3mins   24.1mins 71.78%  2:23:35.828am.\n23 Blue|    8025606   15118814    7093209|   14877107    11.76|    3307729     5  1.058|  13.003    14.123|    1401940     6  1.071|   22.4mins   35.3mins 63.46%  2:58:53.375am.\n24  Red|   12318702   23102481   10783780|   22603192    12.29|    6014769     6  1.083|  19.074    21.464|    2526552     6  1.084|   36.7mins   65.6mins 55.95%  4:04:29.375am.\n24 Blue|   15118815   28246178   13127364|   27507742    12.56|    8148893     7  1.105|  22.682    26.150|    4539588     7  1.124|   49.4mins   96.5mins 51.22%  5:40:59.265am.\n25  Red|   23102482   42928799   19826318|   41532426    12.98|   15508438     9  1.166|  32.086    39.535|    8144188     7  1.151|   84.5mins    3.0hrs! 47.06%  8:40:25.296am.\n25 Blue|   28246179   52299632   24053454|   50352435    13.30|   21007872     9  1.207|  37.354    47.979|   13961187     8  1.232|    2.0hrs!    4.4hrs! 44.40%  1:07:12.546pm.\n26  Red|   42928800   79070945   36142146|   75611538    13.85|   38688179    10  1.300|  50.548    72.103|   24060624     9  1.278|    3.5hrs!    8.3hrs! 42.77%  9:23:03.250pm.\n26 Blue|   52299633   95957208   43657576|   91305518    14.15|   51817830    14  1.379|  57.098    87.170|   39429635    10  1.424|    5.3hrs!   12.5hrs! 42.37%  9:53:57.890am.\n\n     Record Stash Move |Board layout by row|  Max|d|  Sum|d|   Euclidean   Encoded vs Zero\n          1  Blue      |FE16/9B4C/0A73/D852|      14      86      27.055    19442940853367\n          2  Blue    L |FE16/9B4C/A073/D852|      14      88      27.423    19442940844007\n          5  Blue    L |FE16/9B4C/A703/D852|      14      88      27.677    19442940842087\n         11  Blue    L |FE16/9B4C/A730/D852|      14      88      27.785    19442940841679\n         25  Blue    D |FE16/9B40/A73C/D852|      14      80      26.000    19442940922295\n         58  Blue    R |FE16/9B04/A73C/D852|      14      80      25.846    19442943220535\n        126  Blue    U |FE16/9B34/A70C/D852|      14      80      26.306    19442940271895\n        265  Blue    R |FE16/9B34/A07C/D852|      14      80      26.038    19442940274415\n        554  Blue    D |FE16/9034/AB7C/D852|      14      72      24.290    19442951159375\n       1156  Blue    D |F016/9E34/AB7C/D852|      14      64      21.863    19530129450575\n       2409  Blue    R |0F16/9E34/AB7C/D852|      13      62      21.166    20837803818575\n       4949  Blue    U |9F16/0E34/AB7C/D852|      13      70      22.804    11597104535375\n      10052  Blue    L |9F16/E034/AB7C/D852|      13      72      23.409    11597064618575\n      20229  Blue    D |9016/EF34/AB7C/D852|      10      64      20.688    11684242909775\n      40459  Blue    L |9106/EF34/AB7C/D852|      10      64      20.736    10544698103375\n      80368  Blue    U |9136/EF04/AB7C/D852|      10      64      21.307    10469454209615\n     158888  Blue    U |9136/EF74/AB0C/D852|      11      64      22.583    10469452026935\n     312029  Blue    U |9136/EF74/AB5C/D802|      15      64      23.452    10469452026423\n     609335  Blue    R |9136/EF74/AB5C/D082|      14      64      23.108    10469452026425\n    1182001  Blue    D |9136/EF74/A05C/DB82|      10      62      21.119    10469452028615\n    2278389  Blue    D |9136/E074/AF5C/DB82|       9      54      18.055    10469455657415\n    4359103  Blue    R |9136/0E74/AF5C/DB82|       8      52      17.263    10469531862215\n    8279825  Blue    D |0136/9E74/AF5C/DB82|       8      44      15.033    19623012937415\n   15596324  Blue    L |1036/9E74/AF5C/DB82|       8      44      15.100     1228393494215\n   29135380  Blue    L |1306/9E74/AF5C/DB82|       8      46      15.297      169799958215\n   53940860  Blue    L |1360/9E74/AF5C/DB82|       8      48      15.684      111840764615\n   98956855  Blue    U |1364/9E70/AF5C/DB82|       8      48      16.673      106528120775\n   47181586   Red    R |1364/9E07/AF5C/DB82|       8      48      16.248      106530419015\n   25400927   Red    U |1364/9E57/AF0C/DB82|      11      48      17.436      106527470375\n   13548279   Red    U |1364/9E57/AF8C/DB02|      15      48      19.183      106527469863\n    7168799   Red    L |1364/9E57/AF8C/DB20|      13      44      17.550      106527469862\n    3761169   Red    D |1364/9E57/AF80/DB2C|      13      68      24.413      106527469916\n    1959965   Red    R |1364/9E57/AF08/DB2C|      13      68      24.083      106527470324\n    1013648   Red    U |1364/9E57/AF28/DB0C|      15      68      24.413      106527469693\n     521247   Red    R |1364/9E57/AF28/D0BC|      14      68      23.958      106527469696\n     266034   Red    D |1364/9E57/A028/DFBC|      12      60      21.307      106527470416\n     135063   Red    D |1364/9057/AE28/DFBC|      12      52      18.493      106534727296\n      68120   Red    L |1364/9507/AE28/DFBC|      12      52      18.762      106504971136\n      34188   Red    U |1364/9527/AE08/DFBC|      12      52      19.183      106501659736\n      17049   Red    U |1364/9527/AEB8/DF0C|      15      52      21.354      106501659249\n       8443   Red    R |1364/9527/AEB8/D0FC|      14      50      20.640      106501659251\n       4119   Red    D |1364/9527/A0B8/DEFC|      12      42      17.720      106501660689\n       1986   Red    R |1364/9527/0AB8/DEFC|      12      40      17.146      106501687329\n        950   Red    D |1364/0527/9AB8/DEFC|      12      32      14.900      106781074689\n        458   Red    L |1364/5027/9AB8/DEFC|      12      32      15.232      106414565889\n        222   Red    L |1364/5207/9AB8/DEFC|      12      32      15.362      106381543809\n        104   Red    D |1304/5267/9AB8/DEFC|      12      26      13.711      168648485889\n         46   Red    R |1034/5267/9AB8/DEFC|      12      24      13.491     1227242021889\n         20   Red    U |1234/5067/9AB8/DEFC|      12      24      14.071          36293889\n          9   Red    L |1234/5607/9AB8/DEFC|      12      24      14.491           3271809\n          4   Red    L |1234/5670/9AB8/DEFC|      12      24      14.967            328449\n          2   Red    U |1234/5678/9AB0/DEFC|      12      24      16.971               105\n          1   Red    U |1234/5678/9ABC/DEF0|       0       0       0.000                 0\n  52 moves: LLLDRURDDRULDLUUURDDRDLLLURUULDRURDDLUURDRDLLDRULLUU\n\n     Record Stash Move |Board layout by row|  Max|d|  Sum|d|   Euclidean   Encoded vs Zero\n          1  Blue      |FE16/9B4C/0A73/D852|      14      86      27.055    19442940853367\n          2  Blue    L |FE16/9B4C/A073/D852|      14      88      27.423    19442940844007\n          5  Blue    L |FE16/9B4C/A703/D852|      14      88      27.677    19442940842087\n         11  Blue    L |FE16/9B4C/A730/D852|      14      88      27.785    19442940841679\n         25  Blue    D |FE16/9B40/A73C/D852|      14      80      26.000    19442940922295\n         58  Blue    R |FE16/9B04/A73C/D852|      14      80      25.846    19442943220535\n        126  Blue    U |FE16/9B34/A70C/D852|      14      80      26.306    19442940271895\n        266  Blue    U |FE16/9B34/A75C/D802|      15      80      27.055    19442940271383\n        558  Blue    R |FE16/9B34/A75C/D082|      14      80      26.758    19442940271385\n       1163  Blue    D |FE16/9B34/A05C/D782|      14      80      25.690    19442940274293\n       2420  Blue    D |FE16/9034/AB5C/D782|      14      72      23.917    19442951159253\n       4967  Blue    D |F016/9E34/AB5C/D782|      14      64      21.448    19530129450453\n      10090  Blue    R |0F16/9E34/AB5C/D782|      13      62      20.736    20837803818453\n      20306  Blue    U |9F16/0E34/AB5C/D782|      13      70      22.405    11597104535253\n      40605  Blue    L |9F16/E034/AB5C/D782|      13      72      23.022    11597064618453\n      80644  Blue    D |9016/EF34/AB5C/D782|       9      64      20.248    11684242909653\n     159412  Blue    L |9106/EF34/AB5C/D782|       9      64      20.298    10544698103253\n     313039  Blue    U |9136/EF04/AB5C/D782|       9      64      20.881    10469454209493\n     611272  Blue    U |9136/EF54/AB0C/D782|      11      64      21.817    10469451664053\n    1185720  Blue    U |9136/EF54/AB8C/D702|      15      64      23.238    10469451663663\n    2285440  Blue    L |9136/EF54/AB8C/D720|      13      60      21.909    10469451663662\n    4372401  Blue    D |9136/EF54/AB80/D72C|      13      84      27.713    10469451663716\n    8304687  Blue    R |9136/EF54/AB08/D72C|      13      84      27.423    10469451664028\n   15642421  Blue    R |9136/EF54/A0B8/D72C|      13      82      27.019    10469451665948\n   29220003  Blue    D |9136/E054/AFB8/D72C|      13      74      24.698    10469455294748\n   54094941  Blue    R |9136/0E54/AFB8/D72C|      13      72      24.125    10469531499548\n   99233939  Blue    D |0136/9E54/AFB8/D72C|      13      64      22.583    19623012574748\n   53847416   Red    L |1036/9E54/AFB8/D72C|      13      64      22.627     1228393131548\n   29052034   Red    L |1306/9E54/AFB8/D72C|      13      66      22.760      169799595548\n   15525093   Red    L |1360/9E54/AFB8/D72C|      13      68      23.022      111840401948\n    8231956   Red    U |1364/9E50/AFB8/D72C|      13      68      23.707      106527758108\n    4326107   Red    U |1364/9E58/AFB0/D72C|      13      68      25.020      106527510356\n    2258614   Red    R |1364/9E58/AF0B/D72C|      13      68      24.576      106527510668\n    1169712   Red    U |1364/9E58/AF2B/D70C|      15      68      24.900      106527510037\n     602597   Red    R |1364/9E58/AF2B/D07C|      14      68      24.617      106527510040\n     308014   Red    D |1364/9E58/A02B/DF7C|      12      60      22.045      106527510760\n     156652   Red    D |1364/9058/AE2B/DF7C|      12      52      19.339      106534767640\n      79080   Red    L |1364/9508/AE2B/DF7C|      12      52      19.596      106505011480\n      39747   Red    U |1364/9528/AE0B/DF7C|      12      52      20.000      106501700080\n      19843   Red    U |1364/9528/AE7B/DF0C|      15      52      21.354      106501699449\n       9866   Red    R |1364/9528/AE7B/D0FC|      14      50      20.640      106501699451\n       4832   Red    D |1364/9528/A07B/DEFC|      12      42      17.720      106501700889\n       2335   Red    R |1364/9528/0A7B/DEFC|      12      40      17.146      106501727529\n       1114   Red    D |1364/0528/9A7B/DEFC|      12      32      14.900      106781114889\n        534   Red    L |1364/5028/9A7B/DEFC|      12      32      15.232      106414606089\n        259   Red    L |1364/5208/9A7B/DEFC|      12      32      15.362      106381584009\n        124   Red    D |1304/5268/9A7B/DEFC|      12      26      13.711      168648526089\n         56   Red    R |1034/5268/9A7B/DEFC|      12      24      13.491     1227242062089\n         24   Red    U |1234/5068/9A7B/DEFC|      12      24      14.071          36334089\n         10   Red    L |1234/5608/9A7B/DEFC|      12      24      14.491           3312009\n          5   Red    U |1234/5678/9A0B/DEFC|      12      24      16.310               609\n          2   Red    L |1234/5678/9AB0/DEFC|      12      24      16.971               105\n          1   Red    U |1234/5678/9ABC/DEF0|       0       0       0.000                 0\n  52 moves: LLLDRUURDDDRULDLUUULDRRDRDLLLUURURDDLUURDRDLLDRULULU\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_35.txt",
        "content": "To play 'slide-square' with 4 rows and 4 columns.\nAn initial layout will be read from file SlideSolveR4C4.txt\nThe objective is to attain the nice orderly layout as follows:\n\nRow|__1__2__3__4\n  1|  1  2  3  4\n  2|  5  6  7  8\n  3|  9 10 11 12\n  4| 13 14 15  0\n\nThe starting position:\nRow|__1__2__3__4\n  1| 13 10 11  6\n  2|  5  3  1  4\n  3|  8  0 12  2\n  4| 14  7  9 15\n\nThe plan is to spread a red tide from the \"solved\" layout and a blue tide from the specified starting position.\nThe hope is that these floods will meet at some position, and the blue moves plus the red moves in reverse order,\nwill be the shortest sequence from the given starting position to the solution.\n\nTide  Red\n Restarting from file SlideSolveR4C4.123456789ABCDEF0.dat\n Stashed 144206568. At surge 26 with the boundary stashed in elements 79070946 to 144206568\n Its index uses 101095844 of 199999991 entries.\n\nTide Blue\n Preparing a stash in file SlideSolveR4C4.DAB6531480C2E79F.dat\n ... with an index in file SlideSolveR4C4.DAB6531480C2E79F.ndx\n   199999991  zero values for an empty index.\n D A B 6 5 3 1 4 8 0 C 2 E 7 9 F is the board layout in INTEGER*1\n 60B0A0D 4010305 20C0008 F09070E is the board layout in INTEGER*4\n        64B1A3D5        2FC9078E ..interleaved into two INTEGER*4\n                        7340B326 multiplied together in INTEGER*4\n                      1933620006 as a decimal integer.\nABS(MOD(1933620006,199999991)) + 2 = 133620089 is the record number for the first index entry.\n\n       |   Tidewrack Boundary Positions  |      Positions     |       Primary Probes         Index Use    |     Secondary Probes   | Memory of Time Passed\nSurge  |      First       Last      Count|    Checked Deja vu%|       Made Max.L  Avg.L|   Used%     Load%|       Made Max.L  Avg.L|      CPU        Clock\n 1 Blue|          1          1          1|          4     0.00|          0     0  0.000|   0.000     0.000|          2     1  1.000|    0.0secs    0.0secs  0.00%  9:27:19.468am.\n 2 Blue|          2          5          4|         10     0.00|          0     0  0.000|   0.000     0.000|          4     2  1.500|    0.0secs    0.5secs  3.33%  9:27:19.937am.\n 3 Blue|          6         15         10|         20     0.00|          0     0  0.000|   0.000     0.000|          5     2  1.400|    0.0secs    0.4secs  0.00%  9:27:20.296am.\n 4 Blue|         16         35         20|         38     0.00|          0     0  0.000|   0.000     0.000|         16     3  1.250|    0.0secs    0.3secs 11.75%  9:27:20.562am.\n 5 Blue|         36         73         38|         80     0.00|          0     0  0.000|   0.000     0.000|         39     4  1.385|    0.0secs    0.1secs  0.00%  9:27:20.625am.\n 6 Blue|         74        153         80|        178     2.25|          4     1  1.000|   0.000     0.000|         87     4  1.379|    0.0secs    0.1secs  0.00%  9:27:20.750am.\n 7 Blue|        154        327        174|        380     2.11|          8     1  1.000|   0.000     0.000|        186     5  1.500|    0.2secs    0.3secs 52.79%  9:27:21.046am.\n 8 Blue|        328        699        372|        790     3.54|         28     1  1.000|   0.001     0.001|        386     5  1.448|    0.2secs    0.4secs 53.51%  9:27:21.484am.\n 9 Blue|        700       1461        762|       1590     3.14|         50     1  1.000|   0.002     0.002|        738     6  1.407|    0.3secs    0.9secs 37.50%  9:27:22.375am.\n10 Blue|       1462       3001       1540|       3234     5.01|        168     1  1.000|   0.003     0.003|       1542     6  1.396|    0.6secs    2.0secs 29.60%  9:27:24.328am.\n11 Blue|       3002       6073       3072|       6512     4.85|        318     1  1.000|   0.006     0.006|       3032     5  1.398|    1.2secs    3.9secs 30.77%  9:27:28.187am.\n12 Blue|       6074      12269       6196|      13182     6.27|        841     2  1.001|   0.012     0.012|       6007     6  1.406|    2.5secs    7.5secs 33.96%  9:27:35.687am.\n13 Blue|      12270      24625      12356|      26134     6.19|       1648     2  1.001|   0.025     0.025|      12261     6  1.410|    5.0secs   15.6secs 32.23%  9:27:51.296am.\n14 Blue|      24626      49141      24516|      51646     6.71|       3581     2  1.000|   0.049     0.049|      23554     6  1.395|    9.2secs   24.8secs 37.14%  9:28:16.078am.\n15 Blue|      49142      97320      48179|     101393     6.94|       7301     2  1.000|   0.096     0.096|      46888     7  1.411|   15.8secs   41.9secs 37.71%  9:28:58.031am.\n16 Blue|      97321     191676      94356|     198950     7.80|      16489     2  1.002|   0.187     0.188|      89521     7  1.399|   27.3secs   62.8secs 43.45%  9:30:00.781am.\n17 Blue|     191677     375108     183432|     386686     8.11|      33604     2  1.003|   0.363     0.365|     177033     8  1.418|   52.7secs    1.9mins 45.48%  9:31:56.734am.\n18 Blue|     375109     730438     355330|     748406     8.84|      74407     3  1.005|   0.700     0.706|     333730     7  1.405|   96.8secs    3.7mins 43.38%  9:35:39.812am.\n19 Blue|     730439    1412688     682250|    1434890     9.27|     154921     4  1.007|   1.340     1.357|     649155     8  1.416|    3.2mins    7.1mins 44.60%  9:42:44.031am.\n\n     Record Stash Move |Board layout by row|  Max|d|  Sum|d|   Euclidean   Encoded vs Zero\n          1  Blue      |DAB6/5314/80C2/E79F|      15      94      29.155    16535302211892\n          4  Blue    R |DAB6/5314/08C2/E79F|      15      94      28.879    16535302234212\n         12  Blue    D |DAB6/0314/58C2/E79F|      15      94      28.178    16535581621572\n         30  Blue    L |DAB6/3014/58C2/E79F|      15      94      28.284    16535251400772\n         62  Blue    L |DAB6/3104/58C2/E79F|      15      94      28.320    16535218378692\n        125  Blue    D |DA06/31B4/58C2/E79F|      15      86      26.721    16560125373252\n        266  Blue    R |D0A6/31B4/58C2/E79F|      15      84      26.344    16971108746052\n        568  Blue    R |0DA6/31B4/58C2/E79F|      15      82      25.846    20719775267652\n       1203  Blue    U |3DA6/01B4/58C2/E79F|      15      86      26.306     3626483421252\n       2480  Blue    L |3DA6/10B4/58C2/E79F|      15      86      26.344     3626080624452\n       5044  Blue    D |30A6/1DB4/58C2/E79F|      15      78      24.290     3887608240452\n      10136  Blue    L |3A06/1DB4/58C2/E79F|      15      80      24.698     3395673597252\n      20466  Blue    L |3A60/1DB4/58C2/E79F|      15      82      24.940     3343462422852\n      40817  Blue    U |3A64/1DB0/58C2/E79F|      15      82      25.573     3338668697412\n      81229  Blue    U |3A64/1DB2/58C0/E79F|      15      82      25.884     3338668369068\n     160022  Blue    R |3A64/1DB2/580C/E79F|      15      80      25.417     3338668369380\n     314204  Blue    R |3A64/1DB2/508C/E79F|      15      80      25.100     3338668372500\n     612120  Blue    D |3A64/10B2/5D8C/E79F|      15      72      22.935     3338679257460\n    1187839  Blue    D |3064/1AB2/5D8C/E79F|      15      64      21.119     3861730860660\n    2285373  Blue    R |0364/1AB2/5D8C/E79F|      15      62      20.976    19815358150260\n   53888966   Red    U |1364/0AB2/5D8C/E79F|      15      62      21.166      106797401460\n   29074972   Red    U |1364/5AB2/0D8C/E79F|      15      62      22.091      106394277060\n   15537643   Red    L |1364/5AB2/D08C/E79F|      15      64      22.672      106394263380\n    8238754   Red    U |1364/5AB2/D78C/E09F|      15      64      23.875      106394258914\n    4329748   Red    L |1364/5AB2/D78C/E90F|      15      64      24.249      106394258911\n    2260520   Red    L |1364/5AB2/D78C/E9F0|       6      34      11.747      106394258910\n    1170710   Red    D |1364/5AB2/D780/E9FC|      12      58      20.640      106394258989\n     603117   Red    R |1364/5AB2/D708/E9FC|      12      58      20.248      106394259493\n     308288   Red    D |1364/5A02/D7B8/E9FC|      12      50      17.944      106396078573\n     156795   Red    L |1364/5A20/D7B8/E9FC|      12      50      18.055      106393135213\n      79148   Red    U |1364/5A28/D7B0/E9FC|      12      50      19.748      106392847909\n      39781   Red    R |1364/5A28/D70B/E9FC|      12      50      19.183      106392848317\n      19862   Red    R |1364/5A28/D07B/E9FC|      12      50      18.815      106392852037\n       9877   Red    U |1364/5A28/D97B/E0FC|      14      50      20.640      106392848411\n       4838   Red    R |1364/5A28/D97B/0EFC|      13      48      19.950      106392848421\n       2337   Red    D |1364/5A28/097B/DEFC|      12      40      17.146      106392863529\n       1115   Red    L |1364/5A28/907B/DEFC|      12      40      17.664      106392836889\n        534   Red    D |1364/5028/9A7B/DEFC|      12      32      15.232      106414606089\n        259   Red    L |1364/5208/9A7B/DEFC|      12      32      15.362      106381584009\n        124   Red    D |1304/5268/9A7B/DEFC|      12      26      13.711      168648526089\n         56   Red    R |1034/5268/9A7B/DEFC|      12      24      13.491     1227242062089\n         24   Red    U |1234/5068/9A7B/DEFC|      12      24      14.071          36334089\n         10   Red    L |1234/5608/9A7B/DEFC|      12      24      14.491           3312009\n          5   Red    U |1234/5678/9A0B/DEFC|      12      24      16.310               609\n          2   Red    L |1234/5678/9AB0/DEFC|      12      24      16.971               105\n          1   Red    U |1234/5678/9ABC/DEF0|       0       0       0.000                 0\n  45 moves: RDLLDRRULDLLUURRDDRUULULLDRDLURRURDLDLDRULULU\n\n     Record Stash Move |Board layout by row|  Max|d|  Sum|d|   Euclidean   Encoded vs Zero\n          1  Blue      |DAB6/5314/80C2/E79F|      15      94      29.155    16535302211892\n          4  Blue    R |DAB6/5314/08C2/E79F|      15      94      28.879    16535302234212\n         12  Blue    D |DAB6/0314/58C2/E79F|      15      94      28.178    16535581621572\n         30  Blue    L |DAB6/3014/58C2/E79F|      15      94      28.284    16535251400772\n         62  Blue    L |DAB6/3104/58C2/E79F|      15      94      28.320    16535218378692\n        125  Blue    D |DA06/31B4/58C2/E79F|      15      86      26.721    16560125373252\n        266  Blue    R |D0A6/31B4/58C2/E79F|      15      84      26.344    16971108746052\n        568  Blue    R |0DA6/31B4/58C2/E79F|      15      82      25.846    20719775267652\n       1203  Blue    U |3DA6/01B4/58C2/E79F|      15      86      26.306     3626483421252\n       2480  Blue    L |3DA6/10B4/58C2/E79F|      15      86      26.344     3626080624452\n       5044  Blue    D |30A6/1DB4/58C2/E79F|      15      78      24.290     3887608240452\n      10136  Blue    L |3A06/1DB4/58C2/E79F|      15      80      24.698     3395673597252\n      20466  Blue    L |3A60/1DB4/58C2/E79F|      15      82      24.940     3343462422852\n      40817  Blue    U |3A64/1DB0/58C2/E79F|      15      82      25.573     3338668697412\n      81229  Blue    U |3A64/1DB2/58C0/E79F|      15      82      25.884     3338668369068\n     160022  Blue    R |3A64/1DB2/580C/E79F|      15      80      25.417     3338668369380\n     314204  Blue    R |3A64/1DB2/508C/E79F|      15      80      25.100     3338668372500\n     612122  Blue    U |3A64/1DB2/578C/E09F|      15      80      26.192     3338668368034\n    1187843  Blue    L |3A64/1DB2/578C/E90F|      15      80      26.533     3338668368031\n    2285379  Blue    L |3A64/1DB2/578C/E9F0|       8      50      15.937     3338668368030\n   53890406   Red    D |3A64/1DB2/5780/E9FC|      12      74      23.281     3338668368109\n   29075781   Red    R |3A64/1DB2/5708/E9FC|      12      74      22.935     3338668368613\n   15538085   Red    D |3A64/1D02/57B8/E9FC|      12      66      20.928     3338669819773\n    8239002   Red    L |3A64/1D20/57B8/E9FC|      12      66      21.024     3338666876413\n    4329887   Red    U |3A64/1D28/57B0/E9FC|      12      66      22.494     3338666634469\n    2260599   Red    R |3A64/1D28/570B/E9FC|      12      66      22.000     3338666634877\n    1170753   Red    R |3A64/1D28/507B/E9FC|      12      66      21.679     3338666638597\n     603141   Red    D |3A64/1028/5D7B/E9FC|      12      58      19.131     3338677523557\n     308302   Red    D |3064/1A28/5D7B/E9FC|      12      50      16.912     3861729126757\n     156805   Red    R |0364/1A28/5D7B/E9FC|      12      48      16.733    19815356416357\n      79152   Red    U |1364/0A28/5D7B/E9FC|      12      48      16.971      106795667557\n      39783   Red    U |1364/5A28/0D7B/E9FC|      12      48      18.111      106392865717\n      19862   Red    L |1364/5A28/D07B/E9FC|      12      50      18.815      106392852037\n       9877   Red    U |1364/5A28/D97B/E0FC|      14      50      20.640      106392848411\n       4838   Red    R |1364/5A28/D97B/0EFC|      13      48      19.950      106392848421\n       2337   Red    D |1364/5A28/097B/DEFC|      12      40      17.146      106392863529\n       1115   Red    L |1364/5A28/907B/DEFC|      12      40      17.664      106392836889\n        534   Red    D |1364/5028/9A7B/DEFC|      12      32      15.232      106414606089\n        259   Red    L |1364/5208/9A7B/DEFC|      12      32      15.362      106381584009\n        124   Red    D |1304/5268/9A7B/DEFC|      12      26      13.711      168648526089\n         56   Red    R |1034/5268/9A7B/DEFC|      12      24      13.491     1227242062089\n         24   Red    U |1234/5068/9A7B/DEFC|      12      24      14.071          36334089\n         10   Red    L |1234/5608/9A7B/DEFC|      12      24      14.491           3312009\n          5   Red    U |1234/5678/9A0B/DEFC|      12      24      16.310               609\n          2   Red    L |1234/5678/9AB0/DEFC|      12      24      16.971               105\n          1   Red    U |1234/5678/9ABC/DEF0|       0       0       0.000                 0\n  45 moves: RDLLDRRULDLLUURRULLDRDLURRDDRUULURDLDLDRULULU\n\n     Record Stash Move |Board layout by row|  Max|d|  Sum|d|   Euclidean   Encoded vs Zero\n          1  Blue      |DAB6/5314/80C2/E79F|      15      94      29.155    16535302211892\n          4  Blue    R |DAB6/5314/08C2/E79F|      15      94      28.879    16535302234212\n         12  Blue    D |DAB6/0314/58C2/E79F|      15      94      28.178    16535581621572\n         31  Blue    D |0AB6/D314/58C2/E79F|      15      86      26.268    20458524891972\n         65  Blue    L |A0B6/D314/58C2/E79F|      15      88      26.646    13048370139972\n        133  Blue    U |A3B6/D014/58C2/E79F|      15      90      27.092    11995513736772\n        281  Blue    L |A3B6/D104/58C2/E79F|      15      90      27.129    11995480714692\n        599  Blue    D |A306/D1B4/58C2/E79F|      15      82      25.456    12026654646852\n       1266  Blue    R |A036/D1B4/58C2/E79F|      15      80      25.338    13004296912452\n       2610  Blue    U |A136/D0B4/58C2/E79F|      15      80      25.495    11777091184452\n       5305  Blue    R |A136/0DB4/58C2/E79F|      15      78      24.980    11777203677252\n      10671  Blue    D |0136/ADB4/58C2/E79F|      15      70      23.324    19623050301252\n      21525  Blue    L |1036/ADB4/58C2/E79F|      15      70      23.367     1228430858052\n      42928  Blue    L |1306/ADB4/58C2/E79F|      15      72      23.495      169837322052\n      85377  Blue    L |1360/ADB4/58C2/E79F|      15      74      23.749      111878128452\n     168152  Blue    U |1364/ADB0/58C2/E79F|      15      74      24.413      106565484612\n     329996  Blue    U |1364/ADB2/58C0/E79F|      15      74      24.739      106565156268\n     642726  Blue    R |1364/ADB2/580C/E79F|      15      72      24.249      106565156580\n    1246294  Blue    R |1364/ADB2/508C/E79F|      15      72      23.917      106565159700\n    2396768  Blue    D |1364/A0B2/5D8C/E79F|      15      64      21.633      106576044660\n   53888966   Red    R |1364/0AB2/5D8C/E79F|      15      62      21.166      106797401460\n   29074972   Red    U |1364/5AB2/0D8C/E79F|      15      62      22.091      106394277060\n   15537643   Red    L |1364/5AB2/D08C/E79F|      15      64      22.672      106394263380\n    8238754   Red    U |1364/5AB2/D78C/E09F|      15      64      23.875      106394258914\n    4329748   Red    L |1364/5AB2/D78C/E90F|      15      64      24.249      106394258911\n    2260520   Red    L |1364/5AB2/D78C/E9F0|       6      34      11.747      106394258910\n    1170710   Red    D |1364/5AB2/D780/E9FC|      12      58      20.640      106394258989\n     603117   Red    R |1364/5AB2/D708/E9FC|      12      58      20.248      106394259493\n     308288   Red    D |1364/5A02/D7B8/E9FC|      12      50      17.944      106396078573\n     156795   Red    L |1364/5A20/D7B8/E9FC|      12      50      18.055      106393135213\n      79148   Red    U |1364/5A28/D7B0/E9FC|      12      50      19.748      106392847909\n      39781   Red    R |1364/5A28/D70B/E9FC|      12      50      19.183      106392848317\n      19862   Red    R |1364/5A28/D07B/E9FC|      12      50      18.815      106392852037\n       9877   Red    U |1364/5A28/D97B/E0FC|      14      50      20.640      106392848411\n       4838   Red    R |1364/5A28/D97B/0EFC|      13      48      19.950      106392848421\n       2337   Red    D |1364/5A28/097B/DEFC|      12      40      17.146      106392863529\n       1115   Red    L |1364/5A28/907B/DEFC|      12      40      17.664      106392836889\n        534   Red    D |1364/5028/9A7B/DEFC|      12      32      15.232      106414606089\n        259   Red    L |1364/5208/9A7B/DEFC|      12      32      15.362      106381584009\n        124   Red    D |1304/5268/9A7B/DEFC|      12      26      13.711      168648526089\n         56   Red    R |1034/5268/9A7B/DEFC|      12      24      13.491     1227242062089\n         24   Red    U |1234/5068/9A7B/DEFC|      12      24      14.071          36334089\n         10   Red    L |1234/5608/9A7B/DEFC|      12      24      14.491           3312009\n          5   Red    U |1234/5678/9A0B/DEFC|      12      24      16.310               609\n          2   Red    L |1234/5678/9AB0/DEFC|      12      24      16.971               105\n          1   Red    U |1234/5678/9ABC/DEF0|       0       0       0.000                 0\n  45 moves: RDDLULDRURDLLLUURRDRULULLDRDLURRURDLDLDRULULU\n\n     Record Stash Move |Board layout by row|  Max|d|  Sum|d|   Euclidean   Encoded vs Zero\n          1  Blue      |DAB6/5314/80C2/E79F|      15      94      29.155    16535302211892\n          4  Blue    R |DAB6/5314/08C2/E79F|      15      94      28.879    16535302234212\n         12  Blue    D |DAB6/0314/58C2/E79F|      15      94      28.178    16535581621572\n         31  Blue    D |0AB6/D314/58C2/E79F|      15      86      26.268    20458524891972\n         65  Blue    L |A0B6/D314/58C2/E79F|      15      88      26.646    13048370139972\n        133  Blue    U |A3B6/D014/58C2/E79F|      15      90      27.092    11995513736772\n        281  Blue    L |A3B6/D104/58C2/E79F|      15      90      27.129    11995480714692\n        599  Blue    D |A306/D1B4/58C2/E79F|      15      82      25.456    12026654646852\n       1266  Blue    R |A036/D1B4/58C2/E79F|      15      80      25.338    13004296912452\n       2610  Blue    U |A136/D0B4/58C2/E79F|      15      80      25.495    11777091184452\n       5305  Blue    R |A136/0DB4/58C2/E79F|      15      78      24.980    11777203677252\n      10671  Blue    D |0136/ADB4/58C2/E79F|      15      70      23.324    19623050301252\n      21525  Blue    L |1036/ADB4/58C2/E79F|      15      70      23.367     1228430858052\n      42928  Blue    L |1306/ADB4/58C2/E79F|      15      72      23.495      169837322052\n      85377  Blue    L |1360/ADB4/58C2/E79F|      15      74      23.749      111878128452\n     168152  Blue    U |1364/ADB0/58C2/E79F|      15      74      24.413      106565484612\n     329996  Blue    U |1364/ADB2/58C0/E79F|      15      74      24.739      106565156268\n     642726  Blue    R |1364/ADB2/580C/E79F|      15      72      24.249      106565156580\n    1246294  Blue    R |1364/ADB2/508C/E79F|      15      72      23.917      106565159700\n    2396770  Blue    U |1364/ADB2/578C/E09F|      15      72      25.060      106565155234\n   53890081   Red    L |1364/ADB2/578C/E90F|      15      72      25.417      106565155231\n   29075603   Red    L |1364/ADB2/578C/E9F0|       7      42      14.000      106565155230\n   15537991   Red    D |1364/ADB2/5780/E9FC|      12      66      22.000      106565155309\n    8238950   Red    R |1364/ADB2/5708/E9FC|      12      66      21.633      106565155813\n    4329857   Red    D |1364/AD02/57B8/E9FC|      12      58      19.494      106566606973\n    2260581   Red    L |1364/AD20/57B8/E9FC|      12      58      19.596      106563663613\n    1170743   Red    U |1364/AD28/57B0/E9FC|      12      58      21.166      106563421669\n     603137   Red    R |1364/AD28/570B/E9FC|      12      58      20.640      106563422077\n     308301   Red    R |1364/AD28/507B/E9FC|      12      58      20.298      106563425797\n     156804   Red    D |1364/A028/5D7B/E9FC|      12      50      17.550      106574310757\n      79152   Red    R |1364/0A28/5D7B/E9FC|      12      48      16.971      106795667557\n      39783   Red    U |1364/5A28/0D7B/E9FC|      12      48      18.111      106392865717\n      19862   Red    L |1364/5A28/D07B/E9FC|      12      50      18.815      106392852037\n       9877   Red    U |1364/5A28/D97B/E0FC|      14      50      20.640      106392848411\n       4838   Red    R |1364/5A28/D97B/0EFC|      13      48      19.950      106392848421\n       2337   Red    D |1364/5A28/097B/DEFC|      12      40      17.146      106392863529\n       1115   Red    L |1364/5A28/907B/DEFC|      12      40      17.664      106392836889\n        534   Red    D |1364/5028/9A7B/DEFC|      12      32      15.232      106414606089\n        259   Red    L |1364/5208/9A7B/DEFC|      12      32      15.362      106381584009\n        124   Red    D |1304/5268/9A7B/DEFC|      12      26      13.711      168648526089\n         56   Red    R |1034/5268/9A7B/DEFC|      12      24      13.491     1227242062089\n         24   Red    U |1234/5068/9A7B/DEFC|      12      24      14.071          36334089\n         10   Red    L |1234/5608/9A7B/DEFC|      12      24      14.491           3312009\n          5   Red    U |1234/5678/9A0B/DEFC|      12      24      16.310               609\n          2   Red    L |1234/5678/9AB0/DEFC|      12      24      16.971               105\n          1   Red    U |1234/5678/9ABC/DEF0|       0       0       0.000                 0\n  45 moves: RDDLULDRURDLLLUURRULLDRDLURRDRULURDLDLDRULULU\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_36.txt",
        "content": "To play 'slide-square' with 3 rows and 4 columns.\n\nTide  Red\n Preparing a stash in file SlideSolveR3C4.123456789AB0.dat\n ... with an index in file SlideSolveR3C4.123456789AB0.ndx\n   199999991  zero values for an empty index.\n 1 2 3 4 5 6 7 8 9 A B 0 is the board layout in INTEGER*1\n 4030201 8070605   B0A09       0 is the board layout in INTEGER*4\n        48372615          B0A090 ..interleaved into two INTEGER*4\n                        8AA0F74D combined.\n                     -1969162419 as a decimal integer.\nABS(MOD(-1969162419,199999991)) + 2 = 169162502 is the record number for the first index entry.\n\n     | Tidewrack Boundary Positions|      Positions   |     Primary Probes        Index Use  |Memory of Time Passed\nSurge|     First      Last    Count|  Checked Deja vu%|     Made Max.L  Avg.L|  Used%   Load%|    CPU      Clock\n    1|         1         1        1|        2     0.00|        0     0  0.000|  0.000   0.000|  0.0secs  0.0secs  0.00%  7:57:19.187am.\n    2|         2         3        2|        4     0.00|        0     0  0.000|  0.000   0.000|  0.0secs  0.1secs 16.62%  7:57:19.281am.\n    3|         4         7        4|        9     0.00|        0     0  0.000|  0.000   0.000|  0.0secs  0.0secs  0.00%  7:57:19.296am.\n    4|         8        16        9|       20     0.00|        0     0  0.000|  0.000   0.000|  0.0secs  0.0secs         7:57:19.312am.\n    5|        17        36       20|       37     0.00|        0     0  0.000|  0.000   0.000|  0.0secs  0.0secs         7:57:19.312am.\n    6|        37        73       37|       64     1.56|        1     1  1.000|  0.000   0.000|  0.0secs  0.2secs  0.00%  7:57:19.468am.\n    7|        74       136       63|      125     2.40|        3     1  1.000|  0.000   0.000|  0.0secs  0.0secs  0.00%  7:57:19.515am.\n    8|       137       258      122|      241     3.73|        9     1  1.000|  0.000   0.000|  0.0secs  0.1secs  0.00%  7:57:19.609am.\n    9|       259       490      232|      451     4.43|       20     1  1.000|  0.000   0.000|  0.0secs  0.1secs  0.00%  7:57:19.671am.\n   10|       491       921      431|      827     5.56|       46     1  1.000|  0.001   0.001|  0.0secs  0.1secs  0.00%  7:57:19.796am.\n   11|       922      1702      781|     1481     6.01|       89     1  1.000|  0.002   0.002|  0.0secs  0.2secs 15.32%  7:57:20.000am.\n   12|      1703      3094     1392|     2671     6.63|      177     1  1.000|  0.003   0.003|  0.0secs  0.4secs  8.33%  7:57:20.375am.\n   13|      3095      5588     2494|     4770     6.88|      328     1  1.000|  0.005   0.005|  0.1secs  1.0secs 11.12%  7:57:21.359am.\n   14|      5589     10030     4442|     8502     7.62|      652     1  1.000|  0.009   0.009|  0.4secs  1.8secs 21.06%  7:57:23.140am.\n   15|     10031     17884     7854|    15135     8.17|     1237     2  1.001|  0.016   0.016|  0.6secs  2.8secs 22.90%  7:57:25.937am.\n   16|     17885     31783    13899|    26554     8.81|     2351     1  1.000|  0.028   0.028|  0.9secs  5.0secs 17.65%  7:57:30.984am.\n   17|     31784     55998    24215|    46180     9.48|     4409     2  1.000|  0.049   0.049|  1.9secs  7.4secs 26.21%  7:57:38.375am.\n   18|     55999     97800    41802|    79668    10.67|     8584     2  1.000|  0.084   0.084|  3.1secs 11.7secs 26.87%  7:57:50.062am.\n   19|     97801    168967    71167|   135867    11.76|    16270     3  1.001|  0.144   0.144|  5.1secs 15.7secs 32.40%  7:58:05.734am.\n   20|    168968    288855   119888|   228379    13.14|    30689     2  1.001|  0.243   0.244|  9.4secs 21.4secs 43.75%  7:58:27.125am.\n   21|    288856    487218   198363|   377240    14.32|    55757     2  1.002|  0.404   0.405| 15.0secs 26.5secs 56.39%  7:58:53.671am.\n   22|    487219    810424   323206|   612123    15.74|   100162     2  1.002|  0.660   0.663| 21.7secs 42.4secs 51.16%  7:59:36.093am.\n   23|    810425   1326202   515778|   977833    17.06|   176608     3  1.003|  1.060   1.069| 32.7secs 59.2secs 55.29%  8:00:35.296am.\n   24|   1326203   2137202   811000|  1533678    18.63|   306896     3  1.005|  1.674   1.693| 56.0secs 91.9secs 60.91%  8:02:07.203am.\n   25|   2137203   3385213  1248011|  2358532    20.07|   522581     4  1.008|  2.592   2.635| 85.7secs  2.1mins 67.00%  8:04:15.062am.\n   26|   3385214   5270492  1885279|  3554164    21.71|   877235     4  1.012|  3.930   4.026|  2.1mins  3.4mins 60.44%  8:07:40.187am.\n   27|   5270493   8052888  2782396|  5239108    23.47|  1452058     5  1.017|  5.824   6.031|  3.1mins  4.4mins 70.93%  8:12:05.062am.\n   28|   8052889  12062610  4009722|  7534021    25.39|  2357673     5  1.025|  8.412   8.842|  4.4mins  6.8mins 64.81%  8:18:50.843am.\n   29|  12062611  17683964  5621354| 10540894    27.45|  3736777     5  1.037| 11.814  12.666|  5.9mins  8.7mins 67.49%  8:27:35.375am.\n   30|  17683965  25331836  7647872| 14308274    29.65|  5757092     5  1.052| 16.090  17.699|  8.1mins 12.1mins 66.43%  8:39:42.640am.\n   31|  25331837  35397636 10065800| 18773730    32.03|  8547647     6  1.072| 21.203  24.079| 10.4mins 14.8mins 70.68%  8:54:28.562am.\n   32|  35397637  48158049 12760413| 23759506    34.47| 12146155     7  1.097| 27.009  31.864| 13.2mins 19.0mins 69.20%  9:13:31.234am.\n   33|  48158050  63728835 15570786| 28870409    37.06| 16437759     8  1.126| 33.226  40.950| 15.7mins 21.8mins 72.16%  9:35:16.421am.\n   34|  63728836  81900441 18171606| 33626342    39.63| 20990966     9  1.157| 39.543  51.100| 18.8mins 31.2mins 60.26% 10:06:28.671am.\n   35|  81900442 102200317 20299876| 37402396    42.28| 25357818     9  1.193| 45.566  61.894| 21.7mins 43.3mins 50.19% 10:49:46.296am.\n   36| 102200318 123787565 21587248| 39666978    44.94| 28674025    11  1.222| 51.062  72.814| 24.1mins 55.6mins 43.32% 11:45:22.359am.\n   37| 123787566 145628724 21841159| 39956652    47.68| 30596301    10  1.253| 55.742  83.268| 24.9mins 62.8mins 39.61% 12:48:08.968pm.\n   38| 145628725 166535629 20906905| 38122360    50.42| 30382490    10  1.269| 59.612  92.717| 24.8mins 65.3mins 37.94%  1:53:27.953pm.\n   39| 166535630 185434986 18899357| 34311262    53.20| 28383116    11  1.286| 62.576 100.747| 22.4mins 61.1mins 36.70%  2:54:31.156pm.\n   40| 185434987 201493321 16058335| 29019233    55.99| 24579603    12  1.283| 64.796 107.133| 19.0mins 52.2mins 36.48%  3:46:40.171pm.\n   41| 201493322 214265924 12772603| 23016150    58.66| 19948189    10  1.281| 66.330 111.891| 14.8mins 40.7mins 36.41%  4:27:20.140pm.\n   42| 214265925 223781141  9515217| 17041788    61.37| 14979073    11  1.262| 67.361 115.182| 10.9mins 29.0mins 37.55%  4:56:23.062pm.\n   43| 223781142 230364322  6583181| 11772739    63.96| 10506946    10  1.249| 67.994 117.304|  7.0mins 19.0mins 37.17%  5:15:21.000pm.\n   44| 230364323 234607075  4242753|  7532690    66.76|  6789748    11  1.222| 68.366 118.555|  4.3mins 11.3mins 37.93%  5:26:38.500pm.\n   45| 234607076 237110948  2503873|  4439978    69.59|  4054719    10  1.206| 68.558 119.231|  2.3mins  6.1mins 37.47%  5:32:47.218pm.\n   46| 237110949 238461216  1350268|  2371273    72.87|  2185279    10  1.176| 68.651 119.552| 70.6secs  2.9mins 39.92%  5:35:44.015pm.\n   47| 238461217 239104461   643245|  1130010    76.08|  1055623    10  1.160| 68.689 119.687| 29.4secs 74.9secs 39.21%  5:36:58.890pm.\n   48| 239104462 239374764   270303|   466424    80.21|   440280    10  1.125| 68.702 119.734| 10.8secs 26.0secs 41.36%  5:37:24.921pm.\n   49| 239374765 239467075    92311|   161691    83.23|   154374     8  1.111| 68.705 119.747|  3.4secs  7.6secs 45.08%  5:37:32.546pm.\n   50| 239467076 239494191    27116|    44973    88.02|    43422    11  1.071| 68.706 119.750|  0.8secs  1.5secs 56.82%  5:37:34.031pm.\n   51| 239494192 239499581     5390|     9553    88.33|     9259     6  1.074| 68.706 119.750|  0.1secs  0.4secs 33.32%  5:37:34.453pm.\n   52| 239499582 239500696     1115|     1625    94.71|     1593     5  1.028| 68.706 119.750|  0.0secs  0.0secs104.17%  5:37:34.468pm.\n   53| 239500697 239500782       86|      167    89.22|      162     3  1.049| 68.706 119.750|  0.0secs  0.0secs 97.66%  5:37:34.484pm.\n   54| 239500783 239500800       18|       18   100.00|       18     1  1.000| 68.706 119.750|  0.0secs  0.0secs         5:37:34.484pm.\n\nThe boundary has not surged to new positions!\nThe now-static boundary has 18\n\n     Record Stash Move | Board layout | Max|d| Sum|d| Euclidean Encoded vs Zero\n  239500783   Red    D |0869/B725/43A1|      7     44    14.765       466581807\n  239500784   Red    D |0869/B7A1/4325|      9     58    18.601       466582214\n  239500785   Red    R |8759/43A2/0B61|      9     48    16.310       302860487\n  239500786   Red    R |4325/8761/0BA9|      9     38    15.362       127427903\n  239500787   Red    R |0821/B3A5/4769|      9     48    15.811       464885186\n  239500788   Red    D |0B21/3765/48A9|      9     38    14.765       475738105\n  239500789   Red    R |4321/8B65/07A9|      9     42    15.362       127389739\n  239500790   Red    D |0861/B325/47A9|      9     48    15.811       466336825\n  239500791   Red    D |0829/B365/47A1|      6     36    12.410       465127617\n  239500792   Red    R |0829/B7A5/4361|      7     44    14.765       465130767\n  239500793   Red    R |4321/8769/0BA5|      9     30    11.832       127387607\n  239500794   Red    R |B821/37A5/0469|     10     58    19.799       424935162\n  239500795   Red    R |4361/8725/0BA9|      9     42    15.362       128113223\n  239500796   Red    R |4321/B765/08A9|      9     40    15.297       127402699\n  239500797   Red    U |8369/4725/0BA1|      9     38    14.283       288340727\n  239500798   Red    U |8329/476A/0B51|      9     36    14.213       287247191\n  239500799   Red    R |0321/8765/4BA9|      9     30    11.832       446727869\n  239500800   Red    R |8321/4765/0BA9|      9     38    15.362       287039663\nNo progress!\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_37.txt",
        "content": "To play 'slide-square' with 4 rows and 3 columns.\n\nTide  Red\n Preparing a stash in file SlideSolveR4C3.123456789AB0.dat\n ... with an index in file SlideSolveR4C3.123456789AB0.ndx\n   199999991  zero values for an empty index.\n 1 2 3 4 5 6 7 8 9 A B 0 is the board layout in INTEGER*1\n 4030201 8070605   B0A09       0 is the board layout in INTEGER*4\n        48372615          B0A090 ..interleaved into two INTEGER*4\n                        8AA0F74D combined.\n                     -1969162419 as a decimal integer.\nABS(MOD(-1969162419,199999991)) + 2 = 169162502 is the record number for the first index entry.\n\n     | Tidewrack Boundary Positions |    Positions     |    Primary Probes       Index Use   |Memory of Time Passed\nSurge|     First       Last    Count|  Checked Deja vu%|     Made Max.L Avg.L|  Used%   Load%|    CPU      Clock\n    1|         1          1        1|        2     0.00|        0     0 0.000|  0.000   0.000|  0.0secs  0.0secs  0.00%  7:50:20.203pm.\n    2|         2          3        2|        4     0.00|        0     0 0.000|  0.000   0.000|  0.0secs  0.1secs 12.50%  7:50:20.328pm.\n    3|         4          7        4|        9     0.00|        0     0 0.000|  0.000   0.000|  0.0secs  0.0secs         7:50:20.328pm.\n    4|         8         16        9|       20     0.00|        0     0 0.000|  0.000   0.000|  0.0secs  0.0secs  0.00%  7:50:20.343pm.\n    5|        17         36       20|       37     0.00|        0     0 0.000|  0.000   0.000|  0.0secs  0.1secs  0.00%  7:50:20.421pm.\n    6|        37         73       37|       64     1.56|        1     1 1.000|  0.000   0.000|  0.0secs  0.0secs  0.00%  7:50:20.437pm.\n    7|        74        136       63|      125     2.40|        3     1 1.000|  0.000   0.000|  0.0secs  0.2secs  8.31%  7:50:20.625pm.\n    8|       137        258      122|      241     3.73|        9     1 1.000|  0.000   0.000|  0.0secs  0.1secs 50.40%  7:50:20.687pm.\n    9|       259        490      232|      451     4.43|       20     1 1.000|  0.000   0.000|  0.0secs  0.1secs 49.87%  7:50:20.781pm.\n   10|       491        921      431|      827     5.56|       46     1 1.000|  0.001   0.001|  0.1secs  0.2secs 63.59%  7:50:20.953pm.\n   11|       922       1702      781|     1481     6.01|       89     1 1.000|  0.002   0.002|  0.1secs  0.3secs 35.06%  7:50:21.265pm.\n   12|      1703       3094     1392|     2671     6.63|      177     1 1.000|  0.003   0.003|  0.2secs  0.6secs 41.63%  7:50:21.828pm.\n   13|      3095       5588     2494|     4770     6.88|      328     1 1.000|  0.005   0.005|  0.5secs  1.5secs 36.19%  7:50:23.296pm.\n   14|      5589      10030     4442|     8502     7.62|      648     1 1.000|  0.009   0.009|  0.8secs  2.2secs 34.50%  7:50:25.515pm.\n   15|     10031      17884     7854|    15135     8.17|     1237     1 1.000|  0.016   0.016|  1.3secs  3.9secs 33.60%  7:50:29.421pm.\n   16|     17885      31783    13899|    26554     8.81|     2344     1 1.000|  0.028   0.028|  2.2secs  5.9secs 36.77%  7:50:35.328pm.\n   17|     31784      55998    24215|    46180     9.48|     4397     1 1.000|  0.049   0.049|  3.1secs  9.5secs 32.73%  7:50:44.781pm.\n   18|     55999      97800    41802|    79668    10.67|     8574     2 1.000|  0.084   0.084|  6.0secs 14.5secs 41.25%  7:50:59.328pm.\n   19|     97801     168967    71167|   135867    11.76|    16154     2 1.000|  0.144   0.144|  9.3secs 20.5secs 45.46%  7:51:19.812pm.\n   20|    168968     288855   119888|   228379    13.14|    30520     2 1.000|  0.243   0.244| 14.7secs 27.9secs 52.72%  7:51:47.671pm.\n   21|    288856     487218   198363|   377240    14.32|    55395     2 1.001|  0.404   0.405| 18.5secs 33.0secs 56.18%  7:52:20.656pm.\n   22|    487219     810424   323206|   612123    15.74|    99611     2 1.002|  0.660   0.663| 22.4secs 41.7secs 53.62%  7:53:02.359pm.\n   23|    810425    1326202   515778|   977833    17.06|   175049     2 1.003|  1.062   1.069| 35.9secs 61.9secs 57.96%  7:54:04.250pm.\n   24|   1326203    2137202   811000|  1533678    18.63|   305322     3 1.004|  1.676   1.693| 55.4secs 94.5secs 58.68%  7:55:38.718pm.\n   25|   2137203    3385213  1248011|  2358532    20.07|   519257     4 1.007|  2.596   2.635| 87.8secs  2.3mins 63.69%  7:57:56.562pm.\n   26|   3385214    5270492  1885279|  3554164    21.71|   872963     3 1.010|  3.936   4.026|  2.2mins  3.4mins 63.19%  8:01:21.109pm.\n   27|   5270493    8052888  2782396|  5239108    23.47|  1445680     4 1.016|  5.833   6.031|  3.2mins  4.8mins 66.44%  8:06:08.906pm.\n   28|   8052889   12062610  4009722|  7534021    25.39|  2348797     4 1.024|  8.426   8.842|  4.5mins  6.9mins 65.49%  8:13:00.218pm.\n   29|  12062611   17683964  5621354| 10540894    27.45|  3734408     5 1.036| 11.829  12.666|  6.4mins  9.1mins 70.67%  8:22:04.328pm.\n   30|  17683965   25331836  7647872| 14308274    29.65|  5746564     5 1.051| 16.110  17.699|  8.3mins 12.3mins 67.88%  8:34:21.375pm.\n   31|  25331837   35397636 10065800| 18773730    32.03|  8552447     6 1.071| 21.220  24.079| 10.9mins 15.7mins 69.40%  8:50:02.062pm.\n   32|  35397637   48158049 12760413| 23759506    34.47| 12145305     7 1.096| 27.027  31.864| 13.8mins 19.5mins 70.96%  9:09:32.671pm.\n   33|  48158050   63728835 15570786| 28870409    37.06| 16448462     7 1.125| 33.238  40.950| 16.7mins 23.2mins 71.94%  9:32:46.109pm.\n   34|  63728836   81900441 18171606| 33626342    39.63| 21022994     9 1.158| 39.540  51.100| 20.1mins 32.4mins 62.17% 10:05:09.859pm.\n   35|  81900442  102200317 20299876| 37402396    42.28| 25358874     8 1.192| 45.562  61.894| 21.9mins 44.7mins 49.02% 10:49:50.296pm.\n   36| 102200318  123787565 21587248| 39666978    44.94| 28734429    10 1.224| 51.028  72.814| 25.6mins 56.6mins 45.33% 11:46:25.156pm.\n   37| 123787566  145628724 21841159| 39956652    47.68| 30572287    11 1.252| 55.720  83.268| 27.1mins 64.5mins 41.99%  0:50:52.171am.\n   38| 145628725  166535629 20906905| 38122360    50.42| 30446707    10 1.273| 59.558  92.717| 26.6mins 66.4mins 40.12%  1:57:16.468am.\n   39| 166535630  185434986 18899357| 34311262    53.20| 28341786    10 1.283| 62.543 100.747| 23.7mins 62.2mins 38.16%  2:59:28.250am.\n   40| 185434987  201493321 16058335| 29019233    55.99| 24605484    10 1.285| 64.750 107.133| 20.0mins 53.8mins 37.26%  3:53:15.640am.\n   41| 201493322  214265924 12772603| 23016150    58.66| 19903099    11 1.276| 66.306 111.891| 15.5mins 41.1mins 37.86%  4:34:19.671am.\n   42| 214265925  223781141  9515217| 17041788    61.37| 14979317    10 1.262| 67.337 115.182| 11.3mins 29.2mins 38.48%  5:03:33.937am.\n   43| 223781142  230364322  6583181| 11772739    63.96| 10478430    12 1.241| 67.985 117.304|  7.4mins 19.1mins 38.79%  5:22:39.250am.\n   44| 230364323  234607075  4242753|  7532690    66.76|  6785656    11 1.220| 68.358 118.555|  4.4mins 11.4mins 38.96%  5:34:04.359am.\n   45| 234607076  237110948  2503873|  4439978    69.59|  4041159    10 1.197| 68.558 119.231|  2.4mins  6.2mins 38.76%  5:40:15.031am.\n   46| 237110949  238461216  1350268|  2371273    72.87|  2182892    11 1.172| 68.652 119.552| 70.1secs  3.0mins 39.48%  5:43:12.625am.\n   47| 238461217  239104461   643245|  1130010    76.08|  1051526    10 1.149| 68.691 119.687| 30.2secs 76.2secs 39.66%  5:44:28.812am.\n   48| 239104462  239374764   270303|   466424    80.21|   439307    10 1.118| 68.705 119.734| 11.2secs 26.3secs 42.40%  5:44:55.125am.\n   49| 239374765  239467075    92311|   161691    83.23|   153927     9 1.102| 68.708 119.747|  3.6secs  7.9secs 45.63%  5:45:03.000am.\n   50| 239467076  239494191    27116|    44973    88.02|    43358     9 1.067| 68.709 119.750|  0.8secs  1.7secs 44.15%  5:45:04.734am.\n   51| 239494192  239499581     5390|     9553    88.33|     9231     6 1.062| 68.709 119.750|  0.1secs  0.3secs 52.87%  5:45:05.000am.\n   52| 239499582  239500696     1115|     1625    94.71|     1598     4 1.029| 68.709 119.750|  0.0secs  0.0secs100.81%  5:45:05.031am.\n   53| 239500697  239500782       86|      167    89.22|      161     3 1.043| 68.709 119.750|  0.0secs  0.0secs         5:45:05.031am.\n   54| 239500783  239500800       18|       18   100.00|       18     1 1.000| 68.709 119.750|  0.0secs  0.0secs         5:45:05.031am.\n\nThe boundary has not surged to new positions!\nThe now-static boundary has 18\n\n     Record Stash Move |  Board layout | Max|d| Sum|d| Euclidean Encoded vs Zero\n  239500783   Red    D |09A/B78/456/321|      9     52    17.720       471375815\n  239500784   Red    L |A90/78B/456/123|      9     60    19.494       391824450\n  239500785   Red    L |BA0/789/546/321|     10     56    18.974       435370175\n  239500786   Red    D |BA0/789/452/361|     10     56    18.493       435370041\n  239500787   Red    R |07A/98B/456/123|      9     56    18.221       464077890\n  239500788   Red    R |09A/B87/465/321|      9     52    17.833       471380879\n  239500789   Red    R |09A/B87/546/321|      9     52    17.833       471380975\n  239500790   Red    R |09A/B87/564/312|     10     54    18.547       471380998\n  239500791   Red    L |970/B8A/465/123|      9     60    19.287       344730714\n  239500792   Red    L |AB0/789/546/123|      9     60    19.950       395453370\n  239500793   Red    L |BA0/879/265/341|     10     56    18.601       435410157\n  239500794   Red    R |09A/B78/546/123|      9     56    18.868       471375930\n  239500795   Red    L |AB0/789/456/132|      9     58    19.339       395453251\n  239500796   Red    R |09A/B78/465/123|      9     56    18.868       471375834\n  239500797   Red    D |AB0/798/456/123|      9     60    19.950       395458290\n  239500798   Red    L |AB0/789/456/213|     10     60    19.950       395453252\n  239500799   Red    L |BA0/789/456/123|     10     60    19.950       435370050\n  239500800   Red    R |0BA/789/456/123|      9     56    18.868       478915650\nNo progress!\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_38.txt",
        "content": "To play 'slide-square' with 3 rows and 3 columns.\n\nTide  Red\n Preparing a stash in file SlideSolveR3C3.123456780.dat\n ... with an index in file SlideSolveR3C3.123456780.ndx\n      199991  zero values for an empty index.\n 1 2 3 4 5 6 7 8 0 is the board layout in INTEGER*1\n 4030201 8070605       0       0 is the board layout in INTEGER*4\n        48372615               0 ..interleaved into two INTEGER*4\n                        89F056BD multiplied together in INTEGER*4\n                     -1980737859 as a decimal integer.\nABS(MOD(-1980737859,199991)) + 2 = 26997 is the record number for the first index entry.\n\n     |Tidewrack Boundary Positions|  Positions     |  Primary Probes       Index Use\nSurge|   First       Last    Count|Checked Deja vu%|  Made Max.L  Avg.L|  Used%  Load%\n    1|       1          1        1|      2     0.00|     0     0  0.000|  0.002  0.002\n    2|       2          3        2|      4     0.00|     0     0  0.000|  0.004  0.004\n    3|       4          7        4|      8     0.00|     0     0  0.000|  0.008  0.008\n    4|       8         15        8|     16     0.00|     0     0  0.000|  0.016  0.016\n    5|      16         31       16|     20     0.00|     0     0  0.000|  0.026  0.026\n    6|      32         51       20|     40     2.50|     1     1  1.000|  0.045  0.045\n    7|      52         90       39|     65     4.62|     3     1  1.000|  0.076  0.076\n    8|      91        152       62|    124     6.45|     8     1  1.000|  0.134  0.134\n    9|     153        268      116|    164     7.32|    12     1  1.000|  0.210  0.210\n   10|     269        420      152|    304     5.92|    18     1  1.000|  0.353  0.353\n   11|     421        706      286|    430     7.91|    38     1  1.000|  0.549  0.551\n   12|     707       1102      396|    792     5.56|    53     1  1.000|  0.919  0.925\n   13|    1103       1850      748|   1114     8.08|    97     2  1.010|  1.427  1.437\n   14|    1851       2874     1024|   2048     7.57|   189     1  1.000|  2.357  2.384\n   15|    2875       4767     1893|   2799    10.25|   356     2  1.006|  3.578  3.640\n   16|    4768       7279     2512|   5024    10.73|   738     2  1.019|  5.721  5.882\n   17|    7280      11764     4485|   6599    14.56|  1365     2  1.023|  8.338  8.701\n   18|   11765      17402     5638|  11276    15.49|  2734     3  1.042| 12.610 13.466\n   19|   17403      26931     9529|  13867    21.55|  4630     3  1.054| 17.228 18.905\n   20|   26932      37809    10878|  21756    21.89|  8302     4  1.087| 23.956 27.402\n   21|   37810      54802    16993|  24289    29.56| 11793     4  1.102| 30.204 35.958\n   22|   54803      71912    17110|  34220    30.01| 18451     4  1.151| 38.089 47.934\n   23|   71913      95864    23952|  33912    40.36| 21895     6  1.165| 44.097 58.047\n   24|   95865     116088    20224|  40448    40.55| 27617     6  1.205| 50.513 70.071\n   25|  116089     140135    24047|  33131    52.98| 25580     7  1.200| 54.289 77.860\n   26|  140136     155713    15578|  31156    53.27| 24657     5  1.208| 57.539 85.140\n   27|  155714     170273    14560|  19530    67.88| 16842     6  1.157| 58.883 88.277\n   28|  170274     176547     6274|  12548    68.84| 10945     5  1.137| 59.684 90.233\n   29|  176548     180457     3910|   4926    84.57|  4615     6  1.068| 59.840 90.613\n   30|  180458     181217      760|   1520    85.46|  1424     4  1.064| 59.888 90.723\n   31|  181218     181438      221|    265    99.25|   264     1  1.000| 59.888 90.724\n   32|  181439     181440        2|      4   100.00|     4     1  1.000| 59.888 90.724\n\nThe boundary has not surged to new positions!\nThe now-static boundary has 2\n\n     Record Stash Move |Board  plan| Max|d| Sum|d| Euclidean Encoded vs Zero\n     181439   Red    D |647/850/321|      6     32    12.247          220175\n     181440   Red    U |867/254/301|      8     32    13.038          311247\nNo progress!\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_39.txt",
        "content": "Randomize Timer\n\nDim Shared As Integer Nr(15) = {3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3}\nDim Shared As Integer Nc(15) = {3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2}\nDim Shared As Integer n, nn\nDim Shared As Integer N0(99), N3(100), N4(99)\nDim Shared As Ulongint N2(99)\n\nEnum\n    Ki = 1\n    Kg = 8\n    Ke = 2\n    Kl = 4\nEnd Enum\n\nDim Shared As Integer l = 108, r = 114, u = 117, d = 100\n\nDeclare Function fY() As Boolean\nDeclare Function fZ(w As Integer) As Boolean\nDeclare Function fN() As Boolean\n\nSub fI()\n    Dim As Integer g = (11 - N0(n)) * 4\n    Dim As Ulongint a = (N2(n) And (15ULL Shl g))\n    N0(n + 1) = N0(n) + 4\n    N2(n + 1) = N2(n) - a + (a Shl 16)\n    N3(n + 1) = d\n    N4(n + 1) = N4(n)\n    If Not(Nr((a Shr g)) <= N0(n)\\4) Then N4(n + 1) += 1\n    n += 1\nEnd Sub\n\nSub fG()\n    Dim As Integer g = (19 - N0(n)) * 4\n    Dim As Ulongint a = (N2(n) And (15ULL Shl g))\n    N0(n + 1) = N0(n) - 4\n    N2(n + 1) = N2(n) - a + (a Shr 16)\n    N3(n + 1) = u\n    N4(n + 1) = N4(n)\n    If Not(Nr((a Shr g)) >= N0(n)\\4) Then N4(n + 1) += 1\n    n += 1\nEnd Sub\n\nSub fE()\n    Dim As Integer g = (14 - N0(n)) * 4\n    Dim As Ulongint a = (N2(n) And (15ULL Shl g))\n    N0(n + 1) = N0(n) + 1\n    N2(n + 1) = N2(n) - a + (a Shl 4)\n    N3(n + 1) = r\n    N4(n + 1) = N4(n)\n    If Not(Nc((a Shr g)) <= (N0(n) Mod 4)) Then N4(n + 1) += 1\n    n += 1\nEnd Sub\n\nSub fL()\n    Dim As Integer g = (16 - N0(n)) * 4\n    Dim As Ulongint a = (N2(n) And (15ULL Shl g))\n    N0(n + 1) = N0(n) - 1\n    N2(n + 1) = N2(n) - a + (a Shr 4)\n    N3(n + 1) = l\n    N4(n + 1) = N4(n)\n    If Not(Nc((a Shr g)) >= (N0(n) Mod 4)) Then N4(n + 1) += 1\n    n += 1\nEnd Sub\n\nFunction fY() As Boolean\n    If N2(n) = &h123456789abcdef0ULL Then Return True\n    If N4(n) <= nn Then Return fN()\n    Return False\nEnd Function\n\nFunction fZ(w As Integer) As Boolean\n    If (w And Ki) > 0 Then\n        fI()\n        If fY() Then Return True\n        n -= 1\n    End If\n    If (w And Kg) > 0 Then\n        fG()\n        If fY() Then Return True\n        n -= 1\n    End If\n    If (w And Ke) > 0 Then\n        fE()\n        If fY() Then Return True\n        n -= 1\n    End If\n    If (w And Kl) > 0 Then\n        fL()\n        If fY() Then Return True\n        n -= 1\n    End If\n    Return False\nEnd Function\n\nFunction fN() As Boolean\n    Select Case N0(n)\n    Case 0\n        Select Case N3(n)\n        Case l: Return fZ(Ki)\n        Case u: Return fZ(Ke)\n        Case Else: Return fZ(Ki Or Ke)\n        End Select\n    Case 3\n        Select Case N3(n)\n        Case r: Return fZ(Ki)\n        Case u: Return fZ(Kl)\n        Case Else: Return fZ(Ki Or Kl)\n        End Select\n    Case 1, 2\n        Select Case N3(n)\n        Case l: Return fZ(Ki Or Kl)\n        Case r: Return fZ(Ki Or Ke)\n        Case u: Return fZ(Ke Or Kl)\n        Case Else: Return fZ(Kl Or Ke Or Ki)\n        End Select\n    Case 12\n        Select Case N3(n)\n        Case l: Return fZ(Kg)\n        Case d: Return fZ(Ke)\n        Case Else: Return fZ(Ke Or Kg)\n        End Select\n    Case 15\n        Select Case N3(n)\n        Case r: Return fZ(Kg)\n        Case d: Return fZ(Kl)\n        Case Else: Return fZ(Kg Or Kl)\n        End Select\n    Case 13, 14\n        Select Case N3(n)\n        Case l: Return fZ(Kg Or Kl)\n        Case r: Return fZ(Ke Or Kg)\n        Case d: Return fZ(Ke Or Kl)\n        Case Else: Return fZ(Kg Or Ke Or Kl)\n        End Select\n    Case 4, 8\n        Select Case N3(n)\n        Case l: Return fZ(Ki Or Kg)\n        Case u: Return fZ(Kg Or Ke)\n        Case d: Return fZ(Ki Or Ke)\n        Case Else: Return fZ(Ki Or Kg Or Ke)\n        End Select\n    Case 7, 11\n        Select Case N3(n)\n        Case d: Return fZ(Ki Or Kl)\n        Case u: Return fZ(Kg Or Kl)\n        Case r: Return fZ(Ki Or Kg)\n        Case Else: Return fZ(Ki Or Kg Or Kl)\n        End Select\n    Case Else\n        Select Case N3(n)\n        Case d: Return fZ(Ki Or Ke Or Kl)\n        Case l: Return fZ(Ki Or Kg Or Kl)\n        Case r: Return fZ(Ki Or Kg Or Ke)\n        Case u: Return fZ(Kg Or Ke Or Kl)\n        Case Else: Return fZ(Ki Or Kg Or Ke Or Kl)\n        End Select\n    End Select\nEnd Function\n\nSub solve()\n    If fN() Then\n        Exit Sub\n    Else\n        n = 0\n        nn += 1\n        solve()\n    End If\nEnd Sub\n\nFunction createPuzzle(Byval j As Integer) As Ulongint\n    Dim As Ulongint q = &h123456789abcdef0ULL\n    Dim As String h = Hex(q, 16)\n    Dim As Integer z, d, r, u = 0\n    While j > 0 ' number of moves to do\n        Do\n            d = Int(Rnd * 4) + 1\n        Loop While d = u\n        u = -d\n        r = Int(Rnd * 3) + 1\n        While r > 0\n            z = Instr(h, \"0\")\n            Select Case d\n            Case 1 ' -1\n                If (z Mod 4) <> 1 Then\n                    Mid(h, z, 1) = Mid(h, z - 1, 1)\n                    Mid(h, z - 1, 1) = \"0\"\n                    j -= 1\n                End If\n            Case 2 ' +1\n                If (z Mod 4) <> 0 Then\n                    Mid(h, z, 1) = Mid(h, z + 1, 1)\n                    Mid(h, z + 1, 1) = \"0\"\n                    j -= 1\n                End If\n            Case 3 ' -4\n                If z >= 5 Then\n                    Mid(h, z, 1) = Mid(h, z - 4, 1)\n                    Mid(h, z - 4, 1) = \"0\"\n                    j -= 1\n                End If\n            Case 4 ' +4\n                If z <= 12 Then\n                    Mid(h, z, 1) = Mid(h, z + 4, 1)\n                    Mid(h, z + 4, 1) = \"0\"\n                    j -= 1\n                End If\n            End Select\n            r -= 1\n        Wend\n    Wend\n    Return Valulng(\"&h\" + h)\nEnd Function\n\nSub ShowConfiguration(Byval h As String, i As Integer)\n    Dim As Integer r, c\n    Dim x As String\n    Color 14\n    For r = 1 To 4\n        For c = 1 To 4\n            x = Mid(h, r * 4 - 4 + c, 1)\n            If x = \"0\" Then x = \" \"\n            Locate r + i, c + c - 1: Print x;\n        Next\n    Next\n    Color 7\nEnd Sub\n\nSub shoWMoves(Byval h As String, Byval s As String, Byval m As Integer, Byval p As Integer)\n    Dim As Integer j, z, d\n    ShowConfiguration(h, 12)\n    For j = 1 To m\n        d = Asc(Mid(s, j, 1))\n        z = Instr(h, \"0\")\n        Select Case d\n        Case l\n            If (z Mod 4) <> 1 Then\n                Mid(h, z, 1) = Mid(h, z - 1, 1)\n                Mid(h, z - 1, 1) = \"0\"\n            End If\n        Case r\n            If (z Mod 4) <> 0 Then\n                Mid(h, z, 1) = Mid(h, z + 1, 1)\n                Mid(h, z + 1, 1) = \"0\"\n            End If\n        Case u\n            If z >= 5 Then\n                Mid(h, z, 1) = Mid(h, z - 4, 1)\n                Mid(h, z - 4, 1) = \"0\"\n            End If\n        Case d\n            If z <= 12 Then\n                Mid(h, z, 1) = Mid(h, z + 4, 1)\n                Mid(h, z + 4, 1) = \"0\"\n            End If\n        End Select\n        ShowConfiguration(h, 12)\n        Sleep p\n    Next\n    Print\nEnd Sub\n\nSub fifteenSolver(Byval g As Ulongint, Byval p As Integer)\n    Dim As String h, s\n    Dim As Integer j\n    Dim As Double t0 = Timer\n    n = 0\n    nn = 0\n    h = Hex(g, 16)\n    Cls\n    Print \"Puzzle: \"; Lcase(h)\n    ShowConfiguration(h, 2)\n    Print Chr(10)\n    N0(0) = Instr(h, \"0\") - 1\n    N2(0) = g\n    solve()\n    Print Using \"Solution found in & moves: \"; n;\n    For j = 1 To n\n        s &= Chr(N3(j))\n    Next\n    Print s\n    Print Using !\"\\nTook ###.######## seconds on i5 @ 3.20 GHz\"; Timer - t0\n    If p Then showMoves(h, s, n, p)\nEnd Sub\n\nfifteenSolver(&hfe169b4c0a73d852ULL, 1000)\n\nSleep\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_4.txt",
        "content": "-V\n   nr = [3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3]\n   nc = [3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2]\n\nT Solver\n   n = 0\n   np = 0\n   n0 = [0] * 100\n   n2 = [UInt64(0)] * 100\n   n3 = [Char(\"\\0\")] * 100\n   n4 = [0] * 100\n\n   F (values)\n      .n0[0] = values.index(0)\n\n      UInt64 tmp = 0\n      L(val) values\n         tmp = (tmp << 4) [|] val\n      .n2[0] = tmp\n\n   F fI()\n      V n = .n\n      V g = (11 - .n0[n]) * 4\n      V a = .n2[n] [&] (UInt64(15) << g)\n      .n0[n + 1] = .n0[n] + 4\n      .n2[n + 1] = .n2[n] - a + (a << 16)\n      .n3[n + 1] = Char(\u2018d\u2019)\n      .n4[n + 1] = .n4[n] + Int(:nr[Int(a >> g)] > .n0[n] I/ 4)\n\n   F fG()\n      V n = .n\n      V g = (19 - .n0[n]) * 4\n      V a = .n2[n] [&] (UInt64(15) << g)\n      .n0[n + 1] = .n0[n] - 4\n      .n2[n + 1] = .n2[n] - a + (a >> 16)\n      .n3[n + 1] = Char(\u2018u\u2019)\n      .n4[n + 1] = .n4[n] + Int(:nr[Int(a >> g)] < .n0[n] I/ 4)\n\n   F fE()\n      V n = .n\n      V g = (14 - .n0[n]) * 4\n      V a = .n2[n] [&] (UInt64(15) << g)\n      .n0[n + 1] = .n0[n] + 1\n      .n2[n + 1] = .n2[n] - a + (a << 4)\n      .n3[n + 1] = Char(\u2018r\u2019)\n      .n4[n + 1] = .n4[n] + Int(:nc[Int(a >> g)] > .n0[n]\u00a0% 4)\n\n   F fL()\n      V n = .n\n      V g = (16 - .n0[n]) * 4\n      V a = .n2[n] [&] (UInt64(15) << g)\n      .n0[n + 1] = .n0[n] - 1\n      .n2[n + 1] = .n2[n] - a + (a >> 4)\n      .n3[n + 1] = Char(\u2018l\u2019)\n      .n4[n + 1] = .n4[n] + Int(:nc[Int(a >> g)] < .n0[n]\u00a0% 4)\n\n   F fY()\n      I .n2[.n] == 1234'5678'9ABC'DEF0\n         R 1B\n      I .n4[.n] <= .np\n         R .fN()\n      R 0B\n\n   F fN() -> Bool\n      V n = .n\n      I .n3[n]\u00a0!= \u2018u\u2019 & .n0[n] I/ 4 < 3 {.fI(); .n++; I .fY() {R 1B}; .n--}\n      I .n3[n]\u00a0!= \u2018d\u2019 & .n0[n] I/ 4 > 0 {.fG(); .n++; I .fY() {R 1B}; .n--}\n      I .n3[n]\u00a0!= \u2018l\u2019 & .n0[n] \u00a0% 4 < 3 {.fE(); .n++; I .fY() {R 1B}; .n--}\n      I .n3[n]\u00a0!= \u2018r\u2019 & .n0[n] \u00a0% 4 > 0 {.fL(); .n++; I .fY() {R 1B}; .n--}\n      R 0B\n\n   F run()\n      L\u00a0!.fY()\n         .np++\n      print(\u2018Solution found with \u2019(.n)\u2018 moves: \u2019, end' \u2018\u2019)\n      L(g) 1 .. .n\n         print(.n3[g], end' \u2018\u2019)\n      print(\u2018.\u2019)\n\nV solver = Solver([15, 14,  1,  6,\n                    9, 11,  4, 12,\n                    0, 10,  7,  3,\n                   13,  8,  5,  2])\nsolver.run()",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_40.txt",
        "content": "Puzzle: fe169b4c0a73d852\n\nF E 1 6\n9 B 4 C\n  A 7 3\nD 8 5 2\n\nSolution found in 52 moves: rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n\nTook   1.41596560 seconds on i5 @ 3.20 GHz\n\n\n1 2 3 4\n5 6 7 8\n9 A B C\nD E F",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_41.txt",
        "content": "// 15 Puzzle Solver\n//https://rosettacode.org/wiki/15_puzzle_solver\n// Requires FutureBasic 7.0.30 or later\n\nbegin globals\n  int Nr(15), Nc(15), n, un, N0(99), N3(99), N4(99)\n  UInt64 N2(99)\nend globals\n\ndef fn fY as BOOL\nvoid def fn fI\nvoid def fn fG\nvoid def fn fE\nvoid def fn fL\n\nlocal fn fN1 as BOOL\n  if ( N3(n)\u00a0!= _\"u\" && N0(n) / 4 < 3 )\n    fn fI\n    n++\n    if ( fn fY ) then return YES\n    n--\n  end if\n  \n  if ( N3(n)\u00a0!= _\"d\" && N0(n) / 4 > 0 )\n    fn fG\n    n++\n    if ( fn fY ) then return YES\n    n--\n  end if\n  \n  if ( N3(n)\u00a0!= _\"l\" && N0(n)\u00a0% 4 < 3 )\n    fn fE\n    n++\n    if ( fn fY ) then return YES\n    n--\n  end if\n  \n  if ( N3(n)\u00a0!= _\"r\" && N0(n) %4 > 0 )\n    fn fL\n    n++\n    if ( fn fY ) then return YES\n    n--\n  end if\nend fn = NO\n\nvoid local fn fI\n  int g = ( 11 - N0(n)) * 4\n  UInt64 a = N2(n) & ((UInt64)15 << g)\n  N0(n + 1) = N0(n) + 4\n  N2(n + 1) = N2(n) - a + (a << 16)\n  N3(n + 1) = _\"d\"\n  if ( Nr(a >> g) <= N0(n) / 4 )\n    N4(n + 1) = N4(n)\n  else\n    N4(n + 1) = N4(n) + 1\n  end if\nend fn\n\nvoid local fn fG\n  int g = (19 - N0(n)) * 4\n  UInt64 a = N2(n) & ((UInt64)15 << g)\n  N0(n + 1) = N0(n) - 4\n  N2(n + 1) = N2(n) - a + (a >> 16)\n  N3(n + 1) = _\"u\"\n  if ( Nr(a >> g) >= N0(n) / 4 )\n    N4(n + 1) = N4(n)\n  else\n    N4(n + 1) = N4(n) + 1\n  end if\nend fn\n\nvoid local fn fE\n  int g = (14 - N0(n)) * 4\n  UInt64 a = N2(n) & ((UInt64)15 << g)\n  N0(n + 1) = N0(n) + 1\n  N2(n + 1) = N2(n) - a + (a << 4)\n  N3(n + 1) = _\"r\"\n  if ( Nc(a >> g) <= N0(n)\u00a0% 4 )\n    N4(n + 1) = N4(n)\n  else\n    N4(n + 1) = N4(n) + 1\n  end if\nend fn\n\nvoid local fn fL\n  int g = (16 - N0(n)) * 4\n  UInt64 a = N2(n) & ((UInt64)15 << g)\n  N0(n + 1) = N0(n) - 1\n  N2(n + 1) = N2(n) - a + (a >> 4)\n  N3(n + 1) = _\"l\"\n  if ( Nc(a >> g) >= N0(n)\u00a0% 4 )\n    N4(n + 1) = N4(n)\n  else\n    N4(n + 1) = N4(n) + 1\n  end if\nend fn\n\nlocal fn fY as BOOL\n  if ( N4(n) < un ) then return fn fN1\n  if ( N2(n) == 0x123456789abcdef0 )\n    printf @\"Solution found in %d moves:\",n\n    for int g = 1 to n\n      printf @\"%c\\b\",N3(g)\n    next\n    print\n    return YES\n  end if\n  if ( N4(n) == un ) then return fn fN1\nend fn = NO\n\nvoid local fn Solve( initN as int, initG as UInt64 )\n  int tempNr(15) = {3,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3}\n  int tempNc(15) = {3,0,1,2,3,0,1,2,3,0,1,2,3,0,1,2}\n  \n  fn memcpy(@Nr(0),@tempNr(0),sizeof(int)*16)\n  fn memcpy(@Nc(0),@tempNc(0),sizeof(int)*16)\n  \n  n = 0\n  un = 0\n  \n  N0(0) = initN\n  N2(0) = initG\n  \n  while ( !fn fY )\n    un++\n  wend\nend fn\n\n\nwindow 1, @\"15 Puzzle Solver\"\nwindowcenter(1)\nWindowSetBackgroundColor(1,fn ColorBlack)\n\ntext ,14,fn colorWhite\nPrint \"Puzzle: \"; \"fe169b4c0a73d852\"\n\ntext ,14,fn colorYellow\nprint\nprint @\"15 14 1  6\"\nprint @\" 9 11 4 12\"\nprint @\" 0 10 7  3\"\nprint @\"13  8 5  2\"\nprint\ntext ,14,fn colorWhite\n\nCFStringRef ComputerChip = unix @\"sysctl -n machdep.cpu.brand_string\"\n\nCFTimeInterval t\u00a0: t = fn CACurrentMediaTime\nfn Solve( 8, 0xfe169b4c0a73d852 )\nCFTimeInterval CurrentTime = fn CACurrentMediaTime-t\n\nprint\ntext ,14,fn colorYellow\nprint\nprint @\" 1  2  3  4\"\nprint @\" 5  6  7  8\"\nprint @\" 9 10 11 12\"\nprint @\"13 14 15  0\"\nprint\ntext ,14,fn colorWhite\n\nprint\u00a0: printf @\"Compute time:\u00a0%.3f seconds\",(CurrentTime)\nprint ComputerChip\n\nHandleEvents",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_42.txt",
        "content": "Puzzle: fe169b4c0a73d852\n\n15 14 1  6\n 9 11 4 12\n 0 10 7  3\n13  8 5  2\n\nSolution found in 52 moves:\nrrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n\n 1  2  3  4\n 5  6  7  8\n 9 10 11 12\n13 14 15  0\n\nCompute time: 0.552 seconds\nApple M3\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_43.txt",
        "content": "package main\n\nimport \"fmt\"\n\nvar (\n    Nr = [16]int{3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3}\n    Nc = [16]int{3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2}\n)\n\nvar (\n    n, _n      int\n    N0, N3, N4 [85]int\n    N2         [85]uint64\n)\n\nconst (\n    i = 1\n    g = 8\n    e = 2\n    l = 4\n)\n\nfunc fY() bool {\n    if N2[n] == 0x123456789abcdef0 {\n        return true\n    }\n    if N4[n] <= _n {\n        return fN()\n    }\n    return false\n}\n\nfunc fZ(w int) bool {\n    if w&i > 0 {\n        fI()\n        if fY() {\n            return true\n        }\n        n--\n    }\n    if w&g > 0 {\n        fG()\n        if fY() {\n            return true\n        }\n        n--\n    }\n    if w&e > 0 {\n        fE()\n        if fY() {\n            return true\n        }\n        n--\n    }\n    if w&l > 0 {\n        fL()\n        if fY() {\n            return true\n        }\n        n--\n    }\n    return false\n}\n\nfunc fN() bool {\n    switch N0[n] {\n    case 0:\n        switch N3[n] {\n        case 'l':\n            return fZ(i)\n        case 'u':\n            return fZ(e)\n        default:\n            return fZ(i + e)\n        }\n    case 3:\n        switch N3[n] {\n        case 'r':\n            return fZ(i)\n        case 'u':\n            return fZ(l)\n        default:\n            return fZ(i + l)\n        }\n    case 1, 2:\n        switch N3[n] {\n        case 'l':\n            return fZ(i + l)\n        case 'r':\n            return fZ(i + e)\n        case 'u':\n            return fZ(e + l)\n        default:\n            return fZ(l + e + i)\n        }\n    case 12:\n        switch N3[n] {\n        case 'l':\n            return fZ(g)\n        case 'd':\n            return fZ(e)\n        default:\n            return fZ(e + g)\n        }\n    case 15:\n        switch N3[n] {\n        case 'r':\n            return fZ(g)\n        case 'd':\n            return fZ(l)\n        default:\n            return fZ(g + l)\n        }\n    case 13, 14:\n        switch N3[n] {\n        case 'l':\n            return fZ(g + l)\n        case 'r':\n            return fZ(e + g)\n        case 'd':\n            return fZ(e + l)\n        default:\n            return fZ(g + e + l)\n        }\n    case 4, 8:\n        switch N3[n] {\n        case 'l':\n            return fZ(i + g)\n        case 'u':\n            return fZ(g + e)\n        case 'd':\n            return fZ(i + e)\n        default:\n            return fZ(i + g + e)\n        }\n    case 7, 11:\n        switch N3[n] {\n        case 'd':\n            return fZ(i + l)\n        case 'u':\n            return fZ(g + l)\n        case 'r':\n            return fZ(i + g)\n        default:\n            return fZ(i + g + l)\n        }\n    default:\n        switch N3[n] {\n        case 'd':\n            return fZ(i + e + l)\n        case 'l':\n            return fZ(i + g + l)\n        case 'r':\n            return fZ(i + g + e)\n        case 'u':\n            return fZ(g + e + l)\n        default:\n            return fZ(i + g + e + l)\n        }\n    }\n}\n\nfunc fI() {\n    g := (11 - N0[n]) * 4\n    a := N2[n] & uint64(15<<uint(g))\n    N0[n+1] = N0[n] + 4\n    N2[n+1] = N2[n] - a + (a << 16)\n    N3[n+1] = 'd'\n    N4[n+1] = N4[n]\n    cond := Nr[a>>uint(g)] <= N0[n]/4\n    if !cond {\n        N4[n+1]++\n    }\n    n++\n}\n\nfunc fG() {\n    g := (19 - N0[n]) * 4\n    a := N2[n] & uint64(15<<uint(g))\n    N0[n+1] = N0[n] - 4\n    N2[n+1] = N2[n] - a + (a >> 16)\n    N3[n+1] = 'u'\n    N4[n+1] = N4[n]\n    cond := Nr[a>>uint(g)] >= N0[n]/4\n    if !cond {\n        N4[n+1]++\n    }\n    n++\n}\n\nfunc fE() {\n    g := (14 - N0[n]) * 4\n    a := N2[n] & uint64(15<<uint(g))\n    N0[n+1] = N0[n] + 1\n    N2[n+1] = N2[n] - a + (a << 4)\n    N3[n+1] = 'r'\n    N4[n+1] = N4[n]\n    cond := Nc[a>>uint(g)] <= N0[n]%4\n    if !cond {\n        N4[n+1]++\n    }\n    n++\n}\n\nfunc fL() {\n    g := (16 - N0[n]) * 4\n    a := N2[n] & uint64(15<<uint(g))\n    N0[n+1] = N0[n] - 1\n    N2[n+1] = N2[n] - a + (a >> 4)\n    N3[n+1] = 'l'\n    N4[n+1] = N4[n]\n    cond := Nc[a>>uint(g)] >= N0[n]%4\n    if !cond {\n        N4[n+1]++\n    }\n    n++\n}\n\nfunc fifteenSolver(n int, g uint64) {\n    N0[0] = n\n    N2[0] = g\n    N4[0] = 0\n}\n\nfunc solve() {\n    if fN() {\n        fmt.Print(\"Solution found in \", n, \" moves: \")\n        for g := 1; g <= n; g++ {\n            fmt.Printf(\"%c\", N3[g])\n        }\n        fmt.Println()\n    } else {\n        n = 0\n        _n++\n        solve()\n    }\n}\n\nfunc main() {\n    fifteenSolver(8, 0xfe169b4c0a73d852)\n    solve()\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_44.txt",
        "content": "Solution found in 52 moves: rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_45.txt",
        "content": "import java.util.ArrayList;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.PriorityQueue;\nimport java.util.Queue;\nimport java.util.Set;\nimport java.util.stream.Collectors;\n\npublic final class Puzzle15Solver {\n    \n    public static void main(String[] aArgs) {\n        List<Integer> start = List.of( 15, 14, 1, 6, 9, 11, 4, 12, 0, 10, 7, 3, 13, 8, 5, 2 );\n        final int zeroIndex = 8;\n        Puzzle initial = new Puzzle(start, new ArrayList<String>(), zeroIndex, 0);\n        openSet.add(initial);\n        System.out.println(\"Solving the 15 puzzle:\");\n        initial.display();        \n        \n        while ( solution == null ) {\n            search();\n        }\n\n        System.out.println(solution.moves.stream().collect(Collectors.joining(\"\")));\n        System.out.println(\"Number of steps: \" + solution.moves.size());\n        System.out.println(\"Number of puzzle states checked: \" + closedSet.size());\n    }\n    \n    private static void search() {\n\t\tPuzzle current = openSet.poll();\n\t    closedSet.add(current);\n\t    final int zeroIndex = current.zeroIndex;\n\t    final int row = zeroIndex / 4;\n        final int column = zeroIndex % 4;\n\t    \n\t\tif ( column > 0 ) {\n\t\t\tPuzzle nextPuzzle = current.clone();\n\t\t\tnextPuzzle.makeMove(Move.LEFT);\n\t    }\n\t    if ( column < 3 ) {\n\t    \tPuzzle nextPuzzle = current.clone();\n\t    \tnextPuzzle.makeMove(Move.RIGHT);\n\t    }\n\t    if ( row > 0 ) {\n\t    \tPuzzle nextPuzzle = current.clone();\n\t    \tnextPuzzle.makeMove(Move.UP);\n\t    }\n\t    if ( row < 3 ) {\n\t    \tPuzzle nextPuzzle = current.clone();\n\t    \tnextPuzzle.makeMove(Move.DOWN);\n\t    }\n\t}\n\n    private enum Move {\t\t\n\t\tLEFT(\"L\", -1), RIGHT(\"R\", +1), UP(\"U\", -4), DOWN(\"D\", +4);\t\t\n\t\t\n\t\tprivate Move(String aSymbol, int aStep) {\n\t\t\tsymbol = aSymbol;\n\t\t\tstep = aStep;\n\t\t}\n\t\t\n\t\tprivate String symbol;\n\t\tprivate Integer step;\t\t\n\t}\n    \n    private static class Puzzle {    \n\n        public Puzzle(List<Integer> aTiles, List<String> aMoves, int aZeroIndex, int aSearchDepth) {\n        \ttiles = aTiles;\n            moves = aMoves;        \n            zeroIndex = aZeroIndex;\n            searchDepth = aSearchDepth;             \n        }\n        \n        public void makeMove(Move aMove) {    \t\t\n    \t\tInteger temp = tiles.get(zeroIndex + aMove.step);\n    \t\ttiles.set(zeroIndex + aMove.step, 0);\n    \t\ttiles.set(zeroIndex, temp);\n    \t\t\n    \t\tzeroIndex += aMove.step;\n    \t\tmoves.add(aMove.symbol);\n    \t\t\n    \t\tif ( ! closedSet.contains(this) ) {\n                openSet.add(this);\n                if ( tiles.equals(Puzzle.GOAL) ) {\n                    solution = this;\n                }\n            }\n    \t}\n\n        public long heuristic() {\n        \tint distance = 0;\n        \tfor ( int i = 0; i < tiles.size(); i++ ) {\n        \t\tfinal int tile = tiles.get(i);\n            \tif ( tile > 0 ) { \n            \t\tdistance += Math.abs( ( i / 4 ) - ( tile - 1 ) / 4 ) + Math.abs( ( i % 4 ) - ( tile - 1 ) % 4 );\n            \t}\n            }\n            return distance + searchDepth;\n        }  \n        \n        public Puzzle clone() {\n            return new Puzzle(new ArrayList<Integer>(tiles), new ArrayList<String>(moves), zeroIndex, searchDepth + 1);\n        }\n\n        public void display() {\n        \t for ( int i = 0; i < tiles.size(); i++ ) {\n                 System.out.print(String.format(\"%s%2d%s\",\n                 \t( i % 4 == 0 ) ? \"[\" : \"\", tiles.get(i), ( i % 4 == 3 ) ? \"]\\n\" : \" \"));\n             }\n             System.out.println();\n        }   \n\n        @Override\n        public boolean equals(Object aObject) {\n        \treturn switch(aObject) {\n        \t\tcase Puzzle puzzle -> tiles.equals(puzzle.tiles);\n        \t\tcase Object object -> false;\n        \t};\n        }\n        \n        @Override\n        public int hashCode() {\n            int hash = 3;\n            hash = 23 * hash + tiles.hashCode();\n            hash = 23 * hash + zeroIndex;\n            return hash;\n        }\n        \n        private List<Integer> tiles;\n        private List<String> moves;\n        private int zeroIndex;\n        private int searchDepth;        \n        \n        private static final List<Integer> GOAL = List.of( 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 0 );\n        \n    }\n\n    private static Queue<Puzzle> openSet =\n    \tnew PriorityQueue<Puzzle>( (one, two) -> Long.compare(one.heuristic(), two.heuristic()) ); \n    private static Set<Puzzle> closedSet = new HashSet<Puzzle>();\n    private static Puzzle solution;\n   \n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_46.txt",
        "content": "Solving the 15 puzzle:\n[15 14  1  6]\n[ 9 11  4 12]\n[ 0 10  7  3]\n[13  8  5  2]\n\nRRRULDLUULDRURDDDLUULURRRDLDDRULDLUURDDLULURRULDRRDD\nNumber of steps: 52\nNumber of puzzle states checked: 2276369\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_47.txt",
        "content": "# The following may be omitted if using the C implementation\n# or if the debug messages are deleted.\ndef debug(msg): (msg | tostring | debug | empty), .;\n\n### Generic functions\n\ndef array_swap($i; $j):\n  if $j < $i then array_swap($j;$i)\n  elif $i == $j then .\n  else .[:$i] + [.[$j]] + .[$i+1:$j] + [.[$i]] + .[$j+1:]\n  end\u00a0;\n\ndef sum(s): reduce s as $x (0; . + $x);\n\n### The 15-Puzzle\n\n# manhattan distance between points $ix and $iy where these are indices in the flat array\ndef distance($ix; $jx):\n  def row: ./4 | floor;\n  def col: .\u00a0% 4;\n  [$ix, $jx]\n  | map(row) as $mr  # [$ri, $rj]\n  | map(col) as $mc  # [$ci, $cj]\n  | [$mr[0] - $mr[1], $mc[0] - $mc[1]]\n  | map(length) # i.e. abs\n  | add;\n      \n# What is the Manhattan distance between the position of $tile in the goal\n# and the location corresponding to index $ix, where $ix is in range(0;16)\ndef manhattan($tile; $ix):\n  .position[$tile|tostring] as $jx\n  | distance($ix; $jx);\n\n# The total of the discrepancies\ndef total_manhattan_distance:\n  sum( range(0;16) as $p | .board[$p] as $tile | select($tile\u00a0!= 0) | manhattan($tile; $p) )\n  | debug;\n  \n# Input:\n#  .goal is the desired board (flat array)\n#  .position is the JSON object mapping tiles to the goal index\n#  .zero is the location of 0\n#  .board is the current state of the board (flat array)\n#  .distance is incremented by $delta after each move\n#  .seen is our memory\n# If allowed, move the zero tile to $p where $p has been properly specified in relation to .zero;\n# otherwise emit empty\ndef move($p):\n  if $p >= 0 and $p < 16\n  then .board[$p] as $tile\n  # Are we making things worse off?\n  | (manhattan($tile; .zero) - manhattan($tile; $p)) as $delta\n  | if $delta > 0 and .distance > (.N - .n)\n    then if .n >= .N then debug({n, N, distance,sequence: (.sequence|length)}) end | empty\n    else # make the move\n    .zero as $zero\n    | (.board | array_swap($zero; $p)) as $candidate\n    | ($candidate|tostring) as $s\n    | if .seen[$s]\n      then empty\n      else .board = $candidate\n      | .zero = $p\n      | .n += 1\n      | .seen[$s] = true\n      end\n    end\n  # We should only reach here if the move has been made\n  | if $delta\u00a0!= 0\n    then .distance += $delta\n    end\n  else empty\n  end\n;\n\ndef row: . / 4 | floor;\ndef col: .\u00a0% 4;\n\ndef up:\n  if (.zero | row) == 0 then empty\n  else move(.zero - 4)\n  | .sequence += [\"u\"]\n  end;\n\ndef down:\n  if (.zero | row) == 3 then empty\n  else move(.zero + 4)\n  | .sequence += [\"d\"]\n  end;\n\ndef left:\n  if (.zero|col) == 0 then empty\n  else move(.zero - 1)\n  | .sequence += [\"l\"]\n  end;\n\ndef right:\n  if (.zero|col) == 3 then empty\n  else move(.zero + 1)\n  | .sequence += [\"r\"]\n  end;  \n\n# $array is a permutation of range(0;16), e.g. the goal\n# Output: a JSON object such that .[$tile] is the position of $tile in the goal\ndef positions($array):\n  reduce range(0; $array|length) as $i ({}; . + {($array[$i]|tostring): $i});\n\n# map a string of lowercase hex digits to an array of decimals\ndef symbols2array: explode | map(if . > 96 then .-87 else .-48 end);\n\n# $start should be a string of length 16 representing the starting state;\n# the goal is: \"123456789abcdef0\"\ndef init($start):\n  if $start|length == 16 then . else error end\n  | [range(1;16), 0] as $init\n  | {goal: $init,\n     position: positions($init),\n     distance: 0,\n     n: 0,           # number of moves so far\n     sequence: [],   # the sequence of moves so far\n     seen: {}\n  }\n  | .board =  ($start | symbols2array)\n  | .zero = (.board|index(0))\n  | (.board|tostring) as $s\n  | .seen[$s] = true\n;\n\n# Output: If the move of the zero tile to $p is legal in one step, \n#         then emit manhattan($tile; .zero) - manhattan($tile; $p)\n#         where $tile is the tile at $p;\n#         otherwise: null\ndef delta_move($p):\n  if $p >= 0 and $p < 16\n  then distance($p; .zero) as $base\n  | if ($base|length) == 1  # abs\n    then .board[$p] as $tile\n    | manhattan($tile; .zero) - manhattan($tile; $p)\n    else null\n    end\n  else null\n  end\u00a0;\n\n# For comparing the possible moves:\ndef moves:\n   {\"u\": delta_move( .zero - 4),\n    \"d\": delta_move( .zero + 4),\n    \"l\": delta_move( .zero - 1),\n    \"r\": delta_move( .zero + 1) }\n   | to_entries\n   | map(select( .value ) )\n   | sort_by(.value)\n  \u00a0;\n\n\n# input: the output of moves\ndef execute($moves):\n  ($moves[] |.key) as $key\n  |   if $key == \"l\" then left\n    elif $key == \"r\" then right\n    elif $key == \"u\" then up\n    elif $key == \"d\" then down\n    else empty\n    end;\n\n# $N is the maximum number of moves allowed\n# Input: as per `input`; .n is the number of moves so far\ndef possible_moves($N):\n  def possible_moves:\n    if .board == .goal then .  # a solution\n    elif (.sequence|length) >= $N then empty\n    else .sequence[-1] as $lastmove\n    | if   $lastmove == \"l\"  then execute(moves | map(select(.key\u00a0!= \"r\")))\n      elif $lastmove == \"r\"  then execute(moves | map(select(.key\u00a0!= \"l\")))\n      elif $lastmove == \"u\"  then execute(moves | map(select(.key\u00a0!= \"d\")))\n      elif $lastmove == \"d\"  then execute(moves | map(select(.key\u00a0!= \"u\")))\n      else                        execute(moves)\n      end\n    | possible_moves\n    end\u00a0;\n  possible_moves;\n\ndef solve($goal):\n  init($goal)\n  | total_manhattan_distance as $d\n  | first( range($d; 100) as $n\n           | .N = $n\n           | .distance = $d\n           | debug(\"before: n=\\($n) distance = \\($d))\")           \n           | possible_moves($n)\n           | .sequence | join(\"\") )\u00a0;\n\nsolve(\"fe169b4c0a73d852\")",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_48.txt",
        "content": "[\"DEBUG:\",36]\n[\"DEBUG:\",\"before: n=36 distance = 36)\"]\n[\"DEBUG:\",\"before: n=37 distance = 36)\"]\n[\"DEBUG:\",\"before: n=38 distance = 36)\"]\n...\n[\"DEBUG:\",\"before: n=52 distance = 36)\"]\n\"rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\"\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_49.txt",
        "content": "const Nr = [3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3]\nconst Nc = [3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2]\n\nconst N0 = zeros(Int, 85)\nconst N2 = zeros(UInt64, 85)\nconst N3 = zeros(UInt8, 85)\nconst N4 = zeros(Int, 85)\nconst i = 1\nconst g = 8\nconst ee = 2\nconst l = 4\nconst _n = Vector{Int32}([0])\n\nfunction fY(n::Int)\n    if N2[n + 1] == UInt64(0x123456789abcdef0)\n        return true, n\n    end\n    if N4[n + 1] <= _n[1]\n        return fN(n)\n    end\n    false, n\nend\n\nfunction fZ(w, n)\n    if w & i > 0\n        n = fI(n)\n        (y, n) = fY(n)\n        if y return (true, n) end\n        n -= 1\n    end\n    if w & g > 0\n        n = fG(n)\n        (y, n) = fY(n)\n        if y return (true, n) end\n        n -= 1\n    end\n    if w & ee > 0\n        n = fE(n)\n        (y, n) = fY(n)\n        if y return (true, n) end\n        n -= 1\n    end\n    if w & l > 0\n        n = fL(n)\n        (y, n) = fY(n)\n        if y return (true, n) end\n        n -= 1\n    end\n    false, n\nend\n\nfunction fN(n::Int)\n    x = N0[n + 1]\n    y = UInt8(N3[n + 1])\n    if x == 0\n        if y == UInt8('l')\n            return fZ(i, n)\n        elseif y == UInt8('u')\n            return fZ(ee, n)\n        else\n            return fZ(i + ee, n)\n        end\n    elseif x == 3\n        if y == UInt8('r')\n            return fZ(i, n)\n        elseif y == UInt8('u')\n            return fZ(l, n)\n        else\n            return fZ(i + l, n)\n        end\n    elseif x == 1 || x == 2\n        if y == UInt8('l')\n            return fZ(i + l, n)\n        elseif y == UInt8('r')\n            return fZ(i + ee, n)\n        elseif y == UInt8('u')\n            return fZ(ee + l, n)\n        else\n            return fZ(l + ee + i, n)\n        end\n    elseif x == 12\n        if y == UInt8('l')\n            return fZ(g, n)\n        elseif y == UInt8('d')\n            return fZ(ee, n)\n        else\n            return fZ(ee + g, n)\n        end\n    elseif x == 15\n        if y == UInt8('r')\n            return fZ(g, n)\n        elseif y == UInt8('d')\n            return fZ(l, n)\n        else\n            return fZ(g + l, n)\n        end\n    elseif x == 13 || x == 14\n        if y == UInt8('l')\n            return fZ(g + l, n)\n        elseif y == UInt8('r')\n            return fZ(ee + g, n)\n        elseif y == UInt8('d')\n            return fZ(ee + l, n)\n        else\n            return fZ(g + ee + l, n)\n        end\n    elseif x == 4 || x == 8\n        if y == UInt8('l')\n            return fZ(i + g, n)\n        elseif y == UInt8('u')\n            return fZ(g + ee, n)\n        elseif y == UInt8('d')\n            return fZ(i + ee, n)\n        else\n            return fZ(i + g + ee, n)\n        end\n    elseif x == 7 || x == 11\n        if y == UInt8('d')\n            return fZ(i + l, n)\n        elseif y == UInt8('u')\n            return fZ(g + l, n)\n        elseif y == UInt8('r')\n                return fZ(i + g, n)\n        else\n            return fZ(i + g + l, n)\n        end\n    else\n        if y == UInt8('d')\n            return fZ(i + ee + l, n)\n        elseif y == UInt8('l')\n                return fZ(i + g + l, n)\n        elseif y == UInt8('r')\n            return fZ(i + g + ee, n)\n        elseif y == UInt8('u')\n            return fZ(g + ee + l, n)\n        else\n            return fZ(i + g + ee + l, n)\n        end\n    end\nend\n\nfunction fI(n)\n    gg = (11 - N0[n + 1]) * 4\n    a = N2[n + 1] & (UInt64(0xf) << UInt(gg))\n    N0[n + 2] = N0[n + 1] + 4\n    N2[n + 2] = N2[n + 1] - a + (a << 16)\n    N3[n + 2] = UInt8('d')\n    N4[n + 2] = N4[n + 1]\n    cond = Nr[(a >> gg) + 1] <= div(N0[n + 1], 4)\n    if !cond\n        N4[n + 2] += 1\n    end\n    n += 1\n    n\nend\n\nfunction fG(n)\n    gg = (19 - N0[n + 1]) * 4\n    a = N2[n + 1] & (UInt64(0xf) << UInt(gg))\n    N0[n + 2] = N0[n + 1] - 4\n    N2[n + 2] = N2[n + 1] - a + (a >> 16)\n    N3[n + 2] = UInt8('u')\n    N4[n + 2] = N4[n + 1]\n    cond = Nr[(a >> gg) + 1] >= div(N0[n + 1], 4)\n    if !cond\n        N4[n + 2] += 1\n    end\n    n += 1\n    n\nend\n\nfunction fE(n)\n    gg = (14 - N0[n + 1]) * 4\n    a = N2[n + 1] & (UInt64(0xf) << UInt(gg))\n    N0[n + 2] = N0[n + 1] + 1\n    N2[n + 2] = N2[n + 1] - a + (a << 4)\n    N3[n + 2] = UInt8('r')\n    N4[n + 2] = N4[n + 1]\n    cond = Nc[(a >> gg) + 1] <= N0[n + 1] % 4\n    if !cond\n        N4[n + 2] += 1\n    end\n    n += 1\n    n\nend\n\nfunction fL(n)\n    gg = (16 - N0[n + 1]) * 4\n    a = N2[n + 1] & (UInt64(0xf) << UInt(gg))\n    N0[n + 2] = N0[n + 1] - 1\n    N2[n + 2] = N2[n + 1] - a + (a >> 4)\n    N3[n + 2] = UInt8('l')\n    N4[n + 2] = N4[n + 1]\n    cond = Nc[(a >> gg) + 1] >= N0[n + 1] % 4\n    if !cond\n        N4[n + 2] += 1\n    end\n    n += 1\n    n\nend\n\nfunction solve(n)\n    ans, n = fN(n)\n    if ans\n        println(\"Solution found in $n moves: \")\n        for ch in N3[2:n+1] print(Char(ch)) end; println()\n    else\n        println(\"next iteration, _n[1] will be $(_n[1] + 1)...\")\n        n = 0; _n[1] += 1; solve(n)\n    end\nend\n\nrun() = (N0[1] = 8; _n[1] = 1; N2[1] = 0xfe169b4c0a73d852; solve(0))\nrun()\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_5.txt",
        "content": "Solution found with 52 moves: rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd.\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_50.txt",
        "content": "\n\nnext iteration, _n[1] will be 2...\nnext iteration, _n[1] will be 3...\nnext iteration, _n[1] will be 4...\nnext iteration, _n[1] will be 5...\nnext iteration, _n[1] will be 6...\nnext iteration, _n[1] will be 7...\nnext iteration, _n[1] will be 8...\nSolution found in 52 moves:\nrrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_51.txt",
        "content": "next iteration, _n[1] will be 2...\nnext iteration, _n[1] will be 3...\nnext iteration, _n[1] will be 4...\nnext iteration, _n[1] will be 5...\nnext iteration, _n[1] will be 6...\nnext iteration, _n[1] will be 7...\nnext iteration, _n[1] will be 8...\nSolution found in 52 moves:\nrrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_52.txt",
        "content": "#!/usr/bin/lua\n--[[\nSolve 3X3 sliding tile puzzle using Astar on Lua. Requires 3mb and\nmillions of recursions.\nby RMM  2020-may-1\n]]--\n\nlocal SOLUTION_LIMIT, MAX_F_VALUE = 100,100\nlocal NR, NC, RCSIZE  = 4,4,4*4\nlocal Up, Down, Right, Left = 'u','d','r','l'\nlocal G_cols = {}  -- goal columns\nlocal G_rows = {} -- goal rows\nlocal C_cols = {} -- current cols\nlocal C_rows = {} -- current rows\nlocal Goal = {}\nlocal Tiles = {}\t\t-- the puzzle\nlocal Solution = {}\t\t-- final path is instance of desc\nlocal desc  = {}\t\t-- descending path\ndesc[0] = 0 -- override Lua default \"1\" index\n\n-- @brief create C compatible array for Lua\nlocal function Amake( list )\n   array = {}\n   for i=0, #list do\n      array[i] = list[i+1] -- simulate \"C\" array in Lua\n   end\n   return array\nend\n\nG_cols= Amake({0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, } )\nG_rows= Amake({0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, } )\nC_cols= Amake({0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, } )\nC_rows= Amake({0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, } )\nTiles = Amake({ 15,14,1,6,  9,11,4,12,  0,10,7,3, 13,8,5,2,} )\nGoal  = Amake({1,2,3,4, 5,6,7,8, 9,10,11,12, 13,14,15,0,} )\n\nlocal m1 = {recursions=0, found=0, threshold=0, times=0, steps=0,}\n-- ---------------------------------------------------------------\n-- return 1D array index given 2D row,column\nlocal function rcidx( row, col )\n   return (row * NR + col)\nend\n\n-- @brief recursive search\n-- @return f_score\nlocal function search( depth, x_row, x_col, h_score)\n   local move, go_back_move, last_move_by_current\n   local f_score, ix, min, temp, hscore2, idx1\n   local N_minus_one = NR - 1;\n   local rc1 = {row=0,col=0}\n   local rc2 = {row=0,col=0}\n   local gtmp = {row=0,col=0}\n\n   f_score = depth + h_score;\n   if f_score > m1.threshold then  return f_score end\n   if h_score == 0 then do\n      m1.found = 1\n      Solution = table.concat(desc)\n      return f_score  end end\n   \n   m1.recursions = m1.recursions+1\n   m1.times = m1.times + 1\n   if m1.times > 200000 then do\n\t print(\"Recursions \",m1.recursions)\n\t m1.times = 0\n   end  end\n   \n   min = 999999\n   last_move_by_current = desc[depth];\n   rc1.row = x_row;\n   rc1.col = x_col;\n   for ix = 0,3 do\n      if ix==0 then do\n\t    move = Up;\n\t    go_back_move = Down;\n\t    rc2.row = x_row - 1;\n\t    rc2.col = x_col;\n\t\t   end\n      elseif ix==1 then do\n\t    move = Down;\n\t    go_back_move = Up;\n\t    rc2.row = x_row + 1;\n\t    rc2.col = x_col;\n\t\t       end\n      elseif ix==2 then do\n\t    move = Left;\n\t    go_back_move = Right;\n\t    rc2.row = x_row;\n\t    rc2.col = x_col - 1;\n\t\t       end\n      elseif ix==3 then do\n\t    move = Right;\n\t    go_back_move = Left;\n\t    rc2.row = x_row;\n\t    rc2.col = x_col + 1;\n\t\t\tend end\n      if move==Up and x_row==0 then goto next end\n      if move==Down and x_row==N_minus_one then goto next end\n      if move==Left and x_col==0 then goto next end\n      if move==Right and x_col==N_minus_one then goto next end\n      if last_move_by_current==go_back_move then goto next end\n      hscore2 = h_score\n      idx1 = Tiles[rcidx(rc2.row,rc2.col)]\n      gtmp.row = G_rows[idx1]\n      gtmp.col = G_cols[idx1]\n      local h_adj=0\n      if go_back_move==Up then do\n\t    if gtmp.row < C_rows[idx1] then\n\t       h_adj = -1 else h_adj = 1 end end\n      end\n      if go_back_move==Down then do\n\t    if gtmp.row > C_rows[idx1] then\n\t       h_adj = -1 else h_adj = 1 end end\n      end\n      if go_back_move==Left then do\n\t    if gtmp.col < C_cols[idx1] then\n\t       h_adj = -1 else h_adj = 1 end end\n      end\n      if go_back_move==Right then do\n\t    if gtmp.col > C_cols[idx1] then\n\t       h_adj = -1 else h_adj = 1 end end\n      end\n      hscore2 = hscore2 + h_adj\n      C_rows[0] = rc2.row;\n      C_cols[0] = rc2.col;\n      C_rows[idx1] = rc1.row;\n      C_cols[idx1] = rc1.col; \n      Tiles[rcidx(rc1.row,rc1.col)] = idx1;\n      Tiles[rcidx(rc2.row,rc2.col)] = 0;\n      desc[depth+1] = move\n      desc[depth+2] = '\\0'\n\n      temp = search(depth+1, rc2.row, rc2.col, hscore2); -- descend\n      -- regress\n      Tiles[rcidx(rc1.row,rc1.col)] = 0\n      Tiles[rcidx(rc2.row,rc2.col)] = idx1\n      desc[depth+1] = '\\0'\n      C_rows[0] = rc1.row;\n      C_cols[0] = rc1.col;\n      C_rows[idx1] = rc2.row;\n      C_cols[idx1] = rc2.col;\n      if m1.found == 1 then return temp end\n      if temp < min then  min = temp end\n      ::next::  -- Lua does not have \"continue;\" so uses goto\n   end  -- end for\n   m1.found = 0;\n   -- return the minimum f_score greater than m1.threshold\n   return min;\nend\n\n-- @brief  Run solver using A-star algorithm\n-- @param Tiles .. 3X3 sliding tile puzzle\nlocal function solve(Tiles)\n    local temp, i,j\n    local x_row, x_col, h_score = 0,0,0\n\n    m1.found = 0;\n    for i=0,(NR-1) do\n       for j=0, (NC-1) do\n\t  G_rows[ Goal[rcidx(i,j)] ] = i;\n\t  G_cols[ Goal[rcidx(i,j)] ] = j;\n\t  C_rows[ Tiles[rcidx(i,j)] ] = i;\n\t  C_cols[ Tiles[rcidx(i,j)] ] = j;\n       end\n    end\n    \n    for i=0,(NR-1) do\n       for j=0, (NC-1) do\n\t  if Tiles[rcidx(i,j)] == 0 then do\n\t\tx_row = i;\n\t\tx_col = j;\n\t\tbreak;\n\t\t\t\t\t end\n\t  end\n       end\n    end\n\n   desc[0] = '$'\n   desc[1] = '\\0'\n\n   h_score = 0;   -- Manhattan/Taxicab heuristic\n   for  i = 1,(RCSIZE-1) do\n      h_score = h_score + (math.abs(C_rows[i] - G_rows[i]) +\n\t\t    math.abs(C_cols[i] - G_cols[i]))\n   end\n   m1.threshold = h_score\n   print(\"solve -> search\")   \n   while true do\n      temp = search( 0, x_row, x_col, h_score);\n      if m1.found == 1 then do\n\t    print(\"Gound solution of length\",#Solution-1)\n\t    print(Solution)\n\t    break;\n      end end\n      \n      if temp > MAX_F_VALUE then do\n\t    print(\"Maximum f value reached! terminating! \\n\");\n\t    break;\t end\n      end\n      m1.threshold = temp;\n   end -- while\n   return 0\nend\n\n-- show sliding tile puzzle rows and columns\nlocal function print_tiles( pt)\n   local i,j,num\n    for i=0,(NR-1) do\n       for j=0, (NC-1) do\n\t  num = pt[rcidx(i,j)]\n\t  io.write(string.format(\"%02d \", num))\n       end\n       print(\"\")\n    end\n    print(\"\")\nend\n\n-- main(void) {\nprint(\"Solve sliding 15 tile puzzle\");\nm1.recursions = 0\nm1.times=0\nprint_tiles(Tiles);\nprint_tiles(Goal)\nsolve(Tiles);\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_53.txt",
        "content": "\n\nFOUND SOLUTION of length 52 rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_54.txt",
        "content": "FOUND SOLUTION of length 52 rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_55.txt",
        "content": "----------\n-- SOLVER\n----------\n\nlocal table_concat = table.concat -- local alias\n\nlocal function Solver(root, h, successors)\n  local pathlist, pathhash, iters\n  -- it is required that \"h(node)\" returns:\n  --   0 when \"is_goal(node)==true\"\n  --   >0 when \"is_goal(node)==false\"\n  --   (because it allows for some simplification herein)\n  local FOUND = 0 -- ie: \"is_goal(node)==true\"\n  local NOT_FOUND = 1e9 -- some number larger than largest possible f\n\n  local function hash(node)\n    return table_concat(node,\",\")\n  end\n\n  local function search(g, bound)\n    iters = iters + 1\n    --if ((iters\u00a0% 1000000) == 0) then print(\"iterations:\", iters) end\n    local node = pathlist[#pathlist]\n    local h = h(node)\n    local f = g + h\n    if (f > bound) then return f end\n    if (h == FOUND) then return FOUND end\n    local min = NOT_FOUND\n    for succ, cost in successors(node) do\n      local succhash = hash(succ)\n      if (not pathhash[succhash]) then\n        pathlist[#pathlist+1], pathhash[succhash] = succ, true\n        local t = search(g+cost, bound)\n        if (t == FOUND) then return FOUND end\n        if (t < min) then min = t end\n        pathlist[#pathlist], pathhash[succhash] = nil, nil\n      end\n    end\n    return min\n  end\n\n  return {\n    solve = function()\n      pathlist = { root }\n      pathhash = { [hash(root)] = true }\n      iters = 0\n      local bound = h(root)\n      while true do\n        bound = search(0, bound)\n        if (bound == FOUND) then return bound, iters, pathlist end\n        if (bound == NOT_FOUND) then return bound, iters, nil end\n      end\n    end\n  }\nend\n\n------------------\n-- DOMAIN SUPPORT\n------------------\n\nlocal i2c = { [0]=0, 1,2,3,4, 1,2,3,4, 1,2,3,4, 1,2,3,4 } -- convert index to column\nlocal i2r = { [0]=0, 1,1,1,1, 2,2,2,2, 3,3,3,3, 4,4,4,4 } -- convert index to row\nlocal R, U, L, D = 1, -4, -1, 4 -- move indexing values\nlocal movenames = { -- move names\n  [0]=\"\", [R]=\"r\", [U]=\"u\", [L]=\"l\", [D]=\"d\"\n}\nlocal succmoves = { -- successor directions\n  {R,D}, {R,L,D}, {R,L,D}, {L,D},\n  {R,U,D}, {R,U,L,D}, {R,U,L,D}, {U,L,D},\n  {R,U,D}, {R,U,L,D}, {R,U,L,D}, {U,L,D},\n  {R,U}, {R,U,L}, {R,U,L}, {U,L}\n}\nlocal manhdists = { -- manhattan distances\n  { [0]=0, 0, 1, 2, 3, 1, 2, 3, 4, 2, 3, 4, 5, 3, 4, 5, 6 },\n  { [0]=0, 1, 0, 1, 2, 2, 1, 2, 3, 3, 2, 3, 4, 4, 3, 4, 5 },\n  { [0]=0, 2, 1, 0, 1, 3, 2, 1, 2, 4, 3, 2, 3, 5, 4, 3, 4 },\n  { [0]=0, 3, 2, 1, 0, 4, 3, 2, 1, 5, 4, 3, 2, 6, 5, 4, 3 },\n  { [0]=0, 1, 2, 3, 4, 0, 1, 2, 3, 1, 2, 3, 4, 2, 3, 4, 5 },\n  { [0]=0, 2, 1, 2, 3, 1, 0, 1, 2, 2, 1, 2, 3, 3, 2, 3, 4 },\n  { [0]=0, 3, 2, 1, 2, 2, 1, 0, 1, 3, 2, 1, 2, 4, 3, 2, 3 },\n  { [0]=0, 4, 3, 2, 1, 3, 2, 1, 0, 4, 3, 2, 1, 5, 4, 3, 2 },\n  { [0]=0, 2, 3, 4, 5, 1, 2, 3, 4, 0, 1, 2, 3, 1, 2, 3, 4 },\n  { [0]=0, 3, 2, 3, 4, 2, 1, 2, 3, 1, 0, 1, 2, 2, 1, 2, 3 },\n  { [0]=0, 4, 3, 2, 3, 3, 2, 1, 2, 2, 1, 0, 1, 3, 2, 1, 2 },\n  { [0]=0, 5, 4, 3, 2, 4, 3, 2, 1, 3, 2, 1, 0, 4, 3, 2, 1 },\n  { [0]=0, 3, 4, 5, 6, 2, 3, 4, 5, 1, 2, 3, 4, 0, 1, 2, 3 },\n  { [0]=0, 4, 3, 4, 5, 3, 2, 3, 4, 2, 1, 2, 3, 1, 0, 1, 2 },\n  { [0]=0, 5, 4, 3, 4, 4, 3, 2, 3, 3, 2, 1, 2, 2, 1, 0, 1 },\n  { [0]=0, 6, 5, 4, 3, 5, 4, 3, 2, 4, 3, 2, 1, 3, 2, 1, 0 },\n}\n\n--- create a state from a pattern, optionally applying a move\nlocal function state(patt, move)\n  local node = {}\n  for k,v in pairs(patt) do node[k] = v end\n  if (move) then\n    local e = node.e\n    local ep = e + move\n    node[e], node[ep] = node[ep], 0\n    node.e, node.m = ep, move\n  end\n  return node\nend\n\n--- iterator for successors of node\nlocal function successors(node)\n  local moves = succmoves[node.e]\n  local i, n = 0, #moves\n  return function()\n    i = i + 1\n    if (i <= n) then\n      return state(node, moves[i]), 1\n    end\n  end\nend\n\n--- hueristic estimate of travel cost from node to goal\nlocal function h(node)\n  local sum, ijx, jix, t = 0, 1, 1\n  for i = 1, 4 do\n    local colmax, rowmax = 0, 0\n    for j = 1, 4 do\n      t = node[ijx]\n      sum = sum + manhdists[ijx][t] -- manhattan\n      if (i2r[t] == i) then -- row conflicts\n        if (t > rowmax) then rowmax=t else sum=sum+2 end\n      end\n      t = node[jix]\n      if (i2c[t] == i) then -- col conflicts\n        if (t > colmax) then colmax=t else sum=sum+2 end\n      end\n      ijx, jix = ijx+1, jix+4\n    end\n    jix = jix - 15\n  end\n  return sum\nend\n\n------------------\n-- PRINT SUPPORT:\n------------------\n\nlocal function printnode(node)\n  print(\"+--+--+--+--+\")\n  for i = 0, 12, 4 do\n    print( string.format(\"|%2d|%2d|%2d|%2d|\", node[i+1], node[i+2], node[i+3], node[i+4]) )\n    print(\"+--+--+--+--+\")\n  end\nend\n\nlocal function printpath(path)\n  -- note that #path is 1 longer than solution due to root node at path[1]\n  -- concatenated result will be correct length since movenames[root.m]==\"\"\n  local t = {}\n  for i, node in ipairs(path) do\n    t[i] = movenames[node.m]\n  end\n  local pathstr = table_concat(t)\n  print(\"SOLUTION: \" .. pathstr .. \" (length: \" .. #pathstr .. \")\")\nend\n\n---------\n-- TASKS:\n---------\n\n-- goal is implied by h(), never actually used (see solver's notes)\n-- local goal = state({ 1,2,3,4, 5,6,7,8, 9,10,11,12, 13,14,15,0, e=16, m=0 })\n\ndo\n  print(\"PRIMARY TASK (OPTIMALLY)\")\n  local sclock = os.clock()\n  local root = state({ 15,14,1,6, 9,11,4,12, 0,10,7,3, 13,8,5,2, e=9, m=0 })\n  printnode(root)\n  local solver = Solver(root, h, successors)\n  local bound, iters, path = solver:solve()\n  printpath(path)\n  printnode(path[#path])\n  print(\"ITERATIONS: \" .. iters)\n  print(\"ELAPSED: \" .. (os.clock()-sclock) .. \"s\")\nend\n\nprint()\n\ndo\n  print(\"EXTRA CREDIT TASK (APPROXIMATELY, NON-OPTIMALLY)\")\n  -- only primary task specifies \"fewest possible moves\"\n  -- extra credit task only specifies \"solve\", so..\n  local sclock = os.clock()\n  local root = state({ 0,12,9,13, 15,11,10,14, 3,7,2,5, 4,8,6,1, e=1, m=0 })\n  printnode(root)\n  local function hec(node)\n    -- overweighting h makes it not admissible,\n    -- causing solver to favor g when minimizing,\n    -- leading to non-optimal (but much easier to find!) solutions\n    return h(node)*1.5\n  end\n  local solver = Solver(root, hec, successors)\n  local bound, iters, path = solver:solve()\n  printpath(path) --> 86, optimal solution is known to be 80\n  printnode(path[#path])\n  print(\"ITERATIONS: \" .. iters)\n  print(\"ELAPSED: \" .. (os.clock()-sclock) .. \"s\")\nend\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_56.txt",
        "content": "PRIMARY TASK (OPTIMALLY)\n+--+--+--+--+\n|15|14| 1| 6|\n+--+--+--+--+\n| 9|11| 4|12|\n+--+--+--+--+\n| 0|10| 7| 3|\n+--+--+--+--+\n|13| 8| 5| 2|\n+--+--+--+--+\nSOLUTION: rrruldluuldrurdddluulurrrdlddruldluurddlulurruldrrdd (length: 52)\n+--+--+--+--+\n| 1| 2| 3| 4|\n+--+--+--+--+\n| 5| 6| 7| 8|\n+--+--+--+--+\n| 9|10|11|12|\n+--+--+--+--+\n|13|14|15| 0|\n+--+--+--+--+\nITERATIONS: 4963696\nELAPSED: 34.279s\n\nEXTRA CREDIT TASK (APPROXIMATELY, NON-OPTIMALLY)\n+--+--+--+--+\n| 0|12| 9|13|\n+--+--+--+--+\n|15|11|10|14|\n+--+--+--+--+\n| 3| 7| 2| 5|\n+--+--+--+--+\n| 4| 8| 6| 1|\n+--+--+--+--+\nSOLUTION: rrdldruldluruldrdrrululdrddlluurrddlluurrdrdllurrdlluruurddluurddluulddrdluluruldddrrr (length: 86)\n+--+--+--+--+\n| 1| 2| 3| 4|\n+--+--+--+--+\n| 5| 6| 7| 8|\n+--+--+--+--+\n| 9|10|11|12|\n+--+--+--+--+\n|13|14|15| 0|\n+--+--+--+--+\nITERATIONS: 1325248\nELAPSED: 9.101s\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_57.txt",
        "content": "# 15 puzzle.\n\nimport strformat\nimport times\n\nconst\n  Nr = [3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3]\n  Nc = [3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2]\n\ntype\n\n  Solver = object\n    n: int\n    np: int\n    n0: array[100, int]\n    n2: array[100, uint64]\n    n3: array[100, char]\n    n4: array[100, int]\n\n  Value = range[0..15]\n\n# Forward definition.\nproc fN(s: var Solver): bool\n\n#---------------------------------------------------------------------------------------------------\n\nproc fI(s: var Solver) =\n\n  let n = s.n\n  let g = (11 - s.n0[n]) * 4\n  let a = s.n2[n] and uint(15 shl g)\n  s.n0[n + 1] = s.n0[n] + 4\n  s.n2[n + 1] = s.n2[n] - a + a shl 16\n  s.n3[n + 1] = 'd'\n  s.n4[n + 1] = s.n4[n] + ord(Nr[a shr g] > s.n0[n] div 4)\n\n#---------------------------------------------------------------------------------------------------\n\nproc fG(s: var Solver) =\n\n  let n = s.n\n  let g = (19 - s.n0[n]) * 4\n  let a = s.n2[n] and uint(15 shl g)\n  s.n0[n + 1] = s.n0[n] - 4\n  s.n2[n + 1] = s.n2[n] - a + a shr 16\n  s.n3[n + 1] = 'u'\n  s.n4[n + 1] = s.n4[n] + ord(Nr[a shr g] < s.n0[n] div 4)\n\n#---------------------------------------------------------------------------------------------------\n\nproc fE(s: var Solver) =\n\n  let n = s.n\n  let g = (14 - s.n0[n]) * 4\n  let a = s.n2[n] and uint(15 shl g)\n  s.n0[n + 1] = s.n0[n] + 1\n  s.n2[n + 1] = s.n2[n] - a + a shl 4\n  s.n3[n + 1] = 'r'\n  s.n4[n + 1] = s.n4[n] + ord(Nc[a shr g] > s.n0[n] mod 4)\n\n#---------------------------------------------------------------------------------------------------\n\nproc fL(s: var Solver) =\n\n  let n = s.n\n  let g = (16 - s.n0[n]) * 4\n  let a = s.n2[n] and uint(15 shl g)\n  s.n0[n + 1] = s.n0[n] - 1\n  s.n2[n + 1] = s.n2[n] - a + a shr 4\n  s.n3[n + 1] = 'l'\n  s.n4[n + 1] = s.n4[n] + ord(Nc[a shr g] < s.n0[n] mod 4)\n\n#---------------------------------------------------------------------------------------------------\n\nproc fY(s: var Solver): bool =\n\n  if s.n2[s.n] == 0x123456789abcdef0'u:\n    return true\n  if s.n4[s.n] <= s.np:\n    return s.fN()\n\n#---------------------------------------------------------------------------------------------------\n\nproc fN(s: var Solver): bool =\n\n  let n = s.n\n  if s.n3[n] != 'u' and s.n0[n] div 4 < 3:\n    s.fI\n    inc s.n\n    if s.fY(): return true\n    dec s.n\n  if s.n3[n] != 'd' and s.n0[n] div 4 > 0:\n    s.fG()\n    inc s.n\n    if s.fY(): return true\n    dec s.n\n  if s.n3[n] != 'l' and s.n0[n] mod 4 < 3:\n    s.fE()\n    inc s.n\n    if s.fY(): return true\n    dec s.n\n  if s.n3[n] != 'r' and s.n0[n] mod 4 > 0:\n    s.fL()\n    inc s.n\n    if s.fY(): return true\n    dec s.n\n\n#---------------------------------------------------------------------------------------------------\n\nproc initSolver(values: array[16, Value]): Solver {.noInit.} =\n\n  result.n = 0\n  result.np = 0\n  result.n0[0] = values.find(0)\n  result.n2[0] = (var tmp = 0'u; for val in values: tmp = tmp shl 4 or uint(val); tmp)\n  result.n4[0] = 0\n\n#---------------------------------------------------------------------------------------------------\n\nproc run(s: var Solver) =\n\n  while not s.fY():\n    inc s.np\n  stdout.write(fmt\"Solution found with {s.n} moves: \")\n  for g in 1..s.n:\n    stdout.write(s.n3[g])\n  stdout.write(\".\\n\")\n\n#---------------------------------------------------------------------------------------------------\n\nproc toString(d: Duration): string =\n  # Custom representation of a duration.\n  const Plural: array[bool, string] = [\"\", \"s\"]\n  var ms = d.inMilliseconds\n  for (label, d) in {\"hour\": 3_600_000, \"minute\": 60_000, \"second\": 1_000, \"millisecond\": 1}:\n    let val = ms div d\n    if val > 0:\n      result.add($val & ' ' & label & Plural[val > 1])\n      ms = ms mod d\n      if ms > 0: result.add(' ')\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_58.txt",
        "content": "let start = getTime()\nvar solver = initSolver([Value 15, 14,  1,  6,\n                                9, 11,  4, 12,\n                                0, 10,  7,  3,\n                               13,  8,  5,  2])\nsolver.run()\necho fmt\"Execution time: {(getTime() - start).toString}.\"\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_59.txt",
        "content": "Solution found with 52 moves: rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd.\nExecution time: 504 milliseconds.\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_6.txt",
        "content": "/* ARM assembly AARCH64 Raspberry PI 3B */\n/*  program puzzle15solvex64.s   */\n/* this program is a adaptation algorithme C++ and go rosetta code */\n/* thanck for the creators */ \n/* 1 byte by box on game board */\n\n/* create a file with nano  */\n/*  15,  2,   3,   4\n    5,   6,   7,   1\n    9,   10,  8,   11\n   13,  14,  12, 0     */\n   \n/*   Run this programm\u00a0: puzzle15solver64 <file name> */\n/*   wait several minutes for r\u00e9sult */\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 TRUE, 1\n.equ FALSE, 0\n\n.equ SIZE,           4\n.equ NBBOX,          SIZE * SIZE\n.equ TAILLEBUFFER,   100\n.equ NBMAXIELEMENTS, 100\n\n.equ CONST_I,    1\n.equ CONST_G,    8\n.equ CONST_E,    2\n.equ CONST_L,    4\n\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nszMessTitre:           .asciz \"File name\u00a0: \"\nsMessResult:           .ascii \" \"\nsMessValeur:           .fill 22, 1, ' '             // size => 21\nszCarriageReturn:      .asciz \"\\n\"\nszMessCounterSolution: .asciz \"Solution in @ moves\u00a0: \\n\"\n\nszMessErreur:          .asciz \"Error detected.\\n\"\nszMessImpossible:      .asciz \"!!! Impossible solution\u00a0!!!\\n\"\nszMessErrBuffer:       .asciz \"buffer size too less\u00a0!!\"\nszMessSpaces:          .asciz \"    \"\n\nqTabNr:  .quad 3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3\nqTabNc:  .quad 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\n.align 8\nsZoneConv:      .skip 24\nqAdrHeap:       .skip 8\ntbBox:          .skip SIZE * SIZE           // game boxes\nqAdrFicName:    .skip 8\nqTabN0:         .skip 8 * NBMAXIELEMENTS    // empty box\nqTabN3:         .skip 8 * NBMAXIELEMENTS    // moves\nqTabN4:         .skip 8 * NBMAXIELEMENTS    //\u00a0????\nqTabN2:         .skip 8 * NBMAXIELEMENTS    // table game address\nsBuffer:        .skip TAILLEBUFFER\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                            // INFO: main\n    mov x0,sp                    // stack address for load parameter\n    bl traitFic                  // read file and store value in array\n    cmp x0,#-1\n    beq 100f                     // error\u00a0?\n\n    ldr x0,qAdrtbBox\n    bl displayGame               // display array game\n    \n    ldr x0,qAdrtbBox              // control if solution exists\n    bl controlSolution\n    cmp x0,#TRUE\n    beq 1f\n    ldr x0,qAdrszMessImpossible  // no solution\u00a0!!!\n    bl affichageMess\n    b 100f\n\n1:\n \n    ldr x0,qAdrtbBox\n    ldr x9,qAdrqTabN2\n    str x0,[x9]                  // N2 address global\n    mov x10,#0                   // variable _n global\n    mov x12,#0                   // variable n global \n    bl searchSolution\n    cmp x0,#TRUE\n    bne 100f                     // no solution\u00a0?\n    ldr x3,qAdrqTabN2\n    ldr x0,[x3,x12,lsl #3]       // visual solution control\n    bl displayGame\n    mov x0,x12                   // move counter\n    ldr x1,qAdrsZoneConv\n    bl conversion10              // conversion counter\n    ldr x0,qAdrszMessCounterSolution\n    bl strInsertAtCharInc\n    ldr x1,qAdrsZoneConv\n    bl affichageMess\n    ldr x5,qAdrqTabN3\n    ldr x3,qAdrsBuffer\n    mov x2,#1\n    mov x4,#0\n2:                                // loop solution display \n    ldr x1,[x5,x2,lsl 3]\n    cmp x2,#TAILLEBUFFER\n    bge 99f\n    strb w1,[x3,x4]\n    add x4,x4,#1\n    add x2,x2,#1\n    cmp x2,x12\n    ble 2b\n    mov x1,#0\n    strb w1,[x3,x4]                 // z\u00e9ro final\n    mov x0,x3\n    bl affichageMess\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess\n    \n    b 100f\n\n99:\n    ldr x0,qAdrszMessErrBuffer\n    bl affichageMess\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 \nqAdrtbBox:                  .quad tbBox\nqAdrqTabN0:                .quad qTabN0\nqAdrqTabN2:                .quad qTabN2\nqAdrqTabN3:                .quad qTabN3\nqAdrqTabN4:                .quad qTabN4\nqAdrszMessCounterSolution: .quad szMessCounterSolution\nqAdrszMessImpossible:      .quad szMessImpossible\nqAdrszMessErrBuffer:       .quad szMessErrBuffer\nqAdrsZoneConv:             .quad sZoneConv\n/******************************************************************/\n/*      search    Solution                                        */ \n/******************************************************************/\nsearchSolution:                  // INFO: searchSolution\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n                                 // address allocation place on the heap\n    mov x0,#0                    // allocation place heap\n    mov x8,BRK                   // call system 'brk'\n    svc #0\n    cmp x0,#-1                   // allocation error\n    beq 99f\n    ldr x1,qAdrqAdrHeap\n    str x0,[x1]                  // store heap address\n    bl functionFN\n    ldr x3,qAdrqTabN2\n    ldr x0,[x3,x12,lsl #3]       // last current game\n    bl gameOK                    // it is Ok\u00a0?\n    cmp x0,#TRUE\n    beq 100f                     // yes --> end\n\n    ldr x1,qAdrqAdrHeap          // free up resources\n    ldr x0,[x1]                  // restaur start address heap\n    mov x8,BRK                   // call system 'brk'\n    svc #0\n    cmp x0,#-1                   // allocation error\n    beq 99f\n    add x10,x10,#1               // _n\n    mov x12,#0                   // n\n    bl searchSolution            // next recursif call\n    b 100f\n99:\n    ldr x0,qAdrszMessErreur\n    bl affichageMess\n100:\n    ldp x8,x9,[sp],16            // restaur des  2 registres\n    ldp x6,x7,[sp],16            // restaur des  2 registres\n    ldp x4,x5,[sp],16            // restaur des  2 registres\n    ldp x2,x3,[sp],16            // restaur des  2 registres\n    ldp x1,lr,[sp],16            // restaur des  2 registres\n    ret\nqAdrszMessErreur:           .quad szMessErreur\nqAdrqAdrHeap:               .quad qAdrHeap\n/******************************************************************/\n/*     Fonction FN                                                */ \n/******************************************************************/\nfunctionFN:                      // INFO: functionFN\n    stp x1,lr,[sp,-16]!          // save  registres\n    ldr x4,qAdrqTabN3\n    ldr x3,[x4,x12,lsl #3]\n    ldr x5,qAdrqTabN0            // load position empty box\n    ldr x6,[x5,x12,lsl #3]\n    cmp x6,#15                   // last box\n    bne 2f\n    cmp x3,#'R'\n    bne 11f\n    mov x0,#CONST_G\n    bl functionFZ\n    b 100f\n11:\n    cmp x3,#'D'\n    bne 12f\n    mov x0,#CONST_L\n    bl functionFZ\n    b 100f\n12:\n    mov x0,#CONST_G + CONST_L\n    bl functionFZ\n    b 100f\n    \n2:\n    cmp x6,#12\n    bne 3f\n    cmp x3,#'L'\n    bne 21f\n    mov x0,#CONST_G\n    bl functionFZ\n    b 100f\n21:\n    cmp x3,#'D'\n    bne 22f\n    mov x0,#CONST_E\n    bl functionFZ\n    b 100f\n22:\n    mov x0,#CONST_E + CONST_G\n    bl functionFZ\n    b 100f\n3:\n    cmp x6,#13\n    beq 30f\n    cmp x6,#14\n    bne 4f\n30:\n    cmp x3,#'L'\n    bne 31f\n    mov x0,#CONST_G + CONST_L\n    bl functionFZ\n    b 100f\n31:\n    cmp x3,#'R'\n    bne 32f\n    mov x0,#CONST_G + CONST_E\n    bl functionFZ\n    b 100f\n32:\n    cmp x3,#'D'\n    bne 33f\n    mov x0,#CONST_E + CONST_L\n    bl functionFZ\n    b 100f\n33:\n    mov x0,#CONST_L + CONST_E + CONST_G\n    bl functionFZ\n    b 100f\n4:\n    cmp x6,#3\n    bne 5f\n    cmp x3,#'R'\n    bne 41f\n    mov x0,#CONST_I\n    bl functionFZ\n    b 100f\n41:\n    cmp x3,#'U'\n    bne 42f\n    mov x0,#CONST_L\n    bl functionFZ\n    b 100f\n42:\n    mov x0,#CONST_I + CONST_L\n    bl functionFZ\n    b 100f\n5:\n    cmp x6,#0\n    bne 6f\n    cmp x3,#'L'\n    bne 51f\n    mov x0,#CONST_I\n    bl functionFZ\n    b 100f\n51:\n    cmp x3,#'U'\n    bne 52f\n    mov x0,#CONST_E\n    bl functionFZ\n    b 100f\n52:\n    mov x0,#CONST_I + CONST_E\n    bl functionFZ\n    b 100f\n6:\n    cmp x6,#1\n    beq 60f\n    cmp x6,#2\n    bne 7f\n60:\n    cmp x3,#'L'\n    bne 61f\n    mov x0,#CONST_I + CONST_L\n    bl functionFZ\n    b 100f\n61:\n    cmp x3,#'R'\n    bne 62f\n    mov x0,#CONST_E + CONST_I\n    bl functionFZ\n    b 100f\n62:\n    cmp x3,#'U'\n    bne 63f\n    mov x0,#CONST_E + CONST_L\n    bl functionFZ\n    b 100f\n63:\n    mov x0,#CONST_I + CONST_E + CONST_L\n    bl functionFZ\n    b 100f\n7:\n    cmp x6,#7\n    beq 70f\n    cmp x6,#11\n    bne 8f\n70:\n    cmp x3,#'R'\n    bne 71f\n    mov x0,#CONST_I + CONST_G\n    bl functionFZ\n    b 100f\n71:\n    cmp x3,#'U'\n    bne 72f\n    mov x0,#CONST_G + CONST_L\n    bl functionFZ\n    b 100f\n72:\n    cmp x3,#'D'\n    bne 73f\n    mov x0,#CONST_I + CONST_L\n    bl functionFZ\n    b 100f\n73:\n    mov x0,#CONST_I + CONST_G + CONST_L\n    bl functionFZ\n    b 100f\n8:\n    cmp x6,#4\n    beq 80f\n    cmp x6,#8\n    bne 9f\n80:\n    cmp x3,#'D'\n    bne 81f\n    mov x0,#CONST_I + CONST_E\n    bl functionFZ\n    b 100f\n81:\n    cmp x3,#'U'\n    bne 82f\n    mov x0,#CONST_G + CONST_E\n    bl functionFZ\n    b 100f\n82:\n    cmp x3,#'L'\n    bne 83f\n    mov x0,#CONST_I + CONST_G\n    bl functionFZ\n    b 100f\n83:\n    mov x0,#CONST_G + CONST_E + CONST_I\n    bl functionFZ\n    b 100f\n9:\n    cmp x3,#'D'\n    bne 91f\n    mov x0,#CONST_I + CONST_E + CONST_L\n    bl functionFZ\n    b 100f\n91:\n    cmp x3,#'L'\n    bne 92f\n    mov x0,#CONST_I + CONST_G + CONST_L\n    bl functionFZ\n    b 100f\n92:\n    cmp x3,#'R'\n    bne 93f\n    mov x0,#CONST_I + CONST_G + CONST_E\n    bl functionFZ\n    b 100f\n93:\n    cmp x3,#'U'\n    bne 94f\n    mov x0,#CONST_G + CONST_E +  CONST_L\n    bl functionFZ\n    b 100f\n94:\n    mov x0,#CONST_G + CONST_L + CONST_I + CONST_E\n    bl functionFZ\n    b 100f\n\n99:                             // error\n    ldr x0,qAdrszMessErreur\n    bl affichageMess\n100:\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n\n/******************************************************************/\n/*     function FZ                           */ \n/*                                                 */\n/***************************************************************/\n/* x0 contains variable w           */\nfunctionFZ:                    // INFO: functionFZ\n    stp x1,lr,[sp,-16]!        // save  registres\n    stp x2,x3,[sp,-16]!        // save  registres\n    mov x2,x0 \n    and x1,x2,#CONST_I\n    cmp x1,#0\n    ble 1f\n    bl functionFI\n    bl functionFY\n    cmp x0,#TRUE\n    beq 100f\n    sub x12,x12,#1              // variable n\n1:\n    ands x1,x2,#CONST_G\n    ble 2f\n    bl functionFG\n    bl functionFY\n    cmp x0,#TRUE\n    beq 100f\n    sub x12,x12,#1              // variable n\n2:\n    ands x1,x2,#CONST_E\n    ble 3f\n    bl functionFE\n    bl functionFY\n    cmp x0,#TRUE\n    beq 100f\n    sub x12,x12,#1              // variable n\n3:\n    ands x1,x2,#CONST_L\n    ble 4f\n    bl functionFL\n    bl functionFY\n    cmp x0,#TRUE\n    beq 100f\n    sub x12,x12,#1              // variable n\n4:\n    mov x0,#FALSE\n100:\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*               function FY                                 */ \n/******************************************************************/\nfunctionFY:                    // INFO: functionFY\n    stp x1,lr,[sp,-16]!        // save  registres\n    ldr x1,qAdrqTabN2\n    ldr x0,[x1,x12,lsl #3]\n    bl gameOK                  // game OK\u00a0?\n    cmp x0,#TRUE\n    beq 100f\n    ldr x1,qAdrqTabN4\n    ldr x0,[x1,x12,lsl #3]\n    cmp x0,x10\n    bgt 1f\n    bl functionFN\n    b 100f\n1:\n    mov x0,#FALSE\n100:\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*     the empty box is down                                     */ \n/******************************************************************/\nfunctionFI:                       // INFO: functionFI\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    ldr x0,qAdrqTabN0\n    ldr x1,[x0,x12,lsl #3]        // empty box\n    add x2,x1,#4\n    ldr x3,[x9,x12,lsl #3]        // load game current\n    ldrb w4,[x3,x2]               // load box down empty box\n    add x5,x12,#1                 // n+1\n    add x8,x1,#4                  // new position empty case\n    str x8,[x0,x5,lsl #3]         // store new position empty case\n    ldr x6,qAdrqTabN3\n    \n    mov x7,#'D'                   // down\n    str x7,[x6,x5,lsl #3]         // store move\n    ldr x6,qAdrqTabN4\n    ldr x7,[x6,x12,lsl #3]\n    str x7,[x6,x5,lsl #3]         // N4 (n+1) = n4(n)\n    mov x0,x3\n    bl createGame                 // create copy game\n    ldrb w3,[x0,x1]               // and inversion box\n    ldrb w8,[x0,x2]\n    strb w8,[x0,x1]\n    strb w3,[x0,x2]\n    str x0,[x9,x5,lsl #3]         // store new game in table\n    lsr x1,x1,#2                  // line position empty case = N\u00b0/ 4\n    ldr x0,qAdrqTabNr\n    ldr x2,[x0,x4,lsl #3]         // load N\u00b0 line box moved\n    cmp x2,x1                     // compare\u00a0????\n    ble 1f\n    add x7,x7,#1                  // and increment\u00a0????\n    str x7,[x6,x5,lsl #3]\n1:\n    add x12,x12,#1                // increment N\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\nqAdrqTabNr:        .quad qTabNr\nqAdrqTabNc:        .quad qTabNc\n/******************************************************************/\n/*     empty case UP   see explain in english in function FI      */ \n/******************************************************************/\nfunctionFG:                      // INFO: functionFG\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    ldr x0,qAdrqTabN0\n    ldr x1,[x0,x12,lsl #3]       // case vide\n    sub x2,x1,#4                 // position case au dessus\n    ldr x3,[x9,x12,lsl #3]       // extrait jeu courant\n    ldrb w4,[x3,x2]              // extrait le contenu case au dessus\n    add x5,x12,#1                // N+1 = N\n    sub x8,x1,#4                 // nouvelle position case vide\n    str x8,[x0,x5,lsl #3]        // et on la stocke\n    ldr x6,qAdrqTabN3\n    mov x7,#'U'                  // puis on stocke le code mouvement\n    str x7,[x6,x5,lsl #3]\n    ldr x6,qAdrqTabN4\n    ldr x7,[x6,x12,lsl #3]\n    str x7,[x6,x5,lsl #3]        // N4 (N+1) = N4 (N)\n    mov x0,x3                    // jeu courant\n    bl createGame                // cr\u00e9ation nouveau jeu\n    ldrb w3,[x0,x1]              // et echange les 2 cases\n    ldrb w8,[x0,x2]\n    strb w8,[x0,x1]\n    strb w3,[x0,x2]\n    str x0,[x9,x5,lsl #3]        // stocke la nouvelle situation \n    lsr x1,x1,#2                 // ligne case vide = position /4\n    ldr x0,qAdrqTabNr\n    ldr x2,[x0,x4,lsl #3]        // extrait table \u00e0 la position case\n    cmp x2,x1                    // et comparaison\u00a0???\n    bge 1f\n    add x7,x7,#1                 // puis increment N4 de 1 \u00a0???\n    str x7,[x6,x5,lsl #3]\n1:\n    add x12,x12,#1               // increment de N\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*    empty case go right see explain finction FI ou FG en fran\u00e7ais */ \n/******************************************************************/\nfunctionFE:                       // INFO: functionFE\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    ldr x0,qAdrqTabN0\n    ldr x1,[x0,x12,lsl #3]\n    add x2,x1,#1\n    ldr x3,[x9,x12,lsl #3]\n    ldrb w4,[x3,x2]               // extrait le contenu case \n    add x5,x12,#1\n    add x8,x1,#1\n    str x8,[x0,x5,lsl #3]         // nouvelle case vide\n    ldr x6,qAdrqTabN3\n    mov x7,#'R'\n    str x7,[x6,x5,lsl #3]         // mouvement\n    ldr x6,qAdrqTabN4\n    ldr x7,[x6,x12,lsl #3]\n    str x7,[x6,x5,lsl #3]         // N4\u00a0??\n    mov x0,x3\n    bl createGame\n    ldrb w3,[x0,x1]               // exchange two boxes\n    ldrb w8,[x0,x2]\n    strb w8,[x0,x1]\n    strb w3,[x0,x2]\n    str x0,[x9,x5,lsl #3]         // stocke la nouvelle situation \n    lsr x3,x1,#2\n    sub x1,x1,x3,lsl #2\n    ldr x0,qAdrqTabNc\n    ldr x2,[x0,x4,lsl #3]         // extrait table \u00e0 la position case\n    cmp x2,x1\n    ble 1f\n    add x7,x7,#1\n    str x7,[x6,x5,lsl #3]\n1:\n    add x12,x12,#1\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*     empty box go left see explain function FI ou FG en fran\u00e7ais */ \n/******************************************************************/\nfunctionFL:                       // INFO: functionFL\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    ldr x0,qAdrqTabN0\n    ldr x1,[x0,x12,lsl #3]        // case vide\n    sub x2,x1,#1\n    ldr x3,[x9,x12,lsl #3]       // extrait jeu courant\n    ldrb w4,[x3,x2]              // extrait le contenu case \n    add x5,x12,#1\n    sub x8,x1,#1\n    str x8,[x0,x5,lsl #3]         // nouvelle case vide\n    ldr x6,qAdrqTabN3\n    mov x7,#'L'\n    str x7,[x6,x5,lsl #3]         // mouvement\n    ldr x6,qAdrqTabN4\n    ldr x7,[x6,x12,lsl #3]\n    str x7,[x6,x5,lsl #3]         // N4\u00a0??\n    mov x0,x3\n    bl createGame\n    ldrb w3,[x0,x1]               // exchange two boxes\n    ldrb w8,[x0,x2]\n    strb w8,[x0,x1]\n    strb w3,[x0,x2]\n    str x0,[x9,x5,lsl #3]         // stocke la nouvelle situation \n    lsr x3,x1,#2\n    sub x1,x1,x3,lsl #2           // compute remainder\n    ldr x0,qAdrqTabNc\n    ldr x2,[x0,x4,lsl #3]         // extrait table colonne \u00e0 la position case\n    cmp x2,x1\n    bge 1f\n    add x7,x7,#1\n    str x7,[x6,x5,lsl #3]\n1:\n    add x12,x12,#1\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*     create new Game                                            */ \n/******************************************************************/\n/* x0 contains box address            */\n/* x0 return address new game  */\ncreateGame:                          // INFO: createGame\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    mov x4,x0                    // save value\n    mov x0,#0                    // allocation place heap\n    mov x8,BRK                   // call system 'brk'\n    svc #0\n    cmp x0,#-1                   // allocation error\n    beq 99f\n    mov x5,x0                    // save address heap for output string\n    add x0,x0,#SIZE * SIZE       // reservation place one element\n    mov x8,BRK                   // call system 'brk'\n    svc #0\n    cmp x0,#-1                   // allocation error\n    beq 99f\n    mov x2,#0\n1:                               // loop copy boxes\n    ldrb w3,[x4,x2]\n    strb w3,[x5,x2]\n    add x2,x2,#1\n    cmp x2,#NBBOX\n    blt 1b\n    add x11,x11,#1\n    mov x0,x5\n    b 100f\n99:                              // error\n    ldr x0,qAdrszMessErreur\n    bl affichageMess\n100:\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*     read file                                                   */ \n/******************************************************************/\n/* x0 contains address stack begin           */\ntraitFic:                             // INFO: traitFic\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,fp,[sp,-16]!          // save  registres\n    mov fp,x0                         //  fp <- start address\n    ldr x4,[fp]                       // number of Command line arguments\n    cmp x4,#1\n    ble 99f\n    add x5,fp,#16                      // second parameter address \n    ldr x5,[x5]\n    ldr x0,qAdrqAdrFicName\n    str x5,[x0]\n    ldr x0,qAdrszMessTitre\n    bl affichageMess                  // display string\n    mov x0,x5\n    bl affichageMess \n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess                  // display carriage return\n\n    mov x0,AT_FDCWD\n    mov x1,x5                         // file name\n    mov x2,#O_RDWR                    // flags    \n    mov x3,#0                         // mode \n    mov x8, #OPEN                     // call system OPEN \n    svc 0 \n    cmp x0,#0                         // error\u00a0?\n    ble 99f\n    mov x7,x0                         // File Descriptor\n    ldr x1,qAdrsBuffer                // buffer address\n    mov x2,#TAILLEBUFFER              // buffer size\n    mov x8,#READ                      // read file\n    svc #0\n    cmp x0,#0                         // error\u00a0?\n    blt 99f\n    // extraction datas\n    ldr x1,qAdrsBuffer                // buffer address\n    add x1,x1,x0\n    mov x0,#0                         // store z\u00e9ro final\n    strb w0,[x1] \n    ldr x0,qAdrtbBox                   // game box address\n    ldr x1,qAdrsBuffer                // buffer address\n    bl extracDatas\n                                      // close file\n    mov x0,x7\n    mov x8, #CLOSE \n    svc 0 \n    mov x0,#0\n    b 100f\n99:                                   // error\n    ldr x0,qAdrszMessErreur           // error message\n    bl   affichageMess\n    mov x0,#-1\n100:\n    ldp x8,fp,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\nqAdrqAdrFicName:              .quad qAdrFicName\nqAdrszMessTitre:              .quad szMessTitre\nqAdrsBuffer:                  .quad sBuffer\n/******************************************************************/\n/*     extrac digit file buffer                                   */ \n/******************************************************************/\n/* x0 contains boxs address           */\n/* x1 contains buffer address         */\nextracDatas:                     // INFO: extracDatas\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    mov x7,x0\n    mov x6,x1\n    mov x2,#0                    // string buffer indice\n    mov x4,x1                    // start digit ascii\n    mov x5,#0                    // box index\n1:\n    ldrb w3,[x6,x2]\n    cmp x3,#0                    // datas end\u00a0?\n    beq 4f\n    cmp x3,#0xA                  // line end\u00a0?\n    beq 2f\n    cmp x3,#','                  // box end\u00a0?\n    beq 3f\n    add x2,x2,#1\n    b 1b\n2:\n    mov x3,#0\n    strb w3,[x6,x2]              // zero final\n    add x3,x2,#1                 // next character\n    ldrb w3,[x6,x3] \n    cmp x3,#0xD                  // line return \n    bne 21f\n    add x2,x2,#2                 // yes\n    b 4f\n21:\n    add x2,x2,#1\n    b 4f\n3:\n    mov x3,#0                    // zero final\n    strb w3,[x6,x2]\n    add x2,x2,#1\n4:  \n    mov x0,x4                    // conversion character ascii in integer\n    bl conversionAtoD\n    strb w0,[x7,x5]              // and store value on 1 byte box\n    cmp x0,#0                    // empty box\u00a0?\n    bne 5f\n    ldr x0,qAdrqTabN0\n    str x5,[x0]                  // empty box in item z\u00e9ro\n5:\n    add x5,x5,#1                 // increment counter boxes\n    cmp x5,#NBBOX                // number box = maxi\u00a0?\n    bge 100f \n    add x4,x6,x2                 // new start address digit ascii\n    b 1b\n100:\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*     control of the game solution                                      */ \n/******************************************************************/\n/* x0 contains boxs address           */\n/* x0 returns 0 if not possible       */\n/* x0 returns 1 if possible           */\ncontrolSolution:                 // INFO: controlSolution\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    mov x5,x0\n    ldr x8,qAdrqTabN0\n    ldr x8,[x8]                  // empty box\n    //mov x7,#0\n    cmp x8,#1\n    cset x7,eq\n    beq 1f\n    cmp x8,#3\n    cset x7,eq\n    beq 1f\n    cmp x8,#4\n    cset x7,eq\n    beq 1f\n    cmp x8,#6\n    cset x7,eq\n    beq 1f\n    cmp x8,#9\n    cset x7,eq\n    beq 1f\n    cmp x8,#11\n    cset x7,eq\n    beq 1f\n    cmp x8,#12\n    cset x7,eq\n    beq 1f\n    cmp x8,#14\n    cset x7,eq\n1:\n    mov x9,NBBOX - 1\n    sub x6,x9,x8\n    add x7,x7,x6\n                                 // count permutations\n    mov x1,#-1\n    mov x6,#0\n2:\n    add x1,x1,#1\n    cmp x1,#NBBOX\n    bge 80f\n    cmp x1,x8\n    beq 2b\n    ldrb w3,[x5,x1]\n    mov x2,x1\n3:\n    add x2,x2,#1\n    cmp x2,#NBBOX\n    bge 2b\n    cmp x2,x8\n    beq 3b\n    ldrb w4,[x5,x2]\n    cmp x4,x3\n    cinc x6,x6,lt\n    b 3b\n80:\n    add x6,x6,x7\n    tst x6,#1\n    cset x0,eq\n100:\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret    \n/******************************************************************/\n/*     game Ok\u00a0?                                      */ \n/******************************************************************/\n/* x0 contains boxs address           */\ngameOK:                          // INFO: gameOK\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    mov x2,#0\n    ldrb w3,[x0,x2]\n    cmp x3,#0\n    bne 0f\n    mov x3,#0xF\n0:\n    add x2,x2,#1\n1:\n    ldrb w4,[x0,x2]\n    cmp x4,#0\n    bne 11f\n    mov x3,#0xF\n11:\n    cmp x4,x3\n    ble 99f\n    mov x3,x4\n    add x2,x2,#1\n    cmp x2,#NBBOX -2\n    ble 1b\n    mov x0,#TRUE                  // game Ok\n    b 100f\n99:\n   mov  x0,#FALSE              // game not Ok\n100:\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*     display game                                       */ \n/******************************************************************/\n/* x0 contains boxs address           */\ndisplayGame:                            // INFO: displayGame\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    mov x4,x0\n    ldr x0,qAdrszMessTitre\n    bl affichageMess            // display titre\n    ldr x0,qAdrqAdrFicName\n    ldr x0,[x0]\n    bl affichageMess            // display string\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess            // display line return\n    mov x2,#0\n    ldr x1,qAdrsMessValeur\n1:\n    ldrb w0,[x4,x2]\n    cmp x0,#0\n    beq 3f\n    bl conversion10             // call conversion decimal\n    cmp x0,1\n    bne 2f\n    mov x0,#0x002020\n    str w0,[x1,#1]              // z\u00e9ro final\n    b 4f\n2:\n    mov x0,#0x20\n    str w0,[x1,#2]              // z\u00e9ro final\n    b 4f\n3:\n    ldr x0,iSpaces              // store spaces to empty case\n    str w0,[x1]\n4:\n    ldr x0,qAdrsMessResult\n    bl affichageMess            // display message\n    add x0,x2,#1\n    tst x0,#0b11\n    bne 5f\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess            // display message\n5:\n    add x2,x2,#1\n    cmp x2,#NBBOX - 1\n    ble 1b\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess            // display line return\n\n100:\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\niSpaces:                       .quad 0x00202020       // spaces\nqAdrszCarriageReturn:          .quad szCarriageReturn\nqAdrsMessValeur:               .quad sMessValeur\nqAdrsMessResult:               .quad sMessResult\n/********************************************************/\n/*        File Include fonctions                        */\n/********************************************************/\n/* for this file see task include a file in language AArch64 assembly */\n.include \"../includeARM64.inc\"",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_60.txt",
        "content": "let start = getTime()\nvar solver = initSolver([Value  0, 12,  9, 13,\n                               15, 11, 10, 14,\n                                3,  7,  2,  5,\n                                4,  8,  6,  1])\nsolver.run()\necho fmt\"Execution time: {(getTime() - start).toString}.\"\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_61.txt",
        "content": "Solution found with 80 moves: dddrurdruuulllddrulddrrruuullddruulldddrrurulldrruulldlddrurullddrrruullulddrdrr.\nExecution time: 3 hours 44 minutes 47 seconds 2 milliseconds.\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_62.txt",
        "content": "unit FifteenSolverT;\n\\\\ Solve 15 Puzzle. Nigel Galloway; February 1st., 2019.\ninterface\ntype TN=record n:UInt64; i,g,e,l:shortint; end;\ntype TG=record found:boolean; path:array[0..99] of TN; end;\nfunction solve15(const board : UInt64; const bPos:shortint; const d:shortint; const ng:shortint):TG;\nconst endPos:UInt64=$123456789abcdef0;\nimplementation\nconst N:array[0..15] of shortint=(3,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3);\nconst I:array[0..15] of shortint=(3,0,1,2,3,0,1,2,3,0,1,2,3,0,1,2);\nconst G:array[0..15] of shortint=(5,13,13,9,7,15,15,11,7,15,15,11,6,14,14,10);\nconst E:array[0..15] of shortint=(0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4);\nconst L:array[0..4 ] of shortint=(0,11,19,14,16);\nfunction solve15(const board:UInt64; const bPos:shortint; const d:shortint; const ng:shortint):TG;\nvar path:TG; P:^TN; Q:^TN; _g:shortint; _n:UInt64;\nbegin P:=@path.path; P^.n:=board; P^.i:=0; P^.g:=0; P^.e:=ng; P^.l:=bPos;\n  while true do begin\n    if P<@path.path then begin path.found:=false; exit(path); end;\n    if P^.n=endPos  then begin path.found:=true; exit(path); end;\n    if (P^.e=0) or (P^.i>d) then begin P-=1; continue; end else begin Q:=P+1; Q^.g:=E[P^.e]; end;\n    Q^.i:=P^.i; _g:=(L[Q^.g]-P^.l)*4; _n:=P^.n and (UInt64($F)<<_g);\n    case Q^.g of\n      1:begin Q^.l:=P^.l+4; Q^.e:=G[Q^.l]-2; P^.e-=1; Q^.n:=P^.n-_n+(_n<<16); if N[_n>>_g]>=(Q^.l div 4) then Q^.i+=1; end;\n      2:begin Q^.l:=P^.l-4; Q^.e:=G[Q^.l]-1; P^.e-=2; Q^.n:=P^.n-_n+(_n>>16); if N[_n>>_g]<=(Q^.l div 4) then Q^.i+=1; end;\n      3:begin Q^.l:=P^.l+1; Q^.e:=G[Q^.l]-8; P^.e-=4; Q^.n:=P^.n-_n+(_n<< 4); if I[_n>>_g]>=(Q^.l mod 4) then Q^.i+=1; end;\n      4:begin Q^.l:=P^.l-1; Q^.e:=G[Q^.l]-4; P^.e-=8; Q^.n:=P^.n-_n+(_n>> 4); if I[_n>>_g]<=(Q^.l mod 4) then Q^.i+=1; end;\n    end;\n    P+=1;\n  end;\nend;\nend.\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_63.txt",
        "content": "// Threaded use of 15 solver Unit. Nigel Galloway; February 1st., 2019.\nprogram testFifteenSolver;\nuses {$IFDEF UNIX}cthreads,{$ENDIF}sysutils,strutils,FifteenSolverT;\nvar Tz:array[0..5] of TThreadID; Tr:array[0..5] of TG; Tc:array[0..5] of shortint; Tw:array[0..5] of shortint;\nconst N:array[0..4 ] of string=('','d','u','r','l');\nconst G:array[0..15] of string=('41','841','841','81','421','8421','8421','821','421','8421','8421','821','42','842','842','82');\nvar ip:string; x,y:UInt64; P,Q:^TN; bPos,v,w,z,f:shortint; time1, time2: TDateTime; c:char;\nfunction T(a:pointer):ptrint;\nbegin\n  Tr[uint32(a)]:=solve15(x,bPos,Tw[uint32(a)],Tc[uint32(a)]);\n  if Tr[uint32(a)].found then f:=uint32(a);\n  T:=0;\nend;\nbegin\n  ReadLn(ip);\n  bPos:=Npos('0',ip,1)-1; w:=0; z:=0; f:=-1;\n  y:=(UInt64(Hex2Dec(ip[9..17]))<<32)>>32; x:=UInt64(Hex2Dec(ip[1..8]))<<32+y;\n  time1:=Now;\n  for w:=0 to $7f do begin\n    for c in G[bpos] do begin v:=z mod 6; Tc[v]:=integer(c)-48; Tw[v]:=w;\n      Tz[v]:=BeginThread(@T,pointer(v));\n      z+=1; if z>5 then waitforthreadterminate(Tz[z mod 6],$7fff);\n    end;\n    if f>=0 then break;\n  end;\n  for bpos:=0 to 5 do if Tw[bpos]>=Tw[f] then killthread(Tz[bpos]) else waitforthreadterminate(Tz[bpos],$7fff);\n  time2:=Now; WriteLn('Solution(s) found in ' +  FormatDateTime('hh.mm.ss.zzz', time2-time1) + ' seconds');\n  for bpos:=0 to 5 do if Tr[bpos].found then begin\n    P:=@Tr[bpos].path; repeat Q:=P; Write(N[Q^.g]); P+=1; until Q^.n=endpos; WriteLn();\n  end;\nend.\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_64.txt",
        "content": "fe169b4c0a73d852\nSolution(s) found in 00.00.00.423 seconds\nrrruldluuldrurdddluulurrrdlddruldluurddlulurruldrrdd\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_65.txt",
        "content": "0c9dfbae37254861\nSolution(s) found in 12.58.46.194 seconds\nrrrdldlluurrddluurrdlurdddllluurrdrdlluluurrdddluurddlluururdrddlluurrullldrrrdd\ndrrrdlluurrdddlluururddlurddlulldrrulluurrdrdllluurrdrdllldruururdddlluluurrrddd\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_66.txt",
        "content": "import planner.\n\nmain =>\n    init(InitS),\n    goal(GoalS),\n    best_plan((InitS,GoalS),Plan),\n    println(Plan).\n\ninit(InitS) =>\n    M = {{15, 14, 1,  6},\n         {9 , 11, 4, 12},\n         {0,  10, 7,  3},\n         {13,  8, 5,  2}},\n    InitS = [(R,C)\u00a0: T in 0..15, pos(M,T,R,C)].\n\ngoal(GoalS) =>\n    M = {{1,  2,  3,  4},\n         {5,  6,  7,  8},\n         {9, 10, 11, 12},\n         {13,14, 15,  0}},\n    GoalS = [(R,C)\u00a0: T in 0..15, pos(M,T,R,C)].         \n\npos(M,T,R,C) =>\n    N = len(M),\n    between(1,N,R),\n    between(1,N,C),\n    M[R,C] == T,!.\n    \nfinal((S,GoalS)) => S == GoalS.\n\naction((S,GoalS),NextS,Action,Cost) =>\n    S = [P0|Tiles],\n    P0 = (R0,C0),\n    Cost = 1,\n    (R1 = R0-1, R1 >= 1, C1 = C0, Action = u;\n     R1 = R0+1, R1 =< 4, C1 = C0, Action = d;\n     R1 = R0, C1 = C0-1, C1 >= 1, Action = l;\n     R1 = R0, C1 = C0+1, C1 =< 4, Action = r),\n    P1 = (R1,C1),\n    slide(P0,P1,Tiles,Tiles1),\n    S1 = [P1|Tiles1],\n    NextS = (S1,GoalS).\n\n% slide the tile at P1 to the empty square at P0\nslide(P0,P1,[P1|Tiles],Tiles1) =>\n    Tiles1 = [P0|Tiles].\nslide(P0,P1,[Tile|Tiles],Tiles1) =>\n    Tiles1=[Tile|Tiles1R],\n    slide(P0,P1,Tiles,Tiles1R).\n\n% called by the planner\nheuristic((S,GoalS)) = Dist =>\n    S = [_|Tiles],\n    GoalS = [_|FTiles],\n    Dist = sum([abs(R-FR)+abs(C-FC)\u00a0: \n                {(R,C),(FR,FC)} in zip(Tiles,FTiles)]).",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_67.txt",
        "content": "rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd  \n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_68.txt",
        "content": "use strict;\nno warnings;\n\nuse enum qw(False True);\nuse constant Nr => <3 0 0 0 0 1 1 1 1 2 2 2 2 3 3 3>;\nuse constant Nc => <3 0 1 2 3 0 1 2 3 0 1 2 3 0 1 2>;\n\nmy ($n, $m) = (0, 0);\nmy(@N0, @N2, @N3, @N4);\n\nsub fY {\n   printf \"Solution found in $n moves: %s\\n\", join('', @N3) and exit if $N2[$n] == 0x123456789abcdef0;\n   $N4[$n] <= $m ? fN() : False;\n}\n\nsub fN {\n   sub common { ++$n; return True if fY(); --$n }\n   if ($N3[$n] ne 'u' and int($N0[$n] / 4) < 3) { fI(); common() }\n   if ($N3[$n] ne 'd' and int($N0[$n] / 4) > 0) { fG(); common() }\n   if ($N3[$n] ne 'l' and    ($N0[$n] % 4) < 3) { fE(); common() }\n   if ($N3[$n] ne 'r' and    ($N0[$n] % 4) > 0) { fL(); common() }\n   return False;\n}\n\nsub fI {\n   my $g = (11-$N0[$n])*4;\n   my $a = $N2[$n] & (15 << $g);\n   $N0[$n+1] = $N0[$n]+4;\n   $N2[$n+1] = $N2[$n]-$a+($a<<16);\n   $N4[$n+1] = $N4[$n]+((Nr)[$a>>$g] <= int($N0[$n] / 4) ? 0 : 1);\n   $N3[$n+1] = 'd';\n}\n\nsub fG {\n   my $g = (19-$N0[$n])*4;\n   my $a = $N2[$n] & (15 << $g);\n   $N0[$n+1] = $N0[$n]-4;\n   $N2[$n+1] = $N2[$n]-$a+($a>>16);\n   $N4[$n+1] = $N4[$n]+((Nr)[$a>>$g] >= int($N0[$n] / 4) ? 0 : 1);\n   $N3[$n+1] = 'u';\n}\n\nsub fE {\n   my $g = (14-$N0[$n])*4;\n   my $a = $N2[$n] & (15 << $g);\n   $N0[$n+1] = $N0[$n]+1;\n   $N2[$n+1] = $N2[$n]-$a+($a<<4);\n   $N4[$n+1] = $N4[$n]+((Nc)[$a>>$g] <= $N0[$n]%4 ? 0 : 1);\n   $N3[$n+1] = 'r';\n}\n\nsub fL {\n   my $g = (16-$N0[$n])*4;\n   my $a = $N2[$n] & (15 << $g);\n   $N0[$n+1] = $N0[$n]-1;\n   $N2[$n+1] = $N2[$n]-$a+($a>>4);\n   $N4[$n+1] = $N4[$n]+((Nc)[$a>>$g] >= $N0[$n]%4 ? 0 : 1);\n   $N3[$n+1] = 'l';\n}\n\n($N0[0], $N2[0]) = (8, 0xfe169b4c0a73d852); # initial state\nwhile () { fY() or ++$m }\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_69.txt",
        "content": "Solution found in 52 moves: rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_7.txt",
        "content": "File name\u00a0: casR1.txt\nFile name\u00a0: casR1.txt\n 15  14  1   6\n 9   11  4   12\n     10  7   3\n 13  8   5   2\n\nFile name\u00a0: casR1.txt\n 1   2   3   4\n 5   6   7   8\n 9   10  11  12\n 13  14  15\n\nSolution in 52 moves\u00a0:\nRRRULDDLUUULDRURDDDRULLULURRRDDLDLUURDDLULURRULDRDRD\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_70.txt",
        "content": "-- demo\\rosetta\\Solve15puzzle.exw\nconstant STM = 0    -- single-tile metrics.\nconstant MTM = 0    -- multi-tile metrics.\nif STM and MTM then ?9/0 end if -- both prohibited\n--  0       0   -- fastest, but non-optimal\n--  1       0   -- optimal in STM\n--  0       1   -- optimal in MTM (slowest by far)\n \n--Note: The fast method uses an inadmissible heuristic - see \"not STM\" in iddfs().\n--      It explores mtm-style using the higher stm heuristic and may therefore \n--      fail badly in some cases.\n \nconstant SIZE = 4\n \nconstant goal = { 1, 2, 3, 4,\n                  5, 6, 7, 8,\n                  9,10,11,12,\n                 13,14,15, 0}\n \n--\n-- multi-tile-metric walking distance heuristic lookup (mmwd).\n-- ==========================================================\n-- Uses patterns of counts of tiles in/from row/col, eg the solved state \n--  (ie goal above) could be represented by the following:\n--      {{4,0,0,0},\n--       {0,4,0,0},\n--       {0,0,4,0},\n--       {0,0,0,3}}\n--  ie row/col 1 contains 4 tiles from col/row 1, etc. In this case\n--  both are identical, but you can count row/col or col/row, and then\n--  add them together. There are up to 24964 possible patterns. The\n--  blank space is not counted. Note that a vertical move cannot change\n--  a vertical pattern, ditto horizontal, and basic symmetry means that\n--  row/col and col/row patterns will match (at least, that is, if they \n--  are calculated sympathetically), halving the setup cost.\n-- The data is just the number of moves made before this pattern was\n--  first encountered, in a breadth-first search, backwards from the\n--  goal state, until all patterns have been enumerated.\n-- (The same ideas/vars are now also used for stm metrics when MTM=0)\n--\nsequence wdkey              -- one such 4x4 pattern\nconstant mmwd = new_dict()  -- lookup table, data is walking distance.\n \n \n--\n-- We use two to-do lists: todo is the current list, and everything\n-- of walkingdistance+1 ends up on tdnx. Once todo is exhausted, we\n-- swap the dictionary-ids, so tdnx automatically becomes empty.\n-- Key is an mmwd pattern as above, and data is {distance,space_idx}.\n--\ninteger todo = new_dict()\ninteger tdnx = new_dict()\n \n--\n \nenum UP = 1, DOWN = -1\n \nprocedure explore(integer space_idx, walking_distance, direction)\n--\n--  Given a space index, explore all the possible moves in direction,\n--  setting the distance and extending the tdnx table.\n--\ninteger tile_idx = space_idx+direction\n    for group=1 to SIZE do\n        if wdkey[tile_idx][group] then\n            -- ie: check row tile_idx for tiles belonging to rows 1..4\n            -- Swap one of those tiles with the space\n            wdkey[tile_idx][group] -= 1\n            wdkey[space_idx][group] += 1\n \n            if getd_index(wdkey,mmwd)=0 then\n                -- save the walking distance value\n                setd(wdkey,walking_distance+1,mmwd)\n                -- and add to the todo next list:\n                if getd_index(wdkey,tdnx)!=0 then ?9/0 end if\n                setd(wdkey,{walking_distance+1,tile_idx},tdnx)\n            end if\n \nif MTM then\n            if tile_idx>1 and tile_idx<SIZE then\n                -- mtm: same direction means same distance:\n                explore(tile_idx, walking_distance, direction)\n            end if\nend if\n \n            -- Revert the swap so we can look at the next candidate.\n            wdkey[tile_idx][group] += 1\n            wdkey[space_idx][group] -= 1\n        end if\n    end for\nend procedure\n \nprocedure generate_mmwd()\n-- Perform a breadth-first search begining with the solved puzzle state \n--  and exploring from there until no more new patterns emerge.\ninteger walking_distance = 0, space = 4\n \n    wdkey = {{4,0,0,0}, -- \\\n             {0,4,0,0}, --  } 4 tiles in correct row positions\n             {0,0,4,0}, -- /\n             {0,0,0,3}} --    3 tiles in correct row position\n    setd(wdkey,walking_distance,mmwd)\n    while 1 do\n        if space<4 then explore(space, walking_distance, UP)    end if\n        if space>1 then explore(space, walking_distance, DOWN) end if\n        if dict_size(todo)=0 then\n            if dict_size(tdnx)=0 then exit end if\n            {todo,tdnx} = {tdnx,todo}\n        end if\n        wdkey = getd_partial_key(0,todo)\n        {walking_distance,space} = getd(wdkey,todo)\n        deld(wdkey,todo)\n    end while\nend procedure\n \nfunction walking_distance(sequence puzzle)\nsequence rkey = repeat(repeat(0,SIZE),SIZE),\n         ckey = repeat(repeat(0,SIZE),SIZE)\n    integer k = 1\n    for i=1 to SIZE do  -- rows\n        for j=1 to SIZE do  -- columns\n            integer tile = puzzle[k]\n            if tile!=0 then\n                integer row = floor((tile-1)/4)+1,\n                        col = mod(tile-1,4)+1\n                rkey[i][row] += 1\n                ckey[j][col] += 1\n            end if\n            k += 1\n        end for\n    end for\n    if getd_index(rkey,mmwd)=0\n    or getd_index(ckey,mmwd)=0 then\n        ?9/0 -- sanity check\n    end if\n    integer rwd = getd(rkey,mmwd),\n            cwd = getd(ckey,mmwd)\n    return rwd+cwd\nend function\n \nsequence puzzle\nstring res = \"\"\natom t0 = time(),\n     t1 = time()+1\natom tries = 0\n \nconstant ok = {{0,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1},   -- left\n               {0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},   -- up\n               {1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0},   -- down\n               {1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,0}}   -- right\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_71.txt",
        "content": "function iddfs(integer step, lim, space, prevmv)\n    if time()>t1 then\n        printf(1,\"working... (depth=%d, tries=%d, time=%3ds)\\r\",{lim,tries,time()-t0})\n        t1 = time()+1\n    end if\n    tries += 1\n    integer d = iff(step==lim?0:walking_distance(puzzle))\n    if d=0 then\n \n        return (puzzle==goal)\n \n    elsif step+d<=lim then\n \n        for mv=1 to 4 do -- l/u/d/r\n            if prevmv!=(5-mv) -- not l after r or vice versa, ditto u/d\n            and ok[mv][space] then\n                integer nspace = space+{-1,-4,+4,+1}[mv]\n                integer tile = puzzle[nspace]\n                if puzzle[space]!=0 then ?9/0 end if    -- sanity check     \n                puzzle[space] = tile\n                puzzle[nspace] = 0\n                if iddfs(step+iff(MTM or not STM?(prevmv!=mv):1),lim,nspace,mv) then\n                    res &= \"ludr\"[mv]\n                    return true\n                end if\n                puzzle[nspace] = tile\n                puzzle[space] = 0\n            end if\n        end for\n    end if\n    return false\nend function\n \nfunction pack(string s)\ninteger n = length(s), n0 = n\n    for i=1 to 4 do\n        integer ch = \"lrud\"[i], k\n        while 1 do\n            k = match(repeat(ch,3),s)\n            if k=0 then exit end if\n            s[k+1..k+2] = \"3\"\n            n -= 2\n        end while\n        while 1 do\n            k = match(repeat(ch,2),s)\n            if k=0 then exit end if\n            s[k+1] = '2'\n            n -= 1\n        end while\n    end for\n    return {n,iff(MTM?sprintf(\"%d\",n):sprintf(\"%d(%d)\",{n,n0})),s}\nend function\n \nprocedure apply_moves(string moves, integer space)\ninteger move, ch, nspace\n    puzzle[space] = 0\n    for i=1 to length(moves) do\n        ch = moves[i]\n        if ch>'3' then\n            move = find(ch,\"ulrd\")\n        end if\n        -- (hint: \"r\" -> the 'r' does 1\n        --        \"r2\" -> the 'r' does 1, the '2' does 1\n        --        \"r3\" -> the 'r' does 1, the '3' does 2!)\n        for j=1 to 1+(ch='3') do\n            nspace = space+{-4,-1,+1,4}[move]\n            puzzle[space] = puzzle[nspace]\n            space = nspace\n            puzzle[nspace] = 0\n        end for\n    end for\nend procedure\n \nfunction solvable(sequence board)\ninteger n = length(board)\nsequence positions = repeat(0,n)\n    -- prepare the mapping from each tile to its position\n    board[find(0,board)] = n\n    for i=1 to n do\n        positions[board[i]] = i\n    end for\n \n    -- check whether this is an even or odd state\n    integer row = floor((positions[16]-1)/4),\n            col = (positions[16]-1)-row*4\n    bool even_state = (positions[16]==16) or (mod(row,2)==mod(col,2))\n \n    -- count the even cycles\n    integer even_count = 0\n    sequence visited = repeat(false,16)\n    for i=1 to n do\n        if not visited[i] then\n            -- a new cycle starts at i. Count its length..\n            integer cycle_length = 0,\n                    next_tile = i\n            while not visited[next_tile] do\n                cycle_length +=1\n                visited[next_tile] = true\n                next_tile = positions[next_tile]\n            end while\n            even_count += (mod(cycle_length,2)==0)\n        end if\n    end for\n    return even_state == (mod(even_count,2)==0)\nend function\n \nprocedure main()\n \n    puzzle = {15,14, 1, 6, \n               9,11, 4,12,\n               0,10, 7, 3, \n              13, 8, 5, 2}\n \n    if not solvable(puzzle) then\n        ?puzzle\n        printf(1,\"puzzle is not solveable\\n\")\n    else\n \n        generate_mmwd()\n \n        sequence original = puzzle\n        integer space = find(0,puzzle)\n \n        for lim=walking_distance(puzzle) to iff(MTM?43:80) do\n            if iddfs(0, lim, space, '-') then exit end if\n        end for\n \n        {integer n, string ns, string ans} = pack(reverse(res))\n \n        printf(1,\"\\n\\noriginal:\")\n        ?original\n        atom t = time()-t0\n        printf(1,\"\\n%soptimal solution of %s moves found in %s: %s\\n\\nresult: \",\n                 {iff(MTM?\"mtm-\":iff(STM?\"stm-\":\"non-\")),ns,elapsed(t),ans})\n        puzzle = original\n        apply_moves(ans,space)\n        ?puzzle\n    end if\nend procedure\nmain()\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_72.txt",
        "content": "original:{15,14,1,6,9,11,4,12,0,10,7,3,13,8,5,2}\nnon-optimal solution of 35(60) moves found in 2.42s: u2r2d3ru2ld2ru3ld3l2u3r2d2l2dru2ldru2rd3lulur3dl2ur2d2\nstm-optimal solution of 38(52) moves found in 1 minute and 54s: r3uldlu2ldrurd3lu2lur3dld2ruldlu2rd2lulur2uldr2d2\nmtm-optimal solution of 31(60) moves found in 2 hours, 38 minutes and 28s: u2r2d3ru2ld2ru3ld3l2u3r2d2l2dru3rd3l2u2r3dl3dru2r2d2\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_73.txt",
        "content": "let all moves which do not increase the manhattan cost be regarded as \"free\".\n   -- (if you can solve in mc, clearly it is an optimal solution)\nlet n=0\nwhile (not solveable_with_at_most_n_non_free_moves(n)) n++\n   -- (clearly optimal by exhaustively disproving all lesser n)\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_74.txt",
        "content": "-- demo/rosetta/Solve15puzzle_simple.exw\nenum left, down, up, right  -- (nb 5-move flips it, as in down===5-up, etc)\n \nconstant valid_moves = {{ 0, 0, 5, 2}, { 1, 0, 6, 3}, { 2, 0, 7, 4}, { 3, 0, 8, 0},\n                        { 0, 1, 9, 6}, { 5, 2,10, 7}, { 6, 3,11, 8}, { 7, 4,12, 0},\n                        { 0, 5,13,10}, { 9, 6,14,11}, {10, 7,15,12}, {11, 8,16, 0},\n                        { 0, 9, 0,14}, {13,10, 0,15}, {14,11, 0,16}, {15,12, 0, 0}}\n \nconstant zero_cost = {{0b000000000000000,0b000000000000000,0b000000000001111,0b001000100010001},\n                      {0b110111011101110,0b000000000000000,0b000000000001111,0b011001100110011},\n                      {0b100110011001100,0b000000000000000,0b000000000001111,0b111011101110111},\n                      {0b000100010001000,0b000000000000000,0b000000000001111,0b000000000000000},\n                      {0b000000000000000,0b111111111110000,0b000000011111111,0b001000100010001},\n                      {0b110111011101110,0b111111111110000,0b000000011111111,0b011001100110011},\n                      {0b100110011001100,0b111111111110000,0b000000011111111,0b111011101110111},\n                      {0b000100010001000,0b111111111110000,0b000000011111111,0b000000000000000},\n                      {0b000000000000000,0b111111100000000,0b000111111111111,0b001000100010001},\n                      {0b110111011101110,0b111111100000000,0b000111111111111,0b011001100110011},\n                      {0b100110011001100,0b111111100000000,0b000111111111111,0b111011101110111},\n                      {0b000100010001000,0b111111100000000,0b000111111111111,0b000000000000000},\n                      {0b000000000000000,0b111000000000000,0b000000000000000,0b001000100010001},\n                      {0b110111011101110,0b111000000000000,0b000000000000000,0b011001100110011},\n                      {0b100110011001100,0b111000000000000,0b000000000000000,0b111011101110111},\n                      {0b000100010001000,0b111000000000000,0b000000000000000,0b000000000000000}}\n \nconstant masks      = {0b000000000000001,0b000000000000010,0b000000000000100,0b000000000001000,\n                       0b000000000010000,0b000000000100000,0b000000001000000,0b000000010000000,\n                       0b000000100000000,0b000001000000000,0b000010000000000,0b000100000000000,\n                       0b001000000000000,0b010000000000000,0b100000000000000}\n \n-- Or, if you prefer to build those with code (but I really wanted to show the above bitmasks):\n--/*\nsequence valid_moves = repeat(repeat(0,4),16),\n         zero_cost   = repeat(repeat(0,4),16)\nconstant masks = sq_power(2,tagset(14,0))\nfor square=1 to 16 do\n    integer s_row = floor((square+3)/4),\n            s_col = remainder((square-1),4)+1\n    for move=left to right do -- (via up/down)\n        if (move=left  and s_col>1)\n        or (move=down  and s_row>1)\n        or (move=up    and s_row<4)\n        or (move=right and s_col<4) then\n            integer origin = square+{-1,-4,+4,+1}[move],\n                    o_row = floor((origin+3)/4),\n                    o_col = remainder((origin-1),4)+1\n            valid_moves[square][move] = origin\n            for piece=1 to 15 do -- (aka target)\n                integer t_row = floor((piece+3)/4),\n                        t_col = remainder((piece-1),4)+1,\n                        p_md = abs(t_row-o_row)+abs(t_col-o_col),\n                        n_md = abs(t_row-s_row)+abs(t_col-s_col)\n                if n_md<=p_md then\n                    zero_cost[square][move] += masks[piece]\n                end if\n            end for\n        end if\n    end for\nend for\n--pp(valid_moves,{pp_IntFmt,\"%2d\",pp_Maxlen,70})\n--pp(zero_cost,{pp_IntFmt,\"%015b\"})\n--pp(masks,{pp_IntFmt,\"%015b\",pp_IntCh,false})\n--*/\nif up or down then end if -- (suppress unused warnings, since the above commented out)\n \nstring moves = \"\"\nsequence board = {15,14, 1, 6, \n                   9,11, 4,12,\n                   0,10, 7, 3, \n                  13, 8, 5, 2}\ninteger space = 9\n \nconstant goal = { 1, 2, 3, 4,\n                  5, 6, 7, 8,\n                  9,10,11,12,\n                 13,14,15, 0}\n \natom t1 = time()+1\n \nfunction solve(integer nfree, space, mdx=1, skip_move=0)\n--\n-- nfree is the number of non-free moves we can yet make\n-- space is the location of the space (duh), [1..16] \n-- mdx is just the move index for building the solution\n-- skip_move significantly narrows search space (1000 or \n--  more times faster, believe it or not, simply by not \n--  allowing the immediate undoing of the last move)\n--\n    for move=left to right do -- (via up/down)\n        integer new_space = valid_moves[space][move]\n        if move!=skip_move and new_space then\n            integer piece = board[new_space],\n                    zcsmv = zero_cost[space][move],\n                    maskp = masks[piece],\n                    zcost = (and_bits(zcsmv,maskp)=0) -- (0==free, 1==not)\n            if nfree>=zcost then\n                if mdx>length(moves) then moves &= '?' end if\n--              moves[mdx] = \"ludr\"[move]\n                moves[mdx] = \"ludrLUDR\"[move+zcost*4]\n                board[space] = piece\n                board[new_space] = 0\n                if time()>t1 then\n                    printf(1,\"%s\\r\",{moves})\n                    t1 = time()+1\n                end if\n                if space=piece and board=goal then\n                    moves = moves[1..mdx] -- (trim)\n                    return true\n                end if\n                if solve(nfree-zcost,new_space,mdx+1,5-move) then\n                    return true\n                end if\n                board[new_space] = piece\n                board[space] = 0\n            end if\n        end if\n    end for\n    return false\nend function\n \npp(board,{pp_IntFmt,\"%2d\",pp_Maxlen,17})\n \natom t0 = time()\ninteger n = 0\nwhile not solve(n,space) do n += 1 end while\nprintf(1,\"solution of %d moves found in %s: %s\\n\",\n         {length(moves),elapsed(time()-t0),moves})\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_75.txt",
        "content": "{15,14, 1, 6,\n  9,11, 4,12,\n  0,10, 7, 3,\n 13, 8, 5, 2}\nsolution of 52 moves found in 8.5s: RRruldluulDRurdddlUulurRrdLddrUldluurddlulurruldrrdd\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_76.txt",
        "content": "' The program solve fe169b4c0a73d852 in 4-5 seconds (on Intel Core i7-3770 3.40 GHz, 16 GB RAM, Windows 10 Pro).\n' Test not completed with 0c9dfbae37254861 (still running after about 4 hours).\n' Most of initialization is done in procedure fifteenSolver(), so it's possible to call it many times from the main function.\n' No need to pass to fifteenSolver() the initial position of 0; the procedure determines it.\n' Program includes procedure to create new configurations (by shuffling the correct final configuration).\n' Program also includes a simple (text only) optional visualization of solving moves; the second (optional) parameter of fifteenSolver() is the pause between each move (in milliseconds).\n'\n' PowerBASIC compilers (both PBCC and PBWin) are 32 bits and are not that efficient when dealing with 64 bit integers (quad, only signed);\n' this is not a problem for additions and subtractions, but left/right shift are quite slow;\n' to speed up execution, left/right shift are done by inline X86 assembler (the PB statement is commented).\n\n#compiler pbcc\n#dim all\n\nglobal Nr() as long\nglobal Nc() as long\nglobal n as long\nglobal nn as long ' variable name _n not allowed\nglobal N0() as long\nglobal N3() as long\nglobal N4() as long\nglobal N2() as quad\n\n%Ki=1\n%Ke=2\n%Kl=4\n%Kg=8\n\n%l=108 ' l\n%r=114 ' r\n%u=117 ' u\n%d=100 ' d\n\nfunction fY() as long\n   if N2(n) = &h123456789abcdef0 then\n      function=1\n      exit function\n   end if\n   if N4(n) <= nn then\n      function = fN()\n      exit function\n   end if\n   function = 0\nend function\n\nfunction fZ(byval w as long) as long\n   if (w and %Ki) > 0 then\n      call fI()\n      if fY() then\n         function = 1\n         exit function\n      end if\n      decr n\n   end if\n   if (w and %Kg) > 0 then\n      call fG()\n      if fY() then\n         function = 1\n         exit function\n      end if\n      decr n\n   end if\n   if (w and %Ke) > 0 then\n      call fE()\n      if fY() then\n         function = 1\n         exit function\n      end if\n      decr n\n   end if\n   if (w and %Kl) > 0 then\n      call fL()\n      if fY() then\n         function = 1\n         exit function\n      end if\n      decr n\n   end if\n   function = 0\nend function\n\nfunction fN() as long\n   select case N0(n)\n      case 0\n         select case N3(n)\n            case %l\n               function = fZ(%Ki)\n               exit function\n            case %u\n               function = fZ(%Ke)\n               exit function\n            case else\n               function = fZ(%Ki + %Ke)\n               exit function\n         end select\n      case 3\n         select case N3(n)\n            case %r\n               function = fZ(%Ki)\n               exit function\n            case %u\n               function = fZ(%Kl)\n               exit function\n            case else\n               function = fZ(%Ki + %Kl)\n               exit function\n         end select\n      case 1, 2\n         select case N3(n)\n            case %l\n               function = fZ(%Ki + %Kl)\n               exit function\n            case %r\n               function = fZ(%Ki + %Ke)\n               exit function\n            case %u\n               function = fZ(%Ke + %Kl)\n               exit function\n            case else\n               function = fZ(%Kl + %Ke + %Ki)\n               exit function\n         end select\n      case 12\n         select case N3(n)\n            case %l\n               function = fZ(%Kg)\n               exit function\n            case %d\n               function = fZ(%Ke)\n               exit function\n            case else\n               function = fZ(%Ke + %Kg)\n               exit function\n         end select\n      case 15\n         select case N3(n)\n            case %r\n               function = fZ(%Kg)\n               exit function\n            case %d\n               function = fZ(%Kl)\n               exit function\n            case else\n               function = fZ(%Kg + %Kl)\n               exit function\n         end select\n      case 13, 14\n         select case N3(n)\n            case %l\n               function = fZ(%Kg + %Kl)\n               exit function\n            case %r\n               function = fZ(%Ke + %Kg)\n               exit function\n            case %d\n               function = fZ(%Ke + %Kl)\n               exit function\n            case else\n               function = fZ(%Kg + %Ke + %Kl)\n               exit function\n         end select\n      case 4, 8\n         select case N3(n)\n            case %l\n               function = fZ(%Ki + %Kg)\n               exit function\n            case %u\n               function = fZ(%Kg + %Ke)\n               exit function\n            case %d\n               function = fZ(%Ki + %Ke)\n               exit function\n            case else\n               function = fZ(%Ki + %Kg + %Ke)\n               exit function\n         end select\n      case 7, 11\n         select case N3(n)\n            case %d\n               function = fZ(%Ki + %Kl)\n               exit function\n            case %u\n               function = fZ(%Kg + %Kl)\n               exit function\n            case %r\n               function = fZ(%Ki + %Kg)\n               exit function\n            case else\n               function = fZ(%Ki + %Kg + %Kl)\n               exit function\n         end select\n      case else\n         select case N3(n)\n            case %d\n               function = fZ(%Ki + %Ke + %Kl)\n               exit function\n            case %l\n               function = fZ(%Ki + %Kg + %Kl)\n               exit function\n            case %r\n               function = fZ(%Ki + %Kg + %Ke)\n               exit function\n            case %u\n               function = fZ(%Kg + %Ke + %Kl)\n               exit function\n            case else\n               function = fZ(%Ki + %Kg + %Ke + %Kl)\n               exit function\n         end select\n   end select\nend function\n\nsub fI()\n   local g as long\n   local a as quad\n   g = (11 - N0(n)) * 4\n   a = (N2(n) and lshift(15,g))\n   N0(n + 1) = N0(n) + 4\n   N2(n + 1) = N2(n) - a + lshift(a, 16)\n   N3(n + 1) = %d\n   N4(n + 1) = N4(n)\n   if isfalse(Nr(rshift(a,g)) <= N0(n)\\4) then\n      incr N4(n + 1)\n   end if\n   incr n\nend sub\n\nsub fG()\n   local g as long\n   local a as quad\n   g = (19 - N0(n)) * 4\n   a = (N2(n) and lshift(15,g))\n   N0(n + 1) = N0(n) - 4\n   N2(n + 1) = N2(n) - a + rshift(a, 16)\n   N3(n + 1) = %u\n   N4(n + 1) = N4(n)\n   if isfalse(Nr(rshift(a,g)) >= N0(n)\\4) then\n      incr N4(n + 1)\n   end if\n   incr n\nend sub\n\nsub fE()\n   local g as long\n   local a as quad\n   g = (14 - N0(n)) * 4\n   a = (N2(n) and lshift(15,g))\n   N0(n + 1) = N0(n) + 1\n   N2(n + 1) = N2(n) - a + lshift(a,4)\n   N3(n + 1) = %r\n   N4(n + 1) = N4(n)\n   if isfalse(Nc(rshift(a,g)) <= (N0(n) mod 4)) then\n      incr N4(n + 1)\n   end if\n   incr n\nend sub\n\nsub fL()\n   local g as long\n   local a as quad\n   g = (16 - N0(n)) * 4\n   a = (N2(n) and lshift(15,g))\n   N0(n + 1) = N0(n) - 1\n   N2(n + 1) = N2(n) - a + rshift(a,4)\n   N3(n + 1) = %l\n   N4(n + 1) = N4(n)\n   if isfalse(Nc(rshift(a,g)) >= (N0(n) mod 4)) then\n      incr N4(n + 1)\n   end if\n   incr n\nend sub\n\nfunction lshift(byval v as quad, byval s as dword) as quad\n   'shift left v, s\n   ' inline assembler shift is much faster\n   !mov edx,v[4]\n   !mov eax,v\n   !mov ecx,s\n   !shld edx,eax,cl\n   !shl eax,cl\n   !test ecx,32\n   !jz skip\n   !mov edx,eax\n   !xor eax,eax\n   skip:\n   !mov v[4],edx\n   !mov v,eax\n   function = v\nend function\n\nfunction rshift(byval v as quad, byval s as dword) as quad\n   'shift right v, s\n   ' inline assembler shift is much faster\n   !mov edx,v[4]\n   !mov eax,v\n   !mov ecx,s\n   !shrd eax,edx,cl\n   !shr edx,cl\n   !test ecx,32\n   !jz skip\n   !mov eax,edx\n   !xor edx,edx\n   skip:\n   !mov v[4],edx\n   !mov v,eax\n   function = v\nend function\n\nsub fifteenSolver(byval g as quad, optional byval p as long)\n   local h as string\n   local j as long\n   local s as string\n   local t as single\n   t=timer\n   redim Nr(0 to 15)\n   redim Nc(0 to 15)\n   redim N0(0 to 99)\n   redim N3(0 to 100)\n   redim N4(0 to 99)\n   redim N2(0 to 99)\n   array assign Nr()=3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3\n   array assign Nc()=3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2\n   n = 0\n   nn = 0\n   h = hex$(g, 16)\n   cls\n   print \"Puzzle: \";lcase$(h)\n   call ShowConfiguration(h, 2)\n   print\n   print\n   N0(0) = instr(h, \"0\") - 1\n   N2(0) = g\n   call solve()\n   print using$(\"Solution found in #### moves: \", n);\n   for j = 1 to n\n      s = s + chr$(N3(j))\n   next\n   print s\n   print \"Time = \";format$(timer-t, \"#####.########\");\" seconds\"\n   if p then\n      call showMoves(h, s, n, p)\n   end if\nend sub\n\nsub solve()\n   if fN() then\n      exit sub\n   else\n      n = 0\n      incr nn\n      call solve()\n   end if\nend sub\n\nfunction createPuzzle(byval j as long) as quad\n   local q as quad\n   local h as string\n   local z as long\n   local d as long\n   local r as long\n   local u as long\n   randomize timer\n   q=&h123456789abcdef0\n   h = hex$(q, 16)\n   u = 0\n   while j > 0 ' number of moves to do\n      do\n         d = rnd(1, 4) ' -1 +1 -4 +4\n      loop while d = u\n      u = -d\n      r = rnd(1, 3) ' repetitions\n      while r\n         z = instr(h, \"0\")\n         select case d\n            case 1 ' -1\n               if (z mod 4) <> 1 then\n                  mid$(h, z, 1) = mid$(h, z - 1, 1)\n                  mid$(h, z - 1, 1) = \"0\"\n                  decr j\n               end if\n            case 2 ' +1\n               if (z mod 4) <> 0 then\n                  mid$(h, z , 1) = mid$(h, z + 1, 1)\n                  mid$(h, z + 1, 1) = \"0\"\n                  decr j\n               end if\n            case 3 ' -4\n               if z >= 5 then\n                  mid$(h, z, 1) = mid$(h, z - 4, 1)\n                  mid$(h, z - 4, 1) = \"0\"\n                  decr j\n               end if\n            case 4 ' +4\n               if z <= 12 then\n                  mid$(h, z , 1) = mid$(h, z + 4, 1)\n                  mid$(h, z + 4, 1) = \"0\"\n                  decr j\n               end if\n         end select\n         decr r\n      wend\n   wend\n   function = val(\"&h\"+h)\nend function\n\nsub shoWMoves(byval h as string, byval s as string, byval m as long, byval p as long)\n   local j as long\n   local z as long\n   local d as long\n   cursor off\n   call ShowConfiguration(h, 12)\n   for j = 1 to m\n      d = asc(mid$(s, j, 1))\n      z = instr(h, \"0\")\n      select case d\n         case %l\n            if (z mod 4) <> 1 then\n               mid$(h, z, 1) = mid$(h, z - 1, 1)\n               mid$(h, z - 1, 1) = \"0\"\n            end if\n         case %r\n            if (z mod 4) <> 0 then\n               mid$(h, z , 1) = mid$(h, z + 1, 1)\n               mid$(h, z + 1, 1) = \"0\"\n            end if\n         case %u\n            if z >= 5 then\n               mid$(h, z, 1) = mid$(h, z - 4, 1)\n               mid$(h, z - 4, 1) = \"0\"\n            end if\n         case %d\n            if z <= 12 then\n               mid$(h, z , 1) = mid$(h, z + 4, 1)\n               mid$(h, z + 4, 1) = \"0\"\n            end if\n      end select\n      call ShowConfiguration(h, 12)\n      sleep p\n   next\n   locate 20,1\n   print \"Press any key ...\"\n   cursor on\n   waitkey$\n   cls\nend sub\n\nsub ShowConfiguration(byval h as string, i as long)\n   local r as long\n   local c as long\n   local x as string\n   for r = 1 to 4\n      for c = 1 to 4\n         locate r + i, c + c - 1\n         x = mid$(h, r * 4 - 4 + c, 1)\n         if x = \"0\" then\n            x = \" \"\n         end if\n         print x;\n      next\n   next\nend sub\n\nfunction PBMain() as long\n   call fifteenSolver(&hfe169b4c0a73d852, 1000)\n  'call fifteenSolver(createPuzzle(100), 1000)\n  'call fifteenSolver(&h0c9dfbae37254861, 1000)\nend function",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_77.txt",
        "content": "import random\n\n\nclass IDAStar:\n    def __init__(self, h, neighbours):\n        \"\"\" Iterative-deepening A* search.\n\n        h(n) is the heuristic that gives the cost between node n and the goal node. It must be admissable, meaning that h(n) MUST NEVER OVERSTIMATE the true cost. Underestimating is fine.\n\n        neighbours(n) is an iterable giving a pair (cost, node, descr) for each node neighbouring n\n        IN ASCENDING ORDER OF COST. descr is not used in the computation but can be used to\n        efficiently store information about the path edges (e.g. up/left/right/down for grids).\n        \"\"\"\n\n        self.h = h\n        self.neighbours = neighbours\n        self.FOUND = object()\n\n\n    def solve(self, root, is_goal, max_cost=None):\n        \"\"\" Returns the shortest path between the root and a given goal, as well as the total cost.\n        If the cost exceeds a given max_cost, the function returns None. If you do not give a\n        maximum cost the solver will never return for unsolvable instances.\"\"\"\n\n        self.is_goal = is_goal\n        self.path = [root]\n        self.is_in_path = {root}\n        self.path_descrs = []\n        self.nodes_evaluated = 0\n\n        bound = self.h(root)\n\n        while True:\n            t = self._search(0, bound)\n            if t is self.FOUND: return self.path, self.path_descrs, bound, self.nodes_evaluated\n            if t is None: return None\n            bound = t\n\n    def _search(self, g, bound):\n        self.nodes_evaluated += 1\n\n        node = self.path[-1]\n        f = g + self.h(node)\n        if f > bound: return f\n        if self.is_goal(node): return self.FOUND\n\n        m = None # Lower bound on cost.\n        for cost, n, descr in self.neighbours(node):\n            if n in self.is_in_path: continue\n\n            self.path.append(n)\n            self.is_in_path.add(n)\n            self.path_descrs.append(descr)\n            t = self._search(g + cost, bound)\n\n            if t == self.FOUND: return self.FOUND\n            if m is None or (t is not None and t < m): m = t\n\n            self.path.pop()\n            self.path_descrs.pop()\n            self.is_in_path.remove(n)\n\n        return m\n\n\ndef slide_solved_state(n):\n    return tuple(i % (n*n) for i in range(1, n*n+1))\n\ndef slide_randomize(p, neighbours):\n    for _ in range(len(p) ** 2):\n        _, p, _ = random.choice(list(neighbours(p)))\n    return p\n\ndef slide_neighbours(n):\n    movelist = []\n    for gap in range(n*n):\n        x, y = gap % n, gap // n\n        moves = []\n        if x > 0: moves.append(-1)    # Move the gap left.\n        if x < n-1: moves.append(+1)  # Move the gap right.\n        if y > 0: moves.append(-n)    # Move the gap up.\n        if y < n-1: moves.append(+n)  # Move the gap down.\n        movelist.append(moves)\n\n    def neighbours(p):\n        gap = p.index(0)\n        l = list(p)\n\n        for m in movelist[gap]:\n            l[gap] = l[gap + m]\n            l[gap + m] = 0\n            yield (1, tuple(l), (l[gap], m))\n            l[gap + m] = l[gap]\n            l[gap] = 0\n\n    return neighbours\n\ndef slide_print(p):\n    n = int(round(len(p) ** 0.5))\n    l = len(str(n*n))\n    for i in range(0, len(p), n):\n        print(\" \".join(\"{:>{}}\".format(x, l) for x in p[i:i+n]))\n\ndef encode_cfg(cfg, n):\n    r = 0\n    b = n.bit_length()\n    for i in range(len(cfg)):\n        r |= cfg[i] << (b*i)\n    return r\n\n\ndef gen_wd_table(n):\n    goal = [[0] * i + [n] + [0] * (n - 1 - i) for i in range(n)]\n    goal[-1][-1] = n - 1\n    goal = tuple(sum(goal, []))\n\n    table = {}\n    to_visit = [(goal, 0, n-1)]\n    while to_visit:\n        cfg, cost, e = to_visit.pop(0)\n        enccfg = encode_cfg(cfg, n)\n        if enccfg in table: continue\n        table[enccfg] = cost\n\n        for d in [-1, 1]:\n            if 0 <= e + d < n:\n                for c in range(n):\n                    if cfg[n*(e+d) + c] > 0:\n                        ncfg = list(cfg)\n                        ncfg[n*(e+d) + c] -= 1\n                        ncfg[n*e + c] += 1\n                        to_visit.append((tuple(ncfg), cost + 1, e+d))\n\n    return table\n\ndef slide_wd(n, goal):\n    wd = gen_wd_table(n)\n    goals = {i : goal.index(i) for i in goal}\n    b = n.bit_length()\n\n    def h(p):\n        ht = 0 # Walking distance between rows.\n        vt = 0 # Walking distance between columns.\n        d = 0\n        for i, c in enumerate(p):\n            if c == 0: continue\n            g = goals[c]\n            xi, yi = i % n, i // n\n            xg, yg = g % n, g // n\n            ht += 1 << (b*(n*yi+yg))\n            vt += 1 << (b*(n*xi+xg))\n\n            if yg == yi:\n                for k in range(i + 1, i - i%n + n): # Until end of row.\n                    if p[k] and goals[p[k]] // n == yi and goals[p[k]] < g:\n                        d += 2\n\n            if xg == xi:\n                for k in range(i + n, n * n, n): # Until end of column.\n                    if p[k] and goals[p[k]] % n == xi and goals[p[k]] < g:\n                        d += 2\n\n        d += wd[ht] + wd[vt]\n\n        return d\n    return h\n\n\n\n\nif __name__ == \"__main__\":\n    solved_state = slide_solved_state(4)\n    neighbours = slide_neighbours(4)\n    is_goal = lambda p: p == solved_state\n\n    tests = [\n        (15, 14, 1, 6, 9, 11, 4, 12, 0, 10, 7, 3, 13, 8, 5, 2),\n    ]\n\n    slide_solver = IDAStar(slide_wd(4, solved_state), neighbours)\n\n    for p in tests:\n        path, moves, cost, num_eval = slide_solver.solve(p, is_goal, 80)\n        slide_print(p)\n        print(\", \".join({-1: \"Left\", 1: \"Right\", -4: \"Up\", 4: \"Down\"}[move[1]] for move in moves))\n        print(cost, num_eval)\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_78.txt",
        "content": "15 14  1  6\n 9 11  4 12\n 0 10  7  3\n13  8  5  2\nRight, Right, Right, Up, Left, Down, Left, Up, Up, Left, Down, Right, Up, Right, Down, Down, Down, Left, Up, Up, Left, Up, Right, Right, Right, Down, Left, Down, Down, Right, Up, Left, Down, Left, Up, Up, Right, Down, Down, Left, Up, Left, Up, Right, Right, Up, Left, Down, Right, Right, Down, Down\n52 872794\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_79.txt",
        "content": "\"\"\"\n\nPython example for this Rosetta Code task:\n\nhttp://rosettacode.org/wiki/15_puzzle_solver\n\nUsing A* Algorithm from Wikkipedia:\n\nhttps://en.wikipedia.org/wiki/A*_search_algorithm\n\nNeed to use heuristic that guarantees a shortest path\nsolution.\n\n\"\"\"\n\nimport heapq\nimport copy\n\n# Hopefully this is larger than any fscore or gscore\n\ninteger_infinity = 1000000000\n\nclass Position(object):\n    \"\"\"Position class represents one position of a 15 puzzle\"\"\"\n\n    def __init__(self, tiles):\n        \"\"\"\n        Takes a tuple of tuples representing the tiles on a 4x4 puzzle board\n        numbering 1-15 with 0 representing an empty square. For example:\n        \n        (( 1,  2,  3,  4),\n         ( 5,  6,  7,  8),\n         ( 9, 10, 11, 12),\n         (13, 14, 15,  0))\n         \n        Converts list of lists representation into tuple of tuples.\n        \"\"\"\n        if type(tiles) == type(list()):\n            t = tiles\n            self.tiles = ((t[0][0], t[0][1], t[0][2], t[0][3]),\n                          (t[1][0], t[1][1], t[1][2], t[1][3]),        \n                          (t[2][0], t[2][1], t[2][2], t[2][3]),        \n                          (t[3][0], t[3][1], t[3][2], t[3][3]))\n        else:\n            self.tiles = tiles\n            \n        # fields for A* algorithm\n        \n        self.fscore = integer_infinity\n        self.gscore = integer_infinity\n        \n        self.cameFrom = None\n                                    \n    def copy_tiles(self):\n        \"\"\" returns list of lists version \"\"\"\n        t = self.tiles\n        \n        return [[t[0][0], t[0][1], t[0][2], t[0][3]],\n                [t[1][0], t[1][1], t[1][2], t[1][3]],        \n                [t[2][0], t[2][1], t[2][2], t[2][3]],        \n                [t[3][0], t[3][1], t[3][2], t[3][3]]]        \n\n        \n    def neighbors(self):\n        \"\"\"\n        returns a list of neighbors\n        returns a list position objects with their\n        directiontomoveto set to the direction that the\n        empty square moved.\n        \n        tiles is 4x4 tuple of tuples with\n        0,0 as top left.\n    \n        tiles[y][x]\n\n        \"\"\"\n        \n        # find 0 - blank square\n        \n        x0 = None\n        y0 = None\n        \n        for i in range(4):\n            for j in range(4):\n                if self.tiles[i][j] == 0:\n                    y0 = i\n                    x0 = j\n\n        if x0 == None or y0 == None:\n            return []\n            \n        neighbor_list = []\n            \n        # move 0 to the right\n        if x0 < 3:\n            new_tiles = self.copy_tiles()\n            temp = new_tiles[y0][x0+1]\n            new_tiles[y0][x0+1] = 0\n            new_tiles[y0][x0] = temp\n            new_pos = new_position(new_tiles)\n            neighbor_list.append(new_pos)\n        # move 0 to the left\n        if x0 > 0:\n            new_tiles = self.copy_tiles()\n            temp = new_tiles[y0][x0-1]\n            new_tiles[y0][x0-1] = 0\n            new_tiles[y0][x0] = temp\n            new_pos = new_position(new_tiles)\n            neighbor_list.append(new_pos)\n        # move 0 up\n        if y0 > 0:\n            new_tiles = self.copy_tiles()\n            temp = new_tiles[y0-1][x0]\n            new_tiles[y0-1][x0] = 0\n            new_tiles[y0][x0] = temp\n            new_pos = new_position(new_tiles)\n            neighbor_list.append(new_pos)\n        # move 0 down\n        if y0 < 3:\n            new_tiles = self.copy_tiles()\n            temp = new_tiles[y0+1][x0]\n            new_tiles[y0+1][x0] = 0\n            new_tiles[y0][x0] = temp\n            new_pos = new_position(new_tiles)\n            neighbor_list.append(new_pos)\n            \n        return neighbor_list\n        \n    def __repr__(self):\n        # printable version of self\n        \n        return str(self.tiles[0])+'\\n'+str(self.tiles[1])+'\\n'+str(self.tiles[2])+'\\n'+str(self.tiles[3])+'\\n'\n\n# takes tuple of tuples tiles as key, Position object for that tiles as value\n\nall_positions = dict()\n\ndef new_position(tiles):\n    \"\"\" returns a new position or looks up existing one \"\"\"\n    global all_positions\n    if type(tiles) == type(list()):\n        t = tiles\n        tuptiles =   ((t[0][0], t[0][1], t[0][2], t[0][3]),\n                      (t[1][0], t[1][1], t[1][2], t[1][3]),        \n                      (t[2][0], t[2][1], t[2][2], t[2][3]),        \n                      (t[3][0], t[3][1], t[3][2], t[3][3]))\n    else:\n        tuptiles = tiles\n        \n    if tuptiles in all_positions:\n        return \tall_positions[tuptiles]\n    else:\n        new_pos = Position(tiles)\n        all_positions[tuptiles] = new_pos\n        return new_pos\n                \ndef reconstruct_path(current):\n    \"\"\" \n    Uses the cameFrom members to follow the chain of moves backwards\n    and then reverses the list to get the path in the correct order.\n    \"\"\"\n    total_path = [current]\n\n    while current.cameFrom != None:\n        current = current.cameFrom\n        total_path.append(current)\n        \n    total_path.reverse()\n    \n    return total_path\n        \nclass PriorityQueue(object):\n    \"\"\"\n    Priority queue using heapq.\n    elements of queue are (fscore,tiles) for each position.\n    If element is removed from queue and fscore doesn't match\n    then that element is discarded.\n    \"\"\"\n\n    def __init__(self, object_list):\n        \"\"\" \n        Save a list in a heapq.\n        Assume that each object only appears once\n        in the list.\n        \"\"\"\n        self.queue_length = 0\n        self.qheap = []\n        for e in object_list:\n            self.qheap.append((e.fscore,e.tiles))\n            self.queue_length += 1\n        heapq.heapify(self.qheap)\n        \n    def push(self, new_object):\n        \"\"\" save object in heapq \"\"\"\n        heapq.heappush(self.qheap,(new_object.fscore,new_object.tiles))\n        self.queue_length += 1\n        \n    def pop(self):\n        \"\"\" remove object from heap and return \"\"\"\n        if self.queue_length < 1:\n            return None\n        fscore, tiles = heapq.heappop(self.qheap)\n        self.queue_length -= 1\n        global all_positions\n        pos = all_positions[tiles]\n        if pos.fscore == fscore:\n            return pos\n        else:\n            return self.pop()\n                \n    def __repr__(self):\n        # printable version of self\n        strrep = \"\"\n        for e in self.qheap:\n          fscore, tiles = e\n          strrep += str(fscore)+\":\"+str(tiles)+\"\\n\"\n        \n        return strrep\n        \nconflict_table = None\n\ndef build_conflict_table():\n    global conflict_table\n    conflict_table = dict()\n    \n    # assumes goal tuple has up to \n    # for the given pattern it the start position\n    # how much to add for linear conflicts\n    # 2 per conflict - max of 6\n    \n    # goal tuple is ('g0', 'g1', 'g2', 'g3')\n    \n    conflict_table[('g0', 'g1', 'g2', 'g3')] = 0\n    conflict_table[('g0', 'g1', 'g2', 'x')] = 0\n    conflict_table[('g0', 'g1', 'g3', 'g2')] = 2\n    conflict_table[('g0', 'g1', 'g3', 'x')] = 0\n    conflict_table[('g0', 'g1', 'x', 'g2')] = 0\n    conflict_table[('g0', 'g1', 'x', 'g3')] = 0\n    conflict_table[('g0', 'g1', 'x', 'x')] = 0\n    conflict_table[('g0', 'g2', 'g1', 'g3')] = 2\n    conflict_table[('g0', 'g2', 'g1', 'x')] = 2\n    conflict_table[('g0', 'g2', 'g3', 'g1')] = 4\n    conflict_table[('g0', 'g2', 'g3', 'x')] = 0\n    conflict_table[('g0', 'g2', 'x', 'g1')] = 2\n    conflict_table[('g0', 'g2', 'x', 'g3')] = 0\n    conflict_table[('g0', 'g2', 'x', 'x')] = 0\n    conflict_table[('g0', 'g3', 'g1', 'g2')] = 4 \n    conflict_table[('g0', 'g3', 'g1', 'x')] = 2\n    conflict_table[('g0', 'g3', 'g2', 'g1')] = 4\n    conflict_table[('g0', 'g3', 'g2', 'x')] = 2\n    conflict_table[('g0', 'g3', 'x', 'g1')] = 2\n    conflict_table[('g0', 'g3', 'x', 'g2')] = 2\n    conflict_table[('g0', 'g3', 'x', 'x')] = 0\n    conflict_table[('g0', 'x', 'g1', 'g2')] = 0\n    conflict_table[('g0', 'x', 'g1', 'g3')] = 0\n    conflict_table[('g0', 'x', 'g1', 'x')] = 0\n    conflict_table[('g0', 'x', 'g2', 'g1')] = 2\n    conflict_table[('g0', 'x', 'g2', 'g3')] = 0\n    conflict_table[('g0', 'x', 'g2', 'x')] = 0\n    conflict_table[('g0', 'x', 'g3', 'g1')] = 2\n    conflict_table[('g0', 'x', 'g3', 'g2')] = 2\n    conflict_table[('g0', 'x', 'g3', 'x')] = 0\n    conflict_table[('g0', 'x', 'x', 'g1')] = 0\n    conflict_table[('g0', 'x', 'x', 'g2')] = 0\n    conflict_table[('g0', 'x', 'x', 'g3')] = 0\n    conflict_table[('g1', 'g0', 'g2', 'g3')] = 2\n    conflict_table[('g1', 'g0', 'g2', 'x')] = 2\n    conflict_table[('g1', 'g0', 'g3', 'g2')] = 4 \n    conflict_table[('g1', 'g0', 'g3', 'x')] = 2\n    conflict_table[('g1', 'g0', 'x', 'g2')] = 2\n    conflict_table[('g1', 'g0', 'x', 'g3')] = 2\n    conflict_table[('g1', 'g0', 'x', 'x')] = 2\n    conflict_table[('g1', 'g2', 'g0', 'g3')] = 4 \n    conflict_table[('g1', 'g2', 'g0', 'x')] = 4\n    conflict_table[('g1', 'g2', 'g3', 'g0')] = 6 \n    conflict_table[('g1', 'g2', 'g3', 'x')] = 0\n    conflict_table[('g1', 'g2', 'x', 'g0')] = 4\n    conflict_table[('g1', 'g2', 'x', 'g3')] = 0\n    conflict_table[('g1', 'g2', 'x', 'x')] = 0\n    conflict_table[('g1', 'g3', 'g0', 'g2')] = 4 \n    conflict_table[('g1', 'g3', 'g0', 'x')] = 4\n    conflict_table[('g1', 'g3', 'g2', 'g0')] = 6 \n    conflict_table[('g1', 'g3', 'g2', 'x')] = 0\n    conflict_table[('g1', 'g3', 'x', 'g0')] = 4\n    conflict_table[('g1', 'g3', 'x', 'g2')] = 2\n    conflict_table[('g1', 'g3', 'x', 'x')] = 0\n    conflict_table[('g1', 'x', 'g0', 'g2')] = 2\n    conflict_table[('g1', 'x', 'g0', 'g3')] = 2\n    conflict_table[('g1', 'x', 'g0', 'x')] = 2\n    conflict_table[('g1', 'x', 'g2', 'g0')] = 4\n    conflict_table[('g1', 'x', 'g2', 'g3')] = 0\n    conflict_table[('g1', 'x', 'g2', 'x')] = 0\n    conflict_table[('g1', 'x', 'g3', 'g0')] = 4\n    conflict_table[('g1', 'x', 'g3', 'g2')] = 2\n    conflict_table[('g1', 'x', 'g3', 'x')] = 0\n    conflict_table[('g1', 'x', 'x', 'g0')] = 2\n    conflict_table[('g1', 'x', 'x', 'g2')] = 0\n    conflict_table[('g1', 'x', 'x', 'g3')] = 0\n    conflict_table[('g2', 'g0', 'g1', 'g3')] = 4\n    conflict_table[('g2', 'g0', 'g1', 'x')] = 4\n    conflict_table[('g2', 'g0', 'g3', 'g1')] = 4\n    conflict_table[('g2', 'g0', 'g3', 'x')] = 2\n    conflict_table[('g2', 'g0', 'x', 'g1')] = 4\n    conflict_table[('g2', 'g0', 'x', 'g3')] = 2\n    conflict_table[('g2', 'g0', 'x', 'x')] = 2\n    conflict_table[('g2', 'g1', 'g0', 'g3')] = 4\n    conflict_table[('g2', 'g1', 'g0', 'x')] = 4\n    conflict_table[('g2', 'g1', 'g3', 'g0')] = 6\n    conflict_table[('g2', 'g1', 'g3', 'x')] = 2\n    conflict_table[('g2', 'g1', 'x', 'g0')] = 4\n    conflict_table[('g2', 'g1', 'x', 'g3')] = 2\n    conflict_table[('g2', 'g1', 'x', 'x')] = 2\n    conflict_table[('g2', 'g3', 'g0', 'g1')] = 4\n    conflict_table[('g2', 'g3', 'g0', 'x')] = 4\n    conflict_table[('g2', 'g3', 'g1', 'g0')] = 6\n    conflict_table[('g2', 'g3', 'g1', 'x')] = 4\n    conflict_table[('g2', 'g3', 'x', 'g0')] = 4\n    conflict_table[('g2', 'g3', 'x', 'g1')] = 4\n    conflict_table[('g2', 'g3', 'x', 'x')] = 0\n    conflict_table[('g2', 'x', 'g0', 'g1')] = 4\n    conflict_table[('g2', 'x', 'g0', 'g3')] = 2\n    conflict_table[('g2', 'x', 'g0', 'x')] = 2\n    conflict_table[('g2', 'x', 'g1', 'g0')] = 4\n    conflict_table[('g2', 'x', 'g1', 'g3')] = 2\n    conflict_table[('g2', 'x', 'g1', 'x')] = 2\n    conflict_table[('g2', 'x', 'g3', 'g0')] = 4\n    conflict_table[('g2', 'x', 'g3', 'g1')] = 4\n    conflict_table[('g2', 'x', 'g3', 'x')] = 0\n    conflict_table[('g2', 'x', 'x', 'g0')] = 2\n    conflict_table[('g2', 'x', 'x', 'g1')] = 2\n    conflict_table[('g2', 'x', 'x', 'g3')] = 0\n    conflict_table[('g3', 'g0', 'g1', 'g2')] = 6\n    conflict_table[('g3', 'g0', 'g1', 'x')] = 4\n    conflict_table[('g3', 'g0', 'g2', 'g1')] = 6\n    conflict_table[('g3', 'g0', 'g2', 'x')] = 4\n    conflict_table[('g3', 'g0', 'x', 'g1')] = 4\n    conflict_table[('g3', 'g0', 'x', 'g2')] = 4\n    conflict_table[('g3', 'g0', 'x', 'x')] = 2\n    conflict_table[('g3', 'g1', 'g0', 'g2')] = 6\n    conflict_table[('g3', 'g1', 'g0', 'x')] = 4\n    conflict_table[('g3', 'g1', 'g2', 'g0')] = 6\n    conflict_table[('g3', 'g1', 'g2', 'x')] = 4\n    conflict_table[('g3', 'g1', 'x', 'g0')] = 4\n    conflict_table[('g3', 'g1', 'x', 'g2')] = 4\n    conflict_table[('g3', 'g1', 'x', 'x')] = 2\n    conflict_table[('g3', 'g2', 'g0', 'g1')] = 6\n    conflict_table[('g3', 'g2', 'g0', 'x')] = 4\n    conflict_table[('g3', 'g2', 'g1', 'g0')] = 6\n    conflict_table[('g3', 'g2', 'g1', 'x')] = 4\n    conflict_table[('g3', 'g2', 'x', 'g0')] = 4\n    conflict_table[('g3', 'g2', 'x', 'g1')] = 4\n    conflict_table[('g3', 'g2', 'x', 'x')] = 2\n    conflict_table[('g3', 'x', 'g0', 'g1')] = 4\n    conflict_table[('g3', 'x', 'g0', 'g2')] = 4\n    conflict_table[('g3', 'x', 'g0', 'x')] = 2\n    conflict_table[('g3', 'x', 'g1', 'g0')] = 4\n    conflict_table[('g3', 'x', 'g1', 'g2')] = 4\n    conflict_table[('g3', 'x', 'g1', 'x')] = 2\n    conflict_table[('g3', 'x', 'g2', 'g0')] = 4\n    conflict_table[('g3', 'x', 'g2', 'g1')] = 4\n    conflict_table[('g3', 'x', 'g2', 'x')] = 2\n    conflict_table[('g3', 'x', 'x', 'g0')] = 2\n    conflict_table[('g3', 'x', 'x', 'g1')] = 2\n    conflict_table[('g3', 'x', 'x', 'g2')] = 2\n    conflict_table[('x', 'g0', 'g1', 'g2')] = 0\n    conflict_table[('x', 'g0', 'g1', 'g3')] = 0\n    conflict_table[('x', 'g0', 'g1', 'x')] = 0\n    conflict_table[('x', 'g0', 'g2', 'g1')] = 2\n    conflict_table[('x', 'g0', 'g2', 'g3')] = 0\n    conflict_table[('x', 'g0', 'g2', 'x')] = 0\n    conflict_table[('x', 'g0', 'g3', 'g1')] = 2\n    conflict_table[('x', 'g0', 'g3', 'g2')] = 2\n    conflict_table[('x', 'g0', 'g3', 'x')] = 0\n    conflict_table[('x', 'g0', 'x', 'g1')] = 0\n    conflict_table[('x', 'g0', 'x', 'g2')] = 0\n    conflict_table[('x', 'g0', 'x', 'g3')] = 0\n    conflict_table[('x', 'g1', 'g0', 'g2')] = 2\n    conflict_table[('x', 'g1', 'g0', 'g3')] = 2\n    conflict_table[('x', 'g1', 'g0', 'x')] = 2\n    conflict_table[('x', 'g1', 'g2', 'g0')] = 4\n    conflict_table[('x', 'g1', 'g2', 'g3')] = 0\n    conflict_table[('x', 'g1', 'g2', 'x')] = 0\n    conflict_table[('x', 'g1', 'g3', 'g0')] = 4\n    conflict_table[('x', 'g1', 'g3', 'g2')] = 2\n    conflict_table[('x', 'g1', 'g3', 'x')] = 0\n    conflict_table[('x', 'g1', 'x', 'g0')] = 2\n    conflict_table[('x', 'g1', 'x', 'g2')] = 0\n    conflict_table[('x', 'g1', 'x', 'g3')] = 0\n    conflict_table[('x', 'g2', 'g0', 'g1')] = 4\n    conflict_table[('x', 'g2', 'g0', 'g3')] = 2\n    conflict_table[('x', 'g2', 'g0', 'x')] = 2\n    conflict_table[('x', 'g2', 'g1', 'g0')] = 4\n    conflict_table[('x', 'g2', 'g1', 'g3')] = 2\n    conflict_table[('x', 'g2', 'g1', 'x')] = 2\n    conflict_table[('x', 'g2', 'g3', 'g0')] = 4\n    conflict_table[('x', 'g2', 'g3', 'g1')] = 4\n    conflict_table[('x', 'g2', 'g3', 'x')] = 0\n    conflict_table[('x', 'g2', 'x', 'g0')] = 2\n    conflict_table[('x', 'g2', 'x', 'g1')] = 2\n    conflict_table[('x', 'g2', 'x', 'g3')] = 0\n    conflict_table[('x', 'g3', 'g0', 'g1')] = 4\n    conflict_table[('x', 'g3', 'g0', 'g2')] = 4\n    conflict_table[('x', 'g3', 'g0', 'x')] = 2\n    conflict_table[('x', 'g3', 'g1', 'g0')] = 4\n    conflict_table[('x', 'g3', 'g1', 'g2')] = 4\n    conflict_table[('x', 'g3', 'g1', 'x')] = 2\n    conflict_table[('x', 'g3', 'g2', 'g0')] = 4\n    conflict_table[('x', 'g3', 'g2', 'g1')] = 4\n    conflict_table[('x', 'g3', 'g2', 'x')] = 2\n    conflict_table[('x', 'g3', 'x', 'g0')] = 2\n    conflict_table[('x', 'g3', 'x', 'g1')] = 2\n    conflict_table[('x', 'g3', 'x', 'g2')] = 2\n    conflict_table[('x', 'x', 'g0', 'g1')] = 0\n    conflict_table[('x', 'x', 'g0', 'g2')] = 0\n    conflict_table[('x', 'x', 'g0', 'g3')] = 0\n    conflict_table[('x', 'x', 'g1', 'g0')] = 2\n    conflict_table[('x', 'x', 'g1', 'g2')] = 0\n    conflict_table[('x', 'x', 'g1', 'g3')] = 0\n    conflict_table[('x', 'x', 'g2', 'g0')] = 2\n    conflict_table[('x', 'x', 'g2', 'g1')] = 2\n    conflict_table[('x', 'x', 'g2', 'g3')] = 0\n    conflict_table[('x', 'x', 'g3', 'g0')] = 2\n    conflict_table[('x', 'x', 'g3', 'g1')] = 2\n    conflict_table[('x', 'x', 'g3', 'g2')] = 2\n        \ndef linear_conflicts(start_list,goal_list):\n    \"\"\"\n    calculates number of moves to add to the estimate of\n    the moves to get from start to goal based on the number\n    of conflicts on a given row or column. start_list\n    represents the current location and goal_list represnts\n    the final goal.\n    \"\"\"\n    \n    # Find which of the tiles in start_list have their goals on this line\n    # build a pattern to use in a lookup table of this form:\n    # g0, g1, g3, g3 fill in x where there is no goal for this line\n    \n    # all 'x' until we file a tile whose goal is in this line\n    \n    goal_pattern = ['x', 'x', 'x', 'x']\n    \n    for g in range(4):\n        for s in range(4):\n            start_tile_num = start_list[s]\n            if start_tile_num == goal_list[g] and start_tile_num != 0:\n                goal_pattern[s] = 'g' + str(g) # i.e. g0\n                                \n    global conflict_table\n    \n    tup_goal_pattern = tuple(goal_pattern)\n    \n    if tup_goal_pattern in conflict_table:\n        return conflict_table[tuple(goal_pattern)]\n    else:\n        return 0\n    \nclass lcmap(dict):\n    \"\"\" \n    Lets you return 0 if you look for an object that\n    is not in the dictionary. \n    \"\"\"\n    def __missing__(self, key):\n        return 0\n\ndef listconflicts(goal_list):\n    \"\"\" \n    list all possible start lists that will have at least\n    one linear conflict.\n    \n    Possible goal tile configurations\n    \n    g g g g\n    g g g x\n    g g x g\n    g x g g\n    x g g g\n    g g x x\n    g x g x\n    g x x g\n    x g g x\n    x g x g\n    x x g g\n        \n    \"\"\"\n    \n    all_tiles = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15]\n    \n    non_goal_tiles = []\n    \n    for t in all_tiles:\n        if t not in goal_list:\n            non_goal_tiles.append(t) \n            \n    combinations = lcmap()\n\n    # g g g g\n    \n    for i in goal_list:\n        tile_list2 = goal_list[:]\n        tile_list2.remove(i)\n        for j in tile_list2:\n            tile_list3 = tile_list2[:]\n            tile_list3.remove(j)\n            for k in tile_list3:\n                tile_list4 = tile_list3[:]\n                tile_list4.remove(k)\n                for l in tile_list4:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd    \n    \n    # g g g x\n    \n    for i in goal_list:\n        tile_list2 = goal_list[:]\n        tile_list2.remove(i)\n        for j in tile_list2:\n            tile_list3 = tile_list2[:]\n            tile_list3.remove(j)\n            for k in tile_list3:\n                for l in non_goal_tiles:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd  \n\n    # g g x g\n    \n    for i in goal_list:\n        tile_list2 = goal_list[:]\n        tile_list2.remove(i)\n        for j in tile_list2:\n            tile_list3 = tile_list2[:]\n            tile_list3.remove(j)\n            for k in non_goal_tiles:\n                for l in tile_list3:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd\n    # g x g g\n    \n    for i in goal_list:\n        tile_list2 = goal_list[:]\n        tile_list2.remove(i)\n        for j in non_goal_tiles:\n            for k in tile_list2:\n                tile_list3 = tile_list2[:]\n                tile_list3.remove(k)\n                for l in tile_list3:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd\n\n    # x g g g\n    \n    for i in non_goal_tiles:\n        for j in goal_list:\n            tile_list2 = goal_list[:]\n            tile_list2.remove(j)\n            for k in tile_list2:\n                tile_list3 = tile_list2[:]\n                tile_list3.remove(k)\n                for l in tile_list3:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd\n\n    # g g x x\n\n    for i in goal_list:\n        tile_list2 = goal_list[:]\n        tile_list2.remove(i)\n        for j in tile_list2:\n            tile_list3 = tile_list2[:]\n            tile_list3.remove(j)\n            for k in non_goal_tiles:\n                tile_list4 = non_goal_tiles[:]\n                tile_list4.remove(k)\n                for l in tile_list4:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd \n                        \n    # g x g x\n\n    for i in goal_list:\n        tile_list2 = goal_list[:]\n        tile_list2.remove(i)\n        for j in non_goal_tiles:\n            tile_list3 = non_goal_tiles[:]\n            tile_list3.remove(j)\n            for k in tile_list2:\n                for l in tile_list3:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd    \n                        \n    # g x x g\n\n    for i in goal_list:\n        tile_list2 = goal_list[:]\n        tile_list2.remove(i)\n        for j in non_goal_tiles:\n            tile_list3 = non_goal_tiles[:]\n            tile_list3.remove(j)\n            for k in tile_list2:\n                for l in tile_list3:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd     \n    \n    # x g g x\n\n    for i in non_goal_tiles:\n        tile_list2 = non_goal_tiles[:]\n        tile_list2.remove(i)\n        for j in goal_list:\n            tile_list3 = goal_list[:]\n            tile_list3.remove(j)\n            for k in tile_list3:\n                for l in tile_list2:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd      \n    \n    # x g x g\n    \n    for i in non_goal_tiles:\n        tile_list2 = non_goal_tiles[:]\n        tile_list2.remove(i)\n        for j in goal_list:\n            tile_list3 = goal_list[:]\n            tile_list3.remove(j)\n            for k in tile_list3:\n                for l in tile_list2:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd      \n      \n    # x x g g\n    \n    for i in non_goal_tiles:\n        tile_list2 = non_goal_tiles[:]\n        tile_list2.remove(i)\n        for j in tile_list2:\n            for k in goal_list:\n                tile_list3 = goal_list[:]\n                tile_list3.remove(k)\n                for l in tile_list3:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd      \n      \n    return combinations\n\n\nclass HeuristicObj(object):\n    \"\"\" Object used to preprocess goal position for heuristic function \"\"\"\n\n    def __init__(self, goal):\n        \"\"\"\n        Preprocess goal position to setup internal data structures\n        that can be used to speed up heuristic.\n        \"\"\"\n        \n        build_conflict_table()\n        \n        self.goal_map = []\n        for i in range(16):\n            self.goal_map.append(i)    \n        \n        self.goal_lists = goal.tiles\n        \n        # preprocess for manhattan distance\n        \n        for row in range(4):\n            for col in range(4):\n                self.goal_map[goal.tiles[row][col]] = (row, col)\n                \n        # make access faster by changing to a tuple\n        \n        self.goal_map = tuple(self.goal_map)\n                \n        # preprocess for linear conflicts\n        \n        self.row_conflicts = []\n        for row in range(4):\n            t = goal.tiles[row]\n            conf_dict = listconflicts([t[0],t[1],t[2],t[3]])\n            self.row_conflicts.append(conf_dict)\n            \n        self.col_conflicts = []\n        for col in range(4):\n            col_list =[]\n            for row in range(4):\n                col_list.append(goal.tiles[row][col])\n            conf_dict = listconflicts(col_list)\n            self.col_conflicts.append(conf_dict)\n\n    def heuristic(self, start):\n        \"\"\" \n        \n        Estimates the number of moves from start to goal.\n        The goal was preprocessed in __init__.\n        \n        \"\"\"\n        \n        distance = 0\n        \n        # local variables for instance variables\n        \n        t = start.tiles\n        g = self.goal_map\n        rc = self.row_conflicts\n        cc = self.col_conflicts\n        \n        # calculate manhattan distance\n        \n        for row in range(4):\n            for col in range(4):\n                start_tilenum = t[row][col]\n                if start_tilenum != 0:\n                    (grow, gcol) = g[start_tilenum]\n                    distance += abs(row - grow) + abs(col - gcol)\n                                        \n        # add linear conflicts \n        \n        for row in range(4):\n            curr_row = t[row]\n            distance += rc[row][curr_row]\n       \n        for col in range(4):\n            col_tuple = (t[0][col], t[1][col], t[2][col], t[3][col])\n            distance += cc[col][col_tuple]\n          \n        return distance\n        \n# global variable for heuristic object\n\nhob = None\n        \ndef a_star(start_tiles, goal_tiles):\n    \"\"\" Based on https://en.wikipedia.org/wiki/A*_search_algorithm \"\"\"\n    \n    start = new_position(start_tiles)\n    goal = new_position(goal_tiles)\n    \n    # Process goal position for use in heuristic\n    \n    global hob\n    hob = HeuristicObj(goal)\n    \n    # The set of currently discovered nodes that are not evaluated yet.\n    # Initially, only the start node is known.\n    # For the first node, the fscore is completely heuristic.\n    \n    start.fscore = hob.heuristic(start)\n    openSet = PriorityQueue([start])\n \n    # The cost of going from start to start is zero.\n    \n    start.gscore = 0\n    \n    num_popped = 0\n    \n    while openSet.queue_length > 0:\n        current = openSet.pop()\n        if current == None: # tried to pop but only found old fscore values\n            break\n        num_popped += 1\n        if num_popped % 100000 == 0:\n            print(str(num_popped)+\" positions examined\")\n        \n        if current == goal:\n            return reconstruct_path(current)\n            \n        for neighbor in current.neighbors():\n\n            # The distance from start to a neighbor\n            # All nodes are 1 move from their neighbors\n            \n            tentative_gScore = current.gscore + 1\n            \n            # update gscore and fscore if this is shorter path\n            # to the neighbor node\n\n            if tentative_gScore < neighbor.gscore: \n                neighbor.cameFrom = current\n                neighbor.gscore = tentative_gScore\n                neighbor.fscore = neighbor.gscore + hob.heuristic(neighbor)\n                openSet.push(neighbor) # add to open set every time\n                \n\ndef find_zero(tiles):\n    \"\"\" file the 0 tile \"\"\"\n    for row in range(4):\n        for col in range(4):\n            if tiles[row][col] == 0:\n                return (row, col)\n\ndef path_as_0_moves(path):\n    \"\"\"\n    Takes the path which is a list of Position\n    objects and outputs it as a string of rlud \n    directions to match output desired by \n    Rosetta Code task.\n    \"\"\"\n    strpath = \"\"\n    if len(path) < 1:\n        return \"\"\n    prev_pos = path[0]\n    p_row, p_col = find_zero(prev_pos.tiles)\n    for i in range(1,len(path)):\n        curr_pos = path[i]\n        c_row, c_col = find_zero(curr_pos.tiles)\n        if c_row > p_row:\n            strpath += 'd'\n        elif c_row < p_row:\n            strpath += 'u'\n        elif c_col > p_col:\n            strpath += 'r'\n        elif c_col < p_col:\n            strpath += 'l'\n        # reset for next loop\n        prev_pos = curr_pos\n        p_row = c_row\n        p_col = c_col\n    return strpath\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_8.txt",
        "content": "with Ada.Text_IO;\n\nprocedure Puzzle_15 is\n\n   type Direction is (Up, Down, Left, Right);\n   type Row_Type is range 0 .. 3;\n   type Col_Type is range 0 .. 3;\n   type Tile_Type is range 0 .. 15;\n\n   To_Col : constant array (Tile_Type) of Col_Type :=\n     (3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2);\n   To_Row : constant array (Tile_Type) of Row_Type :=\n     (3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3);\n\n   type Board_Type is array (Row_Type, Col_Type) of Tile_Type;\n\n   Solved_Board : constant Board_Type :=\n     ((1,   2,  3,  4),\n      (5,   6,  7,  8),\n      (9,  10, 11, 12),\n      (13, 14, 15, 0));\n\n   type Try_Type is\n      record\n         Board : Board_Type;\n         Move  : Direction;\n         Cost  : Integer;\n         Row   : Row_Type;\n         Col   : Col_Type;\n      end record;\n\n   Stack : array (0 .. 100) of Try_Type;\n   Top             : Natural := 0;\n   Iteration_Count : Natural := 0;\n\n   procedure Move_Down is\n      Board   : Board_Type         := Stack (Top).Board;\n      Row     : constant Row_Type  := Stack (Top).Row;\n      Col     : constant Col_Type  := Stack (Top).Col;\n      Tile    : constant Tile_Type := Board (Row + 1, Col);\n      Penalty : constant Integer   :=\n        (if To_Row (Tile) <= Row then 0 else 1);\n   begin\n      Board (Row,     Col) := Tile;\n      Board (Row + 1, Col) := 0;\n      Stack (Top + 1) := (Board => Board,\n                          Move  => Down,\n                          Row   => Row + 1,\n                          Col   => Col,\n                          Cost  => Stack (Top).Cost + Penalty);\n   end Move_Down;\n\n   procedure Move_Up is\n      Board   : Board_Type         := Stack (Top).Board;\n      Row     : constant Row_Type  := Stack (Top).Row;\n      Col     : constant Col_Type  := Stack (Top).Col;\n      Tile    : constant Tile_Type := Board (Row - 1, Col);\n      Penalty : constant Integer   :=\n        (if To_Row (Tile) >= Row then 0 else 1);\n   begin\n      Board (Row,     Col) := Tile;\n      Board (Row - 1, Col) := 0;\n      Stack (Top + 1) := (Board => Board,\n                          Move  => Up,\n                          Row   => Row - 1,\n                          Col   => Col,\n                          Cost  => Stack (Top).Cost + Penalty);\n   end Move_Up;\n\n   procedure Move_Left is\n      Board   : Board_Type         := Stack (Top).Board;\n      Row     : constant Row_Type  := Stack (Top).Row;\n      Col     : constant Col_Type  := Stack (Top).Col;\n      Tile    : constant Tile_Type := Board (Row, Col - 1);\n      Penalty : constant Integer :=\n        (if To_Col (Tile) >= Col then 0 else 1);\n   begin\n      Board (Row, Col)     := Tile;\n      Board (Row, Col - 1) := 0;\n      Stack (Top + 1) := (Board => Board,\n                          Move  => Left,\n                          Row   => Row,\n                          Col   => Col - 1,\n                          Cost  => Stack (Top).Cost + Penalty);\n   end Move_Left;\n\n   procedure Move_Right is\n      Board   : Board_Type         := Stack (Top).Board;\n      Row     : constant Row_Type  := Stack (Top).Row;\n      Col     : constant Col_Type  := Stack (Top).Col;\n      Tile    : constant Tile_Type := Board (Row, Col + 1);\n      Penalty : constant Integer :=\n        (if To_Col (Tile) <= Col then 0 else 1);\n   begin\n      Board (Row, Col)     := Tile;\n      Board (Row, Col + 1) := 0;\n      Stack (Top + 1) := (Board => Board,\n                          Move  => Right,\n                          Row   => Row,\n                          Col   => Col + 1,\n                          Cost  => Stack (Top).Cost + Penalty);\n   end Move_Right;\n\n   function Is_Solution return Boolean;\n\n   function Test_Moves return Boolean is\n   begin\n      if\n        Stack (Top).Move /= Down and then\n        Stack (Top).Row  /= Row_Type'First\n      then\n         Move_Up;\n         Top := Top + 1;\n         if Is_Solution then return True; end if;\n         Top := Top - 1;\n      end if;\n\n      if\n        Stack (Top).Move /= Up and then\n        Stack (Top).Row  /= Row_Type'Last\n      then\n         Move_Down;\n         Top := Top + 1;\n         if Is_Solution then return True; end if;\n         Top := Top - 1;\n      end if;\n\n      if\n        Stack (Top).Move /= Right and then\n        Stack (Top).Col  /= Col_Type'First\n      then\n         Move_Left;\n         Top := Top + 1;\n         if Is_Solution then return True; end if;\n         Top := Top - 1;\n      end if;\n\n      if\n        Stack (Top).Move /= Left and then\n        Stack (Top).Col  /= Col_Type'Last\n      then\n         Move_Right;\n         Top := Top + 1;\n         if Is_Solution then return True; end if;\n         Top := Top - 1;\n      end if;\n\n      return False;\n   end Test_Moves;\n\n   function Is_Solution return Boolean is\n      use Ada.Text_IO;\n   begin\n      if Stack (Top).Board = Solved_Board then\n         Put (\"Solved in \" & Top'Image & \" moves: \");\n         for R in 1 .. Top loop\n            Put (String'(Stack (R).Move'Image) (1));\n         end loop;\n         New_Line;\n         return True;\n      end if;\n      if Stack (Top).Cost <= Iteration_Count then\n         return Test_Moves;\n      end if;\n      return False;\n   end Is_Solution;\n\n   procedure Solve (Row   : in Row_Type;\n                    Col   : in Col_Type;\n                    Board : in Board_Type) is\n   begin\n      pragma Assert (Board (Row, Col) = 0);\n      Top := 0;\n      Iteration_Count := 0;\n      Stack (Top) := (Board => Board,\n                      Row   => Row,\n                      Col   => Col,\n                      Move  => Down,\n                      Cost  => 0);\n      while not Is_Solution loop\n         Iteration_Count := Iteration_Count + 1;\n      end loop;\n   end Solve;\n\nbegin\n   Solve (Row   => 2,\n          Col   => 0,\n          Board => ((15, 14, 1, 6),\n                    (9, 11, 4, 12),\n                    (0, 10, 7, 3),\n                    (13, 8, 5, 2)));\nend Puzzle_15;\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_80.txt",
        "content": "\"\"\"\n\nRuns one test of the solver passing a \nstart and goal position.\n\n\"\"\"\n\nfrom astar import *\nimport time\n\n# Rosetta Code start position\n\n\nstart_tiles =    [[ 15, 14,  1,  6],\n                  [ 9, 11,  4, 12],\n                  [ 0, 10,  7,  3],\n                  [13,  8,  5,  2]]\n\ngoal_tiles =        [[ 1,  2,  3,  4],\n                     [ 5,  6,  7,  8],\n                     [ 9, 10, 11, 12],\n                     [13, 14, 15,  0]]\n                 \n\nbefore = time.perf_counter()\n\nresult = a_star(start_tiles,goal_tiles)\n\nafter = time.perf_counter()\n\nprint(\" \")\nprint(\"Path length = \"+str(len(result) - 1))\nprint(\" \")\nprint(\"Path using rlud:\")\nprint(\" \")\nprint(path_as_0_moves(result))\nprint(\" \")\nprint(\"Run time in seconds: \"+str(after - before))\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_81.txt",
        "content": "C:\\bobby\\15puzzlesolver\\my15puzzlesolver>testone.py\n100000 positions examined\n200000 positions examined\n300000 positions examined\n400000 positions examined\n500000 positions examined\n600000 positions examined\n700000 positions examined\n800000 positions examined\n\nPath length = 52\n\nPath using rlud:\n\nrrruldluuldrurdddluulurrrdlddruldluurddlulurruldrrdd\n\nRun time in seconds: 56.601139201\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_82.txt",
        "content": "#lang racket\n\n;;; Solution to the 15-puzzle game, based on the A* algorithm described\n;;; at https://de.wikipedia.org/wiki/A*-Algorithmus\n\n;;; Inspired by the Python solution of the rosetta code:\n;;; http://rosettacode.org/wiki/15_puzzle_solver#Python\n\n(require racket/set)\n(require data/heap)\n\n;; ----------------------------------------------------------------------------\n;; Datatypes\n\n;; A posn is a pair struct containing two integer for the row/col indices.\n(struct posn (row col) #:transparent)\n\n;; A state contains a vector and a posn describing the position of the empty slot.\n(struct state (matrix empty-slot) #:transparent)\n\n(define directions '(up down left right))\n\n;; A node contains a state, a reference to the previous node, a g value (actual\n;; costs until this node, and a f value (g value + heuristics).\n(struct node (state prev cost f-value) #:transparent)\n\n;; ----------------------------------------------------------------------------\n;; Constants\n\n(define side-size 4)\n\n(define initial-state\n  (state\n    #(\n      15  14  1  6\n      9  11  4 12\n      0  10  7  3\n      13  8  5  2)\n    (posn 2 0)))\n\n\n(define goal-state\n  (state\n    #( 1  2  3  4\n      5  6  7 8\n      9 10 11 12\n      13 14 15 0)\n    (posn 3 3)))\n\n;; ----------------------------------------------------------------------------\n;; Functions\n\n;; Matrices are simple vectors, abstracted by following functions.\n(define (matrix-ref matrix row col)\n  (vector-ref matrix (+ (* row side-size) col)))\n\n(define (matrix-set! matrix row col val)\n  (vector-set! matrix\n               (+ (* row side-size) col)\n               val))\n\n(define (target-state? st)\n  (equal? st goal-state))\n\n;; Traverse all nodes until the initial state and generate a return a list\n;; of symbols describing the path.\n(define (reconstruct-movements leaf-node)\n  ;; compute a pair describing the movement.\n  (define (posn-diff p0 p1)\n    (posn (- (posn-row p1) (posn-row p0))\n          (- (posn-col p1) (posn-col p0))))\n  \n  ;; describe a single movement with a symbol (r, l, u d).\n  (define (find-out-movement prev-st st)\n    (let ([prev-empty-slot (state-empty-slot prev-st)]\n          [this-empty-slot (state-empty-slot st)])\n      (match (posn-diff prev-empty-slot this-empty-slot)\n             [(posn  1  0) 'u]\n             [(posn -1  0) 'd]\n             [(posn  0  1) 'l]\n             [(posn  0 -1) 'r]\n             [#f 'invalid])))\n  \n  (define (iter n path)\n    (if (or (not n) (not (node-prev n)))\n        path\n      (iter (node-prev n)\n            (cons (find-out-movement (node-state n)\n                                     (node-state (node-prev n)))\n                  path))))\n  (iter leaf-node '()))\n\n(define (print-path path)\n  (for ([dir (in-list (car path))])\n       (display dir))\n  (newline))\n\n;; Return #t if direction is allowed for the given empty slot position.\n(define (movement-valid? direction empty-slot)\n  (match direction\n         ['up (< (posn-row empty-slot) (- side-size 1))]\n         ['down (> (posn-row empty-slot) 0)]\n         ['left (< (posn-col empty-slot) (- side-size 1))]\n         ['right (> (posn-col empty-slot) 0)]))\n\n;; assumes move direction is valid (see movement-valid?).\n;; Return a new state in the given direction.\n(define (move st direction)\n  (define m (vector-copy (state-matrix st)))\n  (define empty-slot (state-empty-slot st))\n  (define r (posn-row empty-slot))\n  (define c (posn-col empty-slot))\n  (define new-empty-slot\n    (match direction\n           ['up  (begin (matrix-set! m r c (matrix-ref m (+ r 1) c))\n                        (matrix-set! m (+ r 1) c 0)\n                        (posn (+ r 1) c))]\n           ['down (begin (matrix-set! m r c (matrix-ref m (- r 1) c))\n                         (matrix-set! m (- r 1) c 0)\n                         (posn (- r 1) c))]\n           ['left (begin (matrix-set! m r c (matrix-ref m r (+ c 1)))\n                         (matrix-set! m r (+ c 1) 0)\n                         (posn r (+ c 1)))]\n           ['right (begin (matrix-set! m r c (matrix-ref m r (- c 1)))\n                          (matrix-set! m r (- c 1) 0)\n                          (posn r (- c 1)))]))\n  (state m new-empty-slot))\n\n(define (l1-distance posn0 posn1)\n  (+ (abs (- (posn-row posn0) (posn-row posn1)))\n     (abs (- (posn-col posn0) (posn-col posn1)))))\n\n;; compute the L1 distance from the current position and the goal position for\n;; the given val\n(define (element-cost val current-posn)\n  (if (= val 0)\n      (l1-distance current-posn (posn 3 3))\n    (let ([target-row (quotient (- val 1) side-size)]\n          [target-col (remainder (- val 1) side-size)])\n      (l1-distance current-posn (posn target-row target-col)))))\n\n;; compute the l1 distance between this state and the goal-state\n(define (state-l1-distance-to-goal st)\n  (define m (state-matrix st))\n  (for*/fold\n    ([sum 0])\n    ([i (in-range side-size)]\n     [j (in-range side-size)])\n    (let ([val (matrix-ref m i j)])\n      (if (not (= val 0))\n          (+ sum (element-cost val (posn i j)))\n        sum))))\n\n;; the heuristic used is the l1 distance to the goal-state + the number of\n;; linear conflicts found\n(define (state-heuristics st)\n  (+ (state-l1-distance-to-goal st)\n     (linear-conflicts st goal-state)))\n\n;; given a list, return the number of values out of order (used for computing\n;; linear conflicts).\n(define (out-of-order-values lst)\n  (define (iter val-lst sum)\n    (if (empty? val-lst)\n        sum\n      (let* ([val (car val-lst)]\n             [rst (cdr val-lst)]\n             [following-smaller-values\n               (filter (lambda (val2) (> val2 val))\n                       rst)])\n        (iter rst (+ sum (length following-smaller-values))))))\n  (* 2 (iter lst 0)))\n\n;; Number of conflicts in the given row. A conflict happens, when two elements\n;; are already in the correct row, but in the wrong order.\n;; For each conflicted pair add 2 to the value, but a maximum of 6.\n(define (row-conflicts row st0 st1)\n  (define m0 (state-matrix st0))\n  (define m1 (state-matrix st1))\n  \n  (define values-in-correct-row\n    (for/fold\n      ([lst '()])\n      ([col0 (in-range side-size)])\n      (let* ([val0 (matrix-ref m0 row col0)]\n             [in-goal-row?\n               (for/first ([col1 (in-range side-size)]\n                           #:when (= val0 (matrix-ref m1 row col1)))\n                          #t)])\n        (if in-goal-row? (cons val0 lst) lst))))\n  \n  (min 6 (out-of-order-values\n           ; 0 doesn't lead to a linear conflict\n           (filter positive? values-in-correct-row))))\n\n;; Number of conflicts in the given row. A conflict happens, when two elements\n;; are already in the correct column but in the wrong order.\n;; For each conflicted pair add 2 to the value, but a maximum of 6, so that\n;; the heuristic doesn't overestimate the actual costs.\n(define (col-conflicts col st0 st1)\n  (define m0 (state-matrix st0))\n  (define m1 (state-matrix st1))\n  \n  (define values-in-correct-col\n    (for/fold\n      ([lst '()])\n      ([row0 (in-range side-size)])\n      (let* ([val0 (matrix-ref m0 row0 col)]\n             [in-goal-col?\n               (for/first ([row1 (in-range side-size)]\n                           #:when (= val0 (matrix-ref m1 row1 col)))\n                          #t)])\n        (if in-goal-col? (cons val0 lst) lst))))\n  (min 6 (out-of-order-values\n           ; 0 doesn't lead to a linear conflict\n           (filter positive? values-in-correct-col))))\n\n(define (all-row-conflicts st0 st1)\n  (for/fold ([sum 0])\n            ([row (in-range side-size)])\n            (+ (row-conflicts row st0 st1) sum)))\n\n(define (all-col-conflicts st0 st1)\n  (for/fold ([sum 0])\n            ([col (in-range side-size)])\n            (+ (col-conflicts col st0 st1) sum)))\n\n(define (linear-conflicts st0 st1)\n  (+ (all-row-conflicts st0 st1) (all-col-conflicts st0 st1)))\n\n;; Return a list of pairs containing the possible next node and the movement\n;; direction needed.\n(define (next-state-dir-pairs current-node)\n  (define st (node-state current-node))\n  (define empty-slot (state-empty-slot st))\n  (define valid-movements\n    (filter (lambda (dir) (movement-valid? dir empty-slot))\n            directions))\n  (map (lambda (dir)\n         (cons (move st dir) dir))\n       valid-movements))\n\n;; Helper function to pretty-print a state\n(define (display-state st)\n  (define m (state-matrix st))\n  (begin\n    (for ([i (in-range 0 side-size 1)])\n         (newline)\n         (for ([j (in-range 0 side-size 1)])\n              (printf \"~a\\t\" (matrix-ref m i j))))\n    (newline)))\n\n\n(define (A* initial-st)\n  (define (compare-nodes n0 n1)\n    (<= (node-f-value n0) (node-f-value n1)))\n  (define open-lst (make-heap compare-nodes))\n  (define initial-st-cost (state-heuristics initial-st))\n  (heap-add! open-lst (node initial-st #f 0 (state-heuristics initial-st)))\n  (define closed-set (mutable-set))\n  \n  (define (pick-next-node!)\n    (define next-node (heap-min open-lst))\n    (heap-remove-min! open-lst)\n    next-node)\n  \n  (define (sort-lst lst)\n    (sort lst\n          (lambda (n0 n1)\n            (< (node-f-value n0) (node-f-value n1)))))\n  \n  (define (expand-node n)\n    \n    (define n-cost (node-cost n))\n    \n    (define (iter lst)\n      (if (empty? lst)\n          '()\n        (let* ([succ (car lst)]\n               [succ-st (car succ)]\n               [succ-dir (cdr succ)]\n               [succ-cost (+ 1 n-cost)])\n          (if (set-member? closed-set succ-st)\n              (iter (cdr lst))\n            \n            (begin    (heap-add! open-lst\n                                 (node succ-st\n                                       n\n                                       succ-cost\n                                       (+ (state-heuristics succ-st)\n                                          succ-cost)))\n                   (iter (cdr lst)))))))\n    \n    (let ([successors (next-state-dir-pairs n)])\n      (iter successors)))\n  \n  (define counter 0)\n  (define (loop)\n    (define current-node (pick-next-node!))\n    (define current-state (node-state current-node))\n    (set! counter (+ counter 1))\n    (if (= (remainder counter 100000) 0)\n        (printf \"~a ~a ~a\\n\" counter\n                (heap-count open-lst)\n                (node-cost current-node))\n      (void))\n    \n    (cond [(target-state? current-state)\n           (let ([path (reconstruct-movements current-node)])\n             (cons path (length path)))]\n          [else\n            (begin (set-add! closed-set (node-state current-node))\n                   (expand-node current-node)\n                   (if (= (heap-count open-lst) 0)\n                       #f\n                     (loop)))]))\n  (loop))\n\n(module+ main\n         (print-path (A* initial-state)))\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_83.txt",
        "content": "# 20210623 Raku programming solution vCSMt9hkak0\n\nconstant \\Nr = <3 0 0 0 0 1 1 1 1 2 2 2 2 3 3 3>;\nconstant \\Nc = <3 0 1 2 3 0 1 2 3 0 1 2 3 0 1 2>;\n\nmy ($n,$m) = 0,0\u00a0;\nmy @N0 is default(0);\nmy @N3 is default(0);\nmy @N4 is default(0);\nmy @N2 is default(0);\n\nsub fY() {\n   if @N2[$n] == 0x123456789abcdef0 {\n      say \"Solution found in \", $n, \" moves: \", [~] @N3[1..$n] and exit();\n   }\n   return @N4[$n] \u2264 $m\u00a0?? fN()\u00a0!! False\u00a0;\n}\n\nsub fN() {\n   sub common { ++$n; return True if fY(); --$n }\n   if (@N3[$n] ne 'u' && @N0[$n] div 4 < 3) { fI() and common }\n   if (@N3[$n] ne 'd' && @N0[$n] div 4 > 0) { fG() and common }\n   if (@N3[$n] ne 'l' && @N0[$n] \u00a0%  4 < 3) { fE() and common }\n   if (@N3[$n] ne 'r' && @N0[$n] \u00a0%  4 > 0) { fL() and common }\n   return False;\n}\n\nsub fI() {\n   my \\g = (11-@N0[$n])*4;\n   my \\a = @N2[$n] +& (15 +< g);\n   @N0[$n+1]=@N0[$n]+4;\n   @N2[$n+1]=@N2[$n]-a+(a+<16);\n   @N3[$n+1]='d';\n   @N4[$n+1]=@N4[$n]+(Nr[a+>g] \u2264 @N0[$n] div 4\u00a0?? 0\u00a0!! 1);\n}\n\nsub fG() {\n   my \\g = (19-@N0[$n])*4;\n   my \\a = @N2[$n] +& (15 +< g);\n   @N0[$n+1]=@N0[$n]-4;\n   @N2[$n+1]=@N2[$n]-a+(a+>16);\n   @N3[$n+1]='u';\n   @N4[$n+1]=@N4[$n]+(Nr[a+>g] \u2265 @N0[$n] div 4\u00a0?? 0\u00a0!! 1);\n}\n\nsub fE() {\n   my \\g = (14-@N0[$n])*4;\n   my \\a = @N2[$n] +& (15 +< g);\n   @N0[$n+1]=@N0[$n]+1;\n   @N2[$n+1]=@N2[$n]-a+(a+<4);\n   @N3[$n+1]='r';\n   @N4[$n+1]=@N4[$n]+(Nc[a+>g] \u2264 @N0[$n]%4\u00a0?? 0\u00a0!! 1);\n}\n\nsub fL(){\n   my \\g = (16-@N0[$n])*4;\n   my \\a = @N2[$n] +& (15 +< g);\n   @N0[$n+1]=@N0[$n]-1;\n   @N2[$n+1]=@N2[$n]-a+(a+>4);\n   @N3[$n+1]='l';\n   @N4[$n+1]=@N4[$n]+(Nc[a+>g] \u2265 @N0[$n]%4\u00a0?? 0\u00a0!! 1);\n}\n\nsub fifteenSolver(\\n, \\g){@N0[0]=n; @N2[0]=g}\n\n\nfifteenSolver(8,0xfe169b4c0a73d852);\nloop { fY() or ++$m }\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_84.txt",
        "content": "Solution found in 52 moves: rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_85.txt",
        "content": "const NR: [i32; 16] = [3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3];\nconst NC: [i32; 16] = [3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2];\n\nconst I: u8 = 1;\nconst G: u8 = 8;\nconst E: u8 = 2;\nconst L: u8 = 4;\n\nstruct FifteenSolver {\n    n: usize,\n    limit: usize,\n    n0: [i32; 85],\n    n3: [u8; 85],\n    n4: [usize; 85],\n    n2: [u64; 85],\n}\n\nimpl FifteenSolver {\n    fn f_y(&mut self) -> bool {\n        if self.n2[self.n] == 0x123456789abcdef0 {\n            return true;\n        }\n        if self.n4[self.n] <= self.limit {\n            return self.f_n();\n        }\n        false\n    }\n\n    fn f_z(&mut self, w: u8) -> bool {\n        if w & I != 0 {\n            self.f_i();\n            if self.f_y() {\n                return true;\n            }\n            self.n -= 1;\n        }\n        if w & G != 0 {\n            self.f_g();\n            if self.f_y() {\n                return true;\n            }\n            self.n -= 1;\n        }\n        if w & E != 0 {\n            self.f_e();\n            if self.f_y() {\n                return true;\n            }\n            self.n -= 1;\n        }\n        if w & L != 0 {\n            self.f_l();\n            if self.f_y() {\n                return true;\n            }\n            self.n -= 1;\n        }\n        false\n    }\n\n    fn f_n(&mut self) -> bool {\n        self.f_z(match self.n0[self.n] {\n            0 => match self.n3[self.n] {\n                b'l' => I,\n                b'u' => E,\n                _ => I + E,\n            },\n            3 => match self.n3[self.n] {\n                b'r' => I,\n                b'u' => L,\n                _ => I + L,\n            },\n            1 | 2 => match self.n3[self.n] {\n                b'l' => I + L,\n                b'r' => I + E,\n                b'u' => E + L,\n                _ => L + E + I,\n            },\n            12 => match self.n3[self.n] {\n                b'l' => G,\n                b'd' => E,\n                _ => E + G,\n            },\n            15 => match self.n3[self.n] {\n                b'r' => G,\n                b'd' => L,\n                _ => G + L,\n            },\n            13 | 14 => match self.n3[self.n] {\n                b'l' => G + L,\n                b'r' => E + G,\n                b'd' => E + L,\n                _ => G + E + L,\n            },\n            4 | 8 => match self.n3[self.n] {\n                b'l' => I + G,\n                b'u' => G + E,\n                b'd' => I + E,\n                _ => I + G + E,\n            },\n            7 | 11 => match self.n3[self.n] {\n                b'd' => I + L,\n                b'u' => G + L,\n                b'r' => I + G,\n                _ => I + G + L,\n            },\n            _ => match self.n3[self.n] {\n                b'd' => I + E + L,\n                b'l' => I + G + L,\n                b'r' => I + G + E,\n                b'u' => G + E + L,\n                _ => I + G + E + L,\n            },\n        })\n    }\n\n    fn f_i(&mut self) {\n        let g = (11 - self.n0[self.n]) * 4;\n        let a = self.n2[self.n] & (15u64 << g);\n        self.n0[self.n + 1] = self.n0[self.n] + 4;\n        self.n2[self.n + 1] = self.n2[self.n] - a + (a << 16);\n        self.n3[self.n + 1] = b'd';\n        self.n4[self.n + 1] = self.n4[self.n];\n        let cond = NR[(a >> g) as usize] <= self.n0[self.n] / 4;\n        if !cond {\n            self.n4[self.n + 1] += 1;;\n        }\n        self.n += 1;\n    }\n\n    fn f_g(&mut self) {\n        let g = (19 - self.n0[self.n]) * 4;\n        let a = self.n2[self.n] & (15u64 << g);\n        self.n0[self.n + 1] = self.n0[self.n] - 4;\n        self.n2[self.n + 1] = self.n2[self.n] - a + (a >> 16);\n        self.n3[self.n + 1] = b'u';\n        self.n4[self.n + 1] = self.n4[self.n];\n        let cond = NR[(a >> g) as usize] >= self.n0[self.n] / 4;\n        if !cond {\n            self.n4[self.n + 1] += 1;\n        }\n        self.n += 1;\n    }\n\n    fn f_e(&mut self) {\n        let g = (14 - self.n0[self.n]) * 4;\n        let a = self.n2[self.n] & (15u64 << g);\n        self.n0[self.n + 1] = self.n0[self.n] + 1;\n        self.n2[self.n + 1] = self.n2[self.n] - a + (a << 4);\n        self.n3[self.n + 1] = b'r';\n        self.n4[self.n + 1] = self.n4[self.n];\n        let cond = NC[(a >> g) as usize] <= self.n0[self.n] % 4;\n        if !cond {\n            self.n4[self.n + 1] += 1;\n        }\n        self.n += 1;\n    }\n\n    fn f_l(&mut self) {\n        let g = (16 - self.n0[self.n]) * 4;\n        let a = self.n2[self.n] & (15u64 << g);\n        self.n0[self.n + 1] = self.n0[self.n] - 1;\n        self.n2[self.n + 1] = self.n2[self.n] - a + (a >> 4);\n        self.n3[self.n + 1] = b'l';\n        self.n4[self.n + 1] = self.n4[self.n];\n        let cond = NC[(a >> g) as usize] >= self.n0[self.n] % 4;\n        if !cond {\n            self.n4[self.n + 1] += 1;\n        }\n        self.n += 1;\n    }\n\n    fn new(n: i32, g: u64) -> Self {\n        let mut solver = FifteenSolver {\n            n: 0,\n            limit: 0,\n            n0: [0; 85],\n            n3: [0; 85],\n            n4: [0; 85],\n            n2: [0; 85],\n        };\n        solver.n0[0] = n;\n        solver.n2[0] = g;\n        solver\n    }\n\n    fn solve(&mut self) {\n        while !self.f_n() {\n            self.n = 0;\n            self.limit += 1;\n        }\n        println!(\n            \"Solution found in {} moves: {}\",\n            self.n,\n            std::str::from_utf8(&self.n3[1..=self.n]).unwrap()\n        );\n    }\n}\n\nfn main() {\n    FifteenSolver::new(8, 0xfe169b4c0a73d852).solve();\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_86.txt",
        "content": "Solution found in 52 moves: rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_87.txt",
        "content": "use keyed_priority_queue::KeyedPriorityQueue;\nuse std::cmp::{Ord, Ordering, PartialOrd, Reverse};\n\nstatic CORRECT_ORDER: [u8; 16] = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 0];\nstatic ROW: [i32; 16] = [0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3];\nstatic COLUMN: [i32; 16] = [0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3];\n\n#[derive(Debug, Clone)]\nstruct State {\n    est_tot_moves: u8,\n    moves: String,\n    est_moves_rem: u8,\n}\n\nimpl PartialOrd for State {\n    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {\n        Some(self.est_tot_moves.cmp(&other.est_tot_moves))\n    }\n}\n\nimpl Eq for State {}\n\nimpl PartialEq for State {\n    fn eq(&self, other: &Self) -> bool {\n        self.est_tot_moves.cmp(&other.est_tot_moves) == Ordering::Equal\n    }\n}\n\nimpl Ord for State {\n    fn cmp(&self, other: &Self) -> Ordering {\n        self.est_tot_moves\n            .partial_cmp(&other.est_tot_moves)\n            .unwrap()\n    }\n}\n\nimpl State {\n    fn init(order: &[u8; 16]) -> State {\n        State {\n            est_tot_moves: State::estimate_moves(&order),\n            moves: String::from(\"\"),\n            est_moves_rem: 0,\n        }\n    }\n\n    fn find_index(order: &[u8; 16], tile: &u8) -> usize {\n        order.iter().position(|&x| x == *tile).unwrap()\n    }\n\n    fn estimate_moves(current: &[u8; 16]) -> u8 {\n        let mut h = 0;\n        for tile in current.iter() {\n            let current_index = State::find_index(current, &tile);\n            let correct_index = State::find_index(&CORRECT_ORDER, &tile);\n            h += ((COLUMN[current_index] - COLUMN[correct_index]).abs()\n                + (ROW[current_index] - ROW[correct_index]).abs()) as u8;\n        }\n        h\n    }\n\n    fn make_move(\n        &self,\n        order: &[u8; 16],\n        dir: fn(usize, [u8; 16]) -> ([u8; 16], String),\n    ) -> ([u8; 16], State) {\n        let est_moves_rem = State::estimate_moves(order);\n        let (new_order, from) = dir(State::find_index(order, &0), *order);\n        let moves = format!(\"{}{}\", self.moves, from);\n        let new_state = State {\n            est_tot_moves: moves.len() as u8 + est_moves_rem,\n            moves,\n            est_moves_rem,\n        };\n        return (new_order, new_state);\n    }\n\n    fn left(index: usize, mut order: [u8; 16]) -> ([u8; 16], String) {\n        order.swap(index, index - 1);\n        return (order, String::from(\"l\"));\n    }\n\n    fn right(index: usize, mut order: [u8; 16]) -> ([u8; 16], String) {\n        order.swap(index, index + 1);\n        return (order, String::from(\"r\"));\n    }\n\n    fn up(index: usize, mut order: [u8; 16]) -> ([u8; 16], String) {\n        order.swap(index, index - 4);\n        return (order, String::from(\"u\"));\n    }\n\n    fn down(index: usize, mut order: [u8; 16]) -> ([u8; 16], String) {\n        order.swap(index, index + 4);\n        return (order, String::from(\"d\"));\n    }\n\n    fn children(&self, order: &[u8; 16]) -> Vec<([u8; 16], State)> {\n        let index = State::find_index(order, &0);\n        let mut new_states: Vec<([u8; 16], State)> = Vec::new();\n        if COLUMN[index] > 0 {\n            new_states.push(self.make_move(order, State::left))\n        }\n        if COLUMN[index] < 3 {\n            new_states.push(self.make_move(order, State::right))\n        }\n        if ROW[index] > 0 {\n            new_states.push(self.make_move(order, State::up))\n        }\n        if ROW[index] < 3 {\n            new_states.push(self.make_move(order, State::down))\n        }\n        new_states\n    }\n}\n\nfn main() {\n    let mut open_states = KeyedPriorityQueue::<[u8; 16], Reverse<State>>::new();\n    let start_order = [15, 14, 1, 6, 9, 11, 4, 12, 0, 10, 7, 3, 13, 8, 5, 2];\n    // let start_order = [0, 1, 2, 3, 5, 6, 7, 4, 9, 10, 11, 8, 13, 14, 15, 12];\n    open_states.push(start_order, Reverse(State::init(&start_order)));\n    let mut closed_states = KeyedPriorityQueue::<[u8; 16], Reverse<State>>::new();\n\n    'outer: while let Some((parent_order, Reverse(parent_state))) = open_states.pop() {\n        for (child_order, child_state) in parent_state.children(&parent_order) {\n            match (\n                open_states.get_priority(&child_order).as_ref(),\n                closed_states.get_priority(&child_order).as_ref(),\n            ) {\n                (None, None) => {\n                    if child_order == CORRECT_ORDER {\n                        println!(\"There are {} entries in the open list.\", open_states.len());\n                        println!(\n                            \"There are {} entries in the closed list.\",\n                            closed_states.len()\n                        );\n                        println!(\n                            \"Reaching the final board took {} moves.\",\n                            child_state.moves.len()\n                        );\n                        println!(\"The moves used were {}.\", child_state.moves);\n                        println!(\n                            \"The final order is:\\n{:?}\\n{:?}\\n{:?}\\n{:?}.\",\n                            &child_order[0..4],\n                            &child_order[4..8],\n                            &child_order[8..12],\n                            &child_order[12..16]\n                        );\n                        break 'outer;\n                    }\n                    open_states.push(child_order, Reverse(child_state.clone()));\n                }\n                (Some(&Reverse(open_state)), None)\n                    if open_state.moves.len() > child_state.moves.len() =>\n                {\n                    open_states.set_priority(&child_order, Reverse(child_state.clone()));\n                }\n                // (None, Some(&Reverse(closed_state))) if closed_state.moves.len() > child_state.moves.len() => {\n                //     closed_states.remove_item(&child_order);\n                //     open_states.push(child_order, Reverse(child_state.clone()));\n                // },\n                _ => {}\n            };\n        }\n        closed_states.push(parent_order, Reverse(parent_state));\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_88.txt",
        "content": "There are 22525454 entries in the open list.\nThere are 24568220 entries in the closed list.\nReaching the final board took 52 moves.\nThe moves used were rrruldluuldrurdddluulurrrdlddruldluurddlulurruldrrdd.\nThe final order is:\n[1, 2, 3, 4]\n[5, 6, 7, 8]\n[9, 10, 11, 12]\n[13, 14, 15, 0].",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_89.txt",
        "content": "import scala.collection.mutable\ncase class Board(table: Array[Int], r: Int, c: Int, parent: List[String] = List()) {\n  def cloneSwap(r: Int, c: Int, rr: Int, cc: Int) = {\n    val cTable = table.clone\n    // Fancy way to access table(r)(c) in linear array\n    // Equivalent with cTable(r*4 + c) \n    cTable(r << 2 | c) = table(rr << 2 | cc)\n    cTable(rr << 2 | cc) = table(r << 2 | c)\n    cTable\n  }\n  def up() =\n    if (r > 0) { Some(Board(cloneSwap(r, c, r - 1, c), r - 1, c, \"u\" :: parent))\n    } else None\n  def down() =\n    if (r < 3) { Some(Board(cloneSwap(r, c, r + 1, c), r + 1, c, \"d\" :: parent))\n    } else None\n  def left() =\n    if (c > 0) { Some(Board(cloneSwap(r, c, r, c - 1), r, c - 1, \"l\" :: parent))\n    } else None\n  def right() =\n    if (c < 3) { Some(Board(cloneSwap(r, c, r, c + 1), r, c + 1, \"r\" :: parent))\n    } else None\n  def format: String = {\n    table.sliding(4, 4).toList.map(_.map(i \u21d2 f\"$i%4d\").mkString).mkString(\"\\n\")\n  }\n  // Manhattan distance\n  def heuristic() = {\n    val posF = Board.finalBoard.positionMap\n    val posT = positionMap\n    var res = 0;\n    for (i \u2190 0 to 15) {\n      val (x, y) = posF(i)\n      val (xx, yy) = posT(i)\n      res += (Math.abs(x - xx) + Math.abs(y - yy))\n    }\n    res\n  }\n  def key = table.mkString(\",\")\n  def travelled() = parent.length\n  // Find children/neighbours, flatten eliminates the empty boundaries\n  def children: List[Board] = List(this.up(), this.down(), this.right(), this.left()).flatten\n  // Map number to positions\n  lazy val positionMap: Map[Int, (Int, Int)] = {\n    val res = mutable.Map[Int, (Int, Int)]()\n    for (x \u2190 0 to 3; y \u2190 0 to 3) {\n      res(table(x << 2 | y)) = (x, y)\n    }\n    res.toMap\n  }\n}\n\nimport Board._\nobject Solver extends App {\n  def solve(initBoard: Board, wTravel:Int, wHeuristic: Int ) {\n    // Setup weights for the heuristic, more weight to heuristic faster but longer solution.\n    def aStar(b:  Board) = wHeuristic * b.heuristic() + wTravel * b.travelled()\n    implicit val ob = new Ordering[Board] {\n      override def compare(x: Board, y: Board) = {\n        aStar(y) - aStar(x)\n      }\n    }\n    val start = System.currentTimeMillis()\n    var found = false\n    var head = initBoard\n    val pq: mutable.PriorityQueue[Board] = new mutable.PriorityQueue()\n    pq.enqueue(head)\n    val visited = mutable.HashSet[String]()\n    var explore = 0\n    while (pq.nonEmpty && !found) {\n      head = pq.dequeue()\n      visited.add(head.key)\n      if (!head.key.equals(finalBoard.key)) {\n        val newChildren = head.children.filter(child \u21d2 !visited.contains(child.key))\n        visited ++= (newChildren.map(_.key))\n        pq.enqueue(newChildren: _*)\n        explore += 1\n      } else found = true\n      if (explore % 5000 == 0)\n        println(s\"# $explore: A* ${aStar(head)}  g:${head.travelled()} h:${head.heuristic()}\")\n    }\n    if (found) {\n      println(s\"Exploring $explore states, solution with length ${head.parent.length}.\")\n      println(s\"Weighted heuristic used $wHeuristic * heuristic + $wTravel * travel.\")\n      println(initBoard.format)\n      println(head.parent.mkString.reverse)\n    }\n    println(\"Total time: \" + (System.currentTimeMillis() - start) / 1000.0 + \" seconds\")\n  }\n  solve(startEasy, 4, 5)\n  solve(startHard, 1, 2 )\n}\n\nobject Board {\n  val finalBoard = Board(Array(Array(1, 2, 3, 4), Array(5, 6, 7, 8), Array(9, 10, 11, 12), Array(13, 14, 15, 0)).flatten, 3, 3)\n  val startEasy = Board(Array(Array(15, 14, 1, 6), Array(9, 11, 4, 12), Array(0, 10, 7, 3), Array(13, 8, 5, 2)).flatten, 2, 0)\n  val startHard = Board(Array(Array(0, 12, 9, 13), Array(15, 11, 10, 14), Array(3, 7, 2, 5), Array(4, 8, 6, 1)).flatten, 0, 0)\n}\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_9.txt",
        "content": "Solved in  52 moves: RRRULDDLUUULDRURDDDRULLULURRRDDLDLUURDDLULURRULDRDRD",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_90.txt",
        "content": "Exploring 698181 states, found solution with length 52.\nWeighted heuristic used 5 * heuristic + 4 * travel.\n  15  14   1   6\n   9  11   4  12\n   0  10   7   3\n  13   8   5   2\nrrruldluuldrurdddluulurrrdlddruldluurddlulurruldrrdd\nTotal time: 48.884 seconds",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_91.txt",
        "content": "Exploring 6117 states, found solution with length 106.\nWeighted heuristic used 2 * heuristic + 1 * travel.\n   0  12   9  13\n  15  11  10  14\n   3   7   2   5\n   4   8   6   1\nddrrurdlulddruldrruluuldlddrruulldrrdruuuldlldrdruruuldldrrululdlurdddluurdrdluldrruluurrddldruulddrulurdd\nTotal time: 0.328 seconds\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_92.txt",
        "content": "Exploring 728832 states, solution with length 98.\nWeighted heuristic used 9 * heuristic + 5 * travel.\n   0  12   9  13\n  15  11  10  14\n   3   7   2   5\n   4   8   6   1\nddrruldrdlururddluuuldlddrruulldrrruuldlldrrruuldldrrululdlurddlurdrrdllluruurrddldllurdrrulldrurd\nTotal time: 117.666 seconds\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_93.txt",
        "content": "# Solve a 15 puzzle https://rosettacode.org/wiki/15_puzzle_solver#Uiua\n# Experimental!\nT \u2190 \u21af4_4 \u21bb1\u21e116\n# Return shuffled copy of the input.\nShuffle \u2190 \u228f\u22b8(\u234f[\u2365\u2682]\u29fb)\n# Positions of the numbers (not 0)\nPos \u2190 \u2261(\u22a2\u229a\u2315)\u21981\u21e116\u00a4\n\n# Applying a very gentle weighting to certain cells massively\n# speeds up the algorithm\nWeights \u2190 [[2 1 1 2] [2 1 1 2] [2 1 1 2] [2 1 1 1]]\nDistance \u2190 /+\u00d7\u22a1:Weights:\u2261/+\u2335-\u2299.\u2229Pos\nHeuristic \u2190 Distance T\n\n# Four possible neighbours\nNfour \u2190 [[1 0] [\u00af1 0] [0 1] [0 \u00af1]]\n# Actual neighbours at a point.\nValidN \u2190 \u2261(\u2282)\u2299\u00a4:\u27dc(\u25bd\u22b8(\u22650\u2261/\u21a7)\u25bd\u22b8(<4\u2261/\u21a5)+Nfour)\u00a4\n# Precalculate them.\nValidNs \u2190 \u229e(\u25a1 ValidN\u229f)\u21e14 \u21e14\n\n# Get the valid (from to) moves from this cell.\nMoves \u2190 \u00b0\u25a1\u22a1:ValidNs\u22a2\u229a\u23150\n# Swap the values at the indexes [0 1] [a b 2 3] -> [b a 2 3]\nSwap \u2190 \u235c(\u22a1|\u2218\u25cc) \u2283(\u21cc\u2299\u2218|\u22a1)\n# List the possible next positions for a position\nNext \u2190 \u2299\u25cc\u2261(Swap \u2299.)\u2299\u00a4\u22b8Moves\nSolve \u2190 (\n  &p\"Running...\"&p.\n  \u235cnowastar(Next|Heuristic|\u224dT)\n  &p$\"_ seconds\"\n  # Track the movement of the 0 between adjacent steps.\n  \u2261(/-)\u25eb2\u25c7\u2261(\u22a2\u229a\u23150)\u21cc\u22a2\n  # Map each to a direction string and join.\n  /\u2282\u21cc\u2261\u2363(\"d\" \u00b0\u00af1_0|\"u\" \u00b01_0|\"r\" \u00b00_\u00af1|\"l\" \u00b00_1|\u2218)\n)\n\n# Uncomment one of the following lines to try random grids\n# \u2365(Swap\u22a1\u22b8(\u230a\u00d7\u2682\u29fb)\u22b8Moves)90 T\n# [[2 14 6 4] [5 1 3 8] [9 10 7 11] [13 0 15 12]] # Simple 40 shuffles\n# [[5 1 2 3] [6 10 7 4] [13 9 11 8] [14 0 15 12]] # Simple 12 steps\n# [[9 1 2 4] [13 6 5 7] [3 11 14 15] [10 0 8 12]] # 34 steps\n# [[10 3 1 4] [13 5 8 7] [9 6 0 11] [14 15 12 2]] # 38 steps (a few seconds)\n[[15 14 1 6] [9 11 4 12] [0 10 7 3] [13 8 5 2]] # Main Challenge\n# [[0 12 9 13] [15 11 10 14] [3 7 2 5] [4 8 6 1]] # Extra Credit\n\nSolve",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_94.txt",
        "content": "\u256d\u2500            \n\u2577 15 14 1  6  \n   9 11 4 12  \n   0 10 7  3  \n  13  8 5  2  \n             \u256f\nRunning...\n7.321068048477173 seconds\n52\n\"rrruldluuldrurdddluulurrrdlddruldluurddlulurruldrrdd\"\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_95.txt",
        "content": "import \"./long\" for ULong\n\nvar Nr = [3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3]\nvar Nc = [3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2]\nvar n  = 0\nvar n1 = 0\nvar N0 = List.filled(85, 0)\nvar N2 = List.filled(85, 0)\nvar N3 = List.filled(85, 0)\nvar N4 = List.filled(85, 0)\nvar i  = 1\nvar g  = 8\nvar e  = 2\nvar l  = 4\n\nvar fN  // forward declaration\n\nvar xx = ULong.fromBaseString(\"123456789abcdef0\", 16)\nvar fifteen = ULong.new(15)\n\nvar fY = Fn.new {\n    if (N2[n] == xx ) return true\n    if (N4[n] <= n1) return fN.call()\n    return false\n}\n\nvar fI = Fn.new {\n    var g = (11 - N0[n]) * 4\n    var a = N2[n] & (fifteen << g)\n    N0[n+1] = N0[n] + 4\n    N2[n+1] = N2[n] - a + (a << 16)\n    N3[n+1] = \"d\"\n    N4[n+1] = N4[n]\n    var cond = Nr[(a >> g).toSmall] <= (N0[n] >> 2)\n    if (!cond) N4[n+1] = N4[n+1] + 1\n    n = n + 1\n}\n\nvar fG = Fn.new {\n    var g = (19 - N0[n]) * 4\n    var a = N2[n] & (fifteen << g)\n    N0[n+1] = N0[n] - 4\n    N2[n+1] = N2[n] - a + (a >> 16)\n    N3[n+1] = \"u\"\n    N4[n+1] = N4[n]\n    var cond = Nr[(a >> g).toSmall] >= (N0[n] >> 2)\n    if (!cond) N4[n+1] = N4[n+1] + 1\n    n = n + 1\n}\n\nvar fE = Fn.new {\n    var g = (14 - N0[n]) * 4\n    var a = N2[n] & (fifteen << g)\n    N0[n+1] = N0[n] + 1\n    N2[n+1] = N2[n] - a + (a << 4)\n    N3[n+1] = \"r\"\n    N4[n+1] = N4[n]\n    var cond = Nc[(a >> g).toSmall] <= N0[n] % 4\n    if (!cond) N4[n+1] = N4[n+1] + 1\n    n = n + 1\n}\n\nvar fL = Fn.new {\n    var g = (16 - N0[n]) * 4\n    var a = N2[n] & (fifteen << g)\n    N0[n+1] = N0[n] - 1\n    N2[n+1] = N2[n] - a + (a >> 4)\n    N3[n+1] = \"l\"\n    N4[n+1] = N4[n]\n    var cond = Nc[(a >> g).toSmall] >= N0[n] % 4\n    if (!cond) N4[n+1] = N4[n+1] + 1\n    n = n + 1\n}\n\nvar fZ = Fn.new { |w|\n    if (w&i > 0) {\n        fI.call()\n        if (fY.call()) return true\n        n = n - 1\n    }\n    if (w&g > 0) {\n        fG.call()\n        if (fY.call()) return true\n        n = n - 1\n    }\n    if (w&e > 0) {\n        fE.call()\n        if (fY.call()) return true\n        n = n - 1\n    }\n    if (w&l > 0) {\n        fL.call()\n        if (fY.call()) return true\n        n = n - 1\n    }\n    return false\n}\n\nfN = Fn.new {\n    var p0 = N0[n]\n    if (p0 == 0) {\n        var p3 = N3[n]\n        if (p3 == \"l\") return fZ.call(i)\n        if (p3 == \"u\") return fZ.call(e)\n        return fZ.call(i + e)\n    } else if (p0 == 3) {\n        var p3 = N3[n]\n        if (p3 == \"r\") return fZ.call(i)\n        if (p3 == \"u\") return fZ.call(l)\n        return fZ.call(i + l)\n    } else if (p0 == 1 || p0 == 2) {\n        var p3 = N3[n]\n        if (p3 == \"l\") return fZ.call(i + l)\n        if (p3 == \"r\") return fZ.call(i + e)\n        if (p3 == \"u\") return fZ.call(e + l)\n        return fZ.call(l + e + i)\n    } else if (p0 == 12) {\n        var p3 = N3[n]\n        if (p3 == \"l\") return fZ.call(g)\n        if (p3 == \"d\") return fZ.call(e)\n        return fZ.call(e + g)\n    } else if (p0 == 15) {\n        var p3 = N3[n]\n        if (p3 == \"r\") return fZ.call(g)\n        if (p3 == \"d\") return fZ.call(l)\n        return fZ.call(g + l)\n    } else if (p0 == 13 || p0 == 14) {\n        var p3 = N3[n]\n        if (p3 == \"l\") return fZ.call(g + l)\n        if (p3 == \"r\") return fZ.call(e + g)\n        if (p3 == \"d\") return fZ.call(e + l)\n        return fZ.call(g + e + l)\n    } else if (p0 == 4 || p0 == 8) {\n        var p3 = N3[n]\n        if (p3 == \"l\") return fZ.call(i + g)\n        if (p3 == \"u\") return fZ.call(g + e)\n        if (p3 == \"d\") return fZ.call(i + e)\n        return fZ.call(i + g + e)\n    } else if (p0 == 7 || p0 == 11) {\n        var p3 = N3[n]\n        if (p3 == \"d\") return fZ.call(i + l)\n        if (p3 == \"u\") return fZ.call(g + l)\n        if (p3 == \"r\") return fZ.call(i + g)\n        return fZ.call(i + g + l)\n    } else {\n        var p3 = N3[n]\n        if (p3 == \"d\") return fZ.call(i + e + l)\n        if (p3 == \"l\") return fZ.call(i + g + l)\n        if (p3 == \"r\") return fZ.call(i + g + e)\n        if (p3 == \"u\") return fZ.call(g + e + l)\n        return fZ.call(i + g + e + l)\n    }\n}\n\nvar fifteenSolver = Fn.new { |n, g|\n    N0[0] = n\n    N2[0] = g\n    N4[0] = 0\n}\n\nvar solve // recursive function\nsolve = Fn.new {\n    if (fN.call()) {\n        System.print(\"Solution found in %(n) moves: \")\n        for (g in 1..n) System.write(N3[g])\n        System.print()\n    } else {\n        n = 0\n        n1 = n1 + 1\n        solve.call()\n    }\n}\n\nfifteenSolver.call(8, ULong.fromBaseString(\"fe169b4c0a73d852\", 16))\nsolve.call()\n",
        "safe": true
    },
    {
        "filename": "15 puzzle solver_96.txt",
        "content": "Solution found in 52 moves: \nrrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_1.txt",
        "content": "T Puzzle\n   position = 0\n   [Int = String] items\n\n   F main_frame()\n      V& d = .items\n      print(\u2018+-----+-----+-----+-----+\u2019)\n      print(\u2018|#.|#.|#.|#.|\u2019.format(d[1], d[2], d[3], d[4]))\n      print(\u2018+-----+-----+-----+-----+\u2019)\n      print(\u2018|#.|#.|#.|#.|\u2019.format(d[5], d[6], d[7], d[8]))\n      print(\u2018+-----+-----+-----+-----+\u2019)\n      print(\u2018|#.|#.|#.|#.|\u2019.format(d[9], d[10], d[11], d[12]))\n      print(\u2018+-----+-----+-----+-----+\u2019)\n      print(\u2018|#.|#.|#.|#.|\u2019.format(d[13], d[14], d[15], d[16]))\n      print(\u2018+-----+-----+-----+-----+\u2019)\n\n   F format(=ch)\n      ch = ch.trim(\u2018 \u2019)\n      I ch.len == 1\n         R \u2018  \u2019ch\u2018  \u2019\n      E I ch.len == 2\n         R \u2018  \u2019ch\u2018 \u2019\n      E\n         assert(ch.empty)\n         R \u2018     \u2019\n\n   F change(=to)\n      V fro = .position\n      L(a, b) .items\n         I b == .format(String(to))\n            to = a\n            L.break\n      swap(&.items[fro], &.items[to])\n      .position = to\n\n   F build_board(difficulty)\n      L(i) 1..16\n         .items[i] = .format(String(i))\n      V tmp = 0\n      L(a, b) .items\n         I b == \u2018  16 \u2019\n            .items[a] = \u2018     \u2019\n            tmp = a\n            L.break\n      .position = tmp\n      Int diff\n      I difficulty == 0\n         diff = 10\n      E I difficulty == 1\n         diff = 50\n      E\n         diff = 100\n      L 0 .< diff\n         V lst = .valid_moves()\n         [Int] lst1\n         L(j) lst\n            lst1.append(Int(j.trim(\u2018 \u2019)))\n         .change(lst1[random:(lst1.len)])\n\n   F valid_moves()\n      V pos = .position\n      I pos C [6, 7, 10, 11]\n         R [.items[pos - 4], .items[pos - 1], .items[pos + 1], .items[pos + 4]]\n      E I pos C [5, 9]\n         R [.items[pos - 4], .items[pos + 4], .items[pos + 1]]\n      E I pos C [8, 12]\n         R [.items[pos - 4], .items[pos + 4], .items[pos - 1]]\n      E I pos C [2, 3]\n         R [.items[pos - 1], .items[pos + 1], .items[pos + 4]]\n      E I pos C [14, 15]\n         R [.items[pos - 1], .items[pos + 1], .items[pos - 4]]\n      E I pos == 1\n         R [.items[pos + 1], .items[pos + 4]]\n      E I pos == 4\n         R [.items[pos - 1], .items[pos + 4]]\n      E I pos == 13\n         R [.items[pos + 1], .items[pos - 4]]\n      E\n         assert(pos == 16)\n         R [.items[pos - 1], .items[pos - 4]]\n\n   F game_over()\n      V flag = 0B\n      L(a, b) .items\n         I b\u00a0!= \u2018     \u2019\n            I a == Int(b.trim(\u2018 \u2019))\n               flag = 1B\n            E\n               flag = 0B\n      R flag\n\nV g = Puzzle()\ng.build_board(Int(input(\"Enter the difficulty\u00a0: 0 1 2\\n2 => highest 0 => lowest\\n\")))\ng.main_frame()\nprint(\u2018Enter 0 to exit\u2019)\nL\n   print(\"Hello user:\\nTo change the position just enter the no. near it\")\n   V lst = g.valid_moves()\n   [Int] lst1\n   L(i) lst\n      lst1.append(Int(i.trim(\u2018 \u2019)))\n      print(i.trim(\u2018 \u2019)\" \\t\", end' \u2018\u2019)\n   print()\n   V x = Int(input())\n   I x == 0\n      L.break\n   E I x !C lst1\n      print(\u2018Wrong move\u2019)\n   E\n      g.change(x)\n   g.main_frame()\n   I g.game_over()\n      print(\u2018You WON\u2019)\n      L.break",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_10.txt",
        "content": "#include <jambo.h>\n\n#define FILATABLA            5\n#define COLUMNATABLA         10\n#define Imprimelamatriz      Gosub 'Pone la matriz'\n#define Imprimelascasillas   Gosub 'Pone las casillas'\n#define Imprimeel\u00edndiceen(_X_,_Y_)  Set '_X_,_Y_',  Gosub 'Pone el \u00edndice'\n\nMain\n   Set break\n\n   Void (casilla, \u00edndice, n\u00fameros)\n   Link gosub( Crea una casilla, Crea el \u00edndice, Crea la matriz de n\u00fameros )\n   \n   Cls\n   x=4, y=4, Tok sep '\"\"', Gosub 'Imprime escenario'\n   \n  /* INICIA EL JUEGO */\n   SW = 1, GANADOR = 0\n   c=0, cero x=4, cero y=4\n   \n   Loop\n       Let ( c:=Getch )\n       Switch ( c )\n           Case 'KRIGHT'  { #( y < 4 ) do{ ++y }, Exit }\n           Case 'KDOWN'   { #( x < 4 ) do{ ++x }, Exit }\n           Case 'KLEFT'   { #( y > 1 ) do{ --y }, Exit }\n           Case 'KUP'     { #( x > 1 ) do{ --x }, Exit }\n           Case 'KRETURN' { If ( Gosub 'Chequear si movimiento es v\u00e1lido' )\n                               Gosub 'Mover las casillas'\n                            End If\n                            Exit\n                          }\n           Case 'KESCAPE' { SW=0 }\n       End switch\n       \n       Gosub 'Imprime escenario'\n       Break if ( Gosub 'Verificar puzzle resuelto' --- Backup to 'GANADOR' )\n   Back if 'SW' is not zero\n\n  /* FIN DEL JUEGO */\n   If ( GANADOR )\n       Locate (18,15), Printnl(\"LO RESOLVISTE!\")\n   End If\n   Locate (19,1), Prnl\nEnd\n\nSubrutines\n\n/* CHEQUEO DE MOVIMIENTO */\n\nDefine ( Verificar puzzle resuelto )\n   ret = 0\n   Clr all marks\n   Tn\u00fameros=n\u00fameros\n   Redim (Tn\u00fameros,0), N = 0, Let ( N\u00a0:= Length(Tn\u00fameros) Minus (1))\n   i=1\n   Iterator ( ++i, Less equal ( i, N ) And( Not(ret) ), \\\n           Let ( ret\u00a0:= Bit xor(i, [i] Get 'Tn\u00fameros') ) )\n   Clr all marks\n   Clear 'Tn\u00fameros'\n\nReturn 'Not (ret); And( Equals(i, Plus one(N)) ) '\n\nDefine ( Chequear si movimiento es v\u00e1lido )\nReturn 'Only one ( Equals (x, cero x), Equals(y, cero y ) )'\n\nDefine ( Mover las casillas )\n   If ( Equals (y, cero y) )\n      If ( Less (x, cero x) )      // mueve hacia abajo\n         Loop for ( i = cero x, #( i >= x ) , --i )\n             If ( Greater ( i, 1 ) )\n                 [{i} Minus(1), y] Get 'n\u00fameros', [i,y] Put 'n\u00fameros'\n             Else\n                 [{i} Plus(1), y] Get 'n\u00fameros', [i,y] Put 'n\u00fameros'\n             End If\n         Next\n      Else                         // por defecto: mueve hacia arriba\n         Loop for ( i = cero x, #( i <= x ) , ++i )\n             If ( Less ( i, 4 ) )\n                 [{i} Plus(1), y] Get 'n\u00fameros', [i,y] Put 'n\u00fameros'\n             Else\n                 [i,y] Get 'n\u00fameros', [{i} Minus(1),y] Put 'n\u00fameros'\n             End If\n         Next\n      End If\n      [x,y] Set '0', Put 'n\u00fameros'\n      Set 'x', Move to 'cero x'\n   Else                           // por defecto: est\u00e1 en la misma fila  \n      If ( Less ( y, cero y ) )   // mueve hacia la derecha\n         Loop for ( i = cero y, #( i >= y ) , --i )\n             If ( Greater ( i, 1) )\n                 [x, {i} Minus(1)] Get 'n\u00fameros', [x,i] Put 'n\u00fameros'\n             Else\n                 [x, y] Get 'n\u00fameros', [x, {i} Plus(1)] Put 'n\u00fameros'\n             End If\n         Next\n      Else                        // por defecto: mueve hacia la izquierda\n         Loop for ( i = cero y, #( i <= y ) , ++i )\n             If ( Less ( i, 4 ) )\n                 [x, {i} Plus(1)] Get 'n\u00fameros', [x,i] Put 'n\u00fameros'\n             Else\n                 [x,i] Get 'n\u00fameros', [x,{i} Minus(1)] Put 'n\u00fameros'\n             End If\n         Next\n      End If\n      [x,y] Set '0', Put 'n\u00fameros'\n      Set 'y', Move to 'cero y'\n   End If\n   Clr all marks\nReturn\n\n/* DESPLIEGUE DE CUADRITOS Y NUMEROS */\n\nDefine ( Imprime escenario )\n   Imprime las casillas\n   Imprime el \u00edndice en 'x,y'\n   Imprime la matriz\nReturn\n\nDefine ( Pone la matriz )\n   i=4, col = COLUMNA TABLA, celda=\"\"\n   Clr all marks\n   py=1\n   Loop\n      j=4, fil = FILA TABLA, px=1\n      Loop\n         Locate 'Plus one(fil), Plus two (col)' \n         Printnl( Get if ([px,py] Get 'n\u00fameros' ---Backup to (celda)---, celda, \"  \") )\n         fil += 3 \n         --j, ++px\n      Back if (j) is not zero\n      col += 6, --i, ++py\n   Back if (i) is not zero\nReturn\n\nDefine ( Pone las casillas )\n   i=4, col = COLUMNA TABLA\n   Clr all marks\n   Loop\n      j=4, fil = FILA TABLA\n      Loop\n         Set 'fil, col', Gosub 'Pone un cuadrito'\n         fil += 3, --j\n      Back if (j) is not zero\n      col += 6, --i\n   Back if (i) is not zero\nReturn\n\nDefine (Pone un cuadrito, fil, col)\n   Locate 'fil, col', Print table 'casilla'\nReturn\n\nDefine ( Pone el \u00edndice, fil, col )\n   /* 5+(fil-1)*3 fila\n      10+(col-1)*6 col */\n   Clr all marks\n   Locate 'Minus one(fil) Mul by (3) Plus (FILA TABLA), Minus one(col) Mulby(6) Plus(COLUMNA TABLA)' \n   Print table '\u00edndice'\nReturn\n\n/* CONFIGURACION DEL JUEGO */\n\nDefine ( Crea la matriz de n\u00fameros )\n   Sequence ( 0, 1, 16, n\u00fameros )\n   Gosub 'Barajar el array'\n   Redim ( n\u00fameros, 4,4 )\nReturn\n\n/* algoritmo de Fisher-Yates */\nDefine ( Barajar el array )\n  N = 0, Let ( N\u00a0:= Length(n\u00fameros) )\n  R = 0, aux = 0\n  Loop\n     Let (R\u00a0:= Ceil(Rand(N)))\n     Let (aux\u00a0:= [R] Get 'n\u00fameros' )\n     [N] Get 'n\u00fameros', [R] Put 'n\u00fameros'\n     Set 'aux', [N] Put 'n\u00fameros'\n     --N\n  Back if 'N' is positive\n  If ( [16] Get 'n\u00fameros' ---Backup to 'aux'---, Not (Is zero?) )\n     [aScan(1,0,n\u00fameros)] Set 'aux', Put 'n\u00fameros'\n     [16] Set '0', Put 'n\u00fameros'\n  End If\nReturn\n\nDefine ( Crea una casilla )\n   Set 'Utf8(Chr(218)),Utf8(Chr(196)),Utf8(Chr(196)),Utf8(Chr(196)),Utf8(Chr(196)),Utf8(Chr(191))', Apnd row 'casilla'\n   Set 'Utf8(Chr(179)),\" \",\" \",\" \",\" \",Utf8(Chr(179))', Apnd row 'casilla'\n   Set 'Utf8(Chr(192)),Utf8(Chr(196)),Utf8(Chr(196)),Utf8(Chr(196)),Utf8(Chr(196)),Utf8(Chr(217))', Apnd row 'casilla'\nReturn\n\nDefine ( Crea el \u00edndice )\n   Set 'Utf8(Chr(220)),Utf8(Chr(220)),Utf8(Chr(220)),Utf8(Chr(220)),Utf8(Chr(220)),Utf8(Chr(220))', Apnd row '\u00edndice'\n   Set 'Utf8(Chr(219)),\" \",\" \",\" \",\" \",Utf8(Chr(219))', Apnd row '\u00edndice'\n   Set 'Utf8(Chr(223)),Utf8(Chr(223)),Utf8(Chr(223)),Utf8(Chr(223)),Utf8(Chr(223)),Utf8(Chr(223))', Apnd row '\u00edndice'\nReturn",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_100.txt",
        "content": "> puz15(scramble.length=4)\n+----+----+----+----+ \n|  1 |  2 |  3 |  4 |\n+----+----+----+----+\n|  5 |  6 |  7 |  8 |\n+----+----+----+----+\n|  9 | 10 |    | 12 |\n+----+----+----+----+\n| 13 | 14 | 11 | 15 |\n+----+----+----+----+\nMove:w\n+----+----+----+----+ \n|  1 |  2 |  3 |  4 |\n+----+----+----+----+\n|  5 |  6 |  7 |  8 |\n+----+----+----+----+\n|  9 | 10 | 11 | 12 |\n+----+----+----+----+\n| 13 | 14 |    | 15 |\n+----+----+----+----+\nMove:a\n+----+----+----+----+ \n|  1 |  2 |  3 |  4 |\n+----+----+----+----+\n|  5 |  6 |  7 |  8 |\n+----+----+----+----+\n|  9 | 10 | 11 | 12 |\n+----+----+----+----+\n| 13 | 14 | 15 |    |\n+----+----+----+----+\n\n[1] \"You win!\"\n\n It took you 2 moves. \n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_101.txt",
        "content": "#lang racket/base\n(require 2htdp/universe 2htdp/image racket/list racket/match)\n\n(define ((fifteen->pict (finished? #f)) fifteen)\n  (for/fold ((i (empty-scene 0 0))) ((r 4))\n    (define row\n      (for/fold ((i (empty-scene 0 0))) ((c 4))\n        (define v (list-ref fifteen (+ (* r 4) c)))\n        (define cell\n          (if v\n              (overlay/align\n               \"center\" \"center\"\n               (rectangle 50 50 'outline (if finished? \"white\" \"blue\"))\n               (text (number->string v) 30 \"black\"))\n              (rectangle 50 50 'solid (if finished? \"white\" \"powderblue\"))))\n        (beside i cell)))\n    (above i row)))\n\n(define (move-space fifteen direction)\n  (define idx (for/first ((i (in-naturals)) (x fifteen) #:unless x) i))\n  (define-values (row col) (quotient/remainder idx 4))\n  (define dest (+ idx (match direction\n                        ['l #:when (> col 0) -1]\n                        ['r #:when (< col 3)  1]\n                        ['u #:when (> row 0) -4]\n                        ['d #:when (< row 3)  4]\n                        [else 0])))\n    (list-set (list-set fifteen idx (list-ref fifteen dest)) dest #f))\n\n(define (key-move-space fifteen a-key)\n  (cond [(key=? a-key \"left\") (move-space fifteen 'l)]\n        [(key=? a-key \"right\") (move-space fifteen 'r)]\n        [(key=? a-key \"up\") (move-space fifteen 'u)]\n        [(key=? a-key \"down\") (move-space fifteen 'd)]\n        [else fifteen]))\n\n(define (shuffle-15 fifteen shuffles)\n  (for/fold ((rv fifteen)) ((_ shuffles))\n    (move-space rv (list-ref '(u d l r) (random 4)))))\n\n(define fifteen0 '(1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 #f))\n\n(define (solved-world? w) (equal? w fifteen0))\n\n(big-bang (shuffle-15 fifteen0 200)\n          (name \"Fifteen\")\n          (to-draw (fifteen->pict))\n          (stop-when solved-world? (fifteen->pict #t))\n          (on-key key-move-space))\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_102.txt",
        "content": "use Term::termios;\n\nconstant $saved   = Term::termios.new(fd => 1).getattr;\nconstant $termios = Term::termios.new(fd => 1).getattr;\n# raw mode interferes with carriage returns, so\n# set flags needed to emulate it manually\n$termios.unset_iflags(<BRKINT ICRNL ISTRIP IXON>);\n$termios.unset_lflags(< ECHO ICANON IEXTEN ISIG>);\n$termios.setattr(:DRAIN);\n\n# reset terminal to original setting on exit\nEND { $saved.setattr(:NOW) }\n\nconstant n    = 4; # board size\nconstant cell = 6; # cell width\n\nconstant $top = join '\u2500' x cell, '\u250c', '\u252c' xx n-1, '\u2510';\nconstant $mid = join '\u2500' x cell, '\u251c', '\u253c' xx n-1, '\u2524';\nconstant $bot = join '\u2500' x cell, '\u2514', '\u2534' xx n-1, '\u2518';\n\nmy %dir = (\n   \"\\e[A\" => 'up',\n   \"\\e[B\" => 'down',\n   \"\\e[C\" => 'right',\n   \"\\e[D\" => 'left',\n);\n\nmy @solved = [1,2,3,4],[5,6,7,8],[9,10,11,12],[13,14,15,' '];\nmy @board;\nnew();\n\nsub new () {\n    loop {\n       @board = shuffle();\n       last if parity-ok(@board);\n   }\n}\n\nsub parity-ok (@b) {\n    my $row = @b.first(/' '/,:k);\n    my $col = @b[$row].first(/' '/,:k);\n    so ([3,3] <<->> [$row,$col]).sum\u00a0%% 2;\n}\n\nsub shuffle () {\n    my @c = [1,2,3,4],[5,6,7,8],[9,10,11,12],[13,14,15,' '];\n    for (^16).pick(*) -> $y, $x {\n        my ($yd, $ym, $xd, $xm) = ($y div n, $y mod n, $x div n, $x mod n);\n        @(@c[$ym;$yd],@c[$xm;$xd]) = @(@c[$xm;$xd],@c[$ym;$yd]);\n    }\n    @c;\n}\n\nsub row (@row) { '\u2502' ~ (join '\u2502', @row\u00bb.&center) ~ '\u2502' }\n\nsub center ($s){\n    my $c   = cell - $s.chars;\n    my $pad = ' ' x ceiling($c/2);\n    sprintf \"%{cell}s\", \"$s$pad\";\n}\n\nsub draw-board {\n    run('clear');\n    print qq:to/END/;\n\n\n\tPress direction arrows to move.\n\n\tPress q to quit. Press n for a new puzzle.\n\n\t$top\n\t{ join \"\\n\\t$mid\\n\\t\", map { .&row }, @board }\n\t$bot\n\n\t{ (so @board ~~ @solved)\u00a0?? 'Solved!!'\u00a0!! '' }\nEND\n}\n\nsub slide (@c is copy) {\n    my $t = (grep { /' '/ },\u00a0:k, @c)[0];\n    return @c unless $t and $t > 0;\n    @c[$t,$t-1] = @c[$t-1,$t];\n    @c;\n}\n\nproto sub move (|) {*};\n\nmulti move('up') {\n    map { @board[*;$_] = reverse slide reverse @board[*;$_] }, ^n;\n}\n\nmulti move('down') {\n    map { @board[*;$_] = slide @board[*;$_] }, ^n;\n}\n\nmulti move('left') {\n    map { @board[$_] = reverse slide reverse @board[$_] }, ^n;\n}\n\nmulti move('right') {\n    map { @board[$_] = slide @board[$_] }, ^n;\n}\n\nloop {\n    draw-board;\n\n    # Read up to 4 bytes from keyboard buffer.\n    # Page navigation keys are 3-4 bytes each.\n    # Specifically, arrow keys are 3.\n    my $key = $*IN.read(4).decode;\n\n    move %dir{$key} if so %dir{$key};\n    last if $key eq 'q'; # (q)uit\n    new() if $key eq 'n';\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_103.txt",
        "content": "\tPress direction arrows to move.\n\n\tPress q to quit. Press n for a new puzzle.\n\n\t\u250c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u2510\n\t\u2502  2   \u2502  1   \u2502  10  \u2502  14  \u2502\n\t\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\t\u2502  15  \u2502  11  \u2502  12  \u2502      \u2502\n\t\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\t\u2502  13  \u2502  3   \u2502  6   \u2502  7   \u2502\n\t\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\t\u2502  9   \u2502  4   \u2502  5   \u2502  8   \u2502\n\t\u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2518\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_104.txt",
        "content": "rebol []  random/seed now  g: [style t box red [\n  if not find [0x108 108x0 0x-108 -108x0] face/offset - e/offset [exit]\n  x: face/offset face/offset: e/offset e/offset: x] across\n] x: random repeat i 15 [append x:[] i]  repeat i 15 [\n  repend g ['t mold x/:i random white] if find [4 8 12] i [append g 'return]\n] append g [e: box]  view layout g\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_105.txt",
        "content": "Red [Needs: 'view]\nsystem/view/screens/1/pane/-1/visible?: false ;; suppress console window\n;; because this code is heavily influenced / (copied from ... )\n;; by the rebol version ( which actually works with red as well with\n;; some minimal changes ) i added some comments to make the\n;; code more readable...\n\n;;-----------------------------------------\n;; check, if puzzle is solved, OK button closes program\n;;-----------------------------------------\ncheck: does [\n;; the text on each tile must be equal to its position:\n  repeat pos 15 [ unless pos = to-integer lay/pane/:pos/text  [exit] ]\n  view/flags [  title \"SuCCeSS\" \n                 text \"You solved the puzzle\u00a0! \"  button \"OK\"  [quit]\n    ] [modal popup]    \n]\n;;--------------------------------------\n;; actually only changes text / Number on tile / button\n;;---------------------------------------\nchangeTiles: func [ f ][\n  ;; this is tricky, check if e(mpty) button is one in of the\n  ;; four valid positions , by simply subtracting their offsets...else exit ( no change)\n  unless find  [ 0x52 0x-52 52x0 -52x0 ] f/offset - e/offset [return false]\n  e/text: f/text  ;; empty button gets Number from clicked button\n  e/visible?: true  ;; empty gets visible\n  f/visible?: false ;; clicked button gets invisible\n  e: f    ;; e(mpty) refers now to clicked button\n  return true ;; true - change has happened\n]\n;;-----------------------------------------\n;; function which is executed, when button is clicked\n;; argument is face - button\n;;-------------------------------------\nbClicked: func [f][   if changeTiles f [check] ]\n \n;; define the window:\n;; style is a prototype definition for a button element\nwin:   [ title \"15 Puzzle\"\n\t\tbackdrop silver\n\t\tstyle btn: button 40x40  [bClicked face] font-size 15 bold \n]\n;; generate 1..15 buttons with number \nrepeat nr 15 [\n     repend win  [ 'btn form nr ] ;; repend reduces and then appends..\n     if  0 = mod nr 4  [  append win  'return ] ;; \"carriage return\" in window after 4 buttons\n\t]\n  ;; append empty / hidden button no 16 and return/quit button:\n\tappend win [ e: btn \"16\" hidden return  button \"Quit\" [quit]]\n   \nlay: layout win\n;; define win as layout, so  each button can now be addressed as\n;; layout/pane/index ( 1..15 - redbol is 1 based )\n\nflip: 0 \n;; start random generator, otherwise we always get the same puzzle\nrandom/seed now/time/precise \n;; lets flip random tiles a few times to initialize the puzzle\n;; ( actually numbers < 100 are quite easy to solve )\n\nwhile [ flip < 40 ] [ if changeTiles lay/pane/(random 16)  [ flip:  flip  + 1 ]  ]\n\n;; show the window...      \nview  lay\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_106.txt",
        "content": "/*REXX pgm implements the 15\u2500puzzle (AKA: Gem Puzzle, Boss Puzzle, Mystic Square, 14\u250015)*/\nparse arg N seed .                               /*obtain optional arguments from the CL*/\nif N=='' | N==\",\"  then N=4                      /*Not specified?  Then use the default.*/\nif datatype(seed, 'W')  then call random ,,seed  /*use repeatability seed for RANDOM BIF*/\nnh= N**2;   @.=;    nn= nh - 1;    w= length(nn) /*define/initialize some handy values. */\n$=                                               /*$: will hold the solution for testing*/\n       do i=1  for nn;  $= $  i                  /* [\u25c4]  build a solution for testing.  */\n       end   /*i*/\ndone= $                                          /* [\u2193]  scramble the tiles in puzzle.  */\n       do j=1  for nn;  a= random(1, words($) );    @.j= word($, a);   $= delword($, a, 1)\n       end   /*j*/\n                             /*\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550 play the 15\u2500puzzle 'til done or quit.*/\n   do  until puzz==done & @.nh==''               /*perform moves until puzzle is solved.*/\n   call getmv                                    /*get user's move(s)  and  validate it.*/\n   if errMsg\\==''  then do;  say sep errMsg;       iterate        /*possible error msg? */\n                        end\n   call showGrid 0                               /*don't display puzzle, just find hole.*/\n   if wordpos(x, !)==0  then do;  say sep  'tile '     x     \" can't be moved.\";   iterate\n                             end\n   @.hole= x;    @.tile=\n   call showGrid 0                               /*move specified tile \u2500\u2500\u2500\u25ba puzzle hole.*/\n   end   /*until*/           /*\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550*/\n\ncall showGrid 1;    say;     say sep  'Congratulations!   The'      nn\"-puzzle is solved.\"\nexit 0                                           /*stick a fork in it,  we're all done. */\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\ngetmv: x= 0;   sep= copies('\u2500', 8);     pad= left('', 1 + length(sep) )   /*pad=9 blanks*/\n       prompt= sep    'Please enter a tile number  or  numbers '     sep     \" (or Quit).\"\n       if queued()==0  then do;    say;    call showGrid 1;     say;      say prompt\n                            end\n       parse pull x . 1 ox . 1 . zx;   upper x   /*obtain a number (or numbers) from CL.*/\n       if abbrev('QUIT', x, 1)  then do;   say;   say;    say sep  \"quitting.\";      exit\n                                     end\n       if words(zx)>0  then do;  parse var  zx    xq;     queue xq\n                            end                  /* [\u2191]  Extra moves?  Stack for later. */\n              select                             /* [\u2193]  Check for possible errors/typos*/\n              when x==''              then errMsg= \"nothing entered.\"\n              when \\datatype(x, 'N')  then errMsg= \"tile number isn't numeric: \"        ox\n              when \\datatype(x, 'W')  then errMsg= \"tile number isn't an integer: \"     ox\n              when x=0                then errMsg= \"tile number can't be zero: \"        ox\n              when x<0                then errMsg= \"tile number can't be negative: \"    ox\n              when x>nn               then errMsg= \"tile number can't be greater than\"  nn\n              otherwise                    errMsg=\n              end   /*select*/                   /* [\u2191]  verify the human entered data. */\n       return\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nshowGrid: parse arg show;       !.=;                      x= x/1;       #= 0;        puzz=\n          top= '\u2554'copies( copies(\"\u2550\", w)'\u2566', N);        top= left( top, length(top) -1)\"\u2557\"\n          bar= '\u2560'copies( copies(\"\u2550\", w)'\u256c', N);        bar= left( bar, length(bar) -1)\"\u2563\"\n          bot= '\u255a'copies( copies(\"\u2550\", w)'\u2569', N);        bot= left( bot, length(bot) -1)\"\u255d\"\n          if show  then say pad top\n\n               do   r=1  for N;     z= '\u2551'\n                 do c=1  for N;     #= #+1;     y= @.#;      puzz= puzz y;        !.r.c= y\n                 _= right(@.#, w)\"\u2551\";           z= z || _              /* [\u2193]  find hole*/\n                 if @.# == ''  then do;    hole= #;     holeRow= r;     holeCol= c;    end\n                 if @.# == x   then do;    tile= #;     tileRow= r;     tileCol= c;    end\n                 end   /*c*/                                           /* [\u2191]  find  X. */\n               if show  then do;    say pad z;     if r\\==N  then say pad bar;         end\n               end     /*r*/\n\n          rm=holeRow-1;   rp=holeRow+1;  cm=holeCol-1;  cp=holeCol+1   /*possible moves.*/\n          !=!.rm.holeCol  !.rp.holeCol   !.holeRow.cm   !.holeRow.cp   /* legal   moves.*/\n          if show  then say pad bot;                  return\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_107.txt",
        "content": "           \u2554\u2550\u2550\u2566\u2550\u2550\u2566\u2550\u2550\u2566\u2550\u2550\u2557\n           \u255110\u2551 7\u2551 8\u255111\u2551\n           \u2560\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u2563\n           \u2551 4\u2551 3\u255115\u2551 1\u2551\n           \u2560\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u2563\n           \u2551 9\u255112\u2551 2\u255113\u2551\n           \u2560\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u2563\n           \u255114\u2551 5\u2551 6\u2551  \u2551\n           \u255a\u2550\u2550\u2569\u2550\u2550\u2569\u2550\u2550\u2569\u2550\u2550\u255d\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a tile number  or  numbers  \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500  (or Quit).\n13                           \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input. \n           \u2554\u2550\u2550\u2566\u2550\u2550\u2566\u2550\u2550\u2566\u2550\u2550\u2557\n           \u255110\u2551 7\u2551 8\u255111\u2551\n           \u2560\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u2563\n           \u2551 4\u2551 3\u255115\u2551 1\u2551\n           \u2560\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u2563\n           \u2551 9\u255112\u2551 2\u2551  \u2551\n           \u2560\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u2563\n           \u255114\u2551 5\u2551 6\u255113\u2551\n           \u255a\u2550\u2550\u2569\u2550\u2550\u2569\u2550\u2550\u2569\u2550\u2550\u255d\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a tile number  or  numbers  \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500  (or Quit).\n1  15  3                     \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input. \n           \u2554\u2550\u2550\u2566\u2550\u2550\u2566\u2550\u2550\u2566\u2550\u2550\u2557\n           \u255110\u2551 7\u2551 8\u255111\u2551\n           \u2560\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u2563\n           \u2551 4\u2551  \u2551 3\u255115\u2551\n           \u2560\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u2563\n           \u2551 9\u255112\u2551 2\u2551 1\u2551\n           \u2560\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u256c\u2550\u2550\u2563\n           \u255114\u2551 5\u2551 6\u255113\u2551\n           \u255a\u2550\u2550\u2569\u2550\u2550\u2569\u2550\u2550\u2569\u2550\u2550\u255d\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a tile number  or  numbers  \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500  (or Quit).\nquit                         \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input. \n\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 quitting.\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_108.txt",
        "content": "# Project\u00a0: CalmoSoft Fifteen Puzzle Game \n# Date   \u00a0: 2018/12/01\n# Author \u00a0: Gal Zsolt (CalmoSoft), Bert Mariani\n# Email  \u00a0: calmosoft@gmail.com\n\nload \"guilib.ring\"\n\napp1 = new qapp {\n\n        stylefusionblack()\n        empty = 16  \n        nr_moves = 0\n        nr_sleep = 1\n        button_size = 4 \n        current_button = 4\n        temp = 0\n        flag_init = 0\n        flag_save = 0\n        flag_move = 0\n        button = list(52)   \n        size_button = list(7)\n        table1 = [] \n        table2 = [] \n        table3 = []\n        n_degree = 0\n        nr_degree = [0,90,180,270 ,-90,-180,-270]\n        n_degreeRight = 0\n        n_degreeLeft = 0\n        btn_degree = newlist(52,2)\n        counter_man = 0 \n        t1 = 0\n\n        win1 = new qwidget() {\n                   move(0,0)\n                   resize(380,760)\n                   setwindowtitle(\"CalmoSoft Fifteen Puzzle Game\")\n\n                  for n=1 to 52\n                        for m=1 to 2\n                             btn_degree[n][m] = 0\n                        next\n                  next \n\n                   for n = 4 to 7\n                               size_button[n] = new qpushbutton(win1)   \n                               {\n                                                  col = n%4\n                                                  setgeometry(100+col*40,60,40,40)\n                                                  settext(string(n) + \"x\" + string(n))\n                                                  setclickevent(\"newsize(\" + string(n) + \")\")\n                               } \n                   next    \n\n                  btnMoves = new qpushbutton(win1)\n                  {\n                                 setgeometry(100,260,80,40)\n                                 settext(\"0\")\n                                 show() \n                  }\n\n                   scramblebtn = new qpushbutton(win1)\n                   {\n                                         setgeometry(100,300,160,40)\n                                         settext(\"Scramble\")\n                                         setclickevent(\"scramble()\")                        \n                   }\n\n                   resetbtn = new qpushbutton(win1)   \n                   {\n                                    setgeometry(100,340,160,40)\n                                    settext(\"Reset\")\n                                    setclickevent(\"resettiles()\")\n                   }\n\n                   savebtn = new qpushbutton(win1)   \n                   {\n                                   setgeometry(100,380,160,40)  \n                                   settext(\"Save Game\")  \n                                   setclickevent(\"pSave()\")\n                   }\n\n                   playbtn = new qpushbutton(win1)   \n                   {\n                                   setgeometry(100,420,160,40)  \n                                   settext(\"Resume Game\")  \n                                   setclickevent(\"pPlay()\")\n                   }\n\n                   sleepbtn = new qpushbutton(win1)   \n                   {\n                                   setgeometry(100,460,160,40)  \n                                   settext(\"Sleep Time: \")  \n\n                   }\n\n                  decbtn = new qpushbutton(win1)   \n                  {\n                               setgeometry(220,460,40,40)  \n                               settext(\"<-\")  \n                               setclickevent(\"pDecSleep()\")\n                  }\n\n                  incbtn = new qpushbutton(win1)   \n                  {\n                               setgeometry(260,460,40,40)  \n                               settext(\"->\")  \n                               setclickevent(\"pIncSleep()\")\n                  }\n\n                 rightbtn = new qpushbutton(win1)   \n                 {\n                               setgeometry(100,500,160,40)  \n                               settext(\"In the Right Place\u00a0: \")  \n                 }\n\n                 timebtn = new qpushbutton(win1)   \n                 {\n                               setgeometry(100,540,160,40)  \n                               settext(\"Elapsed Time\u00a0: \")  \n                 }\n\n                TimerMan = new qtimer(win1)\n               {\n                                  setinterval(500)\n                                  settimeoutevent(\"pTime()\")\n                                  stop()\n               }\n              newsize(4) \n              show()\n        }\n        exec()\n}\n\nFunc newlist x, y\n     if isstring(x) x=0+x ok\n     if isstring(y) y=0+y ok\n     alist = list(x)\n     for t in alist\n         t = list(y)\n     next\n     return alist\n\nfunc scramble\n       for n= 1 to 1000   \n            current_button=random(button_size*button_size-1)+1\n            up = (empty = (current_button - button_size))\n            down = (empty = (current_button + button_size))\n            left = ((empty = (current_button - 1)) and ((current_button\u00a0% button_size)\u00a0!= 1))\n            right = ((empty = (current_button + 1)) and ((current_button\u00a0% button_size)\u00a0!= 0))\n            move = up or down or left  or right\n            if move = 1 \n               button[current_button] { temp2 = text() }\n               col = empty%button_size\n               if col = 0 col = button_size ok\n               row = ceil(empty/button_size)\n               button[empty] {\n                       setgeometry(60+col*40,60+row*40,40,40)\n                       rnd = random(6)+1\n                       n_degree = nr_degree[rnd]\n                       button[empty].setbuttoncolor(\"yellow\")\n                       button[empty].settext(temp2)\n                       button[empty].setClickEvent(\"movetile(\" + string(empty) +\")\")\n                       btn_degree[empty] [1] = temp2\n                       btn_degree[empty] [2] = n_degree\n                       }\n               button[current_button].setbuttoncolor(\"yellow\")\n               btn_degree[current_button][2] = 0\n               button[current_button]{settext(\"\")}\n               empty = current_button\n            ok\n       next\n       button[button_size*button_size+2]{settext(\"Here\")}\n       for n=1 to button_size*button_size\n             button[n].setbuttoncolor(\"yellow\")\n       next\n       table1 = []\n       table2 = []\n       table3 = []   \n       for n = 1 to button_size*button_size\n             add(table1, button[n].text())\n             add(table2, button[n].text())\n             add(table3, string(btn_degree[n][2]))\n       next\n       add(table1, string(empty))\n       add(table2, string(empty))\n       add(table3, string(empty))\n       add(table1, \"OK\")\n       add(table2, \"OK\")\n       add(table3, \"OK\")\n       flag_save = 0\n       flag_move = 0\n       nr_moves = 0\n       btnMoves.settext(string(nr_moves))\n       timebtn.settext(\"Elapsed Time\u00a0: \")\n       t1 = clock()\n       rightPlace()\n       return\n\nfunc movetile current_button2\n       if (current_button2 = button_size*button_size-1 and button[current_button2].text() = \"In\")\n           pBack()\n       else\n           see char(7)\n           up = (empty = (current_button2 - button_size))\n           down = (empty = (current_button2 + button_size))\n           left = ((empty = (current_button2- 1)) and ((current_button2\u00a0% button_size)\u00a0!= 1))\n           right = ((empty = (current_button2 + 1)) and ((current_button2\u00a0% button_size)\u00a0!= 0))\n           move = up or down or left  or right\n           if move = 1 \n              temp2 = button[current_button2].text() \n              btn_degree[empty][1] = temp2\n              add(table1, temp2)\n              add(table2, string(current_button2))              \n              col = empty%button_size\n              if col = 0 col = button_size ok\n              row = ceil(empty/button_size)\n              button[empty] {\n                                   setgeometry(60+col*40,60+row*40,40,40)\n                                   n_degree = btn_degree[current_button2][2]\n                                   btn_degree[empty][2] = n_degree\n                                   button[empty].setbuttoncolor(\"orange\")\n                                   button[empty].settext(temp2)                                   \n              }\n              add(table3, string(n_degree))\n              button[current_button2].setbuttoncolor(\"cyan\")\n              button[current_button2]{settext(\"\")}\n              empty = current_button2\n              nr_moves = nr_moves + 1\n              btnMoves.settext(string(nr_moves))\n              isGameOver()\n           ok\n      ok \n      flag_move = 1\n      pElapsedTime()\n      rightPlace()\n      return\n\nfunc resettiles\n        n_degree = 0  \n        empty = button_size*button_size\n        for empty = 1 to button_size*button_size-1\n             btn_degree[empty][2] = 0\n             n_degree = 0\n             btn_degree[empty][1] = string(empty)\n             button[empty].setstylesheet(\"background-color:yellow\")\n             button[empty] {settext(string(empty))}\n        next\n        button[button_size*button_size].setstylesheet(\"background-color:yellow\")\n        button[button_size*button_size] {settext(\"\")}\n        table1 = []\n        table2 = []\n        table3 = []   \n        for n = 1 to button_size*button_size\n             add(table1, button[n].text())\n             add(table2, button[n].text())\n             add(table3, string(btn_degree[n][2]))\n        next\n        add(table1, string(empty))\n        add(table2, string(empty))\n        add(table3, string(empty))\n        add(table1, \"OK\")\n        add(table2, \"OK\")\n        add(table3, \"OK\")\n        flag_save = 0\n        flag_move = 0\n        nr_moves = 0\n        btnMoves.settext(string(nr_moves))\n        timebtn.settext(\"Elapsed Time\u00a0: \")\n        t1 = clock()\n        rightPlace()\n        return\n\nfunc pHere\n        if button[button_size*button_size-1].text()\u00a0!= \"\" and button[button_size*button_size+2].text() = \"Here\"\n           button[button_size*button_size-1] { temp = text() }\n           button[button_size*button_size+2].close()\n           button[button_size*button_size+2] = new ButtonWithRotatedText(win1)\n           button[button_size*button_size+2] {\n           setgeometry(60+(button_size-1)*40,60+(button_size+1)*40,40,40)\n           setstylesheet(\"background-color:yellow\")\n           btn_degree[button_size*button_size+2][2] = btn_degree[button_size*button_size-1][2]\n           n_degree = btn_degree[button_size*button_size+2][2]\n           emptysave = empty\n           empty = button_size*button_size+2\n           btn_degree[empty][1] = temp\n           settext(temp)\n           }\n           n_degree = 0\n           empty = button_size*button_size-1\n           btn_degree[empty][1] = \"In\"\n           button[button_size*button_size-1]{settext(\"In\")}\n           for n = 1 to button_size*button_size\n\t   button[n].setenabled(false)\n           next\n           button[button_size*button_size-1].setenabled(true)\n           scramblebtn.setenabled(false)\n           resetbtn.setenabled(false)\n           savebtn.setenabled(false)\n           playbtn.setenabled(false)\n           empty = emptysave\n        ok\n\nfunc pBack\n        button[button_size*button_size+2] { temp = text() }\n        n_degree = btn_degree[button_size*button_size+2][2]\n        btn_degree[button_size*button_size-1][2] = btn_degree[button_size*button_size+2][2]\n        emptysave = empty\n        empty = button_size*button_size-1\n        btn_degree[empty][1] = temp\n        button[button_size*button_size-1] {settext(temp)}\n        button[button_size*button_size+2].close()\n        button[button_size*button_size+2] = new qpushbutton(win1)\n                {\n                setgeometry(60+(button_size-1)*40,60+(button_size+1)*40,40,40)\n                settext(\"Here\")\n                setclickevent(\"pHere()\")   \n                show() \n                } \n        for n = 1 to button_size*button_size\n              button[n].setenabled(true)\n        next\n        scramblebtn.setenabled(true)\n        resetbtn.setenabled(true)\n        savebtn.setenabled(true)\n        playbtn.setenabled(true)\n        empty = emptysave\n        isGameOver()\n\nfunc rotateleft\n        if button[button_size*button_size+2].text()\u00a0!= \"Here\" \n           button[button_size*button_size+2].close()\n           button[button_size*button_size+2] = new ButtonWithRotatedText(win1)\n                      button[button_size*button_size+2] {\n                      setgeometry(60+(button_size-1)*40,60+(button_size+1)*40,40,40)\n                      setstylesheet(\"background-color:yellow\")\n                      n_degreeLeft = (n_degreeLeft-90)%360\n                      n_degree = n_degreeLeft\n                      btn_degree[button_size*button_size+2][2] = n_degree\n                      emptysave = empty\n                      empty = button_size*button_size+2\n                      btn_degree[empty][1] = temp\n                      button[button_size*button_size+2]{settext(temp)}\n                      } \n                      empty = emptysave\n        ok\n\nfunc rotateright\n        if button[button_size*button_size+2].text()\u00a0!= \"Here\"  \n           button[button_size*button_size+2].close()\n           button[button_size*button_size+2] = new ButtonWithRotatedText(win1)\n                      button[button_size*button_size+2] {\n                      setgeometry(60+(button_size-1)*40,60+(button_size+1)*40,40,40)\n                      setstylesheet(\"background-color:yellow\")\n                      n_degreeRight = (n_degreeRight+90)%360\n                      n_degree = n_degreeRight\n                      btn_degree[button_size*button_size+2][2] = n_degree\n                      emptysave = empty\n                      empty = button_size*button_size+2\n                      btn_degree[empty][1] = temp\n                      button[button_size*button_size+2]{settext(temp)}\n                      }\n                      empty = emptysave\n        ok\n\nfunc newsize current_button\n        win1{ \n                sizenew = current_button%4\n                win1.resize(360+sizenew*40,640+sizenew*40)\n                if flag_init\u00a0!= 0\n                   for nb = 1 to button_size*button_size+3\n                         button[nb] {close()}\n                   next\n                   btnMoves.close()\n                ok\n                scramblebtn.close()\n                resetbtn.close()\n                savebtn.close()\n                playbtn.close()\n                btnMoves.close()\n                sleepbtn.close()\n                decbtn.close()\n                incbtn.close()\n                rightbtn.close()\n                timebtn.close()\n\n                for n = 1 to current_button*current_button\n                     col = n%current_button\n                     if col = 0 col = current_button ok\n                     row = ceil(n/current_button)\n                     button[n] = new ButtonWithRotatedText(win1)\n                                       button[n] {\n                                       setgeometry(60+col*40,60+row*40,40,40)\n                                       button[n].setbuttoncolor(\"yellow\")                                       \n                                       n_degree = 0\n                                       if n < current_button*current_button\n                                          button[n].settext(string(n))\n                                       but n = current_button*current_button\n                                          button[n].settext(\"\")\n                                       ok \n                                       setClickEvent(\"movetile(\" + string(n) +\")\")\n                                       }\n                next\n\n                btnMoves = new qpushbutton(win1)\n                {\n                                        setgeometry(100,60+(current_button+1)*40,(current_button-3)*40,40)\n                                        setStyleSheet(\"text-align:center\")\n                                        settext(\"0\")\n                                        show() \n                }\n\n                button[current_button*current_button+1] = new qpushbutton(win1)\n                {\n                                              setgeometry(60+(current_button-2)*40,60+(current_button+1)*40,40,40)\n                                              settext(\"<-\")\n                                              setclickevent(\"rotateLeft()\")   \n                                              show() \n                } \n\n                button[current_button*current_button+2] = new qpushbutton(win1)\n                {\n                                             setgeometry(60+(current_button-1)*40,60+(current_button+1)*40,40,40)\n                                             settext(\"Here\")\n                                             setclickevent(\"pHere()\")   \n                                             show() \n                }\n\n                button[current_button*current_button+3] = new qpushbutton(win1)\n                {\n                                             setgeometry(60+current_button*40,60+(current_button+1)*40,40,40)\n                                             settext(\"->\")\n                                             setclickevent(\"rotateRight()\")   \n                                             show() \n                 }\n\n                scramblebtn = new qpushbutton(win1)\n                {\n                                      setgeometry(100,100+(current_button+1)*40,current_button*40,40)\n                                      settext(\"Scramble\")\n                                      setclickevent(\"scramble()\")\n                                      show()                        \n                }\n\n                resetbtn = new qpushbutton(win1)   \n                {\n                                 setgeometry(100,100+(current_button+2)*40,current_button*40,40)\n                                 settext(\"Reset\")\n                                 setclickevent(\"resettiles()\")\n                                 show() \n                }\n\n                savebtn = new qpushbutton(win1)   \n                {\n                                 setgeometry(100,100+(current_button+3)*40,current_button*40,40)\n                                 settext(\"Save Game\")\n                                 setclickevent(\"pSave()\")\n                                 show() \n                }\n\n                playbtn = new qpushbutton(win1)   \n                {\n                               setgeometry(100,100+(current_button+4)*40,current_button*40,40)  \n                               settext(\"Resume Game\")  \n                               setclickevent(\"pPlay()\")\n                               show()\n                }\n\n                sleepbtn = new qpushbutton(win1)   \n                {\n                               setgeometry(100,100+(current_button+5)*40,(current_button-2)*40,40)  \n                               settext(\"Sleep Time: \" + string(nr_sleep) + \" s\")  \n                               show()\n                }\n\n                decbtn = new qpushbutton(win1)   \n                {\n                               setgeometry(100+(current_button-2)*40,100+(current_button+5)*40,40,40)  \n                               settext(\"<-\")  \n                               setclickevent(\"pDecSleep()\")\n                               show()\n                }\n\n                incbtn = new qpushbutton(win1)   \n                {\n                               setgeometry(100+(current_button-1)*40,100+(current_button+5)*40,40,40)  \n                               settext(\"->\")  \n                               setclickevent(\"pIncSleep()\")\n                               show()\n                }\n\n               rightbtn = new qpushbutton(win1)   \n                {\n                               setgeometry(100,100+(current_button+6)*40,current_button*40,40)  \n                               settext(\"In the Right Place\u00a0: \")  \n                               show()\n                }\n\n                timebtn = new qpushbutton(win1)   \n                {\n                               setgeometry(100,100+(current_button+7)*40,current_button*40,40)  \n                               settext(\"Elapsed Time\u00a0: \")  \n                               show()\n                }\n\n                table1 = []\n                table2 = []\n                table3 = []   \n                for n = 1 to button_size*button_size\n                      add(table1, button[n].text())\n                      add(table2, button[n].text())\n                      add(table3, string(0))\n                next\n                add(table1, string(empty))\n                add(table2, string(empty))\n                add(table3, string(empty))\n                add(table1, \"OK\")\n                add(table2, \"OK\")\n                add(table3, \"OK\")\n                empty = current_button*current_button\n                button_size = current_button\n                flag_init = 1\n                flag_save = 0\n                flag_move = 0\n                nr_moves = 0\n                timebtn.settext(\"Elapsed Time\u00a0: \")\n                t1 = clock()\n                scramble()\n                }\n\nfunc pSave\n        textedit1 = list2str(table1)\n        textedit2 = list2str(table2)\n        textedit3 = list2str(table3)\n        chdir(currentdir())\n        cName1 = \"CalmoSoftPuzzle1.txt\"\n        cName2 = \"CalmoSoftPuzzle2.txt\"\n        cName3 = \"CalmoSoftPuzzle3.txt\"\n        write(cName1,textedit1)\n        write(cName2,textedit2)\n        write(cName3,textedit3)\n         flag_save = 1   \n         timebtn.settext(\"Elapsed Time\u00a0: \")\n         t1 = clock()\n         return\n\nfunc pPlay\n        if  flag_save = 0 or flag_move = 0\n            warning()  \n        else\n           chdir(currentdir())\n           cName1 = \"CalmoSoftPuzzle1.txt\"\n           textedit1 = read(cName1)\n           table1 = str2list(textedit1)\n           cName2 = \"CalmoSoftPuzzle2.txt\"\n           textedit2 = read(cName2)\n           table2 = str2list(textedit2)\n           cName3 = \"CalmoSoftPuzzle3.txt\"\n           textedit3 = read(cName3)\n           table3 = str2list(textedit3)\n           for empty = 1 to button_size*button_size\n                button[empty].setbuttoncolor(\"yellow\") \n                n_degree = number(table3[empty])\n                btn_degree[empty][1] = table1[empty]\n                button[empty] {settext(table1[empty])}\n           next\n           empty = number(table1[button_size*button_size + 1])\n           counter_man = button_size*button_size+2\n           nr_moves = 0\n           t1 = clock()\n           TimerMan.start()\n       ok\n\nfunc pTime()\n        if flag_save = 0 or flag_move = 0\n           warning()    \n        else\n           counter_man++\n           pPlaySleep()\n           sleep(nr_sleep*1000) \n           pElapsedTime()\n           if counter_man = len(table1)\n              TimerMan.stop()\n           ok\n        ok\n\nfunc pPlaySleep\n        see char(7)\n        value = table1[counter_man]\n        place = table2[counter_man]\n        n_degree = number(table3[counter_man])\n        btn_degree[empty][1] = value\n        button[empty].setbuttoncolor(\"orange\")\n        button[empty] {settext(value)}\n        n_degree = 0\n        button[number(place)].setbuttoncolor(\"cyan\")\n        button[number(place)] {settext(\"\")}\n        empty = number(place)        \n        nr_moves = nr_moves + 1\n        btnMoves.settext(string(nr_moves))\n\nfunc pIncSleep\n        nr_sleep = nr_sleep + 1 \n        sleepbtn.settext(\"Sleep Time: \" + string(nr_sleep) + \" s\")\n\nfunc pDecSleep\n        if nr_sleep > 1 \n           nr_sleep = nr_sleep - 1\n           sleepbtn.settext(\"Sleep Time: \" + string(nr_sleep) + \" s\")\n        ok\n\nfunc sleep(x)\n        nTime = x \n        oTest = new qTest\n        oTest.qsleep(nTime)\n        return\n\nfunc isGameOver\n        flagend = 1\n        for n=1 to button_size*button_size-1\n              if button[n].text()\u00a0!= n or btn_degree[n][2]\u00a0!= 0\n                 flagend = 0\n                 exit\n              ok\n        next\n        if flagend = 1\n           new qmessagebox(win1) {\n                   setwindowtitle(\"Game Over\") \n                   settext(\"Congratulations!\")\n                   show()\n                   }   \n        ok   \n\nfunc rightPlace\n        count = 0\n        for n=1 to button_size*button_size\n             if button[n].text() = n and btn_degree[n][2] = 0\n                count = count + 1\n             ok\n        next   \n        rightbtn.settext(\"In the Right Place\u00a0: \" + count)\n\nfunc warning\n        new qmessagebox(win1) {\n                setwindowtitle(\"Warning!\") \n                settext(\"First you must play and save the game.\")\n                show()\n                }         \n\nfunc pElapsedTime\n        t2 = (clock() - t1)/1000\n        timebtn.settext(\"Elapsed Time\u00a0: \" + t2 + \" s\")\n\nClass ButtonWithRotatedText\n\n         oButton oLabel  cText=\"We are here\"  n_degree = 30  nTransX = 50   nTransY = 0\n\nfunc init( oParent)\n        oButton = new qPushButton(oParent)\n        oLabel  = new qLabel(oParent)\n        oLabel.setAttribute(Qt_WA_TransparentForMouseEvents,True)\n        oLabel.setAttribute(Qt_WA_DeleteOnClose, True)\n        oButton.setAttribute(Qt_WA_DeleteOnClose, True)\n        oButton.Show()\n        return\n    \nfunc close()\n        oLabel.close()\n        oButton.close()\n        return\n\nfunc setstylesheet(x)\n        oButton.setstylesheet(x)\n\nfunc setgeometry( x,y,width,height)\n        oButton.setgeometry(x,y,width,height)\n        oLabel.setgeometry( x,y,width,height)\n        \nfunc setText( cValue)\n        cText = cValue\n        return\n    \nfunc Text() \n         return cText\n\nfunc setTranslate( x,y )    \n         nTransX = x\n         nTransY = y\t\t\n         return\n\nfunc TranslateOffsetX()\n        return nTransX \n\nfunc TranslateOffsetY()\n        return nTransY \n\t\nfunc setRotation_degree( nValue)\n        n_degree = nValue\n        return\n    \nfunc Rotation_degree()\n        return n_degree\n\nfunc setClickEvent( cEvent)\n        oButton.setClickEvent(cEvent)\n        return\n    \nfunc braceend()\n        draw() \n        return\n\nfunc setEnabled(value)        \n        oButton.setenabled(value)\n        return\t\n\n func setButtonColor(color)  \n         colorIt = \"background-color:\" + color  \n         oButton.setstylesheet(colorIt) \n         return\n    \t\nfunc draw()\n         picture = new qpicture()\n         color   = new qcolor() { setrgb(0,0,255,255) }\n         pen     = new qpen()   { setcolor(color) setwidth(10) }\n                    \n         painter = new qpainter() \n         {\n                       begin(picture)        \n                       setpen(pen)\n                       oFont = new qfont(\"Courier New\",12,75,0)\n                       oFont.setpointsize(20)\n                       setfont(oFont)\n                       if n_degree = 0\n                          if btn_degree[empty] [1]=\"In\" p1 = -8 p2=0 \n                          translate(p1,p2) ok ok\n                       if n_degree = 0\n                          if btn_degree[empty] [1]<10 p1 = 10 p2=10 else p1=5 p2=10 ok\n                          translate(p1,p2)\n                       but n_degree = 90\n                             if btn_degree[empty] [1]<10 p=-10 else p=-15 ok\n                             translate(10,p)\n                       but n_degree = 180\n                              if btn_degree[empty] [1]<10 p1= 30 p2=-10 else p1=35 p2=-10 ok\n                              translate(p1,p2)\n                       but n_degree = 270\n                             if btn_degree[empty] [1]<10 p=10 else p=15 ok\n                             translate(30,p)\n                       but n_degree = -90\n                             if btn_degree[empty] [1]<10 p=10 else p=15 ok\n                             translate(30,p)\n                       but n_degree = -180\n                              if btn_degree[empty] [1]<10 p1=30 p2=-10 else p1=35 p2=-10 ok\n                              translate(p1,p2)\n                       but n_degree = -270\n                             if btn_degree[empty] [1]<10 p1=10 p2=-10 else p1=10 p2=-15 ok\n                             translate(p1,p2)\n                       ok\t\t\t\t\t\t\n                       rotate(n_degree)\n\t          drawtext(0,0,this.Text())   \n                       endpaint()\n         }\n         oLabel {\n                    setpicture(picture)  \n                     show() \n                    }\n         return",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_109.txt",
        "content": "/*\n**\n**\tGame  \t\t\t\u00a0: CalmoSoft Fifteen Puzzle Game 3D \n**\tDate   \t\t\t\u00a0: 2017/09/01\n**  Author \t\t\t\u00a0: CalmoSoft <calmosoft@gmail.com>, Mahmoud Fayed\n**\n*/\n\n# Load Libraries\nload \"gamelib.ring\"\t\t# RingAllegro Library\nload \"opengl21lib.ring\"\t# RingOpenGL  Library\n\nbutSize = 3\ntexture = list(9)\ncube = list(9)\nrnd = list(9)\nrndok = 0\n\nfor n=1 to 9\n     rnd[n] = 0\nnext \n\nfor n=1 to 9\n     while true\n               rndok = 0\n               ran = random(8) + 1\n               for nr=1 to 9\n                     if rnd[nr] = ran\n                        rndok = 1\n                     ok\n               next  \n               if rndok = 0\n                  rnd[n] = ran\n                  exit\n               ok \n     end\nnext \n\nfor n=1 to 9\n     if rnd[n] = 9\n        empty = n\n     ok\nnext \n\n#==============================================================\n# To Support MacOS X\n\tal_run_main()\t\n\tfunc al_game_start \t# Called by al_run_main()\n\t\tmain()\t\t# Now we call our main function\n#==============================================================\n\nfunc main\n\tnew TicTacToe3D {\n\t\tstart()\n\t}\n\nclass TicTacToe3D from GameLogic\n\n\tFPS = 60\n\tTITLE = \"CalmoSoft Fifteen Puzzle Game 3D\"\n\n\toBackground = new GameBackground\n\toGameSound = new GameSound\n\toGameCube = new GameCube\n\toGameInterface = new GameInterface \n\n\tfunc loadresources\n\t\toGameSound.loadresources()\n\t\toBackGround.loadresources()\n\t\toGameCube.loadresources()\n\n\tfunc drawScene\n\t\toBackground.update()\n\t\toGameInterface.update(self)\n\n\tfunc MouseClickEvent\n\t\toGameInterface.MouseClickEvent(self)\n\nclass GameInterface \n\n\tfunc Update oGame\n\t\tprepare()\n\t\tcubes(oGame)\n\n\tfunc Prepare \n\t\tw = 1024 h = 768\n\t\tratio =  w / h\n\t\tglViewport(0, 0, w, h)\n\t\tglMatrixMode(GL_PROJECTION)\n\t\tglLoadIdentity()\n\t\tgluPerspective(-120,ratio,1,120)\n\t\tglMatrixMode(GL_MODELVIEW)\n\t\tglLoadIdentity()\n\t\tglEnable(GL_TEXTURE_2D)\t\t\t\t\t\t\t\n\t\tglShadeModel(GL_SMOOTH)\t\t\n\t\tglClearColor(0.0, 0.0, 0.0, 0.5)\n\t\tglClearDepth(1.0)\t\t\t\n\t\tglEnable(GL_DEPTH_TEST)\t\n\t\tglEnable(GL_CULL_FACE)\n\t\tglDepthFunc(GL_LEQUAL)\n\t\tglHint(GL_PERSPECTIVE_CORRECTION_HINT, GL_NICEST)\n\n\tfunc Cubes oGame\n\t\toGame.oGameCube {\n\t\taGameMap = oGame.aGameMap \n                cube[1] = cube( 5  , -3 , -5  , texture[rnd[1]] )\n\t\tcube[2] = cube( 0  , -3 , -5  , texture[rnd[2]] )\n\t\tcube[3] = cube( -5 , -3 , -5  , texture[rnd[3]] )\n\t\tcube[4] = cube( 5  , 1  , -5  , texture[rnd[4]] )\n\t\tcube[5] = cube( 0  , 1  , -5  , texture[rnd[5]] )\n\t\tcube[6] = cube( -5 , 1  , -5  , texture[rnd[6]] )\n\t\tcube[7] = cube( 5  , 5  , -5  , texture[rnd[7]] )\n\t\tcube[8] = cube( 0  , 5  , -5  , texture[rnd[8]] )\n\t\tcube[9] = cube( -5 , 5  , -5  , texture[rnd[9]] )\n \t\trotate()\n\t\t}\n\n\tfunc MouseClickEvent oGame\n\t\toGame {\n\t\t\taBtn = Point2Button(Mouse_X,Mouse_Y)\n                        move = 0\n\t\t\tnRow = aBtn[1]\n\t\t\tnCol = aBtn[2]\n                        tile = (nRow-1)*3 + nCol\n                        up = (empty = (tile - butSize))\n                        down = (empty = (tile + butSize))\n                        left = ((empty = (tile- 1)) and ((tile\u00a0% butSize)\u00a0!= 1))\n                        right = ((empty = (tile + 1)) and ((tile\u00a0% butSize)\u00a0!= 0))\n                        move = up or down or left  or right\n                        if move = 1 \n                           temp = rnd[empty]\n                           rnd[empty] = rnd[tile] \n                           rnd[tile] = temp\n                           empty = tile\n                           oGame.oGameCube {\n\t\t                      aGameMap = oGame.aGameMap \n                                      cube[1] = cube( 5  , -3 , -5  , texture[rnd[1]] )\n\t\t                      cube[2] = cube( 0  , -3 , -5  , texture[rnd[2]] )\n\t\t                      cube[3] = cube( -5 , -3 , -5  , texture[rnd[3]] )\n\t\t                      cube[4] = cube( 5  , 1  , -5  , texture[rnd[4]] )\n\t\t                      cube[5] = cube( 0  , 1  , -5  , texture[rnd[5]] )\n\t                              cube[6] = cube( -5 , 1  , -5  , texture[rnd[6]] )\n\t\t                      cube[7] = cube( 5  , 5  , -5  , texture[rnd[7]] )\n\t                              cube[8] = cube( 0  , 5  , -5  , texture[rnd[8]] )\n\t\t                      cube[9] = cube( -5 , 5  , -5  , texture[rnd[9]] )\n \t\t                      rotate()\n\t\t           }\n                        ok\n\t\t}\n\nClass GameLogic from GraphicsAppBase\n\n\taGameMap = [\n\t\t[ :n , :n , :n ] ,\n\t\t[ :n , :n , :n ] ,\n\t\t[ :n , :n , :n ]\n\t]\n\n\taGameButtons = [\t\t\t# x1,y1,x2,y2\n \t\t[176,88,375,261],\t\t# [1,1]\n\t\t[423,88,591,261],\t\t# [1,2]\n\t\t[645,88,876,261],\t\t# [1,3]\n \t\t[176,282,375,428],\t\t# [2,1]\n\t\t[423,282,591,428],\t\t# [2,2]\n\t\t[645,282,876,428],\t\t# [2,3]\n \t\t[176,454,375,678],\t\t# [3,1]\n\t\t[423,454,591,678],\t\t# [3,2]\n\t\t[645,454,876,678]\t\t# [3,3]\n\t]\n\n\tcActivePlayer = :x\n\n\tfunc point2button x,y\n\t\tnRow = 0\n\t\tnCol = 0\n\t\tfor t = 1 to len(aGameButtons) \n\t\t\trect = aGameButtons[t]\n\t\t\tif x >= rect[1] and x <= rect[3] and\n\t\t\t   y >= rect[2] and y <= rect[4] \n\t\t\t\t\tswitch t\n\t\t\t\t\t\ton 1  nRow = 1  nCol = 1\n\t\t\t\t\t\ton 2  nRow = 1  nCol = 2\n\t\t\t\t\t\ton 3  nRow = 1 \tnCol = 3\n\t\t\t\t\t\ton 4  nRow = 2  nCol = 1\n\t\t\t\t\t\ton 5  nRow = 2  nCol = 2\n\t\t\t\t\t\ton 6  nRow = 2  nCol = 3\n\t\t\t\t\t\ton 7  nRow = 3 \tnCol = 1\n\t\t\t\t\t\ton 8  nRow = 3  nCol = 2\n\t\t\t\t\t\ton 9  nRow = 3  nCol = 3\n\t\t\t\t\toff\n\t\t\t\t\texit \n\t\t\tok\n\t\tnext \n\t\treturn [nRow,nCol]\n\nclass GameCube\n\n\tbitmap bitmap2 bitmap3 \n\ttextureX textureO textureN\n\n\txrot = 0.0\n\tyrot = 0.0\n\tzrot = 0.0\n\n\tfunc loadresources\n\t\tbitmp1 = al_load_bitmap(\"image/n1.jpg\")\n\t\ttexture[1] = al_get_opengl_texture(bitmp1)\n\t\tbitmp2 = al_load_bitmap(\"image/n2.jpg\")\n\t\ttexture[2] = al_get_opengl_texture(bitmp2)\n\t\tbitmp3 = al_load_bitmap(\"image/n3.jpg\")\n\t\ttexture[3] = al_get_opengl_texture(bitmp3)\n\t\tbitmp4 = al_load_bitmap(\"image/n4.jpg\")\n\t\ttexture[4] = al_get_opengl_texture(bitmp4)\n\t\tbitmp5 = al_load_bitmap(\"image/n5.jpg\")\n\t\ttexture[5] = al_get_opengl_texture(bitmp5)\n\t\tbitmp6 = al_load_bitmap(\"image/n6.jpg\")\n\t\ttexture[6] = al_get_opengl_texture(bitmp6)\n\t\tbitmp7 = al_load_bitmap(\"image/n7.jpg\")\n\t\ttexture[7] = al_get_opengl_texture(bitmp7)\n\t\tbitmp8 = al_load_bitmap(\"image/n8.jpg\")\n\t\ttexture[8] = al_get_opengl_texture(bitmp8)\n\t\tbitmp9 = al_load_bitmap(\"image/empty.png\")\n\t\ttexture[9] = al_get_opengl_texture(bitmp9)\n\n\tfunc cube(x,y,z,nTexture)\n\t\tglLoadIdentity()\t\t\t\t\t\t\t\t\t\n\t\tglTranslatef(x,y,z)\n\t\tglRotatef(xrot,1.0,0.0,0.0)\n\t\tglRotatef(yrot,0.0,1.0,0.0)\n\t\tglRotatef(zrot,0.0,0.0,1.0)\n\t\tsetCubeTexture(nTexture)\n\t\tdrawCube()\n\n\tfunc setCubeTexture cTexture\n\t\tglBindTexture(GL_TEXTURE_2D, cTexture)\n\n\tfunc Rotate \n\t\txrot += 0.3 * 5\n\t\tyrot += 0.2 * 5\n\t\tzrot += 0.4 * 5\n\n\tfunc drawcube\n\t\tglBegin(GL_QUADS)  \n\t\t\t// Front Face\n\t\t\tglTexCoord2f(0.0, 0.0) glVertex3f(-1.0, -1.0,  1.0)\n\t\t\tglTexCoord2f(1.0, 0.0) glVertex3f( 1.0, -1.0,  1.0)\n\t\t\tglTexCoord2f(1.0, 1.0) glVertex3f( 1.0,  1.0,  1.0)\n\t\t\tglTexCoord2f(0.0, 1.0) glVertex3f(-1.0,  1.0,  1.0)\n\t\t\t// Back Face\n\t\t\tglTexCoord2f(1.0, 0.0) glVertex3f(-1.0, -1.0, -1.0)\n\t\t\tglTexCoord2f(1.0, 1.0) glVertex3f(-1.0,  1.0, -1.0)\n\t\t\tglTexCoord2f(0.0, 1.0) glVertex3f( 1.0,  1.0, -1.0)\n\t\t\tglTexCoord2f(0.0, 0.0) glVertex3f( 1.0, -1.0, -1.0)\n\t\t\t// Top Face\n\t\t\tglTexCoord2f(0.0, 1.0) glVertex3f(-1.0,  1.0, -1.0)\n\t\t\tglTexCoord2f(0.0, 0.0) glVertex3f(-1.0,  1.0,  1.0)\n\t\t\tglTexCoord2f(1.0, 0.0) glVertex3f( 1.0,  1.0,  1.0)\n\t\t\tglTexCoord2f(1.0, 1.0) glVertex3f( 1.0,  1.0, -1.0)\n\t\t\t// Bottom Face\n\t\t\tglTexCoord2f(1.0, 1.0) glVertex3f(-1.0, -1.0, -1.0)\n\t\t\tglTexCoord2f(0.0, 1.0) glVertex3f( 1.0, -1.0, -1.0)\n\t\t\tglTexCoord2f(0.0, 0.0) glVertex3f( 1.0, -1.0,  1.0)\n\t\t\tglTexCoord2f(1.0, 0.0) glVertex3f(-1.0, -1.0,  1.0)\n\t\t \n\t\t\t// Right face\n\t\t\tglTexCoord2f(1.0, 0.0) glVertex3f( 1.0, -1.0, -1.0)\n\t\t\tglTexCoord2f(1.0, 1.0) glVertex3f( 1.0,  1.0, -1.0)\n\t\t\tglTexCoord2f(0.0, 1.0) glVertex3f( 1.0,  1.0,  1.0)\n\t\t\tglTexCoord2f(0.0, 0.0) glVertex3f( 1.0, -1.0,  1.0)\n\t \n\t\t\t// Left Face\n\t\t\tglTexCoord2f(0.0, 0.0) glVertex3f(-1.0, -1.0, -1.0)\n\t\t\tglTexCoord2f(1.0, 0.0) glVertex3f(-1.0, -1.0,  1.0)\n\t\t\tglTexCoord2f(1.0, 1.0) glVertex3f(-1.0,  1.0,  1.0)\n\t\t\tglTexCoord2f(0.0, 1.0) glVertex3f(-1.0,  1.0, -1.0)\n\t\tglEnd()\n\n\nclass GameBackground \n\n\tnBackX = 0\n\tnBackY = 0\n\tnBackDiffx = -1\n\tnBackDiffy = -1\n\tnBackMotion = 1\n\taBackMotionList = [\n\t\t[ -1, -1 ] ,\t\t# Down - Right\n\t\t[ 0 , 1  ] ,\t\t# Up\n\t\t[ -1, -1 ] , \t\t# Down - Right\n\t\t[ 0 , 1  ] ,\t\t# Up\n\t\t[ 1 , -1 ] ,\t\t# Down - Left\n\t\t[ 0 , 1  ] ,\t\t# Up\n\t\t[ 1 , -1 ] , \t\t# Down - Left\n\t\t[ 0 , 1  ]\t\t\t# Up\n\t]\n\n\tbitmap\n\n\tfunc Update \n\t\tdraw()\n\t\tmotion()\n\n\tfunc draw\n\t\tal_draw_bitmap(bitmap,nBackX,nBackY,1)\n\n\tfunc motion\n\t\tnBackX += nBackDiffx\n\t\tnBackY += nBackDiffy\n\t\tif (nBackY = -350) or (nBackY = 0)\n\t\t\tnBackMotion++\n\t\t\tif nBackMotion > len(aBackMotionList)\n\t\t\t\tnBackMotion = 1\n\t\t\tok\n\t\t\tnBackDiffx  = aBackMotionList[nBackMotion][1]\n\t\t\tnBackDiffy  = aBackMotionList[nBackMotion][2]\n\t\tok\n\n\tfunc loadResources\n\t\tbitmap = al_load_bitmap(\"image/back.jpg\")\n\nclass GameSound\n\n\tsample sampleid\n\n\tfunc loadresources\n\t\tsample = al_load_sample( \"sound/music1.wav\" )\n\t\tsampleid = al_new_allegro_sample_id()\n\t\tal_play_sample(sample, 1.0, 0.0,1.0,ALLEGRO_PLAYMODE_LOOP,sampleid)\n\nclass GraphicsAppBase\n\n\tdisplay event_queue ev timeout \n\ttimer  \n\tredraw \t\t\t= true\n\tFPS \t\t\t= 60 \n\tSCREEN_W \t\t= 1024\n\tSCREEN_H \t\t= 700\n\tKEY_UP\t\t\t= 1\n\tKEY_DOWN \t\t= 2\n\tKEY_LEFT \t\t= 3\n\tKEY_RIGHT \t\t= 4\n\tKey \t\t\t= [false,false,false,false]\n\tMouse_X \t\t= 0\n\tMouse_Y\t\t\t= 0\n\tTITLE \t\t\t= \"Graphics Application\"\n\tPRINT_MOUSE_XY \t= False\n\n\tfunc start\n\t\tSetUp()\n\t\tloadResources()\n\t\teventsLoop()\n\t\tdestroy()\n\n\tfunc setup\n\t\tal_init()\n\t\tal_init_font_addon()\n\t\tal_init_ttf_addon()\n\t\tal_init_image_addon()\n\t\tal_install_audio()\n\t\tal_init_acodec_addon()\n\t\tal_reserve_samples(1)\n\t\tal_set_new_display_flags(ALLEGRO_OPENGL) \n\t\tdisplay = al_create_display(SCREEN_W,SCREEN_H)\n\t\tal_set_window_title(display,TITLE)\n\t\tal_clear_to_color(al_map_rgb(0,0,0))\n\t\tevent_queue = al_create_event_queue()\n\t\tal_register_event_source(event_queue, \n\t\tal_get_display_event_source(display))\n\t\tev = al_new_allegro_event()\n\t\ttimeout = al_new_allegro_timeout()\n\t\tal_init_timeout(timeout, 0.06)\n\t\ttimer = al_create_timer(1.0 / FPS)\n\t\tal_register_event_source(event_queue, \n\t\tal_get_timer_event_source(timer))\n\t\tal_start_timer(timer)\n\t\tal_install_mouse()\n\t\tal_register_event_source(event_queue, \n\t\tal_get_mouse_event_source())\n\t\tal_install_keyboard()\n\t\tal_register_event_source(event_queue, \n\t\tal_get_keyboard_event_source())\n\n\tfunc eventsLoop\n\t\twhile true\n\t\t\tal_wait_for_event_until(event_queue, ev, timeout)\n\t\t\tswitch al_get_allegro_event_type(ev)\n\t\t\ton ALLEGRO_EVENT_DISPLAY_CLOSE\n\t\t\t\tCloseEvent()\n\t\t\ton ALLEGRO_EVENT_TIMER\n\t\t\t\tredraw = true\n\t\t\ton ALLEGRO_EVENT_MOUSE_AXES\n\t\t\t\tmouse_x = al_get_allegro_event_mouse_x(ev)\n\t\t\t\tmouse_y = al_get_allegro_event_mouse_y(ev)\n\t\t\t\tif PRINT_MOUSE_XY\n\t\t\t\t\tsee \"x = \" + mouse_x + nl\n\t\t\t\t\tsee \"y = \" + mouse_y + nl\n\t\t\t\tok\n\t\t\ton ALLEGRO_EVENT_MOUSE_ENTER_DISPLAY\n\t\t\t\tmouse_x = al_get_allegro_event_mouse_x(ev)\n\t\t\t\tmouse_y = al_get_allegro_event_mouse_y(ev)\n\t\t\ton ALLEGRO_EVENT_MOUSE_BUTTON_UP\n\t\t\t\tMouseClickEvent()\n\t\t\ton ALLEGRO_EVENT_KEY_DOWN\n\t\t\t\tswitch al_get_allegro_event_keyboard_keycode(ev)\n\t\t\t\t\ton ALLEGRO_KEY_UP\n\t\t\t\t\t\tkey[KEY_UP] = true\n\t\t\t\t\ton ALLEGRO_KEY_DOWN\n\t\t\t\t\t\tkey[KEY_DOWN] = true\n\t\t\t\t\ton ALLEGRO_KEY_LEFT\n\t\t\t\t\t\tkey[KEY_LEFT] = true\n\t\t\t\t\ton ALLEGRO_KEY_RIGHT\n\t\t\t\t\t\tkey[KEY_RIGHT] = true\n\t\t\t\toff\n\t\t\ton ALLEGRO_EVENT_KEY_UP\n\t\t\t\tswitch al_get_allegro_event_keyboard_keycode(ev)\n\t\t\t\t\ton ALLEGRO_KEY_UP\n\t\t\t\t\t\tkey[KEY_UP] = false\n\t\t\t\t\ton ALLEGRO_KEY_DOWN\n\t\t\t\t\t\tkey[KEY_DOWN] = false\n\t\t\t\t\ton ALLEGRO_KEY_LEFT\n\t\t\t\t\t\tkey[KEY_LEFT] = false\n\t\t\t\t\ton ALLEGRO_KEY_RIGHT\n\t\t\t\t\t\tkey[KEY_RIGHT] = false\n\t\t\t\t\ton ALLEGRO_KEY_ESCAPE\n\t\t\t\t\t\texit\n\t\t\t\toff\n\t\t\toff\n\t\t\tif redraw and al_is_event_queue_empty(event_queue)\n\t\t\t\tredraw = false\n\t\t\t\tdrawScene()\n\t\t\t\tal_flip_display()\n\t\t\tok\n\t\t\tcallgc()\n\t\tend\n\n\tfunc destroy\n\t\tal_destroy_timer(timer)\n\t\tal_destroy_allegro_event(ev)\n\t\tal_destroy_allegro_timeout(timeout)\n\t\tal_destroy_event_queue(event_queue)\n\t\tal_destroy_display(display)\n\t\tal_exit()\n\n\tfunc loadresources\n\n\tfunc drawScene\n\n\tfunc MouseClickEvent\n\t\texit \t\t\t# Exit from the Events Loop \n\n\tfunc CloseEvent\n\t\texit \t\t\t# Exit from the Events Loop",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_11.txt",
        "content": "$ hopper jm/puzzle.jambo\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\n         \u2502 14 \u2502\u2502 5  \u2502\u2502 3  \u2502\u2502 12 \u2502\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\n         \u2502 13 \u2502\u2502 9  \u2502\u2502 6  \u2502\u2502 11 \u2502\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\n         \u2502 15 \u2502\u2502 10 \u2502\u2502 8  \u2502\u2502 2  \u2502\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u2584\u2584\u2584\u2584\u2584\u2584\n         \u2502 4  \u2502\u2502 1  \u2502\u2502 7  \u2502\u2588    \u2588\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2580\u2580\u2580\u2580\u2580\u2580\n         ..... (muchos click)\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\n         \u2502 7  \u2502\u2502 10 \u2502\u2502 14 \u2502\u2502 12 \u2502\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\n         \u2502 15 \u2502\u2502    \u2502\u2502 4  \u2502\u2502 2  \u2502\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\n         \u250c\u2500\u2500\u2500\u2500\u2510\u2584\u2584\u2584\u2584\u2584\u2584\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\n         \u2502 1  \u2502\u2588 8  \u2588\u2502 6  \u2502\u2502 11 \u2502\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2580\u2580\u2580\u2580\u2580\u2580\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\n         \u2502 3  \u2502\u2502 13 \u2502\u2502 5  \u2502\u2502 9  \u2502\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\n         ....( muy muchos clicks )\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\n         \u2502 1  \u2502\u2502 2  \u2502\u2502 3  \u2502\u2502 4  \u2502\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\n         \u2502 5  \u2502\u2502 6  \u2502\u2502 7  \u2502\u2502 8  \u2502\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\n         \u2502 9  \u2502\u2502 10 \u2502\u2502 11 \u2502\u2502 12 \u2502\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\n         \u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u250c\u2500\u2500\u2500\u2500\u2510\u2584\u2584\u2584\u2584\u2584\u2584\n         \u2502 13 \u2502\u2502 14 \u2502\u2502 15 \u2502\u2588    \u2588\n         \u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2514\u2500\u2500\u2500\u2500\u2518\u2580\u2580\u2580\u2580\u2580\u2580\n\n              LO RESOLVISTE!\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_110.txt",
        "content": "require 'io/console'\n\nclass Board\n  SIZE = 4\n  RANGE = 0...SIZE\n  \n  def initialize\n    width = (SIZE*SIZE-1).to_s.size\n    @frame = (\"+\" + \"-\"*(width+2)) * SIZE + \"+\"\n    @form = \"|\u00a0%#{width}d \" * SIZE + \"|\"\n    @step = 0\n    @orign = [*0...SIZE*SIZE].rotate.each_slice(SIZE).to_a.freeze\n    @board = @orign.map{|row | row.dup}\n    randomize\n    draw\n    message\n    play\n  end\n  \n  private\n  \n  def randomize\n    @board[0][0], @board[SIZE-1][SIZE-1] = 0, 1\n    @board[SIZE-1][0], @board[0][SIZE-1] = @board[0][SIZE-1], @board[SIZE-1][0]\n    x, y, dx, dy = 0, 0, 1, 0\n    50.times do\n      nx,ny = [[x+dx,y+dy], [x+dy,y-dx], [x-dy,y+dx]]\n                .select{|nx,ny| RANGE.include?(nx) and RANGE.include?(ny)}\n                .sample\n      @board[nx][ny], @board[x][y] = 0, @board[nx][ny]\n      x, y, dx, dy = nx, ny, nx-x, ny-y\n    end\n    @x, @y = x, y \n  end\n  \n  def draw\n    puts \"\\e[H\\e[2J\"\n    @board.each do |row|\n      puts @frame\n      puts (@form % row).sub(\" 0 \", \"   \")\n    end\n    puts @frame\n    puts \"Step: #{@step}\"\n  end\n  \n  DIR = {up: [-1,0], down: [1,0], left: [0,-1], right: [0,1]}\n  def move(direction)\n    dx, dy = DIR[direction]\n    nx, ny = @x + dx, @y + dy\n    if RANGE.include?(nx) and RANGE.include?(ny)\n      @board[nx][ny], @board[@x][@y] = 0, @board[nx][ny]\n      @x, @y = nx, ny\n      @step += 1\n      draw\n    end\n  end\n  \n  def play\n    until @board == @orign\n      case  key_in\n      when \"\\e[A\", \"w\" then move(:up)\n      when \"\\e[B\", \"s\" then move(:down)\n      when \"\\e[C\", \"d\" then move(:right)\n      when \"\\e[D\", \"a\" then move(:left)\n      \n      when \"q\",\"\\u0003\",\"\\u0004\"  then exit\n      when \"h\"  then message\n      end\n    end\n    \n    puts \"Congratulations, you have won!\"\n  end\n  \n  def key_in\n    input = STDIN.getch\n    if input == \"\\e\" \n      2.times {input << STDIN.getch}\n    end\n    input\n  end\n  \n  def message\n    puts <<~EOM\n      Use the arrow-keys or WASD on your keyboard to push board in the given direction.   \n      PRESS q TO QUIT (or Ctrl-C or Ctrl-D)\n    EOM\n  end\nend\n\nBoard.new\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_111.txt",
        "content": "+----+----+----+----+\n|  5 |  7 |  2 | 13 |\n+----+----+----+----+\n|  6 |    |  8 | 12 |\n+----+----+----+----+\n| 10 |  3 |  1 | 15 |\n+----+----+----+----+\n|  9 |  4 | 14 | 11 |\n+----+----+----+----+\nStep: 0\nUse the arrow-keys or WASD on your keyboard to push board in the given direction.\nPRESS q TO QUIT (or Ctrl-C or Ctrl-D)\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_112.txt",
        "content": "DIM = 100\nSOLUTION = %w[1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 0].freeze\n\nattr_reader :bcolor, :dark, :light, :tcolor, :space, :blank, :list\n\ndef settings\n  size(400, 400)\nend\n\ndef setup\n  sketch_title 'Fifteen Tile Puzzle'\n  labels = SOLUTION.shuffle\n  @list = []\n  grid(width, height, DIM, DIM) do |y, x|\n    list << Tile.new(Vec2D.new(x, y), labels[list.length])\n  end\n  @tcolor = color(255, 175, 0)\n  @bcolor = color(235, 231, 178)\n  @dark = color(206, 141, 0)\n  @light = color(255, 214, 126)\n  text_size(DIM / 2.7)\n  text_align(CENTER)\n  no_loop\nend\n\ndef draw\n  list.each(&:draw)\nend\n\ndef mouse_clicked\n  inside = list.find_index { |tile| tile.include?(Vec2D.new(mouse_x, mouse_y)) }\n  target = list.find_index { |tile| tile.label == '0' }\n  source = list[inside].pos\n  dest = list[target].pos\n  return unless source.dist(dest) == DIM\n\n  list[target].label = list[inside].label\n  list[inside].label = '0'\n  redraw\nend\n\n# Our Tile Boundary Class\nclass Boundary\n  attr_reader :low, :high\n\n  def initialize(low, high)\n    @low = low\n    @high = high\n  end\n\n  def include?(val)\n    return false unless (low.x...high.x).cover? val.x\n\n    return false unless (low.y...high.y).cover? val.y\n\n    true\n  end\nend\n\n# Holds Tile logic and draw (Processing::Proxy give access to Sketch methods)\nclass Tile\n  include Processing::Proxy\n  attr_writer :label\n  attr_reader :boundary, :label, :pos\n\n  def initialize(pos, lbl)\n    @label = lbl\n    @pos = pos\n    @boundary = Boundary.new(pos, pos + Vec2D.new(DIM, DIM))\n  end\n\n  def draw_empty\n    fill(bcolor)\n    rect(pos.x + 1, pos.y + 1, DIM - 1, DIM - 1)\n  end\n\n  def draw_tile\n    rect(pos.x + 1, pos.y + 1, DIM - 1, DIM - 1)\n    fill(0) # Black text shadow\n    text(label, pos.x + DIM / 2 + 1, pos.y + DIM / 2 + text_ascent / 2)\n    fill(255)\n    text(label, pos.x + DIM / 2, pos.y + DIM / 2 + text_ascent / 2)\n    stroke(dark)\n    line(pos.x + DIM - 1, pos.y + 1, pos.x + DIM - 1, pos.y + DIM - 2) # Right side shadow\n    line(pos.x + 2, pos.y + DIM, pos.x + DIM - 1, pos.y + DIM - 2) # Bottom side shadow\n    stroke(light)\n    line(pos.x + 2, pos.y - 1, pos.x + 2, pos.y + DIM - 1) # Left bright\n    line(pos.x + 2, pos.y + 1, pos.x + DIM - 1, pos.y + 1) # Upper bright\n  end\n\n  def include?(vec)\n    boundary.include?(vec)\n  end\n\n  def draw\n    no_stroke\n    return draw_empty if label == '0'\n\n    fill(tcolor)\n    draw_tile\n  end\nend\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_113.txt",
        "content": "call SetCSS\n' ---- fill 15 squares with 1 to 15\ndim sq(16)\nfor i = 1 to 15: sq(i) = i: next \n \n'----- shuffle the squares\n[newGame]\nfor i = 1 to 100\t\t' Shuffle the squares\n\tj\t= rnd(0) * 16 + 1\n\tk\t= rnd(0) * 16 + 1\n\th\t= sq(j)\n\tsq(j)\t= sq(k)\n\tsq(k)\t= h\nnext i\n \n' ---- show the squares\n[loop]\ncls\nhtml \"<CENTER><TABLE><TR align=center>\"\nfor i = 1 to 16\n\thtml \"<TD>\"\n\tif sq(i) <> 0 then\n\t\tbutton\t#pick, str$(sq(i)), [pick]\n\t\t\t#pick setkey(str$(i))\n\t\t\t#pick cssclass(\"lBtn\")\n\tend if\n\thtml \"</TD>\"\n\tif i mod 4 = 0 then html \"</TR><TR align=center>\"\nnext i\nhtml \"</table>\"\nwait\n \n' ---- Find what square they picked\n[pick]\t\t\t\npicked\t= val(EventKey$)\nmove\t= 0             '                0000000001111111\nif picked - 1 > 0 then  ' LEFT           1234567890123456\n\t\t\t\tif mid$(\" *** *** *** ***\",picked,1) = \"*\" and sq(picked -1) = 0 then move = -1 :end if\nif picked + 1 < 17 then ' RIGHT\n\t\t\t\tif mid$(\"*** *** *** *** \",picked,1) = \"*\" and sq(picked +1) = 0 then move =  1 :end if\nif picked - 4 > 0  then ' UP \n\t\t\t\tif mid$(\"    ************\",picked,1) = \"*\" and sq(picked -4) = 0 then move = -4 :end if\nif picked + 4 < 17 then ' DOWN \n\t\t\t\tif mid$(\"************    \",picked,1) = \"*\" and sq(picked +4) = 0 then move =  4 :end if\n' ---- See if they picked a valid square next to the blank square\nif move = 0 then\n\tprint \"Invalid move: \";sq(picked)\n\twait\nend if\n \n' ---- Valid squire, switch it with the blank square\nsq(picked + move) = sq(picked) ' move to the empty square\nsq(picked) = 0\nfor i = 1 to 15  ' ---- If they got them all in a row they are a winner\n\tif sq(i) <> i then goto [loop]\nnext i\n \nprint \"----- You are a winner -----\"\ninput \"Play again (Y/N)\";a$\nif a$ = \"Y\" then goto [newGame]\t\t' set up new game\nend\n \n' ---- Make the squares look nice\nSUB SetCSS\nCSSClass \".lBtn\", \"{\nbackground:wheat;border-width:5px;width:70px;\nText-Align:Center;Font-Size:24pt;Font-Weight:Bold;Font-Family:Arial;\n}\"\nEND SUB",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_114.txt",
        "content": "extern crate rand;\nuse clearscreen::clear;\nuse std::collections::HashMap;\nuse std::fmt;\nuse std::io::{self, Write};\n\nuse rand::seq::SliceRandom;\nuse rand::Rng;\n\n#[derive(Copy, Clone, PartialEq, Debug)]\nenum Cell {\n    Card(usize),\n    Empty,\n}\n\n#[derive(Eq, PartialEq, Hash, Debug)]\nenum Direction {\n    Up,\n    Down,\n    Left,\n    Right,\n}\n\nenum Action {\n    Move(Direction),\n    Quit,\n}\n\ntype Board = [Cell; 16];\nconst EMPTY: Board = [Cell::Empty; 16];\n\nstruct P15 {\n    board: Board,\n}\n\nimpl P15 {\n    fn new() -> Self {\n        let mut board = EMPTY;\n        for (i, cell) in board.iter_mut().enumerate().skip(1) {\n            *cell = Cell::Card(i);\n        }\n\n        let mut rng = rand::thread_rng();\n\n        board.shuffle(&mut rng);\n        if !Self::is_valid(board) {\n            // random swap\n            let i = rng.gen_range(0..16);\n            let mut j = rng.gen_range(0..16);\n            while j == i {\n                j = rng.gen_range(0..16);\n            }\n            board.swap(i, j);\n        }\n\n        Self { board }\n    }\n\n    fn is_valid(mut board: Board) -> bool {\n        // TODO: optimize\n        let mut permutations = 0;\n\n        let pos = board.iter().position(|&cell| cell == Cell::Empty).unwrap();\n\n        if pos != 15 {\n            board.swap(pos, 15);\n            permutations += 1;\n        }\n\n        for i in 1..16 {\n            let pos = board\n                .iter()\n                .position(|&cell| matches!(cell, Cell::Card(value) if value == i))\n                .unwrap();\n\n            if pos + 1 != i {\n                board.swap(pos, i - 1);\n                permutations += 1;\n            }\n        }\n\n        permutations % 2 == 0\n    }\n\n    fn get_empty_position(&self) -> usize {\n        self.board.iter().position(|&c| c == Cell::Empty).unwrap()\n    }\n\n    fn get_moves(&self) -> HashMap<Direction, Cell> {\n        let mut moves = HashMap::new();\n        let i = self.get_empty_position();\n\n        if i > 3 {\n            moves.insert(Direction::Up, self.board[i - 4]);\n        }\n        if i % 4 != 0 {\n            moves.insert(Direction::Left, self.board[i - 1]);\n        }\n        if i < 12 {\n            moves.insert(Direction::Down, self.board[i + 4]);\n        }\n        if i % 4 != 3 {\n            moves.insert(Direction::Right, self.board[i + 1]);\n        }\n        moves\n    }\n\n    fn play(&mut self, direction: &Direction) {\n        let i = self.get_empty_position();\n        // This is safe because `ask_action` only returns legal moves\n        match *direction {\n            Direction::Up => self.board.swap(i, i - 4),\n            Direction::Left => self.board.swap(i, i - 1),\n            Direction::Right => self.board.swap(i, i + 1),\n            Direction::Down => self.board.swap(i, i + 4),\n        };\n    }\n\n    fn is_complete(&self) -> bool {\n        self.board.iter().enumerate().all(|(i, &cell)| match cell {\n            Cell::Card(value) => value == i + 1,\n            Cell::Empty => i == 15,\n        })\n    }\n}\n\nimpl fmt::Display for P15 {\n    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n        (writeln!(f, \"+----+----+----+----+\"))?;\n        for (i, &cell) in self.board.iter().enumerate() {\n            match cell {\n                Cell::Card(value) => (write!(f, \"| {value:2} \"))?,\n                Cell::Empty => (write!(f, \"|    \"))?,\n            }\n\n            if i % 4 == 3 {\n                (writeln!(f, \"|\"))?;\n                (writeln!(f, \"+----+----+----+----+\"))?;\n            }\n        }\n        Ok(())\n    }\n}\n\nfn main() {\n    let mut p15 = P15::new();\n\n    for turns in 1.. {\n        println!(\"{p15}\");\n        match ask_action(&p15.get_moves(), true) {\n            Action::Move(direction) => {\n                p15.play(&direction);\n                clear().expect(\"failed to clear screen\");\n            }\n            Action::Quit => {\n                clear().expect(\"failed to clear screen\");\n\n                println!(\"Bye!\");\n                break;\n            }\n        }\n\n        if p15.is_complete() {\n            println!(\"Well done! You won in {turns} turns\");\n            break;\n        }\n    }\n}\n\nfn ask_action(moves: &HashMap<Direction, Cell>, render_list: bool) -> Action {\n    use Action::*;\n    use Direction::*;\n\n    if render_list {\n        println!(\"Possible moves:\");\n\n        if let Some(&Cell::Card(value)) = moves.get(&Up) {\n            println!(\"\\tU) {value}\");\n        }\n        if let Some(&Cell::Card(value)) = moves.get(&Left) {\n            println!(\"\\tL) {value}\");\n        }\n        if let Some(&Cell::Card(value)) = moves.get(&Right) {\n            println!(\"\\tR) {value}\");\n        }\n        if let Some(&Cell::Card(value)) = moves.get(&Down) {\n            println!(\"\\tD) {value}\");\n        }\n        println!(\"\\tQ) Quit\");\n        print!(\"Choose your move: \");\n        io::stdout().flush().unwrap();\n    } else {\n        print!(\"Unknown move, try again: \");\n        io::stdout().flush().unwrap();\n    }\n\n    let mut action = String::new();\n    io::stdin().read_line(&mut action).expect(\"read error\");\n    match action.to_uppercase().trim() {\n        \"U\" if moves.contains_key(&Up) => Move(Up),\n        \"L\" if moves.contains_key(&Left) => Move(Left),\n        \"R\" if moves.contains_key(&Right) => Move(Right),\n        \"D\" if moves.contains_key(&Down) => Move(Down),\n        \"Q\" => Quit,\n        _ => {\n            if unknown_action() {\n                ask_action(moves, true)\n            } else {\n                ask_action(moves, false)\n            }\n        }\n    }\n}\n\nfn unknown_action() -> bool {\n    use crossterm::{\n        cursor::MoveToPreviousLine,\n        terminal::{Clear, ClearType},\n        ExecutableCommand,\n    };\n    std::io::stdout().execute(MoveToPreviousLine(1)).unwrap();\n    std::io::stdout()\n        .execute(Clear(ClearType::CurrentLine))\n        .unwrap();\n    false\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_115.txt",
        "content": "import java.util.Random\n\nimport jline.console._\n\nimport scala.annotation.tailrec\nimport scala.collection.immutable\nimport scala.collection.parallel.immutable.ParVector\n\nobject FifteenPuzzle {\n  def main(args: Array[String]): Unit = play()\n  \n  @tailrec def play(len: Int = 1000): Unit = if(gameLoop(Board.randState(len))) play(len)\n  def gameLoop(board: Board): Boolean = {\n    val read = new ConsoleReader()\n    val km = KeyMap.keyMaps().get(\"vi-insert\")\n    val opMap = immutable.HashMap[Operation, Char](\n      Operation.PREVIOUS_HISTORY -> 'u',\n      Operation.BACKWARD_CHAR -> 'l',\n      Operation.NEXT_HISTORY -> 'd',\n      Operation.FORWARD_CHAR -> 'r')\n    \n    @tailrec\n    def gloop(b: Board): Boolean = {\n      println(s\"\\u001B[2J\\u001B[2;0H$b\\n\u2190\u2191\u2192\u2193q\")\n      if(b.isSolved) println(\"Solved!\\nPlay again? (y/n)\")\n      \n      read.readBinding(km) match{\n        case Operation.SELF_INSERT => read.getLastBinding match{\n          case \"q\" => false\n          case \"y\" if b.isSolved => true\n          case \"n\" if b.isSolved => false\n          case _ => gloop(b)\n        }\n        case op: Operation if opMap.isDefinedAt(op) => gloop(b.move(opMap(op)))\n        case _ => gloop(b)\n      }\n    }\n    \n    gloop(board)\n  }\n  \n  case class Board(mat: immutable.HashMap[(Int, Int), Int], x: Int, y: Int) {\n    def move(mvs: Seq[Char]): Board = mvs.foldLeft(this){case (b, m) => b.move(m)}\n    def move(mov: Char): Board = mov match {\n      case 'r' if x < 3 => Board(mat ++ Seq(((x, y), mat((x + 1, y))), ((x + 1, y), 0)), x + 1, y)\n      case 'l' if x > 0 => Board(mat ++ Seq(((x, y), mat((x - 1, y))), ((x - 1, y), 0)), x - 1, y)\n      case 'd' if y < 3 => Board(mat ++ Seq(((x, y), mat((x, y + 1))), ((x, y + 1), 0)), x, y + 1)\n      case 'u' if y > 0 => Board(mat ++ Seq(((x, y), mat((x, y - 1))), ((x, y - 1), 0)), x, y - 1)\n      case _ => this\n    }\n    \n    def isSolved: Boolean = sumDist == 0\n    def sumDist: Int = mat.to(LazyList).map{ case ((a, b), n) => if(n == 0) 6 - a - b else (a + b - ((n - 1) % 4) - ((n - 1) / 4)).abs }.sum\n  \n    override def toString: String = {\n      val lst = mat.toVector.map { case ((a, b), n) => (4 * b + a, n) }.sortWith(_._1 < _._1).map(_._2)\n      lst.map { n => if (n == 0) \"  \" else f\"$n%2d\" }.grouped(4).map(_.mkString(\" \")).mkString(\"\\n\")\n    }\n  }\n  \n  object Board {\n    val moves: Vector[Char] = Vector('r', 'l', 'd', 'u')\n    \n    def apply(config: Vector[Int]): Board = {\n      val ind = config.indexOf(0)\n      val formed = config.zipWithIndex.map { case (n, i) => ((i % 4, i / 4), n) }\n      val builder = immutable.HashMap.newBuilder[(Int, Int), Int]\n      builder ++= formed\n      Board(builder.result, ind % 4, ind / 4)\n    }\n    \n    def solveState: Board = apply((1 to 15).toVector :+ 0)\n    def randState(len: Int, rand: Random = new Random()): Board = Iterator\n      .fill(len)(moves(rand.nextInt(4)))\n      .foldLeft(Board.solveState) { case (state, mv) => state.move(mv) }\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_116.txt",
        "content": "(import (scheme base)\n        (scheme read)\n        (scheme write)\n        (srfi 27))    ; random numbers\n\n(define *start-position* #(1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 #\\space))\n(random-source-randomize! default-random-source)\n\n;; return a 16-place vector with the tiles randomly shuffled\n(define (create-start-position)\n  (let ((board (vector-copy *start-position*)))\n    (do ((i 0 (+ 1 i))\n         (moves (find-moves board) (find-moves board)))\n      ((and (>= i 100)\n            (not (finished? board)))\n       board)\n      (make-move board\n                 (list-ref moves (random-integer (length moves)))))))\n\n;; return index of space\n(define (find-space board)\n  (do ((i 0 (+ 1 i)))\n    ((equal? #\\space (vector-ref board i)) i)))\n\n;; return a list of symbols indicating available moves\n(define (find-moves board)\n  (let* ((posn (find-space board))\n         (row (quotient posn 4))\n         (col (remainder posn 4))\n         (result '()))\n    (when (> row 0) (set! result (cons 'up result)))\n    (when (< row 3) (set! result (cons 'down result)))\n    (when (> col 0) (set! result (cons 'left result)))\n    (when (< col 3) (set! result (cons 'right result)))\n    result))\n\n;; make given move - assume it is legal\n(define (make-move board move)\n  (define (swap posn-1 posn-2)\n    (let ((tmp (vector-ref board posn-1)))\n      (vector-set! board posn-1 (vector-ref board posn-2))\n      (vector-set! board posn-2 tmp)))\n  ;\n  (let ((posn (find-space board)))\n    (case move\n      ((left)\n       (swap posn (- posn 1)))\n      ((right)\n       (swap posn (+ posn 1)))\n      ((up)\n       (swap posn (- posn 4)))\n      ((down)\n       (swap posn (+ posn 4))))))\n\n(define (finished? board)\n  (equal? board *start-position*))\n\n(define (display-board board)\n  (do ((i 0 (+ 1 i)))\n    ((= i (vector-length board)) (newline))\n    (when (zero? (modulo i 4)) (newline))\n    (let ((curr (vector-ref board i)))\n      (display curr)\n      (display (if (and (number? curr) \n                        (> curr 9)) \n                 \" \"\n                 \"  \")))))\n\n;; the main game loop\n(define (play-game)\n  (let ((board (create-start-position)))\n    (do ((count 1 (+ count 1))\n         (moves (find-moves board) (find-moves board)))\n      ((finished? board) \n       (display (string-append \"\\nCOMPLETED PUZZLE in \"\n                               (number->string count)\n                               \" moves\\n\")))\n      (display-board board)\n      (display \"Enter a move: \") (display moves) (newline)\n      (let ((move (read)))\n        (if (memq move moves)\n          (make-move board move)\n          (display \"Invalid move - try again\"))))))\n\n(play-game)\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_117.txt",
        "content": "1  2     3  \n5  7  6  11 \n13 14 8  4  \n10 9  15 12 \nEnter a move: (right left down)\nright\n\n1  2  3     \n5  7  6  11 \n13 14 8  4  \n10 9  15 12 \nEnter a move: (left down)\ndown\n\n1  2  3  11 \n5  7  6     \n13 14 8  4  \n10 9  15 12 \nEnter a move: (left down up)\ndown\n\n1  2  3  11 \n5  7  6  4  \n13 14 8     \n10 9  15 12 \nEnter a move: (left down up)\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_118.txt",
        "content": "tiles=[1:15,0];\nsolution=[tiles(1:4);...\n          tiles(5:8);...\n          tiles(9:12);...\n          tiles(13:16)];\nsolution=string(solution);\nsolution(16)=\" \";\n          \ninit_pos=grand(1,\"prm\",tiles);\npuzzle=[init_pos(1:4);...\n        init_pos(5:8);...\n        init_pos(9:12);...\n        init_pos(13:16)];\npuzzle=string(puzzle);\n\nblank_pos=[];\nfor i=1:4\n    for j=1:4\n        if puzzle(i,j)==\"0\" then\n            blank_pos=[i,j];\n        end\n    end\nend\n\nclear i j\n\npuzzle(blank_pos(1),blank_pos(2))=\" \";\n\nn_moves=0;\nsolved=%F;\nwhile ~solved\n    disp(puzzle); mprintf(\"\\n\");\n    \n    neighbours=[0 -1;...\n               -1  0;...\n                0 +1;...\n               +1  0];\n    neighbours(:,1)=neighbours(:,1)+blank_pos(1);\n    neighbours(:,2)=neighbours(:,2)+blank_pos(2);\n    neighbours=[neighbours zeros(4,1)]\n    \n    i=0;\n    for i=1:4\n        if ~(neighbours(i,1)<1 | neighbours(i,1)>4 |...\n           neighbours(i,2)<1 | neighbours(i,2)>4) then\n           neighbours(i,3)=evstr(puzzle(neighbours(i,1),neighbours(i,2)));\n       end\n    end\n    \n    valid_move=%F;\n    while ~valid_move\n        move_tile=[];    \n        move_tile=input(\"Enter tile you want to move (0 to exit):\");\n        if sum(move_tile==neighbours(:,3)) & move_tile~=0 then\n            valid_move=%T;\n            n_moves=n_moves+1;\n        elseif move_tile==0 then\n            disp(\"Exit\");\n            abort\n        else\n            disp(puzzle);\n            disp(\"Invalid input\");\n        end\n    end\n    \n    neighb_i=find(neighbours(:,3)'==move_tile);\n    puzzle(neighbours(neighb_i,1),neighbours(neighb_i,2))=\" \";\n    puzzle(blank_pos(1),blank_pos(2))=string(move_tile);\n    blank_pos=neighbours(neighb_i,1:2);\n    \n    if sum(puzzle==solution)==16 then\n        solved=%T;\n        disp(puzzle);\n        mprintf(\"\\n\"+...\n                \"   _____       _               _ _ \\n\"+...\n                \"  / ____|     | |             | | |\\n\"+...\n                \" | (___   ___ | |_   _____  __| | |\\n\"+...\n                \"  \\\\___ \\\\ / _ \\\\| \\\\ \\\\ / / _ \\\\/ _` | |\\n\"+...\n                \"  ____) | (_) | |\\\\ V /  __/ (_| |_|\\n\"+...\n                \" |_____/ \\\\___/|_| \\\\_/ \\\\___|\\\\__,_(_)\\n\")\n    end\nend\n\ndisp(\"Solved in \"+string(n_moves)+\" moves.\");\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_119.txt",
        "content": "!1   2   3   4  \u00a0!\n!               \u00a0!\n!5   6   7   8  \u00a0!\n!               \u00a0!\n!9   14  10  11 \u00a0!\n!               \u00a0!\n!13      15  12 \u00a0!\n\nEnter tile you want to move (0 to exit):\n14\n\n!1   2   3   4  \u00a0!\n!               \u00a0!\n!5   6   7   8  \u00a0!\n!               \u00a0!\n!9       10  11 \u00a0!\n!               \u00a0!\n!13  14  15  12 \u00a0!\n\nEnter tile you want to move (0 to exit):\n10\n\n\n!1   2   3   4  \u00a0!\n!               \u00a0!\n!5   6   7   8  \u00a0!\n!               \u00a0!\n!9   10      11 \u00a0!\n!               \u00a0!\n!13  14  15  12 \u00a0!\n\nEnter tile you want to move (0 to exit):\n11\n\n\n!1   2   3   4  \u00a0!\n!               \u00a0!\n!5   6   7   8  \u00a0!\n!               \u00a0!\n!9   10  11     \u00a0!\n!               \u00a0!\n!13  14  15  12 \u00a0!\n\nEnter tile you want to move (0 to exit):\n12\n\n\n!1   2   3   4  \u00a0!\n!               \u00a0!\n!5   6   7   8  \u00a0!\n!               \u00a0!\n!9   10  11  12 \u00a0!\n!               \u00a0!\n!13  14  15     \u00a0!\n\n   _____       _               _ _ \n  / ____|     | |             | | |\n | (___   ___ | |_   _____  __| | |\n  \\___ \\ / _ \\| \\ \\ / / _ \\/ _` | |\n  ____) | (_) | |\\ V /  __/ (_| |_|\n |_____/ \\___/|_| \\_/ \\___|\\__,_(_)\n\n Solved in 4 moves.",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_12.txt",
        "content": "fpg\u2190{\u2395IO\u21900\n    \u237a\u21904 4\n    (s\u2228.<0)\u22282\u2260\u2374s\u2190\u237a:'invalid shape:'s\n    0\u2260\u2374\u2374\u2375:'invalid shuffle count:'\u2375\n    d\u2190d,-d\u2190\u21932 2\u23743\u21911\n    e\u2190\u00af1+\u2374c\u2190'\u2191\u2193\u2190\u2192\u25cb'\n    b\u2190w\u2190s\u2374w\u21901\u233d\u2373\u00d7/s\n    z\u2190\u2283{\n        z p\u2190\u2375\n        n\u2190(?\u2374p)\u2283p\u2190(p\u2261\u00a8(\u2282s)|p)/p\u2190(d~p)+\u2282z\n        b[z n]\u2190b[n z]\n        -\u2368\\n z\n    }\u2363\u2375\u22a2(s-1)0\n    \u2395\u2190b\n    \u236c{\n        b\u2261w:'win'\n        0=\u2374\u237a:\u235e\u2207 \u2375\n        e=i\u2190c\u2373m\u2190\u2283\u237a:'quit'\n        i>e:\u235e\u2207 \u2375\u22a3\u2395\u2190'invalid direction:'m\n        n\u2262s|n\u2190\u2375+i\u2283d:\u235e\u2207 \u2375\u22a3'out of bounds:'m\n        b[\u2375 n]\u2190b[n \u2375]\n        \u2395\u2190(s\u00d70\u2260\u2374\u237a)\u2374b\n        (1\u2193\u237a)\u2207 n\n    }z\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_120.txt",
        "content": "BEGIN\n    CLASS FIFTEENPUZZLE(NUMTILES, SIDE, WIDTH, SEED);\n        INTEGER NUMTILES, SIDE, WIDTH, SEED;\n    BEGIN\n        INTEGER ARRAY TILES(0:NUMTILES);\n        INTEGER BLANKPOS;\n \n        PROCEDURE INVARIANT;\n        BEGIN\n            INTEGER ARRAY UQ(0:NUMTILES);\n            INTEGER I;\n            FOR I\u00a0:= 0 STEP 1 UNTIL NUMTILES DO UQ(I)\u00a0:= -1;\n            FOR I\u00a0:= 0 STEP 1 UNTIL NUMTILES DO\n            BEGIN\n                INTEGER T;\n                T\u00a0:= TILES(I);\n                IF UQ(T) <> -1 THEN ERROR(\"TILES ARE NOT UNIQUE\");\n                UQ(T)\u00a0:= T;\n            END;\n            IF TILES(BLANKPOS) <> 0 THEN ERROR(\"BLANKPOS IS NOT BLANK\");\n        END;\n\n        PROCEDURE SHUFFLE;\n        BEGIN\n            BOOLEAN B;\n            WHILE NOT B DO\n            BEGIN\n                INTEGER N;\n                RESET;\n               \u00a0! DON'T INCLUDE THE BLANK SPACE IN THE SHUFFLE, LEAVE IT\n               \u00a0! IN THE HOME POSITION\u00a0;\n                N\u00a0:= NUMTILES;\n                WHILE N > 1 DO\n                BEGIN\n                    INTEGER R, TMP;\n                    R\u00a0:= UNIFORM(0, N, SEED); N\u00a0:= N - 1;\n                    TMP\u00a0:= TILES(R);\n                    TILES(R)\u00a0:= TILES(N);\n                    TILES(N)\u00a0:= TMP;\n                END;\n                B\u00a0:= ISSOLVABLE;\n            END;\n            INVARIANT;\n        END;\n     \n        PROCEDURE RESET;\n        BEGIN\n            INTEGER I;\n            FOR I\u00a0:= 0 STEP 1 UNTIL NUMTILES DO\n                TILES(I)\u00a0:= MOD((I + 1), NUMTILES + 1);\n            BLANKPOS\u00a0:= NUMTILES;\n            INVARIANT;\n        END;\n     \n       \u00a0! ONLY HALF THE PERMUTATIONS OF THE PUZZLE ARE SOLVABLE.\n       \u00a0! WHENEVER A TILE IS PRECEDED BY A TILE WITH HIGHER VALUE IT COUNTS\n       \u00a0! AS AN INVERSION. IN OUR CASE, WITH THE BLANK SPACE IN THE HOME\n       \u00a0! POSITION, THE NUMBER OF INVERSIONS MUST BE EVEN FOR THE PUZZLE\n       \u00a0! TO BE SOLVABLE.\n       \u00a0! SEE ALSO:\n       \u00a0! WWW.CS.BHAM.AC.UK/~MDR/TEACHING/MODULES04/JAVA2/TILESSOLVABILITY.HTML\n       \u00a0;\n\n        BOOLEAN PROCEDURE ISSOLVABLE;\n        BEGIN\n            INTEGER COUNTINVERSIONS;\n            INTEGER I, J;\n            FOR I\u00a0:= 0 STEP 1 UNTIL NUMTILES - 1 DO\n                FOR J\u00a0:= 0 STEP 1 UNTIL I - 1 DO\n                    IF TILES(J) > TILES(I) THEN\n                        COUNTINVERSIONS\u00a0:= COUNTINVERSIONS + 1;\n            ISSOLVABLE\u00a0:= MOD(COUNTINVERSIONS, 2) = 0;\n        END;\n\n        PROCEDURE PRINTBOARD;\n        BEGIN\n            INTEGER I, J;\n\n            PROCEDURE PRINTLINE;\n            BEGIN\n              INTEGER ROW, COL;\n             \u00a0!      +-----+-----+-----+-----+\u00a0;\n              FOR ROW\u00a0:= 1 STEP 1 UNTIL SIDE DO\n              BEGIN\n                  OUTCHAR('+');\n                  FOR COL\u00a0:= 0 STEP 1 UNTIL WIDTH DO OUTCHAR('-');\n              END;\n              OUTCHAR('+');\n              OUTIMAGE;\n            END;\n\n            PROCEDURE PRINTCELL(T); INTEGER T;\n            BEGIN\n                IF T = 0 THEN\n                BEGIN\n                    INTEGER R;\n                    FOR R\u00a0:= 1 STEP 1 UNTIL WIDTH DO\n                        OUTCHAR(' ');\n                END\n                ELSE OUTINT(T, WIDTH);\n                OUTCHAR(' ');\n            END;\n\n           \u00a0!      +-----+-----+-----+-----+\n           \u00a0!      |  1  |  2  |  3  |  4  |\n           \u00a0!      +-----+-----+-----+-----+\n           \u00a0!      |  5  |  6  |  7  |  8  |\n           \u00a0!      +-----+-----+-----+-----+\n           \u00a0!      |  9  |  10 |  11 |     |\n           \u00a0!      +-----+-----+-----+-----+\n           \u00a0!      |  13 |  14 |  15 |  12 |\n           \u00a0!      +-----+-----+-----+-----+  \u00a0;\n\n            FOR I\u00a0:= 1 STEP 1 UNTIL SIDE DO\n            BEGIN\n                PRINTLINE;\n                OUTCHAR('|');\n                FOR J\u00a0:= 1 STEP 1 UNTIL SIDE DO\n                BEGIN\n                    INTEGER T;\n                    T\u00a0:= TILES((I - 1) * SIDE + (J - 1));\n                    PRINTCELL(T);\n                    OUTCHAR('|');\n                END;\n                OUTIMAGE;\n            END;\n            PRINTLINE;\n        END;\n\n        BOOLEAN PROCEDURE DONE;\n        BEGIN\n            BOOLEAN ORDERED;\n            INTEGER I, EXPECT;\n            ORDERED\u00a0:= TRUE;\n            EXPECT\u00a0:= 1;\n            FOR I\u00a0:= 0 STEP 1 UNTIL NUMTILES - 1 DO\n            BEGIN\n                IF I <> BLANKPOS THEN\n                BEGIN\n                    IF TILES(I) <> EXPECT THEN\n                        ORDERED\u00a0:= FALSE;\n                    EXPECT\u00a0:= EXPECT + 1;\n                END;\n            END;\n            DONE\u00a0:= ORDERED;\n        END;\n\n        PROCEDURE REQUEST;\n        BEGIN\n            INTEGER ARRAY CANDIDATES(1:4);\n            INTEGER I, CANDCOUNT, CHOOSE;\n            BOOLEAN VALIDINPUT;\n\n            PROCEDURE ADDCAND(IDX); INTEGER IDX;\n            BEGIN\n                IF IDX >= 0 AND IDX <= NUMTILES THEN\n                BEGIN\n                    CANDCOUNT\u00a0:= CANDCOUNT + 1;\n                    CANDIDATES(CANDCOUNT)\u00a0:= TILES(IDX);\n                END;\n            END;\n\n            PRINTBOARD;\n\n            IF BLANKPOS <= NUMTILES - SIDE     THEN ADDCAND(BLANKPOS + SIDE);\n            IF BLANKPOS >= SIDE                THEN ADDCAND(BLANKPOS - SIDE);\n            IF MOD(BLANKPOS, SIDE) <> SIDE - 1 THEN ADDCAND(BLANKPOS + 1);\n            IF MOD(BLANKPOS, SIDE) <> 0        THEN ADDCAND(BLANKPOS - 1);\n\n            WHILE NOT VALIDINPUT DO\n            BEGIN\n                OUTTEXT(\"YOUR MOVE: \");\n\n                FOR I\u00a0:= 1 STEP 1 UNTIL CANDCOUNT DO\n                    OUTINT(CANDIDATES(I), SIDE);\n                OUTIMAGE;\n                CHOOSE\u00a0:= ININT;\n\n                FOR I\u00a0:= 1 STEP 1 UNTIL CANDCOUNT DO\n                    IF CHOOSE = CANDIDATES(I) THEN\n                    BEGIN\n                        INTEGER LOOKUP;\n                        FOR LOOKUP\u00a0:= 0 STEP 1 UNTIL NUMTILES DO\n                            IF NOT VALIDINPUT AND TILES(LOOKUP) = CHOOSE THEN\n                            BEGIN\n                                TILES(BLANKPOS)\u00a0:= TILES(LOOKUP);\n                                TILES(LOOKUP)\u00a0:= 0;\n                                BLANKPOS\u00a0:= LOOKUP;\n                                INVARIANT;\n                                VALIDINPUT\u00a0:= TRUE;\n                            END;\n                    END;\n\n                IF NOT VALIDINPUT THEN\n                BEGIN\n                    OUTTEXT(\"INVALID INPUT!\");\n                    OUTIMAGE;\n                END;\n            END;\n        END;\n\n        SHUFFLE;\n    END;\n \n    REF(FIFTEENPUZZLE) P;\n\n    OUTTEXT(\"INPUT RANDOM SEED: \");\n    OUTIMAGE;\n    P\u00a0:- NEW FIFTEENPUZZLE(15, 4, 3, ININT);\u00a0! ININT = RANDOM SEED\u00a0;\n    WHILE NOT P.DONE DO\n        P.REQUEST;\n    P.PRINTBOARD;\nEND.",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_121.txt",
        "content": "INPUT RANDOM SEED:\n456\n+----+----+----+----+\n| 15 |  8 | 13 | 14 |\n+----+----+----+----+\n|  1 |  2 |  9 |  4 |\n+----+----+----+----+\n| 12 |  3 |  5 |  7 |\n+----+----+----+----+\n| 11 |  6 | 10 |    |\n+----+----+----+----+\nYOUR MOVE:    7  10\n7\n+----+----+----+----+\n| 15 |  8 | 13 | 14 |\n+----+----+----+----+\n|  1 |  2 |  9 |  4 |\n+----+----+----+----+\n| 12 |  3 |  5 |    |\n+----+----+----+----+\n| 11 |  6 | 10 |  7 |\n+----+----+----+----+\nYOUR MOVE:    7   4   5\n4\n+----+----+----+----+\n| 15 |  8 | 13 | 14 |\n+----+----+----+----+\n|  1 |  2 |  9 |    |\n+----+----+----+----+\n| 12 |  3 |  5 |  4 |\n+----+----+----+----+\n| 11 |  6 | 10 |  7 |\n+----+----+----+----+\nYOUR MOVE:    4  14   9\n...\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_122.txt",
        "content": "(* Load required Modules for Moscow ML *)\nload \"Int\";\nload \"Random\";\n\n\n(* Mutable Matrix *)\nsignature MATRIX =\nsig\n\ttype 'a matrix\n\tval construct : 'a -> int * int -> 'a matrix\n\tval size : 'a matrix -> int * int\n\tval get : 'a matrix -> int * int -> 'a\n\tval set : 'a matrix -> int * int -> 'a -> unit\nend\n\nstructure Matrix :> MATRIX =\nstruct\n\t(* Array of rows, where the rows are a array of 'a *)\n\ttype 'a matrix = 'a Array.array Array.array\n\n\tfun 'a construct (a : 'a) (width, height) : 'a matrix =\n\t\tif width < 1 orelse height < 1\n\t\t\tthen raise Subscript\n\t\t\telse Array.tabulate (height, fn _ => Array.tabulate (width, fn _ => a))\n\t\n\tfun size b =\n\t\tlet\n\t\t\tval firstrow = Array.sub (b, 0)\n\t\tin\n\t\t\t(Array.length firstrow, Array.length b)\n\t\tend\n\n\t\n\tfun get b (x, y) = Array.sub (Array.sub (b, y), x)\n\n\tfun set b (x, y) v = Array.update (Array.sub (b, y), x, v)\nend\n\nsignature P15BOARD =\nsig\n\ttype board\n\tdatatype direction = North | East | South | West\n\n\tval construct : int * int -> board\n\tval emptyField : board -> int * int\n\tval get : board -> int * int -> int option\n\tval size : board -> int * int\n\n\texception IllegalMove\n\tval moves : board -> int list\n\tval move : board -> int -> unit\n\n\tval issolved : board -> bool\nend\n\n(* Game Logic and data *)\n\nstructure Board :> P15BOARD =\nstruct\n\t(* Matrix + empty Field position *)\n\ttype board = int option Matrix.matrix * (int * int) ref\n\t\n\tdatatype direction = North | East | South | West\n\n\texception IllegalMove\n\n\tfun numberat width (x, y) = (y*width + x + 1)\n\n\tfun construct (width, height) =\n\t\tlet\n\t\t\tval emptyBoard : int option Matrix.matrix = Matrix.construct NONE (width, height) \n\t\tin\n\t\t\t(* Fill the board with numbers *)\n\t\t\tList.tabulate (height, fn y => List.tabulate (width, fn x =>\n\t\t\t\t\tMatrix.set emptyBoard (x, y) (SOME (numberat width (x, y)))));\n\t\t\t(* Clear the last field *)\n\t\t\tMatrix.set emptyBoard (width-1, height-1) NONE;\n\t\t\t(* Return the board *)\n\t\t\t(emptyBoard, ref (width-1, height-1))\n\t\tend\n\n\tfun emptyField (_, rfield) = !rfield\n\n\tfun get (mat, _) (x, y) = Matrix.get mat (x, y)\n\n\tfun size (mat, _) = Matrix.size mat\n\n\t(* toggle the empty field with a given field *)\n\tfun toggle (mat, rpos) pos =\n\t\tlet\n\t\t\tval pos' = !rpos\n\t\t\tval value = Matrix.get mat pos\n\t\tin\n\t\t\tMatrix.set mat pos NONE;\n\t\t\tMatrix.set mat pos' value;\n\t\t\trpos := pos\n\t\tend\n\n\t(* Get list of positions of the neighbors of a given field *)\n\tfun neighbors mat (x, y) : (int * int) list =\n\t\tlet\n\t\t\tval (width, height) = Matrix.size mat\n\t\t\tval directions = [(x, y-1), (x+1, y), (x, y+1), (x-1, y)]\n\t\tin\n\t\t\tList.mapPartial (fn pos => SOME (Matrix.get mat pos; pos) handle Subscript => NONE) directions\n\t\tend\n\t\n\tfun moves (mat, rpos) =\n\t\tlet\n\t\t\tval neighbors = neighbors mat (!rpos)\n\t\tin\n\t\t\tmap (fn pos => valOf (Matrix.get mat pos)) neighbors\n\t\tend\n\t\t\n\tfun move (mat, rpos) m =\n\t\tlet\n\t\t\tval (hx, hy) = !rpos\n\t\t\tval neighbors = neighbors mat (hx, hy)\n\t\t\tval optNeighbor = List.find (fn pos => SOME m = Matrix.get mat pos) neighbors\n\t\tin\n\t\t\tif isSome optNeighbor\n\t\t\tthen\n\t\t\t\ttoggle (mat, rpos) (valOf optNeighbor)\n\t\t\telse\n\t\t\t\traise IllegalMove\n\t\tend\n\n\tfun issolved board =\n\t\tlet\n\t\t\tval (width, height) = size board\n\t\t\tval xs = List.tabulate (width,  fn x => x)\n\t\t\tval ys = List.tabulate (height, fn y => y)\n\t\tin\n\t\t\tList.all (fn x => List.all (fn y => (x + 1 = width andalso y + 1 = height) orelse get board (x, y) = SOME (numberat width (x,y))) ys) xs\n\t\tend\nend\n\n(* Board Shuffle *)\nsignature BOARDSHUFFLE =\nsig\n\tval shuffle : Board.board -> int -> unit\nend\n\nstructure Shuffle :> BOARDSHUFFLE =\nstruct\n\t(*\n\t * Note: Random Number Interfaces are different in SML/NJ and Moscow ML. Comment out the corresponding version:\n\t *)\n\n\t(*\n\t(* SML/NJ - Version *)\n\tval time = Time.now ()\n\tval timeInf = Time.toMicroseconds time\n\tval timens = Int.fromLarge (LargeInt.mod (timeInf, 1073741823));\n\tval rand = Random.rand (timens, timens)\n\n\tfun next n = Random.randRange (0, n) rand\n\t*)\n\n\t(* Moscow ML - Version *)\n\tval generator = Random.newgen ()\n\tfun next n = Random.range (0, n) generator\n\n\n\tfun shuffle board 0 = if (Board.issolved board) then shuffle board 1 else ()\n\t  | shuffle board n =\n\t  \tlet\n\t\t\tval moves = Board.moves board\n\t\t\tval move  = List.nth (moves, next (List.length moves - 1))\n\t\tin\n\t\t\tBoard.move board move;\n\t\t\tshuffle board (n-1)\n\t\tend\nend\n\n\n(* Console interface *)\n\nsignature CONSOLEINTERFACE =\nsig\n\tval start : unit -> unit\n\tval printBoard : Board.board -> unit\nend\n\nstructure Console :> CONSOLEINTERFACE =\nstruct\n\tfun cls () = print \"\\^[[1;1H\\^[[2J\"\n\n\tfun promptNumber prompt =\n\t\tlet\n\t\t\tval () = print prompt\n\t\t\t(* Input + \"\\n\" *)\n\t\t\tval line   = valOf (TextIO.inputLine TextIO.stdIn)\n\t\t\tval length = String.size line\n\t\t\tval input  = String.substring (line, 0, length - 1)\n\t\t\tval optnum = Int.fromString input\n\t\tin\n\t\t\tif isSome optnum\n\t\t\t\tthen valOf optnum\n\t\t\t\telse (print \"Input is not a number.\\n\"; promptNumber prompt)\n\t\tend\n\n\tfun fieldToString (SOME x) = Int.toString x\n\t  | fieldToString (NONE  ) = \"\"\n\n\tfun boardToString board =\n\t\tlet\n\t\t\tval (width, height) = Board.size board\n\t\t\tval xs = List.tabulate (width,  fn x => x)\n\t\t\tval ys = List.tabulate (height, fn y => y)\n\t\tin\n\t\t\tfoldl (fn (y, str) => (foldl (fn (x, str') => str' ^ (fieldToString (Board.get board (x, y))) ^ \"\\t\") str xs) ^ \"\\n\") \"\" ys\n\t\tend\n\t\n\tfun printBoard board = print (boardToString board)\n\n\n\tfun loop board =\n\t\tlet\n\t\t\tval rvalidInput = ref false\n\t\t\tval rinput      = ref 42\n\t\t\tval () = cls ()\n\t\t\tval () = printBoard board\n\t\tin\n\t\t\t(* Ask for a move and repeat until it is a valid move *)\n\t\t\twhile (not (!rvalidInput)) do\n\t\t\t\t(\n\t\t\t\t\trinput := promptNumber \"Input the number to move: \";\n\t\t\t\t\tBoard.move board (!rinput);\n\t\t\t\t\trvalidInput := true\n\t\t\t\t) handle Board.IllegalMove => print \"Illegal move!\\n\"\n\t\tend\n\n\t\n\tfun start () =\n\t\tlet\n\t\t\tval () = cls ()\n\t\t\tval () = print \"Welcome to nxm-Puzzle!\\n\"\n\t\t\tval (width, height) = (promptNumber \"Enter the width: \", promptNumber \"Enter the height: \")\n\t\t\tval diff = (promptNumber \"Enter the difficulty (number of shuffles): \")\n\t\t\tval board = Board.construct (width, height)\n\t\tin\n\t\t\tShuffle.shuffle board diff;\n\t\t\twhile (not (Board.issolved board)) do loop board;\n\t\t\tprint \"Solved!\\n\"\n\t\tend\nend\n\n\nval () = Console.start()\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_123.txt",
        "content": " # 15puzzle_21.tcl - HaJo Gurt -  2016-02-16\n # http://wiki.tcl.tk/14403\n\n #: 15-Puzzle - with grid, buttons and colors\n\n  package require Tk\n\n  set progVersion \"15-Puzzle v0.21\";        # 2016-02-20\n\n  global Msg Moves PuzzNr GoalNr\n  set Msg    \" \"\n  set Moves  -1\n  set PuzzNr  0\n  set GoalNr  0\n\n  set Keys   { 11 12 13 14  21 22 23 24  31 32 33 34  41 42 43 44 }\n\n  set Puzz_T {  T  h  e  F   i  f  t  e   e  n  P  u   z  z  l  e }; # Title\n  set Goal_T {  x  x  x  F   i  f  t  e   e  n  x  x   x  x  x  x }; # Title-highlight\n\n  set Puzz_0 {  E  G  P  N   C  A  F  B   D  L  H  I   O  K  M  _ }; # -  / 116\n  set Puzz_1 {  C  A  F  B   E  G  P  N   D  L  H  I   O  K  M  _ }; # E  / 156 from Tk-demo\n  set Puzz_2 {  E  O  N  K   M  I  _  G   B  H  L  P   C  F  A  D }; # L  / 139\n  set Puzz_3 {  P  G  M  _   E  L  N  D   O  K  H  I   B  C  F  A }; # EK / 146\n\n  set Goal_0 {  A  B  C  D   E  F  G  H   I  K  L  M   N  O  P  _ }; # Rows LTR   / 1:E\u00a0: 108\n  set Goal_1 {  A  E  I  N   B  F  K  O   C  G  L  P   D  H  M  _ }; # Cols forw. / 1:M\u00a0: 114\n\n  set Puzz $Puzz_T\n  set Goal $Goal_T\n\n#---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+---\n\n  proc Move {k} {\n  # find the key with the empty tile:\n    set e -1\n    foreach p $::Keys  {\n      set t [.key$p cget -text]\n      if { $t eq \"_\" } { set e $p }\n    }\n    if {$e  <  0} {return 0};   # no key with empty tile found\n    if {$k == $e} {return 0};   # click was on the empty tile\n\n    set t [.key$k cget -text]\n    .key$e config -text $t\n    .key$k config -text \"_\";  \n    return 1\n  }\n\n  proc Check {} {\n    set ok 0\n    set i  0\n    foreach k $::Keys {\n      set t [.key$k cget -text]\n      set g [lindex $::Goal $i]\n      incr i\n\n      .key$k config -background white\n      if { $t eq $g  } { .key$k config -background lightgreen; incr ok }\n      if { $t eq \"_\" } { .key$k config -background gray }\n    }\n\n    # Solved:\n    update\n    if { $ok > 15 && $::Moves > 0} {\n      foreach k $::Keys  {\n        .key$k flash; bell;\n      }\n    }\n  }\n\n  proc Click {k} {\n    set ::Msg \"\"\n    set val [.key$k cget -text]\n    set ok [Move $k]\n\n    incr ::Moves $ok\n    wm title . \"$::Moves moves\"\n    Check\n  }\n\n  proc ShowKeys {} {\n    set i 0\n    foreach k $::Keys  {\n      set t [lindex $::Puzz $i]\n      incr i\n      .key$k config -text $t -background white;  \n    }\n    Check\n  }\n\n  proc NewGame {N} {\n    global Msg Moves PuzzNr GoalNr\n\n    incr  PuzzNr $N\n    if { $PuzzNr > 3} { set PuzzNr 0 }\n\n                         set ::Goal $::Goal_0;\n    if { $GoalNr == 1} { set ::Goal $::Goal_1; }\n\n    if { $PuzzNr == 0} { set ::Puzz $::Puzz_0; }\n    if { $PuzzNr == 1} { set ::Puzz $::Puzz_1; }\n    if { $PuzzNr == 2} { set ::Puzz $::Puzz_2; }\n    if { $PuzzNr == 3} { set ::Puzz $::Puzz_3; }\n\n                  set Msg \"Try again\"\n    if { $N>0 } { set Msg \"New game\" }\n\n    set Moves 0\n    ShowKeys\n    wm title . \"$Msg \"\n  }\n\n#---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+---\n\n  button .reset   -text \"Restart\"  -fg blue -command {NewGame  0}\n  button .newGame -text \"New Game\" -fg red  -command {NewGame +1}\n\n  foreach k $::Keys {\n    button .key$k -text \"$k\" -width 4 -command \"Click $k\"\n  }\n\n  grid .newGame x .reset x -sticky nsew\n\n  grid .key11 .key12 .key13 .key14  -sticky nsew  -padx 2 -pady 2\n  grid .key21 .key22 .key23 .key24  -sticky nsew  -padx 2 -pady 2\n  grid .key31 .key32 .key33 .key34  -sticky nsew  -padx 2 -pady 2\n  grid .key41 .key42 .key43 .key44  -sticky nsew  -padx 2 -pady 2\n\n  grid configure .newGame .reset  -columnspan 2 -padx 4\n\n  ShowKeys; Check\n  wm title . $progVersion\n  focus -force .\n  wm resizable . 0 0\n\n# For some more versions, see:  http://wiki.tcl.tk/15067\u00a0: Classic 15 Puzzle and http://wiki.tcl.tk/15085\u00a0: N-Puzzle\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_124.txt",
        "content": "#!/usr/bin/env bash\nmain() {\n  local puzzle=({1..15} \" \") blank moves_kv i key count total last\n  printf '\\n'\n  show_puzzle \"${puzzle[@]}\"\n  printf '\\nPress return to scramble.'\n  read _\n  IFS= readarray -t puzzle < <(scramble \"${puzzle[@]}\")\n  printf '\\r\\e[A\\e[A\\e[A\\e[A\\e[A\\e[A'\n  show_puzzle \"${puzzle[@]}\"\n  printf '\\nUse hjkl to slide tiles. '\n  printf '\\r\\e[A\\e[A\\e[A\\e[A\\e[A'\n  total=0\n  while ! solved \"${puzzle[@]}\"; do\n    show_puzzle \"${puzzle[@]}\"\n    { read blank; readarray -t moves_kv; } < <(find_moves \"${puzzle[@]}\")\n    local count=${#moves_kv[@]}/2\n    local -A moves\n    for (( i=0; i<count; i++ )); do\n      moves[${moves_kv[i]}]=${moves_kv[i+count]}\n    done\n    read -r -n 1 key\n    printf '\\r '\n    if [[ \"$key\" = u ]]; then\n      (( total -= 2 ))\n      case \"$last\" in\n        h) key=l;;\n        j) key=k;;\n        k) key=j;;\n        l) key=h;;\n      esac\n    fi\n    if [[ -n \"${moves[$key]}\" ]]; then\n      last=$key\n      (( total++ ))\n      i=${moves[$key]}\n      puzzle[$blank]=${puzzle[i]}\n      puzzle[i]=' '\n    fi\n    printf '\\r\\e[A\\e[A\\e[A\\e[A'\n  done\n  show_puzzle \"${puzzle[@]}\"\n  printf '\\nSolved in %d moves.     \\n' \"$total\"\n}\n\n\nsolved() { \n  local solved=({1..15} ' ')\n  [[ \"${puzzle[*]}\" == \"${solved[*]}\" ]]\n}\n\nshow_puzzle() {\n  printf '%2s %2s %2s %2s\\n' \"$@\"\n}\n\nfind_moves() {\n  local puzzle=(\"$@\")\n  local i j blank\n  for (( i=0; i<${#puzzle[@]}; ++i )); do\n    if [[ \"${puzzle[i]}\" == \" \" ]]; then\n      blank=$i\n      break\n    fi\n  done\n  local -A moves=()\n  if (( blank%4 )); then\n    # swapping blank with tile to its left\n    # is sliding that tile right, which is the l key\n    moves['l']=$(( blank-1 )) \n  fi\n  if (( blank%4 != 3 )); then\n    moves['h']=$(( blank+1 )) # left\n  fi\n  if (( blank >= 4 )); then\n    moves['j']=$(( blank-4 )) # down\n  fi\n  if (( blank < 12 )); then\n    moves['k']=$(( blank+4 )) # up\n  fi\n  printf '%s\\n' \"$blank\" \"${!moves[@]}\" \"${moves[@]}\" \n}\n\nscramble() {\n  local puzzle=(\"$@\") i j \n  for (( i=0; i<256; ++i )); do\n    local blank moves\n    { read blank; readarray -t moves; } < <(find_moves \"${puzzle[@]}\")\n    moves=(${moves[@]:${#moves[@]}/2})\n    local dir=$(( RANDOM % ${#moves[@]} ))\n    j=${moves[dir]}\n    puzzle[blank]=${puzzle[j]}\n    puzzle[j]=' '\n  done\n  printf '%s\\n' \"${puzzle[@]}\"\n}\n\nmain \"$@\"\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_125.txt",
        "content": " 1  2  3  4\n 5  6  7  8\n 9 10 11 12\n13 14 15   \n\nPress return to scramble.\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_126.txt",
        "content": "Public iSide As Integer\nPublic iSize As Integer\nPublic iGrid() As Integer\nPublic lMoves As Long\nPublic sMessage As String\nPublic Const sTitle As String = \"Tile Puzzle\"\n\n\nSub PlayGame()\n    Dim iNum As Integer\n    Dim i As Integer\n    Dim vInput As Variant\n\nDefineGrid:\n    vInput = InputBox(\"Enter size of grid, as a whole number\" & String(2, vbCr) & \"(e.g. for a 4 x 4 grid, enter '4')\", sTitle, 4)\n    If vInput = \"\" Then Exit Sub\n    If Not IsNumeric(vInput) Then GoTo DefineGrid\n    iSide = vInput\n    If iSide < 3 Or iNum > 10 Then GoTo DefineGrid\n    iSize = iSide ^ 2\n    ReDim iGrid(1 To iSize)\n    \nInitalize:\n    InitializeGrid\n    If Not IsSolvable Then GoTo Initalize\n      \nGetInput:\n    vInput = InputBox(ShowGrid & vbCr & \"Enter number to move into empty tile\", sTitle)\n    If vInput = \"\" Then\n        If MsgBox(\"Are you sure? This will end the current game.\", vbExclamation + vbYesNo, sTitle) = vbYes Then Exit Sub\n    End If\n    If Not IsNumeric(vInput) Then\n        sMessage = \"'\" & vInput & \"' is not a valid tile\"\n        GoTo GetInput\n    End If\n    iNum = vInput\n    If iNum < 1 Or iNum > iSize - 1 Then\n        sMessage = iNum & \" is not a valid tile\"\n        GoTo GetInput\n    End If\n    i = FindTile(iNum)\n    If Not ValidMove(i) Then GoTo GetInput\n    MoveTile (i)\n    If TestGrid Then\n        MsgBox \"SUCCESS! You solved the puzzle in \" & lMoves & \" moves\", vbInformation + vbOKOnly, sTitle\n    Else\n        GoTo GetInput\n    End If\nEnd Sub\n\nFunction RandomTile() As Integer\n    Randomize\n    RandomTile = Int(Rnd * iSize) + 1\nEnd Function\n\nFunction GetX(ByVal i As Integer) As Integer\n    GetX = Int((i - 1) / iSide) + 1\nEnd Function\n\nFunction GetY(ByVal i As Integer) As Integer\n    GetY = (i - 1) Mod iSide + 1\nEnd Function\n\nFunction GetI(ByVal x As Integer, y As Integer)\n    GetI = (x - 1) * iSide + y\nEnd Function\n\nFunction InitializeGrid()\n    Dim i As Integer\n    Dim x As Integer\n    Dim y As Integer\n    \n    sMessage = \"New \" & iSide & \" x \" & iSide & \" game started\" & vbCr\n    \n    For i = 1 To iSize\n        iGrid(i) = 0\n    Next i\n    For i = 1 To iSize - 1\n        Do\n            x = RandomTile\n            If iGrid(x) = 0 Then iGrid(x) = i\n        Loop Until iGrid(x) = i\n    Next i\n    lMoves = 0\nEnd Function\n\nFunction IsSolvable() As Boolean\n    Dim i As Integer\n    Dim j As Integer\n    Dim iCount As Integer\n    For i = 1 To iSize - 1\n        For j = i + 1 To iSize\n            If iGrid(j) < iGrid(i) And iGrid(j) > 0 Then iCount = iCount + 1\n        Next j\n    Next i\n    If iSide Mod 2 Then\n        IsSolvable = Not iCount Mod 2\n    Else\n        IsSolvable = iCount Mod 2 = GetX(FindTile(0)) Mod 2\n    End If\nEnd Function\n\nFunction TestGrid() As Boolean\n    Dim i As Integer\n    \n    For i = 1 To iSize - 1\n        If Not iGrid(i) = i Then\n            TestGrid = False\n            Exit Function\n        End If\n    Next i\n    TestGrid = True\nEnd Function\n\nFunction FindTile(ByVal iNum As Integer) As Integer\n    Dim i As Integer\n    For i = 1 To iSize\n        If iGrid(i) = iNum Then\n            FindTile = i\n            Exit Function\n        End If\n    Next i\nEnd Function\n\nFunction ValidMove(ByVal i As Integer) As Boolean\n    Dim e As Integer\n    Dim xDiff As Integer\n    Dim yDiff As Integer\n    \n    e = FindTile(0)\n    xDiff = GetX(i) - GetX(e)\n    yDiff = GetY(i) - GetY(e)\n    If xDiff = 0 Then\n        If yDiff = 1 Then\n            sMessage = \"Tile \" & iGrid(i) & \" was moved left\"\n            ValidMove = True\n        ElseIf yDiff = -1 Then\n            sMessage = \"Tile \" & iGrid(i) & \" was moved right\"\n            ValidMove = True\n        End If\n    ElseIf yDiff = 0 Then\n        If xDiff = 1 Then\n            sMessage = \"Tile \" & iGrid(i) & \" was moved up\"\n            ValidMove = True\n        ElseIf xDiff = -1 Then\n            sMessage = \"Tile \" & iGrid(i) & \" was moved down\"\n            ValidMove = True\n        End If\n    End If\n    If Not ValidMove Then sMessage = \"Tile \" & iGrid(i) & \" may not be moved\"\nEnd Function\n\nFunction MoveTile(ByVal i As Integer)\n    Dim e As Integer\n    e = FindTile(0)\n    iGrid(e) = iGrid(i)\n    iGrid(i) = 0\n    lMoves = lMoves + 1\nEnd Function\n\nFunction ShowGrid()\n    Dim x As Integer\n    Dim y As Integer\n    Dim i As Integer\n    Dim sNum As String\n    Dim s As String\n    \n    For x = 1 To iSide\n        For y = 1 To iSide\n            sNum = iGrid(GetI(x, y))\n            If sNum = \"0\" Then sNum = \"\"\n            s = s & sNum & vbTab\n        Next y\n        s = s & vbCr\n    Next x\n    If Not sMessage = \"\" Then\n        s = s & vbCr & sMessage & vbCr\n    End If\n    ShowGrid = s\nEnd Function\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_127.txt",
        "content": "10  4   3   14  \n9   15  1   6   \n12  11  7   8   \n2   5       13  \n\nNew 4 x 4 game started\n\nEnter number to move into empty tile\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_128.txt",
        "content": "Public Class Board\n    Inherits System.Windows.Forms.Form\n\n    Const XbyX = 4\n    Const XSize = 60\n\n    Private Empty As New Panel\n    Private Tiles As New List(Of Tile)\n    Private Moves As Integer\n\n    Public Sub New()\n        Me.Text = XbyX ^ 2 - 1 & \" Puzzle Game\"\n        Me.ClientSize = New Size(XbyX * XSize, XbyX * XSize)\n        Me.FormBorderStyle = FormBorderStyle.FixedToolWindow\n        Restart()\n    End Sub\n\n    Public Sub Restart()\n        Dim Start As List(Of Integer) = MakeCompleteable(GetRandamStartOrder())\n\n        Empty.SetBounds(((XbyX ^ 2 - 1) Mod XbyX) * XSize, ((XbyX ^ 2 - 1) \\ XbyX) * XSize, XSize, XSize)\n\n        Me.Moves = 0\n        Me.Tiles.Clear()\n        Me.Controls.Clear()\n        For No = 0 To XbyX ^ 2 - 2\n            Dim Tile As New Tile\n            Tile.Text = Start(No)\n            Tile.Board = Me\n            Tile.SetBounds((No Mod XbyX) * XSize, (No \\ XbyX) * XSize, XSize, XSize)\n            Me.Tiles.Add(Tile)\n            Me.Controls.Add(Tile)\n        Next\n\n    End Sub\n\n    Public Sub IsComplete()\n        Me.Moves += 1\n        If Empty.Left = ((XbyX ^ 2 - 1) Mod XbyX) * XSize AndAlso Empty.Top = ((XbyX ^ 2 - 1) \\ XbyX) * XSize Then\n            Me.Tiles.Sort()\n            For x = 1 To XbyX ^ 2 - 1\n                If Not Tiles(x - 1).Text = x Then\n                    Exit Sub\n                End If\n            Next\n            MsgBox($\"Completed in {Me.Moves} Moves!\", MsgBoxStyle.Information, \"Winner\")\n            Restart()\n        End If\n    End Sub\n\n    Public Class Tile\n        Inherits Button\n        Implements IComparable(Of Tile)\n        Public Board As Board\n        Private Sub Tile_Click(sender As Object, e As EventArgs) Handles Me.Click\n            With Board.Empty\n                If Me.Left = .Left AndAlso (Me.Top + Me.Height = .Top OrElse .Top + .Height = Me.Top) Then\n                    Swap()\n                ElseIf Me.Top = .Top AndAlso (Me.Left + Me.Width = .Left OrElse .Left + .Width = Me.Left) Then\n                    Swap()\n                End If\n            End With\n        End Sub\n        Private Sub Swap()\n            Dim p = Board.Empty.Location\n            Board.Empty.Location = Me.Location\n            Me.Location = p\n            Board.IsComplete()\n        End Sub\n        Public Function CompareTo(other As Tile) As Integer Implements IComparable(Of Tile).CompareTo\n            Dim Result = Me.Top.CompareTo(other.Top)\n            If Result = 0 Then\n                Return Me.Left.CompareTo(other.Left)\n            End If\n            Return Result\n        End Function\n    End Class\n\n    Public Function GetRandamStartOrder() As List(Of Integer)\n        Dim List As New List(Of Integer)\n        Dim Random As New Random()\n        Do While List.Count < XbyX ^ 2 - 1\n            Dim Value As Integer = Random.Next(1, XbyX ^ 2)\n            If Not List.Contains(Value) Then\n                List.Add(Value)\n            End If\n        Loop\n        Return List\n    End Function\n\n    Public Function MakeCompleteable(List As List(Of Integer)) As List(Of Integer)\n        'ToDo\n        Return List\n    End Function\n\nEnd Class\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_129.txt",
        "content": "/* ------------------------------------------------------------------------------------------------------\n\n                                               Copyright (c) 2004 - Gal Zsolt (CalmoSoft)\n\n   ------------------------------------------------------------------------------------------------------ */\n\nimplement playDialog\n    open core, vpiDomains, vpiOldDomains, resourceIdentifiers\n\n    facts\n        thisWin\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n\n    clauses\n        show(Parent):-\n            _ = vpi::winCreateDynDialog(Parent, controlList, eventHandler, gui_api::lNull).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        eventHandler\u00a0: vpiDomains::ehandler.\n    clauses\n        eventHandler(Win, Event) = Result\u00a0:-\n            Result = generatedEventHandler(Win, Event).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n\n    predicates\n        onDestroy\u00a0: vpiOldDomains::destroyHandler.\n    clauses\n        onDestroy() = vpiOldDomains::defaultHandling()\u00a0:-\n            thisWin\u00a0:= erroneous.\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlCancel\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlCancel(_Ctrl, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull)\u00a0:-\n            file::save(\"game.dba\",gameDB),\n            retractall(table(_,_)),\n            retractall(gameplay(_,_)),\n            retractall(empty_cell(_)),\n            retractall(cell(_,_)),\n            retractall(cellnr(_,_)),\n            retractall(good(_,_,_)),\n            vpi::winDestroy(thisWin).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n predicates\n        onUpdate\u00a0: vpiOldDomains::updateHandler.\n    clauses\n        onUpdate(Rectangle) = vpiOldDomains::defaultHandling():-\n            vpi::winClear( thisWin,Rectangle,0x808040),\n           \u00a0!.\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    class facts - gameDB\n        table:(integer,string).\n        gameplay:(integer,integer).\n        empty_cell:(integer).\n\n    class facts\n        cell:(integer,vpiDomains::windowHandle).\n        cellnr:(integer,integer).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    class facts\n        step_nr:integer:=0.\n\n    predicates\n        onCreate\u00a0: vpiOldDomains::createHandler.\n    clauses\n        onCreate(_CreationData) = vpiOldDomains::defaultHandling():-\n            retractall(table(_,_)),\n            retractall(gameplay(_,_)),\n            retractall(empty_cell(_)),\n            retractall(cell(_,_)),\n            retractall(cellnr(_,_)),\n            retractall(good(_,_,_)),\n\n            scrollbars_init(),\n            cellhandle_init(),\n            empty:=16,\n            good_cell(0),\n            table_save(),\n            step_nr:=0,\n            fail.\n        onCreate(_CreationData) = vpiOldDomains::defaultHandling().\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    facts\n        vsbarr\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        vsbarl\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        hsbart\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        hsbarb\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n\n    predicates\n        scrollbars_init:().\n    clauses\n        scrollbars_init():-\n            vsbarr\u00a0:= vpi::winGetCtlHandle(thisWin,idc_sbvr),\n            vsbarl\u00a0:= vpi::winGetCtlHandle(thisWin,idc_sbvl),\n            hsbart\u00a0:= vpi::winGetCtlHandle(thisWin,idc_sbht),\n            hsbarb\u00a0:= vpi::winGetCtlHandle(thisWin,idc_sbhb),\n\n\n            vpi::winSetScrollRange(vsbarr,sb_Ctl,1,4),\n            vpi::winSetScrollProportion(vsbarr,sb_Ctl,1),\n            vpi::winSetScrollPos(vsbarr,sb_Ctl,4),\n\n            vpi::winSetScrollRange(vsbarl,sb_Ctl,1,4),\n            vpi::winSetScrollProportion(vsbarl,sb_Ctl,1),\n            vpi::winSetScrollPos(vsbarl,sb_Ctl,4),\n\n            vpi::winSetScrollRange(hsbart,sb_Ctl,1,4),\n            vpi::winSetScrollProportion(hsbart,sb_Ctl,1),\n            vpi::winSetScrollPos(hsbart,sb_Ctl,4),\n\n            vpi::winSetScrollRange(hsbarb,sb_Ctl,1,4),\n            vpi::winSetScrollProportion(hsbarb,sb_Ctl,1),\n            vpi::winSetScrollPos(hsbarb,sb_Ctl,4).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    class facts\n        cell1\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell2\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell3\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell4\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell5\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell6\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell7\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell8\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell9\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell10\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell11\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell12\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell13\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell14\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell15\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n        cell16\u00a0: vpiDomains::windowHandle\u00a0:= erroneous.\n\n    predicates\n        cell_handle:().\n    clauses\n        cell_handle():-\n            cell1:=vpi::winGetCtlHandle(thisWin,idc_cell1),\n            cell2:=vpi::winGetCtlHandle(thisWin,idc_cell2),\n            cell3:=vpi::winGetCtlHandle(thisWin,idc_cell3),\n            cell4:=vpi::winGetCtlHandle(thisWin,idc_cell4),\n            cell5:=vpi::winGetCtlHandle(thisWin,idc_cell5),\n            cell6:=vpi::winGetCtlHandle(thisWin,idc_cell6),\n            cell7:=vpi::winGetCtlHandle(thisWin,idc_cell7),\n            cell8:=vpi::winGetCtlHandle(thisWin,idc_cell8),\n            cell9:=vpi::winGetCtlHandle(thisWin,idc_cell9),\n            cell10:=vpi::winGetCtlHandle(thisWin,idc_cell10),\n            cell11:=vpi::winGetCtlHandle(thisWin,idc_cell11),\n            cell12:=vpi::winGetCtlHandle(thisWin,idc_cell12),\n            cell13:=vpi::winGetCtlHandle(thisWin,idc_cell13),\n            cell14:=vpi::winGetCtlHandle(thisWin,idc_cell14),\n            cell15:=vpi::winGetCtlHandle(thisWin,idc_cell15),\n            cell16:=vpi::winGetCtlHandle(thisWin,idc_cell16).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        cellhandle_init:().\n    clauses\n        cellhandle_init():-\n            retractall(cell(_,_)),\n            cell_handle(),\n\n            assert(cell(1,cell1)),\n            assert(cell(2,cell2)),\n            assert(cell(3,cell3)),\n            assert(cell(4,cell4)),\n            assert(cell(5,cell5)),\n            assert(cell(6,cell6)),\n            assert(cell(7,cell7)),\n            assert(cell(8,cell8)),\n            assert(cell(9,cell9)),\n            assert(cell(10,cell10)),\n            assert(cell(11,cell11)),\n            assert(cell(12,cell12)),\n            assert(cell(13,cell13)),\n            assert(cell(14,cell14)),\n            assert(cell(15,cell15)),\n            assert(cell(16,cell16)).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    class facts\n        good_nr:integer:=0.\n        good:(integer,integer,integer) nondeterm.\n        empty:integer:=16.\n\n    predicates\n        good_cell:(integer) multi.\n    clauses\n        good_cell(16):-!.\n        good_cell(Number):-\n            NumberNew = Number+1,\n            good_nr:=0,\n            good_above(NumberNew),                   \u00a0% movable cells above empty cell\n            good_before(NumberNew),                   \u00a0% movable cells before empty cell\n            good_after(NumberNew),                      \u00a0% movable cells after empty cell\n            good_under(NumberNew),                     \u00a0% movable cells under empty cell\n            assert(cellnr(NumberNew,good_nr)),      \u00a0% number of movable cells around the empty cell\n            good_cell(NumberNew).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        good_above:(integer).\n    clauses\n        good_above(Number):-\n            Number > 4,                                            \u00a0% movable cells above empty cell\n            good_nr:= good_nr+1,\n            assert(good(Number,good_nr,Number-4)),\n            fail.\n        good_above(_).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        good_before:(integer).\n    clauses\n        good_before(Number):-\n            (Number mod 4) <> 1,                              \u00a0% movable cells before empty cell\n            good_nr:= good_nr+1,\n            assert(good(Number,good_nr,Number-1)),\n            fail.\n        good_before(_).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        good_after:(integer).\n    clauses\n        good_after(Number):-\n            (Number mod 4) > 0,                                  \u00a0% movable cells after empty cell\n            good_nr:= good_nr+1,\n            assert(good(Number,good_nr,Number+1)),\n            fail.\n        good_after(_).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        good_under:(integer).\n    clauses\n        good_under(Number):-\n            Number < 13,                                              \u00a0% movable cells under empty cell\n            good_nr:= good_nr+1,\n            assert(good(Number,good_nr,Number+4)),\n            fail.\n        good_under(_).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        cell_click:(integer).\n\n    clauses\n        cell_click(NrCell):-\n            good(empty,_,NrCell),\n            cell(empty,EmptyHandle),\n            cell(NrCell,NrCellHandle),\n            EmptyNr = vpi::winGetText(NrCellHandle),\n            vpi::winSetText(EmptyHandle,EmptyNr),\n            vpi::winSetText(NrCellHandle,\"\"),\n            empty:=NrCell,\n            step_nr\u00a0:= step_nr + 1,\n            Bingo = vpi::winGetCtlHandle(thisWin,idc_bingo),\n            vpi::winSetText(  Bingo, \"\"),\n            vpi::winSetState(Bingo,[wsf_Invisible]),\n            bingo(),\n\n           \u00a0% VerVal = uncheckedConvert(integer, math::floor((empty-1)/4)+1),\n           \u00a0% HorVal = uncheckedConvert(integer, math::floor((empty-1) mod 4)+1),\n\n            VerVal = math::floor((empty-1)/4)+1,\n            HorVal = math::floor((empty-1) mod 4)+1,\n\n            vpi::winSetScrollPos(vsbarr,sb_Ctl,VerVal),\n            vpi::winSetScrollPos(vsbarl,sb_Ctl,VerVal),\n            vpi::winSetScrollPos(hsbart,sb_Ctl,HorVal),\n            vpi::winSetScrollPos(hsbarb,sb_Ctl,HorVal),\n\n            Step = vpi::winGetCtlHandle(thisWin,idc_step),\n            vpi::winSetText(Step,toString(step_nr)),\n\n            assert(gameplay(step_nr,NrCell)),\n\n            fail.\n        cell_click(_).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        cell_click_play:(integer).\n\n    clauses\n        cell_click_play(NrCell):-\n            good(empty,_,NrCell),\n            cell(empty,EmptyHandle),\n            cell(NrCell,NrCellHandle),\n            EmptyNr = vpi::winGetText(NrCellHandle),\n            vpi::winSetText(EmptyHandle,EmptyNr),\n            vpi::winSetText(NrCellHandle,\"\"),\n            empty:=NrCell,\n            Bingo = vpi::winGetCtlHandle(thisWin,idc_bingo),\n            vpi::winSetText(Bingo, \"\"),\n            vpi::winSetState(Bingo,[wsf_Invisible]),\n            bingo(),\n\n           \u00a0% VerVal = uncheckedConvert(integer,math::floor((empty-1)/4)+1),\n           \u00a0% HorVal = uncheckedConvert(integer,math::floor((empty-1) mod 4)+1),\n\n            VerVal = math::floor((empty-1)/4)+1,\n            HorVal = math::floor((empty-1) mod 4)+1,\n\n            vpi::winSetScrollPos(vsbarr,sb_Ctl,VerVal),\n            vpi::winSetScrollPos(vsbarl,sb_Ctl,VerVal),\n            vpi::winSetScrollPos(hsbart,sb_Ctl,HorVal),\n            vpi::winSetScrollPos(hsbarb,sb_Ctl,HorVal),\n\n            programControl::sleep(1000),\n\n            fail.\n        cell_click_play(_).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlmix\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlmix(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            step_nr:=0,\n            cell_reset(),\n            mix_cells(0),\n            Play = vpi::winGetCtlHandle(thisWin,idc_play),\n            vpi::winSetState(Play,[wsf_Disabled]),\n            Bingo = vpi::winGetCtlHandle(thisWin,idc_bingo),\n            vpi::winSetText(Bingo, \"\"),\n            vpi::winSetState(Bingo,[wsf_Invisible]),\n            step_nr:=0,\n            Step = vpi::winGetCtlHandle(thisWin,idc_step),\n            vpi::winSetText(Step,toString(step_nr)),\n            table_save(),\n            retractall(gameplay(_,_)),\n            fail.\n\n        onControlmix(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    class facts\n        rand_nr:integer:=0.\n        mix_nr:integer:=300.\n\n    predicates\n        mix_cells:(integer) multi.\n\n    clauses\n        mix_cells(mix_nr):-!.\n        mix_cells(Number):-\n            NumberNew = Number+1,\n            cellnr(empty,CellNr),\n            RandomNr = (math::random(1315) mod CellNr) + 1,\n            rand_nr\u00a0:= RandomNr,\n            good(empty,rand_nr, I),\n            cell_click(I),\n            mix_cells(NumberNew).\n        mix_cells(_).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        table_save:().\n    clauses\n        table_save():-\n            retractall(table(_,_)),\n            retractall(empty_cell(_)),\n            assert(empty_cell(empty)),\n\n            assert(table(1,vpi::winGetText(cell1))),\n            assert(table(2,vpi::winGetText(cell2))),\n            assert(table(3,vpi::winGetText(cell3))),\n            assert(table(4,vpi::winGetText(cell4))),\n            assert(table(5,vpi::winGetText(cell5))),\n            assert(table(6,vpi::winGetText(cell6))),\n            assert(table(7,vpi::winGetText(cell7))),\n            assert(table(8,vpi::winGetText(cell8))),\n            assert(table(9,vpi::winGetText(cell9))),\n            assert(table(10,vpi::winGetText(cell10))),\n            assert(table(11,vpi::winGetText(cell11))),\n            assert(table(12,vpi::winGetText(cell12))),\n            assert(table(13,vpi::winGetText(cell13))),\n            assert(table(14,vpi::winGetText(cell14))),\n            assert(table(15,vpi::winGetText(cell15))),\n            assert(table(16,vpi::winGetText(cell16))).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlreset\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlreset(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n                              cell_reset().\n\n/* ------------------------------------------------------------------------------------------------------ */\n    predicates\n        cell_reset:().\n    clauses\n        cell_reset():-\n            vpi::winSetText(cell1,\"1\"),\n            vpi::winSetText(cell2,\"2\"),\n            vpi::winSetText(cell3,\"3\"),\n            vpi::winSetText(cell4,\"4\"),\n            vpi::winSetText(cell5,\"5\"),\n            vpi::winSetText(cell6,\"6\"),\n            vpi::winSetText(cell7,\"7\"),\n            vpi::winSetText(cell8,\"8\"),\n            vpi::winSetText(cell9,\"9\"),\n            vpi::winSetText(cell10,\"10\"),\n            vpi::winSetText(cell11,\"11\"),\n            vpi::winSetText(cell12,\"12\"),\n            vpi::winSetText(cell13,\"13\"),\n            vpi::winSetText(cell14,\"14\"),\n            vpi::winSetText(cell15,\"15\"),\n            vpi::winSetText(cell16,\"\"),\n\n            vpi::winSetScrollPos(vsbarr,sb_Ctl,4),\n            vpi::winSetScrollPos(vsbarl,sb_Ctl,4),\n            vpi::winSetScrollPos(hsbart,sb_Ctl,4),\n            vpi::winSetScrollPos(hsbarb,sb_Ctl,4),\n\n            empty:=16,\n            step_nr:=0,\n            Step = vpi::winGetCtlHandle(thisWin,idc_step),\n            vpi::winSetText(Step,toString(step_nr)),\n            Bingo = vpi::winGetCtlHandle(thisWin,idc_bingo),\n            vpi::winSetText(Bingo, \"\"),\n            vpi::winSetState(Bingo,[wsf_Invisible]),\n            Play = vpi::winGetCtlHandle(thisWin,idc_play),\n            vpi::winSetState(Play,[wsf_Disabled]),\n            retractall(gameplay(_,_)),\n            table_save().\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        bingo:().\n\n    clauses\n        bingo():-\n            toString(1) = vpi::winGetText(cell1),\n            toString(2) = vpi::winGetText(cell2),\n            toString(3) = vpi::winGetText(cell3),\n            toString(4) = vpi::winGetText(cell4),\n            toString(5) = vpi::winGetText(cell5),\n            toString(6) = vpi::winGetText(cell6),\n            toString(7) = vpi::winGetText(cell7),\n            toString(8) = vpi::winGetText(cell8),\n            toString(9) = vpi::winGetText(cell9),\n            toString(10) = vpi::winGetText(cell10),\n            toString(11) = vpi::winGetText(cell11),\n            toString(12) = vpi::winGetText(cell12),\n            toString(13) = vpi::winGetText(cell13),\n            toString(14) = vpi::winGetText(cell14),\n            toString(15) = vpi::winGetText(cell15),\n            \"\" = vpi::winGetText(cell16),\n\n            Bingo = vpi::winGetCtlHandle(thisWin,idc_bingo),\n            vpi::winSetState(Bingo,[wsf_Visible]),\n            vpi::winSetText(Bingo, \"BINGO\u00a0!\"),\n\n            Step = vpi::winGetCtlHandle(thisWin,idc_step),\n            vpi::winSetText(Step,toString(step_nr)),\n\n            fail.\n bingo().\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    facts\n        fileName:string:=\"\".\n\n    predicates\n        onControlsave\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlsave(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            try\n            \tFileName = vpiCommonDialogs::getFileName(fileName, [\"All files\", \"*.game\"], \"Save game as\", [dlgfn_Save], \"\", _)\n            catch _ do\n            \tfail\n            end try,\n           \u00a0!,\n            file::save(FileName,gameDB).\n\n        onControlsave(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo)= vpiOldDomains::handled(gui_api::rNull).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlopen\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlopen(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            try\n            \tFileName = vpiCommonDialogs::getFileName(\"game_\", [\"All files\", \"*.game\"], \"Open game file\", [], \"\", _)\n            catch _ do\n            \tfail\n            end try,\n           \u00a0!,\n            retractall(table(_,_)),\n            retractall(gameplay(_,_)),\n            retractall(empty_cell(_)),\n            file::consult(FileName,gameDB),\n            play_display(),\n            Play = vpi::winGetCtlHandle(thisWin,idc_play),\n            vpi::winSetState(Play,[wsf_Enabled]),\n            Bingo = vpi::winGetCtlHandle(thisWin,idc_bingo),\n            vpi::winSetState(Bingo,[wsf_Invisible]),\n            vpi::winSetText(Bingo, \"\"),\n            step_nr:=0,\n            Step = vpi::winGetCtlHandle(thisWin,idc_step),\n            vpi::winSetText(Step,toString(step_nr)).\n\n        onControlopen(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        play_display:().\n    clauses\n        play_display():-\n\n            table(1,Cell1),\n            table(2,Cell2),\n            table(3,Cell3),\n            table(4,Cell4),\n            table(5,Cell5),\n            table(6,Cell6),\n            table(7,Cell7),\n            table(8,Cell8),\n            table(9,Cell9),\n            table(10,Cell10),\n            table(11,Cell11),\n            table(12,Cell12),\n            table(13,Cell13),\n            table(14,Cell14),\n            table(15,Cell15),\n            table(16,Cell16),\n\n            vpi::winSetText(cell1,Cell1),\n            vpi::winSetText(cell2,Cell2),\n            vpi::winSetText(cell3,Cell3),\n            vpi::winSetText(cell4,Cell4),\n            vpi::winSetText(cell5,Cell5),\n            vpi::winSetText(cell6,Cell6),\n            vpi::winSetText(cell7,Cell7),\n            vpi::winSetText(cell8,Cell8),\n            vpi::winSetText(cell9,Cell9),\n            vpi::winSetText(cell10,Cell10),\n            vpi::winSetText(cell11,Cell11),\n            vpi::winSetText(cell12,Cell12),\n            vpi::winSetText(cell13,Cell13),\n            vpi::winSetText(cell14,Cell14),\n            vpi::winSetText(cell15,Cell15),\n            vpi::winSetText(cell16,Cell16),\n\n            empty_cell(Empty_Cell),\n            empty:=Empty_Cell,\n\n            fail.\n        play_display().\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlplay\u00a0: vpiOldDomains::controlHandler.\n    clauses\n\n        onControlplay(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            Play = vpi::winGetCtlHandle(thisWin,idc_play),\n            vpi::winSetState(Play,[wsf_Disabled]),\n            gameplay(Nr,Nr_cell),\n            cell_click_play(Nr_cell),\n            Step = vpi::winGetCtlHandle(thisWin,idc_step),\n            vpi::winSetText(Step,toString(Nr)),\n            fail.\n\n        onControlplay(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlsbvr\u00a0: vpiOldDomains::controlHandler.              \u00a0% Sets the right vertical scrollbar\n    clauses\n        onControlsbvr(_CtrlID, _CtrlType, _CtrlWin,scroll(sc_LineDown,_)) = vpiOldDomains::handled(gui_api::rNull):-\n            Sbarvalr = vpi::winGetScrollPos(vsbarr,sb_Ctl)+1,\n            Sbarvalr < 5,\n            cell_click(empty+4),\n            vpi::winSetScrollPos(vsbarr,sb_Ctl, Sbarvalr),\n            vpi::winSetScrollPos(vsbarl,sb_Ctl, Sbarvalr),\n            fail.\n\n        onControlsbvr(_CtrlID, _CtrlType, _CtrlWin,scroll(sc_LineUp,_)) = vpiOldDomains::handled(gui_api::rNull):-\n            Sbarvalr = vpi::winGetScrollPos(vsbarr,sb_Ctl)-1,\n            Sbarvalr > 0,\n            cell_click(empty-4),\n            vpi::winSetScrollPos(vsbarr,sb_Ctl, Sbarvalr),\n            vpi::winSetScrollPos(vsbarl,sb_Ctl, Sbarvalr),\n            fail.\n\n        onControlsbvr(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull).\n\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlsbvl\u00a0: vpiOldDomains::controlHandler.                 \u00a0% Sets the left vertical scrollbar\n    clauses\n        onControlsbvl(_CtrlID, _CtrlType, _CtrlWin,scroll(sc_LineDown,_)) = vpiOldDomains::handled(gui_api::rNull):-\n            Sbarvall = vpi::winGetScrollPos(vsbarl,sb_Ctl)+1,\n            Sbarvall < 5,\n            cell_click(empty+4),\n            vpi::winSetScrollPos(vsbarl,sb_Ctl, Sbarvall),\n            vpi::winSetScrollPos(vsbarr,sb_Ctl, Sbarvall),\n            fail.\n\n        onControlsbvl(_CtrlID, _CtrlType, _CtrlWin,scroll(sc_LineUp,_)) = vpiOldDomains::handled(gui_api::rNull):-\n            Sbarvall = vpi::winGetScrollPos(vsbarl,sb_Ctl)-1,\n            Sbarvall > 0,\n            cell_click(empty-4),\n            vpi::winSetScrollPos(vsbarl,sb_Ctl, Sbarvall),\n            vpi::winSetScrollPos(vsbarr,sb_Ctl, Sbarvall),\n            fail.\n\n        onControlsbvl(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlsbht\u00a0: vpiOldDomains::controlHandler.            \u00a0% Sets the top horizontal scrollbar\n    clauses\n        onControlsbht(_CtrlID, _CtrlType, _CtrlWin,scroll(sc_LineDown,_)) = vpiOldDomains::handled(gui_api::rNull):-\n            Sbarvalt = vpi::winGetScrollPos(hsbart,sb_Ctl)+1,\n            Sbarvalt < 5,\n            cell_click(empty+1),\n            vpi::winSetScrollPos(hsbart,sb_Ctl, Sbarvalt),\n            vpi::winSetScrollPos(hsbarb,sb_Ctl, Sbarvalt),\n            fail.\n\n        onControlsbht(_CtrlID, _CtrlType, _CtrlWin,scroll(sc_LineUp,_)) = vpiOldDomains::handled(gui_api::rNull):-\n            Sbarvalt = vpi::winGetScrollPos(hsbart,sb_Ctl)-1,\n            Sbarvalt > 0,\n            cell_click(empty-1),\n            vpi::winSetScrollPos(hsbart,sb_Ctl, Sbarvalt),\n            vpi::winSetScrollPos(hsbarb,sb_Ctl, Sbarvalt),\n            fail.\n\n        onControlsbht(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlsbhb\u00a0: vpiOldDomains::controlHandler.      \u00a0% Sets the bottom horizontal scrollbar\n    clauses\n        onControlsbhb(_CtrlID, _CtrlType, _CtrlWin,scroll(sc_LineDown,_)) = vpiOldDomains::handled(gui_api::rNull):-\n            Sbarvalb = vpi::winGetScrollPos(hsbarb,sb_Ctl)+1,\n            Sbarvalb < 5,\n            cell_click(empty+1),\n            vpi::winSetScrollPos(hsbarb,sb_Ctl, Sbarvalb),\n            vpi::winSetScrollPos(hsbart,sb_Ctl, Sbarvalb),\n            fail.\n\n        onControlsbhb(_CtrlID, _CtrlType, _CtrlWin,scroll(sc_LineUp,_)) = vpiOldDomains::handled(gui_api::rNull):-\n            Sbarvalb = vpi::winGetScrollPos(hsbarb,sb_Ctl)-1,\n            Sbarvalb > 0,\n            cell_click(empty-1),\n            vpi::winSetScrollPos(hsbarb,sb_Ctl, Sbarvalb),\n            vpi::winSetScrollPos(hsbart,sb_Ctl, Sbarvalb),\n            fail.\n\n        onControlsbhb(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell1\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell1(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(1).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n\n    predicates\n        onControlcell2\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell2(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(2).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell3\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell3(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(3).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell4\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell4(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(4).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell5\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell5(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(5).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell6\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell6(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(6).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell7\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell7(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(7).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell8\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell8(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(8).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell9\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell9(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(9).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell10\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell10(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(10).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell11\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell11(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(11).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell12\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell12(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(12).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell13\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell13(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(13).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell14\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell14(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(14).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell15\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell15(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(15).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n    predicates\n        onControlcell16\u00a0: vpiOldDomains::controlHandler.\n    clauses\n        onControlcell16(_CtrlID, _CtrlType, _CtrlWin, _CtrlInfo) = vpiOldDomains::handled(gui_api::rNull):-\n            cell_click(16).\n\n/* ------------------------------------------------------------------------------------------------------ */\n\n   \u00a0% This code is maintained by the VDE do not update it manually, 22:12:35-14.3.2004\n    constants\n        dialogType\u00a0: vpiDomains::wintype = wd_Modal.\n        title\u00a0: string = \"playDialog\".\n        rectangle\u00a0: vpiDomains::rct = rct(200,40,359,263).\n        dialogFlags\u00a0: vpiDomains::wsflags = [wsf_Close,wsf_TitleBar].\n        dialogFont = \"MS Sans Serif\".\n        dialogFontSize = 8.\n\n    constants\n        controlList\u00a0: vpiDomains::windef_list =\n            [\n            dlgFont(wdef(dialogType, rectangle, title, u_DlgBase),\n                    dialogFont, dialogFontSize, dialogFlags),\n            ctl(wdef(wc_PushButton,rct(40,166,67,178),\"&Mix\",u_DlgBase),idc_mix,[wsf_Group,wsf_TabStop]),\n            ctl(wdef(wc_PushButton,rct(67,166,94,178),\"&Reset\",u_DlgBase),idc_reset,[wsf_Group,wsf_TabStop]),\n            ctl(wdef(wc_PushButton,rct(40,178,67,190),\"&Save\",u_DlgBase),idc_save,[wsf_Group,wsf_TabStop]),\n            ctl(wdef(wc_PushButton,rct(94,178,121,190),\"&Open\",u_DlgBase),idc_open,[wsf_Group,wsf_TabStop]),\n            ctl(wdef(wc_PushButton,rct(40,190,121,202),\"&Play\",u_DlgBase),idc_play,[wsf_Group,wsf_TabStop,wsf_Disabled]),\n            ctl(wdef(wc_PushButton,rct(94,166,121,178),\"&Exit\",u_DlgBase),idc_cancel,[wsf_Group,wsf_TabStop]),\n            ctl(wdef(wc_PushButton,rct(40,40,60,60),\"1\",u_DlgBase),idc_cell1,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(60,40,80,60),\"2\",u_DlgBase),idc_cell2,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(80,40,100,60),\"3\",u_DlgBase),idc_cell3,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(100,40,120,60),\"4\",u_DlgBase),idc_cell4,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(40,60,60,80),\"5\",u_DlgBase),idc_cell5,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(60,60,80,80),\"6\",u_DlgBase),idc_cell6,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(80,60,100,80),\"7\",u_DlgBase),idc_cell7,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(100,60,120,80),\"8\",u_DlgBase),idc_cell8,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(40,80,60,100),\"9\",u_DlgBase),idc_cell9,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(60,80,80,100),\"10\",u_DlgBase),idc_cell10,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(80,80,100,100),\"11\",u_DlgBase),idc_cell11,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(100,80,120,100),\"12\",u_DlgBase),idc_cell12,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(40,100,60,120),\"13\",u_DlgBase),idc_cell13,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(60,100,80,120),\"14\",u_DlgBase),idc_cell14,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(80,100,100,120),\"15\",u_DlgBase),idc_cell15,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(100,100,120,120),\"\",u_DlgBase),idc_cell16,[wsf_Group]),\n            ctl(wdef(wc_HScroll,rct(30,18,130,30),\"\",u_DlgBase),idc_sbht,[]),\n            ctl(wdef(wc_VScroll,rct(130,30,142,130),\"\",u_DlgBase),idc_sbvr,[]),\n            ctl(wdef(wc_HScroll,rct(30,130,130,142),\"\",u_DlgBase),idc_sbhb,[]),\n            ctl(wdef(wc_VScroll,rct(18,30,30,130),\"\",u_DlgBase),idc_sbvl,[]),\n            ctl(wdef(wc_PushButton,rct(67,178,94,190),\"\",u_DlgBase),idc_step,[wsf_Group]),\n            ctl(wdef(wc_PushButton,rct(40,154,121,166),\"\",u_DlgBase),idc_bingo,[wsf_Group,wsf_Invisible])\n            ].\n\n    predicates\n        generatedEventHandler\u00a0: vpiDomains::ehandler.\n    clauses\n        generatedEventHandler(Win, e_create(_)) = _\u00a0:-\n            thisWin\u00a0:= Win,\n            fail.\n        generatedEventHandler(_Win, e_Create(CreationData)) = Result\u00a0:-\n            handled(Result) = onCreate(CreationData).\n        generatedEventHandler(_Win, e_Update(Rectangle)) = Result\u00a0:-\n            handled(Result) = onUpdate(Rectangle).\n        generatedEventHandler(_Win, e_Control(idc_cancel, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlCancel(idc_cancel, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_mix, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlmix(idc_mix, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_reset, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlreset(idc_reset, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_sbvr, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlsbvr(idc_sbvr, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_sbvl, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlsbvl(idc_sbvl, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_sbhb, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlsbhb(idc_sbhb, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_sbht, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlsbht(idc_sbht, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_save, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlsave(idc_save, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_open, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlopen(idc_open, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_play, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlplay(idc_play, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell1, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell1(idc_cell1, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell10, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell10(idc_cell10, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell11, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell11(idc_cell11, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell12, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell12(idc_cell12, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell13, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell13(idc_cell13, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell14, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell14(idc_cell14, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell15, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell15(idc_cell15, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell16, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell16(idc_cell16, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell2, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell2(idc_cell2, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell3, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell3(idc_cell3, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell4, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell4(idc_cell4, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell5, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell5(idc_cell5, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell6, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell6(idc_cell6, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell7, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell7(idc_cell7, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell8, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell8(idc_cell8, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Control(idc_cell9, CtrlType, CtrlWin, CtlInfo)) = Result\u00a0:-\n            handled(Result) = onControlcell9(idc_cell9, CtrlType, CtrlWin, CtlInfo).\n        generatedEventHandler(_Win, e_Destroy()) = Result\u00a0:-\n            handled(Result) = onDestroy().\n   \u00a0% end of automatic code\nend implement playDialog",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_13.txt",
        "content": "      fpg 10\n 1  3  0  4\n 5  2  6  8\n 9 10  7 12\n13 14 11 15\n\u2190\n 1  0  3  4\n 5  2  6  8\n 9 10  7 12\n13 14 11 15\n\u2193\n 1  2  3  4\n 5  0  6  8\n 9 10  7 12\n13 14 11 15\n\u2192\n 1  2  3  4\n 5  6  0  8\n 9 10  7 12\n13 14 11 15\n\u2193\u2193\n 1  2  3  4\n 5  6  7  8\n 9 10 11 12\n13 14  0 15\n\u2192\n 1  2  3  4\n 5  6  7  8\n 9 10 11 12\n13 14 15  0\nwin\n\n\n      2 5 fpg 2\n1 2 3 0 4\n6 7 8 9 5\n\u2192\n1 2 3 4 0\n6 7 8 9 5\n\u2193\n1 2 3 4 5\n6 7 8 9 0\nwin\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_130.txt",
        "content": "'----------------15 game-------------------------------------\n'WARNING: this script uses ANSI escape codes to position items on console so \n'it won't work in Windows from XP to 8.1 where Microsoft removed ANSI support...\n'Windows 10, 11 or 98 are ok!!!\n\noption explicit\nconst maxshuffle=100 'level \n\ndim ans0:ans0=chr(27)&\"[\"\ndim anscls:anscls=ans0 & \"2J\"\n\ndim dirs:dirs=array(6,-1,-6,1)\ndim a:a=array(-1,-1,-1,-1,-1,-1,_\n              -1, 1, 2, 3, 4,-1,_\n              -1, 5, 6, 7, 8,-1,_\n              -1, 9,10,11,12,-1,_\n              -1,13,14,15, 0,-1,_\n              -1,-1,-1,-1,-1,-1)\ndim b(35)\ndim pos0\ndim s:s=Array(\"W+Enter: up   Z+Enter: down  A+Enter: left   S+Enter right \",_\n              \"Bad move!!                                                 \",_\n\t      \"You did it! Another game? [y/n]+Enter                      \",_\n\t      \"Bye!                                                       \")\n\n\ndo\n  shuffle\n  draw\n  toxy 10,1,s(0)\n  do \n   if usr(wait()) then \n     draw  \n     toxy 10,1,s(0)\n   else \t\n     toxy 10,1,s(1)\n   end if\n  loop until checkend\n  toxy 10,1,s(2)\nloop until wait()=\"n\"\ntoxy 10,1,s(3)\n\nfunction wait():\n toxy 11,1,\"\":\n wait=left(lcase(wscript.stdin.readline),1):\t\nend function\n\nsub toxy(x,y,s)\n wscript.StdOut.Write ans0 & x & \";\" & y & \"H\"& \" \"& s  \nend sub\n\nsub draw\n  dim i,j \n  wscript.stdout.write anscls\n  for i=0 to 3 'row\n    for j=0 to 3  'col\n      toxy (j*2)+2,(i*3)+3,iif(b(j*6+i+7)<>0,b(j*6+i+7),\" \")\n    next\n  next\n  toxy 10,1,\"\"\nend sub\n\n\nfunction checkend\n  dim i\n  for i=0 to ubound(a)\n   if (b(i)<>a(i)) then checkend=false : exit function\n  next\n  checkend=true\nend function\t\n\nfunction move(d) \n dim p1 \n p1=pos0+d\n if b(p1) <>-1 then \n    b(pos0)=b(p1):\n    b(p1)=0:\n    pos0=p1:\n    move=true\n else\n   move=false\n end if \nend function \n\nsub shuffle\n  dim cnt,r,i\n   randomize timer\n   for i=0 to ubound(a):b(i)=a(i):next\n   pos0=28\n   cnt=0\n   do\n     r=int(rnd*4)\n     if move(dirs(r))=true then cnt=cnt+1\n   loop until cnt=maxshuffle\nend sub\t \n\nfunction iif(a,b,c): if a then iif=b else iif=c end if:end function\t\t\t \n\nfunction usr(a)\n  dim d \n  select case lcase(a)\n  case \"w\" :d=-6\n  case \"z\" :d=6\n  case \"a\" :d=-1\n  case \"s\" :d=1\n  end select\n  usr= move(d) \nend function\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_131.txt",
        "content": "import \"random\" for Random\nimport \"./dynamic\" for Enum\nimport \"./ioutil\" for Input\nimport \"./fmt\" for Fmt\n\nvar Move = Enum.create(\"Move\", [\"up\", \"down\", \"right\", \"left\"])\n\nvar Rand = Random.new()\nvar RandMove = Fn.new { Rand.int(4) }\n\nvar SolvedBoard = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 0]\n\nvar AreEqual = Fn.new { |l1, l2|\n    if (l1.count != l2.count) return false\n    for (i in 0...l1.count) {\n        if (l1[i] != l2[i]) return false\n    }\n    return true\n}\n\nclass Puzzle {\n    construct new() {\n        _board = SolvedBoard.toList\n        _empty = 15 // _board[empty] == 0\n        _moves = 0\n        _quit  = false\n        // Could make this configurable, 10 == easy, 50 == normal, 100 == hard\n        shuffle(50)\n    }\n\n    shuffle(moves) {\n        // we use some number of random moves to \"shuffle\" the board\n        var i = 0\n        while (i < moves || AreEqual.call(_board, SolvedBoard)) {\n            if (doMove(RandMove.call())) i = i + 1\n        }\n    }\n\n    isValidMove(m) {\n        if (m == Move.up)    return [_empty - 4, (_empty/4).floor > 0]\n        if (m == Move.down)  return [_empty + 4, (_empty/4).floor < 3]  \n        if (m == Move.right) return [_empty + 1, _empty % 4 < 3]\n        if (m == Move.left)  return [_empty - 1, _empty % 4 > 0]\n        Fiber.abort(\"not reached\")\n    }\n\n    doMove(m) {\n        var i = _empty\n        var res = isValidMove(m)\n        var j  = res[0]\n        var ok = res[1]\n        if (ok) {\n            _board.swap(i, j)\n            _empty = j\n            _moves = _moves + 1\n        }\n        return ok\n    }\n\n    play() {\n        var instructions = \"\"\"\nPlease enter \"U\", \"D\", \"L\", or \"R\" to move the empty cell\nup, down, left, or right. You can also enter \"Q\" to quit.\nUpper or lowercase is accepted and only the first character\nis important (i.e. you may enter \"up\" if you like).\n\"\"\"\n        System.print(instructions)\n        System.write(\"\\nStarting board:\")\n        while (!AreEqual.call(_board, SolvedBoard) && !_quit) {\n            System.print(\"\\n%(this)\")\n            playOneMove()\n        }\n        if (AreEqual.call(_board, SolvedBoard)) {\n            System.print(\"\\n%(this)\")\n            System.print(\"You solved the puzzle in %(_moves) moves.\")\n        }\n    }\n\n    playOneMove() {\n        while (true) {\n            var s = Input.option(\"Enter move #%(_moves + 1) (U, D, L, R or Q): \", \"UuDdLlRrQq\")\n            var m\n            if (s == \"U\" || s == \"u\") {\n                m = Move.up\n            } else if (s == \"D\" || s == \"d\") {\n                m = Move.down\n            } else if (s == \"L\" || s == \"l\") {\n                m = Move.left\n            } else if (s == \"R\" || s == \"r\") {\n                m = Move.right\n            } else if (s == \"Q\" || s == \"q\") {\n                System.print(\"Quiting after %(_moves).\")\n                _quit = true\n                return\n            }\n            if (!doMove(m)) {\n                System.print(\"That is not a valid move at the moment.\")\n                continue\n            }\n            return\n        }\n    }\n\n    toString {\n        var buf = \"\"\n        var i = 0\n        for (c in _board) {\n            if (c == 0) {\n                buf = buf + \"  .\"\n            } else {\n                buf = buf + Fmt.swrite(\"$3d\", c)\n            }\n            if (i % 4 == 3) buf = buf + \"\\n\"\n            i = i + 1\n        }\n        return buf\n    }\n}\n\nvar p = Puzzle.new()\np.play()\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_132.txt",
        "content": "Please enter \"U\", \"D\", \"L\", or \"R\" to move the empty cell\nup, down, left, or right. You can also enter \"Q\" to quit.\nUpper or lowercase is accepted and only the first character\nis important (i.e. you may enter \"up\" if you like).\n\nStarting board:\n  1  2  3  4\n  6  .  7  8\n  5  9 11 12\n 13 10 14 15\n\nEnter move #51 (U, D, L, R or Q): l\n\n  1  2  3  4\n  .  6  7  8\n  5  9 11 12\n 13 10 14 15\n\nEnter move #52 (U, D, L, R or Q): d\n\n  1  2  3  4\n  5  6  7  8\n  .  9 11 12\n 13 10 14 15\n\nEnter move #53 (U, D, L, R or Q): r\n\n  1  2  3  4\n  5  6  7  8\n  9  . 11 12\n 13 10 14 15\n\nEnter move #54 (U, D, L, R or Q): d\n\n  1  2  3  4\n  5  6  7  8\n  9 10 11 12\n 13  . 14 15\n\nEnter move #55 (U, D, L, R or Q): r\n\n  1  2  3  4\n  5  6  7  8\n  9 10 11 12\n 13 14  . 15\n\nEnter move #56 (U, D, L, R or Q): r\n\n  1  2  3  4\n  5  6  7  8\n  9 10 11 12\n 13 14 15  .\n\nYou solved the puzzle in 56 moves.\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_133.txt",
        "content": "       \u00a0; Puzzle15 by grosged (march 2019)\n       \u00a0; How to play\u00a0?.. Just press one of the arrow keys then [enter] to valid\n       \u00a0; ( press [Ctrl+C] to escape )\n\n        segment\t.data\ncheck:\tdb\t\"1   2   3   4\",10,\"  5   6   7   8\",10,\"  9  10  11  12\",10,\" 13  14  1\"\npuzzle:\tdb\t27,\"c\",10,\"  1   2   3   4\",10,\"  5   6   7   8\",10,\"  9  10  11  12\",10,\" 13  14  15    \",10,10\n\tdb\t\" Direction\u00a0?\",13             \n\tdb\t\" Well done\u00a0!  \",10,10\ninKey:\tdw\t0,0,0,0\n\t\n\tsegment\t.text\n\tglobal\t_start\n\n_start:\tmov\trax,100\n\tsyscall\n\tmov\trcx,rax\n\tshr\trcx,3\n\tand\trcx,255\n\tand\trax,31\n\tlea\trsi,[_start+rax]\n\tmov\trbx,15\n\nMixing:\tpush\trcx\n\tmov\tdi,word[rsi+rcx*2]\n\tmov\trcx,8\nquatre:\tmov\tax,di\n\tshr\tdi,2\n\tand\tax,3\n\tadd\tax,65\n\tcall\tSWAPPIN\n\tloop\tquatre\n\tpop\trcx\n\tloop\tMixing\n\tcmp\tcx,ax\n\nMainLp:\tmov\trdx,80\t\nSucces:\tlea\trsi,[puzzle]\n\tmov\trdi,1\n\tmov\trax,1\nEnd?:\tsyscall\n\tmov\trax,60\n\tje\tEnd?\n\tmov\trdx,8\n\tlea\trsi,[inKey]\n\tmov\trdi,0\n\tmov\trax,0\n\tsyscall\n\tmov\tal,byte [rsi+rax-2]\n\tcall\tSWAPPIN\n\tlea \trsi,[check]\n\tlea\trdi,[puzzle+5]\n\tmov\trcx,7\n\trepe\tcmpsq\n\tjne\tMainLp\n\tmov\trdx,95\n\tjmp\tSucces\n\nSWAPPIN:mov\trdx,rbx\n\tcmp\tal,\"A\"\n\tjne\tNotUp\n\tadd\trbx,4\n\tcmp\trbx,16\n\tcmovae\trbx,rdx\nNotUp:\tcmp\tal,\"B\"\n\tjne\tNotDwn\t\n\tsub\trbx,4\n\tcmovc\trbx,rdx\t\nNotDwn:\tcmp\tal,\"C\"\n\tjne\tNotLft\n\ttest\trbx,3\n\tjz\tEndcll\n\tdec\trbx\nNotLft:\tcmp\tal,\"D\"\n\tjne\tEndcll\n\tinc\trbx\n\ttest\trbx,3\n\tcmovz\trbx,rdx\nEndcll:\tmov\tax,\"  \"\n\txchg\tax,word[puzzle+4+rbx*4]\n\tmov\tword[puzzle+4+rdx*4],ax\n\tret",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_134.txt",
        "content": "PROGRAM \"fifteenpuzzlegame\"\nVERSION \"0.0001\"\n\nIMPORT \"xst\"\n\nDECLARE FUNCTION Entry()\nINTERNAL FUNCTION PrintPuzzle(d%[])\nINTERNAL FUNCTION IntroAndLevel(shCnt%[])\nINTERNAL FUNCTION BuildBoard(d%[], shCnt%[], level%)\nINTERNAL FUNCTION IsMoveValid(d%[], piece%, piecePos%, emptyPos%)\nINTERNAL FUNCTION IsPuzzleComplete(d%[])\nINTERNAL FUNCTION PiecePosition(d%[], piece%)\n\n' Pseudo-random number generator\n' Based on the rand, srand functions from Kernighan & Ritchie's book\n' 'The C Programming Language'\nDECLARE FUNCTION Rand()\nDECLARE FUNCTION SRand(seed%%)\n\nFUNCTION Entry()\n  DIM d%[15]\n  DIM shCnt%[2]\n  BuildBoard(@d%[], @shCnt%[], IntroAndLevel(@shCnt%[]))\n  PrintPuzzle(@d%[])\n  DO\n    x% = SSHORT(INLINE$(\"To move a piece, enter its number: \"))\n    DO WHILE IsMoveValid(@d%[], x%, @y%, @z%) = 0\n      PRINT \"Wrong move.\"\n      PrintPuzzle(@d%[])\n      x% = SSHORT(INLINE$(\"To move a piece, enter its number: \"))\n    LOOP\n    d%[z% - 1] = x%\n    d%[y% - 1] = 0\n    PrintPuzzle(@d%[])\n  LOOP UNTIL IsPuzzleComplete(@d%[])\n  PRINT \"YOU WON!\"\nEND FUNCTION\n\nFUNCTION PrintPuzzle(d%[])\n  DIM ds$[15] ' Board pieces\n  FOR p%% = 0 TO 15\n    IF d%[p%%] = 0 THEN\n      ds$[p%%] = \"     \"\n    ELSE\n      ds$[p%%] = FORMAT$(\"###  \", d%[p%%])\n    END IF\n  NEXT p%%\n  PRINT \"+-----+-----+-----+-----+\"\n  PRINT \"|\"; ds$[0]; \"|\"; ds$[1]; \"|\"; ds$[2]; \"|\"; ds$[3]; \"|\"\n  PRINT \"+-----+-----+-----+-----+\"\n  PRINT \"|\"; ds$[4]; \"|\"; ds$[5]; \"|\"; ds$[6]; \"|\"; ds$[7]; \"|\"\n  PRINT \"+-----+-----+-----+-----+\"\n  PRINT \"|\"; ds$[8]; \"|\"; ds$[9]; \"|\"; ds$[10]; \"|\"; ds$[11]; \"|\"\n  PRINT \"+-----+-----+-----+-----+\"\n  PRINT \"|\"; ds$[12]; \"|\"; ds$[13]; \"|\"; ds$[14]; \"|\"; ds$[15]; \"|\"\n  PRINT \"+-----+-----+-----+-----+\"\nEND FUNCTION\n\nFUNCTION IntroAndLevel(shCnt%[])\n  XstClearConsole()\n  shCnt%[0] = 10\n  shCnt%[1] = 50\n  shCnt%[2] = 100\n  PRINT \"15 PUZZLE GAME\"\n  PRINT\n  PRINT\n  PRINT \"Please enter level of difficulty,\"\n  DO\n    level% = SSHORT(INLINE$(\"1 (easy), 2 (medium) or 3 (hard): \"))\n  LOOP UNTIL (level% >= 1) && (level% <= 3)\nEND FUNCTION level%\n\nFUNCTION BuildBoard(d%[], shCnt%[], level%)\n  ' Set pieces in correct order first\n  FOR p%% = 1 TO 15\n    d%[p%% - 1] = p%%\n  NEXT p%%\n  d%[15] = 0 ' 0 = empty piece/slot\n  z% = 16 ' z% = empty position\n  PRINT\n  PRINT \"Shuffling pieces\";\n  XstGetSystemTime (@msec)\n  SRand(INT(msec) MOD 32768)\n  FOR n% = 1 TO shCnt%[level% - 1]\n    PRINT \".\";\n    DO\n      x% = INT(Rand() / 32768.0 * 4.0) + 1\n      PRINT x%\n      SELECT CASE x%\n        CASE 1:\n          r% = z% - 4\n        CASE 2:\n          r% = z% + 4\n        CASE 3:\n          IF (z% - 1) MOD 4 <> 0 THEN\n            r% = z% - 1\n          END IF\n        CASE 4:\n          IF z% MOD 4 <> 0 THEN\n            r% = z% + 1\n          END IF\n      END SELECT\n    LOOP UNTIL (r% >= 1) && (r% <= 16)\n    d%[z% - 1] = d%[r% - 1]\n    z% = r%\n    d%[z% - 1] = 0\n  NEXT n%\n  XstClearConsole()\nEND FUNCTION\n\nFUNCTION IsMoveValid(d%[], piece%, piecePos%, emptyPos%)\n  mv% = 0\n  IF (piece% >= 1) && (piece% <= 15) THEN\n    piecePos% = PiecePosition(@d%[], piece%)\n    emptyPos% = PiecePosition(@d%[], 0)\n    ' Check if empty piece is above, below, left or right to piece\n    IF (piecePos% - 4 = emptyPos%) || (piecePos% + 4 = emptyPos%) || ((piecePos% - 1 = emptyPos%) && (emptyPos% MOD 4 <> 0)) || ((piecePos% + 1 = emptyPos%) && (piecePos% MOD 4 <> 0)) THEN\n      mv% = 1\n    END IF\n  END IF\nEND FUNCTION mv%\n\nFUNCTION PiecePosition(d%[], piece%)\n  p%% = 0\n  DO WHILE d%[p%%] <> piece%\n    INC p%%\n    IF p%% > 15 THEN\n      PRINT \"UH OH!\"\n      QUIT(1)\n    END IF\n  LOOP\nEND FUNCTION p%% + 1\n\nFUNCTION IsPuzzleComplete(d%[])\n  pc% = 0\n  p%% = 1\n  DO WHILE (p%% < 16) && (d%[p%% - 1] = p%%)\n    INC p%%\n  LOOP\n  IF p%% = 16 THEN\n    pc% = 1\n  END IF\nEND FUNCTION pc%\n\n' Return pseudo-random integer on 0..32767\nFUNCTION Rand() \n  #next&& = #next&& * 1103515245 + 12345\nEND FUNCTION USHORT(#next&& / 65536) MOD 32768\n\n' Set seed for Rand()\nFUNCTION SRand(seed%%) \n  #next&& = seed%%\nEND FUNCTION\n\nEND PROGRAM\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_135.txt",
        "content": "int Box, Hole, I;\n[Box:= [^ ,^F,^E,^D,    \\starting configuration\n        ^C,^B,^A,^9,    \\slide digits into ascending order\n        ^8,^7,^6,^5,    \\with blank in lower-right corner\n        ^4,^3,^2,^1];\nHole:= 0;               \\index for hole position\nloop    [Clear;         \\erase screen and move to start\n        for I:= 0 to 15 do \\show puzzle\n                [ChOut(0, Box(I));  ChOut(0, ^ );\n                if (I & 3) = 3 then CrLf(0)];\n        case ChIn(1) of                 \\get move\n          $1B:  quit;                   \\Esc\n          $48:  if Hole < 12 then       \\UpArrow scan code\n                        [Box(Hole):= Box(Hole+4);\n                        Hole:= Hole+4;\n                        Box(Hole):= ^ ];\n          $50:  if Hole > 3 then        \\DnArrow\n                        [Box(Hole):= Box(Hole-4);\n                        Hole:= Hole-4;\n                        Box(Hole):= ^ ];\n          $4B:  if (Hole & 3) < 3 then  \\LfArrow\n                        [Box(Hole):= Box(Hole+1);\n                        Hole:= Hole+1;\n                        Box(Hole):= ^ ];\n          $4D:  if (Hole & 3) > 0 then  \\RtArrow\n                        [Box(Hole):= Box(Hole-1);\n                        Hole:= Hole-1;\n                        Box(Hole):= ^ ]\n        other   [];     \\ignore 0 scan code prefix etc.\n        ];\n]",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_136.txt",
        "content": "  F E D \nC B A 9 \n8 7 6 5 \n4 3 2 1 \n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_137.txt",
        "content": "dx = 4\u00a0: dy = 4\u00a0: dxy = dx * dy\ndim grid(dx, dy)\n\ndim t(dxy)\n\nfor x = 1 to dx\n\tfor y = 1 to dy\n\t\tfin = false\n\t\trepeat\n\t\t\ti = int(ran(dxy) + 1)\n\t\t\tif t(i) = 0 then\n\t\t\t\tt(i) = 1\n\t\t\t\tfin = true\n\t\t\t\tif i < dxy then\n\t\t\t\t\tgrid(x, y) = i\n\t\t\t\telse\n\t\t\t\t\tex = x\u00a0: ey = y\n\t\t\t\tend if\n\t\t\tend if\n\t\tuntil(fin = true)\n\tnext y\nnext x\n\ndrawTable()\n\nrepeat\n\tmoveTile()\n\tdrawTable()\nuntil(finish())\n\nprint \"\\n\\n\\nNumber of movements: \",mov,\"\\nEnd\\n\"\n\nsub finish()\n\tlocal x, y, v\n\t\n\tfor y = 1 to dy\n\t\tfor x = 1 to dx\n\t\t\tv = v + 1\n\t\t\tif (v < dxy) and (grid(x, y) <> v) return false\n\t\tnext x\n\tnext y\n\treturn true\nend sub\n\nsub moveTile()\n\tlocal direction$\n\t\n\tdirection$ = inkey$\n\t\n\tswitch direction$\n\t\tcase \"up\": if (ey + 1) < (dy + 1) then grid(ex, ey) = grid(ex, ey + 1)\u00a0: ey = ey + 1  end if\u00a0: break\n\t\tcase \"down\": if (ey - 1) > 0 then grid(ex, ey) = grid(ex, ey - 1)\u00a0: ey = ey - 1  end if\u00a0: break\n\t\tcase \"right\": if (ex - 1) > 0 then grid(ex, ey) = grid(ex - 1, ey)\u00a0: ex = ex - 1  end if\u00a0: break\n\t\tcase \"left\": if (ex + 1) < (dx + 1) then grid(ex, ey) = grid(ex + 1, ey)\u00a0: ex = ex + 1  end if\u00a0: break\n\t\tdefault: return\u00a0: break\n\tend switch\n\tmov = mov + 1\n\tgrid(ex, ey) = 0\nend sub\n\nsub drawTable()\n\tlocal x, y\n\t\n\tclear screen\n\t\n\tprint \"   Use the cursor keys\"\n\t\n\tfor x = 1 to dx\n\t\tfor y = 1 to dy\n\t\t\tprint at(x * 3, y * 2);\n\t\t\tif grid(x, y) then\n\t\t\t\tprint color(\"yellow\",\"magenta\") grid(x, y) using \"##\"\n\t\t\telse\n\t\t\t\tprint \"  \"\n\t\t\tend if\n\t\tnext y\n\tnext x\nend sub",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_138.txt",
        "content": "board$ = \"123456789ABCDEF0\"\nsolve$ = board$\npos = 16\n \nsub print_board()\n    local i, n$\n\t\n    clear screen\n    for i = 1 to len(board$)\n    \tif i = pos then\n            print \"   \";\n    \telse\n    \t    n$ = str$(dec(mid$(board$, i, 1)), \"###\")\n    \t    print n$; \n        end if\n        if mod(i, 4) = 0 print\n    next\n    print\nend sub\n \nsub move(d)\n    local new_pos, delta(4)\n    \n    delta(1) = 4\u00a0: delta(2) = 1\u00a0: delta(3) = -1\u00a0: delta(4) = -4\n    \n    new_pos = pos + delta(d)\n    if new_pos >= 1 and new_pos <= 16 and (mod(pos, 4) = mod(new_pos, 4) or floor((pos - 1) / 4) = floor((new_pos - 1) / 4)) then\n    \tmid$(board$, pos, 1) = mid$(board$, new_pos, 1)\n    \tmid$(board$, new_pos, 1) = \"0\"\n        pos = new_pos\n    end if\nend sub\n \nfor i = 1 to 100\u00a0: move(int(ran(4))+1)\u00a0: next\ndo\n    print_board()\n    if board$ = solve$ break\n    c = ((instr(\"esc  up   left rightdown \", inkey$) - 1) / 5)\n    if c < 1 break\n    move(c)\nloop\nprint \"solved!\\n\"",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_139.txt",
        "content": "const std = @import(\"std\");\nconst stdout = std.io.getStdOut().writer();\n\nconst tokens = [16][]const u8{ \" 1\", \" 2\", \" 3\", \" 4\", \" 5\", \" 6\", \" 7\", \" 8\", \" 9\", \"10\", \"11\", \"12\", \"13\", \"14\", \"15\", \"  \" };\n\nconst empty_token = 15;\nvar empty: u8 = empty_token;\nvar cells: [16]u8 = undefined;\nvar invalid: bool = false;\n\nconst Move = enum { no, up, down, left, right };\n\nfn showBoard() !void {\n    try stdout.writeAll(\"\\n\");\n\n    var solved = true;\n    var i: u8 = 0;\n    while (i < 16) : (i += 1) {\n        try stdout.print(\" {s} \", .{tokens[cells[i]]});\n        if ((i + 1) % 4 == 0) try stdout.writeAll(\"\\n\");\n        if (i != cells[i]) solved = false;\n    }\n\n    try stdout.writeAll(\"\\n\");\n\n    if (solved) {\n        try stdout.writeAll(\"\\n\\n** You did it! **\\n\\n\");\n        std.posix.exit(0);\n    }\n}\n\nfn updateToken(move: Move) !void {\n    const newEmpty = switch (move) {\n        Move.up => if (empty / 4 < 3) empty + 4 else empty,\n        Move.down => if (empty / 4 > 0) empty - 4 else empty,\n        Move.left => if (empty % 4 < 3) empty + 1 else empty,\n        Move.right => if (empty % 4 > 0) empty - 1 else empty,\n        else => empty,\n    };\n\n    if (empty == newEmpty) {\n        invalid = true;\n    } else {\n        invalid = false;\n        cells[empty] = cells[newEmpty];\n        cells[newEmpty] = empty_token;\n        empty = newEmpty;\n    }\n}\n\nfn waitForMove() !Move {\n    const reader = std.io.getStdIn().reader();\n    if (invalid) try stdout.writeAll(\"(invalid) \");\n    try stdout.writeAll(\"enter u/d/l/r or q: \");\n    const input = try reader.readBytesNoEof(2);\n    switch (std.ascii.toLower(input[0])) {\n        'q' => std.posix.exit(0),\n        'u' => return Move.up,\n        'd' => return Move.down,\n        'l' => return Move.left,\n        'r' => return Move.right,\n        else => return Move.no,\n    }\n}\n\nfn shuffle(moves: u8) !void {\n    var random = std.Random.DefaultPrng.init(@intCast(std.time.microTimestamp()));\n    const rand = random.random();\n    var n: u8 = 0;\n    while (n < moves) {\n        const move: Move = rand.enumValue(Move);\n        try updateToken(move);\n        if (!invalid) n += 1;\n    }\n    invalid = false;\n}\n\npub fn main() !void {\n    var n: u8 = 0;\n    while (n < 16) : (n += 1) {\n        cells[n] = n;\n    }\n\n    try shuffle(50);\n    try showBoard();\n\n    while (true) {\n        try updateToken(try waitForMove());\n        try showBoard();\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_14.txt",
        "content": "/* ARM assembly Raspberry PI  */\n/*  program puzzle15.s   */\n \n/************************************/\n/* Constantes                       */\n/************************************/\n.equ STDIN,  0     @ Linux input console\n.equ STDOUT, 1     @ Linux output console\n.equ EXIT,   1     @ Linux syscall\n.equ READ,   3     @ Linux syscall\n.equ WRITE,  4     @ Linux syscall\n\n.equ IOCTL,     0x36  @ Linux syscall\n.equ SIGACTION, 0x43  @ Linux syscall\n.equ SYSPOLL,   0xA8  @ Linux syscall\n\n.equ TCGETS,    0x5401\n.equ TCSETS,    0x5402\n.equ ICANON,    2\n.equ ECHO,     10\n.equ POLLIN,    1\n\n.equ SIGINT,   2    @ Issued if the user sends an interrupt signal (Ctrl + C)\n.equ SIGQUIT,  3    @ Issued if the user sends a quit signal (Ctrl + D)\n.equ SIGTERM, 15    @ Software termination signal (sent by kill by default)\n.equ SIGTTOU, 22    @ \n\n.equ NBBOX,  16\n.equ TAILLEBUFFER,   10\n\n/*******************************************/\n/* Structures                               */\n/********************************************/\n/* structure termios see doc linux*/\n    .struct  0\nterm_c_iflag:                    @ input modes\n    .struct  term_c_iflag + 4 \nterm_c_oflag:                    @ output modes\n    .struct  term_c_oflag + 4 \nterm_c_cflag:                    @ control modes\n    .struct  term_c_cflag + 4 \nterm_c_lflag:                    @ local modes\n    .struct  term_c_lflag + 4 \nterm_c_cc:                       @ special characters\n    .struct  term_c_cc + 20      @ see length if necessary \nterm_fin:\n\n/* structure sigaction see doc linux */\n    .struct  0\nsa_handler:\n    .struct  sa_handler + 4 \nsa_mask:\n    .struct  sa_mask + 4 \nsa_flags:\n    .struct  sa_flags + 4 \nsa_sigaction:\n    .struct  sa_sigaction + 4 \nsa_fin:\n\n/* structure poll see doc linux */\n    .struct  0\npoll_fd:                            @   File Descriptor\n    .struct  poll_fd + 4 \npoll_events:                        @  events mask\n    .struct  poll_events + 4 \npoll_revents:                       @ events returned\n    .struct  poll_revents + 4 \npoll_fin:\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nsMessResult:           .ascii \" \"\nsMessValeur:           .fill 11, 1, ' '             @ size => 11\nszCarriageReturn:      .asciz \"\\n\"\nszMessGameWin:         .ascii \"You win in \"\nsMessCounter:           .fill 11, 1, ' '            @ size => 11\n                       .asciz \" move number\u00a0!!!!\\n\"\nszMessMoveError:       .asciz \"Huh... Impossible move\u00a0!!!!\\n\"\nszMessErreur:          .asciz \"Error detected.\\n\"\nszMessSpaces:          .asciz \"    \"\niGraine:               .int 123456\n/*************************************************/\nszMessErr: .ascii\t\"Error code hexa\u00a0: \"\nsHexa: .space 9,' '\n         .ascii \"  decimal\u00a0:  \"\nsDeci: .space 15,' '\n         .asciz \"\\n\"\nszClear:     .byte 0x1B \n\t\t     .byte 'c'                         @ console clear\n\t\t     .byte 0\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\n.align 4\niCodeError:     .skip 4\nibox:          .skip 4 * NBBOX                 @ game boxes\niEnd:           .skip 4                        @ 0 loop  1 = end loop\niTouche:        .skip 4                        @ value key pressed\nstOldtio:       .skip term_fin                 @ old terminal state\nstCurtio:       .skip term_fin                 @ current terminal state\nstSigAction:    .skip sa_fin                   @ area signal structure\nstSigAction1:   .skip sa_fin\nstPoll1:        .skip poll_fin                 @ area poll structure\nstPoll2:        .skip poll_fin\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                @ entry of program \n    mov r0,#0\n    ldr r2,iAdribox\n    mov r9,#0                        @ move counter \n1:                                   @ loop init boxs\n    add r1,r0,#1                     @ box value\n    str r1,[r2,r0, lsl #2]           @ store value\n    add r0,#1                        @ increment counter\n    cmp r0,#NBBOX - 2                @ end\u00a0?\n    ble 1b\n    mov r10,#15                      @ empty box location \n    ldr r0,iAdribox\n    bl shuffleGame\n2:                                   @ loop moves\n    ldr r0,iAdribox\n    bl displayGame\n    //ldr r0,iAdribox\n    //bl gameOK                      @ end game\u00a0?\n    //cmp r0,#1\n    //beq 50f\n    bl readKey                       @ read key \n    cmp r0,#-1\n    beq 100f                         @ error or control-c\n    mov r1,r0                        @ key\n    ldr r0,iAdribox\n    bl keyMove\n    ldr r0,iAdribox\n    bl gameOK                        @ end game\u00a0?\n    cmp r0,#1\n    bne 2b                           @ no -> loop\n50:                                  @ win\n    mov r0,r9                        @ move counter\n    ldr r1,iAdrsMessCounter\n    bl conversion10\n    ldr r0,iAdrszMessGameWin\n    bl affichageMess\n\n100:                                 @ standard end of the program \n    mov r0, #0                       @ return code\n    mov r7, #EXIT                    @ request to exit program\n    svc #0                           @ perform the system call\n \niAdrsMessValeur:          .int sMessValeur\niAdrszCarriageReturn:     .int szCarriageReturn\niAdrsMessResult:          .int sMessResult\niAdribox:                 .int ibox\niAdrszMessGameWin:        .int szMessGameWin\niAdrsMessCounter:         .int sMessCounter\n/******************************************************************/\n/*     key move                                                   */ \n/******************************************************************/\n/* r0 contains boxs address           */\n/* r1 contains key value               */\n/* r9 move counter                     */\n/* r10 contains location empty box    */\nkeyMove:\n    push {r1-r8,lr}                  @ save  registers\n    mov r8,r0\n    cmp r1,#0x42                     @ down arrow \n    bne 1f\n    cmp r10,#4                       @ if r10 < 4   error\n    blt 80f\n    sub r2,r10,#4                    @ compute location\n    b 90f\n1:\n    cmp r1,#0x41                     @ high arrow\n    bne 2f\n    cmp r10,#11                      @ if r10 > 11   error\n    bgt 80f\n    add r2,r10,#4                    @ compute location\n    b 90f\n2:\n    cmp r1,#0x43                     @ right arrow\n    bne 3f\n    tst r10,#0b11                    @ if r10 = 0,4,8,12   error\n    beq 80f\n    sub r2,r10,#1                    @ compute location\n    b 90f\n3:\n    cmp r1,#0x44                     @ left arrow\n    bne 100f\n    and r3,r10,#0b11                 @ error if r10 = 3 7 11 and 15\n    cmp r3,#3\n    beq 80f\n    add r2,r10,#1                    @ compute location\n    b 90f\n\n80:                                  @ move error\n    ldr r0,iAdriCodeError\n    mov r1,#1\n    str r1,[r0]\n    b 100f\n90:                                  @ white box and move box inversion\n    ldr r3,[r8,r2,lsl #2]\n    str r3,[r8,r10,lsl #2]\n    mov r10,r2\n    mov r3,#0\n    str r3,[r8,r10,lsl #2]\n    add r9,#1                        @ increment move counter\n100:\n    pop {r1-r8,lr}                   @ restaur registers \n    bx lr                            @return\niAdriCodeError:             .int iCodeError\n/******************************************************************/\n/*     shuffle game                                       */ \n/******************************************************************/\n/* r0 contains boxs address           */\nshuffleGame:\n    push {r1-r6,lr}                     @ save  registers\n    mov r1,r0\n    mov r0,#4\n    bl genereraleas\n    lsl r4,r0,#1\n    mov r0,r8\n1:\n    mov r0,#14\n    bl genereraleas\n    add r6,r0,#1\n    mov r0,#14\n    bl genereraleas\n    add r5,r0,#1\n    ldr r2,[r1,r6,lsl #2]\n    ldr r3,[r1,r5,lsl #2]\n    str r2,[r1,r5,lsl #2]\n    str r3,[r1,r6,lsl #2]\n    subs r4,#1\n    bgt 1b\n\n100:\n    pop {r1-r6,lr}                      @ restaur registers \n    bx lr                               @return\n/******************************************************************/\n/*     game Ok\u00a0?                                      */ \n/******************************************************************/\n/* r0 contains boxs address           */\ngameOK:\n    push {r1-r8,lr}                     @ save  registers\n    mov r8,r0\n    mov r2,#0\n    ldr r3,[r8,r2,lsl #2]\n    add r2,#1\n1:\n    ldr r4,[r8,r2,lsl #2]\n    cmp r4,r3\n    movlt r0,#0                         @ game mot Ok\n    blt 100f\n    mov r3,r4\n    add r2,#1\n    cmp r2,#NBBOX -2\n    ble 1b\n    mov r0,#1                           @ game Ok\n\n100:\n    pop {r1-r8,lr}                      @ restaur registers \n    bx lr                               @return\n/******************************************************************/\n/*     display game                                       */ \n/******************************************************************/\n/* r0 contains boxs address           */\ndisplayGame:\n    push {r1-r5,lr}                     @ save  registers\n    @ clear\u00a0!\n    mov r4,r0\n    ldr r0,iAdrszClear\n    bl affichageMess \n    mov r2,#0\n    ldr r1,iAdrsMessValeur\n1:\n    ldr r0,[r4,r2,lsl #2]\n    cmp r0,#0\n    ldreq r0,iSpaces                    @ store spaces\n    streq r0,[r1]\n    beq 2f\n    bl conversion10                     @ call conversion decimal\n    mov r0,#0\n    strb r0,[r1,#3]                     @ z\u00e9ro final\n2:\n\n    ldr r0,iAdrsMessResult\n    bl affichageMess                    @ display message\n    add r0,r2,#1\n    tst r0,#0b11\n    bne 3f\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess                    @ display message\n3:\n    add r2,#1\n    cmp r2,#NBBOX - 1\n    ble 1b\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess                    @ display line return\n    ldr r0,iAdriCodeError               @ error detected\u00a0?\n    ldr r1,[r0]\n    cmp r1,#0\n    beq 100f\n    mov r1,#0                           @ raz error code\n    str r1,[r0]\n    ldr r0,iAdrszMessMoveError          @ display error message\n    bl affichageMess\n100:\n    pop {r1-r5,lr}                      @ restaur registers \n    bx lr                               @return\niSpaces:                       .int 0x00202020       @ spaces\niAdrszClear:                   .int szClear          \niAdrszMessMoveError:           .int szMessMoveError\n/******************************************************************/\n/*     display text with size calculation                         */ \n/******************************************************************/\n/* r0 contains the address of the message */\naffichageMess:\n    push {r0,r1,r2,r7,lr}                          @ save  registres\n    mov r2,#0                                      @ counter length \n1:                                                 @ loop length calculation \n    ldrb r1,[r0,r2]                                @ read octet start position + index \n    cmp r1,#0                                      @ if 0 its over \n    addne r2,r2,#1                                 @ else add 1 in the length \n    bne 1b                                         @ and loop \n                                                   @ so here r2 contains the length of the message \n    mov r1,r0                                      @ address message in r1 \n    mov r0,#STDOUT                                 @ code to write to the standard output Linux \n    mov r7, #WRITE                                 @ code call system \"write\" \n    svc #0                                         @ call systeme \n    pop {r0,r1,r2,r7,lr}                           @ restaur des  2 registres */ \n    bx lr                                          @ return  \n/******************************************************************/\n/*     Converting a register to a decimal unsigned                */ \n/******************************************************************/\n/* r0 contains value and r1 address area   */\n/* r0 return size of result (no zero final in area) */\n/* area size => 11 bytes          */\n.equ LGZONECAL,   10\nconversion10:\n    push {r1-r4,lr}                                 @ save registers \n    mov r3,r1\n    mov r2,#LGZONECAL\n1:                                                  @ start loop\n    bl divisionpar10U                               @ unsigned  r0 <- dividende. quotient ->r0 reste -> r1\n    add r1,#48                                      @ digit\n    strb r1,[r3,r2]                                 @ store digit on area\n    cmp r0,#0                                       @ stop if quotient = 0 \n    subne r2,#1                                     @ else previous position\n    bne 1b                                          @ and loop\n                                                    @ and move digit from left of area\n    mov r4,#0\n2:\n    ldrb r1,[r3,r2]\n    strb r1,[r3,r4]\n    add r2,#1\n    add r4,#1\n    cmp r2,#LGZONECAL\n    ble 2b\n                                                      @ and move spaces in end on area\n    mov r0,r4                                         @ result length \n    mov r1,#' '                                       @ space\n3:\n    strb r1,[r3,r4]                                   @ store space in area\n    add r4,#1                                         @ next position\n    cmp r4,#LGZONECAL\n    ble 3b                                            @ loop if r4 <= area size\n \n100:\n    pop {r1-r4,lr}                                    @ restaur registres \n    bx lr                                             @return\n \n/***************************************************/\n/*   division par 10   unsigned                    */\n/***************************************************/\n/* r0 dividende   */\n/* r0 quotient    */\n/* r1 remainder   */\ndivisionpar10U:\n    push {r2,r3,r4, lr}\n    mov r4,r0                                          @ save value\n    ldr r3,iMagicNumber                                @ r3 <- magic_number    raspberry 1 2\n    umull r1, r2, r3, r0                               @ r1<- Lower32Bits(r1*r0) r2<- Upper32Bits(r1*r0) \n    mov r0, r2, LSR #3                                 @ r2 <- r2 >> shift 3\n    add r2,r0,r0, lsl #2                               @ r2 <- r0 * 5 \n    sub r1,r4,r2, lsl #1                               @ r1 <- r4 - (r2 * 2)  = r4 - (r0 * 10)\n    pop {r2,r3,r4,lr}\n    bx lr                                              @ leave function \niMagicNumber:  \t.int 0xCCCCCCCD\n/***************************************************/\n/*   Generation random number                  */\n/***************************************************/\n/* r0 contains limit  */\ngenereraleas:\n    push {r1-r4,lr}                                    @ save registers \n    ldr r4,iAdriGraine\n    ldr r2,[r4]\n    ldr r3,iNbDep1\n    mul r2,r3,r2\n    ldr r3,iNbDep1\n    add r2,r2,r3\n    str r2,[r4]                                        @ maj de la graine pour l appel suivant \n    cmp r0,#0\n    beq 100f\n    mov r1,r0                                          @ divisor\n    mov r0,r2                                          @ dividende\n    bl division\n    mov r0,r3                                          @ r\u00e9sult = remainder\n  \n100:                                                   @ end function\n    pop {r1-r4,lr}                                     @ restaur registers\n    bx lr                                              @ return\n/*****************************************************/\niAdriGraine: .int iGraine\niNbDep1: .int 0x343FD\niNbDep2: .int 0x269EC3 \n/***************************************************/\n/* integer division unsigned                       */\n/***************************************************/\ndivision:\n    /* r0 contains dividend */\n    /* r1 contains divisor */\n    /* r2 returns quotient */\n    /* r3 returns remainder */\n    push {r4, lr}\n    mov r2, #0                                         @ init quotient\n    mov r3, #0                                         @ init remainder\n    mov r4, #32                                        @ init counter bits\n    b 2f\n1:                                                     @ loop \n    movs r0, r0, LSL #1                                @ r0 <- r0 << 1 updating cpsr (sets C if 31st bit of r0 was 1)\n    adc r3, r3, r3                                     @ r3 <- r3 + r3 + C. This is equivalent to r3\u00a0? (r3 << 1) + C \n    cmp r3, r1                                         @ compute r3 - r1 and update cpsr \n    subhs r3, r3, r1                                   @ if r3 >= r1 (C=1) then r3 <- r3 - r1 \n    adc r2, r2, r2                                     @ r2 <- r2 + r2 + C. This is equivalent to r2 <- (r2 << 1) + C \n2:\n    subs r4, r4, #1                                    @ r4 <- r4 - 1 \n    bpl 1b                                             @ if r4 >= 0 (N=0) then loop\n    pop {r4, lr}\n    bx lr\n/***************************************************/\n/* read touch                                      */\n/***************************************************/\nreadKey:\n    push {r1-r7,lr}\n    mov r5,#0\n    /* read terminal state */\n    mov r0,#STDIN                                @ input console\n    mov r1,#TCGETS\n    ldr r2,iAdrstOldtio\n    mov r7, #IOCTL                               @ call system Linux\n    svc #0 \n    cmp r0,#0                                    @ error\u00a0?\n    beq 1f\n    ldr r1,iAdrszMessErreur                      @ error message\n    bl   displayError\n    mov r0,#-1\n    b 100f\n1:\n    adr r0,sighandler                            @ adresse routine traitement signal\n    ldr r1,iAdrstSigAction                       @ adresse structure sigaction\n    str r0,[r1,#sa_handler]                      @ maj handler\n    mov r0,#SIGINT                               @ signal type\n    ldr r1,iAdrstSigAction\n    mov r2,#0                                    @ NULL\n    mov r7, #SIGACTION                           @ call system\n    svc #0 \n    cmp r0,#0                                    @ error\u00a0?\n    bne 97f\n    mov r0,#SIGQUIT\n    ldr r1,iAdrstSigAction\n    mov r2,#0                                    @ NULL\n    mov r7, #SIGACTION                           @ call system \n    svc #0 \n    cmp r0,#0                                    @ error\u00a0?\n    bne 97f\n    mov r0,#SIGTERM\n    ldr r1,iAdrstSigAction\n    mov r2,#0                                    @ NULL\n    mov r7, #SIGACTION                           @ appel systeme \n    svc #0 \n    cmp r0,#0\n    bne 97f\n    @\n    adr r0,iSIG_IGN                              @ address signal ignore function\n    ldr r1,iAdrstSigAction1\n    str r0,[r1,#sa_handler]\n    mov r0,#SIGTTOU                              @invalidate other process signal\n    ldr r1,iAdrstSigAction1\n    mov r2,#0                                    @ NULL\n    mov r7,#SIGACTION                            @ call system \n    svc #0 \n    cmp r0,#0\n    bne 97f\n    @\n    /* read terminal current state  */\n    mov r0,#STDIN\n    mov r1,#TCGETS\n    ldr r2,iAdrstCurtio                          @ address current termio\n    mov r7,#IOCTL                                @ call systeme \n    svc #0 \n    cmp r0,#0                                    @ error\u00a0?\n    bne 97f\n    mov r2,#ICANON | ECHO                        @ no key pressed echo on display\n    mvn r2,r2                                    @ and one key \n    ldr r1,iAdrstCurtio\n    ldr r3,[r1,#term_c_lflag]\n    and r3,r2                                    @ add flags \n    str r3,[r1,#term_c_lflag]                    @ and store\n    mov r0,#STDIN                                @ maj terminal current state \n    mov r1,#TCSETS\n    ldr r2,iAdrstCurtio\n    mov r7, #IOCTL                               @ call system\n    svc #0 \n    cmp r0,#0\n    bne 97f\n    @\n2:                                               @ loop waiting key\n    ldr r0,iAdriEnd                              @ if signal ctrl-c  -> end\n    ldr r0,[r0]\n    cmp r0,#0\n    movne r5,#-1\n    bne 98f\n    ldr r0,iAdrstPoll1                            @ address structure poll\n    mov r1,#STDIN\n    str r1,[r0,#poll_fd]                          @ maj FD\n    mov r1,#POLLIN                                @ action code\n    str r1,[r0,#poll_events]\n    mov r1,#1                                     @ items number structure poll\n    mov r2,#0                                     @ timeout = 0 \n    mov r7,#SYSPOLL                               @ call system POLL\n    svc #0 \n    cmp r0,#0                                     @ key pressed\u00a0?\n    ble 2b                                        @ no key pressed -> loop\n                                                  @ read key\n    mov r0,#STDIN                                 @ File Descriptor\n    ldr r1,iAdriTouche                            @ buffer address\n    mov r2,#TAILLEBUFFER                          @ buffer size\n    mov r7,#READ                                  @ read key\n    svc #0\n    cmp r0,#0                                     @ error\u00a0?\n    bgt 98f\n\n97:                                               @ error detected\n    ldr r1,iAdrszMessErreur                       @ error message\n    bl   displayError\n    mov r5,#-1\n98:                                               @ end then restaur begin state terminal\n    mov r0,#STDIN\n    mov r1,#TCSETS\n    ldr r2,iAdrstOldtio\n    mov r7,#IOCTL                                 @ call system  \n    svc #0\n    cmp r0,#0\n    beq 99f                                       @ restaur ok\n    ldr r1,iAdrszMessErreur                       @ error message\n    bl   displayError\n    mov r0,#-1\n    b 100f\n99:\n    cmp r5,#0                                     @ error or control-c\n    ldreq r2,iAdriTouche                          @ key address\n    ldreqb r0,[r2,#2]                             @ return key byte\n    movne r0,r5                                   @ or error\n100:\n    pop {r1-r7, lr}\n    bx lr\niSIG_IGN:                 .int 1\niAdriEnd:                 .int iEnd\niAdrstPoll1:              .int stPoll1\niAdriTouche:              .int iTouche\niAdrstOldtio:             .int stOldtio\niAdrstCurtio:             .int stCurtio\niAdrstSigAction:          .int stSigAction\niAdrstSigAction1:         .int stSigAction1\niAdrszMessErreur\u00a0:        .int szMessErreur \n/******************************************************************/\n/*     traitement du signal                                       */ \n/******************************************************************/\nsighandler:\n    push {r0,r1}\n    ldr r0,iAdriEnd\n    mov r1,#1                 @ maj zone end\n    str r1,[r0]\n    pop {r0,r1}\n    bx lr\n/***************************************************/\n/*   display error message                         */\n/***************************************************/\n/* r0 contains error code  r1\u00a0: message address */\ndisplayError:\n    push {r0-r2,lr}                         @ save registers\n    mov r2,r0                               @ save error code\n    mov r0,r1\n    bl affichageMess\n    mov r0,r2                               @ error code\n    ldr r1,iAdrsHexa\n    bl conversion16                         @ conversion hexa\n    mov r0,r2                               @ error code\n    ldr r1,iAdrsDeci                        @ result address\n    bl conversion10                         @ conversion decimale\n    ldr r0,iAdrszMessErr                    @ display error message\n    bl affichageMess\n100:\n    pop {r0-r2,lr}                          @ restaur registers\n    bx lr                                   @ return \niAdrszMessErr:                 .int szMessErr\niAdrsHexa:                     .int sHexa\niAdrsDeci:                     .int sDeci\n/******************************************************************/\n/*     Converting a register to hexadecimal                      */ \n/******************************************************************/\n/* r0 contains value and r1 address area   */\nconversion16:\n    push {r1-r4,lr}                                    @ save registers\n    mov r2,#28                                         @ start bit position\n    mov r4,#0xF0000000                                 @ mask\n    mov r3,r0                                          @ save entry value\n1:                                                     @ start loop\n    and r0,r3,r4                                       @value register and mask\n    lsr r0,r2                                          @ move right \n    cmp r0,#10                                         @ compare value\n    addlt r0,#48                                       @ <10  ->digit\t\n    addge r0,#55                                       @ >10  ->letter A-F\n    strb r0,[r1],#1                                    @ store digit on area and + 1 in area address\n    lsr r4,#4                                          @ shift mask 4 positions\n    subs r2,#4                                         @  counter bits - 4 <= zero \u00a0?\n    bge 1b                                             @  no -> loop\n\n100:\n    pop {r1-r4,lr}                                     @ restaur registers \n    bx lr                                              @return",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_140.txt",
        "content": "  1   2   3   4 \n  5   6   7   8 \n  9  10  12     \n 13  14  11  15 \n\nenter u/d/l/r or q: r\n\n  1   2   3   4 \n  5   6   7   8 \n  9  10      12 \n 13  14  11  15 \n\nenter u/d/l/r or q: u\n\n  1   2   3   4 \n  5   6   7   8 \n  9  10  11  12 \n 13  14      15 \n\nenter u/d/l/r or q: l\n\n  1   2   3   4 \n  5   6   7   8 \n  9  10  11  12 \n 13  14  15     \n\n\n** You did it! **\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_15.txt",
        "content": ";; ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~\n;; ===>> ~~ Game's functions ~~ <<===\n;; --->> ~~ Init functions ~~ <<---\n\n;; This is a solved sample that is used to\n;; init and finish the game\nsolvedTable: @[ \"  1  \" \"  2  \" \"  3  \" \"  4  \"\n                \"  5  \" \"  6  \" \"  7  \" \"  8  \"\n                \"  9  \" \"  10 \" \"  11 \" \"  12 \"\n                \"  13 \" \"  14 \" \"  15 \" \"     \" ]\n\n;; Use this once in :game's init, to get a player position\n;; Q: Why use it once?\n;; A: This algorithm is slower than just get a stored varible\n;; yet this searches for a string for every value from :game\ngetPlayerPosition: $[table :block][\n    return index table \"     \"\n]\n\n;; This is the object that represents the game\n;; 'table\u00a0\u00bb The sample table to generate the game\ndefine :game [\n    table :block\n][\n\n    init: [\n        ; checks if 'table has 16 elements\n        ensure [16 = size this\\table]\n\n        ;; The game's table itself\n        this\\table: (shuffle this\\table) ; creates a random game\n        ;; The current movement. When less, better is your punctuation\n        this\\movements: 0\n        ;; The current 'playerPosition in table\n        ;; Used to evaluate if certain movement is possible or not\n        this\\playerPosition: getPlayerPosition this\\table\n        ;; Defines it the gameLoop still running\n        this\\running?: true\n    ]\n\n    ;; A builtin print function that simplifies the use\n    print: [\n        render {\n            Movements: |this\\movements|, Position: |this\\playerPosition|\n            *-----*-----*-----*-----*\n             |this\\table\\0| |this\\table\\1| |this\\table\\2| |this\\table\\3|\n            *-----*-----*-----*-----*\n             |this\\table\\4| |this\\table\\5| |this\\table\\6| |this\\table\\7|\n            *-----*-----*-----*-----*\n             |this\\table\\8| |this\\table\\9| |this\\table\\10| |this\\table\\11|\n            *-----*-----*-----*-----*\n             |this\\table\\12| |this\\table\\13| |this\\table\\14| |this\\table\\15|\n            *-----*-----*-----*-----*\n        }\n    ]\n\n    ;; Compares the internal's 'table with another :block\n    compare: [\n        if this\\table = that\n            -> return true\n    ]\n\n]\n\n;; These are the commands used internally on game\n;; To avoid ambiguity, User's input'll to be translated to this\ngameActions: ['up, 'left, 'down, 'right, 'quit]\n\n\n;; ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~\n;; -->> Print funnctions <<---\n\n;; A template for print instructions\nprintInstructions: [\n    color #cyan \"Type (WASD) to move and (Q) to quit.\"\n]\n\n;; A template for print input warning\n;; 'input: the wrong input itself that will be printed\nprintWrongInput: $[inp :string][\n    print color #red\n    ~\"Wrong input: '|inp|'\"\n]\n\n;; A template for print input warning\n;; 'action: could be 'up, 'down, 'left or 'right\nprintWrongMovement: $[action :literal][\n    print color #red\n    ~\"Wrong movement. Can't go |action|\"\n]\n\n\n;; ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~\n;; --->> Validators/Checkers functions <<---\n\n;; Checks if a 'input is in 'gameActions\n;; Valids for: 'up, 'down, 'left, 'right and 'quit\nvalidInput?: $[inp :any][\n    return (in? inp gameActions)\n]\n\n;; Checks if the current movement tried is possible\n;; 'game\u00a0\u00bb is the current game\n;; 'movement\u00a0\u00bb must be in 'gameActions, but can't be 'quit\nvalidMovement?: $[\n    game     :game\n    movement :literal\n][\n    pos: game\\playerPosition\n    case [movement]\n        when? [='up]\n            -> return (not? in? pos [0..3])\n        when? [='down]\n            -> return (not? in? pos [12..15])\n        when? [='left]\n            -> return (not? in? pos [0 4 8 12])\n        when? [='right]\n            -> return (not? in? pos [3 7 11 15])\n    else\n        -> return false\n]\n\n\n;; ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~\n;; --->> Action functions <<---\n\n;; Gets user input from terminal\n;; returning a :literal from 'gameActions\n;; Raises: In case of wrong input,\n;; will be returned the same input as a :string\nparseInput: $[inp :string][\n    lowerInp: lower inp\n    case [lowerInp]\n        when? [=\"w\"] -> return 'up\n        when? [=\"a\"] -> return 'left\n        when? [=\"s\"] -> return 'down\n        when? [=\"d\"] -> return 'right\n        when? [=\"q\"] -> return 'quit\n    else -> return inp\n]\n\n;; Moves the player in Game's Table\n;; Note that this's a unsafe function,\n;; use 'validMovement? to check a 'movement given a game,\n;; and then use this\nmovePlayer: $[\n    game     :game\n    movement :literal\n][\n\n    position: game\\playerPosition\n\n    updateGame: $[\n        game             :game\n        playerPosition   :integer\n        relativePosition :integer\n    ][\n        try [\n\n            ; 'otherPosition is the real index of the 'relativePosition\n            otherPosition: + playerPosition relativePosition\n\n            ; -- Updates the table, swaping the positions\n            temp: game\\table\\[playerPosition]\n            game\\table\\[playerPosition]: game\\table\\[otherPosition]\n            game\\table\\[otherPosition]: temp\n\n            ; -- Updates player's status\n            game\\playerPosition: otherPosition\n            game\\movements: inc game\\movements\n        ] else -> panic \"'movement didn't checked.\"\n    ]\n\n    case [movement]\n    when? [='up]\n        -> (updateGame game position (neg 4))\n    when? [='down]\n        -> (updateGame game position (4))\n    when? [='left]\n        -> (updateGame game position (neg 1))\n    when? [='right]\n        -> (updateGame game position (1))\n    else -> panic \"'movement didn't checked.\"\n\n]\n\nendGame: $[\n    message :string\n][\n    print message\n    exit\n]\n\n\n;; ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~\n;; --->> Run function <<---\n\n;; Inits ans runs the game\n;; 'sampleTable must be already solved\nrunGame: $[sampleTable :block][\n    game: to :game [sampleTable]\n\n    while [game\\running?] [\n        print game\n        print printInstructions\n        command: parseInput input \">> \"\n\n        if command = 'quit\n            -> endGame \"Exiting game...\"\n\n        validInp: validInput? command\n        if? validInp [\n            validMov: validMovement? game command\n            (validMov)?\n                -> movePlayer game command\n                -> printWrongMovement command\n        ] else\n            -> printWrongInput command\n\n        if sampleTable = game\n            -> endGame \"Congratulations! You won!\"\n        print \"\"\n    ]\n]\n\n\nrunGame solvedTable\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_16.txt",
        "content": "type Puzzle(var items: {}, var position: -1)\n\nfun mainframe(puz):\n    let d = puz.items\n    print('+-----+-----+-----+-----+')\n    print(d[1], d[2], d[3], d[4], first: '|', sep: '|', last: '|')\n    print('+-----+-----+-----+-----+')\n    print(d[5], d[6], d[7], d[8], first: '|', sep: '|', last: '|')\n    print('+-----+-----+-----+-----+')\n    print(d[9], d[10], d[11], d[12], first: '|', sep: '|', last: '|')\n    print('+-----+-----+-----+-----+')\n    print(d[13], d[14], d[15], d[16], first: '|', sep: '|', last: '|')\n    print('+-----+-----+-----+-----+')\n\nfun format(puz, ch):\n    match ch.trim().length:\n        1 => '  $ch  '\n        2 => '  $ch '\n        0 => '     '\n\nfun change(puz, to):\n    let fro = puz.position\n    for a, b in puz.items where b == puz.format(str i):\n        to = a\n        break\n\n    swap(puz.items[fro], :[to])\n    puz.position = to;\n\nfun buildboard(puz, difficulty):\n    for i in 1..16:\n        puz.items[i] = puz.format(str i)\n\n    var tmp = a\n    for a, b in puz.items where b == '  16 ':\n        puz.items[a] = '     '\n            tmp = a\n            break\n\n    puz.position = tmp\n    let diff = match difficulty:\n        0 => 10\n        1 => 50\n        _ => 100\n\n    for i in 1..diff:\n        let lst = puz.validmoves()\n        let lst1 = []\n        for j in lst:\n            lst1.push! j.trim().int()\n        puz.change(lst1[random(1, lst1.length - 1)])\n\nfun validmoves(puz):\n    match puz.position:\n        6 | 7 | 10 | 11 =>\n            puz.items[pos - 4], :[pos - 1], :[pos + 1], :[pos + 4]\n        5 | 9 =>\n            puz.items[pos - 4], :[pos + 4], :[pos + 1]\n        8 | 12 =>\n            puz.items[pos - 4], :[pos + 4], :[pos - 1]\n        2 | 3 =>\n            puz.items[pos - 1], :[pos + 1], :[pos + 4]\n        14 | 15 =>\n            puz.items[pos - 1], :[pos + 1], :[pos - 4]\n        1 =>\n            puz.items[pos + 1], :[pos + 4]\n        4 =>\n            puz.items[pos - 1], :[pos + 4]\n        13 =>\n            puz.items[pos + 1], :[pos - 4]\n        16 =>\n            puz.items[pos - 1], :[pos - 4]\n\nfun mainframe(puz):\n    var flag = false\n    for a, b in puz.items:\n        if b == '     ':\n            pass\n        else:\n            flag = (a == b.trim().int())\n    ..\n    return flag\n\nlet game = Puzzle()\ngame.buildboard(\n    int(input('Enter the difficulty\u00a0: 0 1 2\\n2 => highest 0=> lowest\\n'))\n)\ngame.mainframe()\n\nprint 'Enter 0 to exit'\n\nloop:\n    print 'Hello user:\\nTo change the position just enter the no. near it'\n\n    var lst = game.validmoves()\n    var lst1 = []\n    for i in lst:\n        lst1.push! i.trim().int()\n        print(i.strip(), '\\t', last: '')\n\n    print()\n\n    let value = int(input())\n    if value == 0:\n        break\n    elif x not in lst1:\n        print('Wrong move')\n    else:\n        game.change(x)\n\n    game.mainframe()\n    if g.gameover():\n        print 'You WON'\n        break\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_17.txt",
        "content": "Size := 20\nGrid := [], Deltas := [\"-1,0\",\"1,0\",\"0,-1\",\"0,1\"], Width := Size * 2.5\nGui, font, S%Size%\nGui, add, text, y1\nloop, 4\n{\n\tRow := A_Index\n\tloop, 4\n\t{\n\t\tCol := A_Index\n\t\tGui, add, button, % (Col=1 ? \"xs y+1\" : \"x+1 yp\") \" v\" Row \"_\" Col \" w\" Width \" gButton -TabStop\", % Grid[Row,Col] := Col + (Row-1)*4\u00a0; 1-16\n\t}\n}\nGuiControl, Hide, % Row \"_\" Col\t; 4_4\nGui, add, Button, % \"xs gShuffle w\" 4 * Width + 3, Shuffle\nGui, show,, 15 Puzzle\nreturn\n;------------------------------\nGuiClose:\nExitApp\nreturn\n;------------------------------\nShuffle:\nShuffle := true\nloop, 1000\n{\n\tRandom, Rnd, 1,4\n\tMove(StrSplit(Deltas[Rnd], \",\").1, StrSplit(Deltas[Rnd], \",\").2)\n}\nShuffle := false\nreturn\n;------------------------------\nButton:\nbuttonRow := SubStr(A_GuiControl, 1, 1), ButtonCol := SubStr(A_GuiControl, 3, 1)\nif Abs(buttonRow-Row) > 1 || Abs(ButtonCol-Col) > 1 || Abs(buttonRow-Row) = Abs(ButtonCol-Col)\n\treturn\nMove(buttonRow-Row, ButtonCol-Col)\nreturn\n;------------------------------\n#IfWinActive, 15 Puzzle\n;------------------------------\nDown::\nMove(-1, 0)\nreturn\n;------------------------------\nUp::\nMove(1, 0)\nreturn\n;------------------------------\nRight::\nMove(0, -1)\nreturn\n;------------------------------\nLeft::\nMove(0, 1)\nreturn\n;------------------------------\n#IfWinActive\n;------------------------------\nMove(deltaRow, deltaCol){\n\tglobal\n\tif (Row+deltaRow=0) || (Row+deltaRow=5) || (Col+deltaCol=0) || (Col+deltaCol=5)\n\t\treturn\n\tGuiControl, Hide, % Row+deltaRow \"_\" Col+deltaCol\n\tGuiControl, Show, % Row \"_\" Col\n\tGuiControl,, %Row%_%Col%, % Grid[Row+deltaRow, Col+deltaCol]\n\tGrid[Row, Col] := Grid[Row+deltaRow, Col+deltaCol]\n\tGrid[Row+=deltaRow, Col+=deltaCol] := 16\n\tif Shuffle\n\t\treturn\n\tgridCont := \"\"\n\tfor m, obj in grid\n\t\tfor n, val in obj\n\t\t\tgridCont .= val \",\"\n\tif (Trim(gridCont, \",\") = \"1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16\")\n\t\tMsgBox, 262208, 15 Puzzle, You solved 15 Puzzle\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_18.txt",
        "content": " 100  GOSUB 500INITIALIZE\n 110  FOR Q = 1 TO 1\n 120      IF I <> X  OR J <> Y THEN GOSUB 200MOVE\n 130      ON W GOSUB 330,450\n 140      LET I = K(0, K) + X\n 150      LET J = K(1, K) + Y\n 160      LET Q = K(2, K) OR W = 3\n 170  NEXT Q\n 180  VTAB T + 3\n 190  END\n\n REM MOVE\n 200  IF I < 0 THEN RETURN\n 210  IF I > 3 THEN RETURN\n 220  IF J < 0 THEN RETURN\n 230  IF J > 3 THEN RETURN\n 240  LET M = (I + J * 4) * 3\n 250  LET N = (X + Y * 4) * 3\n 260  IF N > M GOTO 290SWAP\n 270      LET N = M\n 280      LET M = (X + Y * 4) * 3\n REM SWAP\n 290  LET A$ = MID$(A$, 1, M) + MID$(A$, N + 1, 2) + MID$(A$,M + 3, N - M - 2) + MID$(A$, M + 1, 2) + MID$(A$, N + 3)\n 300  LET X = I\n 310  LET Y = J\n 320  ON W GOTO 440,400\n\n REM RANDOM MOVE\n 330  VTAB T + 3\n 340  HTAB 2\n 350  PRINT MID$(S$, S + 1, 10);\n 360  LET S = NOT S\n 370  LET K = INT(RND(1) * 4) + 1\n 380  IF PEEK(49152) < 128 OR A$ = W$ THEN RETURN\n 390  LET K = PEEK(49168) * 0\n REM SHOW\n 400  VTAB T\n 410  HTAB 1\n 420  PRINT A$;\n 430  LET W = (A$ = W$) + 2\n REM DON'T SHOW\n 440  RETURN\n\n REM GET KEY\n 450  VTAB T + Y\n 460  HTAB X * 3 + 2\n 470  GET K$\n 480  LET K =  ASC (K$)\n 490  RETURN\n\n REM INITIALIZE\n 500  PRINT \" 15-PUZZLE\"\n\n REM KEYBOARD\n\n REM ARROW KEYS  TWO HANDED  CLASSIC T  REVERSE T  SEQUENCED\n REM    ^K           A           I          G         ^C\n REM ^H ^J ^U     ,  Z  .     J  K  L    H  T  F   ^B ^D ^A\n\n REM RIGHT    ,  J      H   ^A\n 510  DATA8,44,74,106,72,104,1\n\n REM LEFT    .  L      F     ^B\n 520  DATA21,46,76,108,70,102,2\n\n REM DOWN    A     I      G     ^C\n 530  DATA11,65,97,73,105,71,103,3\n\n REM UP      Z      K      T     ^D\n 540  DATA10,90,122,75,107,84,116,4\n\n REM QUIT   ^Q ESC\n 550  DATA0,17,27,0\n \n 560  DIM K(2,127)\n 570  FOR V = 0 TO 2\n 580      FOR D =  - 1 TO 1 STEP 2\n 590          FOR R = 1 TO 1\n 600              READ K\n 610              LET K(V,K) = D\n 620              LET R = K < 5\n 630  NEXT R,D,V\n 640  LET A$ = \" 1  2  3  4\"\n 650  LET M$ =  CHR$ (13)\n 660  LET L$ = \" 5  6  7  8\"\n 670  LET A$ = A$ + M$ + L$\n 680  LET L$ = \" 9 10 11 12\"\n 690  LET A$ = A$ + M$ + L$\n 700  LET L$ = \"13 14 15   \"\n 710  LET A$ = A$ + M$ + L$\n 720  LET W$ = A$\n 730  DATA3,3,3,3,1,0\n 740  READ X,Y,I,J,W,k(2, 0)\n 750  PRINT \"PRESS A KEY\"\n 760  PRINT \" TO STOP\"\n 770  LET S$ = \" SHUFFLING \"\n 780  LET T = PEEK(37) - 2\n 790  RETURN\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_19.txt",
        "content": "10 REM 15-PUZZLE GAME\n20 REM COMMODORE BASIC 2.0\n30 REM ********************************\n40 GOSUB 400 : REM INTRO AND LEVEL\n50 GOSUB 510 : REM SETUP BOARD\n60 GOSUB 210 : REM PRINT PUZZLE\n70 PRINT \"TO MOVE A PIECE, ENTER ITS NUMBER:\"\n80 INPUT X\n90 GOSUB 760 : REM CHECK IF MOVE IS VALID\n100 IF MV=0 THEN PRINT \"WRONG MOVE\" : GOSUB 1130 : GOTO 60\n110 D(Z)=X : D(Y)=0\n120 GOSUB 210 : REM PRINT PUZZLE\n130 GOSUB 1030: REM CHECK IF PUZZLE COMPLETE\n140 IF PC THEN 160\n150 GOTO 70\n160 PRINT\"YOU WON!\"\n170 END\n180 REM\n190 REM *******************************\n200 REM PRINT/DRAW THE PUZZLE\n210 FOR P=1 TO 16\n220   IF D(P)=0 THEN D$(P)=\"     \" : GOTO 260\n230   S$=STR$(D(P))\n240   N=LEN(S$)\n250   D$(P) = LEFT$(\"   \",3-N)+S$+\"  \"\n260 NEXT\n270 PRINT \"+-----+-----+-----+-----+\"\n280 PRINT \"!\"D$(1)\"!\"D$(2)\"!\"D$(3)\"!\"D$(4)\"!\"\n290 PRINT \"+-----+-----+-----+-----+\"\n300 PRINT \"!\"D$(5)\"!\"D$(6)\"!\"D$(7)\"!\"D$(8)\"!\"\n310 PRINT \"+-----+-----+-----+-----+\"\n320 PRINT \"!\"D$(9)\"!\"D$(10)\"!\"D$(11)\"!\"D$(12)\"!\"\n330 PRINT \"+-----+-----+-----+-----+\"\n340 PRINT \"!\"D$(13)\"!\"D$(14)\"!\"D$(15)\"!\"D$(16)\"!\"\n350 PRINT \"+-----+-----+-----+-----+\"\n360 RETURN\n370 REM\n380 REM *******************************\n390 REM INTRO AND LEVEL OF DIFFICULTY\n400 PRINT CHR$(147)\n410 DIM SH(3) : SH(1)=10 : SH(2)=50 : SH(3)=100\n420 PRINT \"15 PUZZLE GAME FOR COMMODORE BASIC 2.0\" : PRINT : PRINT\n430 PRINT \"PLEASE ENTER LEVEL OF DIFFICULTY,\"\n440 PRINT \"1(EASY), 2(MEDIUM) OR 3(HARD):\";\n450 INPUT V\n460 IF V<1 OR V>3 THEN 440\n470 RETURN\n480 REM\n490 REM *******************************\n500 REM BUILD THE BOARD\n510 DIM D(16) : DIM D$(16) : REM BOARD PIECES\n520 REM SET PIECES IN CORRECT ORDER FIRST\n530 FOR P=1 TO 15\n540   D(P) = P\n550 NEXT\n560 D(16) = 0 : REM 0 = EMPTY PIECE/SLOT\n570 Z=16      : REM Z = EMPTY POSITION\n580 PRINT: PRINT \"SHUFFLING PIECES\";\n590 FOR N=1 TO SH(V)\n600   PRINT\".\";\n610   X = INT(RND(0)*4)+1\n620   IF X=1 THEN R=Z-4\n630   IF X=2 THEN R=Z+4\n640   IF (X=3) AND (INT((Z-1)/4)<>(Z-1)/4) THEN R=Z-1\n650   IF (X=4) AND (INT(Z/4)<>Z/4) THEN R=Z+1\n660   IF R<1 OR R>16 THEN 610\n670   D(Z)=D(R)\n680   Z=R\n690   D(Z)=0\n700 NEXT\n710 PRINT CHR$(147)\n720 RETURN\n730 REM\n740 REM *******************************\n750 REM CHECK IF MOVE IS VALID\n760 MV = 0\n770 IF X<1 OR X>15 THEN RETURN\n780 REM FIND POSITION OF PIECE X AND OF EMPTY PIECE\n790 AX=X\n800 GOSUB 940 : REM FIND POSITION OF PIECE AX\n810 Y=P\n820 AX=0\n830 GOSUB 940 : REM FIND POSITION OF PIECE AX\n840 Z=P\n850 REM CHECK IF EMPTY PIECE IS ABOVE, BELOW, LEFT OR RIGHT TO PIECE X\n860 IF Y-4=Z THEN MV=1 : RETURN\n870 IF Y+4=Z THEN MV=1 : RETURN\n880 IF (Y-1=Z) AND (INT(Z/4)<>Z/4) THEN MV=1 : RETURN\n890 IF (Y+1=Z) AND (INT(Y/4)<>Y/4) THEN MV=1 : RETURN\n900 RETURN\n910 REM\n920 REM *******************************\n930 REM FIND POSITION OF PIECE AX\n940 P=1\n950 IF D(P)=AX THEN 990\n960   P=P+1\n970   IF P>16 THEN PRINT \"UH OH!\" : STOP\n980 GOTO 950\n990 RETURN\n1000 REM\n1010 REM *******************************\n1020 REM CHECK IF PUZZLE IS COMPLETE / GAME OVER\n1030 PC = 0\n1040 P=1\n1050 IF (P>=16) OR (D(P)<>P) THEN 1080\n1060   P=P+1\n1070 GOTO 1050\n1080 IF P=16 THEN PC=1\n1090 RETURN\n1100 REM\n1110 REM ******************************\n1120 REM A SMALL DELAY\n1130 FOR T=0 TO 400\n1140 NEXT\n1150 RETURN\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_2.txt",
        "content": ";15 PUZZLE GAME\n;Ram Variables\nCursor_X equ $00FF0000\t\t;Ram for Cursor Xpos\nCursor_Y equ $00FF0000+1\t;Ram for Cursor Ypos\njoypad1 equ $00FF0002\n\nGameRam equ $00FF1000\t\t;Ram for where the pieces are\nGameRam_End equ $00FF100F\t;the last valid slot in the array\n;Video Ports\nVDP_data\tEQU\t$C00000\t; VDP data, R/W word or longword access only\nVDP_ctrl\tEQU\t$C00004\t; VDP control, word or longword writes only\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n; \t\t\t\t\tVECTOR TABLE\n;org $00000000\n\tDC.L\t$00FFFFFE\t\t;SP register value\n\tDC.L\tProgramStart\t;Start of Program Code\n\tDC.L\tIntReturn\t\t; bus err\n\tDC.L\tIntReturn\t\t; addr err\n\tDC.L\tIntReturn\t\t; illegal inst\n\tDC.L\tIntReturn\t\t; divzero\n\tDC.L\tIntReturn\t\t; CHK\n\tDC.L\tIntReturn\t\t; TRAPV\n\tDC.L\tIntReturn\t\t; privilege viol\n\tDC.L\tIntReturn\t\t; TRACE\n\tDC.L\tIntReturn\t\t; Line A (1010) emulator\n\tDC.L\tIntReturn\t\t; Line F (1111) emulator\n\tDC.L\tIntReturn,IntReturn,IntReturn,IntReturn\t\t; Reserved /Coprocessor/Format err/ Uninit Interrupt\n\tDC.L\tIntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn\n\tDC.L\tIntReturn\t\t; spurious interrupt\n\tDC.L\tIntReturn\t\t; IRQ level 1\n\tDC.L\tIntReturn\t\t; IRQ level 2 EXT\n\tDC.L\tIntReturn\t\t; IRQ level 3\n\tDC.L\tIntReturn\t\t; IRQ level 4 Hsync\n\tDC.L\tIntReturn\t\t; IRQ level 5\n\tDC.L\tIntReturn\t\t; IRQ level 6 Vsync\n\tDC.L\tIntReturn\t\t; IRQ level 7 (NMI)\n;org $00000080\n;TRAPS\n\tDC.L\tIntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn\n\tDC.L\tIntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn\n;org $000000C0\n;FP/MMU\n\tDC.L\tIntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn\n\tDC.L\tIntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn,IntReturn\n\n\t\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;\t\t\t\t\tHeader\nHEADER:\n\tDC.B\t\"SEGA GENESIS    \"\t        ;System Name\tMUST TAKE UP 16 BYTES, USE PADDING IF NECESSARY\n\tDC.B\t\"(C)PDS  \"\t\t\t;Copyright\tMUST TAKE UP 8 BYTES, USE PADDING IF NECESSARY\n \tDC.B\t\"2022.JUN\"\t\t\t;Date\t\tMUST TAKE UP 8 BYTES, USE PADDING IF NECESSARY\nCARTNAME:\n\tDC.B \t\"15 PUZZLE\"\nCARTNAME_END:\n\tDS.B 48-(CARTNAME_END-CARTNAME)\t;ENSURES PROPER SPACING\nCARTNAMEALT:\n\tDC.B\t\"15 PUZZLE\"\nCARTNAMEALT_END:\n\tDS.B 48-(CARTNAMEALT_END-CARTNAMEALT)\t;ENSURES PROPER SPACING\ngameID:\n\tDC.B\t\"GM PUPPY001-00\"\t        ;TT NNNNNNNN-RR T=Type (GM=Game) N=game Num  R=Revision\n\tDC.W\t$0000\t\t\t\t;16-bit Checksum (Address $000200+)\nCTRLDATA:\n\tDC.B\t\"J               \"\t        ;Control Data (J=3button K=Keyboard 6=6button C=cdrom) \n                                                ;(MUST TAKE UP 16 BYTES, USE PADDING IF NECESSARY)\nROMSTART:\n\tDC.L\t$00000000\t\t\t;ROM Start\nROMLEN:\n\tDC.L\t$003FFFFF\t\t\t;ROM Length\nRAMSTART:\n\tDC.L\t$00FF0000\nRAMEND:\n\tDC.L\t$00FFFFFF\t;RAM start/end (fixed)\n\n\tDC.B\t\"            \"\t\t;External RAM Data\t(MUST TAKE UP 12 BYTES, USE PADDING IF NECESSARY)\n\tDC.B\t\"            \"\t\t;Modem Data\t\t(MUST TAKE UP 12 BYTES, USE PADDING IF NECESSARY)\nMEMO:\n\tDC.B\t\"                                        \"      ;(MUST TAKE UP 40 BYTES, USE PADDING IF NECESSARY)\nREGION:\n\tDC.B\t\"JUE             \"\t;Regions Allowed        (MUST TAKE UP 16 BYTES, USE PADDING IF NECESSARY)\n\teven\nHEADER_END:\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;\t\t\t\t\tGeneric Interrupt Handler\nIntReturn:\n\trte                            ;immediately return to game\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;\t\t\t\t\tProgram Start\nProgramStart:\n\t;initialize TMSS (TradeMark Security System)\n\tmove.b ($A10001),D0\t\t;A10001 test the hardware version\n\tand.b #$0F,D0\n\tbeq\tNoTmss\t\t\t\t;branch if no TMSS chip\n\tmove.l #'SEGA',($A14000);A14000 disable TMSS \nNoTmss:\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;\t\t\t\t\tSet Up Graphics\n\n\tlea VDPSettings,A5\t\t      ;Initialize Screen Registers\n\tmove.l #VDPSettingsEnd-VDPSettings,D1 ;length of Settings\n\t\n\tmove.w (VDP_ctrl),D0\t              ;C00004 read VDP status (interrupt acknowledge?)\n\tmove.l #$00008000,d5\t              ;VDP Reg command (%8rvv)\n\t\nNextInitByte:\n\tmove.b (A5)+,D5\t\t\t      ;get next video control byte\n\tmove.w D5,(VDP_ctrl)\t              ;C00004 send write register command to VDP\n\t\t;   8RVV - R=Reg V=Value\n\tadd.w #$0100,D5\t\t\t      ;point to next VDP register\n\tdbra D1,NextInitByte\t              ;loop for rest of block\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;       Set up palette\n\t\n\t;Define palette\n\tmove.l #$C0000000,d0\t;Color 0 (background)\n\tmove.l d0,VDP_Ctrl\n\t;        ----BBB-GGG-RRR-\n\tmove.w #%0000011000000000,VDP_data\n\t\n\tmove.l #$C01E0000,d0\t;Color 15 (Font)\n\tmove.l d0,VDP_Ctrl\n\tmove.w #%0000000011101110,VDP_data\n\t\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;\t\t\t\t\tSet up Font\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n; FONT IS 1BPP, THIS ROUTINE CONVERTS IT TO A 4BPP FORMAT.\n\tlea Font,A1\t\t\t\t\t ;Font Address in ROM\n\tmove.l #Font_End-Font,d6\t                 ;Our font contains 96 letters 8 lines each\n\t\n\tmove.l #$40000000,(VDP_Ctrl);Start writes to VRAM address $0000\nNextFont:\n\tmove.b (A1)+,d0\t\t;Get byte from font\n\tmoveq.l #7,d5\t\t;Bit Count (8 bits)\n\tclr.l d1\t\t;Reset BuildUp Byte\n\t\nFont_NextBit:\t\t\t;1 color per nibble = 4 bytes\n\n\trol.l #3,d1\t\t;Shift BuildUp 3 bits left\n\troxl.b #1,d0\t\t;Shift a Bit from the 1bpp font into the Pattern\n\troxl.l #1,d1\t\t;Shift bit into BuildUp\n\tdbra D5,Font_NextBit    ;Next Bit from Font\n\t\n\tmove.l d1,d0\t\t; Make fontfrom Color 1 to color 15\n\trol.l #1,d1\t\t;Bit 1\n\tor.l d0,d1\n\trol.l #1,d1\t\t;Bit 2\n\tor.l d0,d1\n\trol.l #1,d1\t\t;Bit 3\n\tor.l d0,d1\n\t\n\tmove.l d1,(VDP_Data);Write next Long of char (one line) to VDP\n\tdbra d6,NextFont\t;Loop until done\n\n\t\n\n\tclr.b Cursor_X\t\t;Clear Cursor XY\n\tclr.b Cursor_Y\n\t\n\t;Turn on screen\n\tmove.w\t#$8144,(VDP_Ctrl);C00004 reg 1 = 0x44 unblank display\n\t\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n; all of the above was just the prep work to boot the Sega Genesis, and had nothing to do with a 15 Puzzle.\n; That's hardware for you!\n\n\tLEA GameRam,A0        \n        ;load the initial state of the puzzle. There is no randomization here unfortunately, as creating a sufficient pseudo-RNG\n        ;to make the game \"believable\" is more difficult than programming the game itself!\n        ;so instead we'll start in such a manner that the player has to do quite a bit of work to win.\n\tMOVE.B #'F',(A0)+\n\tMOVE.B #'E',(A0)+\n\tMOVE.B #'D',(A0)+\n\tMOVE.B #'C',(A0)+\n\tMOVE.B #'B',(A0)+\n\tMOVE.B #'A',(A0)+\n\tMOVE.B #'9',(A0)+\n\tMOVE.B #'8',(A0)+\n\tMOVE.B #'7',(A0)+\n\tMOVE.B #'6',(A0)+\n\tMOVE.B #'5',(A0)+\n\tMOVE.B #'4',(A0)+\n\tMOVE.B #'3',(A0)+\n\tMOVE.B #'2',(A0)+\n\tMOVE.B #'1',(A0)+\n\tMOVE.B #' ',(A0)+\n\n       ;puzzle will look like:\n       ;FEDC\n       ;BA98\n       ;7654\n       ;321 \n\nmain:\n\tJSR Player_ReadControlsDual     ;get controller input\n\tmove.w d0,(joypad1)\n\n\n\t;adjust the number of these as you see fit.\n\t;this affects the game's overall speed.\n\tJSR waitVBlank\n\tJSR waitVBlank\n\tJSR waitVBlank\n\tJSR waitVBlank\n\tJSR waitVBlank\n\tJSR waitVBlank\n\tJSR waitVBlank\n\tJSR waitVBlank\n\tJSR waitVBlank\n\tJSR waitVBlank\n\n        ;find where the blank space is among GameRAM\n\tLEA GameRAM,a0\n\tMOVE.B #' ',D0\n\tJSR REPNE_SCASB\n\tMOVE.L A0,A1\t\n\t\n;;;;;;;;;;;;;;;;;;; check controller presses\nJOYPAD_BITFLAG_M equ 2048\nJOYPAD_BITFLAG_Z equ 1024\nJOYPAD_BITFLAG_Y equ 512\nJOYPAD_BITFLAG_X equ 256\nJOYPAD_BITFLAG_S equ 128\nJOYPAD_BITFLAG_C equ 64\nJOYPAD_BITFLAG_B equ 32\nJOYPAD_BITFLAG_A equ 16\nJOYPAD_BITFLAG_R equ 8\nJOYPAD_BITFLAG_L equ 4\nJOYPAD_BITFLAG_D equ 2\nJOYPAD_BITFLAG_U equ 1\n\nJOYPAD_BITNUM_M equ 11\nJOYPAD_BITNUM_Z equ 10\nJOYPAD_BITNUM_Y equ 9\nJOYPAD_BITNUM_X equ 8\nJOYPAD_BITNUM_S equ 7\nJOYPAD_BITNUM_C equ 6\nJOYPAD_BITNUM_B equ 5\nJOYPAD_BITNUM_A equ 4\nJOYPAD_BITNUM_R equ 3\nJOYPAD_BITNUM_L equ 2\nJOYPAD_BITNUM_D equ 1\nJOYPAD_BITNUM_U equ 0\n\n\n\n\n\tmove.w (joypad1),D0\n\n\tBTST #JOYPAD_BITNUM_U,D0\n\tBNE JoyNotUp\n\t\tMOVEM.L D0/A1,-(SP)\n\t\t\tADDA.L #4,A1\n\t\t\tCMPA.L #GameRam_End,A1\n\t\t\tBHI .doNothing\n\t\t\t;OTHERWISE SWAP THE EMPTY SPACE WITH THE BYTE BELOW IT.\n\t\t\t\tMOVE.B (A1),D7\n\t\t\t\tMOVE.B (A0),(A1)\n\t\t\t\tMOVE.B D7,(A0)\t\n.doNothing\n\t\tMOVEM.L (SP)+,D0/A1\n\t\tbra vdraw\t\nJoyNotUp:\n\tBTST #JOYPAD_BITNUM_D,D0\n\tBNE JoyNotDown\n\t\tMOVEM.L D0/A1,-(SP)\n\n\t\t\tSUBA.L #4,A1\t\t;CHECK ONE ROW ABOVE WHERE WE ARE\n\t\t\tCMPA.L #GameRam,A1\n\t\t\tBCS .doNothing\t\t;if A1-4 IS BELOW THE START OF GAME RAM, DON'T MOVE\n\t\t\t;OTHERWISE SWAP THE EMPTY SPACE WITH THE BYTE ABOVE IT.\n\t\t\t\tMOVE.B (A1),D7\n\t\t\t\tMOVE.B (A0),(A1)\n\t\t\t\tMOVE.B D7,(A0)\t\t\t\t\n.doNothing:\n\t\tMOVEM.L (SP)+,D0/A1\n\t\tbra vdraw\nJoyNotDown:\n\tBTST #JOYPAD_BITNUM_L,D0\n\tBNE JoyNotLeft\n\t\tMOVEM.L D0/A1,-(SP)\n\t\t\tADDA.L #1,A1\n\t\t\tMOVE.L A1,D4\n\t\t\tMOVE.L A0,D3\n\t\t\tAND.L #3,D4\n\t\t\tAND.L #3,D3\n\t\t\tCMP.L D3,D4\t\n\t\t\tBCS .doNothing\n\t\t\t;OTHERWISE SWAP THE EMPTY SPACE WITH THE BYTE TO THE LEFT\n\t\t\t\tMOVE.B (A1),D7\n\t\t\t\tMOVE.B (A0),(A1)\n\t\t\t\tMOVE.B D7,(A0)\t\t\t\t\n.doNothing:\n\t\tMOVEM.L (SP)+,D0/A1\n\t\tbra vdraw\nJoyNotLeft:\n\tBTST #JOYPAD_BITNUM_R,D0\n\tBNE JoyNotRight\n\t\tMOVEM.L D0/A1,-(SP)\n\t\t\tSUBA.L #1,A1\n\t\t\tMOVE.L A1,D4\n\t\t\tMOVE.L A0,D3\n\t\t\tAND.L #3,D4\n\t\t\tAND.L #3,D3\n\t\t\tCMP.L D3,D4\t\n\t\t\tBHI .doNothing\n\t\t\t;OTHERWISE SWAP THE EMPTY SPACE WITH THE BYTE TO THE RIGHT\n\t\t\t\tMOVE.B (A1),D7\n\t\t\t\tMOVE.B (A0),(A1)\n\t\t\t\tMOVE.B D7,(A0)\t\t\t\t\n.doNothing:\n\t\tMOVEM.L (SP)+,D0/A1\n\t\tbra vdraw\nJoyNotRight:\n\nvdraw:\n\t;this actually draws the current state of the puzzle to the screen.\n\tLEA GameRam,A0\n\tCLR.B (Cursor_X)   ;reset text cursors to top left of screen\n\tCLR.B (Cursor_Y)\n\t\n;draw the puzzle\n\n;anything insize a REPT N...ENDR block is in-lined N times, back to back.\n       rept 4\n\n\t      MOVE.B (A0)+,D0      \n\t      JSR PrintChar\n\n\t      MOVE.B (A0)+,D0\n\t      JSR PrintChar\n\n\t      MOVE.B (A0)+,D0\n\t      JSR PrintChar\n\n\t      MOVE.B (A0)+,D0\n\t      JSR PrintChar         ;we just finished drawing one row of the puzzle. Now, begin a new line and continue drawing.\n\n              jsr newline\n       endr\n\t\n\t\ncheckIfWin:\n\t;YES THIS IS MESSY, I TRIED IT WITH A LOOP BUT IT WOULDN'T WORK SO I JUST UNROLLED THE LOOP.\n\tLEA GameRam,a4\n\tMOVE.B (A4)+,D5\n\tCMP.B #'1',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'2',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'3',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'4',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'5',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'6',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'7',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'8',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'9',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'A',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'B',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'C',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'D',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'E',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #'F',D5\n\tBNE .keepGoing\n\n\tMOVE.B (A4)+,D5\n\tCMP.B #' ',D5\n\tBNE .keepGoing\n\t\n\tclr.b (Cursor_X)\n\tmove.b #7,(Cursor_Y)\n\tLEA victoryMessage,a3\n\tjsr PrintString\n\tjmp *  ;game freezes after you win.\n\n.keepGoing:\n;it's unlikely that the label \"main\" is in range of here so I didn't bother checking and just assumed it was out of range.\n;Otherwise I would have said \"BEQ main\" instead of BNE .keepGoing\n\tjmp main\n\t\t\n\nVictoryMessage:\n\tDC.B \"A WINNER IS YOU\",255\n\tEVEN\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\nREPNE_SCASB:\n\t;INPUT: \n\t;A0 = POINTER TO START OF MEMORY\n\t;D0 = THE BYTE TO SEARCH FOR\n\t;OUTPUT = A0 POINTS TO THE BYTE THAT CONTAINED D0\n\tMOVE.B (A0),D1\n\tCMP.B D0,D1\n\tBEQ .done\n\tADDA.L #1,A0\n\tBRA REPNE_SCASB\n.done:\n\tRTS\n\t\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n\n\nPlayer_ReadControlsDual:\n\t\n\tmove.b #%01000000,($A1000B)\t; Set direction IOIIIIII (I=In O=Out)\n\tmove.l #$A10003,a0\t\t;RW port for player 1\n\n\tmove.b  #$40,(a0)\t; TH = 1\n\tnop\t\t;Delay\n\tnop\n\tmove.b  (a0),d2\t\t; d0.b = --CBRLDU\tStore in D2\n\t\n\tmove.b\t#$0,(a0)\t; TH = 0\n\tnop\t\t;Delay\n\tnop\n\tmove.b\t(a0),d1\t\t; d1.b = --SA--DU\tStore in D1\n\t\n\tmove.b  #$40,(a0)\t; TH = 1\n\tnop\t\t;Delay\n\tnop\n\tmove.b\t#$0,(a0)\t; TH = 0\n\tnop\t\t;Delay\n\tnop\n\tmove.b  #$40,(a0)\t; TH = 1\n\tnop\t\t;Delay\n\tnop\n\tmove.b\t(a0),d3\t\t; d1.b = --CBXYZM\tStore in D3\n\tmove.b\t#$0,(a0)\t; TH = 0\n\t\n\tclr.l d0\t\t\t;Clear buildup byte\n\troxr.b d2\n\troxr.b d0\t\t\t;U\n\troxr.b d2\n\troxr.b d0\t\t\t;D\n\troxr.b d2\n\troxr.b d0\t\t\t;L\n\troxr.b d2\n\troxr.b d0\t\t\t;R\n\troxr.b #5,d1\n\troxr.b d0\t\t\t;A\n\troxr.b d2\n\troxr.b d0\t\t\t;B\n\troxr.b d2\n\troxr.b d0\t\t\t;C\n\troxr.b d1\n\troxr.b d0\t\t\t;S\n\t\n\tmove.l d3,d1\n\troxl.l #7,d1\t\t;XYZ\n\tand.l #%0000011100000000,d1\n\tor.l d1,d0\t\t\t\n\t\n\tmove.l d3,d1\n\troxl.l #8,d1\t\t;M\n\troxl.l #3,d1\t\t\n\tand.l #%0000100000000000,d1\n\tor.l d1,d0\n\t\n\tor.l #$FFFFF000,d0\t;Set unused bits to 1\n\n\t\n\t\n\t;this returns player 1's buttons into D0 as the following:\n\t;----MZYXSCBARLDU\n\trts\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\nwaitVBlank:\t\t\t\t\t\t\t;Bit 3 defines if we're in Vblank\n\tMOVE.L d0,-(sp)\n.wait:\n\t\tmove.w VDP_ctrl,d0\n\t\tand.w #%0000000000001000,d0\t\t;See if vblank is running\n\t\tbne .wait\t\t\t\t\t;wait until it is\n\t\t\nwaitVBlank2:\n\t\tmove.w VDP_ctrl,d0\n\t\tand.w #%0000000000001000,d0\t\t;See if vblank is running\n\t\tbeq waitVBlank2\t\t\t\t\t;wait until it isnt\n\tMOVE.L (SP)+,d0\n\trts\t\t\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\t\nPrintChar:\t\t\t\t;Show D0 to screen\n\tmoveM.l d0-d7/a0-a7,-(sp)\n\t\tand.l #$FF,d0\t\t\t;Keep only 1 byte\n\t\tsub #32,d0\t\t\t\t;No Characters in our font below 32\nPrintCharAlt:\t\t\n\t\tMove.L  #$40000003,d5\t;top 4=write, bottom $3=Cxxx range\n\t\tclr.l d4\t\t\t\t\t;Tilemap at $C000+\n\n\t\tMove.B (Cursor_Y),D4\t\n\t\trol.L #8,D4\t\t\t\t;move $-FFF to $-FFF----\n\t\trol.L #8,D4\n\t\trol.L #7,D4\t\t\t\t;2 bytes per tile * 64 tiles per line\n\t\tadd.L D4,D5\t\t\t\t;add $4------3\n\t\t\n\t\tMove.B (Cursor_X),D4\n\t\trol.L #8,D4\t\t\t\t;move $-FFF to $-FFF----\n\t\trol.L #8,D4\n\t\trol.L #1,D4\t\t\t\t;2 bytes per tile\n\t\tadd.L D4,D5\t\t\t\t;add $4------3\n\t\t\n\t\tMOVE.L\tD5,(VDP_ctrl)\t; C00004 write next character to VDP\n\t\tMOVE.W\tD0,(VDP_data)\t; C00000 store next word of name data\n\n\t\taddq.b #1,(Cursor_X)\t;INC Xpos\n\t\tmove.b (Cursor_X),d0\n\t\tcmp.b #39,d0\n\t\tbls nextpixel_Xok\n\t\tjsr NewLine\t\t\t;If we're at end of line, start newline\nnextpixel_Xok:\n\tmoveM.l (sp)+,d0-d7/a0-a7\n\trts\n\t\nPrintString:\n\t\tmove.b (a3)+,d0\t\t\t;Read a character in from A3\n\t\tcmp.b #255,d0\n\t\tbeq PrintString_Done\t;return on 255\n\t\tjsr PrintChar\t\t\t;Print the Character\n\t\tbra PrintString\nPrintString_Done:\t\t\n\trts\n\t\nNewLine:\n\taddq.b #1,(Cursor_Y)\t\t;INC Y\n\tclr.b (Cursor_X)\t\t\t;Zero X\n\trts\t\n\t\nFont:\t\t\t\t\t\t\t\n;1bpp font - 8x8 96 characters\n;looks just like your typical \"8-bit\" font. You'll just have to take my word for it.\n     DC.B $00,$00,$00,$00,$00,$00,$00,$00,$18,$3c,$3c,$18,$18,$00,$18,$18\n     DC.B $36,$36,$12,$24,$00,$00,$00,$00,$00,$12,$7f,$24,$24,$fe,$48,$00\n     DC.B $00,$04,$1e,$28,$1c,$0a,$3c,$10,$00,$62,$64,$08,$10,$26,$46,$00\n     DC.B $00,$18,$24,$20,$12,$2c,$44,$3a,$18,$18,$08,$10,$00,$00,$00,$00\n     DC.B $08,$10,$20,$20,$20,$20,$10,$08,$10,$08,$04,$04,$04,$04,$08,$10\n     DC.B $00,$10,$38,$10,$28,$00,$00,$00,$00,$00,$10,$10,$7c,$10,$10,$00\n     DC.B $00,$00,$00,$00,$0c,$0c,$04,$08,$00,$00,$00,$00,$7e,$00,$00,$00\n     DC.B $00,$00,$00,$00,$00,$18,$18,$00,$01,$02,$04,$08,$10,$20,$40,$00\n     DC.B $1c,$26,$63,$63,$63,$32,$1c,$00,$0c,$1c,$0c,$0c,$0c,$0c,$3f,$00\n     DC.B $3e,$63,$07,$1e,$3c,$70,$7f,$00,$3f,$06,$0c,$1e,$03,$63,$3e,$00\n     DC.B $0e,$1e,$36,$66,$7f,$06,$06,$00,$7e,$60,$7e,$03,$03,$63,$3e,$00\n     DC.B $1e,$30,$60,$7e,$63,$63,$3e,$00,$7f,$63,$06,$0c,$18,$18,$18,$00\n     DC.B $3c,$62,$72,$3c,$4f,$43,$3e,$00,$3e,$63,$63,$3f,$03,$06,$3c,$00\n     DC.B $00,$18,$18,$00,$18,$18,$00,$00,$00,$0c,$0c,$00,$0c,$0c,$04,$08\n     DC.B $00,$00,$06,$18,$60,$18,$06,$00,$00,$00,$00,$7e,$00,$7e,$00,$00\n     DC.B $00,$00,$60,$18,$06,$18,$60,$00,$1c,$36,$36,$06,$0c,$00,$0c,$0c\n     DC.B $3c,$42,$99,$a1,$a1,$99,$42,$3c,$1c,$36,$63,$63,$7f,$63,$63,$00\n     DC.B $7e,$63,$63,$7e,$63,$63,$7e,$00,$1e,$33,$60,$60,$60,$33,$1e,$00\n     DC.B $7c,$66,$63,$63,$63,$66,$7c,$00,$3f,$30,$30,$3e,$30,$30,$3f,$00\n     DC.B $7f,$60,$60,$7e,$60,$60,$60,$00,$1f,$30,$60,$67,$63,$33,$1f,$00\n     DC.B $63,$63,$63,$7f,$63,$63,$63,$00,$3f,$0c,$0c,$0c,$0c,$0c,$3f,$00\n     DC.B $03,$03,$03,$03,$03,$63,$3e,$00,$63,$66,$6c,$78,$7c,$6e,$67,$00\n     DC.B $30,$30,$30,$30,$30,$30,$3f,$00,$63,$77,$7f,$7f,$6b,$63,$63,$00\n     DC.B $63,$73,$7b,$7f,$6f,$67,$63,$00,$3e,$63,$63,$63,$63,$63,$3e,$00\n     DC.B $7e,$63,$63,$63,$7e,$60,$60,$00,$3e,$63,$63,$63,$6f,$66,$3d,$00\n     DC.B $7e,$63,$63,$67,$7c,$6e,$67,$00,$3c,$66,$60,$3e,$03,$63,$3e,$00\n     DC.B $3f,$0c,$0c,$0c,$0c,$0c,$0c,$00,$63,$63,$63,$63,$63,$63,$3e,$00\n     DC.B $63,$63,$63,$77,$3e,$1c,$08,$00,$63,$63,$6b,$7f,$7f,$77,$63,$00\n     DC.B $63,$77,$3e,$1c,$3e,$77,$63,$00,$33,$33,$33,$1e,$0c,$0c,$0c,$00\n     DC.B $7f,$07,$0e,$1c,$38,$70,$7f,$00,$00,$38,$20,$20,$20,$20,$38,$00\n     DC.B $80,$40,$20,$10,$08,$04,$02,$00,$00,$1c,$04,$04,$04,$04,$1c,$00\n     DC.B $10,$28,$44,$00,$00,$00,$00,$00,$00,$00,$00,$00,$00,$00,$7e,$00\n     DC.B $00,$20,$10,$00,$00,$00,$00,$00,$00,$18,$04,$1c,$24,$2c,$1c,$00\n     DC.B $00,$20,$20,$38,$24,$24,$38,$00,$00,$00,$1c,$20,$20,$20,$1c,$00\n     DC.B $00,$04,$04,$1c,$24,$24,$1c,$00,$00,$00,$1c,$24,$3c,$20,$1c,$00\n     DC.B $00,$18,$24,$20,$30,$20,$20,$00,$00,$1c,$24,$24,$1c,$04,$3c,$00\n     DC.B $00,$20,$20,$38,$24,$24,$24,$00,$00,$10,$00,$10,$10,$10,$10,$00\n     DC.B $08,$00,$08,$08,$08,$08,$28,$10,$20,$20,$24,$28,$30,$28,$24,$00\n     DC.B $10,$10,$10,$10,$10,$10,$18,$00,$00,$00,$40,$68,$54,$54,$54,$00\n     DC.B $00,$00,$28,$34,$24,$24,$24,$00,$00,$00,$1c,$22,$22,$22,$1c,$00\n     DC.B $00,$00,$38,$24,$24,$38,$20,$20,$00,$00,$1c,$24,$24,$1c,$04,$04\n     DC.B $00,$00,$2c,$30,$20,$20,$20,$00,$00,$00,$1c,$20,$1c,$02,$3c,$00\n     DC.B $00,$10,$3c,$10,$10,$14,$08,$00,$00,$00,$24,$24,$24,$24,$1a,$00\n     DC.B $00,$00,$24,$24,$24,$14,$18,$00,$00,$00,$92,$92,$92,$5a,$6c,$00\n     DC.B $00,$00,$22,$14,$08,$14,$22,$00,$00,$00,$24,$24,$1c,$04,$18,$00\n     DC.B $00,$00,$3c,$04,$18,$20,$3c,$00,$00,$08,$10,$10,$20,$10,$10,$08\n     DC.B $18,$18,$18,$18,$18,$18,$18,$18,$00,$10,$08,$08,$04,$08,$08,$10\n     DC.B $00,$00,$00,$30,$4a,$04,$00,$00,$1c,$7f,$00,$7f,$55,$55,$55,$00\nFont_End:\n\nVDPSettings:\n\tDC.B $04 ; 0 mode register 1\t\t\t\t\t\t\t\t\t\t\t---H-1M-\n\tDC.B $04 ; 1 mode register 2\t\t\t\t\t\t\t\t\t\t\t-DVdP---\n\tDC.B $30 ; 2 name table base for scroll A (A=top 3 bits)\t\t\t\t--AAA--- = $C000\n\tDC.B $3C ; 3 name table base for window (A=top 4 bits / 5 in H40 Mode)\t--AAAAA- = $F000\n\tDC.B $07 ; 4 name table base for scroll B (A=top 3 bits)\t\t\t\t-----AAA = $E000\n\tDC.B $6C ; 5 sprite attribute table base (A=top 7 bits / 6 in H40)\t\t-AAAAAAA = $D800\n\tDC.B $00 ; 6 unused register\t\t\t\t\t\t\t\t\t\t\t--------\n\tDC.B $00 ; 7 background color (P=Palette C=Color)\t\t\t\t\t\t--PPCCCC\n\tDC.B $00 ; 8 unused register\t\t\t\t\t\t\t\t\t\t\t--------\n\tDC.B $00 ; 9 unused register\t\t\t\t\t\t\t\t\t\t\t--------\n\tDC.B $FF ;10 H interrupt register (L=Number of lines)\t\t\t\t\tLLLLLLLL\n\tDC.B $00 ;11 mode register 3\t\t\t\t\t\t\t\t\t\t\t----IVHL\n\tDC.B $81 ;12 mode register 4 (C bits both1 = H40 Cell)\t\t\t\t\tC---SIIC\n\tDC.B $37 ;13 H scroll table base (A=Top 6 bits)\t\t\t\t\t\t\t--AAAAAA = $FC00\n\tDC.B $00 ;14 unused register\t\t\t\t\t\t\t\t\t\t\t--------\n\tDC.B $02 ;15 auto increment (After each Read/Write)\t\t\t\t\t\tNNNNNNNN\n\tDC.B $01 ;16 scroll size (Horiz & Vert size of ScrollA & B)\t\t\t\t--VV--HH = 64x32 tiles\n\tDC.B $00 ;17 window H position (D=Direction C=Cells)\t\t\t\t\tD--CCCCC\n\tDC.B $00 ;18 window V position (D=Direction C=Cells)\t\t\t\t\tD--CCCCC\n\tDC.B $FF ;19 DMA length count low\t\t\t\t\t\t\t\t\t\tLLLLLLLL\n\tDC.B $FF ;20 DMA length count high\t\t\t\t\t\t\t\t\t\tHHHHHHHH\n\tDC.B $00 ;21 DMA source address low\t\t\t\t\t\t\t\t\t\tLLLLLLLL\n\tDC.B $00 ;22 DMA source address mid\t\t\t\t\t\t\t\t\t\tMMMMMMMM\n\tDC.B $80 ;23 DMA source address high (C=CMD)\t\t\t\t\t\t\tCCHHHHHH\nVDPSettingsEnd:\n\teven\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_20.txt",
        "content": "      IF INKEY(-256)=77 OR (INKEY(-256) AND &F0)=&A0 THEN MODE 1: COLOUR 0: COLOUR 143: *FX4,1\n\n      SIZE=4 : DIFFICULTY=3\n\n      MAX=SIZE * SIZE - 1\n      DIM Board(MAX)\n      FOR I%=1 TO MAX : Board(I% - 1)=I% : NEXT\n      Gap=MAX\n      WHILE N% < DIFFICULTY ^ 2 PROCSlide(RND(4)) : ENDWHILE : REM Shuffle\n      N%=0\n\n      @%=2 + LOG(MAX + 1)\n      PROCShowAndTest\n      WHILE NOT Solved\n        PRINT \"Use arrow keys to move the gap around. Moves taken: \";N%\n        PROCSlide(GET - 135)\n        PROCShowAndTest\n      ENDWHILE\n      PRINT \"Solved after \";N% LEFT$(\" moves\", 6 + (N% = 1)) \".\"\n      END\n\n      DEF PROCSlide(dir%)\n      NewGap=Gap\n      CASE dir% OF\n        WHEN 1: IF Gap MOD SIZE > 0        NewGap=Gap - 1    : N%+=1 : REM Left\n        WHEN 2: IF Gap MOD SIZE < SIZE - 1 NewGap=Gap + 1    : N%+=1 : REM Right\n        WHEN 3: IF Gap < MAX - SIZE + 1    NewGap=Gap + SIZE : N%+=1 : REM Down\n        WHEN 4: IF Gap > SIZE - 1          NewGap=Gap - SIZE : N%+=1 : REM Up\n      ENDCASE\n      SWAP Board(Gap), Board(NewGap)\n      Gap=NewGap\n      ENDPROC\n\n      DEF PROCShowAndTest\n      CLS\n      Solved=TRUE\n      FOR I%=0 TO MAX\n        COLOUR 12 : COLOUR 135\n        IF I% = Gap COLOUR 1 : COLOUR 129\n        IF I% MOD SIZE = SIZE - 1 PRINT Board(I%) ELSE PRINT Board(I%),;\n        IF Solved IF I% < MAX - 1 IF Board(I%) > Board(I% + 1) OR I% = Gap Solved=FALSE\n      NEXT\n      COLOUR 0 : COLOUR 143\n      PRINT\n      ENDPROC\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_21.txt",
        "content": "_while_ \u2190 {\ud835\udd3d\u235f\ud835\udd3e\u2218\ud835\udd3d_\ud835\udd63_\ud835\udd3e\u2218\ud835\udd3d\u235f\ud835\udd3e\ud835\udd69}\nFPG\u2190{\n  \ud835\udd4a\ud835\udd69: 4\u203f4\ud835\udd4a\ud835\udd69;\n  (\u2227\u00b4\ud835\udd68<0)\u22282\u2260\u2260\ud835\udd68 ? \u2022Out \"Invalid shape: \"\u223e\u2022Fmt \ud835\udd68;\n  0\u2260=\ud835\udd69 ? \u2022Out \"Invalid shuffle count: \"\u223e\u2022Fmt \ud835\udd69;\n  s\ud835\udd4a\ud835\udd69:\n  d\u2190\u27e81\u203f0\u22c4\u00af1\u203f0\u22c40\u203f1\u22c40\u203f\u00af1\u27e9 # Directions\n  w\u2190\ud835\udd68\u294a1\u233d\u2195\u00d7\u00b4\ud835\udd68 # Solved grid\n  b\u2190w        # Board\n  z\u2190\u2291{\n    z\u203fp\u2190\ud835\udd69\n    p\u21a9(\u22a2\u2261s\u22b8|)\u00a8\u22b8/(<z)+d(\u00ac\u2218\u220a/\u22a3)p # filter out invalid\n    n\u2190(\u2022rand.Range \u2260p)\u2291p\n    b\u233d\u233e(z\u203fn\u22b8\u2291)\u21a9 # switch places\n    -`n\u203fz\n  }\u235f\ud835\udd69 \u27e8\ud835\udd68-1,\u27e80\u27e9\u27e9\n  {\n    \ud835\udd4a:\n    b\u2261w ? \u2022Show b, \u2022Out \"You win\", 0;\n    \u2022Show b\n    inp\u2190\u2291{\n      Check \ud835\udd69:\n      \u2022Out \"Enter move: \"\n      x\u2190\u2022GetLine@\n      i\u2190\u2291\"\u2191\u2193\u2190\u2192q\"\u2290x\n      {\n        i=4 ? i; # quit\n        i>4 ? \u2022Out \"Invalid direction: \"\u223ex, Check x;\n        (\u22a2\u2262s\u22b8|)z+i\u2291d ? \u2022Out \"Out of bounds: \"\u223ex, Check x;\n        i\n      }\n    } @\n    {\n      \ud835\udd69=4 ? \u2022Out \"Quitting\", 0;\n      mv\u2190z+\ud835\udd69\u2291d\n      b\u233d\u233e(mv\u203fz\u22b8\u2291)\u21a9\n      z\u21a9mv\n      1\n    } inp\n  } _while_ \u22a2 1\n  @\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_22.txt",
        "content": "   )ex 15_puzzle.bqn\n   FPG 10\n\u250c\u2500             \n\u2575  1  2  0  3  \n   5  6  7  4  \n   9 10 11  8  \n  13 14 15 12  \n              \u2518\nEnter move: \na\nInvalid direction: a\nEnter move: \n\u2191\n\u250c\u2500             \n\u2575  1  2  7  3  \n   5  6  0  4  \n   9 10 11  8  \n  13 14 15 12  \n              \u2518\nEnter move: \n\u2193\n\u250c\u2500             \n\u2575  1  2  0  3  \n   5  6  7  4  \n   9 10 11  8  \n  13 14 15 12  \n              \u2518\nEnter move: \n\u2193\nOut of bounds: \u2193\n...\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_23.txt",
        "content": "/* RosettaCode: Fifteen puzle game, C89, plain vanillia TTY, MVC, \u00a7 22 */\n#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n#define N 4\n#define M 4\nenum Move{UP,DOWN,LEFT,RIGHT};int hR;int hC;int cc[N][M];const int nS=100;int\nupdate(enum Move m){const int dx[]={0,0,-1,1};const int dy[]={-1,1,0,0};int i=hR\n+dy[m];int j=hC+dx[m];if(i>= 0&&i<N&&j>=0&&j<M){cc[hR][hC]=cc[i][j];cc[i][j]=0;\nhR=i;hC=j;return 1;}return 0;}void setup(void){int i,j,k;for(i=0;i<N;i++)for(j=0\n;j<M;j++)cc[i][j]=i*M+j+1;cc[N-1][M-1]=0;hR=N-1;hC=M-1;k=0;while(k<nS)k+=update(\n(enum Move)(rand()%4));}int isEnd(void){int i,j; int k=1;for(i=0;i<N;i++)for(j=0\n;j<M;j++)if((k<N*M)&&(cc[i][j]!=k++))return 0;return 1;}void show(){int i,j;\nputchar('\\n');for(i=0;i<N;i++)for(j=0;j<M;j++){if(cc[i][j])printf(j!=M-1?\" %2d \"\n:\" %2d \\n\",cc[i][j]);else printf(j!=M-1?\" %2s \":\" %2s \\n\", \"\");}putchar('\\n');}\nvoid disp(char* s){printf(\"\\n%s\\n\", s);}enum Move get(void){int c;for(;;){printf\n(\"%s\",\"enter u/d/l/r\u00a0: \");c=getchar();while(getchar()!='\\n');switch(c){case 27:\nexit(0);case'd':return UP;case'u':return DOWN;case'r':return LEFT;case'l':return\nRIGHT;}}}void pause(void){getchar();}int main(void){srand((unsigned)time(NULL));\ndo setup();while(isEnd());show();while(!isEnd()){update(get());show();}disp(\n\"You win\"); pause();return 0;}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_24.txt",
        "content": "/*\n * RosettaCode: Fifteen puzle game, C89, plain vanillia TTY, MVC\n */\n\n#define _CRT_SECURE_NO_WARNINGS /* unlocks printf etc. in MSVC */\n#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n\nenum Move { MOVE_UP = 0, MOVE_DOWN = 1, MOVE_LEFT = 2, MOVE_RIGHT = 3 };\n\n/* *****************************************************************************\n * Model\n */\n\n#define NROWS     4\n#define NCOLLUMNS 4\nint holeRow;       \nint holeCollumn;   \nint cells[NROWS][NCOLLUMNS];\nconst int nShuffles = 100;\n\nint Game_update(enum Move move){\n    const int dx[] = {  0,  0, -1, +1 };\n    const int dy[] = { -1, +1,  0,  0 };\n    int i = holeRow     + dy[move];\n    int j = holeCollumn + dx[move];    \n    if ( i >= 0 && i < NROWS && j >= 0 && j < NCOLLUMNS ){\n        cells[holeRow][holeCollumn] = cells[i][j];\n        cells[i][j] = 0; holeRow = i; holeCollumn = j;\n        return 1;\n    }\n    return 0;\n}\n\nvoid Game_setup(void){\n    int i,j,k;\n    for ( i = 0; i < NROWS; i++ )\n        for ( j = 0; j < NCOLLUMNS; j++ )\n            cells[i][j] = i * NCOLLUMNS + j + 1;\n    cells[NROWS-1][NCOLLUMNS-1] = 0;\n    holeRow = NROWS - 1;\n    holeCollumn = NCOLLUMNS - 1;\n    k = 0;\n    while ( k < nShuffles )\n        k += Game_update((enum Move)(rand() % 4));\n}\n\nint Game_isFinished(void){\n    int i,j; int k = 1;\n    for ( i = 0; i < NROWS; i++ )\n        for ( j = 0; j < NCOLLUMNS; j++ ) \n            if ( (k < NROWS*NCOLLUMNS) && (cells[i][j] != k++ ) )\n                return 0;\n    return 1;        \n}\n\n\n/* *****************************************************************************\n * View \n */\n\nvoid View_showBoard(){\n    int i,j;\n    putchar('\\n');\n    for ( i = 0; i < NROWS; i++ )\n        for ( j = 0; j < NCOLLUMNS; j++ ){\n            if ( cells[i][j] )\n                printf(j != NCOLLUMNS-1 ? \" %2d \" : \" %2d \\n\", cells[i][j]);\n            else\n                printf(j != NCOLLUMNS-1 ? \" %2s \" : \" %2s \\n\", \"\");\n        }\n    putchar('\\n');\n}\n\nvoid View_displayMessage(char* text){\n    printf(\"\\n%s\\n\", text);\n}\n\n\n/* *****************************************************************************\n * Controller\n */\n\nenum Move Controller_getMove(void){\n    int c;\n    for(;;){\n        printf(\"%s\", \"enter u/d/l/r\u00a0: \");\n        c = getchar();\n        while( getchar() != '\\n' )\n            ;\n        switch ( c ){\n            case 27: exit(EXIT_SUCCESS);\n            case 'd' : return MOVE_UP;   \n            case 'u' : return MOVE_DOWN;\n            case 'r' : return MOVE_LEFT;\n            case 'l' : return MOVE_RIGHT;\n        }\n    }\n}\n\nvoid Controller_pause(void){\n    getchar();\n}\n\nint main(void){\n\n    srand((unsigned)time(NULL));\n\n    do Game_setup(); while ( Game_isFinished() );\n\n    View_showBoard();\n    while( !Game_isFinished() ){ \n        Game_update( Controller_getMove() ); \n        View_showBoard(); \n    }\n\n    View_displayMessage(\"You win\");\n    Controller_pause();\n\n    return EXIT_SUCCESS;\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_25.txt",
        "content": "  9   1   4   7\n  6   5   3   2\n 13  10       8\n 14  15  11  12\n\nenter u/d/l/r\u00a0: u\n\n  9   1   4   7\n  6   5   3   2\n 13  10  11   8\n 14  15      12\n\nenter u/d/l/r\u00a0: l\n\n  9   1   4   7\n  6   5   3   2\n 13  10  11   8\n 14  15  12\n\nenter u/d/l/r\u00a0: d\n\n  9   1   4   7\n  6   5   3   2\n 13  10  11\n 14  15  12   8\n\nenter u/d/l/r\u00a0:",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_26.txt",
        "content": "/**\n * RosettaCode: Fifteen puzle game, C89, MS Windows Console API, MVC\n *\n * @version 0.2 (added TTY and ncurses modes)\n */\n\n#define UNDEFINED_WIN32API_CONSOLE\n#define UNDEFINED_NCURSES_CONSOLE\n#if !defined (TTY_CONSOLE) && !defined(WIN32API_CONSOLE) && !defined(NCURSES_CONSOLE)\n#define TTY_CONSOLE\n#endif\n\n#define _CRT_SECURE_NO_WARNINGS    /* enable printf etc. */\n#define _CRT_NONSTDC_NO_DEPRECATE  /* POSIX functions enabled */\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <time.h>\n#if defined(NCURSES_CONSOLE)\n#include \"curses.h\"  /* see http://pdcurses.sourceforge.net/ */\n#elif defined(WIN32API_CONSOLE)\n#define NOGDI                   /* we don't need GDI */\n#define WIN32_LEAN_AND_MEAN     /* we don't need OLE etc. */\n#include <windows.h>            /* MS Windows stuff */\n#include <conio.h>              /* kbhit() and getch() */\n#endif\n\nenum Move { MOVE_UP = 0, MOVE_DOWN = 1, MOVE_LEFT = 2, MOVE_RIGHT = 3 };\n\n/* *****************************************************************************\n * Model\n */\n\n#define NROWS     4\n#define NCOLLUMNS 4\nint holeRow;       \nint holeCollumn;   \nint cells[NROWS][NCOLLUMNS];\nconst int nShuffles = 100;\n\nint Game_update(enum Move move){\n    const int dx[] = {  0,  0, -1, +1 };\n    const int dy[] = { -1, +1,  0,  0 };\n    int i = holeRow     + dy[move];\n    int j = holeCollumn + dx[move];    \n    if ( i >= 0 && i < NROWS && j >= 0 && j < NCOLLUMNS ){\n        cells[holeRow][holeCollumn] = cells[i][j];\n        cells[i][j] = 0; holeRow = i; holeCollumn = j;\n        return 1;\n    }\n    return 0;\n}\n\nvoid Game_setup(void){\n    int i,j,k;\n    for ( i = 0; i < NROWS; i++ )\n        for ( j = 0; j < NCOLLUMNS; j++ )\n            cells[i][j] = i * NCOLLUMNS + j + 1;\n    cells[NROWS-1][NCOLLUMNS-1] = 0;\n    holeRow = NROWS - 1;\n    holeCollumn = NCOLLUMNS - 1;\n    k = 0;\n    while ( k < nShuffles )\n        k += Game_update((enum Move)(rand() % 4));\n}\n\nint Game_isFinished(void){\n    int i,j; int k = 1;\n    for ( i = 0; i < NROWS; i++ )\n        for ( j = 0; j < NCOLLUMNS; j++ ) \n            if ( (k < NROWS*NCOLLUMNS) && (cells[i][j] != k++ ) )\n                return 0;\n    return 1;        \n}\n\n\n/* *****************************************************************************\n * View \n */\n\nint fieldWidth;\n#ifdef WIN32API_CONSOLE\nHANDLE hConsole;\nCONSOLE_SCREEN_BUFFER_INFO csbi; \n#endif\n\nvoid View_setup_base(void)\n{\n    int i;\n    fieldWidth = 0;\n    for ( i = NROWS * NCOLLUMNS - 1; i > 0; i /= 10 )\n        fieldWidth++;\n}\n\n#if defined(TTY_CONSOLE)\n\nvoid View_setup(void) {\n    View_setup_base();\n}\n\nvoid View_showBoard()\n{\n    int i,j;\n    putchar('\\n');\n    for ( i = 0; i < NROWS; i++ )\n        for ( j = 0; j < NCOLLUMNS; j++ ){\n            if ( cells[i][j] )\n                printf(j != NCOLLUMNS-1 ? \"\u00a0%*d \" : \"\u00a0%*d \\n\", fieldWidth, cells[i][j]);\n            else\n                printf(j != NCOLLUMNS-1 ? \"\u00a0%*s \" : \"\u00a0%*s \\n\", fieldWidth, \"\");\n        }\n    putchar('\\n');\n}\n\nvoid View_displayMessage(char* text)\n{\n    printf(\"\\n%s\\n\", text);\n}\n\n#elif defined(NCURSES_CONSOLE)\n\nvoid View_setup(void) {\n    View_setup_base();\n    initscr();        \n    clear();\n}\n\nvoid View_showBoard()\n{\n    int i,j;\n    for ( i = 0; i < NROWS; i++ )\n        for ( j = 0; j < NCOLLUMNS; j++ ){\n            int x = (fieldWidth+1)*j;\n            int y = 2*i;\n            if ( cells[i][j] ){\n                attron(A_REVERSE);\n                mvprintw(y,x,\"%*d\", fieldWidth, cells[i][j]);\n            }else{\n                attroff(A_REVERSE);\n                mvprintw(y,x,\"%*s\", fieldWidth, \" \");\n            }\n        }\n    attrset(A_NORMAL);\n}\n\nvoid View_displayMessage(char* text)\n{\n    mvprintw(2*NROWS,0, \"%s\", text);\n}\n\n#elif defined(WIN32API_CONSOLE)\n\nvoid View_setup(void) {\n    const COORD coordHome = { 0, 0 }; \n    CONSOLE_CURSOR_INFO cci;\n    DWORD size, nWritten;\n    View_setup_base();\n    hConsole = GetStdHandle(STD_OUTPUT_HANDLE);\n    cci.bVisible = FALSE; \n    cci.dwSize = 1;\n    SetConsoleCursorInfo(hConsole,&cci);    \n    GetConsoleScreenBufferInfo(hConsole,&(csbi));\n    size = csbi.dwSize.X*csbi.dwSize.Y;\n    FillConsoleOutputCharacter(hConsole,' ',size,coordHome,&nWritten);\n    FillConsoleOutputAttribute(hConsole,csbi.wAttributes,size,coordHome,&nWritten);\n\n}\n\nvoid View_showBoard()\n{\n    int i,j;\n    char labelString[32];\n    WORD attributes;\n    DWORD nWritten;\n    for ( i = 0; i < NROWS; i++ )\n        for ( j = 0; j < NCOLLUMNS; j++ ){\n            COORD coord = { ((SHORT)fieldWidth+1)*j, coord.Y = 2*i };\n            if ( cells[i][j] ){\n                sprintf(labelString,\"%*d\", fieldWidth, cells[i][j]);                \n                attributes = BACKGROUND_BLUE | BACKGROUND_GREEN | BACKGROUND_RED;\n            }else{\n                sprintf(labelString,\"%*s\", fieldWidth, \" \");\n                attributes = csbi.wAttributes;\n            }\n            WriteConsoleOutputCharacter(hConsole,labelString,fieldWidth,coord,&nWritten);\n            FillConsoleOutputAttribute (hConsole,attributes,fieldWidth,coord,&nWritten);\n        }\n}\n\nvoid View_displayMessage(char* text)\n{\n    DWORD nWritten;\n    COORD coord = { 0, 2 * NROWS };\n    WriteConsoleOutputCharacter(hConsole,text,strlen(text),coord,&nWritten);\n}\n\n#endif\n\n\n/* *****************************************************************************\n * Controller\n */\n\n#if defined(TTY_CONSOLE)\n\nvoid Controller_setup(void){\n}\n\nenum Move Controller_getMove(void){\n    int c;\n    for(;;){\n        printf(\"%s\", \"enter u/d/l/r\u00a0: \");\n        c = getchar();\n        while( getchar() != '\\n' )\n            ;\n        switch ( c ){\n            case 27: exit(EXIT_SUCCESS);\n            case 'd' : return MOVE_UP;   \n            case 'u' : return MOVE_DOWN;\n            case 'r' : return MOVE_LEFT;\n            case 'l' : return MOVE_RIGHT;\n        }\n    }\n}\n\nvoid Controller_pause(void)\n{\n    getchar();\n}\n\n#elif defined(NCURSES_CONSOLE)\n\nvoid Controller_setup(void){\n    noecho();\n    cbreak();\n    curs_set(0);\n    keypad(stdscr,TRUE);\n}\n\nenum Move Controller_getMove(void){\n    for(;;){\n        switch ( wgetch(stdscr) ){\n            case  27: exit(EXIT_SUCCESS);\n            case KEY_DOWN  : return MOVE_UP;   \n            case KEY_UP    : return MOVE_DOWN;\n            case KEY_RIGHT : return MOVE_LEFT;\n            case KEY_LEFT  : return MOVE_RIGHT;\n            case ERR: /* NOP */;\n        }\n    }\n}\n\nvoid Controller_pause(void){\n    while ( wgetch(stdscr) == ERR )\n        ;\n}\n\n\n#elif defined(WIN32API_CONSOLE)\n\nvoid Controller_setup(void){\n}\n\nenum Move Controller_getMove(void){\n    for(;;){\n        switch ( getch() ){\n            case  27: exit(EXIT_SUCCESS);\n            case   0:\n            case 224: switch ( getch() ){\n                case 80 : return MOVE_UP;   \n                case 72 : return MOVE_DOWN;\n                case 77 : return MOVE_LEFT;\n                case 75 : return MOVE_RIGHT;\n            }\n        }\n    }\n}\n\nvoid Controller_pause(void){\n    while(  kbhit() ) getch();\n    while( !kbhit() )   ;\n    while(  kbhit() ) getch();\n}\n\n#endif\n\n\n/* *****************************************************************************\n * Main function: create model, view and controller. Run main loop.\n */\nint main(void) {\n\n    srand((unsigned)time(NULL));\n\n    do Game_setup(); while ( Game_isFinished() );\n    View_setup(); \n    Controller_setup();\n\n    View_showBoard();\n    while( !Game_isFinished() ){ \n        Game_update( Controller_getMove() ); \n        View_showBoard(); \n    }\n\n    View_displayMessage(\"You win\");\n    Controller_pause();\n\n    return EXIT_SUCCESS;\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_27.txt",
        "content": "using System;\nusing System.Collections.Generic;\nusing System.Drawing;\nusing System.Windows.Forms;\n\npublic class FifteenPuzzle\n{\n    const int GridSize = 4; //Standard 15 puzzle is 4x4\n    const int BlockCount = 16;\n\n    static readonly Random R = new Random();\n\n    private List<Button> Puzzles = new List<Button>();\n    private int Moves = 0;\n    private DateTime Start;\n\n    public class Puzzle\n    {\n        private int mOrderedNumer;\n\n        public int CurrentNumber;\n\n        public int X;\n        public int Y;\n\n        public int InvX\n        {\n            get { return (GridSize - 1) - X; }\n        }\n        public int InvY\n        {\n            get { return (GridSize - 1) - Y; }\n        }\n\n        public Puzzle(int OrderedNumer)\n        {\n            mOrderedNumer = OrderedNumer;\n\n            CurrentNumber = OrderedNumer;\n\n            X = OrderedNumer % GridSize;\n            Y = OrderedNumer / GridSize;\n        }\n        public Puzzle(int OrderedNumer, int CurrentNumber)\n            : this(OrderedNumer)\n        {\n            this.CurrentNumber = CurrentNumber;\n        }\n\n        public bool IsEmptyPuzzle\n        {\n            get { return CurrentNumber >= (BlockCount - 1); }\n        }\n        public bool IsTruePlace\n        {\n            get { return (CurrentNumber == mOrderedNumer); }\n        }\n        public bool NearestWith(Puzzle OtherPz)\n        {\n            int dx = (X - OtherPz.X);\n            int dy = (Y - OtherPz.Y);\n\n            if ((dx == 0) && (dy <= 1) && (dy >= -1)) return true;\n            if ((dy == 0) && (dx <= 1) && (dx >= -1)) return true;\n\n            return false;\n        }\n\n        public override string ToString()\n        {\n            return (CurrentNumber + 1).ToString();\n        }\n    }\n\n    public static void Main(string[] args)\n    {\n        FifteenPuzzle Game = new FifteenPuzzle();\n        Application.Run(Game.CreateForm());\n    }\n\n    private Form CreateForm()\n    {\n        int ButtonSize = 50;\n        int ButtonMargin = 3;\n        int FormEdge = 9;\n\n        Font ButtonFont = new Font(\"Arial\", 15.75F, FontStyle.Regular);\n\n        Button StartButton = new Button();\n        StartButton.Location = new Point(FormEdge, (GridSize * (ButtonMargin + ButtonSize)) + FormEdge);\n        StartButton.Size = new Size(86, 23);\n        StartButton.Font = new Font(\"Arial\", 9.75F, FontStyle.Regular);\n        StartButton.Text = \"New Game\";\n        StartButton.UseVisualStyleBackColor = true;\n        StartButton.TabStop = false;\n\n        StartButton.Click += new EventHandler(NewGame);\n\n        int FormWidth = (GridSize * ButtonSize) + ((GridSize - 1) * ButtonMargin) + (FormEdge * 2);\n        int FormHeigth = FormWidth + StartButton.Height;\n\n        Form Form = new Form();\n        Form.Text = \"Fifteen\";\n        Form.ClientSize = new Size(FormWidth, FormHeigth);\n        Form.FormBorderStyle = FormBorderStyle.FixedSingle;\n        Form.MaximizeBox = false;\n        Form.SuspendLayout();\n\n        for (int i = 0; i < BlockCount; i++)\n        {\n            Button Bt = new Button();\n            Puzzle Pz = new Puzzle(i);\n\n            int PosX = FormEdge + (Pz.X) * (ButtonSize + ButtonMargin);\n            int PosY = FormEdge + (Pz.Y) * (ButtonSize + ButtonMargin);\n            Bt.Location = new Point(PosX, PosY);\n\n            Bt.Size = new Size(ButtonSize, ButtonSize);\n            Bt.Font = ButtonFont;\n\n            Bt.Text = Pz.ToString();\n            Bt.Tag = Pz;\n            Bt.UseVisualStyleBackColor = true;\n            Bt.TabStop = false;\n\n            Bt.Enabled = false;\n            if (Pz.IsEmptyPuzzle) Bt.Visible = false;\n\n            Bt.Click += new EventHandler(MovePuzzle);\n\n            Puzzles.Add(Bt);\n            Form.Controls.Add(Bt);\n        }\n\n        Form.Controls.Add(StartButton);\n        Form.ResumeLayout();\n\n        return Form;\n    }\n\n    private void NewGame(object Sender, EventArgs E)\n    {\n        do\n        {\n            for (int i = 0; i < Puzzles.Count; i++)\n            {\n                Button Bt1 = Puzzles[R.Next(i, Puzzles.Count)];\n                Button Bt2 = Puzzles[i];\n                Swap(Bt1, Bt2);\n            }\n        }\n        while (!IsSolvable());\n\n        for (int i = 0; i < Puzzles.Count; i++)\n        {\n            Puzzles[i].Enabled = true;\n        }\n\n        Moves = 0;\n        Start = DateTime.Now;\n    }\n\n    private void MovePuzzle(object Sender, EventArgs E)\n    {\n        Button Bt1 = (Button)Sender;\n        Puzzle Pz1 = (Puzzle)Bt1.Tag;\n\n        Button Bt2 = Puzzles.Find(Bt => ((Puzzle)Bt.Tag).IsEmptyPuzzle);\n        Puzzle Pz2 = (Puzzle)Bt2.Tag;\n\n        if (Pz1.NearestWith(Pz2))\n        {\n            Swap(Bt1, Bt2);\n            Moves++;\n        }\n\n        CheckWin();\n    }\n\n    private void CheckWin()\n    {\n        Button WrongPuzzle = Puzzles.Find(Bt => !((Puzzle)Bt.Tag).IsTruePlace);\n        bool UWin = (WrongPuzzle == null);\n\n        if (UWin)\n        {\n            for (int i = 0; i < Puzzles.Count; i++)\n            {\n                Puzzles[i].Enabled = false;\n            }\n\n            TimeSpan Elapsed = DateTime.Now - Start;\n            Elapsed = TimeSpan.FromSeconds(Math.Round(Elapsed.TotalSeconds, 0));\n            MessageBox.Show(String.Format(\"Solved in {0} moves. Time: {1}\", Moves, Elapsed));\n        }\n    }\n\n    private void Swap(Button Bt1, Button Bt2)\n    {\n        if (Bt1 == Bt2) return;\n\n        Puzzle Pz1 = (Puzzle)Bt1.Tag;\n        Puzzle Pz2 = (Puzzle)Bt2.Tag;\n\n        int g = Pz1.CurrentNumber;\n        Pz1.CurrentNumber = Pz2.CurrentNumber;\n        Pz2.CurrentNumber = g;\n\n        Bt1.Visible = true;\n        Bt1.Text = Pz1.ToString();\n        if (Pz1.IsEmptyPuzzle) Bt1.Visible = false;\n\n        Bt2.Visible = true;\n        Bt2.Text = Pz2.ToString();\n        if (Pz2.IsEmptyPuzzle) Bt2.Visible = false;\n    }\n\n    private bool IsSolvable()\n    {\n        // WARNING: size of puzzle board MUST be even(like 4)!\n        // For explain see: https://www.geeksforgeeks.org/check-instance-15-puzzle-solvable/\n\n        int InvCount = 0;\n        for (int i = 0; i < Puzzles.Count - 1; i++)\n        {\n            for (int j = i + 1; j < Puzzles.Count; j++)\n            {\n                Puzzle Pz1 = (Puzzle)Puzzles[i].Tag;\n                if (Pz1.IsEmptyPuzzle) continue;\n\n                Puzzle Pz2 = (Puzzle)Puzzles[j].Tag;\n                if (Pz2.IsEmptyPuzzle) continue;\n\n                if (Pz1.CurrentNumber > Pz2.CurrentNumber) InvCount++;\n            }\n        }\n\n        Button EmptyBt = Puzzles.Find(Bt => ((Puzzle)Bt.Tag).IsEmptyPuzzle);\n        Puzzle EmptyPz = (Puzzle)EmptyBt.Tag;\n\n        bool Result = false;\n        if ((EmptyPz.InvY + 1) % 2 == 0) // is even\n        {\n            // is odd\n            if (InvCount % 2 != 0) Result = true;\n        }\n        else // is odd\n        {\n            // is even\n            if (InvCount % 2 == 0) Result = true;\n        }\n        return Result;\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_28.txt",
        "content": "#include <time.h>\n#include <stdlib.h>\n#include <vector>\n#include <string>\n#include <iostream>\nclass p15 {\npublic :\n    void play() {\n        bool p = true;\n        std::string a;\n        while( p ) {\n            createBrd();\n            while( !isDone() ) { drawBrd();getMove(); }\n            drawBrd();\n            std::cout << \"\\n\\nCongratulations!\\nPlay again (Y/N)?\";\n            std::cin >> a; if( a != \"Y\" && a != \"y\" ) break;\n        }\n    }\nprivate:\n    void createBrd() {\n        int i = 1; std::vector<int> v;\n        for( ; i < 16; i++ ) { brd[i - 1] = i; }\n        brd[15] = 0; x = y = 3;\n        for( i = 0; i < 1000; i++ ) {\n            getCandidates( v );\n            move( v[rand() % v.size()] );\n            v.clear();\n        }\n    }\n    void move( int d ) {\n        int t = x + y * 4;\n        switch( d ) {\n            case 1: y--; break;\n            case 2: x++; break;\n            case 4: y++; break;\n            case 8: x--;\n        }\n        brd[t] = brd[x + y * 4];\n        brd[x + y * 4] = 0;\n    }\n    void getCandidates( std::vector<int>& v ) {\n        if( x < 3 ) v.push_back( 2 ); if( x > 0 ) v.push_back( 8 );\n        if( y < 3 ) v.push_back( 4 ); if( y > 0 ) v.push_back( 1 );\n    }\n    void drawBrd() {\n        int r; std::cout << \"\\n\\n\";\n        for( int y = 0; y < 4; y++ ) {\n            std::cout << \"+----+----+----+----+\\n\";\n            for( int x = 0; x < 4; x++ ) {\n                r = brd[x + y * 4];\n                std::cout << \"| \";\n                if( r < 10 ) std::cout << \" \";\n                if( !r ) std::cout << \"  \";\n                else std::cout << r << \" \";\n            }\n            std::cout << \"|\\n\";\n        }\n        std::cout << \"+----+----+----+----+\\n\";\n    }\n    void getMove() {\n        std::vector<int> v; getCandidates( v );\n        std::vector<int> p; getTiles( p, v ); unsigned int i;\n        while( true ) {\n            std::cout << \"\\nPossible moves: \";\n            for( i = 0; i < p.size(); i++ ) std::cout << p[i] << \" \";\n            int z; std::cin >> z;\n            for( i = 0; i < p.size(); i++ )\n                if( z == p[i] ) { move( v[i] ); return; }\n        }\n    }\n    void getTiles( std::vector<int>& p, std::vector<int>& v ) {\n        for( unsigned int t = 0; t < v.size(); t++ ) {\n            int xx = x, yy = y;\n            switch( v[t] ) {\n                case 1: yy--; break;\n                case 2: xx++; break;\n                case 4: yy++; break;\n                case 8: xx--;\n            }\n            p.push_back( brd[xx + yy * 4] );\n        }\n    }\n    bool isDone() {\n        for( int i = 0; i < 15; i++ ) {\n            if( brd[i] != i + 1 ) return false;\n        }\n        return true;\n    }\n    int brd[16], x, y;\n};\nint main( int argc, char* argv[] ) {\n    srand( ( unsigned )time( 0 ) );\n    p15 p; p.play(); return 0;\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_29.txt",
        "content": "+----+----+----+----+\n| 11 |  5 | 12 |  3 |\n+----+----+----+----+\n| 10 |  7 |  6 |  4 |\n+----+----+----+----+\n| 13 |    |  2 |  1 |\n+----+----+----+----+\n| 15 | 14 |  8 |  9 |\n+----+----+----+----+\n\nPossible moves: 2 13 14 7\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_3.txt",
        "content": "/* ARM assembly AARCH64 Raspberry PI 3B */\n/*  program puzzle15_64.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 NBBOX,  16\n.equ GRAINE,  123456      // change for other game\n.equ NBSHUFFLE, 4         \n.equ KEYSIZE,  8\n \n.equ IOCTL,     0x1D  // Linux syscall\n.equ SIGACTION, 0x86   // Linux syscall\n.equ SYSPOLL,   0x16  // Linux syscall\n.equ CREATPOLL, 0x14  // Linux syscall\n.equ CTLPOLL,   0x15  // Linux syscall\n \n.equ TCGETS,    0x5401\n.equ TCSETS,    0x5402\n.equ ICANON,    2\n.equ ECHO,     10\n.equ POLLIN,    1\n.equ EPOLL_CTL_ADD,    1\n\n.equ SIGINT,   2    // Issued if the user sends an interrupt signal (Ctrl + C)\n.equ SIGQUIT,  3    // Issued if the user sends a quit signal (Ctrl + D)\n.equ SIGTERM, 15    // Software termination signal (sent by kill by default)\n.equ SIGTTOU, 22    // \n\n/*******************************************/\n/* Structures                               */\n/********************************************/\n/* structure termios see doc linux*/\n    .struct  0\nterm_c_iflag:                    // input modes\n    .struct  term_c_iflag + 4 \nterm_c_oflag:                    // output modes\n    .struct  term_c_oflag + 4 \nterm_c_cflag:                    // control modes\n    .struct  term_c_cflag + 4 \nterm_c_lflag:                    // local modes\n    .struct  term_c_lflag + 4 \nterm_c_cc:                       // special characters\n    .struct  term_c_cc + 20      // see length if necessary \nterm_fin:\n \n/* structure sigaction see doc linux */\n    .struct  0\nsa_handler:\n    .struct  sa_handler + 8\nsa_mask:\n    .struct  sa_mask + 8\nsa_flags:\n    .struct  sa_flags + 8\nsa_sigaction:\n    .struct  sa_sigaction + 8\nsa_fin:\n\n/* structure poll see doc linux */\n    .struct  0\npoll_event:\n    .struct  poll_event + 8\npoll_fd:                            //   File Descriptor\n    .struct  poll_fd + 8 \npoll_fin:\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nsMessResult:           .ascii \" \"\nsMessValeur:           .fill 11, 1, ' '             // size => 11\nszCarriageReturn:      .asciz \"\\n\"\nszMessGameWin:         .asciz \"You win in @ move number\u00a0!!!!\\n\"\nszMessMoveError:       .asciz \"Huh... Impossible move\u00a0!!!!\\n\"\nszMessErreur:          .asciz \"Error detected.\\n\"\nszMessErrInitTerm:     .asciz \"Error terminal init.\\n\"\nszMessErrInitPoll:     .asciz \"Error poll init.\\n\"\nszMessErreurKey:       .asciz \"Error read key.\\n\"\nszMessSpaces:          .asciz \"    \"\nqGraine:               .quad GRAINE\nszMessErr:             .asciz    \"Error code hexa\u00a0: @ d\u00e9cimal\u00a0: @ \\n\"\n\nszClear:     .byte 0x1B \n             .byte 'c'                         // console clear\n             .byte 0\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\n.align 4\nsZoneConv:      .skip 24\nqCodeError:     .skip 8\nibox:           .skip 4 * NBBOX                // game boxes\nqEnd:           .skip 8                        // 0 loop  1 = end loop\nqTouche:        .skip KEYSIZE                  // value key pressed\nstOldtio:       .skip term_fin                 // old terminal state\nstCurtio:       .skip term_fin                 // current terminal state\nstSigAction:    .skip sa_fin                   // area signal structure\nstSigAction1:   .skip sa_fin\nstSigAction2:   .skip sa_fin\nstSigAction3:   .skip sa_fin\nstPoll1:        .skip poll_fin                 // area poll structure\nstPoll2:        .skip poll_fin\nstevents:       .skip 16\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                // entry of program \n    mov x0,#0\n    bl initTerm                      // terminal init\n    cmp x0,0                         // error\u00a0?\n    blt 100f\n    bl initPoll                      // epoll instance init\n    cmp x0,0\n    blt 99f\n    mov x22,x0                       // save epfd\n    ldr x2,qAdribox\n    mov x9,#0                        // init counter \n    mov x0,0\n1:                                   // loop init boxs\n    add x1,x0,#1                     // box value\n    str w1,[x2,x0, lsl #2]           // store value\n    add x0,x0,#1                     // increment counter\n    cmp x0,#NBBOX - 2                // end\u00a0?\n    ble 1b\n    mov x10,#15                      // empty box location \n    ldr x0,qAdribox\n    bl shuffleGame\n2:                                   // loop moves\n    ldr x0,qAdribox\n    bl displayGame\n3:\n    mov x0,x22                       // epfd\n    bl waitKey\n    cmp x0,0\n    beq 3b                           // no ket pressed -> loop\n    blt 99f                          // error\u00a0?\n    bl readKey                       // read key \n    cmp x0,#-1\n    beq 99f                          // error  \n    cmp x0,3                         // <ctrl_C>\n    beq 5f\n    cmp x0,113                       // saisie q (quit)\u00a0?\n    beq 5f\n    cmp x0,81                        // saisie Q  (Quit)?\n    beq 5f\n    mov x1,x0                        // key\n    ldr x0,qAdribox\n    bl keyMove                       // analyze key move \n    ldr x0,qAdribox\n    bl gameOK                        // end game\u00a0?\n    cmp x0,#1\n    bne 2b                           // no -> loop\n                                     // win\n    mov x0,x9                        // move counter\n    ldr x1,qAdrsZoneConv\n    bl conversion10\n    ldr x0,qAdrszMessGameWin\n    ldr x1,qAdrsZoneConv\n    bl strInsertAtCharInc            // insert result at @ character\n    bl affichageMess\n5:\n    bl restauTerm                    // terminal restaur\n    mov x0, #0                       // return code\n    b 100f\n99:\n    bl restauTerm                    // terminal restaur\n    mov x0,1                         // return code error\n    b 100f\n100:                                 // standard end of the program \n    mov x8, #EXIT                    // request to exit program\n    svc #0                           // perform the system call\n \nqAdrsMessValeur:          .quad sMessValeur\nqAdrszCarriageReturn:     .quad szCarriageReturn\nqAdrsMessResult:          .quad sMessResult\nqAdribox:                 .quad ibox\nqAdrszMessGameWin:        .quad szMessGameWin\nqAdrstevents:             .quad stevents\nqAdrszMessErreur:         .quad szMessErreur\nqAdrstOldtio:             .quad stOldtio\nqAdrstCurtio:             .quad stCurtio\nqAdrstSigAction:          .quad stSigAction\nqAdrstSigAction1:         .quad stSigAction1\nqAdrSIG_IGN:              .quad 1\nqAdrqEnd:                 .quad qEnd\nqAdrqTouche:              .quad qTouche\nqAdrszMessErrInitTerm:    .quad szMessErrInitTerm\nqAdrszMessErrInitPoll:    .quad szMessErrInitPoll\nqAdrszMessErreurKey:      .quad szMessErreurKey\n/******************************************************************/\n/*     key move                                                   */ \n/******************************************************************/\n/* x0 contains boxs address           */\n/* x1 contains key value               */\n/* x9 move counter                     */\n/* x10 contains location empty box    */\nkeyMove:\n    stp x1,lr,[sp,-16]!              // save  registers\n    mov x7,x0\n    lsr x1,x1,16           \n    cmp x1,#0x42                     // down arrow \n    bne 1f\n    cmp x10,#4                       // if x10 < 4   error\n    blt 80f\n    sub x2,x10,#4                    // compute location\n    b 90f\n1:\n    cmp x1,#0x41                     // high arrow\n    bne 2f\n    cmp x10,#11                      // if x10 > 11   error\n    bgt 80f\n    add x2,x10,#4                    // compute location\n    b 90f\n2:\n    cmp x1,#0x43                     // right arrow\n    bne 3f\n    tst x10,#0b11                    // if x10 = 0,4,8,12   error\n    beq 80f\n    sub x2,x10,#1                    // compute location\n    b 90f\n3:\n    cmp x1,#0x44                     // left arrow\n    bne 100f\n    and x3,x10,#0b11                 // error if x10 = 3 7 11 and 15\n    cmp x3,#3\n    beq 80f\n    add x2,x10,#1                    // compute location\n    b 90f\n \n80:                                  // move error\n    ldr x0,qAdrqCodeError\n    mov x1,#1\n    str x1,[x0]\n    b 100f\n90:                                  // white box and move box inversion\n    ldr w3,[x7,x2,lsl #2]\n    str w3,[x7,x10,lsl #2]\n    mov x10,x2\n    mov x3,#0\n    str w3,[x7,x10,lsl #2]\n    add x9,x9,#1                        // increment move counter\n100:\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\nqAdrqCodeError:             .quad qCodeError\n/******************************************************************/\n/*     shuffle game                                       */ \n/******************************************************************/\n/* x0 contains boxs address           */\nshuffleGame:\n    stp x1,lr,[sp,-16]!            // save  registers\n    stp x2,x3,[sp,-16]!            // save  registers\n    stp x4,x5,[sp,-16]!            // save  registers\n    mov x1,x0\n    mov x0,NBSHUFFLE\n    bl genereraleas\n    lsl x4,x0,#1\n1:\n    mov x0,#14\n    bl genereraleas\n    add x3,x0,#1\n    mov x0,#14\n    bl genereraleas\n    add x5,x0,#1\n    ldr w2,[x1,x3,lsl #2]\n    ldr w0,[x1,x5,lsl #2]\n    str w2,[x1,x5,lsl #2]\n    str w0,[x1,x3,lsl #2]\n    subs x4,x4,#1\n    bgt 1b\n \n100:\n    ldp x4,x5,[sp],16              // restaur  2 registers\n    ldp x2,x3,[sp],16              // restaur  2 registers\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n/******************************************************************/\n/*     game Ok\u00a0?                                      */ \n/******************************************************************/\n/* x0 contains boxs address           */\ngameOK:\n    stp x1,lr,[sp,-16]!            // save  registers\n    stp x2,x3,[sp,-16]!            // save  registers\n    mov x2,#0\n    ldr w3,[x0,x2,lsl #2]\n    add x2,x2,#1\n1:\n    ldr w1,[x0,x2,lsl #2]\n    cmp w1,w3\n    bge 2f\n    mov x0,#0                      // game not Ok\n    b 100f\n2:\n    mov x3,x1\n    add x2,x2,#1\n    cmp x2,#NBBOX -2\n    ble 1b\n    mov x0,#1                      // game Ok\n \n100:\n    ldp x2,x3,[sp],16              // restaur  2 registers\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n/******************************************************************/\n/*     display game                                       */ \n/******************************************************************/\n/* x0 contains boxs address           */\ndisplayGame:\n    stp x1,lr,[sp,-16]!            // save  registers\n                                   // clear screen\u00a0!\n    mov x4,x0\n    ldr x0,qAdrszClear\n    bl affichageMess \n    mov x2,#0\n    ldr x1,qAdrsMessValeur\n1:\n    ldr w0,[x4,x2,lsl #2]\n    cmp w0,#0\n    bne 2f\n    ldr w0,iSpaces                    // store spaces\n    str w0,[x1]\n    b 3f\n2:\n    bl conversion10                     // call conversion decimal\n    cmp x0,1\n    beq 21f\n    mov x0,0x20\n    strh w0,[x1,#2]\n    b 3f\n21:\n    mov w0,0x2020\n    str w0,[x1,#1]\n3:\n    ldr x0,qAdrsMessResult\n    bl affichageMess                    // display message\n    add x0,x2,#1\n    tst x0,#0b11\n    bne 4f\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess                    // display message\n4:\n    add x2,x2,#1\n    cmp x2,#NBBOX - 1\n    ble 1b\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess                    // display line return\n    ldr x0,qAdrqCodeError               // error detected\u00a0?\n    ldr x1,[x0]\n    cmp x1,#0\n    beq 100f\n    mov x1,#0                           // raz error code\n    str x1,[x0]\n    ldr x0,qAdrszMessMoveError          // display error message\n    bl affichageMess\n100:\n    ldp x1,lr,[sp],16                   // restaur  2 registers\n    ret                                 // return to address lr x30\niSpaces:              .int 0x00202020   // spaces\nqAdrszClear:          .quad szClear          \nqAdrszMessMoveError:  .quad szMessMoveError\n\n/***************************************************/\n/*   Generation random number                  */\n/***************************************************/\n/* x0 contains limit  */\ngenereraleas:\n    stp x1,lr,[sp,-16]!            // save  registers\n    stp x2,x3,[sp,-16]!            // save  registers\n    ldr x1,qAdrqGraine\n    ldr x2,[x1]\n    ldr x3,qNbDep1\n    mul x2,x3,x2\n    ldr x3,qNbDep2\n    add x2,x2,x3\n    str x2,[x1]                    // maj de la graine pour l appel suivant \n    cmp x0,#0\n    beq 100f\n    udiv x3,x2,x0\n    msub x0,x3,x0,x2               // r\u00e9sult = remainder\n \n100:                               // end function\n    ldp x2,x3,[sp],16              // restaur  2 registers\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n/*****************************************************/\nqAdrqGraine: .quad qGraine\nqNbDep1:     .quad 0x0019660d\nqNbDep2:     .quad 0x3c6ef35f\n\n/******************************************************************/\n/*     traitement du signal                                       */ \n/******************************************************************/\nsighandler:\n    stp x0,lr,[sp,-16]!            // save  registers\n    str x1,[sp,-16]! \n    ldr x0,qAdrqEnd\n    mov x1,#1                      // maj zone end\n    str x1,[x0]\n    ldr x1,[sp],16\n    ldp x0,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n/***************************************************/\n/*   display error message                         */\n/***************************************************/\n/* x0 contains error code  x1\u00a0: message address */\ndisplayError:\n    stp x2,lr,[sp,-16]!            // save  registers\n    mov x2,x0                      // save error code\n    mov x0,x1\n    bl affichageMess\n    mov x0,x2                      // error code\n    ldr x1,qAdrsZoneConv\n    bl conversion16                // conversion hexa\n    ldr x0,qAdrszMessErr           // display error message\n    ldr x1,qAdrsZoneConv\n    bl strInsertAtCharInc               // insert result at @ character\n    mov x3,x0\n    mov x0,x2                      // error code\n    ldr x1,qAdrsZoneConv               // result address\n    bl conversion10S                // conversion decimale\n    mov x0,x3\n    ldr x1,qAdrsZoneConv\n    bl strInsertAtCharInc               // insert result at @ character\n    bl affichageMess\n100:\n    ldp x2,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\nqAdrszMessErr:                 .quad szMessErr\nqAdrsZoneConv:                 .quad sZoneConv\n/*********************************/\n/* init terminal state            */\n/*********************************/\ninitTerm:\n    stp x1,lr,[sp,-16]!            // save  registers\n    /* read terminal state */\n    mov x0,STDIN                   // input console\n    mov x1,TCGETS\n    ldr x2,qAdrstOldtio\n    mov x8,IOCTL                   // call system Linux\n    svc 0 \n    cbnz x0,98f                    // error\u00a0?\n\n    adr x0,sighandler              // adresse routine traitement signal\n    ldr x1,qAdrstSigAction         // adresse structure sigaction\n    str x0,[x1,sa_handler]         // maj handler\n    mov x0,SIGINT                  // signal type\n    ldr x1,qAdrstSigAction\n    mov x2,0\n    mov x3,8\n    mov x8,SIGACTION               // call system\n    svc 0 \n\n    cmp x0,0                       // error\u00a0?\n    bne 98f\n    mov x0,SIGQUIT\n    ldr x1,qAdrstSigAction\n    mov x2,0                       // NULL\n    mov x8,SIGACTION               // call system \n    svc 0 \n    cmp x0,0                       // error\u00a0?\n    bne 98f\n    mov x0,SIGTERM\n    ldr x1,qAdrstSigAction\n    mov x2,0                       // NULL\n    mov x8,SIGACTION               // appel systeme \n    svc 0 \n    cmp x0,0\n    bne 98f\n    //\n    adr x0,qAdrSIG_IGN             // address signal igonre function\n    ldr x1,qAdrstSigAction1\n    str x0,[x1,sa_handler]\n    mov x0,SIGTTOU                 //invalidate other process signal\n    ldr x1,qAdrstSigAction1\n    mov x2,0                       // NULL\n    mov x8,SIGACTION               // call system \n    svc 0 \n    cmp x0,0\n    bne 98f\n    //\n    /* read terminal current state  */\n    mov x0,STDIN\n    mov x1,TCGETS\n    ldr x2,qAdrstCurtio            // address current termio\n    mov x8,IOCTL                   // call systeme \n    svc 0 \n    cmp x0,0                       // error\u00a0?\n    bne 98f\n    mov x2,ICANON | ECHO           // no key pressed echo on display\n    mvn x2,x2                      // and one key \n    ldr x1,qAdrstCurtio\n    ldr x3,[x1,#term_c_lflag]\n    and x3,x2,x2                   // add flags \n    str x3,[x1,#term_c_lflag]      // and store\n    mov x0,STDIN                   // maj terminal current state \n    mov x1,TCSETS\n    ldr x2,qAdrstCurtio\n    mov x8,IOCTL                   // call system\n    svc 0 \n    cbz x0,100f\n98:                                // error display\n    ldr x1,qAdrszMessErrInitTerm\n    bl   displayError\n    mov x0,-1\n100:\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\nqAdrstSigAction2:    .quad stSigAction2\nqAdrstSigAction3:    .quad stSigAction3\n/*********************************/\n/* init instance epool            */\n/*********************************/\ninitPoll:\n    stp x1,lr,[sp,-16]!            // save  registers\n    ldr x0,qAdrstevents\n    mov x1,STDIN                   // maj structure events\n    str x1,[x0,#poll_fd]           // maj FD\n    mov x1,POLLIN                  // action code\n    str x1,[x0,#poll_event]\n    mov x0,0\n    mov x8,CREATPOLL               // create epoll instance\n    svc 0\n    cmp x0,0                       // error\u00a0?\n    ble 98f\n    mov x10,x0                     // return FD epoll instance\n    mov x1,EPOLL_CTL_ADD\n    mov x2,STDIN                   // Fd to we want add\n    ldr x3,qAdrstevents            // structure events address\n    mov x8,CTLPOLL                 // call system control epoll\n    svc 0\n    cmp x0,0                       // error\u00a0?\n    blt 98f                       // no\n    mov x0,x10                     // return FD epoll instance\n    b 100f\n98:                                // error display\n    ldr x1,qAdrszMessErrInitPoll   // error message\n    bl   displayError\n    mov x0,-1\n100:\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n/*********************************/\n/* wait key                      */\n/*********************************/\n/* x0 contains FD poll    */\nwaitKey:\n    stp x1,lr,[sp,-16]!            // save  registers\n    ldr x11,qAdrqTouche            // key address\n    str xzr,[x11]                  // raz key\n1:\n    ldr x1,qAdrqEnd                // if signal ctrl-c  -> end\n    ldr x1,[x1]\n    cbnz x1,100f\n\n    ldr x1,qAdrstevents\n    mov x2,12                      // size events\n    mov x3,1                       // timeout = 1  TODO:\u00a0??\n    mov x4,0\n    mov x8,SYSPOLL                 // call system wait POLL\n    svc 0 \n    cmp x0,0                       // key pressed\u00a0?\n    bge 100f\n98:                                // error display\n    ldr x1,qAdrszMessErreurKey        // error message\n    bl   displayError\n    mov x0,-1\n100:\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n/*********************************/\n/* read key                      */\n/*********************************/\n/* x0 returns key value */\nreadKey:\n    stp x1,lr,[sp,-16]!            // save  registers\n    mov x0,STDIN                   // File Descriptor\n    ldr x1,qAdrqTouche             // buffer address\n    mov x2,KEYSIZE                 // key size\n    mov x8,READ                    // read key\n    svc #0\n    cmp x0,0                       // error\u00a0?\n    ble 98f\n    ldr x2,qAdrqTouche             // key address\n    ldr x0,[x2]\n    b 100f\n98:                                // error display\n    ldr x1,qAdrszMessErreur        // error message\n    bl   displayError\n    mov x0,-1\n100:\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n/*********************************/\n/* restaur terminal state        */\n/*********************************/\nrestauTerm:\n    stp x1,lr,[sp,-16]!            // save  registers\n    mov x0,STDIN                   // end then restaur begin state terminal\n    mov x1,TCSETS\n    ldr x2,qAdrstOldtio\n    mov x8,IOCTL                   // call system  \n    svc 0\n    cbz x0,100f\n    ldr x1,qAdrszMessErreur        // error message\n    bl   displayError\n100:\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n\n/********************************************************/\n/*        File Include fonctions                        */\n/********************************************************/\n/* for this file see task include a file in language AArch64 assembly */\n.include \"../includeARM64.inc\"",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_30.txt",
        "content": "         >>SOURCE FORMAT FREE\n*> This code is dedicated to the public domain\n*> This is GNUCOBOL 2.0\nidentification division.\nprogram-id. fifteen.\nenvironment division.\nconfiguration section.\nrepository. function all intrinsic.\ndata division.\nworking-storage section.\n\n01  r pic 9.\n01  r-empty pic 9.\n01  r-to pic 9.\n01  r-from pic 9.\n\n01  c pic 9.\n01  c-empty pic 9.\n01  c-to pic 9.\n01  c-from pic 9.\n\n01  display-table.\n    03  display-row occurs 4.\n        05  display-cell occurs 4 pic 99.\n\n01  tile-number pic 99.\n01  tile-flags pic x(16).\n\n01  display-move value spaces.\n    03  tile-id pic 99.\n\n01  row-separator pic x(21) value all '.'.\n01  column-separator pic x(3) value ' . '.\n\n01  inversions pic 99.\n01  current-tile pic 99.\n\n01  winning-display pic x(32) value\n        '01020304'\n    &   '05060708'\n    &   '09101112'\n    &   '13141500'.\n\nprocedure division.\nstart-fifteen.\n    display 'start fifteen puzzle'\n    display '    enter a two-digit tile number and press <enter> to move'\n    display '    press <enter> only to exit'\n\n    *> tables with an odd number of inversions are not solvable\n    perform initialize-table with test after until inversions = 0\n    perform show-table\n    accept display-move\n    perform until display-move = spaces\n        perform move-tile\n        perform show-table\n        move spaces to display-move\n        accept display-move\n    end-perform\n    stop run\n    .\ninitialize-table.\n    compute tile-number = random(seconds-past-midnight) *> seed only\n    move spaces to tile-flags\n    move 0 to current-tile inversions\n    perform varying r from 1 by 1 until r > 4\n    after c from 1 by 1 until c > 4\n        perform with test after\n        until tile-flags(tile-number + 1:1) = space\n            compute tile-number = random() * 100\n            compute tile-number = mod(tile-number, 16)\n        end-perform\n        move 'x' to tile-flags(tile-number + 1:1)\n        if tile-number > 0 and < current-tile\n            add 1 to inversions\n        end-if\n        move tile-number to display-cell(r,c) current-tile\n    end-perform\n    compute inversions = mod(inversions,2)\n    .\nshow-table.\n    if display-table = winning-display\n        display 'winning'\n    end-if\n    display space row-separator\n    perform varying r from 1 by 1 until r > 4\n        perform varying c from 1 by 1 until c > 4\n            display column-separator with no advancing\n            if display-cell(r,c) = 00\n                display '  ' with no advancing\n                move r to r-empty\n                move c to c-empty\n            else\n                display display-cell(r,c) with no advancing\n            end-if\n        end-perform\n        display column-separator\n    end-perform\n    display space row-separator\n    .\nmove-tile.\n    if not (tile-id numeric and tile-id >= 01 and <= 15)\n        display 'invalid tile number'\n        exit paragraph\n    end-if\n\n    *> find the entered tile-id row and column (r,c)\n    perform varying r from 1 by 1 until r > 4\n    after c from 1 by 1 until c > 4\n        if display-cell(r,c) = tile-id\n            exit perform\n        end-if\n    end-perform\n\n    *> show-table filled (r-empty,c-empty)\n    evaluate true\n    when r = r-empty\n        if c-empty < c\n            *> shift left\n            perform varying c-to from c-empty by 1 until c-to > c\n                compute c-from = c-to + 1\n                move display-cell(r-empty,c-from) to display-cell(r-empty,c-to)\n            end-perform\n        else\n           *> shift right\n           perform varying c-to from c-empty by -1 until c-to < c\n               compute c-from = c-to - 1\n               move display-cell(r-empty,c-from) to display-cell(r-empty,c-to)\n           end-perform\n       end-if\n       move 00 to display-cell(r,c)\n    when c = c-empty\n        if r-empty < r\n            *>shift up\n            perform varying r-to from r-empty by 1 until r-to > r\n                compute r-from = r-to + 1\n                move display-cell(r-from,c-empty) to display-cell(r-to,c-empty)\n            end-perform\n        else\n            *> shift down\n            perform varying r-to from r-empty by -1 until r-to < r\n                compute r-from = r-to - 1\n                move display-cell(r-from,c-empty) to display-cell(r-to,c-empty)\n            end-perform\n        end-if\n        move 00 to display-cell(r,c)\n    when other\n         display 'invalid move'\n    end-evaluate\n    .\nend program fifteen.\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_31.txt",
        "content": "prompt$ cobc -xj fifteen.cbl\nstart fifteen puzzle\n    enter a two-digit tile number and press <enter> to move\n    press <enter> only to exit\n .....................\n . 05 . 14 . 08 . 12 .\n . 01 . 10 . 03 . 09 .\n . 02 . 15 . 13 . 11 .\n . 06 .    . 07 . 04 .\n .....................\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_32.txt",
        "content": "|15|::main\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_33.txt",
        "content": "(defpackage :15\n  (:use :common-lisp))\n(in-package :15)\n\n(defvar +side+ 4)\n(defvar +max+ (1- (* +side+ +side+))) ; 15\n\n(defun make-board ()\n  (make-array (list +side+ +side+)\n              :initial-contents\n              (loop :for i :below +side+ :collecting\n                 (loop :for j :below +side+ :collecting\n                    (mod (1+ (+ j (* i +side+))) (1+ +max+))))))\n(defvar *board* (make-board))\n\n(defun shuffle-board (board)\n  (loop for i from (array-total-size board) downto 2\n     do (rotatef (row-major-aref board (random i))\n                 (row-major-aref board (1- i))))\n  board)\n\n(defun pb (stream object &rest args)\n  (declare (ignorable args))\n  (loop for i below (car (array-dimensions object)) do\n       (loop for j below (cadr (array-dimensions object)) do\n            (let ((cell (aref object i j)))\n              (format stream \"(~[  ~:;~:*~2d~])\" cell)))\n       (format stream \"~%\")))\n\n(defun sortedp (board)\n  (declare (ignorable board))\n  (loop for i upto +max+\n     when (eq (row-major-aref board i) (mod (1+ i) 16)) do\n       (return-from sortedp nil))\n  t)\n\n(defun inversions (lst)\n  (if (or (null lst) (null (cdr lst)))\n      0\n      (let* ((half (ceiling (/ (length lst) 2)))\n             (left-list (subseq lst 0 half))\n             (right-list (subseq lst half)))\n        (+ (loop for a in left-list\n              summing (loop for b in right-list\n                         counting (not (< a b))))\n           (inversions left-list)\n           (inversions right-list)))))\n\n(defun solvablep (board)\n  (let ((inv (inversions (loop for i upto +max+ collecting\n                              (row-major-aref board i))))\n        (row (- +side+ (first (board-position board 0)))))\n    (or (and (oddp +side+)\n             (evenp inv))\n        (and (evenp +side+)\n             (evenp row)\n             (oddp inv))\n        (and (evenp +side+)\n             (oddp row)\n             (evenp inv)))))\n\n(defun board-position (board dig)\n  (loop for i below (car (array-dimensions board)) do\n       (loop for j below (cadr (array-dimensions board))\n          when (eq dig (aref board i j)) do\n          (return-from board-position (list i j)))))\n\n(defun in-bounds (y x)\n  (and (< -1 y +side+)\n       (< -1 x +side+)))\n\n(defun get-adjacents (board pos)\n  (let ((adjacents ()) (y (first pos)) (x (second pos)))\n    (if (in-bounds y (1+ x))\n        (push (aref board y (1+ x)) adjacents))\n    (if (in-bounds (1+ y) x)\n        (push (aref board (1+ y) x) adjacents))\n    (if (in-bounds y (1- x))\n        (push (aref board y (1- x)) adjacents))\n    (if (in-bounds (1- y) x)\n        (push (aref board (1- y) x) adjacents))\n    adjacents))\n\n(defun main (&rest argv)\n  (declare (ignorable argv))\n  (setf *random-state* (make-random-state t))\n  (loop until (solvablep *board*) do\n       (shuffle-board *board*))\n  (loop until (sortedp *board*) do\n       (format t \"~/15:pb/~%\" *board*)\n       (format t \"Which number do you want to swap the blank with?~%> \")\n       (let* ((in (read))\n              (zpos (board-position *board* 0))\n              (pos (board-position *board* in))\n              (adj (get-adjacents *board* zpos)))\n         (if (find in adj)\n             (rotatef (aref *board* (first pos) (second pos))\n                      (aref *board* (first zpos) (second zpos))))))\n  (format t \"You win!~%\"))\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_34.txt",
        "content": "rem 15 Puzzle example game\nrem written in Craft Basic\nrem by Gemino Smothers 2023\nrem www.lucidapogee.com\n\ndefine size = 16, correct = 0, moves = 0\ndefine click = 0, start = 0\n\ndim list[size]\n\ngosub setup\ngosub game\n\nend\n\nsub setup\n\n\ttitle \"15 Puzzle\"\n\n\tbgcolor 0,128,0\n\tcls graphics\n\n\tresize 0, 0, 170, 270\n\tcenter\n\n\tlet x = 0\n\tlet y = 30\n\n\tfor i = 0 to size - 1\n\n\t\tif x = 112 then\n\n\t\t\tlet x = 0\n\t\t\tlet y = y + 25\n\n\t\tendif\n\n\t\tlet x = x + 28\n\n\t\tformid i + 1\n\t\tformtext \"\"\n\t\tbuttonform x, y, 25, 20\n\n\tnext i\n\n\tformid 17\n\tformtext \"\n\tstaticform 40, 130, 100, 20\n\tbgcolor 0, 128, 0\n\tfgcolor 255, 255, 0\n\tcolorform\n\n\tformid 18\n\tformtext \"\"\n\tstaticform 40, 150, 100, 20\n\tbgcolor 0, 128, 0\n\tfgcolor 255, 255, 0\n\tcolorform\n\n\tformid 19\n\tformtext \"New\"\n\tbuttonform 1, 1, 50, 20\n\n\tformid 20\n\tformtext \"Help\"\n\tbuttonform 55, 1, 50, 20\n\n\tformid 21\n\tformtext \"About\"\n\tbuttonform 110, 1, 50, 20\n\n\tformid 22\n\tformtext \"Welcome.\"\n\tstaticform 40, 170, 120, 20\n\tbgcolor 0, 128, 0\n\tfgcolor 255, 255, 0\n\tcolorform\n\nreturn\n\nsub shuffle\n\n\tlet start = 1\n\n\tformid 22\n\tformtext \"shuffling...\"\n\tupdateform\n\n\tfor i = 0 to size - 1\n\n\t\tformid i + 1\n\t\tformtext \"\"\n\t\tupdateform\n\n\t\tlet list[i] = 0\n\n\tnext i\n\n\tlet t = 0\n\tlet i = 0\n\n\tdo\n\n\t\tif i = 14 then\n\n\t\t\tlet n = 120 - t\n\n\t\t\tformid i + 1\n\t\t\tformtext n\n\t\t\tupdateform\n\n\t\t\tlet list[i] = n\n\n\t\t\tbreak\n\n\t\tendif\n\n\t\tfor f = 0 to size - 1\n\n\t\t\tlet n = int(rnd * 15) + 1\n\t\t\tlet s = 0\n\n\t\t\tfor c = 0 to i - 1\n\n\t\t\t\tif n = list[c] then\n\n\t\t\t\t\tlet s = 1\n\t\t\t\t\tbreak c\n\n\t\t\t\tendif\n\n\t\t\tnext c\n\n\t\t\tif s = 0 and list[i] = 0 then\n\n\t\t\t\tformid i + 1\n\t\t\t\tformtext n\n\t\t\t\tupdateform\n\n\t\t\t\tlet list[i] = n\n\t\t\t\tlet t = t + n\n\t\t\t\tlet i = i + 1\n\n\t\t\tendif\n\n\t\t\twait\n\n\t\tnext f\n\n\tloop i < size - 1\n\n\tformid 22\n\tformtext \"\"\n\tupdateform\n\nreturn\n\nsub game\n\n\tdo\n\n\t\tlet click = forms\n\n\t\tif click > 0 and click < 17 and start = 1 then\n\n\t\t\tlet moves = moves + 1\n\n\t\t\tformid 17\n\t\t\tformtext \"Moves: \", moves\n\t\t\tupdateform\n\n\t\t\tgosub checkspaces\n\t\t\tgosub checkorder\n\n\t\tendif\n\n\t\tif click = 19 then\n\n\t\t\tgosub shuffle\n\n\t\t\tlet moves = 0\n\t\t\tlet correct = 0\n\n\t\t\tformid 17\n\t\t\tformtext \"Moves:\"\n\t\t\tupdateform\n\n\t\t\tformid 18\n\t\t\tformtext \"Correct:\"\n\t\t\tupdateform\n\n\t\tendif\n\n\t\tif click = 20 then\n\n\t\t\talert \"Click the numbers to move them in the correct order.\"\n\n\t\tendif\n\n\t\tif click =  21 then\n\n\t\t\talert \"15 Puzzle\", newline, \"by Gemino Smothers 2023 \", newline, \" www.lucidapogee.com\"\n\n\t\tendif\n\n\t\tbutton k, 27\n\n\t\twait\n\n\tloop k = 0\n\nreturn\n\nsub checkspaces\n\n\tlet click = click - 1\n\tlet top = click - 4\n\tlet right = click + 1\n\tlet bottom = click + 4\n\tlet left = click - 1\n\n\tif top >= 0 then\n\n\t\tif list[top] = 0 then\n\n\t\t\tlet n = top\n\t\t\tgosub swap\n\n\t\tendif\n\n\tendif\n\n\tif right <= size - 1 then\n\n\t\tif list[right] = 0 then\n\n\t\t\tlet n = right\n\t\t\tgosub swap\n\n\t\tendif\n\n\tendif\n\n\tif bottom <= size - 1 then\n\n\t\tif list[bottom] = 0 then\n\n\t\t\tlet n = bottom\n\t\t\tgosub swap\n\n\t\tendif\n\n\tendif\n\n\tif left >= 0 then\n\n\t\tif list[left] = 0 then\n\n\t\t\tlet n = left\n\t\t\tgosub swap\n\n\t\tendif\n\n\tendif\n\nreturn\n\nsub swap\n\n\tlet t = list[click]\n\tlet list[n] = list[click]\n\tlet list[click] = 0\n\n\tlet click = click + 1\n\tformid click\n\tformtext \"\"\n\tupdateform\n\n\tlet n = n + 1\n\tformid n\n\tformtext t\n\tupdateform\n\nreturn\n\nsub checkorder\n\n\tlet correct = 0\n\n\tfor i = 0 to size - 2\n\n\t\tif list[i] = i + 1 then\n\n\t\t\tlet correct = correct + 1\n\n\t\tendif\n\n\tnext i\n\n\tformid 18\n\tformtext \"Correct: \", correct\n\tupdateform\n\n\tif correct = size - 1 then \n\n\t\twait\n\t\talert \"You win! Moves: \", moves\n\n\tendif\n\nreturn\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_35.txt",
        "content": "const BoardWidth = 4; BoardHeight = 4;\nconst CellCount = BoardWidth * BoardHeight;\n\nvar GameBoard: array [0..BoardWidth-1,0..BoardHeight-1] of integer;\n\n\nprocedure BuildBoard;\n{Put all number in the game board}\nvar I,X,Y: integer;\nbegin\nfor I:=0 to CellCount-1 do\n\tbegin\n\tY:=I div BoardHeight;\n\tX:=I mod BoardWidth;\n\tGameBoard[X,Y]:=I;\n\tend;\nend;\n\n\nfunction IsWinner: boolean;\n{Check to see if tiles are winning in order}\nvar I,X,Y: integer;\nbegin\nResult:=False;\nfor I:=1 to CellCount-1 do\n\tbegin\n\tY:=(I-1) div BoardHeight;\n\tX:=(I-1) mod BoardWidth;\n\tif GameBoard[X,Y]<>I then exit;\n\tend;\nResult:=True;\nend;\n\n\nprocedure DisplayGameBoard(Grid: TStringGrid);\n{Display game on TStringGrid component}\nvar Tile,X,Y: integer;\nvar S: string;\nbegin\nfor Y:=0 to High(GameBoard) do\n\tbegin\n\tS:='';\n\tfor X:=0 to High(GameBoard[0]) do\n\t\tbegin\n\t\tTile:=GameBoard[X,Y];\n\t\tif Tile=0 then Form1.GameGrid.Cells[X,Y]:=''\n\t\telse Grid.Cells[X,Y]:=IntToStr(GameBoard[X,Y]);\n\t\tend;\n\tend;\nend;\n\n\n\nprocedure ExchangePieces(P1,P2: TPoint);\n{Exchange the pieces specified by P1 and P2}\nvar T: integer;\nbegin\nT:=GameBoard[P1.X,P1.Y];\nGameBoard[P1.X,P1.Y]:=GameBoard[P2.X,P2.Y];\nGameBoard[P2.X,P2.Y]:=T;\nend;\n\n\nprocedure Randomize;\n{Scramble piece by exchanging random pieces}\nvar I: integer;\nvar P1,P2: TPoint;\nbegin\nfor I:=0 to 100 do\n\tbegin\n\tP1:=Point(Random(BoardWidth),Random(BoardHeight));\n\tP2:=Point(Random(BoardWidth),Random(BoardHeight));\n\tExchangePieces(P1,P2);\n\tend;\nend;\n\n\nprocedure NewGame;\n{Initiate new game by randomizing tiles}\nbegin\nBuildBoard;\nRandomize;\nDisplayGameBoard(Form1.GameGrid);\nend;\n\n\n\nfunction FindEmptyNeighbor(P: TPoint): TPoint;\n{Find the empty neighbor cell if any}\n{Returns Point(-1,-1) if none found}\nbegin\nResult:=Point(-1,-1);\nif (P.X>0) and (GameBoard[P.X-1,P.Y]=0) then Result:=Point(P.X-1,P.Y)\nelse if (P.X<(BoardWidth-1)) and (GameBoard[P.X+1,P.Y]=0) then Result:=Point(P.X+1,P.Y)\nelse if (P.Y>0) and (GameBoard[P.X,P.Y-1]=0) then Result:=Point(P.X,P.Y-1)\nelse if (P.Y<(BoardHeight-1)) and (GameBoard[P.X,P.Y+1]=0) then Result:=Point(P.X,P.Y+1);\nend;\n\n\n\nprocedure ShowStatus(S: string; BellCount: integer);\n{Display status string and ring bell specified number of times}\nvar I: integer;\nbegin\nForm1.StatusMemo.Lines.Add(S);\nfor I:=1 to BellCount do PlaySound('DeviceFail', 0, SND_SYNC);\nend;\n\n\n\nprocedure HandleMouseClick(X,Y: integer; Grid: TStringGrid);\n{Handle mouse click on specified grid}\nvar Pos,Empty: TPoint;\nvar Item: integer;\nbegin\nGrid.MouseToCell(X, Y,Pos.X, Pos.Y);\nItem:=GameBoard[Pos.X,Pos.Y];\nEmpty:=FindEmptyNeighbor(Pos);\nif (Item>0) and (Empty.X>=0) then\n\tbegin\n\tExchangePieces(Empty,Pos);\n\tDisplayGameBoard(Grid);\n\tif IsWinner then ShowStatus('Winner', 5);\n\tend\nelse ShowStatus('Invalid Command.', 1);\nend;\n\n\n\nprocedure TForm1.NewGameBtnClick(Sender: TObject);\n{Create new game when button pressed}\nbegin\nNewGame;\nend;\n\n\nprocedure TForm1.GameGridMouseDown(Sender: TObject; Button: TMouseButton;\n  Shift: TShiftState; X, Y: Integer);\n{Use the mouse click event to select a move}\nbegin\nHandleMouseClick(X,Y,GameGrid);\nend;\n\nprocedure TForm1.FormCreate(Sender: TObject);\n{Start new game when the program starts running}\nbegin\nNewGame;\nend;\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_36.txt",
        "content": "sysconf topleft\nbackground 432\ntextsize 13\nlen f[] 16\nproc draw . .\n   clear\n   for i = 1 to 16\n      h = f[i]\n      if h < 16\n         x = (i - 1) mod 4 * 24 + 3\n         y = (i - 1) div 4 * 24 + 3\n         color 210\n         move x y\n         rect 22 22\n         move x + 4 y + 6\n         if h < 10\n            move x + 6 y + 6\n         .\n         color 885\n         text h\n      .\n   .\n.\nglobal done .\nproc smiley . .\n   s = 3.5\n   x = 86\n   y = 86\n   move x y\n   color 983\n   circle 2.8 * s\n   color 000\n   move x - s y - s\n   circle s / 3\n   move x + 3.5 y - 3.5\n   circle s / 3\n   linewidth s / 3\n   curve [ x - s y + s x y + 2 * s x + s y + s ]\n.\nproc init . .\n   done = 0\n   for i = 1 to 16\n      f[i] = i\n   .\n   # shuffle\n   for i = 15 downto 2\n      r = random i\n      swap f[r] f[i]\n   .\n   # make it solvable\n   inv = 0\n   for i = 1 to 15\n      for j = 1 to i - 1\n         if f[j] > f[i]\n            inv += 1\n         .\n      .\n   .\n   if inv mod 2 <> 0\n      swap f[1] f[2]\n   .\n   textsize 12\n   draw\n.\nproc move_tile . .\n   c = mouse_x div 25\n   r = mouse_y div 25\n   i = r * 4 + c + 1\n   if c > 0 and f[i - 1] = 16\n      swap f[i] f[i - 1]\n   elif r > 0 and f[i - 4] = 16\n      swap f[i] f[i - 4]\n   elif r < 3 and f[i + 4] = 16\n      swap f[i] f[i + 4]\n   elif c < 3 and f[i + 1] = 16\n      swap f[i] f[i + 1]\n   .\n   draw\n   for i = 1 to 15\n      if f[i] > f[i + 1]\n         return\n      .\n   .\n   done = 1\n   timer 0.5\n.\non mouse_down\n   if done = 0\n      move_tile\n   elif done = 3\n      init\n   .\n.\non timer\n   if done = 1\n      smiley\n      done = 2\n      timer 2\n   else\n      done = 3\n   .\n.\ninit\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_37.txt",
        "content": "// 15 Puzzle Game. Nigel Galloway: August 9th., 2020\nlet Nr,Nc,RA,rnd=[|3;0;0;0;0;1;1;1;1;2;2;2;2;3;3;3|],[|3;0;1;2;3;0;1;2;3;0;1;2;3;0;1;2|],[|for n in [1..16]->n%16|],System.Random()\nlet rec fN g \u03a3=function h::t->fN g (\u03a3+List.sumBy(fun n->if h>n then 1 else 0)t) t|_->(\u03a3-g/4)%2=1\nlet rec fI g=match if System.Console.IsInputRedirected then char(System.Console.Read()) else System.Console.ReadKey(true).KeyChar with\n               n when Seq.contains n g->printf \"%c\" n; (match n with 'l'-> -1|'r'->1|'d'->4|_-> -4)|_->System.Console.Beep(); fI g \nlet rec fG n \u03a3=function 0->(List.findIndex((=)0)\u03a3,\u03a3)|g->let i=List.item(rnd.Next(g)) n in fG(List.except [i] n)(i::\u03a3)(g-1)\nlet rec fE()=let n,g=fG [0..15] [] 16 in if fN n 0 (List.except [0] g) then (n,Array.ofList g) else fE()\nlet rec fL(n,g) \u03a3=let fa=printfn \"\";Array.chunkBySize 4 g|>Array.iter(fun n->Array.iter(printf \"%3d\")n;printfn \"\")\n                  match g=RA with true->printfn \"Solved in %d moves\" \u03a3; fa; 0\n                                 |_->let vM=match n/4,n%4 with (0,0)->\"rd\"|(0,3)->\"ld\"|(0,_)->\"lrd\"|(3,0)->\"ru\"|(3,3)->\"lu\"|(3,_)->\"lru\"|(_,0)->\"rud\"|(_,3)->\"lud\"|_->\"lrud\"\n                                     fa; printf \"Move Number: %2d; Manhatten Distance: %2d; Choose move from %4s: \" \u03a3\n                                         ([0..15]|>List.sumBy(fun n->match g.[n] with 0->0 |i->(abs(n/4-Nr.[i]))+(abs(n%4-Nc.[i])))) vM\n                                     let v=fI vM in g.[n]<-g.[n+v];g.[n+v]<-0;fL(n+v,g)(\u03a3+1)\n[<EntryPoint>]\nlet main n = fL(match n with [|n|]->let g=[|let g=uint64 n in for n in 60..-4..0->int((g>>>n)&&&15UL)|] in (Array.findIndex((=)0)g,g) |_->fE()) 0\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_38.txt",
        "content": "15 game with no parameters will generate a random game which may be solved.\nA solution in the form suggested in 15_puzzle_solver may be piped into 15game. \"dddrurdruuulllddrulddrrruuullddruulldddrrurulldrruulldlddrurullddrrruullulddrdrr\" | .\\15game 0x0c9dfbae37254861 produces the output here: 15_puzzle_solver/extra_credit/solution.\nOptionally a start position may be supplied. 15game 0x123450689a7bdefc may be solved:\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_39.txt",
        "content": "  1  2  3  4\n  5  0  6  8\n  9 10  7 11\n 13 14 15 12\nMove Number:  0; Manhatten Distance:  4; Choose move from lrud: r\n  1  2  3  4\n  5  6  0  8\n  9 10  7 11\n 13 14 15 12\nMove Number:  1; Manhatten Distance:  3; Choose move from lrud: d\n  1  2  3  4\n  5  6  7  8\n  9 10  0 11\n 13 14 15 12\nMove Number:  2; Manhatten Distance:  2; Choose move from lrud: r\n  1  2  3  4\n  5  6  7  8\n  9 10 11  0\n 13 14 15 12\nMove Number:  3; Manhatten Distance:  1; Choose move from  lud: d\n  1  2  3  4\n  5  6  7  8\n  9 10 11 12\n 13 14 15  0\nSolved in 4 moves\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_4.txt",
        "content": "DEFINE BOARDSIZE=\"16\"\nDEFINE X0=\"13\"\nDEFINE Y0=\"6\"\nDEFINE ITEMW=\"3\"\nDEFINE ITEMH=\"2\"\n\nBYTE ARRAY board(BOARDSIZE)\nBYTE emptyX,emptyY,solved,first=[1]\n\nBYTE FUNC Index(BYTE x,y)\nRETURN (x+y*4)\n\nPROC UpdateItem(BYTE x,y)\n  BYTE item\n\n  Position(X0+x*ITEMW+1,Y0+y*ITEMH+1)\n  item=board(Index(x,y))\n  IF item=0 THEN\n    Print(\"  \")\n  ELSEIF item<10 THEN\n    Put(160) Put(item+176)\n  ELSE\n    Put(item/10+176)\n    Put(item MOD 10+176)\n  FI\nRETURN\n\nPROC UpdateBoard()\n  BYTE x,y\n\n  FOR y=0 TO 3\n  DO\n    FOR x=0 TO 3\n    DO\n      UpdateItem(x,y)     \n    OD\n  OD\nRETURN\n\nPROC DrawGrid()\n  CHAR ARRAY\n    top=[13 17 18 18 23 18 18 23 18 18 23 18 18 5],\n    row=[13 124 32 32 124 32 32 124 32 32 124 32 32 124],\n    mid=[13 1 18 18 19 18 18 19 18 18 19 18 18 4],\n    bot=[13 26 18 18 24 18 18 24 18 18 24 18 18 3]\n  BYTE y,i\n\n  y=Y0\n  Position(X0,y) Print(top) y==+1\n  Position(X0,y) Print(row) y==+1\n  FOR i=0 TO 2\n  DO\n    Position(X0,y) Print(mid) y==+1\n    Position(X0,y) Print(row) y==+1\n  OD\n  Position(X0,y) Print(bot)\nRETURN\n\nPROC DrawBoard()\n  DrawGrid()\n  UpdateBoard()\nRETURN\n\nPROC FindEmpty()\n  BYTE i\n\n  FOR i=0 TO BOARDSIZE-1\n  DO\n    IF board(i)=0 THEN\n      emptyX=i MOD 4\n      emptyY=i/4\n    FI\n  OD\nRETURN\n\nPROC Wait(BYTE frames)\n  BYTE RTCLOK=$14\n  frames==+RTCLOK\n  WHILE frames#RTCLOK DO OD\nRETURN\n\nPROC UpdateStatus()\n  Position(9,3) Print(\"Game status: \")\n  IF solved THEN\n    Print(\"SOLVED\u00a0!\")\n    IF first=0 THEN\n      Sound(0,100,10,5) Wait(5)\n      Sound(0,60,10,5) Wait(5)\n      Sound(0,40,10,5) Wait(5)\n      Sound(0,0,0,0)\n    FI\n    first=0\n  ELSE\n    Print(\"Shuffled\")\n  FI\nRETURN\n\nPROC InitBoard()\n  BYTE i\n  \n  FOR i=1 TO BOARDSIZE\n  DO\n    board(i-1)=i MOD 16\n  OD\n  FindEmpty()\n  solved=1\n  UpdateStatus()\nRETURN\n\nBYTE FUNC IsSolved()\n  BYTE i\n\n  FOR i=1 TO BOARDSIZE\n  DO\n    IF board(i-1)#i MOD 16 THEN\n      RETURN (0)\n    FI\n  OD\nRETURN (1)\n\nPROC CheckStatus()\n  BYTE tmp\n\n  tmp=IsSolved()\n  IF solved#tmp THEN\n    solved=tmp\n    UpdateStatus()\n  FI\nRETURN\n\nPROC Swap(BYTE x1,y1,x2,y2)\n  BYTE tmp,i1,i2\n\n  i1=Index(x1,y1)\n  i2=Index(x2,y2)\n  tmp=board(i1)\n  board(i1)=board(i2)\n  board(i2)=tmp\n  UpdateItem(x1,y1)\n  UpdateItem(x2,y2)\n  CheckStatus()\nRETURN\n\nPROC Shuffle()\n  BYTE i,j,tmp\n\n  i=BOARDSIZE-1\n  WHILE i>0\n  DO\n    j=Rand(i)\n    tmp=board(i)\n    board(i)=board(j)\n    board(j)=tmp\n    i==-1\n  OD\n  FindEmpty()\n  UpdateBoard()\n  CheckStatus()\nRETURN\n\nPROC MoveLeft()\n  IF emptyX=0 THEN RETURN FI\n  Swap(emptyX,emptyY,emptyX-1,emptyY)\n  emptyX==-1\nRETURN\n\nPROC MoveRight()\n  IF emptyX=3 THEN RETURN FI\n  Swap(emptyX,emptyY,emptyX+1,emptyY)\n  emptyX==+1\nRETURN\n\nPROC MoveUp()\n  IF emptyY=0 THEN RETURN FI\n  Swap(emptyX,emptyY,emptyX,emptyY-1)\n  emptyY==-1\nRETURN\n\nPROC MoveDown()\n  IF emptyY=3 THEN RETURN FI\n  Swap(emptyX,emptyY,emptyX,emptyY+1)\n  emptyY==+1\nRETURN\n\nPROC Main()\n  BYTE k,lastStick=[255],currStick,\n    CH=$02FC, ;Internal hardware value for last key pressed\n    CRSINH=$02F0 ;Controls visibility of cursor\n\n  Graphics(0)\n  SetColor(2,0,2)\n  CRSINH=1 ;hide cursor\n  Position(10,18) Print(\"Joystick - move tiles\")\n  Position(9,19) Print(\"Space bar - shuffle\")\n  Position(15,20) Print(\"ESC - exit\")\n  InitBoard()\n  DrawBoard()\n  DO\n    currStick=Stick(0)\n    IF currStick#lastStick THEN\n      IF currStick=11 THEN MoveRight()\n      ELSEIF currStick=7 THEN MoveLeft()\n      ELSEIF currStick=13 THEN MoveUp()\n      ELSEIF currStick=14 THEN MoveDown()\n      FI\n    FI\n    lastStick=currStick\n    k=CH\n    IF k#$FF THEN CH=$FF FI\n    IF k=33 THEN Shuffle()\n    ELSEIF k=28 THEN EXIT\n    FI\n  OD\nRETURN",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_40.txt",
        "content": "USING: accessors combinators combinators.extras\ncombinators.short-circuit grouping io kernel literals math\nmath.matrices math.order math.parser math.vectors prettyprint qw\nrandom sequences sequences.extras ;\nIN: rosetta-code.15-puzzle-game\n\n<<\n\nTUPLE: board matrix zero ;\n\n: <board> ( -- board )\n    16 <iota> 1 rotate 4 group { 3 3 } board boa ;\n\n>>\n\nCONSTANT: winning $[ <board> matrix>> ]\n\n: input>dir ( str -- pair )\n    {\n        { \"u\" [ { 1 0 } ] }\n        { \"d\" [ { -1 0 } ] }\n        { \"l\" [ { 0 1 } ] }\n        { \"r\" [ { 0 -1 } ] }\n    } case ;\n\n: get-index ( loc matrix -- elt ) [ first2 swap ] dip nth nth ;\n\n: mexchange ( loc1 loc2 matrix -- )\n    tuck [ [ [ get-index ] keepd ] 2bi@ ] keep [ spin ] 2dip\n    [ set-index ] keep set-index ;\n\n: vclamp+ ( seq1 seq2 -- seq ) v+ { 0 0 } { 3 3 } vclamp ;\n\n: slide-piece ( board str -- )\n    over zero>> [ vclamp+ ] keep rot matrix>> mexchange ;\n\n: move-zero ( board str -- )\n    [ vclamp+ ] curry change-zero drop ;\n\n: move ( board str -- )\n    input>dir [ slide-piece ] [ move-zero ] 2bi ;\n\n: rand-move ( board -- ) qw{ u d l r } random move ;\n\n: shuffle-board ( board n -- board' ) [ dup rand-move ] times ;\n\n: .board ( board -- ) matrix>> simple-table. ;\n\n: get-input ( -- str )\n    \"Your move? (u/d/l/r/q) \" write flush readln dup\n    qw{ u d l r q } member? [ drop get-input ] unless ;\n\n: won? ( board -- ? ) matrix>> winning = ;\n\nDEFER: game\n: process-input ( board -- board' )\n    get-input dup \"q\" = [ drop ] [ game ] if ;\n\n: check-win ( board -- board' )\n    dup won? [ \"You won!\" print ] [ process-input ] if ;\n\n: game ( board str -- board' )\n    [ move ] keepd dup .board check-win ;\n\n: valid-difficulty? ( obj -- ? )\n    { [ fixnum? ] [ 3 100 between? ] } 1&& ;\n\n: choose-difficulty ( -- n )\n    \"How many shuffles? (3-100) \" write flush readln\n    string>number dup valid-difficulty?\n    [ drop choose-difficulty ] unless ;\n\n: main ( -- )\n    <board> choose-difficulty shuffle-board dup .board check-win\n    drop ;\n\nMAIN: main\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_41.txt",
        "content": "How many shuffles? (3-100) 5\n1  2  3  4\n5  6  7  8\n9  0  10 12\n13 14 11 15\nYour move? (u/d/l/r/q) apple\nYour move? (u/d/l/r/q) l\n1  2  3  4\n5  6  7  8\n9  10 0  12\n13 14 11 15\nYour move? (u/d/l/r/q) u\n1  2  3  4\n5  6  7  8\n9  10 11 12\n13 14 0  15\nYour move? (u/d/l/r/q) l\n1  2  3  4\n5  6  7  8\n9  10 11 12\n13 14 15 0\nYou won!\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_42.txt",
        "content": "#! /usr/bin/gforth\n\ncell 8 <> [if] s\" 64-bit system required\" exception throw [then]\n\n\\ In the stack comments below,\n\\ \"h\" stands for the hole position (0..15),\n\\ \"s\" for a 64-bit integer representing a board state,\n\\ \"t\" a tile value (0..15, 0 is the hole),\n\\ \"b\" for a bit offset of a position within a state,\n\\ \"m\" for a masked value (4 bits selected out of a 64-bit state),\n\\ \"w\" for a weight of a current path,\n\\ \"d\" for a direction constant (0..3)\n\n\\ Utility\n: 3dup   2 pick 2 pick 2 pick ;\n: 4dup   2over 2over ;\n: shift   dup 0 > if lshift else negate rshift then ;\n\nhex 123456789abcdef0 decimal constant solution\n: row   2 rshift ;   : col   3 and ;\n\n: up-valid?    ( h -- f ) row 0 > ;\n: down-valid?  ( h -- f ) row 3 < ;\n: left-valid?  ( h -- f ) col 0 > ;\n: right-valid? ( h -- f ) col 3 < ;\n\n\\ To iterate over all possible directions, put direction-related functions into arrays:\n: ith ( u addr -- w ) swap cells + @ ;\ncreate valid? ' up-valid? , ' left-valid? , ' right-valid? , ' down-valid? , does> ith execute ;\ncreate step -4 , -1 , 1 , 4 , does> ith ;\n\n\\ Advance from a single state to another:\n: bits ( h -- b ) 15 swap - 4 * ;\n: tile ( s b -- t ) rshift 15 and ;\n: new-state ( s h d -- s' ) step dup >r + bits 2dup tile ( s b t ) swap lshift tuck - swap r> 4 * shift + ;\n\n: hole? ( s u -- f ) bits tile 0= ;\n: hole ( s -- h ) 16 0 do dup i hole? if drop i unloop exit then loop drop ;\n\n0 constant up 1 constant left 2 constant right 3 constant down\n\n\\ Print a board:\n: .hole   space space space ;\n: .tile ( u -- ) ?dup-0=-if .hole else dup 10 < if space then . then ;\n: .board ( s -- ) 4 0 do cr 4 0 do dup j 4 * i + bits tile .tile loop loop drop ;\n: .help   cr .\" ijkl move, q quit\" ;\n\n\\ Pseudorandom number generator:\ncreate (rnd)   utime drop ,\n: rnd   (rnd) @ dup 13 lshift xor dup 17 rshift xor dup dup 5 lshift xor (rnd) ! ;\n\n: move ( s u -- s' ) >r dup hole r> new-state ;\n: ?move ( s u -- s' ) >r dup hole r@ valid? if r> move else rdrop then ;\n: shuffle ( s u -- s' ) 0 do rnd 3 and ?move loop ;\n\n: win   cr .\" you won!\" bye ;\n: turn ( s -- )\n\tpage dup .board .help\n\tkey case\n\t\t[char] q of bye endof\n\t\t[char] i of down ?move endof\n\t\t[char] j of right ?move endof\n\t\t[char] k of up ?move endof\n\t\t[char] l of left ?move endof\n\tendcase ;\n\n: play  begin dup solution <> while turn repeat win ;\n\nsolution 1000 shuffle play\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_43.txt",
        "content": "LOCZ = MINLOC(BOARD)\t!Find the zero. 0 = BOARD(LOCZ(1),LOCZ(2)) == BOARD(ZC,ZR)\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_44.txt",
        "content": "      SUBROUTINE SWAP(I,J)\t!Alas, furrytran does not provide this.\n       INTEGER I,J,T\t\t!So, we're stuck with supplying the obvious.\n        T = I\t\t\t!And, only for one type at a go.\n        I = J\t\t\t!One could define a MODULE containing a collection\n        J = T\t\t\t!And thence a \"generic\" routine,\n      END SUBROUTINE SWAP\t!But this will do for now.\n\n      SUBROUTINE SHOW(NR,NC,BOARD)\t!The layout won't work for NC > 99...\n       INTEGER NR,NC\t\t!Number of rows and columns.\n       INTEGER BOARD(NC,NR)\t!The board is stored transposed!\n       INTEGER I\t\t!A stepper.\n       COMMON/IODEV/ MSG\t!I talk to the trees...\n        WRITE (MSG,1) (I,I = 1,NC)\t!Prepare a heading.\n    1   FORMAT (\"Row|\",9(\"__\",I1,:),90(\"_\",I2,:))\t!This should suffice.\n        DO I = 1,NR\t\t!Chug down the rows.\n          WRITE (MSG,2) I,BOARD(1:NC,I)\t!The columns of the row. Usage is BOARD(column,row).\n    2     FORMAT (I3,\"|\",99I3)\t!Could use parameters, but enough.\n        END DO\t\t\t!On to the next row.\n      END SUBROUTINE SHOW\t!That was nice.\n\n      PROGRAM PUZZLE\n      INTEGER LOCN(2),NR,NC,N\t!Describes the shape of the board.\n      INTEGER LOCZ(2),ZC,ZR\t!Fingers the location of the \"blank\" square.\n      INTEGER LOCI(2),IC,IR\t!Fingers a location.\nCan't EQUIVALENCE (LOCN(1),NC),(LOCN(2),NR)\t!This usage and a PARAMETER statement is too scary.\n      EQUIVALENCE (LOCZ(1),ZC),(LOCZ(2),ZR)\t!Annotate my (column,row) usage.\n      EQUIVALENCE (LOCI(1),IC),(LOCI(2),IR)\t!Rather than the displayed (row,column) style.\n      PARAMETER (NR = 4, NC = 4, N = NR*NC)\t!Determine the shape of the board.\n      INTEGER BOARD(NC,NR)\t\t!Thus transpose furrytran's column-major usage. Beware!!!\n      INTEGER BORED(N)\t\t\t!This allows for consecutive comparisons.\n      EQUIVALENCE (BOARD,BORED)\t\t!Because the arrays are in the same place.\n      INTEGER WAYS\t\t\t!Now define adjacency.\n      PARAMETER (WAYS = 4)\t\t!Just orthogonal neghbours.\n      INTEGER WAY(2,WAYS)\t\t!Now list the allowed adjacencies.\n      PARAMETER (WAY = (/1,0, 0,1, -1,0, 0,-1/))\t!W(1,1), W(2,1), W(1,2), W(2,2), W(1,3), ...\n      INTEGER M,MOVE(WAYS),LOCM(2,WAYS)\t!Move possibilities.\n      INTEGER SPACE\t\t\t!Document the empty square's code number.\n      PARAMETER (SPACE = 0)\t\t!Zero will do.\n      INTEGER I,IT,PARITY,TRY\t\t!Odds and ends.\n      REAL VALUE\t\t\t!Humph. Yet another interface to a \"random\" number generator.\n      COMMON/IODEV/ MSG,KBD\t!Pass the word.\n\n      KBD = 5\t!Standard input. (Keyboard -> Display screen)\n      MSG = 6\t!Standard output. (Display screen)\n      WRITE (MSG,1) NR,NC\t!Announce.\n    1 FORMAT (\"To play 'slide-square' with \",I0,\" rows and \",\n     1 I0,\" columns.\",/,\"The game is to slide a square into the space\",/\n     2 \"(thus leaving a space behind) until you attain\"/\n     3 \"the nice orderly layout as follows:\",/)\nConcoct a board layout.\n   10 FOR ALL (I = 1:N - 1) BORED(I) = I\t!Prepare the board. Definitely unique values.\n      BORED(N) = SPACE\t        !The empty square is not at the start! Oh well.\n      CALL SHOW(NR,NC,BOARD)\t!Reveal the nice layout.\n   11 DO I = 1,N - 1\t\t!Now shuffle the squares a bit.\n        CALL RANDOM(VALUE)\t\t!0 <= VALUE < 1.\n        IT = VALUE*(N - 1) + 1\t\t!1 <= IT < N. Don't round up!\n        IF (I.NE.IT) CALL SWAP(BORED(I),BORED(IT))\t!Whee!\n      END DO\t\t\t!On to the next victim, leaving the last cell alone.\nCalculate the parity, knowing the space is at the end. The target state has even parity, with zero inversions.\n      PARITY = 0\t!There are two classes of arrangements, that can't mix.\n      DO I = 1,N - 2\t!Skipping the blank cell still at BORED(N).\n        PARITY = PARITY + COUNT(BORED(I) > BORED(I + 1:N - 1))\t!For each square,\n      END DO\t\t!Count the inversions following.\n      IF (MOD(PARITY,2).NE.0) GO TO 11\t!No transition can change the parity, so, try for another arrangement.\nChoose a new position for the space. Using approved moves will not change the parity.\n      CALL RANDOM(VALUE)\t\t!0 <= VALUE < 1.\n      ZC = VALUE*(NC - 2) + 1\t\t!1 <= ZC < NC: Choose a random column other than the last.\n      BOARD(ZC + 1:NC,NR) = BOARD(ZC:NC - 1,NR)\t!Shift the end of the last row back one place.\n      BOARD(ZC,NR) = SPACE\t\t\t!Put the space in the hole.\n      CALL RANDOM(VALUE)\t\t\t!So the parity doesn't change.\n      ZR = VALUE*(NR - 2) + 1\t\t!1 <= ZR < NR: Choose a random row, other than the last.\n      BOARD(ZC,ZR + 1:NR) = BOARD(ZC,ZR:NR - 1)\t!Shift the end of column ZC up one.\n      BOARD(ZC,ZR) = SPACE\t\t\t!Revive the space again.\nCast forth the starting position.\n      WRITE (MSG,12)\t\t!Announce the result.\n   12 FORMAT (/,\"But, your board looks like this...\")\t!Alas. Almost certainly not in order.\n      CALL SHOW(NR,NC,BOARD)\t!Just so.\n      TRY = 0\t\t!No moves made yet.\n\nConsider possible moves.\n   20 TRY = TRY + 1\t!Here we go again.\n      M = 0\t\t!No moveable pieces are known.\n      DO I = 1,WAYS\t!So scan the possible ways away from LOCZ.\n        LOCI = LOCZ + WAY(1:2,I)\t!Finger an adjacent location, via the adjacency offsets in array WAY.\n        IF (ALL(LOCI > 0) .AND. ALL(LOCI <= (/NC,NR/))) THEN\t!Within bounds?\n          M = M + 1\t\t\t!Yes. We have a candidate.\n          MOVE(M) = BOARD(IC,IR)\t!Record the piece's name.\n          LOCM(:,M) = LOCI\t\t!And, remember where it is...\n        END IF\t\t\t!So much for that location.\n      END DO\t\t!Try another offset.\n   21 WRITE (MSG,22,ADVANCE=\"no\") MOVE(1:M)\t!Two-stage output.\n   22 FORMAT (\"Moveable pieces: \",<WAYS>(I0:\",\"))\t!Since M is not necessarily WAYS, a trailing $ may not be reached..\n      WRITE (MSG,23)\t\t!Now for the question. Always at least two moveable squares.\n   23 FORMAT(\". Choose one: \",$)\t!Continue the line, presuming screen and keyboard->screen.\n      READ (KBD,*) IT\t\t!Now request the answer. Rather doggedly: blank lines won't do.\n      DO I = M,1,-1\t\t!There are at least two possible moves.\n        IF (MOVE(I) .EQ. IT) EXIT\t!Perhaps this piece was selected.\n      END DO\t\t\t!The INDEX function is alas, only for CHARACTER variables. Grr.\n      IF (I .LE. 0) THEN\t!I'm suspicious.\n        WRITE (MSG,*) \"Huh? That is not a moveable piece!\"\t!Justified!\n        IF (IT.GT.0) GO TO 21\t\t!Try again.\n        STOP \"Oh well.\"\t\t\t!Or quit, on negative vibrations.\n      END IF\t\t\t!So much for selecting a piece.\nComplete the selected move.\n   30 BOARD(ZC,ZR) = IT\t\t!Place the named piece where the space was.\n      LOCZ = LOCM(:,I)\t\t!The space is now where that piece came from.\n      BOARD(ZC,ZR) = SPACE\t\t!And now holds a space.\nc      write (6,*)\nc     1 \"disorder=\",COUNT(BORED(1:N - 2) + 1 .NE. BORED(2:N - 1))\n      IF (TRY.LE.6) WRITE (MSG,31)\t!Set off with a nice heading.\n   31 FORMAT (/\"The new layout...\")\t!Just for clarity.\n      CALL SHOW(NR,NC,BOARD)\t\t!Perhaps it will be good.\nCheck for success.\n      IF (BORED(N).NE.SPACE) GO TO 20\t!Is the space at the end?\n      IF (ANY(BORED(1:N - 2) + 1 .NE. BORED(2:N - 1))) GO TO 20\t!Are we there yet?\n      WRITE (MSG,*) TRY,\"Steps to success!\"\t!Yes!\n      END\t!That was fun.\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_45.txt",
        "content": "To play 'slide-square' with 4 rows and 4 columns.\nThe game is to slide a square into the space\n(thus leaving a space behind) until you attain\nthe nice orderly layout as follows:\n\nRow|__1__2__3__4\n  1|  1  2  3  4\n  2|  5  6  7  8\n  3|  9 10 11 12\n  4| 13 14 15  0\n\nBut, your board looks like this...\nRow|__1__2__3__4\n  1| 15  0 14 11\n  2|  8 13  5  3\n  3|  4  1  7  9\n  4| 10  6  2 12\nMoveable pieces: 14,13,15. Choose one: 15\n\nThe new layout...\nRow|__1__2__3__4\n  1|  0 15 14 11\n  2|  8 13  5  3\n  3|  4  1  7  9\n  4| 10  6  2 12\nMoveable pieces: 15,8. Choose one:\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_46.txt",
        "content": "sub drawboard( B() as ubyte )\n    dim as string outstr = \"\"\n    for i as ubyte = 0 to 15\n        if B(i) = 0 then \n            outstr = outstr + \" XX \"\n        elseif B(i) < 10 then\n            outstr = outstr + \"  \"+str(B(i))+\" \"\n        else\n            outstr = outstr + \" \" +str(B(i))+\" \"\n        end if\n        if i mod 4 = 3 then \n            print outstr\n            print\n            outstr = \"\"\n        end if\n    next i\n    print\nend sub\n\nfunction move( B() as ubyte, byref gap as ubyte, direction as ubyte ) as ubyte\n    dim as integer targ = gap\n    select case direction\n        case 1  'UP\n            targ = gap - 4\n        case 2  'RIGHT\n            if gap mod 4 = 3 then return gap\n            targ = gap + 1\n        case 3  'DOWN\n            targ = gap + 4\n        case 4\n            if gap mod 4 = 0 then return gap\n            targ = gap - 1\n        case else\n            return gap\n    end select\n    if targ > 15 or targ < 0 then return gap\n    swap B(targ), B(gap)\n    return targ\nend function\n\nsub shuffle( B() as ubyte, byref gap as ubyte )\n    for i as ubyte = 0 to 100\n        gap = move(B(), gap, int(rnd*4) + 1)\n    next i\nend sub\n\nfunction solved( B() as ubyte ) as boolean\n    dim as integer i\n    for i = 0 to 14\n        if B(i)>B(i+1) then return false\n    next i\n    return true\nend function\n\ndim as ubyte i, B(15), direction, gap\nfor i = 0 to 15\n    B(i) = i\nnext i\nshuffle B(), gap\n\n\nwhile not solved( B() )\n    cls\n    drawboard B()\n    print gap\n    print \"1 = up, 2=right, 3=down, 4=left\"\n    input direction\n    gap = move( B(), gap, direction )\nwend\n\ncls\nprint \"Congratulations! You win!\"\nprint\ndrawboard B()\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_47.txt",
        "content": "// 15 Puzzle // 26 september 2023 //\n\nbegin globals\nCFMutableStringRef board\u00a0: board = fn MutableStringNew\nend globals\n\n\nvoid local fn buildUI\n  Long i, j, k = 1 // k is button number\n  window 1, @\"15 Puzzle\", ( 0, 0, 200, 200 ), 3\n  for j = 3 to 0 step -1\u00a0: for i = 0 to 3 // Top to bottom, left to right\n    button k, Yes, 1, @\"\",  ( 20 + 40 * i, 20 + 40 * j , 40, 40 ), , NSBezelStyleShadowlessSquare\n    ControlSetFont(k, fn FontSystemFontOfSize( 21 ) )\n    ControlSetAlignment( k, NSTextAlignmentCenter )\n    k ++\n  next\u00a0: next\n  menu 1, , 1, @\"File\": menu 1, 1, , @\"Close\", @\"w\"\u00a0: MenuItemSetAction( 1, 1, @\"performClose:\" )\n  editmenu 2\u00a0: menu 2, 0, No\u00a0: menu 3, , , @\"Level\"\n  for i = 1 to 8\u00a0: menu 3, i, , str( i )\u00a0: next\n  MenuSetOneItemOnState( 3, 3 )\nend fn\n\n\nvoid local fn newGame\n  CFStringRef s\n  Long i, m, n = 16, p = 0 // n is empty starting tile, p holds previous move\n  Bool ok\n  MutableStringSetString (board, @\" 123456789ABCDEF \" )\n  for i = 1 to fn MenuSelectedItem( 3 )^2 // Number of shuffles is square of level\n    do\u00a0: ok = Yes\n      m = n + int( 2.6 * rnd( 4 ) - 6.5 )       // Choose a random move, but\n      if m < 1 or m > 16 or m == p then ok = No // not of bounds or previous,\n      if n mod 4 = 0 and m = n + 1 then ok = No // and don't exchange eg tile 4 and 5\n      if n mod 4 = 1 and m = n - 1 then ok = No // or 9 and 8\n    until ok = Yes // Found a move, swap in board string\n    s = mid( board, m, 1 )\u00a0: mid( board, m, 1 ) = @\" \"\u00a0: mid( board, n, 1 ) = s\n    p = n\u00a0: n = m\n  next\n  for i = 1 to 16 // Stamp the buttons, p is unicode of board char, s is button title\n    p = (Long) fn StringCharacterAtIndex( board, i )\n    if p > 64 then s = fn StringWithFormat ( @\"%d\", p - 55 ) else s = mid( board, i, 1 )\n    button i, Yes, 1, s\n    if fn StringIsEqual( s, @\" \") == Yes then button i, No\n  next\nend fn\n\n\nvoid local fn move ( n as Long )\n  CFStringRef s\n  Long i, m, x = -1 // x is empty plot\n  Bool ok\n  for i = 1 to 4 // see if clicked button is next to empty plot\n    m = n + int( 2.6 * i - 6.5 ) // -4. -1, +1, +4\n    ok = Yes\n    if m < 1 or m > 16 then ok = No // Not out of bounds etc\n    if n mod 4 = 0 and m = n + 1 then ok = No\n    if n mod 4 = 1 and m = n - 1 then ok = No\n    if ok == Yes\n      if fn StringIsEqual( mid( board, m, 1 ), @\" \" ) then x = m\n    end if    \n  next\n  if x > -1 // Swap places in board string and button titles\n    s = mid( board, n, 1 )\u00a0: mid( board, n, 1 ) = @\" \"\u00a0: mid( board, x, 1 ) = s\n    button x, Yes, 1 , fn ButtonTitle( n )\u00a0: button n, No, 1, @\" \"\n  end if\n  if fn StringIsEqual( board, @\" 123456789ABCDEF \" )\n    alert 112, , @\"Well done.\", @\"Another game?\", @\"Yes;No\", Yes\n  end if\nend fn\n\n\nvoid local fn doMenu( mnu as Long, itm as Long )\n  if mnu == 3 then MenuSetOneItemOnState( 3, itm )\u00a0: fn newGame\nend fn\n\n\nvoid local fn DoDialog( evt as Long, tag as Long )\n  select evt\n    case _btnClick\u00a0: fn move( tag )\n    case _alertDidEnd\u00a0: if tag == NSAlertFirstButtonReturn then fn newGame else end\n  end select\nend fn\n\nfn buildUI\nfn newGame\n\non dialog fn doDialog\non menu fn doMenu\nhandleevents",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_48.txt",
        "content": "'Charlie Ogier (C) 15PuzzleGame 24/04/2017 V0.1.0 Licenced under MIT\n'Inspiration came from: -\n''http://rosettacode.org/wiki/15_Puzzle_Game\n''Bugs or comments to bugs@cogier.com\n'Written in Gambas 3.9.2 - Updated on the Gambas Farm 01/05/2017\n'Updated so that the message and the Title show the same amount of moves 01/06/2017\n'Form now expandable. Font height automated. Form size and position saved 06/06/2107\n\n'Simulate playing the 15 - game(puzzle)         Yes in GUI\n'Generate a random start position               Yes\n'Prompt the user for which piece To move        No\n'Validate if the move is legal(possible)        Yes\n'Display the game(puzzle) as pieces are moved   Yes in GUI\n'Announce when the puzzle is solved             Yes\n'Possibly keep track of the number of moves     Yes\n\nbyPos As New Byte[]                                             'Stores the position of the 'Tiles'\nsiMoves As Short                                                'Stores the amount of moves\nhTimer As Timer                                                 'Timer\ndTimerStart As Date                                             'Stores the start time \ndTimerDiff As Date                                              'Stores the time from the start to now\nbTimerOn As Boolean                                             'To know if the Timer is running\n\nPublic Sub Form_Open()                                          'Form opens\n\nSettings.read(Me, \"Window\")                                     'Get details of the last window position and size\nWith Me                                                         'With the Form..\n  .Padding = 5                                                  'Pad the edges\n  .Arrangement = Arrange.Row                                    'Arrange the Form\n  .Title = \"15PuzzleGame v0.3.0\"                                'Set the Form Title\nEnd With\n\nBuildForm                                                       'Go to the BuildForm routine\n\nEnd\n\nPublic Sub BuildForm()                                          'To add items to the Form\nDim hButton As Button                                           'We need some Buttons\nDim byRand, byTest As Byte                                      'Various variables\nDim bOK As Boolean                                              'Used to stop duplicate numbers being added\nDim bSolvable As Boolean\n\nRepeat                                                          'Repeat until the puzzle is solvable    \n  Do                                                            'Start of a Do loop to create 0 to 15 in random order\n    byRand = Rand(0, 15)                                        'Get a random number between 0 and 15\n    If byRand = 0 Then byRand = 99                              'Change 0 to 99 for the Blank space\n    bOK = True                                                  'Set bOK to True\n    For Each byTest In byPos                                    'For each number stored in the array byPos\n      If byRand = byTest Then bOK = False                       'Check to see if it already exists, if it does set bOK to False\n    Next\n    If bOK Then byPos.Add(byRand)                               'If not a duplicate then add it to the array\n    If byPos.max = 15 Then Break                                'Once the array has 16 numbers get out of here. 99 is used for the blank space\n  Loop\n  bSolvable = IsItSolvable()                                    'Go to the 'check if puzzle is solvable' routine\n  If Not bSolvable Then byPos.clear                             'If it's not solvable then clear byPos\nUntil bSolvable = True                                          'Repeat until the puzzle is solvable\n\nFor byRand = 0 To 15                                            'Loop\n  If byPos[byRand] = 99 Then                                    'Check if value is 99 as this is where the blank space will go\n    AddPanel                                                    'Go to the AddPanel routine to add the blank space\n    Continue                                                    'Skip to the end of the loop\n  Endif\n  hButton = New Button(Me) As \"AllButtons\"                      'Add a new button to the Form, all buttons grouped as 'AllButtons'\n  With hButton                                                  'With the following properties\n    .Text = Str(byPos[byRand])                                  'Add Button text \n    .Tag = Str(byPos[byRand])                                   'Add a Tag\n    .Height = (Me.Height - 10) / 4                              'Set the Button height\n    .Width = (Me.Width - 10) / 4                                'Set the Button width\n    .Font.Bold = True                                           'Set the font to Bold\n    .Font.Size = 16                                             'Set Font size\n  End With\nNext\n\nAddTimer                                                        'Go to the AddTimer routine\n\nEnd\n\n\nPublic Sub AddPanel()                                           'Routine to add an invisible panel that is the blank area\nDim hPanel As Panel                                             'We need a Panel\n\nHPanel = New Panel(Me)                                          'Add the Panel to the Form\nWith HPanel                                                     'With the following Properties\n  .Tag = 99                                                     'Set a Tag to 99\n  .Height = (Me.Height - 10) / 4                                'Set the height\n  .Width = (Me.Width - 10) / 4                                  'Set the width\nEnd With\n\nEnd\n\nPublic Sub AddTimer()                                           'To add a Timer\n\nhTimer = New Timer As \"MyTimer\"                                 'Add a Timer\nhTimer.Delay = 1000                                             'Set the timer delay \n\nEnd\n\nPublic Sub MyTimer_Timer()                                      'Timer\n\nMe.Title = siMoves & \" Moves \"                                  'Set the Form Title to show the amount of moves taken\n\nIf dTimerStart Then                                             'If a start time has been set then\n  dTimerDiff = Time(Now) - dTimerStart                          'Calculate the time difference between StartTime and Now\n  Me.Title &= \" - \" & Str(dTimerDiff)                           'Add the time taken to the Form Title\nEnd If\n\nEnd\n\nPublic Sub AllButtons_Click()                                   'What to do when a Button is clicked\nDim byLast As Byte = Last.Tag                                   'Get the Tag of the Button clicked\nDim byTemp, byCount As Byte                                     'Various variables\nDim byCheck As Byte[] = [88, 88, 88, 88]                        'Used for checking for the blank space\nDim byWChgeck As New Byte[16, 4]\nDim oObj As Object                                              'We need to enumerate Objects\n\nFor Each oObj In Me.Children                                    'For each Object (Buttons in this case) that are Children of the Form..\n  If oObj.Tag = byLast Then Break                               'If the Tag of the Button matches then we know the position of the Button on the form so get out of here\n  Inc byCount                                                   'Increase the value of byCount\nNext\n\nSelect Case byCount                                             'Depending on the position of the Button\n  Case 0                                                        'e.g 0 then we need to check positions 1 & 4 for the blank\n    byCheck[0] = 1\n    byCheck[1] = 4\n  Case 1\n    byCheck[0] = 0\n    byCheck[1] = 2\n    byCheck[2] = 5\n  Case 2\n    byCheck[0] = 1\n    byCheck[1] = 3\n    byCheck[2] = 6\n  Case 3\n    byCheck[0] = 2\n    byCheck[1] = 7\n  Case 4\n    byCheck[0] = 0\n    byCheck[1] = 5\n    byCheck[2] = 8\n  Case 5                                                        'e.g 5 then we need to check positions 1, 4, 6 & 9 for the blank\n    byCheck[0] = 1\n    byCheck[1] = 4\n    byCheck[2] = 6\n    byCheck[3] = 9\n  Case 6\n    byCheck[0] = 2\n    byCheck[1] = 5\n    byCheck[2] = 7\n    byCheck[3] = 10\n  Case 7\n    byCheck[0] = 3\n    byCheck[1] = 6\n    byCheck[2] = 11\n  Case 8\n    byCheck[0] = 4\n    byCheck[1] = 9\n    byCheck[2] = 12\n  Case 9\n    byCheck[0] = 5\n    byCheck[1] = 8\n    byCheck[2] = 10\n    byCheck[3] = 13\n  Case 10\n    byCheck[0] = 6\n    byCheck[1] = 9\n    byCheck[2] = 11\n    byCheck[3] = 14\n  Case 11\n    byCheck[0] = 7\n    byCheck[1] = 10\n    byCheck[2] = 15\n  Case 12\n    byCheck[0] = 8\n    byCheck[1] = 13\n  Case 13\n    byCheck[0] = 9\n    byCheck[1] = 12\n    byCheck[2] = 14\n  Case 14\n    byCheck[0] = 10\n    byCheck[1] = 13\n    byCheck[2] = 15\n  Case 15\n    byCheck[0] = 11\n    byCheck[1] = 14\nEnd Select\n\nFor Each byTemp In byCheck                                      'For each value in byCheck\n  If byTemp = 88 Then Break                                     'If byTemp = 88 then get out of here\n  If byPos[byTemp] = 99 Then                                    'If the position checked is 99 (the blank) then..\n    byPos[byTemp] = Last.Text                                   'Set the new position of the Tile in byPos\n    byPos[byCount] = 99                                         'Set the existing Tile position to = 99 (blank)\n    Inc siMoves                                                 'Inc the amount of moves made\n    If Not bTimerOn Then                                        'If the Timer is now needed then \n      dTimerStart = Time(Now)                                   'Set the Start time to NOW\n      hTimer.start                                              'Start the Timer\n      bTimerOn = True                                           'Set bTimerOn to True \n    Endif\n    Break                                                       'Get out of here\n  End If\nNext\n\nRebuildForm                                                     'Go to the RebuilForm routine\nCheckIfPuzzleCompleted                                          'Check to see if the puzzle has been solved\n\nEnd\n\nPublic Sub CheckIfPuzzleCompleted()                             'Is the puzzle is complete\nDim byTest As Byte[] = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 99] 'byPos will equal this if it is completed\nDim siCount As Short                                            'Counter\nDim bCompleted As Boolean = True                                'Completed?\nDim sMessage As String                                          'String to store the display message\n\nFor siCount = 0 To 15                                           'Loop through the byPos\n  If byPos[siCount] <> byTest[siCount] Then                     'If the position does not match the completed position then..\n    bCompleted = False                                          'Set bCompleted to False\n    Break                                                       'Get out of here\n  Endif\nNext\n\nIf bCompleted Then                                              'If the puzzle is completed then\n  hTimer.Stop                                                   'Stop the timer\n  Me.Title = siMoves & \" Moves \"                                'Set the Form Title to show the amount of moves taken\n  sMessage = \"Congratulations!!\\n\"                              'Build sMessage\n  sMessage &= Str(siMoves) & \" Moves\\n\"                         'Build sMessage\n  sMessage &= \"Time = \" & Str(dTimerDiff)                       'Build sMessage\n  Message(sMessage, \"OK\")                                       'Put up a congratulatory message\n  Me.Close                                                      'Close the form\nEndif\n\nEnd\n\nPublic Sub RebuildForm()                                        'To clear the Form and rebuild with the Tiles in the new postion\nDim hButton As Button                                           'We need Buttons\nDim byCount, byTemp As Byte                                     'Various variables\nDim siFontH As Short\n\nMe.Children.clear                                               'Clear the Form of all Objects\n\nFor Each byTemp In byPos                                        'For each 'Position'\n  If byTemp = 99 Then                                           'If the Position's value is 99 then it's the space\n    AddPanel                                                    'Go to the AddPanel routine\n  Else                                                          'If the Position's value is NOT 99 then \n    hButton = New Button(Me) As \"AllButtons\"                    'Create a new Button\n  With hButton                                                  'With the following properties\n    .Text = Str(byPos[byCount])                                 'Text as stored in byPos\n    .Tag = Str(byPos[byCount])                                  'Tag as stored in byPos\n    .Height = (Me.Height - 10) / 4                              'Set the Button height\n    .Width = (Me.Width - 10) / 4                                'Set the Button width\n    .Font.Bold = True                                           'Set the Font to Bold\n      End With\n    If Me.Width > Me.Height Then                                'If Form Width is greater than Form Width then..\n      siFontH = Me.Height                                       'siFontH = Form Height\n    Else                                                        'Else..\n      siFontH = Me.Width                                        'siFontH = Form Width\n    End If\n  hButton.Font.size = siFontH / 16                              'Set Font height\n  Endif\n  \n  Inc byCount                                                   'Increase counter\nNext\n\nEnd\n\nPublic Sub Form_Resize()                                        'If the form is resized\n\nRebuildForm                                                     'Rebuild the Form\n\nEnd\n\nPublic Sub IsItSolvable() As Boolean                            'To check if the puzzle is solvable\nDim bSolvable, bBlankOnEven As Boolean                          'Triggers\nDim siCount0, siCount1, siInversion As Short                    'Counters\n\nFor siCount0 = 0 To byPos.Max                                   'Loop through the positions\n  If byPos[siCount0] = 99 Then                                  'The blank\n    If InStr(\"0,1,2,3,8,9,10,11,\", Str(siCount0 & \",\")) Then    'Is the blank on an even row (counting from the bottom) if so..\n      bBlankOnEven = True                                       'bBlankOnEven = True\n    End If\n    Continue                                                    'Go to the end of the loop\n  End If\n  For siCount1 = siCount0 + 1 To byPos.Max                      'Loop through the positions \n    If byPos[siCount0] > byPos[siCount1] Then Inc siInversion   'Counts the inversions\n  Next                                                          'See https://www.cs.bham.ac.uk/~mdr/teaching/modules04/java2/TilesSolvability.html\nNext\n\nIf bBlankOnEven And Odd(siInversion) Then bSolvable = True      'Blank is on an even row (counting from the bottom) then the number of inversions in a solvable situation is odd\nIf Not bBlankOnEven And Even(siInversion) Then bSolvable = True 'Blank is on an odd row (counting from the bottom) then the number of inversions in a solvable situation is even\n\nReturn bSolvable                                                'Return the value\n\nEnd\n\nPublic Sub Form_Close()\n\nSettings.Write(Me, \"Window\")                                    'Store the window position and size\n\nEnd\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_49.txt",
        "content": "package main\n\nimport (\n\t\"fmt\"\n\t\"math/rand\"\n\t\"strings\"\n\t\"time\"\n)\n\nfunc main() {\n\trand.Seed(time.Now().UnixNano())\n\tp := newPuzzle()\n\tp.play()\n}\n\ntype board [16]cell\ntype cell uint8\ntype move uint8\n\nconst (\n\tup move = iota\n\tdown\n\tright\n\tleft\n)\n\nfunc randMove() move { return move(rand.Intn(4)) }\n\nvar solvedBoard = board{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 0}\n\nfunc (b *board) String() string {\n\tvar buf strings.Builder\n\tfor i, c := range b {\n\t\tif c == 0 {\n\t\t\tbuf.WriteString(\"  .\")\n\t\t} else {\n\t\t\t_, _ = fmt.Fprintf(&buf, \"%3d\", c)\n\t\t}\n\t\tif i%4 == 3 {\n\t\t\tbuf.WriteString(\"\\n\")\n\t\t}\n\t}\n\treturn buf.String()\n}\n\ntype puzzle struct {\n\tboard board\n\tempty int // board[empty] == 0\n\tmoves int\n\tquit  bool\n}\n\nfunc newPuzzle() *puzzle {\n\tp := &puzzle{\n\t\tboard: solvedBoard,\n\t\tempty: 15,\n\t}\n\t// Could make this configurable, 10==easy, 50==normal, 100==hard\n\tp.shuffle(50)\n\treturn p\n}\n\nfunc (p *puzzle) shuffle(moves int) {\n\t// As with other Rosetta solutions, we use some number\n\t// of random moves to \"shuffle\" the board.\n\tfor i := 0; i < moves || p.board == solvedBoard; {\n\t\tif p.doMove(randMove()) {\n\t\t\ti++\n\t\t}\n\t}\n}\n\nfunc (p *puzzle) isValidMove(m move) (newIndex int, ok bool) {\n\tswitch m {\n\tcase up:\n\t\treturn p.empty - 4, p.empty/4 > 0\n\tcase down:\n\t\treturn p.empty + 4, p.empty/4 < 3\n\tcase right:\n\t\treturn p.empty + 1, p.empty%4 < 3\n\tcase left:\n\t\treturn p.empty - 1, p.empty%4 > 0\n\tdefault:\n\t\tpanic(\"not reached\")\n\t}\n}\n\nfunc (p *puzzle) doMove(m move) bool {\n\ti := p.empty\n\tj, ok := p.isValidMove(m)\n\tif ok {\n\t\tp.board[i], p.board[j] = p.board[j], p.board[i]\n\t\tp.empty = j\n\t\tp.moves++\n\t}\n\treturn ok\n}\n\nfunc (p *puzzle) play() {\n\tfmt.Printf(\"Starting board:\")\n\tfor p.board != solvedBoard && !p.quit {\n\t\tfmt.Printf(\"\\n%v\\n\", &p.board)\n\t\tp.playOneMove()\n\t}\n\tif p.board == solvedBoard {\n\t\tfmt.Printf(\"You solved the puzzle in %d moves.\\n\", p.moves)\n\t}\n}\n\nfunc (p *puzzle) playOneMove() {\n\tfor {\n\t\tfmt.Printf(\"Enter move #%d (U, D, L, R, or Q): \", p.moves+1)\n\t\tvar s string\n\t\tif n, err := fmt.Scanln(&s); err != nil || n != 1 {\n\t\t\tcontinue\n\t\t}\n\n\t\ts = strings.TrimSpace(s)\n\t\tif s == \"\" {\n\t\t\tcontinue\n\t\t}\n\n\t\tvar m move\n\t\tswitch s[0] {\n\t\tcase 'U', 'u':\n\t\t\tm = up\n\t\tcase 'D', 'd':\n\t\t\tm = down\n\t\tcase 'L', 'l':\n\t\t\tm = left\n\t\tcase 'R', 'r':\n\t\t\tm = right\n\t\tcase 'Q', 'q':\n\t\t\tfmt.Printf(\"Quiting after %d moves.\\n\", p.moves)\n\t\t\tp.quit = true\n\t\t\treturn\n\t\tdefault:\n\t\t\tfmt.Println(`\nPlease enter \"U\", \"D\", \"L\", or \"R\" to move the empty cell\nup, down, left, or right. You can also enter \"Q\" to quit.\nUpper or lowercase is accepted and only the first non-blank\ncharacter is important (i.e. you may enter \"up\" if you like).\n`)\n\t\t\tcontinue\n\t\t}\n\n\t\tif !p.doMove(m) {\n\t\t\tfmt.Println(\"That is not a valid move at the moment.\")\n\t\t\tcontinue\n\t\t}\n\n\t\treturn\n\t}\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_5.txt",
        "content": "generic\n   Rows, Cols: Positive;\n   with function Name(N: Natural) return String; -- with Pre => (N < Rows*Cols);\n   -- Name(0) shall return the name for the empty tile\npackage Generic_Puzzle is\n\n   subtype Row_Type is Positive range 1 .. Rows;\n   subtype Col_Type is Positive range 1 .. Cols;\n   type Moves is (Up, Down, Left, Right);\n   type Move_Arr is array(Moves) of Boolean;\n   \n   function Get_Point(Row: Row_Type; Col: Col_Type) return String;\n   function Possible return Move_Arr;\n   procedure Move(The_Move: Moves);\n\nend Generic_Puzzle;\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_50.txt",
        "content": "#include \"inkey.ch\"\n#include \"Box.ch\"\n\n\nprocedure Main()\n    // console init\n    SET SCOREBOARD OFF\n    SetMode(30,80) \n    ret\u00a0:= 0\n\n    // main loop\n    yn\u00a0:= .F.  \n    DO WHILE yn == .F.\n        // draw console\n        cls\n        @ 0, 0 TO MaxRow(), MaxCol() DOUBLE\n        SetColor(\"BG+/B,W/N\")\n        @ 0, 4 SAY \"  Slidng puzzle game  \"\n        SetColor()\n\n        // input size of grid\n        tam\u00a0:= 0           \n        @ MaxRow() - 2, 4 SAY \"Size of grid: \" GET tam PICTURE \"9\"\n        READ \n\n        // Initialize numbers\n        lista\u00a0:= ARRAY (tam * tam)\n        FOR z\u00a0:= 1 TO tam * tam\n            lista[z]\u00a0:= z\n        NEXT\n        lista1\u00a0:= lista\n        grid\u00a0:= ARRAY (tam,tam)\n\n        // populate grid with numbers\n        FOR i\u00a0:= 1 TO tam \n            FOR j\u00a0:= 1 TO tam \n                grid[i,j]\u00a0:= lista1[ (i-1) * tam + j] \n            NEXT \n        NEXT\n        Mostra(@grid)\n        InKey(0)\n\n        // initialize the game\n        n\u00a0:= 0\n        t\u00a0:= 0\n        lista\u00a0:= lista1     // lista for scrambling, lista1 preserve numbers in order\n        DO WHILE .T.\n            // scrambling numbers\n            FOR i\u00a0:= 1 TO tam*tam\n                n\u00a0:= Int ( ft_Rand1(tam * tam - 1) + 1 )\n                t\u00a0:= lista[n]\n                lista[n]\u00a0:= lista[i]\n                lista[i]\u00a0:= t\n            NEXT\n            // have solution?\n            possp\u00a0:= 0\n            invct\u00a0:= 0  // change counter\n            FOR i\u00a0:= 1 TO tam * tam -1\n                IF lista[i]\u00a0!= tam*tam \n                    FOR j\u00a0:= i + 1 TO tam * tam \n                        IF lista[j]\u00a0!= tam*tam\n                            IF lista[i] > lista[j]\n                                invct++ \n                            ENDIF \n                        ENDIF\n                    NEXT\n                ELSE\n                    possp\u00a0:= i\n                ENDIF\n            NEXT\n            linv\u00a0:= If( ( (invct\u00a0% 2) == 0 ), .T., .F.)\n            lkin\u00a0:= If( ( (tam - Int( (possp -1) / tam ))\u00a0% 2) == 0, .T., .F. )\n            \n            IF ( (tam\u00a0% 2)\u00a0!= 0)    // if grid size is odd\n                IF linv                 // if number of positions changes is even, solvable\n                    EXIT\n                ELSE \n                    LOOP                // if is odd, not solvable, scramble more\n                ENDIF               // if grid size is even\n            ELSE                    \n                                        // If changes is even and space position is in odd line\n                                        // or changes is odd and space position is in even line\n                                        // (XOR condition) is solvable \n                IF (linv .AND. !lkin) .OR. (!linv .AND. lkin) // XOR\u00a0!!! \n                    EXIT\n                ElSE                    // else scramble more\n                    LOOP    \n                ENDIF\n            ENDIF\n\n        ENDDO\n\n        // populate the grid with scrambled numbers\n        FOR i\u00a0:= 1 TO tam \n            FOR j\u00a0:= 1 TO tam \n                grid[i,j]\u00a0:= lista[ (i-1) * tam + j] \n            NEXT \n        NEXT\n        ret\u00a0:= Mostra(@grid)\n\n    // play\n        key\u00a0:= 0\n        DO WHILE LastKey()\u00a0!= K_ESC\n            key\u00a0:= 0 \n            // find the space coords\n            xe\u00a0:= 0\n            ye\u00a0:= 0\n            lv\u00a0:= tam*tam\n            FOR i\u00a0:= 1 TO tam \n                FOR j\u00a0:= 1 TO tam \n                    IF grid[i,j] == lv \n                        xe\u00a0:=i\n                        ye\u00a0:=j\n                    ENDIF\n                NEXT\n            NEXT\n            // the direction keys\n            key\u00a0:= inkey(0)\n            DO CASE \n                CASE key == K_UP\n                    IF xe > 1\n                        grid[xe,ye]\u00a0:= grid[xe-1,ye]\n                        grid[xe-1,ye]\u00a0:= lv\n                    ENDIF\n                    ret\u00a0:= Mostra(@grid)            \n                CASE key == K_DOWN\n                    IF xe < tam\n                        grid[xe,ye]\u00a0:= grid[xe+1,ye]\n                        grid[xe+1,ye]\u00a0:= lv\n                    ENDIF\n                    ret\u00a0:= Mostra(@grid)   \n                CASE key == K_LEFT\n                    IF ye > 1\n                        grid[xe,ye]\u00a0:= grid[xe,ye-1]\n                        grid[xe,ye-1]\u00a0:= lv\n                    ENDIF\n                    ret\u00a0:= Mostra(@grid)   \n                CASE key == K_RIGHT\n                    IF ye < tam\n                        grid[xe,ye]\u00a0:= grid[xe,ye+1]\n                        grid[xe,ye+1]\u00a0:= lv\n                    ENDIF\n                    ret\u00a0:= Mostra(@grid)   \n            ENDCASE  \n            IF ret == tam*tam-1                             // ret is qtty numbers in position\n                @ MaxRow() - 3, 4 SAY \"Fim de jogo!\"        // if ret == (size*size) -1\n                key\u00a0:= K_ESC                                // all numbers in position\n                EXIT                                        // game solved\n            ENDIF\n        ENDDO\n        @ MaxRow() - 2, 4 SAY \"Deseja sair? (yn): \" GET yn PICTURE \"Y\"\n        READ \n        @ MaxRow() - 3, 4 SAY \"              \"\n    ENDDO\nreturn NIL\n\nFUNCTION Mostra(grid)\n    // Show the gris\n    fim\u00a0:= 0                                                    // how many numbers in position?\n    SetColor(\"BG+/B,W/N\") \n    @ 5,10 , 5 + tam * 2, 9 + tam * 4 BOX B_SINGLE + Space(1)\n    i\u00a0:= 0\n    FOR y\u00a0:= 1 TO tam\n        FOR x\u00a0:= 1 TO tam\n            IF grid[x,y] == tam * tam                           // show space\n                SetColor(\" B/GR+, W/N\")\n                @ x*2 + 4, i + 11 SAY \"  \" \n                SetColor(\"BG+/B,W/N\")\n            ELSE \n                IF ( (x-1) * tam + y ) == grid[x,y]             // show number in position\n                    SetColor(\"W/G,W/N\")\n                    @ x*2 + 4, i + 11 SAY grid[x,y] PICTURE \"99\" \n                    fim++\n                ELSE                                            // show number out position\n                    SetColor(\"BG+/B,W/N\")\n                    @ x*2 + 4, i + 11 SAY grid[x,y] PICTURE \"99\"\n                ENDIF\n            ENDIF\n        NEXT\n        i = i + 4\n    NEXT\n    SetColor(\" W/N, BG+/B\")\nRETURN fim",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_51.txt",
        "content": "import Data.Array\nimport System.Random\n\ntype Puzzle = Array (Int, Int) Int\n\nmain :: IO ()\nmain = do\n    putStrLn \"Please enter the difficulty level: 0, 1 or 2\"\n    userInput <- getLine\n    let diffLevel = read userInput\n    if userInput == \"\" || any (\\c -> c < '0' || c > '9') userInput || diffLevel > 2 || diffLevel < 0\n        then putStrLn \"That is not a valid difficulty level.\" >> main\n        else shufflePuzzle ([10, 50, 100] !! diffLevel) solvedPuzzle >>= gameLoop\n\ngameLoop :: Puzzle -> IO ()\ngameLoop puzzle\n    | puzzle == solvedPuzzle = putStrLn \"You solved the puzzle!\" >> printPuzzle puzzle\n    | otherwise = do\n    printPuzzle puzzle\n    putStrLn \"Please enter number to move\"\n    userInput <- getLine\n    if any (\\c -> c < '0' || c > '9') userInput\n        then putStrLn \"That is not a valid number.\" >> gameLoop puzzle\n        else let move = read userInput in\n            if move `notElem` validMoves puzzle\n                then putStrLn \"This move is not available.\" >> gameLoop puzzle\n                else gameLoop (applyMove move puzzle)\n\nvalidMoves :: Puzzle -> [Int]\nvalidMoves puzzle = [puzzle ! (row', column') |\n                     row' <- [rowEmpty-1..rowEmpty+1], column' <- [columnEmpty-1..columnEmpty+1],\n                     row' < 4, row' >= 0, column' < 4, column' >= 0,\n                     (row' == rowEmpty) /= (column' == columnEmpty)]\n    where (rowEmpty, columnEmpty) = findIndexOfNumber 16 puzzle\n\napplyMove :: Int -> Puzzle -> Puzzle\napplyMove numberToMove puzzle = puzzle // [(indexToMove, 16), (emptyIndex, numberToMove)]\n    where indexToMove = findIndexOfNumber numberToMove puzzle\n          emptyIndex = findIndexOfNumber 16 puzzle\n\nfindIndexOfNumber :: Int -> Puzzle -> (Int, Int)\nfindIndexOfNumber number puzzle = case filter (\\idx -> number == puzzle ! idx)\n                                              (indices puzzle) of\n                                      [idx] -> idx\n                                      _ -> error \"BUG: number not in puzzle\"\n\nprintPuzzle :: Puzzle -> IO ()\nprintPuzzle puzzle = do\n    putStrLn \"+--+--+--+--+\"\n    putStrLn $ \"|\" ++ formatCell (0, 0) ++ \"|\" ++ formatCell (0, 1) ++ \"|\" ++ formatCell (0, 2) ++ \"|\" ++ formatCell (0, 3) ++ \"|\"\n    putStrLn \"+--+--+--+--+\"\n    putStrLn $ \"|\" ++ formatCell (1, 0) ++ \"|\" ++ formatCell (1, 1) ++ \"|\" ++ formatCell (1, 2) ++ \"|\" ++ formatCell (1, 3) ++ \"|\"\n    putStrLn \"+--+--+--+--+\"\n    putStrLn $ \"|\" ++ formatCell (2, 0) ++ \"|\" ++ formatCell (2, 1) ++ \"|\" ++ formatCell (2, 2) ++ \"|\" ++ formatCell (2, 3) ++ \"|\"\n    putStrLn \"+--+--+--+--+\"\n    putStrLn $ \"|\" ++ formatCell (3, 0) ++ \"|\" ++ formatCell (3, 1) ++ \"|\" ++ formatCell (3, 2) ++ \"|\" ++ formatCell (3, 3) ++ \"|\"\n    putStrLn \"+--+--+--+--+\"\n    where formatCell idx\n              | i == 16 = \"  \"\n              | i > 9 = show i\n              | otherwise = \" \" ++ show i\n              where i = puzzle ! idx\n\nsolvedPuzzle :: Puzzle\nsolvedPuzzle = listArray ((0, 0), (3, 3)) [1..16]\n\nshufflePuzzle :: Int -> Puzzle -> IO Puzzle\nshufflePuzzle 0 puzzle = return puzzle\nshufflePuzzle numOfShuffels puzzle = do\n    let moves = validMoves puzzle\n    randomIndex <- randomRIO (0, length moves - 1)\n    let move = moves !! randomIndex\n    shufflePuzzle (numOfShuffels - 1) (applyMove move puzzle)\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_52.txt",
        "content": "Please enter the difficulty level: 0, 1 or 2\n0\n+--+--+--+--+\n| 1| 6| 2| 4|\n+--+--+--+--+\n| 5|10| 3| 8|\n+--+--+--+--+\n| 9|14| 7|11|\n+--+--+--+--+\n|13|  |15|12|\n+--+--+--+--+\nPlease enter number to move\n14\n+--+--+--+--+\n| 1| 6| 2| 4|\n+--+--+--+--+\n| 5|10| 3| 8|\n+--+--+--+--+\n| 9|  | 7|11|\n+--+--+--+--+\n|13|14|15|12|\n+--+--+--+--+\nPlease enter number to move",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_53.txt",
        "content": "require'general/misc/prompt'\n\ngenboard=:3 :0\n  b=. ?~16\n  if. 0<C.!.2 b do.\n    b=. (<0 _1)C. b\n  end.\n  a: (b i.0)} <\"0 b\n)\n\ndone=: (<\"0]1+i.15),a:\n\nshift=: |.!._\"0 2\ntaxi=: |:,/\"2(_1 1 shift i.4 4),_1 1 shift\"0 1/ i.4 4\n\nshowboard=:3 :0\n  echo 'current board:'\n  echo 4 4$y\n)\n\nhelp=:0 :0\n\n  Slide a number block into the empty space\n  until you get:\n\u250c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u2510\n\u25021 \u25022 \u25023 \u25024 \u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u25025 \u25026 \u25027 \u25028 \u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u25029 \u250210\u250211\u250212\u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u250213\u250214\u250215\u2502  \u2502\n\u2514\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2518\n  Or type 'q' to quit.\n)\n\ngetmove=:3 :0\n  showboard y\n  blank=. y i. a:\n  options=. /:~ ;y {~ _ -.~ blank { taxi\n  whilst. -. n e. options do.\n    echo 'Valid moves: ',\":options\n    t=. prompt 'move which number? '\n    if. 'q' e. t do.\n      echo 'giving up'\n      throw.\n    elseif. 'h' e. t do.\n      echo help\n      showboard y\n    end.\n    n=. {._\".t\n  end.\n  (<blank,y i.<n) C. y\n)\n\ngame=: 3 :0\n  echo '15 puzzle'\n  echo 'h for help, q to quit'\n  board=. genboard''\n  whilst. -. done-:board do.\n    board=. getmove board\n  end.\n  showboard board\n  echo 'You win.'\n)\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_54.txt",
        "content": "   game''\n15 puzzle\nh for help, q to quit\ncurrent board:\n\u250c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u2510\n\u25021 \u25022 \u25023 \u25024 \u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u25025 \u25026 \u25027 \u25028 \u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u25029 \u250210\u2502  \u250211\u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u250213\u250214\u250215\u250212\u2502\n\u2514\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2518\nValid moves: 7 10 11 15\nmove which number? 11\ncurrent board:\n\u250c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u2510\n\u25021 \u25022 \u25023 \u25024 \u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u25025 \u25026 \u25027 \u25028 \u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u25029 \u250210\u250211\u2502  \u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u250213\u250214\u250215\u250212\u2502\n\u2514\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2518\nValid moves: 8 11 12\nmove which number? 12\ncurrent board:\n\u250c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u2510\n\u25021 \u25022 \u25023 \u25024 \u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u25025 \u25026 \u25027 \u25028 \u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u25029 \u250210\u250211\u250212\u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u250213\u250214\u250215\u2502  \u2502\n\u2514\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2518\nYou win.\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_55.txt",
        "content": "package fifteenpuzzle;\n\nimport java.awt.*;\nimport java.awt.event.*;\nimport java.util.Random;\nimport javax.swing.*;\n\nclass FifteenPuzzle extends JPanel {\n\n    private final int side = 4;\n    private final int numTiles = side * side - 1;\n\n    private final Random rand = new Random();\n    private final int[] tiles = new int[numTiles + 1];\n    private final int tileSize;\n    private int blankPos;\n    private final int margin;\n    private final int gridSize;\n    private boolean gameOver;\n\n    private FifteenPuzzle() {\n        final int dim = 640;\n\n        margin = 80;\n        tileSize = (dim - 2 * margin) / side;\n        gridSize = tileSize * side;\n\n        setPreferredSize(new Dimension(dim, dim + margin));\n        setBackground(Color.WHITE);\n        setForeground(new Color(0x6495ED)); // cornflowerblue\n        setFont(new Font(\"SansSerif\", Font.BOLD, 60));\n\n        gameOver = true;\n\n        addMouseListener(new MouseAdapter() {\n            @Override\n            public void mousePressed(MouseEvent e) {\n                if (gameOver) {\n                    newGame();\n\n                } else {\n\n                    int ex = e.getX() - margin;\n                    int ey = e.getY() - margin;\n\n                    if (ex < 0 || ex > gridSize || ey < 0 || ey > gridSize) {\n                        return;\n                    }\n\n                    int c1 = ex / tileSize;\n                    int r1 = ey / tileSize;\n                    int c2 = blankPos % side;\n                    int r2 = blankPos / side;\n\n                    int clickPos = r1 * side + c1;\n\n                    int dir = 0;\n                    if (c1 == c2 && Math.abs(r1 - r2) > 0) {\n                        dir = (r1 - r2) > 0 ? 4 : -4;\n                        \n                    } else if (r1 == r2 && Math.abs(c1 - c2) > 0) {\n                        dir = (c1 - c2) > 0 ? 1 : -1;\n                    }\n\n                    if (dir != 0) {\n                        do {\n                            int newBlankPos = blankPos + dir;\n                            tiles[blankPos] = tiles[newBlankPos];\n                            blankPos = newBlankPos;\n                        } while (blankPos != clickPos);\n                        tiles[blankPos] = 0;\n                    }\n                    \n                    gameOver = isSolved();\n                }\n                repaint();\n            }\n        });\n\n        newGame();\n    }\n\n    private void newGame() {\n        do {\n            reset();\n            shuffle();\n        } while (!isSolvable());\n        gameOver = false;\n    }\n\n    private void reset() {\n        for (int i = 0; i < tiles.length; i++) {\n            tiles[i] = (i + 1) % tiles.length;\n        }\n        blankPos = tiles.length - 1;\n    }\n\n    private void shuffle() {\n        // don't include the blank space in the shuffle, leave it\n        // in the home position\n        int n = numTiles;\n        while (n > 1) {\n            int r = rand.nextInt(n--);\n            int tmp = tiles[r];\n            tiles[r] = tiles[n];\n            tiles[n] = tmp;\n        }\n    }\n\n    /*  Only half the permutations of the puzzle are solvable.\n\n        Whenever a tile is preceded by a tile with higher value it counts\n        as an inversion. In our case, with the blank space in the home\n        position, the number of inversions must be even for the puzzle\n        to be solvable.\n\n        See also:\n        www.cs.bham.ac.uk/~mdr/teaching/modules04/java2/TilesSolvability.html\n     */\n    private boolean isSolvable() {\n        int countInversions = 0;\n        for (int i = 0; i < numTiles; i++) {\n            for (int j = 0; j < i; j++) {\n                if (tiles[j] > tiles[i]) {\n                    countInversions++;\n                }\n            }\n        }\n        return countInversions % 2 == 0;\n    }\n\n    private boolean isSolved() {\n        if (tiles[tiles.length - 1] != 0) {\n            return false;\n        }\n        for (int i = numTiles - 1; i >= 0; i--) {\n            if (tiles[i] != i + 1) {\n                return false;\n            }\n        }\n        return true;\n    }\n\n    private void drawGrid(Graphics2D g) {\n        for (int i = 0; i < tiles.length; i++) {\n            int r = i / side;\n            int c = i % side;\n            int x = margin + c * tileSize;\n            int y = margin + r * tileSize;\n\n            if (tiles[i] == 0) {\n                if (gameOver) {\n                    g.setColor(Color.GREEN);\n                    drawCenteredString(g, \"\\u2713\", x, y);\n                }\n                continue;\n            }\n\n            g.setColor(getForeground());\n            g.fillRoundRect(x, y, tileSize, tileSize, 25, 25);\n            g.setColor(Color.blue.darker());\n            g.drawRoundRect(x, y, tileSize, tileSize, 25, 25);\n            g.setColor(Color.WHITE);\n\n            drawCenteredString(g, String.valueOf(tiles[i]), x, y);\n        }\n    }\n\n    private void drawStartMessage(Graphics2D g) {\n        if (gameOver) {\n            g.setFont(getFont().deriveFont(Font.BOLD, 18));\n            g.setColor(getForeground());\n            String s = \"click to start a new game\";\n            int x = (getWidth() - g.getFontMetrics().stringWidth(s)) / 2;\n            int y = getHeight() - margin;\n            g.drawString(s, x, y);\n        }\n    }\n\n    private void drawCenteredString(Graphics2D g, String s, int x, int y) {\n        FontMetrics fm = g.getFontMetrics();\n        int asc = fm.getAscent();\n        int des = fm.getDescent();\n\n        x = x + (tileSize - fm.stringWidth(s)) / 2;\n        y = y + (asc + (tileSize - (asc + des)) / 2);\n\n        g.drawString(s, x, y);\n    }\n\n    @Override\n    public void paintComponent(Graphics gg) {\n        super.paintComponent(gg);\n        Graphics2D g = (Graphics2D) gg;\n        g.setRenderingHint(RenderingHints.KEY_ANTIALIASING,\n                RenderingHints.VALUE_ANTIALIAS_ON);\n\n        drawGrid(g);\n        drawStartMessage(g);\n    }\n\n    public static void main(String[] args) {\n        SwingUtilities.invokeLater(() -> {\n            JFrame f = new JFrame();\n            f.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);\n            f.setTitle(\"Fifteen Puzzle\");\n            f.setResizable(false);\n            f.add(new FifteenPuzzle(), BorderLayout.CENTER);\n            f.pack();\n            f.setLocationRelativeTo(null);\n            f.setVisible(true);\n        });\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_56.txt",
        "content": "var board, zx, zy, clicks, possibles, clickCounter, oldzx = -1, oldzy = -1;\nfunction getPossibles() {\n    var ii, jj, cx = [-1, 0, 1, 0], cy = [0, -1, 0, 1];\n    possibles = [];\n    for( var i = 0; i < 4; i++ ) {\n        ii = zx + cx[i]; jj = zy + cy[i];\n        if( ii < 0 || ii > 3 || jj < 0 || jj > 3 ) continue;\n        possibles.push( { x: ii, y: jj } );\n    }\n}\nfunction updateBtns() {\n    var b, v, id;\n    for( var j = 0; j < 4; j++ ) {\n        for( var i = 0; i < 4; i++ ) {\n            id = \"btn\" + ( i + j * 4 );\n            b = document.getElementById( id );\n            v = board[i][j];\n            if( v < 16 ) {\n                b.innerHTML = ( \"\" + v );\n                b.className = \"button\"\n            }\n            else {\n                b.innerHTML = ( \"\" );\n                b.className = \"empty\";\n            }\n        }\n    }\n    clickCounter.innerHTML = \"Clicks: \" + clicks;\n}\nfunction shuffle() {\n    var v = 0, t; \n    do {\n        getPossibles();\n        while( true ) {\n            t = possibles[Math.floor( Math.random() * possibles.length )];\n            console.log( t.x, oldzx, t.y, oldzy )\n            if( t.x != oldzx || t.y != oldzy ) break;\n        }\n        oldzx = zx; oldzy = zy;\n        board[zx][zy] = board[t.x][t.y];\n        zx = t.x; zy = t.y;\n        board[zx][zy] = 16; \n    } while( ++v < 200 );\n}\nfunction restart() {\n    shuffle();\n    clicks = 0;\n    updateBtns();\n}\nfunction checkFinished() {\n    var a = 0;\n    for( var j = 0; j < 4; j++ ) {\n        for( var i = 0; i < 4; i++ ) {\n            if( board[i][j] < a ) return false;\n            a = board[i][j];\n        }\n    }\n    return true;\n}\nfunction btnHandle( e ) {\n    getPossibles();\n    var c = e.target.i, r = e.target.j, p = -1;\n    for( var i = 0; i < possibles.length; i++ ) {\n        if( possibles[i].x == c && possibles[i].y == r ) {\n            p = i;\n            break;\n        }\n    }\n    if( p > -1 ) {\n        clicks++;\n        var t = possibles[p];\n        board[zx][zy] = board[t.x][t.y];\n        zx = t.x; zy = t.y;\n        board[zx][zy] = 16;\n        updateBtns();\n        if( checkFinished() ) {\n            setTimeout(function(){ \n                alert( \"WELL DONE!\" );\n                restart();\n            }, 1);\n        }\n    }\n}\nfunction createBoard() {\n    board = new Array( 4 );\n    for( var i = 0; i < 4; i++ ) {\n        board[i] = new Array( 4 );\n    }\n    for( var j = 0; j < 4; j++ ) {\n        for( var i = 0; i < 4; i++ ) {\n            board[i][j] = ( i + j * 4 ) + 1;\n        }\n    }\n    zx = zy = 3; board[zx][zy] = 16;\n}\nfunction createBtns() {\n    var b, d = document.createElement( \"div\" );\n    d.className += \"board\";\n    document.body.appendChild( d );\n    for( var j = 0; j < 4; j++ ) {\n        for( var i = 0; i < 4; i++ ) {\n            b = document.createElement( \"button\" );\n            b.id = \"btn\" + ( i + j * 4 );\n            b.i = i; b.j = j;\n            b.addEventListener( \"click\", btnHandle, false );\n            b.appendChild( document.createTextNode( \"\" ) );\n            d.appendChild( b );\n        }\n    }\n    clickCounter = document.createElement( \"p\" );\n    clickCounter.className += \"txt\";\n    document.body.appendChild( clickCounter );\n}\nfunction start() {\n    createBtns();\n    createBoard();\n    restart();\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_57.txt",
        "content": "<!DOCTYPE html>\n<html><head><meta charset=\"UTF-8\">\n<title>15 Puzzle</title>\n<script src=\"p15.js\"></script>\n<style>\n    html,body{padding:0; margin:0;padding-top:8vh;background:#222;color:#111}\n    .txt{color:#fff;text-align:center;font-size:5vh}\n    .board{padding:0;margin:auto;width:33vh;height:33vh}\n    .button, .empty{border:0;font-size:3.5vh;margin:0.5vh;padding:0;height:6vh;width:7.25vh;line-height:5vh;\n    vertical-align:middle;background:#fff;text-align:center;border-radius:3px;cursor:pointer;float:left}\n    .empty{background:#333;border:1px solid #111}\n</style>\n</head><body onload=\"start()\"></body></html>\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_58.txt",
        "content": "include \"MRG32k3a\" {search: \".\"};  # see above\n\n# The following may be omitted if using the C implementation of jq\ndef _nwise($n):\n  def n: if length <= $n then . else .[0:$n] , (.[$n:] | n) end;\n  n;\n\n### Generic utilities \n\ndef lpad($len): tostring | ($len - length) as $l | (\" \" * $l) + .;\n\n# tabular print\ndef tprint($columns; $width):\n  reduce _nwise($columns) as $row (\"\";\n     . + ($row|map(lpad($width)) | join(\" \")) + \"\\n\" );\n\ndef array_swap($i; $j):\n  if $j < $i then array_swap($j;$i)\n  elif $i == $j then .\n  else .[:$i] + [.[$j]] + .[$i+1:$j] + [.[$i]] + .[$j+1:]\n  end\u00a0;\n\n### Pre-requisite: MRG32k3a\n# Input: an array to be shuffled\n# Output: the shuffled array using a seed based on `now`\ndef shuffle:\n  { prng: (seed(now | tostring | sub(\"^.*[.]\";\"\") | tonumber)),\n    array: . }\n  | knuthShuffle\n  | .array;\n\n### 15-Puzzle\n\n# Pretty-print the board\ndef pp:\n  .board | map(if . == 0 then \"\" end) | tprint(4;3);\n\ndef row: ./4 | floor;\ndef col: .\u00a0% 4;\n\ndef move($p):\n  .zero as $zero\n  | (.board |= array_swap($zero; $p))\n  | .zero = $p\n  | .n += 1\u00a0;\n\ndef SolvedBoard: [range(1;16), 0];\n\n# Output: {goal, n, board, zero}\ndef init($easy):\n  SolvedBoard as $init\n  | { goal: $init,\n      n: 0,          # number of moves so far\n      board: ($init | if $easy then array_swap(14;15) else shuffle end)\n    }\n  | .zero = (.board|index(0))\u00a0;\n\n# If $m is a valid single-letter move, then emit the corresponding\n# index of the proposed new position.\n# Input must include .zero\ndef isValidMove($m):\n  if   ($m == \"u\") then if (.zero|row)\u00a0!= 0 then .zero - 4 else false end\n  elif ($m == \"d\") then if (.zero|row)\u00a0!= 3 then .zero + 4 else false end\n  elif ($m == \"r\") then if (.zero|col)\u00a0!= 3 then .zero + 1 else false end\n  elif ($m == \"l\") then if (.zero|col)\u00a0!= 0 then .zero - 1 else false end\n  else false\n  end;\n\ndef instructions:\n  \"Please enter \\\"u\\\", \\\"d\\\", \\\"l\\\", or \\\"r\\\" to move the empty cell\",\n  \"up, down, left, or right. You can also enter \\\"q\\\" to quit.\",\n  \"Upper or lowercase is accepted and only the first character\",\n  \"is important, so for example you could enter `up` instead of `u`.\";\n\ndef play($easy):\n  def prompt:\n    pp,\n    if .board == .goal then \"Congratulations. You solved the puzzle in \\(.n) moves.\"\n    else\n      \"Enter move #\\(.n + 1) (u, d, l, r or q): \",\n      ( (limit(1;inputs)[:1]|ascii_downcase) as $m\n        | if $m == \"q\" then halt\n          else isValidMove($m) as $p\n          | if $p then move($p) | prompt\n            else \"Invalid move.\", prompt\n            end\n          end)\n    end;\n    \n  instructions,\n  (init($easy) | prompt);\n\nplay(ARGS.named.easy)",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_59.txt",
        "content": "Please enter \"u\", \"d\", \"l\", or \"r\" to move the empty cell\nup, down, left, or right. You can also enter \"q\" to quit.\nUpper or lowercase is accepted and only the first character\nis important, so for example you could enter `up` instead of `u`.\n  1   2   3   4\n  5   6   7   8\n  9  10  11  12\n 13  14      15\n\nEnter move #1 (u, d, l, r or q): \nu\n  1   2   3   4\n  5   6   7   8\n  9  10      12\n 13  14  11  15\n\nEnter move #2 (u, d, l, r or q): \nd\n  1   2   3   4\n  5   6   7   8\n  9  10  11  12\n 13  14      15\n\nEnter move #3 (u, d, l, r or q): \nr\n  1   2   3   4\n  5   6   7   8\n  9  10  11  12\n 13  14  15    \n\nCongratulations. You solved the puzzle in 3 moves.\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_6.txt",
        "content": "package body Generic_Puzzle is\n   \n   Field: array(Row_Type, Col_Type) of Natural;\n   Current_R: Row_Type := Rows;\n   Current_C: Col_Type := Cols;\n   -- invariant: Field(Current_R, Current_C=0) \n   -- and for all R, C: Field(R, C) < R*C\n   -- and for all (R, C) /= (RR, CC): Field(R, C) /= Field(RR, CC)\n   \n   function Get_Point(Row: Row_Type; Col: Col_Type) return String is\n      (Name(Field(Row, Col)));\n      \n   function Possible return Move_Arr is\n      (Up => Current_R > 1, Down => Current_R < Rows,\n       Left => Current_C > 1, Right => Current_C < Cols);\n      \n   procedure Move(The_Move: Moves) is\n      Old_R: Row_Type; Old_C: Col_Type; N: Natural;\n   begin\n      if not Possible(The_Move) then\n\t raise Constraint_Error with \"attempt to make impossible move\";\n      else\n\t -- remember current row and column\n\t Old_R := Current_R;\n\t Old_C := Current_C;\n\t \n\t -- move the virtual cursor to a new position\n\t case The_Move is \n\t   when Up    => Current_R := Current_R - 1;\n\t   when Down  => Current_R := Current_R + 1;\n\t   when Left  => Current_C := Current_C - 1;\n\t   when Right => Current_C := Current_C + 1;\n\t end case;\n\t \n\t -- swap the tiles on the board\n\t N := Field(Old_R, Old_C);\n\t Field(Old_R, Old_C) := Field(Current_R, Current_C);\n\t Field(Current_R, Current_C) := N;\n      end if;\n   end Move;\n\nbegin\n   declare   -- set field to its basic setting\n      N: Positive := 1;\n   begin\n      for R in Row_Type loop\n\t for C in Col_Type loop\n\t    if (R /= Current_R) or else (C /= Current_C) then \n\t       Field(R, C) := N;\n\t       N := N + 1;\n\t    else\n\t       Field(R, C) := 0;\n\t    end if;\n\t end loop;\n      end loop;\n   end;\nend Generic_Puzzle;\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_60.txt",
        "content": "using Random\n\nconst size = 4\nconst puzzle = string.(reshape(1:16, size, size))\npuzzle[16] = \" \"\nrng = MersenneTwister(Int64(round(time())))\nshufflepuzzle() = (puzzle .= shuffle(rng, puzzle))\nfindtile(t) = findfirst(x->x == t, puzzle)\nfindhole() = findtile(\" \")\n\nfunction issolvable()\n    inversioncount = 1\n    asint(x) = (puzzle[x] == \" \") ? 0 : parse(Int64, puzzle[x])\n    for i in 1:size^2-1, j in i:size^2\n        if puzzle[i] == \" \" || puzzle[j] == \" \"\n            continue\n        end\n        if parse(Int, puzzle[i]) < parse(Int, puzzle[j])\n            inversioncount += 1\n        end\n    end\n    if size % 2 == 1\n        return inversioncount % 2 == 0\n    end\n    pos = findhole()\n    inversioncount += pos[2]\n    return inversioncount & 1 == 0\nend\n\nfunction nexttohole()\n    holepos = findhole()\n    row = holepos[1]\n    col = holepos[2]\n    if row == 1\n        if col == 1\n            return [[row, col + 1], [row + 1, col]]\n        elseif col == size\n            return [[row, col - 1], [row + 1, col]]\n        else\n            return [[row, col - 1], [row, col + 1], [row + 1, col]]\n        end\n    elseif row == size\n        if col == 1\n            return [[row - 1, col], [row, col + 1]]\n        elseif col == size\n            return [[row - 1, col], [row, col - 1]]\n        else\n            return [[row - 1, col], [row, col - 1], [row, col + 1]]\n        end\n    else\n        if col == 1\n            return [[row - 1, col], [row, col + 1], [row + 1, col]]\n        elseif col == size\n            return [[row - 1, col], [row, col - 1], [row + 1, col]]\n        else\n            return [[row - 1, col], [row, col - 1], [row, col + 1], [row + 1, col]]\n        end\n    end\nend\n\npossiblemoves() = map(pos->puzzle[pos[1], pos[2]], nexttohole())\n\nfunction movehole(tiletofill)\n    if tiletofill in possiblemoves()\n        curpos = findtile(tiletofill)\n        holepos = findhole()\n        puzzle[holepos] = tiletofill\n        puzzle[curpos] = \" \"\n    else\n        println(\"Bad tile move $tiletofill.\\nPossible moves are $(possiblemoves()).\")\n    end\nend\n\nfunction printboard()\n    ppuz(x,y) = print(lpad(rpad(puzzle[x,y], 3), 4), \"|\")\n    print(\"+----+----+----+----+\\n|\")\n    for j in 1:size, i in 1:size\n        ppuz(i,j)\n        if i == size\n            print(\"\\n\")\n            if j < size\n                 print(\"|\")\n            end\n        end\n    end\n    println(\"+----+----+----+----+\")\n\nend\n\nfunction puzzle15play()\n    solved() = (puzzle[1:15] == string.(1:15))\n    shufflepuzzle()\n    println(\"This puzzle is\", issolvable() ? \" \" : \" not \", \"solvable.\")\n    while !solved()\n        printboard()\n        print(\"Possible moves are: $(possiblemoves()), 0 to exit. Your move? =>  \")\n        s = readline()\n        if s == \"0\"\n            exit(0)\n        end\n        movehole(s)\n    end\n    printboard()\n    println(\"Puzzle solved.\")\nend\n\npuzzle15play()\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_61.txt",
        "content": "\n\nThis puzzle is solvable.\n+----+----+----+----+\n| 5  | 7  | 14 |    |\n| 4  | 3  | 13 | 12 |\n| 10 | 1  | 6  | 9  |\n| 8  | 15 | 11 | 2  |\n+----+----+----+----+\nPossible moves are: [\"14\", \"12\"], 0 to exit. Your move? =>  12\n+----+----+----+----+\n| 5  | 7  | 14 | 12 |\n| 4  | 3  | 13 |    |\n| 10 | 1  | 6  | 9  |\n| 8  | 15 | 11 | 2  |\n+----+----+----+----+\nPossible moves are: [\"13\", \"12\", \"9\"], 0 to exit. Your move? =>\n\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_62.txt",
        "content": "import std/num/random\nimport std/os/readline\nstruct board\n  cells: vector<vector<int>>\n  hole-pos: (int, int)\n  size: (int, int)\n\ntype move\n  MUp\n  MDown\n  MLeft\n  MRight\n\nfun delta(move: move): (int, int)\n  match move\n    MUp -> (0, 1)\n    MDown -> (0, -1)\n    MLeft -> (1, 0)\n    MRight -> (-1, 0)\n\ninline extern unsafe-assign : forall<a> ( v : vector<a>, i : ssize_t, x : a ) -> total ()\n  c \"kk_vector_unsafe_assign\"\n\nfun update(game: board, move: move): exn board\n  val (dx, dy) = move.delta\n  val (hx, hy) = game.hole-pos\n  val (nx, ny) = (hx + dx, hy + dy)\n  val (w, h) = game.size\n  if nx >= 0 && nx < w && ny >= 0 && ny < h then\n    game.cells[hx].unsafe-assign(hy.ssize_t, game.cells[nx][ny])\n    game.cells[nx].unsafe-assign(ny.ssize_t, 0)\n    game(hole-pos=(nx, ny))\n  else \n    game\n\nval num_shuffles = 100\n\nfun random-move(): random move\n  match random-int() % 4\n    0 -> MUp\n    1 -> MDown\n    2 -> MLeft\n    _ -> MRight\n\nfun setup(size: (int, int)): <exn,random> board\n  val (w, h) = size\n  val cells = vector-init(w, fn(x) vector-init(h, fn(y) x*h + y + 1))\n  var game := Board(cells, (w - 1, h - 1), size)\n  for(0,num_shuffles) fn(_)\n    game := game.update(random-move())\n  game\n\neffect break<a>\n  final ctl break(a: a) : b\n\nfun finished(game: board): exn bool\n  val (w, h) = game.size\n  var i := 1\n  with final ctl break(a:bool)\n    a\n  for(0,w - 1) fn(x)\n    for(0,h - 1) fn(y)\n      if game.cells[x][y] != i then\n        break(False)\n      else\n        i := i + 1\n  True\n\nfun display(game: board): <console,exn> ()\n  println(\"\")\n  val (w, h) = game.size\n  for(0, h - 1) fn(y)\n    for(0, w - 1) fn(x)\n      val c = game.cells[x][y]\n      if c == 0 then\n        print(\"    \")\n      else\n        print(\" \" ++ c.show ++ \" \")\n    println(\"\")\n  println(\"\")\n\nfun get_move(): <div,console,exn,break<string>> move\n  val c = readline()\n  match c.trim()\n    \"w\" -> MUp\n    \"s\" -> MDown\n    \"a\" -> MLeft\n    \"d\" -> MRight\n    \"q\" -> break(\"Finished\")\n    _ -> get_move()\n\nfun main()\n  var game := setup((4, 4))\n  with final ctl break(a:string)\n    a.println\n  while {!game.finished}\n    game.display\n    val move = get_move()\n    game := game.update(move)\n  println(\"You won!\")\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_63.txt",
        "content": "// version 1.1.3\n\nimport java.awt.BorderLayout\nimport java.awt.Color\nimport java.awt.Dimension\nimport java.awt.Font\nimport java.awt.Graphics\nimport java.awt.Graphics2D\nimport java.awt.RenderingHints\nimport java.awt.event.MouseAdapter\nimport java.awt.event.MouseEvent\nimport java.util.Random\nimport javax.swing.JFrame\nimport javax.swing.JPanel\nimport javax.swing.SwingUtilities\n\nclass FifteenPuzzle(dim: Int, val margin: Int) : JPanel() {\n\n    private val rand = Random()\n    private val tiles = IntArray(16)\n    private val tileSize = (dim - 2 * margin) / 4\n    private val gridSize = tileSize * 4\n    private var blankPos = 0\n\n    init {\n        preferredSize = Dimension(dim, dim)\n        background = Color.white\n        val cornflowerBlue = 0x6495ED\n        foreground = Color(cornflowerBlue)\n        font = Font(\"SansSerif\", Font.BOLD, 60)\n\n        addMouseListener(object : MouseAdapter() {\n            override fun mousePressed(e: MouseEvent) {\n                val ex = e.x - margin\n                val ey = e.y - margin\n                if (ex !in 0..gridSize || ey !in 0..gridSize) return\n\n                val c1 = ex / tileSize\n                val r1 = ey / tileSize\n                val c2 = blankPos % 4\n                val r2 = blankPos / 4\n                if ((c1 == c2 && Math.abs(r1 - r2) == 1) ||\n                    (r1 == r2 && Math.abs(c1 - c2) == 1)) {\n                    val clickPos = r1 * 4 + c1\n                    tiles[blankPos] = tiles[clickPos]\n                    tiles[clickPos] = 0\n                    blankPos = clickPos\n                }\n                repaint()\n            }\n        })\n\n        shuffle()\n    }\n\n    private fun shuffle() {\n        do {\n            reset()\n            // don't include the blank space in the shuffle,\n            // leave it in the home position\n            var n = 15\n            while (n > 1) {\n                val r = rand.nextInt(n--)\n                val tmp = tiles[r]\n                tiles[r] = tiles[n]\n                tiles[n] = tmp\n            }\n        } while (!isSolvable())\n    }\n\n    private fun reset() {\n        for (i in 0 until tiles.size) {\n            tiles[i] = (i + 1) % tiles.size\n        }\n        blankPos = 15\n    }\n\n    /*  Only half the permutations of the puzzle are solvable.\n\n        Whenever a tile is preceded by a tile with higher value it counts\n        as an inversion. In our case, with the blank space in the home\n        position, the number of inversions must be even for the puzzle\n        to be solvable.\n    */\n\n    private fun isSolvable(): Boolean {\n        var countInversions = 0\n        for (i in 0 until 15) {\n            (0 until i)\n                .filter { tiles[it] > tiles[i] }\n                .forEach { countInversions++ }\n        }\n        return countInversions % 2 == 0\n    }\n\n    private fun drawGrid(g: Graphics2D) {\n        for (i in 0 until tiles.size) {\n            if (tiles[i] == 0) continue\n\n            val r = i / 4\n            val c = i % 4\n            val x = margin + c * tileSize\n            val y = margin + r * tileSize\n\n            with(g) {\n                color = foreground\n                fillRoundRect(x, y, tileSize, tileSize, 25, 25)\n                color = Color.black\n                drawRoundRect(x, y, tileSize, tileSize, 25, 25)\n                color = Color.white\n            }\n            drawCenteredString(g, tiles[i].toString(), x, y)\n        }\n    }\n\n    private fun drawCenteredString(g: Graphics2D, s: String, x: Int, y: Int) {\n        val fm = g.fontMetrics\n        val asc = fm.ascent\n        val des = fm.descent\n\n        val xx = x + (tileSize - fm.stringWidth(s)) / 2\n        val yy = y + (asc + (tileSize - (asc + des)) / 2)\n\n        g.drawString(s, xx, yy)\n    }\n\n    override fun paintComponent(gg: Graphics) {\n        super.paintComponent(gg)\n        val g = gg as Graphics2D\n        g.setRenderingHint(RenderingHints.KEY_ANTIALIASING,\n            RenderingHints.VALUE_ANTIALIAS_ON)\n        drawGrid(g)\n    }\n}\n\nfun main(args: Array<String>) {\n    SwingUtilities.invokeLater {\n        val f = JFrame()\n        with(f) {\n            defaultCloseOperation = JFrame.EXIT_ON_CLOSE\n            title = \"Fifteen Puzzle\"\n            isResizable = false\n            add(FifteenPuzzle(640, 80), BorderLayout.CENTER)\n            pack()\n            setLocationRelativeTo(null)\n            isVisible = true\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_64.txt",
        "content": "' 15-PUZZLE GAME\n' ********************************\ndim d(16)\ndim ds$(16) ' Board pieces\ndim sh(3)\n\ncall buildBoard introAndLevel()\ncall printPuzzle\ndo\n  print \"To move a piece, enter its number: \"\n  input x\n  while isMoveValid(x, y, z) = 0\n    print \"Wrong move.\"\n    call printPuzzle\n    print \"To move a piece, enter its number: \"\n    input x\n  wend\n  d(z) = x\n  d(y) = 0\n  call printPuzzle\nloop until isPuzzleComplete()\nprint \"YOU WON!\"\nend\n\nsub printPuzzle\n  for p = 1 to 16\n    if d(p) = 0 then\n      ds$(p) = \"     \"\n    else\n      ds$(p) = using(\"###\", d(p)) + \"  \"\n    end if\n  next p\n  print \"+-----+-----+-----+-----+\"\n  print \"|\"; ds$(1); \"|\"; ds$(2); \"|\"; ds$(3); \"|\"; ds$(4); \"|\"\n  print \"+-----+-----+-----+-----+\"\n  print \"|\"; ds$(5); \"|\"; ds$(6); \"|\"; ds$(7); \"|\"; ds$(8); \"|\"\n  print \"+-----+-----+-----+-----+\"\n  print \"|\"; ds$(9); \"|\"; ds$(10); \"|\";ds$(11); \"|\"; ds$(12); \"|\"\n  print \"+-----+-----+-----+-----+\"\n  print \"|\"; ds$(13); \"|\"; ds$(14); \"|\"; ds$(15); \"|\"; ds$(16); \"|\"\n  print \"+-----+-----+-----+-----+\"\nend sub\n\nfunction introAndLevel()\n  cls\n  sh(1) = 10\n  sh(2) = 50\n  sh(3) = 100\n  print \"15 PUZZLE GAME\"\n  print\n  print\n  print \"Please enter level of difficulty,\"\n  do\n    print \"1 (easy), 2 (medium) or 3 (hard): \";\n    input level\n  loop while (level < 1) or (level > 3)\n  introAndLevel = level\nend function\n\nsub buildBoard level\n  ' Set pieces in correct order first\n  for p = 1 to 15\n    d(p) = p\n  next p\n  d(16) = 0 ' 0 = empty piece/slot\n  z = 16 ' z = empty position\n  print\n  print \"Shuffling pieces\";\n  for n = 1 to sh(level)\n    print \".\";\n    do\n      x = int(rnd(0) * 4) + 1\n      select case x\n        case 1\n          r = z - 4\n        case 2\n          r = z + 4\n        case 3\n          if (z - 1) mod 4 <> 0 then\n            r = z - 1\n          end if\n        case 4\n          if z mod 4 <> 0 then\n            r = z + 1\n          end if\n      end select\n    loop while (r < 1) or (r > 16)\n    d(z) = d(r)\n    z = r\n    d(z) = 0\n  next n\n  cls\nend sub\n\nfunction isMoveValid(piece, byref piecePos, byref emptyPos)\n  mv = 0\n  if (piece >= 1) and (piece <= 15) then\n    piecePos = piecePosition(piece)\n    emptyPos = piecePosition(0)\n    ' Check if empty piece is above, below, left or right to piece\n    if (piecePos - 4 = emptyPos) or _\n      (piecePos + 4 = emptyPos) or _\n      ((piecePos - 1 = emptyPos) and (emptyPos mod 4 <> 0)) or _\n      ((piecePos + 1 = emptyPos) and (piecePos mod 4 <> 0)) then\n      mv = 1\n    end if\n  end if\n  isMoveValid = mv\nend function\n\nfunction piecePosition(piece)\n  p = 1\n  while d(p) <> piece\n    p = p + 1\n    if p > 16 then\n      print \"UH OH!\"\n      stop\n    end if\n  wend\n  piecePosition = p\nend function\n\nfunction isPuzzleComplete()\n  pc = 0\n  p = 1\n  while (p < 16) and (d(p) = p)\n    p = p + 1\n  wend\n  if p = 16 then\n    pc = 1\n  end if\n  isPuzzleComplete = pc\nend function",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_65.txt",
        "content": "#Please note that all this code can be performed in livecode with just few mouse clicks\n#This is just a pure script exampe\non OpenStack\n   show me  #Usually not necessary\n   #tile creation\n   set the width of the templateButton to 50\n   set the height of the templateButton to 50\n   repeat with i=1 to 16\n      create button \n      set the label of  button i to i\n      if i =1 then\n         set the top of button 1 to 0\n         set the left of button 1 to 0\n      end if\n      if i > 1 and 1 <=4  then\n         set the left of button i to the right of button (i-1)\n         set the top of button i to the top of button 1\n      end if\n      if i >= 5 and i <= 8 then\n         set the top of button i to the bottom of button 1\n         if i = 5 then \n            set the left of button i to the left of button 1\n         else\n            set the left of button i to the right of button (i - 1)\n         end if\n      end if   \n      if i >= 9 and i <= 12 then\n         set the top of button i to the bottom of button 5\n         if i = 9 then \n            set the left of button i to the left of button 1\n         else \n            set the left of button i to the right of button (i - 1)\n         end if\n      end if   \n      if i >= 13 and i <= 16 then\n         set the top of button i to the bottom of button 9\n         if i = 13 then \n            set the left of button i to the left of button 1\n         else \n            set the left of button i to the right of button (i - 1)\n         end if\n      end if   \n      #this is usally the script directly wirtten in the objects, it's really weird this way\n      put \"on MouseUp\" &CR& \"if checkDistance(the label of me) then\" & CR &\"put the loc of me into temp\" into ts\n      put CR& \"set the loc of me to the loc of button 16\" after ts\n      put CR& \"set the loc of button 16 to temp\" & Cr & \"end if \" &CR &\"End MouseUp\" after ts\n      set the script of button i to ts\n   end repeat\n   #graphic adjustements\n   set the visible of button 16 to false   \n   set the width of this stack to the right of button 16\n   set the height of this stack to the bottom of button 16\nend openStack\n\nfunction checkDistance i\n   if (((the top of button i - the bottom of button 16) = 0 OR (the top of button 16 - the bottom of button i) = 0) AND the left of button i = the left of button 16) OR (((the left of button i - the right of button 16) = 0 OR (the right of button i - the left of button 16) = 0) AND the top of button i = the top of button 16) then\n      return true\n   else \n      return false\n   end if\nend checkDistance",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_66.txt",
        "content": "math.randomseed( os.time() )\nlocal puz = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 0 }\nlocal dir = { { 1, 0 }, { -1, 0 }, { 0, 1 }, { 0, -1 } }\nlocal sx, sy = 4, 4 \n\nfunction isValid( tx, ty )\n    return tx > 0 and tx < 5 and ty > 0 and ty < 5  \nend\nfunction display()\n    io.write( \"\\n\\n\" )\n    for j = 1, 4 do\n        io.write( \"+----+----+----+----+\\n\" )\n        for i = 1, 4 do\n            local d = puz[i + j * 4 - 4]\n            io.write( \": \" )\n            if d < 10 then io.write( \" \" ) end\n            if d < 1  then\n                io.write( \"  \" )\n            else\n                io.write( string.format( \"%d \", d ) )\n            end\n        end\n        io.write( \":\\n\" )\n    end\n    io.write( \"+----+----+----+----+\\n\\n\" )\nend\nfunction getUserNove()\n    local moves, r, tx, ty = {}\n    for d = 1, 4 do\n        tx = sx; ty = sy\n        tx = tx + dir[d][1]; ty = ty + dir[d][2]\n        \n        if isValid( tx, ty ) then \n            table.insert( moves, puz[tx + ty * 4 - 4] )\n        end\n    end\n    \n    io.write( \"Your possible moves are: \" )\n    for i = 1, #moves do \n        io.write( string.format( \"%d \", moves[i] ) )\n    end\n    \n    io.write ( \"\\nYour move: \" ); r = tonumber( io.read() )\n    if r ~= nil then\n        for i = 1, #moves do\n            if moves[i] == r then return r end\n        end\n    end\n    print( \"Invalid move!\" )\n    return -1\nend\nfunction checked( r )\n    for i = 1, #puz do\n        if puz[i] == r then \n            puz[i] = 0\n            sx = 1 + ( i - 1 ) % 4; sy = math.floor( ( i + 3 ) / 4 )\n        elseif puz[i] == 0 then\n            puz[i] = r\n        end\n    end\n    for i = 2, #puz - 1 do\n        if puz[i - 1] + 1 ~= puz[i] then return false end\n    end\n    return true\nend\nfunction beginGame()\n    local r, d, tx, ty\n    while( true ) do\n        for i = 1, 100 do\n            while( true ) do\n                tx = sx; ty = sy; d = math.random( 4 )\n                tx = tx + dir[d][1]; ty = ty + dir[d][2]\n                if isValid( tx, ty ) then break end\n            end\n            puz[sx + sy * 4 - 4] = puz[tx + ty * 4 - 4]\n            puz[tx + ty * 4 - 4] = 0; sx = tx; sy = ty\n        end\n        while( true ) do\n            display(); r = getUserNove()\n            if r > 0 then\n                if checked( r ) then\n                    display()\n                    io.write( \"\\nDone!\\n\\nPlay again (Y/N)?\" )\n                    r = io.read()\n                    if r ~= \"Y\" and r ~= \"y\" then \n                        return\n                    else\n                        break\n                    end\n                end\n            end\n        end\n    end\nend\n-- [ entry point ] --\nbeginGame()\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_67.txt",
        "content": "+----+----+----+----+\n:  1\u00a0: 15\u00a0:  7\u00a0:  3\u00a0:\n+----+----+----+----+\n: 14\u00a0:  9\u00a0:  2\u00a0:  4\u00a0:\n+----+----+----+----+\n:  5\u00a0: 13\u00a0:   \u00a0: 10\u00a0:\n+----+----+----+----+\n:  6\u00a0: 12\u00a0:  8\u00a0: 11\u00a0:\n+----+----+----+----+\n\nYour possible moves are: 10 13 8 2\nYour move:\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_68.txt",
        "content": "Module Puzzle15 {\n      \n      00 BASE 1\u00a0: DEF RND(X)=RND\n      10 REM 15-PUZZLE GAME\n      20 REM COMMODORE BASIC 2.0\n      30 REM ********************************\n      40 GOSUB 400\u00a0: REM INTRO AND LEVEL\n      50 GOSUB 510\u00a0: REM SETUP BOARD\n      60 GOSUB 210\u00a0: REM PRINT PUZZLE\n      70 PRINT \"TO MOVE A PIECE, ENTER ITS NUMBER:\"\n      80 INPUT X\n      90 GOSUB 730\u00a0: REM CHECK IF MOVE IS VALID\n      100 IF MV=0 THEN PRINT \"WRONG MOVE\"\u00a0: GOSUB 1050\u00a0: GOTO 60\n      110 D(Z)=X\u00a0: D(Y)=0\n      120 GOSUB 210\u00a0: REM PRINT PUZZLE\n      130 GOSUB 950\u00a0: REM CHECK IF PUZZLE COMPLETE\n      140 IF PC THEN 160\n      150 GOTO 70\n      160 PRINT\"YOU WON!\"\n      170 END\n      180 REM\n      190 REM *******************************\n      200 REM PRINT/DRAW THE PUZZLE\n      210 FOR P=1 TO 16\n      220   IF D(P)=0 THEN D$(P)=\"     \"\u00a0: GOTO 260\n      230   S$=STR$(D(P))\n      240   N=LEN(S$)\n      250   D$(P) = LEFT$(\"   \",3-N)+S$+\"  \"\n      260 NEXT P\n      270 PRINT \"+-----+-----+-----+-----+\"\n      280 PRINT \"!\";D$(1);\"!\";D$(2);\"!\";D$(3);\"!\";D$(4);\"!\"\n      290 PRINT \"+-----+-----+-----+-----+\"\n      300 PRINT \"!\";D$(5);\"!\";D$(6);\"!\";D$(7);\"!\";D$(8);\"!\"\n      310 PRINT \"+-----+-----+-----+-----+\"\n      320 PRINT \"!\";D$(9);\"!\";D$(10);\"!\";D$(11);\"!\";D$(12);\"!\"\n      330 PRINT \"+-----+-----+-----+-----+\"\n      340 PRINT \"!\";D$(13);\"!\";D$(14);\"!\";D$(15);\"!\";D$(16);\"!\"\n      350 PRINT \"+-----+-----+-----+-----+\"\n      360 RETURN\n      370 REM\n      380 REM *******************************\n      390 REM INTRO AND LEVEL OF DIFFICULTY\n      400 PRINT CHR$(147)\n      410 DIM SH(3)\u00a0: SH(1)=10\u00a0: SH(2)=50\u00a0: SH(3)=100\n      420 PRINT \"15 PUZZLE GAME FOR COMMODORE BASIC 2.0\"\u00a0: PRINT\u00a0: PRINT\n      430 PRINT \"PLEASE ENTER LEVEL OF DIFFICULTY,\"\n      440 PRINT \"1(EASY), 2(MEDIUM) OR 3(HARD):\";\n      450 INPUT V\n      460 IF V<1 OR V>3 THEN 440\n      470 RETURN\n      480 REM\n      490 REM *******************************\n      500 REM BUILD THE BOARD\n      510 DIM D(16)\u00a0: DIM D$(16)\u00a0: REM BOARD PIECES\n      520 REM SET PIECES IN CORRECT ORDER FIRST\n      530 FOR P=1 TO 15\n      540   D(P) = P\n      550 NEXT P\n      560 D(16) = 0\u00a0: REM 0 = EMPTY PIECE/SLOT\n      570 Z=16     \u00a0: REM Z = EMPTY POSITION\n      580 PRINT: PRINT \"SHUFFLING PIECES\";\n      590 FOR N=1 TO SH(V)\n      600   PRINT\".\";\n      610   X = INT(RND(0)*4)+1\n      620   R = Z+(X=1)*4-(X=2)*4+(X=3)-(X=4)\n      630   IF R<1 OR R>16 THEN 610\n      640   D(Z)=D(R)\n      650   Z=R\n      660   D(Z)=0\n      670 NEXT N\n      680 PRINT CHR$(147)\n      690 RETURN\n      700 REM\n      710 REM *******************************\n      720 REM CHECK IF MOVE IS VALID\n      730 MV = 0\n      740 IF X<1 OR X>15 THEN RETURN\n      750 REM FIND POSITION OF PIECE X\n      760 P=1\n      770 IF D(P)=X THEN Y=P\u00a0: GOTO 810\n      780 P=P+1\u00a0: IF P>16 THEN PRINT \"UH OH!\"\u00a0: STOP\n      790 GOTO 770\n      800 REM FIND POSITION OF EMPTY PIECE\n      810 P=1\n      820 IF D(P)=0 THEN Z=P\u00a0: GOTO 860\n      830 P=P+1\u00a0: IF P>16 THEN PRINT \"UH OH!\"\u00a0: STOP\n      840 GOTO 820\n      850 PRINT Y;Z\n      860 REM CHECK IF EMPTY PIECE IS ABOVE, BELOW, LEFT OR RIGHT TO PIECE X\n      870 IF Y-4=Z THEN MV=1\u00a0: RETURN\n      880 IF Y+4=Z THEN MV=1\u00a0: RETURN\n      890 IF Y-1=Z THEN MV=1\u00a0: RETURN\n      900 IF Y+1=Z THEN MV=1\u00a0: RETURN\n      910 RETURN\n      920 REM\n      930 REM *******************************\n      940 REM CHECK IF PUZZLE IS COMPLETE / GAME OVER\n      950 PC = 0\n      960 P=1\n      970 IF D(P)<>P THEN RETURN\n      980 P=P+1\n      990 IF P<16 THEN 970\n      1000 PC = 1\n      1010 RETURN\n      1020 REM\n      1030 REM ******************************\n      1040 REM A SMALL DELAY\n      1050 FOR T=0 TO 400\n      1060 NEXT T\n      1070 RETURN\n}\nPuzzle15",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_69.txt",
        "content": "grid = MapThread[{#1,#2} &, {Range @ 16, Range @ 16}]\n\nMove[x_] := (empty = Select[grid, #[[1]]==16 &][[1,2]];\n             If[(empty == x+4) || (empty == x-4) ||\n                (Mod[empty,4] != 0 && empty == x-1) ||\n                (Mod[empty,4] != 1 && empty == x+1),\n             oldEmpty = grid[[empty]][[1]];\n             grid[[empty]][[1]] = grid[[x]][[1]];\n             grid[[x]][[1]] = oldEmpty])\n\nCButton[{x_,loc_}] := If[x==16, Null, Button[x,Move @ loc]]\n\nDynamic @ Grid @ Partition[CButton /@ grid,4]\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_7.txt",
        "content": "with Generic_Puzzle, Ada.Text_IO, \n     Ada.Numerics.Discrete_Random, Ada.Command_Line;\n\nprocedure Puzzle_15 is\n   \n   function Image(N: Natural) return String is\n      (if N=0 then \"   \" elsif N < 10 then \" \" & Integer'Image(N)\n\telse Integer'Image(N));\n\t\n   package Puzzle is new Generic_Puzzle(Rows => 4, Cols => 4, Name => Image);\n    \n   package Rnd is new Ada.Numerics.Discrete_Random(Puzzle.Moves);\n   Rand_Gen: Rnd.Generator;\n    \n   Level: Natural := (if Ada.Command_Line.Argument_Count = 0 then 10 \n                      else Natural'Value(Ada.Command_Line.Argument(1)));\n   Initial_Moves: Natural := (2**(Level/2) + 2**((1+Level)/2))/2;\n   Texts: constant array(Puzzle.Moves) of String(1..9) :=\n       (\"u,U,^,8: \", \"d,D,v,2: \", \"l,L,<,4: \", \"r,R,>,6: \");\n   Move_Counter: Natural := 0;    \n   Command: Character;\n       \n begin\n    -- randomize board\n    for I in 1 .. Initial_Moves loop\n       declare\n\t  M: Puzzle.Moves := Rnd.Random(Rand_Gen);\n       begin\n\t  if Puzzle.Possible(M) then\n\t     Puzzle.Move(M);\n\t  end if;\n       end;\n    end loop;\n    \n    -- read command and perform move\t  \n    loop\n      -- Print board\n      for R in Puzzle.Row_Type loop\n\t for C in Puzzle.Col_Type loop\n\t    Ada.Text_IO.Put(Puzzle.Get_Point(R, C));\n\t end loop;\n\t Ada.Text_IO.New_Line;\n      end loop;\n      Ada.Text_IO.Get(Command);\n      begin\n\t case Command is\n\t    when 'u' | 'U' | '^' | '8' =>\n\t       Ada.Text_IO.Put_Line(\"Up!\"); Puzzle.Move(Puzzle.Up);\n\t    when 'd' | 'D' | 'v' | '2' =>\n\t       Ada.Text_IO.Put_Line(\"Down!\"); Puzzle.Move(Puzzle.Down);\n\t    when 'l' | 'L' | '<' | '4' =>\n\t       Ada.Text_IO.Put_Line(\"Left!\"); Puzzle.Move(Puzzle.Left);\n\t    when 'r' | 'R' | '>' | '6' =>\n\t       Ada.Text_IO.Put_Line(\"Right!\"); Puzzle.Move(Puzzle.Right);\n\t    when '!' => \n\t       Ada.Text_IO.Put_Line(Natural'Image(Move_Counter) & \" moves!\"); \n\t       exit;\n\t    when others => \n\t       raise Constraint_Error with \"wrong input\";\n\t end case;\n\t Move_Counter := Move_Counter + 1;\n      exception when Constraint_Error => \n\t Ada.Text_IO.Put_Line(\"Possible Moves and Commands:\");\n\t for M in Puzzle.Moves loop\n\t    if Puzzle.Possible(M) then\n\t       Ada.Text_IO.Put(Texts(M) & Puzzle.Moves'Image(M) & \"   \");\n\t    end if;\n\t end loop;\n\t Ada.Text_IO.Put_Line(\"!: Quit\");\n      end;\n   end loop;\nend Puzzle_15;\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_70.txt",
        "content": ":- module fifteen.\n:- interface.\n:- use_module random, io.\n\n:- type board.\n:- type invalid_board\n    --->    invalid_board(board).\n:- type move\n    --->    up\n   \u00a0;       down\n   \u00a0;       left\n   \u00a0;       right.\n\n   \u00a0% init(Board):\n   \u00a0% Board is fifteen game in its initial state\n   \u00a0%\n:- pred init(board::out) is det.\n\n   \u00a0% print(Board, !IO)\n:- pred print(board::in, io.io::di, io.io::uo) is det.\n\n   \u00a0% Shuffled(Board, !RS):\n   \u00a0% Board is a fifteen game in a random (but valid) state.\n   \u00a0%\n:- pred shuffled(board::out, random.supply::mdi, random.supply::muo) is det.\n\n   \u00a0% space(Board) = I:\n   \u00a0% I is the index of the blank space in the board.\n   \u00a0% Throws invalid_board iff there is no blank.\n   \u00a0%\n:- func space(board) = int.\n\n   \u00a0% move(Move, !Board):\n   \u00a0% Move the blank space in a board in the given direction.\n   \u00a0% Fails if this is an invalid move to make.\n   \u00a0%\n:- pred move(move::in, board::in, board::out) is semidet.\n\n:- implementation.\n:- import_module bt_array, int, list, string.\n:- use_module array, exception.\n\n:- type board == bt_array(int).\n\ninit(B)\u00a0:- from_list(0, (1 .. 15) ++ [0], B).\n\nprint(B, !IO)\u00a0:-\n    Tile = (func(N) = ( if N = 0 then s(\"  \") else s(string.format(\"%2d\", [i(N)])) )),\n    io.format(\"\\\n|----+----+----+----|\n| %s | %s | %s | %s |\n| %s | %s | %s | %s |\n| %s | %s | %s | %s |\n| %s | %s | %s | %s |\n|----+----+----+----|\n\",\n        map(Tile, to_list(B)), !IO).\n\nshuffled(!:B, !RS)\u00a0:-\n    init(!:B),\n    some [!A] (\n        array.from_list(to_list(!.B),\u00a0!:A),\n        array.random_permutation(!A, !RS),\n        from_list(0, array.to_list(!.A),\u00a0!:B)\n    ).\n\nspace(Board) = I\u00a0:- space(0, Board, I).\n\n:- pred space(int::in, board::in, int::out) is det.\nspace(N, Board, I)\u00a0:-\n    ( if semidet_lookup(Board, N, X) then\n        ( if X = 0 then\n            N = I\n        else\n            space(N + 1, Board, I)\n        )\n    else\n        exception.throw(invalid_board(Board))\n    ).\n\n:- pred swap(int::in, int::in, board::in, board::out) is det.\nswap(I, J, !B)\u00a0:-\n    X =\u00a0!.B ^ elem(I),\n    Y =\u00a0!.B ^ elem(J),\n    !B ^ elem(I)\u00a0:= Y,\n    !B ^ elem(J)\u00a0:= X.\n\nmove(M, !B)\u00a0:- move(space(!.B), M, !B).\n\n:- pred move(int::in, move::in, board::in, board::out) is semidet.\nmove(I, up, !B)\u00a0:-\n    I >= 4,\n    swap(I, I - 4, !B).\nmove(I, down, !B)\u00a0:-\n    I < 12,\n    swap(I, I + 4, !B).\nmove(I, left, !B)\u00a0:-\n    not (I = 0\u00a0; I = 4\u00a0; I = 8\u00a0; I = 12),\n    swap(I, I - 1, !B).\nmove(I, right, !B)\u00a0:-\n    not (I = 3\u00a0; I = 7\u00a0; I = 11\u00a0; I = 15),\n    swap(I, I + 1, !B).",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_71.txt",
        "content": ":- module play_fifteen.\n:- interface.\n:- import_module io.\n:- pred main(io::di, io::uo) is det.\n:- implementation.\n:- import_module string.\n:- use_module random, fifteen, exception.\n\nmain(!IO)\u00a0:-\n    seed(Seed, !IO),\n    random.init(Seed, RS),\n    fifteen.shuffled(Board, RS, _),\n    fifteen.print(Board, !IO),\n    play(Board, !IO).\n\n:- type input_command\n    --->    up\u00a0; down\u00a0; left\u00a0; right\n   \u00a0;       quit.\n\n:- type command\n    --->    move(fifteen.move)\n   \u00a0;       quit.\n\n:- pred input(input_command::in, command::out) is det.\ninput(up, move(fifteen.up)).\ninput(down, move(fifteen.down)).\ninput(left, move(fifteen.left)).\ninput(right, move(fifteen.right)).\ninput(quit, quit).\n\n:- pred command(string::in, command::out) is semidet.\ncommand(String, C)\u00a0:-\n    Term = chomp(String) ++ \".\",\n    io.read_from_string(\"play_fifteen\", Term, length(Term),\n        ok(I), io.posn(0, 0, 0), _),\n    input(I, C).\n\n:- pred play(fifteen.board::in, io::di, io::uo) is det.\nplay(!.B, !IO)\u00a0:-\n    io.write_string(\"Move? \", !IO),\n    io.read_line_as_string(Res, !IO),\n    (\n        Res = eof\n   \u00a0;\n        Res = error(_),\n        exception.throw(Res)\n   \u00a0;\n        Res = ok(String),\n        ( if command(String, Command) then\n            (\n                Command = quit,\n                io.write_string(\"Bye\u00a0:(\\n\", !IO)\n           \u00a0;\n                Command = move(Move),\n                ( if fifteen.move(Move, !B) then\n                    ( if fifteen.init(!.B) then\n                        fifteen.print(!.B, !IO),\n                        io.write_string(\"You win!\\n\", !IO)\n                    else\n                        fifteen.print(!.B, !IO),\n                        play(!.B, !IO)\n                    )\n                else\n                    io.write_string(\"Invalid move.\\n\", !IO),\n                    play(!.B, !IO)\n                )\n            )\n        else\n            io.write_string(\"I didn't understand that.\\n\", !IO),\n            play(!.B, !IO)\n        )\n    ).\n\n:- pragma foreign_decl(\"C\", \"#include <time.h>\").\n:- pred seed(int::out, io::di, io::uo) is det.\n:- pragma foreign_proc(\"C\",\n    seed(Seed::out, _IO0::di, _IO::uo),\n    [promise_pure, will_not_call_mercury],\n\"\n    Seed = time(NULL);\n\").",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_72.txt",
        "content": "isMiniMicro = version.hostName == \"Mini Micro\"\n\n// These coordinates are [row,col] not [x,y]\nDirections = {\"up\": [-1,0], \"right\": [0,1], \"down\": [1, 0], \"left\": [0,-1]}\nTileNum = range(1, 15)\nPuzzle15 = {\"grid\":[[1,2,3,4],[5,6,7,8],[9,10,11,12],[13,14,15,16]],\n            \"blankPos\": [3,3]}\n\nPuzzle15.__setTile = function(position, value)\n\trow = position[0]; col = position[1]\n\tself.grid[row][col] = value\nend function\n\nPuzzle15.__getTile = function(position)\n\trow = position[0]; col = position[1]\n\treturn self.grid[row][col]\nend function\n\nPuzzle15.__getOppositeDirection = function(direction)\n\tdirections = Directions.indexes\n\toppix = (directions.indexOf(direction) + 2) % 4\n\treturn directions[oppix]\nend function\n\nPuzzle15.getState = function\n\treturn self.grid\nend function\n\nPuzzle15.getBlankPos = function\n\treturn self.blankPos\nend function\n\nPuzzle15.hasWon = function\n\tcount = 1\n\tfor r in range(0, 3)\n\t\tfor c in range(0, 3)\n\t\t\tif self.grid[r][c] != count then return false\n\t\t\tcount += 1\n\t\tend for\n\tend for\n\treturn true\nend function\n\nPuzzle15.move = function(direction)\n\tif not Directions.hasIndex(direction) then return false\n\tmove = Directions[direction]\n\tcurPos = self.blankPos[:]\n\tnewPos = [curPos[0] + move[0], curPos[1] + move[1]]\n\tif (-1 < newPos[0] < 4) and (-1 < newPos[1] < 4) then\n\t\tvalue = self.__getTile(newPos)\n\t\tself.__setTile(curPos, value)\n\t\tself.__setTile(newPos, 16) // 16 is the blank tile\n\t\tself.blankPos = newPos\n\t\treturn true\n\telse\n\t\treturn false\n\tend if\nend function\n\nPuzzle15.shuffle = function(n)\n\tlastMove = \"\"\n\tdirections = Directions.indexes\n\tfor i in range(1, 50)\n\t\twhile true\n\t\t\tmoveTo = directions[floor(rnd * 4)]\n\t\t\toppMove = self.__getOppositeDirection(moveTo)\n\t\t\t\n\t\t\tif self.__getOppositeDirection(moveTo) != lastMove and self.move(moveTo) then\n\t\t\t\tlastMove = moveTo\n\t\t\t\tif isMiniMicro then\n\t\t\t\t\tself.displayBoard\n\t\t\t\t\twait 1/33\n\t\t\t\tend if\n\t\t\t\tbreak\n\t\t\tend if\n\t\tend while\n\tend for\nend function\n\nPuzzle15.displayBoard = function\n\tif isMiniMicro then clear\n\tfor r in range(0, 3)\n\t\tfor c in range(0, 3)\n\t\t\tgrid = self.getState\n\t\t\tif grid[r][c] == 16 then\n\t\t\t\ts = \"   \"\n\t\t\telse\n\t\t\t\ts = (\"  \" + grid[r][c])[-3:]\n\t\t\tend if\n\t\t\tprint s, \"\"\n\t\tend for\n\t\tprint\n\tend for \nend function\n\nPuzzle15.shuffle\n\nwhile not Puzzle15.hasWon\n\tif isMiniMicro then \n\t\tclear\n\telse\n\t\tprint\n\tend if\n\t\n\tPuzzle15.displayBoard\n\twhile true\n\t\tprint\n\t\tmove = input(\"Enter the direction to move the blank in (up, down, left, right): \")\n\t\tmove = move.lower\n\t\tif Directions.hasIndex(move) and Puzzle15.move(move) then break\n\t\tprint \"Please enter a valid move.\"\n\tend while\nend while\nprint \"Congratulations! You solved the puzzle!\"\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_73.txt",
        "content": "woodSound = file.loadSound(\"small_wooden_bricks_movement.mp3\")\npuzzleTiles = function\n\tgfx.scale = 2\n\twoodImg = file.loadImage(\"/sys/pics/textures/Wood.png\")\n\t\n\tgfx.drawImage woodImg,0,0\n\tgfx.color = color.black\n\tgfx.drawRect 6,6, 244,244\n\t\n\tbgBoard = new Sprite\n\tbgBoard.image = gfx.getImage(0, 0, 256, 256)\n\tbgBoard.scale = 1.6\n\tbgBoard.x = (960 - 1.6 * 256) / 2 + 128 * 1.6\n\tbgBoard.y = (640 - 1.6 * 256) / 2 + 128 * 1.6\n\tbgBoard.tint = color.rgb(102,51,0)\n\tsprites = [bgBoard]\n\t\n\tgfx.clear\n\tgfx.drawImage woodImg,0,0\n\tpositions = range(1,15)\n\tpositions.shuffle\n\t\n\tspriteScale = 1.5\n\tspriteSize = 64\n\ttileXOffset = (960 - 3 * spriteSize * spriteScale) / 2\n\ttileYOffset = (640 - 3 * spriteSize * spriteScale) / 2\n\tfor i in range(0,14)\n\t\ts = str(i+1)\n\t\tpos = positions[i]\n\t\tx = pos % 4\n\t\ty = floor(pos / 4)\n\t\txp = x * spriteSize + (spriteSize - (s.len * 14 + 2)) / 2\n\t\typ = y * spriteSize + 20\n\t\tgfx.print s, xp, yp, color.black, \"normal\"\n\t\t\n\t\tsprite = new Sprite\n\t\tsprite.image = gfx.getImage(x * spriteSize, y * spriteSize, spriteSize, spriteSize)\n\t\tsprite.scale = spriteScale\n\t\txs = i % 4; ys = 3 - floor(i / 4)\n\t\tsprite.x = spriteSize * (xs) * spriteScale + tileXOffset\n\t\tsprite.y = spriteSize * ys * spriteScale + tileYOffset\n\t\tsprite.localBounds = new Bounds\n\t\tsprite.localBounds.width = spriteSize\n\t\tsprite.localBounds.height = spriteSize\n\t\t\n\t\t// tint the blocks with different shades of brown\n\t\tsat = floor(rnd * 47 - 10) * 3\n\t\tsprite.tint = color.rgb(153 + sat, 102 + sat, 51 + sat)\n\t\tsprites.push(sprite)\n\tend for\n\t\n\treturn sprites\nend function\n\nmoveTiles = function(sprites, instructions, t = 6, mute = false)\n\tdirection = instructions[0]\n\tdelta = Directions[direction]\n\tif not mute and woodSound and direction then woodSound.play 0.1\n\tfor i in range(96, 1, -t)\n\t\tfor tile in instructions[1:]\n\t\t\tsprites[tile].x += delta[1] * t\n\t\t\tsprites[tile].y += -delta[0] * t\n\t\tend for\n\t\twait 1/3200\n\tend for\nend function\n// These coordinates are [row,col] not [x,y]\nDirections = {\"up\": [-1,0], \"right\": [0,1], \"down\": [1, 0], \"left\": [0,-1]}\nTileNum = range(1, 15)\nPuzzle15 = {\"grid\":[[1,2,3,4],[5,6,7,8],[9,10,11,12],[13,14,15,16]],\n\"blankPos\": [3,3], \"movesToShuffled\": [], \"movesMade\": [], \"moveCount\": 0}\n\nPuzzle15.__setTile = function(position, value)\n\trow = position[0]; col = position[1]\n\tself.grid[row][col] = value\nend function\n\nPuzzle15.__getTile = function(position)\n\trow = position[0]; col = position[1]\n\treturn self.grid[row][col]\nend function\n\nPuzzle15.__getOppositeDirection = function(direction)\n\tdirections = Directions.indexes\n\toppix = (directions.indexOf(direction) + 2) % 4\n\treturn directions[oppix]\nend function\n\nPuzzle15.__getDirectionToTile = function(n)\n\tfor row in range(0, 3)\n\t\tfor col in range(0, 3)\n\t\t\tif self.grid[row][col] == n then\n\t\t\t\tdr = row - self.getBlankPos[0]\n\t\t\t\tdc = col - self.getBlankPos[1]\n\t\t\t\treturn Directions.indexOf([sign(dr), sign(dc)])\n\t\t\tend if\n\t\tend for\n\tend for\n\treturn null\nend function\n\nPuzzle15.getState = function\n\treturn self.grid\nend function\n\nPuzzle15.getBlankPos = function\n\treturn self.blankPos\nend function\n\nPuzzle15.hasWon = function\n\tcount = 1\n\tfor r in range(0, 3)\n\t\tfor c in range(0, 3)\n\t\t\tif self.grid[r][c] != count then return false\n\t\t\tcount += 1\n\t\tend for\n\tend for\n\treturn true\nend function\n\nPuzzle15.move = function(direction)\n\tif not Directions.hasIndex(direction) then return false\n\tmove = Directions[direction]\n\tcurPos = self.blankPos[:]\n\tnewPos = [curPos[0] + move[0], curPos[1] + move[1]]\n\tif (-1 < newPos[0] < 4) and (-1 < newPos[1] < 4) then\n\t\tvalue = self.__getTile(newPos)\n\t\tself.__setTile(curPos, value)\n\t\tself.__setTile(newPos, 16) // 16 is the blank tile\n\t\tself.blankPos = newPos\n\t\tif self.movesMade.len > 0 then\n\t\t\tlastMove = self.movesMade[-1]\n\t\telse\n\t\t\tlastMove = \"\"\n\t\tend if\n\t\tif lastMove != \"\" and self.__getOppositeDirection(lastMove) == direction then\n\t\t\tself.movesMade.pop\n\t\telse\n\t\t\tself.movesMade.push(direction)\n\t\tend if\n\t\tself.moveCount += 1\n\t\treturn value // return tile that was moved\n\telse\n\t\treturn false\n\tend if\nend function\n\nPuzzle15.moveNumber = function(n)\n\tdirection = Puzzle15.__getDirectionToTile(n)\n\torigDir = direction\n\t\n\tif direction == null then return 0\n\ttiles = [self.__getOppositeDirection(direction)]\n\twhile origDir == direction\n\t\ttileNum = self.move(origDir)\n\t\ttiles.insert(1, tileNum)\n\t\tdirection = self.__getDirectionToTile(n)\n\tend while\n\treturn tiles\nend function\n\nPuzzle15.shuffle = function(n, sprites)\n\tlastMove = \"\"\n\tdirections = Directions.indexes\n\tcnt = 0\n\tinstructions = []\n\twhile self.movesToShuffled.len < n\n\t\tif self.movesToShuffled.len == 0 then\n\t\t\tlastMove = \"\"\n\t\telse\n\t\t\tlastMove = self.movesToShuffled[-1]\n\t\tend if\n\t\tmoveTo = directions[floor(rnd * 4)]\n\t\tcnt += 1\n\t\toppMove = self.__getOppositeDirection(moveTo)\n\t\ttileMoved = self.move(moveTo)\n\t\t\n\t\tif oppMove != lastMove and tileMoved then\n\t\t\tinstructions.push([oppMove, tileMoved])\n\t\t\tlastMove = moveTo\n\t\t\tself.movesToShuffled.push(moveTo)\n\t\telse if oppMove == lastMove then\n\t\t\tself.movesToShuffled.pop\n\t\t\tinstructions.pop\n\t\tend if\n\tend while\n\tfor i in instructions\n\t\tmoveTiles(sprites, i, 96, true)\n\tend for\nend function\n\nclear\ndisplay(4).sprites = puzzleTiles\ngfx.clear\nPuzzle15.shuffle(200, display(4).sprites)\n\nwhile not Puzzle15.hasWon\n\tif mouse.button and not wasPressed then\n\t\ttile = 16\n\t\tfor i in range(1, 15)\n\t\t\tsprite = display(4).sprites[i]\n\t\t\t//print sprite.localBounds\n\t\t\tif sprite.contains(mouse) then tile = i\n\t\t\t\n\t\tend for\n\t\tif tile != 16 then\n\t\t\tinstructions = Puzzle15.moveNumber(tile)\n\t\t\tif instructions then moveTiles(display(4).sprites, instructions)\n\t\tend if\n\tend if\n\twasPressed = mouse.button\n\tyield\nend while\nfanfare = file.loadSound(\"/sys/sounds/fanfare.wav\")\nfanfare.play 0.25\nwhile fanfare.isPlaying\nend while\nkey.get\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_74.txt",
        "content": "15Game\u00a0;\n\t; setting the layout\n\tf i=1:1:15 s box(i)=16-i\n\t; no number for box 16\n\ts box(16)=\"\"\n\tf  {\n\t; initialise i for incrementation\n\t\ts i=0\n\t; write out the 4-by-4 box\n\t\tf row=1:1:4 {\n\t\t\tw\u00a0!?20\n\t\t\tf column=1:1:4 {\n\t\t\t\ts i=$i(i)\n\t\t\t\tw $j(box(i),2),\" \"\n\t\t\t}\n\t\t}\n\t\tr\u00a0!!,\"Enter number to move (q to quit): \",number\n\t\tq:number=\"q\"\n\t\tf i=1:1:16 q:box(i)=\"\"\n\t\tif box(i)=\"\" {\n\t\t\tif i>4,number=box(i-4) {\n\t\t\t\ts box(i)=number,box(i-4)=\"\"\n\t\t\t\tw\u00a0!!\n\t\t\t}\n\t\t\telseif i>1,i'=5,i'=9,i'=13,number=box(i-1) {\n\t\t\t\ts box(i)=number,box(i-1)=\"\"\n\t\t\t\tw\u00a0!!\n\t\t\t}\n\t\t\telseif i<16,i'=4,i'=8,i'=12,number=box(i+1) {\n\t\t\t\ts box(i)=number,box(i+1)=\"\"\n\t\t\t\tw\u00a0!!\n\t\t\t}\n\t\t\telseif i<13,number=box(i+4) {\n\t\t\t\ts box(i)=number,box(i+4)=\"\"\n\t\t\t\tw\u00a0!!\n\t\t\t}\n\t\t\telse {\n\t\t\t\tw\u00a0!,\"You have to enter a number either above, below, left or right of the empty space.\"\n\t\t\t}\n\t\t}\n\t}\n\tq\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_75.txt",
        "content": "import random, terminal\n\ntype\n  Tile = uint8\n  Board = array[16, Tile]\n\ntype\n  Operation = enum\n    opInvalid\n    opUp\n    opDown\n    opLeft\n    opRight\n    opQuit\n    opRestart\n\nfunc charToOperation(c: char): Operation =\n  case c\n  of 'w', 'W': opUp\n  of 'a', 'A': opLeft\n  of 's', 'S': opDown\n  of 'd', 'D': opRight\n  of 'q', 'Q': opQuit\n  of 'r', 'R': opRestart\n  else: opInvalid\n\nproc getKey(): Operation =\n  var c = getch()\n  if c == '\\e':\n    c = getch()\n    if c == '[':\n      case getch()\n      of 'A': opUp\n      of 'D': opLeft\n      of 'B': opDown\n      of 'C': opRight\n      else: opInvalid\n    else: charToOperation c\n  else: charToOperation c\n\nfunc isSolved(board: Board): bool =\n  for i in 0..<board.high:\n    if i != board[i].int - 1:\n      return false\n  true\n\nfunc findTile(b: Board, n: Tile): int =\n  for i in 0..b.high:\n    if b[i] == n:\n      return i\n\nfunc canSwap(a, b: int): bool =\n  let dist = a - b\n  dist == 4 or dist == -4 or\n    (dist == 1 and a mod 4 != 0) or\n    (dist == -1 and b mod 4 != 0)\n\nfunc pad(i: Tile): string =\n  if i == 0:\n    \"\u2502  \"\n  elif i < 10:\n    \"\u2502 \" & $i\n  else:\n    \"\u2502\" & $i\n\nproc draw(b: Board) =\n  echo \"\u250c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u2510\\n\",\n     b[0].pad, b[1].pad, b[2].pad, b[3].pad,\n     \"\u2502\\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\\n\",\n     b[4].pad, b[5].pad, b[6].pad, b[7].pad,\n     \"\u2502\\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\\n\",\n     b[8].pad, b[9].pad, b[10].pad, b[11].pad,\n     \"\u2502\\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\\n\",\n     b[12].pad, b[13].pad, b[14].pad, b[15].pad,\n     \"\u2502\\n\u2514\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2518\"\n\nproc clearScreen ()=\n  for i in 1..10:\n    eraseLine()\n    cursorUp()\n\nfunc calcPosMove(b: var Board; o: Operation; ): int =\n  var posEmpty = b.findTile 0\n  case o\n  of opUp:    return posEmpty + 4\n  of opDown:  return posEmpty - 4\n  of opLeft:  return posEmpty + 1\n  of opRight: return posEmpty - 1\n  else: return -1\n\nproc moveTile (b : var Board, op : Operation) : bool =\n  let posMove = b.calcPosMove op\n  let posEmpty = b.findTile 0\n  if posMove < 16 and posMove >= 0 and canSwap(posEmpty, posMove):\n    swap b[posEmpty], b[posMove]\n    return true\n  return false\n\nproc shuffleBoard ( b: var Board, nSteps : int = 2000 ) =\n  var opMove = @[opUp, opLeft, opDown, opRight]\n  for i in 0 ..< nSteps:\n    let op = opMove[rand(3)]\n    discard b.moveTile op\n\nproc generateBoard: Board =\n  for i in 0..15:\n    if i == 15 :\n      result[i] = 0\n    else:\n      result[i] = (i + 1).Tile\n  shuffleBoard result\n\nwhen isMainModule:\n  randomize()\n  var\n    board = generateBoard()\n    empty = board.findTile 0\n\n  block gameLoop:\n    while not isSolved board:\n      # draw\n      draw board\n      echo \"Press arrow keys or WASD to move, R to Restart, Q to Quit\"\n\n      # handle input\n      while true:\n        let op = getKey()\n        case op\n        of opRestart:\n          board = generateBoard()\n          empty = board.findTile 0\n          break\n        of opQuit: break gameLoop\n        of opInvalid: continue\n        else:\n          if board.moveTile op:\n            empty = board.findTile 0\n            break\n\n      clearScreen()\n\n    draw board\n    echo \"You win!\"\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_76.txt",
        "content": "\u250c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u252c\u2500\u2500\u2510\n\u250212\u250211\u250215\u2502 2\u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u2502 6\u250214\u2502 3\u2502 7\u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u2502 5\u2502  \u2502 9\u250210\u2502\n\u251c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u253c\u2500\u2500\u2524\n\u2502 1\u2502 4\u2502 8\u250213\u2502\n\u2514\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2534\u2500\u2500\u2518\nPress arrow keys or WASD to move, R to Restart, Q to Quit",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_77.txt",
        "content": "module Puzzle =\nstruct\n  type t = int array\n  let make () =\n    [| 15; (* 0: the empty space *)\n        0;  1;  2;  3;\n        4;  5;  6;  7;\n        8;  9; 10; 11;\n       12; 13; 14;  |]\n\n  let move p n =\n    let hole, i = p.(0), p.(n) in\n    p.(0) <- i;\n    p.(n) <- hole\n\n  let print p =\n    let out = Array.make 16 \"   \" in\n    for i = 1 to 15 do\n      out.(p.(i)) <- Printf.sprintf \" %2d\" i\n    done;\n    for i = 0 to 15 do\n      if (i mod 4) = 0 then print_newline ();\n      print_string out.(i);\n    done\n\n  let shuffle p n =\n    for i = 1 to n do\n      move p (1 + Random.int 15)\n    done\nend\n\nlet play () =\n  let p = Puzzle.make () in\n  Puzzle.shuffle p 20;\n  while true do\n    Puzzle.print p;\n    print_string \" > \";\n    Puzzle.move p (read_line () |> int_of_string)\n  done\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_78.txt",
        "content": "# play ();;\n\n  8 11  7 13\n  3  6    15\n  9 10 12  4\n  1  5 14  2 > 6\n\n  8 11  7 13\n  3     6 15\n  9 10 12  4\n  1  5 14  2 > 11\n\n  8     7 13\n  3 11  6 15\n  9 10 12  4\n  1  5 14  2 > 8\n\n     8  7 13\n  3 11  6 15\n  9 10 12  4\n  1  5 14  2 > 3\n\n  3  8  7 13\n    11  6 15\n  9 10 12  4\n  1  5 14  2 > 11\n\n  3  8  7 13\n 11     6 15\n  9 10 12  4\n  1  5 14  2 > 8\n\n  3     7 13\n 11  8  6 15\n  9 10 12  4\n  1  5 14  2 > 3\n\n     3  7 13\n 11  8  6 15\n  9 10 12  4\n  1  5 14  2 > \n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_79.txt",
        "content": "program fifteen;\n{$mode objfpc}\n{$modeswitch advancedrecords}\n{$coperators on}\nuses\n  SysUtils, crt;\ntype\n  TPuzzle = record\n  private\n  const\n    ROW_COUNT  = 4;\n    COL_COUNT  = 4;\n    CELL_COUNT = ROW_COUNT * COL_COUNT;\n    RAND_RANGE = 101;\n  type\n    TTile          = 0..Pred(CELL_COUNT);\n    TAdjacentCell  = (acLeft, acTop, acRight, acBottom);\n    TPossibleMoves = set of TTile;\n    TCellAdjacency = set of TAdjacentCell;\n    TBoard         = array[0..Pred(CELL_COUNT)] of TTile;\n  class var\n    HBar: string;\n  var\n    FBoard: TBoard;\n    FZeroPos,\n    FMoveCount: Integer;\n    FZeroAdjacency: TCellAdjacency;\n    FPossibleMoves: TPossibleMoves;\n    FSolved: Boolean;\n    procedure DoMove(aTile: TTile);\n    procedure CheckPossibleMoves;\n    procedure PrintBoard;\n    procedure PrintPossibleMoves;\n    procedure TestSolved;\n    procedure GenerateBoard;\n    class constructor Init;\n  public\n    procedure New;\n    function  UserMoved: Boolean;\n    property  MoveCount: Integer read FMoveCount;\n    property  Solved: Boolean read FSolved;\n  end;\n\nprocedure TPuzzle.DoMove(aTile: TTile);\nvar\n  Pos: Integer = -1;\n  Adj: TAdjacentCell;\nbegin\n  for Adj in FZeroAdjacency do\n    begin\n      case Adj of\n        acLeft:   Pos := Pred(FZeroPos);\n        acTop:    Pos := FZeroPos - COL_COUNT;\n        acRight:  Pos := Succ(FZeroPos);\n        acBottom: Pos := FZeroPos + COL_COUNT;\n      end;\n      if FBoard[Pos] = aTile then\n        break;\n    end;\n  FBoard[FZeroPos] := aTile;\n  FZeroPos := Pos;\n  FBoard[Pos] := 0;\nend;\n\nprocedure TPuzzle.CheckPossibleMoves;\nvar\n  Row, Col: Integer;\nbegin\n  Row := FZeroPos div COL_COUNT;\n  Col := FZeroPos mod COL_COUNT;\n  FPossibleMoves := [];\n  FZeroAdjacency := [];\n  if Row > 0 then\n    begin\n      FPossibleMoves += [FBoard[FZeroPos - COL_COUNT]];\n      FZeroAdjacency += [acTop];\n    end;\n  if Row < Pred(ROW_COUNT) then\n    begin\n      FPossibleMoves += [FBoard[FZeroPos + COL_COUNT]];\n      FZeroAdjacency += [acBottom];\n    end;\n  if Col > 0 then\n    begin\n      FPossibleMoves += [FBoard[Pred(FZeroPos)]];\n      FZeroAdjacency += [acLeft];\n    end;\n  if Col < Pred(COL_COUNT) then\n    begin\n      FPossibleMoves += [FBoard[Succ(FZeroPos)]];\n      FZeroAdjacency += [acRight];\n    end;\nend;\n\nprocedure TPuzzle.PrintBoard;\nconst\n  Space = ' ';\n  VBar  = '|';\n  VBar1 = '| ';\n  VBar2 = '|  ';\n  VBar3 = '|    ';\nvar\n  I, J, Pos, Tile: Integer;\n  Row: string;\nbegin\n  ClrScr;\n  Pos := 0;\n  WriteLn(HBar);\n  for I := 1 to ROW_COUNT do\n    begin\n      Row := '';\n      for J := 1 to COL_COUNT do\n        begin\n          Tile := Integer(FBoard[Pos]);\n          case Tile of\n            0:    Row += VBar3;\n            1..9: Row += VBar2 + Tile.ToString + Space;\n          else\n            Row += VBar1 + Tile.ToString + Space;\n          end;\n          Inc(Pos);\n        end;\n      WriteLn(Row + VBar);\n      WriteLn(HBar);\n    end;\n  if not Solved then\n    PrintPossibleMoves;\nend;\n\nprocedure TPuzzle.PrintPossibleMoves;\nvar\n  pm: TTile;\n  spm: string = '';\nbegin\n  for pm in FPossibleMoves do\n    spm += Integer(pm).ToString + ' ';\n  WriteLn('possible moves: ', spm);\nend;\n\nprocedure TPuzzle.TestSolved;\n  function IsSolved: Boolean;\n  var\n    I: Integer;\n  begin\n    for I := 0 to CELL_COUNT - 3 do\n      if FBoard[I] <> Pred(FBoard[Succ(I)]) then\n        exit(False);\n    Result := True;\n  end;\nbegin\n  FSolved := IsSolved;\n  if not Solved then\n    CheckPossibleMoves;\nend;\n\nprocedure TPuzzle.GenerateBoard;\nvar\n  I, CurrMove, SelMove: Integer;\n  Tile: TTile;\nbegin\n  FZeroPos := Pred(CELL_COUNT);\n  FBoard[FZeroPos] := 0;\n  for I := 0 to CELL_COUNT - 2 do\n    FBoard[I] := Succ(I);\n  for I := 1 to Random(RAND_RANGE) do\n    begin\n      CheckPossibleMoves;\n      SelMove := 0;\n      for Tile in FPossibleMoves do\n        Inc(SelMove);\n      SelMove := Random(SelMove);\n      CurrMove := 0;\n      for Tile in FPossibleMoves do\n        begin\n          if CurrMove = SelMove then\n            begin\n              DoMove(Tile);\n              break;\n            end;\n          Inc(CurrMove);\n        end;\n    end;\nend;\n\nclass constructor TPuzzle.Init;\nvar\n  I: Integer;\nbegin\n  HBar := '';\n  for I := 1 to COL_COUNT do\n    HBar += '+----';\n  HBar += '+';\nend;\n\nprocedure TPuzzle.New;\nbegin\n  FSolved := False;\n  FMoveCount := 0;\n  GenerateBoard;\n  CheckPossibleMoves;\n  PrintBoard;\nend;\n\nfunction TPuzzle.UserMoved: Boolean;\nconst\n  Sorry          = 'sorry, ';\n  InvalidInput   = ' is invalid input';\n  ImpossibleMove = ' is impossible move';\nvar\n  UserInput: string;\n  Tile: Integer = 0;\nbegin\n  ReadLn(UserInput);\n  case LowerCase(UserInput) of\n    'c', 'cancel': exit(False);\n  end;\n  Result := True;\n  if not Tile.TryParse(UserInput, Tile) then\n    begin\n      WriteLn(Sorry, UserInput, InvalidInput);\n      exit;\n    end;\n  if not (Tile in [1..Pred(CELL_COUNT)]) then\n    begin\n      WriteLn(Sorry, Tile, InvalidInput);\n      exit;\n    end;\n  if not (Tile in FPossibleMoves) then\n    begin\n      WriteLn(Sorry, Tile, ImpossibleMove);\n      PrintPossibleMoves;\n      exit;\n    end;\n  DoMove(Tile);\n  Inc(FMoveCount);\n  TestSolved;\n  PrintBoard;\nend;\n\nprocedure PrintStart;\nbegin\n  ClrScr;\n  WriteLn('Fifteen puzzle start:');\n  WriteLn('  enter a tile number and press <enter> to move' );\n  WriteLn('  enter Cancel(C) and press <enter> to exit' );\n  Window(10, 4, 58, 21);\nend;\n\nprocedure Terminate;\nbegin\n  ClrScr;\n  Window(1, 1, 80, 25);\n  ClrScr;\n  WriteLn('Fifteen puzzle exit.');\n  Halt;\nend;\n\nfunction UserWantContinue(aMoveCount: Integer): Boolean;\nvar\n  UserInput: string;\nbegin\n  WriteLn('Congratulations! Puzzle solved in ', aMoveCount, ' moves.');\n  WriteLn('Play again(Yes(Y)/<any button>)?');\n  ReadLn(UserInput);\n  case LowerCase(UserInput) of\n    'y', 'yes': exit(True);\n  end;\n  Result := False;\nend;\n\nprocedure Run;\nvar\n  Puzzle: TPuzzle;\nbegin\n  Randomize;\n  PrintStart;\n  repeat\n    Puzzle.New;\n    while not Puzzle.Solved do\n      if not Puzzle.UserMoved then\n        Terminate;\n    if not UserWantContinue(Puzzle.MoveCount) then\n      Terminate;\n  until False;\nend;\n\nbegin\n  Run;\nend.\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_8.txt",
        "content": ">./puzzle_15 4\n  1  2  3  4\n  5  6  7  8\n  9 14 10 11\n 13    15 12\n8\nUp!\n  1  2  3  4\n  5  6  7  8\n  9    10 11\n 13 14 15 12\n6\nRight!\n  1  2  3  4\n  5  6  7  8\n  9 10    11\n 13 14 15 12\n5\nPossible Moves and Commands:\nu,U,^,8: UP   d,D,v,2: DOWN   l,L,<,4: LEFT   r,R,>,6: RIGHT  \u00a0!: Quit\n  1  2  3  4\n  5  6  7  8\n  9 10    11\n 13 14 15 12\n6\nRight!\n  1  2  3  4\n  5  6  7  8\n  9 10 11   \n 13 14 15 12\n2\nDown!\n  1  2  3  4\n  5  6  7  8\n  9 10 11 12\n 13 14 15   \n!\n 4 moves!",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_80.txt",
        "content": "// \u0418\u0433\u0440\u0430 \u0432 15 PABCWork.NET\\Samples\\Games\\15.pas\nuses GraphABC,ABCObjects,ABCButtons;\n\nconst\n/// \u0440\u0430\u0437\u043c\u0435\u0440 \u043f\u043e\u043b\u044f\n  n = 4;\n/// \u0440\u0430\u0437\u043c\u0435\u0440 \u0444\u0438\u0448\u043a\u0438\n  sz = 100;\n/// \u0437\u0430\u0437\u043e\u0440 \u043c\u0435\u0436\u0434\u0443 \u0444\u0438\u0448\u043a\u0430\u043c\u0438\n  zz = 10;\n/// \u043e\u0442\u0441\u0442\u0443\u043f \u043e\u0442 \u043b\u0435\u0432\u043e\u0433\u043e \u0438 \u043f\u0440\u0430\u0432\u043e\u0433\u043e \u043a\u0440\u0430\u0435\u0432\n  x0 = 20;\n/// \u043e\u0442\u0441\u0442\u0443\u043f \u043e\u0442 \u0432\u0435\u0440\u0445\u043d\u0435\u0433\u043e \u0438 \u043d\u0438\u0436\u043d\u0435\u0433\u043e \u043a\u0440\u0430\u0435\u0432\n  y0 = 20;\n\nvar\n  p: array [1..n,1..n] of SquareABC;\n  digits: array [1..n*n-1] of integer;\n\n  MeshButton: ButtonABC;\n  StatusRect: RectangleABC;\n\n  EmptyCellX,EmptyCellY: integer;\n  MovesCount: integer;\n  EndOfGame: boolean;  // True \u0435\u0441\u043b\u0438 \u0432\u0441\u0435 \u0444\u0438\u0448\u043a\u0438 \u0441\u0442\u043e\u044f\u0442 \u043d\u0430 \u0441\u0432\u043e\u0438\u0445 \u043c\u0435\u0441\u0442\u0430\u0445\n\n// \u041f\u043e\u043c\u0435\u043d\u044f\u0442\u044c \u043c\u0435\u0441\u0442\u0430\u043c\u0438 \u0434\u0432\u0435 \u0444\u0438\u0448\u043a\u0438\nprocedure Swap(var p,p1: SquareABC);\nbegin\n  PABCSystem.Swap(p,p1);\n  var i := p.Left;\n  p.Left := p1.Left;\n  p1.Left := i;\n  i := p.Top;\n  p.Top := p1.Top;\n  p1.Top := i;\nend;\n\n// \u041e\u043f\u0440\u0435\u0434\u0435\u043b\u0438\u0442\u044c, \u044f\u0432\u043b\u044f\u044e\u0442\u0441\u044f \u043b\u0438 \u043a\u043b\u0435\u0442\u043a\u0438 \u0441\u043e\u0441\u0435\u0434\u044f\u043c\u0438\nfunction Neighbours(x1,y1,x2,y2: integer): boolean;\nbegin\n  Result := (Abs(x1-x2)=1) and (y1=y2) or (Abs(y1-y2)=1) and (x1=x2)\nend;\n\n// \u0417\u0430\u043f\u043e\u043b\u043d\u0438\u0442\u044c \u0432\u0441\u043f\u043e\u043c\u043e\u0433\u0430\u0442\u0435\u043b\u044c\u043d\u044b\u0439 \u043c\u0430\u0441\u0441\u0438\u0432 \u0446\u0438\u0444\u0440\nprocedure FillDigitsArr;\nbegin\n  for var i:=1 to n*n-1 do\n    digits[i] := i;\nend;\n\n// \u041f\u0435\u0440\u0435\u043c\u0435\u0448\u0430\u0442\u044c \u0432\u0441\u043f\u043e\u043c\u043e\u0433\u0430\u0442\u0435\u043b\u044c\u043d\u044b\u0439 \u043c\u0430\u0441\u0441\u0438\u0432 \u0446\u0438\u0444\u0440. \u041a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u043e\u0431\u043c\u0435\u043d\u043e\u0432 \u0434\u043e\u043b\u0436\u043d\u043e \u0431\u044b\u0442\u044c \u0447\u0435\u0442\u043d\u044b\u043c\nprocedure MixDigitsArr;\nvar x: integer;\nbegin\n  for var i:=1 to n*n-1 do\n  begin\n    repeat\n      x := Random(15)+1;\n    until x<>i;\n    Swap(digits[i],digits[x]);\n  end;\n  if n mod 2=0 then\n    Swap(digits[1],digits[2]); // \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u043e\u0431\u043c\u0435\u043d\u043e\u0432 \u0434\u043e\u043b\u0436\u043d\u043e \u0431\u044b\u0442\u044c \u0447\u0435\u0442\u043d\u044b\u043c\nend;\n\n// \u0417\u0430\u043f\u043e\u043b\u043d\u0438\u0442\u044c \u0434\u0432\u0443\u043c\u0435\u0440\u043d\u044b\u0439 \u043c\u0430\u0441\u0441\u0438\u0432 \u0444\u0438\u0448\u0435\u043a. \u0412\u043c\u0435\u0441\u0442\u043e \u043f\u0443\u0441\u0442\u043e\u0439 \u044f\u0447\u0435\u0439\u043a\u0438 - \u0431\u0435\u043b\u0430\u044f \u0444\u0438\u0448\u043a\u0430 \u0441 \u0447\u0438\u0441\u043b\u043e\u043c 0\nprocedure Fill15ByDigitsArr;\nbegin\n  Swap(p[EmptyCellY,EmptyCellX],p[n,n]); // \u041f\u0435\u0440\u0435\u043c\u0435\u0441\u0442\u0438\u0442\u044c \u043f\u0443\u0441\u0442\u0443\u044e \u0444\u0438\u0448\u043a\u0443 \u0432 \u043f\u0440\u0430\u0432\u044b\u0439 \u043d\u0438\u0436\u043d\u0438\u0439 \u0443\u0433\u043e\u043b\n  EmptyCellX := n;\n  EmptyCellY := n;\n  var i := 1;\n  for var y:=1 to n do\n  for var x:=1 to n do\n  begin\n    if x*y=n*n then exit;\n    p[y,x].Number := digits[i];\n    i += 1;\n  end;\nend;\n\n// \u041f\u0435\u0440\u0435\u043c\u0435\u0448\u0430\u0442\u044c \u043c\u0430\u0441\u0441\u0438\u0432 \u0444\u0438\u0448\u0435\u043a\nprocedure Mix15;\nbegin\n  MixDigitsArr;\n  Fill15ByDigitsArr;\n  MovesCount := 0;\n  EndOfGame := False;\n  StatusRect.Text := '\u041a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432: '+IntToStr(MovesCount);\n  StatusRect.Color := RGB(200,200,255);\nend;\n\n// \u0421\u043e\u0437\u0434\u0430\u0442\u044c \u043c\u0430\u0441\u0441\u0438\u0432 \u0444\u0438\u0448\u0435\u043a\nprocedure Create15;\nbegin\n  EmptyCellX := n;\n  EmptyCellY := n;\n  for var x:=1 to n do\n  for var y:=1 to n do\n  begin\n    p[y,x] := new SquareABC(x0+(x-1)*(sz+zz),y0+(y-1)*(sz+zz),sz,clMoneyGreen);\n    p[y,x].BorderColor := clGreen;\n    p[y,x].BorderWidth := 2;\n    p[y,x].TextScale := 0.7;\n  end;\n  p[EmptyCellY,EmptyCellX].Color := clWhite;\n  p[EmptyCellY,EmptyCellX].BorderColor := clWhite;\n  FillDigitsArr;\n  MixDigitsArr;\n  Fill15ByDigitsArr;\nend;\n\n// \u041f\u0440\u043e\u0432\u0435\u0440\u0438\u0442\u044c, \u0432\u0441\u0435 \u043b\u0438 \u0444\u0438\u0448\u043a\u0438 \u0441\u0442\u043e\u044f\u0442 \u043d\u0430 \u0441\u0432\u043e\u0438\u0445 \u043c\u0435\u0441\u0442\u0430\u0445\nfunction IsSolution: boolean;\nbegin\n  Result:=True;\n  var i:=1;\n  for var y:=1 to n do\n  for var x:=1 to n do\n  begin\n    if p[y,x].Number<>i then\n    begin\n      Result:=False;\n      break;\n    end;\n    i += 1;\n    if i=n*n then i:=0;\n  end;\nend;\n\nprocedure MouseDown(x,y,mb: integer);\nbegin\n  if EndOfGame then // \u0415\u0441\u043b\u0438 \u0432\u0441\u0435 \u0444\u0438\u0448\u043a\u0438 \u043d\u0430 \u0441\u0432\u043e\u0438\u0445 \u043c\u0435\u0441\u0442\u0430\u0445, \u0442\u043e \u043d\u0435 \u0440\u0435\u0430\u0433\u0438\u0440\u043e\u0432\u0430\u0442\u044c \u043d\u0430 \u043c\u044b\u0448\u044c \u0438 \u0436\u0434\u0430\u0442\u044c \u043d\u0430\u0436\u0430\u0442\u0438\u044f \u043a\u043d\u043e\u043f\u043a\u0438 \"\u041f\u0435\u0440\u0435\u043c\u0435\u0448\u0430\u0442\u044c\"\n    exit;\n  if ObjectUnderPoint(x,y)=nil then // E\u0441\u043b\u0438 \u043c\u044b \u0449\u0435\u043b\u043a\u043d\u0443\u043b\u0438 \u043d\u0435 \u043d\u0430 \u043e\u0431\u044a\u0435\u043a\u0442\u0435, \u0442\u043e \u043d\u0435 \u0440\u0435\u0430\u0433\u0438\u0440\u043e\u0432\u0430\u0442\u044c \u043d\u0430 \u043c\u044b\u0448\u044c\n    exit;\n  var fx := (x-x0) div (sz+zz) + 1; // \u0412\u044b\u0447\u0438\u0441\u043b\u0438\u0442\u044c \u043a\u043e\u043e\u0440\u0434\u0438\u043d\u0430\u0442\u044b \u043d\u0430 \u0434\u043e\u0441\u043a\u0435 \u0434\u043b\u044f \u044f\u0447\u0435\u0439\u043a\u0438, \u043d\u0430 \u043a\u043e\u0442\u043e\u0440\u043e\u0439 \u043c\u044b \u0449\u0435\u043b\u043a\u043d\u0443\u043b\u0438 \u043c\u044b\u0448\u044c\u044e\n  var fy := (y-y0) div (sz+zz) + 1;\n  if (fx>n) or (fy>n) then\n    exit;\n  if Neighbours(fx,fy,EmptyCellX,EmptyCellY) then // \u0415\u0441\u043b\u0438 \u044f\u0447\u0435\u0439\u043a\u0430 \u0441\u043e\u0441\u0435\u0434\u0441\u0442\u0432\u0443\u0435\u0442 \u0441 \u043f\u0443\u0441\u0442\u043e\u0439, \u0442\u043e \u043f\u043e\u043c\u0435\u043d\u044f\u0442\u044c \u0438\u0445 \u043c\u0435\u0441\u0442\u0430\u043c\u0438\n  begin\n    Swap(p[EmptyCellY,EmptyCellX],p[fy,fx]);\n    EmptyCellX := fx;\n    EmptyCellY := fy;\n    Inc(MovesCount);\n    StatusRect.Text := '\u041a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432: ' + MovesCount;\n    if IsSolution then\n    begin\n      StatusRect.Text := '\u041f\u043e\u0431\u0435\u0434\u0430! \u0421\u0434\u0435\u043b\u0430\u043d\u043e \u0445\u043e\u0434\u043e\u0432: ' + MovesCount;\n      StatusRect.Color := RGB(255,200,200);\n      EndOfGame := True;\n    end\n  end;\nend;\n\nbegin\n  SetSmoothingOff;\n  Window.Title := '\u0418\u0433\u0440\u0430 \u0432 15';\n  Window.IsFixedSize := True;\n  SetWindowSize(2*x0+(sz+zz)*n-zz,2*y0+(sz+zz)*n-zz+90);\n  \n  EndOfGame := False;\n  Create15;\n\n  MeshButton := ButtonABC.Create((WindowWidth-200) div 2,2*y0+(sz+zz)*n-zz,200,'\u041f\u0435\u0440\u0435\u043c\u0435\u0448\u0430\u0442\u044c',clLightGray);\n  MeshButton.OnClick := Mix15;\n  StatusRect := new RectangleABC(0,WindowHeight-40,WindowWidth,40,RGB(200,200,255));\n  StatusRect.TextVisible := True;\n  StatusRect.Text := '\u041a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u0445\u043e\u0434\u043e\u0432: '+IntToStr(MovesCount);\n  StatusRect.BorderWidth := 2;\n  StatusRect.BorderColor := RGB(80,80,255);\n\n  MovesCount := 0;\n\n  OnMouseDown := MouseDown;\nend.\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_81.txt",
        "content": "use strict;\nuse warnings;\n\nuse Getopt::Long;\nuse List::Util 1.29 qw(shuffle pairmap first all);\nuse Tk;\n    # 5 options                                 1 label text\nmy ($verbose,@fixed,$nocolor,$charsize,$extreme,$solvability);\n\nunless (GetOptions (\n                     'verbose!' => \\$verbose,\n                     'tiles|positions=i{16}' => \\@fixed,\n                     'nocolor' => \\$nocolor,\n                     'charsize|size|c|s=i' => \\$charsize,\n                     'extreme|x|perl' => \\$extreme,\n                    )\n        ) { die \"invalid arguments!\";}\n\n@fixed = &check_req_pos(@fixed) if @fixed;\n\nmy $mw = Tk::MainWindow->new(-bg=>'black',-title=>'Giuoco del 15');\n\nif ($nocolor){ $mw->optionAdd( '*Button.background',   'ivory' );}\n\n$mw->optionAdd('*Button.font', 'Courier '.($charsize or 16).' bold' );\n$mw->bind('<Control-s>', sub{#&init_board;\n                             &shuffle_board});\n\nmy $top_frame = $mw->Frame( -borderwidth => 2, -relief => 'groove',\n                           )->pack(-expand => 1, -fill => 'both');\n\n$top_frame->Label( -textvariable=>\\$solvability,\n                  )->pack(-expand => 1, -fill => 'both');\n\nmy $game_frame = $mw->Frame(  -background=>'saddlebrown',\n                              -borderwidth => 10, -relief => 'groove',\n                            )->pack(-expand => 1, -fill => 'both');\n\n# set victory conditions in pairs of coordinates\nmy @vic_cond =  pairmap {\n       [$a,$b]\n    } qw(0 0 0 1 0 2 0 3\n         1 0 1 1 1 2 1 3\n         2 0 2 1 2 2 2 3\n         3 0 3 1 3 2 3 3);\n\nmy $board = [];\n\nmy $victorious = 0;\n\n&init_board;\n\nif ( $extreme ){ &extreme_perl}\n\n&shuffle_board;\n\nMainLoop;\n\n################################################################################\nsub init_board{\n  # tiles from 1 to 15\n  for (0..14){\n     $$board[$_]={\n          btn=>$game_frame->Button(\n                            -text => $_+1,\n                            -relief => 'raised',\n                            -borderwidth => 3,\n                            -height => 2,\n                            -width =>  4,\n                                  -background=>$nocolor?'ivory':'gold1',\n                                  -activebackground => $nocolor?'ivory':'gold1',\n                                  -foreground=> $nocolor?'black':'DarkRed',\n                                  -activeforeground=>$nocolor?'black':'DarkRed'\n          ),\n          name => $_+1,     # x and y set by shuffle_board\n     };\n     if (($_+1) =~ /^(2|4|5|7|10|12|13|15)$/ and !$nocolor){\n         $$board[$_]{btn}->configure(\n                                  -background=>'DarkRed',\n                                  -activebackground => 'DarkRed',\n                                  -foreground=> 'gold1',\n                                  -activeforeground=>'gold1'\n         );\n     }\n   }\n   # empty tile\n   $$board[15]={\n          btn=>$game_frame->Button(\n                            -relief => 'sunken',\n                            -borderwidth => 3,\n                            -background => 'lavender',\n                            -height => 2,\n                            -width =>  4,\n          ),\n          name => 16,      # x and y set by shuffle_board\n     };\n}\n################################################################################\nsub shuffle_board{\n    if ($victorious){\n        $victorious=0;\n        &init_board;\n    }\n    if (@fixed){\n          my $index = 0;\n\n          foreach my $tile(@$board[@fixed]){\n                  my $xy = $vic_cond[$index];\n                  ($$tile{x},$$tile{y}) = @$xy;\n                  $$tile{btn}->grid(-row=>$$xy[0], -column=> $$xy[1]);\n                  $$tile{btn}->configure(-command =>[\\&move,$$xy[0],$$xy[1]]);\n                  $index++;\n          }\n          undef @fixed;\n    }\n    else{\n        my @valid = shuffle (0..15);\n        foreach my $tile ( @$board ){\n            my $xy = $vic_cond[shift @valid];\n            ($$tile{x},$$tile{y}) = @$xy;\n            $$tile{btn}->grid(-row=>$$xy[0], -column=> $$xy[1]);\n            $$tile{btn}->configure(-command => [ \\&move, $$xy[0], $$xy[1] ]);\n        }\n    }\n    my @appear =  map {$_->{name}==16?'X':$_->{name}}\n                  sort{$$a{x}<=>$$b{x}||$$a{y}<=>$$b{y}}@$board;\n    print \"\\n\".('-' x 57).\"\\n\".\n          \"Appearence of the board:\\n[@appear]\\n\".\n          ('-' x 57).\"\\n\".\n          \"current\\tfollowers\\t               less than current\\n\".\n          ('-' x 57).\"\\n\" if $verbose;\n    # remove the, from now on inutile, 'X' for the empty space\n    @appear = grep{$_ ne 'X'} @appear;\n    my $permutation;\n    foreach my $num (0..$#appear){\n        last if $num == $#appear;\n         my $perm;\n          $perm += grep {$_ < $appear[$num]} @appear[$num+1..$#appear];\n          if ($verbose){\n            print \"[$appear[$num]]\\t@appear[$num+1..$#appear]\".\n            (\" \" x (37 - length \"@appear[$num+1..$#appear]\")).\n            \"\\t   $perm \".($num == $#appear  - 1 ? '=' : '+').\"\\n\";\n          }\n          $permutation+=$perm;\n    }\n    print +(' ' x 50).\"----\\n\" if $verbose;\n    if ($permutation % 2){\n        print \"Impossible game with odd permutations!\".(' ' x 13).\n              \"$permutation\\n\"if $verbose;\n        $solvability = \"Impossible game with odd permutations [$permutation]\\n\".\n                        \"(ctrl-s to shuffle)\".\n                        (($verbose or $extreme) ? '' :\n                           \" run with --verbose to see more info\");\n        return;\n    }\n    # 105 is the max permutation\n    my $diff =  $permutation == 0 ? 'SOLVED' :\n                $permutation < 35 ? 'EASY  ' :\n                $permutation < 70 ? 'MEDIUM' : 'HARD  ';\n    print \"$diff game with even permutations\".(' ' x 17).\n          \"$permutation\\n\" if $verbose;\n    $solvability = \"$diff game with permutation parity of [$permutation]\\n\".\n                    \"(ctrl-s to shuffle)\";\n}\n################################################################################\nsub move{\n    # original x and y\n    my ($ox, $oy) = @_;\n    my $self = first{$_->{x} == $ox and $_->{y} == $oy} @$board;\n    return if $$self{name}==16;\n    # check if one in n,s,e,o is the empty one\n    my $empty = first {$_->{name} == 16 and\n                          ( ($_->{x}==$ox-1 and $_->{y}==$oy) or\n                            ($_->{x}==$ox+1 and $_->{y}==$oy) or\n                            ($_->{x}==$ox and $_->{y}==$oy-1) or\n                            ($_->{x}==$ox and $_->{y}==$oy+1)\n                           )\n                      } @$board;\n    return unless $empty;\n    # empty x and y\n    my ($ex,$ey) = ($$empty{x},$$empty{y});\n    # reconfigure emtpy tile\n    $$empty{btn}->grid(-row => $ox, -column => $oy);\n    $$empty{x}=$ox;    $$empty{y}=$oy;\n    # reconfigure pressed tile\n    $$self{btn}->grid(-row => $ex, -column => $ey);\n    $$self{btn}->configure(-command => [ \\&move, $ex, $ey ]);\n    $$self{x}=$ex;    $$self{y}=$ey;\n    # check for victory if the empty one is at the bottom rigth tile (3,3)\n    &check_win if $$empty{x} == 3 and $$empty{y} == 3;\n}\n################################################################################\nsub check_win{\n     foreach my $pos (0..$#$board){\n        return unless ( $$board[$pos]->{'x'} == $vic_cond[$pos]->[0] and\n                        $$board[$pos]->{'y'} == $vic_cond[$pos]->[1]);\n     }\n     # victory!\n     $victorious = 1;\n     my @text =  ('Dis','ci','pu','lus','15th','','','at',\n                  'P','e','r','l','M','o','n','ks*');\n     foreach my $tile(@$board){\n            $$tile{btn}->configure( -text=> shift @text,\n                                    -command=>sub{return});\n            $mw->update;\n            sleep 1;\n     }\n}\n################################################################################\nsub check_req_pos{\n    my @wanted = @_;\n    # fix @wanted: seems GetOptions does not die if more elements are passed\n    @wanted = @wanted[0..15];\n    my @check = (1..16);\n    unless ( all {$_ == shift @check} sort {$a<=>$b} @wanted ){\n        die \"tiles must be from 1 to 16 (empty tile)\\nyou passed [@wanted]\\n\";\n    }\n    return map {$_-1} @wanted;\n}\n################################################################################\nsub extreme_perl {\n  $verbose = 0;\n  $mw->optionAdd('*font', 'Courier 20 bold');\n  my @extreme = (\n    'if $0',                               #1\n    \"\\$_=\\n()=\\n\\\"foo\\\"=~/o/g\",            #2\n    \"use warnings;\\n\\$^W\u00a0?\\nint((length\\n'Discipulus')/3)\\n:'15'\",   #3\n    \"length \\$1\\nif \\$^X=~\\n\\/(?:\\\\W)(\\\\w*)\\n(?:\\\\.exe)\\$\\/\", #4\n    \"use Config;\\n\\$Config{baserev}\",                   #5.\n    \"(split '',\\nvec('JAPH'\\n,1,8))[0]\",       #6\n    \"scalar map\\n{ord(\\$_)=~/1/g}\\nqw(p e r l)\", #7\n    \"\\$_ = () =\\n'J A P H'\\n=~\\/\\\\b\\/g\",   # 8\n    \"eval join '+',\\nsplit '',\\n(substr\\n'12345',3,2)\",  #9\n    'printf \\'%b\\',2',                     #10\n    \"int(((1+sqrt(5))\\n/ 2)** 7 /\\nsqrt(5)+0.5)-2\",    #11\n    \"split '',\\nunpack('V',\\n01234567))\\n[6,4]\",  # 12\n    'J','A','P','H'                               # 13..16\n  );\n  foreach (0..15){\n      $$board[$_]{btn}->configure(-text=> $extreme[$_],\n                                 -height => 8,\n                                  -width =>  16, ) if $extreme[$_];\n\n  }\n  @fixed = qw(0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15);\n  $mw->after(5000,\\&shuffle_board);#\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_82.txt",
        "content": "use strict; \nuse warnings;\n\nuse List::Util qw(shuffle first);\nmy @tbl = ([1,2,3,4],[5,6,7,8],[9,10,11,12],[13,14,15,16]);\nmy $e = [3,3];\nfor (1..$ARGV[0]||1000) {\n  my $new = (shuffle &ad($e))[0];\n  $tbl[$e->[0]][$e->[1]] = $tbl[$new->[0]][$new->[1]];\n  $tbl[$new->[0]]->[$new->[1]] = 16;\n  $e = [$new->[0],$new->[1]];\n}\nwhile(1){\n  print +(join ' ',map{$_==16?'  ':sprintf '%02s',$_}@{$tbl[$_]}),\"\\n\" for 0..3;\n  my $m = <STDIN>;\n  chomp $m;  \n  die \"Enter a number to move!\" unless $m;\n  if ($m > 15){\n\twarn \"$m not in the board! Enter a tile from 1 to 15\\n\";\n\tnext;\n  }\n  my $tile=first{$tbl[$$_[0]]->[$$_[1]]==$m}map{[$_,0],[$_,1],[$_,2],[$_,3]}0..3;\n  my $new=first{$tbl[$$_[0]]->[$$_[1]]==16}&ad(grep{$tbl[$$_[0]]->[$$_[1]]==$m}\n          map {[$_,0],[$_,1],[$_,2],[$_,3]}0..3);\n  if ($new){$tbl[$$new[0]][$$new[1]]=$m;$tbl[$$tile[0]][$$tile[1]]=16;}\n  system ($^O eq 'MSWin32' ? 'cls' : 'clear');\n}\nsub ad{\n      my $e = shift; grep {$_->[0]<4 && $_->[1]<4 && $_->[0]>-1 && $_->[1]>-1}\n      [$$e[0]-1,$$e[1]],[$$e[0]+1,$$e[1]],[$$e[0],$$e[1]-1],[$$e[0],$$e[1]+1]\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_83.txt",
        "content": "constant ESC=27, UP=328, LEFT=331, RIGHT=333, DOWN=336\nsequence board = tagset(15)&0, solve = board\ninteger pos = 16\n \nprocedure print_board()\n    for i=1 to length(board) do\n        puts(1,iff(i=pos?\"   \":sprintf(\"%3d\",{board[i]})))\n        if mod(i,4)=0 then puts(1,\"\\n\") end if\n    end for\n    puts(1,\"\\n\")\nend procedure\n \nprocedure move(integer d)\n    integer new_pos = pos+{+4,+1,-1,-4}[d]\n    if new_pos>=1 and new_pos<=16\n    and (mod(pos,4)=mod(new_pos,4) -- same col, or row:\n     or floor((pos-1)/4)=floor((new_pos-1)/4)) then\n        {board[pos],board[new_pos]} = {board[new_pos],0}\n        pos = new_pos\n    end if\nend procedure\n \nfor i=1 to 5 do move(rand(4)) end for\nwhile 1 do\n    print_board()\n    if board=solve then exit end if\n    integer c = find(wait_key(),{ESC,UP,LEFT,RIGHT,DOWN})-1\n    if c=0 then exit end if\n    move(c)\nend while\nputs(1,\"solved!\\n\")\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_84.txt",
        "content": "  1  2  3  4\n  5     6  8\n  9 10  7 11\n 13 14 15 12\n\n  1  2  3  4\n  5  6     8\n  9 10  7 11\n 13 14 15 12\n\n  1  2  3  4\n  5  6  7  8\n  9 10    11\n 13 14 15 12\n\n  1  2  3  4\n  5  6  7  8\n  9 10 11\n 13 14 15 12\n\n  1  2  3  4\n  5  6  7  8\n  9 10 11 12\n 13 14 15\n\nsolved!\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_85.txt",
        "content": "--\n-- demo\\rosetta\\15_puzzle_game.exw\n-- ===============================\n--\nwith javascript_semantics\ninclude pGUI.e\n\nconstant title = \"15 puzzle\",\n         help_text = \"\"\"\nPut the tiles back into order 1..15 and the hole last.\nRightarrow moves the tile to the left of the hole (rightwards) into it.\nLeftarrow moves the tile to the right of the hole (leftwards) into it.\nUparrow moves the tile below the hole (upwards) into it.\nDownarrow moves the tile above the hole (downwards) into it.\nPress 'N' to start a new game.\n\"\"\"\n\nfunction show_help()\n    IupMessage(title,help_text,bWrap:=false)\n    return IUP_IGNORE -- (don't open browser help!)\nend function\n\nIhandle canvas, dialog\ncdCanvas cddbuffer, cdcanvas\n\nsequence solved = tagset(15)&0, board\ninteger pos\n\nprocedure move(integer d)\n    if d=5 then -- new game\n        board = deep_copy(solved)\n        pos = 16\n        for i=1 to 1000 do move(rand(4)) end for\n    elsif d then\n        integer new_pos = pos+{+4,+1,-1,-4}[d]\n        if new_pos>=1 and new_pos<=16\n        and (mod(pos,4)=mod(new_pos,4) -- same col, or row:\n         or floor((pos-1)/4)=floor((new_pos-1)/4)) then\n            board[pos] = board[new_pos]\n            board[new_pos] = 0\n            pos = new_pos\n        end if\n    end if\nend procedure\nmove(5) -- new game\n\nfunction redraw_cb(Ihandle /*ih*/)\n    integer {dw,dh} = IupGetIntInt(canvas, \"DRAWSIZE\"),\n            ox,oy,              -- top right coords\n            os,ts,              -- overall and tile size\n            ht                  -- half tile, for number positioning\n            \n    if dw>=dh then\n        ox = floor((dw-dh)/2)\n        oy = 0\n        os = dh\n    else\n        ox = 0\n        oy = floor((dh-dw)/2)\n        os = dw\n    end if\n    ts = floor((os-10)/4-7)\n    ht = floor(ts/2+5)-10\n\n    cdCanvasActivate(cddbuffer)\n    cdCanvasSetBackground(cddbuffer, #FAF8EF)\n    cdCanvasClear(cddbuffer)\n    cdCanvasSetForeground(cddbuffer, #BBADA0)\n    cdCanvasRoundedBox(cddbuffer, ox+5, ox+os-5, oy+5, oy+os-5, 10, 10)\n\n    integer tx = ox+15\n    for y=1 to 4 do\n        integer ty = oy+15\n        for x=1 to 4 do\n            integer bxy = board[(4-x)*4+y]\n            cdCanvasSetForeground(cddbuffer, #EEE4DA)\n            cdCanvasRoundedBox(cddbuffer, tx, tx+ts-10, ty, ty+ts-10, 5, 5)\n            if bxy then\n                cdCanvasSetForeground(cddbuffer, #776E65)\n                cdCanvasFont(cddbuffer, \"Calibri\", CD_BOLD, 32)\n                cdCanvasText(cddbuffer, tx+ht, ty+ht, sprint(bxy)) \n            end if\n            ty += ts+5\n        end for\n        tx += ts+5\n    end for\n    cdCanvasFlush(cddbuffer)\n    string fmt = iff(board==solved?\"%s - solved\":\"%s\")\n    IupSetStrAttribute(dialog,\"TITLE\",fmt,{title})\n    return IUP_DEFAULT\nend function\n\nfunction map_cb(Ihandle ih)\n    cdcanvas = cdCreateCanvas(CD_IUP, ih)\n    cddbuffer = cdCreateCanvas(CD_DBUFFER, cdcanvas)\n    cdCanvasSetTextAlignment(cddbuffer, CD_CENTER) \n    return IUP_DEFAULT\nend function\n\nfunction key_cb(Ihandle /*ih*/, atom c)\n    if c=K_ESC then return IUP_CLOSE end if -- (standard practice for me)\n    if c=K_F5 then return IUP_DEFAULT end if -- (let browser reload work)\n    if c=K_F1 then return show_help() end if\n    move(find(upper(c),{K_UP,K_LEFT,K_RIGHT,K_DOWN,'N'}))\n    IupUpdate(canvas)\n    return IUP_IGNORE\nend function\n\nIupOpen()\n\ncanvas = IupCanvas(\"RASTERSIZE=520x540\")\nIupSetCallbacks(canvas, {\"MAP_CB\", Icallback(\"map_cb\"),\n                         \"ACTION\", Icallback(\"redraw_cb\")})\n\ndialog = IupDialog(canvas,`TITLE=\"%s\",MINSIZE=440x450`,{title})\nIupSetCallback(dialog, \"KEY_CB\", Icallback(\"key_cb\"));\n\nIupShow(dialog)\nIupSetAttribute(canvas, \"RASTERSIZE\", NULL)\nIupSetAttributeHandle(NULL,\"PARENTDIALOG\",dialog)\nif platform()!=JS then\n    IupMainLoop()\n    IupClose()\nend if\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_86.txt",
        "content": "<?php\n// Puzzle 15 Game - Rosseta Code - PHP 7 as the server-side script language.\n\n// This program DOES NOT use cookies.\n\nsession_start([\n  \"use_only_cookies\" => 0,\n  \"use_cookies\" => 0,\n  \"use_trans_sid\" => 1,\n]);\n\nclass Location\n{\n  protected $column, $row;\n\n  function __construct($column, $row){\n    $this->column = $column;\n    $this->row = $row;\n  }\n  function create_neighbor($direction){\n    $dx = 0; $dy = 0;\n    switch ($direction){\n      case 0: case 'left':  $dx = -1; break;\n      case 1: case 'right': $dx = +1; break;\n      case 2: case 'up':    $dy = -1; break;\n      case 3: case 'down':  $dy = +1; break;\n    }\n    return new Location($this->column + $dx, $this->row + $dy);\n  }\n  function equals($that){\n    return $this->column == $that->column && $this->row == $that->row;\n  }\n  function is_inside_rectangle($left, $top, $right, $bottom){\n    return $left <= $this->column && $this->column <= $right\n        && $top <= $this->row && $this->row <= $bottom;\n  }\n  function is_nearest_neighbor($that){\n    $s = abs($this->column - $that->column) + abs($this->row - $that->row);\n    return $s == 1;\n  }\n}\n\nclass Tile\n{\n  protected $index;\n  protected $content;\n  protected $target_location;\n  protected $current_location;\n\n  function __construct($index, $content, $row, $column){\n    $this->index = $index;\n    $this->content = $content;\n    $this->target_location = new Location($row, $column);\n    $this->current_location = $this->target_location;\n  }\n  function get_content(){\n    return $this->content;\n  }\n  function get_index(){\n    return $this->index;\n  }\n  function get_location(){\n    return $this->current_location;\n  }\n  function is_completed(){\n    return $this->current_location->equals($this->target_location);\n  }\n  function is_empty(){\n    return $this->content == NULL;\n  }\n  function is_nearest_neighbor($that){\n    $a = $this->current_location;\n    $b = $that->current_location;\n    return $a->is_nearest_neighbor($b);\n  }\n  function swap_locations($that){\n    $a = $this->current_location;\n    $b = $that->current_location;\n    $this->current_location = $b;\n    $that->current_location = $a;\n  }\n}\n\nclass Model\n{\n  protected $N;\n  protected $M;\n  protected $tiles;\n\n  function __construct($N, $M){\n    $this->N = $N;\n    $this->M = $M;\n    $this->tiles[0] = new Tile(0, NULL, $N, $M);\n    for ($k = 1; $k < $N * $M; $k++ ){\n      $i = 1 + intdiv($k - 1, $M);\n      $j = 1 + ($k - 1) % $M;\n      $this->tiles[$k] = new Tile($k, (string)$k, $i, $j);\n    }\n    $number_of_shuffles = 1000;\n    $i = 0;\n    while ($i < $number_of_shuffles)\n      if ($this->move_in_direction(random_int(0, 3)))\n        $i++;\n  }\n  function get_N(){\n    return $this->N;\n  }\n  function get_M(){\n    return $this->M;\n  }\n  function get_tile_by_index($index){\n    return $this->tiles[$index];\n  }\n  function get_tile_at_location($location){\n    foreach($this->tiles as $tile)\n      if ($location->equals($tile->get_location()))\n        return $tile;\n    return NULL;\n  }\n  function is_completed(){\n    foreach($this->tiles as $tile)\n      if (!$tile->is_completed())\n        return FALSE;\n    return TRUE;\n  }\n  function move($tile){\n    if ($tile != NULL)\n      foreach($this->tiles as $target){\n        if ($target->is_empty() && $target->is_nearest_neighbor($tile)){\n          $tile->swap_locations($target);\n          break;\n        }\n      }\n  }\n  function move_in_direction($direction){\n    foreach($this->tiles as $tile)\n      if ($tile->is_empty())\n        break;   \n    $location = $tile->get_location()->create_neighbor($direction);\n    if ($location->is_inside_rectangle(0, 0, $this->M, $this->N)){\n      $tile = $this->get_tile_at_location($location);\n      $this->move($tile);\n      return TRUE;\n    }\n    return FALSE;\n  }\n}\n\nclass View\n{\n  protected $model;\n\n  function __construct($model){\n      $this->model = $model;\n  }\n  function show(){\n    $N = $this->model->get_N();\n    $M = $this->model->get_M();\n    echo \"<form>\";\n    for ($i = 1; $i <= $N; $i++){\n      for ($j = 1; $j <= $M; $j++){\n        $tile = $this->model->get_tile_at_location(new Location($i, $j));\n        $content = $tile->get_content();\n        if ($content != NULL)\n          echo \"<span class='puzzle'>\"\n          .    \"<input type='submit' class='puzzle' name='index'\"\n          .    \"value='$content'>\"\n          .    \"</span>\";\n        else\n          echo \"<span class='puzzle'></span>\";\n      }\n      echo \"<br>\";\n    }\n    echo \"</form>\";\n    if ($this->model->is_completed()){\n      echo \"<p class='end-game'>\";\n      echo \"You win!\";\n      echo \"</p>\";\n    }\n  }\n}\n\nclass Controller\n{\n  protected $model;\n  protected $view;\n\n  function __construct($model, $view){\n    $this->model = $model;\n    $this->view = $view;\n  }\n  function run(){\n    if (isset($_GET['index'])){\n      $index = $_GET['index'];\n      $this->model->move($this->model->get_tile_by_index($index));\n    }\n    $this->view->show();\n  }\n}\n?>\n\n<!DOCTYPE html>\n<html lang=\"en\"><meta charset=\"UTF-8\">\n<head>\n  <title>15 puzzle game</title>\n  <style>\n    .puzzle{width: 4ch; display: inline-block; margin: 0; padding: 0.25ch;}\n    span.puzzle{padding: 0.1ch;}\n    .end-game{font-size: 400%; color: red;}\n  </style>\n</head>\n<body>\n  <p><?php\n    if (!isset($_SESSION['model'])){\n      $width = 4; $height = 4;\n      $model = new Model($width, $height);\n    }\n    else\n      $model = unserialize($_SESSION['model']);\n    $view = new View($model);\n    $controller = new Controller($model, $view);\n    $controller->run();\n    $_SESSION['model'] = serialize($model);\n  ?></p>\n</body>\n</html>\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_87.txt",
        "content": " import util.\n\nmain =>\n    Board = {{1,2,3,4},\n             {5,6,7,8},\n             {9,10,11,12},\n             {13,14,15,0}},\n    Goal = copy_term(Board),\n    shuffle(Board),\n    play(Board,Goal).\n\nshuffle(Board) =>\n    foreach (_ in 1..1000)\n        R1 = random() mod 4 + 1,\n        C1 = random() mod 4 + 1,\n        R2 = random() mod 4 + 1,\n        C2 = random() mod 4 + 1,\n        T\u00a0:= Board[R1,C1],\n        Board[R1,C1]\u00a0:= Board[R2,C2],\n        Board[R2,C2]\u00a0:= T\n    end.\n\nplay(Board,Goal) =>\n    while (Board\u00a0!= Goal)\n        print_board(Board),\n        possible_moves(Board,R0,C0,Moves),\n        printf(\"Possible moves are: %w, 0 to exit. Your move? =>  \", Moves),\n        S = read_line().strip(),\n        if S == \"0\" || S == \"\" then\n            halt\n        else\n            move_hole(Board,R0,C0,to_int(S))\n        end\n    end,\n    print_board(Board),\n    println(\"Puzzle solved.\").\n\nprint_board(Board) =>\n    N = len(Board),\n    print(\"+----+----+----+----+\\n\"),\n    foreach (R in 1..N)\n        print(\"|\"),\n        foreach (C in 1..N)\n            printf(\"%4d|\", Board[R,C])\n        end,\n        nl\n    end,\n    println(\"+----+----+----+----+\").\n\npossible_moves(Board,R0,C0,Moves) =>\n    N = len(Board),\n    between(1,N,R0),\n    between(1,N,C0),\n    Board[R0,C0] == 0,\u00a0!,\n    NeibsOfHole = [(R1,C1)\u00a0: (R1,C1) in [(R0-1,C0), (R0+1,C0), (R0,C0-1), (R0,C0+1)], R1 >= 1, R1 =< N, C1 >= 1, C1 =< N],\n    Moves = sort([Board[R,C]\u00a0: (R,C) in NeibsOfHole]).\n\nmove_hole(Board,R0,C0,S) =>\n    N = len(Board),\n    between(1,N,R),\n    between(1,N,C),\n    Board[R,C] == S,\u00a0!,\n    Board[R0,C0]\u00a0:= S,\n    Board[R,C]\u00a0:= 0.",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_88.txt",
        "content": "#15 Puzzle Game\n$Script:Neighbours = @{\n    \"1\" = @(\"2\",\"5\")\n    \"2\" = @(\"1\",\"3\",\"6\")\n    \"3\" = @(\"2\",\"4\",\"7\")\n    \"4\" = @(\"3\",\"8\")\n    \"5\" = @(\"1\",\"6\",\"9\")\n    \"6\" = @(\"2\",\"5\",\"7\",\"10\")\n    \"7\" = @(\"3\",\"6\",\"8\",\"11\")\n    \"8\" = @(\"4\",\"7\",\"12\")\n    \"9\" = @(\"5\",\"10\",\"13\")\n    \"10\" = @(\"6\",\"9\",\"11\",\"14\")\n    \"11\" = @(\"7\",\"10\",\"12\",\"15\")\n    \"12\" = @(\"8\",\"11\",\"0\")\n    \"13\" = @(\"9\",\"14\")\n    \"14\" = @(\"10\",\"13\",\"15\")\n    \"15\" = @(\"11\",\"14\",\"0\")\n    \"0\" = @(\"12\",\"15\")\n}\n$script:blank = ''\n#region XAML window definition\n$xaml = @'\n<Window\n   xmlns=\"http://schemas.microsoft.com/winfx/2006/xaml/presentation\"\n   xmlns:x=\"http://schemas.microsoft.com/winfx/2006/xaml\"\n   xmlns:d=\"http://schemas.microsoft.com/expression/blend/2008\" xmlns:mc=\"http://schemas.openxmlformats.org/markup-compatibility/2006\" mc:Ignorable=\"d\"\n   MinWidth=\"200\"\n   Width =\"333.333\"\n   Title=\"15 Game\"\n   Topmost=\"True\" Height=\"398.001\" VerticalAlignment=\"Center\" HorizontalAlignment=\"Center\">\n    <Grid HorizontalAlignment=\"Center\" Height=\"285\" Margin=\"0\" VerticalAlignment=\"Center\" Width=\"300\">\n        <Grid.ColumnDefinitions>\n            <ColumnDefinition/>\n            <ColumnDefinition/>\n            <ColumnDefinition/>\n            <ColumnDefinition/>\n        </Grid.ColumnDefinitions>\n        <Grid.RowDefinitions>\n            <RowDefinition/>\n            <RowDefinition/>\n            <RowDefinition/>\n            <RowDefinition/>\n        </Grid.RowDefinitions>\n        <Button x:Name=\"B_1\" Content=\"01\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\"/>\n        <Button x:Name=\"B_2\" Content=\"02\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"1\"/>\n        <Button x:Name=\"B_3\" Content=\"03\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"2\"/>\n        <Button x:Name=\"B_4\" Content=\"04\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"3\"/>\n        <Button x:Name=\"B_5\" Content=\"05\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Row=\"1\"/>\n        <Button x:Name=\"B_6\" Content=\"06\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"1\" Grid.Row=\"1\"/>\n        <Button x:Name=\"B_7\" Content=\"07\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"2\" Grid.Row=\"1\"/>\n        <Button x:Name=\"B_8\" Content=\"08\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"3\" Grid.Row=\"1\"/>\n        <Button x:Name=\"B_9\" Content=\"09\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Margin=\"0,71,0,0\" Grid.Row=\"1\" Grid.RowSpan=\"2\"/>\n        <Button x:Name=\"B_10\" Content=\"10\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"1\" Grid.Row=\"1\" Margin=\"0,71,0,0\" Grid.RowSpan=\"2\"/>\n        <Button x:Name=\"B_11\" Content=\"11\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"2\" Grid.Row=\"1\" Margin=\"0,71,0,0\" Grid.RowSpan=\"2\"/>\n        <Button x:Name=\"B_12\" Content=\"12\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"3\" Grid.Row=\"1\" Margin=\"0,71,0,0\" Grid.RowSpan=\"2\"/>\n        <Button x:Name=\"B_13\" Content=\"13\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Margin=\"0,71,0,0\" Grid.Row=\"2\" Grid.RowSpan=\"2\"/>\n        <Button x:Name=\"B_14\" Content=\"14\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"1\" Grid.Row=\"2\" Margin=\"0,71,0,0\" Grid.RowSpan=\"2\"/>\n        <Button x:Name=\"B_15\" Content=\"15\" HorizontalAlignment=\"Center\" VerticalAlignment=\"Center\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"2\" Grid.Row=\"2\" Margin=\"0,71,0,0\" Grid.RowSpan=\"2\"/>\n        <Button x:Name=\"B_0\" Content=\"00\" HorizontalAlignment=\"Left\" VerticalAlignment=\"Top\" Width=\"75\" Height=\"72\" FontSize=\"24\" Grid.Column=\"3\" Grid.Row=\"2\" Margin=\"0,71,0,0\" Grid.RowSpan=\"2\"/>\n        <Button x:Name=\"B_Jumble\" Grid.ColumnSpan=\"2\" Content=\"Jumble Tiles\" Grid.Column=\"1\" HorizontalAlignment=\"Left\" Height=\"23\" Margin=\"0,81,0,-33\" Grid.Row=\"3\" VerticalAlignment=\"Top\" Width=\"150\"/>\n    </Grid>\n</Window>\n'@\n#endregion\n\n#region Code Behind\nfunction Convert-XAMLtoWindow\n{\n    param\n    (\n        [Parameter(Mandatory=$true)]\n        [string]\n        $XAML\n    )\n  \n    Add-Type -AssemblyName PresentationFramework\n  \n    $reader = [XML.XMLReader]::Create([IO.StringReader]$XAML)\n    $result = [Windows.Markup.XAMLReader]::Load($reader)\n    $reader.Close()\n    $reader = [XML.XMLReader]::Create([IO.StringReader]$XAML)\n    while ($reader.Read())\n    {\n        $name=$reader.GetAttribute('Name')\n        if (!$name) { $name=$reader.GetAttribute('x:Name') }\n        if($name)\n        {$result | Add-Member NoteProperty -Name $name -Value $result.FindName($name) -Force}\n    }\n    $reader.Close()\n    $result\n}\nfunction Show-WPFWindow\n{\n    param\n    (\n        [Parameter(Mandatory=$true)]\n        [Windows.Window]\n        $Window\n    )\n  \n    $result = $null\n    $null = $window.Dispatcher.InvokeAsync{\n        $result = $window.ShowDialog()\n        Set-Variable -Name result -Value $result -Scope 1\n    }.Wait()\n    $result\n}\n#endregion Code Behind\n\n#region Convert XAML to Window\n$window = Convert-XAMLtoWindow -XAML $xaml \n\n#endregion\n\n#region Define Event Handlers\nfunction Test-Victory{\n    #Evaluate if all the labels are in the correct position\n    $victory = $true\n    foreach($num in 1..15){\n        if([int]$window.\"b_$num\".Content -ne $num){$victory = $false;break}\n    }\n    return($victory)\n}\nfunction Test-Move($Number){\n    #Number is a string of the pressed button number.\n    if($Script:Neighbours[$Number] -contains $script:blank){\n        return($true)\n    } else {\n        return($false)\n    }\n}\nFunction Move-Tile($Number,$Bypass){\n    if((!(Test-Victory)) -or $Bypass){\n        if(Test-Move $Number){\n            #Set the new window label\n            $window.\"B_$script:blank\".content = $window.\"B_$Number\".content\n            $window.\"B_$script:blank\".background = $window.\"B_$Number\".background\n            $window.\"B_$Number\".background = \"#FFDDDDDD\"\n            #Set the new blank window label\n            $window.\"B_$Number\".content = ''\n            #Enable the old blank tile\n            $window.\"B_$script:blank\".isenabled = $true\n            #disable the new blank tile\n            $window.\"B_$Number\".isenabled = $false\n            #set the new blank\n            $script:blank = $Number\n        }\n    }\n}\nfunction Move-TileRandom{\n    $lastmove = \"1\"\n    for($i=0;$i -lt 500;$i++){\n        $move = $Script:Neighbours[$script:blank] | Where-Object {$_ -ne $lastmove} | Get-Random\n        $lastmove = $move\n        Move-Tile $move $true\n    }\n}\nfunction Set-TileColour($Tile){\n    #I was curious about setting tiles to a checkerboard pattern at this stage. It's probably far better to just define it in the xaml\n    #Ignore the blank tile\n    if($Tile -ne 0){\n        #check if the row of the tile is odd or even\n        if((([math]::floor(($Tile - 1)/4)) % 2 -eq 0)){\n            #check if the tile is odd or even\n            if($Tile % 2 -eq 0){\n                $window.\"B_$Tile\".Background = \"#FFFF7878\"\n            } else {\n                $window.\"B_$Tile\".Background = \"#FF9696FF\"\n            }\n        }else{\n            if($Tile % 2 -eq 0){\n                $window.\"B_$Tile\".Background = \"#FF9696FF\"\n            } else {\n                $window.\"B_$Tile\".Background = \"#FFFF7878\"\n            }\n        }\n    } else {\n        $window.B_0.Background = \"#FFDDDDDD\"\n    }\n}\n$window.B_1.add_Click{\n    $n = \"1\"\n    move-tile $n\n}\n$window.B_2.add_Click{\n    $n = \"2\"\n    move-tile $n\n}\n$window.B_3.add_Click{\n    $n = \"3\"\n    move-tile $n\n}\n$window.B_4.add_Click{\n    $n = \"4\"\n    move-tile $n\n}\n$window.B_5.add_Click{\n    $n = \"5\"\n    move-tile $n\n}\n$window.B_6.add_Click{\n    $n = \"6\"\n    move-tile $n\n}\n$window.B_7.add_Click{\n    $n = \"7\"\n    move-tile $n\n}\n$window.B_8.add_Click{\n    $n = \"8\"\n    move-tile $n\n}\n$window.B_9.add_Click{\n    $n = \"9\"\n    move-tile $n\n}\n$window.B_10.add_Click{\n    $n = \"10\"\n    move-tile $n\n}\n$window.B_11.add_Click{\n    $n = \"11\"\n    move-tile $n\n}\n$window.B_12.add_Click{\n    $n = \"12\"\n    move-tile $n\n}\n$window.B_13.add_Click{\n    $n = \"13\"\n    move-tile $n\n}\n$window.B_14.add_Click{\n    $n = \"14\"\n    move-tile $n\n}\n$window.B_15.add_Click{\n    $n = \"15\"\n    move-tile $n\n}\n$window.B_0.add_Click{\n    $n = \"0\"\n    move-tile $n\n}\n\n$window.B_Jumble.add_Click{\n    Move-TileRandom\n}\n#endregion Event Handlers\n(([math]::floor((\"9\" - 1)/4)) % 2 -eq 0)\n#region Manipulate Window Content\n#initial processing of tiles\n$array = 0..15 | ForEach-Object {\"{0:00}\" -f $_}\n0..15 | ForEach-Object {if($array[$_] -ne '00'){$window.\"B_$_\".content = $array[$_]} else {$window.\"B_$_\".content = '';$script:blank = \"$_\";$window.\"B_$_\".isenabled = $false};Set-TileColour $_}\n#Shove them around a bit\nMove-TileRandom\n#endregion\n# Show Window\n$result = Show-WPFWindow -Window $window\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_89.txt",
        "content": "int number_of_grid_cells = 16;  //   Set the number of cells of the board here 9, 16, 25 etc  \ncolor piece_color = color(255, 175, 0);\ncolor background_color = color(235, 231, 178);\ncolor piece_shadow_dark = color(206, 141, 0);\ncolor piece_shadow_light = color(255, 214, 126);\nint z, t, p, piece_number, row_length, piece_side_length;\n\nPuzzlePiece[] piece = new PuzzlePiece[number_of_grid_cells]; //  Number of puzzle pieces objects array\n\nvoid setup() { \n  size(400, 400);  // Window size width and height must be egual\n\tbackground(200, 50, 0);\n  row_length = int(sqrt(number_of_grid_cells));\n  piece_side_length = width/row_length;\n  textSize(piece_side_length/2.7);\n  textAlign(CENTER);\n\n  PVector[] xy_values = new PVector[number_of_grid_cells]; //  Setting the x and y values for each cell on grid\n  for (int i = 0; i < number_of_grid_cells; i += row_length) { // Values are the top left pixel of the cell\n    for (int j = 0; j < row_length; j++) {\n      xy_values[z] = new PVector();\n      xy_values[z].x = j*piece_side_length;\n      xy_values[z].y = t*piece_side_length; \n      z++;\n    }\n    t++;\n  } \n\n  int[] place = new int[number_of_grid_cells]; // This array is  to help placing the pieces randomly and store values in piece objects array\n  for (int i = 0; i < number_of_grid_cells; i++) place[i] = 0;\n  piece_number = 0;\n\n  while (piece_number < number_of_grid_cells) {  // Placing pieces randomly in grid\n    p = int(random(0, number_of_grid_cells));\n    if (place[p] == 0) { // Once placed will be set to 1 to avoid designing again at this location\n      piece[piece_number] = new PuzzlePiece(piece_number, xy_values[p].x, xy_values[p].y); // Creating the piece objects array \n      place[p] = 1;\n      piece[piece_number].design(); // Design newly create piece object\n      piece_number++;\n    }\n  }\n}\n\nvoid draw() {  \n  for (int i = 0; i < number_of_grid_cells; i++) {   // Search all piece object indexes and verify which one is mouse pressed in this loop\n    if (mousePressed == true && mouseX >= piece[i].xPosition() && mouseX <= piece[i].xPosition()+piece_side_length && mouseY >= piece[i].yPosition() && mouseY <= piece[i].yPosition()+piece_side_length && piece[i].pieceNumber() != 15) {  \n      if (pieceMove(piece[number_of_grid_cells-1].xPosition(), piece[number_of_grid_cells-1].yPosition(), piece[i].xPosition(), piece[i].yPosition())) {\n        float temp_x = piece[number_of_grid_cells-1].xPosition(); // Remember x and y value of final piece index (white piece) \n        float temp_y = piece[number_of_grid_cells-1].yPosition();\n        piece[number_of_grid_cells-1].storePos(piece[i].xPosition(), piece[i].yPosition()); // Store clicked x and y value in final index of piece array\n        piece[i].storePos(temp_x, temp_y); // Store temp x and y value (the last/previous final index values) in current clicked piece index  \n        piece[number_of_grid_cells-1].design(); // draw the final index piece index (only final piece index is painted white)\n        piece[i].design(); // Draw a numbered piece of current index\n      }\n    }\n  }\n}\n\nboolean pieceMove(float final_index_piece_x, float final_index_piece_y, float current_index_x, float current_index_y) {\n  // If both x values from clicked and white piece have same value meaning in same horizontal column \n  // AND   current clicked y value is equal to white piece y value - piece side lenght  OR  current clicked y value + piece side lenght is egual to white piece y \n  if (current_index_x == final_index_piece_x && (current_index_y == final_index_piece_y-piece_side_length || (current_index_y == final_index_piece_y+piece_side_length))) return true;\n  // If both y values from clicked and white piece have same value meaning in same vertical column \n  // AND   current clicked x value is equal to white piece x value - piece side lenght  OR  current clicked x value + piece side lenght is egual to white piece x \n  else if (current_index_y == final_index_piece_y && (current_index_x == final_index_piece_x-piece_side_length || (current_index_x == final_index_piece_x+piece_side_length))) return true;\n  else return false;\n}\n\nclass PuzzlePiece {   \n  int piece_number;\n  float x_pos, y_pos;\n\n  PuzzlePiece(int _piece_nr, float _xp, float _yp) {\n    piece_number = _piece_nr;\n    x_pos = _xp;\n    y_pos = _yp;\n  }  \n\n  void storePos(float _xp, float _yp) {\n    x_pos = _xp;\n    y_pos = _yp;\n  }\n\n  int pieceNumber() {\n    return piece_number;\n  }\n\n  float xPosition() {\n    return x_pos;\n  }\n\n  float yPosition() {\n    return y_pos;\n  }\n\n  void design() {\n    noStroke();\n    fill(piece_color);\n    if (piece_number == number_of_grid_cells-1) fill(background_color);   \n    rect(x_pos+1, y_pos+1, piece_side_length-1, piece_side_length-1);\n    if (piece_number != number_of_grid_cells-1) {\n      fill(0); // Black text shadow\n      text(piece_number+1, x_pos+piece_side_length/2+1, y_pos+piece_side_length/2+textAscent()/2);\n      fill(255);\n      text(piece_number+1, x_pos+piece_side_length/2, y_pos+piece_side_length/2+textAscent()/2);\n      stroke(piece_shadow_dark);\n      line(x_pos+piece_side_length-1, y_pos+1, x_pos+piece_side_length-1, y_pos+piece_side_length-1); // Right side shadow\n      line(x_pos+2, y_pos+piece_side_length, x_pos+piece_side_length-1, y_pos+piece_side_length); // Bottom side shadow\n      stroke(piece_shadow_light);\n      line(x_pos+2, y_pos-1, x_pos+2, y_pos+piece_side_length); // Left bright\n      line(x_pos+2, y_pos+1, x_pos+piece_side_length-1, y_pos+1); // Upper bright\n    }\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_9.txt",
        "content": "   package Puzzle is new Generic_Puzzle(Rows => 3, Cols => 3, Name => Image);\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_90.txt",
        "content": "# Set the number of cells of the board here 9, 16, 25 etc\nnum_grid_cells = 16\npiece_color = color(255, 175, 0)\nbackground_color = color(235, 231, 178)\npiece_shadow_dark = color(206, 141, 0)\npiece_shadow_light = color(255, 214, 126)\n\ndef setup():\n    global piece, piece_number, row_length, piece_side_length\n    size(400, 400)  # Window size width and height must be egual\n    background(200, 50, 0)\n    row_length = int(sqrt(num_grid_cells))\n    piece_side_length = width / row_length\n    textSize(piece_side_length / 2.7)\n    textAlign(CENTER)\n    # Setting the x and y values for each cell on grid\n    xy_val = []\n    t = 0\n    for i in range(0, num_grid_cells, row_length):\n        for j in range(row_length):\n            xy_val.append((j * piece_side_length,\n                           t * piece_side_length))\n        t += 1\n    piece = []  # Puzzle piece objects\n    placed = [False] * num_grid_cells  # to help placing the pieces randomly\n    piece_number = 0\n    # Placing pieces randomly in grid\n    while (piece_number < num_grid_cells):\n        p = int(random(0, num_grid_cells))\n        # Once placed will be set to True to avoid adding again at this location\n        if not placed[p]:\n            # Creating the piece objects list\n            piece.append(PuzzlePiece(piece_number, xy_val[p][0], xy_val[p][1]))\n            placed[p] = True\n            piece[piece_number].design()  # Draw newly create piece object\n            piece_number += 1\n\ndef draw():\n    # Search all piece object indexes and verify which one is mouse pressed\n    for i in range(num_grid_cells):\n        if (mousePressed and\n                piece[i].x <= mouseX <= piece[i].x + piece_side_length and\n                piece[i].y <= mouseY <= piece[i].y + piece_side_length and\n                piece[i].piece_number != 15):\n            if (pieceMove(piece[num_grid_cells - 1].x, piece[num_grid_cells - 1].y, piece[i].x, piece[i].y)):\n                # Remember x and y value of final piece index (white piece)\n                temp_x = int(piece[num_grid_cells - 1].x)\n                temp_y = int(piece[num_grid_cells - 1].y)\n                # Store clicked x and y value in final index of piece list\n                piece[num_grid_cells - 1].set_pos(piece[i].x, piece[i].y)\n                # Store temp x and y value (the last/previous final index\n                # values) in current clicked piece\n                piece[i].set_pos(temp_x, temp_y)\n                # draw the final index piece index (only final piece index is\n                # painted white)\n                piece[num_grid_cells - 1].design()\n                piece[i].design()  # Draw a numbered piece of current index\n\ndef pieceMove(final_index_piece_x, final_index_piece_y, current_index_x, current_index_y):\n    # If both x's from clicked and white piece have same value meaning in same horizontal column\n    # AND current clicked y value is equal to white piece y value - piece side lenght OR\n    # current clicked y value + piece side lenght is egual to white piece y\n    if (current_index_x == final_index_piece_x and (current_index_y == final_index_piece_y - piece_side_length or\n                                                    (current_index_y == final_index_piece_y + piece_side_length))):\n        return True\n    # If both y's from clicked and white piece have same value meaning in same vertical column AND current clicked x value\n    # is equal to white piece x value - piece side lenght OR current clicked x value + piece side lenght is\n    # egual to white piece x\n    elif (current_index_y == final_index_piece_y and (current_index_x == final_index_piece_x - piece_side_length or\n                                                      (current_index_x == final_index_piece_x + piece_side_length))):\n        return True\n    else:\n        return False\n\nclass PuzzlePiece:\n\n    def __init__(self, pn, xp, yp):\n        self.piece_number = pn\n        self.x = xp\n        self.y = yp\n\n    def set_pos(self, xp, yp):\n        self.x = xp\n        self.y = yp\n\n    def design(self):\n        noStroke()\n        fill(piece_color)\n        if (self.piece_number == num_grid_cells - 1):\n            fill(background_color)\n        rect(self.x + 1, self.y + 1,\n             piece_side_length - 1, piece_side_length - 1)\n        if (self.piece_number != num_grid_cells - 1):\n            fill(0)  # Black text shadow\n            text(self.piece_number + 1, self.x + piece_side_length / 2 + 2,\n                 self.y + piece_side_length / 2 + textAscent() / 2)\n            fill(255)\n            text(self.piece_number + 1, self.x + piece_side_length / 2,\n                 self.y + piece_side_length / 2 + textAscent() / 2)\n            stroke(piece_shadow_dark)\n            line(self.x + piece_side_length - 1, self.y + 1, self.x +\n                 piece_side_length - 1, self.y + piece_side_length - 1)  # Right side shadow\n            line(self.x + 2, self.y + piece_side_length, self.x +\n                 piece_side_length - 1, self.y + piece_side_length)  # Bottom side shadow\n            stroke(piece_shadow_light)\n            # Left bright\n            line(self.x + 2, self.y - 1, self.x + 2,\n                 self.y + piece_side_length)\n            # Upper bright\n            line(self.x + 2, self.y + 1, self.x +\n                 piece_side_length - 1, self.y + 1)\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_91.txt",
        "content": "% map the sequence of cells\nnext_cell(1,Y,2,Y).\nnext_cell(2,Y,3,Y).\nnext_cell(3,Y,4,Y).\nnext_cell(4,1,1,2).\nnext_cell(4,2,1,3).\nnext_cell(4,3,1,4).\n\n% map the game items, and how to print\t\nitem(1,2,   '  1 ').\nitem(2,3,   '  2 ').\nitem(3,4,   '  3 ').\nitem(4,5,   '  4 ').\nitem(5,6,   '  5 ').\nitem(6,7,   '  6 ').\nitem(7,8,   '  7 ').\nitem(8,9,   '  8 ').\nitem(9,10,  '  9 ').\nitem(10,11, ' 10 ').\nitem(11,12, ' 11 ').\nitem(12,13, ' 12 ').\nitem(13,14, ' 13 ').\nitem(14,15, ' 14 ').\nitem(15,0,  ' 15 ').\n\n% Move - find the current blank space, and the new place and swap them\nmove_1(1,2).\nmove_1(2,3).\nmove_1(3,4).\n\nmove(up, X, Y, X, Y1) :- move_1(Y1,Y). \nmove(down, X, Y, X, Y1) :- move_1(Y, Y1).\nmove(left, X, Y, X1, Y) :- move_1(X1, X).\nmove(right, X, Y, X1, Y) :- move_1(X, X1).\n\nmove(Dir, Board, [p(X1,Y1,0),p(X,Y,P)|B2]) :-\n    select(p(X, Y, 0), Board, B1),\n    move(Dir, X,Y,X1,Y1),\n    select(p(X1, Y1, P), B1, B2).\n\n% Solved - the game is solved if running through the next_cell sequence produces the item sequence.\nsolved(Board) :-\n    select(p(1,1,1),Board,Remaining),\n    solved(Remaining,p(1,1,1)).\nsolved([p(4,4,0)], p(_,_,15)).\nsolved(Board,p(Xp,Yp,Prev)) :- \n    item(Prev,P,_),\n    select(p(X,Y,P),Board,Remaining),\n    next_cell(Xp,Yp,X,Y),\n    solved(Remaining, p(X,Y,P)).   \n\n% Print - run through the next_cell sequence printing the found items.\nprint(Board) :-\n    select(p(1,1,P),Board,Remaining),\n    nl, write_cell(P), \n    print(Remaining,p(1,1)).\nprint([],_) :- nl.\nprint(Board,p(X,Y)) :-\n    next_cell(X,Y,X1,Y1),\n    select(p(X1,Y1,P),Board,Remaining),\n    write_cell(P),\n    end_line_or_not(X1),\n    print(Remaining,p(X1,Y1)).\n\nwrite_cell(0) :- write('    ').\t\nwrite_cell(P) :- item(P,_,W), write(W).\n\nend_line_or_not(1).\nend_line_or_not(2).\nend_line_or_not(3).\nend_line_or_not(4) :- nl.\n\n% Next Move - get the player input.\nnext_move_by_player(Move) :- \n    repeat, \n    get_single_char(Char), \n    key_move(Char, Move).\n\nkey_move(119, up).    % 'w' \nkey_move(115, down).  % 'd'\t\nkey_move(97, left).   % 'a'\nkey_move(100, right). % 'd' \n\n% Play - loop over the player moves until solved.\nplay(Board) :-\n    solved(Board) -> (\n        print(Board),\n        write('You Win!\\n'))\n    ; (\n        print(Board),\n        next_move_by_player(Move),\n        move(Move, Board, NewBoard),\n        play(NewBoard)).\n\nplay :-\n   test_board(Board),\n   play(Board),\n   !.\n    \ntest_board(\n   [p(1,1,9),p(2,1,1),p(3,1,4),p(4,1,7),\n    p(1,2,6),p(2,2,5),p(3,2,3),p(4,2,2),\n    p(1,3,13),p(2,3,10),p(3,3,0),p(4,3,8),\n    p(1,4,14),p(2,4,15),p(3,4,11),p(4,4,12)]).\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_92.txt",
        "content": "#difficulty=10 ;higher is harder\n#up=\"u\"\n#down=\"d\"\n#left=\"l\"\n#right=\"r\"\nOpenConsole(\"15 game\"):EnableGraphicalConsole(1)\nGlobal Dim Game.i(3,3)\nGlobal hole.point\n\nProcedure NewBoard()\n    num.i=0\n    For j=0 To 3\n        For i=0 To 3\n            Game(i,j)=num\n            num+1\n        Next i\n    Next j\nEndProcedure\nProcedure.s displayBoard()\n    For j=0 To 3\n        For i=0 To 3\n            ConsoleLocate(i,j)\n            If Game(i,j)=0:Print(\" \"):Continue:EndIf\n            Print(Hex(Game(i,j)))\n        Next i\n    Next j\n    PrintN(\"\")\n    Print(\"Your Choice Up\u00a0:\"+#up+\", Down\u00a0:\"+#down+\", Left\u00a0:\"+#left+\" Or Right\u00a0:\"+#right+\" \")\n    Repeat\n        keypress$=Inkey()\n    Until keypress$<>\"\"\n    keypress$=LCase(keypress$)\n    ProcedureReturn keypress$\nEndProcedure\nProcedure UpdateBoard(key$)\n    If key$=#up And hole\\y<3\n        Swap game(hole\\x,hole\\y),game(hole\\x,hole\\y+1):hole\\y+1\n    ElseIf key$=#down And hole\\y\n        Swap game(hole\\x,hole\\y),game(hole\\x,hole\\y-1):hole\\y-1\n    ElseIf key$=#left And hole\\x<3\n        Swap game(hole\\x,hole\\y),game(hole\\x+1,hole\\y):hole\\x+1\n    ElseIf key$=#right And hole\\x\n        Swap game(hole\\x,hole\\y),game(hole\\x-1,hole\\y):hole\\x-1\n    EndIf\nEndProcedure\nProcedure TestGameWin()\n    For j=0 To 3\n        For i=0 To 3\n            num+1\n            If game(i,j)=num:win+1:EndIf\n        Next i\n    Next j\n    If win=15:ProcedureReturn 1:EndIf\nEndProcedure\nProcedure ShuffleBoard(difficulty.i)\n    Dim randomKey$(3)\n    randomkey$(0)=#up:randomkey$(1)=#down:randomkey$(2)=#left:randomkey$(3)=#right\n    For i=1 To difficulty\n       UpdateBoard(randomKey$(Random(3))) \n    Next i\nEndProcedure\nNewBoard()\nShuffleBoard(#difficulty)\nRepeat\n    choice$=displayBoard()\n    UpdateBoard(choice$)\nUntil TestGameWin()\nPrint(\"Won\u00a0!\")\nCloseConsole()\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_93.txt",
        "content": "1234\n5678\n9ABC\nDEF\n\nYour Choice Up :u, Down :d, Left :l Or Right :r\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_94.txt",
        "content": "''' Structural Game for 15 - Puzzle with different difficulty levels'''\nfrom random import randint\n\n\nclass Puzzle:\n    def __init__(self):\n        self.items = {}\n        self.position = None\n\n    def main_frame(self):\n        d = self.items\n        print('+-----+-----+-----+-----+')\n        print('|%s|%s|%s|%s|' % (d[1], d[2], d[3], d[4]))\n        print('+-----+-----+-----+-----+')\n        print('|%s|%s|%s|%s|' % (d[5], d[6], d[7], d[8]))\n        print('+-----+-----+-----+-----+')\n        print('|%s|%s|%s|%s|' % (d[9], d[10], d[11], d[12]))\n        print('+-----+-----+-----+-----+')\n        print('|%s|%s|%s|%s|' % (d[13], d[14], d[15], d[16]))\n        print('+-----+-----+-----+-----+')\n\n    def format(self, ch):\n        ch = ch.strip()\n        if len(ch) == 1:\n            return '  ' + ch + '  '\n        elif len(ch) == 2:\n            return '  ' + ch + ' '\n        elif len(ch) == 0:\n            return '     '\n\n    def change(self, to):\n        fro = self.position\n        for a, b in self.items.items():\n            if b == self.format(str(to)):\n                to = a\n                break\n        self.items[fro], self.items[to] = self.items[to], self.items[fro]\n        self.position = to\n\n    def build_board(self, difficulty):\n        for i in range(1, 17):\n            self.items[i] = self.format(str(i))\n        tmp = 0\n        for a, b in self.items.items():\n            if b == '  16 ':\n                self.items[a] = '     '\n                tmp = a\n                break\n        self.position = tmp\n        if difficulty == 0:\n            diff = 10\n        elif difficulty == 1:\n            diff = 50\n        else:\n            diff = 100\n        for _ in range(diff):\n            lst = self.valid_moves()\n            lst1 = []\n            for j in lst:\n                lst1.append(int(j.strip()))\n            self.change(lst1[randint(0, len(lst1)-1)])\n\n    def valid_moves(self):\n        pos = self.position\n        if pos in [6, 7, 10, 11]:\n            return self.items[pos - 4], self.items[pos - 1],\\\n                   self.items[pos + 1], self.items[pos + 4]\n        elif pos in [5, 9]:\n            return self.items[pos - 4], self.items[pos + 4],\\\n                   self.items[pos + 1]\n        elif pos in [8, 12]:\n            return self.items[pos - 4], self.items[pos + 4],\\\n                   self.items[pos - 1]\n        elif pos in [2, 3]:\n            return self.items[pos - 1], self.items[pos + 1], self.items[pos + 4]\n        elif pos in [14, 15]:\n            return self.items[pos - 1], self.items[pos + 1],\\\n                  self.items[pos - 4]\n        elif pos == 1:\n            return self.items[pos + 1], self.items[pos + 4]\n        elif pos == 4:\n            return self.items[pos - 1], self.items[pos + 4]\n        elif pos == 13:\n            return self.items[pos + 1], self.items[pos - 4]\n        elif pos == 16:\n            return self.items[pos - 1], self.items[pos - 4]\n\n    def game_over(self):\n        flag = False\n        for a, b in self.items.items():\n            if b == '     ':\n                pass\n            else:\n                if a == int(b.strip()):\n                    flag = True\n                else:\n                    flag = False\n        return flag\n\n\ng = Puzzle()\ng.build_board(int(input('Enter the difficulty\u00a0: 0 1 2\\n2 '\n                        '=> highest 0=> lowest\\n')))\ng.main_frame()\nprint('Enter 0 to exit')\nwhile True:\n    print('Hello user:\\nTo change the position just enter the no. near it')\n    lst = g.valid_moves()\n    lst1 = []\n    for i in lst:\n        lst1.append(int(i.strip()))\n        print(i.strip(), '\\t', end='')\n    print()\n    x = int(input())\n    if x == 0:\n        break\n    elif x not in lst1:\n        print('Wrong move')\n    else:\n        g.change(x)\n    g.main_frame()\n    if g.game_over():\n        print('You WON')\n        break\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_95.txt",
        "content": "Enter the difficulty\u00a0: 0 1 2\n2 => highest 0=> lowest\n1\n+-----+-----+-----+-----+\n|  1  |  7  |  2  |  4  |\n+-----+-----+-----+-----+\n|  5  |  6  |  3  |  12 |\n+-----+-----+-----+-----+\n|  9  |  8  |  11 |  15 |\n+-----+-----+-----+-----+\n|  13 |  10 |  14 |     |\n+-----+-----+-----+-----+\nEnter 0 to exit\nHello user:\nTo change the position just enter the no. near it\n14 \t15 \t\n14\n+-----+-----+-----+-----+\n|  1  |  7  |  2  |  4  |\n+-----+-----+-----+-----+\n|  5  |  6  |  3  |  12 |\n+-----+-----+-----+-----+\n|  9  |  8  |  11 |  15 |\n+-----+-----+-----+-----+\n|  13 |  10 |     |  14 |\n+-----+-----+-----+-----+\nHello user:\nTo change the position just enter the no. near it\n10 \t14 \t11 \t\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_96.txt",
        "content": "''' Python 3.6.5 code using Tkinter graphical user interface.''' \n\nfrom tkinter import *\nfrom tkinter import messagebox\nimport random\n\n# ************************************************\n\nclass Board:\n    def __init__(self, playable=True):\n        while True:\n            # list of text for game squares:\n            self.lot = [str(i) for i in range(1,16)] + ['']\n            if not playable:\n                break\n            # list of text for game squares randomized:\n            random.shuffle(self.lot)\n            if self.is_solvable():\n                break\n            \n        # game board is 2D array of game squares:\n        self.bd = []\n        i = 0\n        for r in range(4):\n            row = []\n            for c in range(4):\n                row.append(Square(r,c,self.lot[i]))\n                i += 1\n            self.bd.append(row)\n            \n    # How to check if an instance of a 15 puzzle\n    # is solvable is explained here:\n    # https://www.geeksforgeeks.org/check-instance-15-puzzle-solvable/\n    # I only coded for the case where N is even.\n    def is_solvable(self):\n        inv = self.get_inversions()\n        odd = self.is_odd_row()\n        if inv % 2 == 0 and odd:\n            return True\n        if inv % 2 == 1 and not odd:\n            return True\n        return False\n        \n    def get_inversions(self):\n        cnt = 0\n        for i, x in enumerate(self.lot[:-1]):\n            if x != '':\n                for y in self.lot[i+1:]:\n                    if y != '' and int(x) > int(y):\n                        cnt += 1\n        return cnt\n\n    # returns True if open square is in odd row from bottom:\n    def is_odd_row(self):\n        idx = self.lot.index('')\n        return idx in [4,5,6,7,12,13,14,15]           \n\n    # returns name, text, and button object at row & col:\n    def get_item(self, r, c):\n        return self.bd[r][c].get()\n\n    def get_square(self, r, c):\n        return self.bd[r][c]\n\n    def game_won(self):\n        goal = [str(i) for i in range(1,16)] + ['']\n        i = 0\n        for r in range(4):\n            for c in range(4):\n                nm, txt, btn = self.get_item(r,c)\n                if txt != goal[i]:\n                    return False\n                i += 1\n        return True\n                \n# ************************************************\n\nclass Square:       # ['btn00', '0', None]\n    def __init__(self, row, col, txt):\n        self.row = row\n        self.col = col\n        self.name = 'btn' + str(row) + str(col)\n        self.txt = txt\n        self.btn = None\n        \n    def get(self):\n            return [self.name, self.txt, self.btn]\n\n    def set_btn(self, btn):\n        self.btn = btn\n\n    def set_txt(self, txt):\n        self.txt = txt\n\n# ************************************************\n\nclass Game:\n    def __init__(self, gw):\n        self.window = gw\n\n        # game data:\n        self.bd = None\n        self.playable = False\n\n        # top frame:\n        self.top_fr = Frame(gw,\n                            width=600,\n                            height=100,\n                            bg='light green')\n        self.top_fr.pack(fill=X)\n\n        self.hdg = Label(self.top_fr,\n                         text='  15 PUZZLE GAME  ',\n                         font='arial 22 bold',\n                         fg='Navy Blue',\n                         bg='white')\n        self.hdg.place(relx=0.5, rely=0.4,\n                       anchor=CENTER)\n\n        self.dir = Label(self.top_fr,\n                 text=\"(Click 'New Game' to begin)\",\n                 font='arial 12 ',\n                 fg='Navy Blue',\n                 bg='light green')\n        self.dir.place(relx=0.5, rely=0.8,\n                       anchor=CENTER)\n\n        self.play_btn = Button(self.top_fr,\n                               text='New \\nGame',\n                               bd=5,\n                               bg='PaleGreen4',\n                               fg='White',\n                               font='times 12 bold',\n                               command=self.new_game)\n        self.play_btn.place(relx=0.92, rely=0.5,\n                       anchor=E)\n\n        # bottom frame:\n        self.btm_fr = Frame(gw,\n                            width=600,\n                            height=500,\n                            bg='light steel blue')\n        self.btm_fr.pack(fill=X)\n\n        # board frame:\n        self.bd_fr = Frame(self.btm_fr,\n                           width=400+2,\n                           height=400+2,\n                           relief='solid',\n                           bd=1,\n                           bg='lemon chiffon')\n        self.bd_fr.place(relx=0.5, rely=0.5,\n                         anchor=CENTER)\n\n        self.play_game()\n\n# ************************************************\n\n    def new_game(self):\n        self.playable = True\n        self.dir.config(text='(Click on a square to move it)')\n        self.play_game()\n\n    def play_game(self):\n        # place squares on board:\n        if self.playable:\n            btn_state = 'normal'\n        else:\n            btn_state = 'disable'\n        self.bd = Board(self.playable)               \n        objh = 100  # widget height\n        objw = 100  # widget width\n        objx = 0    # x-position of widget in frame\n        objy = 0    # y-position of widget in frame\n\n        for r in range(4):\n            for c in range(4):\n                nm, txt, btn = self.bd.get_item(r,c)\n                bg_color = 'RosyBrown1'\n                if txt == '':\n                    bg_color = 'White'           \n                game_btn = Button(self.bd_fr,\n                                  text=txt,\n                                  relief='solid',\n                                  bd=1,\n                                  bg=bg_color,\n                                  font='times 12 bold',\n                                  state=btn_state,\n                                  command=lambda x=nm: self.clicked(x))\n                game_btn.place(x=objx, y=objy,\n                               height=objh, width=objw)\n                \n                sq = self.bd.get_square(r,c)\n                sq.set_btn(game_btn)\n                \n                objx = objx + objw\n            objx = 0\n            objy = objy + objh\n\n    # processing when a square is clicked:\n    def clicked(self, nm):\n        r, c = int(nm[3]), int(nm[4])\n        nm_fr, txt_fr, btn_fr = self.bd.get_item(r,c)\n        \n        # cannot 'move' open square to itself:\n        if not txt_fr:\n            messagebox.showerror(\n                'Error Message',\n                'Please select \"square\" to be moved')\n            return\n\n        # 'move' square to open square if 'adjacent' to it:            \n        adjs = [(r-1,c), (r, c-1), (r, c+1), (r+1, c)]\n        for x, y in adjs:\n            if 0 <= x <= 3 and 0 <= y <= 3:\n                nm_to, txt_to, btn_to = self.bd.get_item(x,y)\n                if not txt_to:\n                    sq = self.bd.get_square(x,y)\n                    sq.set_txt(txt_fr)\n                    sq = self.bd.get_square(r,c)\n                    sq.set_txt(txt_to)\n                    btn_to.config(text=txt_fr,\n                                  bg='RosyBrown1')\n                    btn_fr.config(text=txt_to,\n                                  bg='White')\n                    # check if game is won:              \n                    if self.bd.game_won():\n                        ans = messagebox.askquestion(\n                            'You won!!!   Play again?')\n                        if ans == 'no':\n                            self.window.destroy()\n                        else:\n                            self.new_game()\n                    return\n                \n        # cannot move 'non-adjacent' square to open square:\n        messagebox.showerror(\n            'Error Message',\n            'Illigal move, Try again')\n        return\n\n# ************************************************\n\nroot = Tk()\nroot.title('15 Puzzle Game')\nroot.geometry('600x600+100+50')\nroot.resizable(False, False)\ng = Game(root)\nroot.mainloop()\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_97.txt",
        "content": "_TITLE \"GUI Sliding Blocks Game \"\nRANDOMIZE TIMER\n\n' get from user the desired board size = s\nDO\n    LOCATE CSRLIN, 3: INPUT \"(0 quits) Enter your number of blocks per side 3 - 9 you want > \", s\n    IF s = 0 THEN END\nLOOP UNTIL s > 2 AND s < 10\n\n' screen setup: based on the square blocks q pixels a sides\nq = 540 / s 'square size, shoot for 540 x 540 pixel board display\nSCREEN _NEWIMAGE(q * s + 1, q * s + 1, 32): _SCREENMOVE 360, 60\n\n'initialize board = solution\nDIM board(s, s)\nFOR r = 1 TO s\n    FOR c = 1 TO s\n        board(c, r) = c + (r - 1) * s\n    NEXT\nNEXT\nboard(s, s) = 0: c0 = s: r0 = s\n\n'scramble board for puzzle\nFOR i = 0 TO s ^ 5 ' mix blocks\n    SELECT CASE INT(RND * 4) + 1\n        CASE 1: IF c0 < s THEN board(c0, r0) = board(c0 + 1, r0): board(c0 + 1, r0) = 0: c0 = c0 + 1\n        CASE 2: IF c0 > 1 THEN board(c0, r0) = board(c0 - 1, r0): board(c0 - 1, r0) = 0: c0 = c0 - 1\n        CASE 3: IF r0 < s THEN board(c0, r0) = board(c0, r0 + 1): board(c0, r0 + 1) = 0: r0 = r0 + 1\n        CASE 4: IF r0 > 1 THEN board(c0, r0) = board(c0, r0 - 1): board(c0, r0 - 1) = 0: r0 = r0 - 1\n    END SELECT\nNEXT\n\nt = TIMER: update = -1 'OK user here you go!\nDO\n    IF update THEN 'display status and determine if solved\n        solved = -1: update = 0\n        FOR r = 1 TO s\n            FOR c = 1 TO s\n                IF board(c, r) THEN\n                    IF board(c, r) <> (r - 1) * s + c THEN solved = 0\n                    COLOR _RGB32(255, 255, 255), _RGB32(0, 0, 255)\n                    LINE ((c - 1) * q + 1, (r - 1) * q + 2)-(c * q - 2, r * q - 2), _RGB32(0, 0, 255), BF\n                    _PRINTSTRING ((c - 1) * q + .4 * q, (r - 1) * q + .4 * q), RIGHT$(\" \" + STR$(board(c, r)), 2)\n                ELSE\n                    IF board(s, s) <> 0 THEN solved = 0\n                    COLOR _RGB32(0, 0, 0), _RGB32(0, 0, 0)\n                    LINE ((c - 1) * q, (r - 1) * q)-(c * q, r * q), , BF\n                END IF\n            NEXT\n        NEXT\n        IF solved THEN 'flash the Solved Report until user closes window else report status\n            _DISPLAY\n            flash$ = \"Solved!\" + STR$(mc) + \" Moves in \" + STR$(INT(TIMER - t)) + \" secs.\"\n            WHILE 1: _TITLE flash$: _DELAY .2: _TITLE \"  \": _DELAY .2: WEND\n        ELSE\n            _TITLE STR$(mc) + \" Moves in \" + STR$(INT(TIMER - t)) + \" secs.\" + STR$(test)\n        END IF\n        _DISPLAY\n    END IF\n\n    'get next mouse click, check if on block next to empty space make move or beep\n    m = _MOUSEINPUT: mb = _MOUSEBUTTON(1): mx = _MOUSEX: my = _MOUSEY\n    IF mb AND solved = 0 THEN 'get last place mouse button was down\n        mb = _MOUSEBUTTON(1): mx = _MOUSEX: my = _MOUSEY\n        WHILE mb 'left button down, wait for mouse button release\n            m = _MOUSEINPUT: mb = _MOUSEBUTTON(1): mx = _MOUSEX: my = _MOUSEY\n        WEND\n\n        'convert mouse position to board array (x, y) are we near empty space?\n        bx = INT(mx / q) + 1: by = INT(my / q) + 1: update = -1\n        IF bx = c0 + 1 AND by = r0 THEN\n            board(c0, r0) = board(c0 + 1, r0): board(c0 + 1, r0) = 0: c0 = c0 + 1: mc = mc + 1\n        ELSEIF bx = c0 - 1 AND by = r0 THEN\n            board(c0, r0) = board(c0 - 1, r0): board(c0 - 1, r0) = 0: c0 = c0 - 1: mc = mc + 1\n        ELSEIF bx = c0 AND by = r0 + 1 THEN\n            board(c0, r0) = board(c0, r0 + 1): board(c0, r0 + 1) = 0: r0 = r0 + 1: mc = mc + 1\n        ELSEIF bx = c0 AND by = r0 - 1 THEN\n            board(c0, r0) = board(c0, r0 - 1): board(c0, r0 - 1) = 0: r0 = r0 - 1: mc = mc + 1\n        ELSE\n            BEEP\n        END IF\n    END IF\nLOOP",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_98.txt",
        "content": "( moves: 0 - up, 1 - down, 2 - left, 3 - right )\n\n[ stack ]                            is 15.solver ( --> [ )\n\n[ 0 swap find ]                      is find-empty ( board --> n )\n\n[ over + dup -1 >\n  over 4 < and iff\n  [ nip true ] else\n  [ drop false ] ] is try-nudge ( coord delta --> coord\u00a0? )\n\n[ dip [ dup find-empty 4 /mod ]\n  2 /mod 2 * 1 -\n  swap iff try-nudge else\n  [ dip swap\n    try-nudge\n    dip swap ]\n  dip [ swap 4 * + ] ]               is try-move-target ( board move --> board target\u00a0? )\n\n[ 2dup peek dip\n  [ -1 unrot poke\n    0 over find ]\n  unrot poke\n  0 swap -1 over find poke ]         is move-to ( board target --> board )\n\n[ try-move-target\n  iff [ move-to true ]\n  else [ drop false ] ]              is try-move ( board move --> board\u00a0? )\n\n[ [] 15 times\n  [ i^ 1+ join ]\n  0 join ]                  constant is <board> ( --> board )\n\n[ <board>\n  410 times ( 2 * the upper bound on the maximum moves required to solve )\n  [ 4 random\n    try-move drop ] ]                is <random-board> ( --> board )\n\n[ peek dup iff\n  [ number$\n    dup size 1 =\n    if [ space swap join ] ]\n  else [ drop $ '  ' ]\n  echo$ ]                            is echo-cell ( board n --> )\n\n[ 4 * 4 times\n  [ say '| '\n    2dup i^ +\n    echo-cell\n    say ' ' ]\n  say '|'\n  2drop ]                            is echo-row ( board n --> )\n\n[ 4 times\n  [ say '+----+----+----+----+' cr\n    dup i^ echo-row cr ]\n  say '+----+----+----+----+' cr\n  drop ]                             is echo-board ( board --> )\n\n[ <board> = ]                        is solved? ( board -->\u00a0? )\n\n[ $ 'Moves: ' input ]                is input-moves ( --> $ )\n\n[ dup char w = iff\n  [ drop 0 true ] done\n  dup char s = iff\n  [ drop 1 true ] done\n  dup char a = iff\n  [ drop 2 true ] done\n  dup char d = iff\n  [ drop 3 true ] done\n  false ]                            is char-to-move ( c --> move true | c false )\n\n[ input-moves witheach\n  [ char-to-move\n    if try-move\n    drop ] ]                         is player-move ( board --> board )\n\n[ ]'[ 15.solver put\n  [ cr dup echo-board\n    dup solved? not while\n    15.solver share do\n    again ]\n  15.solver release drop ]           is 15-solve-with ( board 'solver --> board )\n\n[ <random-board>\n  15-solve-with player-move ]        is 15-puzzle ( --> )\n\n15-puzzle",
        "safe": true
    },
    {
        "filename": "15_puzzle_game_99.txt",
        "content": "puz15<-function(scramble.length=100){\n  m=matrix(c(1:15,0),byrow=T,ncol=4)\n  scramble=sample(c(\"w\",\"a\",\"s\",\"d\"),scramble.length,replace=T)\n  for(i in 1:scramble.length){\n    m=move(m,scramble[i])\n  }\n  win=F\n  turn=0\n  while(!win){\n    print.puz(m)\n    newmove=getmove()\n    if(newmove==\"w\"|newmove==\"a\"|newmove==\"s\"|newmove==\"d\"){\n      m=move(m,newmove)\n      turn=turn+1\n    }\n    else{\n      cat(\"Input not recognized\",\"\\n\")\n    }\n    if(!(F %in% m==matrix(c(1:15,0),byrow=T,ncol=4))){\n      win=T\n    }\n  }\n  print.puz(m)\n  cat(\"\\n\")\n  print(\"You win!\")\n  cat(\"\\n\",\"It took you\",turn,\"moves.\",\"\\n\")\n}\n\ngetmove<-function(){\n  direction<-readline(prompt=\"Move:\")\n  return(direction)\n}\nmove<-function(m,direction){\n  if(direction==\"w\"){\n    m=move.u(m)\n  }\n  else if(direction==\"s\"){\n    m=move.d(m)\n  }\n  else if(direction==\"a\"){\n    m=move.l(m)\n  }\n  else if(direction==\"d\"){\n    m=move.r(m)\n  }\n  return(m)\n}\nmove.u<-function(m){\n  if(0 %in% m[4,]){}\n  else{\n    pos=which(m==0)\n    m[pos]=m[pos+1]\n    m[pos+1]=0\n  }\n  return(m)\n}\nmove.d<-function(m){\n  if(0 %in% m[1,]){}\n  else{\n    pos=which(m==0)\n    m[pos]=m[pos-1]\n    m[pos-1]=0\n  }  \n  return(m)\n}\nmove.l<-function(m){\n  if(0 %in% m[,4]){return(m)}\n  else{return(t(move.u(t(m))))}\n}\nmove.r<-function(m){\n  if(0 %in% m[,1]){return(m)}\n  else{return(t(move.d(t(m))))}\n}\nprint.puz<-function(m){\n  cat(\"+----+----+----+----+\",\"\\n\")\n  for(r in 1:4){\n    string=\"|\"\n    for(c in 1:4){\n      if(m[r,c]==0)\n        string=paste(string,\"    |\",sep=\"\")\n      else if(m[r,c]<10)\n        string=paste(string,\"  \",m[r,c],\" |\",sep=\"\")\n      else\n        string=paste(string,\" \",m[r,c],\" |\",sep=\"\")\n    }\n    cat(string,\"\\n\",\"+----+----+----+----+\",\"\\n\",sep=\"\")\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_1.txt",
        "content": "15 14  1  6\n 9 11  4 12\n 0 10  7  3\n13  8  5  2",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_10.txt",
        "content": "/* ARM assembly Raspberry PI  */\n/*  program puzzle15solver.s   */\n/* my first other program find \u00e0 solution in 134 moves\u00a0!!! */\n/* this second program is a adaptation algorithme C++ and go rosetta code */\n/* thanck for the creators */ \n/* 1 byte by box on game board */\n\n/* create a file with nano  */\n/*  15,  2,   3,   4\n    5,   6,   7,   1\n    9,   10,  8,   11\n   13,  14,  12, 0     */\n   \n/*   Run this programm\u00a0: puzzle15solver <file name> */\n/*   wait several minutes for r\u00e9sult */\n\n/* REMARK 1\u00a0: this program use routines in a include file \n   see task Include a file language arm assembly \n   for the routine affichageMess conversion10 \n   see at end of this program the instruction include */\n/* for constantes see task include a file in arm assembly */\n/************************************/\n/* Constantes                       */\n/************************************/\n.include \"../constantes.inc\"\n\n.equ STDIN,  0     @ Linux input console\n.equ STDOUT, 1     @ Linux output console\n.equ EXIT,   1     @ Linux syscall\n.equ READ,   3     @ Linux syscall\n.equ WRITE,  4     @ Linux syscall\n.equ OPEN,   5     @ Linux syscall\n.equ CLOSE,  6     @ Linux syscall\n\n.equ TRUE, 1\n.equ FALSE, 0\n\n.equ O_RDWR,    0x0002        @ open for reading and writing\n\n.equ SIZE,           4\n.equ NBBOX,          SIZE * SIZE\n.equ TAILLEBUFFER,   100\n.equ NBMAXIELEMENTS, 100\n\n.equ CONST_I,    1\n.equ CONST_G,    8\n.equ CONST_E,    2\n.equ CONST_L,    4\n\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nszMessTitre:            .asciz \"Nom du fichier\u00a0: \"\nsMessResult:           .ascii \" \"\nsMessValeur:           .fill 11, 1, ' '             @ size => 11\nszCarriageReturn:      .asciz \"\\n\"\nszMessCounterSolution: .asciz \"Solution in @ moves\u00a0: \\n\"\n\n//szMessMoveError:       .asciz \"Huh... Impossible move\u00a0!!!!\\n\"\nszMessErreur:          .asciz \"Error detected.\\n\"\nszMessImpossible:      .asciz \"!!! Impossible solution\u00a0!!!\\n\"\nszMessErrBuffer:       .asciz \"buffer size too less\u00a0!!\"\nszMessSpaces:          .asciz \"    \"\n\niTabNr:  .int 3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3\niTabNc:  .int 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\n.align 4\nsZoneConv:      .skip 24\niAdrHeap:       .skip 4\nibox:           .skip SIZE * SIZE           @ game boxes\niAdrFicName:    .skip 4\niTabN0:         .skip 4 * NBMAXIELEMENTS    @ empty box\niTabN3:         .skip 4 * NBMAXIELEMENTS    @ moves\niTabN4:         .skip 4 * NBMAXIELEMENTS    @\u00a0????\niTabN2:         .skip 4 * NBMAXIELEMENTS    @ table game address\nsBuffer:        .skip TAILLEBUFFER\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                            @ INFO: main\n    mov r0,sp                    @ stack address for load parameter\n    bl traitFic                  @ read file and store value in array\n    cmp r0,#-1\n    beq 100f                     @ error\u00a0?\n\n    ldr r0,iAdribox\n    bl displayGame               @ display array game\n    \n    ldr r0,iAdribox              @ control if solution exists\n    bl controlSolution\n    cmp r0,#TRUE\n    beq 1f\n    ldr r0,iAdrszMessImpossible  @ no solution\u00a0!!!\n    bl affichageMess\n    b 100f\n\n1:\n    ldr r0,iAdribox\n    ldr r9,iAdriTabN2\n    str r0,[r9]                  @ N2 address global\n    \n    mov r10,#0                   @ variable _n global\n    mov r12,#0                   @ variable n global \n    bl searchSolution\n    cmp r0,#TRUE\n    bne 100f                     @ no solution\u00a0?\n    ldr r3,iAdriTabN2\n    ldr r0,[r3,r12,lsl #2]       @ visual solution control\n    bl displayGame\n    mov r0,r12                   @ move counter\n    ldr r1,iAdrsZoneConv\n    bl conversion10              @ conversion counter\n    mov r2,#0\n    strb r2,[r1,r0]              @ and display\n    ldr r0,iAdrszMessCounterSolution\n    bl strInsertAtCharInc\n    ldr r1,iAdrsZoneConv\n    bl affichageMess\n    ldr r5,iAdriTabN3\n    ldr r3,iAdrsBuffer\n    mov r2,#1\n    mov r4,#0\n2:                                @ loop solution display \n    ldrb r1,[r5,r2,lsl #2]\n    cmp r2,#TAILLEBUFFER\n    bge 99f\n    strb r1,[r3,r4]\n    add r4,r4,#1\n    add r2,r2,#1\n    cmp r2,r12\n    ble 2b\n    mov r1,#0\n    str r1,[r3,r4]                 @ z\u00e9ro final\n    mov r0,r3\n    bl affichageMess\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess\n    \n    b 100f\n\n99:\n    ldr r0,iAdrszMessErrBuffer\n    bl affichageMess\n100:                                 @ standard end of the program \n    mov r0, #0                       @ return code\n    mov r7, #EXIT                    @ request to exit program\n    svc #0                           @ perform the system call\n \niAdribox:                  .int ibox\niAdriTabN0:                .int iTabN0\niAdriTabN2:                .int iTabN2\niAdriTabN3:                .int iTabN3\niAdriTabN4:                .int iTabN4\niAdrszMessCounterSolution: .int szMessCounterSolution\niAdrszMessImpossible:      .int szMessImpossible\niAdrszMessErrBuffer:       .int szMessErrBuffer\niAdrsZoneConv:             .int sZoneConv\n/******************************************************************/\n/*      search    Solution                                        */ \n/******************************************************************/\nsearchSolution:                      @ INFO: searchSolution\n    push {r1-r8,lr}                  @ save  registers\n                                     @ address allocation place on the heap\n    mov r0,#0                        @ allocation place heap\n    mov r7,#0x2D                     @ call system 'brk'\n    svc #0\n    cmp r0,#-1                       @ allocation error\n    beq 99f\n    ldr r1,iAdriAdrHeap\n    str r0,[r1]                      @ store heap address\n    bl functionFN\n    ldr r3,iAdriTabN2\n    ldr r0,[r3,r12,lsl #2]           @ last current game\n    bl gameOK                        @ it is Ok\u00a0?\n    cmp r0,#TRUE\n    beq 100f                         @ yes --> end\n\n    ldr r1,iAdriAdrHeap              @ free up resources\n    ldr r0,[r1]                      @ restaur start address heap\n    mov r7,#0x2D                     @ call system 'brk'\n    svc #0\n    cmp r0,#-1                       @ allocation error\n    beq 99f\n    add r10,r10,#1                   @ _n\n    mov r12,#0                       @ n\n    bl searchSolution                @ next recursif call\n    b 100f\n99:\n    ldr r0,iAdrszMessErreur\n    bl affichageMess\n100:\n    pop {r1-r8,lr}                   @ restaur registers \n    bx lr                            @return\niAdrszMessErreur:           .int szMessErreur\niAdriAdrHeap:               .int iAdrHeap\n/******************************************************************/\n/*     Fonction FN                                                */ \n/******************************************************************/\nfunctionFN:                          @ INFO: functionFN\n    push {lr}                        @ save  register\n    ldr r4,iAdriTabN3\n    ldr r3,[r4,r12,lsl #2]\n    ldr r5,iAdriTabN0                @ load position empty box\n    ldr r6,[r5,r12,lsl #2]\n    cmp r6,#15                       @ last box\n    bne 2f\n    cmp r3,#'R'\n    bne 11f\n    mov r0,#CONST_G\n    bl functionFZ\n    b 100f\n11:\n    cmp r3,#'D'\n    bne 12f\n    mov r0,#CONST_L\n    bl functionFZ\n    b 100f\n12:\n    mov r0,#CONST_G + CONST_L\n    bl functionFZ\n    b 100f\n    \n2:\n    cmp r6,#12\n    bne 3f\n    cmp r3,#'L'\n    bne 21f\n    mov r0,#CONST_G\n    bl functionFZ\n    b 100f\n21:\n    cmp r3,#'D'\n    bne 22f\n    mov r0,#CONST_E\n    bl functionFZ\n    b 100f\n22:\n    mov r0,#CONST_E + CONST_G\n    bl functionFZ\n    b 100f\n3:\n    cmp r6,#13\n    beq 30f\n    cmp r6,#14\n    bne 4f\n30:\n    cmp r3,#'L'\n    bne 31f\n    mov r0,#CONST_G + CONST_L\n    bl functionFZ\n    b 100f\n31:\n    cmp r3,#'R'\n    bne 32f\n    mov r0,#CONST_G + CONST_E\n    bl functionFZ\n    b 100f\n32:\n    cmp r3,#'D'\n    bne 33f\n    mov r0,#CONST_E + CONST_L\n    bl functionFZ\n    b 100f\n33:\n    mov r0,#CONST_L + CONST_E + CONST_G\n    bl functionFZ\n    b 100f\n4:\n    cmp r6,#3\n    bne 5f\n    cmp r3,#'R'\n    bne 41f\n    mov r0,#CONST_I\n    bl functionFZ\n    b 100f\n41:\n    cmp r3,#'U'\n    bne 42f\n    mov r0,#CONST_L\n    bl functionFZ\n    b 100f\n42:\n    mov r0,#CONST_I + CONST_L\n    bl functionFZ\n    b 100f\n5:\n    cmp r6,#0\n    bne 6f\n    cmp r3,#'L'\n    bne 51f\n    mov r0,#CONST_I\n    bl functionFZ\n    b 100f\n51:\n    cmp r3,#'U'\n    bne 52f\n    mov r0,#CONST_E\n    bl functionFZ\n    b 100f\n52:\n    mov r0,#CONST_I + CONST_E\n    bl functionFZ\n    b 100f\n6:\n    cmp r6,#1\n    beq 60f\n    cmp r6,#2\n    bne 7f\n60:\n    cmp r3,#'L'\n    bne 61f\n    mov r0,#CONST_I + CONST_L\n    bl functionFZ\n    b 100f\n61:\n    cmp r3,#'R'\n    bne 62f\n    mov r0,#CONST_E + CONST_I\n    bl functionFZ\n    b 100f\n62:\n    cmp r3,#'U'\n    bne 63f\n    mov r0,#CONST_E + CONST_L\n    bl functionFZ\n    b 100f\n63:\n    mov r0,#CONST_I + CONST_E + CONST_L\n    bl functionFZ\n    b 100f\n7:\n    cmp r6,#7\n    beq 70f\n    cmp r6,#11\n    bne 8f\n70:\n    cmp r3,#'R'\n    bne 71f\n    mov r0,#CONST_I + CONST_G\n    bl functionFZ\n    b 100f\n71:\n    cmp r3,#'U'\n    bne 72f\n    mov r0,#CONST_G + CONST_L\n    bl functionFZ\n    b 100f\n72:\n    cmp r3,#'D'\n    bne 73f\n    mov r0,#CONST_I + CONST_L\n    bl functionFZ\n    b 100f\n73:\n    mov r0,#CONST_I + CONST_G + CONST_L\n    bl functionFZ\n    b 100f\n8:\n    cmp r6,#4\n    beq 80f\n    cmp r6,#8\n    bne 9f\n80:\n    cmp r3,#'D'\n    bne 81f\n    mov r0,#CONST_I + CONST_E\n    bl functionFZ\n    b 100f\n81:\n    cmp r3,#'U'\n    bne 82f\n    mov r0,#CONST_G + CONST_E\n    bl functionFZ\n    b 100f\n82:\n    cmp r3,#'L'\n    bne 83f\n    mov r0,#CONST_I + CONST_G\n    bl functionFZ\n    b 100f\n83:\n    mov r0,#CONST_G + CONST_E + CONST_I\n    bl functionFZ\n    b 100f\n9:\n    cmp r3,#'D'\n    bne 91f\n    mov r0,#CONST_I + CONST_E + CONST_L\n    bl functionFZ\n    b 100f\n91:\n    cmp r3,#'L'\n    bne 92f\n    mov r0,#CONST_I + CONST_G + CONST_L\n    bl functionFZ\n    b 100f\n92:\n    cmp r3,#'R'\n    bne 93f\n    mov r0,#CONST_I + CONST_G + CONST_E\n    bl functionFZ\n    b 100f\n93:\n    cmp r3,#'U'\n    bne 94f\n    mov r0,#CONST_G + CONST_E +  CONST_L\n    bl functionFZ\n    b 100f\n94:\n    mov r0,#CONST_G + CONST_L + CONST_I + CONST_E\n    bl functionFZ\n    b 100f\n\n99:                                  @ error\n    ldr r0,iAdrszMessErreur\n    bl affichageMess\n100:\n    pop {lr}                         @ restaur registers \n    bx lr                            @return\n\n/******************************************************************/\n/*     function FZ                           */ \n/*                                                 */\n/***************************************************************/\n/* r0 contains variable w           */\nfunctionFZ:                    @ INFO: functionFZ\n    push {r1,r2,lr}            @ save  registers \n    mov r2,r0 \n    and r1,r2,#CONST_I\n    cmp r1,#0\n    ble 1f\n    bl functionFI\n    bl functionFY\n    cmp r0,#TRUE\n    beq 100f\n    sub r12,r12,#1              @ variable n\n1:\n    ands r1,r2,#CONST_G\n    ble 2f\n    bl functionFG\n    bl functionFY\n    cmp r0,#TRUE\n    beq 100f\n    sub r12,r12,#1              @ variable n\n2:\n    ands r1,r2,#CONST_E\n    ble 3f\n    bl functionFE\n    bl functionFY\n    cmp r0,#TRUE\n    beq 100f\n    sub r12,r12,#1              @ variable n\n3:\n    ands r1,r2,#CONST_L\n    ble 4f\n    bl functionFL\n    bl functionFY\n    cmp r0,#TRUE\n    beq 100f\n    sub r12,r12,#1              @ variable n\n4:\n    mov r0,#FALSE\n100:\n    pop {r1,r2,lr}              @ restaur registers \n    bx lr                       @return\n/******************************************************************/\n/*               function FY                                 */ \n/******************************************************************/\nfunctionFY:                    @ INFO: functionFY\n    push {lr}                  @ save  registers\n    ldr r1,iAdriTabN2\n    ldr r0,[r1,r12,lsl #2]\n    bl gameOK                  @ game OK\u00a0?\n    cmp r0,#TRUE\n    beq 100f\n    ldr r1,iAdriTabN4\n    ldr r0,[r1,r12,lsl #2]\n    cmp r0,r10\n    bgt 1f\n    bl functionFN\n    b 100f\n1:\n    mov r0,#FALSE\n100:\n    pop {lr}                     @ restaur registers \n    bx lr                        @return\n\n/******************************************************************/\n/*     the empty box is down                                     */ \n/******************************************************************/\nfunctionFI:                       @ INFO: functionFI\n    push {r0-r8,lr}               @ save  registers\n    ldr r0,iAdriTabN0\n    ldr r1,[r0,r12,lsl #2]        @ empty box\n    add r2,r1,#4\n    ldr r3,[r9,r12,lsl #2]        @ load game current\n    ldrb r4,[r3,r2]               @ load box down empty box\n    add r5,r12,#1                 @ n+1\n    add r8,r1,#4                  @ new position empty case\n    str r8,[r0,r5,lsl #2]         @ store new position empty case\n    ldr r6,iAdriTabN3\n    \n    mov r7,#'D'                   @ down\n    str r7,[r6,r5,lsl #2]         @ store move\n    ldr r6,iAdriTabN4\n    ldr r7,[r6,r12,lsl #2]\n    str r7,[r6,r5,lsl #2]         @ N4 (n+1) = n4(n)\n    mov r0,r3\n    bl createGame                 @ create copy game\n    ldrb r3,[r0,r1]               @ and inversion box\n    ldrb r8,[r0,r2]\n    strb r8,[r0,r1]\n    strb r3,[r0,r2]\n    str r0,[r9,r5,lsl #2]         @ store new game in table\n    lsr r1,r1,#2                  @ line position empty case = N\u00b0/ 4\n    ldr r0,iAdriTabNr\n    ldr r2,[r0,r4,lsl #2]         @ load N\u00b0 line box moved\n    cmp r2,r1                     @ compare\u00a0????\n    ble 1f\n    add r7,r7,#1                  @ and increment\u00a0????\n    str r7,[r6,r5,lsl #2]\n1:\n    add r12,r12,#1                @ increment N\n    pop {r0-r8,lr} \n    bx lr                         @return\niAdriTabNr:        .int iTabNr\niAdriTabNc:        .int iTabNc\n/******************************************************************/\n/*     empty case UP   see explain in english in function FI      */ \n/******************************************************************/\nfunctionFG:                      @ INFO: functionFG\n    push {r0-r8,lr}              @ save  registers\n    ldr r0,iAdriTabN0\n    ldr r1,[r0,r12,lsl #2]       @ case vide\n    sub r2,r1,#4                 @ position case au dessus\n    ldr r3,[r9,r12,lsl #2]       @ extrait jeu courant\n    ldrb r4,[r3,r2]              @ extrait le contenu case au dessus\n    add r5,r12,#1                @ N+1 = N\n    sub r8,r1,#4                 @ nouvelle position case vide\n    str r8,[r0,r5,lsl #2]        @ et on la stocke\n    ldr r6,iAdriTabN3\n    mov r7,#'U'                  @ puis on stocke le code mouvement\n    str r7,[r6,r5,lsl #2]\n    ldr r6,iAdriTabN4\n    ldr r7,[r6,r12,lsl #2]\n    str r7,[r6,r5,lsl #2]        @ N4 (N+1) = N4 (N)\n    mov r0,r3                    @ jeu courant\n    bl createGame                @ cr\u00e9ation nouveau jeu\n    ldrb r3,[r0,r1]              @ et echange les 2 cases\n    ldrb r8,[r0,r2]\n    strb r8,[r0,r1]\n    strb r3,[r0,r2]\n    str r0,[r9,r5,lsl #2]        @ stocke la nouvelle situation \n    lsr r1,r1,#2                 @ ligne case vide = position /4\n    ldr r0,iAdriTabNr\n    ldr r2,[r0,r4,lsl #2]        @ extrait table \u00e0 la position case\n    cmp r2,r1                    @ et comparaison\u00a0???\n    bge 1f\n    add r7,r7,#1                 @ puis increment N4 de 1 \u00a0???\n    str r7,[r6,r5,lsl #2]\n1:\n    add r12,r12,#1               @ increment de N\n    pop {r0-r8,lr} \n    bx lr                        @return\n/******************************************************************/\n/*    empty case go right see explain finction FI ou FG en fran\u00e7ais */ \n/******************************************************************/\nfunctionFE:                       @ INFO: functionFE\n    push {r0-r8,lr}               @ save  registers\n    ldr r0,iAdriTabN0\n    ldr r1,[r0,r12,lsl #2]\n    add r2,r1,#1\n    ldr r3,[r9,r12,lsl #2]\n    ldrb r4,[r3,r2]               @ extrait le contenu case \n    add r5,r12,#1\n    add r8,r1,#1\n    str r8,[r0,r5,lsl #2]         @ nouvelle case vide\n    ldr r6,iAdriTabN3\n    mov r7,#'R'\n    str r7,[r6,r5,lsl #2]         @ mouvement\n    ldr r6,iAdriTabN4\n    ldr r7,[r6,r12,lsl #2]\n    str r7,[r6,r5,lsl #2]         @ N4\u00a0??\n    mov r0,r3\n    bl createGame\n    ldrb r3,[r0,r1]               @ exchange two boxes\n    ldrb r8,[r0,r2]\n    strb r8,[r0,r1]\n    strb r3,[r0,r2]\n    str r0,[r9,r5,lsl #2]         @ stocke la nouvelle situation \n    lsr r3,r1,#2\n    sub r1,r1,r3,lsl #2\n    ldr r0,iAdriTabNc\n    ldr r2,[r0,r4,lsl #2]         @ extrait table \u00e0 la position case\n    cmp r2,r1\n    ble 1f\n    add r7,r7,#1\n    str r7,[r6,r5,lsl #2]\n1:\n    add r12,r12,#1\n    pop {r0-r8,lr} \n    bx lr                        @return\n/******************************************************************/\n/*     empty box go left see explain function FI ou FG en fran\u00e7ais */ \n/******************************************************************/\nfunctionFL:                       @ INFO: functionFL\n    push {r0-r8,lr}               @ save  registers\n    ldr r0,iAdriTabN0\n    ldr r1,[r0,r12,lsl #2]        @ case vide\n    sub r2,r1,#1\n    ldr r3,[r9,r12,lsl #2]       @ extrait jeu courant\n    ldrb r4,[r3,r2]              @ extrait le contenu case \n    add r5,r12,#1\n    sub r8,r1,#1\n    str r8,[r0,r5,lsl #2]         @ nouvelle case vide\n    ldr r6,iAdriTabN3\n    mov r7,#'L'\n    str r7,[r6,r5,lsl #2]         @ mouvement\n    ldr r6,iAdriTabN4\n    ldr r7,[r6,r12,lsl #2]\n    str r7,[r6,r5,lsl #2]         @ N4\u00a0??\n    mov r0,r3\n    bl createGame\n    ldrb r3,[r0,r1]               @ exchange two boxes\n    ldrb r8,[r0,r2]\n    strb r8,[r0,r1]\n    strb r3,[r0,r2]\n    str r0,[r9,r5,lsl #2]         @ stocke la nouvelle situation \n    lsr r3,r1,#2\n    sub r1,r1,r3,lsl #2           @ compute remainder\n    ldr r0,iAdriTabNc\n    ldr r2,[r0,r4,lsl #2]         @ extrait table colonne \u00e0 la position case\n    cmp r2,r1\n    bge 1f\n    add r7,r7,#1\n    str r7,[r6,r5,lsl #2]\n1:\n    add r12,r12,#1\n    pop {r0-r8,lr} \n    bx lr                         @return\n/******************************************************************/\n/*     create new Game                                            */ \n/******************************************************************/\n/* r0 contains box address            */\n/* r0 return address new game  */\ncreateGame:                          @ INFO: createGame\n    push {r1-r8,lr}                  @ save  registers\n    mov r4,r0                        @ save value\n    mov r0,#0                        @ allocation place heap\n    mov r7,#0x2D                     @ call system 'brk'\n    svc #0\n    cmp r0,#-1                       @ allocation error\n    beq 99f\n    mov r5,r0                        @ save address heap for output string\n    add r0,#SIZE * SIZE              @ reservation place one element\n    mov r7,#0x2D                     @ call system 'brk'\n    svc #0\n    cmp r0,#-1                       @ allocation error\n    beq 99f\n    mov r2,#0\n1:                                   @ loop copy boxes\n    ldrb r3,[r4,r2]\n    strb r3,[r5,r2]\n    add r2,r2,#1\n    cmp r2,#NBBOX\n    blt 1b\n    add r11,r11,#1\n    mov r0,r5\n    b 100f\n99:                                  @ error\n    ldr r0,iAdrszMessErreur\n    bl affichageMess\n100:\n    pop {r1-r8,lr}                   @ restaur registers \n    bx lr                            @return\n/******************************************************************/\n/*     read file                                                   */ \n/******************************************************************/\n/* r0 contains address stack begin           */\ntraitFic:                             @ INFO: traitFic\n    push {r1-r8,fp,lr}                @ save  registers\n    mov fp,r0                         @  fp <- start address\n    ldr r4,[fp]                       @ number of Command line arguments\n    cmp r4,#1\n    movle r0,#-1\n    ble 99f\n    add r5,fp,#8                      @ second parameter address \n    ldr r5,[r5]\n    ldr r0,iAdriAdrFicName\n    str r5,[r0]\n    ldr r0,iAdrszMessTitre\n    bl affichageMess                  @ display string\n    mov r0,r5\n    bl affichageMess \n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess                  @ display carriage return\n\n    mov r0,r5                         @ file name\n    mov r1,#O_RDWR                    @ flags    \n    mov r2,#0                         @ mode \n    mov r7, #OPEN                     @ call system OPEN \n    svc 0 \n    cmp r0,#0                         @ error\u00a0?\n    ble 99f\n    mov r8,r0                         @ File Descriptor\n    ldr r1,iAdrsBuffer                @ buffer address\n    mov r2,#TAILLEBUFFER              @ buffer size\n    mov r7,#READ                      @ read file\n    svc #0\n    cmp r0,#0                         @ error\u00a0?\n    blt 99f\n    @ extraction datas\n    ldr r1,iAdrsBuffer                @ buffer address\n    add r1,r0\n    mov r0,#0                         @ store z\u00e9ro final\n    strb r0,[r1] \n    ldr r0,iAdribox                   @ game box address\n    ldr r1,iAdrsBuffer                @ buffer address\n    bl extracDatas\n                                      @ close file\n    mov r0,r8\n    mov r7, #CLOSE \n    svc 0 \n    mov r0,#0\n    b 100f\n99:                                   @ error\n    ldr r1,iAdrszMessErreur           @ error message\n    bl   displayError\n    mov r0,#-1\n100:\n    pop {r1-r8,fp,lr}                 @ restaur registers \n    bx lr                             @return\niAdriAdrFicName:              .int iAdrFicName\niAdrszMessTitre:              .int szMessTitre\niAdrsBuffer:                  .int sBuffer\n/******************************************************************/\n/*     extrac digit file buffer                                   */ \n/******************************************************************/\n/* r0 contains boxs address           */\n/* r1 contains buffer address         */\nextracDatas:                     @ INFO: extracDatas\n    push {r1-r8,lr}              @ save  registers\n    mov r7,r0\n    mov r6,r1\n    mov r2,#0                    @ string buffer indice\n    mov r4,r1                    @ start digit ascii\n    mov r5,#0                    @ box index\n1:\n    ldrb r3,[r6,r2]\n    cmp r3,#0\n    beq 4f                       @ end\n    cmp r3,#0xA\n    beq 2f\n    cmp r3,#','\n    beq 3f\n    add r2,#1\n    b 1b\n2:\n    mov r3,#0\n    strb r3,[r6,r2]\n    ldrb r3,[r6,r2]\n    cmp r3,#0xD\n    addeq r2,#2\n    addne r2,#1\n    b 4f\n \n3:\n    mov r3,#0\n    strb r3,[r6,r2]\n    add r2,#1\n4:  \n    mov r0,r4\n    bl conversionAtoD\n    strb r0,[r7,r5]\n    cmp r0,#0\n    ldreq r0,iAdriTabN0\n    streq r5,[r0]                @ empty box in item z\u00e9ro\n    add r5,#1\n    cmp r5,#NBBOX                @ number box = maxi\u00a0?\n    bge 100f \n    add r4,r6,r2                 @ new start address digit ascii\n    b 1b\n100:\n    pop {r1-r8,lr}               @ restaur registers \n    bx lr                        @return\n/******************************************************************/\n/*     control of the game solution                                      */ \n/******************************************************************/\n/* r0 contains boxs address           */\n/* r0 returns 0 if not possible       */\n/* r0 returns 1 if possible           */\ncontrolSolution:                 @ INFO: controlSolution\n    push {r1-r8,lr}              @ save  registers\n    mov r5,r0\n    ldr r8,iAdriTabN0\n    ldr r8,[r8]                  @ empty box\n    @ empty box\n    mov r7,#0\n    cmp r8,#1\n    moveq r7,#1\n    beq 1f\n    cmp r8,#3\n    moveq r7,#1\n    beq 1f\n    cmp r8,#4\n    moveq r7,#1\n    beq 1f\n    cmp r8,#6\n    moveq r7,#1\n    beq 1f\n    cmp r8,#9\n    moveq r7,#1\n    beq 1f\n    cmp r8,#11\n    moveq r7,#1\n    beq 1f\n    cmp r8,#12\n    moveq r7,#1\n    beq 1f\n    cmp r8,#14\n    moveq r7,#1\n1:\n    rsb r6,r8,#NBBOX - 1\n    add r7,r6\n                                 @ count permutations\n    mov r1,#-1\n    mov r6,#0\n2:\n    add r1,#1\n    cmp r1,#NBBOX\n    bge 80f\n    cmp r1,r8\n    beq 2b\n    ldrb r3,[r5,r1]\n    mov r2,r1\n3:\n    add r2,#1\n    cmp r2,#NBBOX\n    bge 2b\n    cmp r2,r8\n    beq 3b\n    ldrb r4,[r5,r2]\n    cmp r4,r3\n    addlt r6,#1\n    b 3b\n80:\n    add r6,r7\n    tst r6,#1\n    movne r0,#0                  @ impossible\n    moveq r0,#1                  @ OK\n\n100:\n    pop {r1-r8,lr}               @ restaur registers \n    bx lr                        @return\n/******************************************************************/\n/*     game Ok\u00a0?                                      */ \n/******************************************************************/\n/* r0 contains boxs address           */\ngameOK:                          @ INFO: gameOK\n    push {r1-r4,lr}              @ save  registers\n    mov r2,#0\n    ldrb r3,[r0,r2]\n    cmp r3,#0\n    moveq r3,#0xF\n    add r2,#1\n1:\n    ldrb r4,[r0,r2]\n    cmp r4,#0\n    moveq r3,#0xF\n    cmp r4,r3\n    movle  r0,#FALSE              @ game not Ok\n    ble 100f\n    mov r3,r4\n    add r2,#1\n    cmp r2,#NBBOX -2\n    ble 1b\n    mov r0,#TRUE                  @ game Ok\n\n100:\n    pop {r1-r4,lr}                @ restaur registers \n    bx lr                         @return\n/******************************************************************/\n/*     display game                                       */ \n/******************************************************************/\n/* r0 contains boxs address           */\ndisplayGame:                            @ INFO: displayGame\n    push {r0-r5,lr}                     @ save  registers\n    mov r4,r0\n    ldr r0,iAdrszMessTitre\n    bl affichageMess                    @ display string\n    ldr r0,iAdriAdrFicName\n    ldr r0,[r0]\n    bl affichageMess                    @ display string\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess                    @ display line return\n    mov r2,#0\n    ldr r1,iAdrsMessValeur\n1:\n    ldrb r0,[r4,r2]\n    cmp r0,#0\n    ldreq r0,iSpaces                    @ store spaces\n    streq r0,[r1]\n    beq 2f\n    bl conversion10                     @ call conversion decimal\n    mov r0,#0\n    strb r0,[r1,#3]                     @ z\u00e9ro final\n2:\n\n    ldr r0,iAdrsMessResult\n    bl affichageMess                    @ display message\n    add r0,r2,#1\n    tst r0,#0b11\n    bne 3f\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess                    @ display message\n3:\n    add r2,#1\n    cmp r2,#NBBOX - 1\n    ble 1b\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess                    @ display line return\n\n100:\n    pop {r0-r5,lr}                      @ restaur registers \n    bx lr                               @return\niSpaces:                       .int 0x00202020       @ spaces\n//iAdrszMessMoveError:           .int szMessMoveError\niAdrszCarriageReturn:          .int szCarriageReturn\niAdrsMessValeur:               .int sMessValeur\niAdrsMessResult:               .int sMessResult\n/***************************************************/\n/*      ROUTINES INCLUDE                           */\n/***************************************************/\n.include \"../affichage.inc\"",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_11.txt",
        "content": "Nom du fichier\u00a0: casR1.txt\nNom du fichier\u00a0: casR1.txt\n 15  14  1   6\n 9   11  4   12\n     10  7   3\n 13  8   5   2\n\nNom du fichier\u00a0: casR1.txt\n 1   2   3   4\n 5   6   7   8\n 9   10  11  12\n 13  14  15\n\nSolution in 52 moves\u00a0:\nRRRULDDLUUULDRURDDDRULLULURRRDDLDLUURDDLULURRULDRDRD\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_12.txt",
        "content": "/**@file  HybridIDA.c\n * @brief solve 4x4 sliding puzzle with IDA* algorithm\n * by RMM 2021-feb-22\n \n * The Interative Deepening A* is relatively easy to code in 'C' since\n * it does not need Queues and Lists to manage memory. Instead the\n * search space state is held on the LIFO stack frame of recursive\n * search function calls. Millions of nodes may be created but they\n * are automatically deleted during backtracking.\n\n * Run-time is a disadvantage with complex puzzles. Also it struggles\n * to solve puzzles with depth g>50. I provided a test puzzle of g=52\n * that works with ordinary search but the Rosetta challenge puzzle\n * cycles forever. The HybridIDA solves it in 18 seconds.\n \n * The HybridIDA solution has two phases.\n * 1. It stops searching when a permutation begins with 1234.\n * 2. Phase2 begins a regular search with the output of phase 1.\n\n * (But an regular one time search can be done with phase 2\n * only). Phase 1 is optional.)\n \n * Pros: Hybrid IDA* is faster and solves more puzzles.\n * Cons: May not find shortest path.\n */ \n#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n\ntypedef unsigned char u8t;\ntypedef unsigned short u16t;\nenum { NR=4, NC=4, NCELLS = NR*NC };\nenum { UP, DOWN, LEFT, RIGHT, NDIRS };\nenum { OK = 1<<8, XX = 1<<9, FOUND = 1<<10, zz=0x80 };\nenum { MAX_INT=0x7E, MAX_NODES=(16*65536)*90};\nenum { BIT_HDR=1<<0, BIT_GRID=1<<1, BIT_OTHER=1<<2 };\nenum { PHASE1,PHASE2 };  // solution phase\n\ntypedef struct { u16t dn; u16t hn; }HSORT_T;\n\ntypedef struct {\n   u8t data[NCELLS]; unsigned id; unsigned src;\n   u8t h; u8t g; u8t udlr;\n}NODE_T;  // contains puzzle data and metadata\n\nNODE_T goal44={\n   {1,2,3,4, 5,6,7,8, 9,10,11,12, 13,14,15,0},0,0,0,0,0};\nNODE_T work; // copy of puzzle with run-time changes\n\nNODE_T G34={ //g=34; n=248,055; (1phase)\n {13,9,5,4, 15,6,1,8, 0,10,2,11, 14,3,7,12},0,0,0,0,0};\n\nNODE_T G52={ // g=52; n=34,296,567; (1phase)\n   {15,13,9,5, 14,6,1,4,  10,12,0,8, 3,7,11,2},0,0,0,0,0};\n\nNODE_T G99={ // formidable Rosetta challenge (2phases)\n   {15,14,1,6, 9,11,4,12, 0,10,7,3, 13,8,5,2},0,0,0,0,0};\n\nstruct {\n   unsigned nodes;\n   unsigned gfound;\n   unsigned root_visits;\n   unsigned verbose;\n   unsigned locks;\n   unsigned phase;\n}my;\n\nu16t  HybridIDA_star(NODE_T *pNode);\nu16t  make_node(NODE_T *pNode, NODE_T *pNew, u8t udlr );\nu16t  search(NODE_T *pNode, u16t bound);\nu16t  taxi_dist( NODE_T *pNode);\nu16t  tile_home( NODE_T *p44);\nvoid  print_node( NODE_T *pN, const char *pMsg, short force );\nu16t  goal_found(NODE_T *pNode);\nchar  udlr_to_char( char udlr );\nvoid  idx_to_rc( u16t idx, u16t *row, u16t *col );\nvoid  sort_nodes(HSORT_T *p);\n\nint main( )\n{\n   my.verbose = 0;\t\t// minimal print node\n   // my.verbose |= BIT_HDR;\t// node header\n   // my.verbose |= BIT_GRID;\t// node 4x4 data\n   \n   memcpy(&work,  &G99, sizeof(NODE_T));  // select puzzle here\n   if(1){   // phase1 can skipped for easy puzzles\n      printf(\"Phase1: IDA* search for 1234 permutation..\\n\");\n      my.phase = PHASE1;\n      (void) HybridIDA_star(&work);\n   }\n   printf(\"Phase2: IDA* search phase1 seed..\\n\");\n   my.phase = PHASE2;\n   (void)HybridIDA_star(&work);\n   return 0;\n}\n\n/// \\brief driver for Iterative Deepining A*\nu16t HybridIDA_star(NODE_T *pN){\n   my.nodes = 1;\n   my.gfound = 0;\n   my.root_visits = 0;\n   pN->udlr = NDIRS;\n   pN->g = 0;\n   pN->h = taxi_dist(pN);\n   pN->id = my.nodes;\n   pN->src = 0;\n   const char *pr = {\"Start\"}; // for g++\n   print_node( pN,pr,1 );\n   u16t depth = pN->h;\n   while(1){\n      depth = search(pN,depth);\n      if( depth & FOUND){\n         return FOUND;  // goodbye\n      }\n      if( depth & 0xFF00 ){\n\t printf(\"..error %x\\n\",depth);\n\t return XX;\n      }\n      my.root_visits++;\n      printf(\"[root visits: %u, depth %u]\\n\",my.root_visits,depth);\n   }\n   return 0;\n}\n\n/// \\brief search is recursive. nodes are instance variables\nu16t search(NODE_T *pN, u16t bound){ \n   if(bound & 0xff00){ return bound; }\n   u16t f = pN->g + pN->h;\n   if( f > bound){ return f; }\n   if(goal_found(pN)){\n      my.gfound = pN->g;\n      memcpy(&work,pN,sizeof(NODE_T));\n      printf(\"total nodes=%d, g=%u \\n\", my.nodes, my.gfound);\n      const char *pr = {\"Found..\"}; // for g++\n      print_node( &work,pr,1 );\n      return FOUND;\n   }\n   NODE_T news;\n   // Sort successor nodes so that the lowest heuristic is visited\n   // before the less promising at the same level. This reduces the\n   // number of searches and finds more solutions\n   HSORT_T hlist[NDIRS];\n   for( short i=0; i<NDIRS; i++ ){\n      u16t rv = make_node(pN,&news, i );\n      hlist[i].dn = i;\n      if( rv & OK ){\n\t hlist[i].hn = news.h;\n\t continue;\n      }\n      hlist[i].hn = XX;\n   }\n   sort_nodes(&hlist[0]);\n   \n   u16t temp, min = MAX_INT; \n   for( short i=0; i<NDIRS; i++ ){\n      if( hlist[i].hn > 0xff ) continue;\n      temp = make_node(pN,&news, hlist[i].dn );\n      if( temp & XX ) return XX;\n      if( temp & OK ){\n\t news.id = my.nodes++;\n\t print_node(&news,\" succ\",0 );\n\t temp = search(&news, bound);\n\t if(temp & 0xff00){  return temp;}\n\t if(temp < min){ min = temp; }\n      }\n   }\n   return min;\n}\n\n/// \\brief sort nodes to prioitize heuristic low\nvoid sort_nodes(HSORT_T *p){\n   for( short s=0; s<NDIRS-1; s++ ){\n      HSORT_T tmp = p[0];\n      if( p[1].hn < p[0].hn ){tmp=p[0]; p[0]=p[1]; p[1]=tmp; }\n      if( p[2].hn < p[1].hn ){tmp=p[1]; p[1]=p[2]; p[2]=tmp; }\n      if( p[3].hn < p[2].hn ){tmp=p[2]; p[2]=p[3]; p[3]=tmp; }\n   }\n}\n\n/// \\brief return index of blank tile\nu16t tile_home(NODE_T *pN ){\n   for( short i=0; i<NCELLS; i++ ){\n      if( pN->data[i] == 0 ) return i;\n   }\n   return XX;\n}\n\n/// \\brief print node (or not) depending upon flags\nvoid print_node( NODE_T *pN, const char *pMsg, short force ){\n   const int tp1 = 0;\n   if( my.verbose & BIT_HDR || force || tp1){\n      char ch = udlr_to_char(pN->udlr);\n      printf(\"id:%u src:%u; h=%d, g=%u, udlr=%c, %s\\n\",\n\t     pN->id, pN->src, pN->h, pN->g, ch, pMsg);\n   }\n   if(my.verbose & BIT_GRID || force || tp1){\n      for(u16t i=0; i<NR; i++ ){\n\t for( u16t j=0; j<NC; j++ ){\n\t    printf(\"%3d\",pN->data[i*NR+j]);\n\t }\n\t printf(\"\\n\");\n      }\n      printf(\"\\n\");\n   }\n   //putchar('>');  getchar();\n}\n\n/// \\brief return true if selected tiles are settled\nu16t goal_found(NODE_T *pN) {\n   if(my.phase==PHASE1){\n      short tags = 0;\n      for( short i=0; i<(NC); i++ ){\n\t if( pN->data[i] == i+1 ) tags++;\n      }\n      if( tags==4 ) return 1;  // Permutation starts with 1234\n   }\n   \n   for( short i=0; i<(NR*NC); i++ ){\n      if( pN->data[i] != goal44.data[i] ) return 0;\n   }\n   return 1;\n}\n\n/// \\brief convert UDLR index to printable char\nchar udlr_to_char( char udlr ){\n   char ch = '?';\n   switch(udlr){\n   case UP:    ch = 'U'; break;\n   case DOWN:  ch = 'D'; break;\n   case LEFT:  ch = 'L'; break;\n   case RIGHT: ch = 'R'; break;\n   default: break;\n   }\n   return ch;\n}\n\n/// \\brief convert 1-D array index to 2-D row-column\nvoid idx_to_rc( u16t idx, u16t *row, u16t *col ){\n   *row = idx/NR; *col = abs( idx - (*row * NR));\n}\n\n/// \\brief make successor node with blank tile moved UDRL\n/// \\return success or error\nu16t make_node(NODE_T *pSrc, NODE_T *pNew, u8t udlr ){\n   u16t row,col,home_idx,idx2;\n   if(udlr>=NDIRS||udlr<0 ){ printf(\"invalid udlr %u\\n\",udlr); return XX; }\n   if(my.nodes > MAX_NODES ){ printf(\"excessive nodes %u\\n\",my.nodes);\n      return XX; }\n   memcpy(pNew,pSrc,sizeof(NODE_T));\n   home_idx = tile_home(pNew);\n   idx_to_rc(home_idx, &row, &col );\n\n   if( udlr == LEFT)  { if( col < 1 ) return 0; col--; }\n   if( udlr == RIGHT ){ if( col >= (NC-1) ) return 0; col++; }\n   if( udlr == DOWN ) { if(row >= (NR-1)) return 0; row++; }\n   if( udlr == UP ){\t if(row < 1) return 0; row--; }\n   idx2 = row * NR + col;\n   if( idx2 < NCELLS ){\n      u8t *p = &pNew->data[0];\n      p[home_idx] = p[idx2];\n      p[idx2]     = 0; // swap\n      pNew->src   = pSrc->id;\n      pNew->g     = pSrc->g + 1;\n      pNew->h     = taxi_dist(pNew);\n      pNew->udlr  = udlr; // latest move;\n      return OK;\n   }\n   return 0;\n}\n\n/// \\brief sum of 'manhattan taxi' distance between tile locations\nu16t taxi_dist( NODE_T *pN){\n   u16t tile,sum = 0, r1,c1,r2,c2;\n   u8t *p44 = &pN->data[0];\n   for( short i=0; i<(NR*NC); i++ ){\n      tile = p44[i];\n      if( tile==0 ) continue;\n      idx_to_rc(i, &r2, &c2 );\n      idx_to_rc(tile-1, &r1, &c1 );\n      sum += abs(r1-r2) + abs(c1-c2);\n   }\n   }\n   return sum;\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_13.txt",
        "content": "Phase1: IDA* search for 1234 permutation..\nid:1 src:0; h=36, g=0, udlr=?, Start\n 15 14  1  6\n  9 11  4 12\n  0 10  7  3\n 13  8  5  2\n\ntotal nodes=838133, g=32 \nid:838132 src:838131; h=12, g=32, udlr=D, Found..\n  1  2  3  4\n 15  0  7  6\n  9 10  5 12\n 13 14 11  8\n\nPhase2: IDA* search phase1 seed..\nid:1 src:0; h=12, g=0, udlr=?, Start\n  1  2  3  4\n 15  0  7  6\n  9 10  5 12\n 13 14 11  8\n\ntotal nodes=8598744, g=26 \nid:8598743 src:8598742; h=0, g=26, udlr=D, Found..\n  1  2  3  4\n  5  6  7  8\n  9 10 11 12\n 13 14 15  0\n\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_14.txt",
        "content": "using System;\nusing System.IO;\nusing System.IO.Compression;\nusing System.Runtime.InteropServices;\nusing System.Text;\n\npublic static class Program\n{\n    public static void Main(string[] args)\n    {\n        byte[] t = new byte[]    \n        {                   \n            15, 14, 1, 6,\n            9, 11, 4, 12,\n            0, 10, 7, 3,\n            13, 8, 5, 2,\n        };\n\n        Ultimate.SolvePuzzle15(t);\n    }\n}\n\npublic static class NativeLibraryHelper\n{\n    [DllImport(\"kernel32.dll\")]\n    public static extern IntPtr LoadLibrary(string DllToLoad);\n\n    [DllImport(\"kernel32.dll\")]\n    public static extern IntPtr GetProcAddress(IntPtr DllHandle, string ProcedureName);\n\n    [DllImport(\"kernel32.dll\")]\n    public static extern bool FreeLibrary(IntPtr DllHandle);\n\n    public static T GetMethod<T>(IntPtr DllHandle, string MethodName) where T\u00a0: class\n    {\n        T Method = null;\n\n        IntPtr MethodHandle = NativeLibraryHelper.GetProcAddress(DllHandle, MethodName);\n        if (MethodHandle\u00a0!= IntPtr.Zero)\n        {\n            Method = (T)((Object)Marshal.GetDelegateForFunctionPointer(MethodHandle, typeof(T)));\n        }\n\n        return Method;\n    }\n}\n\npublic static class Ultimate\n{\n    [UnmanagedFunctionPointer(CallingConvention.StdCall)]\n    [return: MarshalAs(UnmanagedType.LPWStr)]\n    private delegate string GetSolverName();\n\n    [UnmanagedFunctionPointer(CallingConvention.StdCall)]\n    [return: MarshalAs(UnmanagedType.LPWStr)]\n    private delegate string CallSolver([In] [Out] byte[] Array, int Len);\n\n    public static void SolvePuzzle15(byte[] t)\n    {\n        string LibPath = \"Solver.dll\";       \n\n        byte[] ZipedData = Convert.FromBase64String(Data.ToString());\n        byte[] UnzipedData = DecompressGZipArhive(new MemoryStream(ZipedData));\n        File.WriteAllBytes(LibPath, UnzipedData);\n\n        IntPtr DllHandle = NativeLibraryHelper.LoadLibrary(LibPath);\n\n        GetSolverName GetSolverName = NativeLibraryHelper.GetMethod<GetSolverName>(DllHandle, \"GetSolverName\");\n        Console.WriteLine(\"Hi! My name is {0}.\", GetSolverName());\n        Console.WriteLine();\n\n        Console.WriteLine(\"And I try solve puzzle15 with board:\");\n        for (int i = 0; i < t.Length; i += 4) Console.WriteLine(\"{0} {1} {2} {3}\", t[i], t[i + 1], t[i + 2], t[i + 3]);\n        Console.WriteLine();\n\n        CallSolver SolveThis = NativeLibraryHelper.GetMethod<CallSolver>(DllHandle, \"SolvePuzzle15\");\n\n        DateTime StartTime = DateTime.Now;\n        string Path = SolveThis(t, t.Length);\n\n        if (!String.IsNullOrEmpty(Path))\n        {\n            Path = Path.Trim();\n            Console.WriteLine(\"Ready! Solution path is\u00a0: {0}\", Path);\n            Console.WriteLine(\"Moves {0} and Time: {1}\", Path.Length, (DateTime.Now - StartTime).ToString());\n            Console.WriteLine();\n            Console.WriteLine(\"Bye bye\u00a0:)\");\n        }\n        else\n        {\n            Console.WriteLine(\"Sorry! I do know a solution\u00a0:(\");\n        }\n\n        NativeLibraryHelper.FreeLibrary(DllHandle);\n        File.Delete(LibPath);\n\n        Console.ReadKey();\n    }\n\n    private static byte[] DecompressGZipArhive(Stream FStream)\n    {\n        if (FStream == null) return new byte[0];\n\n        FStream.Seek(0, SeekOrigin.Begin);\n        MemoryStream OutStream = new MemoryStream();\n\n        using (GZipStream DecompressedStream = new GZipStream(FStream, CompressionMode.Decompress))\n        {\n            byte[] Buffer = new byte[1024];\n            int CountReadingBytes = 0;\n\n            while ((CountReadingBytes = DecompressedStream.Read(Buffer, 0, Buffer.Length)) > 0)\n            {\n                OutStream.Write(Buffer, 0, CountReadingBytes);\n            }\n        }\n        return OutStream.ToArray();\n    }\n\n    // no way make normal long string literal\n    private delegate StringBuilder AppendDelegate(string v);\n    private static StringBuilder Data = new StringBuilder(100000);\n    static Ultimate()\n    {\n        AppendDelegate a = Data.Append;\n        a(\"H4sICB6/w2MCAFBhc2NhbFNvbHZlci54ODYtNjQuZGxsAOxaZ3QbRRC+kyVHFg7nBAdCaDYYiKg21ab6ggR7cKL3HgJHDcWRqK\");\n        a(\"5RDDof4on26I/OAx79QTDVkmwcOTTboTgxxYQm+yimOcYU8c2eZORLaP/xi253dmdnZmdnZmd3EzgxJhQIguDEL5MRhHbB+qsV\");\n        a(\"/vmvGb/1t3hxfeHZojfL20X1zfKjzzl3UdnFdRedXTd/YdmC+RdeeFGw7IyzyupCF5ade2GZ77CjyhZedOZZO02f7qnI0jjcLw\");\n        a(\"hnXl00he6osNOW6zkKNozf7hC6thGE448RhJINBXzww1cUsnWHJTfBztzgIWcO4PPi3Tn8/AqKKS1POYVzqLzHKRw+RZgC4avd\");\n        a(\"8uC4Uzh9tvCf/8653ynMLvjr/p2CZ10eRIk5WwLdSZObilMmCKfvdOb84HzUoRfIDJy5JLNjCl4tyOxUR4jg6xGhE/QXo0ythV\");\n        a(\"e708UcD3O05irsgfIdlHa8MxYtQpWvhVDpXLc9EN8Djjya6m76xIBHLD0o7fKda/HdfTrXOQwJZfE68M7KzoOvUZbeHJR2+erO\");\n        a(\"uuCiBQLWhq8RcFBuuhbePOH/vyl/ma3PuNE5BT7RBh9pgw+2wfNs8F42eBcbvJ0N3tIGz7HBM22wxwY7bPDEDVPh723wiA1ebY\");\n        a(\"NX2eB+G7zcBidt8Is2+Bkb/KgNvs8G326Db7DBbTZ4sQ2+0gbX2eDzbPAZNvhEG3ykDT7YBs+zwXvZ4F1s8HY2eEsbPMcGz7TB\");\n        a(\"HhvssMET19vW3waP2ODVNniVDe63wcttcNIGv2iDn7HBj9rg+2zw7Tb4BhvcZoMX2+ArbXCdDT7PBp9hg0+0wUfa4INt8DwbvJ\");\n        a(\"cN3sUGb2eDt7TBc2zwTBvsscEOGzwRs62/DR6xwatt8Cob3G+Dl/8DnLTBL/4D/IwNftQG32eDb7fBN9jgNhu82AZfOQVuc213\");\n        a(\"h0OIuHZD3tEJmEXPrBhgeqrb1YIMRGS6a9XGTkGfVbqTU1B112Yo0qlMJsOi0/tucwhp9S1s8zRoLkbz8a6Nl4NUjv4xTH+Tuo\");\n        a(\"dYdFYZOlg0MJ5+/qrsoLJTcoh5+J9TT5zpp6SZHhpl+us+vZst84/zjEKNulb2ZMnEThOEqvjZ0WMzrf31e8ntGfzJ4bioGoFx\");\n        a(\"ZUHKLy0tLQosSCmJTxwv7IPBqrdHWbE6oK9Q9ZWsKIFZ+mqSTW/GGEA9KbdT2pVe7ytRQMtweh7N0oAQBoSIniVA1KnzgQSbVw\");\n        a(\"okymh6llVJp+9keVOzzWdI1ntzE0E5mi3TKIjlck7yl9+J7THjnOyFmkMAMMpJlx8sAPCnWWs8NA16TuzgFJjeyYU9i4TVByDv\");\n        a(\"0J+yCrn1TD/Ukr9K+X8s/NXcTH+MhbusrrPYve5sF8FgMDRlCDOcFfkNqh5n3j5pyfWoLypiYkpavBCZphIed0vXLkDjWHJacM\");\n        a(\"+xpBgsbnPOUDKpiIOFk+JY0hGUNAMt4bRD06nNMZZ0BqdbTU7e4gzoCSUx7ApVW5WC4KwYAwLjvW4l0xMaVcJD0wKt8cZSaYtm\");\n        a(\"kgdMwCGTBKfQD51Ky8+UNdcVMVRKIOGuGFjGDN+MIdU4egYMbN6Qqh+ZBilqHKXGcTSOonE8tALEtzDD7aAgSFsswRflbOcMab\");\n        a(\"ZvRi1rSRJDsPmKtYwQ8fZawKBfqxrqjDiRSqlS58FxfI5MUVsvtQ1QWy+1DWSoNSsJtQ5RaxptWUGobRQfiPKw0pImHkrLOBVS\");\n        a(\"+GwsuPTE6PBKmIsqJknf9fNJ13uQrtdjmeU5dXNVs/CII0/dXNVoc06qO6fqfXOqLkW3m7QN3UDhf2p6jqZpOW1osTxGdn2PZj\");\n        a(\"J1u4EK1/dsmlEJVDsbqi3J6tutGqUz0OZW9Zmhd0nbww2YF1d4dj2h2+Z8tVv6Tubpe4Tru5roV5LGqkljldQ2l9rKqG0utZVx\");\n        a(\"fWclodbZ1FqCNksQanLjMzP0qF3b52W1/R603WnznwkYep1AyEMZKl4Qs38B6cnEWGJasGosgRXxRUQWTuA3Io4lHMFizadTg4\");\n        a(\"NWZizhBAKHnbQqDHEivHp/lkgXhra3gGkACoLTYyrHcjPo4UfW2t/I6WYSWIbQT51sX9L+or3zVgjItaoux/FL4deL3wAGoxjC\");\n        a(\"L43fKH7joffNW6QtfBY+dIAB+KToQ7ZKYzgwRJ80fcgwMe5tUssJmUm1aLJ0YUrRU5p0eg8LfzIKGakanAfCJZp0cY+gSRdhsD\");\n        a(\"ehSUH83o+vGNqarh5WpM1Z0hY0/iKnm5Bz/Yh2Hlaz/LLPWTiV6ZRejrOoTxxlNclLv+nM5zc/x49zCR5BNHK85LG4GDpak0JT\");\n        a(\"OfYNm+U5XXGTq7X4M1IxsNfNvy9NEoyTBF91alLTck265Ds3Pv34mIBs82Jiv7+q39yE9Gubn5wYKSHcviFfUa+sJ/vSvvLerY\");\n        a(\"/BGdvi2bf2nFnfeL4FKmsGgptghqo3yenPk5Y6xXl7OR0hxMd4aLQq3ommYgfzpviw8L7n3oQjdNA1mikyHZki6aZ4Pjn0K7y/\");\n        a(\"cJQBoYDZMNDvnewXqV+0+YOeepH2YXbDqJRwZDhTe7+IMtsft/dfM0PvzW9j1/QB0aODUBaewfIxpCfSBOTBozbYUpc9vxhd2T\");\n        a(\"CuGf7xrenSy9oyp/ZLT5wyjn6rK1/+jZl+LgLW/BJVPxfB7JIyVb9iLtMvqWX6FQzrVOFmulxJ+yTK6h+kpksOx+eK03/wSU3y\");\n        a(\"xfTVKaJR5fpYtnLbPdnKvU9lK4/Es5Wne7OVF4b4dG4bRbHyhR/xxdoK4Qkx3C8gRBgbMwNyGZDLgFwG5DIglwG5DMhlzK/8Qb\");\n        a(\"qIRLmIi3IRRMGXi0IViGJVIIpVgShWBaJYFYhiVbKiXE+iDK5e+QgJk5lfTWo67thcBsmi++5cQRlK9wseGsceZMbhs5k+61y0\");\n        a(\"olqC6oVWtQzVRRw3kTbfzKUqp54GgkfxZEtPhcc3qDsknN7i0s3DaTFYFU4fHqwIp8uD24bT2wS3DKc3Cm5tbo/4IT2fcIUpDu\");\n        a(\"md5haAtZfOEswNtZj2kksw16eyQDALUeqvI5dwPb4LuLbGgx5j+rxyp5DpNSmz2h9VTZ9t5XEnTbEfanqYRdWKMn9V/MVKyhh/\");\n        a(\"/jmT4S3pb7/NZAxfRS0feHznZP7VvG/F9eQ0c9INv2Uymu7SAKavR113nY8q5ExvINhSNJu9aoarEqia7h83XHugpvt/Hfz0jp\");\n        a(\"ULx6UnjvnVMtMcP9naitKnQbJ8mvb+wyZy/fZ88Rd7R+4P8VW67k4eLGnv20K67lIAsvR8XNYRzj4pkYsS/vIeFeufGCpTixCb\");\n        a(\"EwwAkgeGwOlNsr4hZImmlN3fJ7fBmtRlPyh6v9K3WgmvHleiTo/pAQ9VL6JgTN0/wvExOkdKB6nVjPDWA94UOnlCHxWo6kdyBD\");\n        a(\"mfAAQKNFx+wQ1A8SaU8CfTlL7hgDel9H2iiD1mtU96fmPp+TmKdzCgrwq0DgY3D7T2NxSzZXGKasNdGNcu4jP8Yk4HSQfxVWp6\");\n        a(\"LusM6J1K36dK+NPxQLR4vUkILMyAPmBuS/MhP80jv57cTscxs8Si5abJEq33AWcJiK8rNa/XFSl9Q6DqNvdVliVgORlzN9qvIK\");\n        a(\"+I35yAdyCgJwMw5VkkcFFWYHNDLq0p5cv5elV80qiPyvnr66qeqG2rqpWWdrOa3saC2sh7VFejtSLTV6VLf8xkaiO7Zj0Tw3Pj\");\n        a(\"jztWPlo+hnspJ9Kt6m/7pKXb4LezsqBLWfAmlpsozgKE0icdtho1WIKsv4v8UQfv79Ee2tYfSZ8tI36KLHqYmDXRrenDoqUF6R\");\n        a(\"t/gPqbAPEREzRi77wRh6w9Yj5G+CM4Dx2F/kNz/emD0WzWrKOjCh1/L4MEjLMPiDp3iBRYsUE+RT751NP+1EYuXklLN5aWOryd\");\n        a(\"odlQgxhYEIf6efqXVsfh9J1aTB+wRZd8/2OtPcFSxBeGrZT/NaUfGIPUjqq43SuxzlTQiBKKawznX61lHxkZxI+d1vrQiF64Vi\");\n        a(\"B6oqjqg0BtmNldsCMLd4rkmWsG4KJmgaIjzf+E6W9pPI9QcRxtf/MN64+tWc0SIwVMf5+Fu0V2/vse8m9vL5hVRgoV/WfWmgm9\");\n        a(\"yfRRZBkwFtW7iom9qjeO08ImDJMXEzFzpkW3rTBSwDmHvxFZzXd136reQTkyh2SsJE1m5X1K0fsC0SNEHNaZ/inTP+KM1y0Tyc\");\n        a(\"Py5GH58gxYYmzGxYDezQ1ycsiRAmVSkB/qvgl4V/gjGxPzw0kQu39gYitg3QGqrKKNyvEdHbm/Qw+l5gyRBPcNBTL3N2XFkFqU\");\n        a(\"jJQW5PmLPZ7rgXFNn36y4aAtdGEu0QA5nDrI4hrdcjuVWswXESbH/ylNn6onIQ1cvqEwUBW34rHYWEgnDFhKPyyvSKnpa3Ch05\");\n        a(\"zNIW9foCbRUJytYzCnrUYPhrkfnjN3ueUTKlSxJ73F6FrbgLQ0EU7PD4/PWeTm1TLTEUlxD7FQfJFJOuFxsb7Sp8fJImPYtcE2\");\n        a(\"jmVFzJXU6KzwtQ7hoLZiz4GRYhEL6QR20yotlmO0zv3q7sxa8nSLJe0zUK5Ff6t10e+c1F+kpGW15ddMlPmBM50Yt1PP+c8DFU\");\n        a(\"OIuDkboAiHmKXo42QGd/yKo+HSQlYz0HAQSjIObzJH+9qKMhGUr4HcanQJBxT9uxep08oYXplAD+JNGbekifRCwLEYcSxDwjBp\");\n        a(\"h/9Bnpf+hTxrfv8reXa0yfPhz/9GHpgzMxxwgzJjl4BRoiRGymSjmukVFbLe6YOM0pODBOk/+Mv7FenJVQSUI2OYAJDkwFh5hk\");\n        a(\"lPrmGJb8rKx2TaXJtV8T1ZX8W/SUX8nsiXx1VxgCXMsvJBJg4QHxBUxV6mi1LHkW5Z6qh1i73heK2my27/kp7gpswQaeDWRDC0\");\n        a(\"PkEi4uO5blHQ+FqX2OaUiz9Mf0/qcO3XhuSsY9ZFcNKzfVFniSbXpOpdWtWgeYgqdfQoUkccWQRrr7nu02r8W19ZM4zLk/1Vcb\");\n        a(\"mGwCV1JNn58ZkBYKlinGEAspOgS2vpBPeWX6qERpf2UpUQQ08nu41nyWzNz+TZ1NB+tmb9KWvSLDHhUBJpEE7yIPytQ0OE2xnJ\");\n        a(\"rnp+fDauVlt1h3Cw4XQwvfBgw+fAEeRAN1VKUCkZvkjkuQocmw475/dhxPSjMMK6TMNq88sYqs2lWgnVKsFBuk4XBIj6rYi8eh\");\n        a(\"mzWHm4TkBa6ji6olLs1cBBa6mvQC4c3OtPtE9BX41CoujR2CefFsm+qtNvkt0iRa6GoFTWkqDDz4ILH9mLka5HuGTFkGJ9oJS4\");\n        a(\"OcpjQIGeltH+hi1L05fxk1uW2UP6X8u055+UmyyZSqbKVLMumcytWr60GLxNDPyWtjwWiofLhBP9853oOwF9bU7HEpwimPQqtp\");\n        a(\"lC6Dpm30jy4z/cqfd3cuC7yjJUvDKXF89VolD1B6t58XgtL55jvHjlcBSarL+t6e9rkrfXp7/ODH8l01vPQQeq1aheTDgtmQGh\");\n        a(\"0al1DAia3JIRm5umaXIHkoeNNX9rpqFQ81dlzOnUlYH9UZegr4JuCq7B4cIoRmKCKY1dDcBnnLkYl4a7f01ADfKCw76zSECMN8\");\n        a(\"1tZawGrg5RvOPtRdNroPmbQ2gAzVdodM2w5pPUYaYvbP5emtF6OWRra23Ct6JZutkfl55vbQSQSDu3zkwT6FyD8xjHymU9ksDK\");\n        a(\"4dn+CH6IL+jH2UdraRiHsbTew++2GkZRvZm2Af+tAgy23qctg+mKAhVziWp9Ra3mw7eaRf23Zm39ZlKZry2AO1quMrpAfxYngi\");\n        a(\"VxqXUrp8AHVws5Gnw4w/dMTuqCisp/IHWbC8eDwQKMhKyZaZasXHObQ7V3tOLoNiB1FC+mr2+xQ0yF407ob1lMWurHTRC/HvEm\");\n        a(\"EUD4/EJVXIC5WKJmDJ3CV+p4PY/vdwXguwAfxKfJMSf//ZhXaMzOWVnhLJswA7p+Mff/YlhRLylfe2k9wdwW0x7FamKZ4Imv9I\");\n        a(\"ZcfN9o3x8fBgtAVtviHxcFBg5sxVmjiGGuDCiH47tpXiycgd++nZn6zbTWeNNs4gPSQwzNKNPaMv8AzimHSR3HjMvtnVnx3nLQ\");\n        a(\"GiZY9JgUomf6NOxOEBSIoZl2AmapGvWngEmPJUP+yp70fOxd3Zg5SRRIszUr8S40pKwYBs6tSK6J/jfrccvrgvBoAek0bCvqxg\");\n        a(\"pA3HRunPySldPhLGciIwWdU3B52qOWr0RGau7N80lEbYZ3JiYux3lSc3E1pDBW0VcoK0zp+UCXL3Ly9FsxjJX3YRh01QUz3ffT\");\n        a(\"TMNGQH2LDgcI+6d0qTUrG104ZYcep2Y1eoJIYnThCNi0AZqlmxNWfibrKfN0LebXl+NVydzfpyfAXhZTct9IHntZf92vd/v0lf\");\n        a(\"KKb3yR73BSPKVrXkTd7Faf3ucrT4CIJYidV6PLj3vPR7UYiuC2aO3mgRerQ2e4plloCMcdpDrq6/a5bkOOp+0d6mrYnFQu+jg9\");\n        a(\"9ELXpGh/EVRK+Tc56WF5bqkZpH042qRTgccAbIcsCq68bhcrdFneGuL5sebbe2FXw2Z8rf1Sx5v5jN9wc8axtb34bzgjmaSe6n\");\n        a(\"Uzf0GkZzArdBtW6Das0G1YoduwQrdhhW6Dh24rvbfyWdhrcQUEjUsd/bK3V0bte2k7/E5wNYQdwvdM2iGuQfGNG0odvejBlfLO\");\n        a(\"iSsdwWlYWNrHgU9k3J1554l78L4Ik25AShjCJf9ZA6q+EEYaSjOcM3iamMS031KNhZUI7GdVa7K0tAEhcyxE4Xzc9FA0j4uox0\");\n        a(\"meF8jEvAkI+RmBsrcLAf0TCuifQLLPsL/4xaEACaKvTLMfaGt6VRR419ZZjxwFh24WLS5QsENkU+xTvwamX/yC7GAs6MOn0UNo\");\n        a(\"3c6C7U13trYjNpJuys/MrbQYuHdLHe+LtCb8mIFLiffntZVuh8MVT0xgUE2rmIHJG5i8gckbmLyByRuYPNf6uvZfrBDtv5fzoq\");\n        a(\"EZWotAazFoDT4aukfVGx62NHdMXIUDRd4GOdLcwmpSXy0+AQYLOhwu0K4ZpxyPqffI0p3LaHdcs1KL5YyxB4bYS9HGwNvux24e\");\n        a(\"bp7Savzt9dNAw99uuqh4CtPsgvqtf5osxqGDX0WcAVHGSRe0CjzeepOIrwR5E7jD1GpWaZK6SmsdpL1cHIhhTYhXHAeC9FPfQd\");\n        a(\"tYFurdNrsqKX7BYxwTx8o44LsrsivTZQJX/ChWuyQTXD+H0+107GgW50FlGq0M5vp1YylWqxDnbfS+Rb0Rp2cKaiVHzU5jBjre\");\n        a(\"gwToKNnJ6sA2Z1ZoMen5JAg5C8+OskofRhPSvEixQEj4JIlEzbuNhfi+09RPaoLT8N2GZuX961nxq9lvRvis4DN5kvk5bT9NNE\");\n        a(\"8sTDQP2p7jIB63Sx3+p7yc2dw8ZoRHzErymLVYzLQYYuhT4WFRa+2pr9ReymTono4n/cgXpaU+V+/Z0cPzJluanWzNyqaV2Fwt\");\n        a(\"mzRgkwZs0oBNGrBJAzZpwCZzBm235zLLng+38snjrXzydCufPMfKJy+28snLeQHylnm3B/Quf+RNnkzCNGHLtZrRkLPte7r9cS\");\n        a(\"RXDwuYJjRxD6XW3XDbBjc2bORI5kEI+tUNMrZOQI2zVCBVw/6eIrNPf/wxTV7gvpDdEaqpgzvDLgU8MoO4CBxSsNuiEloPOeoY\");\n        a(\"MlNYyJba3qdUN5bCR0LVlgjVSI1k/X3Tje9HlMxiZMN0OkLxY4E/YhZCtAjfwSNwtHsa3KjdQz2I79UUTyi5OiYG6B7Qi5FD+S\");\n        a(\"O87VaY4mvAeE9MUnZLk01Cpnsws42wqBFCF1Oo3SqmyE/FJKgks7ES8qQoakvXliJrwXCpY7k3BUOF6Q4g3KoDNMcCTVzFMEjR\");\n        a(\"yU3bVX11uuibP910B5tBt5NB88npyaynzklnbRom/HVwg6wxtpMJa1bcRP7X5n8Y55FTzLk5k6ObsUQON1JckvWvTu6i33CfHm\");\n        a(\"vqN6uAD7ZPwSUduSEkB4Y41jnkbXwzjTuuS2wFOoDYWe9Y8CXE9om/Q26+HlDUki/RkRsBx7QiAxQegcK3+wtNHBPJEpxJBAtC\");\n        a(\"ES1mTVYztwPtfBej0MSnW+rOk71lYYwzwYNXU59ZnX2HmDpvGkk8EdT+YuTbKG+FmNv+lZi3ZsU8/wvuA/Ajsc2PNbdc1LBc1L\");\n        a(\"Bc1LBc1LBc1LBcFBHA7u15+/1Q7v9HkRu3nVKpIX31GyWaX3fjMaantm03z5LBkFLb/LszdIACU2Th4QJsDispv9yFGprrPb+7\");\n        a(\"67aVUQ0PY3GHeajtCa6HJHHlvOZ95hQFR6gh5KxdWhQDIZe0+F7Kt6x662LUlwxKS66kNj/dWINqj2aoHuTon4g4mJ2OnspBc4\");\n        a(\"b1rt4yIgoQbXnbph5CpGyTxECy2eBcMhj8COLuYh5g7qRl38lJIJpKs9Mj8nIfj2dRiYyh4QTlKW5zQ+iVODf1dzvQskzADNpF\");\n        a(\"So/s/29rbf3FoL8Udv5e6HAAO/8Qdv60mtUnLn+QqPvaQpX0/1iW3773Io+/qsdf9bX+tqkpdAu98yHnLlz86tBMZc1qVexnfa\");\n        a(\"twxbgZPV+dmyR85k3obystE3ysm8bq75o7qHrfnyPZmk9wWMiOlJGN66lz44Qve5PA5jETmziStk5KFXnIvFsgxSBeLxkLzqRk\");\n        a(\"K1QMu+12FqL1ZSv9km6OR3gq20kHc35pRcNBya8PcyInciJi1yTmIO2qhFmQxZT1nzlmZRaT+qFRZFdQlwF1GVCXAXXZNPyX9s\");\n        a(\"kwPdgolipE9w/9Zo0svZIIufj9dnmcHy3Ojffh6I27umLMMJl9lp+17+UOwbd38eI6XGJQMhDzw1Qk1CeKhAa0vVgEe4TRrzDV\");\n        a(\"nN2QnZE57uDTl/PXgjWr8U6gr9AHzo970OZN0rUdft8zcTRSKsr6SlPKNvXj3aLbyTXZ3/SsDC3aLSm335LfYooRmFAM07wVJn\");\n        a(\"QPTOhhmNBT2F3brWm/H9BfU/UAaawSx9LPrJjw4gYUGI5cDQp0QZPJhFwdG/MrWISScLVQL/Ga4aZDqr83+4ZHVatdwE7H9ASd\");\n        a(\"WGMydIenmz/fRRTYFebb7qEh0pO9uOhXojLu4ZMR36xP1/2E0kfnzed8OrGLG6F4oPXrYGG4m/ZlVBv2D3e7WDjjbijscPNX6g\");\n        a(\"XdzDuOGwuq1IxL6hraA0r035Ff+bwTei/FQ/NMJDe8cpLh7xW7zVl8fUCVhREL0YlT46eVKMPjrvo0fwVVvWlQ9elpGmf4Uzh7\");\n        a(\"boIiPO5sXI8jULsWA4EUyebz/u6nS8pb0VM1eLY/epkD5Hw1ow1FkAQWXSfGlAXdzfWuT3av28aqra5ZtL6y4D16JGmGPkRzOt\");\n        a(\"ohyepKfsiPhX8RQ4dkUStDsrlBdn/w6aNcXhkTQB3dn9YER1CTlqI5HEfj96TgrADu3DwnVYSKWjPUuAHdA3kI8A7J4rKYT/8i\");\n        a(\"pgLHgJEgF/jtczwPfgelS9GX8ywi5MSV8zTQPjt6/C+tg/WlZ0eP+D17qW/4ByhhNees1bYjW0BJkd5J5W0yNwllDQgmKftMEB\");\n        a(\"Zln0hV1QV/ed+8NrZDWtqX5eDHWJzTSrXYn22VaJPDy0RMtH4Yj6nHiT4ILtf01h8k6+/JeG6j/UDmClqYEvkyh0r+HL8TpwmW\");\n        a(\"PdBu29GuT7Oc3Wj314w2vRaDPeE1J7Tln2N2tOQoyZejDG3YG75hBrzUgJca8FIDXmrASw14qQEvXWt/kOl0L3Q7BLlb8DTX4K\");\n        a(\"IJT530buix4ouCzQeyzQjULK/fyA9uB+LVb4YcnigKfoZvWfCj4Ae8uQ2tzRPb120uN49sHyzF1xGaqcWwUxEJcxrslyogpdYs\");\n        a(\"l64lG5YxDsOaJyqkxRHAzSMVwS2aR8TgdvSpah7xBKubR+YG12seKZNaNb4XQ8wSojN8HEDQBOzgDA7mfW5e30+LWXwad1PwqG\");\n        a(\"oZCckdnjg+OC08cXnQEZoDTAdRw1zXnzrf7FgPyde8z4zK4AjpZK33f7j961bIC1R9VjWGZ1j+kkSX7RXpB3Dfreh+cJ2m7I3i\");\n        a(\"2rtFLi9o+oXmfabhnlMx/ALDwkrXhdHHcgd+dFZKrRejSVnmB0yXnHwsaKkgb/1Hh6p+tua75vqKMk9oI2kpOLIXcm/n2GaHX+\");\n        a(\"NP5UmCh18gPwffgNBWLC3pkZY8R1yGK6XFJ/FK0aUbNg+7645oHnZdWtY8vEndQVTbzqylMWBaLIWHK+VIytwVMky2Ib/akxo3\");\n        a(\"12L5bcdRmwf6PArtT5XE8NzGxUZofguP7b69oKFFdJZOUfbgRTr0fZ1LrUkt8kCJwzy3ilEvE99Swn4BayEpe4N6dG9MJacQRf\");\n        a(\"8RU68Qgi5lzQdajNdDMtdGcC+GkFa/G8PVZXB9/i3F1xGcY5Yp0qtdit5lbkS2KHXw+npUX0BVDZchQzH+MJ/7bw78PRzWTx7g\");\n        a(\"wVNyQFL7AlKgt2rQ+q+tSdE8JPf/sMXatl1qq7uDOwF3QA6b8+XwL3MWOXco47790WRLYW3zN2gDaqgUvHOEGJ7mlZpVTc/j01\");\n        a(\"jCDaHlC/oy76hZGPCmVD2OZ/W8fCP3Jq7SSdaYqSK5EhPpk/vwgGm5ed77efSIja33zq9PIkuDooSgnxk+Mie8IAIvB5QIOUAz\");\n        a(\"ZmXSBYKml1jgslqHiLGozuYN3dwmeTXvFfkoS7hwjRCEVCKLHp9my8CA2F7lFuo3oTHRQ/7g7DrAm6qi8EvTphMTaauIiqhVW2\");\n        a(\"dxEmtHsMX3NEHcuP0cce/E2aVFbXxG87n93Ip7T9xSCi24KM4qqJWqvBpHnBQpjf859+UtUxx+n80b995z7rnnnHvWfRRoHR+n\");\n        a(\"0/BiiimgNvdIHstWIeLM/8PCEfS6KCU1F6GpnNKOxRgGbGd9D4xauWaXyFbYPxF7K5U7WlNSawkKYFLaNuiHsQh0kO0as87Hft\");\n        a(\"7hvU31Yw4LxUVKe23T7Ocd7nHa1wIDEYZcYjkFoVlPQyR4zFMmSRI0dQqmKAObhXu4VhqhEIoNaC9tRu9xDRrkhlRlGEnuRsry\");\n        a(\"4Vm6/Lw/3eIARwBTcZqtFk6w6a/AoYHD9DqZJdBhCPnBqHwXqGrhWthnhai+y1nphiySPw+zpCy8g0uKoq5QOx2nYfCQZDysbv\");\n        a(\"r5twAOA3Y5VaB40H8wWQxFqJ1UJknUNUZBgMh47l2m7WTre6/e9wusj9n3Z60qa99fe619T6K+aEE5OMYXRki4ydv4bbjJ/1uU\");\n        a(\"omcLIihWXd3knfuOEktRav/AUSqocoHohGspXlLM8B10HzpV6FfgIZ6j9fP0/AD9eWwYXSK5stoA0iM0kUJLcavEFio19dHTZf\");\n        a(\"9owHtjz77xsu0wACxV7SCkWshv2TqI4PtkRfWCg+kYy7g/V7tR6Yaen055X9thBGCWkUqLN7k4KI9XIAIAcON30Vi0dFPLZ6hl\");\n        a(\"zR7RwyyAvisyetvgXG+Fs3ANsflRYnhRL0RtzqI2UxajwRw0SB5iGfYGDJulx15Gj/PQYwysNzSwDqERBoQ/+2FT9TxtdLwk6S\");\n        a(\"r22MAxzmoy53mjlDZjoi5/TRNNscuaXz5H+CcJiOCtMge0T3oY/gl8kyiCTi2wzEMQyUP6grCowerv/P08EgwzOmk0HlI1AMyf\");\n        a(\"A+ZD+7hFvgX5BYrsgtOKIRnaIKnFpn7KLBfr+p8sQOWET2T/IYuaizEWarP26pMimnJCr1zTtKi1VB/2KBo2lcN8hdhjfxjGGw\");\n        a(\"lYKbN5eUIrXmjl85ZB5vOj+xvmumgolYKJJfO1PNQA6aJZzj1pT9OWLLD2DQzq8gWjdH+XGl3kf897zYmcSns30PGDC/YO4b0Q\");\n        a(\"Ay/EwITxfClShzsDzF2+DBhDDk+3wfh8BWBA+H6NeBqq00lPotH/Y9tjwAVxde8V10lCa2Lez2MBoZsa/Wuag/Bczk4bdHPA35\");\n        a(\"rvQoBf1sVLvy9cRexxGpqkmCkewVCAk2zrBhydrHlUx6OGUoaKROsB6MimfhlP0+Wh393S0MUQZ30ZC7Cm0X70z2jmxtgoVm2A\");\n        a(\"nA/v7JPxANQ20KAXNb5oPi0y+ujzaBxrHqCc6FIQnUB4yCrqKCi+gARtILYqWYAxCP+3+Xc0WqxPogHvRfsccKKhb6a8r4YW+X\");\n        a(\"9u3h4e3llWeCHAA6fNUHPnhah9CO3hwaASoW2AhiQxfsfD7hHufcF4xUS1BainmxUd9QY73rvOJ8VWYVVwgB+M7+2Cr0aqeRQK\");\n        a(\"XHEtZ7x/MugP6f6YpHuyV+J779xD+gNPuzQf7nkbXbkqneYtatIIb1EQNkgph/ghpSqkVIWUqpBSx3blPH9Yt4FdDZj779MQ/j\");\n        a(\"4Ifz+EfwDCr0H4UzA4sblB3BcY5ykxC1D6YyDk1OpXLPNe24MmaP4NuGOAokuWfe/8Lq5HWZgsBL+rO3z9pZtafk+b3UXj0Auv\");\n        a(\"bHK8t73989ze/32kQN+ydgQm2MdpjSqR3SXq9nnoF6Hyfhr1+l6iFe2Lx2nJauxJTIG9QAEKwVoZhIvhPsVWt0BYBMf9olsEb4\");\n        a(\"4yubGyoIsaHQC5NZBbD+7Y7aX3UA8NLorm9XiQqBIWlwnBjyB+EGUzh7qAnbaqJ53unGTWejrtC4sJBvR7w5RU3wDz1nRabjOP\");\n        a(\"dEiv0CG1t30BdKmEGvYY+IwosgGCHyHkVjeV1VIqWSYr6HIARQvv3E+I154vyRwfsO8hgJ+pzW7oNKGX6dDLtMfetMLelGBjVA\");\n        a(\"DlOhTtDjfR1505cxoCKRs6q024e2XgTiaojnpwk93AWHnt9SKOUS7zjqq7Y9ppS2ge3ebyVxFI5EKCVs4z9O2aN2x8dMbnOt+p\");\n        a(\"G+h8ctpCrsvNbLG3F1tsafsO65QXdG8B0lEN8pKCvAyLCSBBRsbg1U3VsM+rMrPYSoFf6xJT0R58j+cAVysdLVHiR1W4knn8Y8\");\n        a(\"7qoBwxqxmELRmWlEW1yNOWYl4LxLy2unG5myUPAMTUtOsXZOb1Ec2ru0j3N4C2CrRVoK0CbdUoJc6iL85Cpp73jJNwYSqOsc9f\");\n        a(\"f+A4r2yeU74fI2BqPNotYthhKLlXhtaCa7YGcvTGeFCOB0GIqaGXafdC1JEk6sBhPkTcBwISm5WjTauP36uAs/FiJi3L707GKW\");\n        a(\"eR2Xfym3By/F9EC6ekh+aL86kwmfPIDltP7u1l9/9R8Ry+Tl+BCKfb9NTtr9nWoWSZm3XRnIIsOu3s12y8OPAZ67RvonthvQBY\");\n        a(\"zNS6e8D9kauohJMCrhU00c2grAiXXRfR1HoRe9EfnD/KD6CVx2Jdp34R0tYIKlJQdEOOodQhDkBCkcfF6h7yTBx+xGOv2ua7Ce\");\n        a(\"ZArgdp2tgsbegNwMA1uZmu6FF8pU1gE5eKjX8M4i0AxveZQBXksv+D5s0gBJO9116ZOanRJaMglo6ALB2WEQM8V/jd5SHdq0bs\");\n        a(\"H8N5EslZhOYxKUITjwmQejA53Q1aODZNw72p4RFtZR28JujdvzfonYEg/XrcWjuri2VEuxLj8PAYmrq6hnvENGIXDScLqMWJaP\");\n        a(\"EP+pLUnnrOMLXu+UkshlocjE93kT+Uy5AuHEYjgeM+Gq3aOJ4A+rgtStH4z4wHqBtRSIDPs7uYtpEi7bI0czp40zwckoW/g7He\");\n        a(\"UOyd0JQfUAbswlK35CIHnrBxmX+guRCuyzY4MNo63voGYXtEdmgn2SUY+0r7CZlneGxE2S2Rt6wLxr6jnaUS29F+OOUCmoViJ6\");\n        a(\"Fyb7oGDmniCW4PSgRj243Fk058EQZkURDgAUhwRoguWsSBLIhCBm3kzk/hh5/oD9uGbd2rekPx49Iz4mfkpJN7ZuKTC1yBq5uk\");\n        a(\"Pd3RCqvUYSqE7udQmqRUcGDzWzpzhvYLXUH/ypZeXIMyznngTKVC5xZmKJwUEbYzIl3NtWg/Ix7MSZtKyz+/eSsFUUqBB5gysG\");\n        a(\"dhNB+6rFuP7aJF20pc0zlNZ/0+pFscl5qSttJAruWjHzi+5ZEgwNhl8JIkhmt/tGNW0YKluH6Zptf6nUVJzOF6fppHFn/waVFv\");\n        a(\"LOC+oPFPH6kjFbljFFfIvW6h5lEQJ44DxCXmR8BGXgzVhKg6nq/VfsBGhxy/id7SvrbxKn6im7w75JKcCTAqgxGKekx7CNwcVL\");\n        a(\"cER0byQipK4xT/b95r6Dg2eNZ77aW4YG1GB+xZZ782Qvw3gCgg0iot48Sl0Ai9xvPm3ehUj35bpSsMDkWX1UGGMxGB9iFyy/sV\");\n        a(\"CPgLSagDMuqr/hTWj3b/n9kUhPP7H9+b2+i/zi8vUWIfBi2fNLEZ3lQWcY6Lp9+W/4aL9yoFZ4lt9q3/1xbgfz75XjRR6wCY4g\");\n        a(\"RCjaYwAP/J3hcX1YpaUqF95DK3M2GDIF+g3f2Cvp/V8n7mw3fgkjuTXn5QNO9x+Ndni/Y9Yu/YbeADtll+JxOFcCCG2CSH59K6\");\n        a(\"pRyLVEwm2Bnq5yCYGkR+S0RPdv3O6YFgvSxxlg8RfcNCUQe09nDrflpe7KF7iEvugvZCcQTjJXtYwd2wUoCjIFfvEMc7oQLpSy\");\n        a(\"ta/3e6O7YZ+HXdiW7TPyBzGvKjc0t0mHqWGsoBXEYFXtqZ0D+mX5Cd/yn8oosfRsPmQgNWYEDcZazYj4RERHwAosR4T7r8FRA/\");\n        a(\"4WRR8lI8YTWgJfMRmZnxvlviVHp3dv/xmCGTf8f+/k449rHBrE2wgScBCcQSengIFZYFUZGE8zoMl/TSVTlYj7bG2DkaU/aKbB\");\n        a(\"/Tce4XAlRjJw551CDqcAPBy+yv/h7v7MulLPZa8lmb/XLUUje1+T0cS6FMzWJfdz9rs9V2RTuqdSwmgy2SB0M16QahMb1oKWAK\");\n        a(\"e6dQn0KyWGg47QswiH3LMPIP2gp8f4i9Ve3ld0hX59QD/b/HmzOZsvbadnIJIpvEPpuyWHvhBd3woc1qH+3BNK1tso4YeymWaq\");\n        a(\"ZHmE11exvpik2FfbN0MDYhk4/IpZe4zE3maSdiBDMXUW2eZ8xQmmgc2SbRXrv6QEKjCByr1QOLZIncsV0u3U0BMMGXZibC5H8x\");\n        a(\"gB8NmeVUZUReOqRtyntGj/AY8bQBTzU6Q6xgGmgK4XtrLjVxniTOzp9vfPvP/KmLUZfBoj1uSbjrGfhCR/h74LL3ZNTB7EHSJ1\");\n        a(\"1g47yqJegQPwSBgru/whXV9ws1kfpJ1wsnZ+deJ/+aHr7Mwd52YI/UHMltQRM2txFl6fdke9WDD9eGY8MoXTb5eMunbfx543ts\");\n        a(\"h/8EFysU+4qyG5D5dPnaAfjn63IInPpFYPIt65ZVwES3qlCvcQgpkXfXCOmx5zRuecomUwUClxXYKy1B7WkriIKrkUyGfkmXnw\");\n        a(\"7MoFOd+si0p01sZunKrAbtMaAlFrDjK2zPCDWozcSuQ5iWCqUHFiKUr6ZNJ+E0r8fKd3lnNwt/D+bE7FMpv1tbMJMYvlIRdnF+\");\n        a(\"k9qAhSHjltY8SGoCMqhoW4ywDDbgKbXzqAeCl9iopG/kjsHhpYSh9jzEqIBaXjtiUf8O/MJMDhFlCYsRw7FqvbVTXv1vRfMQdN\");\n        a(\"g1oQjONrEm29FAwz8vAtMRp2cIAU16kx0KizthrofwFtm2GpR0T9FHW/2RnBnxwE0mWi2fAVpF95A7dszF7sy6aJYH7pb2Wx06\");\n        a(\"+bsvKMVjXUXR1GtZ6XV4codOQ38ar5jH6xYOnFUiA45HZKT5h1vzsNLJ8r+/Q8Es4DIPfKZd+RytDQHcnoefpGPhRu0v413BeJ\");\n        a(\"fRMEtXxi4aSQivbxRGnZ1zeDW0K+eN9b2LdnhpHq6/6mYzvmO1O0LZwN/ecku8xRa/bdtizf3g/Wft+8EvU9e5HxiqfqJQ9QfV\");\n        a(\"Gqp+mu7KzvI5UtQiK33xW/asdI41K830GGM/+E/56cG5Zn56w9r/l59+c66DzOvWnw1fGfpTOAekPOtM5WnEMFY+atOdsxZn1Z\");\n        a(\"2HL8+iO7Pryw1cY+jLO//Ipi9PftSmL/sXZdOX4z+36csPlmXRlw79ZZqTIPo06BKhs4SHa+qbi7B1ZNtOs41n1WM+7O0OLWgO\");\n        a(\"uqVt0LHHGy8KCYq5kOAL1s009py1jl3emW+328BEJJ+u9m+jKF2O0P3RUl0vz6aHP4gaJxtPKLG1aAeSIPAJfR89QPavotTzfv\");\n        a(\"Gy7QmR7XJE3nkTeHf0wRh3KeyQUIxmqtU/hUGp8sp4F0ICF29IcW1BL9kBramJ7pEZbrkrS2sYS789yQ4Awif6NjWIB8l6wU69\");\n        a(\"MBszA9yOAWwNX0HDbPDvw3NBPjMz7LSPdgQ7/uf8T8iS/oGPDKGyJn1aAxQZeuFXIVF2Pm97yCZnqYVuiXw9dEC+hZyrdPmJ/W\");\n        a(\"6RjzG1twgQuuiLBHly/FhXAnLBc/yFA7yvPAHKoUpQrvqMaBAvOYb8nzlP67ZXcXpdORvH/riTvj8KCbEGVhxb4zdznVujPf7X\");\n        a(\"l9EGqzgO8Qfrwxp9i5T/pM7uIVLrhq9wEK5ssdH398BbqmA5ePxERD7P2wC1bZO9V96CTiAKnngvV43vLuRNtcVD3Ymhs/X9c9\");\n        a(\"lqIyTqtjryrQHrA7F7plrzENNKlto8URRTgRDgUeygILsIlDY9DvISO46sNiKlbnnpt7J7l3CvR0xLxErRph9txLbxD/YmIjns\");\n        a(\"FUwLJzJ0iexuCaN6eS69iKHqYkPi/spjIpJKkM7iBjVKbASMaVeN2et1UkGQpgDhRIrv51ZQi6GhPDA23dFah6YsC035Q+nt1Z\");\n        a(\"1j7+yX89BmhCsOGmmiR1UUTL+6YuPGzsH2wfZoTaB9BCWEdDxyeXhabJNzFRSq0o0S+zJZnvUxfUVm6DEM2Ng5QN9aKac8More\");\n        a(\"lg5eNjgKqJ39FBzs7Kbhtf3im4AwScQG374gX3wsJqHEL0qjvtp1Xh0+VqXnsxUsG9piKSMVBVdvMqmh84uG9m/bcfSiPZofvm\");\n        a(\"ywQYoUhGJ9nDsP+j+5cAl+A6/T1hLkPJTLe7kLKBGoyC78109/vbPbMLi4ynPpV5d/Iq5yvFcuxNXQIpeEseqJlq/jMsE4hKep\");\n        a(\"m0wCYDp+uqxr0COfsEyJfZ55ddQkF97VSzJeBguTeKN0rG3zXtViDAX8Mt+hsI3nFeOVZB3PhIVBba9znOCQRM6XpAu2xMUoqH\");\n        a(\"D+RFxI/YB3+WpAp9df4uaq76UMQuHEEJ78DZ98AXP8OvApyYbPutF1/x1dSXLhQ6mEWNonXVAgkErur1z2A72R40ekg/5fL9gh\");\n        a(\"GEvKXcki+bJumo3Be/T4skE6X09vlksSBk2OD7m6wYGUy83MEaJxgTcU+yk8PbY9d8R80Sro/+WCwpD/U+9Va8isQB5bjpVVDD\");\n        a(\"2Zgz66XBzMcjGxsXNF+4r26DYsF+N0tv9QwQm8YssNy8Cxpgys732xb+mKy1Yw//cx/8+nYTRsg24qvkdBsYX/ZfD/6jH4/2Di\");\n        a(\"/4mdn6F7+5/t0aJw7LPwZSvs/L/Uxv+oWf8TXN2FwQEK/M9//fhr8D9d5Yn3aHmLuAL/X0H832nyf4vg/4N5GUsm4mAT8f/irq\");\n        a(\"+wyIuV2LuZV8GJLrzjFV4cLBzCG8H/tTb+30nwv208rxivJOt4JiwManud4wQ3Nv+/bOX/x638f7f0d3zyBczx68CnJBs+60bX\");\n        a(\"7UB3TP73ElMlC238mw/+pcfgW2bZ49BF4TwcYtsq/qfv+GQtoHPaS+v9+i/jSYaBJAw4z+/pNEcQovRMRATE9srD9iIHYi9CQT\");\n        a(\"JUYdNfZJCElY3kUDyvGIFHsnsygag1fW7ky7Hv0Z6+ETqmeciISKtwfLrzN90W2skZh7LUP7fX9tXRpjb7QbZK8j5AgQ3hM04d\");\n        a(\"1w8HMd0HXzQJgOXv4w547HJ2joTAY/NJ3PoBs/WjeuuuJKE3B3faVSdyo3az0RW2IdvEkJPFkFViyAPN1ofZhjyAhtwVQ2pP3W\");\n        a(\"+4yN9JuF9SZXORTf98g7TTcbS//2N07Pd5n3JMMm/Fu266e0zcnfEe3639ie/eE++8Kb5bJO7WF3f7oqU5KhmXebIaGO7WDx7Y\");\n        a(\"ATr5qSUFnhoWPCWi2udlZM4txy9C5qoeuRTtwfvssYKeSuJ9etlaR0Zg+GF2vndGwRFO34Dz47vmwO8qkyIbyuo+BfyRRnU6wh\");\n        a(\"0+8kWmbiZMx3N2MAK4gmuAjRrVy0Mc+PYB32Ga3M6AGz88BWQJsXEOxHaoJBmll62FZLD98BARXkVXsx7Dnqsmu+8W0El37paP\");\n        a(\"sl9oD8KMXb96K0h4D0j4MFyYp+HCoHY1Oi/In7kIDXChdhOyayENB1KoVLFlgnbkvQbGiwnjS7dhesPDAOXghbiQ8szhs3Qqvj\");\n        a(\"uuTpU7LgEZC3FXFlQrk25KrHN1pQ9HNFAfGz/e11T9R6YWMnosvaQr6AJQlnKGXAIzZzuu9UvpBVvfgLPpFF0l9sf8juFxEfzx\");\n        a(\"4ZSN+O5NXPbRMEFVCoIkhVRCH3jRNZSA/GaGF3W3RLFHqfK6kGBlaiE7NLgh4hsbpHXQHLvZ15gsBsngU6bjQ4VcPqLDQcCIW6\");\n        a(\"szCxhIja9lffGgoUBkSHuS+WLq1fAiMPsmKskRCM8khAG8gCqRCu4h/dtYkYJL1zqJGqC/D57bBKqJQsaVC55W3EexACJCjRw/\");\n        a(\"Jg3XsnlnubeHZIbWA/ocepRpbBkhB3l7bREKWpHjbFuGdhkqzIGZwvajgTJUrD4P7+xDXWQxjPia8VH7lj6pddOg/6S+1g21GX\");\n        a(\"fbmeGsrUiuDKJdMSn7gK0zCO2pVj4QfQSOJhnFGlbND8anuQjzNzbG+IInqL51W1gQTwGulcxYRIDI8cZvxotMSw9a8qagBhgP\");\n        a(\"ATIeMMAF0VtHB+Bgq4gmROdL7hWspjhYzU97BzE52I1ahzDgNB/OxDjQV6r6qIqBOLFtoq6bBHOBnRKgZ7+r9XDCWrCeS4QJmq\");\n        a(\"cba0n2mlhPFM0C0MfW9WQgcZmA9UNNpQnMBKwl1pfqfTk0s5PRgRg8lsO3dJpbsLANdqCA1g96QYVeUKEXVOgFFXpBhV5ANe86\");\n        a(\"ziMv0urvZHbwvjhu66k5ErhCO3pLY8dxxC/hP0+g7QsWaBH6aM/xJ4ciuUgU5lQbn2G160/xRUbqWgE9TL1auFe0XFtwh8GJy4\");\n        a(\"gTv96C66MM1Zk9P1eOYdh/ltKQQKHKwwkjZOGItwJiFzcFjXQE/x6vK6KQpOpBowSDWM8KIpywxuwc+xlWIgaOgm0dLaclohI9\");\n        a(\"QEwfeAoxC8t0S0qKzAJsHCIg3qBfrKL+oh4/wxKJFUZCfwKZ6JSoykW8KaWVtr6deVxCUy+g/Mh6WCZ66gygO+f3R+t6bDW504\");\n        a(\"mEUf/nxXPMWzyfeU7CmKCDfl7MhvMxOuxsFkXyAP37uOrhM5uQlorvjU8FYu4dF02GzkaIJaTKPsW1FPEn+CckP/MqAxBXOlCO\");\n        a(\"U3IX+7DXBNWAL6RKtNdgL+vifA5ezZSij3Tb49FqqQgPTd8qkwwQWXByLCfjLeSf9tcLma8nIWI/U4qM0yOmB2IBxPz3l9X9Gg\");\n        a(\"jKdO3d8aJgD4ztV90nI/CAU7o7BV6j1dLPPyxwoeQWH++GIdvoLoEMe/T79MHu3Eb/yrblVDfFMSNrhMbJv9r8XK5n0L6rMPPH\");\n        a(\"2eO/Qyea/95HUD2/MoTlqg+oHtT3n5J+M83zwEmD2DBhoahBTy7N77xeUdo1TjxHMNhTktwq4F974QfMi5f6eFvf24fVpC8nC7\");\n        a(\"0VvQvnKhFcskdW/zE+PXQqo9hg4LdPBj9Bu4SFbkpNs6ckOgl3Aq9G4Kt/ZFWLz0H4sRL4oergwrfXhefNqDt3IpnlvBoXaMEB\");\n        a(\"D7TD+7ryerTgAF9Q3WKomXyVkIpPndH2cIQSjxYhWtskQY/GuqHB5Tct+hv0hWpGEL9I26hHEBYIecRg8V19yVrSDWQJFFFE0f\");\n        a(\"tiQxEZof41OI+tgDMxiSIFPJGZhSgz9F7RzDG4P4KxVPZzTiiakNotIoYdcCrdZvvesdowQVBxn/sNc1+8V5UJ2vELGW3vjbZv\");\n        a(\"ZJPKq0pukNBFD8MbdBaSl0ex46/wBx27q81KvezxxnlMbzl2cEWlmsOfSdXJvfNQm/BX1dbJIeQj1lPibQUBNZ/aTE3mAxxdoO\");\n        a(\"3UkxHZAfXr3mC+oW3zhB5iFLyrrinLj26u3wfVM/JhoEJuCEQlguzBmJbuS/oT2DoXKR2tNB9FnW5SvAeM6b3iEgzLPVhE9S0h\");\n        a(\"0Z6p4miwroB9fjC757F5Lj4TLMdurKjEr70E8e17afgbuQVN+x7hz2Des2jeGwbgtETW55nPrqhGIyJEsggE0O9V8YMvGRAZ9m\");\n        a(\"cyhC10wAmjfKH1noYFCT6stBNkjkBOFcgZZGkIE11eGpsuRwBOppcMJGiUDHX+ou1a4KKssvgMMDoIOOODQtMaFQ1MDCoNQmpG\");\n        a(\"wQaFwtXssWvauo6WbRrMoG2K4mAxflJTmWuvrX202267ZZkJPQVKqLby0cOsLSWrD2czMsO3s/9z7jffnRlG2Mdv/RVzz73nnv\");\n        a(\"s6332ce+45G6h32CwcIsM7KFIf+OJAjlOpsjtJbwPn3Y6+ROE46zulEAFRtlOWjT01nfvflscdxZgf5xmHrV0C9owJisGBY9Yo\");\n        a(\"gGZUhez/o7OVRAdeSvXDypGAGOAgR/xGIzGnvJ+Q56sWiH3E08QMFlHsZK6HYR7a8SqTbZjqx5LPjFL8sdTUIJKgC+jPDRzl06\");\n        a(\"LS2n8txpIbYMRX17t9NXeMgNEmiipnPuc4LE/G7RwNTqOeUEqgPYrvIVDmVGYiPT4sXU8EkUA25e+abRDT7YJOdQJbwWJN9DVE\");\n        a(\"bP1ovnZJ2TEWTjbWnuaTM7r3PMcLxsAMTQlpJPP1m8U+TVGY7RM4at8Aal+HUmSDyZFyHPPPC7xfVLPffS6i0I+0s47HztriVP\");\n        a(\"Bfb7HVQt0g8+yqktNd/ZBHq8es6HoM6a4eFxV7lxuYu4sMIQ4jGymR1UsOr153dZPyk5lnkq/EXq9XRqzXZcVKrxKshHjPsmyG\");\n        a(\"tqYYxHq9cGtGad0vesEKxYR0rjeEdbLe50VEmxH9FvXJJydpyDw5fqzlK7Z0s0a6k3jHY1m9BGXGXtZj17/mjPW/Lnb9aYVL01\");\n        a(\"a4tLAWDItMkG34ETsypIs2bPp32lBxxjZEjlfejgiHTFgaI9+bSe1yPosoZlYWV1+APimHNIXVX+BZja4zjjKi/L/wELgTIMk3\");\n        a(\"1cfZDSt15uB0clKiXrRe8kys/ThrjXz7IOzZbMMkfh7AZPU0QDLd0i+k+cQ78jnoH19HLA2Gnvf3LZPMhNYyKZl+hLRWhZS3h3\");\n        a(\"1/1/0FzqjqF+tkk6LSvUvNGGYhBFuQKl31iP6afJhKxA0zqeZwvSLSIQ0thNBTczT055fjQ46G/ogg2EGWqeMPlPh3SPxKxgcz\");\n        a(\"FezKJCW2kYSC3YfTVqjYh4hDvTmYugWJDZ/wfnMAqgr0wgyge5JF5O6BOMfAcljKFYhVbxkgWyP7WzHd/5ZegyMv6TU4jKBTSU\");\n        a(\"P3ghrrro1G/sC13jvTDB4Tlkiwdidyz5C5G2TuFzn3dMzwVrA9VJuScTSxqS1w2q3Zn5gwiGSWpvvOjxPdH8kXsn8Ot+r0r5f0\");\n        a(\"ZxL9FkYEznaJM1LiDJc4stkx5Ml0h//599EMwekkVEujtp++N2Y6OzwqmJPBirV0RE69BuHI82RXfHsY/rh/A98Whp/aLb6j/m\");\n        a(\"QQ/1Jfb4g3xOLvYOrm6JSo9Loe0mf1kL68h/R5XdJjv3feJe9vusqv6e5GXtwQ/jN7dOX0YKqxQXsG/JS4RpGqvDH615LR+IPl\");\n        a(\"hlbu3CfqZeW0dHoNQ4n4AcIKiRBqb33s9sTOf2WX/Ju39DAePaQv7yF9dQ/pv+whfSTSD1lukEetqHRTD/l/fLH79He7pEfLFz\");\n        a(\"CeI+Ngoz9eShei0velc7pRpjP9abgHcBjFxrQ5Ap5rN5P8RZ6ra8m7Cs7hfJJaY5iQaFmVjDlvTJ9K2xijOwP/Z+P/GfjfOibO\");\n        a(\"nTvG5DaPibesVlEOW8pr/5rXgtfTKLxH2zeDrlpJHAipwrawuHIt7nmO42MlBLaoHHnnGQjZ8WUG9yDIQYWp8hedxpC+UByScX\");\n        a(\"iaaEZuvs2wPNhr5eWQFC0g/VXSBJlNAaiA9Kc/Q+lPBv25OFDsp3sPyMIpT4D1sRleauaI0aiHgK0MD9bhNIb7ABavaukRU5e9\");\n        a(\"eWz/YM66KWjURDRqAizDzR/i9LbYHN6TxmXpMLDpJ/sLdKVFtwm8ibViCQhuB5IV1gJWRG1mo8bTntwcud+LKtHYCNEbaQu5C0\");\n        a(\"nX9SEYw0OfkUwAVz/0tBAii2WZxUKwrb0v5HuKo/BTs42qhF0616c07/CK/XKjFlt/cwaYJo6Y5mUDM835Y3Da+hPCYBiE3Vfg\");\n        a(\"/wFgnEvBOEnEOA+I85cm6OVtagn8oWgHehufDwC0L5R6K+CRyWgc9DcgpIEWN/NIL41HyiSPkLAGtGaF05qDVY6uDfkMQUzgTk\");\n        a(\"U0xQStPLbAST4WqQYq9ZVl8/ibSHRfguaUURMPA0/7Lm4luBUwmjlnjEkLx+Os+bFoA+uXvYA2tUh4wS7AWyTsfBfwnwSMNtwR\");\n        a(\"3obk00hTRNp//M2Al4WIn3d3yaBHUSw/Rzn9wsu5BLdwgVGiT65TER7MYU5Xe7chIlHo0x0J6cp1ww+9RYddzDyADvpOdNh0/L\");\n        a(\"+Q4F2iw2ZTh70sOuz89p3avJCkHt2ENjeH9dffAW8SMKUv3Qn497H76zO6R7v7v+afrHBatpOSfy7lScKdrTEQ3yUEhov6bthH\");\n        a(\"jghFuOQbhDXeMhyRvBXjPC9lHCGPVOKxxPVQvxTixRW9V7KC/FjtKTTe47a8KeRJ/M7Xp+K7fYOnEpzJbqKnozDTsj/KqJ3812\");\n        a(\"P5cVT+J8f+u/Ib//fy47n9/2X5t5/6N8r3pTy8Md6QQ07boNhxD8LOua2FSuGak+RhpP3cwpzGm9+a5+t9KzmKMLbiBZUvYU3B\");\n        a(\"InTMsr+3mN6Gl7DFCEui9aHzNJlC3Q6pTD5IKiX3JfiawE5jARQpCX7f2942uHXaU932xUbzQ3D3RgsWuasKrnAkwqWJWpjThH\");\n        a(\"ogx8lnoXN88braS3qhro2ICFCEb2BtQZsBddhQTz/h5b2DdL281wD8Z+Wt1cpzY/C4vDtD5d0WR+UpqbdQASk2bC592717yTnV\");\n        a(\"SCJavY9pthHNxB072nNaLzYt2gwk04/Y7bWYHj9PnHBi7m+UoTVI9pqW469RMS3ZEG/IN+UMjTN4zNUnbkfG8hFKyk2IVUsw/x\");\n        a(\"1JnYmgYirbQOT7AO1lGgR/9Qn80PuIJUDK+bTFdAGRE/0DB2p1pmefQbaBG3zbG9WknO2+psa23tVtK2eOeSynybejcZ+F2rDt\");\n        a(\"u5wdvtZGtX9Oq9xHxTqfs7093zb1MvpphDMcm7NeN8E5rNGZ+D2dyVPo7PKQ88gJCPRJWAIwYgrAusyPUXqXKMZiBfoVEk4sVU\");\n        a(\"hMCraOA2pM/RXF9NlL+pnv9j/rZ77bEHRV5+K4dJ5li9W3i1/FqNkrQneymIymm7hfIi9kpT6LenEtkJWhP3sa9JV8Vte9IKfT\");\n        a(\"L/QYOlhw7Z0Qz+cxhoLQc/RVmPEaYQnrMXgLDIPYcXYw9WhanLSZE2v/u810GCjGbaZ/0I+6VErnNP5ARXb9BQ+QMlH+QjMqsJ\");\n        a(\"vP/o1tqMQyKwRSVhmFeztrmp9f8yzZETWE8jz9hwa93449pPdbJ4LVS83PY7H2jARWVYOu07ULSVKn611A6uIJfOy+XpI6d71O\");\n        a(\"6pz1ktQoYF0sSR19MJzUIUDqSJDyAytF0lr1hE5rxRORtL6p12n9DEmS1kxA6if5glZjvU5r2+91Ws0IhtN6RNJ6AkmS1sOA1D\");\n        a(\"rQijhnT2dzDrvxgQUKcD/I7ZflHPyjXk4AQWY7jN2fzoojIcej+KF/GCva4RbcS7Dn1ZUF488mThlO7Ze16a/VpjmQ6awbmgwo\");\n        a(\"YANGYIte2pzH9dJmIQhUEJ1CRC01r3A5n2MCO3BlHEKHoKi3Es+46AFsLlBETJWdd5wf6yizCqjCqb2AIe5k1q7VHURSekGBMN\");\n        a(\"U1bwKTB+qnqRpqMHU7coXh9tNw84DLr2xNzwIXWRaAy9Xfx3HR6yYjip9Etwk0tQ9+8fZkOlYv9TRmYbSpE32JNi2mCw7THgDa\");\n        a(\"ZdIUvkwK2RkH5feQhtsjYUkvAxGvigg25jctldv2Fy2qJaHJIOZG3CPhrWHKfUhQxwAJQ1WNMP3De/PB2lVRBhnbOIM8/Wuq7L\");\n        a(\"RpwIx5PvalPHg/aG+X33Us+e07oscHK+hxCqEz0EGT0EHiJq76ri4iXDlfhbYO6K3rUomb+rLZgEMkCHEiwuUb6hhIXT1uNP8U\");\n        a(\"fElDrJge3ayz0/eSeYmP+YBgBRUxmhfP4L6CFPHYAAwfPbboMqfp5wVt91si3G0hRE3LUC1spZDiFMRhrC8Pyt1zjPkdi8yyO+\");\n        a(\"Sczf5g5YQdiQ/funOoYlM5A3uuO6p5hzuqrudXLxRpugBIQuHJtBf9gvZkUrYZpyPtBse2p8IedDqghKj6QX93S9F+g67uZVat\");\n        a(\"Y6H8XvRB+1KOY3d1u1EFlRX0BlAVvMtV8LFIp/i6D0A2mPrrAfThrAbA0iv09od5hIKan8wNqdMU+b1F+42ob3H/OINyzX7n3C\");\n        a(\"YnvPv2Wrn8A4Mno/o4rfQrbFxuftHuyrPUYVhHEOyoTGq/DaWo/cjmSXQbEYrtbwSMdB6qhTuMYOrZA4TP+u+W6EpNu4gjLdGd\");\n        a(\"Fq0PiqedK3HheQ3N/5v0mS33N+HKxBcBAp/PncTKxJ+hvcA2Sew+SJezcgIgteVSejkBtM+f19G+fCyc6D8AQXURBBVB8AWJ2Y\");\n        a(\"A0SXATILXyUka6VyKtiyB3DyCaJydyHXMFyZsktisCew4X3gHMvgLzUok5IQJzvKB7t6C7V9QiUWL3jcA2E/bcFmDOvIwxv3hO\");\n        a(\"x9z/aDjm54BA9wpBt1bQfU5iv4h02QUbAakPjGektRLpvgiSiiC5384kxwmSN0rsuREkZxFJO0g2fEmM0hn9DrurfE8dvohl8D\");\n        a(\"RqO9WRAOTeJSb+odvC8E094mP/GUwdz3NffAhTyh+zkNCt/LOH9K8GdJ/+YQ/pr/aQvryH9HlnSr82tF9/34n191l9sl/3N32y\");\n        a(\"vw9BZ93GreL6xamQ7q89je3WzbQ1mBD9g/NJbdM+m8jH7l+cRyT5cZL8RUTeJKhDF3sKqP8E1OEU02lTytJ805OVMptvulWxW3\");\n        a(\"3xLZMSiKp+yzdQ/KSJnyHixyZ+0uknetCh92ODt4FbRZIjlwSK1W17YYmVDhjevXuLja3QgC1RijPYhWc77DYmv+XyC5FQv2IY\");\n        a(\"AVWmmfGGw1rqm2LleKseb0W8GfHmAI4nTtgYS4QYsjhva0VjbPvrtPtZGKR5v4qIhPeub2JaIAmSE4S8wrdtVZqOkgYUK1C4/C\");\n        a(\"qbYVmi9+l1QDICJm1O6Iq0wdbVA9sRpx4ItzkRXj401/hV5l6jO8V7l5/yO70jTgcmKAzkm/amxBkqrAIH1npNhr5xhsoU7Mao\");\n        a(\"3hfTw9l+LBuaZIayoUZBltTlPrUVfcVtIJv8E9MwzFBUK7NxH9r0eBsNP+LTAhY+sHBnrHqKWmLvuj8Cz0zLoDENeoaL8fRRHi\");\n        a(\"dEV/sSPBbQFuG9sDgY+DLiPQLuwp97QrM8MsyvtepvYjRwd4l2HQkkIX9lWqDN5c8ha1QxpigSFkPLkzin1NdIznW8xzLKF5TU\");\n        a(\"DQRPNBd7v0zwmK+qGwILrUl+LaI08Z1S3w3I1b9EYxf07znsWhe0SEHbRM0tbpnIjMxK9lPSeLuVCKDEN81GOuVggO3NsC7X3f\");\n        a(\"04lGfE+IqL6tc7WfaiRaNPSPlgJsJtCaRxOtWaAHOTxg66kWUOQhnMdv0l29nAdjbQIL7T+dGms6wF9MygHxozyQ4R80H2p+g3\");\n        a(\"qkOC51wttJcFtMpECsd5zMxfm4z+WvkgO1q+8Bzv9iZRBrNnBNiUDhyZ21C6oGHVxrSdt2Y/SDuKVJ/Y+nzMF6VQECOr//D4dj\");\n        a(\"k53RBzhdKbexJy8fNPwwSEGeI23G/7Lg+UFcOTrDlQ7GIcmkHg4ykvsCSnNO9g+ZhS34WEmch3GL5eAQ4U0yNl7zP8wdDDnPlk\");\n        a(\"XD4F/HGSKJOZA7/ObVEKkrH1UXGmAifgAVEuGxdy4HRnhTmS4pY3xJvnbxWv+KRT+sQZys/m4wMsDmjKakfRQai0n9wMrT4iHk\");\n        a(\"n9gnf49RsB4d0PQvUcSvHWEyGolr7PeClj/oSF/E/9OJyNPOojZg6nU/i8RBy8Cp5CkHVROSEJUFj56p2icDZ0t4h9l8zKgFoT\");\n        a(\"zYeQV0bOh9BzQsi0ACSAkiZQouZDxfsEUwGm92UKGtxJWmSJb4EVLlKsBg4/TVF+1Ohmqmo6msDtv8IoX97nOk3sdwza1ro5rk\");\n        a(\"43nIwqpCCozjkiq07aniiG4hmx/TbdaUi+aYs5zrAEHJryDAJqpp7NXYJV8WHEcRZ/oCCUYT1lGI4MdZThaKee4RxkuCOUIZAi\");\n        a(\"bgp3i3RU3zNGxGzTc3gGryzY8msMgLs3bOA+hsY1vEN1f+EQMNDVof7oqd+ov3gAvbxSs8jfiLHRluz8PpXgbIIxBtwKUDKw/i\");\n        a(\"EtQijFZmDyncWNX5sYoSSzA4ZJKzUdmnTUx1Gfi+DUugkZ4H7ha0XqZUGFz/u2kdTj6cFp4tsoqZSmqhlE6RBMa5b3u6ouObvE\");\n        a(\"58Tn5UB9WwOwP5D8A0WUku0viqU5YMIPXi8vltUv008tczNbmKx+GcOHfwm86omxNOKH9Yo4j4HDgeupPUH8K65bnou6iu7wHs\");\n        a(\"ilWRPVxM0RPc/QFqjrzDQRVTfRfIhWcUfwIxJnGl9ImRlw2FC3OBCTt4g93wdgrGmeajxoAl98/6S+2f5Ikw210A6rYDugEiX9\");\n        a(\"CFn2GMnKdfCqV+r7qjjzTXxGeKdwdbG31GD0PssTEtp3BU1K/cUDl/6Co2qEMdr25awjJ2Q4hHXrCb58QLlsBfum0rpb01vh9s\");\n        a(\"JmSTOQxWtzMZDRAQlHnHWikxIsaXGsGxUaYTT47nCmShNMlebMn2KuBA9SBOtVwuGRjWSbPd6XhOZGLNrVJ+jbrUxbWfDcOpqG\");\n        a(\"Vp+DT0Cw3HNszk0xNfxB77ff/E702zbqt3EbANECsgF7TiwETuUuGkL2IxUYH3rnlH+ddclw6lmqqbU4f0a6taI/eoQS3IP8DX\");\n        a(\"2EDIkmMTgg4xfBq99a0kqLwjk4mwh7+6OOh3pR85+JN/BQJNS0CS1QAgxffimaFl8RLRff/oiI2jOB88h8y0yacrwl6Vbc263n\");\n        a(\"vjZOTGMrIE50s9NcSSsvETFLBhSdK+3f0wNl02tG/lBOQ0JnWDIYd4XnO0fS5hldRj114ynmkgAu8U+3ViQh/VJe2jkV98ucGr\");\n        a(\"4MR+1X6lI+IwnttUnEDTMzWGh9P61BxAEiZhWDOJcT4m1AlLQizhtA8RNKElA04Tdo1QtaaQSCFoFAnE+Iw5O6nhai9ovx9OHo\");\n        a(\"u4wMkvtXf8PNz2uFwRfvbcSeR4FkYrcYLZPE1OqbbhbmV7Drc/qGNDozG3YjnrdQK87nn+VJgieHwiE62zGbcRhMlqTZ/v4YHd\");\n        a(\"d1+xnbvp9Shd3PN9iu32h29yVKB3iBPRn4KZ8NvDdZT/GrQpOYjhzadISKTdP3mACm2GiuNKtrO/kUrW3SkmGzJtnTWx2F2iE9\");\n        a(\"82VqR0zrLLHrV1dB5s8xNZC+oBnfVOAa/jZM436rf4ODHw+fuwYCwvxA5VA2pRdqQfqiddNVmn5OcePeYCvpBJcK+Mz1kfwWGC\");\n        a(\"bk85uIoTCc4AcvB0Wfx4MSVkKxAfpEZzKZX08027M7A6PQDnDSUBI/bTALSbUfEwXiEinuDcTZXzTaa6X+4pnqw0wpTn71sj4D\");\n        a(\"RH3qo+oj+V1Lw1kGZT5IUiurVo8Noh7VFDfBHEs/CuzJ9pIS/erU07EtIcnzDoawCQsdzKHytw0bR81iEkDQHPv8r24WVv9oiA\");\n        a(\"dRlTZTlXRruS0uPpd0KbPLfheWIoqy9wt196Wox1Hek1+KgFaD6uM0M1nuTjMCqJtyPh/98hotd5OKBRT+24OkSHOc52TCtiK6\");\n        a(\"Igk0278Wcfzt1GEurLsOluu/ROYTSwbAXBUCuyv6EIVXNb0LU/VvdHGG61FdnAE5F82GVMeSusVqcX6l2bLax3lgmqwEH+SxQ6\");\n        a(\"xMnVKsHcPA6qCX90UF7nHuEnKQ4yWZB6JXQmdoJcQ+EbWq6Ie5ncj9ik358xsCkb0k8zuncWlE3kQ9L1pQWBtDpTy2fJb44lxp\");\n        a(\"fZcUNi6AOCGkkLRCmsFCRXawsaZ4fhqnvTm8nF9beG6gjE2nuJ5wcWuLQ6cPDBmKdNqced9XmEEhEE8zVN77TsuVx1QvU9tGHW\");\n        a(\"wRjyNw1aA+dhPmR4Dsj4vfpiqRlvUFv7mqCxofpjpWjQDj1yKoxpswBNWmvyBspC+1giLHmrSx3PyoPv88jAS+V6PhHLoOkOb/\");\n        a(\"RKUJeggMJwL/w5NGRHs3REqYZPktJgeXD9QbJOkrIkjnRZFunMukfyVJ03qIO3wd43FgyOKkfAXN3fkQFbeiDCW3IMhN9COgvh\");\n        a(\"PPtfjgESnffihCvg0IPjzULw/yVVpF0Chk+gsR0O0RNnfhD1i67HccjpEL3gFvjDAaEPo7QoMQov6cJ4ub8lB4owsBobojuLpV\");\n        a(\"Q1GBA6S2MC9eTFWzsBGi36/w6yft8YzQPkupModm/xRtStwIa+sB3HCPOu30naZ3VXs0xmzBaZf/UVH1GyjOck8V91aqgsMQZf\");\n        a(\"7hW52/Lib9+g0UPTkNXWBGkN9Bm4KMu9iKfhBHIUCmA4iEb5zqrNnAM1IJM0UJ65rRmiHUmo/B4OSXGnAywfMBg4Zk1Jjybfh8\");\n        a(\"VwtO8Sj8zccntmDqkwj41bN3IOlQFg9k0sP6rPNErT7rPFYrbpO5abl2+m2m+4+HdOQHJLK/lpqVpmbfiMIY70WJt1DiLSC8C9\");\n        a(\"KQvl6m58v0XEEH7wvQSKZzm8QbUanj2RD0pXWZ2iX/osXNoMV89zICdJf0gOiJT09q/LgLAYr/6Rf8lSTIkho88j0BguLYhaxL\");\n        a(\"USvWr1i8IVJfG65V8d+OFpxiRBXo2SZdRb6ENZpuL3qHPuvcZv3+EF5ES5RrclnUQs89g6m3gxHk7VakvN3z6x70qXtIn9dD+q\");\n        a(\"we0ot6SM/qIT21h/RT62OmR9gT3mTEIExar41rPgK1zX58FunY1o0E1DBCXB0AK5WxkoKpKYyFca7dLb+WGOU/ub4Hffge0j09\");\n        a(\"pM/qIb2oh/SsHtJTe0g/9WD36V/1kP7ugz3py7P/dV7Slel4InQJMsDHbjIv5wdi2IdWht5xF7TD8qHotGxwTif0KUj0W9gMka\");\n        a(\"WZ7dPnHVlxoIsdbpkfJY4Vdo4UM+q3jndJgCBmM5MNyLmTzNoevuH6YFCvyvsRBCPq0776jPW568z1kfMtP4EpWUfyS96NDt1I\");\n        a(\"4aePyjVWvKdTUrYgwWc2pj6L39j2xdXDZcEgT4FTjxoN1blE25PU0AYM9Y4vhJwhBymo20tloYXHM15J/RlINtgJreknenwfkd\");\n        a(\"EuprpjRygfbacWAQV9iCn+wbKY1nil/tYbR/RqDFHPJtJK6kbE+eKwKF3L9qdPS38RXfW/avT8bitAD9dB/Xwa8vD6DrjFQMmS\");\n        a(\"QJS+ibrvatL/A3KuyNwIGCNNDRymvnGa2zZUJP1RJDWQ/EltpxHAfvI5RJJaYkK+HES9fvs79fqNof1YJ9O5EVlYtkSPtaqnaf\");\n        a(\"IdToOUJXtaLP0awFuFdyftnTEYkRYDBKwUyKb17359tZm6SF9tnAiSaaYkEpFlqznMORic2jZNKZriM9Q/z9SKtaP+PfuDkU6d\");\n        a(\"3i1U5mHR8eSqo9BbLaZXOozc5Q1p7E+CSvHlsp+bReLbudbaUnRSjGLRSW5EoQ8dh2v5VGSDsWmq3WXMf804gCexPdl9zFNK0U\");\n        a(\"mHr5dvdw/uTri/eHQnobWk344e72J/BkvoQJRyxvdnw95SE3pIP3x1t+niEesXV/PxordaWRoM0htamSOa3iVXdUMPp5x42GQB\");\n        a(\"2mOy2Mj867qvj1rTXbo6uTQqtau/QU13qKVot8GqqwftheYQlIlaiv4prDPXle6GPuYPRoOjvhciwNOPlqDlvdRrWqTuzhnkoW\");\n        a(\"zrufo0Twkp6v6rmAtw8g2kOnwd2TsbDAlgqn+IaJwSxd1QMPXpe+MN9Na8DyD4d4v2MRPln+O3PdpTjDKniPuUXHXJVcKWPOuj\");\n        a(\"8X0dvVHNRskG92BEMu2f/05oPwHjfNbqE4/37uxiA7Gb94JVq/6r+n1cyvU7B1XBWYwpzfitXps8rb4r76H69hGNqEFkT/WT/P\");\n        a(\"FibP6Q7697SF//P6a7Snt47x/mM7SwlvzNNbARuap/8D1ThNVw8pEKH04BC6LIwuXIzCpytL3Pbg46YLEByvUkg3Ec2W03d1oe\");\n        a(\"bKpuI/DIHmKvFSUsFaJLPZ816mVXV32SJHX2FHFaPPsf4ZNQ7PexWB2yS2QrY6XbZHr0+q49nk+CCa9fTeWn/MOz6FzqHpC1in\");\n        a(\"7SskgS6R4UOB98+VocG7Hy53QGbCwwhx2L1/ipxntOTJqwEJUoYODGfM+M7gOf5ezEPHrrVFmnsPEq7n48Z07tPn1U9+kvsfOV\");\n        a(\"+6ZIpKj8lV2SosYH7xmUeIJZr1kE2b4mu7EyrUcMoGePMeQX0D4BrRHQDwKqEZDpOENVAvq1SFspoEEi7RYBXSCgWwVUICCXgK\");\n        a(\"4W0BwB3SSgGwQ0/QRDMwT0lYCuEtC1JxlyCuhmAU0U0J0CmiCgOgGNF9DjAsoW0HM/MjRaQLs6GUoX0GaRdq6Azj7CUJqA7hBU\");\n        a(\"+gvohICSBTT0FEO9BHShgAwCcgjo+BqGfi+gwwLaLKCDAmoRkCqgTwTUJqCAgD4T0CkBfcRQyuuQTqh9DoFXir7Xtr+3+vSd0j\");\n        a(\"CXvlM6F0EIHGajlci2HQ8f1IrJfLFAuJCvpv6d4r7gOFMuaIQ+Z2wnSXmowL2GDwwNvcSZkRTNJD+GbOe+fgfqs2ay5M0u/vke\");\n        a(\"6eG9+NuR78UPAj/cOO+NVEDmZOmB9jHdA602uWv12UnoqRcSep+I+nC68PmhdhTJlCh9caSYt2K2lMmx37+vi9ke6CM/Ifw7qv\");\n        a(\"yzuYN/3tMbpxYVspd6IiKUxw//msS62O1Suu70USkSjvd4Kqruz88DWgstr8PnegNtU9RSVBRyZniEFO/rQaUEmZgm1JdJs0S9\");\n        a(\"HpWE9jKFdbtnD16rLY9jeHkU9VS4njHs/aLnBwaM0C8+1Z2/mO1ifaKFofM6cdQIiXgcvpPwGW1ZW8nWroP4J94VD4Brd5eSMN\");\n        a(\"EFN5sVM0ZS1Sy/N2V8YzRUTLbXdHrGCSN7nix2SLGjTWjgt35IDbpS81kgnnwmTJV+EzS6LQkTf2agR8oPYJ4/0521Mz+l/Wsj\");\n        a(\"VKwQ6KBAIgJHEJAmns6g39oU5M2veHeqzpjEtrGS1YUT6bmV+gGOfGd+n9UKAoW+bXr/lJD6PbaBbJ9vIlPqpw4TlNaAUvs1QM\");\n        a(\"p3p2dY7pmKEO2+2XnJ5w5eCy/L/lSdiwoUbMQesjw96zn8VA7KunA0oLNgSqoyJav3+wj3QXiJyb/J6CI5UIIPBEnbX4japP3F\");\n        a(\"1sh6qQtEjQaq9zqoRt5jv3Sb1R+m8R5Q5g9bH5E9XWRHwNEQJ7bKDmoPCBfwFvgs1SEqn6LmMln1t6AYbscw0j/jU9qT3Vz0W2\");\n        a(\"Ht+74OKAUZoU8wHUg4MhZsxIOhZcOy6Mc9Ee1clupV41aw/WUnvQYa6/KL9/Om4hp9ivy8XJ8iPy1nCa7L0H7MSFt9BU2y1x4n\");\n        a(\"jstVzwLjk37ufiOpJ2NvAPH779ogfB5pheAdulIz1qTeD7h2e3qHOxnm8G2QSx8H45qFSf3AJchwO2fIRoZsTuBdyjlIuI4T7E\");\n        a(\"iwGzx9ChVTC8rhvYl3b/yyAuojtgdGf0YEssjGznNo5ktsReBcF8HPa7A90JfhTRq8lfrJSrJsUZypXtyKoFGu6jzSx1gIWJlq\");\n        a(\"rj5GJC1rTwKsbqewm/QlLGsDiECgajD+uEe2f8bZUzZ/ST2R1P4uT9USflWDnxSwqBm1JfT+GaxhTxNTHE6gYs5z0kCHz320sy\");\n        a(\"NOIfazc2VVt50vt6q/NhjpjlXztTIIulqDUZSbx3klRkkr0a8hJALhGLrXM0DdeTlzWf7VjER8UpKPMXaniAJ2QcYfmieuE7NE\");\n        a(\"l/1u8ASzwVNtzAbd67MXsmWp6dmU70+0Z5iLI86kDKemHh3KLOmz/Z1CZLOFsm0/IbLlT7K5R6Bcf7W0n7NY2s9ZzIw7DySjaE\");\n        a(\"feb9NHQuO6bEwW/QiesuIjcQ+g/TF9TbBl+JrRit8c/Brxm0nfyyBZ7DNS+PI0guJ7WS2KnL4UMxLmsKLst9TJaDBwXuclZ1IZ\");\n        a(\"KsZjXH0nM64nhfZfIs0eKAbQqQEo7emVeml2WVoBgvxg1DOYembycT4Q9kXKyyKrE2Mnd/IxxoMu8UDaoO65kgfxy708iBorsK\");\n        a(\"6IkfXrluFDAcFsWf9cxfQjsEPf4UC21xcY53e1eJcC2diH+qlOoTBEPQ9b4wziYXg2OBzfo46X0sVHm/Q/DdbVHZ6pqCG5FuOl\");\n        a(\"Wix5mx+kDr1zqbMOJgIa7GITBrqVoKu9f7MhyFzbzfn7dPm/ba8ndNB+Z5n0J4tPR+wa/hhlsSf2e4O9VfpQen6pD2U5gjyUun\");\n        a(\"0N5kyefW5ERBZ9v1W9wZien7j8YBmCPb1JGDLdzt91vmn8F0bMTwgUUMCCQCEFejFSmRxTfA78m0G/fDak+V9W6/Nb5fyPIPh5\");\n        a(\"Pu4WY38/vo/0ZWa4WGYm0TJzFi0z/YT9hGDEOrNvuV5OpSynAkHx3bDvCjxJjq6nS/Eui8cPu3fWfeo9kB8MIopsNbiUcaYbsE\");\n        a(\"V3+TYRIjc6FwUulgWaZIFxCIq31r1Fx8jvJGq8smX+Nxfq+ZsQFJ/eWcK+hVjSXsKwQF51Wm5zuo7/Mjn+kl75Qn3854nx18bY\");\n        a(\"PT00P6Qj8+9l5lyZedxC7r2bDQGSOq+QOAMlTj8EeSQDsBsi2EZWMbb/figX+iBuXUC6zjaoZQbyhcpaNsFwUTClLnkUfNSpv8\");\n        a(\"EqBPWOUuM/S4wLbYK2wLQyZibe3n1YnHdq2dau+Ul94kZaxYx32rrKVqLl98xwTGSpRrolcAX1v6TL5tznfuyoJ+5RH4BIIvO0\");\n        a(\"c24LXhXErJnv47wjqFd0/o+0/NOLabHpdBorbFLcH27fbKnTwHL9YJmca5sjxrvjV/pwrL5ZH45VN+vjfW/0934DIsRqdCG+Jc\");\n        a(\"9VLj+8dGOypHIfuCNOXKcXs+bVnSj+J9wuZ2CK0P+RxZ0lixuAoOAQ4qJZEufQAh3nuwWxvvXY73Wx/kkaz0gaTy/Qm7WODbuG\");\n        a(\"2vRzvU2XUptmuvyWF892zoWX+Kbl/eASwLcns4nUdfqjWdze3ny4QQz50dHa9uQdepmXyTIvRVC2rVrinCVxBsi2yXE803pw8N\");\n        a(\"bu/BVi3JdjaD0q7kc6urgqJP2MpfK92nz5Xm2+3jOjjaTfo1wZ6pvOUN9YalqElVvL6jYEXBGOD33NcKjf13cocw9dkBxgv78w\");\n        a(\"oHsP7T1Jm/apVTwVRvpCrBgfPj9+NYPmx/wtND+6L8ep+W6EdPcO891iTQvJCXqDZ+jYXAqK7KmQyt2J3Rd0qTgXqsaIny8AIo\");\n        a(\"YSyZuQDF7WxuvHJXpPrJFil7td4eO1Q+K4JM5clxwvWlp/Knze4ytF3yvoe2WeXGblfgFYYSxaKUknSdJmV2jmHu3X3v0fczTw\");\n        a(\"pkLz7/wMC3wPcSK+tODJsBfsgm9il9dLlvfIPL28DfN6Ku+9yPLujVme/P4Ka6mwhyr1wsbKwi6Yp3PZBtpaVmlrCAIbQ2vIbJ\");\n        a(\"nz8C/0nN8jKNaHnwMnX+JslzjvIihG7nKXH977qizz66YH6SP96XEe99DDq/wy67LeiA/OtPs5Tsyt9toJcJAx2Wbs5j6eOxMz\");\n        a(\"GvhqrAnSt9tZIpmPHQEqUPOD2DpXnxZfzgJq40GeVszeg3QOvN5P8k6BZmfTn8FU6h+Xj7cPgSJKfyyUHsfpfWU68XDwoLhXAa\");\n        a(\"JbIDppv9rgArLaf2ssv96+1pFB5BYStMa2PonbpbNl+pcjJSY9wXK+gW5PzlbB5NHp/284JN/8xW4jyzeTuso3Wd8Eyd3qE50p\");\n        a(\"XTEWmHAMt6wKAsjiYM0HPPWlWWqaObDIUrNGmwxrHgoFFmuBVaF58q67Qkm/DAXcIuCeT38u46ibQ2krOTDfne9VCyw1t1Dhvz\");\n        a(\"KS97klIXo0yDy/+etb8bfZ5a/PxjdKv29p8Nva78Va/EXab472+7GWnqHBuzX4E+13j/Zr1NKDvP5LZmF+8u4zYmcaxzQhXNoX\");\n        a(\"R9BFISiBoOwQZCbo4hBk1TG9e206jZY4Lu6M7wuhevYRyZB8b5XmBKtzJ5VN3kvPA+1QOEgLDMA94tEdJGJwBVM7EICgeVhnib\");\n        a(\"FT6UVuGlpg06vU8Yr008D+OeAFLKF47hsldWOaHNXLDZTqHuiAAvKUuoHZtIPp/bi4X0VcwlV1E7Jx/0SOO0jPqiT2O8Mu+te6\");\n        a(\"WZucTtzorLopnlOlCt0MCNrqE4wGticwNhhEtbduK4QHVge9v3di1bwfidiGCN9kpkJQwEMDOl2mqy3jMDfHjWXhf/52owEm+t\");\n        a(\"v7AJ3Wtz7S7iIcGlEvwG1ueYeDLVp+x2u3PTtY6jsM9XX4mXWs6TXBWJ4zxlaZCIt5/fjMZa8JurPgkJJkVY6VVcbh7kRE2S3r\");\n        a(\"WgLJRDfQy+VHsp/CRNfzEr1bA79T5X2HqPIfAuBivoYeTe0cthBTooxpap+h+QER5eZp5Q4KXKiVW4AER22RgeyvBUZ1KX8gl4\");\n        a(\"85T6KF1eMvjm1F+D4EiIXmBK2C447N5uLZL1RjWzyE40cQo07cyXKFAKdikBI6UDVpmuYMD8oi7JuyQQ6WgOYvti37GYeU62zz\");\n        a(\"62aavW1HGcSDbf51zkVAlH4Hlf4GxFd6AoYZG35OVlJuQDJF1CU3kq7/p9gniXOwQ9QUCR3OuezyWa3aEe5ZOEo+QPcLOIRuM3\");\n        a(\"3zrpGsoN2H/D6TsguaSEWHCRf2qBBFb6jatJkplf4s5gnpEZpuBvN+UN1yAfrR9P1tfIk1ZTGqP+4yFjGP9gdTnwcNEAziX/sB\");\n        a(\"1t+CjxatBPXbJ1HB9l1EvmDvFHwEML4+ki+wd/uKDre/ZGD638DFoNBlGvoBa7Fe8z4KFnVAj6g3xmMtnIg4lz9kexFIdkJy9w\");\n        a(\"VCCyPkAPaT/tcO1m1aNVroNl2vtoJoALIJb0EWmmBwTxNvT6oXoSG35nFDbKC3/b0QvSVMrxGwX/3pZu5/ddMefHN98afFtP+X\");\n        a(\"2tdsumyn0DBSig5ryiRS/tD+pNh1TycrUyPd6DuYWC0grZGqgfgoBiCmniBnJj+gw066AphTs5F2pIIvD/cuokxNkCypH+bQQX\");\n        a(\"Tc50hA+scifSvStyVYDU5o7yOGiHkuXFmQ9ncjy93qUh8HQlHOWxByvXrKSDPNa2Npj0D2wQmf65eJUkmUabl3WjBCR66rPW7K\");\n        a(\"UzUKdK/U6c4TdF2gC6r5hCHGB1CWgCLXWZACgY9YUFdmR/AdEXQi6A9ysAx5vy8XeaW8Fen1J3CndeKfLKp8IShEfTRdqwelUE\");\n        a(\"PXj+ZO6NfQCTz12gyeKjciDkn1nNS/4UdKmiCSnkScH2l/1dIOU5pNpD1EaXgP+Tbx5GrwMtu/WSjfB8yMeB8ASJ2M7GT/RiIl\");\n        a(\"TA9HOv0TIA0TSLdIpNenhiM1AEKrm46j1aZ/Mu7lEnfE1eG4QwEBdz3hfhJg3P4S9+Mrw3F3AALuLYT7N+C2/yiatO8WPcO2q8\");\n        a(\"IzbAVUgvuQd4yGl2hHq35zmEvYKDOYImoenMIZypBBiJ1eFBlWyAyFEVW6HBAyXKhnWC0yXCUzNE8Lz/AqIGQ4+HYowwyRYajM\");\n        a(\"MPya8AxDACHDu3qGEcggOTOW/s5WIW9yFfpIgYcuPnIJI+LWlyNCq3qRb59ly/vCgI47E5KnuSpOGjB5TPP4AwvZzWDV+K6ECn\");\n        a(\"23pmeErMaGE7kQRBDv8i1VhUKkXJKi9xv6NaULxxSusMvX4SoYbSgvcmWNhmzDlRX3Rnke/hoqL3BlxcP3AYXd5/HfQa4sz+Dy\");\n        a(\"c1xZiTBY4soad165hQ7qSxL9sCkdSGLf0MIvQ+xGv4f6FsJ/420Z1OoOnFXw/lztWEFN7qw6v9Dnpgb25gZGZChABiS4Wuzqxg\");\n        a(\"RxLykX3qj722VCeentlfiN8uU/LMJjv5IU0j/4/DqyX4he1OVGkl65Ru9X/wG9e4jeQ+H0uun/6tPtpzwm6sBeove677uLzg/v\");\n        a(\"u3VLRN+dd+a+MyKDP7rPZPsuqtTb1Uuxn3TuUKllI0TLEPUTRB0Ia9vz18ZjPsiQbYvq/zbPf0bv50Tvl7Hpwb5Af7qfHER/bP\");\n        a(\"jjGUFr7NWjWMsiQPKh6Vq4D8KXpnPYsqVZkoqWv2L+guBcySX99vE5n3qb2X4hokiAekkTaGr6+33J5Io6kFrj3cYmmz0H8r5Y\");\n        a(\"8Z7LT/o6J4S+zgxeYM87zdB2Af1WQG8L6EsBvSGgN0W+8dcwNF/TYxJQ3imGRgvoTgGlC+hbQWUUIHXaSGqlaY+DRBmmffjZmI\");\n        a(\"CAikD7KRfsbyKA9AP4kad8VsUrwzKYGveW0YCgHcGPibhid4Ly37EKdNHvXVnwQTPtdUYrpmXI5T0aVzEAI7YY8idhIvrrbLIy\");\n        a(\"3WI6DrEK/XPR+tfM69/L2vr3C7n+RaxEmwCpf/xKrH8SKaEkYv2bCqRqgXSLRLrQEY6UCUj9mUAqkkijneFI6YDUSwWSTSJ5Cs\");\n        a(\"ORFgFS+wPJ5cf+2g7gSVvU7N9V3wOvlPUPVX0T+KBGgrAMvCN1CHXO1xFL2+dXxJ4nZ6fjeWP7b7m/fNvXlCRkuOCoYqTF4Kjd\");\n        a(\"Wtua3uGobazBfnSMzd1vjNWdMibbPWyM353TTrIirDJbXSN7Q6egl8FhWdfUfi3T1OKTEZ/A8Xxms7y4dfXWY24c7uIwdg7L/U\");\n        a(\"2BC2iOXnnU4hnknAsHrYUJmZor2zR4tDLhJXVgMD27Ti3K3umH/8Gimp3uRO9xi2XtdOxC+JW11CmJtR7iVDTnOCtFscUfGMV+\");\n        a(\"hd3QNdyjPUqiq3+6s90NWB01GueOwvTJRsx+OZ3FLTjXauc+9CCpCKxNz+BLA+FOTr1reOipg7tEro91wtMdz3wE2DQgm4A0Dc\");\n        a(\"goUWqYGKnrK6AnztSFoAizCkhrJUQFuALN6RVRMCL1CkdAGaQwP+uDRqNh+VTMAfmPpm9Hcnki3FlZ7ilF7xTmHVwxEFMF7l7o\");\n        a(\"iEYS7fXPsY1wZWA6FJf01viSmxx0Hm0/m3L5VD8rlkGGpC9o0v4/68dCvWHtt5qSjZH1zJWplwhV/XXY0+qqNdld7p/LMN9Id2\");\n        a(\"185XzRMIp6Id3PfkMfTd+A3xJ01FMMHxdIWadZRYE64wlOX8v4jnr8Ed9+AwlYVM9QTdK7MSHylprirkPh1AJ9PQPpbM24SiN0\");\n        a(\"cUux3fnAJghw8VH6sPX4Vt1zdDHuJ9N0Me5HCGKshLUJfhBipd8MHJKHUCAbKTYK5LawVgo7IpJmYoShpC6NeWqI9rE7m2P4/8\");\n        a(\"Ry+kGp703oKJUolTayU0GmeAqVqmyEc5n5qi8nOpaahcI0Dxe5DY3nCwrImM9Hr7Kx4Fmv07R6NqQgnxzZbSnGIB8KphYjkkj6\");\n        a(\"2fuch2QZlpoHQQLlWcFNLF3Hbu8+rBoOiKw+Xd5LLcpClRuod9Upz7L6JD/i94H7Ksya3twkW6HvziGaMT906bDZepfeVaZ3qR\");\n        a(\"dBZn9SbzGdulHH+bnEmU04vjRqknEN/sRyNdpVPifVJrFd/RhdWOp7T7kywbvX5ZlTfQWJTj2DipW6o9SIJ4UCSGIR7IN5ybY6\");\n        a(\"OwI5hqajnOeM6jzQwft+O3/RCGRwv+MKFgcVB/BLfMdKyb7yuTiuFADmcmyWmpw4bvoo2Szlar1ZtQhqX34ZxoXdtKz+s5FzHJ\");\n        a(\"6l57i5SM/hQpDQ7UASNVSnniSNzSN7LMVNviZy6ZnLBB4VONBD+NaoGVy+/UvawNUwgogJYskBSquOchVQnApXh5lcaKstvYjQ\");\n        a(\"MOsJpMwvxcZ0GmT2oYK6ZILc5RWjISzXD20i1zltsgjv0iF4yH0Hs8c6jlEmDiG56LbVncvmsXV5aq2TO0f8GruWSPIpDUkZ2K\");\n        a(\"SVfklk6R6t9Mf2YdoSyHnbVvzF5Q/rqWOBUDdcqWEvArZL4R6jnU0HvlllLUPqQKisBGbgkxr9CkC3PVQd8tUWCgufbbJjZBgv\");\n        a(\"Jn942aj5cHuLZFAi+BqCWD9BErlh84SXtSiXpd36r91Y7HtfsyBnB7uzZgV7pi2huyS6ujdDkufwfVikuJwO8TVYVo8DWvu5LE\");\n        a(\"sDb+dCEpkQ8hFdNyGuMH+RuTwdf5MrzlWwYhvdJqzqlf3VjfcJL2obasD15PUcOAmWVTtEyGzx0uRHfj1rXkPAoX1zOLvwElvL\");\n        a(\"H96YI/zhJWsOdNtzjJQlrjKP1HDtJWDwW47pDF6o9C7G5hixDhR7uxqyQeJJJbF5YDbLl8keX/xkM1JAB1uSRkFJ+5jVR/hLF4\");\n        a(\"5qgN/1oy6Fr056/6dZG3x6MMvXqADqm8J8m2UV2e9hQV+JuLXTutW3i+8/eB8fux8Tyq+knqmA+1x829SNnvH5sxPK++XPNlck\");\n        a(\"i/GwebJR3nwHamt0+CY7Q931hIGmlWRqW3C7P6w+5Q8AI5fnxLIIRpHnmX/RdiXwURVnfDcX4dxFCARFCQoaBDF4JgZ1Q7K6kQ\");\n        a(\"2NAooWlTY1YuuBklWsIQmGaJY1uPWqtrXiVW3VitaD4pUETKJVDIgaATUq6ksXNaJCuLL9f9/Me/P2vc2GXvx+ZOfN+c3MN9/M\");\n        a(\"fPMdwOl3R/FoIfQGhco809nlq2dB7JXFV9vl7vqggd7g1PdXlu/d8lvV3yjYoyujugWCky406FfX2Qb9+hJBslRw/eF6viEqX5\");\n        a(\"PK9yqCwlLBjnlG+m9U+kpRD9nToPP1rVCHrDl91YvMG0MPv8pg/dhFxZQrifVbiyWpTZ2JEGzib/cRs3kYPrCGr8dV0AFZaxde\");\n        a(\"YrRB8EZE7/+3I/zHG/EnjxQiinbgz2tf4s9pzBlPna0A084yAPsCQeF8YgRgGN+IBrdcIvRRqvkmtQOQm0ccNb3hY9jWmfULMx\");\n        a(\"Pr+5zSZ7rir+MRlPFZG5OprHbL8qMS119ArlLQh+hoWzbpP9GaYNV36Cf9/X7SW/pJ/1PidODFHJBX7ZrPVDa7/arQ4e8QGoXw\");\n        a(\"5rEoWrfL5i892KN7yYdXahhpW58VGR4uxvZCusfLoTFFUSqT24+l2JnXW73erE8p4L0lmmi+lGNuJSnPjl3v7kas9uHNxFGuEz\");\n        a(\"of3h4IzHSn8FmypBscw8XvOHGWlHbPutDpLRc6HWwnG/yPr8mvilf4kfonfQLSuenaBT8YGHEQ7V+YsP0Rpva/0tD+Rf23/8H3\");\n        a(\"RvvKH6fS9o3nvzhhOgBnIULccNnddybCMrOejqufNcmsH++MhnscKiWu/JxqIpnrofd9Fl9Mskazg2q2BKQibebe4srLBnqk1O\");\n        a(\"6yXiTWVA5EgBzsVE3GUD++WQ31L3Ig4eG6gIeaBIlYwlfTloJWhblxbrmbZxIVh1BxzHwvEvpEj/PPK6uFWtEa/PiDjzbyz1Nt\");\n        a(\"/PN8O/+80iFO0jg6lHuD66FAtIs1KEdDybkncliYxZ9qfy18IM9QPpC9iF3aA+lwei/6DuDme3sCm0TciewAcLUYnn2+BtQQSv\");\n        a(\"KLCJzYaXNFV/LaA4Nkc8AjUuA9wut6cX1x2Xs4/qIGMb509r2bpIoiF5pw2AUc1giH765mHEaYnUUAhzWJwxoG9p1/qIE96kvg\");\n        a(\"8D3n6wP7tBzYCVCIC9V1sjCVGLWQGLWQGLWQGLWQGLWQGLUQj5oY+INf711VidZbmQnWG74ArP+c2+96u7xbrXeTfjSQeinrSE\");\n        a(\"Mer8dw4GBDvSlo9bhNqtUucOS1u+ZYUS+pm8+uwR5oBNPuobDQzZICWAtoMYQWQ2gxhBYtwt6J5QVhT0HBiGuapNOQkSou24xX\");\n        a(\"SDTsndSpN5lOh+bg617nDghGVKSCV1L9HkLcF6dpBF8hitU229qXU76lvljF5mA7QQFtk38MlXRqK29MoI9e0k1rhSwBFJCynQ\");\n        a(\"HDQCwLmBzXloWpO95OXktc3Zl/5xiNBfnu4Oc4fCgQzPLkbRgZ40mAeBPSG/g6JlGEQJq4DO8sous52zPEd3z77rBjrl23gDiv\");\n        a(\"UdgRbFTyuab0mxOkA5qyTWxm0mEhrH3Ru9BMtojyNiqFEtxxmKYtbWqaNkwDyo0/zzpNt38tZA8UqnUoghcfvxT8Oy+1i1gp+F\");\n        a(\"ZhvjoxX5ofS7C8CJMHmgXx2xGYgk5MENKaouct5PlCSqdDiE+Fw1iuHXSOoIX9gpM1LGndenlGcXC4CbkoD/WMC1acyW5iKnIp\");\n        a(\"A9XOg1bPKuciZQTa6zCnli7A+wP6rk2twwxSrESKWHnc1dolBX3hY42tfwCK7V/228+7nKqfsnlY/XMT1mpXocFyYHj5REf0+s\");\n        a(\"NcL87tLsI5lD3bfAY8EBXOSI9kUBJH/9QUzVXBMUPUVdfBxt7gBycauIKJpNPQX/U2ou01gwmjP17oBOXnriYjiPTVSG9Hettg\");\n        a(\"QTLX0DvveoVJUz7Fgn+xVMekByUmeSPYOS7vu6GAauh3l/fZ0ABTQ09QQ7NsDW37p1R5mY3F97/Ag5mAXDu61oIHB+1fnxaedu\");\n        a(\"rFABPO+4bR7jpQOdSPo//EhKYUV3CPe53uL0Gl83dmfPus2MGhwkZvcrPRaCZM7Fadg7e4Si+E5yiFIyeBcGxA0lKXKQqi2WF8\");\n        a(\"pvMnfPyWtWiXuaJRkplKLswE5zAT7xnd8aBFD72s81KwTHPC45r8HRQZS+Zx6R2PDeE6yVVDZmQA0RLnuZmqD2Z+uIWm8hgSM5\");\n        a(\"/dXABWENRPMKcG81Nxxs3/+tl/6blvKSxpp7GCkYelc4LthEJNe4AfnybD74WvqScJ/ASMThqp8lXBB2FrVTJcF1BEatTFBu67\");\n        a(\"idSnYdQgUpwWSPOHytIjZ/saQGVDo7Qb7jOMfJ9ILVYRvT22WSHvER8BeZ/xW+ntOI3pLWTr+9jL+8c3tmeIEH5BDI+A/hgh3n\");\n        a(\"BCvCEG4tl07+znfd3YuE8y2gEo6ptl7Gjx90eeOS2b90GyCV+YiRF0Vw1iZGM8SuCvVvm4IpwaAKmkTMfSAfR+Xgh9g7Kv/Mll\");\n        a(\"mf78MnfVaPzNqhoK5ju1thYPqkgPlpH6Zjq36WyGWydiLv1xSDSKlMyC4AG8x9i1eGLpuaatzO/LPkCNOM+vEef5RnGebxPn+X\");\n        a(\"Zxnu8Q53nd+ZwuB1C04qocOg+zKJR0IgHQvh9A2YA+eECs24Q07/KvWYhSiQcY4vh+cbKWUvn8noG7jzx7M+DvFSEqByZQ+Our\");\n        a(\"c8VRRj/eDlbH2wmNCgu7O4GFg2fqWLhcYuF94FpHCk1QLOVK0lQln7xmosNUScs5eiWvy0rmoBJeXehqtuhqNnf13X+rq68cZu\");\n        a(\"vqPwvNXd1f2mdX80xQphKUWedYu/rX7f119YdXVSWNn6CSrcXWrl6BSsJ6X/1p9IjTAlKarZWm6UabSyDCd+ReuTMFWTldoFJI\");\n        a(\"oFJIoFJIoFJIoFKIUUms/MTnJ79xfBppP1aU6+eK22LOT/K4NP8qfqnNIn2abujTkAWi1MdOTsZ3SY5xUN6137qZzhBbZr5tM3\");\n        a(\"WNS7yf7vsc0/r+Tf/FfpqtnQrPjxzoTUGAKd1JVwlK5yJKN8igdIreqP0zK8R7q/1+oWlVd6r1b6cPHdrVpybSv2KZWxomSqDu\");\n        a(\"gWz7cgDciyhGhzGK4oGiHHxPJumB93X3hhBaPX0RclJkE6PcXA3FurXdAaeDDogYMOGp03Ub6dDAXaLy1wlfhuQDMeSF34WUZr\");\n        a(\"xFkLJUyrTGSDIu/TW5rsDF1Lo/RE1pobnINbKdK7+oSnINphspKe1grU/GuuNO3wglSJ5J2SFc32jUP8USOIzObl2fYlDyL97u\");\n        a(\"uv0Gk52xh3WDXmuFglS7mOnY+YXiPC2a33KF6obBQjnHEfc3mwYlG87o2JkL6jbfefXi81DcNM8J9UfUbrWR9kejZMx5pFO8zx\");\n        a(\"fBvA2em7R5qfygZ7tvgcUcgx/t2iwI5vOYeUWgR5uOgMIYtZ+E+9pPfKy4Byxqp+w6NiktPvJXliaGSRqI/xniiLnD90/B+ZmF\");\n        a(\"YUJUBw+VJvALvaaLROrOgUl86RWl2rVfohSS2xkfG4hy7IFsr+C6aV/ngkCOh9AUKDDRJu1JrDMZ5oyN2kVnyIn+rrcPuqbWuB\");\n        a(\"r/2iXZjsAwDKmdpRj3PpmlbUpWOazpbJ8YlcEgEYF0zNlGVp4fLK5WDz2m980Padf5B1g2VaPEcqQb1CFESO8QtEfWQ0SQw8IP\");\n        a(\"20BeRSkYLh6FENYAJwJzcH/CB5KBarVFuuPRTDFHwylB5HTIM5kaKFv/yPMImBi0FbFvFF4B9vFQ+GjtAknSKETsix8U6DTGIU\");\n        a(\"je35/SnHQA1yaW86seqzmZ4eYTephH4FlOAsrfh40Oj4MRJzwK58IUI99ia707nJxtcpTNtobm7uDMYxmRmnW07iS7ORfvqG7n\");\n        a(\"sTw+Sn6+aBfioo2QvBA8I4Aph4pQCVOCkL3/PVTyIPvPtJs2B/ZPODGsyLXqJMA93CGn+a6oevSJby94lJQ3nJmlHcMEpEl7p5\");\n        a(\"w9sHEb1V9YZBnt66MqrXZhNmz/8FoZRBW8ut9sg9a+X8JJOTb6XyC+9qZsCDuQvjYdpocXsC0a/nty5Gx6l8WAB7cY7HXth0KH\");\n        a(\"g2whmOKTKX4bxY+yx69HvKK5cd4Lgu1ouDKtKN/jrjwEVLyEGJQZX+ANUVuYpDBXwS9MaZCuFt1Fx+/CNmS/c8bkz1/srkxnJu\");\n        a(\"qAKpw1BuPiiiYeoiZSqYn8xSMryAaCFNyi25m2LQTkXDzSqNhcX90uo7qRRnWzn0N1L/DbPdqrOhWVVg0S9vQXISvFHeUrK2Tp\");\n        a(\"MNbhSSLwQzPd0NNpI2I0aBDNGa5D9s4c5H1uiXGfm/WLg7zPxa8ft7D8wpGBwVTpbKEvxsDOxuXspHak1ha6nX34B2Lcqhgr4G\");\n        a(\"jBKInQlRSS7kUtCG25HxrXQ7KXV/srt9PPo9ZSPKmxuKkzmS5vrKXlb06XCNAwslvb1tsbDRWOPN0BcKuOaNKS6D45auOvRvrK\");\n        a(\"Zo80ZjVthVoXgDw+fTOZyaLtr0FdGtzyvF8cbNfP+i9vJvtpp5tZ/yk4Isfy/a/pUETANt5isJemwf9R5ALYRRmJ1PSqAaTy5I\");\n        a(\"zk8neNo2oQOtekJcMp8EREgeWuRyUh6pDam0ZSETebglpLTOZk9Bpj+CMIASr22dgy0xqL4Gs1klzb6CzIa8IlGd5XC4KNM/NH\");\n        a(\"NgciiKlOW8P0GNnj6jdjDaQSTqv1dAItgOfpNCfRJ50AGClwf+nkPmZxDmYRrK9gN+mxwR5XL+ZHTmtwejfhWSL/xbU3uh3sH8\");\n        a(\"0F9tHlDaVRbbN0iBPs27+lM0r2s2t7oxVifbJ9KcsAmfnr++xvxnZ66gY9nSepqIvp53j+eyL0ta001JMcn4ZmJ8enoW78jXM/\");\n        a(\"SVf3k3jvG7V7nYEMfXc3rnndrnF8vAC4lfo9D9wk4/hRcWk0quP2om2Y0TJEcA3gC1NepMnzyZnifJKr9nkzn7RH3Os0lSrudU\");\n        a(\"e9j9NhL06HfDSSq6J/+ibIylDz6Z/isAcfLsYKYn/iYVj7FH+x2t1adp7Twct+HAKCDJ18qSCMbiKMgw3CaKEJdnuPHfxj5tk0\");\n        a(\"eHv4ZJyxqRejdPhCNhpofvMcpr95PvjzRG+ehz2lGAeXvouqHsqzvnnmQC+R+xrI0HO+t4Xeyy6mGpk9K7j+p+6luRLAWrgCB9\");\n        a(\"+fJOpPyeV992fjzxL1Z+aTqj+3b0JVm3Kt/VnwruxPxXgD9Pn7hdNZOvIEBvH0XXEq62nau2P3XyUuQ3gPh3F34fT5THJXiwWC\");\n        a(\"NYjjxTScM9c5Sa4cx01faJY7uEX7C7sLhUvaLi8z2+DzqRhHS3fd1uot5WGrJydF/8zPZC1krL2VcGlErKhBO+GnWdRAnfcO5f\");\n        a(\"Me819ZZBQG0ukDV2TeZPnM96kiXnb6K5pH69ouloaXX2t7CLWjFRnoi0FrDGAUJP/dfvfW25jS6CmJ97vqjQn2Oz9zvdJJW/Ux\");\n        a(\"iBTS4B1iGzxF7/5z+nZXPPp210Xi2iXZ1ly+wZep7b9P0b15HejjE3v/t3RvMvkaSrtCp3uJ3q+7tVfNoC27T7EG/sP7KKqcad\");\n        a(\"xG4UFdu+oiY0SORJCvKjdilEQPR4l+uGJvnmEz0LMlsBdCP6IpUzsAX3imPVed77kH4+6zbKEqvWbJFJiVafFMPbLFc/yUFk/O\");\n        a(\"6aGMBb9xOqD02+KZ4kRx0vj96x7MyH0TUIusRre37SRfqtAVl9F9789ZuE/THQvyl/yyPZg/yuEShX27ay9zNFmaW5wVGcdIKe\");\n        a(\"+aLMNAHPiIsOhmQc4E7xuZjHYzqQNf96ADa3IEf2oYTj8+arT1KNxbS0KFHoqk08Lh9GdK5DSGifSfqdiDyMX2FkTcQxTXQHEj\");\n        a(\"jLgNFHcj4sJ9ne93FxQRkYbp43X6d7rlO0l9W/HxYyyWvvmd4Ice2b+8BT9t6Pfj47BeuOY5VHPsSsJwR46kXMTX1Mqg3G9dT2\");\n        a(\"GS3uZ6vBXsTHcjI7AP482x394qb9/n22/f6v0Uqk2ptb6ipHW1C4oOqPT4+JMp8CdTu3OkwB/+OPoCHX8qRxr4kxnJioc/mZGB\");\n        a(\"2tFuJwfVLMW33zV1/EHb7xIQmvl+Whh6ZmYBnGBr7bdOWDg5UbdwUiTsm2DfE/y/Hs5KFdBeTFUcB2YzmTLpYPtlL8vhRG/7sm\");\n        a(\"Gl5Pd8zgTye6sl27K2GgM6FT7bM1ngKuPtD2h9XEiHDiKfF2RSu5kusbrXRTL+5owMN48nWN8PrKufPyGL7NvzQYQV7iom5LBp\");\n        a(\"Y6k/yaLsFOuRKgh7SE/+R5IbGGDaZkotlwsL/qr9sUjuiw77vviHVnTgq+MT74uXv2mgoxqvdMt42fnRdvwYNg6dAwBaKgLife\");\n        a(\"uIWIwx+8NZA3xBPwJtwJd2yG91+MG/i8UbvVfGKgVWsNXqCbj9sI/mpd04XFA/qnvMuAXd9eLar53QWK+cXtzaQvhl2JXxsuFr\");\n        a(\"WsUm/PJqhga139npb5iQW5L3Y3U7vwcL5Z+U4kn7CY/xbkt8kZunENKdEr9R120PoFajYY/eLhoVYKp2e4x2xZN7hRunDiIXeG\");\n        a(\"vV7v+mNxr2O79UrQhROdBjf1539RACL7iHz8QT2T1qj7NyLMYlXIx1RDvujBVzjozWY+NsQYHOag2dct1+jemdI188b0CnDXMR\");\n        a(\"wlyEMBchzAWYlAn9y+g37lg5PvRBRYQRAU8gUIPiOM0Fi/IWP712e0nQzmwpIS2VDlyIpEo7YkLHwCheVao/78ulI/zsRHs8lA\");\n        a(\"Rgo6crJB6mv2D5DBjUQUe/qTxkBpRIJ0drewaREulQKJF+UZx/RGC0nw0aFK+Jin/V2q/ApI14Ea2di2dp/MLuZsmkznMa5hwV\");\n        a(\"xTuCNhPKTVThsBk1lZOjQwNp1EJ5mKJcHDUoMICi0HZJ8HjPi3D5m8DCkk1/j/Vx3sXZ00/6h35ilOcCoauGx/Q/r2cpyDZ1eg\");\n        a(\"q9nefs6nqK0Cv0Ex+cMfOb/Bbgo+FuKz+mMFgpFJ9/RMVVxcEf/Zjzy/EqjV/Mi7mnP5tG5iB9NEpoC6d10yh5pyJtKhG/ySiL\");\n        a(\"X0vZiShbHDrbp6wQOFsNR/nBpIIX4IW2266WZ32/HDYw0X7eqf310AT7T4lG+3lRPV/9OplahLnW+nSwquj8eAh90lI3NvSw8S\");\n        a(\"rMsXyo+/BbkMxHYJyAhnIO34ukCJosrbZ6/kgnN024p3byhXHyAV6N70RO7LucuQBD+KUotIlXZJf+8uhQp4SE5zkfudngFVaw\");\n        a(\"2qn90yy1Gf/8Z+SHHIK2Nia/zP2mcEmj3T9FbQIHx+/lI+0YPsU6hvCRZIivAR8nZrONeT6ycHqm1jlYT8fHCE6X7JBR8CSQgE\");\n        a(\"/8392/wvHuXyOhKa2Ng9doebfK5BqkWq64mBWNlcEWz3GO2KuXR1xM8mxXr3DCu9fT69Doip/a7159+WeOPT3FfJGZJT2iDRFW\");\n        a(\"fQJ7fSA6eoFSrg81BPcq0bU4dVjX6yV4GEokb9A7qq/1ukr4wwu0W9atkD3gyjemINTnulUx+q7YYXrzUjulc11MVoeMzltXNd\");\n        a(\"1WR3CdrYrLG0Ymx+TLEe8Otoz6i2E5STUoPSHIM4D+Br3bg80xRdxCP6QI6fJK0SHTjANvh6ldTE00PA9lIKdQ/YS+d1+jU4pb\");\n        a(\"EBCe/DCgdn8qtMxrLaJvlvXTSWb0j0eExML48utkfiyx/EgnzSXxa4rqgetUZlCyPo0jYoVt+E1KRak546VS24xL9li3nm6dvB\");\n        a(\"MTFnQ2q2Q1Z/DKhgk6udW7jSaoXMqdbHMyGS7zboNISWy5Uh7wbcR342H+NkYURI0vkd2jrL5q4r/ndvsbZqBjGVc+43Sw/YSf\");\n        a(\"ybth4SLLUok7vkv5jRvnZQ0LWA41C7MLrswSWAj8KpnUvjdfwyKc2Kaljv/s7b1RlMPnp8gLMDwExhersdfVCyfrqAwJWP+k0D\");\n        a(\"5BR638qOxzaCk/XON8qMn+2+/jszBgCe7b6l0+8KZ4l284S7zLb1BC1RrXtNkR7/4NIClCW+GZUj9jivqaWj9jqvo6vn7G8eor\");\n        a(\"p35Gjv4V8niCMzxiTZX6JCfLp31wSDSqshQFZxTJLJkMSz2EZWVEFkecCuMWtrs/6WHL/Tvm1f/NiWpRmd4ja286CfbdMNrPOp\");\n        a(\"neegSO1hae5FTcKvN7+kn8nn4Szp4IC9mTHCF74lE3NUXf+T6LkR78Bmb4aC/fYFxSdpNss9SvA4zi83GIW9avq+/ox343+jJ1\");\n        a(\"uBQLmjjchq12+t4IfGUaD7zrwP0OeBvQjPtdd4xcEBxTWjc3davO6wn8HGMjuAVzC16JsYf6Ou5VmhQh4hJUoR9LAtHimtdtum\");\n        a(\"5BKJL444eL090Q2EX9tvol1A0PmDx5Q8j0ST3JLzcC45mgAuNxGwL0oYDC/Pjyd7N6E8vffePi8WvXvnDZx89+nqVtMai2Rfy2\");\n        a(\"q+3xWSI4QDJjl1DbircT+4rcU1QijwCw3FYAcjmWenj3Rx2cl6SsYuoAmWi3Fshycnyntf5sEd9hjc/SV8tLOqHZRIEE48v+xo\");\n        a(\"b140+kzcRwaiKMMISzzG7dbh2cDH/IexEp3brdY3XrZj8v8V1XuzgiWEFy5Wxo430H1USGy6h/tOpRqFCtqPj9+XiovT92+X8r\");\n        a(\"L21aNJIM/WO1XmiFVE2Ghls8tpk6FzILjNC+ObZoII01m6U9eIRQkZLfN42I3b/eQcLPxKgIQ6J3AUZisswr3LkOMcOmbQ1HBs\");\n        a(\"p9eZ0zhgJ0UP861DI3969H5lT9iy0aSHtJ9S+f+tdxkP07Y4jkZ52MgOrowe7Pdj4Wy8Pc+xW0laFORHwhTJqVJ+R6YSZLLstn\");\n        a(\"41+CVhG/pyC4Hj7tKqeWlL2lUhm4DlzJxda90zLTFZk2PKlu4MnmsXDxXCfY3a33D0At58eOfyPU3YGpUF53YEt8PDNfK1T9bb\");\n        a(\"TC3qEurDPfYyTzSF1KVFn7fK0cdLD86fg4mWHDyWTgpL/scyNe8d+K89ZXjjXHIw50QI6PuAz8Gzi7gWfkOMbO+Lzs2PP8iXZ1\");\n        a(\"dPt5/YgzE6xPde+ik1fB37McSuf0QIvQOR0KP9Os21e0gi/UYpsboBPvlYpDEbf9P57Rb/v+YLz2l8r2G1pk+4TfNl5Ktw7HLT\");\n        a(\"Y4bPef2f2PF/Rn8HKdiP80NT3BfdbOf+JrT2ACdY+qh10xdAEzOghH34Lobwj8rt1C54Cb/+RHrp4VGwrRlL7xY993Svtz2Hqb\");\n        a(\"OgcFvW/5yua+5UvGDo/sxKn5HvZEGMbfjZbi7nyDmuOOYh9/S9095TUq6N3sK0O809uxbGk7hu/MpSkbL2uHiP7mfO9bFfdSIt\");\n        a(\"cyqRlBUqDWG1qBhmwzQTaPZAbAfnmGJDB/FLLZ2m5PkdtBPuCoUA74O2zLkLP8Xm379vno/SHBfGRkTU7iRrXLz5Vi6yvTEumz\");\n        a(\"SnxT8xPLb/gZNwaNTopC9U3HJrHiJjUhafElkIbXT2FQ7aQ4457fxvOy3leG/8ksjo6SGZX2SsagEqnm0o5xxfSsjzM9b3FFTm\");\n        a(\"/7sqVtPD2pGy9rKw9jLvO96yvCnIoKMD9iHvUGB9sbfPwkMQt+yF2L4zDG7PseaqWRAcFGka6zioFXjTDpTZZhikIljX6ky4Nk\");\n        a(\"t+b63uEwT+chtUsbHa4Hmnn4ZnwudOJRP32OgFaFaTArJtnAGn6SQFQbIjFefH9A4tAghSA2/Ph4Z+LzdlWKSk98vlZocNHO/+\");\n        a(\"xcrZa46ehrrSeMOD+G33Qk1vb0yJ5mRWXgVEXOLPeLPCT0e7+G+YCoIqUnNAlSOqOJSakWtt1c3brs/+1oNyH/Z0PuQdPzWCCe\");\n        a(\"ahRAvNKYiJ5nJh08PS9U9DyB//8keX4LJP1X91X7Oc4LxvVhfsjCq0MXg9/1kqTn8p2yErqxCR4pO4trdzhLyFVx7X/yXvg6hd\");\n        a(\"246Orv4x+9jH4meiyc/xG/NLgLgsyNojJ/pjIleT9Uh3S+4otYcv3egO30ODwxycHD/gGcI+O7Bt88+q38Dfz9xiE3qS8cieeD\");\n        a(\"34dXYz7WYD4aMR9tmA/MS6DDUE3t64nY2Hwx5AGM002Z1O/nuN8VRTyg0i5MllMNqKJ/UEA/QnfOlV5Cw4xYfXyXvsRwz9Wozl\");\n        a(\"Xb+Nytibneo+V87XDQcY0ciw0sgUPfHnqF7euB+B7zhJvmu1PNt66sOJWosIRce3MH6ukLvo/W9jf/W8X8Q8bCmH8qg3fhWP23\");\n        a(\"owQOrAYOrAEONKJjbcAB4ALmQOKA/f0/2nuw/j7JFslgLjQwAsEaDuLo4EcNAExHerUf3BnfBehsf6i4NNhORrZKQmOd6qs4NN\");\n        a(\"+JSS0oLQhuLG76NMWLF5Kmz1JmhUa6ZwVHcsr4TRDAR0IT0pHgT0/HI6wbSeeWwmoxVeIPjk2inN7xjcX4PCc435EeK5IRWkbP\");\n        a(\"POylJsl1RyPkKYMYJl8p1LlQKUAaqL4A0kDU7rODNBwgDUSKDaSBBNJwKgSQmpFGIA0HrsYHSfELQ6Xzl+2lk0TlOF/Zm8XBth\");\n        a(\"LUCRsBxbARUOJsK4aNAL+zKfhmZBj5pGPR/EgylD90JcEcq/RHXH33DRBurV+fXzXP1UC+FmtevYXyVJSGzpp3eVHDwmhB3gHX\");\n        a(\"bdc66Bnl0qhxrw+dXxrsoOElj5CY83mQrjdH+pPStRS8HRbkfVT9DunjnmCqr3Ii1RWOV48b9VCZz1EmWDUPNHp7wMXP5rhpyS\");\n        a(\"5Zdejt9nTxDA/VSfEgny0esENAgho2kQyVUVoXec2BYf6G06sPEAGAh9zISGHWIeT2h9ZSRo4lRYKyd3GYIrGM6ry8j10rh7Ld\");\n        a(\"oW5Ihof8lJ8c77dDaGgluZuB8AGnwUdTtJ18WH/CewkKbCsKflUQ/LEoGCku+6G47G14f/JNatKq/YDF2Q3vSWW6XUnT/Tyvt2\");\n        a(\"os1bc3tq3qAZHPwEOOOPM+XpoRB5bq7QxHR3Avw5G3O5ACDZDUvO9dRbvz9lX/mXoFfCerSnntlaMxL2dhEDBWRcHPuCaNzF9J\");\n        a(\"h0UwL43Bqh4Dl0JOzoS9SmSq7WVa04epXhs+4z2a8dKndK9s8ihtuskCEwshF/lDhfPyC+cLvY9t+0nvY97SE6H3Mc/Q+8A2Mb\");\n        a(\"sUXwKZ5iSR6HppsJs/nU3a6H/0EqzIpEe2kr6kQ8UwCoIDqN22l3C5sBR6Ik1fYrH+Iie9tnCesQnkJMVKwKj3AEj9uZBrLWti\");\n        a(\"pKVhJgeJt/C9qUozyfp+MBHP6QtgrwTgLoQMSHT2AkPpgK5qnwxh/OnrPSFwCDRAFzlAhkO+JbiSKn3zePzPNmHbAugkpAgeAl\");\n        a(\"zc0yjenDCAI3NpM7ltT2/UzKEJFcyPpZcF88zfNv05P2pV4wekzElXT/7x/RlqS4R8Fnkl8laxRgV1flMH3UeE4NEu0DeFEeYW\");\n        a(\"MG85NG+be3qjtklSnNt44yGln+Rw3Nl3E8HKnPT4dSt/XExL66JLR/DBLOP+avQDwzm0g3TTq+a7VpL1A3jfpS1A2kufTXzByg\");\n        a(\"lZmEdRaKEs1PEBpVSVOipgAXY+kJPetWeVwpEokzPN14a+lp01H9VJt12CAiDdyT67RoMXTyVAvbTIebxOpdmas0qDVfO7qgEL\");\n        a(\"AdVwPQI4ZU2qrZrnqHKjbbyEAmU/2MNlqAou72s9q5QN1niBPZxJew5ZYrpThnwCylZekAzpH1sFINqjnKpACAu6YZ8f83oaZp\");\n        a(\"6PyBD7FKDwQegvsrEOLXmPrjK4Z1v/ujrx5XVrX6LDQlLFQFAkumBHCkj+03yFKE1iueFJoVriKuCEdzI5zE+LZEam0N06I/VG\");\n        a(\"A793vkf4De6+kLHq0HduD6qgkVLQ2MeHCcA8R8WksIVUGt0diUtpvAGLow95n9OM+VaiiLqW/NgbrXlJHA1Gi1S10R+W4uR3z1\");\n        a(\"/Ncyaky5zdbV64I3O0qtdZL88Mp+q1fb0Wmdbr50gENpI+p6NP+ENDktSXPwR4CQDUAbTFmiMIZ4VSsHGnmCBDrUgGArvJCQCW\");\n        a(\"PmqQZmCDqM8gmThg5PZFF+LrC/+tnobw0NrepIBLLzgPBem8Q2mq94n0meeRPnPGYTcJAYQnoPSk7POZ91PdA3PNq8t56k4g2j\");\n        a(\"K/XTyAsVTBHu3+p4wHsEIZdc6TRhRbtzg2tsTvVYnhMupeowTQ2Lw7Hsz93B9c2s0W/N8nSzLenCjd6FrZqx3VPf8Hvu+QXcfi\");\n        a(\"G5UG2P1AWq3baTVgdcn9tKZgPVJcEQ2+PkxFRi7jcxXMivLhq9lHZ/quM33ON30b94L9RjT2Anke9YdSkvDMrFfiE7I+RF0G4L\");\n        a(\"hU5oyMwc+voogIuApedNa+RovdWeTyfh725n2x9PfUhaJgVlF9T1+3cH9oqfUmZKc3vKH+9HsegOGCyGh/AJeOSc+R8UlPYFAr\");\n        a(\"olk+JmynIvb9V5K0AG2+bdcbxGkutIoiU4Qy7rwq7E/dSH98CadruUiMedbx2JE/Pv28aZ6zqqDmpTpKCQzUyenxlsMeBteDBr\");\n        a(\"4T5PrQH2IpmYlOx9qnoCuVXNFOdRfz4XYmSatdhUCVBxI9g0HTcy5IsuaM//77bfz7MvyWHGB9SI1/nu/Gj1WhApvPBKH92EPa\");\n        a(\"j+/CU5UMU9U0CTU4i0Xc9AXoICfh0L5Be1Yjhp3E/hzM34OpAjSl3cKV1SFsVaUEBqY6rlMLyU8mpW+NOuRCekAupIzfSVbmEL\");\n        a(\"62i36EuB8Sbe32bEge6ICSUounb3CQ+rh23dv38JdVbp88oNsiaD6qP1sE/55+6s/XkT/CKX3rp047JpF+6hPXqkH99reo6oRe\");\n        a(\"h0U/tRHKbNw/pW972QPIOY+9DxWywjrLILe++j/Qt72jGVV/NLnv/vzs6ET92bpI9Wcc9efnB6z96f6t7E/FeAP0HY3Cfoahb5\");\n        a(\"uu7dnn6EffVvEjpK/D2ipUOh2qtumGqu1UVrUNCz3bdMjLz3iZoHgd+gksOLGTBOKhGMOKth9a+QT28yX47MTCGm4yrNTmULe2\");\n        a(\"k/Yrn54J1n+kr/XfKOZHE/PT3Wtf/1itcul3TDCWPqaOVv4tOHEplXQhClDMDEQJqoZIIZh8gkEGGlJ/Cy69kMBLU9aUvlPWlB\");\n        a(\"4A+dD5gyfKhS0mpdtu6S3++0C3X5j87ha23ohxrRlC2hrbetPYBIyU0e6krUhm7CHLohQnBa81ofPaTTqv6hlB6byyzKnlkYHl\");\n        a(\"rk+9B6N2yFTMkMVg8r9rn7Jq3H9hzyS02B05XNiZvD6dLUy2eqCpII0EJO9BAAeEj/uyZ4IVI5zdXXgEmyp08+hA7V6hnWqPbb\");\n        a(\"Ff646kUFtKL1yKWTh4599ugdlGn4Hufh/bF/L68n1uLE8Y50Cr7sgkXwh/B/Cd7zz0BarJ5L/El9cU+MaXf056gPit6aSy7MVR\");\n        a(\"cIB2yxEWO0Dx1sfQzv2w6vzSc2qJ2OwdSdY/8j5Heas5b+3p9+CDkSK1ASEfaAChc8TF8Hm7EZFOEQJDhskoNxuR+0TH78UC75\");\n        a(\"RUvh0+D7V5WAL4tFmoRNrJC1yLEsOoxId/E1B27wOUgWNhr/D2F0z2KP/mxE/qI/jhmSGfJK3IybAPfQUhTWzLzch8PgpqNx4m\");\n        a(\"GpErxM3gz7GAH5/+/HFXAvn9oQuosfy/9d0/5JlOeQZQHmmWfOihFFOnv97eFpWBhy1Pevb3xVT3XpqsjIH8cwhThRzVtEVeHQ\");\n        a(\"P4NDLChGMYRd/bw0U37FFFs8P6kGaSRaUTeZSatHwdoJsVQPHtsaGFEm5hHNubatSre4OqewQJVN0OED47P1KREFaEeWwUMrNq\");\n        a(\"VoHr7vUVk7Fas3E5ID7IbYfGJLmRlCmkg7QmeLANQxY15kbEvkp9+ee6A8mrnety1OnIZH+F4w7eHmWmtvtQnbfx1KH98zYS6X\");\n        a(\"9+0RtFIEdLRcA6dYnlG/k24QdS+YNvaKOonhDqGUr1sM5QYCIWStUzaqHcvJoXyk2r1UIpzBT9+WCvvkBKUECbl8m2d0gNic8Y\");\n        a(\"GkTh8ZGNjxxtK30E6ZFwsVg5x9LK6VNCEO/7tTdmMs+UDEHPcAM3+tCv0dqFqbjICcjD+sq8QbcyrcbnRlb6wt4BkEGNCRtW7h\");\n        a(\"V6271E+d/C8PP6AXLAlEDcC5LFfuPKz3v7knew2VuVYiz/rt3VMOWUpCYTv93c8Ml/YMG2dt3Yu7YckEh50v+NHfNayJpplxzd\");\n        a(\"tz37EMCYmplIHqRNu/qz3gT6SGabAG2GTQAaOC1VHHI7DBHsLuKJyP1EKgp0aJfu5xm9lCN5ozwGwQ6kZ3HzLmEzoE0UwiidgQ\");\n        a(\"MV7Q3HoePtjsAoHbdX3gm0XTaK22wP03Bw9759lnk13NaI/QIilOyApbwKDDNXgnMeiWd73MLSauVpOJbH6CNprI+kBZu5yunP\");\n        a(\"8FIRI+3LJCQcCNZf/sVa9WYR6cnkrgTyZK/S4Ztfh/PLO8hfe4aySGJY8kAE/FMIeA179i0wosgf5fhY4d3B3A21tuLbAwxk6q\");\n        a(\"0todZ+lSEuO6hXt3bT8Uzf9lMVPVYk0GUmgahH3EFOp2sHj9uSKNQMpgqjBGSPgNrB45bmXi3HaugpPyQ5aKg+hrwgzBHgvsA3\");\n        a(\"lZ98qx8ML8tIREclMbf3F1ThpX2MQ4PF+Yz3l9XKpp08/4EG5QgDY0NgCyxHu/5pm3Ux+U/kTMY1GgQrB/RqXWJ7Ejmm8U7/Dc\");\n        a(\"Z73wge7xwx3jk03gt5HC6xWIuw3Y82ag8Ukl/EQo8OlDW9WqTPiJveOoMNtzNMFROobe2dZ/lymMP4OJyjpo9k+305cez32ez/\");\n        a(\"5ToqpqBQrnarqCeX6xnDUT+M4HrYce+ystIobetx62P3tR3iPuaplyY48kgSaG0U6eIx44WveqPsC4C3I98oYV9lhGf5LhyKg/\");\n        a(\"AkIP2+Mj48wj5/MYyW87brxVKPtmOJYiTZ02dob/WV3gDzrdGPeqMy0WbvQspz446cSbAlh5Z4ykOzPcGe8rxmWFupL2IbFldF\");\n        a(\"DRsW85UNi9G9IjYXsdKGheAZnI9TK7+1t1PnQoUzmr51L4O0Oz7yelStp8at9dMDfdSaJWu1W8aw84fQdT3COl5EhrUd29SQ2P\");\n        a(\"1RcPnaBaW968zfvlJnHP9whrV/eGwPDJHL9f40QChQ9vwwoSoRlKKGBVH4vdbtqeYQLVn/BNlZ7+FiTYaSSgGkwahUUf4Cd6Vb\");\n        a(\"lhey/1h/EP9f+pqZgNj5Z29PV+hghxf4uhzHx9qZpbgJ1paVfisgPZMuZadRa4r8TRbkj/1I6jC7ATOg9dTzWeWhqKB9H8XQNL\");\n        a(\"O8Pcvaq2MwkY4SrVfYB38OsBFtvABTjBcnyAQ/ezffQs8yWbMPWE3iH32pOv89WwvqNDTisFiz/z1c3hh65odjXfIalKYL4VzB\");\n        a(\"0NWLZFCiziYGfRbR+AIwGdhd5ZT+BUFW09McCPGxUInBSfzwrIvFn9ds95VVdv0Q5WKBBuKX8jEkdCe/+/3Ul39JZmCu9BHxQr\");\n        a(\"Lg4XiNwUEV1sF5Y74anLtvpveNLuvgVC2n8+XuwlIW3z1KDNJYGiA208HoqMaI6FMC5RDLfamdHJ1AyIjKLrIxyvvi916nMv43\");\n        a(\"/KIlNn5Rq2eO02ByDaVirGbrx0jGspA8gg2QZ2MhhRPykL6vxXl0w2EWHpLt/YxsebiEroc6b2CbL2KfxVW5gP0qxJKrbiw+oU\");\n        a(\"Jynng7zwWT8v7HWI1Xfl3zZ8ZKqPAKtnZxKGUCCIesShwIDqGq8ue5qwZynfPcLOsDTZanfA2zcrUnv3Rw+xUOLpTJYzMrk9bm\");\n        a(\"M/xmwVZG7tGEAbzhJLY6RICv+FqK/Kj53O0pJd5VYDBdii9HyMjbF/8+MonkXHkTb/0LX5Tkgtuzm/mYjMrc7gJxLtmszhtx71\");\n        a(\"tAawbBA/qWLijbyQZRYw+eR7P+kaG/hKYh+XHanwRj4FkkwTvnl+VhddOync+26FPZCOhYEVBFtSNqtTOSlNOoAFXyZaZqilvX\");\n        a(\"OyT5KxVwFodjqW9eATj40q9wi6C/mKDwo8yxLg6VMC392e1EKQKpJcEdkfSivN3V7wrfO1YTkWgqsT24DpxipTfjtxFU0MfZX3\");\n        a(\"Ma+6lPjcdClnWfJd8YIRmvaKy0b/sjTzQo65/QrE6VhgoJEcR6IHJh95SpwOujP2JtGPlRHQh60S6DoN+HZkUbiN/WQyJ8ZxlA\");\n        a(\"vqEDGZ+DG+99HMvIx1bYZvmEexwsPB+TiVwsZrdymeMeSoblY5+4/w38arPjVwJ4RtvhcQOcwxQ4TW6+aRDRSH0pyeOoiYXMQq\");\n        a(\"9rl6BSN5vICXlE99IjqWuiynNtv/ndtvz281q884N2K2dsoZuycnaDDNYd8Na5ageM3EDvnZ9Zd8DKpTT53byN96PPPXTVF+Bk\");\n        a(\"/uMpxVIwv8/GeT8rIfbnr6jQ9SgEZOTXgn/+ic06f+MEAfqZdCdAejw7+B6+g/3raBOZCHnZEaC8RzTQ1U+7cmsvve1QmFVwhg\");\n        a(\"zmSXML/yXkLFCbtJRkxAI72C4ImJY924lpeZ5kx0bwBQbpdvzwzvY4xgfN4kUsh30YDH1TZFjHP0rVpVu0MIZaaK0kWmRWYu3S\");\n        a(\"3mWIkM3yMJdgPEtpaG560jKedv8NBPYEynv8k2oYH35UDeN5PIwMk2UcP3qEQPGkMy//KHSQIttEZKbq1Tjq1Xc3yXF7ydq3sy\");\n        a(\"Xz3OKswdqfGgyZ9sQTqj92+zZL29GnDhzWuF90nkE5H5Wb/YTqW+sjqm+zYvk1tTAzhPMXO1HDGYb3R7DScQTAKsaSIrlHYquY\");\n        a(\"/NmMEf3SqtehX0gTfSqM6iwXsJ8AFsT4UafqWrz7zbQo0OnvnxM6zQTcqxHSDqPBLOv2AVofwD2RLMuhHfouDm4L7kS+eso3W0\");\n        a(\"AZbZc2yQaUh5G/+gM+//TYCI2dPyzHCxAcQxAEDl8jV/a5y4TtkAcfZo/pg5BabvD6JzyIZX92stAyQi7xujnDLbmW3fRIFgb6\");\n        a(\"sDhiWrn06zH09c8AsgcV5nt3VE0QC+MZirvtIUKFUi7PLLsnBvACbEWGMGUYLAudKQpVUtwFXGhup3hVmuEOHCkSL6XE05CoQ8\");\n        a(\"JKVTcC2sgkUvEQufIo1y8eQ+RITr8Q6dpy8jR/KVnd6FvftkObmpxIP7VHnqe1Fjhb4qMtfNqHLhOUh85rTFsHOVhFjY3B6KP6\");\n        a(\"/kqMasFdguMYFsdgN7c4PYhIRswkRrMro4DbTWxLNAJ5CDc+neEV3u12fbbUrE5+tBnT2f97j8IHlNM+4XKf4kc99gj1STdg4P\");\n        a(\"fZeu8O+f7EaC9bt9ozueStft7fOwV91/AjAHjXIBSenF3gt2HR3UeSdHntFeX4JKKLGe+uuFDcQdnfNXuqdEcgCin8ywAkTz3b\");\n        a(\"3pIenUenonoRxkmHIVv/Hr+AsCodbPWQasw0JHvSW7hbJ3MdSBUQhgChnfja7eFeDUF21r+6TARg3xwBNQI2ewasb6XUxFHgJh\");\n        a(\"Swq1rhlkXXj12Rn5K7iHPoDeN7Fh8ArFcIpXcBwZDl+JCErBOSWXJbzxSGRjLm0vLN7mAmgc9V9L2ouSKV3kOe5J5PjuobONOw\");\n        a(\"OPRL6XFguqReRqm0l/D3qUQhR2/rpYY9LzpQbQlnqVmCi97RltzA/O2rANAx2ISDLXWNHtfdrZhXFMqUOT1KG4+Ux6A1UrahuL\");\n        a(\"bLaVRknEe1E7aQ1PUusMP4wJJyhsjT4OsRz/ifASizVLN9fbdpsyz6Vbb3j2g/7xuKBvjxrNHi3eaQasfSOjfw2FW3X/eEdPtv\");\n        a(\"6MDK547lCOatc9V16mmLEYGJG4w6nF1vIlbR4HlBjNk6iHIRGTBiZ1DsUyK2LezHfPuFSax2mtb1gup0Sr3QNopbLdpqpwcNPp\");\n        a(\"pw4wxQG+LaVFzeusBJtpx4shW5QGcRz/bFD39YPLikEdiRFPwVu+PduhWaJ/llYpv9ZSIuvX31QOL3NqkPi7HWaJxj/Xqfe73Q\");\n        a(\"iX3jfHwSXZVMig56MzIEiqTnOo03MUwSt3v0xfKkcpXlEVvaHy8/nbfG6JYkno+t2FBqoYuP8FgKP5YPovNQGEid+iSy6AB5QM\");\n        a(\"i0yQ9y0ZO2ctGLKfsSyp78IGW/mGpsTb0D0fhHwd9yUPVq369RyZeruJJLt6rKP6f4DSL+bFGLf0ts0UWb+UX3CvzIvmP/Zleq\");\n        a(\"y5o7RZavPwQ82fuoKxmf4nqIqEMxjNrru23W1+znz3a0p+17UG2RlnQPpW+1pSt5FGo8cppKt79nBzTsT74PeX8q+NC0P6H6c6\");\n        a(\"n6+Q+qY1/779Sx75hW73469oW8+/k8u1+cZ4f+TjAn5qLL+YH91Z0868cgIyp0UIX5SEH4hw46L4twD4WPQnjaJphmPfYTHqY7\");\n        a(\"CfgNeVQw9cWNScxOHBQauh/R0fbIAIz7HoY3Xevay7XcQQU+QhiFz6LwtZt5Cn6J2rEbPbynl06HIaRAHgj5b6Y8B+5TvtNy0C\");\n        a(\"WD32LqF/KeT3mn3Sf6diPayL94f/U2JJxOCQsRAfQ4DmH6R+9tFH2uiD5aRrekXgp3D046b1J/k1epgb3hPjWwUwkKdZ62jO9T\");\n        a(\"9woYftxjHt+vDvCQ5VC9N73LEDz3AY2vmPuhH9DHQ7kk4ozR/DO+hPyNJwfI/Tt8yqfSbPDDmHqWZ9GdD8NViURH4E10oxoh48\");\n        a(\"Jxj2jwaap37e96ibAOw/c19H1oLpW1XFit/rbV+4RExn/w8xPvPsQU0+bcJV6ksumhUvf3gzjehMpJ98/1Gv5MdNSQsf3migHl\");\n        a(\"y7CYotWcVI7b4tH4UzGw/LhodYUrMiZsXMMjF4fLEc6ODojMxt5YvuzKCdmO6aLY6W9HK8eiXPVon+s1euTZ/aHv3SvRHhVA0S\");\n        a(\"yVLa389N4BVYN2utypH0I2PzLPt/EXyBh2vYgc9CqUA8H6k2QAVeDd048gb6ED2zgeTxtjEIHYtXIwanwD2zmpHLOGH9Qu2Doe\");\n        a(\"ucEqfoUcriYxNIZZh3JqgGDIktTFnj/FnD+kcvZVf7o5v89agIJtMfkHqfz68+JoXegod11c+Y6ig/Kn2xjPn+6QXcAJPs2Rz+\");\n        a(\"8XihRD5c1fgM6+0u6wqExMvpLv4dSGvGul+4QdOMiHGL7/y+Z2a8vGWiVBCgQH/jSbJEh5OKEsyA1oUzsvRcmCHLz8Zmj2WLz6\");\n        a(\"TAIRomXglM5tFOODj+zD4JwNsEMK82tm8POT/h2Qqe1f1tM+307z/LleUPNteZ+WsrrQhBqrLECa/BfMs7+p2O1fvZbg/JdIf0\");\n        a(\"a9RUHDJMcQMhZ+5mVf+fl1Qvf0blfdsyqWYS6obykvCnaXT3Q5XK81BtP+zD47loes2YKtUJO/biZ02mx+RTibNNX6amNwQOTc\");\n        a(\"sNkGAKpF3OlGnAdxiCC9nnMLFZJO/DmQNHODFUlvuYJoqNk63gJhTZTMoWodr/ZG46d1aS8jTdgfwJrrXxvHNF8L1Hwlsues/W\");\n        a(\"Uf+2oqa5d8Xunv9ny4vYsx/WGX/1LnvRaLLzhr+lnUBjDve5fbTm+Qfj7SfVc0uo+hgVM5jPRTkM4JO80V2Nabl152/8hWObUB\");\n        a(\"FWPZ0dwv6a9reYWITak4q6uBOqO2J545ZfsO0VKIfTzdNEOjinjNmEciMkv3Q/MnkpMa8wrUXPINnzPnUVwqxSnfNJdQ3Hcv95\");\n        a(\"p909xBcR8hLvzvrN9X447fCziKAkNVgnV+9iSen/fjp9vt37+U6L7BsmvGnVznckm5AzY3jyxkgjiUxAbIJKIjwbjDInBpWNBy\");\n        a(\"kJNrdhGveFttTzQwGQtNO1MttJcvweg9/aZ1oR1ejo64XvBucz3h3RFZwYefKwaQv1UkaA/09korjBP5qLvDTLrj2/PEotyvP+\");\n        a(\"ukmDEllDp+itOR791fQTTg6zMUaOMJtJE20G6+jGmAMiFifz+Sk74uMV4G26DOSnrX14+Ki54Kn8z8CH6dKajtGXJdJtbBkIo0\");\n        a(\"/E0PDGH7u7vp0BwBL0A0oredZtozgusAe9m70md1GkCo21qFt97RwsKgkdnKQbDTm9OotVbxBPTNe6gnyv0AtSnY2Gnph53i2O\");\n        a(\"v75y5V36vbEtXXv33hDWt6haGg1xHo194mAWFzEINT4InCVxxGjd+FoNHEWCRB0cT5Yli54e/OlxK7x+H0rZm3rQje0JWh5hqn\");\n        a(\"Lfdn5twGftORPaE9W/iverE3gf1UzazjELY54K/tyXDd6sBOO74RaB7B25evLOVmqKJGccbr+krYk46Mlv00l653WiJkP7bY2u\");\n        a(\"gC+0suLPTqaSdiVjqZ15Mk435Pcb8WcSky7laKKxdxg2TcYoo7j+Okwftu2ZKkQzz/L/RGu44zvFXf/gM/mG5hfSMqf4hRXlss\");\n        a(\"0zZ+RqkZlPqDzpu6gNKaRco+6sUWh1GO2BWSX9V1vbLfZxsOnFFqe5IXj7AOHMoZ4/EAIccwY3y1aB/j+pllXOPmctUtAdLYck\");\n        a(\"bGq3E9nr6Hh9emy+9xUs6C9SsOMMbJC6JVXhH7t7RsE8lneJftc6DWqgGv0k8kKfix5Fj6eqCryxdFxeHUN79J30M1rkVILKaw\");\n        a(\"xGIC+6o4X/YYInLFwR+67hLn78Kx+YVZlXNICL6IRY1msrtkZfmwMKtO6GvvyVM0vQSnX82z3krT/3op0fTWwrG8QnCwx/F+Uj\");\n        a(\"u0tWHWu8jl/5ZagXPrsWSIoKTsdUhTaTPreqNFzl+NhWWaYuf6oknf1kVdt5fHcSCGw12PZTDt9o+fO1h7V/bDJ+v//U3p6dXr\");\n        a(\"lq7ui2vpKr7+zt8Oun2J5zYwzAblEKj+WPBD+4Lhv7hvtsW7b/7hK/N986xT1JRfdD75e222TvlLF/N9sygkFJ7U1VAiqWh8Rr\");\n        a(\"a8epZqa4+2XjtniKtlvu3aiXoT3jujaFvb8mOv/d558Po2DTNLtbMBEhA/W6tC76W+KEJ0u3TR7XKQcbtUZwkbvwJdu32pEmaN\");\n        a(\"l16dID3kwxB5sg0+s5m/QfbHlAu5DwOYiLu+tZ5Q4+JboEd3BIuaC7MN8pbXzce0P52s5vfXc1DtVY3W+d0KhZHIcKMCRTBRfS\");\n        a(\"igVmR8/ZfVvcIQbN3qBOcHm/85MVsrvDnFIebkFQsFwZ7ikJMwuDhUQJ+aVP5QZmOFeKDfF7qT7ERww1OuIFhJzHMnQzSWv0va\");\n        a(\"ycZQ6Svi8eEwJvIw10TKMyEqKszm5tBdU/F3lU+2+PIHaO0Mk5qVfTwe16qe5vFYrQUQSDgeNRiPVfY3C9qkk+jBhnU68Zwj33\");\n        a(\"6RC9DxKDViOB6Xw7JaH5Y2rPdJ+u0ixGY0GI6hC3kqV9PSZQj3X87j8zh5MMt5WQgH133rkCWBpOLXo1CJXLqVxk2tlw221LgR\");\n        a(\"cgLfTjlR4dsgHD60A69Y8e1XFwLfxtjqk3hnlF5+NfnT/6xXvICr7CAS5iKOWBB45pEnOreNJ/YMMBEEYapX0573sn4rOpOTMQ\");\n        a(\"9qvu3rVR0YlHvZuPK4Ldi/QfHW0Oom37mh+nZ+eeSH0Wa56leo++zB+RcPWgSU/vGCSUBpmDaW1elAmwk+7w7w05Y4Ko7wNSAY\");\n        a(\"5PNEqMaQ1/LyIpi9pGbpDkfFsSS/NU1N109LMeCzXrZO18sXJBA7stt/xXMeACVjGtp1IqwR0OUI25eDuf8eYX9jEf+8skSY4a\");\n        a(\"jBjz/4aD3/PBXmn+fv5Z9XVh0gAN9SVknrqFUZpEZ5aRTDYJcHa+MATqElIYSLQze4u7YlGedQP+uCn5/N4J8JMItrX57Ay6si\");\n        a(\"szh024TVPHpe8upTEL2LU4CNs9hZOUnlT+/UvQC6lr/PyHgWuzKtewPP85sisPQ1vOa0YYEj0AZJLOZA6JtN08KI6Dyct3E2Pi\");\n        a(\"NJL+WGsilKvUGlBtXkjXLVXeOMm6ad/5V4mG0oHON6YfYY3EHoNRyPmxhwkmpgjNHCt/aaxRzkXGx5jk4Ar/AQBX6hxPvsgPvI\");\n        a(\"dVKwjiYcY0rTL+xNNFAQ6NM2VaHP2Fm0Xtfq6POoRJ+lc7GNYfy6JRwkcb8HTUOiZ5Q+JPQErW2noaA7h8lciguF1hAqXf45da\");\n        a(\"SOwoCnUcCzRsKDBFFzXbtIaFOArhGARqcoQBeXANCzDEAbJKCbocDd9TfKoiZKe/o7APVHEZmtBBpQHnwhnHpp0qvxTfm165oY\");\n        a(\"iMfZRuWs7JK6Nypgj7S4hw6+k5rwl11AoSJ9In7zd+K3Ma7yWi0pe5tEGVRb+kpaiIz+EIf9PEvnA/0aqCHt8PUYXxZRZ+3mV1\");\n        a(\"+jtbELZxpX3ZG0QEB8PFr2GnnS/QkrVIhFFhKLLCQWWUgsspBYZCGxyEK0yNRaT0wfJVGLm96j0s33F9bJkAcPtaEohKxNF6KR\");\n        a(\"VrHTRSa8e2QmpvOGNfp0viqnM3W27XYW976/VD9D2Q5AeM/sHRhIhYPRyEm1vekI5UQjRDTPMyHT0dT6mBetRPPW80haqIcBCC\");\n        a(\"01naOs9HLWY/3wIwIxdwppnVq7IMt6kYDB08BAivKsyGEon5ysoKw5B1AufsEK5afnShmMhYjwuF5oAbwW9WubP+rX/iN4jxmv\");\n        a(\"4E0Lefb7NmoK4vKQgHjvsQriDcWAuOl5K8TH6xDT/dH1oh1gO7+MOXVsGp4AOaKHzesUI147oYLuspHTFV9qFXCMUtZcxzSdOA\");\n        a(\"34Zpt1XpfIcmA/S+F0Ufg3g0XcG7tZQvEVvbEc2di1SE/kz5EZMhi3GbnSeybOx6Uk5Xev9v4W+34Zz97+sEd7hX+r1EdVgbj7\");\n        a(\"aylGDFNUo9jWVh9XDd52JkNSozhbOk0ljvB2jpOrmRl6MiKXzqMy7EZ4Daq7l6vTncvx+fIDJ2J2QwiSX6mS8KM0tkfL9mhHbd\");\n        a(\"dO3yCM5kfSdQajUDiqu8uhF1qzhnfnUwymIwoKdwml40kIqUlUWN8oPWfJgYY/xzV6dUAARWXYdQRdk+sliakHMl51tELGgrOJ\");\n        a(\"v/2cjoxNEhkfmgX8ifWLea90mUdzKnuYC9jfd8honOkpqet1EwPVgP6OLCZ2q2Uve7iXE2RnHE7d0BMyGB3q4Tu07FMJaqHCq6\");\n        a(\"OlxAdYhfFOkT5AvKuWQaeSbbFRQT8EJ5B5la+1mTkDSFfkFx8ozX0iRczIWGF9vUs7JJn1BdO0K9DxsFb4JTDO0Ad7j3WZZBnD\");\n        a(\"Dshc0h+/gWf0XuE/olmJq5S0et9SfiHhZ4PlRN4KNnPO5c1c7PHdnjnci9Ho9eO8Nn79awb5cWqpPJx/8Vssd61jV93vCfuklY\");\n        a(\"BYM0Uep4FCjKMVR8nBXSXmvd2PnGpwKQ/6B6y0+SNl2b8ZmwBHvlcLHEtpGGAHjYEar8+ccrzySmi8RnyhxiswXIiPk26AtsXP\");\n        a(\"eMRuPriOCpekBxrRA/RNjmsSd3/w9WoIj5VDiDym8eNsRYFolMrQ+HzOddgdxYmKF5Qe4BLPBlTFk/S5CVvr3QGqSUW4XjHuSa\");\n        a(\"ax9OWCUdTGsEsKYXgZKdcpQGCoubNjZEEfFdKuWkz01dVA1h64vbEmqE41uuux9XdOBdsK0CvTTro2GgWMLP8e08JhSGC+kw7N\");\n        a(\"ACHyOojR7uL3MEvarfCfoP38cwTDQj9hr9x3qhAQIwhKypuO5D/p4q8QUtbue4kNlz+73MniXf/s6GWXm9fp4ie7PaJhN8hDj4\");\n        a(\"M2wcHaF5uJfrcmE17qjGCmwjmb9E9FgGsIbU5EKyxqKfnI3SqfTqQh9ByG0LJiacn9g3BBijjmSFTrBKrlYuuw+zeJZPD6FDxy\");\n        a(\"imrWcsEPZ5L1TjfvfJ/zx80pxraQwxREbRGdsY8pPZIe6u1jHHIEVnRTjwBKTmwBh4muRtwMj3QjffgeqadTJEDR+GN3sjzwDp\");\n        a(\"OKJYaKyhBOv/U73Qar3d8+M9fKXdWwJ6+OhWZuSGpgHO3u62BIKCY1nXDcNaklMpySaVXs9LmObaQo/O8Ol7uuQZ38XIipOPj2\");\n        a(\"XIFjbIdTFSHlaFzZMLfF9kbx8T2aRYQru8XeqIGvG3BpQfmzzE250ZSMVU2pCOnBA0+nGXRMmibcXUg5BmUOg3Ht4Ps3PJCduH\");\n        a(\"+Z+sC6qYPk72Vnn+Pa9/k++L79iN9a17inwgXZCbw8XYc/aXsqnD2Lx3DG4E68qFJ2g1ryKXVOljoYZON9XjvsCespNQgfu/aj\");\n        a(\"fwL+rQ0w8m1x80XiUaxiKEl1ZNGfEyPFYVNeJbzTEplvjpcCPBRfpOLlDojI44H76EpwnOrKxWegK6V/sXblVS/bdO+Ozw3uF5\");\n        a(\"9G9IdPPolPwwifPmU3Bo02RLLLbzDU2neajUUu00EYNlsS4/Ovr14j+dev3ycVNfzPyhfxhz9SJ+o45+kF4jx9L1BsFabxcYFi\");\n        a(\"sRxrpbDBNU77SNihW5MK8AOETAMOVzOwdTrJaz9unYHpRbqRybWZ1On9V/ILhlbRTVIA/BL991NNL9Hc0tlg2fAxBKOa/5EoMG\");\n        a(\"IUeBlH8hmQ8xSa8oyWeb7NQJ5ep253sfQAPety7okfqdxdEDro6pCXnP3EIZCZPKZM6ynT3/hNnPNtNuXr2aby/YHyhaQv5mi6\");\n        a(\"626RJcNU1Y3bBHTnEnQLZLsn7TPVZ8rsp/ryVbt/wI7tym7jfGFTvgmUb4TKl4J8ICdNnPFWU8Z9W5Hxn4Ytyin7TPkeMOV7l/\");\n        a(\"I16/kQ26nlHGJSxKk1dfoxynuPKW+HttwtrgKc91RT3puQN3KVzIf3jRGcr53zXWPKN5vyeZWcMEQPgX2NDnG2bQS23WjCtqtO\");\n        a(\"o/fdx3Rsa5HYtqHA8BP4rjC+gXM7EDwEBOelb9FvWnkPr5Y1Wp0IPK5VisC92mIRWKX9EgFjIan1g8Vu3EWVehPf7UwPHPfK31\");\n        a(\"VCxEq/m3KnzXfSbtOds5NSjAcBvoIGSN7eeWcS633o54eOtczL+90yvne1E3PibJoCrDXuwYPgyeP7Xr9QdOkAF6+kTBo45p61\");\n        a(\"P8oZVjEk/MKA9Xk3pmGSuZqLZDXmXO8jV9dOcf1k1i0AkA8b6doVG1BAv8aGOf/1GxnGNurKxGedND/rsJTpWPlEkn4HbMNZko\");\n        a(\"839+7gU0+bwTVuJHZuUk2uKzBCmEMDoVu8jatsjKTraIIkQDz0DuK9XNZGh9aA1xhw/Ma8+wCfJo1R+HR4Lgq5H7FSr6oz5d2m\");\n        a(\"keal61ZMut7L2rdtvQy3G72sGOUX9wjh5/6WZCz9JuRRUytvNOrBGKXN6U5Rcw3VbH5wd628ETE5m2gMq51iDC93qjF01V2IL8\");\n        a(\"FPiIAnPFPwIMOE5uL9aA80c8TRNJ38Pxai52lvM0v7EBFdmsVr4rs7xcP1GnPzgaONoneHiQscgkqkDMsmtNz7pdVwug5wBcG6\");\n        a(\"eVHmbRMbh22Hgw95qNOBhIUiYYGR4NUQu0TELlKxYfl8WI/prhGcjgaqDRPZOVpN5JxTSP/uYX0iA3Iinz8doJa+D9w+IxzJRz\");\n        a(\"W8FGvW8ExUHC7qL02PcXOoCTO3qVruGSg8ggo7BW15UYjPqvvTGro/5da/63mBNflyAStd0zsczDCagkZUNJDF+G7wPa6tuKM3\");\n        a(\"yl8tntUOGXjOUT9/QpbIU6v5WSdB/yqlr2xTffWdDlP9flqi8huMkk6ZUNpt5BDnGP6sWbLaUTG/ZslzjsD58SEMAcI2qIIRDp\");\n        a(\"yoZ+EFcPObvACsxbQVb1PZOYgMzmgLczI1UDHJlNOn4I9Zlbh+Ao/1O58PxyeL/FtY8gvfC0vq/PJmScFn/5kDjdpF4g27TXsm\");\n        a(\"rAi37fyTFeX3OsFWfGUe/zwPJKT3uoX889Qi/nmeUNHsRLDbzHZkGDIBg6L9ghgpk5C11W4HyyfdmKHQ9KkTgaarHrDSm2H5gt\");\n        a(\"6MNtM92PMpWJEyYYpzeqbrVg9uqROjwkeq43jTwQnjFudyMiCwQPcs+RAcOyC8n0lD3WvCBZK/zLtfmvd4dhNo1KQUJo1TRypQ\");\n        a(\"kwjUH/9oBbXsNBCXvcniNPMl6vaXNcqaFlJNnyQbZxMfLLpB7FVPLqbkRlnyrdi04yjtEZm2QKO0F/W04ZRWL9LQkTatfSfrkr\");\n        a(\"eRTP4Pb5Do8X6IHvNYXzXCxP88AR04ydaBh/JorE0D8MxG1J8t236um89JzTLtPQ1pQ0TaWqI+2olwEEkNh94kdPcNND88xkxE\");\n        a(\"KcBQY+OnRmjviz9fQ+NcJmHH9gXMuKxgXwQV3IwKWBlXzm3LdxgJdm8BaobThXebJBLebv0ZPcwarnvYu/+W6J2UtWbpNmwXpw\");\n        a(\"gXNunYsAzH/4Tj4iRSyJIsUiJrcBJBg2gByiICZTfvPcacVKYJk6W8Sp9u6CWwMpnIjjdx6ENZzhho+IocJm63rPqLLagavABZ\");\n        a(\"b6O2PZ254fowZnyO9EojfY22fACnr5Hpl32C9PlG+iotBRgK0FfJ9Lk7kI4bS9w5uO6SWm1oxUC6smZHzisP22ZEVFKCrW7pO1\");\n        a(\"KOtI882lukDih0B8d/iRXTJkxUeoR94g0XKjT97ALWZt16gck+sYfa9minPiRdD3xTHLw+hyalOHiWuzhYlakP++vfiqVQ3DAr\");\n        a(\"W8u9DVvVz8V5f+x3VFQftmHAvojPOGMXuF5ImQDeNohVWB60w1g83cMVVCmgMdoHv7c+Hlx2CnZAYa+XWYqCkIYEIQ0JQhoShD\");\n        a(\"QkCGkIhDSxvReQpas/jPatr56a81tdDRV+LAw11J8j6KvNBT/SYJ5egCd2nW/a6vFRPXqtFvmvFXKvqBOBRq0SASbqi1ckvj8L\");\n        a(\"eZd7Y68B7QbpV1uBOv7HPYx2moXRsUTarI9Y7UDb7ZjkbfZHLJaDzGVu/g8vRKNASClq3CS2U166wArbA0DXd8qfC3Gy3fz0sE\");\n        a(\"2cSjkrPIbWtiUHZ5RKDgBVwwO0NdgrOJYPfYC5ivzasDvT6eQzO948MCl1C5ziMagM7rv/LiwY1JGMkHyz0Tb/slcIddyNWDHi\");\n        a(\"Tpw32ZkYf41AvHzMWYPeP06NK88S3gZKpfn6e1TIgN2EWukGYO2r1Ndn+/LqWSLdFHaTPfi7DNQadL+BWgMQBGpB2AhZnlVZvv\");\n        a(\"qDkWU7guIkj/7O8EXGGHrteWRPCqJanIqksM4fNtDU81N6LFiaaUs49ULm75oZynq49pzSZJPN5G6dO6zeRGSEeBdJ3X+nAfU0\");\n        a(\"BfVUBHnN+GR2nzIAfTJmXL1r0bzK9thE8/QLWAHa4BjnX9xZvRWwGvIZ2gooVkfAN2P3vB/hQ6CpeJ94hWTXtK9OQL7mNxEU7/\");\n        a(\"coJqaM15OiEXZ7JA/0Sv/cj0p7JG/dksgeibSfaTC3NLMDaPXMb2esgpdaMQTKNxXgqo6sSAqU2HmqbK+uNjrSVfc8r49RDNi2\");\n        a(\"Z8SMA7cZPj8A1Z0trwKsXfVUf09tzyGo9WjUyrwAo85FTrEEperQBvQ3ciFlzzBl7zayL5EPCzL7J4/0ChmPqwcpCj5jEhDx5L\");\n        a(\"utx5+Hc+Sb0O8w5GarnWr47fITl9RJ7uLcOjkROx7ue/zNYy/H2joHvEcthINEDMgeWJrVRoJ3vHg+xRKvD4MfyKNeF6wZgtwx\");\n        a(\"Q7VQDhWDcdlqMezM38ModF2J7HLOYgY3cr4u1LGJxYcQrttEt9vzeIqGiruxkkyBmEflUdM2hWubIR86DK6R/Ugt90LHKj1a7g\");\n        a(\"0WFffmtVd/JnlO74ihNA2jVf5/uRy/R/8gx2/I8sT4e7BjOGFrvDH82CHGcErMGHZbx5CH7cinMWx1yJEIKbVtD9PZQh/Dlfvj\");\n        a(\"jGHXn3ppFBC5lSJ/2lO7z1l5/DRlRxN5fnysl9x5skxn2TvlOIj4MZ5Bf2lv3j5FT15LgJqJ5Lk6lLyWRT61nX9esYipqrGlA2\");\n        a(\"lDQ48hgng4jlJ0OCZonE59yz2CTTQBRTJ8+YXpFS7kcFMO4X9ZZppI/TzwtBCvDO7B0ls1DSvx9y8xq2UA5rbHyDsep2RN93cZ\");\n        a(\"6hZHsR79dKycL40kskp2s6mmc7mmQIlxnJOOn6T8qOSRaEKE8A8piiI4jkHp5Dt0ivCypAi/gS8yaRYL48THOZvIrM0+KXuCPr\");\n        a(\"Rrpe5P2h9anFNStws8KbY3e30SLnBTC+DD3lv3deX5MfZUiZQWtST5Q1nSslEY4853qgvW8hiNQxjwXZEDcH8hooZwVn9wQU9k\");\n        a(\"ahjevatftNrNcsBuViPLlqbmoKAvr8NVdzlatVk5Ndu/2OkaXmQy/wQH9wyowzeefMMP4cuUSGrSTvJNjOKyUa7zZLKU+Qhkd9\");\n        a(\"3dVB5CSjnOJLddSixy2nxhBmNAhY/vEhDozcZVaiEltSKjc3rEJe1gAFxYsRAtZcfUWtEp08ORE8rDXC5aHTmGyyHsmC6KbNRs\");\n        a(\"piyykWf5GxXp5cv8yFcT5owMIVkKJUvq0uBHWSlRJGA64nLkKesniOvD/kV5ELqn/CeOJYx0p02eknLG5k6Jk9u0njlzbIn0OC\");\n        a(\"XE+ywWMS7rQglbmwQskoU6hEUMWzn1gv2/toex/1mzflKLU626h44ke1YN1n34sEkHaw/j2g97/0f2MC5Hm9qMpt7/wB6G/uUw\");\n        a(\"jF8MNYxfdHfo2kn3PNu/7Qvze+gwwrZzB5vwII6/zJ99g8++MCe+vuxfK/v0lxl/P2D+H5FMQxXRG3zL2Ggh+H5qsGcofdR79z\");\n        a(\"Mzzaz5zfDsbmV5Ihf83etj5eP9c5huve/C53ut1vvSbpHHF+ypvx7E8tpZFL4aYaUfbCfLfMtWpvxi35edKNzn+/L2gbZEla7t\");\n        a(\"sqb27d9dqL+z2q52+0DdR3KqsIevTFLw2NgVuu3+7AeyfDr+RobSJ9OmUweanXUkkHdpAxXYICFKpZIHUB5x3xFMG8G1twqUyP\");\n        a(\"Io+b1rOPYyWdZFZZtQln1lo+zJVJZL9W8fe62bSteitG/NzAtvyX3/9atO8u3+0tf0z8FU1aGoylgFqv2d5vaHUw0FVIMOwPa9\");\n        a(\"dgDs5/NXb+xXvtniFhKTxCUfOQGNicNF8bkgVJtvEbpnhxA4QwmcZ7HpddG7pl7kWlXkfVK+eVAVkfNWTUUCpiJnqCLrqMjVso\");\n        a(\"iaeT+KRLx6/mEq/2zKf4bMP0SQmXGUOZPKIoD3uwHcEs/XALlwtmFxWMSsE/mz6a2pPAl/q6unUq28Ca5NI0m0CrkR2Rd81zX0\");\n        a(\"tazXURONVh6FQBQqFdWHUvlkKv9rlHe9yKYPXuvB1bgQWWiDrjwSASzr6uoxlDeF8s5CXtGB9cgqujaCEk5OM7q2pceEPzb4q2\");\n        a(\"+YbEDu6AfyyMUS2hsUtG+lGtAOJxBOk0DeoID8c6oO5DgDyFGUEE5V428GMoG/6W5sEMbbYtWhxlR6VVW/TCVaYKDhZHyqmq34\");\n        a(\"f30s/ifQN9cdUquVoHP230AvC1427OmvdxYFO4M7a3vGXZ/cE0l2Pdy8+AgvG0XnJreuFsZ/eH5RksvsH1fZIlD0SUQJf1Z2lX\");\n        a(\"GFkHZ7pPoA7ZYDVN2zjFXCqnl60wjO8Sk0vZV9T+9oyjqEsu5K1gnzlbC+ARcTI4UvGUWcDT/XOf3Y71h7CFX4KCqUwKWFqqEQ\");\n        a(\"8a2ofihXf32Gbs1jp53891d/Bs8/1686L2p/+keufbS9dobfVr9d/6NB4Yddv5dtXVnoYyhtYtSFWb2NbFSQvtRixLKFoioZuO\");\n        a(\"0qpwisrNSTPtcDu/TA83ogxSkDozmQrNeTWsHWjqYjrWL2cRF+N6Z3hS6XeF9R+J+EyBncX+mvnCKm8fDiwjlkLZ3Bms1Hj66R\");\n        a(\"+ENp7X+PSSulNPSS035AWr2RlElJHzlknUti68ylxEZZbizSIJ+kp2VT2iMyLQtpLGskE7Mo8Vbl08RjSc8hpP1lubEnrQJMvL\");\n        a(\"Q4XXC72FawvPCCUKVJR9IO5Uj6vD1KC3fqaNJvqtXP3Ovkmfuxw5Wfua3CDgbb6FLr0X4+kQYoyPlNuvan46JRtiKhziV9+3uK\");\n        a(\"XEo0IbifzslsXGJSc3HZel9e89JhMGjBFiiEvybD+oSzuQQZMEIbZsD4xKSvipxlY6mIs4XNYWQGhqpjOB9Lq1dZDKTbzs/1MT\");\n        a(\"cpZx8n6P7pT1Xaa/QTTkR4Doq+/J/uX5WPxtiH+EHhwpEZwIXjaqz3r98f1rd9CM1iH6LFk+P8X/im/Aptas1/+0/uXzXk/mUQ\");\n        a(\"G4O4Fl2VNODoR/u9byXilzmciew5XHsqnQe7E9pzUPNXJP2F9j9/iyzzR5feHnqaUab33f8j+4+Hkv3HZ/sdbwyrD1wkn7E0Co\");\n        a(\"KNcPilD0RnAQZiMONNI9/QzNnn2V3A2PXdjrg6gb1F8/6zYm7/tiU6dPtVs8Xo+LmJl65ijqUHzEM8l3GU7xqmox0x7xzdQkNF\");\n        a(\"Y7sSnTJJqbsK+wJRK2209GfWVf+P/lwg+lPKTUSutPVnydV99YctyH+oPYawrUeSR59v7VNifrKVSsbzh/T446gS7oDV9Md/34\");\n        a(\"Y8+oP92+MLtgt7GfjhkerQ0W/aFKDfH8DIpvEKC8Pfc7Wo0u8y3pOD3u38rd4Us0HfYrUg3frT6EXKJHhf/c9U/bfo//7qoO0J\");\n        a(\"LfuM9g39WezugLG1a8EsCckqMTUJ9Hevrv132kODXGrNLaqx6XpjD1sbi79/x6BRm/TCdQ7tzQ/hERMPhd862f+W+b7A8uK4ps\");\n        a(\"AHImWcdAqLerP+bpqQLnofqeQLcWOYvtrwZd+/7f5IfWw75jyD7ij/PM21e6NQymstZBeorYWlBE1knMooJ5w9kwRnZwKzgoWl\");\n        a(\"8f2VUmSb4d91nqNijnD7N5JcjQMNt2SSvcz7mR2fx97/mBPewCxl5uMX5kqG+cwF5M9LPmPMnsfGlsnrtr4v5cb3D058UDxf78\");\n        a(\"O0WPW9Mg19L/WG34Fwbt/rSTnw75ThTIt6Vwe7osfLegoHhP8C3HqNj6/ER7dS6pJabHElOjSdfOboruNPVUts7myJ0B1chr1e\");\n        a(\"/VQp+HE1av/RNQfzIFoi9Blrve2m9/h2o4TyxNSkzbufDKS3s383IbUNmYLPr9eR7KcK3WPGt4OkFGwyElK3jsKhuZuDpXNE6K\");\n        a(\"1gaalZ3y5sHW+rCp0BKcabq/DMCXo3i1Ap9CDDZmkdCsMhowoyQtPQKx1TAK0zzJWsBCFo3ih6L/qd0FrEeU/ZEchCwr6SqCGS\");\n        a(\"oeODXukwoxb02NA15r7jxLiR/QySlrsXRAy/Yhoy9VrUNiTnBy7pSq7EzOsVpcuK5h2wVGRGq26JPfw+zYELew3ssZxXQE3F2s\");\n        a(\"wKnVX6Z9GFP2cx+1mQC2myOjJ891nUQ45I4b1QpGeECufkF5YGBnA1AdgYbUsqDxeFZs5Rb+dKNE6USa0tnOMMS+ZMiVRnScVv\");\n        a(\"zU1ZsF8vE7YfiM8AYugFo5b3GL7/hTxKPe9g7I95VL6Y9LJNRhafrSp7ffEyx02f1096pyNxuuaw75+sxND7WmJ+lVxT0hhvDy\");\n        a(\"mvbn1I+mOrmk9O4aTQTpH0AhZm/198lMbqGwn6QPvfKvYNmCnj/aGUdoO0kQwlOW8nPzWG/32EbeSuXRhVszrQUf3hFutyUVzS\");\n        a(\"aQ10B4JFdxMZ1B4p642aOmovby2wGAUoTpJXzW6MBVVZ/fW/+nMWq6jXvDdxoEabzoGGJVTlKk5tWEThu0R4IYWzl3F4AYXHij\");\n        a(\"CDsEjkyabwL0S4vRfh+ns43EbhShEmezOaR+RZReEJf+LwGsqTLeIbKTwWYQW9zX5UDf+UaLpVNZMsYb38rRG/rCIhg4tUcKEK\");\n        a(\"LlDBHBXMVkF0Rg+2qSC6wkG9J6fhbonoNSpHowyGDQ//ruWrRgm6Z9HZ0am9j12nz6JdBmo8rrprkT2s45j2GKsN1nkAmlBKud\");\n        a(\"4NSn2tJOFerppThTUFNDdNlPdqqBj0bzIHpZI0m+TQJEVmRGc/ReTDZzv78NnuIDhWOCBRP9p165cZSqJ+lMMkUa/guxWC+tis\");\n        a(\"apZuh100iZSZlKpdxSntkUFiI5uAMISY872bA4NPJya/q+5WVK9P/jhIjYo9oHQyaLeOH+m/JPtIPMLy2O7BVUcvtOJnVOhuhG\");\n        a(\"3rQe043J/pTtfN6AD6VZE9RdpQp982+k1yLa+n3yHi4t31Af4Y+yaJCOrWudK1e1ey7YpGRFZkkXhxqGRzdG4jKwhJaVLtX7Rd\");\n        a(\"C3xT1Rlv0geFFlKBQgGBIoWCPGx9QSlqAw2mkkyePgBxs1rYg+mwUaYtrYRuDbEY3XROh7KNaTenq9NhcQotdW15iEXYrOKjzt\");\n        a(\"etAa3KpOJo9v++c27uzU2atJvj96O55/Wd73Xe53zfjTiP6vwZYGBSwBG3UsQmHlssO2Xcp18g7oci7jkZtxC2duEDhM0RXvkw\");\n        a(\"T0kHksYkOkllYGpcJRKAJZ3aXSV/FtYxR3nOJ3m36pcE4n76ZvAHv4rMJtXWSOepYfwblO1K2BXC2ZutnqWbESLdy2RanX+MJl\");\n        a(\"+hzg1ZX1hWiETYuLfVl1jOs9XdMco1ksBYqu5FLXeVtwkV2IyAiu/Zq40qwEJOXMsq0GBQAVnop9ezCtRHUwFg4axnFvyyu3cW\");\n        a(\"gP6hTL9D7nfxXds1uDXC5I+UlWdQMpJ8igNJ/jTdS0Yf/TZXvUl9gGyAa+NK59prOEquBWw+XgHgYzuvCSQ6tzi80o6fvGUMUy\");\n        a(\"/ApfJFKgqurRwqDbjk23yWzU4Kucu3x5WqZKRBOx1IV+2qVcAhTeWL+EThn4wbqnF556qIXH60JBqXJ6yOyWWJz9Je8PkUN5jl\");\n        a(\"t655Ty2JDpedy49Rk3JfDUuMqs/ZZxnkKSrd8ZjWLuTwNwFMYSmP1ktZHRBvRQG9mst48WSw+btMAiLwI6A9s5aPYlWF356mU/\");\n        a(\"ifpWmimLYyoiiG3xRNFA+sii0KqXwbqPev4dFQp2rVNEqGa9sGH6BSVm4oaWkxeHvAYmwr1Ur+E720lUolE0n+dI2FFAnm7bqN\");\n        a(\"tx8q7V4UX4WAjm3ftejYtsqise3ktRHZ9lZxNLZdv7IvbFtezdSfb4lCva/zlSEG2sVc6eCTQDVcieTs6Smk+jM0Dsh4smdQxq\");\n        a(\"ghhB8B6kdlIaxYPUTHisVDNFZ0XhORFa/eEI0Vy1bEZgXS16q6UDgkhi7sGcy/ZP/gpTjV/sGb2uKyCV4QlUNrwuwfwMOqxkMx\");\n        a(\"o3rwOZ7Q0DdmPXHIiVCtCCWLUJ0IpSHE3C40cJvhLAqBo/To4XT16OF0I+QfLg03Bm0x3DKNuyuKQxLhYa3nhNdmIIEOO/enam\");\n        a(\"K44eqIYlj4nWhiePma2GIACnGqGMo/jzZ25aeGjt03PxKcN7IObaYt5JAR3ClyiPede8nOZxL5+90iZpbPCiWg8kgyUdJ0mfRL\");\n        a(\"TuKCao68vZbNmzjaKWaX+dbZlqpbOGYehZJdJXKeym+oJQuu4Ha2jb4ZoEyV7JvOqfxNJo2vKxZtYqwEJHHH+UaKvYU/hU25Fy\");\n        a(\"kRjWYnQmrWfE63bE5P0YT25PKIQnvg+mhCy7g6ttDUBHL5DQcMIekFscasW/mKm26+//ZAsP6urYL1y42paxOQWixTHeZgqmZb\");\n        a(\"jaVh67ZsnolU1txJ+NB4aMePkU2fDOQcdgEomV9AvYE4XvFxn9W1jPggCnv46XrnQXHPmUVAuWCrGHykL1mM2Zi+kd5cHF7OB0\");\n        a(\"5cEMrIOsPenSdTpNSDsNLKQyjWeadksfAIzbldmZFqemEaalqDIv6Fvqhg5yOPzMCIMEFqDM30UzCYZoIH5yAM6igaj8sk/bTM\");\n        a(\"Qp8XpDoT+hFaAV4zLiJcji2Tb+8YgVDLBXcma5o5bGlEzfz3qmiauXFZbM2UmInzlhP46H2M8w8QXJYMmR3QKlX3AI4vgRBlng\");\n        a(\"LkwfGLAW1e+ttWMXfxzTZ0uUdN3JDNFg7qEJLv3NRNDu0hW9lV2qRM12/dj/4HH7zl7eMOSFL05gm5K+j+BDH6VvL5AHD/Eq9o\");\n        a(\"JWeBMgY7OwTspQArrMxhF8jOaWJfsobgKIGfBqh01ZEkTU7fXxxRTstWRpPTP5bElpOR05tQkU9jEE07r0Q3pSf++g8l8c3gAv\");\n        a(\"yxTEsKHQ8sD3Bvj7f9kXj62f2cmoFUv4VJKi7IoggGL37yuTDuF8rV+75EjRPfWRSRE1esiMaJg4v7pLGZKomr/DHWr7MSQ2n2\");\n        a(\"bxU93v1V7/dIsseGkL0/mKGjR5qu73JvyIqTEdpkbQtDmMOxrsHBqVhzgsaC1VdGZMHl10Zjwb5FsVmw5X7ULThwx3tR2+ysBO\");\n        a(\"O8lPfk3n+A+2T6xjxgKOO8rRUh2ox+bRPsorPv9RezaKwSRT67TlhP+SCeh+BWMUDTD98boB7BHpxZ7DbOLL643zCz2HsGzfnE\");\n        a(\"XaL9PRQyfbCr0wd32PThR/rpwxrqbQ3Th5QB0aYPJ5JCpg/jVorpwzgJSCIIfhnnD/aQ+YNdPzD+3awJfJ0zosCvujqawNu/1a\");\n        a(\"/5w+tZ/Z0/XGAWWEeeA6Src4BUczhx3YAdHO79Jv1wb3KGDfcvsz+82OP91gnoe991/lfj/R+c/RnvD04ke+HO2OP9Uuf/fbz/\");\n        a(\"NuHid/Q+3nvjNE2auDCiJqUuj6ZJWx39G+8PfRCt7+Ch48BH/JKiUrMMH/t86JYY5z8bYqRX6tLdndeQu8/tKEP/KNzZchu1Sy\");\n        a(\"38kSE84HZ9OKMzOzM0/JEh/PgEfTitc83K0HD2qtDwRwjr6Vc+vCuKf0k+n+pQznfzqsm7ygz7XuXsYX0PTKAjqhV7hko89ubC\");\n        a(\"DZSGvR88UELHmF/uIbPH/tUlvqLiZrwLJYcQhxXcioSBwMaOBIB+/wW0xELvdHNJYd4nrgm4ki0TDrzAryTMyejo6Q30E0vRNr\");\n        a(\"J8Jda8f92avMZWU5pl8ietsdaUZQUK806VPyouzKUX9YS/CAy/bzJkTdT7Jp4jutvj+7nEmyhB4zI648Yb2Tgka93vuFNpN1w4\");\n        a(\"CffPVRLr/QbqLPQ0h1V7k6wWzthQ8+O6mh+WNRvfQBjlYb1avWni9DTbPK+wPcXLAdWdj+HvR1QZrDPhXqFqjm59oRmVtHCMbP\");\n        a(\"QQGO6+m8oW2HJPSLsQVvffTJadA6yW3ybdOrFg85euEQR4Mq8wh8GphL2mzBwo2El5Ck3d1TiIbjHZ8o7zeaTghPV6TURSP627\");\n        a(\"yEIBeqC3b0IPlBd83amdj+eyS/OqfeIBMo7K5Qvl27rteW87LI5mh8XZxP7xQM14+9QvcHuyfAC/+/QPwffGAbyvg7ekr3raQv\");\n        a(\"xzCi7l7cdxyTH/AOWPZ/eQW8F2eZcG98OKPK1csRMMKfIcRsXCj4Yzr9FpcRx2WpxtucecVa9uXORfUOLbYirYcn7B7ObSmbCC\");\n        a(\"1G51+79jdX89+taE6fBljpi3gzFJBZWfIA5ZXcN5H6rRZHfvxf8mU1HeG/wOFr8bLXyUddeH9Hdql3+8c2qrs6ohSBq+Q0gDUR\");\n        a(\"H6v0D6YCsJdy+QLx9QL7kClAfUy6KqJyE1/wcFfcxP/NlnV32LWN1fmcqTcxo6t5F+QQ1snv1W92lcqr+bL4sd81lBH9SmNKuo\");\n        a(\"+Jhl56pRAbef2LE+1f31OHrs7s9EyHJfA3TTb8fdwbHIV1k2KjDTNcyGA6uLbHmvWx5tAGSaA2VrQHLcXw9aP9ztPysSMBRMRX\");\n        a(\"5b3huWe+4U8yfJKKP/i0JDe438fh/vTRT4N+wKXgkPtt+qgCtxD/EInZ7swFZg7bSmsGZNwFb1vuXuDdSGXtTscVB74vsV6OZQ\");\n        a(\"pqj4ZfvU/eS5wf2uBQ2ivBFZtqQmVzvSAvbGTxKoKR30X0x36nFo1WFBh7kCWSw7h5vVq3iDeLaG42ZvPGOwT8mw9XBhXHVztX\");\n        a(\"AnkhQIfYjv8IIg7zpDb2K4/2mwX/AGuSHaxS+IsmkvwtNc4i3vLsGbyvm6F+zX8XX+FO06//xD2h6r5RI09yuWqnusf5N7rO0n\");\n        a(\"0Aa7wg0FaO8DPUfQUTpqUItA4DHsI5R46QVz1asWW5P2sM5433BetPutTFvk53R/QUFPu7sbmnxaPP0oTac/q/jtB/kB7fwn/q\");\n        a(\"hvGTRrPEbyE17WyE8jE7sLlxhtMb0OX1rsLTMWrO59GqyX8gErsNgIq+Y4zSyh77FgHT+gwdpAsJ4Jg2U9rhp4eTzcLkak8a9e\");\n        a(\"6SmQ/uf+xR81lSio/Pha/q7m8w+RwaccLTBIxmjfr0fY9+sR9v16hH2/HmHfj0MHQj3XuXJ0JvzqxG8V1S8/qXr9Eai8eX+wwG\");\n        a(\"AwRHq462De8O11zVpgZ0Wqup7wp6jrCmTlS3b5yxsqUghUZVlaYJLrQ3wi0ta+MceBq0LSgKsDP9RYmQdpoA4RPoyksuWutkKv\");\n        a(\"fbIk3BCYUR8J4EP8WqtfmjvJsmkYhDh9kmXz14PwO770SrogcHu8uChwXoL4/Yh+kyybr04S4XsSxQWChQPxiydLgSQRbjGJcA\");\n        a(\"XiO58fRPrMBpzY/m4KXzpaJO/ptfJ0rdhhTg6ag/LpzEH9LVMIHp2Salj0c7uIYohKwlVQ8hYURBAPbAVZN0eqw1uIuaA3cjWr\");\n        a(\"w6vxhlSzjXZSi+GK6vmzZB0poo4r+1zH6fFhdWSH1JFH+8Le5Ts8bafaLUVtnuU77MVshLdOUyIyPLi8luIqZ88onQYp1z6fg7\");\n        a(\"pY7rVLucf2OZDMYCH5Gy8Df+idtB1ZyVMXZ1ebzW1cAt9sArJO7j1WLkaZ+IG8pg7KbcygcHq9vYltSDit+ZfraXUuQxWtBrHV\");\n        a(\"D+yn2GaFV3N0gb6aD2nSf6NebMv6W8eRcWF13BJSxybUUWKUm207KqjTzN9MbSMDaHgfoknr9OJwae28BGzx0Btl4kuqxHl7Mu\");\n        a(\"O8IGg611OaNSUCAWmFcH6Dm51qDRnZ+EAN3HPmzwXomQBN3IiXkBcki62uEYiPDh3XSOJCwdMNTeVfk3VVtOejigNi71WPf8cA\");\n        a(\"xv9y3Iigk/he0bfusgBjKKFKwNV66HcQ9HVJoQRUATSfDSE+KnjgnxwGf5Ye/mjAx95xSjj+mQL/+X3iP/SEYT88SQd79xzg/n\");\n        a(\"RiKO77UBMfKSb2gfnJetgVetg3zGG8lyaG4b02qX98j1f58k6WDr6ZcP9XQijugyXubyX0ne8a/D16+L/JY/x/lqDiH6ykNpHx\");\n        a(\"t/e5ggS1gtX6Cqx5IOBCSYDKG0eiIOBsxMfkjxH8nok68P+czfgfiVfxD7pZVxIY/3P0MHlLQjWInT0PmDWbRC9olqX+HKGUZa\");\n        a(\"eu1I+olE+WSpKlymLV9QSVWiFLDVLbvyh1UXgpOceqEgc29K0CWkKjw1kS0EAJ6Ex8OCDLczpAjqVhgAYu1o0BFgno2fgYdBxZ\");\n        a(\"hFL3yVIpstRGUersiKWUgllkm4zyD5X5vyXyj++tFj4f959HCjNYFhkjioyJXMWJMqNNdOrvoVgwPFw6jLx/5NtqywfxwIAEsm\");\n        a(\"nrrAWoelIh0acq1y4AZXebhJ4mymp3QC3CqrTWp4lBnIejCSP1ltbr2D4gjfpWgNLmXSvNjP9YPTDWb1511qbxPhtyB0fKc0WB\");\n        a(\"cRFaxGwqMZ5KTAeuwfGb9tCj5WbqwYeN07GDYauFpQSVhCEjwkhIIRI2Sq8JvFswkPxj2d0I0VyG1hSN75rFWuPIP+15p29Pss\");\n        a(\"PVT9lbajXlA5ANDuN8VNt2XW3b08Nq23Yp5D0M7ZcisFb5+1IsXZIv6gm4y3cExClP6ESsGKN8XpulZgfbS/5VnOtKijJO1vDY\");\n        a(\"TCeoVq1etSefdGn4JOBpVOt3xgb343Bw/7hEnfkvD4K7AeBK5FoAaRz3LREnjXh28G1sdXGw9SdfyNPUDXzpBmslYcKXf7BWEi\");\n        a(\"Z8DQY5xXqa7b7lHBPmz9wbagMui+rHC2n2Vv9gNVhLQTXQSrtWiGjTIvLtSsUQsgMPISfY84cnl06ykWFymWNR9y42S1JFz49l\");\n        a(\"dWvbTH7zM6bqdoM9HCN+tAvfUlBLszsu2VKwQ/e9nb4xHE+hXwm5AGxS6yUz95VlZqzEEp6Z5M+DwzuFDCbQb3ec+N0uf6fgN6\");\n        a(\"QcrBmaA4ppGEwqNFl2Nunx1JvNs4ZUNNM1XwIpUFFBLuUJkwTu3jAFB9MSe1QpjQPRg0COxGGDZ9524669Vp/yHT0k9LzhpXeo\");\n        a(\"0MVbs97ez6DPS80yoj+D3NQnZBH2zQW/MvG3Sok/VZfEIJIJanR+zClNFRz4PXUKBsIFn0Lzu5ZqfMoIybKLlzvWT4I6VFwwRS\");\n        a(\"PfM69WT3eoEAw8MNij/VZOtP16tDendA4jvbsQbpYqJ9ChkESP3te1+4eVaH7q1MpDMuUvaqhIow5iS2FaYG7e7Qlzc249bMyx\");\n        a(\"caQWA7p5vCk6Ie06Gjl2rqVqlkmrUjTkIVrOa9r8o3ShWh1utUbc2iuS7PnXKJHq33dcX3/NUhPobdNl68LxhBhGEszoBcWeJz\");\n        a(\"7oEZuSBr8RtHF2uf8mX8Qyzm4afTzWKf5VEdORSBsm3jjYcPDnaTC4y3mPMmToMmSEoz/oOLWFELl0euNCJNgOBnSU/1CNwdWa\");\n        a(\"DvzSfk0wCkE9aNaeRWJQUMi/uNiXHFLAMd1ApQRnpbAdedvEcIw2+LG/zltFrLKyF79BGDLRNtiM51Wt2Korx9aj7BwblTYSTK\");\n        a(\"/7cdLL9/dnaCre9/019p/RI/xn8M+LlZylppZ/+DIUWYqweV722nJwOP0gRXhds/XO70FhwZaC+GrbSZAKfZgmbOokSgs6MwbK\");\n        a(\"j5OD5McsTOI6t46gfahCTxd2X9dnIt41ht9lnwmUJuHvsI2Z1heHCZsRI0p8wXjLxmTri5Y4raxl07/jJNyH5Rbut+DPzlL1gc\");\n        a(\"BtW628XVI0HYMsjSTEWnbbwrfEaCXNB1yLBlhZbkUtDbzT8EuIvfNrROhgJPYGY0Uc3pk0CDhJztx9KpBlBGSnuA8hU2UZ3rkN\");\n        a(\"COOvJxGWJehhz80TSb1YBmKbg9IVz0VaLO90PIglhP+6Ej2NN02LQWNyCI3wtwOt8Y8CDAFYTH2FXcKprPb3UzR7dcosfQPgRD\");\n        a(\"BN76V++1zyUt9CVznODEfFApTSiYVqUfFrW5wn+ZTDWNRGRW9CUZQMWLZWoOSamtvNOK07B7z6/oFBWgl7cTMMOZsDpla3koO3\");\n        a(\"1s0mLS24p4NMZKunWV+shXxeiVEPc/0m+6l2TxPOrhFffARn1ziY4Umjm0xYf33asvUOfFCk+2OTxn/lFqwoq45Z7u4ExjjxKa\");\n        a(\"YTn7JLd3OLBi4qvV/lEb2vSJbhhRSIp6M/65ZlaYHqZckBK85MrXknKw6APrXQS3l6Jln5jEmjAJgK7MdSWf9Iwv21EFEpbnAw\");\n        a(\"rECOpYoVN5xLhGDefsvWN0OTa6ymLWDwHNtJy+ZGGsd/4Sg+UHRKtRhUk77KbsIPK6qyaCCqhFIK9qgd0MfnEyL87SxuKUI7lJ\");\n        a(\"xQGoCiSu/R2cwk4v/Uw0FWDQJZjuImx9S9YD0x7CxmmFro0dl6Jrm/DpRmqkmbQ+C5O03NMPidA30OJ93zD3+Cz/2JCcZ6hofo\");\n        a(\"FnOs9IOQOMkNVzwXKB3u7jG5srUclXNmuDIkDuDOanLd/d0paOr1Z5EG/UOnPedfjOhfIxrzBqN2SRnuQUuBgQqD5iomgdjBsH\");\n        a(\"gVuXERof1IQAMPIrWEaa4xCKEnMJTKRyn/OaRlY2ldFzHPSOQxApVIvkL3vf6axv3cN9BXb5vcv776xGwwORDaV187uZ99dS0B\");\n        a(\"eb6ffXXT2Eh99VvnGfrq43PB3u+E9NW7JvWvrx44m/rqsXL+Gd5f/xjpeg1Ff63vvme4snTBDeaZruFqI7oMI8uW5SerF5n9E/\");\n        a(\"V5TDidV/OMUfOYfJG78ocuDo4Cz+CRDjoss5enC+7uhI2pvFkn5w8Ru6UWOksp5nT6qplnIlMs91OYwbC77qdIBMU1FNR3Th/N\");\n        a(\"1zqnZxIidU7OmfrOSe2YskngSUA2Qr86bVZPb4hilMks4pZnlmXkQc0pauo7Bwu7DU8SlqYg7lsfQXykjvonNBkqp7Gk807xdk\");\n        a(\"llGyb5DFeyzT9STRgKfg7VEtS2dVxtW/fItnUFt62/G9qWdWKveucQAhB6R/ahIfTOw4bypolR25WEgXYFAMsJgA8AZGwv7Sn3\");\n        a(\"VWpKG0ZHakr3TTc0pV/noSldBj7pcFp3Tp9p2nshsvpCGoprVITmdC7vyUSe8Tx1QVDXW1K0Gc+pXB6M0EwwekGeT6T0TZ4WyN\");\n        a(\"PyX8vzRxP6THvzBRHkmTuh7/KsuqAf8qzNiCTPveca5Hl4Vrg8t2X2mabPz++bPFdc0Ls8386V8izNUGU5LUc/5/CP1vpFbQcQ\");\n        a(\"ox9KWd2fxvtX8j06QwtXx/AZ/LyjAJ1uXOlM+rLsXGTW9U7nnRupd/IAYR8Bt7oDporHOq8j69qaLg2TgBI8bapCjdY6CIu+gw\");\n        a(\"Bv+6lTY8f3mf/rcyPo1Fvj+q5Tubn90KllIyLp1A+nGHSq/KJwnSoa12eaHskx6tQMy8+bXKMjqFU8sEc9kfXqJ+eF6dWRGQa9\");\n        a(\"Ch9jMPgF9Wq+1Kuo+vNpdiT9KcrV68/uSBXhCt/GUZuPlabLMrQ/sYlPV0Gub/MxSxUdLPH6HnGlI2CxYg7+r6bLJo/RRRk6M1\");\n        a(\"X55PByTrZmp0pon3IruN75myQeE5HKz5g0TLR8CynfHcF8wjRVVZt4oTV5Lr/Qag+dPHju7xBPtiiXBkoOxvszAXAq4ac1XQ3i\");\n        a(\"0XwNolZdNHh3ZPK54muJkiEFprkWy09bEzWrJEpcqJ9PVFMjqqkLraYewRCkGgRSFSJ3q8CizoAFb7CfRMPks2UBf50o0RYKv9\");\n        a(\"0APypdvyGIJkCMwPch+f3n+xKC93SCAZ4Ro3ZRwZPwDx4DPzPB+w7BQ/5LRP46I7h6HQM0fp43JyY/d5DaxSeo/ByLEmHo9k9P\");\n        a(\"lowj+gHcF8IyydEX8vqrd+ZxRH84PKPIGfx1eTH5+eexdF4cL/g5Q+SvMwq4XoB7ajYnN+jqisHPZQT9GbPKz5dn96r/eIcqoR\");\n        a(\"srj6r/Z5P+S/h6CdUJmP/GTnmv+nDZ7Jj68HOC/4WJ4asANOiPSOhGjCX8d2bFhH8hwf9Zb/Av1eAj5JvVf/4cHQP4F5h65c/c\");\n        a(\"kBoOXdxf+ZYS/CNxqnyfjAIg8RYkRmn7916s19UGQ228z56E2vxrkdd2cTRWJCaJ5MhtYmrseh4ZTX07Hfx0w7Z76ZzexsoJoQ\");\n        a(\"vqobphcyHgqLbZrleiHtSyr1X+EZvu3hcrDae3hvc3D8qjgCO2nBPy7Kw7wSXfByQ+b9YdtRUUbNmAVekFuBOuvqP4R1mJo+YG\");\n        a(\"eS+9CHZPHUim7DiHLzhp3ZWJ4mQh3I5zh0kXYSOr4+SZALmXsiNDi5Y+RWlBwnzsxE4OWH6LeZTVct/fbh2AuxN5H1Y8Dtptm0\");\n        a(\"+Ujg/iVzocky79TOl1zFJ8hdUKn1Ks1R6LGO/jt9KFX+/yHJwZzabpGhUWXqYcZJa0kZzaKWd/pJ2JGO57s81CWZ4MP3UTkIRI\");\n        a(\"QF77UGW73r9BQTXuibcQUHoHM5mmjpd+Do6Y2v0TcBYh+Fgw58J8V5K9JiHfn0pvYSrn5se5Ps5tMPg2CD3fpe3AZ9CdGw8rtf\");\n        a(\"vvB9xNCezvi/xjsTlo4OwZbXeDqQnMWuNherh/Bok82RnPrcyPK51OFJR9RjK9xQQ7t/cG2NcdLWPOcmDTXPhsSIElSLb3362R\");\n        a(\"YMQfjenZbDPee6h3RBuVox+ekeRE848B/x140QJXeyQKAS59DnoiBzk2w6sIuefympXehAEFe1VALLHEPbDPixAFZRLHanQhRj\");\n        a(\"NRb3zvBvkXevbhdl6OvXifswa7wUBTs+4oxW30NzE0hr1i6CTec+0nsNobguJXi0xtUpf0dnsIV2UlQOLX8lz6r0+b6HKU0olF\");\n        a(\"CncPldHtJw9um2yG/8G3zmgo6fBBeh2lf5/T3ZfcgUCcK1O9479qLHunXo4f6WfWk3gNsnDFv+CKE+0c5soN/qQuxpdRmuH45V\");\n        a(\"D9X7+p4Wc8T0eeVMrTwnm8gz+dhMBDlxJDmugghfZ+W2wnA/jntp00AaWXkQM3bE7avak4ck7fzUEbggl7g+9CwcqrvjLFwULg\");\n        a(\"EmR5WJ/Fg567/GRc6VQkbOIEJxISb8cnO/xN2I+E7yIkXkmYscZgl4W72H/UXyGX/OtOWu65WbwhgivExOPdmkc43wjmqQc/wv\");\n        a(\"kF1QfwGQBIrShZ3Qyg/0hTAPnnc038BAPFP8syx0kF/xI8AD/eQYyyBUdvVBpjythDiEB8C8WvRzyw/StHwUfT8CZU9SRCQrPS\");\n        a(\"WJLrxEjXrR0kR5FXJYFdeKxXffo2pY85JvTpnKwQfXp2FNP+5CidPsVlhepT10SDPhnqp/zKgTd6rb9jIun7G6L+5yeG1H90JN\");\n        a(\"f/8khd/Q9ODK2/Okb9lQR/oaF+4/0P5LuG8g2jfFI5ae/OdhJC9dhOQqbd55iBS+pe5bKxcXHQt8T170JoQ6nUi/lSuctmwgkd\");\n        a(\"l1X9bXeRfp9AUXIOSPqtfHs+2X3uqngP8NVrJ+Q3b05QZXafE1SZprmy1zgXQDVxc3ut196bAUm2brCMKmpJOMx1dyeu/4joR5\");\n        a(\"zivStk3OHySPvBUAz4n0KbiH7K59bn0/7lNjT1Ot5U7bNsvhFx9Xq6JT4vTSDFvfCwPe8L14CC50x+a4mP8HoHnGufQPXhTKmq\");\n        a(\"oSz7eaZF+O9N3E2livcXeS9spYJJVDDZBw++HQU5gYJq4xCl2UNXJ0oOvL11Y+ybhHt29J5sCt3/akU+MptyF37VgaizlJj8Cb\");\n        a(\"vB2xvM+QjnLB2k/J0T4v2LlTtPh2a5U81yw2mRZaYy5UxolmvULJYzIguMLl+gVuzFr2ZcXa+v6ZnoY9jd4JqrIj+eCtdfl8I6\");\n        a(\"7GlzeJo0f8NwIawOfpnSCnpIf+WJF32IPRMypOgiRDeavLggu9ee11g2EE9DE/Em0x+PZ5v0unOqo1gWWZRJZon5fe0zJn+K4n\");\n        a(\"j3DHoz2jYqqH5bnQdnBwKQFr34Y1davfsLeGpQH/zhQbiGN9WCNITIAYj1Ljw2pk3EQ9LrcSD9siSokf7Rl3xrXQG8en9qHel9\");\n        a(\"+aC++ytjPG2elxyeV/BYLQa2zuKDQWzvTQzDNu8Ly5Vv45Uz5mlNmKexIZkb0EFJHxlXMx1h3spi0/N29v/Ibw/uvkpu41aUwP\");\n        a(\"/1hMjcvisCt43vc7O/Sf4ydpK7QezyE3rl7jBwt+hwh8pg0+tnAv3mr9eaFsXf46EBfZhfRiWFwazZHQg6yBiTLceF+wyzycj+\");\n        a(\"FXj96kqXrgK6gm5+uoRv6644YYIfdEsL5fJdKU+G3vnUFEfN3Ub79dISsfAvRrnxI0CUWoX36zmUl7IZ/f50C78/ipYu/P5UwO\");\n        a(\"WPsuIKEESxhqE8nB4F9HTRrTSqVfguUhisSpTCvosU0FSm0tQRQhN3YU5FpUfR09Mh6VEEPV2CHoWyGenpEvR0aOmCnj89DXq2\");\n        a(\"FAl6lFj0SH9MffanVRvqjwmZQI5nXpr46vLM48JYAMMxMVIuqcPat2z8DNqS3Zg6Y9ZXCJ2Fk5+KVOEqKznOPwiwxbfBbVaB4E\");\n        a(\"NemCOn6H6c/lRH9NsNfpzC18Nea4aH9iG8RcML0YDUOV9mCs/5RuGHpGJYkkT0N5MQw79ROdqZqx39Rwfe9ytyUSqdBstW56hZ\");\n        a(\"1+1AezoHsPDLnt1O08nEBGwOYe3xxnETt0Jayo3DvpTw3hXeSvECQ+kZHfbamD1KLJjCU7wubcn7/vmGnOxf04EYJ8U4KcY7gv\");\n        a(\"ul7x5V+6VAj+obCXR5QZcXdHnXyQFWv3/ELNKTW+T5FxF5SbyByLmjiKL2SF0PkCWazwVN+AQn2mCPiajMGK1y3eCsnQq3UcAY\");\n        a(\"Nu53iI5PXylrq2VTIz5n0GfpEj6tLKfw7K+QVPWY9h4/XkycuybzToLOxZ1Sk0tsjW+O+5T+Fpj+yj/mPZ13q+/vzaLss+FlF6\");\n        a(\"tlA6Jsj38F6tOVqQwvM1Yt0yPKBPyTZRk5uXeEl+mkS+nqdo42/va5vy4N6a+pT7XWK2f4/PLQaWEwDi3a0EXPE91wflgXDbhR\");\n        a(\"++hjf0Sb3lkYuY+W7VltwHuSuQHXJ/OiLWIDXlOTsMTdYG7qTT++IX50Cn7s/uob58eBJ8CPx+b3iR+WgcyP5IHR+dHUx/ai1/\");\n        a(\"2TE8P06t6ZkXU/ZOew0NNwuIM/w+cj6K0OF3qaHJ79uPN9+L28JsuV7ZgmJWOapLz/yhkxJeoOpbioGJLaC9/Zl7FNqG6REAs+\");\n        a(\"BmJs0x3jRwAKSjbZD39dmNdkRYViTqaU9lJfPXUOvfqPXd1z5puYb516VptvPTE2+nyr//q6IUxfoak3YjyQmipdKsE63jc1zx\");\n        a(\"r5e+js5wVGnQ1vvwNE+x1g1Nfe+L11TIz1RCuvyRuDLHcW76OZOQYT9weoJH0btttCh8HDHXLMHDpBjJmagtdNYwUPWcrSsDke\");\n        a(\"pnGcFMkmnSjSO4xHzvNePhP0IztfiE+OlWH25IAk4QaEoZBFpsaiw1/RDPit9wnLT0+ZVFZ42kKaTxxWzEb9j95+5VhyYWZY+z\");\n        a(\"18rmH86cWf/Adow9iPPtyR12q5stFe3Oow7fNPk/svQNpsbVSSbdWmIizpHXn7bksu3GJGEHcdhU0qMyJvf03yQcITDbKBH3N2\");\n        a(\"gpRWkFKY14AG2YAKimpSi/xZ4hzJ02az7EyzNv4zGb8FJpuprcTmYbAAz6Df1LO4/ulo7fWp099Ie738aa29fj0qSns16Ht2Eu\");\n        a(\"t7ZlKf9D29cpxJ1PdRdpT9mVj2pcLnnzOyAVi54WOcTHrexZEH7QzoDy8EaZ85PYqyDmcJ0oPXetVB5LWxjT9FpqdurKTn1Pz+\");\n        a(\"0xORFjyQcA0GqujQln51JuC/xge3yLI9zxsr2zNqlBr/DvjIU9GviESlch+dVQkx/pzSr+xk4/zkqRicAUtCPbDlRCBcEB27/T\");\n        a(\"17dvj8L9swl4v8ftVrNuz9KyYcjPkvFPux/Kah1brl7IEO71B8ObyjnRR2DDLNr05NkcnVqwaarJgGoYlVvIwK/qf5z0uG8YS4\");\n        a(\"Xb2dKLoH7j+Vc3FmIIpuag06v6umT+VmJPFgU9kuqxehN2UI9/SwAvizCeuEwh8EoTxIRW88BFmFDE4FYgDKCxucoo9Nd/4GOF\");\n        a(\"41J9LYZFzPaE6XB+udLqOMl8lt+B7h6GXSljG+Xsa1FmzYI/f1cWTrgSm1HzRleLqhD03skNOf5nN6jju96+Ic2L4duARaWXXC\");\n        a(\"ddwdsJS9QsepQ+hUfWDQbXPktU/E8a8cDHN1A3HspgLNdn5vefAMLSLhffBm9qLfouJfAPxxWurApqsblqg2zlJL3I4SMB7Xna\");\n        a(\"6dTZGjeiWQYHRnsQ43G4P8aINXGO/VqTgPg1P8CW2uqwmqazCSScCKFVB9Ko926Hh3DfjlHyr0WY27EXGyIBr3xSiKa6W3v6s4\");\n        a(\"8OVN/HJ9XJzp8lSx56ugPeLXZZi5RezfmTc5ryo3mYmSZrvqwd97FdBuWE9ol5Z4Ex/A19QFqUrPAdS7EUQMV4lYhRjlI/yBbF\");\n        a(\"V22REEH1NV2hTwQeXJv9f2CAhzZDeaHy/m/OeCwS3DNQZPjAeDH4k3Mjj1UeLTdf2iD5KuMjF9VLOl6o/Ip+L/wn7gPxIIs4nh\");\n        a(\"Ep+Sgm81sQKJ/M5WCuHR78o7pz8junbx65BpiMNVXne3+dZpIKFQR8K3zWTv32wkoegR6IhaxVyq/xf4w8xj4V7LtcL0NYH/AQ\");\n        a(\"LuBakmA82x5Hl/nCrP0qUsy/dvYVkucP8w1cT8L1ExeGgf65JrrBJHdf2Vu6LbgjQ/sZZpltKqoUGPZdU0TCP0dhMI/dxkJPTb\");\n        a(\"24yyCutP0NTovLjHxAe6g7yDpx/DXKDNP4DuD+HTOxtrFE+3mOKl5p4WE6TM3P3iIwsfjUpOrpyMWD1HrY3HE6y5R63u9y2wgc\");\n        a(\"sdjf9s4G/12pLzE3ffjDPOBPQFPupsFAtIR0+DN1P55WmuN/FpqfqFuH9SekWweB7eZcnyG6l8ZlGNM9mbfgO+lW2tWCY15190\");\n        a(\"EyUMsHrK0/wWAfuZVobtai7x0c/8Xew5xukkS+t/o4zWFlsqsRrn2TcT6rZkpwflHkY524T3r6hxvJfh8HysrES4yGNjm+4exd\");\n        a(\"D1af6Pj9CFqREt89NYKa9qpV6hDa7lPPOTfZofY7395mR7C2uQUjRZO3nU0nEwlSZH/DRyflcHoxI5DTJf5PGS94cdfdofLtX2\");\n        a(\"h6Vtaih+R1aP6gEimSck93SdCYTuDF8mxrrZYTvDUfeFf/Ewxrj1Fxj3hY3z4TblkU8N8+Hw/WKH9N+v2iyMvW/885B9Yx9t2o\");\n        a(\"LYLyb2sOMjB5YSRCzX/8NGnki3MTRwQakhhNheG4p+I3vE3ofAi5LzDXvE/6s8N0SSZ9pEvTwBxpumvPCJUaQFQnB5YSKNvtff\");\n        a(\"9EvQ8UiuQaYGeR468X+Q54MR5TnxHCFPSSiJlVF4eI9BpM+fkCJdHCZSq+DInDCRlkSX6XMPghf35RhlatTvDmX38cj82JFVJ+\");\n        a(\"wVtAlDBe38Iy23dkhjAyn2Gr6ArtTjAaX8xsybAd/0JcSKusUtnMS3B9PVT2LG/GT8QrlJaz7TLkP/rksyYRWri6jXy/Vq2Ov7\");\n        a(\"q0pyYzoI0lA+BqM12yvafU0QQcWLPIeEDWGn52DlJXOvBgyy5ZI4rFuMMYO9gzPeozEG10b8U+01Y4ci5M9Ejs9OBUehkneCo1\");\n        a(\"AxPpEVwxAGvSGgC903+mVMye8tB9cPzuUFobg5uIfniVjkiAy3UIYnkMFaPwdoiMhjlYh8AJEOstdVhoCHAwAx+Po2ej8xjl3H\");\n        a(\"X1/keavIOwQXQAF4QVaPHvBIArwExYDSb1NNErKJYuci1uldkCyiPqGoqbKys6iysxHoJA0WNaZvpvmmViMArggCrKMCftywCe\");\n        a(\"Kxe2IIHvdQhv35jEd+sNiPKfbZfFHpr+5E4HEE/JMF+AuC+RZTvrtlvlLKV4EAcqn8DKS/vRyIavWNpxIrZIl5VMKJQFVg42JY\");\n        a(\"MAhUfVlWJJcZBbTOIEh4EO8d/pKE5guFdpgApEpoJ+9AIIBlUF5PRRPGWmD6dApJ/g3kfJxy/hOJNAXaTzn/joAPKse3ZPVXap\");\n        a(\"+X6xyyP+Bpc36/IcNRM/incHt3uWVnqslR3Agz564RWtIPkLSwJsHURGVOjytrMVz4Yf3mKzbqep/NJpeRrY/SITP2k3oP4G8/\");\n        a(\"fN9Neitgiut8CTjh+136pqU12aeQvidGO9grpz1ZXA0ecpoazEud9yEE/7IE2my5OxUhTGlLbya4t/E50I/V52tl6kcFfwyEyz\");\n        a(\"f+WG7ZXKUmVasf/yHuusOjKoL4vcu95JIQLpBEo4LGDoKaKGpE0BwkkkBi7/WzECsWSLAFOIloHkf07FhQbFiwYCGCSkzRJEiL\");\n        a(\"IIrYAgK+4yxBWgrh/M3s3r13zxyI+un9cW9md3a2zc622V1vCLg/BDwYAh4JATTe8j/JOg5lvvJWYNOAAS4YC9gj4AWlgEsE3O\");\n        a(\"sWwNcKeD3RXCLg+YADZ4u6O/JWwCMEXAv6wEkCPpfcjxawRvDBAp5B8N6y3glOFPCn4Omjtc29QmPdd79EuX3ZxuUWOD681YSD\");\n        a(\"bZlhK1s2r0Xow5HqULi7KNzEdg7nBnU6NM6kzWGNk7o2rHF6ASymsRlb3/5OU+K9HpJDtGwpZxb70VNdSEGtfrTFjNSi/1fp1R\");\n        a(\"ui9Yc+sV9bClNo6pNY5WPmfQZnkLJA02nZF2irmZnSUzyszAoetk/y9muMmtVfxxoZX70BGZ+7jTqUhsB+8DyzxPBcQJ7ztrKn\");\n        a(\"dlk6Jg/tPHmg3kLPeFAuJZ4QDO27ljaL7iGafc36riBbcK1cb8mo9f5reqoVWZ6JJYJXkO05WFKbF75+vshYUjOMurTV6OyY+e\");\n        a(\"0YlPHIhA4ipNlvkqugaxBnwAU6wkCrnwE6seZl3BPeBIY1VFK0Lw64mQ3kJ8iy5QKsQRlVjjHKKH4Nnf/gMqot0lqKpqwrUYtw\");\n        a(\"X5ivUFtLiLMAxupOyKv+2wOywDZwd4rceZE7L3LnRe4M+0UI2ZaFbNK5BH0esCrIM7BlZ5DiUM+41Yi85Cu6f2ILe3s6FVtDTj\");\n        a(\"qRJN1ikFxHkr1lM5OMkSTgCZEll1HgCWxQJ2N9CWtUe7cjrFVYDXlG00gVjBSYK8YD1F+kfXLEazjbybkSzmYmcj6krzyUjXz5\");\n        a(\"EQqn3kiYNx19uHkqJO0XZYx9l1/NSWvEh36BVLn+Ms5JWn/LKaT96RmM0p/N712waqZKzrRJ60aPzbjGVms+lKSnVnccWAN98A\");\n        a(\"B453kdnvK1MSiSW4F5U32YadF7IUnDWhRa8NNHviFFN3uX/Fmo7l7L7Dc6DlwOhplgmOt1hDm2/sAcPwBJjb75dYOt8TP4Z4QV\");\n        a(\"l54NUmilWDKVDKhsXSpDdk/fNnvX9KvyMI+kQyDU+R7iBaBvRRANTIYScWlvfetrzCK+EQRyVA1fo2Yt+m4Wgls8LfXJTVm+GH\");\n        a(\"E7Py/WWuoCrnsRNB6vvdUY01nUZCR/1MIhc0wxRLdPtO3h+xZLta9gQlcEHqEl+1xtrdaOgXEREvrWmyiVemz5Dsa9OnTBDEcy\");\n        a(\"34EVpk5lYiotxbu1rzmEXs60PuhJmj1SNhUkJpAIB1o2OGeNHGCP2uXuhFyfz62o54GRW1yzth0iiH292KlwCtgrVvFBW/NqfN\");\n        a(\"T935auXd/3N0HaOC4K5z8rmLWNxj4NitZK73VuUzAZKqtrs5VmCpXLjLdu7OIdJqJJmk40lYW1sD9CfDzkCziJx864svc508Vw\");\n        a(\"0thIH9k2mz9a979++KfpLURayssm7wiWZpmSeyont6gN88Knng4Geah9ECi13Ad3/P306vrO77t2995G+D7FrG94HFyv8MN+V2\");\n        a(\"/lMqujJGUj1+z4ABwbc5F4/Mo748pwH/3r8GrAFvEWWErNp37qg8RkSMT62SwRo30NNBzAdG4Lz+USQMAJU0WGdTGsfPmpIGSz\");\n        a(\"XI8pb4sZl4W8Y3YYdGMh73chYNx+4YzuKuQcw/sls4394pig9U0Mq7xVtiG4Hog4r2Odz4qJ7IIWMa3Vxf17rYxhasvvPnNhaY\");\n        a(\"uygqzv5f5EYUM2bhwbkevGGFVbHYrrgB18opJg2iUEkf4zoqcA0xpoUkVhsiPDBDojwgg6fS6ClQd7lEGcikPxinud1Pwn5sdR\");\n        a(\"sW5vx3KmYN1GrPPQQLMMvg9b+DKRfmk4OZmKDHOEEeZySxgm0vtzWuJc00hP0m7c0VTtffl+DgSoOFWlt2mS6nbS3d98f7Fklx\");\n        a(\"xmh8o8LVlvwbEjJn2fSTNMpOs7zKTp+lyQUlSDKar9KapxHFUshz99B4XvZwr/UkT4DL00FFUuk/Y3kd4ZQdpPHxkizeok0kNN\");\n        a(\"pKczKcNoFpumB2nbIrG4kd8cV64NpIOQwEKMl7pobkcJ3XdeV1A+yU3NXbK6en2XKdZM8QDgDwikb/y2O/pBEfTZgn4Z0X/A6S\");\n        a(\"2i5pVqSusL7eZsOfVx38hsXdRB2drPRHp7uzlb+yJbFaJcj2bSPibSogjS3x6nOlCoYgZSxbgov6vbydFOjkeRY09y/JQdY5jr\");\n        a(\"1+3EdR8T1+1tZq5PMFdHmGsPYnAPM4jjpt6Pm5Voq17RVr2irXq5rcrmb+7/X0bmaathySjwciK8+b2tJl6sQCd+M8gyl7uq6n\");\n        a(\"KnFjoOwxefwwOFpBcrmnKzm8b2z6tocnuwgVxRF3qPzVOn5FEI12w1uQjjqezm2wLQSZ46u6ejx7hkCzMfOcbn3YP3uu5ZWPqa\");\n        a(\"ZYBljEfTOMH6zlldWI9poPsHMb4o1urnH8H6Er70Aq26+hfFNn8kn4cPOTXBqVF9G//xDhug2QTZCHoJEKvb6bN48JQZsskoxl\");\n        a(\"bAwZp6N/wxAA1CtWrq7UDYF6PFBC1tDFCf6/1F+keQZn5/yDP0ErjZSmL1V1E14T2DyP5y/+1R+x/jPMwi83tPCCWazeZOCLx5\");\n        a(\"HBuUk6LQe3nDVtJyCw9CbA7aEIFZ1nwbdT79nucdqokDqEvlffmrmml0VHx32Zk7k2x0Iw+7MZ5gw92Buh0op7iskzd7Q2Ok77\");\n        a(\"bJYRGNMo3zMVb5Kp4ZbXxJfUs+L9yqlb+ivORgnJYzxBrgUy9i6wXZ1NS3YbgM6BBNfV9A/TR1gYAGamo9IBJgfCjgIPc8D++P\");\n        a(\"ot4Z14fN7QpWqK+zf9KCdvh5ZlJe1P6/ilWDPpgE9QUMLm+S9xrh3YFqxHmuoW6EjB2XCDkZKZIOtyPJbWxK+dBBAJSxCY3qdH\");\n        a(\"jayZMyNg+AJcPh+WKBjc8fOxR5/hjHlhH/d3AOTTfuXqHY2F+/7wVIex2cqkUofda6aOVpka8v5fw9DUDU+TvLm/l8Chu5LfVO\");\n        a(\"yLTM2nnpZnx6kVZLtmQPVis2Mm8JpsV9rtB+GqwKxu9XoG0izxLh2cpnVn5qZn9okDHPdAmLDimkM5ZLIZWO4dPS/Qohm0Whd/\");\n        a(\"vYjpyCQKlfjyBaB8u0fj8kmcy8SEDlKZ1OUnDGYRdDHi357W4+UYj9XuOgt7Y41zsmE4meN4MEoQQG/ho94Km1423nXG2jSMJJ\");\n        a(\"SELhVa0F5b/a9UkgRB5OoLWDcYDL224v3TdXu/GQjCI2hJKbvhW8rN7g008X9HH6vfy+eKHW2t3MotC8TS3P3y+XZxTpfCLeuq\");\n        a(\"wZl+LWagsr+87AkuwIbx9vXvzqYt+UmrEtuTRPlM9CxuV5C3YUfO6XL0YCzQGqw4vqIq0XajEkeypgnTYRrFJ2tmG50oyAhq3/\");\n        a(\"MZSzo2DaT9+qH6maU4xLJ7yJIc6zm8H5y+ewtJMgXjTrWAHRlNpxd/yXgpa+50XnP4r4P2bi/6SZv+jPUACCPcvgPs1SBsPsUG\");\n        a(\"b9IOTy5EJBWPR+W6bAoEDUe8rMsOgZvVS3/Ocv+6v8H1gmbQBEFHOetUZh8A+/JABe0PAEhlJ2RzfB5G+X4U0xHx+VBYdH2jlc\");\n        a(\"roblCjALxRx8xhqse3pTTIufiRKTVd70d5Am84qT1X9sN/67bS9jzoreXkTdmJ9XDbWUn5YYLeUbwPqszmDU/k0t4LO3qn2xQt\");\n        a(\"iHAushsKQuxmIFdrnAbAJ7W2AdixiL2cnYFoEdJ7BfBXaNwHSBaQJbK7APBfatwJYI7EuB/QBMxlcfeR66BjpQ92wQmxx7R25y\");\n        a(\"9F9DoeoD2eFlK2+sltvNcn36hcai5os1CLlMhOQl3aTX5sLlyBjeKoMN113p81NAujn/JV+oFnOs5mjGe9HrRcpi6YYcXuTPBf\");\n        a(\"9u34+429+Cj/8T186gGf/Cgq+z4I5vgpH+VnxVJL7la8Zl+g6D3YGu0ND9Wz/f3fOSKOlnBrNEnBBkbCYw/aktoDpsK/42bSP6\");\n        a(\"7Uz/6c9Msf8wI1fW97Af2gjyvvTXVkNh0h7cxCWdkAOuW3FlJeCJbsD7LO0ieDLBSQKeRbAi4NcInrKB4LSTf2cWL6+FTL/DLN\");\n        a(\"IGCKcXyelZwXU6hahfwiFKOth7JXl7RIjrdrDTsHVwGiOc7hVOl9Ps4iLB5CqCJ4KJ3F637Cf42nm9YTp/Fszkz9xX2nm9YQ7v\");\n        a(\"+nw2NS+zsHJGDSMp7obhThv+4vHu5PCEvIrhofcuK6cQReGJq8ZnNEyZBxC7pTAWn0vg/IVC4vyz7Xx3LmzxT1KvPw2mR5JW6Y\");\n        a(\"Z2EtO6PXclYHCfN3iUc0JsQXkgOfBoUeXwZLerangCMjwaTKY67O6KnHj31OFOfJ3wyomH10XwclXDz1V9dmL/5toWUH2S76pu\");\n        a(\"ElenrmgpODgGjcQ9NSd+CJ5zjUN0uKrwgIFyb4++LkV8J+Hr36BQesBteGJ5jQMxJSKmMxIhRM1FHFMydCucE9yeGxIUymP/Vd\");\n        a(\"QCa9cmw8S/QLMVuKpzEtkirAPmQGtj4Jpf22aH82KiW7ERtTUarJDG1F50z/wD4xSa2OGUJe4RvEbc0SXi1yPiPyMcvxKK326K\");\n        a(\"f+MexL++0BT/tM02I/6fbKb4axQZPxhWpjUXipIu152h+B3m/DtM8WOVyCFWiTheDCBX6PR+hYjXoeCyZLzNbIr3ZnO8ekS8F4\");\n        a(\"TjdYTidZrz/RfiVU3xlsXJOAvK65P9A/jZDdEwvKJheEXD8HLDMLUmqc+N5rSIVyn3gUhBNiugvMN4rqu6hx1/6o1AsAl3KH14\");\n        a(\"M+IG9Fcgu64mP5YNzQesUfAZYs+vxKt2oUZhJkgAgWcIbvh0VvS9DGyKfbhNircI4Q+NHn39v1W/CQaE4n35hXs2X+HHdXEcSy\");\n        a(\"9DQGOPke3AkvJxfYL+MDyQsSGA5X3bWFfroPswBwBGDVaot8CvQdXwj89D4vMUPkGxSOtVgyqVyhlOXqt1ggcn+sIviDOAOVh8\");\n        a(\"oLFMbUsGrCgzqH9GABk4rQ4wB4wLBcwIBbzNFDBGnQ9ChH2ewqqd+Kdxi0fdBEjhcPmwRnRVqbWcmrSRI2nen1rHXm/Ai5a7jW\");\n        a(\"vTyndCiSwlS1i246A7vmiuNTU3G7PhpcQCtT4LX0hirJDEirTxwBHDW/jgpQpXVdpojivpe1w+UOHo5apKOocd1O/gMDXtfBXO\");\n        a(\"qU5wShsiCKdASvUM2IIgbH/htPx7zNscDyK2bGJbgwI/GsAQdeLhlISDI5IA1s+D3tvD90FwEirpXLDy5Z+40/XASWIc5xmqII\");\n        a(\"BtQjLDK5GMSa5pX6GXbVBfARL0qM/ho4DPYHyRiof5k7SYEpyaPDjVWZaOHE5wcBkez3FN1pfS4wH7wX20cN9fuIs0fA5Pz9CR\");\n        a(\"8FHLZjaoborG51FPpHgQ5Bh8jVbg+F60AmGrAe+UCO/13yn48DN56tcxdhJV9XN8ga7GR3YVp+RjMMVXR6UNcnAhHulgIdLXN9\");\n        a(\"KWuToDtMkIOouCem3ovV4fgd7rHQSIEQF2wEcshm7cjjy8gXA+z9ApcFVd004J8o3CoF4JB/2WBrmYcw3afJQJNI9vjCGJMR5B\");\n        a(\"cn3buVVpSIJekswd/xvCaRY5XQEnwB/YEdWUT7sIvoyivQOwL8KemSMJWw+Q6cKjaLEw9PCc3Lv0BK1tSrDsYDr5v3+xLwdX+1\");\n        a(\"F/WygbASaHr4JfwA25kPM/oLD3yyzA2n0vN3ZLlf5fBbDuiN6njp41wUwNr0xMCU76GX2Q3OHcsDS0vmKxD/mzfVxoZ1Q0OTlb\");\n        a(\"Le3Bu1L8CAP0NjxpLUss3A0Gb0pmnY2zlJf1C9N6Tupdmk0LBN6k6TQ0Ongir57HZQXZTkf43Es+8ezjmnIpnPmdlcB5RVDGvQ\");\n        a(\"JZbNO8SZiWba5DNGCQ4Mb6mHLNsMoh/dA/xRYqrXTKB8sP9LJ/OTaLY92ek22ljQT2lAsU9+GZU63Rp7V1a5Jl/Fiyz0Qjc9vR\");\n        a(\"pdVHKx+csTPnf0mXyBKPzyi6eWyiQi9F9Ibg9wYrSiKZ21dOtGMx6Xg3lFjZiXlZ6+j9pE8Q3+kDRCZ7ikyWHA2xbcOoYwACDg\");\n        a(\"iHb8zDhY5LaV3Fr6ceTHHVk73BtCwkKkrW5P6tq2rYETAyKG+JKdmXrKomS1us8f3wV7K3f7w4u+8dlo6jhVPT/cWMA+Wd8Ir6\");\n        a(\"wAUGBzoLkMikGm3/4iCAkh8DzCsXBWhOLKhjy1uUkmR+IQ9uQWQQnHqaENSv8Qph1PNEKNHineJqRNfH5ydjoBODJkRi/dujXa\");\n        a(\"F7rYgqR1BZyp3M6V3v52HB+JOC8k/tgRO5nsipX375kAZbaQ+GC7WBDSxv0A6i3F1VNhOL8p8VnJ6bhNbbrj9+IBc+ieN9Fot7\");\n        a(\"pN+SdlguBJHw25PzYYjYB9c6yAzoa/qQ1cleRBMLicG0r5F6i8irHsP2+/pZHdTOajHk4vvVLOsCFvuYeL0+aEzho9s3vYIhxx\");\n        a(\"wMOeZhybAGS4ZNhTDxKsQyIsxks75BDiihTZgUk/RlrnMvoMHd1LghEKEGOXgv5m/JSL5/3F5y0cB41+TX2G38EcBPhvtRRDdR\");\n        a(\"0k8W38n3iu995I52sMCJr/9W/AFWCB4tYDvBFxJMRX8JVHnu1Ozcijbwjx1oH58QSBb0ASdoBS/oUDoCCGPFEoirw+165JPAvq\");\n        a(\"E43O8pgSQJI0uo82LvqUcUHxpjc00bS3MhBN2n+EgF6FVAGbq/nRJxDtC8e9aJ0wm5mk4X90+7D47UiPaiv0PJLHIQxsklw/03\");\n        a(\"2UWbOtVJOspVTRLjvxCOhtvH7JZndruKnY6JCOtNx/j8ALsRZ0q0ODsUUzhXFfPaEOH2PrstJzdLnNXKn+KcDSdT+RQPVWylCU\");\n        a(\"RBttuBngXe2PwYIF4b4ZAcqKxTRbtHPZebCul7+ahBGv31owSfRAk+zf8p1av3vAzauQme20qGJJyYN6zuQeH+aKQ7BpnkOknM\");\n        a(\"XQx3OAL3X2NKwsUyCb3p70BKQiYl4aRAns8SeeBYhLVEHDgAbhGRQoaMyIp9LBd3meK7WcaXQH+9AlchPISgnkKez/DHBPsCIy\");\n        a(\"PuIzl1AIqSjf0chrVkTq6x7rQuSPsnS4JBcZSqVh6lSsMpLJ/YJoBBH5q0F03aiybtRZP2oknTGrz1OJzVvhPZmsA2nlAGcrhS\");\n        a(\"KIYrDX2oZ0R+eqJNjY0t11U0q3FO90dOanix7o8otUQ4ozvCsYPJa3IfsTP0JDZ/p5J2SB1ovy0j/+6f+GTWR3bi1MtHuI1wRd\");\n        a(\"SpkCg79Vzp3HORLwH3jgXg3yRMpFq4yAciDPdn9HcQVfGRVMXZ/hQhx5BcvKiWmp5TMdhvg1MIL9YG+1ttBg50DfFlXEFJZKMt\");\n        a(\"LLOkh/vBBCbhxkAXH8QAEY2BbtNwl+9wlh4ZbhIQPSmgBRqJjX8COBKKLoHQm4CaiF0gdmttUsYCZ2sdITB/d/LS6jbk5T0yGT\");\n        a(\"h/kVVe1o/mwyCoci+qnAUEVR7tPii9od3SmVj8q7oM/2jyZdz3JGXLULtoN6x2ewu1eyNQgib2DlxNykaBWGf7n2HdHkUXyeJ3\");\n        a(\"morfXJZmzdAYON8Ej0Kd7q48a3KM8rx6B8oz7jNreT56Nbe/NvPtT1yce1AeaGsmae/N0j5GjtNSA8XFvrA4yrLYA1m0FIYhhY\");\n        a(\"HzDBH8K7rokVOMsrigE2XR2WQtC+0qlEW0gmB5IVvGlAjzXqt9Jq7L1Gu72OybDnjvQ5MRnLnqSaOfJzZ1YY29VGU7O0xUzEaa\");\n        a(\"Uh4fM3b69qj8xQwr+2fMsLwjpHDeK4UzTQjnbSHh7Ou/kRvwCAgo+stkhNV3BjAXmEE5Q3iznIJKVg31mUBk1XCfOSI8Vs71js\");\n        a(\"hAFkMt/TwDttTNiO7qJv1ko24+oh3/yxutdfPLFVHq5q+Wzyb9g70wArQN6ema3IeWbXuWJA90uu5ZR9o4UbHq7FSW4rukFO8v\");\n        a(\"xndCz/ZIh9TpizeixFbssW6NrlXvi9SqtwPdbfseYpTbPW0ot8MbrOVGrwT4AkfxGZQ17Qb5kidBnv4pyCNONt8L8uLuylnK57\");\n        a(\"Yo+2uW83i8PwwA8S/ZzXkFn7BnbOLPAusxPa47eYIgbAAqhH0UzEhoYP1jKldrnGvymbRCH1dy6UC7657rFB7cx6Oa+/uz7aEz\");\n        a(\"J5ymW1W++kSXawxXLkVNpoHEJ2g4A985maZF0kxcAZpNCmiM9lUV2b5eNtrX0wDRcNAlZ8rw+1cj/NvK321f/dG+WFbk6UQIiI\");\n        a(\"Qk/+oF4H8m+O+K6AkiorGGtT3yeQ0pV82Qq4rBhqAM3Eb7hfVWubr0MsiV/wch/39V50SoHO+7SA33B/+JzrHm8cUTjTzmb0Ue\");\n        a(\"A3XWPN5x6U55P+IBYq2/SRjydXOm03oeaWkzy3+LPvezPZH/uc0mwc9rCx1YMs6qQo1t7hWS9yKTvI8xy/sgu7jbh1OQQmc3cY\");\n        a(\"JVLinlogz8KfzeDdNwcg/4nGlWSZo5caD5LYpOfFfqxIP8r1KSpEpEaGkP9+MHqNd3lOj9vG7Rizrd8GDSiwMkLza7pELWfWBZ\");\n        a(\"WDmFYKEzW4Pn6v7TEMefSEeDFFJPcIjuME6LVZc2o1CbpDw0QR5KTjDkIXsz8vFNjVUerruYZP4rW/flclu4rxhjKhc+7j9zDo\");\n        a(\"rkWRHu75VJssw35Rd5CpxLCHgzkr+7vE0/3sjbJb+TfcjH1rxVXhSS9WPNsg6BlEK+a33//RKp7497azf7RR7kbB765xo056bd\");\n        a(\"6fjzPxM6PtgzJPNZCst8LyzQJEHeCyDvh/r7KBH6/TkM+qV+19MWouh3gKNJtysxYd2uzyXl/y38/964qWqhHDf9LzqsZZCp/2\");\n        a(\"+l/r/6T/3/BaF6HcUVirL3ouy9KHuu1Sj12XOxrM/Rb/xb9blJPzEpVItHi1pMQS26UIunoxYH+PfldsrXx9Zw3AsbWCvpUit9\");\n        a(\"BqN2/1bBrINT+Qd7VxnjRBCFt6UNxdLC4RYCxa24BooXL+6kBAnuxaVoIAfkgAQLrgf8oLgEOQiB4sWdKxa6HFLcKW92vrLtQP\");\n        a(\"HAHybZ++abeTO7M/Pe7t7s64ztRMSt7Y2W+ZNI0jdtU3yPe35Ytc2/8X+JOIbvS6pjmPCIxrDzbnEMn7QMjWGraGMojl+Vgxi/\");\n        a(\"Vev/pD3mP87tsV+qKPZYkEaylmiPaV+q9sieh6I93nxH+bBH57HfssfJx/6lPdpLqGP5/AGN5dxd4ljmbfFL9tj3AMbz/No/Z4\");\n        a(\"9rU0Sxx+I0ivW/tMfhngh7rPhKtMfuRyLs8TKN60/b48Ej/9YeexdXx9CSRGN4doc4hp2a/Yg94v3Owb9XzKPhWNrNONaZwMeE\");\n        a(\"NoktM5VURJ1LSo4p/KxczV9rQlP4y6k2WdZg0J4n57ORqe8Eg5/3UM1NRzHspdpI1mNenk1A0ea4Fvk5FQan81rkOwI/F8Ztxk\");\n        a(\"IS7Xd2SN7H3/+Qnljgegc/CdeiPx31F5MkRYjy5blc7sfnt1griqEVtW+jFdnpym3sK0t/9nVFyxejkSvxutXBdZpgjtSugHKf\");\n        a(\"wWCHklKwfvqKvNKkBxLk1aTL0jfkd38pv1aQz49MapwvsY/vegcf6yQf66RN9yXek86IapjOJfa5dL3DJSZ5iUlOgWRSo26YV/\");\n        a(\"/2+5y/iKqj0/yko8W3iTq6x046SnXSjZF0L5bpXj9nAvRTvF8oH9LClJPKXfhi/jpRg/lrRR9Ph/Sxi56P5KibYfqYj46SdFSh\");\n        a(\"o6n8UAMbV/St7aFnxrSSfIkSP6eltcgege8Im+cmpSxC28pp5RWR8+GsfU+NbfQ2WZJIpmgCkxmr+dl7hzL/r+PN2OpDM7LRpd\");\n        a(\"dhCtkPCjmXUM7NrDJCX6hBJzGyso7rIyVdCCU9+Zp+0XU/YZnnuGIg6SlL2v8t+ZVfys8U5LMqmegXi5/3i5fd+3qiZCgzhmU2\");\n        a(\"oE5jmQ1/6HuOvZCqd+nZAhfbN4t6V6sRn6dTPuSE6dyPfK85nIw/osiBNOIFYBFeADLzO+OM0AtAaXmCBH2oY2gw3WyhRSOME7\");\n        a(\"ezlwtaRYL2R6pLHhd0G6phIJnQM+VfzG+WL6j227U7bP3FTWK/pWkY9bvGT86/Z1SsdTSesGZ5kBRhM7bY5GQlvN3VDfxd6def\");\n        a(\"s/SMDeuTt4j/iC7pCqh94rlNfdJro9gnb+pHm/MV13/nm4Y5C7Pnt1mt1z+J6i3lFic5l6He16hP3H8M6hibZkd+Kj+b+2bx99\");\n        a(\"VghpWUJuwWFrX8FFa+GZXnhZWfYA2OUt42vYnBNqGi5ExGCyWxffpitchF/oQKoby0lEeg38l818Qlg5NScH9ritIuaOmpR2Yx\");\n        a(\"sc5e5mdbt1Jqk/Nu2PeGbUG+97+uxJmkGLribiTLHSB15NijIR3xYro33B/srOIo5d9Jf7AWZ7u4BrH52JotKRrGdjG/ZpvC1i\");\n        a(\"XHk6QK1M8ZaalmpcJYxc2upplbEvtN4eHWim+VURWKraxlvkUPFI8oPTmujN479bXgAfZd/zfrbWX4L+dl/m+y4uB2ncXnLWbx\");\n        a(\"DJ3uKNkjrmnIn5Gyo+8nQ9sHxhQlMjgL9U1Kivm7dmdurfq3RbiUul4bvjcKzitR19dY/J31ydV1GaizuJ/sTrPy++IN3J0sM/\");\n        a(\"32ja/Hc4SatPgdZbVZQv52qbFOj78wnYLv79U2GMRv8oZi/ylh8fLv7m9DLhIB+PbSBl5KrQsX0TKgJV4yh7DmJYKhz95WZU5R\");\n        a(\"Xfo6Iy3mwdaV0zymtULHxNBK48oPZ5W8rG7mD8hUxdb5UIMKvlF6knHuoz8NjI1f8fXQF9I/FFMDX9uapoGw0VoQQZIE/j/8kS\");\n        a(\"D2pcOtNWkIA0DJxzHXRnAEXyYJHCEkb9EpaIK8QTif421kucB7cCG4PkSm51rL63MP42gazjEunuNSoO+Dhpf7yDFuHPKBWha/\");\n        a(\"y+OtiyT74twhbr3AZL4f+qO9OnbNiLuS0fWVVuNLy6lxSyU1nlBFjdurUxzX50DcwOoPi7sQ17F2hcWXhsVNtVT5XGFxixKHfB\");\n        a(\"Me94uNgezvBK30b4M4ZiVjhIQsorwQjh33HLl4ynPi5NVLVy4fvXb9RqLv5u1zd+7K95MesH5fBL38weBYCvlfDCaBP1+Q/fLs\");\n        a(\"ysbqK5Ltaxdf+EOen61PJya4vidhAgplhIw/dX/WSL8Xkv2kvKVEyVKly5QtV75Cteo1ataqnZI0OC3VkkHSKUcMOyjNTKjUX7\");\n        a(\"dvt4jzNerUN6K+YYM85uMdx8/5yPnqIPSw6fVcvVMVuHUa6TuQ3jCnc2Vbb4GDacCPAs/OGtRjvtm8ri74NWDyDjlmzXg0a/Yk\");\n        a(\"8EdABNd+cDVYh1TslerGe6SnQ+rmDMmPjDw5N6E8uBnYtHej1dbKqdcMBi8LrF8xx/29xjtxbnAbsP2SeSsGLjj0MiMMfwvSJ4\");\n        a(\"5/MO9evVsPe0OdumNgK1U9dCbxnGdirw+cN8B1jR9b0lpg4L6pGd5xPu9jpE5ogpJGQ3+IqC2kKFgQcqCRISUdXejws/tyfrr/\");\n        a(\"TdZI1upGyTWHZqNuvtBLRxdU+lzj8CX2mJpnq4b4AG0Uu3Rzu7Zv4hjYDL4F9r6NYy7waMG+EuVXfF1uSkwfazh3H4U80HqMow\");\n        a(\"PoAiaE8AZHL9AHDAClRI4mYC6gBWgF2oEOYLT3h6XveL4b6AUGgKb3qB9oB/YHxgHdQC8wFBzt1GdaQI2TIqrx8NDcXtsSzn3Z\");\n        a(\"8MzPzjEX0Ap0AF3A7wWNvkgxbdGKRfq34vJxQDfQB5Ra43xAK7A7cAowHugB+oGGNhwLAG3A7sApwHigB+gHGtpytADtwP7AOK\");\n        a(\"Ab6AUGgJnbcSwPdACnAOOBHqAfaGiP6wbagN2BU4DxQA8wAMzcAecFlhSfr0j/W8H1k+fLC4xDua0oPA/8OfhS8INazuPBveA7\");\n        a(\"wG+CJ4AnxwPPA94U3AveHPwSeCtwH3hrcD94G/AAeFvw1+DtwQ0dOe8AbgLv+Im9u4xxIorCMDy4u0tgcAlSHIK7BtcQ3N2h+O\");\n        a(\"DuVrxYcCjuUNyCuxd3ggYnwLlvA5xgP/jJTdiP59zpdK5Md7c0AcfH9bCN6+O0uAF24YY4N26CC+GmuBRuiSviVrg+no/b40XY\");\n        a(\"wevwWLwee3HI0KwHjod9uDP24y74OO6KA7gbford2Kpn3B1Hxz2wjXtiF+6FC+HeuCL24fp4FW6Pb2AH38Rj8S3sxbexD9/Bfn\");\n        a(\"wXH8f3cADfx0/xA2zVN64UhvHjI5HYTzh6GuYDx8AuHBMXwrFwfRwbt8dxsIPj4rE4Hvbi+NiHE+LjOBkO4FT4Kc6IrQbcHzg6\");\n        a(\"boBt3BC7cCAT48PXcSlsl2e8yu1xMuzg5HisshenwD6cEvtxKnwcD8MBPBw/xSOw1dB4JI6OZ2Mbp6rA+HFGXAhnwRVxDlwT58\");\n        a(\"T1cW7cHOfD7XF+7MZFsINL46F4Dx6L92MPPoC9uEEl5hM3xQdwf3weD8EBPBbfw4vxU7wVv8F7cPhGXA+Ojs9gGyerzHzjFLgQ\");\n        a(\"blmN+cYr2zG/2Ifb41XYwavxWLwGe/Fa7MPrsB+vx8fxBhzAG/FTvAlbjY234Oh4K7bxNuzC23EhXLoD48f7JjN+nGEP48cZsY\");\n        a(\"Mz4bE4C/bibNiHc2A/fr6P8eMXOIBfYauJ8WscHr/F0fF7HB9fPsR84ABOix9jFz5wlPnBnrPMD15ylfnBS3F7vAw7eDkei1dg\");\n        a(\"L16JfdiH/XgVPo5X4wBeg5/iex+Zr6bG93F4rN8fSEu9FNmc/O73ob5/+Q4Hx+t+Hk87QNbMzPweDyl5kHohl6m7T5v6Ier+gh\");\n        a(\"xP/UjwfNl5HaR+lLovBz8PnjH1Y9TfZDX18ydN/Tj1QDZTf8PxJ6lXLMbxp0z9FHV3Ec5/zNRPU2+fm+MZ11nqT/Pz/Zb6Oepp\");\n        a(\"s3CfnzD18xaN4z2c/wLlRYUYL+e5SP18Aa6HebhE3ZWX52W8l6nHz0edcV1R9dzUr6q6m+e9puobmbeAqp+nfl3VPdRvUq9flP\");\n        a(\"lnvLeohy/JeZif28HxluJ5Ge9d6mMLczz1e9QPlGZ+GNd96nYJzkP9AfWNZbhO6g+pLyrLPFB/RD13ca6f51VNv9tYyAph+fVd\");\n        a(\"FFK93yd15adXt05zV88e04jjQ3xpIb+0UF+aFSLk93/CRIkSIVy0aJG+/gkbNWpEK4Q5LDTNihQr6s/e+PR0ZV7I8+QbMtjid2\");\n        a(\"O/kDVJN+khN5LnyTdkfDePJ2uSbtJDbiTPk2+C9e6Sv2x2D173u5Nk3Qntw8t+ob+mytGdB0WR+cZ+lXvSrZHHN+9pnFZl1rc5\");\n        a(\"ZWne4EUq1yTtGEleL3oZu1RWWfEhojw/XqQyZtJSkeV1qDePUxmzQnrpd/VhnqgH84z/slyfh/7mKlenuyTjC9/X+Dj1YDZyV5\");\n        a(\"Trd9NfSOWElRPMz3V4kcqToRLI9VV0jG2VVedGlmX1Y0dll5YJpN/uZ/zUIcn4c+eZ1wP6a6q8MNuR9bX6Gx+gHswkVc1vfg79\");\n        a(\"uVXODCyKLOuDN6rc/dC8g1xzAPtC5dxlO+X6N+KhKhc/SxRWxjeQcVEPZughD6Tfob+iysZh9oaT/Yc3qmz8IryMr/0g9o3KSD\");\n        a(\"nfRJD1w4tUxt4SyoxvMOumMmW9PDK/B/BYlXtfXZP94xpibKlcXfKInN+Lm6vcMyVKGHn9GWp8nnowJ+aZEVHWn/76KlcP3GTW\");\n        a(\"f5ixn3owq+aaIfPnpr+QyvKfroWR9ccbVbaN4JXrTzvCuBTZnPzbNvQPx3tH/eF8o9nXo0hyQOLWZv3pz63y6O4Ncv3n8SKVod\");\n        a(\"3Xosr6jTEOr3L+oGwhZP5xfZWZlg6LaG5Qrot6MLO2eSL7uzn9uVW2iOZI/wHsUZmyYy05f6FxzI/KeRMWy/V7cHuVsc+3N+uL\");\n        a(\"D6jMMO50BNn/441tlYsmJYgm9zceqrLghwzy+PgTjO9RD+aCzSNkfdz0l/qWnD+U7M8A9qks5h8YRcY/0Ti+ypeJysn8eXB7lS\");\n        a(\"tiNJH78w0+oHJtnTNhZH0mGbtUTox+Web3OPaqzJEqpHx/yT2ZfaOyW+nX0u/BzVXuybhQ1jf8FK6LejCL3HfJ/Lanv5DKlL7j\");\n        a(\"oeX6sFflnv6f5PEuj7Gl8tXh8+b+w81VZv3YXM7/Bh9X2fhMdpn/+lON06q8US2yjO889qhccWVkNFnfacybyqPNm5nfg7Bb5c\");\n        a(\"sH5h+A7ensO+rBbHv6k6zfIvorqsw0arqsf6kZxgHqwUzSoqFc/z36HZWj4/WW668509hWOfrBLZmfjXioyg+pd8hypJ1l/JR6\");\n        a(\"ME+drS/736G/psrSVT7J4wPYp/J1/IGhZH5nG0dXWTfrKfP9CbdXmfxNHRn/G3xc5cI0q8z6e1l3lVXfJTI//2CPyqwFQ8n9EX\");\n        a(\"8O4/aSZMzYu+X63fSXUlnl9dqosj7Yp3LtkZ2RZH3msi4qzy0KLY8/gIeqHD0mt7l/5hm/oR7MXdU+yPp46W+uMnTaxtIff77x\");\n        a(\"eerBTNC2nMyvQ38plX2LPpL9qZuf/l+1+mf5PZnj/tTiL/j9cSUqFrWzZcqaKatdO6sra9bMrjyZs2avYzdt19F2585ZL2d2O6\");\n        a(\"Ndo0XbnNmt/+1ftDBk/OHsV9I9yqRDelhfL3mAPE6WYl0rkr7QIX/4PFAUnqei1cDqZDX68rW1ZVtVvnxtZ3W1mlgd6Y8ToUi7\");\n        a(\"Bh0bF+neuUkISs4ts8ViiEwLW6Vd665Nvv5np4EfP2f4Rn3+yHNd+n/dbtP/h+bvxecTepus2Mek45iM7v192v1MWv1N+oaY9J\");\n        a(\"PHyWALV7VCw5ZNGnU+wPiCzc9tsohxpe7pomX89qUof6Nlz9nb8nN8fM5zj3nyUvd/5u5KY5opwnDL54GIUm+84nrjgRZBKZ6F\");\n        a(\"shUUZIWixCN2LatUy3btFuXTGBs1indj1KAxpj+MIWpijZr4wx/9oQne9YrXD+sV8cYzeNYp+wxtt9t30SiubjI8zPHu7PPOO7\");\n        a(\"Oz7850P6D1MFVHT8smucycC/N+Wk8u5AvAv6qnHUKDalJJXCBHlElDY/Dj/YzrAEpALvskeL+F6/dwvSB9jZ8p3hOaiurC+VFV\");\n        a(\"TmwWpmRdUOOCnkxE1QuFSFxlJqlH46qgz2haPJFkSdNaNKZMClEV7+kuHFWQKCSnFEHWtFg0IidLQpdFk1OCLMyo0STLk5NMSE\");\n        a(\"/KsZhuJEbikwpqmpZV+UIlwQqsnkRLxC9MyNPCjK7oQiQmMzzChWP70Rk1GZ1WBCWRYGOoa0uBnfgA5gcT2N8S715dVxKr9V8g\");\n        a(\"ly4Vcg1Cm2GHhwuxqKoILp5+iHHqi5WEqsQ6j+LpY0oyNJVQ5Ml+RY8kolrpjKvltzMeW8RS9QzdW6BrY6mWhs7tbhybYhpjje\");\n        a(\"lKVfrQ55C/05Ys65iurZCcgvletYD8Hbfui8djiqy6q72Ai8jfpqlX1aNjq/pbbWekt1h2NIwxm/WkMl09TmzfODiuXqzGL1N5\");\n        a(\"Mbe5a67JbWKjnxdyLbWGyk2rDUWqauT9zf8oQ9SS/bLBdcblRlHhwd+LbSzEWEixcAcLCyw8hSAgFFjoeogh4v3s/y9YaH749+\");\n        a(\"KvDH99kAXEWxkm2Q9ESM/9XpxnyMO1z7JvNzxnpDc/awT2fzlA5hyW3sXCwyy8zsJTiwa2sbyP2P9cW5nDN7meeMzgwePPPG7E\");\n        a(\"m19hcix8z0Lo1d+LGgtPsTD3Wjm4XmdcWOh6wwj+11lA/C0ml2FhrzdYQD7PK7xm5K+uoy2yOhDy7qKBDWw83KIcft2yWGxsLB\");\n        a(\"af3sUI6R2KxZu3Kf1vlE97isV7W0oBZRBWtioWzeNsqh3z1SV6nJ3dZ5Mj7kfZs6qvs1lkfUeRp3k/nvjE+n7iAz/PpzTPrEN5\");\n        a(\"bicGA4xnUgFR/xLNc8WG55JDeW4rBkc0RQVLZpef0jwLn9E8BcGxPNldLbHG0/OZNc9lpC9+TvOccCjPJnGU3XxBkx0rNjyzX9\");\n        a(\"A85xzKc1vxzESU9052FD6nec5/SfPMOZTn9mIgJuv6afFkMD6jTroW0V717iupr2ieKw7l2czstsyyNMeheU59TfP07utMnk3i\");\n        a(\"UFRPlvvn/Fc0T2mZ5hl2KE+PaMyxq9my+r6m+fq/ofnOO5Rvixhgj3NxVVENutoyfy4/5pjOwDHezkB7Z5D96QoEjm73HcX+6w\");\n        a(\"34vN09wZ7uHvHoK10T39B6mfiW1kveoXrZRhw5X1cS7IEY95NvrP003P+Q+Y7m6drPGTzzwLTbvYqF31G+aKAfKAD5eTNFIMrn\");\n        a(\"gB6X28AGnG+T2+QHMubdGuygDelvmfX3vc246DD95a4xeAqQMyM/tgqtzt9c2e/A3w3+vxv8F8A79wPNfwH8wzZ6kO50byj/5b\");\n        a(\"vQ3vOIo/783bCLe4AoV7jPbB+leZ+SyEIPc0ifLVbrJ/+jzfx9f7wvsNFP+M2N0Y/rXaMe6W3YyTsG5lB/geM7Zn2szg8TedhD\");\n        a(\"GOkZ6GPuN8wLV2zGVehDAvJj0SQnxa314dXdlvz9mvsv6SM1AfuIgu/FBnrPhh4uqj5vDvE8T0d5gcsB18ojLsXqXPc08oE8PY\");\n        a(\"y4XzWdD/w1pKeBwiXABK4DmEJ5fjSF1u6rq3H/b6gfGAZqwAaTX3cB7TRRx6/btsMmy3ITSOdH4Ufab77yk8087YD1jbv+VvcG\");\n        a(\"v18ISqU5WhuuX+B8zfx+pvml6/Br/aVaTth7Y/jx8vk9YU8C6gXyY8tQiT2r/zfkAzPAGk7gw+0gZZqvNkJPfsRzJj0Kv9o8h6\");\n        a(\"7TTqT9NtZOtg0Zbn1DW6y+X+j+4P3NZh6/vzXPCZNcdmJjeGJcLc/TEOfjahpY1oekJHSmDAxMWdhLDpivYz9+8PPUsR8f7MOH\");\n        a(\"+KLpfpX/ndar/0CsFzDZUcEkl9vp39Vrbmfod0f0tx0MzALzQC7H/hrn2wm4K3AXA6Vdze0TiMdiSoS/f+JHGnqUEM+a9Cu46f\");\n        a(\"7nOQjrFaFnfnjdpvgRf69+80e7Sf26DoYeEQ93Vdtt4aDqebanrTruRVwDeg+1vv9n25EOfkIP6j0S8xJgoQPXdZSB/k6UAxba\");\n        a(\"ref96W7w9OH6cX7pWJznOMgdXy1fQDx7AniciHo4+nF9fTh/AOfrhxwwHYT+BtzV43rI8Gfo5vfe6FdpxDXuL4c9ZDfR9uQ/yD\");\n        a(\"o/Z5Y73aH2dBrygRowBeT2lEXcO4J8ILenvAS7CuF8p/81e1qGnHcU6UBuT/lx2p68Z7j/UXuSBpE/DHlgZgjnAWZCON+ZiJ9h\");\n        a(\"Ht/K/rUqe4Ldebh98uc/7lfZkrbH2YOc5R9Yr39F2wL6BnqBEtDjAm5p7V/ZLjQgq5MxxfCysPrR/8zzGw/0N7AVracV6DFrp8\");\n        a(\"9G9/9Kj9syP01Zi0x/0Jf5uYLbY3prWj/eg51pjxrajesxzOKUvy+FfLO/z7WNtR53CgVm9GR8eliZjic2l/UZht2Z/X8L0ONS\");\n        a(\"I60vbZ361JrcjtSna1t3lT79LE7pM72NuZ9XazQLvXmRnzfp09tE62thnfqUWpypz79qny3M36jHZxIR3te32UT69Qvb0noqOK\");\n        a(\"yfr5X/jyM/dgn1nq8nE3IkaSw6M7zF7D7WZD2erKC95rej20VoW1+75a/bWL9P6nrct4AZYIGn34Dx43b0F8RzwAJQuBF2D/QD\");\n        a(\"PTchDgwDU8AcMH0z5G9BOWAB6L3VwCwwfZv5PtC3usa0utXY0Uz3t4EWG/99m7P625+3b2f103r9zHgLwfwF21n3szDaacVjs1\");\n        a(\"9xne1VeHZj+pn0HOwcqAEzzyMdWADy8y+/jn71Buz8BfRHYBqY5+kvQh6YBeZfQvmXEX8V/TGPcsDwKwYuA6VXqf6F1mLHFNrl\");\n        a(\"/cWvTnJ9dMApTz28j/vkyZ5HW3fYhPf6nUFRDPjEjnaxi62y7+o9qqu9L9AbaO8Ieju6uo/p6uzp67jS5d3B9Dxm9pPuaONvOs\");\n        a(\"RZ/bR8/x+Kqhcrq/7gwaQyHd6BHo+EnWgeAw7jae7XO1bwPSOqR5NY0TLA2o/yg7fuTPNKrZO359yN6dfhc8zPc+ANP4N/J+v5\");\n        a(\"sp/b8S40n9ZD4T8t8XZAO/Nj59C4mlD00m6iyVHlAiWhqBGlxBPtZ/bHt4Lnsg3fiUOdZdf82D00FI/IsXF11Ewa87pdrJ/beT\");\n        a(\"sv7Urzml8n74K8Ye+xMN6XKQ+W9tWAceuu1uO0D/Ze2I3m89Z6+V7g/lfGrx1CfTPRWM3w5WrczZr3CtLfaqV5eQ5zFu/UhdXj\");\n        a(\"V2sIrb1m35w+L2CyczP/3Wl+C+AvldAB/F1KNf/dGP/puAX93en71uIeNJ+lw5w5rjWHBtVo0vDlltp4xYZndk+ah3C4M3luF5\");\n        a(\"LiesXSmMJaexl/izg2obw4EixBTf5WSB3bPH1+PEbkY8ecOX9r5Jc2tbGtiDX5WyI/GIvLSYv6m5B/ZnRSQR2W18m5HwE86Iq+\");\n        a(\"QHdn9zFib3tHT09pXe1Rve2+Y3xd7cEun/fooPeYno5A75U152ng+mui62HZZP52wHr6wNvCuu1xWjRWbkyL5wyz3BYoN6RckH\");\n        a(\"QR7RyKayWo2w4jZ54mjjKsp5f2E12kfFCO6QrDetcXSswo1PWplbyJ85w2E4tR+j/PTn58aIjk0Ts0JlI8RsdFisdpg0O0ni9T\");\n        a(\"lQTR345AgZaqDXV8N91cjPfmrVe3fyi6eV9gS/UGNb49bWGfOoJZLle54avtU0IK4yWXq9xA5fnMVk4QIFexIWkFYpJQKzbBy1\");\n        a(\"du7Cl8Xl8AxxyXM22UWfyCFs1xuaqNJ9kv7fS/wuUqNnLMf1VfyrsvytdsiEh9TdUV5nK1GwvIS5zncuWF93PfEBJ5Xr5mgfnH\");\n        a(\"DZYq2A/lsSA7+x1d3MvL8wXK1AeGVh1h2JDd6K72V/LzmBc6TyDDVPECL4+FwOuu12+a15vPk/+BrFfYH+VNC1fXU7VQkS7x81\");\n        a(\"QuNPP9SinbaH+L+vna1UXkNayJNdTU7a072fFtcZo8reRQvg2pHN01vLybQvKFrjy/nvJCU5JD+ACUNxZmNv5swzjNy1cuUJR+\");\n        a(\"sdVTjsvVLhSzbyhvOXnF6jxYZAaFW9bP1+lt3zKIqULvpKwx+wrjmt1dR96rfzGa3+G+B1zCIydc/U75FA3sbjIL+ZbywiTi4h\");\n        a(\"tYyELChzROZqCq5JM1513+nSLjOQjlKxek+N2o6qD6/Llc9cILvuyibb86krNczrTQYF3t5iknZ63OwxcrLNS/7hUuZ/WCPrwV\");\n        a(\"ffVYzwDelZL8NfTUwXUkNS5X++KVlFzgctYvANnrP7qnFLi85YuoZjxctdWfB7RB3vrFCHstQtcf5vJWjnrupJ+vX38GWc1rnX\");\n        a(\"Yrk/27M8Y/4Mvrq3Vwk1fqOQRyFo5i+IgtRQe4XKWjFU5WavxKcTlrxyU9FtSM+jzeVh4HyPNzr6j/EAvFw88L+fqORu5ilA61\");\n        a(\"OMkEl7dy2MFZR1TvmufytY4v7vKatZJ+i8vVdxzBY9R4mOV4iNSWeo6XPztW4ZBsz7s7dVmuBS5f5SCBd4QwtCUuV+1wKOxBCp\");\n        a(\"b9JtknjQIHFNnvx7DwOgsHsPtXkoXXWTjAzf5n4WkWDmgoFq9l4SMW+jcVi/ezsMUWxWKMhXr+G63d5j13DENUCR21L3Y2omjl\");\n        a(\"SUeG64u3t3n/7xH09adjzvBT1fIUZ9lIrcoxPK+1W/OcAj//kTbt5Fieg3hAw/36CGueEvi1eWkeyw7l2ST2Ry/t23yWkojjex\");\n        a(\"Q0T08HzaNt2pk8txVHZfVCZa1F/V6a54oNz7BDeTaX7HaEeQkuiMUvw3c1qP5ZOIrmMe9Qnk3isJycKndQz1HWPJeRvthJ88g7\");\n        a(\"luegeqkci06OaPhuC80z20XzaFSdyXNbsTQEsbGIvTfAd2hInvNH0zz8DuW5jcg7J/9uD80zdQzNQ3MozyZxXJ2sIJo92vRe1v\");\n        a(\"z7P900jwWH8tyW9c+RmfJMYf4Ymqfko3kU/irPsxv+4d//GVBkzXBxVP3+T7fN/K+H5tMad2a77rg2z62e2Gs+6/adQrr3WJrP\");\n        a(\"RNyZ7dvC7zNSPKoy4uEemmfrcTSPtEN5Noust45cYBgyiw+w9qJ+p8l1PM1j0aH228zbMyDrSXz/jBqXlmx4ujRn8txOPENORG\");\n        a(\"U8q+G7asR4lD+B5uFzKE+P2BuJKLp+RjQekyvfbZxgzXcJ6bkTaT6aQ/luI/bN6GhTfDeQbNeFk2geGYfybBKlBJv0xthiG3y/\");\n        a(\"kOaZ9tusW3Qoz+3Z63I5cvHa5Dd3Es1ztpfm4bnEmTy3EQNxNZmIxwL8O5X0/SXcR/PwO5TndiWerDH5uJvupXkOBGgesw7lub\");\n        a(\"2I11wgOttH8/T20zyyDuXpEdc+GBCs/F5AOEDzFUSaz5JD+TaLxovHwJQSuRjft6V4NgZpHkLCqTyNZRT8VuoTaZ7LNjwnHMqz\");\n        a(\"URyLXnj6TDSJuBCkeb51Ms1jzqE8ty/5dy9gk3qMR40n0/P63ADNI+dQno3iyFiln2H5ZLo9FwZpHssO5bmjOCZfoETkmMnP8N\");\n        a(\"YAzXf+FJqPV3cmX494WtwYkcaMb+mUv0tN8p07leYz5VC+OzO+5bXw4IzvalN8Z4ds/KEO5bsD49u/WR2Knq+DLP9eOL1vdnGY\");\n        a(\"5jOQdAZfen/7+lE6toHM58c2IVGNxCfX9lHMD1mP929Bf20jNvNsh+kxdzx+z/cEA70nGpgDugLAfgO1kwzMcOwzMIX8NDADdP\");\n        a(\"kNzAMzvQ3m34/pC4yVdVwYttavD3qdk2zm9/8z/WpBxIFZHu9HXLTT73go2F3Wr3/EWr/z0OvS6TbPE/8z/aZOhh6BOWCex4Pr\");\n        a(\"0K+vrN+MZD3O8vHBN0brT5hxln6FAegVqAHTwNQpyD/VwALSPYNIR34Y+RowzeODpvlJaNz4JN+aSnGMWutVgj7TIZvnJofqtc\");\n        a(\"D1wPU8BL0OGyidBn0hPQcUhq316hmx1uvubLnvhaI6GZVVSwVPQI+jN3uuuG3vd4fufe/MwiW7n3DSkyH++xzdfR1eX+Doo9o7\");\n        a(\"+n1Btj+wv6+9J9AfbD+6W/R2d3T0dPZ3Bq905VF+ib9fRDsJH+K7kOM2613qtJPvjOr0vNSwId/DzEGf/DggNDwTS0ZX92DNRm\");\n        a(\"IzevRSZXXx9NhmNTKViKvRy5VE6bpm0X7AMFADpoBpYAbI61rk9gzeBaSvmO18nJ7H+s+0Gc8d0i9qnrNDw6PimeVnMg16qLd/\");\n        a(\"8QAXvc9y8sjpIzdb5Ht4/uR+wn7T7GCwmR1Irruvs3eYzpeG6euZmjpWVS3yGyvzj9V1ROvumzxFVsn8oHI+mT8sJ8j8Xi1hI7\");\n        a(\"+Zvr4/aDuXXadhIAx3AQuWvAEbJFgYOU6cy5LboiAuUkEsK8dxG9M2qZyECh4ekcSTuplSV0LCm9Hn+W3PeOI0PTo5p6vu+Pf+\");\n        a(\"9but179SR6//k2y9/o/1D6//jZI330uG/e+E+XldR7f/ZhR4rk+ogyxv+KEOev8PdXjg6qD8/v3PW++zQx26pr32P3J1aNUhV8\");\n        a(\"bzHjfUo7YqtF+uHvNpsM7VZdL5r48719+H2u//0imv/5sq/OPLzn8+jfbHL1r/3xnoqsKWHvun/MCP6+Hya6wA1dXlV40KTz0g\");\n        a(\"TwOym/FCvqBC87h8OwMK3/X6Qm62C+/nwbzp/EDDZLTRYJevPnBKFwvRHGqS0HTSvfm0Igmjgy4BfZLw0aacgmXj+JT3/fKY8n\");\n        a(\"gB/VZPacphPquLYVwc2PnTmNn+EPwRWDtfPM0XZ7Y/6cefdFXUp4akSdR7R10flmtNqTft+rtugLc5CwPm/LtmLdc8pgEJsrSP\");\n        a(\"M9dbDvsSUBaPcQc0SkBuOYjoRR4DB4gZ4hBxhObjiGPECRqfIs4m7toNCcbRwPahdrPZqJGn/QoYp4gDxAxxiDhCzBHHiBPEYw\");\n        a(\"7v6lLkw3lcvh/jOwipq7ZuyunnQqTvId/FUVSqURPLUg/YGlFMic70u9ooUTkWRuRaOi5VbtTJ8dYotbsYL38avd9ridZr9OH4\");\n        a(\"1/VMfRCVFtXE3c4IPXQAt6XQl3qp5uO1VHtRFVpO+s7sdFM6valF209n6xuyyb56u7iK57WNdf3642pkiJ3IqrF8ZJTSYNKvQU\");\n        a(\"/etqq61CvLoA9BP3GEmJ95+ZLP4tGCk60y/Qad/WR1UsWYH/DH2pzUdkiwa4hopNaL2fwsDhBn7nywJASbgE2tTSlYex9hKbc2\");\n        a(\"o2CtPmIUrL3vRCy6jP/tq9dvlq/J+/GSGn75sipUMehtVaHtap0SY+9PSWAtrJ9Ruy6lmZv57dfX5N3nKZ8shCM78flAy2NAGQ\");\n        a(\"eY/H1Xcrlu5/y6qUma8owEiBniEHGEmCOOESeIU8QZjociDhCHiCPEHHE81acz9VFc5Z8SPTGjjJHv9uTKZrn6NHT0m4/8c96Z\");\n        a(\"837znm26jl19spDOrneVy0K7W5aoiq6RohKFmPQhWA42ATvMqTrZh2KtrEZrQ4FW/iLbnLjPsG0epBQigPM2HB9SqDnniFuBGP\");\n        a(\"lFM+fazHmHxh8Qb7s5H4X7fErApp7nFAn2ln9zx/9kcd1+w+MdNO/4p2Af0qHd1lGwD0Dmjcfjf3bH//yOn8z/18NV/v/re/vj\");\n        a(\"8/cOUexruXtSqFbJVhU31vvDyPkzpw0DUJzL0GZISzL0jrsOVZdeh15CL+2VS/8BDSRN27tcQ5qMuKAUl8T22SYHW8aMGTNmZG\");\n        a(\"RkZGTsyMjIyEcoJnpYkm0JT5H1fpJO5ECW39NzfP9Z9fn2EAleMdM6+U3PbJeSIv1jWvOKBP6A3S0anlkrXVLLPzFMv2y75Gxu\");\n        a(\"DyKmRZbZitqc9+TONPH9PAvHGTQUN8zgfuJ87RC23i5YpGU1DKse4BT7NsSu1VquO7tl+CRYk68wYKMUSuZGINbOU2J6xLJ9Yp\");\n        a(\"+RWpCAJgvhZlD/QuagN8jcbn0PBVL1c8jFVn2r04nWr6F+dpH6K4K9oJVGQ/mctmNZyv6wm9OkrkXPtxfr5j3q75pes+xSeuQY\");\n        a(\"NVpqF+59Q+nKD9vyG8EZMQXXNTpVGIqUxy2k8n/Z+QyPKyeUNhc4FtIP1XjqivGP0pWy7V4Y/hH1ff44lDbEfAiHP2dI6mBdKm\");\n        a(\"dQ1hyZgHJWKucwDjbQvFS+Y+U+K2NHFeWcOP4Bu/1EGDhA/L161PGOffPcS/WaTP+gUuz41ENrV0y5gYYFKpUaMy6NoPqSp+PI\");\n        a(\"9ZnzSDuIuuPsAKHjKvRhcByRcZxfJehvoA8D2Ihe9+P0A+i5IDMyzJMYANcUHB8Mzme1IPLNaSFo+/K1DqyC44KryKz2FeO8Bc\");\n        a(\"cFQZEBHV4kc//A8cHK8bYWXLUYFwYVh28UVB56LvDXe6sfnwOOD9AhPHedPCFdcJFA2tU7FTwGFxPscnL6zyFjMz4pKLVux8Kn\");\n        a(\"4ITg0f6OAkJ+ChwX5Mm+103QEJwYjMl80IEO46JBk4+q2cmBCwMbiGo0nBjAgZ4LPow+6ef/DpwUJBh8VrMjcKExv5tXIMgVpE\");\n        a(\"WD+01BM395cJJhvF1Ug21wEQN29YuK7IETjMyHu7qPeQJOMAbnSjqOuIxbGG1JWcWcQi8ZVlf31D1dg1sYQKdKYgB9jJFytJ9M\");\n        a(\"4pqCjxgTh19VdNZjXKzBr3+g67kBPmqY635TwF1wkjEsUCnP6/bkdcZ64KRhK8XoiiHjR/q5/a74nd+HXjRUwU7l+AkT0QYnGo\");\n        a(\"VgE+omcT2By4GD/WWcxE3ARY0eP1VDJS3GJRsZYGE4bMU0cAp+uRf4x8zlG51qyaeQll5UO7/U/3kTxq2llluRk0vosZBekfVj\");\n        a(\"Xn94qX5PXtc8X7c09a6m/j9zV87rRAyEEYIOEOK+ZQFB3AIEEqLilpC4xCGgoDBZByw23ijeBUJFzdFT8l+oaBAlJT+BkhKPPZ\");\n        a(\"MlXnvechQI3ntJ1t/32eNrdux1yiXuv08e59frTkMC/jrLf5rjB/0TafwKwmMC7jqbvxPH/0v95XN91j7Av9R13v54mYkj9Ypn\");\n        a(\"rZrfCK5k+8fZGfWPVzSusuknmD633nnrztULN67fvnM7k8/dFEcyQ2XraopBipF7tXtgd/tQxAiOPj6axm+nflSXw8rY2h61Eq\");\n        a(\"kc1CNZ3AVpQMJp6sdGSDGwoq7836NJ3KauXsAqmNu76TeQDhQrKlKKf0uX31skKkwHt4906AS8oFVUynpBPZ6Uakyfd/F7ErpE\");\n        a(\"BSSmnjMk9U9RPK+ZlHooayWMHKsz4pyY0/hPipAvWYJnMhPqhXZa/exQEDXw5OwwWDjfXpSOvjWCLJ2HLeY8Kd1tjK5lzv8/SO\");\n        a(\"uqZakey1Jc16Ww/gBU35bxUGjhOafNEA9a7FUPajypZ4FLB/apJ/ujfMDU/M/y8dyTJfEP5/tPxLNw3yZscAd9PibTagI3B8oe\");\n        a(\"FTdLJa0SjfupnyhKbkVjdA1h2VnVeICPTkpTiKmCNqVLldDdlcj3dGoqZMU8dHGbEedbJ4VAjajwjPJO+q0ZnZoQcJHJ310jH5\");\n        a(\"UKxpqhPyVfjLR7C+pnxMAijtcbBaQfeNSLjN6Ojp4zvInV0vaI9QCJatnx5wrEEEZyqKLx54l8psCgV65cdF0zmc9YTxOVqbQu\");\n        a(\"LKC6uI2Iw6BC29Yh1tqvXDpA9Vg+Vtn5CUoThcajkS1t/01ZPcTw5aGOMhMTF2Vj23vMT0gA5sc50nG/G+W7JuGY9Q1WzzNl8w\");\n        a(\"nn3DrDNc5o+wfFAVE1fmniEcxt9mivdg9jumfAKTeZz0O0Py7wj32YSjx/Au1evZhIA3c49LGlU7p7tcsAChifBW4e97f8wiX1\");\n        a(\"egML/7DP9dUjw84Xgbj1tHDothcUnH02dHUAAxC2n92k9qitFzlSmXLG+FcRP6RuGxjTP+kQ8chl4vsX6bTeUpbf+Xe3lXq66B\");\n        a(\"upLv/OLr91OAdbRMW4vdT+XFF92LF1QFQh3FtbTR3SOyjL+vkhAQEArKUUTqTHw2qeDSz4b7S/QIG9HArP6d7Clj6aVmOnhUMm\");\n        a(\"zv1oKra8sa6psPPw8yn4NaBbVxnV/nrg1WT1ti70axsW88jKVr/MrT9vyek5CoSx88dd89TlzMxH5zORH8+UqwlQQvL5i3WEm0\");\n        a(\"CUGGTrbdeSekCQ6h+kN6+kVhOdNdJO6R5I6LZUxIREwJPJ/7rFcdN7tILpXxu7uh6DkFy/oPvMxoKnZ/wI0JhoDGD2PUR+JlAY\");\n        a(\"pYpfxgS2fkgfy1dXra2hGR3l/f9Wd+hZPEldEQXXn0kX+nBXM2UvRhdI4lb8/RM+9/N5Ofvczo/XSzwn+PY/fW7nEs64eErlfi\");\n        a(\"zH337/Gf/9dcz+9gc3r1y/fKNz/dhifVtVi1vn7om5Dx8mhCs4vLSfpw8r+Xi2b3z2+xuMG0eGAjtFXyp1Zza5YkbVYn2vXn3n\");\n        a(\"UpjGz5VaWqJd23cPwX3k2bhugcfvESGS95AGbUWvKTcfKB8Ob5oxzNKq8BRqycx8BWy0UPKN8rO5w7eYqf3v2kz514smOoYffc\");\n        a(\"F+9d3/ZZ4zeHDbx/nwbdqPIv9fm0K9SPj/zLxkZ9aPB8H99wQ45DJ+DOkN5UQOdT0LkuBHq0IVR5m4YKRHBCjJzNO0WCrGqn5S\");\n        a(\"4f4vxg9tdSQiUSNKv5r4/WK2KJTRqkjnI+b1CATkntcj3mftcYy8/xPzt0D+vvGathY8Jjl93PhwpDZ4s44OzZJ6hBwHJpLLlG\");\n        a(\"tgXaXbw6LURglX+7lybezqwPI11gZjN1rkxn2Ev2E3QiKQj8Odb2xwS4T774ouS4g5F6KQtRShClj/ptV91Ni2UNl2hpsLjlwQ\");\n        a(\"T3Tdi3cYEEPiTa8HwOY8cRm/PLMXb+EQIwBw7aqNMy70POHAE1kPn/Tof5QUjZOpb9h4ZKG6H82EW9iscvW9PsH/7NEMIGz7u+\");\n        a(\"UdJWlrocBLHPlIXS9+l74aQWqWnzYL/bKldPCi1zioEDkHsvt6L0OgpV1ZUUXvfgFFcMAlcGtincz9/qYcfyb96pgXgp6MPTu8\");\n        a(\"mfSbU7w+3qbNT8auWCeOGIhenYQ2Shc3SCmSbeiiNChFRBGhcJf0m9072AK82Bzo/p5n+xmL9XmYCgF+M7bXM/M8M3s37x/qeC\");\n        a(\"nJB4yoOl429SDSAiLc40R9RDfsouQbgGJ9Rvu8mVgoQNGeznH3uIGFT4OxbJlS+nNQzowQnk/JXy8SCPX4Wv5u6H0jfp8u9olR\");\n        a(\"jFyoioL6fYOgKGIl99lTb7pSh2mq4yD1ENPcN8of3YREv5+3w7QD4VDYI+VHYOO5L86XSW3xjbqucL4E3OeFHj6NvBBnmHBRnA\");\n        a(\"PqiwKa/oV6svXr94mA1n2bdYpQaiEAP/NXn6v4NWEFpcozwqz6mAqbLZAl36iPj9RrZ9FvUF9Ss3WVIvX6KAD/UukjuZDsR9YH\");\n        a(\"AQWm1vfm+j4K+uxcj//B8ak1cJEm7cxVLq2GZM21Cxkx+FvzEEbTuF2n8+uQHFGU3pj/ZeZVBzj/aQBP/++w9K12ZuMr3KFMsb\");\n        a(\"KPen7AAuap5Pj8fpfv/2f93+CN1B6WkdjNI8h7qKw2J9jP+HV2E+7hGdkJ/qfMj/ebp6SV0OZ5W1/8+vP3YmNAmsDRQol8i40Y\");\n        a(\"oUqOC0UfkPf8vFnBz6fmXMjPX5I5+dBjoNhvG5FDaOtliJT88PqASHpr4siv5svl2vy0Y7zBfT95d+oV67Feqn+dHKsPquIhmJ\");\n        a(\"DdcbzA8xb+kMxDcd/JQ2V7f2k2h39nKwechMbPzhkpnov4EomJT0uuI1byXUAS0ubtsem9bIsirvqAyIBmvqe8zgZK5dlBzSuh\");\n        a(\"ji9kkHzPec+/TkA9cod0+xMRzf358Mo/U7DqXCZvS0DzHGysDW7oUNpAfCN/X8m3NgADjjCxv4WJ3qv93bfNdMuaikHp+6w7G1\");\n        a(\"eK+w7LSA6FfuBb6/p03N72+d0dPf8oEInvnN8xJAddPjmpcFqY/ulWKjvh+uiipP3/Rx7Qh9wt06SGKB3/ABGIYKZYhfxcrS/V\");\n        a(\"XfD2KruUxpVeX0LI/LHoiz2Gz7RdS6vTQBT+JjYmk8ZHfWHEggUfwW5qra9CQa8PFBUl6koUxW50JdqVuBMEQVDci+JO3Ii/QP\");\n        a(\"D+ANGiuHPRjTsXBcGNfqYTJ53EIQouDie5mXO+b85rQi7cu220iU5Gl9m6fH9NvVT/XkdcctVGxv7K62RofM6pkLdfy4bq//rp\");\n        a(\"7+IrP1Bbfu9y8sDZo1TYpNbtV3oTpYMd6GInetiF3diDvdiHA1jAQRzCYRwBbN/dzybnzh47cQYAqvz9nusK96HSwhVwF6ilA9\");\n        a(\"kVpxuNpWgMKT0X8oY4/fkbkPl4uQ5Yx8F8aV1u/bIalvVqhbX3uO4NpUPJMKKaQI3661TZrxKnf2tvCbwF55K4DoilDpZ2RSe1\");\n        a(\"e5bZa5vsvqCFgOgAma/0OlyKsOu9dV8vueRcFx3tW9n4NfjJ7Fl6/Wh2rX1UwK27qItDmFma9wpjVQnGoIHBdCUGkxUYjJdjsL\");\n        a(\"gMg2GIwaiOQS9AKLZCnFY4DnVrOVoTidbYR2vRQ4t5ao1ctBh/+Yr82g20p8vQnoRoj+toLwZoDyXaIx/tnkd/62f++g30pyH6\");\n        a(\"kzr64wD9RYn+0Ed/5KHfY7zExtm6tBYc1oJIcz3DD4lfJ35AfEl8cqFv+Y7PzfVxA/G0jngSIB5LxIs+4qGHeLQUcc8lzhriqB\");\n        a(\"wluRw5Dn5FXtWYjruZO50jXY9RgIg4EXEi4kTEka/ma/MBO/EjZRNFrPSxMql/lZ9z+JmvlH9A/pL8ffL3yJ/cRy7518h/Vco/\");\n        a(\"7zs6Adw6BTw9nuPUDNGkfZP2Tdo3ad+kvXw0zwv09YXy8pSxt8BFsEB2+XrqKq5mfadYklg+sTxiEa/npljzPVvs7x1ngeeUz2\");\n        a(\"eKfWPloPJi2pj3s77YrPtig4cNQ0pac9vTWBo4OobW2pvfx53zgLwAdKgtcaw08zoXgSuUrxeKMcns0/0nOg4asxrG+0tA6zLw\");\n        a(\"kLp63A2c/LXiodfqninnrJ/b8TWO9Xq5h+UL+Y76+174cRV4fI29cNXYT1LGS/XxKqOPK8R+003WPOXzDc2xMN/X+ljLOl3LXl\");\n        a(\"qrfIishxJe5+Nsn3lqZhSx8v5scy6ind7DTM7dBu5SXlD0Ws3fjFXm38xTee7KZ+R8jNSaG8aa1RKrRQz9U7OGjZxa54fGrMxb\");\n        a(\"LoHkvMnHohjT8pjZtcXmf2jzXSuZr+FP94GvlKeU/83FPIuVtubRzE3pvEqMeWa8E9jvy2fvn3r0j+8TQQ2B2AJaG/Vt1FLel+\");\n        a(\"I+hyWdVEfhkt/nWr5fjz0BvlPwVOe2eJ4W9b/mquzd2l7/lnOmYK96v6u63JJzM2f2s8V+npm2dl92v4Yu5W7NTzFm5Tn7yap5\");\n        a(\"hv4UhXH8eey9R4SQn+y9905GRNmrv1227E1WZEYoI1FSyi6RTVmFvEIo8YJIVrwQn64r7nPPPa5x69tzzv0959xznvOsc84vCx\");\n        a(\"rqxr/an0uf/w91ydtTDnl9/jDR9qZR9+Z18Vj4r5T4Gck1gOy8JHISnAF/kyNOvixyCNQDafgLXxHpCW5fTjtuzz42dVxKv+7h\");\n        a(\"/mtK2viT94ZITXD7eooYFuT8+cj58+Iba8X2T8/pZ8JNXCP0R1uvr8/6Za5ZJufZG895DHX6NrN//+38V98T2Qt6A0+/zn2StS\");\n        a(\"efDfr2uDZ/Pnhf5MsDkRFQu++y9UTbzqHB+lh9CKnb7xfNI0WJoeG7WI6H/UXkB0SeiRQDVYBLf517lGkm1mQZf21knobHt2+K\");\n        a(\"6Frh3FJYj0usrz4/dGfrL7LNJnl0y/e5LI3k0iZPrmXy5JB3k+H15gT/Lb5YP/jzfZDTVEMvTPlv4lbgI3NK0dCmvp+HcQZGPG\");\n        a(\"hNPGhNPGhNPGhNPGgdnF81iH83sIXc2AJ2wF6yTHgWmeocBGp98/HsKlfBCJDGl9o5ROLM0aieT+W3s+Ap+DGGgO/td75s4Riy\");\n        a(\"cqlsya3yBj6lPpD6VeovgTeXQf+S5OGai/uc1PiaJoWlCevRhPVowno0YT2asB5NgvWoF/PfdQuo1C2kcj6/OmVwhN9KFVZpCV\");\n        a(\"znJDFfuykqm4mcWpcsSv+0F56y1CtQf0Ld5zt+niORX6APldCHSsF+vE5sDlOKqeQuTg2auO6hb0SHYvHgE20LllDZA/Wdr1uf\");\n        a(\"nbOkykCwgbY/+F39v4DnPdgArB/wr/OflxPPtDYZnUqRE6Y5y9heTuU1KF7erGeQN+Qhb8gd5g3ud2lz98g7M5+ksc2ppPIc5K\");\n        a(\"/sX58V/L4bVAT+/NXK3dqD9VVRWyifwU+Bw1W+fzkf5WngNnXTV+q8YVxVlQugIvgxxsidRTiO8DdzPpuPPB774hu/2pg9nz1c\");\n        a(\"TeVLdZV2UBNnnDmFK2a65GN9xeNaKutrqyyGCs8j6Dbqe6BuuafX0891VLLqqqwEzvzJjtHa/tHoWPfUUzlVX6UeVHi2Qi9S7w\");\n        a(\"21srY+0q7h2AYq1RuyhtDYOtn44Gifl/ub8mAEffhi5U54ejVmHaFWz515q/f+Ktr3qiYqBZoyB2iatT4H74JmjAUqPCegK6iP\");\n        a(\"gP72/Ay+bM3RC6hz3MH5L2e/jLUk7WM5A20LtlCZAk3bZhb8r0A98CdrM6WlymdQBHj0LrW952+tsgacb2V1xb3m1dqotAC3ae\");\n        a(\"PjOwDPRdAbJOov1NrBprYqg9rRC1R4hkEXUK8IdbW3uVOR9uROHYiNtBGeXNR3UT/cLp0ele6osgocpo3wFKS8Edzu4J/vO3jy\");\n        a(\"dkKHoD6+2fBsAhWBkcsf2UezzipFuzAu+knT3vrgB7Qt2RV7gf7OPubAtx+0A+Ede0jt+YTfZ/vvI/znaUm5RuJdQthX+rzG87\");\n        a(\"2kcWeKSIb74QwyzyDzDDLPIPMMMs+Ea/ZH/Vt9iOQ33WJ56qn+KkMG4HegYdu/yJk8Z0uRceSiTc5w32XGMVil8RDGAXXFyp38\");\n        a(\"dh98BSnWw8rFm2vdHYYeD8feoT6+2fDcA/WA0w/0ifqB7iOQLXgDv/B0ozwaFAGRdg2i33nI7x/BYuDSGzPv1PFiX5ZKoZHYIN\");\n        a(\"Tl68s4fFmDUSpDwXnaKfXqlNeBYyApl7D+uNlo5j2GPmgjPBWoT6P+hLrnbt2ztuZdAvXcxdi81O9b3O/DfXtucrFcgdy+75vz\");\n        a(\"EivzECuJl7xHFvYcxanftyaxB52s0hEkfT+NH/Ddk5lyStl75BFSKwe3zdeI2fywGdj8TOwBmmZvux/eorPIx6B/8l+dJbR5Bu\");\n        a(\"oBMxfnWnyYTbyfo3IURGzD6HWjuSo9wHn4DjzLJgUp9wNjgC9+X+P3h2AKiMoqJ7LK4fSPLeZhc+DNr21+OTeysuoyX+UQeEKb\");\n        a(\"SExLabOzF6pkX0QusuB7j1nUC1A/v8DMzXx3LTynQT2QlLM5xx/KKPuP7y9ROQKeLP7e852lrP0yyrwL/BLlpaAi9fAeyH+/k+\");\n        a(\"W6twErVHaAc8B79mPjiD9ux3SwwiqVzGrkt1JT3b/9y51Mkj9X8GCNyrC1+F8gPPepT6e8B6o/c7d4ztHHf4cX1adcMb24s06l\");\n        a(\"73piGvR3/yE7CN+VjdgH9LsPXx74cP95rD//HL+ZfTyo9419swrBIoii8PnHLuxE7O7u7u7u7tYXxcbAwsDu7m7sBLuwu1FUDG\");\n        a(\"yszxjz2i8+uHA4Z3ZnZqd28i74md+b+Ik8kvk7bLWZ9jyLNCqgrMCol1/f5/Xp+Mo26Ot5du4xrB/AltE/GHO/WsNkGRdQC7CU\");\n        a(\"cOKqNDagAbgP4f4qXfZ8zsf/bj89LPvpYdhPZy+d8S03fnMzvuV+Z3NX7Zu+qu2EgDpP5l3jjXe9S2+Id2Vq2UT9ytln7qnM1Y\");\n        a(\"DAr/i/g78C0ygL+Ed7KzEjBFOEd3mKJp+nYCIe8Hw648HMgA4A3GoyK6DL4BXArbPcHzgnoCVAXDfwvwwtWFzj4HW488Gftxm/\");\n        a(\"B2yNE0/mUofz+GbgQFjGhWbv9+e9/sre5Qs/Vtl+3f5+af0QI5RiNALs18d41z6ifFPfWszabinpXOTrw9utZJL3G0RSu+tOtZ\");\n        a(\"YFtGpFQNtX4h93Htw70VoFRN3iDqC3LP1QTr3fp+/LswTOEWiLWWiLWWiLWWiLWbzN8VdpS7+GfZUN9CWrA98dh2JGDqbI5O3z\");\n        a(\"9Ab15+ybGHdBOeIQV87N9AlbiA83d1RnY0DJcJcF4sqFuxx6C8/NebkxVh/F/4GtxAn/yjyo3DbSsJ25wNZff8dI/DffQf8Hf6\");\n        a(\"zjd+cYrPMpv/iU3w/2v386xvqzI6u/jLg7oPngIPilNpcszNd20ub88eUexq69jF2wlS7bnuar78ewG/P3fqVvObQ/oIUH6I/g\");\n        a(\"H8+zf38f/fQh5seHiRv+9THYp5czdMOu+d6RgPYfpS+EfXnY8/vPx327XocfDyjFCdo++FG9WmHLn2TeBTaDH9o6G/P54acCug\");\n        a(\"nSgV/xX/90QBuBgDGf+uF8dsAZvk2QDvyqLUv2swFVAwI/8zsPPztBO/B1PVg2Kn688GyeWZynT7rAOgkW13E4Pe52cCB0EN7h\");\n        a(\"0n0Tx5Ev48h8iXUMyEc4cdW4GFBb3IcuGHX9t/aoRtsfciWgcyAf+O764V2/HfKLOYhfPzx6GFDfR6wtr76Pse5j1gug3Ad3uO\");\n        a(\"u0iRd8W7h/Na1Gv/jT+o3xOqCM4OKrX5urDMXvIlAOWOdYRvv9yubK6KP9/d+0ny8bxOkBEHg/nwCMFVH9vobvJ41+5+tvMG4w\");\n        a(\"p/T4vxjUfdXPY99OmGTEm+zdGJTrm34+dAinQ5GdyhHev9OzWWfOu3/+j1mO6E6jYxIA9nYvvzb3tdPaKpZT5/TkkzjftZdtRn\");\n        a(\"vx65XlP7ApJm/WM3st/+M22DCz01gQD/xof/M6zyNmcVoK/2r5DcT/mazUDfyjuLNkc6oPBH7kbzXPL4Ge4GfvzpPd6QAQ+OG4\");\n        a(\"/6n/NPdOvo43aC6nXmBpTvdL3+wV/MbM7TQV/p3xfThhLoF84FfeUzGPU38QAfzOe+7jP39e0gf/rK1swN910BNY43b2fE4jwB\");\n        a(\"pgPQ+X36kB6A+s55fePi/Ac/BNG7PW98Z4nqGg0ylwkTjMcwe+HWtf72ZhpyxFnGqCH+3FPuN5kaJOLYH3Z9nof65/Vq6pijtV\");\n        a(\"AfeKOfOd83j2HMQtYX179j7JFPxGLelUD/46nV/PE36WvrOlCFeaNgL7uH53vFhO+LugHPid8+juZZxugHjAp9+fDZr1U5Y+u5\");\n        a(\"zTevBV/f/CuvcX3L9kJ22nLXVVpy5gCvjRuUqCak6VwFL8BURc6H5gAbDifcn9MtWdOoIfxfuA50lr8P3C79o8XAN3D2DsNZvr\");\n        a(\"qlP4TVXTaRjs82rY5L5fNzQw1g2/sA7ZV8+pfH3eAX/0HzuMYjPGxiZMbMbY2Iyx1v+xpwjXu4FTO9hYh9pngA1+zD/ea/39by\");\n        a(\"F9E6ch4GJj36Z/3RYkfVPyB+4R/lfDXMJ/hmZ8v/CvzMcG4rdwc75V+LP52Nf/GprtYw3h0rWm34G/3mP35f9lGkKRhpDfpCF8\");\n        a(\"W6eZ4FAbH4+3dY7u3V/lPxT5h438DG3vlLoD6YLf/w8SBhuG0NgwfLbH8dV5nGkzQB5+kX9sc9DB3tf3+Qm8K+uglHUQytpR1g\");\n        a(\"HK+gBl/cG2Hv0+hl8vg9zdndr3os11+7YP/2ptaX7P1j3fdu3/Dez+8f3/q+GUDJvfZEff5jM0+QxFPmlbpNt/0+Z56RHD7vzr\");\n        a(\"fOPHumd8v38exydb38//JzJtfQeNcHo2kvELNuwuzDB9RzldG0MY+Lv1++Crf4TGOm0cx/wP/tUwecczl51Amxj362Fe47/0JP\");\n        a(\"oS+FfDHMR/xCn0yXAgJnXaLPj7ev1szzgQLaSiNQuqaPQv0ahr4jDPzO26+cH/0l7/yhm+/X/2z+2X5jltBflA4Ed2qnyT+n/9\");\n        a(\"k1eEaFJJUG1WENWDe4F66GFwquhSM3Q6uBYYhq4HnwRj0Rfh+2ADWjGksGAH+l4cKUxc6RA6ApwEnESXiydNBhfRU+FE8aXb6H\");\n        a(\"RwLfAQXQ8eCV6gp8L7QdDZQXQIvgHCou/BIRNIUdAR4PggNvoi/Cwh8aKVSMoGUqHzwUUS40aXg3uDYuhh8BpQDn0RHpaEckDD\");\n        a(\"iplUaoSOBzcD7dDt4KGgK3opnCyZ1Ac9FV4LBqPvwdGSkwd0PHgamIheCqdPIS1E54ODpaTc0BHgBqmlXeh2cJuM0tG3Gt4IXq\");\n        a(\"C3wFczUQ5ziB9elZXsobfAM3JKpdBL4au5pE7oe3CRPKQNXQ5Ok1eaiU4HBy0orUTnKySlLiKdRaeDN4Pb6C3wLfAQfQ+uVZQ0\");\n        a(\"oOvBM0HQubwLPgnCoi/C8YpRF2hYpUA8dDn4EUiGVnHKoyRli54Kbwet0IfgmWVJM3opvAesRB+Cw5SnfNAR4ErgHroefBK8QF\");\n        a(\"+Ey1QgDfN4F/wYxECronQaJENfhINUkgqhI8CbQCn0FnhZZer0rYZDVpV6oiPADcEwdDt4CpiIngoXrkZa0eXgcNVJJ7odfAzs\");\n        a(\"QF+Em9ag7tDt4OQ1aa/odHAJ8BRdDk5bW9J87sOtQDZ0uzcM3Xl0HVMAgPFBUU4x59hqf/ateAiKYFAEwaAogociKAZFUIy9Kh\");\n        a(\"gURfHsRfEQVBtMq6gqXq0Rxdhjf4i9lt8f3/m+pmky986997VNOuU5GKYbvPjhxqxDPhttOuXoCPdUR3wMxuuEv8ZE3eCNK65T\");\n        a(\"l/kiTNYZP4gpusZbeSZKriOegT5d57ajXKeu8AwMfMjb+cSj3V+d8M0o6Sr/gCG6wfM9wqxJB8f4u3NEOuYz0KJT/hOxDo41Vo\");\n        a(\"zQMXegolP+F+06OM5+QofOeC7G6oLXaTd2XeZ2VHXCjxxvvLrGs5HrOj9/gv2lc17sRNeqQ95slPU82Tzw/Qh1jd85zRh1wX+h\");\n        a(\"SQen+zho1jlPGO180FV+DKN0znMxWsdnGC/G6OBMaxWZjvlCTNQZv3uO7+nWBS9+rjNTh7w9enTEV6DQGXfjO53zx+jXBa88xr\");\n        a(\"h0iZ/CwIe9D/+D9XRwXhCsiSad8e7nG4uO+WS06oQHXmDt6ZAfRruu8ZgUuso5Mp3zB5igSxe6d6hq/wdPsNrF9ogucYI5usbP\");\n        a(\"XGJcOucDLnVm6Qr/hH4dXGb9YMAjfi1/jEG64Lsvd190nRcdayw65I0R6TLvghYd8/WIdZV/RZsOrnBOoF2XeAckOuIj0KEr3I\");\n        a(\"lUZ7zEOGtPh/wQMl3jAVe6jzrk9XGPLvPumKxjPh1dOuW70a1r/BZm6oL/wBwddPqncXhbl3gzzNMR74fPdYVPw3c65evQr6s8\");\n        a(\"FfN1zgte5foedW28CdbTZY5R1jEfhaE64QyRzvgutOgaz0Cs6/wpRugGL3i1PatDXgPtusy7ItExH4UOnfBFSHXGd2GsrvEcZL\");\n        a(\"rO32GCDq+xNjJrSVf4OUzWdW691hzqmDe6zn7RZW673lzpCl8x3lzpjBe8wWuHDvkiBDVv5wVvtN91dpN1NMG60hF3Yj2d84o3\");\n        a(\"+zld4osQ6YwfRauu8e8YroNbfB/Era5DR7zjbc4HHfOxSHTCl6NDZzwbqa7zgbf73LrCt2CCrvKrqOo6r3mHedBlXrRqXekSj0\");\n        a(\"CPrvAldzkrdMZP4Dud82fo1w1e4m7rRIe8BgY85mPyThikYz4Ky+iEL8LKOuO7sJau8QwM0XX+FE26wTve42zRMfegRVfutZcR\");\n        a(\"64J3v89c6ZjvR7sueN37zZXOecQkZ46u8C0Yq6vch0w3+LYH7EFd5esednt1lR9/xP7SOS9Vs6d0yKfgc53wNDR0zos8Zk50yP\");\n        a(\"dhwOPGyLs8bp3omN9BSRdcesI+0hyciGadcA0tmoPvMFw3eOku49UxX46ROuPfnvTaoYOn/H4Pqc55m6etBx3xAxiva7z8FOPV\");\n        a(\"JT72GWeOTvioqT63TvhjTNEFh9Oc1zrkLTFLR7wf6rrCp6FHp3wdCl3lx9Gnc34TDV3wz/hDB93OKwRPuB7eDAN1xOMR6io/jp\");\n        a(\"V1zm9iLV3wzxiig2d9HDTpEm+GZh3xfhimK3waWnXK12G4rvLjaNM5v4mRuuAlnzO3OuQ9MFrHfCtSXeVedOqCl3jevtNl7kJV\");\n        a(\"5/w7Jusgd16iS0d8B7p1lb/CLN3gI6abW13hVWeYW13iZvyhI94fQZf34dMxUKd8PUJd5RcxWNf5M5R0gxd/wRmlQ14TZV3mnT\");\n        a(\"FUx3wkIp3wC2jRdS7PtNc0B3ugQ8f8AlJd528wSTf46BetK53whejRGd+JQtd4Ovp0nT9BQzd4gZeMV4c8AcGTxsXTEeo6f4XB\");\n        a(\"usGLvmyMOuRzsZ5O+VY06So/hmad81wM0wX/hFYdzPLnLwzXJd4UbTribLa1oTN+EKN0jV/DaF3nbzBGNzh61XmqIz4Mk3SFz0\");\n        a(\"JNp3wjpugqT0Wucx47x6XojCehX9f42NecM7rKb2PQU66fz3vdeatTnoaSznnQG+ZBh9w51/3TGT+BSOfcQIvmoPVNZ6yOeZe3\");\n        a(\"nKE65j6M1A3e6W1j1zGfgDE64S5conPufMd164xPetd4dcLT0K1zPvw9Z6yucD/m6KAnCK7GPJ3xo+jTNe5437XqlA/stTZ0hc\");\n        a(\"/BgKe9nVeaZ8y6xFejWWf8L1p18KE9izZd8C0fWc+6wcHH7qNOeBzG6IzvwiW6xjPQqeNP/Bn8U+eUDvmzz4xXN7jzc2PUGYdf\");\n        a(\"uo865B706YI3+MqYdYUzzNcZz/zaWKZYS3zmN8aiU2771hmoK1xDWbMXCXtWB5wh0hnPw3Bd8JDv/Xpd5rMwUqec/uA+6hrP+N\");\n        a(\"H86jrPbfg5XfBGPxuPLnM7qjrhPkzSDV7nF2tYl/lR5LrGX/Ubu27wm7+7Jl3w338auw7+Mg8Y+Ixx8cS/zZeu8XQM1nX+BCXd\");\n        a(\"4CXnW8865NVR1mVuwVAd85GIdMIXokVnfCdiXePpGKHr/AkqusED/zFOHXKKRKd8LVJd5dK/9qfmoIrxmoMnUNU5v4VJuuDgP/\");\n        a(\"dMB7wSpugSb4FcR3wDZukqh4F/E6dDvsLXbD/XGYcL+nrGVG/nOzFY1/hAz0Qp6wqfg1ad8vsYrgte39esR+sy74NUx3wKxuqE\");\n        a(\"r0amM/Z3uMEEHfLamKTL/ANqusGLe/5JXYf8m2eg9GhfaAp2wcBproF/wTI6Wsz3iqGkMz5pcd9PpxOejkjX+U+06sBzSrbGcB\");\n        a(\"3xVFR0zr1IdMHHeW5Jh054V88a6dIxP4C3dc69KHTBf6FPB6E583yShubgWqzVbT75FZR1nf/DUB145sgQRLrMG3iGSIsu8/7o\");\n        a(\"0BU+A6lOuYqxmoPHkOmc91/G3OoKX4opOuMnkeucz/cMkVk64yfR0DkvtNwCwR865J0x+Fnj5XNR0ikvvLy51SHvgCYd8XFo1g\");\n        a(\"nnaNE5Nw02zzria1HRVf4Ao3TBy6xgjLrENyDVVR644gJBpw55HMbrnIetZPw65nMwWaf8ELp0jV9Eruu8+8rGqyu86irunS7x\");\n        a(\"A+jXNT5v1QX8Yc7H4dbVXJOOOcd6mm1OY9QBb4UWHfE4xDrjP9Cmg9WtMYzUES+3hnWlS7wbMh3zq5ig6/wDpugGD1zT59Yh74\");\n        a(\"NZOuZjUdcJv4seXfCpa9nLusaz0dB1/gZ/6AZfuLYxPO99ePl1rENd4m3QrCP+GMN0wb9itA7WdSZgjK5xuJ61p0NeG5mOeBQm\");\n        a(\"6ITX3MA90mU+Dz065eM2tEd0wud7Jsd8nfItCHP3nadisM75/o2sPV3jjxHrgpfa2DzrkDdAuy7zM0h0ztdt4pp1lb/ARN3g9c\");\n        a(\"vOHF3mPdClYz4B3TrhHs/hmKkL7sd8HWzmujBgunnjbTBIR7zt5taMjng4huoK34BIV3nbJmtGR3wIOnSFT9rCmtcJT0RVV/kN\");\n        a(\"TNJ1Xm5LZ6Mu8c7o1jFvsZXr1BEfgvm6whdjwAxrkm8Y6jp1laeiWee8/NbutS5xO9p1wuMwWme8/jbmUJd5D0zSMS+2revRIW\");\n        a(\"+OeTriFZqtQ13iFMu84P5yN0o6514M0QU/tJ0zQtd4JkbqOn+DUbrBu2/venTMJ2C8TnguJuqC+9GtA8+MWBEzdYm3wRwdcWdk\");\n        a(\"7+uMH8SAmT4v92KQLvjhnVyzrvFsDNN1/gatusHVnd1jzcFUXKJzHjzM59Al3gaTdcR3okvXeCbe1nX+BfN0sIvzZFfzpiO+GC\");\n        a(\"u/6Dp52xavHTriQ9CmK/w0Ruqcm3a3H3XMLyPTdV5zD/tRl/lfVHWwp33R6t7pKk/DTJ3zBXuZK53yI5ina/wdPtcNXn5vP9Yl\");\n        a(\"Phz9OuXJCF7y/rzGPuZTl/l8DNYpz4iNRdf5P5R1sO8CwQEYqiv8GYbpBpf3s981B+9jhC74xv2NXVf5PSS64KWGW6s65Ntwia\");\n        a(\"7y9AOsGV3n9Q90xuoyX4+Zusr/oK6Dg1wL5umIj8LnOuFx+E5n3DHC2HXKt6D0srHzKgd7vdAl/h5NusHdh9j7Oud1DnUfdZlH\");\n        a(\"YpROeBxG64z3bTMWXeHFD7PvdMhHYpZO+CG8rWv8AQpd8LKHO2N1iS9Gv874YczXNV7vCOt/lmvgvbCWjvkrDNENXrxizeuQN8\");\n        a(\"JwXebRaNMpT0KnrvHCR5pnHfKe6NIxP4puXfCmR1ljOuKj0aMT3vBo169j7sKgV8wV92KwLvi5keZZ59yLWBf8F0bo4BjPZvKc\");\n        a(\"gorOeC7G64LHHGf965QfRU3XuAfdOmj3e0vM1DGfhLpO+Cr06IzfRqELXut486zL3ImGzvghzNc1fhUDZlt73IdBusHTTnDO6I\");\n        a(\"L/RkmXT/RvHLCezrkXQ3XB8SivIzrm7U/yY13hLU82Xh3xkejQCY9DqjPe+xTng465OXHPdMRHY4pO+EnkOudVT3WPdIkPR4+u\");\n        a(\"8Gf4XDd45dP8vkJHPA0DXvVrec3TvY7rMqdYWaf8HIbonFccbVy6xHuiRcd8LmKd8cJnuKc65I3Qrst8wJn2u67weZioU97Qsw\");\n        a(\"Lu0WXeC3N0zIt0uGc65IsxYI6Pz8+cbf51zr1o0gUn55gjnfAEjNJV/gGjdYMXP9e60iG/iYm64EFj7E0d8kuo6zpPOM9c6SpP\");\n        a(\"xYDXfF7uxSBd8OoXuB5d5j3QomOejVjX+c3U9emC/0GHDi505iDVJd4OY3XET13stUDX+c9L3EcdXOpcRaE5OAR9usJXoqEzzv\");\n        a(\"GHznn2Zc72130c3utya1XHfC6G6JRvR5Ou8pNo1jn3YpgueJ8rnCc65mMwVifchUznPBcTdcF/4x4djDNGTNYlbkaXjniJK+1f\");\n        a(\"HfK2mKUjHo66rvCp6NEpX4tCV3kq+nTOl3Yau874L5Te8Hmv8iwVDNEV7sVQXfA6VxuXLvOZiHXKd6NN1/iYa5zvOuFxGKszfu\");\n        a(\"9a49UFb3+dseiI17revOsy74F5Ov6fYrsMlSKKAyg+dhfYhYKFCDY2dtfY3S12K7aiomJ3C3aLLWI3drfPbjGx4zcfDucg+9y7\");\n        a(\"996dh8KfV+Kp3sZnkfCSs+Ccc3zXdAGuMNf+65DXo6HexqfRVl/il+iqP3DKee6SjlwYQ3Q53o3R+jA/wQz9gTfOd4/1Nj6L4/\");\n        a(\"oSf8Y5HZhXX7zQd02v4BNIeNlrOMki76dT8jmk15c49mJ7q1Py3mXWrw9zDAboyMFyz24deSDG69H8FzN0sMLzBKt0Nt6ATXob\");\n        a(\"n8U1fYlbrLSfui3/QNwrftZsdyGk1OW4A9LrPnxprTugIw9f5+z0aF6GOXoFz17vrkbNCTa4hzolD8dpPZpf4pr+wG02+my6Lf\");\n        a(\"/AWx1sspcIrnovLrjZenQ5bozMui33Rw49mnchnz7Mh7bZt6j5LzrqYLu/Y5dnl2az1H7f6ch7cEAf5soHvLcOuTuCa17Dh5FQ\");\n        a(\"R/6KlDowJ93tsP3RfXgJ+ugV/PKI+6M/cOajzkJn4/zHnIUuwC1xTbflccedhZ7B25DwuvPifye8lw5O+n8S5NGX+Mcp33kdnP\");\n        a(\"bsQiUduTVq6bY8Aw115DNoqS/xnTP2RMdw9bPujw65M2boPrwgQq/g/VihD/NSs8rr9ArejXv6MF/FUx3DH/FWB+f8ux5fdMhj\");\n        a(\"ENywHj6PhPoSxznvOa9Tcl1k1iGPRx49gzeggN7GRy945uhLPP2i77KewUUuOV9djqdhiJ7BGzBeb+MGZpGn6rb8HAf0B65yxf\");\n        a(\"3UIa/BNb2NzyJGX+In15yr/sAZrjuXm86UVyG93sZ3kEfHcJUb1qxDbn7Teem2vA8t9WGOQVcdOc4t90en5LMYoi9xrtvOQhfg\");\n        a(\"GlilQ/6HTTq44/uOazobX8U9HcPBXd/rW17DOZFUF+AaSK9Dvo9sOoajed9yOnJGVNPZuDtC3YcnY4CewTcxXMdwx/vuie7D17\");\n        a(\"BNx3C9B55lui33wnHdhxfhnF7B0YzuNR35JOLe9tk5eYx91il55CNr1qO56GNr0+W4KxrqPjwDLXXkHeioD3MMeujIwRPr15Gz\");\n        a(\"YbiOXA7jdeTmmKrbcoKnnm86JVfEXh3yNBzWM7jWM/dHh3zlt2eljuHgjzXficPeK0JHLoc8OoY/ooAO/rrDKK7L8V2U0zH8Ew\");\n        a(\"118M/nRksdcneM1n34JCbpSzwyMJejR/MyHNcr+A/OaQO1QTbc0pGvIEbHcIrYZpl0Si6LD7oc/8J3Hc3SZkRw189y6rjmHaLm\");\n        a(\"TSitt/F9hDqGf6KpjgZbq8Y3d6FDnoNJegX/NB87Qwep/TmO6xVcOo0163K8Ftf0Nv6MezpIGzuojqc65G94q4N01okvOhuvM8\");\n        a(\"/6W2/jm8h2z9r4D/LowNzr3oLmL/Rh3lgotvvu9fwG4/UHzl84djBVF+CxmKNn8Cqs0Nv4EdbpD1y5iLPQIffHAT2aX+G4/sBZ\");\n        a(\"i5oh0dm4JG7pcrwBMXobn0fc+86Xc5tVTaoLcHnk0yH3RBHdhz8Ws3c6mlfNgrY6Gw9GVz2al2KSXsHfMEMHJbwe23Q2jsFeHT\");\n        a(\"lzSXuus3ElPNVt+SXe6g+8pZR7orfxZcR94Gd5UWlr1it4P4row1ywjHXqctwcHXVbjmXWs4dOyXmxRBfg5VilV/B+nNOHuV1Z\");\n        a(\"d0OP5kWI+9Br+DuSapc4OIoC+hLPKu9+6hU8q4KzjpqvYYaO4Z9YoIOK7j9WRF0pdjAI1/QK3lbZPujInavYB92H5yJpjLXxoK\");\n        a(\"q+J3o0r0YRfYkzVfPZdQHuikp6Bt9CqD9wYjOVLXVK7oqOug/nreHsdAFuhHW6LQ/DNj2ac9d0droAt8U9PYOv4amO4fy1rFkX\");\n        a(\"4Mn4olfwfvzWhzl9bfv5yLlzZeTRIfdFAT2aU5l9LK6zcXn00CHHN+s4QKfkhlil2/IubNKH+aQ5yJ36EverZ316NM+qb516Bf\");\n        a(\"dr4Cz1aO7c0DPnsX3grI2sT2fjno2tTffhJSiuV/BBlNOH+Tmq6Q+8oYl91tv4LProS7zbrOIQfZhHNrO3ejQvwmm9gic3953V\");\n        a(\"M3gDgif+Hq7Wwtp0yL1RRPfhv62ctQ5bW39b76v78CS01TN4A7rqbdylnfXoPjwbC/QKXtEeOnLRDvZKl+NhuKdH81o81dv4Hd\");\n        a(\"7qD1y7oz3UIa9C8NRr+AES6hhO3sl8jk7JDZFet+W+yKZH8x7k0Yf5KoroGP6J0jow97cVlfQ2fowh+gMn7mK2U6fkZZikV/B+\");\n        a(\"7NSHuU5Xz0kdcne81H24RTe/j3RbHoH0z6yHm/e0Nt2WR6GhHs3xevnu6JR8CR115NfooT/w/t7upz7Ml7FEx/DRPvZIX+Lsfd\");\n        a(\"1VXYAbYKduyzX6WacOOVl/69QpeSISPnem/B4p9QeuM8CadcgbkU1v4+QD7adOyZVRQIc8CcX1DD6Ecvowf0I1HQwya4tQZ+MS\");\n        a(\"aKrL8Xa01X0Ge5YOca90Si6MAXobJxoaOxiuU/IrjNcfuNgIv+N0Ob6KdTqG44z0PNEpeYo5vcN6Bi/BW72C3+OL/sATxnqG6B\");\n        a(\"k8c5zn4Qvvyz3+s1v3vAxFcQDG6+UDGMQgTdyhG0OFUaJJV0MtImLoILFWYjJVgkjjpQiplrjES5n6EYiRoYsQi8tUYiAxivj1\");\n        a(\"e/QmT55naXL/555z0iWz6xz3Lts/OuAXjOiIkyvtsTHd9DgmdZbnkdV5XiyYSxf5ZM29rWt8g6qu8ytq+ou/172/jm3Yq7hv9q\");\n        a(\"a7GZEOeBoNneU5/Og87xXNokP+2/JNG3677d5DQgecxoDOcHzXXDrgNGZ0httK5tddPISSTvHjvnOtI+4oezfdxZWKM65DvkXs\");\n        a(\"3Vw8e2iP6RzvYFiH3H9kDXWS746tj67z6Klzp1O8cOZ/i85z4dze1kV+xrWOuOfCO+iAJ/Ck6xyrult006v41EU+wK8O+Q2dH9\");\n        a(\"ac+y59dx3wILp1iqcQ11l+QEJHXL6yt3XraT3/7MitSwMBAMbhQw6DGBYWRNRkGgYxiJhMi7JgEDEaLl0WkWEyH5dFjg38OD8Q\");\n        a(\"kywtikFMC8ZhWhCjXPLgHlzZn7C3PC+/6cxaWfj/aw9hEHXD4Lczbstlq12FwUJ33BplWy/bpJ3pCTt8Yp8fHPKHM9eVdTa4wz\");\n        a(\"1GbDPlJXO+8I2fHLHg/E3lIte4zRYPGfOE50x5wZw9vnLAIUcsOHdbucQNNnnAmKdMmPGRPQ74zdm8coVb3OURY7aZ8p59vvOL\");\n        a(\"Bet3lavcZJP7jHjMhBmf/wSlj0DpG1D6FZT+A6U51kDjE0rrgGkEcILyw6B0Gpp8DZTfBaXnQOl1UHoPlD4Hpe9A6XdQmmkty2\");\n        a(\"i+GM0Xo/kCR75AAPfUkuCSFI/EvJScVCjfOT+vGEA31e62DcPAvJrnuliAeDFqY/6t2NdUgywZFFXUe/pJFoUlQfpLvCPFj6Pk\");\n        a(\"DFo378xgfCR/KxOQ/SfluSFylLz9A35T2qP5mrCydjYxzZfmjtwE70s9RRzWo313Vam4LLGDk7YoTCCCLfeO8x07fBDUHMlnsa\");\n        a(\"mH6BXUYnG05bg4UDB41Qa/1BIL3bK7AJkbSfMeJZnEPNTGeYnLcydH57RlFCUaO5/fE12U3TxjSYNGfHIqTnghRdso/tRkNc+U\");\n        a(\"2z68EiARCTlaFLfRp67Yb9QElVsb7zZ1DrwGrjvJem7aYhdRfkKtiUlnZYybxE4VZcc7LbbQ0erL5kv1rH3Zq6B9ukkZySFIsv\");\n        a(\"QGWNMZ/Ao7y5WkrQ/LTb4BtGh7W2JUmqMKvbbXOOTlDybOOueIjrQjzbLde+7xvUiN8wr7Hx39Cy7hegV1BA/LZUo0nxFVh9wl\");\n        a(\"eIdlx8U+Ws1aGf0XNUUrDtxjkkf/AgN+wjeWQY900gvqE0/4gbZvrrTBsP6xMQY36hn1h6LIFnNwxS9/tqq7+9+d8Rv/I6OMeh\");\n        a(\"UGYSjsX8PtmtyEp+udeybamUUF0o3M/XuPtCTiHs9HCxR6em9cnBMT8EzPWZgN4ZbiIfl8Gm7Aq0afRljX3Tu/jP4iTMXPM9eX\");\n        a(\"HnixkPhM/2ukyexqmq23pdb5a3JXXTlgu7Jiao3RYtRLheR/wS+EoRDtwFvRxVuqizt7bBuWqR0Zrxp4NcpPxBPKlpMwmqJjOs\");\n        a(\"6MLiwRub1JBphW0gD4i2OFdV6/yVMC077VZwdLDMixJhLTTcQtDQ6/a5vfNte+inflKEs+s+xhQaL/aBOls2UfpFL0TRcj8T4N\");\n        a(\"Q79TYsNSEY1BwleGqTIqJevVTHzJNxXojuRiBiRXgEqJ7NSivNQcYyO9lJwcBmAqTSwtgXJKgR6HMocp0NjAAj7bhwmKTYB8Gy\");\n        a(\"B2AeJgf58w1yCw78FnwASIActvoHgYSA80XPNzylKLQNmLAcwMKK2qykk1NGUYBQBm7I7vcSAKw/iDweJgMVgMFgMLxWBhIVgM\");\n        a(\"LBSDhYXgmZfMnJnMSzCwUFgYLAYWisHCAwMLO9vffog9X+H6H7n/45vzrpkD7oDAHkqooIYTNHCBKwyAMMMCd4jwgBWesMEn/A\");\n        a(\"ZCj/QLbehXeqHfaE+/U6CWLvQnfdBfdKOf9MDPvFJHVauTatRZXVWvZrWou4rqoVb1VJt6qaQ+sMAdEtxjiQc8YYNnbPGCHV6x\");\n        a(\"xxsOCDjjD4z4woQfutA7TXStT7rRZ93qi+70Vff6pgcNGvWsF33XUT/0qp960y+d9IcpzM4QszelOZjKHE1tTqYxZ9Oai+nM1f\");\n        a(\"TmZgYDBs3dHKZ26qZ+GiaclilO67RNaSossaWtbG0b29rO9nawaBcb7Wo3m2zhiCtd5WrXuNZ1rneDQ7e46Fa3ueQKT3zpK1/7\");\n        a(\"xre+870fPPrFR7/6zSdfBBLKUIU6NKENXejDEDAsIYY1bCGF3Omed9f8lAWQf5UaaKGD/l1pgQhrrpOgoISWtKJ17tPSLtcZKO\");\n        a(\"Y2ka65TKIFI6xkFatZw1rWsZ4NDNnCIlvZxhIrOOElr3jNG97yjvd84MgXHvnKN554IYgoRSVq0YhWdKIXg0CxiChWsYkkipGM\");\n        a(\"h7EajyOO83gf47iOz/E1prGQO7mXpazkUZ5kI1t5kVfZy0GCnOUio3zIp9xkkh9qp4gq1eGvoLefi+qyoJsChW9F2dBbUPbz1n\");\n        a(\"PACuvsJ+t52/lDmd3yyAmGURgmqaEOuRKJRK5EIpErkUjkJDUkNUjkypev7bvDpxyJRCJHIpHIyp59OJmk2512+w/Iw3XumcxQ\");\n        a(\"yCd8iAy6EBWHCYoYzxeYWM7X83rezz/PRmM1D43duM1j4zVB89SETQwvSZNBjGpGmJmaBWrWZocbo7Ugx25d2PHaAHrCNoafpM\");\n        a(\"0gSLUjDE3tAkVru8OR0VmQZHcuLHldAE1hF8NT0mUQpboRpqZugaq12+HK6C3IsnsXtrw+gK6wj+Er6TMIU/3S770FW/bgQpc3\");\n        a(\"BPAVDjGEJUMGY2oYoWwaFjhbh/1N2oLf/d+Cro4iuLDmSRFCFcNbojKIU0cXWIUd7ozcgjw7d2HPywPoC/MY/pI8g0CVjzA45Q\");\n        a(\"sUrvkOh0ZhQaJduLDoFQE0hkUMj0mRQaQqRpicigUq12KHS6O0INMuXdj0ygA6wzKGz6TMIFSVI4xO5QKla7nDqVFZkGpXLqx6\");\n        a(\"VQCtYRXDa1JlEKuqEWanaoHatdrh1qgtyLVpN6if6rCO61Od1Fn9XCtYvkDzctNsvNhw7MMwbrXifw3czFSs6HE1KWmJK624js\");\n        a(\"PL+LxNxOukucJlNtzDLJzbJSLeIuU1dDHKJTZewi6TSuH5Vzz519rBs36rv8tzRthK9pfSPkplT+iqRlkvekJbF33Vq97YWPv1\");\n        a(\"8dXDdu6vxpSW+u/rybXM5wVbMbEUV/YRcSEpN6JlJVfZxwNW4XMXEZeRchuTrMLoHK7B5x4iLiLtNLYwo6/HBhyuwOcOIiwhQ2\");\n        a(\"XHfkFhjcEcjiU43IIvazjJDi7Qvx3+d/wfj84a6v3bjGA/VZrmN6o36R7vF282EetTvtG4SeUOnftFJG9VU/ZG2yZ1O/TtU3hE\");\n        a(\"4ymUa/ie0eDDtUPZPm1H1J3Ct4aMudrg+jDtULVP1xFlp7StoXuG600a7UqhfWl0KJU+SaczKbWWVk8v15cdpX74YbPSgXQ6kl\");\n        a(\"In0upnqfU/P/Uh0tP+H5/91Ck2N3FpfUKmITX30PHonk7WfEPL34w6KLkvSlPWe2a/NxbcRMNdURq3qcjU7PbMcm9st8l6i1V+\");\n        a(\"D1CdhtHl1muzv6OV3U6PcovbSz/1m8iF2Vu9I/Y7ZcE1Gz6z4nRs4L/eLx859lnziD1PWfTbd70PhD9KtU55Bt2aLZ9Z87vW77\");\n        a(\"WMbZ//dwMs/VyuWIF5zz/7rln4mY2XNcgSsIHf9bPtM+u+se+/2juz0JnCMIwfBh1ZGkVOpCypIcufLCdLja1EMrZMoZALW7IU\");\n        a(\"QvYsyXYhU8I5M2dmzpnvnBmKsu9ZUxPRlCXhYkppkCX7872+rN98thsX5mbu3+f3PO/zfk0N94LBGws5Ik4+SIB83lNK1FQq1F\");\n        a(\"V0aiutqa+YEi+4nH+Qryae2u73qQzued81/6DrRqnLrPyRe9FjdNFkIqLLDGUxRVqTK+AG3mZMSVb/xBGKDN9H7qgEv+OJi0j0\");\n        a(\"Uv4evFGRJPtkcof1vR/C/Leof+eHMFI+Tns7oeA/StSvVHJuEtuLQbMrmstF0V3Kor3oToToBtcKoj917biC5jDxG5NluCBZI3\");\n        a(\"qjyux+RfSaKl4/sxpV0QpKOaE1RKc8o0tEqKFg8hRbV9iC3DtZuAB9nxfe8fuodUg7AH0Nq7PVE4pOs2ZDyx3WbusQ6Vex6tmN\");\n        a(\"oV8/ezA0nG8vQZZ59n6oeMt+AP3qJ5vwu4jU24iU2p88DN1qIZE6pLohi5YhfdKpADrdTj2EQhGkzgxnHvJmp7MXulx1bkCP9l\");\n        a(\"BjRHoc9utG6HA//RQbtUWmLfJjRGYcEmR9ZiumfwfJUTfbCIkxJDsCc1+RXY95H86exo58mf2QNdyebn+kwyJ3BWZ80D2OJHjq\");\n        a(\"vnF1r43XAfOd6E3DdDd7OzDVx9573DBdcr1wvSzILcUkg9xBeP1R7hk6WEfWHVPciJmdZpew016w9+hcXf3e1LngWe5WhU9X0t\");\n        a(\"VxKihX3V7TyZ+uwpEx2ljbZDuqJqRN/KprmeTExYpd1Jo69GS0ZlwV0l2k0wYaqtg5lSR3YI1stwg3lsiDhmK7nCIHaopm5ZIH\");\n        a(\"y2mxQyStahv5sKjYIYvJiYcUvWm66ErfNnh6JUFbing1XpycmPirTREhL06XbATRk7AXIuhIMcVOeOVzwsyvs1/ctK64asvEV0\");\n        a(\"SR/UXiKyzau6wNHSK+6L0kGtIWg63qOW9xwsCWaPCSC20DEXZR0W/mEmH7FD0mToQlZAkvLtShxNcGSbrzq1THXVpDfM1VtBVD\");\n        a(\"dJRqGX/vF1K+THxFFL2kSISFKePlb3CniDBN8dK2T9yH1buHxekCV7p4O+Fkmd/ciduIraKyYcgpK1GOGX/cMUxxM1Zv3VospA\");\n        a(\"3+hZ6RoIQrfbkgFS8EkqwDkZxG84/6dYxyb1uV3qG+L/eB0Fd0V5pgUn5LEp/fNmjKPrz5EaGuokHHspjd5JBm4WtKbiaosXIe\");\n        a(\"culJrhZrwtqwbmwAG8WmsHlsFduOLDrCzrMSJdAg0DHLX4D82eWnkDxX/OvooW/9OqCjZ9AfVMwJFoIGJ/DROW8HD5E3zfKtsM\");\n        a(\"eG58eAg2X5tdD/YP44dH+af42c6VToAb1nFOYhXfYUMlD7ZuEuV3luSDvH/6vFag5th1mjoelSaw009a0DVpG2lW63tNtBz5H2\");\n        a(\"eOgIDaHfGfsydtQL+71tJLskeyE/piZnQjmoBsUuJ69BqzqphlBoYGoYttPy1DrspKOps1Ao7LSFGmOcCdBhvbMVbfCkcwE58d\");\n        a(\"L5gBbYPd0HaixIL4UKJ9LnkQu4YDD77pm+mPvUzCz0v9HeBLh1tbcJPuU/SAppY/GFDUBOnay4lHVW22/gG+TDmL8e6X6MXr6b\");\n        a(\"wnWjgknCaZz5kNYUX9iQlGM8tbT/n3/68xHeVZKEADYEAA==\");\n    }\n}",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_15.txt",
        "content": "Hi! My name is Pascal Slover.\n\nAnd I try solve puzzle15 with board:\n15 14 1 6\n9 11 4 12\n0 10 7 3\n13 8 5 2\n\nReady! Solution path is\u00a0: rrruldluuldrurdddluulurrrdlddruldluurddlulurruldrrdd\nMoves 52 and Time: 00:00:00.7509766\n\nBye bye\u00a0:)\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_16.txt",
        "content": "// Solve Random 15 Puzzles\u00a0: Nigel Galloway - October 18th., 2017\nclass fifteenSolver{\n  const int Nr[16]{3,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3}, Nc[16]{3,0,1,2,3,0,1,2,3,0,1,2,3,0,1,2};\n  int n{},_n{}, N0[100]{},N3[100]{},N4[100]{};\n  unsigned long N2[100]{};\n  const bool fY(){\n    if (N4[n]<_n) return fN();\n    if (N2[n]==0x123456789abcdef0) {std::cout<<\"Solution found in \"<<n<<\" moves\u00a0:\"; for (int g{1};g<=n;++g) std::cout<<(char)N3[g]; std::cout<<std::endl; return true;};\n    if (N4[n]==_n) return fN(); else return false;\n  }\n  const bool                     fN(){\n    if (N3[n]!='u' && N0[n]/4<3){fI(); ++n; if (fY()) return true; --n;}\n    if (N3[n]!='d' && N0[n]/4>0){fG(); ++n; if (fY()) return true; --n;}\n    if (N3[n]!='l' && N0[n]%4<3){fE(); ++n; if (fY()) return true; --n;}\n    if (N3[n]!='r' && N0[n]%4>0){fL(); ++n; if (fY()) return true; --n;}\n    return false;\n  }\n  void fI(){\n    const int           g = (11-N0[n])*4;\n    const unsigned long a = N2[n]&((unsigned long)15<<g);\n    N0[n+1]=N0[n]+4; N2[n+1]=N2[n]-a+(a<<16); N3[n+1]='d'; N4[n+1]=N4[n]+(Nr[a>>g]<=N0[n]/4?0:1);\n  } \n  void fG(){\n    const int           g = (19-N0[n])*4;\n    const unsigned long a = N2[n]&((unsigned long)15<<g);\n    N0[n+1]=N0[n]-4; N2[n+1]=N2[n]-a+(a>>16); N3[n+1]='u'; N4[n+1]=N4[n]+(Nr[a>>g]>=N0[n]/4?0:1);\n  } \n  void fE(){\n    const int           g = (14-N0[n])*4;\n    const unsigned long a = N2[n]&((unsigned long)15<<g);\n    N0[n+1]=N0[n]+1; N2[n+1]=N2[n]-a+(a<<4); N3[n+1]='r'; N4[n+1]=N4[n]+(Nc[a>>g]<=N0[n]%4?0:1);\n  } \n  void fL(){\n    const int           g = (16-N0[n])*4;\n    const unsigned long a = N2[n]&((unsigned long)15<<g);\n    N0[n+1]=N0[n]-1; N2[n+1]=N2[n]-a+(a>>4); N3[n+1]='l'; N4[n+1]=N4[n]+(Nc[a>>g]>=N0[n]%4?0:1);\n  }\npublic:\n  fifteenSolver(int n, unsigned long g){N0[0]=n; N2[0]=g;}\n  void Solve(){for(;not fY();++_n);}\n};\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_17.txt",
        "content": "int main (){\n  fifteenSolver start(8,0xfe169b4c0a73d852);\n  start.Solve();\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_18.txt",
        "content": "Solution found in 52 moves: rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n\nreal    0m0.517s\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_19.txt",
        "content": "int main (){\n  fifteenSolver start(0,0x0c9dfbae37254861);\n  start.Solve();\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_2.txt",
        "content": " 1  2  3  4\n 5  6  7  8\n 9 10 11 12\n13 14 15  0\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_20.txt",
        "content": "Solution found in 80 moves :dddrurdruuulllddrulddrrruuullddruulldddrrurulldrruulldlddrurullddrrruullulddrdrr\n\nreal    249m18.464s\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_21.txt",
        "content": ";;; Using a priority queue for the A* search\n(eval-when (:load-toplevel :compile-toplevel :execute)\n  (ql:quickload \"pileup\"))\n\n;; * The package definition\n(defpackage :15-solver\n  (:use :common-lisp :pileup)\n  (:export \"15-puzzle-solver\" \"*initial-state*\" \"*goal-state*\"))\n(in-package :15-solver)\n\n;; * Data types\n(defstruct (posn (:constructor posn))\n  \"A posn is a pair struct containing two integer for the row/col indices.\"\n  (row 0 :type fixnum)\n  (col 0 :type fixnum))\n\n(defstruct (state (:constructor state))\n  \"A state contains a vector and a posn describing the position of the empty slot.\"\n  (matrix '#(1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 0) :type simple-vector)\n  (empty-slot (posn :row 3 :col 3) :type posn))\n \n(defparameter directions '(up down left right)\n  \"The possible directions shifting the empty slot.\")\n \n(defstruct (node (:constructor node))\n  \"A node contains a state, a reference to the previous node, a g value (actual\ncosts until this node, and a f value (g value + heuristics).\"\n  (state (state) :type state)\n  (prev nil)\n  (cost 0 :type fixnum)\n  (f-value 0 :type fixnum))\n\n;; * Some constants\n(defparameter *side-size* 4 \"The size of the puzzle.\")\n\n(defvar *initial-state*\n  (state :matrix #(15  14  1  6\n                    9  11  4 12\n                    0  10  7  3\n                   13   8  5  2)\n         :empty-slot (posn :row 2 :col 0)))\n\n(defvar *initial-state-2*\n  (state :matrix #( 0 12  9 13\n                   15 11 10 14\n                    3  7  2  5\n                    4  8  6  1)\n         :empty-slot (posn :row 0 :col 0)))\n\n(defvar *goal-state*\n  (state :matrix #( 1  2  3  4\n                    5  6  7  8\n                    9 10 11 12\n                   13 14 15  0)\n          :empty-slot (posn :row 3 :col 3)))\n\n;; * The functions\n\n;; ** Accessing the elements of the puzzle\n(defun matrix-ref (matrix row col)\n  \"Matrices are simple vectors, abstracted by following functions.\"\n  (svref matrix (+ (* row *side-size*) col)))\n\n(defun (setf matrix-ref) (val matrix row col)\n  (setf (svref matrix (+ (* row *side-size*) col)) val))\n\n;; ** The final predicate\n(defun target-state-p (state goal-state)\n  \"Returns T if STATE is the goal state.\"\n  (equalp state goal-state))\n\n(defun valid-movement-p (direction empty-slot)\n  \"Returns T if direction is allowed for the current empty slot position.\"\n  (case direction\n    (up (< (posn-row empty-slot) (1- *side-size*)))\n    (down (> (posn-row empty-slot) 0))\n    (left (< (posn-col empty-slot) (1- *side-size*)))\n    (right (> (posn-col empty-slot) 0))))\n\n;; ** Pretty print the state\n(defun print-state (state)\n  \"Helper function to pretty-print a state.\"\n  (format t \" ====================~%\")\n  (loop\n     with matrix = (state-matrix state)\n     for i from 0 below *side-size*\n     do\n       (loop\n          for j from 0 below *side-size*\n          do (format t \"| ~2,D \" (matrix-ref matrix i j)))\n       (format t \" |~%\"))\n  (format t \" ====================~%\"))\n\n;; ** Move the empty slot\n(defun move (state direction)\n  \"Returns a new state after moving STATE's empty-slot in DIRECTION assuming a\n  valid direction.\"\n  (let* ((matrix (copy-seq (state-matrix state)))\n         (empty-slot (state-empty-slot state))\n         (r (posn-row empty-slot))\n         (c (posn-col empty-slot))\n         (new-empty-slot\n          (ccase direction\n            (up (setf (matrix-ref matrix r c) (matrix-ref matrix (1+ r) c)\n                      (matrix-ref matrix (1+ r) c) 0)\n                (posn :row (1+ r) :col c))\n            (down (setf (matrix-ref matrix r c) (matrix-ref matrix (1- r) c)\n                        (matrix-ref matrix (1- r) c) 0)\n                  (posn :row (1- r) :col c))\n            (left (setf (matrix-ref matrix r c) (matrix-ref matrix r (1+ c))\n                        (matrix-ref matrix r (1+ c)) 0)\n                  (posn :row r :col (1+ c)))\n            (right (setf (matrix-ref matrix r c) (matrix-ref matrix r (1- c))\n                         (matrix-ref matrix r (1- c)) 0)\n                   (posn :row r :col (1- c))))))\n    (state :matrix matrix :empty-slot new-empty-slot)))\n\n;; ** The heuristics\n(defun l1-distance (posn0 posn1)\n  \"Returns the L1 distance between two positions.\"\n  (+ (abs (- (posn-row posn0) (posn-row posn1)))\n     (abs (- (posn-col posn0) (posn-col posn1)))))\n\n(defun element-cost (val current-posn)\n  \"Returns the L1 distance between the current position and the goal-position\nfor VAL.\"\n  (if (zerop val)\n      (l1-distance current-posn (posn :row 3 :col 3))\n      (multiple-value-bind (target-row target-col)\n          (floor (1- val) *side-size*)\n        (l1-distance current-posn (posn :row target-row :col target-col)))))\n\n(defun distance-to-goal (state)\n  \"Returns the L1 distance from STATE to the goal state.\"\n  (loop\n     with matrix = (state-matrix state)\n     with sum = 0\n     for i below *side-size*\n     do (loop\n           for j below *side-size*\n           for val = (matrix-ref matrix i j)\n           for cost = (element-cost val (posn :row i :col j))\n           unless (zerop val)\n           do (incf sum cost))\n     finally (return sum)))\n\n(defun out-of-order-values (list)\n  \"Returns the number of values out of order.\"\n  (flet ((count-values (list)\n           (loop\n              with a = (first list)\n              with rest = (rest list)\n              for b in rest\n              when (> b a)\n              count b)))\n    (loop\n       for candidates = list then (rest candidates)\n       while candidates\n       summing (count-values candidates) into result\n       finally (return (* 2 result)))))\n\n(defun row-conflicts (row state0 state1)\n  \"Returns the number of conflicts in the given row, i.e. value in the right row\n  but in the wrong order. For each conflicted pair add 2 to the value, but a\n  maximum of 6 to avoid over-estimation.\"\n  (let* ((goal-row (loop\n                      with matrix1 = (state-matrix state1)\n                      for j below *side-size*\n                      collect (matrix-ref matrix1 row j)))\n         (in-goal-row (loop\n                         with matrix0 = (state-matrix state0)\n                         for j below *side-size*\n                         for val = (matrix-ref matrix0 row j)\n                         when (member val goal-row)\n                         collect val)))\n    (min 6 (out-of-order-values\n            ;; 0 does not lead to a linear conflict\n            (remove 0 (nreverse in-goal-row))))))\n\n(defun col-conflicts (col state0 state1)\n  \"Returns the number of conflicts in the given column, i.e. value in the right\n  row but in the wrong order. For each conflicted pair add 2 to the value, but a\n  maximum of 6 to avoid over-estimation.\"\n  (let* ((goal-col (loop\n                      with matrix1 = (state-matrix state1)\n                      for i below *side-size*\n                      collect (matrix-ref matrix1 i col)))\n         (in-goal-col (loop\n                         with matrix0 = (state-matrix state0)\n                         for i below *side-size*\n                         for val = (matrix-ref matrix0 i col)\n                         when (member val goal-col)\n                         collect val)))\n    (min 6 (out-of-order-values\n            ;; 0 does not lead to a linear conflict\n            (remove 0 (nreverse in-goal-col))))))\n\n(defun linear-conflicts (state0 state1)\n  \"Returns the linear conflicts for state1 with respect to state0.\"\n  (loop\n     for i below *side-size*\n     for row-conflicts = (row-conflicts i state0 state1)\n     for col-conflicts = (col-conflicts i state0 state1)\n     summing row-conflicts into all-row-conflicts\n     summing col-conflicts into all-col-conflicts\n     finally (return (+ all-row-conflicts all-col-conflicts))))\n\n(defun state-heuristics (state)\n  \"Using the L1 distance and the number of linear conflicts as heuristics.\"\n  (+ (distance-to-goal state)\n     (linear-conflicts state *goal-state*)))\n\n;; ** Generate the next possible states. \n(defun next-state-dir-pairs (current-node)\n  \"Returns a list of pairs containing the next states and the direction for the\n  movement of the empty slot.\"\n  (let* ((state (node-state current-node))\n         (empty-slot (state-empty-slot state))\n         (valid-movements (remove-if-not (lambda (dir) (valid-movement-p dir empty-slot))\n                                         directions)))\n    (map 'list (lambda (dir) (cons (move state dir) dir)) valid-movements)))\n\n;; ** Searching the shortest paths and reconstructing the movements\n(defun reconstruct-movements (leaf-node)\n  \"Traverse all nodes until the initial state and return a list of symbols\ndescribing the path.\"\n  (labels ((posn-diff (p0 p1)\n             ;; Compute a pair describing the last move\n             (posn :row (- (posn-row p1) (posn-row p0))\n                        :col (- (posn-col p1) (posn-col p0))))\n           (find-movement (prev-state state)\n             ;; Describe the last movement of the empty slot with R, L, U or D.\n             (let* ((prev-empty-slot (state-empty-slot prev-state))\n                    (this-empty-slot (state-empty-slot state))\n                    (delta (posn-diff prev-empty-slot this-empty-slot)))\n               (cond ((equalp delta (posn :row  1 :col  0)) 'u)\n                     ((equalp delta (posn :row -1 :col  0)) 'd)\n                     ((equalp delta (posn :row  0 :col  1)) 'l)\n                     ((equalp delta (posn :row  0 :col -1)) 'r))))\n           (iter (node path)\n             (if (or (not node) (not (node-prev node)))\n                 path\n                 (iter (node-prev node)\n                       (cons (find-movement (node-state node)\n                                            (node-state (node-prev node)))\n                             path)))))\n    (iter leaf-node '())))\n\n(defun A* (initial-state\n           &key (goal-state *goal-state*) (heuristics #'state-heuristics)\n             (information 0))\n  \"An A* search for the shortest path to *GOAL-STATE*\"\n  (let ((visited (make-hash-table :test #'equalp))) ; All states visited so far\n    ;; Some internal helper functions\n    (flet ((pick-next-node (queue)\n             ;; Get the next node from the queue\n             (heap-pop queue))\n           (expand-node (node queue)\n             ;; Expand the next possible nodes from node and add them to the\n             ;; queue if not already visited.\n             (loop\n                with costs = (node-cost node)\n                with successors = (next-state-dir-pairs node)\n                for (state . dir) in successors\n                for succ-cost = (1+ costs)\n                for f-value = (+ succ-cost (funcall heuristics state))\n                ;; Check if this state was already looked at\n                unless (gethash state visited)\n                do\n                ;; Insert the next node into the queue\n                  (heap-insert\n                   (node :state state :prev node :cost succ-cost\n                              :f-value f-value)\n                   queue))))\n      \n      ;; The actual A* search\n      (loop\n         ;; The priority queue\n         with queue = (make-heap #'<= :name \"queue\" :size 1000 :key #'node-f-value)\n         with initial-state-cost = (funcall heuristics initial-state)\n         initially (heap-insert (node :state initial-state :prev nil :cost 0\n                                           :f-value initial-state-cost)\n                                queue)\n         for counter from 1\n         for current-node = (pick-next-node queue)\n         for current-state = (node-state current-node)\n         ;; Output some information each counter or nothing if information\n         ;; equals 0.\n         when (and (not (zerop information)) \n                   (zerop (mod counter information))) \n         do (format t \"~Dth State, heap size: ~D, current costs: ~D~%\"\n                    counter (heap-count queue)\n                    (node-cost current-node))\n           \n         ;; If the target is not reached continue\n         until (target-state-p current-state goal-state)\n         do\n         ;; Add the current state to the hash of visited states\n           (setf (gethash current-state visited) t)\n         ;; Expand the current node and continue\n           (expand-node current-node queue)\n         finally (return (values (reconstruct-movements current-node) counter))))))\n\n;; ** Pretty print the path\n(defun print-path (path)\n  \"Prints the directions of PATH and its length.\"\n  (format t \"~{~A~} ~D moves~%\" path (length path)))\n\n;; ** Get some timing information\n(defmacro timing (&body forms)\n  \"Return both how much real time was spend in body and its result\"\n  (let ((start (gensym))\n\t(end (gensym))\n\t(result (gensym)))\n    `(let* ((,start (get-internal-real-time))\n\t    (,result (progn ,@forms))\n\t    (,end (get-internal-real-time)))\n       (values ,result (/ (- ,end ,start) internal-time-units-per-second)))))\n\n;; ** The main function\n(defun 15-puzzle-solver (initial-state &key (goal-state *goal-state*))\n  \"Solves a given and valid 15 puzzle and returns the shortest path to reach the\n  goal state.\"\n  (print-state initial-state)\n  (multiple-value-bind (result time)\n      (timing (multiple-value-bind (path steps)\n                      (a* initial-state :goal-state goal-state)\n                (print-path path)\n                steps))\n   (format t \"Found the shortest path in ~D steps and ~3,2F seconds~%\" result time)) \n  (print-state goal-state))\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_22.txt",
        "content": "15-SOLVER> (15-puzzle-solver *initial-state*)\n ====================\n| 15 | 14 |  1 |  6  |\n|  9 | 11 |  4 | 12  |\n|  0 | 10 |  7 |  3  |\n| 13 |  8 |  5 |  2  |\n ====================\nRRRULDDLUUULDRURDDDRULLULURRRDDLDLUURDDLULURRULDRDRD 52 moves\nFound the shortest path in 1130063 steps and 17.61 seconds\n ====================\n|  1 |  2 |  3 |  4  |\n|  5 |  6 |  7 |  8  |\n|  9 | 10 | 11 | 12  |\n| 13 | 14 | 15 |  0  |\n ====================",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_23.txt",
        "content": "import 'package:collection/collection.dart';\n\ntypedef OffsetFunction = int Function(int a, int b);\nFunction eq = const ListEquality().equals;\n\n/// Solve Random 15 Puzzles\nclass FifteenSolver {\n  static const target = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 0];\n  static const trN = [3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3];\n  static const tcN = [3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2];\n  var pos0 = List.filled(100, 0);\n  var moves = List.filled(100, 0);\n  var dirs = List.filled(100, '');\n  int step = 0, best = 0;\n  var board = List.generate(100, (int i) => List.filled(16, 0));\n\n  bool isFinished() {\n    if (moves[step] < best) return nextMove();\n    if (eq(board[step], target)) {\n      print(\"Solution found in $step moves\u00a0:${dirs.join('')}\");\n      return true;\n    }\n    return (moves[step] == best) ? nextMove() : false;\n  }\n\n  var passNumber = 0;\n\n  /// Try all valid moves from here, but don't retrace your steps.\n  /// Return true if a solution is found.\n  bool nextMove() {\n    // if (passNumber++ ~/ 100000 == 0) print(\"${dirs.join('')}\");\n    return (dirs[step] != 'u' && pos0[step] ~/ 4 < 3 && down()) ||\n        (dirs[step] != 'd' && pos0[step] ~/ 4 > 0 && up()) ||\n        (dirs[step] != 'l' && pos0[step] % 4 < 3 && right()) ||\n        (dirs[step] != 'r' && pos0[step] % 4 > 0 && left()) ||\n        false;\n  }\n\n  bool move(int offset, String dir, List<int> rcArray, OffsetFunction rcFunc) {\n    final int ix = pos0[step] + offset;\n    final n = board[step][ix];\n    pos0[step + 1] = pos0[step] + offset;\n    board[step + 1] = board[step].toList()\n      ..[pos0[step]] = n\n      ..[ix] = 0;\n    dirs[step + 1] = dir;\n    moves[step + 1] = moves[step] + rcFunc(rcArray[n], pos0[step]);\n    step++;\n    if (isFinished()) return true;\n    step--;\n    return false;\n  }\n\n  bool right() => move(1, 'r', tcN, (a, b) => (a <= b % 4 ? 0 : 1));\n  bool left() => move(-1, 'l', tcN, (a, b) => (a >= b % 4 ? 0 : 1));\n  bool down() => move(4, 'd', trN, (a, b) => (a <= b ~/ 4 ? 0 : 1));\n  bool up() => move(-4, 'u', trN, (a, b) => (a >= b ~/ 4 ? 0 : 1));\n\n  void solve(List<int> initBoard) {\n    pos0[0] = initBoard.indexOf(0);\n    board[0] = initBoard;\n    while (!isFinished()) best++;\n  }\n}\n\nvoid main(List<String> args) {\n  print(\"running\");\n  // test values\n  // final start = [5, 1, 2, 3, 6, 10, 7, 4, 13, 9, 11, 8, 14, 0, 15, 12];\n  // final start = [9, 1, 2, 4, 13, 6, 5, 7, 3, 11, 14, 15, 10, 0, 8, 12];\n  // final start = [10, 3, 1, 4, 13, 5, 8, 7, 9, 6, 0, 11, 14, 15, 12, 2];\n  // required solution\n  final start = [15, 14, 1, 6, 9, 11, 4, 12, 0, 10, 7, 3, 13, 8, 5, 2];\n  // Extra credit\n  // final start = [0, 12, 9, 13, 15, 11, 10, 14, 3, 7, 2, 5, 4, 8, 6, 1];\n  print(start);\n  FifteenSolver().solve(start);\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_24.txt",
        "content": "running\nSolution found in 52 moves :rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_25.txt",
        "content": "// A Naive 15 puzzle solver using no memory. Nigel Galloway: October 6th., 2017\nlet Nr,Nc = [|3;0;0;0;0;1;1;1;1;2;2;2;2;3;3;3|],[|3;0;1;2;3;0;1;2;3;0;1;2;3;0;1;2|]\ntype G= |N |I |G |E |L \ntype N={i:uint64;g:G list;e:int;l:int}\nlet fN     n=let g=(11-n.e)*4 in let a=n.i&&&(15UL<<<g)\n             {i=n.i-a+(a<<<16);g=N::n.g;e=n.e+4;l=n.l+(if Nr.[int(a>>>g)]<=n.e/4 then 0 else 1)}\nlet fI     i=let g=(19-i.e)*4 in let a=i.i&&&(15UL<<<g)\n             {i=i.i-a+(a>>>16);g=I::i.g;e=i.e-4;l=i.l+(if Nr.[int(a>>>g)]>=i.e/4 then 0 else 1)}\nlet fG     g=let l=(14-g.e)*4 in let a=g.i&&&(15UL<<<l)\n             {i=g.i-a+(a<<<4) ;g=G::g.g;e=g.e+1;l=g.l+(if Nc.[int(a>>>l)]<=g.e%4 then 0 else 1)}\nlet fE     e=let l=(16-e.e)*4 in let a=e.i&&&(15UL<<<l)\n             {i=e.i-a+(a>>>4) ;g=E::e.g;e=e.e-1;l=e.l+(if Nc.[int(a>>>l)]>=e.e%4 then 0 else 1)}\nlet fL=let l=[|[I;E];[I;G;E];[I;G;E];[I;G];[N;I;E];[N;I;G;E];[N;I;G;E];[N;I;G];[N;I;E];[N;I;G;E];[N;I;G;E];[N;I;G];[N;E];[N;G;E];[N;G;E];[N;G];|]\n       (fun n g->List.except [g] l.[n] |> List.map(fun n->match n with N->fI |I->fN |G->fE |E->fG))\nlet solve n g l=let rec solve n=match n with // n is board, g is pos of 0, l is max depth\n                                |n when n.i =0x123456789abcdef0UL->Some(n.g)\n                                |n when n.l>l                    ->None\n                                |g->let rec fN=function h::t->match solve h with None->fN t |n->n\n                                                       |_->None\n                                    fN (fL g.e (List.head n.g)|>List.map(fun n->n g))\n                solve {i=n;g=[L];e=g;l=0}\n  let n = Seq.collect fN n\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_26.txt",
        "content": "let test n g=match [1..15]|>Seq.tryPick(solve n g) with\n               Some n->n|>List.rev|>List.iter(fun n->printf \"%c\" (match n with N->'d'|I->'u'|G->'r'|E->'l'|L->'\\u0000'));printfn \" (%n moves)\" (List.length n)\n              |_     ->printfn \"No solution found\"\ntest 0xfe169b4c0a73d852UL 8\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_27.txt",
        "content": "rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd (52 moves)\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_28.txt",
        "content": "#! /usr/bin/gforth\n\ncell 8 <> [if] s\" 64-bit system required\" exception throw [then]\n\n\\ In the stack comments below,\n\\ \"h\" stands for the hole position (0..15),\n\\ \"s\" for a 64-bit integer representing a board state,\n\\ \"t\" a tile value (0..15, 0 is the hole),\n\\ \"b\" for a bit offset of a position within a state,\n\\ \"m\" for a masked value (4 bits selected out of a 64-bit state),\n\\ \"w\" for a weight of a current path,\n\\ \"d\" for a direction constant (0..3)\n\n\\ Utility\n: 3dup   2 pick 2 pick 2 pick ;\n: 4dup   2over 2over ;\n: shift   dup 0 > if lshift else negate rshift then ;\n\nhex 123456789abcdef0 decimal constant solution\n: row   2 rshift ;   : col   3 and ;\n\n: up-valid?    ( h -- f ) row 0 > ;\n: down-valid?  ( h -- f ) row 3 < ;\n: left-valid?  ( h -- f ) col 0 > ;\n: right-valid? ( h -- f ) col 3 < ;\n\n: up-cost    ( h t -- 0|1 ) 1 - row swap row < 1 and ;\n: down-cost  ( h t -- 0|1 ) 1 - row swap row > 1 and ;\n: left-cost  ( h t -- 0|1 ) 1 - col swap col < 1 and ;\n: right-cost ( h t -- 0|1 ) 1 - col swap col > 1 and ;\n\n\\ To iterate over all possible directions, put direction-related functions into arrays:\n: ith ( u addr -- w ) swap cells + @ ;\ncreate valid? ' up-valid? , ' left-valid? , ' right-valid? , ' down-valid? , does> ith execute ;\ncreate cost ' up-cost , ' left-cost , ' right-cost , ' down-cost , does> ith execute ;\ncreate step -4 , -1 , 1 , 4 , does> ith ;\n\n\\ Advance from a single state to another:\n: bits ( h -- b ) 15 swap - 4 * ;\n: tile ( s b -- t ) rshift 15 and ;\n: new-state ( s h d -- s' ) step dup >r + bits 2dup tile ( s b t ) swap lshift tuck - swap r> 4 * shift + ;\n: new-weight ( w s h d -- w' ) >r tuck r@ step + bits tile r> cost + ;\n: advance ( w s h d -- w s h w' s' h' ) 4dup new-weight >r  3dup new-state >r  step over + 2r> rot ;\n\n\\ Print a solution:\n: rollback   2drop drop ;\n: .dir ( u -- ) s\" d..r.l..u\" drop 4 + swap + c@ emit ;\n: .dirs ( .. -- ) 0 begin >r 3 pick -1 <> while 3 pick over - .dir rollback r> 1+ repeat r> ;\n: win   cr .\" solved (read right-to-left!): \" .dirs .\"  - \" . .\" moves\" bye ;\n\n\\ The main recursive function for depth-first search:\ncreate limit 1 ,   : deeper  1 limit +! ;\n: u-turn ( .. h2 w1 s1 h1 ) 4 pick 2 pick - ;\n: search ( .. h2 w1 s1 h1 )\n\tover solution = if win then\n\t2 pick limit @ > if exit then\n\t4 0 do dup i valid? if i step u-turn <> if i advance recurse rollback then then loop ;\n\n\\ Iterative-deepening search:\n: solve   1 limit !  begin search deeper again ;\n\n\\ -1 0 hex 0c9dfbae37254861 decimal 0 solve    \\ uhm.\n -1 0 hex fe169b4c0a73d852 decimal 8 solve     \\ the 52 moves case\n\\ -1 0 hex 123456789afbde0c decimal 14 solve   \\ some trivial case, 3 moves\nbye\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_29.txt",
        "content": "time ./15_puzzle_solver.fs \nredefined search \nsolved (read right-to-left!): ddrrdlurrululddruuldlurddldrrruluuldddrurdluuldlurrr - 52 moves\nreal\t1m14.605s\nuser\t1m5.212s\nsys\t0m0.048s\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_3.txt",
        "content": "  0 12  9 13\n 15 11 10 14\n  3  7  2  5\n  4  8  6  1\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_30.txt",
        "content": "59:         H = MOD(ABS(PRODUCT(BRD)),APRIME)\n004016E3   mov         esi,1\n004016E8   mov         ecx,1\n004016ED   cmp         ecx,2\n004016F0   jg          MAIN$SLIDESOLVE+490h (0040171e)\n004016F2   cmp         ecx,1\n004016F5   jl          MAIN$SLIDESOLVE+46Eh (004016fc)\n004016F7   cmp         ecx,2\n004016FA   jle         MAIN$SLIDESOLVE+477h (00401705)\n004016FC   xor         eax,eax\n004016FE   mov         dword ptr [ebp-54h],eax\n00401701   dec         eax\n00401702   bound       eax,qword ptr [ebp-54h]\n00401705   imul        edx,ecx,4\n00401708   mov         edx,dword ptr H (00473714)[edx]\n0040170E   imul        edx,esi\n00401711   mov         esi,edx\n00401713   mov         eax,ecx\n00401715   add         eax,1\n0040171A   mov         ecx,eax\n0040171C   jmp         MAIN$SLIDESOLVE+45Fh (004016ed)\n0040171E   mov         eax,esi\n00401720   cmp         eax,0\n00401725   jge         MAIN$SLIDESOLVE+49Bh (00401729)\n00401727   neg         eax\n00401729   mov         edx,10549h\n0040172E   mov         dword ptr [ebp-54h],edx\n00401731   cdq\n00401732   idiv        eax,dword ptr [ebp-54h]\n00401735   mov         eax,edx\n00401737   mov         dword ptr [H (00473714)],eax\n60:         write (6,*) H,bored\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_31.txt",
        "content": "59:         H = MOD(ABS(BRD(1)*BRD(2)),APRIME)\n004016E3   mov         eax,dword ptr [BRD (00473718)]\n004016E9   imul        eax,dword ptr [BRD+4 (0047371c)]\n004016F0   cmp         eax,0\n004016F5   jge         MAIN$SLIDESOLVE+46Bh (004016f9)\n004016F7   neg         eax\n004016F9   mov         esi,10549h\n004016FE   cdq\n004016FF   idiv        eax,esi\n00401701   mov         eax,edx\n00401703   mov         dword ptr [H (00473714)],eax\n60:         write (6,*) H,bored\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_32.txt",
        "content": "IF (NR.EQ.4) THEN\n code specialised for NR = 4\nELSE IF (NR.EQ.3) THEN\n code specialised for NR = 3\nEND IF\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_33.txt",
        "content": "      SUBROUTINE PROUST(T)\t!Remembrance of time passed.\n       DOUBLE PRECISION T\t!The time, in seconds. Positive only, please.\n       DOUBLE PRECISION S\t!A copy I can mess with.\n       TYPE TIMEWARP\t\t!Now prepare a whole lot of trickery for expressing the wait time.\n        INTEGER LIMIT\t\t!The upper limit for the usage.\n        INTEGER STEP\t\t!Conversion to the next unit.\n        CHARACTER*4 NAME\t!A suitable abbreviated name for the accepted unit.\n       END TYPE TIMEWARP\t!Enough of this.\n       INTEGER CLOCKCRACK\t!How many different units might I play with?\n       PARAMETER (CLOCKCRACK = 5)\t!This should so.\n       TYPE(TIMEWARP) TIME(CLOCKCRACK)\t!One set, please.\n       PARAMETER (TIME = (/\t\t!The mention of times lost has multiple registers.\n     1  TIMEWARP(99, 60,\"secs\"),\t!Beware 99.5+ rounding up to 100.\n     2  TIMEWARP(99, 60,\"mins\"),\t!Likewise with minutes.\n     3  TIMEWARP(66, 24,\"hrs!\"),\t!More than a few days might as well be in days.\n     4  TIMEWARP(99,365,\"days\"),\t!Too many days, and we will speak of years.\n     5  TIMEWARP(99,100,\"yrs!\")/))\t!And the last gasp converts to centuries.\n       INTEGER CC\t\t!A stepper for these selections.\n       CHARACTER*4 U\t\t!The selected unit.\n       INTEGER MSG\t\t!The mouthpiece.\n       COMMON/IODEV/ MSG\t!Used in common.\n        S = T\t\t\t!A working copy.\n        DO CC = 1,CLOCKCRACK\t!Now re-assess DT, with a view to announcing a small number.\n          IF (S.LE.TIME(CC).LIMIT) THEN\t!Too big a number?\n            U = TIME(CC).NAME\t\t\t!No, this unit will suffice.\n            GO TO 10\t\t\t\t!Make off to use it.\n          END IF\t\t\t!But if the number is too big,\n          S = S/TIME(CC).STEP\t\t!Escalate to the next larger unit.\n        END DO \t\t\t!And see if that will suffice.\n        U = \"Cys!!\"\t\t!In case there are too many years, this is the last gasp.\n   10   WRITE (MSG,11) S,U\t!Say it.\n   11   FORMAT (F7.1,A4,$)\t!But don't finish the line.\n       END SUBROUTINE PROUST\t!A sigh.\n\n       CHARACTER*15 FUNCTION HMS(T)\t!Report the time of day.\nCareful! Finite precision and binary/decimal/sexagesimal conversion could cause 2:30:00am. to appear as 2:29:60am.\n        DOUBLE PRECISION S,T\t!Seconds (completed) into the day.\n        INTEGER H,M\t\t!More traditional units are to be extracted.\n        INTEGER SECONDSINDAY\t!A canonical day.\n        PARAMETER (SECONDSINDAY = 24*60*60)\t!Of nominal seconds.\n        CHARACTER*15 TEXT\t!A scratchpad.\n         H = T\t\t\t!Truncate into an integer.\n         S = T - (H - 1)/SECONDSINDAY*SECONDSINDAY\t!Thus allow for midnight = hour 24.\n         IF (S.EQ.SECONDSINDAY/2) THEN\t!This might happen.\n           TEXT = \"High Noon!\"\t!Though the chances are thin.\n         ELSE IF (S.EQ.SECONDSINDAY) THEN\t!This is synonymous with the start of the next day.\n           TEXT = \"Midnight!\"\t!So this presumably won't happen.\n         ELSE\t\t!But more likely are miscellaneous values.\n           H = S/3600\t\t!Convert seconds into whole hours completed.\n           S = S - H*3600\t!The remaining time.\n           M = S/60\t\t!Seconds into minutes completed.\n           S = S - M*60\t\t!Remove them.\n           IF (S .GE. 59.9995D0) THEN\t!Via format F6.3, will this round up to 60?\n             S = 0\t\t!Yes. Curse recurring binary sequences for decimal.\n             M = M + 1\t\t!So, up the minute count.\n             IF (M.GE.60) THEN\t!Is there an overflow here too?\n               M = 0\t\t!Yes.\n               H = H + 1\t!So might appear 24:00:00.000 though it not be Midnight!\n             END IF\t\t!So much for twiddling the minutes.\n           END IF\t\t!And twiddling the hours.\n           IF (H.LT.12) THEN\t!A plague on the machine mentality.\n             WRITE (TEXT,1) H,M,S,\"am.\"\t!Ante-meridian.\n    1        FORMAT (I2,\":\",I2,\":\",F6.3,A3)\t!Thus.\n            ELSE\t\t!For the post-meridian, H >= 12.\n             IF (H.GT.12) H = H - 12\t!Adjust to civil usage. NB! 12 appears.\n             WRITE (TEXT,1) H,M,S,\"pm.\"\t!Thus. Post-meridian.\n           END IF\t!So much for those fiddles.\n           IF (TEXT(4:4).EQ.\" \") TEXT(4:4) = \"0\"\t!Now help hint that the\n           IF (TEXT(7:7).EQ.\" \") TEXT(7:7) = \"0\"\t! character string is one entity.\n         END IF\t\t!So much for preparation.\n         HMS = TEXT\t!The result.\n       END FUNCTION HMS\t!Possible compiler confusion if HMS is invoked in a WRITE statement.\n\n       DOUBLE PRECISION FUNCTION NOWWAS(WOT)\t!Ascertain the local time for interval assessment.\nCompute with whole day numbers, to avoid day rollover annoyances.\nCan't use single precision and expect much discrimination within a day.\nC I'd prefer a TIMESTAMP(Local) and a TIMESTAMP(GMT) system function.\nC Quite likely, the system separates its data to deliver the parameters, which I then re-glue.\n        INTEGER WOT\t!What sort of time do I want?\n        REAL*8 TIME\t!A real good time.\n        INTEGER MARK(8)\t!The computer's clock time will appear here, but fragmented.\n         IF (WOT.LE.0) THEN\t!Just the CPU time for this.\n           CALL CPU_TIME(TIME)\t!Apparently in seconds since starting.\n          ELSE\t\t\t!But normally, I want a time-of-day now.\n           CALL DATE_AND_TIME(VALUES = MARK)\t!Unpack info that I will repack.\nc           WRITE (6,1) MARK\nc    1      FORMAT (\"The computer clock system reports:\",\nc     1      /\"Year\",I5,\", Month\",I3,\", Day\",I3,\nc     2      /\" Minutes from GMT\",I5,\nc     3      /\" Hour\",I3,\", Minute\",I3,\",Seconds\",I3,\".\",I3)\n           TIME = (MARK(5)*60 + MARK(6))*60 + MARK(7) + MARK(8)/1000D0\t!By the millisecond, to seconds.\n           IF (WOT.GT.1) TIME = TIME - MARK(4)*60\t!Shift back to GMT, which may cross a day boundary.\nc          TIME = DAYNUM(MARK(1),MARK(2),MARK(3)) + TIME/SECONDSINDAY\t!The fraction of a day is always less than 1 as MARK(5) is declared < 24.\n           TIME = MARK(3)*24*60*60 + TIME\t!Not bothering with DAYNUM, and converting to use seconds rather than days as the unit.\n         END IF\t\t\t!A simple number, but, multiple trickeries. The GMT shift includes daylight saving's shift...\n         NOWWAS = TIME\t\t!Thus is the finger of time found.\n       END FUNCTION NOWWAS\t!But the Hand of Time has already moved on.\n\n      MODULE SLIDESOLVE\t\t!Collect the details for messing with the game board.\n       INTEGER NR,NC,N\t\t\t\t!Give names to some sizes.\n       PARAMETER (NR = 4, NC = 4, N = NR*NC)\t!The shape of the board.\n       INTEGER*1 BOARD(N),TARGET(N),ZERO(N)\t!Some scratchpads.\n       INTEGER BORED(4)\t\t\t\t!A re-interpretation of the storage containing the BOARD.\n       CHARACTER*(N) BOAR\t\t\t!Another, since the INDEX function only accepts these.\n       EQUIVALENCE (BORED,BOARD,BOAR)\t\t!All together now!\n       CHARACTER*1 DIGIT(0:35)\t\t\t!This will help to translate numbers to characters.\n       PARAMETER (DIGIT = (/\"0\",\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\",\n     1  \"A\",\"B\",\"C\",\"D\",\"E\",\"F\",\"G\",\"H\",\"I\",\"J\",\t!I don't anticipate going beyond 15.\n     2  \"K\",\"L\",\"M\",\"N\",\"O\",\"P\",\"Q\",\"R\",\"S\",\"T\",\t!But, for completeness...\n     3  \"U\",\"V\",\"W\",\"X\",\"Y\",\"Z\"/))\t\t\t!Add a few more.\n      CONTAINS\n       SUBROUTINE SHOW(NR,NC,BOARD)\t!The layout won't work for NC > 99...\n        INTEGER NR,NC\t\t!Number of rows and columns.\n        INTEGER*1 BOARD(NC,NR)\t!The board is stored transposed, in Furrytran!\n        INTEGER R,C\t\t!Steppers.\n        INTEGER MSG\t\t!Keep the compiler quiet.\n        COMMON/IODEV/ MSG\t!I talk to the trees...\n         WRITE (MSG,1) (C,C = 1,NC)\t!Prepare a heading.\n    1    FORMAT (\"Row|\",9(\"__\",I1,:),90(\"_\",I2,:))\t!This should suffice.\n         DO R = 1,NR\t\t!Chug down the rows, for each showing a succession of columns.\n           WRITE (MSG,2) R,BOARD(1:NC,R)\t!Thus, successive elements of storage. Storage style is BOARD(column,row).\n    2      FORMAT (I3,\"|\",99I3)\t\t!Could use parameters, but enough.\n         END DO\t\t\t!Show columns across and rows down, despite the storage order.\n       END SUBROUTINE SHOW\t!Remember to transpose the array an odd number of times.\n\n       SUBROUTINE UNCRAM(IT,BOARD)\t!Recover the board layout..\n        INTEGER IT(2)\t\t!Two 32-bit integers hold 16 four-bit fields in a peculiar order.\n        INTEGER*1 BOARD(*)\t!This is just a simple, orderly sequence of integers.\n        INTEGER I,HIT\t\t!Assistants.\n         DO I = 0,8,8\t\t!Unpack into the work BOARD.\n           HIT = IT(I/8 + 1)\t\t!Grab eight positions, in four bits each..\n                                BOARD(I + 5) = IAND(HIT,15)\t!The first is position 5.\n           HIT = ISHFT(HIT,-4); BOARD(I + 1) = IAND(HIT,15)\t!Hex 48372615\n           HIT = ISHFT(HIT,-4); BOARD(I + 6) = IAND(HIT,15)\t!and C0BFAE9D\n           HIT = ISHFT(HIT,-4); BOARD(I + 2) = IAND(HIT,15)\t!For BOARD(1) = 1, BOARD(2) = 2,...\n           HIT = ISHFT(HIT,-4); BOARD(I + 7) = IAND(HIT,15)\t!This computer is (sigh) little-endian.\n           HIT = ISHFT(HIT,-4); BOARD(I + 3) = IAND(HIT,15)\t!Rather than mess with more loops,\n           HIT = ISHFT(HIT,-4); BOARD(I + 8) = IAND(HIT,15)\t!Explicit code is less of a brain strain.\n           HIT = ISHFT(HIT,-4); BOARD(I + 4) = IAND(HIT,15)\t!And it should run swiftly, too...\n         END DO\t\t\t\t!Only two of them.\n       END SUBROUTINE UNCRAM\t!A different-sized board would be a problem too.\n\n       INTEGER*8 FUNCTION ZDIST(BOARD)\t!Encode the board's positions against the ZERO sequence.\n        INTEGER*1 BOARD(N)\t!The values of the squares.\n        LOGICAL*1 AVAIL(N)\t!The numbers will be used one-by-one to produce ZC.\n        INTEGER BASE\t\t!This is not a constant, such as ten.\n        INTEGER M,IT\t\t!Assistants.\n         AVAIL = .TRUE.\t\t\t!All numbers are available.\n         BASE = N\t\t\t!The first square has all choices.\n         ZDIST = 0\t\t\t!Start the encodement of choices.\n         DO M = 1,N\t\t\t!Step through the board's squares.\n           IT = BOARD(M)\t\t\t!Grab the square's number. It is the index into ZERO.\n           IF (IT.EQ.0) IT = N\t\t\t!But in ZERO, the zero is at the end, damnit.\n           AVAIL(IT) = .FALSE.\t\t\t!This number is now used.\n           ZDIST = ZDIST*BASE + COUNT(AVAIL(1:IT - 1))\t!The number of available values to skip to reach it.\n           BASE = BASE - 1\t\t\t!Option count for the next time around.\n         END DO\t\t\t\t!On to the next square.\n       END FUNCTION ZDIST\t!ZDIST(ZERO) = 0.\n\n       SUBROUTINE REPORT(R,WHICH,MOVE,BRD)\t!Since this is invoked in two places.\n        INTEGER R\t\t!The record number of the position.\n        CHARACTER*(*) WHICH\t!In which stash.\n        CHARACTER*1 MOVE\t!The move code.\n        INTEGER BRD(2)\t\t!The crammed board position.\n        INTEGER*1 BOARD(N)\t!Uncrammed for nicer presentation.\n        INTEGER*8 ZC\t\t!Encodes the position in a mixed base.\n        INTEGER ZM,ZS\t\t!Alternate forms of distance.\n        DOUBLE PRECISION ZE\t!This is Euclidean.\n        INTEGER MSG\t\t!Being polite about usage,\n        COMMON/IODEV/MSG\t!Rather than mysterious constants.\n         CALL UNCRAM(BRD,BOARD)\t\t!Isolate the details.\n         ZM = MAXVAL(ABS(BOARD - ZERO))\t\t\t!A norm. |(x,y)| = r gives a square shape.\n         ZS = SUM(ABS(BOARD - ZERO))\t\t\t!A norm. |(x,y)| = r gives a diamond shape.\n         ZE = SQRT(DFLOAT(SUM((BOARD - ZERO)**2)))\t!A norm. |(x,y)| = r gives a circle.\n         ZC = ZDIST(BOARD)\t\t\t\t!Encodement against ZERO.\n         WRITE (MSG,1) R,WHICH,MOVE,DIGIT(BOARD),ZM,ZS,ZE,ZC\t!After all that,\n    1    FORMAT (I11,A6,A5,1X,\"|\",<NR - 1>(<NC>A1,\"/\"),<NC>A1,\"|\",\t!Show the move and the board\n     1    2I8,F12.3,I18)\t\t\t\t\t!Plus four assorted distances.\n       END SUBROUTINE REPORT\t!Just one line is produced.\n\n       SUBROUTINE PURPLE HAZE(BNAME)\t!Spreads a red and a blue tide.\n        CHARACTER*(*) BNAME\t\t!Base name for the work files.\n        CHARACTER*(N) BRAND\t\t!Name part based on the board sequence.\n        CHARACTER*(LEN(BNAME) + 1 + N + 4) FNAME\t!The full name.\nCollect the details for messing with the game board.\n        CHARACTER*4 TIDE(2)\t\t\t!Two tides will spread forth.\n        PARAMETER (TIDE = (/\" Red\",\"Blue\"/))\t!With these names.\n        INTEGER LZ,LOCZ(2),LOCI(2),ZR,ZC\t!Location via row and column.\n        EQUIVALENCE(LOCZ(1),ZR),(LOCZ(2),ZC)\t!Sometimes separate, sometimes together.\n        INTEGER WAY(4),HENCE,W,M,D,WAYS(2,4)\t!Direction codes.\n        PARAMETER (WAY = (/   +1,  -NC,   -1,  +NC/))\t!Directions for the zero square, in one dimension.\n        PARAMETER (WAYS = (/0,+1, -1,0, 0,-1, +1,0/))\t!The same, but in (row,column) style.\n        CHARACTER*1 WNAMEZ(0:4),WNAMEF(0:4)\t!Names for the directions.\n        PARAMETER (WNAMEZ = (/\" \",\"R\",\"U\",\"L\",\"D\"/))\t!The zero square's WAYS.\n        PARAMETER (WNAMEF = (/\" \",\"L\",\"D\",\"R\",\"U\"/))\t!The moved square's ways are opposite.\nCreate two hashed stashes. A stash file and its index file, twice over.\n        INTEGER APRIME\t\t\t\t!Determines the size of the index.\n        PARAMETER (APRIME = 199 999 991)\t!Prime 11078917. Prime 6666666 = 116 743 349. Perhaps 1999999973?\n        INTEGER HCOUNT(2),NINDEX(2)\t\t!Counts the entries in the stashes and their indices.\n        INTEGER P,HIT\t\t\t\t!Fingers to entries in the stash.\n        INTEGER SLOSH,HNEXT\t\t\t!Advances from one surge to the next.\n        INTEGER IST(2),LST(2),SURGE(2)\t\t!Define the perimeter of a surge.\n        INTEGER HEAD,LOOK\t\t\t!For chasing along a linked-list of records.\n        TYPE AREC\t\t\t\t!Stores the board position, and helpful stuff.\n         INTEGER NEXT\t\t\t\t\t!Links to the next entry that has the same hash value.\n         INTEGER PREV\t\t\t\t\t!The entry from which this position was reached.\n         INTEGER MOVE\t\t\t\t\t!By moving the zero in this WAY.\n         INTEGER BRD(2)\t\t\t\t\t!Squeezed representation of the board position.\n        END TYPE AREC\t\t\t\t!Greater compaction (especially of MOVE) would require extra crunching.\n        INTEGER LREC\t\t\t\t!Record length, in INTEGER-size units. I do some counting.\n        PARAMETER (LREC = 5)\t\t\t!For the OPEN statement.\n        TYPE(AREC) ASTASH,APROBE\t\t!I need two scratchpads.\n        INTEGER NCHECK\t\t\t\t!Number of new positions considered.\n        INTEGER NLOOK(2),PROBES(2),NP(2),MAXP(2)!Statistics for the primary and secondary searches resulting.\n        LOGICAL SURGED(2)\t\t\t!A SLOSH might not result in a SURGE.\nCatch   the red/blue meetings, if any.\n        INTEGER MANY,LONG\t\t\t!They may be many, and, long.\n        PARAMETER (MANY = 666,LONG = 66)\t!This should do.\n        INTEGER NMET,MET(2,MANY)\t\t!Identify the meeting positions, in their own stash.\n        INTEGER NTRAIL,TRAIL(LONG)\t\t!Needed to follow the moves.\n        INTEGER NS,LS(MANY)\t\t\t!Count the shove sequences.\n        CHARACTER*128 SHOVE(MANY)\t\t!Record them.\nConglomeration of support stuff.\n        LOGICAL EXIST\t\t\t\t!For testing the presence of a disc file.\n        INTEGER I,IT\t\t\t\t!Assistants.\n        DOUBLE PRECISION T1,T2,E1,E2,NOWWAS\t!Time details.\n        CHARACTER*15 HMS\t\t\t!A clock.\n        INTEGER MSG,KBD,WRK(2),NDX(2)\t!I/O unit numbers.\n        COMMON/IODEV/ MSG,KBD,WRK,NDX\t!I talk to the trees...\n         NS = 0\t!No shove sequences have been found.\nConcoct some disc files for storage areas, reserving the first record of each as a header.\n   10    BOARD = ZERO\t!The red tide spreads from \"zero\".\n         DO W = 1,2\t!Two work files are required.\n           WRITE(MSG,11) TIDE(W)\t!Which one this time?\n   11      FORMAT (/,\"Tide \",A)\t\t!Might as well supply a name.\n           DO I = 1,N\t\t!Produce a text sequence for the board layout.\n             BRAND(I:I) = DIGIT(BOARD(I))\t!One by one...\n           END DO\t\t!BRAND = DIGIT(BOARD)\n           FNAME = BNAME//\".\"//BRAND//\".dat\"\t!It contains binary stuff, so what else but data?\n           INQUIRE (FILE = FNAME, EXIST = EXIST)\t!Perhaps it is lying about.\n   20      IF (EXIST) THEN\t\t\t\t!Well?\n             WRITE (MSG,*) \"Restarting from file \",FNAME\t!One hopes its content is good.\n             OPEN (WRK(W),FILE = FNAME,STATUS = \"OLD\",ACCESS = \"DIRECT\",\t!Random access is intended.\n     1        FORM = \"UNFORMATTED\",BUFFERED = \"YES\",RECL = LREC)\t\t!Using record numbers as the key.\n             FNAME = BNAME//\".\"//BRAND//\".ndx\"\t\t!Now go for the accomplice.\n             INQUIRE (FILE = FNAME, EXIST = EXIST)\t!That contains the index.\n             IF (.NOT.EXIST) THEN\t\t\t!Well?\n               WRITE (MSG,*) \" ... except, no file \",FNAME\t!Oh dear.\n               CLOSE(WRK(W))\t\t\t\t!So, no index for the work file. Abandon it.\n               GO TO 20\t\t\t\t\t!And thus jump into the ELSE clause below.\n             END IF\t\t\t\t!Seeing as an explicit GO TO would be regarded as improper...\n             READ (WRK(W),REC = 1) HCOUNT(W),SURGE(W),IST(W),LST(W)!Get the header information.\n             WRITE (MSG,22) HCOUNT(W),SURGE(W),IST(W),LST(W)\t!Reveal.\n   22        FORMAT (\" Stashed \",I0,\". At surge \",I0,\t\t!Perhaps it will be corrupt.\n     1        \" with the boundary stashed in elements \",I0,\" to \",I0)\t!If so, this might help the reader.\n             OPEN (NDX(W),FILE = FNAME,STATUS = \"OLD\",ACCESS=\"DIRECT\",\t!Now for the accomplice.\n     1        FORM = \"UNFORMATTED\",BUFFERED = \"YES\",RECL = 1)\t\t!One INTEGER per record.\n             READ(NDX(W), REC = 1) NINDEX(W)\t\t\t!This count is maintained, to avoid a mass scan.\n             WRITE (MSG,23) NINDEX(W),APRIME\t\t\t!Exhibit the count.\n   23        FORMAT (\" Its index uses \",I0,\" of \",I0,\" entries.\")\t!Simple enough.\n            ELSE\t\t\t!But, if there is no stash, create a new one.\n             WRITE (MSG,*) \"Preparing a stash in file \",FNAME\t!Start from scratch.\n             OPEN (WRK(W),FILE = FNAME,STATUS=\"REPLACE\",ACCESS=\"DIRECT\",\t!I intend non-sequential access...\n     1        FORM = \"UNFORMATTED\",BUFFERED = \"YES\",RECL = LREC)\t\t!And, not text.\n             HCOUNT(W) = 1\t\t!Just one position is known, the final position.\n             SURGE(W) = 0\t\t!It has not been clambered away from.\n             IST(W) = 1\t\t\t!The first to inspect at the current level.\n             LST(W) = 1\t\t\t!The last.\n             WRITE (WRK(W),REC = 1) HCOUNT(W),SURGE(W),IST(W),LST(W),0\t!The header.\n             FNAME = BNAME//\".\"//BRAND//\".ndx\"\t!Now for the associated index file..\n             WRITE (MSG,*) \"... with an index in file \",FNAME\t!Announce before attempting access.\n             OPEN (NDX(W),FILE = FNAME,STATUS = \"REPLACE\",ACCESS=\t!Lest there be a mishap.\n     1        \"DIRECT\",FORM = \"UNFORMATTED\",BUFFERED = \"YES\",RECL = 1)\t!Yep. Just one value per record.\n             WRITE (MSG,*) APRIME,\" zero values for an empty index.\"\t!This may cause a pause.\n             NINDEX(W) = 1\t\t\t\t!The index will start off holding one used entry.\n             WRITE (NDX(W),REC = 1) NINDEX(W)\t!Save this count in the header record.\n             WRITE (NDX(W),REC = 1 + APRIME) 0\t!Zero values will also appear in the gap!\n             ASTASH.NEXT = 0\t\t!The first index emtry can never collide with another in an empty index.\n             ASTASH.PREV = 0\t\t!And it is created sufficient unto itself.\n             ASTASH.MOVE = 0\t\t!Thus, it is not a descendant, but immaculate.\n             ASTASH.BRD(1) = BORED(1)*16 + BORED(2)\t!Only four bits of the eight supplied are used.\n             ASTASH.BRD(2) = BORED(3)*16 + BORED(4)\t!So interleave them, pairwise.\n             SLOSH = ASTASH.BRD(1)*ASTASH.BRD(2)\t!Mash the bits together.\n             HIT = ABS(MOD(SLOSH,APRIME)) + 2\t\t!Make a hash. Add one since MOD starts with zero.\n             WRITE (NDX(W),REC = HIT) HCOUNT(W)\t\t!Adding another one to dodge the header as well.\n             WRITE (MSG,24) BOARD,BORED,ASTASH.BRD,\t!Reveal the stages.\n     1        SLOSH,SLOSH,SLOSH,APRIME,HIT\t\t\t\t!Of the mostly in-place reinterpretations.\n   24        FORMAT (<N>Z2,\" is the board layout in INTEGER*1\",/,\t!Across the columns and down the rows.\n     1        4Z8,\" is the board layout in INTEGER*4\",/,\t\t!Reinterpret as four integers.\n     2        2(8X,Z8),\" ..interleaved into two INTEGER*4\",/,\t\t!Action: Interleaved into two.\n     3        Z32,\" multiplied together in INTEGER*4\",/,\t\t!Action: Their product.\n     4        I32,\" as a decimal integer.\",/,\t\t\t\t!Abandoning hexadecimal.\n     5        \"ABS(MOD(\",I0,\",\",I0,\")) + 2 = \",I0,\t\t\t!The final step.\n     6        \" is the record number for the first index entry.\")\t!The result.\n             WRITE (WRK(W),REC = HCOUNT(W) + 1) ASTASH\t!Record one is reserved as a header...\n           END IF\t\t\t\t!Either way, a workfile should be ready now.\n           IF (W.EQ.1) BOARD = TARGET\t!Thus go for the other work file.\n         END DO\t\t!Only two iterations, but a lot of blather.\n         SLOSH = MINVAL(SURGE,DIM = 1)\t!Find the laggard.\n\nCast forth a heading for the progress table to follow..\n         WRITE (MSG,99)\n   99    FORMAT (/,7X,\"|\",3X,\"Tidewrack Boundary Positions  |\",\n     1    6X,\"Positions\",5X,\"|\",7X,\"Primary Probes\",9X,\"Index Use\",\n     2    4X,\"|\",5X,\"Secondary Probes\",3X,\"|\",\" Memory of Time Passed\",/,\n     3    \"Surge\",2X,\"|\",6X,\"First\",7X,\"Last\",6X,\"Count|\",\n     4    4X,\"Checked Deja vu%|\",7X,\"Made Max.L  Avg.L|   Used%\",\n     5    5X,\"Load%|\",7X,\"Made Max.L  Avg.L|\",6X,\"CPU\",8X,\"Clock\")\n\nChase along the boundaries of the red and the blue tides, each taking turns as primary and secondary interests.\n  100    SLOSH = SLOSH + 1\t!Another advance begins.\n      WW:DO W = 1,2\t!The advance is made in two waves, each with its own statistics.\n           M = 3 - W\t\t!Finger the other one.\n           NMET = 0\t\t!No meetings have happened yet.\n           IF (SURGE(W).GE.SLOSH) CYCLE WW\t!Prefer to proceed with matched surges.\n           WRITE (MSG,101) SLOSH,TIDE(W),IST(W),LST(W),LST(W)-IST(W)+1\t!The boundary to be searched.\n  101      FORMAT (I2,1X,A4,\"|\",3I11,\"|\",$)\t\t\t\t!This line will be continued.\n           NCHECK = 0\t\t!No new positions have been prepared.\n           NLOOK = 0\t\t!So the stashes have not been searched for any of them.\n           PROBES = 0\t\t!And no probes have been made in any such searches.\n           MAXP = 0\t\t!So the maximum length of all probe chains is zero so far.\n           HNEXT = LST(W) + 1\t!This will be where the first new position will be stashed.\n           T1 = NOWWAS(0)\t!Note the accumulated CPU time at the start of the boundary ride..\n           E1 = NOWWAS(2)\t!Time of day, in seconds. GMT style (thus not shifted by daylight saving)\n        PP:DO P = IST(W),LST(W)\t!These are on the edge of the tide. Spreading proceeds.\n             READ (WRK(W),REC = P + 1) ASTASH\t!Obtain a position, remembering to dodge the header record.\n             HENCE = ASTASH.MOVE\t\t!The move (from ASTASH.PREV) that reached this position.\n             IF (HENCE.NE.0) HENCE = MOD(HENCE + 1,4) + 1\t!The reverse of that direction. Only once zero. Sigh.\n             CALL UNCRAM(ASTASH.BRD,BOARD)\t!Unpack into the work BOARD.\n             LZ = INDEX(BOAR,CHAR(0))\t!Find the BOARD square with zero.\n             ZR =    (LZ - 1)/NC + 1\t!Convert to row and column in LOCZ to facilitate bound checking.\n             ZC = MOD(LZ - 1,NC) + 1\t!Two divisions, sigh. Add a special /\\ syntax? (ZR,ZC) = (LZ - 1)/\\NC + 1\nConsider all possible moves from position P, If a new position is unknown, add it to the stash.\n          DD:DO D = 1,4\t\t\t!Step through the possible directions in which the zero square might move.\n               IF (D.EQ.HENCE) CYCLE DD\t\t!Don't try going back whence this came.\n               LOCI = LOCZ + WAYS(1:2,D)\t!Finger the destination of the zero square, (row,column) style.\n               IF (ANY(LOCI.LE.0)) CYCLE DD\t!No wrapping left/right or top/bottom.\n               IF (ANY(LOCI.GT.(/NR,NC/))) CYCLE DD\t!No .OR. to avoid the possibility of non-shortcut full evaluation.\n               NCHECK = NCHECK + 1\t\t!So, here is another position to inspect.\n               NP = 0\t\t\t\t!No probes of stashes W or M for it have been made.\n               IT = WAY(D) + LZ\t\t\t!Finger the square that is to move to the adjacent zero.\n               BOARD(LZ) = BOARD(IT)\t\t!Move that square's content to the square holding the zero.\n               BOARD(IT) = 0\t\t\t!It having departed.\n               ASTASH.BRD(1) = BORED(1)*16 + BORED(2)\t!Pack the position list\n               ASTASH.BRD(2) = BORED(3)*16 + BORED(4)\t!Without fussing over adjacency,\n               HIT = ABS(MOD(ASTASH.BRD(1)*ASTASH.BRD(2),APRIME)) + 2\t!Crunch the hash index.\n               READ (NDX(W),REC = HIT) HEAD\t!Refer to the index, which fingers the first place to look.\n               LOOK = HEAD\t\t\t!This may be the start of a linked-list.\n               IF (LOOK.EQ.0) NINDEX(W) = NINDEX(W) + 1\t!Or, a new index entry will be made.\n               IF (LOOK.NE.0) NLOOK(1) = NLOOK(1) + 1\t!Otherwise, we're looking at a linked-list, hopefully short.\n               DO WHILE (LOOK.NE.0)\t\t!Is there a stash entry to look at?\n                 NP(1) = NP(1) + 1\t\t\t!Yes. Count a probe of the W stash.\n                 READ (WRK(W),REC = LOOK + 1) APROBE\t!Do it. (Dodging the header record)\n                 IF (ALL(ASTASH.BRD.EQ.APROBE.BRD)) GO TO 109\t!Already seen? Ignore all such as previously dealt with.\n                 LOOK = APROBE.NEXT\t\t\t!Perhaps there follows another entry having the same index.\n               END DO\t\t\t\t!And eventually, if there was no matching entry,\n               HCOUNT(W) = HCOUNT(W) + 1\t!A new entry is to be added to stash W, linked from its index.\n               IF (HCOUNT(W).LE.0) STOP \"HCOUNT overflows!\"\t!Presuming the usual two's complement style.\n               WRITE (NDX(W),REC = HIT) HCOUNT(W)\t!The index now fingers the new entry in ASTASH.\n               ASTASH.NEXT = HEAD\t\t\t!Its follower is whatever the index had fingered before.\n               ASTASH.PREV = P\t\t\t!This is the position that led to it.\n               ASTASH.MOVE = D\t\t\t!Via this move.\n               WRITE (WRK(W),REC = HCOUNT(W) + 1) ASTASH\t!Place the new entry, dodging the header.\nCheck the other stash for this new position. Perhaps there, a meeting will be found!\n               READ (NDX(M),REC = HIT) LOOK\t!The other stash uses the same hash function but has its own index.\n               IF (LOOK.NE.0) NLOOK(2) = NLOOK(2) + 1\t!Perhaps stash M has something to look at.\n               DO WHILE(LOOK.NE.0)\t\t!Somewhere along a linked-list.\n                 NP(2) = NP(2) + 1\t\t\t!A thorough look may involve multiple probes.\n                 READ(WRK(M),REC = LOOK + 1) APROBE\t!Make one.\n                 IF (ALL(ASTASH.BRD.EQ.APROBE.BRD)) THEN!A match?\n                   IF (NMET.LT.MANY) THEN\t\t\t!Yes! Hopefully, not too many already.\n                     NMET = NMET + 1\t\t\t\t\t!Count another.\n                     MET(W,NMET) = HCOUNT(W)\t\t\t\t!Save a finger to the new entry.\n                     MET(M,NMET) = LOOK\t\t\t\t\t!And to its matching counterparty.\n                    ELSE\t\t\t\t\t\t!But if too numerous for my list,\n                     WRITE (MSG,108) TIDE(W),HCOUNT(W),TIDE(M),LOOK\t!Announce each.\n  108                FORMAT (\"Can't save \",A,1X,I0,\" matching \",A,1X,I0)!Also wrecking my tabular layout.\n                   END IF\t\t\t\t\t\t!So much for recording a match.\n                   GO TO 109\t\t\t\t\t!Look no further for the new position; it is found..\n                 END IF\t\t\t\t\t!So much for a possible match.\n                 LOOK = APROBE.NEXT\t\t\t!Chase along the linked-list.\n               END DO\t\t\t\t!Thus checking all those hashing to the same index.\nCompleted the probe.\n  109          MAXP = MAX(MAXP,NP)\t\t!Track the maximum number of probes in any search..\n               PROBES = PROBES + NP\t\t!As well as their count.\n               BOARD(IT) = BOARD(LZ)\t\t!Finally, undo the move.\n               BOARD(LZ) = 0\t\t\t!To be ready for the next direction.\n             END DO DD\t\t\t!Consider another direction.\n           END DO PP\t\t!Advance P to the next spreading possibility.\nCompleted one perimeter sequence. Cast forth some statistics.\n  110      T2 = NOWWAS(0)\t!A boundary patrol has been completed.\n           E2 = NOWWAS(2)\t!And time has passed.\n           HIT = HCOUNT(W) - HNEXT + 1\t!The number of new positions to work from in the next layer.\n           WRITE (MSG,111) NCHECK,100.0*(NCHECK - HIT)/NCHECK,\t!Tested, and %already seen\n     1      NLOOK(1),MAXP(1),FLOAT(PROBES(1))/MAX(NLOOK(1),1),\t!Search statistics.\n     2      100.0*NINDEX(W)/APRIME,100.0*HCOUNT(W)/APRIME,\t!Index occupancy: used entries, and load.\n     3      NLOOK(2),MAXP(2),FLOAT(PROBES(2))/MAX(NLOOK(2),1)\t!Other stash's search statistics.\n  111      FORMAT (I11,F9.2,\"|\",I11,I6,F7.3,\"|\",F8.3,F10.3,\"|\",\t!Attempt to produce regular columns.\n     1      I11,I6,F7.3,\"|\"$)\t\t\t\t\t!To be continued...\n           T1 = T2 - T1\t\t\t!Thus, how much CPU time was used perusing the perimeter.\n           E1 = E2 - E1\t\t\t!Over the elapsed time.\n           CALL PROUST(T1)\t\t!Muse over the elapsed CPU time, in seconds.\n           CALL PROUST(E1)\t\t!And likewise the elapsed clock time.\n           E2 = NOWWAS(1)\t\t!Civil clock, possibly adjusted for daylight saving.\n           IF (E1.LE.0) THEN\t\t!The offered timing may be too coarse.\n             WRITE (MSG,112) HMS(E2)\t\t!So, just finish the line.\n  112        FORMAT (8X,A)\t\t\t!With a time of day.\n            ELSE\t\t\t!But if some (positive) clock time was measured as elapsing,\n             WRITE (MSG,113) T1/E1*100,HMS(E2)\t!Offer a ratio as well.\n  113        FORMAT (F6.2,\"%\",1X,A)\t\t!Percentages are usual.\n           END IF\t\t\t!Enough annotation.\nCould there be new positions to check? HCOUNT will have been increased if so.\n           SURGED(W) = HCOUNT(W).GE.HNEXT\t!The boundary has been extended to new positions.\n           IF (SURGED(W)) THEN\t\t!But, are there any new positions?\n             IST(W) = HNEXT\t\t\t!Yes. The first new position would have been placed here.\n             LST(W) = HCOUNT(W)\t\t\t!This is where the last position was placed.\n             SURGE(W) = SLOSH\t\t\t!The new surge is ready.\n             WRITE (WRK(W),REC = 1) HCOUNT(W),SURGE(W),IST(W),LST(W)\t!Update the headers correspondingly..\n             WRITE (NDX(W), REC = 1) NINDEX(W)\t!Otherwise, a rescan would be needed on a restart.\n           ELSE IF (SURGE(W) + 1 .EQ. SLOSH) THEN\t!No new positions. First encounter?\n             LOOK = LST(W) - IST(W) + 1\t\t!Yes. How many dead ends are there?\n             WRITE (MSG,114) LOOK\t\t!Announce.\n  114        FORMAT (/,\"The boundary has not surged to new positions!\",/\n     1       \"The now-static boundary has \",I0)\n             LOOK = LOOK/666 + 1\t\t!If there are many, don't pour forth every one.\n             IF (LOOK.GT.1) WRITE (MSG,115) LOOK!Some restraint.\n  115        FORMAT (6X,\"... Listing step: \",I0)!Rather than rolling forth a horde.\n             WRITE (MSG,121)\t\t\t!Re-use the heading for the REPORT.\n             DO P = IST(W),LST(W),LOOK\t\t!Step through the dead ends, possibly sampling every one.\n               READ (WRK(W),REC = P + 1) ASTASH\t\t!Grab a position.\n               CALL REPORT(P,TIDE(W),WNAMEF(ASTASH.MOVE),ASTASH.BRD)\t!Describe it.\n             END DO\t\t\t\t!On to the next dead end.\n           END IF\t\t\t!Perhaps the universe has been filled.\nCould the clouds have touched? If so, two trails have met.\n  120   ML:DO P = 1,NMET\t\t!Step through the meeting list.\n             IF (NS.LT.MANY) NS = NS + 1!Note another shove sequence.\n             LS(NS) = 0\t\t\t!Details to be determined.\n             WRITE (MSG,121)\t\t!Announce, via a heading.\n  121         FORMAT (/,5X,\"Record Stash Move |Board layout by row|\",\t!Various details\n     1         2X,\"Max|d|  Sum|d|   Euclidean   Encoded vs Zero\")\t!Will be attached.\n             NTRAIL = 1\t\t\t!Every trail starts with its first step.\n             TRAIL(1) = MET(2,P)\t!This is the blue trail's position that met the red tide..\n  122        READ(WRK(2),REC = TRAIL(NTRAIL) + 1) ASTASH\t!Obtain details\n             IF (ASTASH.PREV.NE.0) THEN\t!Had this step arrived from somewhere?\n               IF (NTRAIL.GE.LONG) STOP \"The trail is too long!\"\t!Yes.\n               NTRAIL = NTRAIL + 1\t\t!Count another step.\n               TRAIL(NTRAIL) = ASTASH.PREV\t!Finger the preceding step.\n               GO TO 122\t\t\t!And investigate it in turn.\n             END IF\t\t\t!Thus follow the blue trail back to its origin.\n  130        DO LOOK = NTRAIL,1,-1\t!The end of the blue trail is the position in TARGET, the start position.\n               READ(WRK(2),REC = TRAIL(LOOK) + 1) ASTASH\t!Grab a position, dodging the header.\n               CALL REPORT(TRAIL(LOOK),\"Blue\",WNAMEF(ASTASH.MOVE),\t!Backwards*backwards = forwards.\n     1          ASTASH.BRD)\t\t\t\t\t\t!The board layout is always straightforward...\n               IF (LOOK.NE.NTRAIL) THEN\t\t!The start position has no move leading to it.\n                 IF (LS(NS).LT.LEN(SHOVE(1))) LS(NS) = LS(NS) + 1\t!But count all subsequent ssociated moves.\n                 SHOVE(NS)(LS(NS):LS(NS)) = WNAMEF(ASTASH.MOVE)\t!Place it.\n               END IF\t\t\t\t!So much for that move.\n             END DO\t\t\t!On to the next move away from the start position.\n  140        HEAD = 0\t\t\t!Syncopation. Prevent the first position of the red trail from being listed.\n             LOOK = MET(1,P)\t\t!It is the same position as the first in the TRAIL, but in the primary stash.\n             DO WHILE(LOOK.NE.0)\t!The red chain runs back to its starting position, which is the \"solution\" state..\n               READ(WRK(1),REC = LOOK + 1) ASTASH\t!Which is in the direction I want to list.\n               IF (HEAD.NE.0) THEN\t\t\t!Except that the moves are one step behind for this list.\n                 CALL REPORT(LOOK,\"Red\",WNAMEZ(HEAD),ASTASH.BRD)\t!As this sequence is not being reversed.\n                 IF (LS(NS).LT.LEN(SHOVE(1))) LS(NS) = LS(NS) + 1\t!This lists the moves in forwards order.\n                 SHOVE(NS)(LS(NS):LS(NS)) = WNAMEZ(HEAD)\t!But the directions are reversed....\n               END IF\t\t\t\t!This test avoids listing the \"Red\" position that is the same as the last \"Blue\" position.\n               HEAD = ASTASH.MOVE\t\t!This is the move that led to this position.\n               LOOK = ASTASH.PREV\t\t!From the next position, which will be listed next.\n             END DO\t\t\t!Thus, the listed position was led to by the previous position's move.\n  150        DO I = 1,NS - 1\t\t!Perhaps the move sequence has been found already.\n               IF (SHOVE(I)(1:LS(I)).EQ.SHOVE(NS)(1:LS(NS))) THEN\t!So, compare agains previous shoves.\n                 WRITE (MSG,151) I\t\t\t\t!It has been seen.\n  151            FORMAT (6X,\"... same as for sequence \",I0)\t!Humm.\n                 NS = NS - 1\t\t\t\t\t!Eject the arriviste.\n                 GO TO 159\t\t\t\t\t!And carry on.\n               END IF\t\t\t\t!This shouldn't happen...\n             END DO\t\t\t!On to the next comparison.\n             WRITE (MSG,152) LS(NS),SHOVE(NS)(1:LS(NS))\t!Show the moves along a line.\n  152        FORMAT (I4,\" moves: \",A)\t!Surely plural? One-steps wouldn't be tried?\n  159      END DO ML\t\t!Perhaps another pair of snakes have met.\n         END DO WW\t!Advance W to the other one. M will be swapped correspondingly.\n\nCould there be an end to it all?\n         IF (.NOT.ANY(SURGED)) STOP \"No progress!\"\t!Oh dear.\n         IF (NMET.LE.0) GO TO 100\t\t\t!Keep right on to the end of the road...\n       END SUBROUTINE PURPLE HAZE\t!That was fun!\n      END MODULE SLIDESOLVE\n\n      PROGRAM POKE\n      USE SLIDESOLVE\n      CHARACTER*(19) FNAME\t\t!A base name for some files.\n      INTEGER I,R,C\t\t\t!Some steppers.\n      INTEGER MSG,KBD,WRK(2),NDX(2)\t!I/O unit numbers.\n      COMMON/IODEV/ MSG,KBD,WRK,NDX\t!I talk to the trees..\n      KBD = 5\t\t\t!Standard input. (Keyboard)\n      MSG = 6\t\t\t!Standard output.(Display screen)\n      WRK = (/10,12/)\t\t!I need two work files,\n      NDX = WRK + 1\t\t!Each with its associated index.\n      WRITE (FNAME,1) NR,NC\t!Now prepare the file name.\n    1 FORMAT (\"SlideSolveR\",I1,\"C\",I1,\".txt\")\t!Allowing for variation, somewhat.\n      WRITE (MSG,2) NR,NC,FNAME\t\t\t!Announce.\n    2 FORMAT (\"To play 'slide-square' with \",I0,\" rows and \",\n     1 I0,\" columns.\",/,\"An initial layout will be read from file \",\n     2 A,/,\"The objective is to attain the nice orderly layout\"\n     3 \" as follows:\",/)\n      FORALL(I = 1:N - 1) ZERO(I) = I\t!Regard the final or \"solution\" state as ZERO.\n      ZERO(N) = 0\t\t\t!The zero sqiuare is at the end, damnit!\n      CALL SHOW(NR,NC,ZERO)\t\t!Show the squares in their \"solved\" arrangement: the \"Red\" stash.\n      OPEN(WRK(1),FILE=FNAME,STATUS=\"OLD\",ACTION=\"READ\")\t!For formatted input.\n      DO R = 1,NR\t\t\t!Chug down the rows, reading successive columns across a row..\n        READ (WRK(1),*) (TARGET((R - 1)*NC + C), C = 1,NC)\t!Into successive storage locations.\n      END DO\t\t\t\t!Furrytran's storage order is (column,row) for that, alas.\n      CLOSE (WRK(1))\t\t\t!A small input, but much effort follows.\n      WRITE (MSG,3)\t\t\t!Now show the supplied layout.\n    3 FORMAT (/,\"The starting position:\")\t!The target, working backwards.\n      CALL SHOW(NR,NC,TARGET)\t\t!This will be the starting point for the \"Blue\" stash.\n      IF (ALL(TARGET.EQ.BOARD)) STOP \"Huh? They're the same!\"\t!Surely not.\n      WRITE (MSG,4)\n    4 FORMAT (/'The plan is to spread a red tide from the \"solved\" ',\n     1 \"layout and a blue tide from the specified starting position.\",/\n     2 \"The hope is that these floods will meet at some position,\",\n     3 \" and the blue moves plus the red moves in reverse order,\",/\n     4 \"will be the shortest sequence from the given starting\",\n     5 \" position to the solution.\")\n\n      CALL PURPLE HAZE(FNAME(1:14))\n\n      END\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_34.txt",
        "content": "To play 'slide-square' with 4 rows and 4 columns.\nAn initial layout will be read from file SlideSolveR4C4.txt\nThe objective is to attain the nice orderly layout as follows:\n\nRow|__1__2__3__4\n  1|  1  2  3  4\n  2|  5  6  7  8\n  3|  9 10 11 12\n  4| 13 14 15  0\n\nThe starting position:\nRow|__1__2__3__4\n  1| 15 14  1  6\n  2|  9 11  4 12\n  3|  0 10  7  3\n  4| 13  8  5  2\n\nThe plan is to spread a red tide from the \"solved\" layout and a blue tide from the specified starting position.\nThe hope is that these floods will meet at some position, and the blue moves plus the red moves in reverse order,\nwill be the shortest sequence from the given starting position to the solution.\n\nTide  Red\n Preparing a stash in file SlideSolveR4C4.123456789ABCDEF0.dat\n ... with an index in file SlideSolveR4C4.123456789ABCDEF0.ndx\n   199999991  zero values for an empty index.\n 1 2 3 4 5 6 7 8 9 A B C D E F 0 is the board layout in INTEGER*1\n 4030201 8070605 C0B0A09   F0E0D is the board layout in INTEGER*4\n        48372615        C0BFAE9D ..interleaved into two INTEGER*4\n                        EF5FA0E1 multiplied together in INTEGER*4\n                      -278945567 as a decimal integer.\nABS(MOD(-278945567,199999991)) + 2 = 78945578 is the record number for the first index entry.\n\nTide Blue\n Preparing a stash in file SlideSolveR4C4.FE169B4C0A73D852.dat\n ... with an index in file SlideSolveR4C4.FE169B4C0A73D852.ndx\n   199999991  zero values for an empty index.\n F E 1 6 9 B 4 C 0 A 7 3 D 8 5 2 is the board layout in INTEGER*1\n 6010E0F C040B09 3070A00 205080D is the board layout in INTEGER*4\n        6C14EBF9        3275A80D ..interleaved into two INTEGER*4\n                        B2B863A5 multiplied together in INTEGER*4\n                     -1296538715 as a decimal integer.\nABS(MOD(-1296538715,199999991)) + 2 = 96538771 is the record number for the first index entry.\n\n       |   Tidewrack Boundary Positions  |      Positions     |       Primary Probes         Index Use    |     Secondary Probes   | Memory of Time Passed\nSurge  |      First       Last      Count|    Checked Deja vu%|       Made Max.L  Avg.L|   Used%     Load%|       Made Max.L  Avg.L|      CPU        Clock\n 1  Red|          1          1          1|          2     0.00|          0     0  0.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.5secs  2.94%  1:07:03.093am.\n 1 Blue|          1          1          1|          3     0.00|          0     0  0.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.5secs  3.22%  1:07:03.578am.\n 2  Red|          2          3          2|          4     0.00|          0     0  0.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.0secs  0.00%  1:07:03.593am.\n 2 Blue|          2          4          3|          6     0.00|          0     0  0.000|   0.000     0.000|          0     0  0.000|    0.1secs    0.5secs 11.75%  1:07:04.125am.\n 3  Red|          4          7          4|         10     0.00|          0     0  0.000|   0.000     0.000|          0     0  0.000|    0.1secs    0.7secs 11.63%  1:07:04.812am.\n 3 Blue|          5         10          6|         14     0.00|          0     0  0.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.0secs         1:07:04.812am.\n 4  Red|          8         17         10|         24     0.00|          0     0  0.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.0secs  0.00%  1:07:04.875am.\n 4 Blue|         11         24         14|         32     0.00|          0     0  0.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.1secs  0.00%  1:07:04.953am.\n 5  Red|         18         41         24|         54     0.00|          0     0  0.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.0secs  0.00%  1:07:05.015am.\n 5 Blue|         25         56         32|         66     0.00|          0     0  0.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.0secs 50.40%  1:07:05.046am.\n 6  Red|         42         95         54|        108     0.93|          1     1  1.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.0secs 33.24%  1:07:05.093am.\n 6 Blue|         57        122         66|        136     1.47|          2     1  1.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.1secs  0.00%  1:07:05.171am.\n 7  Red|         96        202        107|        215     1.40|          3     1  1.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.1secs  0.00%  1:07:05.265am.\n 7 Blue|        123        256        134|        285     1.75|          5     1  1.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.1secs  0.00%  1:07:05.375am.\n 8  Red|        203        414        212|        456     2.19|         10     1  1.000|   0.000     0.000|          0     0  0.000|    0.0secs    0.2secs  8.36%  1:07:05.578am.\n 8 Blue|        257        536        280|        601     2.66|         16     1  1.000|   0.001     0.001|          0     0  0.000|    0.0secs    0.2secs 20.03%  1:07:05.812am.\n 9  Red|        415        860        446|        974     2.87|         28     1  1.000|   0.001     0.001|          0     0  0.000|    0.2secs    0.5secs 37.50%  1:07:06.312am.\n 9 Blue|        537       1121        585|       1254     3.19|         41     1  1.000|   0.001     0.001|          0     0  0.000|    0.2secs    0.5secs 34.38%  1:07:06.812am.\n10  Red|        861       1806        946|       2032     4.13|         88     1  1.000|   0.002     0.002|          0     0  0.000|    0.3secs    0.9secs 37.28%  1:07:07.734am.\n10 Blue|       1122       2335       1214|       2578     4.50|        117     1  1.000|   0.002     0.002|          0     0  0.000|    0.3secs    1.1secs 25.00%  1:07:08.859am.\n11  Red|       1807       3754       1948|       4124     4.51|        189     1  1.000|   0.004     0.004|          0     0  0.000|    0.5secs    1.8secs 29.66%  1:07:10.703am.\n11 Blue|       2336       4797       2462|       5188     4.66|        249     1  1.000|   0.005     0.005|          0     0  0.000|    0.6secs    2.2secs 27.54%  1:07:12.859am.\n12  Red|       3755       7692       3938|       8244     5.29|        440     1  1.000|   0.008     0.008|          0     0  0.000|    1.0secs    3.6secs 28.51%  1:07:16.421am.\n12 Blue|       4798       9743       4946|      10442     5.56|        588     1  1.000|   0.010     0.010|          1     1  1.000|    1.6secs    4.2secs 38.20%  1:07:20.593am.\n13  Red|       7693      15500       7808|      16470     5.62|        943     1  1.000|   0.016     0.016|          0     0  0.000|    2.2secs    6.5secs 33.65%  1:07:27.093am.\n13 Blue|       9744      19604       9861|      20858     6.03|       1285     2  1.001|   0.020     0.020|          4     1  1.000|    2.8secs    7.5secs 37.00%  1:07:34.625am.\n14  Red|      15501      31044      15544|      32950     6.46|       2175     2  1.000|   0.031     0.031|          5     1  1.000|    3.8secs   11.2secs 34.12%  1:07:45.843am.\n14 Blue|      19605      39204      19600|      41448     6.66|       2813     2  1.001|   0.039     0.039|         14     1  1.000|    4.6secs   12.7secs 36.19%  1:07:58.578am.\n15  Red|      31045      61865      30821|      65311     6.84|       4611     2  1.001|   0.061     0.061|         23     1  1.000|    6.8secs   17.2secs 39.62%  1:08:15.734am.\n15 Blue|      39205      77892      38688|      81703     6.87|       5803     2  1.000|   0.077     0.077|         47     1  1.000|    7.2secs   18.2secs 39.64%  1:08:33.906am.\n16  Red|      61866     122707      60842|     128412     7.33|       9742     2  1.002|   0.121     0.121|         77     2  1.013|   11.9secs   23.2secs 51.21%  1:08:57.093am.\n16 Blue|      77893     153978      76086|     160446     7.49|      12421     2  1.001|   0.151     0.151|        172     1  1.000|   13.6secs   23.2secs 58.57%  1:09:20.250am.\n17  Red|     122708     241707     119000|     250818     7.56|      20063     3  1.002|   0.236     0.237|        303     1  1.000|   20.5secs   30.5secs 67.33%  1:09:50.765am.\n17 Blue|     153979     302413     148435|     312766     7.89|      26220     2  1.002|   0.294     0.295|        678     2  1.001|   24.3secs   32.3secs 75.17%  1:10:23.109am.\n18  Red|     241708     473551     231844|     487982     8.33|      43582     3  1.003|   0.458     0.460|       1229     2  1.002|   38.0secs   46.2secs 82.36%  1:11:09.265am.\n18 Blue|     302414     590511     288098|     606919     8.56|      56018     3  1.003|   0.570     0.573|       2440     2  1.004|   47.5secs   59.4secs 80.02%  1:12:08.687am.\n19  Red|     473552     920893     447342|     942552     8.79|      93152     3  1.005|   0.883     0.890|       4672     2  1.005|   73.1secs   91.3secs 80.07%  1:13:40.046am.\n19 Blue|     590512    1145481     554970|    1168265     9.04|     120435     3  1.006|   1.093     1.104|       8999     3  1.009|   90.6secs    1.9mins 81.12%  1:15:31.765am.\n20  Red|     920894    1780637     859744|    1809752     9.52|     202081     3  1.007|   1.687     1.709|      17194     2  1.008|    2.4mins    3.0mins 79.31%  1:18:30.265am.\n20 Blue|    1145482    2208109    1062628|    2235235     9.77|     262047     3  1.008|   2.080     2.112|      33025     3  1.014|    3.0mins    3.7mins 79.82%  1:22:14.375am.\n21  Red|    1780638    3418020    1637383|    3444691    10.06|     451483     4  1.014|   3.183     3.258|      62538     3  1.015|    4.5mins    5.7mins 79.80%  1:27:56.468am.\n21 Blue|    2208110    4224923    2016814|    4238343    10.33|     588823     4  1.017|   3.905     4.013|     118609     5  1.024|    5.7mins    7.1mins 80.08%  1:35:03.140am.\n22  Red|    3418021    6516290    3098270|    6506982    10.83|    1022051     4  1.023|   5.926     6.159|     219923     4  1.025|    8.7mins   10.7mins 81.12%  1:45:44.328am.\n22 Blue|    4224924    8025605    3800682|    7979315    11.11|    1353159     5  1.029|   7.218     7.559|     414055     4  1.039|   10.9mins   13.8mins 79.04%  1:59:31.875am.\n23  Red|    6516291   12318701    5802411|   12178635    11.45|    2470087     6  1.048|  10.780    11.551|     765853     5  1.046|   17.3mins   24.1mins 71.78%  2:23:35.828am.\n23 Blue|    8025606   15118814    7093209|   14877107    11.76|    3307729     5  1.058|  13.003    14.123|    1401940     6  1.071|   22.4mins   35.3mins 63.46%  2:58:53.375am.\n24  Red|   12318702   23102481   10783780|   22603192    12.29|    6014769     6  1.083|  19.074    21.464|    2526552     6  1.084|   36.7mins   65.6mins 55.95%  4:04:29.375am.\n24 Blue|   15118815   28246178   13127364|   27507742    12.56|    8148893     7  1.105|  22.682    26.150|    4539588     7  1.124|   49.4mins   96.5mins 51.22%  5:40:59.265am.\n25  Red|   23102482   42928799   19826318|   41532426    12.98|   15508438     9  1.166|  32.086    39.535|    8144188     7  1.151|   84.5mins    3.0hrs! 47.06%  8:40:25.296am.\n25 Blue|   28246179   52299632   24053454|   50352435    13.30|   21007872     9  1.207|  37.354    47.979|   13961187     8  1.232|    2.0hrs!    4.4hrs! 44.40%  1:07:12.546pm.\n26  Red|   42928800   79070945   36142146|   75611538    13.85|   38688179    10  1.300|  50.548    72.103|   24060624     9  1.278|    3.5hrs!    8.3hrs! 42.77%  9:23:03.250pm.\n26 Blue|   52299633   95957208   43657576|   91305518    14.15|   51817830    14  1.379|  57.098    87.170|   39429635    10  1.424|    5.3hrs!   12.5hrs! 42.37%  9:53:57.890am.\n\n     Record Stash Move |Board layout by row|  Max|d|  Sum|d|   Euclidean   Encoded vs Zero\n          1  Blue      |FE16/9B4C/0A73/D852|      14      86      27.055    19442940853367\n          2  Blue    L |FE16/9B4C/A073/D852|      14      88      27.423    19442940844007\n          5  Blue    L |FE16/9B4C/A703/D852|      14      88      27.677    19442940842087\n         11  Blue    L |FE16/9B4C/A730/D852|      14      88      27.785    19442940841679\n         25  Blue    D |FE16/9B40/A73C/D852|      14      80      26.000    19442940922295\n         58  Blue    R |FE16/9B04/A73C/D852|      14      80      25.846    19442943220535\n        126  Blue    U |FE16/9B34/A70C/D852|      14      80      26.306    19442940271895\n        265  Blue    R |FE16/9B34/A07C/D852|      14      80      26.038    19442940274415\n        554  Blue    D |FE16/9034/AB7C/D852|      14      72      24.290    19442951159375\n       1156  Blue    D |F016/9E34/AB7C/D852|      14      64      21.863    19530129450575\n       2409  Blue    R |0F16/9E34/AB7C/D852|      13      62      21.166    20837803818575\n       4949  Blue    U |9F16/0E34/AB7C/D852|      13      70      22.804    11597104535375\n      10052  Blue    L |9F16/E034/AB7C/D852|      13      72      23.409    11597064618575\n      20229  Blue    D |9016/EF34/AB7C/D852|      10      64      20.688    11684242909775\n      40459  Blue    L |9106/EF34/AB7C/D852|      10      64      20.736    10544698103375\n      80368  Blue    U |9136/EF04/AB7C/D852|      10      64      21.307    10469454209615\n     158888  Blue    U |9136/EF74/AB0C/D852|      11      64      22.583    10469452026935\n     312029  Blue    U |9136/EF74/AB5C/D802|      15      64      23.452    10469452026423\n     609335  Blue    R |9136/EF74/AB5C/D082|      14      64      23.108    10469452026425\n    1182001  Blue    D |9136/EF74/A05C/DB82|      10      62      21.119    10469452028615\n    2278389  Blue    D |9136/E074/AF5C/DB82|       9      54      18.055    10469455657415\n    4359103  Blue    R |9136/0E74/AF5C/DB82|       8      52      17.263    10469531862215\n    8279825  Blue    D |0136/9E74/AF5C/DB82|       8      44      15.033    19623012937415\n   15596324  Blue    L |1036/9E74/AF5C/DB82|       8      44      15.100     1228393494215\n   29135380  Blue    L |1306/9E74/AF5C/DB82|       8      46      15.297      169799958215\n   53940860  Blue    L |1360/9E74/AF5C/DB82|       8      48      15.684      111840764615\n   98956855  Blue    U |1364/9E70/AF5C/DB82|       8      48      16.673      106528120775\n   47181586   Red    R |1364/9E07/AF5C/DB82|       8      48      16.248      106530419015\n   25400927   Red    U |1364/9E57/AF0C/DB82|      11      48      17.436      106527470375\n   13548279   Red    U |1364/9E57/AF8C/DB02|      15      48      19.183      106527469863\n    7168799   Red    L |1364/9E57/AF8C/DB20|      13      44      17.550      106527469862\n    3761169   Red    D |1364/9E57/AF80/DB2C|      13      68      24.413      106527469916\n    1959965   Red    R |1364/9E57/AF08/DB2C|      13      68      24.083      106527470324\n    1013648   Red    U |1364/9E57/AF28/DB0C|      15      68      24.413      106527469693\n     521247   Red    R |1364/9E57/AF28/D0BC|      14      68      23.958      106527469696\n     266034   Red    D |1364/9E57/A028/DFBC|      12      60      21.307      106527470416\n     135063   Red    D |1364/9057/AE28/DFBC|      12      52      18.493      106534727296\n      68120   Red    L |1364/9507/AE28/DFBC|      12      52      18.762      106504971136\n      34188   Red    U |1364/9527/AE08/DFBC|      12      52      19.183      106501659736\n      17049   Red    U |1364/9527/AEB8/DF0C|      15      52      21.354      106501659249\n       8443   Red    R |1364/9527/AEB8/D0FC|      14      50      20.640      106501659251\n       4119   Red    D |1364/9527/A0B8/DEFC|      12      42      17.720      106501660689\n       1986   Red    R |1364/9527/0AB8/DEFC|      12      40      17.146      106501687329\n        950   Red    D |1364/0527/9AB8/DEFC|      12      32      14.900      106781074689\n        458   Red    L |1364/5027/9AB8/DEFC|      12      32      15.232      106414565889\n        222   Red    L |1364/5207/9AB8/DEFC|      12      32      15.362      106381543809\n        104   Red    D |1304/5267/9AB8/DEFC|      12      26      13.711      168648485889\n         46   Red    R |1034/5267/9AB8/DEFC|      12      24      13.491     1227242021889\n         20   Red    U |1234/5067/9AB8/DEFC|      12      24      14.071          36293889\n          9   Red    L |1234/5607/9AB8/DEFC|      12      24      14.491           3271809\n          4   Red    L |1234/5670/9AB8/DEFC|      12      24      14.967            328449\n          2   Red    U |1234/5678/9AB0/DEFC|      12      24      16.971               105\n          1   Red    U |1234/5678/9ABC/DEF0|       0       0       0.000                 0\n  52 moves: LLLDRURDDRULDLUUURDDRDLLLURUULDRURDDLUURDRDLLDRULLUU\n\n     Record Stash Move |Board layout by row|  Max|d|  Sum|d|   Euclidean   Encoded vs Zero\n          1  Blue      |FE16/9B4C/0A73/D852|      14      86      27.055    19442940853367\n          2  Blue    L |FE16/9B4C/A073/D852|      14      88      27.423    19442940844007\n          5  Blue    L |FE16/9B4C/A703/D852|      14      88      27.677    19442940842087\n         11  Blue    L |FE16/9B4C/A730/D852|      14      88      27.785    19442940841679\n         25  Blue    D |FE16/9B40/A73C/D852|      14      80      26.000    19442940922295\n         58  Blue    R |FE16/9B04/A73C/D852|      14      80      25.846    19442943220535\n        126  Blue    U |FE16/9B34/A70C/D852|      14      80      26.306    19442940271895\n        266  Blue    U |FE16/9B34/A75C/D802|      15      80      27.055    19442940271383\n        558  Blue    R |FE16/9B34/A75C/D082|      14      80      26.758    19442940271385\n       1163  Blue    D |FE16/9B34/A05C/D782|      14      80      25.690    19442940274293\n       2420  Blue    D |FE16/9034/AB5C/D782|      14      72      23.917    19442951159253\n       4967  Blue    D |F016/9E34/AB5C/D782|      14      64      21.448    19530129450453\n      10090  Blue    R |0F16/9E34/AB5C/D782|      13      62      20.736    20837803818453\n      20306  Blue    U |9F16/0E34/AB5C/D782|      13      70      22.405    11597104535253\n      40605  Blue    L |9F16/E034/AB5C/D782|      13      72      23.022    11597064618453\n      80644  Blue    D |9016/EF34/AB5C/D782|       9      64      20.248    11684242909653\n     159412  Blue    L |9106/EF34/AB5C/D782|       9      64      20.298    10544698103253\n     313039  Blue    U |9136/EF04/AB5C/D782|       9      64      20.881    10469454209493\n     611272  Blue    U |9136/EF54/AB0C/D782|      11      64      21.817    10469451664053\n    1185720  Blue    U |9136/EF54/AB8C/D702|      15      64      23.238    10469451663663\n    2285440  Blue    L |9136/EF54/AB8C/D720|      13      60      21.909    10469451663662\n    4372401  Blue    D |9136/EF54/AB80/D72C|      13      84      27.713    10469451663716\n    8304687  Blue    R |9136/EF54/AB08/D72C|      13      84      27.423    10469451664028\n   15642421  Blue    R |9136/EF54/A0B8/D72C|      13      82      27.019    10469451665948\n   29220003  Blue    D |9136/E054/AFB8/D72C|      13      74      24.698    10469455294748\n   54094941  Blue    R |9136/0E54/AFB8/D72C|      13      72      24.125    10469531499548\n   99233939  Blue    D |0136/9E54/AFB8/D72C|      13      64      22.583    19623012574748\n   53847416   Red    L |1036/9E54/AFB8/D72C|      13      64      22.627     1228393131548\n   29052034   Red    L |1306/9E54/AFB8/D72C|      13      66      22.760      169799595548\n   15525093   Red    L |1360/9E54/AFB8/D72C|      13      68      23.022      111840401948\n    8231956   Red    U |1364/9E50/AFB8/D72C|      13      68      23.707      106527758108\n    4326107   Red    U |1364/9E58/AFB0/D72C|      13      68      25.020      106527510356\n    2258614   Red    R |1364/9E58/AF0B/D72C|      13      68      24.576      106527510668\n    1169712   Red    U |1364/9E58/AF2B/D70C|      15      68      24.900      106527510037\n     602597   Red    R |1364/9E58/AF2B/D07C|      14      68      24.617      106527510040\n     308014   Red    D |1364/9E58/A02B/DF7C|      12      60      22.045      106527510760\n     156652   Red    D |1364/9058/AE2B/DF7C|      12      52      19.339      106534767640\n      79080   Red    L |1364/9508/AE2B/DF7C|      12      52      19.596      106505011480\n      39747   Red    U |1364/9528/AE0B/DF7C|      12      52      20.000      106501700080\n      19843   Red    U |1364/9528/AE7B/DF0C|      15      52      21.354      106501699449\n       9866   Red    R |1364/9528/AE7B/D0FC|      14      50      20.640      106501699451\n       4832   Red    D |1364/9528/A07B/DEFC|      12      42      17.720      106501700889\n       2335   Red    R |1364/9528/0A7B/DEFC|      12      40      17.146      106501727529\n       1114   Red    D |1364/0528/9A7B/DEFC|      12      32      14.900      106781114889\n        534   Red    L |1364/5028/9A7B/DEFC|      12      32      15.232      106414606089\n        259   Red    L |1364/5208/9A7B/DEFC|      12      32      15.362      106381584009\n        124   Red    D |1304/5268/9A7B/DEFC|      12      26      13.711      168648526089\n         56   Red    R |1034/5268/9A7B/DEFC|      12      24      13.491     1227242062089\n         24   Red    U |1234/5068/9A7B/DEFC|      12      24      14.071          36334089\n         10   Red    L |1234/5608/9A7B/DEFC|      12      24      14.491           3312009\n          5   Red    U |1234/5678/9A0B/DEFC|      12      24      16.310               609\n          2   Red    L |1234/5678/9AB0/DEFC|      12      24      16.971               105\n          1   Red    U |1234/5678/9ABC/DEF0|       0       0       0.000                 0\n  52 moves: LLLDRUURDDDRULDLUUULDRRDRDLLLUURURDDLUURDRDLLDRULULU\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_35.txt",
        "content": "To play 'slide-square' with 4 rows and 4 columns.\nAn initial layout will be read from file SlideSolveR4C4.txt\nThe objective is to attain the nice orderly layout as follows:\n\nRow|__1__2__3__4\n  1|  1  2  3  4\n  2|  5  6  7  8\n  3|  9 10 11 12\n  4| 13 14 15  0\n\nThe starting position:\nRow|__1__2__3__4\n  1| 13 10 11  6\n  2|  5  3  1  4\n  3|  8  0 12  2\n  4| 14  7  9 15\n\nThe plan is to spread a red tide from the \"solved\" layout and a blue tide from the specified starting position.\nThe hope is that these floods will meet at some position, and the blue moves plus the red moves in reverse order,\nwill be the shortest sequence from the given starting position to the solution.\n\nTide  Red\n Restarting from file SlideSolveR4C4.123456789ABCDEF0.dat\n Stashed 144206568. At surge 26 with the boundary stashed in elements 79070946 to 144206568\n Its index uses 101095844 of 199999991 entries.\n\nTide Blue\n Preparing a stash in file SlideSolveR4C4.DAB6531480C2E79F.dat\n ... with an index in file SlideSolveR4C4.DAB6531480C2E79F.ndx\n   199999991  zero values for an empty index.\n D A B 6 5 3 1 4 8 0 C 2 E 7 9 F is the board layout in INTEGER*1\n 60B0A0D 4010305 20C0008 F09070E is the board layout in INTEGER*4\n        64B1A3D5        2FC9078E ..interleaved into two INTEGER*4\n                        7340B326 multiplied together in INTEGER*4\n                      1933620006 as a decimal integer.\nABS(MOD(1933620006,199999991)) + 2 = 133620089 is the record number for the first index entry.\n\n       |   Tidewrack Boundary Positions  |      Positions     |       Primary Probes         Index Use    |     Secondary Probes   | Memory of Time Passed\nSurge  |      First       Last      Count|    Checked Deja vu%|       Made Max.L  Avg.L|   Used%     Load%|       Made Max.L  Avg.L|      CPU        Clock\n 1 Blue|          1          1          1|          4     0.00|          0     0  0.000|   0.000     0.000|          2     1  1.000|    0.0secs    0.0secs  0.00%  9:27:19.468am.\n 2 Blue|          2          5          4|         10     0.00|          0     0  0.000|   0.000     0.000|          4     2  1.500|    0.0secs    0.5secs  3.33%  9:27:19.937am.\n 3 Blue|          6         15         10|         20     0.00|          0     0  0.000|   0.000     0.000|          5     2  1.400|    0.0secs    0.4secs  0.00%  9:27:20.296am.\n 4 Blue|         16         35         20|         38     0.00|          0     0  0.000|   0.000     0.000|         16     3  1.250|    0.0secs    0.3secs 11.75%  9:27:20.562am.\n 5 Blue|         36         73         38|         80     0.00|          0     0  0.000|   0.000     0.000|         39     4  1.385|    0.0secs    0.1secs  0.00%  9:27:20.625am.\n 6 Blue|         74        153         80|        178     2.25|          4     1  1.000|   0.000     0.000|         87     4  1.379|    0.0secs    0.1secs  0.00%  9:27:20.750am.\n 7 Blue|        154        327        174|        380     2.11|          8     1  1.000|   0.000     0.000|        186     5  1.500|    0.2secs    0.3secs 52.79%  9:27:21.046am.\n 8 Blue|        328        699        372|        790     3.54|         28     1  1.000|   0.001     0.001|        386     5  1.448|    0.2secs    0.4secs 53.51%  9:27:21.484am.\n 9 Blue|        700       1461        762|       1590     3.14|         50     1  1.000|   0.002     0.002|        738     6  1.407|    0.3secs    0.9secs 37.50%  9:27:22.375am.\n10 Blue|       1462       3001       1540|       3234     5.01|        168     1  1.000|   0.003     0.003|       1542     6  1.396|    0.6secs    2.0secs 29.60%  9:27:24.328am.\n11 Blue|       3002       6073       3072|       6512     4.85|        318     1  1.000|   0.006     0.006|       3032     5  1.398|    1.2secs    3.9secs 30.77%  9:27:28.187am.\n12 Blue|       6074      12269       6196|      13182     6.27|        841     2  1.001|   0.012     0.012|       6007     6  1.406|    2.5secs    7.5secs 33.96%  9:27:35.687am.\n13 Blue|      12270      24625      12356|      26134     6.19|       1648     2  1.001|   0.025     0.025|      12261     6  1.410|    5.0secs   15.6secs 32.23%  9:27:51.296am.\n14 Blue|      24626      49141      24516|      51646     6.71|       3581     2  1.000|   0.049     0.049|      23554     6  1.395|    9.2secs   24.8secs 37.14%  9:28:16.078am.\n15 Blue|      49142      97320      48179|     101393     6.94|       7301     2  1.000|   0.096     0.096|      46888     7  1.411|   15.8secs   41.9secs 37.71%  9:28:58.031am.\n16 Blue|      97321     191676      94356|     198950     7.80|      16489     2  1.002|   0.187     0.188|      89521     7  1.399|   27.3secs   62.8secs 43.45%  9:30:00.781am.\n17 Blue|     191677     375108     183432|     386686     8.11|      33604     2  1.003|   0.363     0.365|     177033     8  1.418|   52.7secs    1.9mins 45.48%  9:31:56.734am.\n18 Blue|     375109     730438     355330|     748406     8.84|      74407     3  1.005|   0.700     0.706|     333730     7  1.405|   96.8secs    3.7mins 43.38%  9:35:39.812am.\n19 Blue|     730439    1412688     682250|    1434890     9.27|     154921     4  1.007|   1.340     1.357|     649155     8  1.416|    3.2mins    7.1mins 44.60%  9:42:44.031am.\n\n     Record Stash Move |Board layout by row|  Max|d|  Sum|d|   Euclidean   Encoded vs Zero\n          1  Blue      |DAB6/5314/80C2/E79F|      15      94      29.155    16535302211892\n          4  Blue    R |DAB6/5314/08C2/E79F|      15      94      28.879    16535302234212\n         12  Blue    D |DAB6/0314/58C2/E79F|      15      94      28.178    16535581621572\n         30  Blue    L |DAB6/3014/58C2/E79F|      15      94      28.284    16535251400772\n         62  Blue    L |DAB6/3104/58C2/E79F|      15      94      28.320    16535218378692\n        125  Blue    D |DA06/31B4/58C2/E79F|      15      86      26.721    16560125373252\n        266  Blue    R |D0A6/31B4/58C2/E79F|      15      84      26.344    16971108746052\n        568  Blue    R |0DA6/31B4/58C2/E79F|      15      82      25.846    20719775267652\n       1203  Blue    U |3DA6/01B4/58C2/E79F|      15      86      26.306     3626483421252\n       2480  Blue    L |3DA6/10B4/58C2/E79F|      15      86      26.344     3626080624452\n       5044  Blue    D |30A6/1DB4/58C2/E79F|      15      78      24.290     3887608240452\n      10136  Blue    L |3A06/1DB4/58C2/E79F|      15      80      24.698     3395673597252\n      20466  Blue    L |3A60/1DB4/58C2/E79F|      15      82      24.940     3343462422852\n      40817  Blue    U |3A64/1DB0/58C2/E79F|      15      82      25.573     3338668697412\n      81229  Blue    U |3A64/1DB2/58C0/E79F|      15      82      25.884     3338668369068\n     160022  Blue    R |3A64/1DB2/580C/E79F|      15      80      25.417     3338668369380\n     314204  Blue    R |3A64/1DB2/508C/E79F|      15      80      25.100     3338668372500\n     612120  Blue    D |3A64/10B2/5D8C/E79F|      15      72      22.935     3338679257460\n    1187839  Blue    D |3064/1AB2/5D8C/E79F|      15      64      21.119     3861730860660\n    2285373  Blue    R |0364/1AB2/5D8C/E79F|      15      62      20.976    19815358150260\n   53888966   Red    U |1364/0AB2/5D8C/E79F|      15      62      21.166      106797401460\n   29074972   Red    U |1364/5AB2/0D8C/E79F|      15      62      22.091      106394277060\n   15537643   Red    L |1364/5AB2/D08C/E79F|      15      64      22.672      106394263380\n    8238754   Red    U |1364/5AB2/D78C/E09F|      15      64      23.875      106394258914\n    4329748   Red    L |1364/5AB2/D78C/E90F|      15      64      24.249      106394258911\n    2260520   Red    L |1364/5AB2/D78C/E9F0|       6      34      11.747      106394258910\n    1170710   Red    D |1364/5AB2/D780/E9FC|      12      58      20.640      106394258989\n     603117   Red    R |1364/5AB2/D708/E9FC|      12      58      20.248      106394259493\n     308288   Red    D |1364/5A02/D7B8/E9FC|      12      50      17.944      106396078573\n     156795   Red    L |1364/5A20/D7B8/E9FC|      12      50      18.055      106393135213\n      79148   Red    U |1364/5A28/D7B0/E9FC|      12      50      19.748      106392847909\n      39781   Red    R |1364/5A28/D70B/E9FC|      12      50      19.183      106392848317\n      19862   Red    R |1364/5A28/D07B/E9FC|      12      50      18.815      106392852037\n       9877   Red    U |1364/5A28/D97B/E0FC|      14      50      20.640      106392848411\n       4838   Red    R |1364/5A28/D97B/0EFC|      13      48      19.950      106392848421\n       2337   Red    D |1364/5A28/097B/DEFC|      12      40      17.146      106392863529\n       1115   Red    L |1364/5A28/907B/DEFC|      12      40      17.664      106392836889\n        534   Red    D |1364/5028/9A7B/DEFC|      12      32      15.232      106414606089\n        259   Red    L |1364/5208/9A7B/DEFC|      12      32      15.362      106381584009\n        124   Red    D |1304/5268/9A7B/DEFC|      12      26      13.711      168648526089\n         56   Red    R |1034/5268/9A7B/DEFC|      12      24      13.491     1227242062089\n         24   Red    U |1234/5068/9A7B/DEFC|      12      24      14.071          36334089\n         10   Red    L |1234/5608/9A7B/DEFC|      12      24      14.491           3312009\n          5   Red    U |1234/5678/9A0B/DEFC|      12      24      16.310               609\n          2   Red    L |1234/5678/9AB0/DEFC|      12      24      16.971               105\n          1   Red    U |1234/5678/9ABC/DEF0|       0       0       0.000                 0\n  45 moves: RDLLDRRULDLLUURRDDRUULULLDRDLURRURDLDLDRULULU\n\n     Record Stash Move |Board layout by row|  Max|d|  Sum|d|   Euclidean   Encoded vs Zero\n          1  Blue      |DAB6/5314/80C2/E79F|      15      94      29.155    16535302211892\n          4  Blue    R |DAB6/5314/08C2/E79F|      15      94      28.879    16535302234212\n         12  Blue    D |DAB6/0314/58C2/E79F|      15      94      28.178    16535581621572\n         30  Blue    L |DAB6/3014/58C2/E79F|      15      94      28.284    16535251400772\n         62  Blue    L |DAB6/3104/58C2/E79F|      15      94      28.320    16535218378692\n        125  Blue    D |DA06/31B4/58C2/E79F|      15      86      26.721    16560125373252\n        266  Blue    R |D0A6/31B4/58C2/E79F|      15      84      26.344    16971108746052\n        568  Blue    R |0DA6/31B4/58C2/E79F|      15      82      25.846    20719775267652\n       1203  Blue    U |3DA6/01B4/58C2/E79F|      15      86      26.306     3626483421252\n       2480  Blue    L |3DA6/10B4/58C2/E79F|      15      86      26.344     3626080624452\n       5044  Blue    D |30A6/1DB4/58C2/E79F|      15      78      24.290     3887608240452\n      10136  Blue    L |3A06/1DB4/58C2/E79F|      15      80      24.698     3395673597252\n      20466  Blue    L |3A60/1DB4/58C2/E79F|      15      82      24.940     3343462422852\n      40817  Blue    U |3A64/1DB0/58C2/E79F|      15      82      25.573     3338668697412\n      81229  Blue    U |3A64/1DB2/58C0/E79F|      15      82      25.884     3338668369068\n     160022  Blue    R |3A64/1DB2/580C/E79F|      15      80      25.417     3338668369380\n     314204  Blue    R |3A64/1DB2/508C/E79F|      15      80      25.100     3338668372500\n     612122  Blue    U |3A64/1DB2/578C/E09F|      15      80      26.192     3338668368034\n    1187843  Blue    L |3A64/1DB2/578C/E90F|      15      80      26.533     3338668368031\n    2285379  Blue    L |3A64/1DB2/578C/E9F0|       8      50      15.937     3338668368030\n   53890406   Red    D |3A64/1DB2/5780/E9FC|      12      74      23.281     3338668368109\n   29075781   Red    R |3A64/1DB2/5708/E9FC|      12      74      22.935     3338668368613\n   15538085   Red    D |3A64/1D02/57B8/E9FC|      12      66      20.928     3338669819773\n    8239002   Red    L |3A64/1D20/57B8/E9FC|      12      66      21.024     3338666876413\n    4329887   Red    U |3A64/1D28/57B0/E9FC|      12      66      22.494     3338666634469\n    2260599   Red    R |3A64/1D28/570B/E9FC|      12      66      22.000     3338666634877\n    1170753   Red    R |3A64/1D28/507B/E9FC|      12      66      21.679     3338666638597\n     603141   Red    D |3A64/1028/5D7B/E9FC|      12      58      19.131     3338677523557\n     308302   Red    D |3064/1A28/5D7B/E9FC|      12      50      16.912     3861729126757\n     156805   Red    R |0364/1A28/5D7B/E9FC|      12      48      16.733    19815356416357\n      79152   Red    U |1364/0A28/5D7B/E9FC|      12      48      16.971      106795667557\n      39783   Red    U |1364/5A28/0D7B/E9FC|      12      48      18.111      106392865717\n      19862   Red    L |1364/5A28/D07B/E9FC|      12      50      18.815      106392852037\n       9877   Red    U |1364/5A28/D97B/E0FC|      14      50      20.640      106392848411\n       4838   Red    R |1364/5A28/D97B/0EFC|      13      48      19.950      106392848421\n       2337   Red    D |1364/5A28/097B/DEFC|      12      40      17.146      106392863529\n       1115   Red    L |1364/5A28/907B/DEFC|      12      40      17.664      106392836889\n        534   Red    D |1364/5028/9A7B/DEFC|      12      32      15.232      106414606089\n        259   Red    L |1364/5208/9A7B/DEFC|      12      32      15.362      106381584009\n        124   Red    D |1304/5268/9A7B/DEFC|      12      26      13.711      168648526089\n         56   Red    R |1034/5268/9A7B/DEFC|      12      24      13.491     1227242062089\n         24   Red    U |1234/5068/9A7B/DEFC|      12      24      14.071          36334089\n         10   Red    L |1234/5608/9A7B/DEFC|      12      24      14.491           3312009\n          5   Red    U |1234/5678/9A0B/DEFC|      12      24      16.310               609\n          2   Red    L |1234/5678/9AB0/DEFC|      12      24      16.971               105\n          1   Red    U |1234/5678/9ABC/DEF0|       0       0       0.000                 0\n  45 moves: RDLLDRRULDLLUURRULLDRDLURRDDRUULURDLDLDRULULU\n\n     Record Stash Move |Board layout by row|  Max|d|  Sum|d|   Euclidean   Encoded vs Zero\n          1  Blue      |DAB6/5314/80C2/E79F|      15      94      29.155    16535302211892\n          4  Blue    R |DAB6/5314/08C2/E79F|      15      94      28.879    16535302234212\n         12  Blue    D |DAB6/0314/58C2/E79F|      15      94      28.178    16535581621572\n         31  Blue    D |0AB6/D314/58C2/E79F|      15      86      26.268    20458524891972\n         65  Blue    L |A0B6/D314/58C2/E79F|      15      88      26.646    13048370139972\n        133  Blue    U |A3B6/D014/58C2/E79F|      15      90      27.092    11995513736772\n        281  Blue    L |A3B6/D104/58C2/E79F|      15      90      27.129    11995480714692\n        599  Blue    D |A306/D1B4/58C2/E79F|      15      82      25.456    12026654646852\n       1266  Blue    R |A036/D1B4/58C2/E79F|      15      80      25.338    13004296912452\n       2610  Blue    U |A136/D0B4/58C2/E79F|      15      80      25.495    11777091184452\n       5305  Blue    R |A136/0DB4/58C2/E79F|      15      78      24.980    11777203677252\n      10671  Blue    D |0136/ADB4/58C2/E79F|      15      70      23.324    19623050301252\n      21525  Blue    L |1036/ADB4/58C2/E79F|      15      70      23.367     1228430858052\n      42928  Blue    L |1306/ADB4/58C2/E79F|      15      72      23.495      169837322052\n      85377  Blue    L |1360/ADB4/58C2/E79F|      15      74      23.749      111878128452\n     168152  Blue    U |1364/ADB0/58C2/E79F|      15      74      24.413      106565484612\n     329996  Blue    U |1364/ADB2/58C0/E79F|      15      74      24.739      106565156268\n     642726  Blue    R |1364/ADB2/580C/E79F|      15      72      24.249      106565156580\n    1246294  Blue    R |1364/ADB2/508C/E79F|      15      72      23.917      106565159700\n    2396768  Blue    D |1364/A0B2/5D8C/E79F|      15      64      21.633      106576044660\n   53888966   Red    R |1364/0AB2/5D8C/E79F|      15      62      21.166      106797401460\n   29074972   Red    U |1364/5AB2/0D8C/E79F|      15      62      22.091      106394277060\n   15537643   Red    L |1364/5AB2/D08C/E79F|      15      64      22.672      106394263380\n    8238754   Red    U |1364/5AB2/D78C/E09F|      15      64      23.875      106394258914\n    4329748   Red    L |1364/5AB2/D78C/E90F|      15      64      24.249      106394258911\n    2260520   Red    L |1364/5AB2/D78C/E9F0|       6      34      11.747      106394258910\n    1170710   Red    D |1364/5AB2/D780/E9FC|      12      58      20.640      106394258989\n     603117   Red    R |1364/5AB2/D708/E9FC|      12      58      20.248      106394259493\n     308288   Red    D |1364/5A02/D7B8/E9FC|      12      50      17.944      106396078573\n     156795   Red    L |1364/5A20/D7B8/E9FC|      12      50      18.055      106393135213\n      79148   Red    U |1364/5A28/D7B0/E9FC|      12      50      19.748      106392847909\n      39781   Red    R |1364/5A28/D70B/E9FC|      12      50      19.183      106392848317\n      19862   Red    R |1364/5A28/D07B/E9FC|      12      50      18.815      106392852037\n       9877   Red    U |1364/5A28/D97B/E0FC|      14      50      20.640      106392848411\n       4838   Red    R |1364/5A28/D97B/0EFC|      13      48      19.950      106392848421\n       2337   Red    D |1364/5A28/097B/DEFC|      12      40      17.146      106392863529\n       1115   Red    L |1364/5A28/907B/DEFC|      12      40      17.664      106392836889\n        534   Red    D |1364/5028/9A7B/DEFC|      12      32      15.232      106414606089\n        259   Red    L |1364/5208/9A7B/DEFC|      12      32      15.362      106381584009\n        124   Red    D |1304/5268/9A7B/DEFC|      12      26      13.711      168648526089\n         56   Red    R |1034/5268/9A7B/DEFC|      12      24      13.491     1227242062089\n         24   Red    U |1234/5068/9A7B/DEFC|      12      24      14.071          36334089\n         10   Red    L |1234/5608/9A7B/DEFC|      12      24      14.491           3312009\n          5   Red    U |1234/5678/9A0B/DEFC|      12      24      16.310               609\n          2   Red    L |1234/5678/9AB0/DEFC|      12      24      16.971               105\n          1   Red    U |1234/5678/9ABC/DEF0|       0       0       0.000                 0\n  45 moves: RDDLULDRURDLLLUURRDRULULLDRDLURRURDLDLDRULULU\n\n     Record Stash Move |Board layout by row|  Max|d|  Sum|d|   Euclidean   Encoded vs Zero\n          1  Blue      |DAB6/5314/80C2/E79F|      15      94      29.155    16535302211892\n          4  Blue    R |DAB6/5314/08C2/E79F|      15      94      28.879    16535302234212\n         12  Blue    D |DAB6/0314/58C2/E79F|      15      94      28.178    16535581621572\n         31  Blue    D |0AB6/D314/58C2/E79F|      15      86      26.268    20458524891972\n         65  Blue    L |A0B6/D314/58C2/E79F|      15      88      26.646    13048370139972\n        133  Blue    U |A3B6/D014/58C2/E79F|      15      90      27.092    11995513736772\n        281  Blue    L |A3B6/D104/58C2/E79F|      15      90      27.129    11995480714692\n        599  Blue    D |A306/D1B4/58C2/E79F|      15      82      25.456    12026654646852\n       1266  Blue    R |A036/D1B4/58C2/E79F|      15      80      25.338    13004296912452\n       2610  Blue    U |A136/D0B4/58C2/E79F|      15      80      25.495    11777091184452\n       5305  Blue    R |A136/0DB4/58C2/E79F|      15      78      24.980    11777203677252\n      10671  Blue    D |0136/ADB4/58C2/E79F|      15      70      23.324    19623050301252\n      21525  Blue    L |1036/ADB4/58C2/E79F|      15      70      23.367     1228430858052\n      42928  Blue    L |1306/ADB4/58C2/E79F|      15      72      23.495      169837322052\n      85377  Blue    L |1360/ADB4/58C2/E79F|      15      74      23.749      111878128452\n     168152  Blue    U |1364/ADB0/58C2/E79F|      15      74      24.413      106565484612\n     329996  Blue    U |1364/ADB2/58C0/E79F|      15      74      24.739      106565156268\n     642726  Blue    R |1364/ADB2/580C/E79F|      15      72      24.249      106565156580\n    1246294  Blue    R |1364/ADB2/508C/E79F|      15      72      23.917      106565159700\n    2396770  Blue    U |1364/ADB2/578C/E09F|      15      72      25.060      106565155234\n   53890081   Red    L |1364/ADB2/578C/E90F|      15      72      25.417      106565155231\n   29075603   Red    L |1364/ADB2/578C/E9F0|       7      42      14.000      106565155230\n   15537991   Red    D |1364/ADB2/5780/E9FC|      12      66      22.000      106565155309\n    8238950   Red    R |1364/ADB2/5708/E9FC|      12      66      21.633      106565155813\n    4329857   Red    D |1364/AD02/57B8/E9FC|      12      58      19.494      106566606973\n    2260581   Red    L |1364/AD20/57B8/E9FC|      12      58      19.596      106563663613\n    1170743   Red    U |1364/AD28/57B0/E9FC|      12      58      21.166      106563421669\n     603137   Red    R |1364/AD28/570B/E9FC|      12      58      20.640      106563422077\n     308301   Red    R |1364/AD28/507B/E9FC|      12      58      20.298      106563425797\n     156804   Red    D |1364/A028/5D7B/E9FC|      12      50      17.550      106574310757\n      79152   Red    R |1364/0A28/5D7B/E9FC|      12      48      16.971      106795667557\n      39783   Red    U |1364/5A28/0D7B/E9FC|      12      48      18.111      106392865717\n      19862   Red    L |1364/5A28/D07B/E9FC|      12      50      18.815      106392852037\n       9877   Red    U |1364/5A28/D97B/E0FC|      14      50      20.640      106392848411\n       4838   Red    R |1364/5A28/D97B/0EFC|      13      48      19.950      106392848421\n       2337   Red    D |1364/5A28/097B/DEFC|      12      40      17.146      106392863529\n       1115   Red    L |1364/5A28/907B/DEFC|      12      40      17.664      106392836889\n        534   Red    D |1364/5028/9A7B/DEFC|      12      32      15.232      106414606089\n        259   Red    L |1364/5208/9A7B/DEFC|      12      32      15.362      106381584009\n        124   Red    D |1304/5268/9A7B/DEFC|      12      26      13.711      168648526089\n         56   Red    R |1034/5268/9A7B/DEFC|      12      24      13.491     1227242062089\n         24   Red    U |1234/5068/9A7B/DEFC|      12      24      14.071          36334089\n         10   Red    L |1234/5608/9A7B/DEFC|      12      24      14.491           3312009\n          5   Red    U |1234/5678/9A0B/DEFC|      12      24      16.310               609\n          2   Red    L |1234/5678/9AB0/DEFC|      12      24      16.971               105\n          1   Red    U |1234/5678/9ABC/DEF0|       0       0       0.000                 0\n  45 moves: RDDLULDRURDLLLUURRULLDRDLURRDRULURDLDLDRULULU\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_36.txt",
        "content": "To play 'slide-square' with 3 rows and 4 columns.\n\nTide  Red\n Preparing a stash in file SlideSolveR3C4.123456789AB0.dat\n ... with an index in file SlideSolveR3C4.123456789AB0.ndx\n   199999991  zero values for an empty index.\n 1 2 3 4 5 6 7 8 9 A B 0 is the board layout in INTEGER*1\n 4030201 8070605   B0A09       0 is the board layout in INTEGER*4\n        48372615          B0A090 ..interleaved into two INTEGER*4\n                        8AA0F74D combined.\n                     -1969162419 as a decimal integer.\nABS(MOD(-1969162419,199999991)) + 2 = 169162502 is the record number for the first index entry.\n\n     | Tidewrack Boundary Positions|      Positions   |     Primary Probes        Index Use  |Memory of Time Passed\nSurge|     First      Last    Count|  Checked Deja vu%|     Made Max.L  Avg.L|  Used%   Load%|    CPU      Clock\n    1|         1         1        1|        2     0.00|        0     0  0.000|  0.000   0.000|  0.0secs  0.0secs  0.00%  7:57:19.187am.\n    2|         2         3        2|        4     0.00|        0     0  0.000|  0.000   0.000|  0.0secs  0.1secs 16.62%  7:57:19.281am.\n    3|         4         7        4|        9     0.00|        0     0  0.000|  0.000   0.000|  0.0secs  0.0secs  0.00%  7:57:19.296am.\n    4|         8        16        9|       20     0.00|        0     0  0.000|  0.000   0.000|  0.0secs  0.0secs         7:57:19.312am.\n    5|        17        36       20|       37     0.00|        0     0  0.000|  0.000   0.000|  0.0secs  0.0secs         7:57:19.312am.\n    6|        37        73       37|       64     1.56|        1     1  1.000|  0.000   0.000|  0.0secs  0.2secs  0.00%  7:57:19.468am.\n    7|        74       136       63|      125     2.40|        3     1  1.000|  0.000   0.000|  0.0secs  0.0secs  0.00%  7:57:19.515am.\n    8|       137       258      122|      241     3.73|        9     1  1.000|  0.000   0.000|  0.0secs  0.1secs  0.00%  7:57:19.609am.\n    9|       259       490      232|      451     4.43|       20     1  1.000|  0.000   0.000|  0.0secs  0.1secs  0.00%  7:57:19.671am.\n   10|       491       921      431|      827     5.56|       46     1  1.000|  0.001   0.001|  0.0secs  0.1secs  0.00%  7:57:19.796am.\n   11|       922      1702      781|     1481     6.01|       89     1  1.000|  0.002   0.002|  0.0secs  0.2secs 15.32%  7:57:20.000am.\n   12|      1703      3094     1392|     2671     6.63|      177     1  1.000|  0.003   0.003|  0.0secs  0.4secs  8.33%  7:57:20.375am.\n   13|      3095      5588     2494|     4770     6.88|      328     1  1.000|  0.005   0.005|  0.1secs  1.0secs 11.12%  7:57:21.359am.\n   14|      5589     10030     4442|     8502     7.62|      652     1  1.000|  0.009   0.009|  0.4secs  1.8secs 21.06%  7:57:23.140am.\n   15|     10031     17884     7854|    15135     8.17|     1237     2  1.001|  0.016   0.016|  0.6secs  2.8secs 22.90%  7:57:25.937am.\n   16|     17885     31783    13899|    26554     8.81|     2351     1  1.000|  0.028   0.028|  0.9secs  5.0secs 17.65%  7:57:30.984am.\n   17|     31784     55998    24215|    46180     9.48|     4409     2  1.000|  0.049   0.049|  1.9secs  7.4secs 26.21%  7:57:38.375am.\n   18|     55999     97800    41802|    79668    10.67|     8584     2  1.000|  0.084   0.084|  3.1secs 11.7secs 26.87%  7:57:50.062am.\n   19|     97801    168967    71167|   135867    11.76|    16270     3  1.001|  0.144   0.144|  5.1secs 15.7secs 32.40%  7:58:05.734am.\n   20|    168968    288855   119888|   228379    13.14|    30689     2  1.001|  0.243   0.244|  9.4secs 21.4secs 43.75%  7:58:27.125am.\n   21|    288856    487218   198363|   377240    14.32|    55757     2  1.002|  0.404   0.405| 15.0secs 26.5secs 56.39%  7:58:53.671am.\n   22|    487219    810424   323206|   612123    15.74|   100162     2  1.002|  0.660   0.663| 21.7secs 42.4secs 51.16%  7:59:36.093am.\n   23|    810425   1326202   515778|   977833    17.06|   176608     3  1.003|  1.060   1.069| 32.7secs 59.2secs 55.29%  8:00:35.296am.\n   24|   1326203   2137202   811000|  1533678    18.63|   306896     3  1.005|  1.674   1.693| 56.0secs 91.9secs 60.91%  8:02:07.203am.\n   25|   2137203   3385213  1248011|  2358532    20.07|   522581     4  1.008|  2.592   2.635| 85.7secs  2.1mins 67.00%  8:04:15.062am.\n   26|   3385214   5270492  1885279|  3554164    21.71|   877235     4  1.012|  3.930   4.026|  2.1mins  3.4mins 60.44%  8:07:40.187am.\n   27|   5270493   8052888  2782396|  5239108    23.47|  1452058     5  1.017|  5.824   6.031|  3.1mins  4.4mins 70.93%  8:12:05.062am.\n   28|   8052889  12062610  4009722|  7534021    25.39|  2357673     5  1.025|  8.412   8.842|  4.4mins  6.8mins 64.81%  8:18:50.843am.\n   29|  12062611  17683964  5621354| 10540894    27.45|  3736777     5  1.037| 11.814  12.666|  5.9mins  8.7mins 67.49%  8:27:35.375am.\n   30|  17683965  25331836  7647872| 14308274    29.65|  5757092     5  1.052| 16.090  17.699|  8.1mins 12.1mins 66.43%  8:39:42.640am.\n   31|  25331837  35397636 10065800| 18773730    32.03|  8547647     6  1.072| 21.203  24.079| 10.4mins 14.8mins 70.68%  8:54:28.562am.\n   32|  35397637  48158049 12760413| 23759506    34.47| 12146155     7  1.097| 27.009  31.864| 13.2mins 19.0mins 69.20%  9:13:31.234am.\n   33|  48158050  63728835 15570786| 28870409    37.06| 16437759     8  1.126| 33.226  40.950| 15.7mins 21.8mins 72.16%  9:35:16.421am.\n   34|  63728836  81900441 18171606| 33626342    39.63| 20990966     9  1.157| 39.543  51.100| 18.8mins 31.2mins 60.26% 10:06:28.671am.\n   35|  81900442 102200317 20299876| 37402396    42.28| 25357818     9  1.193| 45.566  61.894| 21.7mins 43.3mins 50.19% 10:49:46.296am.\n   36| 102200318 123787565 21587248| 39666978    44.94| 28674025    11  1.222| 51.062  72.814| 24.1mins 55.6mins 43.32% 11:45:22.359am.\n   37| 123787566 145628724 21841159| 39956652    47.68| 30596301    10  1.253| 55.742  83.268| 24.9mins 62.8mins 39.61% 12:48:08.968pm.\n   38| 145628725 166535629 20906905| 38122360    50.42| 30382490    10  1.269| 59.612  92.717| 24.8mins 65.3mins 37.94%  1:53:27.953pm.\n   39| 166535630 185434986 18899357| 34311262    53.20| 28383116    11  1.286| 62.576 100.747| 22.4mins 61.1mins 36.70%  2:54:31.156pm.\n   40| 185434987 201493321 16058335| 29019233    55.99| 24579603    12  1.283| 64.796 107.133| 19.0mins 52.2mins 36.48%  3:46:40.171pm.\n   41| 201493322 214265924 12772603| 23016150    58.66| 19948189    10  1.281| 66.330 111.891| 14.8mins 40.7mins 36.41%  4:27:20.140pm.\n   42| 214265925 223781141  9515217| 17041788    61.37| 14979073    11  1.262| 67.361 115.182| 10.9mins 29.0mins 37.55%  4:56:23.062pm.\n   43| 223781142 230364322  6583181| 11772739    63.96| 10506946    10  1.249| 67.994 117.304|  7.0mins 19.0mins 37.17%  5:15:21.000pm.\n   44| 230364323 234607075  4242753|  7532690    66.76|  6789748    11  1.222| 68.366 118.555|  4.3mins 11.3mins 37.93%  5:26:38.500pm.\n   45| 234607076 237110948  2503873|  4439978    69.59|  4054719    10  1.206| 68.558 119.231|  2.3mins  6.1mins 37.47%  5:32:47.218pm.\n   46| 237110949 238461216  1350268|  2371273    72.87|  2185279    10  1.176| 68.651 119.552| 70.6secs  2.9mins 39.92%  5:35:44.015pm.\n   47| 238461217 239104461   643245|  1130010    76.08|  1055623    10  1.160| 68.689 119.687| 29.4secs 74.9secs 39.21%  5:36:58.890pm.\n   48| 239104462 239374764   270303|   466424    80.21|   440280    10  1.125| 68.702 119.734| 10.8secs 26.0secs 41.36%  5:37:24.921pm.\n   49| 239374765 239467075    92311|   161691    83.23|   154374     8  1.111| 68.705 119.747|  3.4secs  7.6secs 45.08%  5:37:32.546pm.\n   50| 239467076 239494191    27116|    44973    88.02|    43422    11  1.071| 68.706 119.750|  0.8secs  1.5secs 56.82%  5:37:34.031pm.\n   51| 239494192 239499581     5390|     9553    88.33|     9259     6  1.074| 68.706 119.750|  0.1secs  0.4secs 33.32%  5:37:34.453pm.\n   52| 239499582 239500696     1115|     1625    94.71|     1593     5  1.028| 68.706 119.750|  0.0secs  0.0secs104.17%  5:37:34.468pm.\n   53| 239500697 239500782       86|      167    89.22|      162     3  1.049| 68.706 119.750|  0.0secs  0.0secs 97.66%  5:37:34.484pm.\n   54| 239500783 239500800       18|       18   100.00|       18     1  1.000| 68.706 119.750|  0.0secs  0.0secs         5:37:34.484pm.\n\nThe boundary has not surged to new positions!\nThe now-static boundary has 18\n\n     Record Stash Move | Board layout | Max|d| Sum|d| Euclidean Encoded vs Zero\n  239500783   Red    D |0869/B725/43A1|      7     44    14.765       466581807\n  239500784   Red    D |0869/B7A1/4325|      9     58    18.601       466582214\n  239500785   Red    R |8759/43A2/0B61|      9     48    16.310       302860487\n  239500786   Red    R |4325/8761/0BA9|      9     38    15.362       127427903\n  239500787   Red    R |0821/B3A5/4769|      9     48    15.811       464885186\n  239500788   Red    D |0B21/3765/48A9|      9     38    14.765       475738105\n  239500789   Red    R |4321/8B65/07A9|      9     42    15.362       127389739\n  239500790   Red    D |0861/B325/47A9|      9     48    15.811       466336825\n  239500791   Red    D |0829/B365/47A1|      6     36    12.410       465127617\n  239500792   Red    R |0829/B7A5/4361|      7     44    14.765       465130767\n  239500793   Red    R |4321/8769/0BA5|      9     30    11.832       127387607\n  239500794   Red    R |B821/37A5/0469|     10     58    19.799       424935162\n  239500795   Red    R |4361/8725/0BA9|      9     42    15.362       128113223\n  239500796   Red    R |4321/B765/08A9|      9     40    15.297       127402699\n  239500797   Red    U |8369/4725/0BA1|      9     38    14.283       288340727\n  239500798   Red    U |8329/476A/0B51|      9     36    14.213       287247191\n  239500799   Red    R |0321/8765/4BA9|      9     30    11.832       446727869\n  239500800   Red    R |8321/4765/0BA9|      9     38    15.362       287039663\nNo progress!\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_37.txt",
        "content": "To play 'slide-square' with 4 rows and 3 columns.\n\nTide  Red\n Preparing a stash in file SlideSolveR4C3.123456789AB0.dat\n ... with an index in file SlideSolveR4C3.123456789AB0.ndx\n   199999991  zero values for an empty index.\n 1 2 3 4 5 6 7 8 9 A B 0 is the board layout in INTEGER*1\n 4030201 8070605   B0A09       0 is the board layout in INTEGER*4\n        48372615          B0A090 ..interleaved into two INTEGER*4\n                        8AA0F74D combined.\n                     -1969162419 as a decimal integer.\nABS(MOD(-1969162419,199999991)) + 2 = 169162502 is the record number for the first index entry.\n\n     | Tidewrack Boundary Positions |    Positions     |    Primary Probes       Index Use   |Memory of Time Passed\nSurge|     First       Last    Count|  Checked Deja vu%|     Made Max.L Avg.L|  Used%   Load%|    CPU      Clock\n    1|         1          1        1|        2     0.00|        0     0 0.000|  0.000   0.000|  0.0secs  0.0secs  0.00%  7:50:20.203pm.\n    2|         2          3        2|        4     0.00|        0     0 0.000|  0.000   0.000|  0.0secs  0.1secs 12.50%  7:50:20.328pm.\n    3|         4          7        4|        9     0.00|        0     0 0.000|  0.000   0.000|  0.0secs  0.0secs         7:50:20.328pm.\n    4|         8         16        9|       20     0.00|        0     0 0.000|  0.000   0.000|  0.0secs  0.0secs  0.00%  7:50:20.343pm.\n    5|        17         36       20|       37     0.00|        0     0 0.000|  0.000   0.000|  0.0secs  0.1secs  0.00%  7:50:20.421pm.\n    6|        37         73       37|       64     1.56|        1     1 1.000|  0.000   0.000|  0.0secs  0.0secs  0.00%  7:50:20.437pm.\n    7|        74        136       63|      125     2.40|        3     1 1.000|  0.000   0.000|  0.0secs  0.2secs  8.31%  7:50:20.625pm.\n    8|       137        258      122|      241     3.73|        9     1 1.000|  0.000   0.000|  0.0secs  0.1secs 50.40%  7:50:20.687pm.\n    9|       259        490      232|      451     4.43|       20     1 1.000|  0.000   0.000|  0.0secs  0.1secs 49.87%  7:50:20.781pm.\n   10|       491        921      431|      827     5.56|       46     1 1.000|  0.001   0.001|  0.1secs  0.2secs 63.59%  7:50:20.953pm.\n   11|       922       1702      781|     1481     6.01|       89     1 1.000|  0.002   0.002|  0.1secs  0.3secs 35.06%  7:50:21.265pm.\n   12|      1703       3094     1392|     2671     6.63|      177     1 1.000|  0.003   0.003|  0.2secs  0.6secs 41.63%  7:50:21.828pm.\n   13|      3095       5588     2494|     4770     6.88|      328     1 1.000|  0.005   0.005|  0.5secs  1.5secs 36.19%  7:50:23.296pm.\n   14|      5589      10030     4442|     8502     7.62|      648     1 1.000|  0.009   0.009|  0.8secs  2.2secs 34.50%  7:50:25.515pm.\n   15|     10031      17884     7854|    15135     8.17|     1237     1 1.000|  0.016   0.016|  1.3secs  3.9secs 33.60%  7:50:29.421pm.\n   16|     17885      31783    13899|    26554     8.81|     2344     1 1.000|  0.028   0.028|  2.2secs  5.9secs 36.77%  7:50:35.328pm.\n   17|     31784      55998    24215|    46180     9.48|     4397     1 1.000|  0.049   0.049|  3.1secs  9.5secs 32.73%  7:50:44.781pm.\n   18|     55999      97800    41802|    79668    10.67|     8574     2 1.000|  0.084   0.084|  6.0secs 14.5secs 41.25%  7:50:59.328pm.\n   19|     97801     168967    71167|   135867    11.76|    16154     2 1.000|  0.144   0.144|  9.3secs 20.5secs 45.46%  7:51:19.812pm.\n   20|    168968     288855   119888|   228379    13.14|    30520     2 1.000|  0.243   0.244| 14.7secs 27.9secs 52.72%  7:51:47.671pm.\n   21|    288856     487218   198363|   377240    14.32|    55395     2 1.001|  0.404   0.405| 18.5secs 33.0secs 56.18%  7:52:20.656pm.\n   22|    487219     810424   323206|   612123    15.74|    99611     2 1.002|  0.660   0.663| 22.4secs 41.7secs 53.62%  7:53:02.359pm.\n   23|    810425    1326202   515778|   977833    17.06|   175049     2 1.003|  1.062   1.069| 35.9secs 61.9secs 57.96%  7:54:04.250pm.\n   24|   1326203    2137202   811000|  1533678    18.63|   305322     3 1.004|  1.676   1.693| 55.4secs 94.5secs 58.68%  7:55:38.718pm.\n   25|   2137203    3385213  1248011|  2358532    20.07|   519257     4 1.007|  2.596   2.635| 87.8secs  2.3mins 63.69%  7:57:56.562pm.\n   26|   3385214    5270492  1885279|  3554164    21.71|   872963     3 1.010|  3.936   4.026|  2.2mins  3.4mins 63.19%  8:01:21.109pm.\n   27|   5270493    8052888  2782396|  5239108    23.47|  1445680     4 1.016|  5.833   6.031|  3.2mins  4.8mins 66.44%  8:06:08.906pm.\n   28|   8052889   12062610  4009722|  7534021    25.39|  2348797     4 1.024|  8.426   8.842|  4.5mins  6.9mins 65.49%  8:13:00.218pm.\n   29|  12062611   17683964  5621354| 10540894    27.45|  3734408     5 1.036| 11.829  12.666|  6.4mins  9.1mins 70.67%  8:22:04.328pm.\n   30|  17683965   25331836  7647872| 14308274    29.65|  5746564     5 1.051| 16.110  17.699|  8.3mins 12.3mins 67.88%  8:34:21.375pm.\n   31|  25331837   35397636 10065800| 18773730    32.03|  8552447     6 1.071| 21.220  24.079| 10.9mins 15.7mins 69.40%  8:50:02.062pm.\n   32|  35397637   48158049 12760413| 23759506    34.47| 12145305     7 1.096| 27.027  31.864| 13.8mins 19.5mins 70.96%  9:09:32.671pm.\n   33|  48158050   63728835 15570786| 28870409    37.06| 16448462     7 1.125| 33.238  40.950| 16.7mins 23.2mins 71.94%  9:32:46.109pm.\n   34|  63728836   81900441 18171606| 33626342    39.63| 21022994     9 1.158| 39.540  51.100| 20.1mins 32.4mins 62.17% 10:05:09.859pm.\n   35|  81900442  102200317 20299876| 37402396    42.28| 25358874     8 1.192| 45.562  61.894| 21.9mins 44.7mins 49.02% 10:49:50.296pm.\n   36| 102200318  123787565 21587248| 39666978    44.94| 28734429    10 1.224| 51.028  72.814| 25.6mins 56.6mins 45.33% 11:46:25.156pm.\n   37| 123787566  145628724 21841159| 39956652    47.68| 30572287    11 1.252| 55.720  83.268| 27.1mins 64.5mins 41.99%  0:50:52.171am.\n   38| 145628725  166535629 20906905| 38122360    50.42| 30446707    10 1.273| 59.558  92.717| 26.6mins 66.4mins 40.12%  1:57:16.468am.\n   39| 166535630  185434986 18899357| 34311262    53.20| 28341786    10 1.283| 62.543 100.747| 23.7mins 62.2mins 38.16%  2:59:28.250am.\n   40| 185434987  201493321 16058335| 29019233    55.99| 24605484    10 1.285| 64.750 107.133| 20.0mins 53.8mins 37.26%  3:53:15.640am.\n   41| 201493322  214265924 12772603| 23016150    58.66| 19903099    11 1.276| 66.306 111.891| 15.5mins 41.1mins 37.86%  4:34:19.671am.\n   42| 214265925  223781141  9515217| 17041788    61.37| 14979317    10 1.262| 67.337 115.182| 11.3mins 29.2mins 38.48%  5:03:33.937am.\n   43| 223781142  230364322  6583181| 11772739    63.96| 10478430    12 1.241| 67.985 117.304|  7.4mins 19.1mins 38.79%  5:22:39.250am.\n   44| 230364323  234607075  4242753|  7532690    66.76|  6785656    11 1.220| 68.358 118.555|  4.4mins 11.4mins 38.96%  5:34:04.359am.\n   45| 234607076  237110948  2503873|  4439978    69.59|  4041159    10 1.197| 68.558 119.231|  2.4mins  6.2mins 38.76%  5:40:15.031am.\n   46| 237110949  238461216  1350268|  2371273    72.87|  2182892    11 1.172| 68.652 119.552| 70.1secs  3.0mins 39.48%  5:43:12.625am.\n   47| 238461217  239104461   643245|  1130010    76.08|  1051526    10 1.149| 68.691 119.687| 30.2secs 76.2secs 39.66%  5:44:28.812am.\n   48| 239104462  239374764   270303|   466424    80.21|   439307    10 1.118| 68.705 119.734| 11.2secs 26.3secs 42.40%  5:44:55.125am.\n   49| 239374765  239467075    92311|   161691    83.23|   153927     9 1.102| 68.708 119.747|  3.6secs  7.9secs 45.63%  5:45:03.000am.\n   50| 239467076  239494191    27116|    44973    88.02|    43358     9 1.067| 68.709 119.750|  0.8secs  1.7secs 44.15%  5:45:04.734am.\n   51| 239494192  239499581     5390|     9553    88.33|     9231     6 1.062| 68.709 119.750|  0.1secs  0.3secs 52.87%  5:45:05.000am.\n   52| 239499582  239500696     1115|     1625    94.71|     1598     4 1.029| 68.709 119.750|  0.0secs  0.0secs100.81%  5:45:05.031am.\n   53| 239500697  239500782       86|      167    89.22|      161     3 1.043| 68.709 119.750|  0.0secs  0.0secs         5:45:05.031am.\n   54| 239500783  239500800       18|       18   100.00|       18     1 1.000| 68.709 119.750|  0.0secs  0.0secs         5:45:05.031am.\n\nThe boundary has not surged to new positions!\nThe now-static boundary has 18\n\n     Record Stash Move |  Board layout | Max|d| Sum|d| Euclidean Encoded vs Zero\n  239500783   Red    D |09A/B78/456/321|      9     52    17.720       471375815\n  239500784   Red    L |A90/78B/456/123|      9     60    19.494       391824450\n  239500785   Red    L |BA0/789/546/321|     10     56    18.974       435370175\n  239500786   Red    D |BA0/789/452/361|     10     56    18.493       435370041\n  239500787   Red    R |07A/98B/456/123|      9     56    18.221       464077890\n  239500788   Red    R |09A/B87/465/321|      9     52    17.833       471380879\n  239500789   Red    R |09A/B87/546/321|      9     52    17.833       471380975\n  239500790   Red    R |09A/B87/564/312|     10     54    18.547       471380998\n  239500791   Red    L |970/B8A/465/123|      9     60    19.287       344730714\n  239500792   Red    L |AB0/789/546/123|      9     60    19.950       395453370\n  239500793   Red    L |BA0/879/265/341|     10     56    18.601       435410157\n  239500794   Red    R |09A/B78/546/123|      9     56    18.868       471375930\n  239500795   Red    L |AB0/789/456/132|      9     58    19.339       395453251\n  239500796   Red    R |09A/B78/465/123|      9     56    18.868       471375834\n  239500797   Red    D |AB0/798/456/123|      9     60    19.950       395458290\n  239500798   Red    L |AB0/789/456/213|     10     60    19.950       395453252\n  239500799   Red    L |BA0/789/456/123|     10     60    19.950       435370050\n  239500800   Red    R |0BA/789/456/123|      9     56    18.868       478915650\nNo progress!\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_38.txt",
        "content": "To play 'slide-square' with 3 rows and 3 columns.\n\nTide  Red\n Preparing a stash in file SlideSolveR3C3.123456780.dat\n ... with an index in file SlideSolveR3C3.123456780.ndx\n      199991  zero values for an empty index.\n 1 2 3 4 5 6 7 8 0 is the board layout in INTEGER*1\n 4030201 8070605       0       0 is the board layout in INTEGER*4\n        48372615               0 ..interleaved into two INTEGER*4\n                        89F056BD multiplied together in INTEGER*4\n                     -1980737859 as a decimal integer.\nABS(MOD(-1980737859,199991)) + 2 = 26997 is the record number for the first index entry.\n\n     |Tidewrack Boundary Positions|  Positions     |  Primary Probes       Index Use\nSurge|   First       Last    Count|Checked Deja vu%|  Made Max.L  Avg.L|  Used%  Load%\n    1|       1          1        1|      2     0.00|     0     0  0.000|  0.002  0.002\n    2|       2          3        2|      4     0.00|     0     0  0.000|  0.004  0.004\n    3|       4          7        4|      8     0.00|     0     0  0.000|  0.008  0.008\n    4|       8         15        8|     16     0.00|     0     0  0.000|  0.016  0.016\n    5|      16         31       16|     20     0.00|     0     0  0.000|  0.026  0.026\n    6|      32         51       20|     40     2.50|     1     1  1.000|  0.045  0.045\n    7|      52         90       39|     65     4.62|     3     1  1.000|  0.076  0.076\n    8|      91        152       62|    124     6.45|     8     1  1.000|  0.134  0.134\n    9|     153        268      116|    164     7.32|    12     1  1.000|  0.210  0.210\n   10|     269        420      152|    304     5.92|    18     1  1.000|  0.353  0.353\n   11|     421        706      286|    430     7.91|    38     1  1.000|  0.549  0.551\n   12|     707       1102      396|    792     5.56|    53     1  1.000|  0.919  0.925\n   13|    1103       1850      748|   1114     8.08|    97     2  1.010|  1.427  1.437\n   14|    1851       2874     1024|   2048     7.57|   189     1  1.000|  2.357  2.384\n   15|    2875       4767     1893|   2799    10.25|   356     2  1.006|  3.578  3.640\n   16|    4768       7279     2512|   5024    10.73|   738     2  1.019|  5.721  5.882\n   17|    7280      11764     4485|   6599    14.56|  1365     2  1.023|  8.338  8.701\n   18|   11765      17402     5638|  11276    15.49|  2734     3  1.042| 12.610 13.466\n   19|   17403      26931     9529|  13867    21.55|  4630     3  1.054| 17.228 18.905\n   20|   26932      37809    10878|  21756    21.89|  8302     4  1.087| 23.956 27.402\n   21|   37810      54802    16993|  24289    29.56| 11793     4  1.102| 30.204 35.958\n   22|   54803      71912    17110|  34220    30.01| 18451     4  1.151| 38.089 47.934\n   23|   71913      95864    23952|  33912    40.36| 21895     6  1.165| 44.097 58.047\n   24|   95865     116088    20224|  40448    40.55| 27617     6  1.205| 50.513 70.071\n   25|  116089     140135    24047|  33131    52.98| 25580     7  1.200| 54.289 77.860\n   26|  140136     155713    15578|  31156    53.27| 24657     5  1.208| 57.539 85.140\n   27|  155714     170273    14560|  19530    67.88| 16842     6  1.157| 58.883 88.277\n   28|  170274     176547     6274|  12548    68.84| 10945     5  1.137| 59.684 90.233\n   29|  176548     180457     3910|   4926    84.57|  4615     6  1.068| 59.840 90.613\n   30|  180458     181217      760|   1520    85.46|  1424     4  1.064| 59.888 90.723\n   31|  181218     181438      221|    265    99.25|   264     1  1.000| 59.888 90.724\n   32|  181439     181440        2|      4   100.00|     4     1  1.000| 59.888 90.724\n\nThe boundary has not surged to new positions!\nThe now-static boundary has 2\n\n     Record Stash Move |Board  plan| Max|d| Sum|d| Euclidean Encoded vs Zero\n     181439   Red    D |647/850/321|      6     32    12.247          220175\n     181440   Red    U |867/254/301|      8     32    13.038          311247\nNo progress!\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_39.txt",
        "content": "Randomize Timer\n\nDim Shared As Integer Nr(15) = {3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3}\nDim Shared As Integer Nc(15) = {3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2}\nDim Shared As Integer n, nn\nDim Shared As Integer N0(99), N3(100), N4(99)\nDim Shared As Ulongint N2(99)\n\nEnum\n    Ki = 1\n    Kg = 8\n    Ke = 2\n    Kl = 4\nEnd Enum\n\nDim Shared As Integer l = 108, r = 114, u = 117, d = 100\n\nDeclare Function fY() As Boolean\nDeclare Function fZ(w As Integer) As Boolean\nDeclare Function fN() As Boolean\n\nSub fI()\n    Dim As Integer g = (11 - N0(n)) * 4\n    Dim As Ulongint a = (N2(n) And (15ULL Shl g))\n    N0(n + 1) = N0(n) + 4\n    N2(n + 1) = N2(n) - a + (a Shl 16)\n    N3(n + 1) = d\n    N4(n + 1) = N4(n)\n    If Not(Nr((a Shr g)) <= N0(n)\\4) Then N4(n + 1) += 1\n    n += 1\nEnd Sub\n\nSub fG()\n    Dim As Integer g = (19 - N0(n)) * 4\n    Dim As Ulongint a = (N2(n) And (15ULL Shl g))\n    N0(n + 1) = N0(n) - 4\n    N2(n + 1) = N2(n) - a + (a Shr 16)\n    N3(n + 1) = u\n    N4(n + 1) = N4(n)\n    If Not(Nr((a Shr g)) >= N0(n)\\4) Then N4(n + 1) += 1\n    n += 1\nEnd Sub\n\nSub fE()\n    Dim As Integer g = (14 - N0(n)) * 4\n    Dim As Ulongint a = (N2(n) And (15ULL Shl g))\n    N0(n + 1) = N0(n) + 1\n    N2(n + 1) = N2(n) - a + (a Shl 4)\n    N3(n + 1) = r\n    N4(n + 1) = N4(n)\n    If Not(Nc((a Shr g)) <= (N0(n) Mod 4)) Then N4(n + 1) += 1\n    n += 1\nEnd Sub\n\nSub fL()\n    Dim As Integer g = (16 - N0(n)) * 4\n    Dim As Ulongint a = (N2(n) And (15ULL Shl g))\n    N0(n + 1) = N0(n) - 1\n    N2(n + 1) = N2(n) - a + (a Shr 4)\n    N3(n + 1) = l\n    N4(n + 1) = N4(n)\n    If Not(Nc((a Shr g)) >= (N0(n) Mod 4)) Then N4(n + 1) += 1\n    n += 1\nEnd Sub\n\nFunction fY() As Boolean\n    If N2(n) = &h123456789abcdef0ULL Then Return True\n    If N4(n) <= nn Then Return fN()\n    Return False\nEnd Function\n\nFunction fZ(w As Integer) As Boolean\n    If (w And Ki) > 0 Then\n        fI()\n        If fY() Then Return True\n        n -= 1\n    End If\n    If (w And Kg) > 0 Then\n        fG()\n        If fY() Then Return True\n        n -= 1\n    End If\n    If (w And Ke) > 0 Then\n        fE()\n        If fY() Then Return True\n        n -= 1\n    End If\n    If (w And Kl) > 0 Then\n        fL()\n        If fY() Then Return True\n        n -= 1\n    End If\n    Return False\nEnd Function\n\nFunction fN() As Boolean\n    Select Case N0(n)\n    Case 0\n        Select Case N3(n)\n        Case l: Return fZ(Ki)\n        Case u: Return fZ(Ke)\n        Case Else: Return fZ(Ki Or Ke)\n        End Select\n    Case 3\n        Select Case N3(n)\n        Case r: Return fZ(Ki)\n        Case u: Return fZ(Kl)\n        Case Else: Return fZ(Ki Or Kl)\n        End Select\n    Case 1, 2\n        Select Case N3(n)\n        Case l: Return fZ(Ki Or Kl)\n        Case r: Return fZ(Ki Or Ke)\n        Case u: Return fZ(Ke Or Kl)\n        Case Else: Return fZ(Kl Or Ke Or Ki)\n        End Select\n    Case 12\n        Select Case N3(n)\n        Case l: Return fZ(Kg)\n        Case d: Return fZ(Ke)\n        Case Else: Return fZ(Ke Or Kg)\n        End Select\n    Case 15\n        Select Case N3(n)\n        Case r: Return fZ(Kg)\n        Case d: Return fZ(Kl)\n        Case Else: Return fZ(Kg Or Kl)\n        End Select\n    Case 13, 14\n        Select Case N3(n)\n        Case l: Return fZ(Kg Or Kl)\n        Case r: Return fZ(Ke Or Kg)\n        Case d: Return fZ(Ke Or Kl)\n        Case Else: Return fZ(Kg Or Ke Or Kl)\n        End Select\n    Case 4, 8\n        Select Case N3(n)\n        Case l: Return fZ(Ki Or Kg)\n        Case u: Return fZ(Kg Or Ke)\n        Case d: Return fZ(Ki Or Ke)\n        Case Else: Return fZ(Ki Or Kg Or Ke)\n        End Select\n    Case 7, 11\n        Select Case N3(n)\n        Case d: Return fZ(Ki Or Kl)\n        Case u: Return fZ(Kg Or Kl)\n        Case r: Return fZ(Ki Or Kg)\n        Case Else: Return fZ(Ki Or Kg Or Kl)\n        End Select\n    Case Else\n        Select Case N3(n)\n        Case d: Return fZ(Ki Or Ke Or Kl)\n        Case l: Return fZ(Ki Or Kg Or Kl)\n        Case r: Return fZ(Ki Or Kg Or Ke)\n        Case u: Return fZ(Kg Or Ke Or Kl)\n        Case Else: Return fZ(Ki Or Kg Or Ke Or Kl)\n        End Select\n    End Select\nEnd Function\n\nSub solve()\n    If fN() Then\n        Exit Sub\n    Else\n        n = 0\n        nn += 1\n        solve()\n    End If\nEnd Sub\n\nFunction createPuzzle(Byval j As Integer) As Ulongint\n    Dim As Ulongint q = &h123456789abcdef0ULL\n    Dim As String h = Hex(q, 16)\n    Dim As Integer z, d, r, u = 0\n    While j > 0 ' number of moves to do\n        Do\n            d = Int(Rnd * 4) + 1\n        Loop While d = u\n        u = -d\n        r = Int(Rnd * 3) + 1\n        While r > 0\n            z = Instr(h, \"0\")\n            Select Case d\n            Case 1 ' -1\n                If (z Mod 4) <> 1 Then\n                    Mid(h, z, 1) = Mid(h, z - 1, 1)\n                    Mid(h, z - 1, 1) = \"0\"\n                    j -= 1\n                End If\n            Case 2 ' +1\n                If (z Mod 4) <> 0 Then\n                    Mid(h, z, 1) = Mid(h, z + 1, 1)\n                    Mid(h, z + 1, 1) = \"0\"\n                    j -= 1\n                End If\n            Case 3 ' -4\n                If z >= 5 Then\n                    Mid(h, z, 1) = Mid(h, z - 4, 1)\n                    Mid(h, z - 4, 1) = \"0\"\n                    j -= 1\n                End If\n            Case 4 ' +4\n                If z <= 12 Then\n                    Mid(h, z, 1) = Mid(h, z + 4, 1)\n                    Mid(h, z + 4, 1) = \"0\"\n                    j -= 1\n                End If\n            End Select\n            r -= 1\n        Wend\n    Wend\n    Return Valulng(\"&h\" + h)\nEnd Function\n\nSub ShowConfiguration(Byval h As String, i As Integer)\n    Dim As Integer r, c\n    Dim x As String\n    Color 14\n    For r = 1 To 4\n        For c = 1 To 4\n            x = Mid(h, r * 4 - 4 + c, 1)\n            If x = \"0\" Then x = \" \"\n            Locate r + i, c + c - 1: Print x;\n        Next\n    Next\n    Color 7\nEnd Sub\n\nSub shoWMoves(Byval h As String, Byval s As String, Byval m As Integer, Byval p As Integer)\n    Dim As Integer j, z, d\n    ShowConfiguration(h, 12)\n    For j = 1 To m\n        d = Asc(Mid(s, j, 1))\n        z = Instr(h, \"0\")\n        Select Case d\n        Case l\n            If (z Mod 4) <> 1 Then\n                Mid(h, z, 1) = Mid(h, z - 1, 1)\n                Mid(h, z - 1, 1) = \"0\"\n            End If\n        Case r\n            If (z Mod 4) <> 0 Then\n                Mid(h, z, 1) = Mid(h, z + 1, 1)\n                Mid(h, z + 1, 1) = \"0\"\n            End If\n        Case u\n            If z >= 5 Then\n                Mid(h, z, 1) = Mid(h, z - 4, 1)\n                Mid(h, z - 4, 1) = \"0\"\n            End If\n        Case d\n            If z <= 12 Then\n                Mid(h, z, 1) = Mid(h, z + 4, 1)\n                Mid(h, z + 4, 1) = \"0\"\n            End If\n        End Select\n        ShowConfiguration(h, 12)\n        Sleep p\n    Next\n    Print\nEnd Sub\n\nSub fifteenSolver(Byval g As Ulongint, Byval p As Integer)\n    Dim As String h, s\n    Dim As Integer j\n    Dim As Double t0 = Timer\n    n = 0\n    nn = 0\n    h = Hex(g, 16)\n    Cls\n    Print \"Puzzle: \"; Lcase(h)\n    ShowConfiguration(h, 2)\n    Print Chr(10)\n    N0(0) = Instr(h, \"0\") - 1\n    N2(0) = g\n    solve()\n    Print Using \"Solution found in & moves: \"; n;\n    For j = 1 To n\n        s &= Chr(N3(j))\n    Next\n    Print s\n    Print Using !\"\\nTook ###.######## seconds on i5 @ 3.20 GHz\"; Timer - t0\n    If p Then showMoves(h, s, n, p)\nEnd Sub\n\nfifteenSolver(&hfe169b4c0a73d852ULL, 1000)\n\nSleep\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_4.txt",
        "content": "-V\n   nr = [3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3]\n   nc = [3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2]\n\nT Solver\n   n = 0\n   np = 0\n   n0 = [0] * 100\n   n2 = [UInt64(0)] * 100\n   n3 = [Char(\"\\0\")] * 100\n   n4 = [0] * 100\n\n   F (values)\n      .n0[0] = values.index(0)\n\n      UInt64 tmp = 0\n      L(val) values\n         tmp = (tmp << 4) [|] val\n      .n2[0] = tmp\n\n   F fI()\n      V n = .n\n      V g = (11 - .n0[n]) * 4\n      V a = .n2[n] [&] (UInt64(15) << g)\n      .n0[n + 1] = .n0[n] + 4\n      .n2[n + 1] = .n2[n] - a + (a << 16)\n      .n3[n + 1] = Char(\u2018d\u2019)\n      .n4[n + 1] = .n4[n] + Int(:nr[Int(a >> g)] > .n0[n] I/ 4)\n\n   F fG()\n      V n = .n\n      V g = (19 - .n0[n]) * 4\n      V a = .n2[n] [&] (UInt64(15) << g)\n      .n0[n + 1] = .n0[n] - 4\n      .n2[n + 1] = .n2[n] - a + (a >> 16)\n      .n3[n + 1] = Char(\u2018u\u2019)\n      .n4[n + 1] = .n4[n] + Int(:nr[Int(a >> g)] < .n0[n] I/ 4)\n\n   F fE()\n      V n = .n\n      V g = (14 - .n0[n]) * 4\n      V a = .n2[n] [&] (UInt64(15) << g)\n      .n0[n + 1] = .n0[n] + 1\n      .n2[n + 1] = .n2[n] - a + (a << 4)\n      .n3[n + 1] = Char(\u2018r\u2019)\n      .n4[n + 1] = .n4[n] + Int(:nc[Int(a >> g)] > .n0[n]\u00a0% 4)\n\n   F fL()\n      V n = .n\n      V g = (16 - .n0[n]) * 4\n      V a = .n2[n] [&] (UInt64(15) << g)\n      .n0[n + 1] = .n0[n] - 1\n      .n2[n + 1] = .n2[n] - a + (a >> 4)\n      .n3[n + 1] = Char(\u2018l\u2019)\n      .n4[n + 1] = .n4[n] + Int(:nc[Int(a >> g)] < .n0[n]\u00a0% 4)\n\n   F fY()\n      I .n2[.n] == 1234'5678'9ABC'DEF0\n         R 1B\n      I .n4[.n] <= .np\n         R .fN()\n      R 0B\n\n   F fN() -> Bool\n      V n = .n\n      I .n3[n]\u00a0!= \u2018u\u2019 & .n0[n] I/ 4 < 3 {.fI(); .n++; I .fY() {R 1B}; .n--}\n      I .n3[n]\u00a0!= \u2018d\u2019 & .n0[n] I/ 4 > 0 {.fG(); .n++; I .fY() {R 1B}; .n--}\n      I .n3[n]\u00a0!= \u2018l\u2019 & .n0[n] \u00a0% 4 < 3 {.fE(); .n++; I .fY() {R 1B}; .n--}\n      I .n3[n]\u00a0!= \u2018r\u2019 & .n0[n] \u00a0% 4 > 0 {.fL(); .n++; I .fY() {R 1B}; .n--}\n      R 0B\n\n   F run()\n      L\u00a0!.fY()\n         .np++\n      print(\u2018Solution found with \u2019(.n)\u2018 moves: \u2019, end' \u2018\u2019)\n      L(g) 1 .. .n\n         print(.n3[g], end' \u2018\u2019)\n      print(\u2018.\u2019)\n\nV solver = Solver([15, 14,  1,  6,\n                    9, 11,  4, 12,\n                    0, 10,  7,  3,\n                   13,  8,  5,  2])\nsolver.run()",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_40.txt",
        "content": "Puzzle: fe169b4c0a73d852\n\nF E 1 6\n9 B 4 C\n  A 7 3\nD 8 5 2\n\nSolution found in 52 moves: rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n\nTook   1.41596560 seconds on i5 @ 3.20 GHz\n\n\n1 2 3 4\n5 6 7 8\n9 A B C\nD E F",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_41.txt",
        "content": "// 15 Puzzle Solver\n//https://rosettacode.org/wiki/15_puzzle_solver\n// Requires FutureBasic 7.0.30 or later\n\nbegin globals\n  int Nr(15), Nc(15), n, un, N0(99), N3(99), N4(99)\n  UInt64 N2(99)\nend globals\n\ndef fn fY as BOOL\nvoid def fn fI\nvoid def fn fG\nvoid def fn fE\nvoid def fn fL\n\nlocal fn fN1 as BOOL\n  if ( N3(n)\u00a0!= _\"u\" && N0(n) / 4 < 3 )\n    fn fI\n    n++\n    if ( fn fY ) then return YES\n    n--\n  end if\n  \n  if ( N3(n)\u00a0!= _\"d\" && N0(n) / 4 > 0 )\n    fn fG\n    n++\n    if ( fn fY ) then return YES\n    n--\n  end if\n  \n  if ( N3(n)\u00a0!= _\"l\" && N0(n)\u00a0% 4 < 3 )\n    fn fE\n    n++\n    if ( fn fY ) then return YES\n    n--\n  end if\n  \n  if ( N3(n)\u00a0!= _\"r\" && N0(n) %4 > 0 )\n    fn fL\n    n++\n    if ( fn fY ) then return YES\n    n--\n  end if\nend fn = NO\n\nvoid local fn fI\n  int g = ( 11 - N0(n)) * 4\n  UInt64 a = N2(n) & ((UInt64)15 << g)\n  N0(n + 1) = N0(n) + 4\n  N2(n + 1) = N2(n) - a + (a << 16)\n  N3(n + 1) = _\"d\"\n  if ( Nr(a >> g) <= N0(n) / 4 )\n    N4(n + 1) = N4(n)\n  else\n    N4(n + 1) = N4(n) + 1\n  end if\nend fn\n\nvoid local fn fG\n  int g = (19 - N0(n)) * 4\n  UInt64 a = N2(n) & ((UInt64)15 << g)\n  N0(n + 1) = N0(n) - 4\n  N2(n + 1) = N2(n) - a + (a >> 16)\n  N3(n + 1) = _\"u\"\n  if ( Nr(a >> g) >= N0(n) / 4 )\n    N4(n + 1) = N4(n)\n  else\n    N4(n + 1) = N4(n) + 1\n  end if\nend fn\n\nvoid local fn fE\n  int g = (14 - N0(n)) * 4\n  UInt64 a = N2(n) & ((UInt64)15 << g)\n  N0(n + 1) = N0(n) + 1\n  N2(n + 1) = N2(n) - a + (a << 4)\n  N3(n + 1) = _\"r\"\n  if ( Nc(a >> g) <= N0(n)\u00a0% 4 )\n    N4(n + 1) = N4(n)\n  else\n    N4(n + 1) = N4(n) + 1\n  end if\nend fn\n\nvoid local fn fL\n  int g = (16 - N0(n)) * 4\n  UInt64 a = N2(n) & ((UInt64)15 << g)\n  N0(n + 1) = N0(n) - 1\n  N2(n + 1) = N2(n) - a + (a >> 4)\n  N3(n + 1) = _\"l\"\n  if ( Nc(a >> g) >= N0(n)\u00a0% 4 )\n    N4(n + 1) = N4(n)\n  else\n    N4(n + 1) = N4(n) + 1\n  end if\nend fn\n\nlocal fn fY as BOOL\n  if ( N4(n) < un ) then return fn fN1\n  if ( N2(n) == 0x123456789abcdef0 )\n    printf @\"Solution found in %d moves:\",n\n    for int g = 1 to n\n      printf @\"%c\\b\",N3(g)\n    next\n    print\n    return YES\n  end if\n  if ( N4(n) == un ) then return fn fN1\nend fn = NO\n\nvoid local fn Solve( initN as int, initG as UInt64 )\n  int tempNr(15) = {3,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3}\n  int tempNc(15) = {3,0,1,2,3,0,1,2,3,0,1,2,3,0,1,2}\n  \n  fn memcpy(@Nr(0),@tempNr(0),sizeof(int)*16)\n  fn memcpy(@Nc(0),@tempNc(0),sizeof(int)*16)\n  \n  n = 0\n  un = 0\n  \n  N0(0) = initN\n  N2(0) = initG\n  \n  while ( !fn fY )\n    un++\n  wend\nend fn\n\n\nwindow 1, @\"15 Puzzle Solver\"\nwindowcenter(1)\nWindowSetBackgroundColor(1,fn ColorBlack)\n\ntext ,14,fn colorWhite\nPrint \"Puzzle: \"; \"fe169b4c0a73d852\"\n\ntext ,14,fn colorYellow\nprint\nprint @\"15 14 1  6\"\nprint @\" 9 11 4 12\"\nprint @\" 0 10 7  3\"\nprint @\"13  8 5  2\"\nprint\ntext ,14,fn colorWhite\n\nCFStringRef ComputerChip = unix @\"sysctl -n machdep.cpu.brand_string\"\n\nCFTimeInterval t\u00a0: t = fn CACurrentMediaTime\nfn Solve( 8, 0xfe169b4c0a73d852 )\nCFTimeInterval CurrentTime = fn CACurrentMediaTime-t\n\nprint\ntext ,14,fn colorYellow\nprint\nprint @\" 1  2  3  4\"\nprint @\" 5  6  7  8\"\nprint @\" 9 10 11 12\"\nprint @\"13 14 15  0\"\nprint\ntext ,14,fn colorWhite\n\nprint\u00a0: printf @\"Compute time:\u00a0%.3f seconds\",(CurrentTime)\nprint ComputerChip\n\nHandleEvents",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_42.txt",
        "content": "Puzzle: fe169b4c0a73d852\n\n15 14 1  6\n 9 11 4 12\n 0 10 7  3\n13  8 5  2\n\nSolution found in 52 moves:\nrrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n\n 1  2  3  4\n 5  6  7  8\n 9 10 11 12\n13 14 15  0\n\nCompute time: 0.552 seconds\nApple M3\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_43.txt",
        "content": "package main\n\nimport \"fmt\"\n\nvar (\n    Nr = [16]int{3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3}\n    Nc = [16]int{3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2}\n)\n\nvar (\n    n, _n      int\n    N0, N3, N4 [85]int\n    N2         [85]uint64\n)\n\nconst (\n    i = 1\n    g = 8\n    e = 2\n    l = 4\n)\n\nfunc fY() bool {\n    if N2[n] == 0x123456789abcdef0 {\n        return true\n    }\n    if N4[n] <= _n {\n        return fN()\n    }\n    return false\n}\n\nfunc fZ(w int) bool {\n    if w&i > 0 {\n        fI()\n        if fY() {\n            return true\n        }\n        n--\n    }\n    if w&g > 0 {\n        fG()\n        if fY() {\n            return true\n        }\n        n--\n    }\n    if w&e > 0 {\n        fE()\n        if fY() {\n            return true\n        }\n        n--\n    }\n    if w&l > 0 {\n        fL()\n        if fY() {\n            return true\n        }\n        n--\n    }\n    return false\n}\n\nfunc fN() bool {\n    switch N0[n] {\n    case 0:\n        switch N3[n] {\n        case 'l':\n            return fZ(i)\n        case 'u':\n            return fZ(e)\n        default:\n            return fZ(i + e)\n        }\n    case 3:\n        switch N3[n] {\n        case 'r':\n            return fZ(i)\n        case 'u':\n            return fZ(l)\n        default:\n            return fZ(i + l)\n        }\n    case 1, 2:\n        switch N3[n] {\n        case 'l':\n            return fZ(i + l)\n        case 'r':\n            return fZ(i + e)\n        case 'u':\n            return fZ(e + l)\n        default:\n            return fZ(l + e + i)\n        }\n    case 12:\n        switch N3[n] {\n        case 'l':\n            return fZ(g)\n        case 'd':\n            return fZ(e)\n        default:\n            return fZ(e + g)\n        }\n    case 15:\n        switch N3[n] {\n        case 'r':\n            return fZ(g)\n        case 'd':\n            return fZ(l)\n        default:\n            return fZ(g + l)\n        }\n    case 13, 14:\n        switch N3[n] {\n        case 'l':\n            return fZ(g + l)\n        case 'r':\n            return fZ(e + g)\n        case 'd':\n            return fZ(e + l)\n        default:\n            return fZ(g + e + l)\n        }\n    case 4, 8:\n        switch N3[n] {\n        case 'l':\n            return fZ(i + g)\n        case 'u':\n            return fZ(g + e)\n        case 'd':\n            return fZ(i + e)\n        default:\n            return fZ(i + g + e)\n        }\n    case 7, 11:\n        switch N3[n] {\n        case 'd':\n            return fZ(i + l)\n        case 'u':\n            return fZ(g + l)\n        case 'r':\n            return fZ(i + g)\n        default:\n            return fZ(i + g + l)\n        }\n    default:\n        switch N3[n] {\n        case 'd':\n            return fZ(i + e + l)\n        case 'l':\n            return fZ(i + g + l)\n        case 'r':\n            return fZ(i + g + e)\n        case 'u':\n            return fZ(g + e + l)\n        default:\n            return fZ(i + g + e + l)\n        }\n    }\n}\n\nfunc fI() {\n    g := (11 - N0[n]) * 4\n    a := N2[n] & uint64(15<<uint(g))\n    N0[n+1] = N0[n] + 4\n    N2[n+1] = N2[n] - a + (a << 16)\n    N3[n+1] = 'd'\n    N4[n+1] = N4[n]\n    cond := Nr[a>>uint(g)] <= N0[n]/4\n    if !cond {\n        N4[n+1]++\n    }\n    n++\n}\n\nfunc fG() {\n    g := (19 - N0[n]) * 4\n    a := N2[n] & uint64(15<<uint(g))\n    N0[n+1] = N0[n] - 4\n    N2[n+1] = N2[n] - a + (a >> 16)\n    N3[n+1] = 'u'\n    N4[n+1] = N4[n]\n    cond := Nr[a>>uint(g)] >= N0[n]/4\n    if !cond {\n        N4[n+1]++\n    }\n    n++\n}\n\nfunc fE() {\n    g := (14 - N0[n]) * 4\n    a := N2[n] & uint64(15<<uint(g))\n    N0[n+1] = N0[n] + 1\n    N2[n+1] = N2[n] - a + (a << 4)\n    N3[n+1] = 'r'\n    N4[n+1] = N4[n]\n    cond := Nc[a>>uint(g)] <= N0[n]%4\n    if !cond {\n        N4[n+1]++\n    }\n    n++\n}\n\nfunc fL() {\n    g := (16 - N0[n]) * 4\n    a := N2[n] & uint64(15<<uint(g))\n    N0[n+1] = N0[n] - 1\n    N2[n+1] = N2[n] - a + (a >> 4)\n    N3[n+1] = 'l'\n    N4[n+1] = N4[n]\n    cond := Nc[a>>uint(g)] >= N0[n]%4\n    if !cond {\n        N4[n+1]++\n    }\n    n++\n}\n\nfunc fifteenSolver(n int, g uint64) {\n    N0[0] = n\n    N2[0] = g\n    N4[0] = 0\n}\n\nfunc solve() {\n    if fN() {\n        fmt.Print(\"Solution found in \", n, \" moves: \")\n        for g := 1; g <= n; g++ {\n            fmt.Printf(\"%c\", N3[g])\n        }\n        fmt.Println()\n    } else {\n        n = 0\n        _n++\n        solve()\n    }\n}\n\nfunc main() {\n    fifteenSolver(8, 0xfe169b4c0a73d852)\n    solve()\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_44.txt",
        "content": "Solution found in 52 moves: rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_45.txt",
        "content": "import java.util.ArrayList;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.PriorityQueue;\nimport java.util.Queue;\nimport java.util.Set;\nimport java.util.stream.Collectors;\n\npublic final class Puzzle15Solver {\n    \n    public static void main(String[] aArgs) {\n        List<Integer> start = List.of( 15, 14, 1, 6, 9, 11, 4, 12, 0, 10, 7, 3, 13, 8, 5, 2 );\n        final int zeroIndex = 8;\n        Puzzle initial = new Puzzle(start, new ArrayList<String>(), zeroIndex, 0);\n        openSet.add(initial);\n        System.out.println(\"Solving the 15 puzzle:\");\n        initial.display();        \n        \n        while ( solution == null ) {\n            search();\n        }\n\n        System.out.println(solution.moves.stream().collect(Collectors.joining(\"\")));\n        System.out.println(\"Number of steps: \" + solution.moves.size());\n        System.out.println(\"Number of puzzle states checked: \" + closedSet.size());\n    }\n    \n    private static void search() {\n\t\tPuzzle current = openSet.poll();\n\t    closedSet.add(current);\n\t    final int zeroIndex = current.zeroIndex;\n\t    final int row = zeroIndex / 4;\n        final int column = zeroIndex % 4;\n\t    \n\t\tif ( column > 0 ) {\n\t\t\tPuzzle nextPuzzle = current.clone();\n\t\t\tnextPuzzle.makeMove(Move.LEFT);\n\t    }\n\t    if ( column < 3 ) {\n\t    \tPuzzle nextPuzzle = current.clone();\n\t    \tnextPuzzle.makeMove(Move.RIGHT);\n\t    }\n\t    if ( row > 0 ) {\n\t    \tPuzzle nextPuzzle = current.clone();\n\t    \tnextPuzzle.makeMove(Move.UP);\n\t    }\n\t    if ( row < 3 ) {\n\t    \tPuzzle nextPuzzle = current.clone();\n\t    \tnextPuzzle.makeMove(Move.DOWN);\n\t    }\n\t}\n\n    private enum Move {\t\t\n\t\tLEFT(\"L\", -1), RIGHT(\"R\", +1), UP(\"U\", -4), DOWN(\"D\", +4);\t\t\n\t\t\n\t\tprivate Move(String aSymbol, int aStep) {\n\t\t\tsymbol = aSymbol;\n\t\t\tstep = aStep;\n\t\t}\n\t\t\n\t\tprivate String symbol;\n\t\tprivate Integer step;\t\t\n\t}\n    \n    private static class Puzzle {    \n\n        public Puzzle(List<Integer> aTiles, List<String> aMoves, int aZeroIndex, int aSearchDepth) {\n        \ttiles = aTiles;\n            moves = aMoves;        \n            zeroIndex = aZeroIndex;\n            searchDepth = aSearchDepth;             \n        }\n        \n        public void makeMove(Move aMove) {    \t\t\n    \t\tInteger temp = tiles.get(zeroIndex + aMove.step);\n    \t\ttiles.set(zeroIndex + aMove.step, 0);\n    \t\ttiles.set(zeroIndex, temp);\n    \t\t\n    \t\tzeroIndex += aMove.step;\n    \t\tmoves.add(aMove.symbol);\n    \t\t\n    \t\tif ( ! closedSet.contains(this) ) {\n                openSet.add(this);\n                if ( tiles.equals(Puzzle.GOAL) ) {\n                    solution = this;\n                }\n            }\n    \t}\n\n        public long heuristic() {\n        \tint distance = 0;\n        \tfor ( int i = 0; i < tiles.size(); i++ ) {\n        \t\tfinal int tile = tiles.get(i);\n            \tif ( tile > 0 ) { \n            \t\tdistance += Math.abs( ( i / 4 ) - ( tile - 1 ) / 4 ) + Math.abs( ( i % 4 ) - ( tile - 1 ) % 4 );\n            \t}\n            }\n            return distance + searchDepth;\n        }  \n        \n        public Puzzle clone() {\n            return new Puzzle(new ArrayList<Integer>(tiles), new ArrayList<String>(moves), zeroIndex, searchDepth + 1);\n        }\n\n        public void display() {\n        \t for ( int i = 0; i < tiles.size(); i++ ) {\n                 System.out.print(String.format(\"%s%2d%s\",\n                 \t( i % 4 == 0 ) ? \"[\" : \"\", tiles.get(i), ( i % 4 == 3 ) ? \"]\\n\" : \" \"));\n             }\n             System.out.println();\n        }   \n\n        @Override\n        public boolean equals(Object aObject) {\n        \treturn switch(aObject) {\n        \t\tcase Puzzle puzzle -> tiles.equals(puzzle.tiles);\n        \t\tcase Object object -> false;\n        \t};\n        }\n        \n        @Override\n        public int hashCode() {\n            int hash = 3;\n            hash = 23 * hash + tiles.hashCode();\n            hash = 23 * hash + zeroIndex;\n            return hash;\n        }\n        \n        private List<Integer> tiles;\n        private List<String> moves;\n        private int zeroIndex;\n        private int searchDepth;        \n        \n        private static final List<Integer> GOAL = List.of( 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 0 );\n        \n    }\n\n    private static Queue<Puzzle> openSet =\n    \tnew PriorityQueue<Puzzle>( (one, two) -> Long.compare(one.heuristic(), two.heuristic()) ); \n    private static Set<Puzzle> closedSet = new HashSet<Puzzle>();\n    private static Puzzle solution;\n   \n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_46.txt",
        "content": "Solving the 15 puzzle:\n[15 14  1  6]\n[ 9 11  4 12]\n[ 0 10  7  3]\n[13  8  5  2]\n\nRRRULDLUULDRURDDDLUULURRRDLDDRULDLUURDDLULURRULDRRDD\nNumber of steps: 52\nNumber of puzzle states checked: 2276369\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_47.txt",
        "content": "# The following may be omitted if using the C implementation\n# or if the debug messages are deleted.\ndef debug(msg): (msg | tostring | debug | empty), .;\n\n### Generic functions\n\ndef array_swap($i; $j):\n  if $j < $i then array_swap($j;$i)\n  elif $i == $j then .\n  else .[:$i] + [.[$j]] + .[$i+1:$j] + [.[$i]] + .[$j+1:]\n  end\u00a0;\n\ndef sum(s): reduce s as $x (0; . + $x);\n\n### The 15-Puzzle\n\n# manhattan distance between points $ix and $iy where these are indices in the flat array\ndef distance($ix; $jx):\n  def row: ./4 | floor;\n  def col: .\u00a0% 4;\n  [$ix, $jx]\n  | map(row) as $mr  # [$ri, $rj]\n  | map(col) as $mc  # [$ci, $cj]\n  | [$mr[0] - $mr[1], $mc[0] - $mc[1]]\n  | map(length) # i.e. abs\n  | add;\n      \n# What is the Manhattan distance between the position of $tile in the goal\n# and the location corresponding to index $ix, where $ix is in range(0;16)\ndef manhattan($tile; $ix):\n  .position[$tile|tostring] as $jx\n  | distance($ix; $jx);\n\n# The total of the discrepancies\ndef total_manhattan_distance:\n  sum( range(0;16) as $p | .board[$p] as $tile | select($tile\u00a0!= 0) | manhattan($tile; $p) )\n  | debug;\n  \n# Input:\n#  .goal is the desired board (flat array)\n#  .position is the JSON object mapping tiles to the goal index\n#  .zero is the location of 0\n#  .board is the current state of the board (flat array)\n#  .distance is incremented by $delta after each move\n#  .seen is our memory\n# If allowed, move the zero tile to $p where $p has been properly specified in relation to .zero;\n# otherwise emit empty\ndef move($p):\n  if $p >= 0 and $p < 16\n  then .board[$p] as $tile\n  # Are we making things worse off?\n  | (manhattan($tile; .zero) - manhattan($tile; $p)) as $delta\n  | if $delta > 0 and .distance > (.N - .n)\n    then if .n >= .N then debug({n, N, distance,sequence: (.sequence|length)}) end | empty\n    else # make the move\n    .zero as $zero\n    | (.board | array_swap($zero; $p)) as $candidate\n    | ($candidate|tostring) as $s\n    | if .seen[$s]\n      then empty\n      else .board = $candidate\n      | .zero = $p\n      | .n += 1\n      | .seen[$s] = true\n      end\n    end\n  # We should only reach here if the move has been made\n  | if $delta\u00a0!= 0\n    then .distance += $delta\n    end\n  else empty\n  end\n;\n\ndef row: . / 4 | floor;\ndef col: .\u00a0% 4;\n\ndef up:\n  if (.zero | row) == 0 then empty\n  else move(.zero - 4)\n  | .sequence += [\"u\"]\n  end;\n\ndef down:\n  if (.zero | row) == 3 then empty\n  else move(.zero + 4)\n  | .sequence += [\"d\"]\n  end;\n\ndef left:\n  if (.zero|col) == 0 then empty\n  else move(.zero - 1)\n  | .sequence += [\"l\"]\n  end;\n\ndef right:\n  if (.zero|col) == 3 then empty\n  else move(.zero + 1)\n  | .sequence += [\"r\"]\n  end;  \n\n# $array is a permutation of range(0;16), e.g. the goal\n# Output: a JSON object such that .[$tile] is the position of $tile in the goal\ndef positions($array):\n  reduce range(0; $array|length) as $i ({}; . + {($array[$i]|tostring): $i});\n\n# map a string of lowercase hex digits to an array of decimals\ndef symbols2array: explode | map(if . > 96 then .-87 else .-48 end);\n\n# $start should be a string of length 16 representing the starting state;\n# the goal is: \"123456789abcdef0\"\ndef init($start):\n  if $start|length == 16 then . else error end\n  | [range(1;16), 0] as $init\n  | {goal: $init,\n     position: positions($init),\n     distance: 0,\n     n: 0,           # number of moves so far\n     sequence: [],   # the sequence of moves so far\n     seen: {}\n  }\n  | .board =  ($start | symbols2array)\n  | .zero = (.board|index(0))\n  | (.board|tostring) as $s\n  | .seen[$s] = true\n;\n\n# Output: If the move of the zero tile to $p is legal in one step, \n#         then emit manhattan($tile; .zero) - manhattan($tile; $p)\n#         where $tile is the tile at $p;\n#         otherwise: null\ndef delta_move($p):\n  if $p >= 0 and $p < 16\n  then distance($p; .zero) as $base\n  | if ($base|length) == 1  # abs\n    then .board[$p] as $tile\n    | manhattan($tile; .zero) - manhattan($tile; $p)\n    else null\n    end\n  else null\n  end\u00a0;\n\n# For comparing the possible moves:\ndef moves:\n   {\"u\": delta_move( .zero - 4),\n    \"d\": delta_move( .zero + 4),\n    \"l\": delta_move( .zero - 1),\n    \"r\": delta_move( .zero + 1) }\n   | to_entries\n   | map(select( .value ) )\n   | sort_by(.value)\n  \u00a0;\n\n\n# input: the output of moves\ndef execute($moves):\n  ($moves[] |.key) as $key\n  |   if $key == \"l\" then left\n    elif $key == \"r\" then right\n    elif $key == \"u\" then up\n    elif $key == \"d\" then down\n    else empty\n    end;\n\n# $N is the maximum number of moves allowed\n# Input: as per `input`; .n is the number of moves so far\ndef possible_moves($N):\n  def possible_moves:\n    if .board == .goal then .  # a solution\n    elif (.sequence|length) >= $N then empty\n    else .sequence[-1] as $lastmove\n    | if   $lastmove == \"l\"  then execute(moves | map(select(.key\u00a0!= \"r\")))\n      elif $lastmove == \"r\"  then execute(moves | map(select(.key\u00a0!= \"l\")))\n      elif $lastmove == \"u\"  then execute(moves | map(select(.key\u00a0!= \"d\")))\n      elif $lastmove == \"d\"  then execute(moves | map(select(.key\u00a0!= \"u\")))\n      else                        execute(moves)\n      end\n    | possible_moves\n    end\u00a0;\n  possible_moves;\n\ndef solve($goal):\n  init($goal)\n  | total_manhattan_distance as $d\n  | first( range($d; 100) as $n\n           | .N = $n\n           | .distance = $d\n           | debug(\"before: n=\\($n) distance = \\($d))\")           \n           | possible_moves($n)\n           | .sequence | join(\"\") )\u00a0;\n\nsolve(\"fe169b4c0a73d852\")",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_48.txt",
        "content": "[\"DEBUG:\",36]\n[\"DEBUG:\",\"before: n=36 distance = 36)\"]\n[\"DEBUG:\",\"before: n=37 distance = 36)\"]\n[\"DEBUG:\",\"before: n=38 distance = 36)\"]\n...\n[\"DEBUG:\",\"before: n=52 distance = 36)\"]\n\"rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\"\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_49.txt",
        "content": "const Nr = [3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3]\nconst Nc = [3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2]\n\nconst N0 = zeros(Int, 85)\nconst N2 = zeros(UInt64, 85)\nconst N3 = zeros(UInt8, 85)\nconst N4 = zeros(Int, 85)\nconst i = 1\nconst g = 8\nconst ee = 2\nconst l = 4\nconst _n = Vector{Int32}([0])\n\nfunction fY(n::Int)\n    if N2[n + 1] == UInt64(0x123456789abcdef0)\n        return true, n\n    end\n    if N4[n + 1] <= _n[1]\n        return fN(n)\n    end\n    false, n\nend\n\nfunction fZ(w, n)\n    if w & i > 0\n        n = fI(n)\n        (y, n) = fY(n)\n        if y return (true, n) end\n        n -= 1\n    end\n    if w & g > 0\n        n = fG(n)\n        (y, n) = fY(n)\n        if y return (true, n) end\n        n -= 1\n    end\n    if w & ee > 0\n        n = fE(n)\n        (y, n) = fY(n)\n        if y return (true, n) end\n        n -= 1\n    end\n    if w & l > 0\n        n = fL(n)\n        (y, n) = fY(n)\n        if y return (true, n) end\n        n -= 1\n    end\n    false, n\nend\n\nfunction fN(n::Int)\n    x = N0[n + 1]\n    y = UInt8(N3[n + 1])\n    if x == 0\n        if y == UInt8('l')\n            return fZ(i, n)\n        elseif y == UInt8('u')\n            return fZ(ee, n)\n        else\n            return fZ(i + ee, n)\n        end\n    elseif x == 3\n        if y == UInt8('r')\n            return fZ(i, n)\n        elseif y == UInt8('u')\n            return fZ(l, n)\n        else\n            return fZ(i + l, n)\n        end\n    elseif x == 1 || x == 2\n        if y == UInt8('l')\n            return fZ(i + l, n)\n        elseif y == UInt8('r')\n            return fZ(i + ee, n)\n        elseif y == UInt8('u')\n            return fZ(ee + l, n)\n        else\n            return fZ(l + ee + i, n)\n        end\n    elseif x == 12\n        if y == UInt8('l')\n            return fZ(g, n)\n        elseif y == UInt8('d')\n            return fZ(ee, n)\n        else\n            return fZ(ee + g, n)\n        end\n    elseif x == 15\n        if y == UInt8('r')\n            return fZ(g, n)\n        elseif y == UInt8('d')\n            return fZ(l, n)\n        else\n            return fZ(g + l, n)\n        end\n    elseif x == 13 || x == 14\n        if y == UInt8('l')\n            return fZ(g + l, n)\n        elseif y == UInt8('r')\n            return fZ(ee + g, n)\n        elseif y == UInt8('d')\n            return fZ(ee + l, n)\n        else\n            return fZ(g + ee + l, n)\n        end\n    elseif x == 4 || x == 8\n        if y == UInt8('l')\n            return fZ(i + g, n)\n        elseif y == UInt8('u')\n            return fZ(g + ee, n)\n        elseif y == UInt8('d')\n            return fZ(i + ee, n)\n        else\n            return fZ(i + g + ee, n)\n        end\n    elseif x == 7 || x == 11\n        if y == UInt8('d')\n            return fZ(i + l, n)\n        elseif y == UInt8('u')\n            return fZ(g + l, n)\n        elseif y == UInt8('r')\n                return fZ(i + g, n)\n        else\n            return fZ(i + g + l, n)\n        end\n    else\n        if y == UInt8('d')\n            return fZ(i + ee + l, n)\n        elseif y == UInt8('l')\n                return fZ(i + g + l, n)\n        elseif y == UInt8('r')\n            return fZ(i + g + ee, n)\n        elseif y == UInt8('u')\n            return fZ(g + ee + l, n)\n        else\n            return fZ(i + g + ee + l, n)\n        end\n    end\nend\n\nfunction fI(n)\n    gg = (11 - N0[n + 1]) * 4\n    a = N2[n + 1] & (UInt64(0xf) << UInt(gg))\n    N0[n + 2] = N0[n + 1] + 4\n    N2[n + 2] = N2[n + 1] - a + (a << 16)\n    N3[n + 2] = UInt8('d')\n    N4[n + 2] = N4[n + 1]\n    cond = Nr[(a >> gg) + 1] <= div(N0[n + 1], 4)\n    if !cond\n        N4[n + 2] += 1\n    end\n    n += 1\n    n\nend\n\nfunction fG(n)\n    gg = (19 - N0[n + 1]) * 4\n    a = N2[n + 1] & (UInt64(0xf) << UInt(gg))\n    N0[n + 2] = N0[n + 1] - 4\n    N2[n + 2] = N2[n + 1] - a + (a >> 16)\n    N3[n + 2] = UInt8('u')\n    N4[n + 2] = N4[n + 1]\n    cond = Nr[(a >> gg) + 1] >= div(N0[n + 1], 4)\n    if !cond\n        N4[n + 2] += 1\n    end\n    n += 1\n    n\nend\n\nfunction fE(n)\n    gg = (14 - N0[n + 1]) * 4\n    a = N2[n + 1] & (UInt64(0xf) << UInt(gg))\n    N0[n + 2] = N0[n + 1] + 1\n    N2[n + 2] = N2[n + 1] - a + (a << 4)\n    N3[n + 2] = UInt8('r')\n    N4[n + 2] = N4[n + 1]\n    cond = Nc[(a >> gg) + 1] <= N0[n + 1] % 4\n    if !cond\n        N4[n + 2] += 1\n    end\n    n += 1\n    n\nend\n\nfunction fL(n)\n    gg = (16 - N0[n + 1]) * 4\n    a = N2[n + 1] & (UInt64(0xf) << UInt(gg))\n    N0[n + 2] = N0[n + 1] - 1\n    N2[n + 2] = N2[n + 1] - a + (a >> 4)\n    N3[n + 2] = UInt8('l')\n    N4[n + 2] = N4[n + 1]\n    cond = Nc[(a >> gg) + 1] >= N0[n + 1] % 4\n    if !cond\n        N4[n + 2] += 1\n    end\n    n += 1\n    n\nend\n\nfunction solve(n)\n    ans, n = fN(n)\n    if ans\n        println(\"Solution found in $n moves: \")\n        for ch in N3[2:n+1] print(Char(ch)) end; println()\n    else\n        println(\"next iteration, _n[1] will be $(_n[1] + 1)...\")\n        n = 0; _n[1] += 1; solve(n)\n    end\nend\n\nrun() = (N0[1] = 8; _n[1] = 1; N2[1] = 0xfe169b4c0a73d852; solve(0))\nrun()\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_5.txt",
        "content": "Solution found with 52 moves: rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd.\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_50.txt",
        "content": "\n\nnext iteration, _n[1] will be 2...\nnext iteration, _n[1] will be 3...\nnext iteration, _n[1] will be 4...\nnext iteration, _n[1] will be 5...\nnext iteration, _n[1] will be 6...\nnext iteration, _n[1] will be 7...\nnext iteration, _n[1] will be 8...\nSolution found in 52 moves:\nrrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_51.txt",
        "content": "next iteration, _n[1] will be 2...\nnext iteration, _n[1] will be 3...\nnext iteration, _n[1] will be 4...\nnext iteration, _n[1] will be 5...\nnext iteration, _n[1] will be 6...\nnext iteration, _n[1] will be 7...\nnext iteration, _n[1] will be 8...\nSolution found in 52 moves:\nrrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_52.txt",
        "content": "#!/usr/bin/lua\n--[[\nSolve 3X3 sliding tile puzzle using Astar on Lua. Requires 3mb and\nmillions of recursions.\nby RMM  2020-may-1\n]]--\n\nlocal SOLUTION_LIMIT, MAX_F_VALUE = 100,100\nlocal NR, NC, RCSIZE  = 4,4,4*4\nlocal Up, Down, Right, Left = 'u','d','r','l'\nlocal G_cols = {}  -- goal columns\nlocal G_rows = {} -- goal rows\nlocal C_cols = {} -- current cols\nlocal C_rows = {} -- current rows\nlocal Goal = {}\nlocal Tiles = {}\t\t-- the puzzle\nlocal Solution = {}\t\t-- final path is instance of desc\nlocal desc  = {}\t\t-- descending path\ndesc[0] = 0 -- override Lua default \"1\" index\n\n-- @brief create C compatible array for Lua\nlocal function Amake( list )\n   array = {}\n   for i=0, #list do\n      array[i] = list[i+1] -- simulate \"C\" array in Lua\n   end\n   return array\nend\n\nG_cols= Amake({0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, } )\nG_rows= Amake({0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, } )\nC_cols= Amake({0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, } )\nC_rows= Amake({0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0, } )\nTiles = Amake({ 15,14,1,6,  9,11,4,12,  0,10,7,3, 13,8,5,2,} )\nGoal  = Amake({1,2,3,4, 5,6,7,8, 9,10,11,12, 13,14,15,0,} )\n\nlocal m1 = {recursions=0, found=0, threshold=0, times=0, steps=0,}\n-- ---------------------------------------------------------------\n-- return 1D array index given 2D row,column\nlocal function rcidx( row, col )\n   return (row * NR + col)\nend\n\n-- @brief recursive search\n-- @return f_score\nlocal function search( depth, x_row, x_col, h_score)\n   local move, go_back_move, last_move_by_current\n   local f_score, ix, min, temp, hscore2, idx1\n   local N_minus_one = NR - 1;\n   local rc1 = {row=0,col=0}\n   local rc2 = {row=0,col=0}\n   local gtmp = {row=0,col=0}\n\n   f_score = depth + h_score;\n   if f_score > m1.threshold then  return f_score end\n   if h_score == 0 then do\n      m1.found = 1\n      Solution = table.concat(desc)\n      return f_score  end end\n   \n   m1.recursions = m1.recursions+1\n   m1.times = m1.times + 1\n   if m1.times > 200000 then do\n\t print(\"Recursions \",m1.recursions)\n\t m1.times = 0\n   end  end\n   \n   min = 999999\n   last_move_by_current = desc[depth];\n   rc1.row = x_row;\n   rc1.col = x_col;\n   for ix = 0,3 do\n      if ix==0 then do\n\t    move = Up;\n\t    go_back_move = Down;\n\t    rc2.row = x_row - 1;\n\t    rc2.col = x_col;\n\t\t   end\n      elseif ix==1 then do\n\t    move = Down;\n\t    go_back_move = Up;\n\t    rc2.row = x_row + 1;\n\t    rc2.col = x_col;\n\t\t       end\n      elseif ix==2 then do\n\t    move = Left;\n\t    go_back_move = Right;\n\t    rc2.row = x_row;\n\t    rc2.col = x_col - 1;\n\t\t       end\n      elseif ix==3 then do\n\t    move = Right;\n\t    go_back_move = Left;\n\t    rc2.row = x_row;\n\t    rc2.col = x_col + 1;\n\t\t\tend end\n      if move==Up and x_row==0 then goto next end\n      if move==Down and x_row==N_minus_one then goto next end\n      if move==Left and x_col==0 then goto next end\n      if move==Right and x_col==N_minus_one then goto next end\n      if last_move_by_current==go_back_move then goto next end\n      hscore2 = h_score\n      idx1 = Tiles[rcidx(rc2.row,rc2.col)]\n      gtmp.row = G_rows[idx1]\n      gtmp.col = G_cols[idx1]\n      local h_adj=0\n      if go_back_move==Up then do\n\t    if gtmp.row < C_rows[idx1] then\n\t       h_adj = -1 else h_adj = 1 end end\n      end\n      if go_back_move==Down then do\n\t    if gtmp.row > C_rows[idx1] then\n\t       h_adj = -1 else h_adj = 1 end end\n      end\n      if go_back_move==Left then do\n\t    if gtmp.col < C_cols[idx1] then\n\t       h_adj = -1 else h_adj = 1 end end\n      end\n      if go_back_move==Right then do\n\t    if gtmp.col > C_cols[idx1] then\n\t       h_adj = -1 else h_adj = 1 end end\n      end\n      hscore2 = hscore2 + h_adj\n      C_rows[0] = rc2.row;\n      C_cols[0] = rc2.col;\n      C_rows[idx1] = rc1.row;\n      C_cols[idx1] = rc1.col; \n      Tiles[rcidx(rc1.row,rc1.col)] = idx1;\n      Tiles[rcidx(rc2.row,rc2.col)] = 0;\n      desc[depth+1] = move\n      desc[depth+2] = '\\0'\n\n      temp = search(depth+1, rc2.row, rc2.col, hscore2); -- descend\n      -- regress\n      Tiles[rcidx(rc1.row,rc1.col)] = 0\n      Tiles[rcidx(rc2.row,rc2.col)] = idx1\n      desc[depth+1] = '\\0'\n      C_rows[0] = rc1.row;\n      C_cols[0] = rc1.col;\n      C_rows[idx1] = rc2.row;\n      C_cols[idx1] = rc2.col;\n      if m1.found == 1 then return temp end\n      if temp < min then  min = temp end\n      ::next::  -- Lua does not have \"continue;\" so uses goto\n   end  -- end for\n   m1.found = 0;\n   -- return the minimum f_score greater than m1.threshold\n   return min;\nend\n\n-- @brief  Run solver using A-star algorithm\n-- @param Tiles .. 3X3 sliding tile puzzle\nlocal function solve(Tiles)\n    local temp, i,j\n    local x_row, x_col, h_score = 0,0,0\n\n    m1.found = 0;\n    for i=0,(NR-1) do\n       for j=0, (NC-1) do\n\t  G_rows[ Goal[rcidx(i,j)] ] = i;\n\t  G_cols[ Goal[rcidx(i,j)] ] = j;\n\t  C_rows[ Tiles[rcidx(i,j)] ] = i;\n\t  C_cols[ Tiles[rcidx(i,j)] ] = j;\n       end\n    end\n    \n    for i=0,(NR-1) do\n       for j=0, (NC-1) do\n\t  if Tiles[rcidx(i,j)] == 0 then do\n\t\tx_row = i;\n\t\tx_col = j;\n\t\tbreak;\n\t\t\t\t\t end\n\t  end\n       end\n    end\n\n   desc[0] = '$'\n   desc[1] = '\\0'\n\n   h_score = 0;   -- Manhattan/Taxicab heuristic\n   for  i = 1,(RCSIZE-1) do\n      h_score = h_score + (math.abs(C_rows[i] - G_rows[i]) +\n\t\t    math.abs(C_cols[i] - G_cols[i]))\n   end\n   m1.threshold = h_score\n   print(\"solve -> search\")   \n   while true do\n      temp = search( 0, x_row, x_col, h_score);\n      if m1.found == 1 then do\n\t    print(\"Gound solution of length\",#Solution-1)\n\t    print(Solution)\n\t    break;\n      end end\n      \n      if temp > MAX_F_VALUE then do\n\t    print(\"Maximum f value reached! terminating! \\n\");\n\t    break;\t end\n      end\n      m1.threshold = temp;\n   end -- while\n   return 0\nend\n\n-- show sliding tile puzzle rows and columns\nlocal function print_tiles( pt)\n   local i,j,num\n    for i=0,(NR-1) do\n       for j=0, (NC-1) do\n\t  num = pt[rcidx(i,j)]\n\t  io.write(string.format(\"%02d \", num))\n       end\n       print(\"\")\n    end\n    print(\"\")\nend\n\n-- main(void) {\nprint(\"Solve sliding 15 tile puzzle\");\nm1.recursions = 0\nm1.times=0\nprint_tiles(Tiles);\nprint_tiles(Goal)\nsolve(Tiles);\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_53.txt",
        "content": "\n\nFOUND SOLUTION of length 52 rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_54.txt",
        "content": "FOUND SOLUTION of length 52 rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_55.txt",
        "content": "----------\n-- SOLVER\n----------\n\nlocal table_concat = table.concat -- local alias\n\nlocal function Solver(root, h, successors)\n  local pathlist, pathhash, iters\n  -- it is required that \"h(node)\" returns:\n  --   0 when \"is_goal(node)==true\"\n  --   >0 when \"is_goal(node)==false\"\n  --   (because it allows for some simplification herein)\n  local FOUND = 0 -- ie: \"is_goal(node)==true\"\n  local NOT_FOUND = 1e9 -- some number larger than largest possible f\n\n  local function hash(node)\n    return table_concat(node,\",\")\n  end\n\n  local function search(g, bound)\n    iters = iters + 1\n    --if ((iters\u00a0% 1000000) == 0) then print(\"iterations:\", iters) end\n    local node = pathlist[#pathlist]\n    local h = h(node)\n    local f = g + h\n    if (f > bound) then return f end\n    if (h == FOUND) then return FOUND end\n    local min = NOT_FOUND\n    for succ, cost in successors(node) do\n      local succhash = hash(succ)\n      if (not pathhash[succhash]) then\n        pathlist[#pathlist+1], pathhash[succhash] = succ, true\n        local t = search(g+cost, bound)\n        if (t == FOUND) then return FOUND end\n        if (t < min) then min = t end\n        pathlist[#pathlist], pathhash[succhash] = nil, nil\n      end\n    end\n    return min\n  end\n\n  return {\n    solve = function()\n      pathlist = { root }\n      pathhash = { [hash(root)] = true }\n      iters = 0\n      local bound = h(root)\n      while true do\n        bound = search(0, bound)\n        if (bound == FOUND) then return bound, iters, pathlist end\n        if (bound == NOT_FOUND) then return bound, iters, nil end\n      end\n    end\n  }\nend\n\n------------------\n-- DOMAIN SUPPORT\n------------------\n\nlocal i2c = { [0]=0, 1,2,3,4, 1,2,3,4, 1,2,3,4, 1,2,3,4 } -- convert index to column\nlocal i2r = { [0]=0, 1,1,1,1, 2,2,2,2, 3,3,3,3, 4,4,4,4 } -- convert index to row\nlocal R, U, L, D = 1, -4, -1, 4 -- move indexing values\nlocal movenames = { -- move names\n  [0]=\"\", [R]=\"r\", [U]=\"u\", [L]=\"l\", [D]=\"d\"\n}\nlocal succmoves = { -- successor directions\n  {R,D}, {R,L,D}, {R,L,D}, {L,D},\n  {R,U,D}, {R,U,L,D}, {R,U,L,D}, {U,L,D},\n  {R,U,D}, {R,U,L,D}, {R,U,L,D}, {U,L,D},\n  {R,U}, {R,U,L}, {R,U,L}, {U,L}\n}\nlocal manhdists = { -- manhattan distances\n  { [0]=0, 0, 1, 2, 3, 1, 2, 3, 4, 2, 3, 4, 5, 3, 4, 5, 6 },\n  { [0]=0, 1, 0, 1, 2, 2, 1, 2, 3, 3, 2, 3, 4, 4, 3, 4, 5 },\n  { [0]=0, 2, 1, 0, 1, 3, 2, 1, 2, 4, 3, 2, 3, 5, 4, 3, 4 },\n  { [0]=0, 3, 2, 1, 0, 4, 3, 2, 1, 5, 4, 3, 2, 6, 5, 4, 3 },\n  { [0]=0, 1, 2, 3, 4, 0, 1, 2, 3, 1, 2, 3, 4, 2, 3, 4, 5 },\n  { [0]=0, 2, 1, 2, 3, 1, 0, 1, 2, 2, 1, 2, 3, 3, 2, 3, 4 },\n  { [0]=0, 3, 2, 1, 2, 2, 1, 0, 1, 3, 2, 1, 2, 4, 3, 2, 3 },\n  { [0]=0, 4, 3, 2, 1, 3, 2, 1, 0, 4, 3, 2, 1, 5, 4, 3, 2 },\n  { [0]=0, 2, 3, 4, 5, 1, 2, 3, 4, 0, 1, 2, 3, 1, 2, 3, 4 },\n  { [0]=0, 3, 2, 3, 4, 2, 1, 2, 3, 1, 0, 1, 2, 2, 1, 2, 3 },\n  { [0]=0, 4, 3, 2, 3, 3, 2, 1, 2, 2, 1, 0, 1, 3, 2, 1, 2 },\n  { [0]=0, 5, 4, 3, 2, 4, 3, 2, 1, 3, 2, 1, 0, 4, 3, 2, 1 },\n  { [0]=0, 3, 4, 5, 6, 2, 3, 4, 5, 1, 2, 3, 4, 0, 1, 2, 3 },\n  { [0]=0, 4, 3, 4, 5, 3, 2, 3, 4, 2, 1, 2, 3, 1, 0, 1, 2 },\n  { [0]=0, 5, 4, 3, 4, 4, 3, 2, 3, 3, 2, 1, 2, 2, 1, 0, 1 },\n  { [0]=0, 6, 5, 4, 3, 5, 4, 3, 2, 4, 3, 2, 1, 3, 2, 1, 0 },\n}\n\n--- create a state from a pattern, optionally applying a move\nlocal function state(patt, move)\n  local node = {}\n  for k,v in pairs(patt) do node[k] = v end\n  if (move) then\n    local e = node.e\n    local ep = e + move\n    node[e], node[ep] = node[ep], 0\n    node.e, node.m = ep, move\n  end\n  return node\nend\n\n--- iterator for successors of node\nlocal function successors(node)\n  local moves = succmoves[node.e]\n  local i, n = 0, #moves\n  return function()\n    i = i + 1\n    if (i <= n) then\n      return state(node, moves[i]), 1\n    end\n  end\nend\n\n--- hueristic estimate of travel cost from node to goal\nlocal function h(node)\n  local sum, ijx, jix, t = 0, 1, 1\n  for i = 1, 4 do\n    local colmax, rowmax = 0, 0\n    for j = 1, 4 do\n      t = node[ijx]\n      sum = sum + manhdists[ijx][t] -- manhattan\n      if (i2r[t] == i) then -- row conflicts\n        if (t > rowmax) then rowmax=t else sum=sum+2 end\n      end\n      t = node[jix]\n      if (i2c[t] == i) then -- col conflicts\n        if (t > colmax) then colmax=t else sum=sum+2 end\n      end\n      ijx, jix = ijx+1, jix+4\n    end\n    jix = jix - 15\n  end\n  return sum\nend\n\n------------------\n-- PRINT SUPPORT:\n------------------\n\nlocal function printnode(node)\n  print(\"+--+--+--+--+\")\n  for i = 0, 12, 4 do\n    print( string.format(\"|%2d|%2d|%2d|%2d|\", node[i+1], node[i+2], node[i+3], node[i+4]) )\n    print(\"+--+--+--+--+\")\n  end\nend\n\nlocal function printpath(path)\n  -- note that #path is 1 longer than solution due to root node at path[1]\n  -- concatenated result will be correct length since movenames[root.m]==\"\"\n  local t = {}\n  for i, node in ipairs(path) do\n    t[i] = movenames[node.m]\n  end\n  local pathstr = table_concat(t)\n  print(\"SOLUTION: \" .. pathstr .. \" (length: \" .. #pathstr .. \")\")\nend\n\n---------\n-- TASKS:\n---------\n\n-- goal is implied by h(), never actually used (see solver's notes)\n-- local goal = state({ 1,2,3,4, 5,6,7,8, 9,10,11,12, 13,14,15,0, e=16, m=0 })\n\ndo\n  print(\"PRIMARY TASK (OPTIMALLY)\")\n  local sclock = os.clock()\n  local root = state({ 15,14,1,6, 9,11,4,12, 0,10,7,3, 13,8,5,2, e=9, m=0 })\n  printnode(root)\n  local solver = Solver(root, h, successors)\n  local bound, iters, path = solver:solve()\n  printpath(path)\n  printnode(path[#path])\n  print(\"ITERATIONS: \" .. iters)\n  print(\"ELAPSED: \" .. (os.clock()-sclock) .. \"s\")\nend\n\nprint()\n\ndo\n  print(\"EXTRA CREDIT TASK (APPROXIMATELY, NON-OPTIMALLY)\")\n  -- only primary task specifies \"fewest possible moves\"\n  -- extra credit task only specifies \"solve\", so..\n  local sclock = os.clock()\n  local root = state({ 0,12,9,13, 15,11,10,14, 3,7,2,5, 4,8,6,1, e=1, m=0 })\n  printnode(root)\n  local function hec(node)\n    -- overweighting h makes it not admissible,\n    -- causing solver to favor g when minimizing,\n    -- leading to non-optimal (but much easier to find!) solutions\n    return h(node)*1.5\n  end\n  local solver = Solver(root, hec, successors)\n  local bound, iters, path = solver:solve()\n  printpath(path) --> 86, optimal solution is known to be 80\n  printnode(path[#path])\n  print(\"ITERATIONS: \" .. iters)\n  print(\"ELAPSED: \" .. (os.clock()-sclock) .. \"s\")\nend\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_56.txt",
        "content": "PRIMARY TASK (OPTIMALLY)\n+--+--+--+--+\n|15|14| 1| 6|\n+--+--+--+--+\n| 9|11| 4|12|\n+--+--+--+--+\n| 0|10| 7| 3|\n+--+--+--+--+\n|13| 8| 5| 2|\n+--+--+--+--+\nSOLUTION: rrruldluuldrurdddluulurrrdlddruldluurddlulurruldrrdd (length: 52)\n+--+--+--+--+\n| 1| 2| 3| 4|\n+--+--+--+--+\n| 5| 6| 7| 8|\n+--+--+--+--+\n| 9|10|11|12|\n+--+--+--+--+\n|13|14|15| 0|\n+--+--+--+--+\nITERATIONS: 4963696\nELAPSED: 34.279s\n\nEXTRA CREDIT TASK (APPROXIMATELY, NON-OPTIMALLY)\n+--+--+--+--+\n| 0|12| 9|13|\n+--+--+--+--+\n|15|11|10|14|\n+--+--+--+--+\n| 3| 7| 2| 5|\n+--+--+--+--+\n| 4| 8| 6| 1|\n+--+--+--+--+\nSOLUTION: rrdldruldluruldrdrrululdrddlluurrddlluurrdrdllurrdlluruurddluurddluulddrdluluruldddrrr (length: 86)\n+--+--+--+--+\n| 1| 2| 3| 4|\n+--+--+--+--+\n| 5| 6| 7| 8|\n+--+--+--+--+\n| 9|10|11|12|\n+--+--+--+--+\n|13|14|15| 0|\n+--+--+--+--+\nITERATIONS: 1325248\nELAPSED: 9.101s\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_57.txt",
        "content": "# 15 puzzle.\n\nimport strformat\nimport times\n\nconst\n  Nr = [3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3]\n  Nc = [3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2]\n\ntype\n\n  Solver = object\n    n: int\n    np: int\n    n0: array[100, int]\n    n2: array[100, uint64]\n    n3: array[100, char]\n    n4: array[100, int]\n\n  Value = range[0..15]\n\n# Forward definition.\nproc fN(s: var Solver): bool\n\n#---------------------------------------------------------------------------------------------------\n\nproc fI(s: var Solver) =\n\n  let n = s.n\n  let g = (11 - s.n0[n]) * 4\n  let a = s.n2[n] and uint(15 shl g)\n  s.n0[n + 1] = s.n0[n] + 4\n  s.n2[n + 1] = s.n2[n] - a + a shl 16\n  s.n3[n + 1] = 'd'\n  s.n4[n + 1] = s.n4[n] + ord(Nr[a shr g] > s.n0[n] div 4)\n\n#---------------------------------------------------------------------------------------------------\n\nproc fG(s: var Solver) =\n\n  let n = s.n\n  let g = (19 - s.n0[n]) * 4\n  let a = s.n2[n] and uint(15 shl g)\n  s.n0[n + 1] = s.n0[n] - 4\n  s.n2[n + 1] = s.n2[n] - a + a shr 16\n  s.n3[n + 1] = 'u'\n  s.n4[n + 1] = s.n4[n] + ord(Nr[a shr g] < s.n0[n] div 4)\n\n#---------------------------------------------------------------------------------------------------\n\nproc fE(s: var Solver) =\n\n  let n = s.n\n  let g = (14 - s.n0[n]) * 4\n  let a = s.n2[n] and uint(15 shl g)\n  s.n0[n + 1] = s.n0[n] + 1\n  s.n2[n + 1] = s.n2[n] - a + a shl 4\n  s.n3[n + 1] = 'r'\n  s.n4[n + 1] = s.n4[n] + ord(Nc[a shr g] > s.n0[n] mod 4)\n\n#---------------------------------------------------------------------------------------------------\n\nproc fL(s: var Solver) =\n\n  let n = s.n\n  let g = (16 - s.n0[n]) * 4\n  let a = s.n2[n] and uint(15 shl g)\n  s.n0[n + 1] = s.n0[n] - 1\n  s.n2[n + 1] = s.n2[n] - a + a shr 4\n  s.n3[n + 1] = 'l'\n  s.n4[n + 1] = s.n4[n] + ord(Nc[a shr g] < s.n0[n] mod 4)\n\n#---------------------------------------------------------------------------------------------------\n\nproc fY(s: var Solver): bool =\n\n  if s.n2[s.n] == 0x123456789abcdef0'u:\n    return true\n  if s.n4[s.n] <= s.np:\n    return s.fN()\n\n#---------------------------------------------------------------------------------------------------\n\nproc fN(s: var Solver): bool =\n\n  let n = s.n\n  if s.n3[n] != 'u' and s.n0[n] div 4 < 3:\n    s.fI\n    inc s.n\n    if s.fY(): return true\n    dec s.n\n  if s.n3[n] != 'd' and s.n0[n] div 4 > 0:\n    s.fG()\n    inc s.n\n    if s.fY(): return true\n    dec s.n\n  if s.n3[n] != 'l' and s.n0[n] mod 4 < 3:\n    s.fE()\n    inc s.n\n    if s.fY(): return true\n    dec s.n\n  if s.n3[n] != 'r' and s.n0[n] mod 4 > 0:\n    s.fL()\n    inc s.n\n    if s.fY(): return true\n    dec s.n\n\n#---------------------------------------------------------------------------------------------------\n\nproc initSolver(values: array[16, Value]): Solver {.noInit.} =\n\n  result.n = 0\n  result.np = 0\n  result.n0[0] = values.find(0)\n  result.n2[0] = (var tmp = 0'u; for val in values: tmp = tmp shl 4 or uint(val); tmp)\n  result.n4[0] = 0\n\n#---------------------------------------------------------------------------------------------------\n\nproc run(s: var Solver) =\n\n  while not s.fY():\n    inc s.np\n  stdout.write(fmt\"Solution found with {s.n} moves: \")\n  for g in 1..s.n:\n    stdout.write(s.n3[g])\n  stdout.write(\".\\n\")\n\n#---------------------------------------------------------------------------------------------------\n\nproc toString(d: Duration): string =\n  # Custom representation of a duration.\n  const Plural: array[bool, string] = [\"\", \"s\"]\n  var ms = d.inMilliseconds\n  for (label, d) in {\"hour\": 3_600_000, \"minute\": 60_000, \"second\": 1_000, \"millisecond\": 1}:\n    let val = ms div d\n    if val > 0:\n      result.add($val & ' ' & label & Plural[val > 1])\n      ms = ms mod d\n      if ms > 0: result.add(' ')\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_58.txt",
        "content": "let start = getTime()\nvar solver = initSolver([Value 15, 14,  1,  6,\n                                9, 11,  4, 12,\n                                0, 10,  7,  3,\n                               13,  8,  5,  2])\nsolver.run()\necho fmt\"Execution time: {(getTime() - start).toString}.\"\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_59.txt",
        "content": "Solution found with 52 moves: rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd.\nExecution time: 504 milliseconds.\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_6.txt",
        "content": "/* ARM assembly AARCH64 Raspberry PI 3B */\n/*  program puzzle15solvex64.s   */\n/* this program is a adaptation algorithme C++ and go rosetta code */\n/* thanck for the creators */ \n/* 1 byte by box on game board */\n\n/* create a file with nano  */\n/*  15,  2,   3,   4\n    5,   6,   7,   1\n    9,   10,  8,   11\n   13,  14,  12, 0     */\n   \n/*   Run this programm\u00a0: puzzle15solver64 <file name> */\n/*   wait several minutes for r\u00e9sult */\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 TRUE, 1\n.equ FALSE, 0\n\n.equ SIZE,           4\n.equ NBBOX,          SIZE * SIZE\n.equ TAILLEBUFFER,   100\n.equ NBMAXIELEMENTS, 100\n\n.equ CONST_I,    1\n.equ CONST_G,    8\n.equ CONST_E,    2\n.equ CONST_L,    4\n\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nszMessTitre:           .asciz \"File name\u00a0: \"\nsMessResult:           .ascii \" \"\nsMessValeur:           .fill 22, 1, ' '             // size => 21\nszCarriageReturn:      .asciz \"\\n\"\nszMessCounterSolution: .asciz \"Solution in @ moves\u00a0: \\n\"\n\nszMessErreur:          .asciz \"Error detected.\\n\"\nszMessImpossible:      .asciz \"!!! Impossible solution\u00a0!!!\\n\"\nszMessErrBuffer:       .asciz \"buffer size too less\u00a0!!\"\nszMessSpaces:          .asciz \"    \"\n\nqTabNr:  .quad 3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3\nqTabNc:  .quad 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\n.align 8\nsZoneConv:      .skip 24\nqAdrHeap:       .skip 8\ntbBox:          .skip SIZE * SIZE           // game boxes\nqAdrFicName:    .skip 8\nqTabN0:         .skip 8 * NBMAXIELEMENTS    // empty box\nqTabN3:         .skip 8 * NBMAXIELEMENTS    // moves\nqTabN4:         .skip 8 * NBMAXIELEMENTS    //\u00a0????\nqTabN2:         .skip 8 * NBMAXIELEMENTS    // table game address\nsBuffer:        .skip TAILLEBUFFER\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                            // INFO: main\n    mov x0,sp                    // stack address for load parameter\n    bl traitFic                  // read file and store value in array\n    cmp x0,#-1\n    beq 100f                     // error\u00a0?\n\n    ldr x0,qAdrtbBox\n    bl displayGame               // display array game\n    \n    ldr x0,qAdrtbBox              // control if solution exists\n    bl controlSolution\n    cmp x0,#TRUE\n    beq 1f\n    ldr x0,qAdrszMessImpossible  // no solution\u00a0!!!\n    bl affichageMess\n    b 100f\n\n1:\n \n    ldr x0,qAdrtbBox\n    ldr x9,qAdrqTabN2\n    str x0,[x9]                  // N2 address global\n    mov x10,#0                   // variable _n global\n    mov x12,#0                   // variable n global \n    bl searchSolution\n    cmp x0,#TRUE\n    bne 100f                     // no solution\u00a0?\n    ldr x3,qAdrqTabN2\n    ldr x0,[x3,x12,lsl #3]       // visual solution control\n    bl displayGame\n    mov x0,x12                   // move counter\n    ldr x1,qAdrsZoneConv\n    bl conversion10              // conversion counter\n    ldr x0,qAdrszMessCounterSolution\n    bl strInsertAtCharInc\n    ldr x1,qAdrsZoneConv\n    bl affichageMess\n    ldr x5,qAdrqTabN3\n    ldr x3,qAdrsBuffer\n    mov x2,#1\n    mov x4,#0\n2:                                // loop solution display \n    ldr x1,[x5,x2,lsl 3]\n    cmp x2,#TAILLEBUFFER\n    bge 99f\n    strb w1,[x3,x4]\n    add x4,x4,#1\n    add x2,x2,#1\n    cmp x2,x12\n    ble 2b\n    mov x1,#0\n    strb w1,[x3,x4]                 // z\u00e9ro final\n    mov x0,x3\n    bl affichageMess\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess\n    \n    b 100f\n\n99:\n    ldr x0,qAdrszMessErrBuffer\n    bl affichageMess\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 \nqAdrtbBox:                  .quad tbBox\nqAdrqTabN0:                .quad qTabN0\nqAdrqTabN2:                .quad qTabN2\nqAdrqTabN3:                .quad qTabN3\nqAdrqTabN4:                .quad qTabN4\nqAdrszMessCounterSolution: .quad szMessCounterSolution\nqAdrszMessImpossible:      .quad szMessImpossible\nqAdrszMessErrBuffer:       .quad szMessErrBuffer\nqAdrsZoneConv:             .quad sZoneConv\n/******************************************************************/\n/*      search    Solution                                        */ \n/******************************************************************/\nsearchSolution:                  // INFO: searchSolution\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n                                 // address allocation place on the heap\n    mov x0,#0                    // allocation place heap\n    mov x8,BRK                   // call system 'brk'\n    svc #0\n    cmp x0,#-1                   // allocation error\n    beq 99f\n    ldr x1,qAdrqAdrHeap\n    str x0,[x1]                  // store heap address\n    bl functionFN\n    ldr x3,qAdrqTabN2\n    ldr x0,[x3,x12,lsl #3]       // last current game\n    bl gameOK                    // it is Ok\u00a0?\n    cmp x0,#TRUE\n    beq 100f                     // yes --> end\n\n    ldr x1,qAdrqAdrHeap          // free up resources\n    ldr x0,[x1]                  // restaur start address heap\n    mov x8,BRK                   // call system 'brk'\n    svc #0\n    cmp x0,#-1                   // allocation error\n    beq 99f\n    add x10,x10,#1               // _n\n    mov x12,#0                   // n\n    bl searchSolution            // next recursif call\n    b 100f\n99:\n    ldr x0,qAdrszMessErreur\n    bl affichageMess\n100:\n    ldp x8,x9,[sp],16            // restaur des  2 registres\n    ldp x6,x7,[sp],16            // restaur des  2 registres\n    ldp x4,x5,[sp],16            // restaur des  2 registres\n    ldp x2,x3,[sp],16            // restaur des  2 registres\n    ldp x1,lr,[sp],16            // restaur des  2 registres\n    ret\nqAdrszMessErreur:           .quad szMessErreur\nqAdrqAdrHeap:               .quad qAdrHeap\n/******************************************************************/\n/*     Fonction FN                                                */ \n/******************************************************************/\nfunctionFN:                      // INFO: functionFN\n    stp x1,lr,[sp,-16]!          // save  registres\n    ldr x4,qAdrqTabN3\n    ldr x3,[x4,x12,lsl #3]\n    ldr x5,qAdrqTabN0            // load position empty box\n    ldr x6,[x5,x12,lsl #3]\n    cmp x6,#15                   // last box\n    bne 2f\n    cmp x3,#'R'\n    bne 11f\n    mov x0,#CONST_G\n    bl functionFZ\n    b 100f\n11:\n    cmp x3,#'D'\n    bne 12f\n    mov x0,#CONST_L\n    bl functionFZ\n    b 100f\n12:\n    mov x0,#CONST_G + CONST_L\n    bl functionFZ\n    b 100f\n    \n2:\n    cmp x6,#12\n    bne 3f\n    cmp x3,#'L'\n    bne 21f\n    mov x0,#CONST_G\n    bl functionFZ\n    b 100f\n21:\n    cmp x3,#'D'\n    bne 22f\n    mov x0,#CONST_E\n    bl functionFZ\n    b 100f\n22:\n    mov x0,#CONST_E + CONST_G\n    bl functionFZ\n    b 100f\n3:\n    cmp x6,#13\n    beq 30f\n    cmp x6,#14\n    bne 4f\n30:\n    cmp x3,#'L'\n    bne 31f\n    mov x0,#CONST_G + CONST_L\n    bl functionFZ\n    b 100f\n31:\n    cmp x3,#'R'\n    bne 32f\n    mov x0,#CONST_G + CONST_E\n    bl functionFZ\n    b 100f\n32:\n    cmp x3,#'D'\n    bne 33f\n    mov x0,#CONST_E + CONST_L\n    bl functionFZ\n    b 100f\n33:\n    mov x0,#CONST_L + CONST_E + CONST_G\n    bl functionFZ\n    b 100f\n4:\n    cmp x6,#3\n    bne 5f\n    cmp x3,#'R'\n    bne 41f\n    mov x0,#CONST_I\n    bl functionFZ\n    b 100f\n41:\n    cmp x3,#'U'\n    bne 42f\n    mov x0,#CONST_L\n    bl functionFZ\n    b 100f\n42:\n    mov x0,#CONST_I + CONST_L\n    bl functionFZ\n    b 100f\n5:\n    cmp x6,#0\n    bne 6f\n    cmp x3,#'L'\n    bne 51f\n    mov x0,#CONST_I\n    bl functionFZ\n    b 100f\n51:\n    cmp x3,#'U'\n    bne 52f\n    mov x0,#CONST_E\n    bl functionFZ\n    b 100f\n52:\n    mov x0,#CONST_I + CONST_E\n    bl functionFZ\n    b 100f\n6:\n    cmp x6,#1\n    beq 60f\n    cmp x6,#2\n    bne 7f\n60:\n    cmp x3,#'L'\n    bne 61f\n    mov x0,#CONST_I + CONST_L\n    bl functionFZ\n    b 100f\n61:\n    cmp x3,#'R'\n    bne 62f\n    mov x0,#CONST_E + CONST_I\n    bl functionFZ\n    b 100f\n62:\n    cmp x3,#'U'\n    bne 63f\n    mov x0,#CONST_E + CONST_L\n    bl functionFZ\n    b 100f\n63:\n    mov x0,#CONST_I + CONST_E + CONST_L\n    bl functionFZ\n    b 100f\n7:\n    cmp x6,#7\n    beq 70f\n    cmp x6,#11\n    bne 8f\n70:\n    cmp x3,#'R'\n    bne 71f\n    mov x0,#CONST_I + CONST_G\n    bl functionFZ\n    b 100f\n71:\n    cmp x3,#'U'\n    bne 72f\n    mov x0,#CONST_G + CONST_L\n    bl functionFZ\n    b 100f\n72:\n    cmp x3,#'D'\n    bne 73f\n    mov x0,#CONST_I + CONST_L\n    bl functionFZ\n    b 100f\n73:\n    mov x0,#CONST_I + CONST_G + CONST_L\n    bl functionFZ\n    b 100f\n8:\n    cmp x6,#4\n    beq 80f\n    cmp x6,#8\n    bne 9f\n80:\n    cmp x3,#'D'\n    bne 81f\n    mov x0,#CONST_I + CONST_E\n    bl functionFZ\n    b 100f\n81:\n    cmp x3,#'U'\n    bne 82f\n    mov x0,#CONST_G + CONST_E\n    bl functionFZ\n    b 100f\n82:\n    cmp x3,#'L'\n    bne 83f\n    mov x0,#CONST_I + CONST_G\n    bl functionFZ\n    b 100f\n83:\n    mov x0,#CONST_G + CONST_E + CONST_I\n    bl functionFZ\n    b 100f\n9:\n    cmp x3,#'D'\n    bne 91f\n    mov x0,#CONST_I + CONST_E + CONST_L\n    bl functionFZ\n    b 100f\n91:\n    cmp x3,#'L'\n    bne 92f\n    mov x0,#CONST_I + CONST_G + CONST_L\n    bl functionFZ\n    b 100f\n92:\n    cmp x3,#'R'\n    bne 93f\n    mov x0,#CONST_I + CONST_G + CONST_E\n    bl functionFZ\n    b 100f\n93:\n    cmp x3,#'U'\n    bne 94f\n    mov x0,#CONST_G + CONST_E +  CONST_L\n    bl functionFZ\n    b 100f\n94:\n    mov x0,#CONST_G + CONST_L + CONST_I + CONST_E\n    bl functionFZ\n    b 100f\n\n99:                             // error\n    ldr x0,qAdrszMessErreur\n    bl affichageMess\n100:\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n\n/******************************************************************/\n/*     function FZ                           */ \n/*                                                 */\n/***************************************************************/\n/* x0 contains variable w           */\nfunctionFZ:                    // INFO: functionFZ\n    stp x1,lr,[sp,-16]!        // save  registres\n    stp x2,x3,[sp,-16]!        // save  registres\n    mov x2,x0 \n    and x1,x2,#CONST_I\n    cmp x1,#0\n    ble 1f\n    bl functionFI\n    bl functionFY\n    cmp x0,#TRUE\n    beq 100f\n    sub x12,x12,#1              // variable n\n1:\n    ands x1,x2,#CONST_G\n    ble 2f\n    bl functionFG\n    bl functionFY\n    cmp x0,#TRUE\n    beq 100f\n    sub x12,x12,#1              // variable n\n2:\n    ands x1,x2,#CONST_E\n    ble 3f\n    bl functionFE\n    bl functionFY\n    cmp x0,#TRUE\n    beq 100f\n    sub x12,x12,#1              // variable n\n3:\n    ands x1,x2,#CONST_L\n    ble 4f\n    bl functionFL\n    bl functionFY\n    cmp x0,#TRUE\n    beq 100f\n    sub x12,x12,#1              // variable n\n4:\n    mov x0,#FALSE\n100:\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*               function FY                                 */ \n/******************************************************************/\nfunctionFY:                    // INFO: functionFY\n    stp x1,lr,[sp,-16]!        // save  registres\n    ldr x1,qAdrqTabN2\n    ldr x0,[x1,x12,lsl #3]\n    bl gameOK                  // game OK\u00a0?\n    cmp x0,#TRUE\n    beq 100f\n    ldr x1,qAdrqTabN4\n    ldr x0,[x1,x12,lsl #3]\n    cmp x0,x10\n    bgt 1f\n    bl functionFN\n    b 100f\n1:\n    mov x0,#FALSE\n100:\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*     the empty box is down                                     */ \n/******************************************************************/\nfunctionFI:                       // INFO: functionFI\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    ldr x0,qAdrqTabN0\n    ldr x1,[x0,x12,lsl #3]        // empty box\n    add x2,x1,#4\n    ldr x3,[x9,x12,lsl #3]        // load game current\n    ldrb w4,[x3,x2]               // load box down empty box\n    add x5,x12,#1                 // n+1\n    add x8,x1,#4                  // new position empty case\n    str x8,[x0,x5,lsl #3]         // store new position empty case\n    ldr x6,qAdrqTabN3\n    \n    mov x7,#'D'                   // down\n    str x7,[x6,x5,lsl #3]         // store move\n    ldr x6,qAdrqTabN4\n    ldr x7,[x6,x12,lsl #3]\n    str x7,[x6,x5,lsl #3]         // N4 (n+1) = n4(n)\n    mov x0,x3\n    bl createGame                 // create copy game\n    ldrb w3,[x0,x1]               // and inversion box\n    ldrb w8,[x0,x2]\n    strb w8,[x0,x1]\n    strb w3,[x0,x2]\n    str x0,[x9,x5,lsl #3]         // store new game in table\n    lsr x1,x1,#2                  // line position empty case = N\u00b0/ 4\n    ldr x0,qAdrqTabNr\n    ldr x2,[x0,x4,lsl #3]         // load N\u00b0 line box moved\n    cmp x2,x1                     // compare\u00a0????\n    ble 1f\n    add x7,x7,#1                  // and increment\u00a0????\n    str x7,[x6,x5,lsl #3]\n1:\n    add x12,x12,#1                // increment N\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\nqAdrqTabNr:        .quad qTabNr\nqAdrqTabNc:        .quad qTabNc\n/******************************************************************/\n/*     empty case UP   see explain in english in function FI      */ \n/******************************************************************/\nfunctionFG:                      // INFO: functionFG\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    ldr x0,qAdrqTabN0\n    ldr x1,[x0,x12,lsl #3]       // case vide\n    sub x2,x1,#4                 // position case au dessus\n    ldr x3,[x9,x12,lsl #3]       // extrait jeu courant\n    ldrb w4,[x3,x2]              // extrait le contenu case au dessus\n    add x5,x12,#1                // N+1 = N\n    sub x8,x1,#4                 // nouvelle position case vide\n    str x8,[x0,x5,lsl #3]        // et on la stocke\n    ldr x6,qAdrqTabN3\n    mov x7,#'U'                  // puis on stocke le code mouvement\n    str x7,[x6,x5,lsl #3]\n    ldr x6,qAdrqTabN4\n    ldr x7,[x6,x12,lsl #3]\n    str x7,[x6,x5,lsl #3]        // N4 (N+1) = N4 (N)\n    mov x0,x3                    // jeu courant\n    bl createGame                // cr\u00e9ation nouveau jeu\n    ldrb w3,[x0,x1]              // et echange les 2 cases\n    ldrb w8,[x0,x2]\n    strb w8,[x0,x1]\n    strb w3,[x0,x2]\n    str x0,[x9,x5,lsl #3]        // stocke la nouvelle situation \n    lsr x1,x1,#2                 // ligne case vide = position /4\n    ldr x0,qAdrqTabNr\n    ldr x2,[x0,x4,lsl #3]        // extrait table \u00e0 la position case\n    cmp x2,x1                    // et comparaison\u00a0???\n    bge 1f\n    add x7,x7,#1                 // puis increment N4 de 1 \u00a0???\n    str x7,[x6,x5,lsl #3]\n1:\n    add x12,x12,#1               // increment de N\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*    empty case go right see explain finction FI ou FG en fran\u00e7ais */ \n/******************************************************************/\nfunctionFE:                       // INFO: functionFE\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    ldr x0,qAdrqTabN0\n    ldr x1,[x0,x12,lsl #3]\n    add x2,x1,#1\n    ldr x3,[x9,x12,lsl #3]\n    ldrb w4,[x3,x2]               // extrait le contenu case \n    add x5,x12,#1\n    add x8,x1,#1\n    str x8,[x0,x5,lsl #3]         // nouvelle case vide\n    ldr x6,qAdrqTabN3\n    mov x7,#'R'\n    str x7,[x6,x5,lsl #3]         // mouvement\n    ldr x6,qAdrqTabN4\n    ldr x7,[x6,x12,lsl #3]\n    str x7,[x6,x5,lsl #3]         // N4\u00a0??\n    mov x0,x3\n    bl createGame\n    ldrb w3,[x0,x1]               // exchange two boxes\n    ldrb w8,[x0,x2]\n    strb w8,[x0,x1]\n    strb w3,[x0,x2]\n    str x0,[x9,x5,lsl #3]         // stocke la nouvelle situation \n    lsr x3,x1,#2\n    sub x1,x1,x3,lsl #2\n    ldr x0,qAdrqTabNc\n    ldr x2,[x0,x4,lsl #3]         // extrait table \u00e0 la position case\n    cmp x2,x1\n    ble 1f\n    add x7,x7,#1\n    str x7,[x6,x5,lsl #3]\n1:\n    add x12,x12,#1\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*     empty box go left see explain function FI ou FG en fran\u00e7ais */ \n/******************************************************************/\nfunctionFL:                       // INFO: functionFL\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    ldr x0,qAdrqTabN0\n    ldr x1,[x0,x12,lsl #3]        // case vide\n    sub x2,x1,#1\n    ldr x3,[x9,x12,lsl #3]       // extrait jeu courant\n    ldrb w4,[x3,x2]              // extrait le contenu case \n    add x5,x12,#1\n    sub x8,x1,#1\n    str x8,[x0,x5,lsl #3]         // nouvelle case vide\n    ldr x6,qAdrqTabN3\n    mov x7,#'L'\n    str x7,[x6,x5,lsl #3]         // mouvement\n    ldr x6,qAdrqTabN4\n    ldr x7,[x6,x12,lsl #3]\n    str x7,[x6,x5,lsl #3]         // N4\u00a0??\n    mov x0,x3\n    bl createGame\n    ldrb w3,[x0,x1]               // exchange two boxes\n    ldrb w8,[x0,x2]\n    strb w8,[x0,x1]\n    strb w3,[x0,x2]\n    str x0,[x9,x5,lsl #3]         // stocke la nouvelle situation \n    lsr x3,x1,#2\n    sub x1,x1,x3,lsl #2           // compute remainder\n    ldr x0,qAdrqTabNc\n    ldr x2,[x0,x4,lsl #3]         // extrait table colonne \u00e0 la position case\n    cmp x2,x1\n    bge 1f\n    add x7,x7,#1\n    str x7,[x6,x5,lsl #3]\n1:\n    add x12,x12,#1\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*     create new Game                                            */ \n/******************************************************************/\n/* x0 contains box address            */\n/* x0 return address new game  */\ncreateGame:                          // INFO: createGame\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    mov x4,x0                    // save value\n    mov x0,#0                    // allocation place heap\n    mov x8,BRK                   // call system 'brk'\n    svc #0\n    cmp x0,#-1                   // allocation error\n    beq 99f\n    mov x5,x0                    // save address heap for output string\n    add x0,x0,#SIZE * SIZE       // reservation place one element\n    mov x8,BRK                   // call system 'brk'\n    svc #0\n    cmp x0,#-1                   // allocation error\n    beq 99f\n    mov x2,#0\n1:                               // loop copy boxes\n    ldrb w3,[x4,x2]\n    strb w3,[x5,x2]\n    add x2,x2,#1\n    cmp x2,#NBBOX\n    blt 1b\n    add x11,x11,#1\n    mov x0,x5\n    b 100f\n99:                              // error\n    ldr x0,qAdrszMessErreur\n    bl affichageMess\n100:\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*     read file                                                   */ \n/******************************************************************/\n/* x0 contains address stack begin           */\ntraitFic:                             // INFO: traitFic\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,fp,[sp,-16]!          // save  registres\n    mov fp,x0                         //  fp <- start address\n    ldr x4,[fp]                       // number of Command line arguments\n    cmp x4,#1\n    ble 99f\n    add x5,fp,#16                      // second parameter address \n    ldr x5,[x5]\n    ldr x0,qAdrqAdrFicName\n    str x5,[x0]\n    ldr x0,qAdrszMessTitre\n    bl affichageMess                  // display string\n    mov x0,x5\n    bl affichageMess \n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess                  // display carriage return\n\n    mov x0,AT_FDCWD\n    mov x1,x5                         // file name\n    mov x2,#O_RDWR                    // flags    \n    mov x3,#0                         // mode \n    mov x8, #OPEN                     // call system OPEN \n    svc 0 \n    cmp x0,#0                         // error\u00a0?\n    ble 99f\n    mov x7,x0                         // File Descriptor\n    ldr x1,qAdrsBuffer                // buffer address\n    mov x2,#TAILLEBUFFER              // buffer size\n    mov x8,#READ                      // read file\n    svc #0\n    cmp x0,#0                         // error\u00a0?\n    blt 99f\n    // extraction datas\n    ldr x1,qAdrsBuffer                // buffer address\n    add x1,x1,x0\n    mov x0,#0                         // store z\u00e9ro final\n    strb w0,[x1] \n    ldr x0,qAdrtbBox                   // game box address\n    ldr x1,qAdrsBuffer                // buffer address\n    bl extracDatas\n                                      // close file\n    mov x0,x7\n    mov x8, #CLOSE \n    svc 0 \n    mov x0,#0\n    b 100f\n99:                                   // error\n    ldr x0,qAdrszMessErreur           // error message\n    bl   affichageMess\n    mov x0,#-1\n100:\n    ldp x8,fp,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\nqAdrqAdrFicName:              .quad qAdrFicName\nqAdrszMessTitre:              .quad szMessTitre\nqAdrsBuffer:                  .quad sBuffer\n/******************************************************************/\n/*     extrac digit file buffer                                   */ \n/******************************************************************/\n/* x0 contains boxs address           */\n/* x1 contains buffer address         */\nextracDatas:                     // INFO: extracDatas\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    mov x7,x0\n    mov x6,x1\n    mov x2,#0                    // string buffer indice\n    mov x4,x1                    // start digit ascii\n    mov x5,#0                    // box index\n1:\n    ldrb w3,[x6,x2]\n    cmp x3,#0                    // datas end\u00a0?\n    beq 4f\n    cmp x3,#0xA                  // line end\u00a0?\n    beq 2f\n    cmp x3,#','                  // box end\u00a0?\n    beq 3f\n    add x2,x2,#1\n    b 1b\n2:\n    mov x3,#0\n    strb w3,[x6,x2]              // zero final\n    add x3,x2,#1                 // next character\n    ldrb w3,[x6,x3] \n    cmp x3,#0xD                  // line return \n    bne 21f\n    add x2,x2,#2                 // yes\n    b 4f\n21:\n    add x2,x2,#1\n    b 4f\n3:\n    mov x3,#0                    // zero final\n    strb w3,[x6,x2]\n    add x2,x2,#1\n4:  \n    mov x0,x4                    // conversion character ascii in integer\n    bl conversionAtoD\n    strb w0,[x7,x5]              // and store value on 1 byte box\n    cmp x0,#0                    // empty box\u00a0?\n    bne 5f\n    ldr x0,qAdrqTabN0\n    str x5,[x0]                  // empty box in item z\u00e9ro\n5:\n    add x5,x5,#1                 // increment counter boxes\n    cmp x5,#NBBOX                // number box = maxi\u00a0?\n    bge 100f \n    add x4,x6,x2                 // new start address digit ascii\n    b 1b\n100:\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*     control of the game solution                                      */ \n/******************************************************************/\n/* x0 contains boxs address           */\n/* x0 returns 0 if not possible       */\n/* x0 returns 1 if possible           */\ncontrolSolution:                 // INFO: controlSolution\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    mov x5,x0\n    ldr x8,qAdrqTabN0\n    ldr x8,[x8]                  // empty box\n    //mov x7,#0\n    cmp x8,#1\n    cset x7,eq\n    beq 1f\n    cmp x8,#3\n    cset x7,eq\n    beq 1f\n    cmp x8,#4\n    cset x7,eq\n    beq 1f\n    cmp x8,#6\n    cset x7,eq\n    beq 1f\n    cmp x8,#9\n    cset x7,eq\n    beq 1f\n    cmp x8,#11\n    cset x7,eq\n    beq 1f\n    cmp x8,#12\n    cset x7,eq\n    beq 1f\n    cmp x8,#14\n    cset x7,eq\n1:\n    mov x9,NBBOX - 1\n    sub x6,x9,x8\n    add x7,x7,x6\n                                 // count permutations\n    mov x1,#-1\n    mov x6,#0\n2:\n    add x1,x1,#1\n    cmp x1,#NBBOX\n    bge 80f\n    cmp x1,x8\n    beq 2b\n    ldrb w3,[x5,x1]\n    mov x2,x1\n3:\n    add x2,x2,#1\n    cmp x2,#NBBOX\n    bge 2b\n    cmp x2,x8\n    beq 3b\n    ldrb w4,[x5,x2]\n    cmp x4,x3\n    cinc x6,x6,lt\n    b 3b\n80:\n    add x6,x6,x7\n    tst x6,#1\n    cset x0,eq\n100:\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret    \n/******************************************************************/\n/*     game Ok\u00a0?                                      */ \n/******************************************************************/\n/* x0 contains boxs address           */\ngameOK:                          // INFO: gameOK\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    mov x2,#0\n    ldrb w3,[x0,x2]\n    cmp x3,#0\n    bne 0f\n    mov x3,#0xF\n0:\n    add x2,x2,#1\n1:\n    ldrb w4,[x0,x2]\n    cmp x4,#0\n    bne 11f\n    mov x3,#0xF\n11:\n    cmp x4,x3\n    ble 99f\n    mov x3,x4\n    add x2,x2,#1\n    cmp x2,#NBBOX -2\n    ble 1b\n    mov x0,#TRUE                  // game Ok\n    b 100f\n99:\n   mov  x0,#FALSE              // game not Ok\n100:\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*     display game                                       */ \n/******************************************************************/\n/* x0 contains boxs address           */\ndisplayGame:                            // INFO: displayGame\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    mov x4,x0\n    ldr x0,qAdrszMessTitre\n    bl affichageMess            // display titre\n    ldr x0,qAdrqAdrFicName\n    ldr x0,[x0]\n    bl affichageMess            // display string\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess            // display line return\n    mov x2,#0\n    ldr x1,qAdrsMessValeur\n1:\n    ldrb w0,[x4,x2]\n    cmp x0,#0\n    beq 3f\n    bl conversion10             // call conversion decimal\n    cmp x0,1\n    bne 2f\n    mov x0,#0x002020\n    str w0,[x1,#1]              // z\u00e9ro final\n    b 4f\n2:\n    mov x0,#0x20\n    str w0,[x1,#2]              // z\u00e9ro final\n    b 4f\n3:\n    ldr x0,iSpaces              // store spaces to empty case\n    str w0,[x1]\n4:\n    ldr x0,qAdrsMessResult\n    bl affichageMess            // display message\n    add x0,x2,#1\n    tst x0,#0b11\n    bne 5f\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess            // display message\n5:\n    add x2,x2,#1\n    cmp x2,#NBBOX - 1\n    ble 1b\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess            // display line return\n\n100:\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\niSpaces:                       .quad 0x00202020       // spaces\nqAdrszCarriageReturn:          .quad szCarriageReturn\nqAdrsMessValeur:               .quad sMessValeur\nqAdrsMessResult:               .quad sMessResult\n/********************************************************/\n/*        File Include fonctions                        */\n/********************************************************/\n/* for this file see task include a file in language AArch64 assembly */\n.include \"../includeARM64.inc\"",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_60.txt",
        "content": "let start = getTime()\nvar solver = initSolver([Value  0, 12,  9, 13,\n                               15, 11, 10, 14,\n                                3,  7,  2,  5,\n                                4,  8,  6,  1])\nsolver.run()\necho fmt\"Execution time: {(getTime() - start).toString}.\"\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_61.txt",
        "content": "Solution found with 80 moves: dddrurdruuulllddrulddrrruuullddruulldddrrurulldrruulldlddrurullddrrruullulddrdrr.\nExecution time: 3 hours 44 minutes 47 seconds 2 milliseconds.\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_62.txt",
        "content": "unit FifteenSolverT;\n\\\\ Solve 15 Puzzle. Nigel Galloway; February 1st., 2019.\ninterface\ntype TN=record n:UInt64; i,g,e,l:shortint; end;\ntype TG=record found:boolean; path:array[0..99] of TN; end;\nfunction solve15(const board : UInt64; const bPos:shortint; const d:shortint; const ng:shortint):TG;\nconst endPos:UInt64=$123456789abcdef0;\nimplementation\nconst N:array[0..15] of shortint=(3,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3);\nconst I:array[0..15] of shortint=(3,0,1,2,3,0,1,2,3,0,1,2,3,0,1,2);\nconst G:array[0..15] of shortint=(5,13,13,9,7,15,15,11,7,15,15,11,6,14,14,10);\nconst E:array[0..15] of shortint=(0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4);\nconst L:array[0..4 ] of shortint=(0,11,19,14,16);\nfunction solve15(const board:UInt64; const bPos:shortint; const d:shortint; const ng:shortint):TG;\nvar path:TG; P:^TN; Q:^TN; _g:shortint; _n:UInt64;\nbegin P:=@path.path; P^.n:=board; P^.i:=0; P^.g:=0; P^.e:=ng; P^.l:=bPos;\n  while true do begin\n    if P<@path.path then begin path.found:=false; exit(path); end;\n    if P^.n=endPos  then begin path.found:=true; exit(path); end;\n    if (P^.e=0) or (P^.i>d) then begin P-=1; continue; end else begin Q:=P+1; Q^.g:=E[P^.e]; end;\n    Q^.i:=P^.i; _g:=(L[Q^.g]-P^.l)*4; _n:=P^.n and (UInt64($F)<<_g);\n    case Q^.g of\n      1:begin Q^.l:=P^.l+4; Q^.e:=G[Q^.l]-2; P^.e-=1; Q^.n:=P^.n-_n+(_n<<16); if N[_n>>_g]>=(Q^.l div 4) then Q^.i+=1; end;\n      2:begin Q^.l:=P^.l-4; Q^.e:=G[Q^.l]-1; P^.e-=2; Q^.n:=P^.n-_n+(_n>>16); if N[_n>>_g]<=(Q^.l div 4) then Q^.i+=1; end;\n      3:begin Q^.l:=P^.l+1; Q^.e:=G[Q^.l]-8; P^.e-=4; Q^.n:=P^.n-_n+(_n<< 4); if I[_n>>_g]>=(Q^.l mod 4) then Q^.i+=1; end;\n      4:begin Q^.l:=P^.l-1; Q^.e:=G[Q^.l]-4; P^.e-=8; Q^.n:=P^.n-_n+(_n>> 4); if I[_n>>_g]<=(Q^.l mod 4) then Q^.i+=1; end;\n    end;\n    P+=1;\n  end;\nend;\nend.\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_63.txt",
        "content": "// Threaded use of 15 solver Unit. Nigel Galloway; February 1st., 2019.\nprogram testFifteenSolver;\nuses {$IFDEF UNIX}cthreads,{$ENDIF}sysutils,strutils,FifteenSolverT;\nvar Tz:array[0..5] of TThreadID; Tr:array[0..5] of TG; Tc:array[0..5] of shortint; Tw:array[0..5] of shortint;\nconst N:array[0..4 ] of string=('','d','u','r','l');\nconst G:array[0..15] of string=('41','841','841','81','421','8421','8421','821','421','8421','8421','821','42','842','842','82');\nvar ip:string; x,y:UInt64; P,Q:^TN; bPos,v,w,z,f:shortint; time1, time2: TDateTime; c:char;\nfunction T(a:pointer):ptrint;\nbegin\n  Tr[uint32(a)]:=solve15(x,bPos,Tw[uint32(a)],Tc[uint32(a)]);\n  if Tr[uint32(a)].found then f:=uint32(a);\n  T:=0;\nend;\nbegin\n  ReadLn(ip);\n  bPos:=Npos('0',ip,1)-1; w:=0; z:=0; f:=-1;\n  y:=(UInt64(Hex2Dec(ip[9..17]))<<32)>>32; x:=UInt64(Hex2Dec(ip[1..8]))<<32+y;\n  time1:=Now;\n  for w:=0 to $7f do begin\n    for c in G[bpos] do begin v:=z mod 6; Tc[v]:=integer(c)-48; Tw[v]:=w;\n      Tz[v]:=BeginThread(@T,pointer(v));\n      z+=1; if z>5 then waitforthreadterminate(Tz[z mod 6],$7fff);\n    end;\n    if f>=0 then break;\n  end;\n  for bpos:=0 to 5 do if Tw[bpos]>=Tw[f] then killthread(Tz[bpos]) else waitforthreadterminate(Tz[bpos],$7fff);\n  time2:=Now; WriteLn('Solution(s) found in ' +  FormatDateTime('hh.mm.ss.zzz', time2-time1) + ' seconds');\n  for bpos:=0 to 5 do if Tr[bpos].found then begin\n    P:=@Tr[bpos].path; repeat Q:=P; Write(N[Q^.g]); P+=1; until Q^.n=endpos; WriteLn();\n  end;\nend.\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_64.txt",
        "content": "fe169b4c0a73d852\nSolution(s) found in 00.00.00.423 seconds\nrrruldluuldrurdddluulurrrdlddruldluurddlulurruldrrdd\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_65.txt",
        "content": "0c9dfbae37254861\nSolution(s) found in 12.58.46.194 seconds\nrrrdldlluurrddluurrdlurdddllluurrdrdlluluurrdddluurddlluururdrddlluurrullldrrrdd\ndrrrdlluurrdddlluururddlurddlulldrrulluurrdrdllluurrdrdllldruururdddlluluurrrddd\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_66.txt",
        "content": "import planner.\n\nmain =>\n    init(InitS),\n    goal(GoalS),\n    best_plan((InitS,GoalS),Plan),\n    println(Plan).\n\ninit(InitS) =>\n    M = {{15, 14, 1,  6},\n         {9 , 11, 4, 12},\n         {0,  10, 7,  3},\n         {13,  8, 5,  2}},\n    InitS = [(R,C)\u00a0: T in 0..15, pos(M,T,R,C)].\n\ngoal(GoalS) =>\n    M = {{1,  2,  3,  4},\n         {5,  6,  7,  8},\n         {9, 10, 11, 12},\n         {13,14, 15,  0}},\n    GoalS = [(R,C)\u00a0: T in 0..15, pos(M,T,R,C)].         \n\npos(M,T,R,C) =>\n    N = len(M),\n    between(1,N,R),\n    between(1,N,C),\n    M[R,C] == T,!.\n    \nfinal((S,GoalS)) => S == GoalS.\n\naction((S,GoalS),NextS,Action,Cost) =>\n    S = [P0|Tiles],\n    P0 = (R0,C0),\n    Cost = 1,\n    (R1 = R0-1, R1 >= 1, C1 = C0, Action = u;\n     R1 = R0+1, R1 =< 4, C1 = C0, Action = d;\n     R1 = R0, C1 = C0-1, C1 >= 1, Action = l;\n     R1 = R0, C1 = C0+1, C1 =< 4, Action = r),\n    P1 = (R1,C1),\n    slide(P0,P1,Tiles,Tiles1),\n    S1 = [P1|Tiles1],\n    NextS = (S1,GoalS).\n\n% slide the tile at P1 to the empty square at P0\nslide(P0,P1,[P1|Tiles],Tiles1) =>\n    Tiles1 = [P0|Tiles].\nslide(P0,P1,[Tile|Tiles],Tiles1) =>\n    Tiles1=[Tile|Tiles1R],\n    slide(P0,P1,Tiles,Tiles1R).\n\n% called by the planner\nheuristic((S,GoalS)) = Dist =>\n    S = [_|Tiles],\n    GoalS = [_|FTiles],\n    Dist = sum([abs(R-FR)+abs(C-FC)\u00a0: \n                {(R,C),(FR,FC)} in zip(Tiles,FTiles)]).",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_67.txt",
        "content": "rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd  \n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_68.txt",
        "content": "use strict;\nno warnings;\n\nuse enum qw(False True);\nuse constant Nr => <3 0 0 0 0 1 1 1 1 2 2 2 2 3 3 3>;\nuse constant Nc => <3 0 1 2 3 0 1 2 3 0 1 2 3 0 1 2>;\n\nmy ($n, $m) = (0, 0);\nmy(@N0, @N2, @N3, @N4);\n\nsub fY {\n   printf \"Solution found in $n moves: %s\\n\", join('', @N3) and exit if $N2[$n] == 0x123456789abcdef0;\n   $N4[$n] <= $m ? fN() : False;\n}\n\nsub fN {\n   sub common { ++$n; return True if fY(); --$n }\n   if ($N3[$n] ne 'u' and int($N0[$n] / 4) < 3) { fI(); common() }\n   if ($N3[$n] ne 'd' and int($N0[$n] / 4) > 0) { fG(); common() }\n   if ($N3[$n] ne 'l' and    ($N0[$n] % 4) < 3) { fE(); common() }\n   if ($N3[$n] ne 'r' and    ($N0[$n] % 4) > 0) { fL(); common() }\n   return False;\n}\n\nsub fI {\n   my $g = (11-$N0[$n])*4;\n   my $a = $N2[$n] & (15 << $g);\n   $N0[$n+1] = $N0[$n]+4;\n   $N2[$n+1] = $N2[$n]-$a+($a<<16);\n   $N4[$n+1] = $N4[$n]+((Nr)[$a>>$g] <= int($N0[$n] / 4) ? 0 : 1);\n   $N3[$n+1] = 'd';\n}\n\nsub fG {\n   my $g = (19-$N0[$n])*4;\n   my $a = $N2[$n] & (15 << $g);\n   $N0[$n+1] = $N0[$n]-4;\n   $N2[$n+1] = $N2[$n]-$a+($a>>16);\n   $N4[$n+1] = $N4[$n]+((Nr)[$a>>$g] >= int($N0[$n] / 4) ? 0 : 1);\n   $N3[$n+1] = 'u';\n}\n\nsub fE {\n   my $g = (14-$N0[$n])*4;\n   my $a = $N2[$n] & (15 << $g);\n   $N0[$n+1] = $N0[$n]+1;\n   $N2[$n+1] = $N2[$n]-$a+($a<<4);\n   $N4[$n+1] = $N4[$n]+((Nc)[$a>>$g] <= $N0[$n]%4 ? 0 : 1);\n   $N3[$n+1] = 'r';\n}\n\nsub fL {\n   my $g = (16-$N0[$n])*4;\n   my $a = $N2[$n] & (15 << $g);\n   $N0[$n+1] = $N0[$n]-1;\n   $N2[$n+1] = $N2[$n]-$a+($a>>4);\n   $N4[$n+1] = $N4[$n]+((Nc)[$a>>$g] >= $N0[$n]%4 ? 0 : 1);\n   $N3[$n+1] = 'l';\n}\n\n($N0[0], $N2[0]) = (8, 0xfe169b4c0a73d852); # initial state\nwhile () { fY() or ++$m }\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_69.txt",
        "content": "Solution found in 52 moves: rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_7.txt",
        "content": "File name\u00a0: casR1.txt\nFile name\u00a0: casR1.txt\n 15  14  1   6\n 9   11  4   12\n     10  7   3\n 13  8   5   2\n\nFile name\u00a0: casR1.txt\n 1   2   3   4\n 5   6   7   8\n 9   10  11  12\n 13  14  15\n\nSolution in 52 moves\u00a0:\nRRRULDDLUUULDRURDDDRULLULURRRDDLDLUURDDLULURRULDRDRD\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_70.txt",
        "content": "-- demo\\rosetta\\Solve15puzzle.exw\nconstant STM = 0    -- single-tile metrics.\nconstant MTM = 0    -- multi-tile metrics.\nif STM and MTM then ?9/0 end if -- both prohibited\n--  0       0   -- fastest, but non-optimal\n--  1       0   -- optimal in STM\n--  0       1   -- optimal in MTM (slowest by far)\n \n--Note: The fast method uses an inadmissible heuristic - see \"not STM\" in iddfs().\n--      It explores mtm-style using the higher stm heuristic and may therefore \n--      fail badly in some cases.\n \nconstant SIZE = 4\n \nconstant goal = { 1, 2, 3, 4,\n                  5, 6, 7, 8,\n                  9,10,11,12,\n                 13,14,15, 0}\n \n--\n-- multi-tile-metric walking distance heuristic lookup (mmwd).\n-- ==========================================================\n-- Uses patterns of counts of tiles in/from row/col, eg the solved state \n--  (ie goal above) could be represented by the following:\n--      {{4,0,0,0},\n--       {0,4,0,0},\n--       {0,0,4,0},\n--       {0,0,0,3}}\n--  ie row/col 1 contains 4 tiles from col/row 1, etc. In this case\n--  both are identical, but you can count row/col or col/row, and then\n--  add them together. There are up to 24964 possible patterns. The\n--  blank space is not counted. Note that a vertical move cannot change\n--  a vertical pattern, ditto horizontal, and basic symmetry means that\n--  row/col and col/row patterns will match (at least, that is, if they \n--  are calculated sympathetically), halving the setup cost.\n-- The data is just the number of moves made before this pattern was\n--  first encountered, in a breadth-first search, backwards from the\n--  goal state, until all patterns have been enumerated.\n-- (The same ideas/vars are now also used for stm metrics when MTM=0)\n--\nsequence wdkey              -- one such 4x4 pattern\nconstant mmwd = new_dict()  -- lookup table, data is walking distance.\n \n \n--\n-- We use two to-do lists: todo is the current list, and everything\n-- of walkingdistance+1 ends up on tdnx. Once todo is exhausted, we\n-- swap the dictionary-ids, so tdnx automatically becomes empty.\n-- Key is an mmwd pattern as above, and data is {distance,space_idx}.\n--\ninteger todo = new_dict()\ninteger tdnx = new_dict()\n \n--\n \nenum UP = 1, DOWN = -1\n \nprocedure explore(integer space_idx, walking_distance, direction)\n--\n--  Given a space index, explore all the possible moves in direction,\n--  setting the distance and extending the tdnx table.\n--\ninteger tile_idx = space_idx+direction\n    for group=1 to SIZE do\n        if wdkey[tile_idx][group] then\n            -- ie: check row tile_idx for tiles belonging to rows 1..4\n            -- Swap one of those tiles with the space\n            wdkey[tile_idx][group] -= 1\n            wdkey[space_idx][group] += 1\n \n            if getd_index(wdkey,mmwd)=0 then\n                -- save the walking distance value\n                setd(wdkey,walking_distance+1,mmwd)\n                -- and add to the todo next list:\n                if getd_index(wdkey,tdnx)!=0 then ?9/0 end if\n                setd(wdkey,{walking_distance+1,tile_idx},tdnx)\n            end if\n \nif MTM then\n            if tile_idx>1 and tile_idx<SIZE then\n                -- mtm: same direction means same distance:\n                explore(tile_idx, walking_distance, direction)\n            end if\nend if\n \n            -- Revert the swap so we can look at the next candidate.\n            wdkey[tile_idx][group] += 1\n            wdkey[space_idx][group] -= 1\n        end if\n    end for\nend procedure\n \nprocedure generate_mmwd()\n-- Perform a breadth-first search begining with the solved puzzle state \n--  and exploring from there until no more new patterns emerge.\ninteger walking_distance = 0, space = 4\n \n    wdkey = {{4,0,0,0}, -- \\\n             {0,4,0,0}, --  } 4 tiles in correct row positions\n             {0,0,4,0}, -- /\n             {0,0,0,3}} --    3 tiles in correct row position\n    setd(wdkey,walking_distance,mmwd)\n    while 1 do\n        if space<4 then explore(space, walking_distance, UP)    end if\n        if space>1 then explore(space, walking_distance, DOWN) end if\n        if dict_size(todo)=0 then\n            if dict_size(tdnx)=0 then exit end if\n            {todo,tdnx} = {tdnx,todo}\n        end if\n        wdkey = getd_partial_key(0,todo)\n        {walking_distance,space} = getd(wdkey,todo)\n        deld(wdkey,todo)\n    end while\nend procedure\n \nfunction walking_distance(sequence puzzle)\nsequence rkey = repeat(repeat(0,SIZE),SIZE),\n         ckey = repeat(repeat(0,SIZE),SIZE)\n    integer k = 1\n    for i=1 to SIZE do  -- rows\n        for j=1 to SIZE do  -- columns\n            integer tile = puzzle[k]\n            if tile!=0 then\n                integer row = floor((tile-1)/4)+1,\n                        col = mod(tile-1,4)+1\n                rkey[i][row] += 1\n                ckey[j][col] += 1\n            end if\n            k += 1\n        end for\n    end for\n    if getd_index(rkey,mmwd)=0\n    or getd_index(ckey,mmwd)=0 then\n        ?9/0 -- sanity check\n    end if\n    integer rwd = getd(rkey,mmwd),\n            cwd = getd(ckey,mmwd)\n    return rwd+cwd\nend function\n \nsequence puzzle\nstring res = \"\"\natom t0 = time(),\n     t1 = time()+1\natom tries = 0\n \nconstant ok = {{0,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1},   -- left\n               {0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},   -- up\n               {1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0},   -- down\n               {1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,0}}   -- right\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_71.txt",
        "content": "function iddfs(integer step, lim, space, prevmv)\n    if time()>t1 then\n        printf(1,\"working... (depth=%d, tries=%d, time=%3ds)\\r\",{lim,tries,time()-t0})\n        t1 = time()+1\n    end if\n    tries += 1\n    integer d = iff(step==lim?0:walking_distance(puzzle))\n    if d=0 then\n \n        return (puzzle==goal)\n \n    elsif step+d<=lim then\n \n        for mv=1 to 4 do -- l/u/d/r\n            if prevmv!=(5-mv) -- not l after r or vice versa, ditto u/d\n            and ok[mv][space] then\n                integer nspace = space+{-1,-4,+4,+1}[mv]\n                integer tile = puzzle[nspace]\n                if puzzle[space]!=0 then ?9/0 end if    -- sanity check     \n                puzzle[space] = tile\n                puzzle[nspace] = 0\n                if iddfs(step+iff(MTM or not STM?(prevmv!=mv):1),lim,nspace,mv) then\n                    res &= \"ludr\"[mv]\n                    return true\n                end if\n                puzzle[nspace] = tile\n                puzzle[space] = 0\n            end if\n        end for\n    end if\n    return false\nend function\n \nfunction pack(string s)\ninteger n = length(s), n0 = n\n    for i=1 to 4 do\n        integer ch = \"lrud\"[i], k\n        while 1 do\n            k = match(repeat(ch,3),s)\n            if k=0 then exit end if\n            s[k+1..k+2] = \"3\"\n            n -= 2\n        end while\n        while 1 do\n            k = match(repeat(ch,2),s)\n            if k=0 then exit end if\n            s[k+1] = '2'\n            n -= 1\n        end while\n    end for\n    return {n,iff(MTM?sprintf(\"%d\",n):sprintf(\"%d(%d)\",{n,n0})),s}\nend function\n \nprocedure apply_moves(string moves, integer space)\ninteger move, ch, nspace\n    puzzle[space] = 0\n    for i=1 to length(moves) do\n        ch = moves[i]\n        if ch>'3' then\n            move = find(ch,\"ulrd\")\n        end if\n        -- (hint: \"r\" -> the 'r' does 1\n        --        \"r2\" -> the 'r' does 1, the '2' does 1\n        --        \"r3\" -> the 'r' does 1, the '3' does 2!)\n        for j=1 to 1+(ch='3') do\n            nspace = space+{-4,-1,+1,4}[move]\n            puzzle[space] = puzzle[nspace]\n            space = nspace\n            puzzle[nspace] = 0\n        end for\n    end for\nend procedure\n \nfunction solvable(sequence board)\ninteger n = length(board)\nsequence positions = repeat(0,n)\n    -- prepare the mapping from each tile to its position\n    board[find(0,board)] = n\n    for i=1 to n do\n        positions[board[i]] = i\n    end for\n \n    -- check whether this is an even or odd state\n    integer row = floor((positions[16]-1)/4),\n            col = (positions[16]-1)-row*4\n    bool even_state = (positions[16]==16) or (mod(row,2)==mod(col,2))\n \n    -- count the even cycles\n    integer even_count = 0\n    sequence visited = repeat(false,16)\n    for i=1 to n do\n        if not visited[i] then\n            -- a new cycle starts at i. Count its length..\n            integer cycle_length = 0,\n                    next_tile = i\n            while not visited[next_tile] do\n                cycle_length +=1\n                visited[next_tile] = true\n                next_tile = positions[next_tile]\n            end while\n            even_count += (mod(cycle_length,2)==0)\n        end if\n    end for\n    return even_state == (mod(even_count,2)==0)\nend function\n \nprocedure main()\n \n    puzzle = {15,14, 1, 6, \n               9,11, 4,12,\n               0,10, 7, 3, \n              13, 8, 5, 2}\n \n    if not solvable(puzzle) then\n        ?puzzle\n        printf(1,\"puzzle is not solveable\\n\")\n    else\n \n        generate_mmwd()\n \n        sequence original = puzzle\n        integer space = find(0,puzzle)\n \n        for lim=walking_distance(puzzle) to iff(MTM?43:80) do\n            if iddfs(0, lim, space, '-') then exit end if\n        end for\n \n        {integer n, string ns, string ans} = pack(reverse(res))\n \n        printf(1,\"\\n\\noriginal:\")\n        ?original\n        atom t = time()-t0\n        printf(1,\"\\n%soptimal solution of %s moves found in %s: %s\\n\\nresult: \",\n                 {iff(MTM?\"mtm-\":iff(STM?\"stm-\":\"non-\")),ns,elapsed(t),ans})\n        puzzle = original\n        apply_moves(ans,space)\n        ?puzzle\n    end if\nend procedure\nmain()\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_72.txt",
        "content": "original:{15,14,1,6,9,11,4,12,0,10,7,3,13,8,5,2}\nnon-optimal solution of 35(60) moves found in 2.42s: u2r2d3ru2ld2ru3ld3l2u3r2d2l2dru2ldru2rd3lulur3dl2ur2d2\nstm-optimal solution of 38(52) moves found in 1 minute and 54s: r3uldlu2ldrurd3lu2lur3dld2ruldlu2rd2lulur2uldr2d2\nmtm-optimal solution of 31(60) moves found in 2 hours, 38 minutes and 28s: u2r2d3ru2ld2ru3ld3l2u3r2d2l2dru3rd3l2u2r3dl3dru2r2d2\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_73.txt",
        "content": "let all moves which do not increase the manhattan cost be regarded as \"free\".\n   -- (if you can solve in mc, clearly it is an optimal solution)\nlet n=0\nwhile (not solveable_with_at_most_n_non_free_moves(n)) n++\n   -- (clearly optimal by exhaustively disproving all lesser n)\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_74.txt",
        "content": "-- demo/rosetta/Solve15puzzle_simple.exw\nenum left, down, up, right  -- (nb 5-move flips it, as in down===5-up, etc)\n \nconstant valid_moves = {{ 0, 0, 5, 2}, { 1, 0, 6, 3}, { 2, 0, 7, 4}, { 3, 0, 8, 0},\n                        { 0, 1, 9, 6}, { 5, 2,10, 7}, { 6, 3,11, 8}, { 7, 4,12, 0},\n                        { 0, 5,13,10}, { 9, 6,14,11}, {10, 7,15,12}, {11, 8,16, 0},\n                        { 0, 9, 0,14}, {13,10, 0,15}, {14,11, 0,16}, {15,12, 0, 0}}\n \nconstant zero_cost = {{0b000000000000000,0b000000000000000,0b000000000001111,0b001000100010001},\n                      {0b110111011101110,0b000000000000000,0b000000000001111,0b011001100110011},\n                      {0b100110011001100,0b000000000000000,0b000000000001111,0b111011101110111},\n                      {0b000100010001000,0b000000000000000,0b000000000001111,0b000000000000000},\n                      {0b000000000000000,0b111111111110000,0b000000011111111,0b001000100010001},\n                      {0b110111011101110,0b111111111110000,0b000000011111111,0b011001100110011},\n                      {0b100110011001100,0b111111111110000,0b000000011111111,0b111011101110111},\n                      {0b000100010001000,0b111111111110000,0b000000011111111,0b000000000000000},\n                      {0b000000000000000,0b111111100000000,0b000111111111111,0b001000100010001},\n                      {0b110111011101110,0b111111100000000,0b000111111111111,0b011001100110011},\n                      {0b100110011001100,0b111111100000000,0b000111111111111,0b111011101110111},\n                      {0b000100010001000,0b111111100000000,0b000111111111111,0b000000000000000},\n                      {0b000000000000000,0b111000000000000,0b000000000000000,0b001000100010001},\n                      {0b110111011101110,0b111000000000000,0b000000000000000,0b011001100110011},\n                      {0b100110011001100,0b111000000000000,0b000000000000000,0b111011101110111},\n                      {0b000100010001000,0b111000000000000,0b000000000000000,0b000000000000000}}\n \nconstant masks      = {0b000000000000001,0b000000000000010,0b000000000000100,0b000000000001000,\n                       0b000000000010000,0b000000000100000,0b000000001000000,0b000000010000000,\n                       0b000000100000000,0b000001000000000,0b000010000000000,0b000100000000000,\n                       0b001000000000000,0b010000000000000,0b100000000000000}\n \n-- Or, if you prefer to build those with code (but I really wanted to show the above bitmasks):\n--/*\nsequence valid_moves = repeat(repeat(0,4),16),\n         zero_cost   = repeat(repeat(0,4),16)\nconstant masks = sq_power(2,tagset(14,0))\nfor square=1 to 16 do\n    integer s_row = floor((square+3)/4),\n            s_col = remainder((square-1),4)+1\n    for move=left to right do -- (via up/down)\n        if (move=left  and s_col>1)\n        or (move=down  and s_row>1)\n        or (move=up    and s_row<4)\n        or (move=right and s_col<4) then\n            integer origin = square+{-1,-4,+4,+1}[move],\n                    o_row = floor((origin+3)/4),\n                    o_col = remainder((origin-1),4)+1\n            valid_moves[square][move] = origin\n            for piece=1 to 15 do -- (aka target)\n                integer t_row = floor((piece+3)/4),\n                        t_col = remainder((piece-1),4)+1,\n                        p_md = abs(t_row-o_row)+abs(t_col-o_col),\n                        n_md = abs(t_row-s_row)+abs(t_col-s_col)\n                if n_md<=p_md then\n                    zero_cost[square][move] += masks[piece]\n                end if\n            end for\n        end if\n    end for\nend for\n--pp(valid_moves,{pp_IntFmt,\"%2d\",pp_Maxlen,70})\n--pp(zero_cost,{pp_IntFmt,\"%015b\"})\n--pp(masks,{pp_IntFmt,\"%015b\",pp_IntCh,false})\n--*/\nif up or down then end if -- (suppress unused warnings, since the above commented out)\n \nstring moves = \"\"\nsequence board = {15,14, 1, 6, \n                   9,11, 4,12,\n                   0,10, 7, 3, \n                  13, 8, 5, 2}\ninteger space = 9\n \nconstant goal = { 1, 2, 3, 4,\n                  5, 6, 7, 8,\n                  9,10,11,12,\n                 13,14,15, 0}\n \natom t1 = time()+1\n \nfunction solve(integer nfree, space, mdx=1, skip_move=0)\n--\n-- nfree is the number of non-free moves we can yet make\n-- space is the location of the space (duh), [1..16] \n-- mdx is just the move index for building the solution\n-- skip_move significantly narrows search space (1000 or \n--  more times faster, believe it or not, simply by not \n--  allowing the immediate undoing of the last move)\n--\n    for move=left to right do -- (via up/down)\n        integer new_space = valid_moves[space][move]\n        if move!=skip_move and new_space then\n            integer piece = board[new_space],\n                    zcsmv = zero_cost[space][move],\n                    maskp = masks[piece],\n                    zcost = (and_bits(zcsmv,maskp)=0) -- (0==free, 1==not)\n            if nfree>=zcost then\n                if mdx>length(moves) then moves &= '?' end if\n--              moves[mdx] = \"ludr\"[move]\n                moves[mdx] = \"ludrLUDR\"[move+zcost*4]\n                board[space] = piece\n                board[new_space] = 0\n                if time()>t1 then\n                    printf(1,\"%s\\r\",{moves})\n                    t1 = time()+1\n                end if\n                if space=piece and board=goal then\n                    moves = moves[1..mdx] -- (trim)\n                    return true\n                end if\n                if solve(nfree-zcost,new_space,mdx+1,5-move) then\n                    return true\n                end if\n                board[new_space] = piece\n                board[space] = 0\n            end if\n        end if\n    end for\n    return false\nend function\n \npp(board,{pp_IntFmt,\"%2d\",pp_Maxlen,17})\n \natom t0 = time()\ninteger n = 0\nwhile not solve(n,space) do n += 1 end while\nprintf(1,\"solution of %d moves found in %s: %s\\n\",\n         {length(moves),elapsed(time()-t0),moves})\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_75.txt",
        "content": "{15,14, 1, 6,\n  9,11, 4,12,\n  0,10, 7, 3,\n 13, 8, 5, 2}\nsolution of 52 moves found in 8.5s: RRruldluulDRurdddlUulurRrdLddrUldluurddlulurruldrrdd\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_76.txt",
        "content": "' The program solve fe169b4c0a73d852 in 4-5 seconds (on Intel Core i7-3770 3.40 GHz, 16 GB RAM, Windows 10 Pro).\n' Test not completed with 0c9dfbae37254861 (still running after about 4 hours).\n' Most of initialization is done in procedure fifteenSolver(), so it's possible to call it many times from the main function.\n' No need to pass to fifteenSolver() the initial position of 0; the procedure determines it.\n' Program includes procedure to create new configurations (by shuffling the correct final configuration).\n' Program also includes a simple (text only) optional visualization of solving moves; the second (optional) parameter of fifteenSolver() is the pause between each move (in milliseconds).\n'\n' PowerBASIC compilers (both PBCC and PBWin) are 32 bits and are not that efficient when dealing with 64 bit integers (quad, only signed);\n' this is not a problem for additions and subtractions, but left/right shift are quite slow;\n' to speed up execution, left/right shift are done by inline X86 assembler (the PB statement is commented).\n\n#compiler pbcc\n#dim all\n\nglobal Nr() as long\nglobal Nc() as long\nglobal n as long\nglobal nn as long ' variable name _n not allowed\nglobal N0() as long\nglobal N3() as long\nglobal N4() as long\nglobal N2() as quad\n\n%Ki=1\n%Ke=2\n%Kl=4\n%Kg=8\n\n%l=108 ' l\n%r=114 ' r\n%u=117 ' u\n%d=100 ' d\n\nfunction fY() as long\n   if N2(n) = &h123456789abcdef0 then\n      function=1\n      exit function\n   end if\n   if N4(n) <= nn then\n      function = fN()\n      exit function\n   end if\n   function = 0\nend function\n\nfunction fZ(byval w as long) as long\n   if (w and %Ki) > 0 then\n      call fI()\n      if fY() then\n         function = 1\n         exit function\n      end if\n      decr n\n   end if\n   if (w and %Kg) > 0 then\n      call fG()\n      if fY() then\n         function = 1\n         exit function\n      end if\n      decr n\n   end if\n   if (w and %Ke) > 0 then\n      call fE()\n      if fY() then\n         function = 1\n         exit function\n      end if\n      decr n\n   end if\n   if (w and %Kl) > 0 then\n      call fL()\n      if fY() then\n         function = 1\n         exit function\n      end if\n      decr n\n   end if\n   function = 0\nend function\n\nfunction fN() as long\n   select case N0(n)\n      case 0\n         select case N3(n)\n            case %l\n               function = fZ(%Ki)\n               exit function\n            case %u\n               function = fZ(%Ke)\n               exit function\n            case else\n               function = fZ(%Ki + %Ke)\n               exit function\n         end select\n      case 3\n         select case N3(n)\n            case %r\n               function = fZ(%Ki)\n               exit function\n            case %u\n               function = fZ(%Kl)\n               exit function\n            case else\n               function = fZ(%Ki + %Kl)\n               exit function\n         end select\n      case 1, 2\n         select case N3(n)\n            case %l\n               function = fZ(%Ki + %Kl)\n               exit function\n            case %r\n               function = fZ(%Ki + %Ke)\n               exit function\n            case %u\n               function = fZ(%Ke + %Kl)\n               exit function\n            case else\n               function = fZ(%Kl + %Ke + %Ki)\n               exit function\n         end select\n      case 12\n         select case N3(n)\n            case %l\n               function = fZ(%Kg)\n               exit function\n            case %d\n               function = fZ(%Ke)\n               exit function\n            case else\n               function = fZ(%Ke + %Kg)\n               exit function\n         end select\n      case 15\n         select case N3(n)\n            case %r\n               function = fZ(%Kg)\n               exit function\n            case %d\n               function = fZ(%Kl)\n               exit function\n            case else\n               function = fZ(%Kg + %Kl)\n               exit function\n         end select\n      case 13, 14\n         select case N3(n)\n            case %l\n               function = fZ(%Kg + %Kl)\n               exit function\n            case %r\n               function = fZ(%Ke + %Kg)\n               exit function\n            case %d\n               function = fZ(%Ke + %Kl)\n               exit function\n            case else\n               function = fZ(%Kg + %Ke + %Kl)\n               exit function\n         end select\n      case 4, 8\n         select case N3(n)\n            case %l\n               function = fZ(%Ki + %Kg)\n               exit function\n            case %u\n               function = fZ(%Kg + %Ke)\n               exit function\n            case %d\n               function = fZ(%Ki + %Ke)\n               exit function\n            case else\n               function = fZ(%Ki + %Kg + %Ke)\n               exit function\n         end select\n      case 7, 11\n         select case N3(n)\n            case %d\n               function = fZ(%Ki + %Kl)\n               exit function\n            case %u\n               function = fZ(%Kg + %Kl)\n               exit function\n            case %r\n               function = fZ(%Ki + %Kg)\n               exit function\n            case else\n               function = fZ(%Ki + %Kg + %Kl)\n               exit function\n         end select\n      case else\n         select case N3(n)\n            case %d\n               function = fZ(%Ki + %Ke + %Kl)\n               exit function\n            case %l\n               function = fZ(%Ki + %Kg + %Kl)\n               exit function\n            case %r\n               function = fZ(%Ki + %Kg + %Ke)\n               exit function\n            case %u\n               function = fZ(%Kg + %Ke + %Kl)\n               exit function\n            case else\n               function = fZ(%Ki + %Kg + %Ke + %Kl)\n               exit function\n         end select\n   end select\nend function\n\nsub fI()\n   local g as long\n   local a as quad\n   g = (11 - N0(n)) * 4\n   a = (N2(n) and lshift(15,g))\n   N0(n + 1) = N0(n) + 4\n   N2(n + 1) = N2(n) - a + lshift(a, 16)\n   N3(n + 1) = %d\n   N4(n + 1) = N4(n)\n   if isfalse(Nr(rshift(a,g)) <= N0(n)\\4) then\n      incr N4(n + 1)\n   end if\n   incr n\nend sub\n\nsub fG()\n   local g as long\n   local a as quad\n   g = (19 - N0(n)) * 4\n   a = (N2(n) and lshift(15,g))\n   N0(n + 1) = N0(n) - 4\n   N2(n + 1) = N2(n) - a + rshift(a, 16)\n   N3(n + 1) = %u\n   N4(n + 1) = N4(n)\n   if isfalse(Nr(rshift(a,g)) >= N0(n)\\4) then\n      incr N4(n + 1)\n   end if\n   incr n\nend sub\n\nsub fE()\n   local g as long\n   local a as quad\n   g = (14 - N0(n)) * 4\n   a = (N2(n) and lshift(15,g))\n   N0(n + 1) = N0(n) + 1\n   N2(n + 1) = N2(n) - a + lshift(a,4)\n   N3(n + 1) = %r\n   N4(n + 1) = N4(n)\n   if isfalse(Nc(rshift(a,g)) <= (N0(n) mod 4)) then\n      incr N4(n + 1)\n   end if\n   incr n\nend sub\n\nsub fL()\n   local g as long\n   local a as quad\n   g = (16 - N0(n)) * 4\n   a = (N2(n) and lshift(15,g))\n   N0(n + 1) = N0(n) - 1\n   N2(n + 1) = N2(n) - a + rshift(a,4)\n   N3(n + 1) = %l\n   N4(n + 1) = N4(n)\n   if isfalse(Nc(rshift(a,g)) >= (N0(n) mod 4)) then\n      incr N4(n + 1)\n   end if\n   incr n\nend sub\n\nfunction lshift(byval v as quad, byval s as dword) as quad\n   'shift left v, s\n   ' inline assembler shift is much faster\n   !mov edx,v[4]\n   !mov eax,v\n   !mov ecx,s\n   !shld edx,eax,cl\n   !shl eax,cl\n   !test ecx,32\n   !jz skip\n   !mov edx,eax\n   !xor eax,eax\n   skip:\n   !mov v[4],edx\n   !mov v,eax\n   function = v\nend function\n\nfunction rshift(byval v as quad, byval s as dword) as quad\n   'shift right v, s\n   ' inline assembler shift is much faster\n   !mov edx,v[4]\n   !mov eax,v\n   !mov ecx,s\n   !shrd eax,edx,cl\n   !shr edx,cl\n   !test ecx,32\n   !jz skip\n   !mov eax,edx\n   !xor edx,edx\n   skip:\n   !mov v[4],edx\n   !mov v,eax\n   function = v\nend function\n\nsub fifteenSolver(byval g as quad, optional byval p as long)\n   local h as string\n   local j as long\n   local s as string\n   local t as single\n   t=timer\n   redim Nr(0 to 15)\n   redim Nc(0 to 15)\n   redim N0(0 to 99)\n   redim N3(0 to 100)\n   redim N4(0 to 99)\n   redim N2(0 to 99)\n   array assign Nr()=3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3\n   array assign Nc()=3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2\n   n = 0\n   nn = 0\n   h = hex$(g, 16)\n   cls\n   print \"Puzzle: \";lcase$(h)\n   call ShowConfiguration(h, 2)\n   print\n   print\n   N0(0) = instr(h, \"0\") - 1\n   N2(0) = g\n   call solve()\n   print using$(\"Solution found in #### moves: \", n);\n   for j = 1 to n\n      s = s + chr$(N3(j))\n   next\n   print s\n   print \"Time = \";format$(timer-t, \"#####.########\");\" seconds\"\n   if p then\n      call showMoves(h, s, n, p)\n   end if\nend sub\n\nsub solve()\n   if fN() then\n      exit sub\n   else\n      n = 0\n      incr nn\n      call solve()\n   end if\nend sub\n\nfunction createPuzzle(byval j as long) as quad\n   local q as quad\n   local h as string\n   local z as long\n   local d as long\n   local r as long\n   local u as long\n   randomize timer\n   q=&h123456789abcdef0\n   h = hex$(q, 16)\n   u = 0\n   while j > 0 ' number of moves to do\n      do\n         d = rnd(1, 4) ' -1 +1 -4 +4\n      loop while d = u\n      u = -d\n      r = rnd(1, 3) ' repetitions\n      while r\n         z = instr(h, \"0\")\n         select case d\n            case 1 ' -1\n               if (z mod 4) <> 1 then\n                  mid$(h, z, 1) = mid$(h, z - 1, 1)\n                  mid$(h, z - 1, 1) = \"0\"\n                  decr j\n               end if\n            case 2 ' +1\n               if (z mod 4) <> 0 then\n                  mid$(h, z , 1) = mid$(h, z + 1, 1)\n                  mid$(h, z + 1, 1) = \"0\"\n                  decr j\n               end if\n            case 3 ' -4\n               if z >= 5 then\n                  mid$(h, z, 1) = mid$(h, z - 4, 1)\n                  mid$(h, z - 4, 1) = \"0\"\n                  decr j\n               end if\n            case 4 ' +4\n               if z <= 12 then\n                  mid$(h, z , 1) = mid$(h, z + 4, 1)\n                  mid$(h, z + 4, 1) = \"0\"\n                  decr j\n               end if\n         end select\n         decr r\n      wend\n   wend\n   function = val(\"&h\"+h)\nend function\n\nsub shoWMoves(byval h as string, byval s as string, byval m as long, byval p as long)\n   local j as long\n   local z as long\n   local d as long\n   cursor off\n   call ShowConfiguration(h, 12)\n   for j = 1 to m\n      d = asc(mid$(s, j, 1))\n      z = instr(h, \"0\")\n      select case d\n         case %l\n            if (z mod 4) <> 1 then\n               mid$(h, z, 1) = mid$(h, z - 1, 1)\n               mid$(h, z - 1, 1) = \"0\"\n            end if\n         case %r\n            if (z mod 4) <> 0 then\n               mid$(h, z , 1) = mid$(h, z + 1, 1)\n               mid$(h, z + 1, 1) = \"0\"\n            end if\n         case %u\n            if z >= 5 then\n               mid$(h, z, 1) = mid$(h, z - 4, 1)\n               mid$(h, z - 4, 1) = \"0\"\n            end if\n         case %d\n            if z <= 12 then\n               mid$(h, z , 1) = mid$(h, z + 4, 1)\n               mid$(h, z + 4, 1) = \"0\"\n            end if\n      end select\n      call ShowConfiguration(h, 12)\n      sleep p\n   next\n   locate 20,1\n   print \"Press any key ...\"\n   cursor on\n   waitkey$\n   cls\nend sub\n\nsub ShowConfiguration(byval h as string, i as long)\n   local r as long\n   local c as long\n   local x as string\n   for r = 1 to 4\n      for c = 1 to 4\n         locate r + i, c + c - 1\n         x = mid$(h, r * 4 - 4 + c, 1)\n         if x = \"0\" then\n            x = \" \"\n         end if\n         print x;\n      next\n   next\nend sub\n\nfunction PBMain() as long\n   call fifteenSolver(&hfe169b4c0a73d852, 1000)\n  'call fifteenSolver(createPuzzle(100), 1000)\n  'call fifteenSolver(&h0c9dfbae37254861, 1000)\nend function",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_77.txt",
        "content": "import random\n\n\nclass IDAStar:\n    def __init__(self, h, neighbours):\n        \"\"\" Iterative-deepening A* search.\n\n        h(n) is the heuristic that gives the cost between node n and the goal node. It must be admissable, meaning that h(n) MUST NEVER OVERSTIMATE the true cost. Underestimating is fine.\n\n        neighbours(n) is an iterable giving a pair (cost, node, descr) for each node neighbouring n\n        IN ASCENDING ORDER OF COST. descr is not used in the computation but can be used to\n        efficiently store information about the path edges (e.g. up/left/right/down for grids).\n        \"\"\"\n\n        self.h = h\n        self.neighbours = neighbours\n        self.FOUND = object()\n\n\n    def solve(self, root, is_goal, max_cost=None):\n        \"\"\" Returns the shortest path between the root and a given goal, as well as the total cost.\n        If the cost exceeds a given max_cost, the function returns None. If you do not give a\n        maximum cost the solver will never return for unsolvable instances.\"\"\"\n\n        self.is_goal = is_goal\n        self.path = [root]\n        self.is_in_path = {root}\n        self.path_descrs = []\n        self.nodes_evaluated = 0\n\n        bound = self.h(root)\n\n        while True:\n            t = self._search(0, bound)\n            if t is self.FOUND: return self.path, self.path_descrs, bound, self.nodes_evaluated\n            if t is None: return None\n            bound = t\n\n    def _search(self, g, bound):\n        self.nodes_evaluated += 1\n\n        node = self.path[-1]\n        f = g + self.h(node)\n        if f > bound: return f\n        if self.is_goal(node): return self.FOUND\n\n        m = None # Lower bound on cost.\n        for cost, n, descr in self.neighbours(node):\n            if n in self.is_in_path: continue\n\n            self.path.append(n)\n            self.is_in_path.add(n)\n            self.path_descrs.append(descr)\n            t = self._search(g + cost, bound)\n\n            if t == self.FOUND: return self.FOUND\n            if m is None or (t is not None and t < m): m = t\n\n            self.path.pop()\n            self.path_descrs.pop()\n            self.is_in_path.remove(n)\n\n        return m\n\n\ndef slide_solved_state(n):\n    return tuple(i % (n*n) for i in range(1, n*n+1))\n\ndef slide_randomize(p, neighbours):\n    for _ in range(len(p) ** 2):\n        _, p, _ = random.choice(list(neighbours(p)))\n    return p\n\ndef slide_neighbours(n):\n    movelist = []\n    for gap in range(n*n):\n        x, y = gap % n, gap // n\n        moves = []\n        if x > 0: moves.append(-1)    # Move the gap left.\n        if x < n-1: moves.append(+1)  # Move the gap right.\n        if y > 0: moves.append(-n)    # Move the gap up.\n        if y < n-1: moves.append(+n)  # Move the gap down.\n        movelist.append(moves)\n\n    def neighbours(p):\n        gap = p.index(0)\n        l = list(p)\n\n        for m in movelist[gap]:\n            l[gap] = l[gap + m]\n            l[gap + m] = 0\n            yield (1, tuple(l), (l[gap], m))\n            l[gap + m] = l[gap]\n            l[gap] = 0\n\n    return neighbours\n\ndef slide_print(p):\n    n = int(round(len(p) ** 0.5))\n    l = len(str(n*n))\n    for i in range(0, len(p), n):\n        print(\" \".join(\"{:>{}}\".format(x, l) for x in p[i:i+n]))\n\ndef encode_cfg(cfg, n):\n    r = 0\n    b = n.bit_length()\n    for i in range(len(cfg)):\n        r |= cfg[i] << (b*i)\n    return r\n\n\ndef gen_wd_table(n):\n    goal = [[0] * i + [n] + [0] * (n - 1 - i) for i in range(n)]\n    goal[-1][-1] = n - 1\n    goal = tuple(sum(goal, []))\n\n    table = {}\n    to_visit = [(goal, 0, n-1)]\n    while to_visit:\n        cfg, cost, e = to_visit.pop(0)\n        enccfg = encode_cfg(cfg, n)\n        if enccfg in table: continue\n        table[enccfg] = cost\n\n        for d in [-1, 1]:\n            if 0 <= e + d < n:\n                for c in range(n):\n                    if cfg[n*(e+d) + c] > 0:\n                        ncfg = list(cfg)\n                        ncfg[n*(e+d) + c] -= 1\n                        ncfg[n*e + c] += 1\n                        to_visit.append((tuple(ncfg), cost + 1, e+d))\n\n    return table\n\ndef slide_wd(n, goal):\n    wd = gen_wd_table(n)\n    goals = {i : goal.index(i) for i in goal}\n    b = n.bit_length()\n\n    def h(p):\n        ht = 0 # Walking distance between rows.\n        vt = 0 # Walking distance between columns.\n        d = 0\n        for i, c in enumerate(p):\n            if c == 0: continue\n            g = goals[c]\n            xi, yi = i % n, i // n\n            xg, yg = g % n, g // n\n            ht += 1 << (b*(n*yi+yg))\n            vt += 1 << (b*(n*xi+xg))\n\n            if yg == yi:\n                for k in range(i + 1, i - i%n + n): # Until end of row.\n                    if p[k] and goals[p[k]] // n == yi and goals[p[k]] < g:\n                        d += 2\n\n            if xg == xi:\n                for k in range(i + n, n * n, n): # Until end of column.\n                    if p[k] and goals[p[k]] % n == xi and goals[p[k]] < g:\n                        d += 2\n\n        d += wd[ht] + wd[vt]\n\n        return d\n    return h\n\n\n\n\nif __name__ == \"__main__\":\n    solved_state = slide_solved_state(4)\n    neighbours = slide_neighbours(4)\n    is_goal = lambda p: p == solved_state\n\n    tests = [\n        (15, 14, 1, 6, 9, 11, 4, 12, 0, 10, 7, 3, 13, 8, 5, 2),\n    ]\n\n    slide_solver = IDAStar(slide_wd(4, solved_state), neighbours)\n\n    for p in tests:\n        path, moves, cost, num_eval = slide_solver.solve(p, is_goal, 80)\n        slide_print(p)\n        print(\", \".join({-1: \"Left\", 1: \"Right\", -4: \"Up\", 4: \"Down\"}[move[1]] for move in moves))\n        print(cost, num_eval)\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_78.txt",
        "content": "15 14  1  6\n 9 11  4 12\n 0 10  7  3\n13  8  5  2\nRight, Right, Right, Up, Left, Down, Left, Up, Up, Left, Down, Right, Up, Right, Down, Down, Down, Left, Up, Up, Left, Up, Right, Right, Right, Down, Left, Down, Down, Right, Up, Left, Down, Left, Up, Up, Right, Down, Down, Left, Up, Left, Up, Right, Right, Up, Left, Down, Right, Right, Down, Down\n52 872794\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_79.txt",
        "content": "\"\"\"\n\nPython example for this Rosetta Code task:\n\nhttp://rosettacode.org/wiki/15_puzzle_solver\n\nUsing A* Algorithm from Wikkipedia:\n\nhttps://en.wikipedia.org/wiki/A*_search_algorithm\n\nNeed to use heuristic that guarantees a shortest path\nsolution.\n\n\"\"\"\n\nimport heapq\nimport copy\n\n# Hopefully this is larger than any fscore or gscore\n\ninteger_infinity = 1000000000\n\nclass Position(object):\n    \"\"\"Position class represents one position of a 15 puzzle\"\"\"\n\n    def __init__(self, tiles):\n        \"\"\"\n        Takes a tuple of tuples representing the tiles on a 4x4 puzzle board\n        numbering 1-15 with 0 representing an empty square. For example:\n        \n        (( 1,  2,  3,  4),\n         ( 5,  6,  7,  8),\n         ( 9, 10, 11, 12),\n         (13, 14, 15,  0))\n         \n        Converts list of lists representation into tuple of tuples.\n        \"\"\"\n        if type(tiles) == type(list()):\n            t = tiles\n            self.tiles = ((t[0][0], t[0][1], t[0][2], t[0][3]),\n                          (t[1][0], t[1][1], t[1][2], t[1][3]),        \n                          (t[2][0], t[2][1], t[2][2], t[2][3]),        \n                          (t[3][0], t[3][1], t[3][2], t[3][3]))\n        else:\n            self.tiles = tiles\n            \n        # fields for A* algorithm\n        \n        self.fscore = integer_infinity\n        self.gscore = integer_infinity\n        \n        self.cameFrom = None\n                                    \n    def copy_tiles(self):\n        \"\"\" returns list of lists version \"\"\"\n        t = self.tiles\n        \n        return [[t[0][0], t[0][1], t[0][2], t[0][3]],\n                [t[1][0], t[1][1], t[1][2], t[1][3]],        \n                [t[2][0], t[2][1], t[2][2], t[2][3]],        \n                [t[3][0], t[3][1], t[3][2], t[3][3]]]        \n\n        \n    def neighbors(self):\n        \"\"\"\n        returns a list of neighbors\n        returns a list position objects with their\n        directiontomoveto set to the direction that the\n        empty square moved.\n        \n        tiles is 4x4 tuple of tuples with\n        0,0 as top left.\n    \n        tiles[y][x]\n\n        \"\"\"\n        \n        # find 0 - blank square\n        \n        x0 = None\n        y0 = None\n        \n        for i in range(4):\n            for j in range(4):\n                if self.tiles[i][j] == 0:\n                    y0 = i\n                    x0 = j\n\n        if x0 == None or y0 == None:\n            return []\n            \n        neighbor_list = []\n            \n        # move 0 to the right\n        if x0 < 3:\n            new_tiles = self.copy_tiles()\n            temp = new_tiles[y0][x0+1]\n            new_tiles[y0][x0+1] = 0\n            new_tiles[y0][x0] = temp\n            new_pos = new_position(new_tiles)\n            neighbor_list.append(new_pos)\n        # move 0 to the left\n        if x0 > 0:\n            new_tiles = self.copy_tiles()\n            temp = new_tiles[y0][x0-1]\n            new_tiles[y0][x0-1] = 0\n            new_tiles[y0][x0] = temp\n            new_pos = new_position(new_tiles)\n            neighbor_list.append(new_pos)\n        # move 0 up\n        if y0 > 0:\n            new_tiles = self.copy_tiles()\n            temp = new_tiles[y0-1][x0]\n            new_tiles[y0-1][x0] = 0\n            new_tiles[y0][x0] = temp\n            new_pos = new_position(new_tiles)\n            neighbor_list.append(new_pos)\n        # move 0 down\n        if y0 < 3:\n            new_tiles = self.copy_tiles()\n            temp = new_tiles[y0+1][x0]\n            new_tiles[y0+1][x0] = 0\n            new_tiles[y0][x0] = temp\n            new_pos = new_position(new_tiles)\n            neighbor_list.append(new_pos)\n            \n        return neighbor_list\n        \n    def __repr__(self):\n        # printable version of self\n        \n        return str(self.tiles[0])+'\\n'+str(self.tiles[1])+'\\n'+str(self.tiles[2])+'\\n'+str(self.tiles[3])+'\\n'\n\n# takes tuple of tuples tiles as key, Position object for that tiles as value\n\nall_positions = dict()\n\ndef new_position(tiles):\n    \"\"\" returns a new position or looks up existing one \"\"\"\n    global all_positions\n    if type(tiles) == type(list()):\n        t = tiles\n        tuptiles =   ((t[0][0], t[0][1], t[0][2], t[0][3]),\n                      (t[1][0], t[1][1], t[1][2], t[1][3]),        \n                      (t[2][0], t[2][1], t[2][2], t[2][3]),        \n                      (t[3][0], t[3][1], t[3][2], t[3][3]))\n    else:\n        tuptiles = tiles\n        \n    if tuptiles in all_positions:\n        return \tall_positions[tuptiles]\n    else:\n        new_pos = Position(tiles)\n        all_positions[tuptiles] = new_pos\n        return new_pos\n                \ndef reconstruct_path(current):\n    \"\"\" \n    Uses the cameFrom members to follow the chain of moves backwards\n    and then reverses the list to get the path in the correct order.\n    \"\"\"\n    total_path = [current]\n\n    while current.cameFrom != None:\n        current = current.cameFrom\n        total_path.append(current)\n        \n    total_path.reverse()\n    \n    return total_path\n        \nclass PriorityQueue(object):\n    \"\"\"\n    Priority queue using heapq.\n    elements of queue are (fscore,tiles) for each position.\n    If element is removed from queue and fscore doesn't match\n    then that element is discarded.\n    \"\"\"\n\n    def __init__(self, object_list):\n        \"\"\" \n        Save a list in a heapq.\n        Assume that each object only appears once\n        in the list.\n        \"\"\"\n        self.queue_length = 0\n        self.qheap = []\n        for e in object_list:\n            self.qheap.append((e.fscore,e.tiles))\n            self.queue_length += 1\n        heapq.heapify(self.qheap)\n        \n    def push(self, new_object):\n        \"\"\" save object in heapq \"\"\"\n        heapq.heappush(self.qheap,(new_object.fscore,new_object.tiles))\n        self.queue_length += 1\n        \n    def pop(self):\n        \"\"\" remove object from heap and return \"\"\"\n        if self.queue_length < 1:\n            return None\n        fscore, tiles = heapq.heappop(self.qheap)\n        self.queue_length -= 1\n        global all_positions\n        pos = all_positions[tiles]\n        if pos.fscore == fscore:\n            return pos\n        else:\n            return self.pop()\n                \n    def __repr__(self):\n        # printable version of self\n        strrep = \"\"\n        for e in self.qheap:\n          fscore, tiles = e\n          strrep += str(fscore)+\":\"+str(tiles)+\"\\n\"\n        \n        return strrep\n        \nconflict_table = None\n\ndef build_conflict_table():\n    global conflict_table\n    conflict_table = dict()\n    \n    # assumes goal tuple has up to \n    # for the given pattern it the start position\n    # how much to add for linear conflicts\n    # 2 per conflict - max of 6\n    \n    # goal tuple is ('g0', 'g1', 'g2', 'g3')\n    \n    conflict_table[('g0', 'g1', 'g2', 'g3')] = 0\n    conflict_table[('g0', 'g1', 'g2', 'x')] = 0\n    conflict_table[('g0', 'g1', 'g3', 'g2')] = 2\n    conflict_table[('g0', 'g1', 'g3', 'x')] = 0\n    conflict_table[('g0', 'g1', 'x', 'g2')] = 0\n    conflict_table[('g0', 'g1', 'x', 'g3')] = 0\n    conflict_table[('g0', 'g1', 'x', 'x')] = 0\n    conflict_table[('g0', 'g2', 'g1', 'g3')] = 2\n    conflict_table[('g0', 'g2', 'g1', 'x')] = 2\n    conflict_table[('g0', 'g2', 'g3', 'g1')] = 4\n    conflict_table[('g0', 'g2', 'g3', 'x')] = 0\n    conflict_table[('g0', 'g2', 'x', 'g1')] = 2\n    conflict_table[('g0', 'g2', 'x', 'g3')] = 0\n    conflict_table[('g0', 'g2', 'x', 'x')] = 0\n    conflict_table[('g0', 'g3', 'g1', 'g2')] = 4 \n    conflict_table[('g0', 'g3', 'g1', 'x')] = 2\n    conflict_table[('g0', 'g3', 'g2', 'g1')] = 4\n    conflict_table[('g0', 'g3', 'g2', 'x')] = 2\n    conflict_table[('g0', 'g3', 'x', 'g1')] = 2\n    conflict_table[('g0', 'g3', 'x', 'g2')] = 2\n    conflict_table[('g0', 'g3', 'x', 'x')] = 0\n    conflict_table[('g0', 'x', 'g1', 'g2')] = 0\n    conflict_table[('g0', 'x', 'g1', 'g3')] = 0\n    conflict_table[('g0', 'x', 'g1', 'x')] = 0\n    conflict_table[('g0', 'x', 'g2', 'g1')] = 2\n    conflict_table[('g0', 'x', 'g2', 'g3')] = 0\n    conflict_table[('g0', 'x', 'g2', 'x')] = 0\n    conflict_table[('g0', 'x', 'g3', 'g1')] = 2\n    conflict_table[('g0', 'x', 'g3', 'g2')] = 2\n    conflict_table[('g0', 'x', 'g3', 'x')] = 0\n    conflict_table[('g0', 'x', 'x', 'g1')] = 0\n    conflict_table[('g0', 'x', 'x', 'g2')] = 0\n    conflict_table[('g0', 'x', 'x', 'g3')] = 0\n    conflict_table[('g1', 'g0', 'g2', 'g3')] = 2\n    conflict_table[('g1', 'g0', 'g2', 'x')] = 2\n    conflict_table[('g1', 'g0', 'g3', 'g2')] = 4 \n    conflict_table[('g1', 'g0', 'g3', 'x')] = 2\n    conflict_table[('g1', 'g0', 'x', 'g2')] = 2\n    conflict_table[('g1', 'g0', 'x', 'g3')] = 2\n    conflict_table[('g1', 'g0', 'x', 'x')] = 2\n    conflict_table[('g1', 'g2', 'g0', 'g3')] = 4 \n    conflict_table[('g1', 'g2', 'g0', 'x')] = 4\n    conflict_table[('g1', 'g2', 'g3', 'g0')] = 6 \n    conflict_table[('g1', 'g2', 'g3', 'x')] = 0\n    conflict_table[('g1', 'g2', 'x', 'g0')] = 4\n    conflict_table[('g1', 'g2', 'x', 'g3')] = 0\n    conflict_table[('g1', 'g2', 'x', 'x')] = 0\n    conflict_table[('g1', 'g3', 'g0', 'g2')] = 4 \n    conflict_table[('g1', 'g3', 'g0', 'x')] = 4\n    conflict_table[('g1', 'g3', 'g2', 'g0')] = 6 \n    conflict_table[('g1', 'g3', 'g2', 'x')] = 0\n    conflict_table[('g1', 'g3', 'x', 'g0')] = 4\n    conflict_table[('g1', 'g3', 'x', 'g2')] = 2\n    conflict_table[('g1', 'g3', 'x', 'x')] = 0\n    conflict_table[('g1', 'x', 'g0', 'g2')] = 2\n    conflict_table[('g1', 'x', 'g0', 'g3')] = 2\n    conflict_table[('g1', 'x', 'g0', 'x')] = 2\n    conflict_table[('g1', 'x', 'g2', 'g0')] = 4\n    conflict_table[('g1', 'x', 'g2', 'g3')] = 0\n    conflict_table[('g1', 'x', 'g2', 'x')] = 0\n    conflict_table[('g1', 'x', 'g3', 'g0')] = 4\n    conflict_table[('g1', 'x', 'g3', 'g2')] = 2\n    conflict_table[('g1', 'x', 'g3', 'x')] = 0\n    conflict_table[('g1', 'x', 'x', 'g0')] = 2\n    conflict_table[('g1', 'x', 'x', 'g2')] = 0\n    conflict_table[('g1', 'x', 'x', 'g3')] = 0\n    conflict_table[('g2', 'g0', 'g1', 'g3')] = 4\n    conflict_table[('g2', 'g0', 'g1', 'x')] = 4\n    conflict_table[('g2', 'g0', 'g3', 'g1')] = 4\n    conflict_table[('g2', 'g0', 'g3', 'x')] = 2\n    conflict_table[('g2', 'g0', 'x', 'g1')] = 4\n    conflict_table[('g2', 'g0', 'x', 'g3')] = 2\n    conflict_table[('g2', 'g0', 'x', 'x')] = 2\n    conflict_table[('g2', 'g1', 'g0', 'g3')] = 4\n    conflict_table[('g2', 'g1', 'g0', 'x')] = 4\n    conflict_table[('g2', 'g1', 'g3', 'g0')] = 6\n    conflict_table[('g2', 'g1', 'g3', 'x')] = 2\n    conflict_table[('g2', 'g1', 'x', 'g0')] = 4\n    conflict_table[('g2', 'g1', 'x', 'g3')] = 2\n    conflict_table[('g2', 'g1', 'x', 'x')] = 2\n    conflict_table[('g2', 'g3', 'g0', 'g1')] = 4\n    conflict_table[('g2', 'g3', 'g0', 'x')] = 4\n    conflict_table[('g2', 'g3', 'g1', 'g0')] = 6\n    conflict_table[('g2', 'g3', 'g1', 'x')] = 4\n    conflict_table[('g2', 'g3', 'x', 'g0')] = 4\n    conflict_table[('g2', 'g3', 'x', 'g1')] = 4\n    conflict_table[('g2', 'g3', 'x', 'x')] = 0\n    conflict_table[('g2', 'x', 'g0', 'g1')] = 4\n    conflict_table[('g2', 'x', 'g0', 'g3')] = 2\n    conflict_table[('g2', 'x', 'g0', 'x')] = 2\n    conflict_table[('g2', 'x', 'g1', 'g0')] = 4\n    conflict_table[('g2', 'x', 'g1', 'g3')] = 2\n    conflict_table[('g2', 'x', 'g1', 'x')] = 2\n    conflict_table[('g2', 'x', 'g3', 'g0')] = 4\n    conflict_table[('g2', 'x', 'g3', 'g1')] = 4\n    conflict_table[('g2', 'x', 'g3', 'x')] = 0\n    conflict_table[('g2', 'x', 'x', 'g0')] = 2\n    conflict_table[('g2', 'x', 'x', 'g1')] = 2\n    conflict_table[('g2', 'x', 'x', 'g3')] = 0\n    conflict_table[('g3', 'g0', 'g1', 'g2')] = 6\n    conflict_table[('g3', 'g0', 'g1', 'x')] = 4\n    conflict_table[('g3', 'g0', 'g2', 'g1')] = 6\n    conflict_table[('g3', 'g0', 'g2', 'x')] = 4\n    conflict_table[('g3', 'g0', 'x', 'g1')] = 4\n    conflict_table[('g3', 'g0', 'x', 'g2')] = 4\n    conflict_table[('g3', 'g0', 'x', 'x')] = 2\n    conflict_table[('g3', 'g1', 'g0', 'g2')] = 6\n    conflict_table[('g3', 'g1', 'g0', 'x')] = 4\n    conflict_table[('g3', 'g1', 'g2', 'g0')] = 6\n    conflict_table[('g3', 'g1', 'g2', 'x')] = 4\n    conflict_table[('g3', 'g1', 'x', 'g0')] = 4\n    conflict_table[('g3', 'g1', 'x', 'g2')] = 4\n    conflict_table[('g3', 'g1', 'x', 'x')] = 2\n    conflict_table[('g3', 'g2', 'g0', 'g1')] = 6\n    conflict_table[('g3', 'g2', 'g0', 'x')] = 4\n    conflict_table[('g3', 'g2', 'g1', 'g0')] = 6\n    conflict_table[('g3', 'g2', 'g1', 'x')] = 4\n    conflict_table[('g3', 'g2', 'x', 'g0')] = 4\n    conflict_table[('g3', 'g2', 'x', 'g1')] = 4\n    conflict_table[('g3', 'g2', 'x', 'x')] = 2\n    conflict_table[('g3', 'x', 'g0', 'g1')] = 4\n    conflict_table[('g3', 'x', 'g0', 'g2')] = 4\n    conflict_table[('g3', 'x', 'g0', 'x')] = 2\n    conflict_table[('g3', 'x', 'g1', 'g0')] = 4\n    conflict_table[('g3', 'x', 'g1', 'g2')] = 4\n    conflict_table[('g3', 'x', 'g1', 'x')] = 2\n    conflict_table[('g3', 'x', 'g2', 'g0')] = 4\n    conflict_table[('g3', 'x', 'g2', 'g1')] = 4\n    conflict_table[('g3', 'x', 'g2', 'x')] = 2\n    conflict_table[('g3', 'x', 'x', 'g0')] = 2\n    conflict_table[('g3', 'x', 'x', 'g1')] = 2\n    conflict_table[('g3', 'x', 'x', 'g2')] = 2\n    conflict_table[('x', 'g0', 'g1', 'g2')] = 0\n    conflict_table[('x', 'g0', 'g1', 'g3')] = 0\n    conflict_table[('x', 'g0', 'g1', 'x')] = 0\n    conflict_table[('x', 'g0', 'g2', 'g1')] = 2\n    conflict_table[('x', 'g0', 'g2', 'g3')] = 0\n    conflict_table[('x', 'g0', 'g2', 'x')] = 0\n    conflict_table[('x', 'g0', 'g3', 'g1')] = 2\n    conflict_table[('x', 'g0', 'g3', 'g2')] = 2\n    conflict_table[('x', 'g0', 'g3', 'x')] = 0\n    conflict_table[('x', 'g0', 'x', 'g1')] = 0\n    conflict_table[('x', 'g0', 'x', 'g2')] = 0\n    conflict_table[('x', 'g0', 'x', 'g3')] = 0\n    conflict_table[('x', 'g1', 'g0', 'g2')] = 2\n    conflict_table[('x', 'g1', 'g0', 'g3')] = 2\n    conflict_table[('x', 'g1', 'g0', 'x')] = 2\n    conflict_table[('x', 'g1', 'g2', 'g0')] = 4\n    conflict_table[('x', 'g1', 'g2', 'g3')] = 0\n    conflict_table[('x', 'g1', 'g2', 'x')] = 0\n    conflict_table[('x', 'g1', 'g3', 'g0')] = 4\n    conflict_table[('x', 'g1', 'g3', 'g2')] = 2\n    conflict_table[('x', 'g1', 'g3', 'x')] = 0\n    conflict_table[('x', 'g1', 'x', 'g0')] = 2\n    conflict_table[('x', 'g1', 'x', 'g2')] = 0\n    conflict_table[('x', 'g1', 'x', 'g3')] = 0\n    conflict_table[('x', 'g2', 'g0', 'g1')] = 4\n    conflict_table[('x', 'g2', 'g0', 'g3')] = 2\n    conflict_table[('x', 'g2', 'g0', 'x')] = 2\n    conflict_table[('x', 'g2', 'g1', 'g0')] = 4\n    conflict_table[('x', 'g2', 'g1', 'g3')] = 2\n    conflict_table[('x', 'g2', 'g1', 'x')] = 2\n    conflict_table[('x', 'g2', 'g3', 'g0')] = 4\n    conflict_table[('x', 'g2', 'g3', 'g1')] = 4\n    conflict_table[('x', 'g2', 'g3', 'x')] = 0\n    conflict_table[('x', 'g2', 'x', 'g0')] = 2\n    conflict_table[('x', 'g2', 'x', 'g1')] = 2\n    conflict_table[('x', 'g2', 'x', 'g3')] = 0\n    conflict_table[('x', 'g3', 'g0', 'g1')] = 4\n    conflict_table[('x', 'g3', 'g0', 'g2')] = 4\n    conflict_table[('x', 'g3', 'g0', 'x')] = 2\n    conflict_table[('x', 'g3', 'g1', 'g0')] = 4\n    conflict_table[('x', 'g3', 'g1', 'g2')] = 4\n    conflict_table[('x', 'g3', 'g1', 'x')] = 2\n    conflict_table[('x', 'g3', 'g2', 'g0')] = 4\n    conflict_table[('x', 'g3', 'g2', 'g1')] = 4\n    conflict_table[('x', 'g3', 'g2', 'x')] = 2\n    conflict_table[('x', 'g3', 'x', 'g0')] = 2\n    conflict_table[('x', 'g3', 'x', 'g1')] = 2\n    conflict_table[('x', 'g3', 'x', 'g2')] = 2\n    conflict_table[('x', 'x', 'g0', 'g1')] = 0\n    conflict_table[('x', 'x', 'g0', 'g2')] = 0\n    conflict_table[('x', 'x', 'g0', 'g3')] = 0\n    conflict_table[('x', 'x', 'g1', 'g0')] = 2\n    conflict_table[('x', 'x', 'g1', 'g2')] = 0\n    conflict_table[('x', 'x', 'g1', 'g3')] = 0\n    conflict_table[('x', 'x', 'g2', 'g0')] = 2\n    conflict_table[('x', 'x', 'g2', 'g1')] = 2\n    conflict_table[('x', 'x', 'g2', 'g3')] = 0\n    conflict_table[('x', 'x', 'g3', 'g0')] = 2\n    conflict_table[('x', 'x', 'g3', 'g1')] = 2\n    conflict_table[('x', 'x', 'g3', 'g2')] = 2\n        \ndef linear_conflicts(start_list,goal_list):\n    \"\"\"\n    calculates number of moves to add to the estimate of\n    the moves to get from start to goal based on the number\n    of conflicts on a given row or column. start_list\n    represents the current location and goal_list represnts\n    the final goal.\n    \"\"\"\n    \n    # Find which of the tiles in start_list have their goals on this line\n    # build a pattern to use in a lookup table of this form:\n    # g0, g1, g3, g3 fill in x where there is no goal for this line\n    \n    # all 'x' until we file a tile whose goal is in this line\n    \n    goal_pattern = ['x', 'x', 'x', 'x']\n    \n    for g in range(4):\n        for s in range(4):\n            start_tile_num = start_list[s]\n            if start_tile_num == goal_list[g] and start_tile_num != 0:\n                goal_pattern[s] = 'g' + str(g) # i.e. g0\n                                \n    global conflict_table\n    \n    tup_goal_pattern = tuple(goal_pattern)\n    \n    if tup_goal_pattern in conflict_table:\n        return conflict_table[tuple(goal_pattern)]\n    else:\n        return 0\n    \nclass lcmap(dict):\n    \"\"\" \n    Lets you return 0 if you look for an object that\n    is not in the dictionary. \n    \"\"\"\n    def __missing__(self, key):\n        return 0\n\ndef listconflicts(goal_list):\n    \"\"\" \n    list all possible start lists that will have at least\n    one linear conflict.\n    \n    Possible goal tile configurations\n    \n    g g g g\n    g g g x\n    g g x g\n    g x g g\n    x g g g\n    g g x x\n    g x g x\n    g x x g\n    x g g x\n    x g x g\n    x x g g\n        \n    \"\"\"\n    \n    all_tiles = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15]\n    \n    non_goal_tiles = []\n    \n    for t in all_tiles:\n        if t not in goal_list:\n            non_goal_tiles.append(t) \n            \n    combinations = lcmap()\n\n    # g g g g\n    \n    for i in goal_list:\n        tile_list2 = goal_list[:]\n        tile_list2.remove(i)\n        for j in tile_list2:\n            tile_list3 = tile_list2[:]\n            tile_list3.remove(j)\n            for k in tile_list3:\n                tile_list4 = tile_list3[:]\n                tile_list4.remove(k)\n                for l in tile_list4:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd    \n    \n    # g g g x\n    \n    for i in goal_list:\n        tile_list2 = goal_list[:]\n        tile_list2.remove(i)\n        for j in tile_list2:\n            tile_list3 = tile_list2[:]\n            tile_list3.remove(j)\n            for k in tile_list3:\n                for l in non_goal_tiles:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd  \n\n    # g g x g\n    \n    for i in goal_list:\n        tile_list2 = goal_list[:]\n        tile_list2.remove(i)\n        for j in tile_list2:\n            tile_list3 = tile_list2[:]\n            tile_list3.remove(j)\n            for k in non_goal_tiles:\n                for l in tile_list3:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd\n    # g x g g\n    \n    for i in goal_list:\n        tile_list2 = goal_list[:]\n        tile_list2.remove(i)\n        for j in non_goal_tiles:\n            for k in tile_list2:\n                tile_list3 = tile_list2[:]\n                tile_list3.remove(k)\n                for l in tile_list3:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd\n\n    # x g g g\n    \n    for i in non_goal_tiles:\n        for j in goal_list:\n            tile_list2 = goal_list[:]\n            tile_list2.remove(j)\n            for k in tile_list2:\n                tile_list3 = tile_list2[:]\n                tile_list3.remove(k)\n                for l in tile_list3:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd\n\n    # g g x x\n\n    for i in goal_list:\n        tile_list2 = goal_list[:]\n        tile_list2.remove(i)\n        for j in tile_list2:\n            tile_list3 = tile_list2[:]\n            tile_list3.remove(j)\n            for k in non_goal_tiles:\n                tile_list4 = non_goal_tiles[:]\n                tile_list4.remove(k)\n                for l in tile_list4:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd \n                        \n    # g x g x\n\n    for i in goal_list:\n        tile_list2 = goal_list[:]\n        tile_list2.remove(i)\n        for j in non_goal_tiles:\n            tile_list3 = non_goal_tiles[:]\n            tile_list3.remove(j)\n            for k in tile_list2:\n                for l in tile_list3:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd    \n                        \n    # g x x g\n\n    for i in goal_list:\n        tile_list2 = goal_list[:]\n        tile_list2.remove(i)\n        for j in non_goal_tiles:\n            tile_list3 = non_goal_tiles[:]\n            tile_list3.remove(j)\n            for k in tile_list2:\n                for l in tile_list3:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd     \n    \n    # x g g x\n\n    for i in non_goal_tiles:\n        tile_list2 = non_goal_tiles[:]\n        tile_list2.remove(i)\n        for j in goal_list:\n            tile_list3 = goal_list[:]\n            tile_list3.remove(j)\n            for k in tile_list3:\n                for l in tile_list2:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd      \n    \n    # x g x g\n    \n    for i in non_goal_tiles:\n        tile_list2 = non_goal_tiles[:]\n        tile_list2.remove(i)\n        for j in goal_list:\n            tile_list3 = goal_list[:]\n            tile_list3.remove(j)\n            for k in tile_list3:\n                for l in tile_list2:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd      \n      \n    # x x g g\n    \n    for i in non_goal_tiles:\n        tile_list2 = non_goal_tiles[:]\n        tile_list2.remove(i)\n        for j in tile_list2:\n            for k in goal_list:\n                tile_list3 = goal_list[:]\n                tile_list3.remove(k)\n                for l in tile_list3:\n                    start_list = (i, j, k, l)\n                    conflictadd = linear_conflicts(start_list,goal_list)\n                    if conflictadd > 0:\n                        combinations[start_list]=conflictadd      \n      \n    return combinations\n\n\nclass HeuristicObj(object):\n    \"\"\" Object used to preprocess goal position for heuristic function \"\"\"\n\n    def __init__(self, goal):\n        \"\"\"\n        Preprocess goal position to setup internal data structures\n        that can be used to speed up heuristic.\n        \"\"\"\n        \n        build_conflict_table()\n        \n        self.goal_map = []\n        for i in range(16):\n            self.goal_map.append(i)    \n        \n        self.goal_lists = goal.tiles\n        \n        # preprocess for manhattan distance\n        \n        for row in range(4):\n            for col in range(4):\n                self.goal_map[goal.tiles[row][col]] = (row, col)\n                \n        # make access faster by changing to a tuple\n        \n        self.goal_map = tuple(self.goal_map)\n                \n        # preprocess for linear conflicts\n        \n        self.row_conflicts = []\n        for row in range(4):\n            t = goal.tiles[row]\n            conf_dict = listconflicts([t[0],t[1],t[2],t[3]])\n            self.row_conflicts.append(conf_dict)\n            \n        self.col_conflicts = []\n        for col in range(4):\n            col_list =[]\n            for row in range(4):\n                col_list.append(goal.tiles[row][col])\n            conf_dict = listconflicts(col_list)\n            self.col_conflicts.append(conf_dict)\n\n    def heuristic(self, start):\n        \"\"\" \n        \n        Estimates the number of moves from start to goal.\n        The goal was preprocessed in __init__.\n        \n        \"\"\"\n        \n        distance = 0\n        \n        # local variables for instance variables\n        \n        t = start.tiles\n        g = self.goal_map\n        rc = self.row_conflicts\n        cc = self.col_conflicts\n        \n        # calculate manhattan distance\n        \n        for row in range(4):\n            for col in range(4):\n                start_tilenum = t[row][col]\n                if start_tilenum != 0:\n                    (grow, gcol) = g[start_tilenum]\n                    distance += abs(row - grow) + abs(col - gcol)\n                                        \n        # add linear conflicts \n        \n        for row in range(4):\n            curr_row = t[row]\n            distance += rc[row][curr_row]\n       \n        for col in range(4):\n            col_tuple = (t[0][col], t[1][col], t[2][col], t[3][col])\n            distance += cc[col][col_tuple]\n          \n        return distance\n        \n# global variable for heuristic object\n\nhob = None\n        \ndef a_star(start_tiles, goal_tiles):\n    \"\"\" Based on https://en.wikipedia.org/wiki/A*_search_algorithm \"\"\"\n    \n    start = new_position(start_tiles)\n    goal = new_position(goal_tiles)\n    \n    # Process goal position for use in heuristic\n    \n    global hob\n    hob = HeuristicObj(goal)\n    \n    # The set of currently discovered nodes that are not evaluated yet.\n    # Initially, only the start node is known.\n    # For the first node, the fscore is completely heuristic.\n    \n    start.fscore = hob.heuristic(start)\n    openSet = PriorityQueue([start])\n \n    # The cost of going from start to start is zero.\n    \n    start.gscore = 0\n    \n    num_popped = 0\n    \n    while openSet.queue_length > 0:\n        current = openSet.pop()\n        if current == None: # tried to pop but only found old fscore values\n            break\n        num_popped += 1\n        if num_popped % 100000 == 0:\n            print(str(num_popped)+\" positions examined\")\n        \n        if current == goal:\n            return reconstruct_path(current)\n            \n        for neighbor in current.neighbors():\n\n            # The distance from start to a neighbor\n            # All nodes are 1 move from their neighbors\n            \n            tentative_gScore = current.gscore + 1\n            \n            # update gscore and fscore if this is shorter path\n            # to the neighbor node\n\n            if tentative_gScore < neighbor.gscore: \n                neighbor.cameFrom = current\n                neighbor.gscore = tentative_gScore\n                neighbor.fscore = neighbor.gscore + hob.heuristic(neighbor)\n                openSet.push(neighbor) # add to open set every time\n                \n\ndef find_zero(tiles):\n    \"\"\" file the 0 tile \"\"\"\n    for row in range(4):\n        for col in range(4):\n            if tiles[row][col] == 0:\n                return (row, col)\n\ndef path_as_0_moves(path):\n    \"\"\"\n    Takes the path which is a list of Position\n    objects and outputs it as a string of rlud \n    directions to match output desired by \n    Rosetta Code task.\n    \"\"\"\n    strpath = \"\"\n    if len(path) < 1:\n        return \"\"\n    prev_pos = path[0]\n    p_row, p_col = find_zero(prev_pos.tiles)\n    for i in range(1,len(path)):\n        curr_pos = path[i]\n        c_row, c_col = find_zero(curr_pos.tiles)\n        if c_row > p_row:\n            strpath += 'd'\n        elif c_row < p_row:\n            strpath += 'u'\n        elif c_col > p_col:\n            strpath += 'r'\n        elif c_col < p_col:\n            strpath += 'l'\n        # reset for next loop\n        prev_pos = curr_pos\n        p_row = c_row\n        p_col = c_col\n    return strpath\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_8.txt",
        "content": "with Ada.Text_IO;\n\nprocedure Puzzle_15 is\n\n   type Direction is (Up, Down, Left, Right);\n   type Row_Type is range 0 .. 3;\n   type Col_Type is range 0 .. 3;\n   type Tile_Type is range 0 .. 15;\n\n   To_Col : constant array (Tile_Type) of Col_Type :=\n     (3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2);\n   To_Row : constant array (Tile_Type) of Row_Type :=\n     (3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3);\n\n   type Board_Type is array (Row_Type, Col_Type) of Tile_Type;\n\n   Solved_Board : constant Board_Type :=\n     ((1,   2,  3,  4),\n      (5,   6,  7,  8),\n      (9,  10, 11, 12),\n      (13, 14, 15, 0));\n\n   type Try_Type is\n      record\n         Board : Board_Type;\n         Move  : Direction;\n         Cost  : Integer;\n         Row   : Row_Type;\n         Col   : Col_Type;\n      end record;\n\n   Stack : array (0 .. 100) of Try_Type;\n   Top             : Natural := 0;\n   Iteration_Count : Natural := 0;\n\n   procedure Move_Down is\n      Board   : Board_Type         := Stack (Top).Board;\n      Row     : constant Row_Type  := Stack (Top).Row;\n      Col     : constant Col_Type  := Stack (Top).Col;\n      Tile    : constant Tile_Type := Board (Row + 1, Col);\n      Penalty : constant Integer   :=\n        (if To_Row (Tile) <= Row then 0 else 1);\n   begin\n      Board (Row,     Col) := Tile;\n      Board (Row + 1, Col) := 0;\n      Stack (Top + 1) := (Board => Board,\n                          Move  => Down,\n                          Row   => Row + 1,\n                          Col   => Col,\n                          Cost  => Stack (Top).Cost + Penalty);\n   end Move_Down;\n\n   procedure Move_Up is\n      Board   : Board_Type         := Stack (Top).Board;\n      Row     : constant Row_Type  := Stack (Top).Row;\n      Col     : constant Col_Type  := Stack (Top).Col;\n      Tile    : constant Tile_Type := Board (Row - 1, Col);\n      Penalty : constant Integer   :=\n        (if To_Row (Tile) >= Row then 0 else 1);\n   begin\n      Board (Row,     Col) := Tile;\n      Board (Row - 1, Col) := 0;\n      Stack (Top + 1) := (Board => Board,\n                          Move  => Up,\n                          Row   => Row - 1,\n                          Col   => Col,\n                          Cost  => Stack (Top).Cost + Penalty);\n   end Move_Up;\n\n   procedure Move_Left is\n      Board   : Board_Type         := Stack (Top).Board;\n      Row     : constant Row_Type  := Stack (Top).Row;\n      Col     : constant Col_Type  := Stack (Top).Col;\n      Tile    : constant Tile_Type := Board (Row, Col - 1);\n      Penalty : constant Integer :=\n        (if To_Col (Tile) >= Col then 0 else 1);\n   begin\n      Board (Row, Col)     := Tile;\n      Board (Row, Col - 1) := 0;\n      Stack (Top + 1) := (Board => Board,\n                          Move  => Left,\n                          Row   => Row,\n                          Col   => Col - 1,\n                          Cost  => Stack (Top).Cost + Penalty);\n   end Move_Left;\n\n   procedure Move_Right is\n      Board   : Board_Type         := Stack (Top).Board;\n      Row     : constant Row_Type  := Stack (Top).Row;\n      Col     : constant Col_Type  := Stack (Top).Col;\n      Tile    : constant Tile_Type := Board (Row, Col + 1);\n      Penalty : constant Integer :=\n        (if To_Col (Tile) <= Col then 0 else 1);\n   begin\n      Board (Row, Col)     := Tile;\n      Board (Row, Col + 1) := 0;\n      Stack (Top + 1) := (Board => Board,\n                          Move  => Right,\n                          Row   => Row,\n                          Col   => Col + 1,\n                          Cost  => Stack (Top).Cost + Penalty);\n   end Move_Right;\n\n   function Is_Solution return Boolean;\n\n   function Test_Moves return Boolean is\n   begin\n      if\n        Stack (Top).Move /= Down and then\n        Stack (Top).Row  /= Row_Type'First\n      then\n         Move_Up;\n         Top := Top + 1;\n         if Is_Solution then return True; end if;\n         Top := Top - 1;\n      end if;\n\n      if\n        Stack (Top).Move /= Up and then\n        Stack (Top).Row  /= Row_Type'Last\n      then\n         Move_Down;\n         Top := Top + 1;\n         if Is_Solution then return True; end if;\n         Top := Top - 1;\n      end if;\n\n      if\n        Stack (Top).Move /= Right and then\n        Stack (Top).Col  /= Col_Type'First\n      then\n         Move_Left;\n         Top := Top + 1;\n         if Is_Solution then return True; end if;\n         Top := Top - 1;\n      end if;\n\n      if\n        Stack (Top).Move /= Left and then\n        Stack (Top).Col  /= Col_Type'Last\n      then\n         Move_Right;\n         Top := Top + 1;\n         if Is_Solution then return True; end if;\n         Top := Top - 1;\n      end if;\n\n      return False;\n   end Test_Moves;\n\n   function Is_Solution return Boolean is\n      use Ada.Text_IO;\n   begin\n      if Stack (Top).Board = Solved_Board then\n         Put (\"Solved in \" & Top'Image & \" moves: \");\n         for R in 1 .. Top loop\n            Put (String'(Stack (R).Move'Image) (1));\n         end loop;\n         New_Line;\n         return True;\n      end if;\n      if Stack (Top).Cost <= Iteration_Count then\n         return Test_Moves;\n      end if;\n      return False;\n   end Is_Solution;\n\n   procedure Solve (Row   : in Row_Type;\n                    Col   : in Col_Type;\n                    Board : in Board_Type) is\n   begin\n      pragma Assert (Board (Row, Col) = 0);\n      Top := 0;\n      Iteration_Count := 0;\n      Stack (Top) := (Board => Board,\n                      Row   => Row,\n                      Col   => Col,\n                      Move  => Down,\n                      Cost  => 0);\n      while not Is_Solution loop\n         Iteration_Count := Iteration_Count + 1;\n      end loop;\n   end Solve;\n\nbegin\n   Solve (Row   => 2,\n          Col   => 0,\n          Board => ((15, 14, 1, 6),\n                    (9, 11, 4, 12),\n                    (0, 10, 7, 3),\n                    (13, 8, 5, 2)));\nend Puzzle_15;\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_80.txt",
        "content": "\"\"\"\n\nRuns one test of the solver passing a \nstart and goal position.\n\n\"\"\"\n\nfrom astar import *\nimport time\n\n# Rosetta Code start position\n\n\nstart_tiles =    [[ 15, 14,  1,  6],\n                  [ 9, 11,  4, 12],\n                  [ 0, 10,  7,  3],\n                  [13,  8,  5,  2]]\n\ngoal_tiles =        [[ 1,  2,  3,  4],\n                     [ 5,  6,  7,  8],\n                     [ 9, 10, 11, 12],\n                     [13, 14, 15,  0]]\n                 \n\nbefore = time.perf_counter()\n\nresult = a_star(start_tiles,goal_tiles)\n\nafter = time.perf_counter()\n\nprint(\" \")\nprint(\"Path length = \"+str(len(result) - 1))\nprint(\" \")\nprint(\"Path using rlud:\")\nprint(\" \")\nprint(path_as_0_moves(result))\nprint(\" \")\nprint(\"Run time in seconds: \"+str(after - before))\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_81.txt",
        "content": "C:\\bobby\\15puzzlesolver\\my15puzzlesolver>testone.py\n100000 positions examined\n200000 positions examined\n300000 positions examined\n400000 positions examined\n500000 positions examined\n600000 positions examined\n700000 positions examined\n800000 positions examined\n\nPath length = 52\n\nPath using rlud:\n\nrrruldluuldrurdddluulurrrdlddruldluurddlulurruldrrdd\n\nRun time in seconds: 56.601139201\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_82.txt",
        "content": "#lang racket\n\n;;; Solution to the 15-puzzle game, based on the A* algorithm described\n;;; at https://de.wikipedia.org/wiki/A*-Algorithmus\n\n;;; Inspired by the Python solution of the rosetta code:\n;;; http://rosettacode.org/wiki/15_puzzle_solver#Python\n\n(require racket/set)\n(require data/heap)\n\n;; ----------------------------------------------------------------------------\n;; Datatypes\n\n;; A posn is a pair struct containing two integer for the row/col indices.\n(struct posn (row col) #:transparent)\n\n;; A state contains a vector and a posn describing the position of the empty slot.\n(struct state (matrix empty-slot) #:transparent)\n\n(define directions '(up down left right))\n\n;; A node contains a state, a reference to the previous node, a g value (actual\n;; costs until this node, and a f value (g value + heuristics).\n(struct node (state prev cost f-value) #:transparent)\n\n;; ----------------------------------------------------------------------------\n;; Constants\n\n(define side-size 4)\n\n(define initial-state\n  (state\n    #(\n      15  14  1  6\n      9  11  4 12\n      0  10  7  3\n      13  8  5  2)\n    (posn 2 0)))\n\n\n(define goal-state\n  (state\n    #( 1  2  3  4\n      5  6  7 8\n      9 10 11 12\n      13 14 15 0)\n    (posn 3 3)))\n\n;; ----------------------------------------------------------------------------\n;; Functions\n\n;; Matrices are simple vectors, abstracted by following functions.\n(define (matrix-ref matrix row col)\n  (vector-ref matrix (+ (* row side-size) col)))\n\n(define (matrix-set! matrix row col val)\n  (vector-set! matrix\n               (+ (* row side-size) col)\n               val))\n\n(define (target-state? st)\n  (equal? st goal-state))\n\n;; Traverse all nodes until the initial state and generate a return a list\n;; of symbols describing the path.\n(define (reconstruct-movements leaf-node)\n  ;; compute a pair describing the movement.\n  (define (posn-diff p0 p1)\n    (posn (- (posn-row p1) (posn-row p0))\n          (- (posn-col p1) (posn-col p0))))\n  \n  ;; describe a single movement with a symbol (r, l, u d).\n  (define (find-out-movement prev-st st)\n    (let ([prev-empty-slot (state-empty-slot prev-st)]\n          [this-empty-slot (state-empty-slot st)])\n      (match (posn-diff prev-empty-slot this-empty-slot)\n             [(posn  1  0) 'u]\n             [(posn -1  0) 'd]\n             [(posn  0  1) 'l]\n             [(posn  0 -1) 'r]\n             [#f 'invalid])))\n  \n  (define (iter n path)\n    (if (or (not n) (not (node-prev n)))\n        path\n      (iter (node-prev n)\n            (cons (find-out-movement (node-state n)\n                                     (node-state (node-prev n)))\n                  path))))\n  (iter leaf-node '()))\n\n(define (print-path path)\n  (for ([dir (in-list (car path))])\n       (display dir))\n  (newline))\n\n;; Return #t if direction is allowed for the given empty slot position.\n(define (movement-valid? direction empty-slot)\n  (match direction\n         ['up (< (posn-row empty-slot) (- side-size 1))]\n         ['down (> (posn-row empty-slot) 0)]\n         ['left (< (posn-col empty-slot) (- side-size 1))]\n         ['right (> (posn-col empty-slot) 0)]))\n\n;; assumes move direction is valid (see movement-valid?).\n;; Return a new state in the given direction.\n(define (move st direction)\n  (define m (vector-copy (state-matrix st)))\n  (define empty-slot (state-empty-slot st))\n  (define r (posn-row empty-slot))\n  (define c (posn-col empty-slot))\n  (define new-empty-slot\n    (match direction\n           ['up  (begin (matrix-set! m r c (matrix-ref m (+ r 1) c))\n                        (matrix-set! m (+ r 1) c 0)\n                        (posn (+ r 1) c))]\n           ['down (begin (matrix-set! m r c (matrix-ref m (- r 1) c))\n                         (matrix-set! m (- r 1) c 0)\n                         (posn (- r 1) c))]\n           ['left (begin (matrix-set! m r c (matrix-ref m r (+ c 1)))\n                         (matrix-set! m r (+ c 1) 0)\n                         (posn r (+ c 1)))]\n           ['right (begin (matrix-set! m r c (matrix-ref m r (- c 1)))\n                          (matrix-set! m r (- c 1) 0)\n                          (posn r (- c 1)))]))\n  (state m new-empty-slot))\n\n(define (l1-distance posn0 posn1)\n  (+ (abs (- (posn-row posn0) (posn-row posn1)))\n     (abs (- (posn-col posn0) (posn-col posn1)))))\n\n;; compute the L1 distance from the current position and the goal position for\n;; the given val\n(define (element-cost val current-posn)\n  (if (= val 0)\n      (l1-distance current-posn (posn 3 3))\n    (let ([target-row (quotient (- val 1) side-size)]\n          [target-col (remainder (- val 1) side-size)])\n      (l1-distance current-posn (posn target-row target-col)))))\n\n;; compute the l1 distance between this state and the goal-state\n(define (state-l1-distance-to-goal st)\n  (define m (state-matrix st))\n  (for*/fold\n    ([sum 0])\n    ([i (in-range side-size)]\n     [j (in-range side-size)])\n    (let ([val (matrix-ref m i j)])\n      (if (not (= val 0))\n          (+ sum (element-cost val (posn i j)))\n        sum))))\n\n;; the heuristic used is the l1 distance to the goal-state + the number of\n;; linear conflicts found\n(define (state-heuristics st)\n  (+ (state-l1-distance-to-goal st)\n     (linear-conflicts st goal-state)))\n\n;; given a list, return the number of values out of order (used for computing\n;; linear conflicts).\n(define (out-of-order-values lst)\n  (define (iter val-lst sum)\n    (if (empty? val-lst)\n        sum\n      (let* ([val (car val-lst)]\n             [rst (cdr val-lst)]\n             [following-smaller-values\n               (filter (lambda (val2) (> val2 val))\n                       rst)])\n        (iter rst (+ sum (length following-smaller-values))))))\n  (* 2 (iter lst 0)))\n\n;; Number of conflicts in the given row. A conflict happens, when two elements\n;; are already in the correct row, but in the wrong order.\n;; For each conflicted pair add 2 to the value, but a maximum of 6.\n(define (row-conflicts row st0 st1)\n  (define m0 (state-matrix st0))\n  (define m1 (state-matrix st1))\n  \n  (define values-in-correct-row\n    (for/fold\n      ([lst '()])\n      ([col0 (in-range side-size)])\n      (let* ([val0 (matrix-ref m0 row col0)]\n             [in-goal-row?\n               (for/first ([col1 (in-range side-size)]\n                           #:when (= val0 (matrix-ref m1 row col1)))\n                          #t)])\n        (if in-goal-row? (cons val0 lst) lst))))\n  \n  (min 6 (out-of-order-values\n           ; 0 doesn't lead to a linear conflict\n           (filter positive? values-in-correct-row))))\n\n;; Number of conflicts in the given row. A conflict happens, when two elements\n;; are already in the correct column but in the wrong order.\n;; For each conflicted pair add 2 to the value, but a maximum of 6, so that\n;; the heuristic doesn't overestimate the actual costs.\n(define (col-conflicts col st0 st1)\n  (define m0 (state-matrix st0))\n  (define m1 (state-matrix st1))\n  \n  (define values-in-correct-col\n    (for/fold\n      ([lst '()])\n      ([row0 (in-range side-size)])\n      (let* ([val0 (matrix-ref m0 row0 col)]\n             [in-goal-col?\n               (for/first ([row1 (in-range side-size)]\n                           #:when (= val0 (matrix-ref m1 row1 col)))\n                          #t)])\n        (if in-goal-col? (cons val0 lst) lst))))\n  (min 6 (out-of-order-values\n           ; 0 doesn't lead to a linear conflict\n           (filter positive? values-in-correct-col))))\n\n(define (all-row-conflicts st0 st1)\n  (for/fold ([sum 0])\n            ([row (in-range side-size)])\n            (+ (row-conflicts row st0 st1) sum)))\n\n(define (all-col-conflicts st0 st1)\n  (for/fold ([sum 0])\n            ([col (in-range side-size)])\n            (+ (col-conflicts col st0 st1) sum)))\n\n(define (linear-conflicts st0 st1)\n  (+ (all-row-conflicts st0 st1) (all-col-conflicts st0 st1)))\n\n;; Return a list of pairs containing the possible next node and the movement\n;; direction needed.\n(define (next-state-dir-pairs current-node)\n  (define st (node-state current-node))\n  (define empty-slot (state-empty-slot st))\n  (define valid-movements\n    (filter (lambda (dir) (movement-valid? dir empty-slot))\n            directions))\n  (map (lambda (dir)\n         (cons (move st dir) dir))\n       valid-movements))\n\n;; Helper function to pretty-print a state\n(define (display-state st)\n  (define m (state-matrix st))\n  (begin\n    (for ([i (in-range 0 side-size 1)])\n         (newline)\n         (for ([j (in-range 0 side-size 1)])\n              (printf \"~a\\t\" (matrix-ref m i j))))\n    (newline)))\n\n\n(define (A* initial-st)\n  (define (compare-nodes n0 n1)\n    (<= (node-f-value n0) (node-f-value n1)))\n  (define open-lst (make-heap compare-nodes))\n  (define initial-st-cost (state-heuristics initial-st))\n  (heap-add! open-lst (node initial-st #f 0 (state-heuristics initial-st)))\n  (define closed-set (mutable-set))\n  \n  (define (pick-next-node!)\n    (define next-node (heap-min open-lst))\n    (heap-remove-min! open-lst)\n    next-node)\n  \n  (define (sort-lst lst)\n    (sort lst\n          (lambda (n0 n1)\n            (< (node-f-value n0) (node-f-value n1)))))\n  \n  (define (expand-node n)\n    \n    (define n-cost (node-cost n))\n    \n    (define (iter lst)\n      (if (empty? lst)\n          '()\n        (let* ([succ (car lst)]\n               [succ-st (car succ)]\n               [succ-dir (cdr succ)]\n               [succ-cost (+ 1 n-cost)])\n          (if (set-member? closed-set succ-st)\n              (iter (cdr lst))\n            \n            (begin    (heap-add! open-lst\n                                 (node succ-st\n                                       n\n                                       succ-cost\n                                       (+ (state-heuristics succ-st)\n                                          succ-cost)))\n                   (iter (cdr lst)))))))\n    \n    (let ([successors (next-state-dir-pairs n)])\n      (iter successors)))\n  \n  (define counter 0)\n  (define (loop)\n    (define current-node (pick-next-node!))\n    (define current-state (node-state current-node))\n    (set! counter (+ counter 1))\n    (if (= (remainder counter 100000) 0)\n        (printf \"~a ~a ~a\\n\" counter\n                (heap-count open-lst)\n                (node-cost current-node))\n      (void))\n    \n    (cond [(target-state? current-state)\n           (let ([path (reconstruct-movements current-node)])\n             (cons path (length path)))]\n          [else\n            (begin (set-add! closed-set (node-state current-node))\n                   (expand-node current-node)\n                   (if (= (heap-count open-lst) 0)\n                       #f\n                     (loop)))]))\n  (loop))\n\n(module+ main\n         (print-path (A* initial-state)))\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_83.txt",
        "content": "# 20210623 Raku programming solution vCSMt9hkak0\n\nconstant \\Nr = <3 0 0 0 0 1 1 1 1 2 2 2 2 3 3 3>;\nconstant \\Nc = <3 0 1 2 3 0 1 2 3 0 1 2 3 0 1 2>;\n\nmy ($n,$m) = 0,0\u00a0;\nmy @N0 is default(0);\nmy @N3 is default(0);\nmy @N4 is default(0);\nmy @N2 is default(0);\n\nsub fY() {\n   if @N2[$n] == 0x123456789abcdef0 {\n      say \"Solution found in \", $n, \" moves: \", [~] @N3[1..$n] and exit();\n   }\n   return @N4[$n] \u2264 $m\u00a0?? fN()\u00a0!! False\u00a0;\n}\n\nsub fN() {\n   sub common { ++$n; return True if fY(); --$n }\n   if (@N3[$n] ne 'u' && @N0[$n] div 4 < 3) { fI() and common }\n   if (@N3[$n] ne 'd' && @N0[$n] div 4 > 0) { fG() and common }\n   if (@N3[$n] ne 'l' && @N0[$n] \u00a0%  4 < 3) { fE() and common }\n   if (@N3[$n] ne 'r' && @N0[$n] \u00a0%  4 > 0) { fL() and common }\n   return False;\n}\n\nsub fI() {\n   my \\g = (11-@N0[$n])*4;\n   my \\a = @N2[$n] +& (15 +< g);\n   @N0[$n+1]=@N0[$n]+4;\n   @N2[$n+1]=@N2[$n]-a+(a+<16);\n   @N3[$n+1]='d';\n   @N4[$n+1]=@N4[$n]+(Nr[a+>g] \u2264 @N0[$n] div 4\u00a0?? 0\u00a0!! 1);\n}\n\nsub fG() {\n   my \\g = (19-@N0[$n])*4;\n   my \\a = @N2[$n] +& (15 +< g);\n   @N0[$n+1]=@N0[$n]-4;\n   @N2[$n+1]=@N2[$n]-a+(a+>16);\n   @N3[$n+1]='u';\n   @N4[$n+1]=@N4[$n]+(Nr[a+>g] \u2265 @N0[$n] div 4\u00a0?? 0\u00a0!! 1);\n}\n\nsub fE() {\n   my \\g = (14-@N0[$n])*4;\n   my \\a = @N2[$n] +& (15 +< g);\n   @N0[$n+1]=@N0[$n]+1;\n   @N2[$n+1]=@N2[$n]-a+(a+<4);\n   @N3[$n+1]='r';\n   @N4[$n+1]=@N4[$n]+(Nc[a+>g] \u2264 @N0[$n]%4\u00a0?? 0\u00a0!! 1);\n}\n\nsub fL(){\n   my \\g = (16-@N0[$n])*4;\n   my \\a = @N2[$n] +& (15 +< g);\n   @N0[$n+1]=@N0[$n]-1;\n   @N2[$n+1]=@N2[$n]-a+(a+>4);\n   @N3[$n+1]='l';\n   @N4[$n+1]=@N4[$n]+(Nc[a+>g] \u2265 @N0[$n]%4\u00a0?? 0\u00a0!! 1);\n}\n\nsub fifteenSolver(\\n, \\g){@N0[0]=n; @N2[0]=g}\n\n\nfifteenSolver(8,0xfe169b4c0a73d852);\nloop { fY() or ++$m }\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_84.txt",
        "content": "Solution found in 52 moves: rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_85.txt",
        "content": "const NR: [i32; 16] = [3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3];\nconst NC: [i32; 16] = [3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2];\n\nconst I: u8 = 1;\nconst G: u8 = 8;\nconst E: u8 = 2;\nconst L: u8 = 4;\n\nstruct FifteenSolver {\n    n: usize,\n    limit: usize,\n    n0: [i32; 85],\n    n3: [u8; 85],\n    n4: [usize; 85],\n    n2: [u64; 85],\n}\n\nimpl FifteenSolver {\n    fn f_y(&mut self) -> bool {\n        if self.n2[self.n] == 0x123456789abcdef0 {\n            return true;\n        }\n        if self.n4[self.n] <= self.limit {\n            return self.f_n();\n        }\n        false\n    }\n\n    fn f_z(&mut self, w: u8) -> bool {\n        if w & I != 0 {\n            self.f_i();\n            if self.f_y() {\n                return true;\n            }\n            self.n -= 1;\n        }\n        if w & G != 0 {\n            self.f_g();\n            if self.f_y() {\n                return true;\n            }\n            self.n -= 1;\n        }\n        if w & E != 0 {\n            self.f_e();\n            if self.f_y() {\n                return true;\n            }\n            self.n -= 1;\n        }\n        if w & L != 0 {\n            self.f_l();\n            if self.f_y() {\n                return true;\n            }\n            self.n -= 1;\n        }\n        false\n    }\n\n    fn f_n(&mut self) -> bool {\n        self.f_z(match self.n0[self.n] {\n            0 => match self.n3[self.n] {\n                b'l' => I,\n                b'u' => E,\n                _ => I + E,\n            },\n            3 => match self.n3[self.n] {\n                b'r' => I,\n                b'u' => L,\n                _ => I + L,\n            },\n            1 | 2 => match self.n3[self.n] {\n                b'l' => I + L,\n                b'r' => I + E,\n                b'u' => E + L,\n                _ => L + E + I,\n            },\n            12 => match self.n3[self.n] {\n                b'l' => G,\n                b'd' => E,\n                _ => E + G,\n            },\n            15 => match self.n3[self.n] {\n                b'r' => G,\n                b'd' => L,\n                _ => G + L,\n            },\n            13 | 14 => match self.n3[self.n] {\n                b'l' => G + L,\n                b'r' => E + G,\n                b'd' => E + L,\n                _ => G + E + L,\n            },\n            4 | 8 => match self.n3[self.n] {\n                b'l' => I + G,\n                b'u' => G + E,\n                b'd' => I + E,\n                _ => I + G + E,\n            },\n            7 | 11 => match self.n3[self.n] {\n                b'd' => I + L,\n                b'u' => G + L,\n                b'r' => I + G,\n                _ => I + G + L,\n            },\n            _ => match self.n3[self.n] {\n                b'd' => I + E + L,\n                b'l' => I + G + L,\n                b'r' => I + G + E,\n                b'u' => G + E + L,\n                _ => I + G + E + L,\n            },\n        })\n    }\n\n    fn f_i(&mut self) {\n        let g = (11 - self.n0[self.n]) * 4;\n        let a = self.n2[self.n] & (15u64 << g);\n        self.n0[self.n + 1] = self.n0[self.n] + 4;\n        self.n2[self.n + 1] = self.n2[self.n] - a + (a << 16);\n        self.n3[self.n + 1] = b'd';\n        self.n4[self.n + 1] = self.n4[self.n];\n        let cond = NR[(a >> g) as usize] <= self.n0[self.n] / 4;\n        if !cond {\n            self.n4[self.n + 1] += 1;;\n        }\n        self.n += 1;\n    }\n\n    fn f_g(&mut self) {\n        let g = (19 - self.n0[self.n]) * 4;\n        let a = self.n2[self.n] & (15u64 << g);\n        self.n0[self.n + 1] = self.n0[self.n] - 4;\n        self.n2[self.n + 1] = self.n2[self.n] - a + (a >> 16);\n        self.n3[self.n + 1] = b'u';\n        self.n4[self.n + 1] = self.n4[self.n];\n        let cond = NR[(a >> g) as usize] >= self.n0[self.n] / 4;\n        if !cond {\n            self.n4[self.n + 1] += 1;\n        }\n        self.n += 1;\n    }\n\n    fn f_e(&mut self) {\n        let g = (14 - self.n0[self.n]) * 4;\n        let a = self.n2[self.n] & (15u64 << g);\n        self.n0[self.n + 1] = self.n0[self.n] + 1;\n        self.n2[self.n + 1] = self.n2[self.n] - a + (a << 4);\n        self.n3[self.n + 1] = b'r';\n        self.n4[self.n + 1] = self.n4[self.n];\n        let cond = NC[(a >> g) as usize] <= self.n0[self.n] % 4;\n        if !cond {\n            self.n4[self.n + 1] += 1;\n        }\n        self.n += 1;\n    }\n\n    fn f_l(&mut self) {\n        let g = (16 - self.n0[self.n]) * 4;\n        let a = self.n2[self.n] & (15u64 << g);\n        self.n0[self.n + 1] = self.n0[self.n] - 1;\n        self.n2[self.n + 1] = self.n2[self.n] - a + (a >> 4);\n        self.n3[self.n + 1] = b'l';\n        self.n4[self.n + 1] = self.n4[self.n];\n        let cond = NC[(a >> g) as usize] >= self.n0[self.n] % 4;\n        if !cond {\n            self.n4[self.n + 1] += 1;\n        }\n        self.n += 1;\n    }\n\n    fn new(n: i32, g: u64) -> Self {\n        let mut solver = FifteenSolver {\n            n: 0,\n            limit: 0,\n            n0: [0; 85],\n            n3: [0; 85],\n            n4: [0; 85],\n            n2: [0; 85],\n        };\n        solver.n0[0] = n;\n        solver.n2[0] = g;\n        solver\n    }\n\n    fn solve(&mut self) {\n        while !self.f_n() {\n            self.n = 0;\n            self.limit += 1;\n        }\n        println!(\n            \"Solution found in {} moves: {}\",\n            self.n,\n            std::str::from_utf8(&self.n3[1..=self.n]).unwrap()\n        );\n    }\n}\n\nfn main() {\n    FifteenSolver::new(8, 0xfe169b4c0a73d852).solve();\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_86.txt",
        "content": "Solution found in 52 moves: rrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_87.txt",
        "content": "use keyed_priority_queue::KeyedPriorityQueue;\nuse std::cmp::{Ord, Ordering, PartialOrd, Reverse};\n\nstatic CORRECT_ORDER: [u8; 16] = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 0];\nstatic ROW: [i32; 16] = [0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3];\nstatic COLUMN: [i32; 16] = [0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3];\n\n#[derive(Debug, Clone)]\nstruct State {\n    est_tot_moves: u8,\n    moves: String,\n    est_moves_rem: u8,\n}\n\nimpl PartialOrd for State {\n    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {\n        Some(self.est_tot_moves.cmp(&other.est_tot_moves))\n    }\n}\n\nimpl Eq for State {}\n\nimpl PartialEq for State {\n    fn eq(&self, other: &Self) -> bool {\n        self.est_tot_moves.cmp(&other.est_tot_moves) == Ordering::Equal\n    }\n}\n\nimpl Ord for State {\n    fn cmp(&self, other: &Self) -> Ordering {\n        self.est_tot_moves\n            .partial_cmp(&other.est_tot_moves)\n            .unwrap()\n    }\n}\n\nimpl State {\n    fn init(order: &[u8; 16]) -> State {\n        State {\n            est_tot_moves: State::estimate_moves(&order),\n            moves: String::from(\"\"),\n            est_moves_rem: 0,\n        }\n    }\n\n    fn find_index(order: &[u8; 16], tile: &u8) -> usize {\n        order.iter().position(|&x| x == *tile).unwrap()\n    }\n\n    fn estimate_moves(current: &[u8; 16]) -> u8 {\n        let mut h = 0;\n        for tile in current.iter() {\n            let current_index = State::find_index(current, &tile);\n            let correct_index = State::find_index(&CORRECT_ORDER, &tile);\n            h += ((COLUMN[current_index] - COLUMN[correct_index]).abs()\n                + (ROW[current_index] - ROW[correct_index]).abs()) as u8;\n        }\n        h\n    }\n\n    fn make_move(\n        &self,\n        order: &[u8; 16],\n        dir: fn(usize, [u8; 16]) -> ([u8; 16], String),\n    ) -> ([u8; 16], State) {\n        let est_moves_rem = State::estimate_moves(order);\n        let (new_order, from) = dir(State::find_index(order, &0), *order);\n        let moves = format!(\"{}{}\", self.moves, from);\n        let new_state = State {\n            est_tot_moves: moves.len() as u8 + est_moves_rem,\n            moves,\n            est_moves_rem,\n        };\n        return (new_order, new_state);\n    }\n\n    fn left(index: usize, mut order: [u8; 16]) -> ([u8; 16], String) {\n        order.swap(index, index - 1);\n        return (order, String::from(\"l\"));\n    }\n\n    fn right(index: usize, mut order: [u8; 16]) -> ([u8; 16], String) {\n        order.swap(index, index + 1);\n        return (order, String::from(\"r\"));\n    }\n\n    fn up(index: usize, mut order: [u8; 16]) -> ([u8; 16], String) {\n        order.swap(index, index - 4);\n        return (order, String::from(\"u\"));\n    }\n\n    fn down(index: usize, mut order: [u8; 16]) -> ([u8; 16], String) {\n        order.swap(index, index + 4);\n        return (order, String::from(\"d\"));\n    }\n\n    fn children(&self, order: &[u8; 16]) -> Vec<([u8; 16], State)> {\n        let index = State::find_index(order, &0);\n        let mut new_states: Vec<([u8; 16], State)> = Vec::new();\n        if COLUMN[index] > 0 {\n            new_states.push(self.make_move(order, State::left))\n        }\n        if COLUMN[index] < 3 {\n            new_states.push(self.make_move(order, State::right))\n        }\n        if ROW[index] > 0 {\n            new_states.push(self.make_move(order, State::up))\n        }\n        if ROW[index] < 3 {\n            new_states.push(self.make_move(order, State::down))\n        }\n        new_states\n    }\n}\n\nfn main() {\n    let mut open_states = KeyedPriorityQueue::<[u8; 16], Reverse<State>>::new();\n    let start_order = [15, 14, 1, 6, 9, 11, 4, 12, 0, 10, 7, 3, 13, 8, 5, 2];\n    // let start_order = [0, 1, 2, 3, 5, 6, 7, 4, 9, 10, 11, 8, 13, 14, 15, 12];\n    open_states.push(start_order, Reverse(State::init(&start_order)));\n    let mut closed_states = KeyedPriorityQueue::<[u8; 16], Reverse<State>>::new();\n\n    'outer: while let Some((parent_order, Reverse(parent_state))) = open_states.pop() {\n        for (child_order, child_state) in parent_state.children(&parent_order) {\n            match (\n                open_states.get_priority(&child_order).as_ref(),\n                closed_states.get_priority(&child_order).as_ref(),\n            ) {\n                (None, None) => {\n                    if child_order == CORRECT_ORDER {\n                        println!(\"There are {} entries in the open list.\", open_states.len());\n                        println!(\n                            \"There are {} entries in the closed list.\",\n                            closed_states.len()\n                        );\n                        println!(\n                            \"Reaching the final board took {} moves.\",\n                            child_state.moves.len()\n                        );\n                        println!(\"The moves used were {}.\", child_state.moves);\n                        println!(\n                            \"The final order is:\\n{:?}\\n{:?}\\n{:?}\\n{:?}.\",\n                            &child_order[0..4],\n                            &child_order[4..8],\n                            &child_order[8..12],\n                            &child_order[12..16]\n                        );\n                        break 'outer;\n                    }\n                    open_states.push(child_order, Reverse(child_state.clone()));\n                }\n                (Some(&Reverse(open_state)), None)\n                    if open_state.moves.len() > child_state.moves.len() =>\n                {\n                    open_states.set_priority(&child_order, Reverse(child_state.clone()));\n                }\n                // (None, Some(&Reverse(closed_state))) if closed_state.moves.len() > child_state.moves.len() => {\n                //     closed_states.remove_item(&child_order);\n                //     open_states.push(child_order, Reverse(child_state.clone()));\n                // },\n                _ => {}\n            };\n        }\n        closed_states.push(parent_order, Reverse(parent_state));\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_88.txt",
        "content": "There are 22525454 entries in the open list.\nThere are 24568220 entries in the closed list.\nReaching the final board took 52 moves.\nThe moves used were rrruldluuldrurdddluulurrrdlddruldluurddlulurruldrrdd.\nThe final order is:\n[1, 2, 3, 4]\n[5, 6, 7, 8]\n[9, 10, 11, 12]\n[13, 14, 15, 0].",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_89.txt",
        "content": "import scala.collection.mutable\ncase class Board(table: Array[Int], r: Int, c: Int, parent: List[String] = List()) {\n  def cloneSwap(r: Int, c: Int, rr: Int, cc: Int) = {\n    val cTable = table.clone\n    // Fancy way to access table(r)(c) in linear array\n    // Equivalent with cTable(r*4 + c) \n    cTable(r << 2 | c) = table(rr << 2 | cc)\n    cTable(rr << 2 | cc) = table(r << 2 | c)\n    cTable\n  }\n  def up() =\n    if (r > 0) { Some(Board(cloneSwap(r, c, r - 1, c), r - 1, c, \"u\" :: parent))\n    } else None\n  def down() =\n    if (r < 3) { Some(Board(cloneSwap(r, c, r + 1, c), r + 1, c, \"d\" :: parent))\n    } else None\n  def left() =\n    if (c > 0) { Some(Board(cloneSwap(r, c, r, c - 1), r, c - 1, \"l\" :: parent))\n    } else None\n  def right() =\n    if (c < 3) { Some(Board(cloneSwap(r, c, r, c + 1), r, c + 1, \"r\" :: parent))\n    } else None\n  def format: String = {\n    table.sliding(4, 4).toList.map(_.map(i \u21d2 f\"$i%4d\").mkString).mkString(\"\\n\")\n  }\n  // Manhattan distance\n  def heuristic() = {\n    val posF = Board.finalBoard.positionMap\n    val posT = positionMap\n    var res = 0;\n    for (i \u2190 0 to 15) {\n      val (x, y) = posF(i)\n      val (xx, yy) = posT(i)\n      res += (Math.abs(x - xx) + Math.abs(y - yy))\n    }\n    res\n  }\n  def key = table.mkString(\",\")\n  def travelled() = parent.length\n  // Find children/neighbours, flatten eliminates the empty boundaries\n  def children: List[Board] = List(this.up(), this.down(), this.right(), this.left()).flatten\n  // Map number to positions\n  lazy val positionMap: Map[Int, (Int, Int)] = {\n    val res = mutable.Map[Int, (Int, Int)]()\n    for (x \u2190 0 to 3; y \u2190 0 to 3) {\n      res(table(x << 2 | y)) = (x, y)\n    }\n    res.toMap\n  }\n}\n\nimport Board._\nobject Solver extends App {\n  def solve(initBoard: Board, wTravel:Int, wHeuristic: Int ) {\n    // Setup weights for the heuristic, more weight to heuristic faster but longer solution.\n    def aStar(b:  Board) = wHeuristic * b.heuristic() + wTravel * b.travelled()\n    implicit val ob = new Ordering[Board] {\n      override def compare(x: Board, y: Board) = {\n        aStar(y) - aStar(x)\n      }\n    }\n    val start = System.currentTimeMillis()\n    var found = false\n    var head = initBoard\n    val pq: mutable.PriorityQueue[Board] = new mutable.PriorityQueue()\n    pq.enqueue(head)\n    val visited = mutable.HashSet[String]()\n    var explore = 0\n    while (pq.nonEmpty && !found) {\n      head = pq.dequeue()\n      visited.add(head.key)\n      if (!head.key.equals(finalBoard.key)) {\n        val newChildren = head.children.filter(child \u21d2 !visited.contains(child.key))\n        visited ++= (newChildren.map(_.key))\n        pq.enqueue(newChildren: _*)\n        explore += 1\n      } else found = true\n      if (explore % 5000 == 0)\n        println(s\"# $explore: A* ${aStar(head)}  g:${head.travelled()} h:${head.heuristic()}\")\n    }\n    if (found) {\n      println(s\"Exploring $explore states, solution with length ${head.parent.length}.\")\n      println(s\"Weighted heuristic used $wHeuristic * heuristic + $wTravel * travel.\")\n      println(initBoard.format)\n      println(head.parent.mkString.reverse)\n    }\n    println(\"Total time: \" + (System.currentTimeMillis() - start) / 1000.0 + \" seconds\")\n  }\n  solve(startEasy, 4, 5)\n  solve(startHard, 1, 2 )\n}\n\nobject Board {\n  val finalBoard = Board(Array(Array(1, 2, 3, 4), Array(5, 6, 7, 8), Array(9, 10, 11, 12), Array(13, 14, 15, 0)).flatten, 3, 3)\n  val startEasy = Board(Array(Array(15, 14, 1, 6), Array(9, 11, 4, 12), Array(0, 10, 7, 3), Array(13, 8, 5, 2)).flatten, 2, 0)\n  val startHard = Board(Array(Array(0, 12, 9, 13), Array(15, 11, 10, 14), Array(3, 7, 2, 5), Array(4, 8, 6, 1)).flatten, 0, 0)\n}\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_9.txt",
        "content": "Solved in  52 moves: RRRULDDLUUULDRURDDDRULLULURRRDDLDLUURDDLULURRULDRDRD",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_90.txt",
        "content": "Exploring 698181 states, found solution with length 52.\nWeighted heuristic used 5 * heuristic + 4 * travel.\n  15  14   1   6\n   9  11   4  12\n   0  10   7   3\n  13   8   5   2\nrrruldluuldrurdddluulurrrdlddruldluurddlulurruldrrdd\nTotal time: 48.884 seconds",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_91.txt",
        "content": "Exploring 6117 states, found solution with length 106.\nWeighted heuristic used 2 * heuristic + 1 * travel.\n   0  12   9  13\n  15  11  10  14\n   3   7   2   5\n   4   8   6   1\nddrrurdlulddruldrruluuldlddrruulldrrdruuuldlldrdruruuldldrrululdlurdddluurdrdluldrruluurrddldruulddrulurdd\nTotal time: 0.328 seconds\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_92.txt",
        "content": "Exploring 728832 states, solution with length 98.\nWeighted heuristic used 9 * heuristic + 5 * travel.\n   0  12   9  13\n  15  11  10  14\n   3   7   2   5\n   4   8   6   1\nddrruldrdlururddluuuldlddrruulldrrruuldlldrrruuldldrrululdlurddlurdrrdllluruurrddldllurdrrulldrurd\nTotal time: 117.666 seconds\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_93.txt",
        "content": "# Solve a 15 puzzle https://rosettacode.org/wiki/15_puzzle_solver#Uiua\n# Experimental!\nT \u2190 \u21af4_4 \u21bb1\u21e116\n# Return shuffled copy of the input.\nShuffle \u2190 \u228f\u22b8(\u234f[\u2365\u2682]\u29fb)\n# Positions of the numbers (not 0)\nPos \u2190 \u2261(\u22a2\u229a\u2315)\u21981\u21e116\u00a4\n\n# Applying a very gentle weighting to certain cells massively\n# speeds up the algorithm\nWeights \u2190 [[2 1 1 2] [2 1 1 2] [2 1 1 2] [2 1 1 1]]\nDistance \u2190 /+\u00d7\u22a1:Weights:\u2261/+\u2335-\u2299.\u2229Pos\nHeuristic \u2190 Distance T\n\n# Four possible neighbours\nNfour \u2190 [[1 0] [\u00af1 0] [0 1] [0 \u00af1]]\n# Actual neighbours at a point.\nValidN \u2190 \u2261(\u2282)\u2299\u00a4:\u27dc(\u25bd\u22b8(\u22650\u2261/\u21a7)\u25bd\u22b8(<4\u2261/\u21a5)+Nfour)\u00a4\n# Precalculate them.\nValidNs \u2190 \u229e(\u25a1 ValidN\u229f)\u21e14 \u21e14\n\n# Get the valid (from to) moves from this cell.\nMoves \u2190 \u00b0\u25a1\u22a1:ValidNs\u22a2\u229a\u23150\n# Swap the values at the indexes [0 1] [a b 2 3] -> [b a 2 3]\nSwap \u2190 \u235c(\u22a1|\u2218\u25cc) \u2283(\u21cc\u2299\u2218|\u22a1)\n# List the possible next positions for a position\nNext \u2190 \u2299\u25cc\u2261(Swap \u2299.)\u2299\u00a4\u22b8Moves\nSolve \u2190 (\n  &p\"Running...\"&p.\n  \u235cnowastar(Next|Heuristic|\u224dT)\n  &p$\"_ seconds\"\n  # Track the movement of the 0 between adjacent steps.\n  \u2261(/-)\u25eb2\u25c7\u2261(\u22a2\u229a\u23150)\u21cc\u22a2\n  # Map each to a direction string and join.\n  /\u2282\u21cc\u2261\u2363(\"d\" \u00b0\u00af1_0|\"u\" \u00b01_0|\"r\" \u00b00_\u00af1|\"l\" \u00b00_1|\u2218)\n)\n\n# Uncomment one of the following lines to try random grids\n# \u2365(Swap\u22a1\u22b8(\u230a\u00d7\u2682\u29fb)\u22b8Moves)90 T\n# [[2 14 6 4] [5 1 3 8] [9 10 7 11] [13 0 15 12]] # Simple 40 shuffles\n# [[5 1 2 3] [6 10 7 4] [13 9 11 8] [14 0 15 12]] # Simple 12 steps\n# [[9 1 2 4] [13 6 5 7] [3 11 14 15] [10 0 8 12]] # 34 steps\n# [[10 3 1 4] [13 5 8 7] [9 6 0 11] [14 15 12 2]] # 38 steps (a few seconds)\n[[15 14 1 6] [9 11 4 12] [0 10 7 3] [13 8 5 2]] # Main Challenge\n# [[0 12 9 13] [15 11 10 14] [3 7 2 5] [4 8 6 1]] # Extra Credit\n\nSolve",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_94.txt",
        "content": "\u256d\u2500            \n\u2577 15 14 1  6  \n   9 11 4 12  \n   0 10 7  3  \n  13  8 5  2  \n             \u256f\nRunning...\n7.321068048477173 seconds\n52\n\"rrruldluuldrurdddluulurrrdlddruldluurddlulurruldrrdd\"\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_95.txt",
        "content": "import \"./long\" for ULong\n\nvar Nr = [3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3]\nvar Nc = [3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2]\nvar n  = 0\nvar n1 = 0\nvar N0 = List.filled(85, 0)\nvar N2 = List.filled(85, 0)\nvar N3 = List.filled(85, 0)\nvar N4 = List.filled(85, 0)\nvar i  = 1\nvar g  = 8\nvar e  = 2\nvar l  = 4\n\nvar fN  // forward declaration\n\nvar xx = ULong.fromBaseString(\"123456789abcdef0\", 16)\nvar fifteen = ULong.new(15)\n\nvar fY = Fn.new {\n    if (N2[n] == xx ) return true\n    if (N4[n] <= n1) return fN.call()\n    return false\n}\n\nvar fI = Fn.new {\n    var g = (11 - N0[n]) * 4\n    var a = N2[n] & (fifteen << g)\n    N0[n+1] = N0[n] + 4\n    N2[n+1] = N2[n] - a + (a << 16)\n    N3[n+1] = \"d\"\n    N4[n+1] = N4[n]\n    var cond = Nr[(a >> g).toSmall] <= (N0[n] >> 2)\n    if (!cond) N4[n+1] = N4[n+1] + 1\n    n = n + 1\n}\n\nvar fG = Fn.new {\n    var g = (19 - N0[n]) * 4\n    var a = N2[n] & (fifteen << g)\n    N0[n+1] = N0[n] - 4\n    N2[n+1] = N2[n] - a + (a >> 16)\n    N3[n+1] = \"u\"\n    N4[n+1] = N4[n]\n    var cond = Nr[(a >> g).toSmall] >= (N0[n] >> 2)\n    if (!cond) N4[n+1] = N4[n+1] + 1\n    n = n + 1\n}\n\nvar fE = Fn.new {\n    var g = (14 - N0[n]) * 4\n    var a = N2[n] & (fifteen << g)\n    N0[n+1] = N0[n] + 1\n    N2[n+1] = N2[n] - a + (a << 4)\n    N3[n+1] = \"r\"\n    N4[n+1] = N4[n]\n    var cond = Nc[(a >> g).toSmall] <= N0[n] % 4\n    if (!cond) N4[n+1] = N4[n+1] + 1\n    n = n + 1\n}\n\nvar fL = Fn.new {\n    var g = (16 - N0[n]) * 4\n    var a = N2[n] & (fifteen << g)\n    N0[n+1] = N0[n] - 1\n    N2[n+1] = N2[n] - a + (a >> 4)\n    N3[n+1] = \"l\"\n    N4[n+1] = N4[n]\n    var cond = Nc[(a >> g).toSmall] >= N0[n] % 4\n    if (!cond) N4[n+1] = N4[n+1] + 1\n    n = n + 1\n}\n\nvar fZ = Fn.new { |w|\n    if (w&i > 0) {\n        fI.call()\n        if (fY.call()) return true\n        n = n - 1\n    }\n    if (w&g > 0) {\n        fG.call()\n        if (fY.call()) return true\n        n = n - 1\n    }\n    if (w&e > 0) {\n        fE.call()\n        if (fY.call()) return true\n        n = n - 1\n    }\n    if (w&l > 0) {\n        fL.call()\n        if (fY.call()) return true\n        n = n - 1\n    }\n    return false\n}\n\nfN = Fn.new {\n    var p0 = N0[n]\n    if (p0 == 0) {\n        var p3 = N3[n]\n        if (p3 == \"l\") return fZ.call(i)\n        if (p3 == \"u\") return fZ.call(e)\n        return fZ.call(i + e)\n    } else if (p0 == 3) {\n        var p3 = N3[n]\n        if (p3 == \"r\") return fZ.call(i)\n        if (p3 == \"u\") return fZ.call(l)\n        return fZ.call(i + l)\n    } else if (p0 == 1 || p0 == 2) {\n        var p3 = N3[n]\n        if (p3 == \"l\") return fZ.call(i + l)\n        if (p3 == \"r\") return fZ.call(i + e)\n        if (p3 == \"u\") return fZ.call(e + l)\n        return fZ.call(l + e + i)\n    } else if (p0 == 12) {\n        var p3 = N3[n]\n        if (p3 == \"l\") return fZ.call(g)\n        if (p3 == \"d\") return fZ.call(e)\n        return fZ.call(e + g)\n    } else if (p0 == 15) {\n        var p3 = N3[n]\n        if (p3 == \"r\") return fZ.call(g)\n        if (p3 == \"d\") return fZ.call(l)\n        return fZ.call(g + l)\n    } else if (p0 == 13 || p0 == 14) {\n        var p3 = N3[n]\n        if (p3 == \"l\") return fZ.call(g + l)\n        if (p3 == \"r\") return fZ.call(e + g)\n        if (p3 == \"d\") return fZ.call(e + l)\n        return fZ.call(g + e + l)\n    } else if (p0 == 4 || p0 == 8) {\n        var p3 = N3[n]\n        if (p3 == \"l\") return fZ.call(i + g)\n        if (p3 == \"u\") return fZ.call(g + e)\n        if (p3 == \"d\") return fZ.call(i + e)\n        return fZ.call(i + g + e)\n    } else if (p0 == 7 || p0 == 11) {\n        var p3 = N3[n]\n        if (p3 == \"d\") return fZ.call(i + l)\n        if (p3 == \"u\") return fZ.call(g + l)\n        if (p3 == \"r\") return fZ.call(i + g)\n        return fZ.call(i + g + l)\n    } else {\n        var p3 = N3[n]\n        if (p3 == \"d\") return fZ.call(i + e + l)\n        if (p3 == \"l\") return fZ.call(i + g + l)\n        if (p3 == \"r\") return fZ.call(i + g + e)\n        if (p3 == \"u\") return fZ.call(g + e + l)\n        return fZ.call(i + g + e + l)\n    }\n}\n\nvar fifteenSolver = Fn.new { |n, g|\n    N0[0] = n\n    N2[0] = g\n    N4[0] = 0\n}\n\nvar solve // recursive function\nsolve = Fn.new {\n    if (fN.call()) {\n        System.print(\"Solution found in %(n) moves: \")\n        for (g in 1..n) System.write(N3[g])\n        System.print()\n    } else {\n        n = 0\n        n1 = n1 + 1\n        solve.call()\n    }\n}\n\nfifteenSolver.call(8, ULong.fromBaseString(\"fe169b4c0a73d852\", 16))\nsolve.call()\n",
        "safe": true
    },
    {
        "filename": "15_puzzle_solver_96.txt",
        "content": "Solution found in 52 moves: \nrrrulddluuuldrurdddrullulurrrddldluurddlulurruldrdrd\n",
        "safe": true
    },
    {
        "filename": "2048_1.txt",
        "content": "               [2][2][2][2] \n",
        "safe": true
    },
    {
        "filename": "2048_10.txt",
        "content": "main:(\nINT side = 4;\nINT right = 1, up = 2, left = 3, down = 4;\n[]CHAR direction letters = \"ruld\";\n[]STRING direction descriptions = (\"right\", \"up\", \"left\", \"down\");\n\nMODE BOARD = REF[,]INT;\nMODE CELL = REF INT;\n\nOP = = (BOARD a, BOARD b) BOOL:\n  (FOR i TO side DO FOR j TO side DO IF a[i,j] /= b[i,j] THEN mismatch FI OD OD;\n  TRUE EXIT\n  mismatch: FALSE);\n\nPROC traverse board = (BOARD board, PROC(CELL)VOID callback) VOID:\n  FOR i FROM 1 LWB board TO 1 UPB board DO\n    FOR j FROM 2 LWB board TO 2 UPB board DO\n      callback(board[i,j])\n  OD OD;\n\nPROC count blanks = (BOARD board) INT:\n  (INT count\u00a0:= 0;\n   traverse board(board, (CELL c)VOID: IF c = 0 THEN count +:= 1 FI);\n   count);\n\nPROC nth blank = (BOARD board, INT nth) CELL:\n  (CELL result;\n   INT count\u00a0:= 0;\n   traverse board(board, (CELL c)VOID:\n                           (IF c = 0 THEN count +:= 1 FI;\n                            IF count = nth THEN\n                              result\u00a0:= c; return\n                            FI));\n   return: result);\n\nPROC add new number = (BOARD board) VOID:\n  (INT nblanks = count blanks(board);\n   INT number  \u00a0:= (random >= .9 | 4 | 2);\n   INT position\u00a0:= ENTIER (random * nblanks) + 1;\n\n   nth blank(board, position)\u00a0:= number);\n\nPROC shift = (REF[]INT row, BOOL to the end) VOID:\n  (INT from = (to the end | UPB row | LWB row),\n       to   = (to the end | LWB row | UPB row),\n       dir  = (to the end | -1 | 1);\n   FOR i FROM from + dir BY dir TO to  DO\n     IF row[i] /= 0 THEN\n       INT blank\u00a0:= 0;\n       FOR j FROM i - dir BY -dir TO from WHILE row[j] = 0 DO\n         blank\u00a0:= j\n       OD;\n       IF blank /= 0 THEN\n         row[blank]\u00a0:= row[i];\n         row[i]\u00a0:= 0\n       FI\n     FI\n   OD);\n\nPROC combine = (REF[]INT row, BOOL to the end) VOID:\n  (INT from = (to the end | UPB row | LWB row),\n       to   = (to the end | LWB row | UPB row),\n       dir  = (to the end | -1 | 1);\n   FOR i FROM from BY dir TO to - dir DO\n     IF row[i] /= 0 AND row[i] = row[i+dir] THEN\n       row[i] *:= 2;\n       row[i+dir]\u00a0:= 0\n     FI\n   OD);\n\nPROC move = (BOARD board, INT direction) VOID:\n  FOR i TO side DO\n    CASE direction IN\n      # right # (shift(board[i,], TRUE);  combine(board[i,], TRUE);  shift(board[i,], TRUE)),\n      # up    # (shift(board[,i], FALSE); combine(board[,i], FALSE); shift(board[,i], FALSE)),\n      # left  # (shift(board[i,], FALSE); combine(board[i,], FALSE); shift(board[i,], FALSE)),\n      # down  # (shift(board[,i], TRUE);  combine(board[,i], TRUE);  shift(board[,i], TRUE))\n    ESAC\n  OD;\n\nPROC print board = (BOARD board)VOID:\n  (FOR i FROM 1 LWB board TO 1 UPB board DO\n     print(\"+\");\n     FOR j FROM 2 LWB board TO 2 UPB board DO print(\"------+\") OD;\n     print((new line, \"|\"));\n     FOR j FROM 2 LWB board TO 2 UPB board DO\n       print(((board[i,j] = 0 | \"     \" | whole(board[i,j],-5)), \" |\"))\n     OD;\n     print(new line)\n   OD;\n   print(\"+\"); FOR j FROM 2 LWB board TO 2 UPB board DO print(\"------+\") OD;\n   print(new line)\n  );\n\nPROC score = (BOARD board) INT:\n  (INT result\u00a0:= 0;\n   traverse board(board, (CELL c)VOID: result +:= c);\n   result);\n\nPROC join = ([]STRING strings, STRING joiner) STRING:\n  IF UPB strings > 0 THEN\n    STRING result\u00a0:= strings[1];\n    FOR i FROM 2 TO UPB strings DO result +:= joiner +:= strings[i] OD;\n    result\n  ELSE\n    \"\"\n  FI;\n\nBOARD board = LOC [side,side]INT;\nBOARD previous = LOC [side,side]INT;\n\ntraverse board(board, (CELL c)VOID: c\u00a0:= 0);\n\n# start with two numbers #\nTO 2 DO add new number(board) OD;\n\n# play! #\nSTRING prompt\u00a0:= \"enter one of [\" + direction letters + \"] (for \" + join(direction descriptions, \"/\") + \"): \";\nDO\n  CHAR key;\n  INT dir;\n  print board(board);\n  print((\"score: \", whole(score(board),0), new line));\n  WHILE\n    print(prompt);\n    read((key, new line));\n    NOT char in string(key, dir, direction letters)\n  DO SKIP OD;\n  previous\u00a0:= board;\n  move(board, dir);\n  IF count blanks(board) = 0 THEN lose FI;\n  traverse board(board, (CELL c)VOID: IF c = 2048 THEN win FI);\n  IF previous = board THEN\n    print((\"try again!\", new line))\n  ELSE\n    add new number(board)\n  FI\nOD;\n\nwin: print board(board); print((\"you win!\", new line)) EXIT\nlose: print((\"you lose!\", new line))\n)",
        "safe": true
    },
    {
        "filename": "2048_100.txt",
        "content": "# Project\u00a0: 2048 Game\n\nload \"stdlib.ring\"\nload \"guilib.ring\"\n\nC_GAMETITLE\t\t= '2048 Game'\nC_WINDOWBACKGROUND \t= \"background-color: gray;\"\nif isMobile()\n\tC_LABELFONTSIZE \t= \"font-size:120px;\"\n\tC_BUTTONFONTSIZE \t= \"font-size:160px;\"\nelse \n\tC_LABELFONTSIZE \t= \"font-size:50px;\"\n\tC_BUTTONFONTSIZE \t= \"font-size:80px;\"\nok\nC_PLAYERSCORESTYLE\t= \"color:white;background-color:rgb(50,50,50);border-radius:17px;\" + C_LABELFONTSIZE\nC_NEWGAMESTYLE\t\t= 'color:white;background-color:rgb(50,50,50);border-radius:17px;' + C_LABELFONTSIZE\nC_EMPTYBUTTONSTYLE \t= 'border-radius:17px;background-color:silver;' + C_BUTTONFONTSIZE\nC_BUTTON2STYLE \t\t= 'border-radius:17px;color:black; background-color: yellow\u00a0;' + C_BUTTONFONTSIZE\nC_BUTTON4STYLE \t\t= 'border-radius:17px;color:black; background-color: violet\u00a0;' + C_BUTTONFONTSIZE\nC_BUTTON8STYLE \t\t= 'border-radius:17px;color:white; background-color: purple\u00a0;' + C_BUTTONFONTSIZE\nC_BUTTON16STYLE \t= 'border-radius:17px;color:white; background-color: blue\u00a0;' + C_BUTTONFONTSIZE\nC_BUTTON32STYLE \t= 'border-radius:17px;color:white; background-color: red\u00a0;' + C_BUTTONFONTSIZE\nC_BUTTON64STYLE \t= 'border-radius:17px;color:black; background-color: lightgray\u00a0;' + C_BUTTONFONTSIZE\nC_BUTTON128STYLE \t= 'border-radius:17px;color:black; background-color: white\u00a0;' + C_BUTTONFONTSIZE\nC_BUTTON256STYLE \t= 'border-radius:17px;color:white; background-color: black\u00a0;' + C_BUTTONFONTSIZE\nC_BUTTON512STYLE \t= 'border-radius:17px;color:white; background-color: Purple\u00a0;' + C_BUTTONFONTSIZE\nC_BUTTON1024STYLE \t= 'border-radius:17px;color:black; background-color: Yellow\u00a0;' + C_BUTTONFONTSIZE\nC_BUTTON2048STYLE \t= 'border-radius:17px;color:white; background-color: Green\u00a0;' + C_BUTTONFONTSIZE\nC_LAYOUTSPACING\t\t= 10\nC_PLAYERSCORE\t\t= 'Player Score\u00a0:  '\n\nsize = 4\nlimit = 2\nnum = 0\nflag = 0\nx1 = 0\nx2 = 0\ny1 = 0\ny2 = 0\nnScore = 0\nbutton = newlist(size,size)\nbuttonsave = newlist(size,size)\nLayoutButtonRow = list(size+2)\nmoveleft = []\nmoveright = []\nmoveup = []\nmovedown = []\nmyfilter2 = null\nmyfilter3 = null\nwinheight = 0\nwinwidth = 0\n\napp = new qApp {\n          StyleFusion()\n          processevents()\n          win = new qWidget() {\n                  setWindowTitle(C_GAMETITLE)\n                  setgeometry(100,100,600,700)\n                  setminimumwidth(300)\n                  setminimumheight(300)\n\t\t  if not isMobile()\n\t                  grabkeyboard()\n\t\t  ok\n                  setstylesheet(C_WINDOWBACKGROUND)\n                  move(490,100) \n                  for n = 1 to size\n                       for m = 1 to size\n                            button[n][m] = new MyButton(win)\n                       next\n                  next\n                  newgame = new qLabel(win)\n                  playerscore = new qLabel(win)\n                  myfilter3 = new qAllEvents(win) {\n                  setMouseButtonPressEvent(\"pPress()\")\n                  setMouseButtonReleaseEvent(\"pRelease()\")}\n                  installeventfilter(myfilter3)\n                  myfilter2 = new qAllEvents(win) {\n                  setkeypressevent(\"keypress()\") }\n                  installeventfilter(myfilter2)\n                  winwidth = win.width()\n                  winheight = win.height()\n                  for n = 1 to size + 2\n\t\t\tLayoutButtonRow[n] = new QHBoxLayout() {\n\t\t\t\tsetSpacing(C_LAYOUTSPACING) \n\t\t\t}\n                  next\n                  for n = 1 to size\n                       for m = 1 to size\n                            button[n][m] { temp = text() }\n                            buttonsave[n][m] = temp\n                            button[n][m] = new MyButton(win) {\n                                                   setalignment(Qt_AlignHCenter | Qt_AlignVCenter)\n                                                   setstylesheet(C_EMPTYBUTTONSTYLE)\n                                                   show()\n                                           }\n                       next\n                  next\n                  for n = 1 to size\n                       for m = 1 to size\n                            LayoutButtonRow[n].AddWidget(button[m][n])\n                            win.show()\n                            temp = buttonsave[n][m]\n                            button[n][m].settext(temp)\n                       next\n  \t\t       LayoutButtonRow[n].setSpacing(C_LAYOUTSPACING)\n                  next\n                  playerscore {\n                                    setGeometry(0,4*floor(winheight/6),winwidth,floor(winheight/6))\n                                    setalignment(Qt_AlignHCenter | Qt_AlignVCenter)\n                                    settext(C_PLAYERSCORE + nScore)\n\t\t\t\t    setStylesheet(C_PLAYERSCORESTYLE)\n                                    show()\n\t\t  }\n                  newgame  {\n                                  setGeometry(0,5*floor(winheight/6),winwidth,floor(winheight/6))\n                                  setalignment(Qt_AlignHCenter | Qt_AlignVCenter)\n                                  setstylesheet(C_NEWGAMESTYLE)\n                                  settext('New Game')\n                                  myfilter4 = new qallevents(newgame)\n                                  myfilter4.setMouseButtonPressEvent(\"pbegin()\")\n                                  installeventfilter(myfilter4)\n                                  show()\n                                  }\n                  LayoutButtonRow[size+1].AddWidget(playerscore)\n                  LayoutButtonRow[size+2].AddWidget(newgame)\n                  LayoutButtonMain = new QVBoxLayout() {\n\t\t\tsetSpacing(C_LAYOUTSPACING)\n\t\t\tfor n = 1 to size+2\n\t\t\t\tAddLayout(LayoutButtonRow[n])\n\t\t\t\twin.show()\n\t\t\tnext\n\t\t  }\n\t\t  win.setLayout(LayoutButtonMain)\n                  win.show()\n                  pbegin()  \n                  show()\n         }\n    exec()\n}\n\nfunc pPress()\n        x1 = myfilter3.getglobalx()\n        y1 = myfilter3.getglobaly()\n\nfunc pRelease()\n        x2 = myfilter3.getglobalx()\n        y2 = myfilter3.getglobaly()\n        difx = x2 - x1\n\tdify = y2 - y1\n\tif fabs(difx) > fabs(dify)\n\t\tif difx < 0\n\t\t\tpleft()\n\t\telse \n\t\t\tpRight()\n\t\tok\n\telse \n\t\tif dify < 0\n\t\t\tpUp()\n\t\telse \n\t\t\tpDown()\n\t\tok\n\tok\n \nfunc keypress() \n        nKey = myfilter2.getkeycode() \n        switch nKey\n                   on 16777234 pleft()\n                   on 16777236 pright()\n                   on 16777235 pup()\n                   on 16777237 pdown()\n        off\n\nfunc pbegin()\n       numbers = [['2','2'],['2','4']]\n       randnew = newlist(2,2)\n       for n = 1 to size\n            for m = 1 to size\n                 button[n][m].setStylesheet(C_EMPTYBUTTONSTYLE)\n                 button[n][m].settext('')\n            next\n        next\n        while true\n                rn1 = random(size - 1) + 1\n                rm1 = random(size - 1) + 1\n                rn2 = random(size - 1) + 1\n                rm2 = random(size - 1) + 1\n                bool = (rn1 = rn2) and (rm1 = rm2)\n                if not bool\n                   exit\n                ok\n        end\n        rand = random(limit - 1) + 1\n        button[rn1][rm1].settext(numbers[rand][1])\n        button[rn2][rm2].settext(numbers[rand][2])\n        nScore = 0\n        playerscore.settext(C_PLAYERSCORE)\n\nfunc pMoveInDirection cFunc \n        num = gameover()\n        if num = size*size\n           flag = 1\n           msgBox('You lost!')\n           pbegin()\n        ok\n        if flag = 0\n           call cFunc()\n           sleep(0.5)\n           newnum()\n        ok\n\nfunc pdown()\n\tpMoveInDirection(:pMoveDown)\n\nfunc pup()\n\tpMoveInDirection(:pMoveUp)\n\nfunc pleft()\n\tpMoveInDirection(:pMoveLeft)\n\nfunc pright()\n\tpMoveInDirection(:pMoveRight)\n\nfunc pmoveleft()\n       for n = 1 to size\n            moveleft = []\n            for m = 1 to size\n                 button[m][n] {temp = text()}\n                 if temp\u00a0!= ''\n                    add(moveleft,temp)\n                 ok\n            next\n            movetilesleft(n,moveleft)\n       next\n\nfunc pmoveright()\n       for n = 1 to size\n            moveright = []\n            for m = size to 1 step -1\n                 button[m][n] {temp = text()}\n                 if temp\u00a0!= ''\n                    add(moveright,temp)\n                 ok\n            next\n            movetilesright(n,moveright)\n        next\n        return\n\nfunc pmoveup()\n       for n = 1 to size\n            moveup = []\n            for m = 1 to size\n                 button[n][m] {temp = text()}\n                 if temp\u00a0!= ''\n                    add(moveup,temp)\n                 ok\n            next\n            movetilesup(n,moveup)\n        next\n        return\n\nfunc pmovedown()\n       for n = 1 to size\n            movedown = []\n            for m = size to 1 step -1\n                 button[n][m] {temp = text()}\n                 if temp\u00a0!= ''\n                    add(movedown,temp)\n                 ok\n            next\n            movetilesdown(n,movedown)\n        next\n        return\n\nfunc movetilesleft(nr,moveleft)\n       for p = 1 to len(moveleft) - 1\n            temp1 = moveleft[p]\n            temp2 = moveleft[p+1]\n            temp = string(number(temp1) + number(temp2))\n            if (temp1 = temp2) and (temp1\u00a0!= '0') and (temp2\u00a0!= '0') and (temp1\u00a0!= '') and (temp2\u00a0!= '')\n               if temp\u00a0!= '0' and temp\u00a0!= ''\n                  nScore = nScore + temp\n                  playerscore.settext(C_PLAYERSCORE + nScore)\n                  flag = 1\n                  moveleft[p] = temp\n                  del(moveleft,p+1)\n               ok\n            ok\n       next\n       for n = 1 to len(moveleft)\n            button[n][nr].settext(moveleft[n])\n       next\n       for n = len(moveleft) + 1 to size \n            if n <= size\n               button[n][nr].setStylesheet(C_EMPTYBUTTONSTYLE)\n               button[n][nr].settext('')\n            ok\n       next\n       return\n\nfunc movetilesright(nr,moveright)\n       flag = 0\n       for p = 2 to len(moveright)\n            temp1 = moveright[p]\n            temp2 = moveright[p-1]\n             if (temp1 = temp2) and (temp1\u00a0!= '0') and (temp2\u00a0!= '0') and (temp1\u00a0!= '') and (temp2\u00a0!= '')\n               temp = string(number(temp1) + number(temp2))\n               if temp\u00a0!= '0' and temp\u00a0!= ''\n                  nScore = nScore + temp\n                  playerscore.settext(C_PLAYERSCORE + nScore)\n                  flag = 1\n                  moveright[p] = temp\n                  del(moveright,p-1)\n               ok\n            ok\n       next\n       for n = 1 to len(moveright)\n            button[size-n+1][nr].settext(moveright[n])\n       next\n       for n = 1 to size - len(moveright)\n            if n <= size\n               button[n][nr].setStylesheet(C_EMPTYBUTTONSTYLE)\n               button[n][nr].settext('')\n            ok\n       next\n\n\nfunc movetilesup(nr,moveup)\n        flag = 0\n        for p = 1 to len(moveup) - 1\n             temp1 = moveup[p] \n             temp2 = moveup[p+1]\n             if (temp1 = temp2) and (temp1\u00a0!= '0') and (temp2\u00a0!= '0') and (temp1\u00a0!= '') and (temp2\u00a0!= '')\n               temp = string(number(temp1) + number(temp2))\n               if temp\u00a0!= '0' and temp\u00a0!= ''\n                  nScore = nScore + temp\n                  playerscore.settext(C_PLAYERSCORE + nScore)\n                  flag = 1\n                  moveup[p] = temp\n                  del(moveup,p+1)\n               ok\n            ok\n       next\n       for n = 1 to len(moveup)\n            button[nr][n].settext(moveup[n])\n       next\n       for n = len(moveup) + 1 to size \n            if n <= size\n               button[nr][n].setStylesheet(C_EMPTYBUTTONSTYLE)\n               button[nr][n].settext('')\n            ok\n       next\n\nfunc movetilesdown(nr,movedown)\n        flag = 0\n        for p = 1 to len(movedown) - 1\n             temp1 = movedown[p]\n             temp2 = movedown[p+1]\n             if (temp1 = temp2) and (temp1\u00a0!= '0') and (temp2\u00a0!= '0') and (temp1\u00a0!= '') and (temp2\u00a0!= '')\n               temp = string(number(temp1) + number(temp2))\n               if temp\u00a0!= '0' and temp\u00a0!= ''\n                  nScore = nScore + temp\n                  playerscore.settext(C_PLAYERSCORE + nScore)\n                  flag = 1\n                  movedown[p] = temp\n                  del(movedown,p+1)\n               ok\n            ok\n       next\n       for n = 1 to len(movedown)\n            button[nr][size-n+1].settext(movedown[n])\n       next\n       for n = size - len(movedown) to 1 step -1 \n            if n <= size\n               button[nr][n].setStylesheet(C_EMPTYBUTTONSTYLE)\n               app.processevents()\n               button[nr][n].settext('')\n            ok\n       next\n\nfunc newnum()\n        while true\n                rn = random(size - 1) + 1\n                rm = random(size - 1) + 1\n                if button[rn][rm].text() = ''\n                   button[rn][rm].settext('2')\n                   exit\n                ok\n        end\n        return\n\nfunc gameover()\n        num = 0\n        flag = 0\n        for n = 1 to size\n             for m = 1 to size \n                  if button[n][m].text()\u00a0!= ''\n                     num = num + 1\n                  ok\n              next\n        next\n        return num\n\nfunc msgBox(text) {\n\tm = new qMessageBox(win) {\n\t       setWindowTitle('2048 Game')\n\t       setText(text)\n\t       show()\n\t       }\n        }\n\nfunc showarray(vect)\n        see \"[\"\n        svect = \"\"\n        for n = 1 to len(vect)\n              svect = svect + vect[n] + \" \"\n        next\n        svect = left(svect, len(svect) - 1)\n        see svect\n        see \"]\" + nl\n\nclass MyButton from qLabel\n       func setText(cValue)\n              Super.setText(cValue)\n              switch cValue \n                        on '2' \t\tsetStyleSheet(C_BUTTON2STYLE)\n                        on '4' \t\tsetStylesheet(C_BUTTON4STYLE)\n                        on '8' \t\tsetStylesheet(C_BUTTON8STYLE)\n                        on '16' \tsetStylesheet(C_BUTTON16STYLE)\n                        on '32' \tsetStylesheet(C_BUTTON32STYLE)\n                        on '64' \tsetStylesheet(C_BUTTON64STYLE)\n                        on '128' \tsetStylesheet(C_BUTTON128STYLE)\n\t\t\ton '256'\tsetStylesheet(C_BUTTON256STYLE)\n\t\t\ton '512'\tsetStylesheet(C_BUTTON512STYLE)\n\t\t\ton '1024'\tsetStylesheet(C_BUTTON1024STYLE)\n\t\t\ton '2048'\tsetStylesheet(C_BUTTON2048STYLE)\n              off",
        "safe": true
    },
    {
        "filename": "2048_101.txt",
        "content": "#!/usr/bin/ruby\n\nrequire 'io/console'\n\nclass Board\n  def initialize size=4, win_limit=2048, cell_width = 6\n    @size = size; @cw = cell_width; @win_limit = win_limit\n    @board = Array.new(size) {Array.new(size, 0)}\n    @moved = true; @score = 0; @no_more_moves = false\n    spawn\n  end\n\n  def draw\n    print \"\\n\\n\" if @r_vert\n    print '    ' if @r_hori\n    print '\u250c' + (['\u2500' * @cw] * @size).join('\u252c')  + '\u2510'\n    @board.each do |row|\n      print \"\\n\"\n      formated = row.map {|num| num == 0 ? ' ' * @cw : format(num)}\n      print '    ' if @r_hori\n      puts '\u2502' + formated.join('\u2502') + '\u2502'\n      print '    ' if @r_hori\n      print '\u251c' + ([' '  * @cw] * @size).join('\u253c') + '\u2524'\n    end\n    print \"\\r\"\n    print '    ' if @r_hori\n    puts '\u2514' + (['\u2500' * @cw] * @size).join('\u2534')  + '\u2518'\n  end\n\n  def move direction\n    case direction\n    when :up\n      @board = column_map {|c| logic(c)}\n      @r_vert = false if $rumble\n    when :down\n      @board = column_map {|c| logic(c.reverse).reverse} \n      @r_vert = true if $rumble\n    when :left \n      @board = row_map {|r| logic(r)}\n      @r_hori = false if $rumble\n    when :right\n      @board = row_map {|r| logic(r.reverse).reverse} \n      @r_hori = true if $rumble\n    end\n    spawn\n    @moved = false\n  end\n\n  def print_score\n    puts \"Your Score is #@score.\"\n    puts \"Congratulations, you have won!\" if to_enum.any? {|e| e >= @win_limit}\n  end\n\n  def no_more_moves?; @no_more_moves; end\n  def won?;  to_enum.any? {|e| e >= @win_limit}; end\n  def reset!; initialize @size, @win_limit, @cw; end\n\n  private\n\n  def set x, y, val\n    @board[y][x] = val\n  end\n\n  def spawn \n    free_pos = to_enum.select{|elem,x,y| elem == 0}.map{|_,x,y| [x,y]}\n    unless free_pos.empty?\n      set *free_pos.sample, rand > 0.1 ? 2 : 4 if @moved\n    else\n      snap = @board\n      unless @stop\n        @stop = true\n        %i{up down left right}.each{|s| move(s)}\n        @no_more_moves = true if snap.flatten == @board.flatten\n        @board = snap\n        @stop = false\n      end\n    end\n  end\n\n  def logic list\n    jump = false\n    result =\n    list.reduce([]) do |res, val|\n      if res.last == val && !jump\n\tres[-1] += val\n\t@score += val\n        jump = true\n      elsif val != 0\n\tres.push val\n        jump = false\n      end\n      res\n    end\n    result += [0] * (@size - result.length)\n    @moved ||= list != result\n    result\n  end\n\n  def column_map\n    xboard = @board.transpose\n    xboard.map!{|c| yield c }\n    xboard.transpose\n  end\n\n  def row_map\n    @board.map {|r| yield r }\n  end\n\n  def to_enum\n    @enum ||= Enumerator.new(@size * @size) do |yielder|\n      (@size*@size).times do |i|\n\tyielder.yield (@board[i / @size][i % @size]), (i % @size), (i / @size )\n      end\n    end\n    @enum.rewind\n  end\n\n  def format(num)\n    if $color\n      cstart = \"\\e[\" + $colors[Math.log(num, 2)] + \"m\"\n      cend = \"\\e[0m\"\n    else\n      cstart = cend = \"\"\n    end\n    cstart + num.to_s.center(@cw) + cend\n  end\nend\n\n$color = true\n$colors = %W{0 1;97 1;93 1;92 1;96 1;91 1;95 1;94 1;30;47 1;43 1;42\n1;46 1;41 1;45 1;44 1;33;43 1;33;42 1;33;41 1;33;44}\n$rumble = false\n\n$check_score = true\nunless ARGV.empty?\n  puts \"Usage: #$0 [gridsize] [score-threshold] [padwidth] [--no-color] [--rumble]\"; exit if %W[-h --help].include?(ARGV[0])\n  args = ARGV.map(&:to_i).reject{|n| n == 0}\n  b = Board.new(*args) unless args.empty?\n  $rumble = true if ARGV.any?{|a| a =~ /rumble/i }\n  $color = false if ARGV.any?{|a| a =~ /no.?color/i}\nend\n\nb ||= Board.new\nputs \"\\e[H\\e[2J\"\nb.draw\nputs \"Press h for help, q to quit\"\nloop do\n  input = STDIN.getch\n  if input == \"\\e\" \n    2.times {input << STDIN.getch}\n  end\n\n  case input\n  when \"\\e[A\", \"w\" then b.move(:up)\n  when \"\\e[B\", \"s\" then b.move(:down)\n  when \"\\e[C\", \"d\" then b.move(:right)\n  when \"\\e[D\", \"a\" then b.move(:left)\n \n  when \"q\",\"\\u0003\",\"\\u0004\"  then b.print_score; exit\n\n  when \"h\" \n    puts <<-EOM.gsub(/^\\s*/, '')\n      \u250c\u2500                                                                                  \u2500\u2510\n      \u2502Use the arrow-keys or WASD on your keyboard to push board in the given direction.   \n      \u2502Tiles with the same number merge into one.                                          \n      \u2502Get a tile with a value of #{ARGV[1] || 2048} to win.                               \n      \u2502In case you cannot move or merge any tiles anymore, you loose.                      \n      \u2502You can start this game with different settings by providing commandline argument:  \n      \u2502For instance:                                                                       \n      \u2502 \u00a0%> #$0 6 8192 --rumble                                                            \n      \u2514\u2500                                                                                  \u2500\u2518\n      PRESS q TO QUIT (or Ctrl-C or Ctrl-D)\n    EOM\n    input = STDIN.getch\n  end\n\n  puts \"\\e[H\\e[2J\"\n  b.draw\n\n  if b.no_more_moves? or $check_score && b.won?\n    b.print_score\n    if b.no_more_moves?\n      puts \"No more moves possible\"\n      puts \"Again? (y/n)\"\n      exit if STDIN.gets.chomp.downcase == \"n\"\n      $check_score = true\n      b.reset!\n      puts \"\\e[H\\e[2J\"\n      b.draw\n    else\n      puts \"Continue? (y/n)\"\n      exit if STDIN.gets.chomp.downcase == \"n\"\n      $check_score = false\n      puts \"\\e[H\\e[2J\"\n      b.draw\n    end\n  end\nend\n",
        "safe": true
    },
    {
        "filename": "2048_102.txt",
        "content": "use std::io::{self,BufRead};\nextern crate rand;\n\nenum Usermove {\n    Up,\n    Down,\n    Left,\n    Right,\n}\n\nfn print_game(field :& [[u32;4];4] ){\n    println!(\"{:?}\",&field[0] );\n    println!(\"{:?}\",&field[1] );\n    println!(\"{:?}\",&field[2] );\n    println!(\"{:?}\",&field[3] );\n}\n\nfn get_usermove()-> Usermove {\n    let umove: Usermove ;\n    loop{\n        let mut input = String::new();\n        io::stdin().read_line(&mut input).unwrap();\n\n        match input.chars().nth(0){\n            Some('a') =>{umove = Usermove::Left ;break },\n            Some('w') =>{umove = Usermove::Up   ;break },\n            Some('s') =>{umove = Usermove::Down ;break },\n            Some('d') =>{umove = Usermove::Right;break },\n            _   => {println!(\"input was {}: invalid character should be a,s,w or d \",input.chars().nth(0).unwrap());} ,\n        }\n    }\n    umove\n}\n\n//this function inplements the user moves.\n//for every element it looks if the element is zero\n// if the element is zero it looks against the direction of the movement if any\n//element is not zero then it will move it to the element its place then it will look for\n//a matching element\n//  if the element is not zero then it will look for a match if no match is found\n// then it will look for the next element\n\nfn do_game_step(step : &Usermove, field:&mut [[u32;4];4]){\n    match *step {\n        Usermove::Left =>{\n            for array in field{\n                for  col in 0..4 {\n                    for testcol in (col+1)..4 {\n                        if array[testcol] != 0 {\n                            if array[col] == 0 {\n                                array[col] += array[testcol];\n                                array[testcol] = 0;\n                            }\n                            else if array[col] == array[testcol] {\n                                array[col] += array[testcol];\n                                array[testcol] = 0;\n                                break;\n                            } else {\n                                break\n                            }\n                        }\n                    }\n                }\n            }\n        } ,\n        Usermove::Right=>{\n            for array in field{\n                for  col in (0..4).rev() {\n                    for testcol in (0..col).rev() {\n                        if array[testcol] != 0 {\n                            if array[col] == 0 {\n                                array[col] += array[testcol];\n                                array[testcol] = 0;\n                            }\n                            else if array[col] == array[testcol] {\n                                array[col] += array[testcol];\n                                array[testcol] = 0;\n                                break;\n                            }else {\n                                break;\n                            }\n                        }\n                    }\n                }\n            }\n        } ,\n        Usermove::Down   =>{\n            for col in 0..4 {\n                for row in (0..4).rev() {\n                    for testrow in (0..row).rev() {\n                        if field[testrow][col] != 0 {\n                            if field[row][col] == 0 {\n                                field[row][col] += field[testrow][col];\n                                field[testrow][col] = 0;\n                            } else if field[row][col] == field[testrow][col] {\n                                field[row][col] += field[testrow][col];\n                                field[testrow][col] = 0;\n                                break;\n                            }else {\n                                break;\n                            }\n\n                        }\n                    }\n                }\n            }\n        } ,\n        Usermove::Up =>{\n            for col in 0..4 {\n                for row in 0..4{\n                    for testrow in (row+1)..4 {\n                        if field[testrow][col] != 0 {\n                            if field[row][col] == 0 {\n                                field[row][col] += field[testrow][col];\n                                field[testrow][col] = 0;\n                            } else if field[row][col] == field[testrow][col] {\n                                field[row][col] += field[testrow][col];\n                                field[testrow][col] = 0;\n                                break;\n                            }else {\n                                break;\n                            }\n                        }\n                    }\n                }\n            }\n        },\n    }\n}\n\nfn spawn( field: &mut  [[u32;4];4]){\n    loop{\n        let x = rand::random::<usize>();\n        if field[x % 4][(x/4)%4] == 0 {\n            if x % 10 == 0 {\n                field[x % 4][(x/4)%4]= 4;\n            }else{\n                field[x % 4][(x/4)%4]= 2;\n            }\n            break;\n        }\n    }\n}\n\n\nfn main() {\n    let mut field : [[u32; 4];4] =  [[0;4];4];\n    let mut test : [[u32; 4];4] ;\n    'gameloop:loop {\n        //check if there is still an open space\n        test=field.clone();\n        spawn(&mut field);\n        //if all possible moves do not yield a change then there is no valid move left\n        //and it will be game over\n        for i in [Usermove::Up,Usermove::Down,Usermove::Left,Usermove::Right].into_iter(){\n            do_game_step(i, &mut test);\n            if test != field{\n                break;//found a valid move\n            }\n            match *i{\n                Usermove::Right=> {\n                    println!(\"No more valid move, you lose\");\n                    break 'gameloop;\n                },\n                _=>{},\n            }\n        }\n        print_game(&field);\n        println!(\"move the blocks\");\n\n        test=field.clone();\n        while test==field {\n            do_game_step(&get_usermove(), &mut field);\n        }\n\n        for row in field.iter(){\n            if row.iter().any(|x| *x == 2048){\n                print_game(&field );\n                println!(\"You Won!!\");\n                break;\n            }\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "2048_103.txt",
        "content": "import java.awt.event.{KeyAdapter, KeyEvent, MouseAdapter, MouseEvent}\nimport java.awt.{BorderLayout, Color, Dimension, Font, Graphics2D, Graphics, RenderingHints}\nimport java.util.Random\n\nimport javax.swing.{JFrame, JPanel, SwingUtilities}\n\nobject Game2048 {\n  val target = 2048\n  var highest = 0\n\n  def main(args: Array[String]): Unit = {\n    SwingUtilities.invokeLater(() => {\n      val f = new JFrame\n      f.setDefaultCloseOperation(3)\n      f.setTitle(\"2048\")\n      f.add(new Game, BorderLayout.CENTER)\n      f.pack()\n      f.setLocationRelativeTo(null)\n      f.setVisible(true)\n    })\n  }\n\n  class Game extends JPanel {\n    private val (rand , side)= (new Random, 4)\n    private var (tiles, gamestate)= (Array.ofDim[Tile](side, side), Game2048.State.start)\n\n    final private val colorTable =\n      Seq(new Color(0x701710), new Color(0xFFE4C3), new Color(0xfff4d3), new Color(0xffdac3), new Color(0xe7b08e), new Color(0xe7bf8e),\n        new Color(0xffc4c3), new Color(0xE7948e), new Color(0xbe7e56), new Color(0xbe5e56), new Color(0x9c3931), new Color(0x701710))\n\n    setPreferredSize(new Dimension(900, 700))\n    setBackground(new Color(0xFAF8EF))\n    setFont(new Font(\"SansSerif\", Font.BOLD, 48))\n    setFocusable(true)\n    addMouseListener(new MouseAdapter() {\n      override def mousePressed(e: MouseEvent): Unit = {\n        startGame()\n        repaint()\n      }\n    })\n    addKeyListener(new KeyAdapter() {\n      override def keyPressed(e: KeyEvent): Unit = {\n        e.getKeyCode match {\n          case KeyEvent.VK_UP => moveUp()\n          case KeyEvent.VK_DOWN => moveDown()\n          case KeyEvent.VK_LEFT => moveLeft()\n          case KeyEvent.VK_RIGHT => moveRight()\n          case _ =>\n        }\n        repaint()\n      }\n    })\n\n    override def paintComponent(gg: Graphics): Unit = {\n      super.paintComponent(gg)\n      val g = gg.asInstanceOf[Graphics2D]\n      g.setRenderingHint(RenderingHints.KEY_ANTIALIASING, RenderingHints.VALUE_ANTIALIAS_ON)\n      drawGrid(g)\n    }\n\n    private def drawGrid(g: Graphics2D): Unit = {\n      val (gridColor, emptyColor, startColor) = (new Color(0xBBADA0), new Color(0xCDC1B4), new Color(0xFFEBCD))\n\n      if (gamestate == State.running) {\n        g.setColor(gridColor)\n        g.fillRoundRect(200, 100, 499, 499, 15, 15)\n        for (\n          r <- 0 until side;\n          c <- 0 until side\n        ) if (Option(tiles(r)(c)).isEmpty) {\n          g.setColor(emptyColor)\n          g.fillRoundRect(215 + c * 121, 115 + r * 121, 106, 106, 7, 7)\n        }\n        else drawTile(g, r, c)\n      } else {\n        g.setColor(startColor)\n        g.fillRoundRect(215, 115, 469, 469, 7, 7)\n        g.setColor(gridColor.darker)\n        g.setFont(new Font(\"SansSerif\", Font.BOLD, 128))\n        g.drawString(\"2048\", 310, 270)\n        g.setFont(new Font(\"SansSerif\", Font.BOLD, 20))\n        if (gamestate == Game2048.State.won) g.drawString(\"you made it!\", 390, 350)\n        else if (gamestate == Game2048.State.over) g.drawString(\"game over\", 400, 350)\n        g.setColor(gridColor)\n        g.drawString(\"click to start a new game\", 330, 470)\n        g.drawString(\"(use arrow keys to move tiles)\", 310, 530)\n      }\n    }\n\n    private def drawTile(g: Graphics2D, r: Int, c: Int): Unit = {\n      val value = tiles(r)(c).value\n      g.setColor(colorTable((math.log(value) / math.log(2)).toInt + 1))\n      g.fillRoundRect(215 + c * 121, 115 + r * 121, 106, 106, 7, 7)\n      g.setColor(if (value < 128) colorTable.head else colorTable(1))\n      val (s , fm)= (value.toString, g.getFontMetrics)\n      val asc = fm.getAscent\n      val (x, y) = (215 + c * 121 + (106 - fm.stringWidth(s)) / 2,115 + r * 121 + (asc + (106 - (asc + fm.getDescent)) / 2))\n      g.drawString(s, x, y)\n    }\n\n    private def moveUp(checkingAvailableMoves: Boolean = false) = move(0, -1, 0, checkingAvailableMoves)\n\n    private def moveDown(checkingAvailableMoves: Boolean = false) = move(side * side - 1, 1, 0, checkingAvailableMoves)\n\n    private def moveLeft(checkingAvailableMoves: Boolean = false) = move(0, 0, -1, checkingAvailableMoves)\n\n    private def moveRight(checkingAvailableMoves: Boolean = false) = move(side * side - 1, 0, 1, checkingAvailableMoves)\n\n    private def clearMerged(): Unit = for (row <- tiles; tile <- row) if (Option(tile).isDefined) tile.setMerged()\n\n    private def movesAvailable() = moveUp(true) || moveDown(true) || moveLeft(true) || moveRight(true)\n\n    def move(countDownFrom: Int, yIncr: Int, xIncr: Int, checkingAvailableMoves: Boolean): Boolean = {\n      var moved = false\n      for (i <- 0 until side * side) {\n        val j = math.abs(countDownFrom - i)\n        var( r,c) = (j / side,  j % side)\n        if (Option(tiles(r)(c)).isDefined) {\n          var (nextR, nextC, breek) = (r + yIncr, c + xIncr, false)\n          while ((nextR >= 0 && nextR < side && nextC >= 0 && nextC < side) && !breek) {\n            val (next, curr) = (tiles(nextR)(nextC),tiles(r)(c))\n            if (Option(next).isEmpty)\n              if (checkingAvailableMoves) return true\n              else {\n                tiles(nextR)(nextC) = curr\n                tiles(r)(c) = null\n                r = nextR\n                c = nextC\n                nextR += yIncr\n                nextC += xIncr\n                moved = true\n              }\n            else if (next.canMergeWith(curr)) {\n              if (checkingAvailableMoves) return true\n              Game2048.highest = math.max(next.mergeWith(curr), Game2048.highest)\n              tiles(r)(c) = null\n              breek = true\n              moved = true\n            } else breek = true\n          }\n        }\n      }\n      if (moved) if (Game2048.highest < Game2048.target) {\n        clearMerged()\n        addRandomTile()\n        if (!movesAvailable) gamestate = State.over\n      }\n      else if (Game2048.highest == Game2048.target) gamestate = State.won\n      moved\n    }\n\n    private def startGame(): Unit = {\n      if (gamestate ne Game2048.State.running) {\n        Game2048.highest = 0\n        gamestate = Game2048.State.running\n        tiles = Array.ofDim[Tile](side, side)\n        addRandomTile()\n        addRandomTile()\n      }\n    }\n\n    private def addRandomTile(): Unit = {\n      var pos = rand.nextInt(side * side)\n      var (row, col) = (0, 0)\n      do {\n        pos = (pos + 1) % (side * side)\n        row = pos / side\n        col = pos % side\n      } while (Option(tiles(row)(col)).isDefined)\n      tiles(row)(col) = new Tile(if (rand.nextInt(10) == 0) 4 else 2)\n    }\n\n    class Tile(var value: Int) {\n      private var merged = false\n\n      def setMerged(): Unit = merged = false\n\n      def mergeWith(other: Tile): Int = if (canMergeWith(other)) {\n        merged = true\n        value *= 2\n        value\n      } else -1\n\n      def canMergeWith(other: Tile): Boolean = !merged && Option(other).isDefined && !other.merged && value == other.value\n    }\n  }\n\n  object State extends Enumeration {\n    type State = Value\n    val start, won, running, over = Value\n  }\n\n}\n",
        "safe": true
    },
    {
        "filename": "2048_104.txt",
        "content": "$ include \"seed7_05.s7i\";\n  include \"console.s7i\";\n  include \"keybd.s7i\";\n\nconst integer: boardLength is 4;\nconst integer: boardSize is boardLength * boardLength;\nconst integer: target is 2048;\n\nconst type: stateType is new struct\n    var integer: fieldsOccupied is 0;\n    var integer: largestNumber is 0;\n    var integer: score is 0;\n    var array array integer: board is boardLength times boardLength times 0;\n  end struct;\n\nconst proc: addTile (inout stateType: state) is func\n  local\n    var integer: row is 0;\n    var integer: col is 0;\n    var integer: field is 2;\n  begin\n    if state.fieldsOccupied < boardSize then\n      repeat\n        col\u00a0:= rand(1, boardLength);\n        row\u00a0:= rand(1, boardLength);\n      until state.board[row][col] = 0;\n      if rand(1, 10) = 10 then\n        field\u00a0:= 4;\n      end if;\n      state.board[row][col]\u00a0:= field;\n      incr(state.fieldsOccupied);\n      state.largestNumber\u00a0:= max(field, state.largestNumber);\n    end if;\n  end func;\n\nconst proc: showBoard (in stateType: state) is func\n  local\n    var integer: row is 0;\n    var integer: field is 0;\n  begin\n    writeln(\"\u250c\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2510\");\n    for key row range state.board do\n      for field range state.board[row] do\n        if field = 0 then\n          write(\"\u2502    \");\n        else\n          write(\"\u2502\" <& field lpad (5 + length(str(field))) div 2 rpad 4);\n        end if;\n      end for;\n      writeln(\"\u2502\");\n      if row < maxIdx(state.board) then\n        writeln(\"\u251c\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2524\");\n      end if;\n    end for;\n    writeln(\"\u2514\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2518\");\n  end func;\n\nconst func boolean: doMove (inout stateType: state, in integer: startRow,\n    in integer: startCol, in integer: deltaRow, in integer: deltaCol, in boolean: doMerge) is func\n  result\n    var boolean: boardChanged is FALSE;\n  local\n    const set of integer: boardRange is {1 .. boardLength};\n    var integer: row is 1;\n    var integer: col is 1;\n    var integer: nextRow is 0;\n    var integer: nextCol is 0;\n  begin\n    row\u00a0:= startRow;\n    col\u00a0:= startCol;\n    while row in boardRange and col in boardRange do\n      while row in boardRange and col in boardRange do\n        nextRow\u00a0:= row + deltaRow;\n        nextCol\u00a0:= col + deltaCol;\n        if state.board[row][col] = 0 and\n            nextRow in boardRange and nextCol in boardRange and\n            state.board[nextRow][nextCol] <> 0 then\n          boardChanged\u00a0:= TRUE;\n          state.board[row][col]\u00a0:= state.board[nextRow][nextCol];\n          state.board[nextRow][nextCol]\u00a0:= 0;\n          if row - deltaRow in boardRange and col - deltaCol in boardRange then\n            nextRow\u00a0:= row - deltaRow;\n            nextCol\u00a0:= col - deltaCol;\n          end if;\n        end if;\n        row\u00a0:= nextRow;\n        col\u00a0:= nextCol;\n      end while;\n\n      if doMerge then\n        if deltaRow <> 0 then\n          row\u00a0:= startRow;\n        elsif deltaCol <> 0 then\n          col\u00a0:= startCol;\n        end if;\n        while row in boardRange and col in boardRange do\n          nextRow\u00a0:= row + deltaRow;\n          nextCol\u00a0:= col + deltaCol;\n          if state.board[row][col] <> 0 and\n              nextRow in boardRange and nextCol in boardRange and\n              state.board[nextRow][nextCol] = state.board[row][col] then\n            boardChanged\u00a0:= TRUE;\n            state.board[row][col] *:= 2;\n            state.largestNumber\u00a0:= max(state.board[row][col], state.largestNumber);\n            state.score +:= state.board[row][col];\n            state.board[nextRow][nextCol]\u00a0:= 0;\n            decr(state.fieldsOccupied);\n          end if;\n          row\u00a0:= nextRow;\n          col\u00a0:= nextCol;\n        end while;\n      end if;\n\n      if deltaRow = 0 then\n        incr(row);\n        col\u00a0:= startCol;\n      elsif deltaCol = 0 then\n        incr(col);\n        row\u00a0:= startRow;\n      end if;\n    end while;\n    if doMerge and boardChanged then\n      ignore(doMove(state, startRow, startCol, deltaRow, deltaCol, FALSE));\n    end if;\n  end func;\n\nconst func boolean: canMove (in stateType: state) is func\n  result\n    var boolean: canMove is FALSE;\n  local\n    var integer: row is 0;\n    var integer: col is 0;\n  begin\n    for row range 1 to boardLength until canMove do\n      for col range 1 to boardLength until canMove do\n        canMove\u00a0:= state.board[row][col] = 0 or\n            (row < boardLength and state.board[row][col] = state.board[succ(row)][col]) or\n            (col < boardLength and state.board[row][col] = state.board[row][succ(col)]);\n      end for;\n    end for;\n  end func;\n\nconst proc: main is func\n  local\n    var stateType: state is stateType.value;\n    var integer: highscore is 0;\n    var char: command is ' ';\n    var boolean: quit is FALSE;\n    var boolean: moveOkay is FALSE;\n  begin\n    OUT\u00a0:= open(CONSOLE);\n    addTile(state);\n    repeat\n      setPos(STD_CONSOLE, 1, 1);\n      showBoard(state);\n      highscore\u00a0:= max(highscore, state.score);\n      writeln(\"Score = \" <& state.score <& \"  Highscore = \" <& highscore);\n      if canMove(state) and state.largestNumber < target then\n        writeln(\"Press arrow keys to move, R to Restart, Q to Quit\");\n      elsif state.largestNumber >= target then\n        writeln(\"You win! Press R to Restart, Q to Quit           \");\n      else\n        writeln(\"Game over! Press R to Restart, Q to Quit         \");\n      end if;\n      repeat\n        moveOkay\u00a0:= FALSE;\n        command\u00a0:= getc(KEYBOARD);\n        case command of\n          when {'r', 'R'}:\n            state\u00a0:= stateType.value;\n            clear(STD_CONSOLE);\n            moveOkay\u00a0:= TRUE;\n          when {'q', 'Q'}:\n            moveOkay\u00a0:= TRUE;\n            quit\u00a0:= TRUE;\n          when {KEY_LEFT}:\n            moveOkay\u00a0:= doMove(state,           1,           1,  0,  1, TRUE);\n          when {KEY_RIGHT}:\n            moveOkay\u00a0:= doMove(state,           1, boardLength,  0, -1, TRUE);\n          when {KEY_UP}:\n            moveOkay\u00a0:= doMove(state,           1,           1,  1,  0, TRUE);\n          when {KEY_DOWN}:\n            moveOkay\u00a0:= doMove(state, boardLength,           1, -1,  0, TRUE);\n        end case;\n\tif moveOkay and not quit then\n\t  addTile(state);\n        end if;\n      until moveOkay;\n    until quit;\n  end func;",
        "safe": true
    },
    {
        "filename": "2048_105.txt",
        "content": "# A minimal implementation of the game 2048 in Tcl.\n# For a maintained version with expanded functionality see\n# https://tcl.wiki/40557.\npackage require Tcl 8.5\npackage require struct::matrix\npackage require struct::list\n\n# Board size.\nset size 4\n\n# Iterate over all cells of the game board and run script for each.\n#\n# The game board is a 2D matrix of a fixed size that consists of elements\n# called \"cells\" that each can contain a game tile (corresponds to numerical\n# values of 2, 4, 8, ..., 2048) or nothing (zero).\n#\n# - cellList is a list of cell indexes (coordinates), which are\n# themselves lists of two numbers each. They each represent the location\n# of a given cell on the board.\n# - varName1 are varName2 are names of the variables the will be assigned\n# the index values.\n# - cellVarName is the name of the variable that at each step of iteration\n# will contain the numerical value of the present cell. Assigning to it will\n# change the cell's value.\n# - script is the script to run.\nproc forcells {cellList varName1 varName2 cellVarName script} {\n    upvar $varName1 i\n    upvar $varName2 j\n    upvar $cellVarName c\n    foreach cell $cellList {\n        set i [lindex $cell 0]\n        set j [lindex $cell 1]\n        set c [cell-get $cell]\n        uplevel $script\n        cell-set \"$i $j\" $c\n    }\n}\n\n# Generate a list of cell indexes for all cells on the board, i.e.,\n# {{0 0} {0 1} ... {0 size-1} {1 0} {1 1} ... {size-1 size-1}}.\nproc cell-indexes {} {\n    global size\n    set list {}\n    foreach i [::struct::list iota $size] {\n        foreach j [::struct::list iota $size] {\n            lappend list [list $i $j]\n        }\n    }\n    return $list\n}\n\n# Check if a number is a valid cell index (is 0 to size-1).\nproc valid-index {i} {\n    global size\n    expr {0 <= $i && $i < $size}\n}\n\n# Return 1 if the predicate pred is true when applied to all items on the list\n# or 0 otherwise.\nproc map-and {list pred} {\n    set res 1\n    foreach item $list {\n        set res [expr {$res && [$pred $item]}]\n        if {! $res} break\n    }\n    return $res\n}\n\n# Check if list represents valid cell coordinates.\nproc valid-cell? cell {\n    map-and $cell valid-index\n}\n\n# Get the value of a game board cell.\nproc cell-get cell {\n    board get cell {*}$cell\n}\n\n# Set the value of a game board cell.\nproc cell-set {cell value} {\n    board set cell {*}$cell $value\n}\n\n# Filter a list of board cell indexes cellList to only have those indexes\n# that correspond to empty board cells.\nproc empty {cellList} {\n    ::struct::list filterfor x $cellList {[cell-get $x] == 0}\n}\n\n# Pick a random item from the given list.\nproc pick list {\n    lindex $list [expr {int(rand() * [llength $list])}]\n}\n\n# Put a \"2\" into an empty cell on the board.\nproc spawn-new {} {\n    set emptyCell [pick [empty [cell-indexes]]]\n    if {[llength $emptyCell] > 0} {\n        forcells [list $emptyCell] i j cell {\n            set cell 2\n        }\n    }\n    return $emptyCell\n}\n\n# Return vector sum of lists v1 and v2.\nproc vector-add {v1 v2} {\n    set result {}\n    foreach a $v1 b $v2 {\n        lappend result [expr {$a + $b}]\n    }\n    return $result\n}\n\n# If checkOnly is false try to shift all cells one step in the direction of\n# directionVect. If checkOnly is true just say if that move is possible.\nproc move-all {directionVect {checkOnly 0}} {\n    set changedCells 0\n\n    forcells [cell-indexes] i j cell {\n        set newIndex [vector-add \"$i $j\" $directionVect]\n        set removedStar 0\n\n        # For every nonempty source cell and valid destination cell...\n        if {$cell != 0 && [valid-cell? $newIndex]} {\n            if {[cell-get $newIndex] == 0} {\n                # Destination is empty.\n                if {$checkOnly} {\n                    # -level 2 is to return from both forcells and move-all.\n                    return -level 2 true\n                } else {\n                    # Move tile to empty cell.\n                    cell-set $newIndex $cell\n                    set cell 0\n                    incr changedCells\n                }\n            } elseif {([cell-get $newIndex] eq $cell) &&\n                      [string first + $cell] == -1} {\n                # Destination is the same number as source.\n                if {$checkOnly} {\n                    return -level 2 true\n                } else {\n                    # When merging two tiles into one mark the new tile with\n                    # the marker of \"+\" to ensure it doesn't get combined\n                    # again this turn.\n                    cell-set $newIndex [expr {2 * $cell}]+\n                    set cell 0\n                    incr changedCells\n                }\n            }\n        }\n    }\n\n    if {$checkOnly} {\n        return false\n    }\n\n    # Remove \"changed this turn\" markers at the end of the turn.\n    if {$changedCells == 0} {\n        forcells [cell-indexes] i j cell {\n            set cell [string trim $cell +]\n        }\n    }\n    return $changedCells\n}\n\n# Is it possible to move any tiles in the direction of directionVect?\nproc can-move? {directionVect} {\n    move-all $directionVect 1\n}\n\n# Check win condition. The player wins when there's a 2048 tile.\nproc check-win {} {\n    forcells [cell-indexes] i j cell {\n        if {$cell == 2048} {\n            puts \"You win!\"\n            exit 0\n        }\n    }\n}\n\n# Check lose condition. The player loses when the win condition isn't met and\n# there are no possible moves.\nproc check-lose {possibleMoves} {\n    set values [dict values $possibleMoves]\n    if {!(true in $values || 1 in $values)} {\n        puts \"You lose.\"\n        exit 0\n    }\n}\n\n# Pretty-print the board. Specify an index in highlight to highlight a cell.\nproc print-board {{highlight {-1 -1}}} {\n    forcells [cell-indexes] i j cell {\n        if {$j == 0} {\n            puts \"\"\n        }\n        puts -nonewline [\n            if {$cell != 0} {\n                if {[::struct::list equal \"$i $j\" $highlight]} {\n                    format \"\\[%4s\\]\" $cell*\n                } else {\n                    format \"\\[%4s\\]\" $cell\n                }\n\n            } else {\n                lindex \"......\"\n            }\n        ]\n    }\n    puts \"\\n\"\n}\n\nproc main {} {\n    global size\n\n    struct::matrix board\n\n    # Generate an empty board of a given size.\n    board add columns $size\n    board add rows $size\n    forcells [cell-indexes] i j cell {\n        set cell 0\n    }\n\n    set controls {\n        h {0 -1}\n        j {1 0}\n        k {-1 0}\n        l {0 1}\n    }\n\n    # Game loop.\n    while true {\n        set playerMove 0\n        set possibleMoves {}\n\n        # Add new tile to the board and print the board highlighting this tile.\n        print-board [spawn-new]\n\n        check-win\n\n        # Find possible moves.\n        foreach {button vector} $controls {\n            dict set possibleMoves $button [can-move? $vector]\n        }\n        check-lose $possibleMoves\n\n        # Get valid input from the player.\n        while {$playerMove == 0} {\n            # Print prompt.\n            puts -nonewline \"Move (\"\n            foreach {button vector} $controls {\n                if {[dict get $possibleMoves $button]} {\n                    puts -nonewline $button\n                }\n            }\n            puts \")?\"\n\n            set playerInput [gets stdin]\n\n            # Validate input.\n            if {[dict exists $possibleMoves $playerInput] &&\n                [dict get $possibleMoves $playerInput]} {\n                set playerMove [dict get $controls $playerInput]\n            }\n        }\n\n        # Apply current move until no changes occur on the board.\n        while true {\n            if {[move-all $playerMove] == 0} break\n        }\n    }\n}\n\nmain\n",
        "safe": true
    },
    {
        "filename": "2048_106.txt",
        "content": "Friend Class Tile\n    Public Sub New()\n        Me.Value = 0\n        Me.IsBlocked = False\n    End Sub\n    Public Property Value As Integer\n    Public Property IsBlocked As Boolean\nEnd Class\n\nFriend Enum MoveDirection\n     Up\n     Down\n     Left\n     Right\nEnd Enum\n\n    Friend Class G2048\n        Public Sub New()\n            _isDone = False\n            _isWon = False\n            _isMoved = True\n            _score = 0\n            InitializeBoard()\n        End Sub\n\n        Private Sub InitializeBoard()\n            For y As Integer = 0 To 3\n                For x As Integer = 0 To 3\n                    _board(x, y) = New Tile()\n                Next\n            Next\n        End Sub\n\n        Private _isDone As Boolean\n        Private _isWon As Boolean\n        Private _isMoved As Boolean\n        Private _score As Integer\n        Private ReadOnly _board As Tile(,) = New Tile(3, 3) {}\n        Private ReadOnly _rand As Random = New Random()\n        Const empty As String = \" \"\n\n        Public Sub [Loop]()\n            AddTile()\n            While True\n                If _isMoved Then AddTile()\n                DrawBoard()\n                If _isDone Then Exit While\n                WaitKey()\n            End While\n            Dim endMessage As String = If(_isWon, \"You've made it!\", \"Game Over!\")\n            Console.WriteLine(endMessage)\n        End Sub\n\n        Public Sub DrawBoard()\n            Console.Clear()\n            Console.WriteLine(\"Score: \" & _score & vbNewLine)\n            For y As Integer = 0 To 3\n                Console.WriteLine(\"+------+------+------+------+\")\n                Console.Write(\"| \")\n                For x As Integer = 0 To 3\n                    If _board(x, y).Value = 0 Then\n                        Console.Write(empty.PadRight(4))\n                    Else\n                        Console.Write(_board(x, y).Value.ToString().PadRight(4))\n                    End If\n                    Console.Write(\" | \")\n                Next\n                Console.WriteLine()\n            Next\n            Console.WriteLine(\"+------+------+------+------+\" & vbNewLine & vbNewLine)\n        End Sub\n\n        Private Sub WaitKey()\n            _isMoved = False\n            Console.WriteLine(\"(W) Up (S) Down (A) Left (D) Right\")\n            Dim input As Char\n            Char.TryParse(Console.ReadKey().Key.ToString(), input)\n            Select Case input\n                Case \"W\"c\n                    Move(MoveDirection.Up)\n                Case \"A\"c\n                    Move(MoveDirection.Left)\n                Case \"S\"c\n                    Move(MoveDirection.Down)\n                Case \"D\"c\n                    Move(MoveDirection.Right)\n            End Select\n            For y As Integer = 0 To 3\n                For x As Integer = 0 To 3\n                    _board(x, y).IsBlocked = False\n                Next\n            Next\n        End Sub\n\n        Private Sub AddTile()\n            For y As Integer = 0 To 3\n                For x As Integer = 0 To 3\n                    If _board(x, y).Value <> 0 Then Continue For\n                    Dim a As Integer, b As Integer\n                    Do\n                        a = _rand.Next(0, 4)\n                        b = _rand.Next(0, 4)\n                    Loop While _board(a, b).Value <> 0\n                    Dim r As Double = _rand.NextDouble()\n                    _board(a, b).Value = If(r > 0.89F, 4, 2)\n                    If CanMove() Then Return\n                Next\n            Next\n            _isDone = True\n        End Sub\n\n        Private Function CanMove() As Boolean\n            For y As Integer = 0 To 3\n                For x As Integer = 0 To 3\n                    If _board(x, y).Value = 0 Then Return True\n                Next\n            Next\n            For y As Integer = 0 To 3\n                For x As Integer = 0 To 3\n                    If TestAdd(x + 1, y, _board(x, y).Value) OrElse TestAdd(x - 1, y, _board(x, y).Value) OrElse TestAdd(x, y + 1, _board(x, y).Value) OrElse TestAdd(x, y - 1, _board(x, y).Value) Then Return True\n                Next\n            Next\n            Return False\n        End Function\n\n        Private Function TestAdd(ByVal x As Integer, ByVal y As Integer, ByVal value As Integer) As Boolean\n            If x < 0 OrElse x > 3 OrElse y < 0 OrElse y > 3 Then Return False\n            Return _board(x, y).Value = value\n        End Function\n\n        Private Sub MoveVertically(ByVal x As Integer, ByVal y As Integer, ByVal d As Integer)\n            If _board(x, y + d).Value <> 0 AndAlso _board(x, y + d).Value = _board(x, y).Value AndAlso Not _board(x, y).IsBlocked AndAlso Not _board(x, y + d).IsBlocked Then\n                _board(x, y).Value = 0\n                _board(x, y + d).Value *= 2\n                _score += _board(x, y + d).Value\n                _board(x, y + d).IsBlocked = True\n                _isMoved = True\n            ElseIf _board(x, y + d).Value = 0 AndAlso _board(x, y).Value <> 0 Then\n                _board(x, y + d).Value = _board(x, y).Value\n                _board(x, y).Value = 0\n                _isMoved = True\n            End If\n            If d > 0 Then\n                If y + d < 3 Then MoveVertically(x, y + d, 1)\n            Else\n                If y + d > 0 Then MoveVertically(x, y + d, -1)\n            End If\n        End Sub\n\n        Private Sub MoveHorizontally(ByVal x As Integer, ByVal y As Integer, ByVal d As Integer)\n            If _board(x + d, y).Value <> 0 AndAlso _board(x + d, y).Value = _board(x, y).Value AndAlso Not _board(x + d, y).IsBlocked AndAlso Not _board(x, y).IsBlocked Then\n                _board(x, y).Value = 0\n                _board(x + d, y).Value *= 2\n                _score += _board(x + d, y).Value\n                _board(x + d, y).IsBlocked = True\n                _isMoved = True\n            ElseIf _board(x + d, y).Value = 0 AndAlso _board(x, y).Value <> 0 Then\n                _board(x + d, y).Value = _board(x, y).Value\n                _board(x, y).Value = 0\n                _isMoved = True\n            End If\n            If d > 0 Then\n                If x + d < 3 Then MoveHorizontally(x + d, y, 1)\n            Else\n                If x + d > 0 Then MoveHorizontally(x + d, y, -1)\n            End If\n        End Sub\n\n        Private Sub Move(ByVal direction As MoveDirection)\n            Select Case direction\n                Case MoveDirection.Up\n                    For x As Integer = 0 To 3\n                        Dim y As Integer = 1\n                        While y < 4\n                            If _board(x, y).Value <> 0 Then MoveVertically(x, y, -1)\n                            y += 1\n                        End While\n                    Next\n                Case MoveDirection.Down\n                    For x As Integer = 0 To 3\n                        Dim y As Integer = 2\n                        While y >= 0\n                            If _board(x, y).Value <> 0 Then MoveVertically(x, y, 1)\n                            y -= 1\n                        End While\n                    Next\n                Case MoveDirection.Left\n                    For y As Integer = 0 To 3\n                        Dim x As Integer = 1\n                        While x < 4\n                            If _board(x, y).Value <> 0 Then MoveHorizontally(x, y, -1)\n                            x += 1\n                        End While\n                    Next\n                Case MoveDirection.Right\n                    For y As Integer = 0 To 3\n                        Dim x As Integer = 2\n                        While x >= 0\n                            If _board(x, y).Value <> 0 Then MoveHorizontally(x, y, 1)\n                            x -= 1\n                        End While\n                    Next\n            End Select\n        End Sub\n    End Class\n\n    Module Module1\n        Sub Main()\n            RunGame()\n        End Sub\n\n        Private Sub RunGame()\n            Dim game As G2048 = New G2048()\n            game.Loop()\n            CheckRestart()\n        End Sub\n\n        Private Sub CheckRestart()\n            Console.WriteLine(\"(N) New game (P) Exit\")\n            While True\n                Dim input As Char\n                Char.TryParse(Console.ReadKey().Key.ToString(), input)\n                Select Case input\n                    Case \"N\"c\n                        RunGame()\n                    Case \"P\"c\n                        Return\n                    Case Else\n                        ClearLastLine()\n                End Select\n            End While\n        End Sub\n\n        Private Sub ClearLastLine()\n            Console.SetCursorPosition(0, Console.CursorTop)\n            Console.Write(New String(\" \", Console.BufferWidth))\n            Console.SetCursorPosition(0, Console.CursorTop - 1)\n        End Sub\n    End Module\n",
        "safe": true
    },
    {
        "filename": "2048_107.txt",
        "content": "Score: 572\n\n+------+------+------+------+\n|      | 2    | 16   | 4    |\n+------+------+------+------+\n|      | 2    | 4    | 64   |\n+------+------+------+------+\n| 4    | 16   | 32   | 4    |\n+------+------+------+------+\n| 2    | 4    | 2    | 16   |\n+------+------+------+------+\n\n\n(W) Up (S) Down (A) Left (D) Right\n",
        "safe": true
    },
    {
        "filename": "2048_108.txt",
        "content": "import \"./dynamic\" for Enum, Struct\nimport \"random\" for Random\nimport \"./ioutil\" for Input\nimport \"./fmt\" for Fmt\nimport \"./str\" for Str\n\nvar MoveDirection = Enum.create(\"MoveDirection\", [\"up\", \"down\", \"left\", \"right\"])\n\nvar Tile = Struct.create(\"Tile\", [\"value\", \"isBlocked\"])\n\nclass G2048 {\n    construct new() {\n        _isDone  = false\n        _isWon   = false\n        _isMoved = true\n        _score = 0\n        _board = List.filled(4, null)\n        for (i in 0..3) {\n            _board[i] = List.filled(4, null)\n            for (j in 0..3) _board[i][j] = Tile.new(0, false)\n        }\n        _rand = Random.new() \n    }\n\n    loop() {\n        addTile()\n        while (true) {\n            if (_isMoved) addTile()\n            drawBoard()\n            if (_isDone) break\n            waitKey()\n        }\n        var endMessage = _isWon ? \"You've made it!\" : \"Game Over!\"\n        System.print(endMessage)\n    }\n\n    drawBoard() {\n        System.print(\"\\e[2J\") // clear terminal\n        System.print(\"Score: %(_score)\\n\")\n        for (y in 0..3) {\n            System.print(\"+------+------+------+------+\")\n            System.write(\"| \")\n            for (x in 0..3) {\n                if (_board[x][y].value == 0) {\n                    System.write(\"    \")\n                } else {\n                    Fmt.write(\"$-4s\", _board[x][y].value)\n                }\n                System.write(\" | \")\n            }\n            System.print()\n        }\n        System.print(\"+------+------+------+------+\\n\\n\")\n    }\n\n    waitKey() {\n        _isMoved = false\n        var input = Str.upper(Input.option(\"(W) Up (S) Down (A) Left (D) Right: \", \"WSADwsad\"))\n        if (input == \"W\") {\n            move(MoveDirection.up)\n        } else if (input == \"A\") {\n            move(MoveDirection.left)\n        } else if (input == \"S\") {\n            move(MoveDirection.down)\n        } else if (input == \"D\") {\n            move(MoveDirection.right)\n        }\n        for (y in 0..3) {\n            for (x in 0..3) _board[x][y].isBlocked = false\n        }\n    }\n\n    addTile() {\n        for (y in 0..3) {\n            for (x in 0..3) {\n                if (_board[x][y].value != 0) continue\n                var a\n                var b\n                while (true) {\n                    a = _rand.int(4)\n                    b = _rand.int(4)\n                    if (_board[a][b].value == 0) break\n                }\n                var r = _rand.float()\n                _board[a][b].value = (r > 0.89) ? 4 : 2\n                if (canMove()) return\n            }\n        }\n        _isDone = true\n    }\n\n    canMove() {\n        for (y in 0..3) {\n            for (x in 0..3) {\n                if (_board[x][y].value == 0) return true\n            }\n        }\n\n        for (y in 0..3) {\n            for (x in 0..3) {\n                if (testAdd(x + 1, y, _board[x][y].value) ||\n                    testAdd(x - 1, y, _board[x][y].value) ||\n                    testAdd(x, y + 1, _board[x][y].value) ||\n                    testAdd(x, y - 1, _board[x][y].value)) return true\n            }\n        }\n\n        return false\n    }\n\n    testAdd(x, y, value) {\n        if (x < 0 || x > 3 || y < 0 || y > 3) return false\n        return _board[x][y].value == value\n    }\n\n    moveVertically(x, y, d) {\n        if (_board[x][y + d].value != 0 &&\n            _board[x][y + d].value == _board[x][y].value &&\n            !_board[x][y].isBlocked &&\n            !_board[x][y + d].isBlocked) {\n            _board[x][y].value = 0\n            _board[x][y + d].value = _board[x][y + d].value * 2\n            _score = _score + _board[x][y + d].value\n            _board[x][y + d].isBlocked = true\n            _isMoved = true\n        } else if (_board[x][y + d].value == 0  && _board[x][y].value != 0) {\n            _board[x][y + d].value = _board[x][y].value\n            _board[x][y].value = 0\n            _isMoved = true\n        }\n\n        if (d > 0) {\n            if (y + d < 3) moveVertically(x, y + d, 1)\n        } else {\n            if (y + d > 0) moveVertically(x, y + d, -1)\n        }\n    }\n\n    moveHorizontally(x, y, d) {\n        if (_board[x + d][y].value != 0 &&\n            _board[x + d][y].value == _board[x][y].value &&\n            !_board[x + d][y].isBlocked &&\n            !_board[x][y].isBlocked) {\n            _board[x][y].value = 0\n            _board[x + d][y].value = _board[x + d][y].value * 2\n            _score = _score + _board[x + d][y].value\n            _board[x + d][y].isBlocked = true\n            _isMoved = true\n        } else if (_board[x + d][y].value == 0  && _board[x][y].value != 0) {\n            _board[x + d][y].value = _board[x][y].value\n            _board[x][y].value = 0\n            _isMoved = true\n        }\n\n        if (d > 0) {\n            if (x + d < 3) moveHorizontally(x + d, y, 1)\n        } else {\n            if (x + d > 0) moveHorizontally(x + d, y, -1)\n        }\n    }\n\n    move(direction) {\n        if (direction == MoveDirection.up) {\n            for (x in 0..3) {\n               for (y in 1..3) {\n                    if (_board[x][y].value != 0) moveVertically(x, y, -1)\n               }\n            }\n        } else if (direction == MoveDirection.down) {\n            for (x in 0..3) {\n                for (y in 2..0) {\n                    if (_board[x][y].value != 0) moveVertically(x, y, 1)\n                }\n            }\n        } else if (direction == MoveDirection.left) {\n            for (y in 0..3) {\n                for (x in 1..3) {\n                    if (_board[x][y].value != 0) moveHorizontally(x, y, -1)\n                }\n            }\n        } else if (direction == MoveDirection.right) {\n            for (y in 0..3) {\n                for (x in 2..0) {\n                    if (_board[x][y].value != 0) moveHorizontally(x, y, 1)\n                }\n            }\n        }\n    }\n}\n\nvar runGame  // forward declaration\n\nvar checkRestart = Fn.new {\n    var input = Str.upper(Input.option(\"(N) New game (P) Exit: \", \"NPnp\"))\n    if (input == \"N\") {\n        runGame.call()\n    } else if (input == \"P\") return\n}\n\nrunGame = Fn.new {\n    var game = G2048.new()\n    game.loop()\n    checkRestart.call()\n}\n\nrunGame.call()\n",
        "safe": true
    },
    {
        "filename": "2048_109.txt",
        "content": "Score: 3016\n\n+------+------+------+------+\n| 2    | 8    | 2    | 4    | \n+------+------+------+------+\n| 16   | 64   | 128  | 2    | \n+------+------+------+------+\n| 8    | 256  | 4    | 8    | \n+------+------+------+------+\n| 2    | 4    | 2    | 32   | \n+------+------+------+------+\n\n\nGame Over!\n(N) New game (P) Exit: p\n",
        "safe": true
    },
    {
        "filename": "2048_11.txt",
        "content": "VERSION 1: \"Hopper\" flavour.\n",
        "safe": true
    },
    {
        "filename": "2048_110.txt",
        "content": "include c:\\cxpl\\codes;  \\intrinsic 'code' declarations\nint     Box(16), Moved;\n\nproc    ShiftTiles(I0, DI);     \\Shift tiles, add adjacents, shift again\nint     I0, DI;\nint     Done, M, N, I;\n[Done:= false;\nloop    [for M:= 1 to 3 do      \\shift all tiles in a single row or column\n            [I:= I0;\n            for N:= 1 to 3 do\n                [if Box(I)=0 & Box(I+DI)#0 then\n                        [Box(I):= Box(I+DI);  Box(I+DI):= 0;  Moved:= true];\n                I:= I+DI;\n                ];\n            ];\n        if Done then return;\n        Done:= true;\n        I:= I0;                 \\add identical adjacent tiles into a new tile\n        for N:= 1 to 3 do\n                [if Box(I)=Box(I+DI) & Box(I)#0 then\n                        [Box(I):= Box(I)+1;  Box(I+DI):= 0;  Moved:= true];\n                I:= I+DI;\n                ];\n        ];                      \\loop back to close any gaps that were opened\n];      \\ShiftTiles\n\nint     I, J, X, Y, C;\n[Clear;\nfor I:= 0 to 15 do Box(I):= 0;                  \\empty the box of tiles\nloop    [repeat I:= Ran(16) until Box(I)=0;     \\in a random empty location\n        Box(I):= if Ran(10) then 1 else 2;      \\insert a 2^1=2 or 2^2=4\n        for I:= 0 to 15 do                      \\show board with its tiles\n                [X:= ((I&3)+5)*6;               \\get coordinates of tile\n                 Y:= I>>2*3+6;\n                 Attrib(((Box(I)+1)&7)<<4 + $F);\\set color based on tile value\n                 for J:= 0 to 2 do              \\draw a square (6*8x3*16)\n                        [Cursor(X, Y+J);\n                        Text(6, \"      \");\n                        ];\n                 if Box(I)#0 then               \\box contains a tile\n                        [J:= 1;                 \\center numbers somewhat\n                        if Box(I) <= 9 then J:= 2;\n                        if Box(I) <= 3 then J:= 3;\n                        Cursor(X+J, Y+1);\n                        IntOut(6, 1<<Box(I));\n                        ];\n                ];\n        Moved:= false;                          \\a tile must move to continue\n        repeat  repeat C:= ChIn(1) until C#0;   \\get key scan code, or ASCII\n                for I:= 3 downto 0 do           \\for all rows or columns\n                        [case C of\n                          $4B:  ShiftTiles(I*4, 1);     \\left arrow\n                          $4D:  ShiftTiles(I*4+3, -1);  \\right arrow\n                          $50:  ShiftTiles(I+12, -4);   \\down arrow\n                          $48:  ShiftTiles(I, 4);       \\up arrow\n                          $1B:  [Clear;  exit]          \\Esc\n                        other   [];                     \\ignore all other keys\n                        ];\n        until   Moved;\n        ];\n]",
        "safe": true
    },
    {
        "filename": "2048_12.txt",
        "content": "#context-free select Position of aleatory tail\n#context-free show Table\n#context-free chek Winner or Game Over\n#context-free print Table structure\n#proto MovingRightDown(_X_)\n#proto MovingLeftUp(_X_)\n#proto checkPointLeftUp(_X_)\n#proto checkPointRightDown(_X_)\n#proto checkMoveRightDown(_X_)\n#proto checkMoveLeftUp(_X_)\n#define KUP        5\n#define KDOWN     24\n#define KLEFT     19\n#define KRIGHT     4\n#define KESCAPE   27\n#define MOVEHORZ   1\n#define MOVEVERT   0 \n#define equaltables(_X_,_Y_)   _I_=1,\\\n                               __LOOP_ROW__:,\\\n                                    _J_=1,\\\n                                    __LOOP_COL__:,\\\n                                        [_I_,_J_]get(_X_),get(_Y_),neq? do{{0},jmp(__OUT__LOOP__)},\\\n                                        ++_J_,{4,_J_}jle(__LOOP_COL__),\\\n                                    ++_I_,{4,_I_}jle(__LOOP_ROW__),\\\n                               {1},__OUT__LOOP__:,clear mark\n#include <hopper.h>\n\nmain:\n  .ctrl c\n  contador de movimientos=0\n  score=0\n  table=0,{4,4}zeros array(table)  // create table\n  oldTable=0, show Structure=1\n /* define initial positions */\n  {\"\"}tok sep\n  select Position of aleatory tail\n  select Position of aleatory tail\n  home\n  hide cursor\n  show Table\n  c=0, go=1,swFin=1\n\n /* game! */\n  __PLAY_GAME__:\n     \n     if key pressed?\n         lastkey(c)\n         oldTable = table\n         switch(c)\n            case(KRIGHT)\u00a0:: do{ _check Move Right Down(MOVEHORZ), exit }\n            case(KDOWN) \u00a0:: do{ _check Move Right Down(MOVEVERT), exit }\n            case(KLEFT) \u00a0:: do{ _check Move Left Up(MOVEHORZ),    exit }\n            case(KUP)   \u00a0:: do{ _check Move Left Up(MOVEVERT),    exit }\n            case(KESCAPE):: do{ go=0,swFin=0 }\n         end switch\n         kbfree\n         chek Winner or Game Over\n         {go}do{\n             if ( not( equal tables(oldTable, table) ) )\n                select Position  of aleatory tail\n                ++contador de movimientos\n             end if\n             show Table\n         }\n     end if\n     {go},jt(__PLAY_GAME__)\n\n     if ( {swFin} )\n        {\"          \\LG\",\"YOU WIN!!!\\OFF\"}\n     else\n        {\"          \\LR\",\"GAME OVER\\OFF\"}\n     end if\n     println\n     show cursor\nexit(0)\n\n.locals\nMoving Right Down(tmpTab)\n   {tmpTab} compact,ht=0,cpy(ht), length,{4}sub,sizet=0,mov(sizet)\n   clear(tmpTab),{sizet}zerosarray(tmpTab)\n   {ht,tmpTab}array(CONCAT)\n   {tmpTab}\nback\nMoving Left Up(tmpTab)\n   {tmpTab} compact,clear(tmpTab),cpy(tmpTab), length,{4}sub,sizet=0,mov(sizet)\n   {sizet}zero?,not,do{ ht=0,{sizet}zerosarray(ht)\n   {ht,tmpTab}array(CONCAT) }\n   {tmpTab}\nback\ncheck Point Right Down(tmpTab)\n  v1=0,v2=0,tScore=0,totScore=0\n  for(k=4,{k}gthan(1),--k)\n     [k]get(tmpTab),mov(v1)\n     [{k}minus(1)]get(tmpTab),mov(v2)\n     if( {v1} eqto (v2) )\n         {v1,v2}add,cpy(tScore),[k]put(tmpTab),[{k}minus(1)]{0}put(tmpTab)\n         {tScore}plus(totScore),mov(totScore)\n     end if\n  next\n  {tmpTab,totScore}\nback\ncheck Move Right Down (_DIRECTION_)\n  tmpTab=0\n  for(i=1,{i}lethan(4),++i)\n    if ( {_DIRECTION_} )    // rows or cols??\n       [i,1:4]   // rows!\n    else\n       [1:4,i]   // cols!\n    end if\n    get(table), mov(tmpTab)\n    \n    if( {tmpTab}stats(SUMMATORY) )     // exist numbers in the row??\n       clear mark\n       _Moving Right Down(tmpTab),mov(tmpTab)    // move its!\n       clear mark\n       _check Point Right Down(tmpTab),plus(score),mov(score)  // check score...\n       mov(tmpTab)\n       _Moving Right Down(tmpTab),mov(tmpTab)   // move remanents!\n       if( {_DIRECTION_} )\n          [i,1:4]\n       else\n          [1:4,i]\n       end if\n       {tmpTab}, put(table)\n    end if\n  next\n  clear mark.\nback\n\ncheck Point Left Up(tmpTab)\n  v1=0,v2=0,tScore=0,totScore=0\n  for(k=1,{k}lthan(4),++k)\n     [k]get(tmpTab),mov(v1)\n     [{k}plus(1)]get(tmpTab),mov(v2)\n     if( {v1} eqto (v2) )\n        {v1,v2}add,cpy(tScore),[k]put(tmpTab),[{k}plus(1)]{0}put(tmpTab)\n        {tScore}plus(totScore),mov(totScore)\n     end if\n  next\n  {tmpTab,totScore}\nback\n\ncheck Move Left Up(_DIRECTION_)\n  tmpTab=0 \n  for(i=1,{i}lethan(4),++i)\n    if( {_DIRECTION_} )\n       [i,1:4]\n    else \n       [1:4,i]\n    end if\n    get(table),mov(tmpTab)\n    if( {tmpTab}stats(SUMMATORY) )  // exist numbers in the row??\n       clear mark\n       _Moving Left Up(tmpTab),mov(tmpTab)  // move its!\n       clear mark\n       _check Point Left Up(tmpTab),plus(score),mov(score)  // check score...\n       mov(tmpTab)\n       _Moving Left Up(tmpTab),mov(tmpTab)  // move remanents!\n       if( {_DIRECTION_} )\n          [i,1:4]\n       else\n          [1:4,i]\n       end if\n       {tmpTab},put(table)\n    end if\n  next\n  clear mark.\nback\n\nchek Winner or Game Over:\n  {table}gthan(0),xtonum,stats(SUMMATORY),{16} eq? do{{0}mov(go),{0}mov(swFin),back}  // You loose!\n  {0}reshape(table),{2048,table}array(SCAN){0} neq? do{{0}mov(go),back}   // you Win!\n  {4,4}reshape(table)\nback\n\nselect Position of aleatory tail:\n  prec(-1)\n  __NO_VALID_POS__:\n     {10}rand, mulby(10),ceil,module(5),x=0,cpy(x),zero?,do{x=1}\n     {10}rand, mulby(10),ceil,module(5),y=0,cpy(y),zero?,do{y=1}\n     [x,y]get(table),jnz(__NO_VALID_POS__)\n  newTail=2\n  {1}rand,gthan(0.9), do{ newTail=4 }\n  {newTail},put(table), clear mark.\n  prec(0)\nback\n\nshow Table:\n  tmpTable=0\n  {\" \",6,table}xtostr,padcenter,mov(tmpTable)\n // prepare colours of tiles\n  {\"\\BGLGR\\BK      \\OFF\",\"  0   \",tmpTable}   transform, mov(tmpTable)\n  {\"\\BGLGR\\BK  2   \\OFF\",\"  2   \",tmpTable}   transform, mov(tmpTable)\n  {\"\\BGLGR\\B  4   \\OFF\",\"  4   \",tmpTable}    transform, mov(tmpTable)\n  {\"\\BGLGR\\B  8   \\OFF\",\"  8   \",tmpTable}    transform, mov(tmpTable)\n  {\"\\BGR\\W  16  \\OFF\",\"  16  \",tmpTable}      transform, mov(tmpTable)\n  {\"\\BGY\\BK  32  \\OFF\",\"  32  \",tmpTable}     transform, mov(tmpTable)\n  {\"\\BGB\\W  64  \\OFF\",\"  64  \",tmpTable}      transform, mov(tmpTable)\n  {\"\\BGLM\\BK 128  \\OFF\",\" 128  \",tmpTable}    transform, mov(tmpTable)\n  {\"\\BGG\\W 256  \\OFF\",\" 256  \",tmpTable}      transform, mov(tmpTable)\n  {\"\\BGB\\W 512  \\OFF\",\" 512  \",tmpTable}      transform, mov(tmpTable)  \n  {\"\\BGR\\W 1024 \\OFF\",\" 1024 \",tmpTable}      transform, mov(tmpTable)\n  {\"\\BGBK\\W\\ENF 2048 \\OFF\",\" 2048 \",tmpTable} transform, mov(tmpTable)\n\n // and PRINT!!\n  {show Structure} do{ print Table structure,{0} mov(show Structure) }\n\n  clear mark\n  scrx=2\n  for (i=1, {i}lethan(4),++i)\n        {2,scrx}goxy,[1,i]get(tmpTable),print\n        {4,scrx}goxy,[2,i]get(tmpTable),print\n        {6,scrx}goxy,[3,i]get(tmpTable),print\n        {8,scrx}goxy,[4,i]get(tmpTable),print\n        clear mark\n        scrx += 7\n  next\n\n  {\"\\BGB\\W\\ENF\",\"\\n\\n\\t   2 0 4 8   \\OFF\\n\\n\"}\n  {\"Movimiento # \",contador de movimientos,\", \\INVSCORE=\",score,\"\\OFF\\n\"}//,tmpTable}\n  println\n\nback\n\nprint Table structure:\n  {\"\u250c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u2510\\n\"},strtoutf8,\n  {\"\u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502\\n\"},strtoutf8,\n  {\"\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\\n\"},strtoutf8,\n  {\"\u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502\\n\"},strtoutf8,\n  {\"\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\\n\"},strtoutf8,\n  {\"\u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502\\n\"},strtoutf8,\n  {\"\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\\n\"},strtoutf8,\n  {\"\u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502\\n\"},strtoutf8,\n  {\"\u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2518\"},strtoutf8,\n  println\nback",
        "safe": true
    },
    {
        "filename": "2048_13.txt",
        "content": "Begin play...\n\u250c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u2510\n\u2502      \u2502      \u2502  2   \u2502      \u2502\n\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\u2502  2   \u2502      \u2502      \u2502      \u2502\n\u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2518\n\t   2 0 4 8   \n\nMovimiento # 0, SCORE=0\n\n",
        "safe": true
    },
    {
        "filename": "2048_14.txt",
        "content": "Playing...\n\u250c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u2510\n\u2502      \u2502  2   \u2502      \u2502      \u2502\n\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\u2502      \u2502      \u2502  2   \u2502  4   \u2502\n\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\u2502      \u2502  2   \u2502  32  \u2502 128  \u2502\n\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\u2502      \u2502  8   \u2502  4   \u2502  16  \u2502\n\u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2518\n\t   2 0 4 8   \n\nMovimiento # 90, SCORE=940\n",
        "safe": true
    },
    {
        "filename": "2048_15.txt",
        "content": "Game Over...\n\u250c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u2510\n\u2502  2   \u2502  16  \u2502  2   \u2502  4   \u2502\n\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\u2502  4   \u2502 128  \u2502  4   \u2502  8   \u2502\n\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\u2502  16  \u2502  8   \u2502 512  \u2502  4   \u2502\n\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\u2502  2   \u2502  4   \u2502  32  \u2502  2   \u2502\n\u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2518\n\t   2 0 4 8   \n\nMovimiento # 347, SCORE=5040\n\n          GAME OVER\n$\n",
        "safe": true
    },
    {
        "filename": "2048_16.txt",
        "content": "VERSION 2: \"Hopper-BASIC\" flavour.\n",
        "safe": true
    },
    {
        "filename": "2048_17.txt",
        "content": "// Definicion de \"contextos\"\n#context-free select Position of aleatory tail\n   set Decimal (-1)\n   tSIZE=0, \n   Let( tSIZE\u00a0:= var(SIZE) Plus (1) )\n__NO_VALID_POS__:\n      x=0, y=0\n      When( Is Zero? ( Ceil( Rand(10) Mul by(10) ) Module (tSIZE)\u00a0\u00bb (x) )){ x = 1 }\n      When( Is Zero? ( Ceil( Rand(10) Mul by(10) ) Module (tSIZE)\u00a0\u00bb (y) )){ y = 1 }\n      At Interval [x,y], Get (table), Goto If Not Zero(__NO_VALID_POS__)\n   newTail=2\n   When ( Rand(1) Is Gt (0.9) ) { newTail=4 }\n   Take( newTail ), and SPut(table).\n   set Decimal(0)\n   Return\\\\\n\n#context-free check Winner or Game Over\n   When ( Summatory ( Val( var(table) Is Gt (0) ) ), Is Eq? ( var(SIZE) Mulby(SIZE) ) ) {\n      MStore( 0, go, swFin ), and Back // You loose!\n   }\n   ReDim( table, 0 )  // convierte en vector\n   When( Scan(1, 2048, table ) Is Not Eq? (0) ){\n      ReDim( table, SIZE, SIZE ), Let ( go:=0 ) and Back   // You Win!\n   }\n   ReDim( table, SIZE, SIZE )\n   Return\\\\\n\n#context-free show Table\n   tmpTable=0\n   Let ( tmpTable\u00a0:= CPad$(\" \", 6, Str$(table)) )\n   Let ( tmpTable\u00a0:= Tran$(\"\\BGLGR\\BK      \\OFF\",\"  0   \", tmpTable) )\n   Let ( tmpTable\u00a0:= Tran$(\"\\BGLGR\\BK  2   \\OFF\",\"  2   \", tmpTable) )\n   Let ( tmpTable\u00a0:= Tran$(\"\\BGLGR\\B  4   \\OFF\",\"  4   \", tmpTable) )\n   Let ( tmpTable\u00a0:= Tran$(\"\\BGLGR\\B  8   \\OFF\",\"  8   \", tmpTable) )\n   Let ( tmpTable\u00a0:= Tran$(\"\\BGR\\W  16  \\OFF\",\"  16  \", tmpTable) )\n   Let ( tmpTable\u00a0:= Tran$(\"\\BGY\\BK  32  \\OFF\",\"  32  \", tmpTable) )\n   Let ( tmpTable\u00a0:= Tran$(\"\\BGB\\W  64  \\OFF\",\"  64  \", tmpTable) )\n   Let ( tmpTable\u00a0:= Tran$(\"\\BGLM\\BK 128  \\OFF\",\" 128  \", tmpTable) )\n   Let ( tmpTable\u00a0:= Tran$(\"\\BGG\\W 256  \\OFF\",\" 256  \", tmpTable) )\n   Let ( tmpTable\u00a0:= Tran$(\"\\BGB\\W 512  \\OFF\",\" 512  \", tmpTable) )\n   Let ( tmpTable\u00a0:= Tran$(\"\\BGR\\W 1024 \\OFF\",\" 1024 \", tmpTable) )\n   Let ( tmpTable\u00a0:= Tran$(\"\\BGBK\\W\\ENF 2048 \\OFF\",\" 2048 \", tmpTable) )\n   When( show Structure ) { print Table structure, and Let ( show Structure\u00a0:= 0 ) }\n   Clear Mark\n   scrx=2\n   For (i=1, var(i) Is Le (SIZE), ++i)\n        Locate in Column (scrx)\n        Locate in Row (2), At Interval [1,i], Print( Get (tmpTable) )\n        Locate in Row (4), At Interval [2,i], Print( Get (tmpTable) )\n        Locate in Row (6), At Interval [3,i], Print( Get (tmpTable) )\n        Locate in Row (8), At Interval [4,i], Print( Get (tmpTable) )\n        When( var(SIZE) Is Ge? (5) ) {Locate in Row (10), At Interval [5,i], Print( Get (tmpTable) )}\n        When( var(SIZE) Is Ge? (6) ) {Locate in Row (12), At Interval [6,i], Print( Get (tmpTable) )}\n        scrx += 7\n   Next\n   Clear Mark\n   Take( \"\\BGB\\W\\ENF\",\"\\n\\n\\t   2 0 4 8   \\OFF\\n\\n\",\\\n         \"Movimiento # \",contador de movimientos,\", \\INVSCORE=\",score,\"\\OFF\\n\" )\n   and Print It\n   Return\\\\\n\n#context-free print Table structure\n   Locate (1,1)\n   If ( var(SIZE) Is Eq? (4) )\n      Str2Utf8$(\"\u250c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u2510\\n\")\n      Str2Utf8$(\"\u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502\\n\")\n      Str2Utf8$(\"\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\\n\")\n      Str2Utf8$(\"\u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502\\n\")\n      Str2Utf8$(\"\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\\n\")\n      Str2Utf8$(\"\u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502\\n\")\n      Str2Utf8$(\"\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\\n\")\n      Str2Utf8$(\"\u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502\\n\")\n      Str2Utf8$(\"\u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2518\")\n   Else If( var(SIZE) Is Eq? (5) )\n      Str2Utf8$(\"\u250c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u2510\\n\")\n      Str2Utf8$(\"\u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502\\n\")\n      Str2Utf8$(\"\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\\n\")\n      Str2Utf8$(\"\u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502\\n\")\n      Str2Utf8$(\"\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\\n\")\n      Str2Utf8$(\"\u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502\\n\")\n      Str2Utf8$(\"\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\\n\")\n      Str2Utf8$(\"\u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502\\n\")\n      Str2Utf8$(\"\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\\n\")\n      Str2Utf8$(\"\u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502\\n\")\n      Str2Utf8$(\"\u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2518\")\n   Else If( var(SIZE) Is Eq? (6) )\n      Str2Utf8$(\"\u250c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u2510\\n\")\n      Str2Utf8$(\"\u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502\\n\")\n      Str2Utf8$(\"\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\\n\")\n      Str2Utf8$(\"\u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502\\n\")\n      Str2Utf8$(\"\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\\n\")\n      Str2Utf8$(\"\u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502\\n\")\n      Str2Utf8$(\"\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\\n\")\n      Str2Utf8$(\"\u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502\\n\")\n      Str2Utf8$(\"\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\\n\")\n      Str2Utf8$(\"\u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502\\n\")\n      Str2Utf8$(\"\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\\n\")\n      Str2Utf8$(\"\u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502 2048 \u2502\\n\")\n      Str2Utf8$(\"\u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2518\")\n   End If\n   now Print It\n   Return\\\\\n\n// definicion de prototipos:\n#proto MovingRightDown(_X_)\n#proto MovingLeftUp(_X_)\n#proto checkPointLeftUp(_X_)\n#proto checkPointRightDown(_X_)\n#proto checkMoveRightDown(_X_)\n#proto checkMoveLeftUp(_X_)\n\n// definiciones varias:\n#define KUP        5\n#define KDOWN     24\n#define KLEFT     19\n#define KRIGHT     4\n#define KESCAPE   27\n#define MOVEHORZ   1\n#define MOVEVERT   0 \n\n// archivo de inclusi\u00f3n de macros H-BASIC:\n#include <hbasic.h>\n\nBegin\n  Option Ctrl+C\n  Option Stack 16\n  \n  contador de movimientos=0\n  score=0, SIZE=4\n  When( ArgCount, Is Eq? (2) ){ get ArgNumber(2,SIZE) }\n\n  If ( var(SIZE) Is Not Between?(4,includ,6,includ) )\n     Print(\"Usage: hopper 2048.bas [4(default)-6]\\n\")\n     Stop\n  End If\n  \n  Dim (SIZE,SIZE) for Zeros Array (table)\n\n  oldTable=0, show Structure=1\n /* define initial positions */\n  Token Sep(\"\")\n  select Position of aleatory tail\n  select Position of aleatory tail\n  Cls\n  Hide Cursor\n  show Table\n  c=0, go=1,swFin=1\n\n /* game! */\n  While ( go )\n     Let ( c:=GetCh )\n     oldTable = table\n     Switch(c)\n        Case(KRIGHT) { _check Move Right Down(MOVEHORZ), Exit }\n        Case(KDOWN)  { _check Move Right Down(MOVEVERT), Exit }\n        Case(KLEFT)  { _check Move Left Up(MOVEHORZ),    Exit }\n        Case(KUP)    { _check Move Left Up(MOVEVERT),    Exit }\n        Case(KESCAPE){ go=0, swFin=0 }\n     End Switch\n\n     check Winner or Game Over\n     When( go ){\n        If ( are Not EqArray? (oldTable, table) )  //( not( equal tables(oldTable, table) ) )\n           select Position  of aleatory tail\n           ++contador de movimientos\n        End If\n        show Table\n     }\n  Wend\n\n  If ( swFin )\n     show Table\n     Print(\"          \\LG\",\"YOU WIN!!!\\OFF\")\n  Else\n     Print(\"          \\LR\",\"GAME OVER\\OFF\")\n  End If\n  Put a Newl\n  Show Cursor\nEnd\n\nSubrutines\n\nMoving Right Down(tmpTab)\n   ht=0, sizet=0\n   Let( sizet\u00a0:= var(SIZE) Minus ( Length( Compact(tmpTab), Copy to (ht) ) ) )\n   If ( Is Not Zero?(sizet) )\n      Clear(tmpTab)\n      Dim (sizet) for Zeros Array (tmpTab)\n      Concat( ht,tmpTab )\n   End If\nReturn (tmpTab)\n\nMoving Left Up(tmpTab)\n   sizet=0\n   Compact( tmpTab ),Clear(tmpTab) and Copy to (tmpTab); get Length It, Subtracted from (SIZE); then Move to (sizet)\n   //When( Is Not Zero?(sizet) ){ \n   When( var(sizet) Is Not Zero? ){\n      ht=0\n      Dim (sizet) for Zeros Array (ht)\n      Concat( ht, tmpTab )\n   }\nReturn (tmpTab)\n\ncheck Point Right Down(tmpTab)\n  v1=0,v2=0,tScore=0,totScore=0\n  For(k=SIZE, var(k) Is Gt (1), --k)\n     Set Interval [k] and Get (tmpTab); then Move to (v1)\n     Set Interval [ var(k) Minus(1)], Get(tmpTab), and Move to (v2)\n     If( var(v1) Is Eq? (v2) )\n         Add(v1,v2), Copy to(tScore); \n         At Interval [k] Put(tmpTab)\n         At Interval [ var(k) Minus(1) ], now Take(0); then Put (tmpTab)\n         Let( totScore\u00a0:= var(tScore) Plus (totScore) )\n     End If\n  Next\n  Take(tmpTab,totScore) and Return \n\ncheck Move Right Down (_DIRECTION_)\n  tmpTab=0\n  For(i=1, while var(i) Is Le (SIZE), ++i)\n    If ( _DIRECTION_ )    // rows or cols??\n       Set Interval [i,1:SIZE]   // rows!\n    Else\n       Set Interval [1:SIZE,i]   // cols!\n    End If\n    now Let( tmpTab\u00a0:= Get(table) )\n    \n    If( Summatory ( tmpTab ) )     // exist numbers in the row??\n       Clear Mark\n       \n       Let( tmpTab\u00a0:= _Moving Right Down(tmpTab) )    // move its!\n       Clear Mark\n       Store ( _check Point Right Down(tmpTab) Plus (score), tmpTab, score )  // check score...\n       Clear Mark\n       Let ( tmpTab\u00a0:= _Moving Right Down(tmpTab) )   // move remanents!\n       If( _DIRECTION_ )\n          Set Interval [i,1:SIZE]\n       Else\n          Set Interval [1:SIZE,i]\n       End If\n       Take( tmpTab ), and Put(table)\n    End If\n  Next\n  Clear(tmpTab) and Clear Mark.\nReturn\n\ncheck Point Left Up(tmpTab)\n  v1=0,v2=0,tScore=0,totScore=0\n  For(k=1, while var(k) Is Lt (SIZE),++k)\n     At Interval [k] Get (tmpTab), and Move to (v1)\n     At Interval [ var(k) Plus(1) ] Get(tmpTab), and Move to (v2)\n     If( var(v1) Is Eq? (v2) )\n        Add(v1, v2),Copy to (tScore)\n        At Interval [k] Put(tmpTab), At Interval [ var(k) Plus(1)]; then Take(0) and Put(tmpTab)\n        Let( totScore\u00a0:= var(tScore) Plus (totScore) )\n     End If\n  Next\n  Take (tmpTab,totScore)\nReturn \n\ncheck Move Left Up(_DIRECTION_)\n  tmpTab=0 \n  For(i=1, while var(i) Is Le (SIZE),++i)\n    If( _DIRECTION_ )\n       Set Interval [i,1:SIZE]\n    Else \n       Set Interval [1:SIZE,i]\n    End If\n    now Get(table), and Move to (tmpTab)\n    If( Summatory (tmpTab) )  // exist numbers in the row??\n       Clear Mark\n       Let ( tmpTab\u00a0:= _Moving Left Up(tmpTab) )  // move its!\n       Clear Mark\n       Store ( _check Point Left Up(tmpTab) Plus (score), tmpTab, score )  // check score...\n\n       Clear Mark\n       Let ( tmpTab\u00a0:= _Moving Left Up(tmpTab) )  // move remanents!\n       If( _DIRECTION_ )\n          Set Interval [i,1:SIZE]\n       Else\n          Set Interval [1:SIZE,i]\n       End If\n       now Take (tmpTab), and Put(table)\n    End If\n  Next\n  Clear Mark.\nReturn",
        "safe": true
    },
    {
        "filename": "2048_18.txt",
        "content": "Se invoca como:\n\nrxvt -g 79x38 -fn \"xft:FantasqueSansMono-Regular:pixelsize=25\" -e hopper bas/2048.bas\n\n",
        "safe": true
    },
    {
        "filename": "2048_19.txt",
        "content": "PRINT \"Game 2048\"\n\n 10  REM  ************\n 20  REM  *   2024   *\n 30  REM  ************\n 40  HOME \n 100 W = 2: REM    **** W=0 FOR LOOSE W=1 FOR WIN W=2 FOR PLAYING ****  \n 110  DIM MA(4,4)\n 120 FC = 16: REM   FREECELLS \n 130 A$ = \"\":SC = 0:MT = 2\n 140  GOSUB 1000: DRAW THESCREEN\n 150  GOSUB 1500: REM  PRINT SCORE AND MAXTILE\n 160  GOSUB 1700: REM  BREED\n 170  GOSUB 2000: REM  PRINT SCORES IN THE MATRIX AND CALC FC AND MT\n 200  REM  ******************\n 210  REM  MAIN PROGRAM\n 220  REM  ******************\n 230  HTAB 38: VTAB 22\n 235  IF W < 2 THEN  GOTO 950: REM  ******* END GAME ********\n 240  WAIT  - 16384,128:A =  PEEK ( - 16384) - 128 - 68: POKE  - 16368,0\n 250  ON A GOTO 999,900,900,900,300,350,400,900,450\n 280  REM  ************************\n 285  REM  FOLLOWING LINES HANDLE THE UP, LEFT, RIGHT, DOWN, NOP, EXIT\n 290  REM  ************************  \n 300  GOSUB 2500: GOSUB 3500: GOSUB 2500: GOSUB 1700: GOSUB 2000: GOSUB 1\n     500\n 310  GOTO 200\n 350  GOSUB 2600: GOSUB 3600: GOSUB 2600: GOSUB 1700: GOSUB 2000: GOSUB 1\n     500\n 360  GOTO 200\n 400  GOSUB 2700: GOSUB 3700: GOSUB 2700: GOSUB 1700: GOSUB 2000: GOSUB 1\n     500\n 410  GOTO 200\n 450  GOSUB 2800: GOSUB 3800: GOSUB 2800: GOSUB 1700: GOSUB 2000: GOSUB 1\n     500\n 460  GOTO 200\n 900  GOTO 200\n 950  HOME\u00a0: VTAB 10\n 960  PRINT \"          ********************\"\n 970  IF W = 1 THEN  PRINT \"          *    YOU   WIN     *\"\n 980  IF W = 0 THEN  PRINT \"          *    YOU   LOOSE   *\"\n 990  PRINT \"          ********************\"\n 995  PRINT \"               SCORE  =\";SC\n 996  PRINT \"               MAXTILE=\";MT\n 999  END \n 1000  REM  DRAW FRAME + SCORE\n 1010  FOR I = 1 TO 5\n 1020  VTAB 1 + (I - 1) * 4: PRINT \"---------------------\"\n 1030  NEXT I\n 1040  FOR I = 1 TO 4\n 1050  FOR J = 1 TO 3\n 1060  VTAB 1 + (I - 1) * 4 + J: PRINT \"|    |    |    |    |\"\n 1070  NEXT J\n 1080  NEXT I\n 1090  HTAB 30: VTAB 3: PRINT \"I\";\n 1100  HTAB 30: VTAB 9: PRINT \"M\";\n 1110  HTAB 25: VTAB 6: PRINT \"J\";\n 1120  HTAB 35: VTAB 6: PRINT \"K\";\n 1130  HTAB 25: VTAB 12: PRINT \"E = END\"\n 1140  HTAB 25: VTAB 14: PRINT \"SCORE:\"\n 1150  HTAB 25: VTAB 16: PRINT \"MAXTILE:\"\n 1160  HTAB 1: VTAB 19: PRINT \"YOU CAN SLIDE  THE NUMBERS IN THE MATRIX\"\n 1170  HTAB 1: VTAB 20: PRINT \"BY PRESSING IJKM. WHEN MATCHING NUMBERS\"\n 1180  HTAB 1: VTAB 21: PRINT \"MEET THEY COMBINE IN THE SUM\"\n 1190  HTAB 1: VTAB 22: PRINT \"TO WIN YOU HAVE TO REACH THE SUM 2048\"\n 1200  RETURN \n 1500  REM  ***************\n 1501  REM  PRINT SCORE + MAXTILE\n 1502  REM  ***************\n 1510  VTAB 14: HTAB 32:\n 1520 SC$ =  STR$ (SC):LS =  LEN (SC$)\n 1530  FOR I = 1 TO 7 - LS: PRINT \" \";: NEXT I\n 1540  PRINT SC$\n 1550  VTAB 16: HTAB 34:\n 1560 MT$ =  STR$ (MT):LS =  LEN (MT$)\n 1570  FOR I = 1 TO 5 - LS: PRINT \" \";: NEXT I\n 1580  PRINT MT$\n 1590  IF SC = 2048 THEN W = 1: REM  ******** YOU WIN ********  \n 1690  RETURN \n 1700  REM  ****************\n 1701  REM  PUT A \"2\" IN A RANDOM EMPTY CELL\n 1702  REM  ****************\n 1708  IF FC = 0 THEN W = 0: GOTO 1800: REM  ***** YOU LOOSE *****\n 1710 K =  INT ( RND (1) * FC + 1)\n 1720 N = 0\n 1730  FOR I = 1 TO 4\n 1740  FOR J = 1 TO 4\n 1750  IF MA(I,J) = 0 THEN N = N + 1\n 1760  IF N = K THEN MA(I,J) = 2:FC = FC - 1:I = 4:J = 4\n 1780  NEXT J\n 1790  NEXT I\n 1800  RETURN \n 2000  REM  *************\n 2001  REM  WRITE THE CELL CONTENT AND CALC. FREECELLS AND MAXTILE\n 2002  REM  *************\n 2005 FC = 0:MT = 0: REM   INITIALIZE FREECELLS AND MAXTILES  \n 2010  FOR I = 1 TO 4\n 2020  FOR J = 1 TO 4\n 2030  HTAB 2 + (J - 1) * 5: VTAB 3 + (I - 1) * 4\n 2040  PRINT \"    \";: HTAB 2 + (J - 1) * 5\n 2050  IF MA(I,J) = 0 THEN FC = FC + 1: GOTO 2060\n 2055  PRINT MA(I,J);\n 2060  IF MA(I,J) > MT THEN MT = MA(I,J)\n 2090  NEXT J\n 2100  NEXT I\n 2190  RETURN \n 2500  REM  *****************\n 2510  REM   COMPACT UP - KIND OF BUBBLE SORT\n 2520  REM  *****************\n 2530  FOR J = 1 TO 4\n 2540  FOR K = 3 TO 1 STEP  - 1\n 2550  FOR I = 1 TO K\n 2560  IF MA(I,J) = 0 THEN MA(I,J) = MA(I + 1,J):MA(I + 1,J) = 0\n 2570  NEXT\u00a0: NEXT\u00a0: NEXT \n 2590  RETURN \n 2600  REM  ************\n 2610  REM  COMPACT LEFT\n 2620  REM  ************\n 2630  FOR I = 1 TO 4\n 2640  FOR K = 3 TO 1 STEP  - 1\n 2650  FOR J = 1 TO K\n 2660  IF MA(I,J) = 0 THEN MA(I,J) = MA(I,J + 1):MA(I,J + 1) = 0\n 2670  NEXT\u00a0: NEXT\u00a0: NEXT \n 2690  RETURN \n 2700  REM   ************\n 2710  REM   COMPACT RIGHT\n 2720  REM   ************\n 2730  FOR I = 1 TO 4\n 2740  FOR K = 2 TO 4\n 2750  FOR J = 4 TO K STEP  - 1\n 2760  IF MA(I,J) = 0 THEN MA(I,J) = MA(I,J - 1):MA(I,J - 1) = 0\n 2770  NEXT\u00a0: NEXT\u00a0: NEXT \n 2790  RETURN \n 2800  REM   *****************  \n 2810  REM    COMPACT DOWN\n 2820  REM   *****************  \n 2830  FOR J = 1 TO 4\n 2840  FOR K = 2 TO 4\n 2850  FOR I = 4 TO K STEP  - 1\n 2860  IF MA(I,J) = 0 THEN MA(I,J) = MA(I - 1,J):MA(I - 1,J) = 0\n 2870  NEXT\u00a0: NEXT\u00a0: NEXT \n 2890  RETURN \n 3500  REM  ***************\n 3510  REM  ADD UP\n 3520  REM  ***************\n 3530  FOR J = 1 TO 4\n 3540  FOR I = 1 TO 3\n 3550  IF MA(I,J) = MA(I + 1,J) THEN MA(I,J) = MA(I,J) * 2:MA(I + 1,J) = \n     0:SC = SC + MA(I,J)\n 3560  NEXT\u00a0: NEXT \n 3590  RETURN \n 3600  REM  **************\n 3610  REM  SUM LEFT\n 3620  REM  **************\n 3630  FOR I = 1 TO 4\n 3640  FOR J = 1 TO 3\n 3650  IF MA(I,J) = MA(I,J + 1) THEN MA(I,J) = MA(I,J) * 2:MA(I,J + 1) = \n     0:SC = SC + MA(I,J)\n 3660  NEXT\u00a0: NEXT \n 3690  RETURN \n 3700  REM  **************\n 3710  REM  SUM RIGHT\n 3720  REM  **************\n 3730  FOR I = 1 TO 4\n 3740  FOR J = 4 TO 2 STEP  - 1\n 3750  IF MA(I,J) = MA(I,J - 1) THEN MA(I,J) = MA(I,J) * 2:MA(I,J - 1) = \n     0:SC = SC + MA(I,J)\n 3760  NEXT\u00a0: NEXT \n 3790  RETURN \n 3800  REM   *************** \n 3810  REM   ADD DOWN\n 3820  REM   ***************  \n 3830  FOR J = 1 TO 4\n 3840  FOR I = 4 TO 2 STEP  - 1\n 3850  IF MA(I,J) = MA(I - 1,J) THEN MA(I,J) = MA(I,J) * 2:MA(I - 1,J) = \n     0:SC = SC + MA(I,J)\n 3860  NEXT\u00a0: NEXT \n 3890  RETURN \n\n-----\nit runs somehow slowly but still fun to play. The only non standard basic is the input routine which reads directly the memory location (line 240) instead of using \"input\" od \"get\" \n\n---------------------\n|    |    |    |    |\n|4   |    |    |2   |        I\n|    |    |    |    |\n---------------------\n|    |    |    |    |   J         K\n|4   |2   |    |    |\n|    |    |    |    |\n---------------------        M\n|    |    |    |    |\n|2   |16  |4   |    |\n|    |    |    |    |   E = END\n---------------------\n|    |    |    |    |   SCORE:    4924\n|128 |512 |    |    |\n|    |    |    |    |   MAXTILE:   512\n---------------------\n\nYOU CAN SLIDE  THE NUMBERS IN THE MATRIX\nBY PRESSING IJKM. WHEN MATCHING NUMBERS\nMEET THEY COMBINE IN THE SUM\nTO WIN YOU HAVE TO REACH THE SUM 2048",
        "safe": true
    },
    {
        "filename": "2048_2.txt",
        "content": "               ......[4][4] \n",
        "safe": true
    },
    {
        "filename": "2048_20.txt",
        "content": "/* ARM assembly Raspberry PI  */\n/*  program 2048.s   */ \n\n/* REMARK 1\u00a0: this program use routines in a include file \n   see task Include a file language arm assembly \n   for the routine affichageMess conversion10 \n   see at end of this program the instruction include */\n/* for constantes see task include a file in arm assembly */\n/************************************/\n/* Constantes                       */\n/************************************/\n.include \"../constantes.inc\"\n.equ STDIN,      0    @ Linux input console\n.equ READ,       3    @ Linux syscall\n.equ SIZE,       4       \n.equ TOTAL,      2048\n.equ BUFFERSIZE, 80\n\n.equ IOCTL,     0x36  @ Linux syscall\n.equ SIGACTION, 0x43  @ Linux syscall\n.equ SYSPOLL,   0xA8  @ Linux syscall\n \n.equ TCGETS,    0x5401\n.equ TCSETS,    0x5402\n.equ ICANON,    2\n.equ ECHO,     10\n.equ POLLIN,    1\n \n.equ SIGINT,   2      @ Issued if the user sends an interrupt signal (Ctrl + C)\n.equ SIGQUIT,  3      @ Issued if the user sends a quit signal (Ctrl + D)\n.equ SIGTERM, 15      @ Software termination signal (sent by kill by default)\n.equ SIGTTOU, 22\n\n/*******************************************/\n/* Structures                               */\n/********************************************/\n/* structure termios see doc linux*/\n    .struct  0\nterm_c_iflag:                    @ input modes\n    .struct  term_c_iflag + 4 \nterm_c_oflag:                    @ output modes\n    .struct  term_c_oflag + 4 \nterm_c_cflag:                    @ control modes\n    .struct  term_c_cflag + 4 \nterm_c_lflag:                    @ local modes\n    .struct  term_c_lflag + 4 \nterm_c_cc:                       @ special characters\n    .struct  term_c_cc + 20      @ see length if necessary \nterm_fin:\n \n/* structure sigaction see doc linux */\n    .struct  0\nsa_handler:\n    .struct  sa_handler + 4 \nsa_mask:\n    .struct  sa_mask + 4 \nsa_flags:\n    .struct  sa_flags + 4 \nsa_sigaction:\n    .struct  sa_sigaction + 4 \nsa_fin:\n \n/* structure poll see doc linux */\n    .struct  0\npoll_fd:                            @   File Descriptor\n    .struct  poll_fd + 4 \npoll_events:                        @  events mask\n    .struct  poll_events + 4 \npoll_revents:                       @ events returned\n    .struct  poll_revents + 4 \npoll_fin:\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nszMessOK:           .asciz \"Bravo\u00a0!! You win. \\n\"\nszMessNotOK:        .asciz \"You lost\u00a0!! \\n\"\nszMessNewGame:      .asciz \"New game (y/n)\u00a0? \\n\"\nszMessErreur:       .asciz \"Error detected.\\n\"\nszCarriageReturn:   .asciz \"\\n\"\n//szMessMovePos:             .asciz \"\\033[00;00H\"\nszMess0:            .asciz \"      \"\nszMess2:            .asciz \"   2  \"\nszMess4:            .asciz \"   4  \"\nszMess8:            .asciz \"   8  \"\nszMess16:           .asciz \"  16  \"\nszMess32:           .asciz \"  32  \"\nszMess64:           .asciz \"  64  \"\nszMess128:          .asciz \" 128  \"\nszMess256:          .asciz \" 256  \"\nszMess512:          .asciz \" 512  \"\nszMess1024:         .asciz \" 1024 \"\nszMess2048:         .asciz \" 2048 \"\nszClear1:           .byte 0x1B \n                    .byte 'c'           @ other console clear\n                    .byte 0\n\nszLineH:            .asciz \"-----------------------------\\n\"\nszLineV:            .asciz \"|\"\nszLineVT:           .asciz \"|      |      |      |      |\\n\"\n.align 4\niGraine:            .int 123456\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\n.align 4\nsZoneConv:      .skip 24\nsBuffer:        .skip BUFFERSIZE\niTbCase:        .skip 4 * SIZE * SIZE\niEnd:           .skip 4                        @ 0 loop  1 = end loop\niTouche:        .skip 4                        @ value key pressed\nstOldtio:       .skip term_fin                 @ old terminal state\nstCurtio:       .skip term_fin                 @ current terminal state\nstSigAction:    .skip sa_fin                   @ area signal structure\nstSigAction1:   .skip sa_fin\nstPoll1:        .skip poll_fin                 @ area poll structure\nstPoll2:        .skip poll_fin\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                 @ entry of program \n    \n1:                                    @ begin game loop\n    ldr r0,iAdrszClear1\n    bl affichageMess\n    bl razTable\n2:\n    bl addDigit   \n    cmp r0,#-1\n    beq 5f                            @ end game\n    bl displayGame\n3:\n    bl readKey\n    cmp r0,#-1\n    beq 100f                          @ error or control-c\n    bl keyMove\n    cmp r0,#0\n    beq 3b                            @ no change -> loop\n    cmp r0,#2                         @ last addition = 2048\u00a0?\n    beq 4f\n    cmp r0,#-1                        @ quit\u00a0?\n    bne 2b                            @ loop\n    \n    b 10f\n4:                                    @ last addition = 2048 \n    ldr r0,iAdrszMessOK\n    bl affichageMess\n    b 10f\n5:                                    @ display message no solution\n    ldr r0,iAdrszMessNotOK\n    bl affichageMess\n\n10:                                   @ display new game\u00a0?\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess\n    ldr r0,iAdrszMessNewGame\n    bl affichageMess\n    bl readKey\n    ldr r0,iAdriTouche\n    ldrb r0,[r0]\n    cmp r0,#'y'\n    beq 1b\n    cmp r0,#'Y'\n    beq 1b\n    \n100:                                  @ standard end of the program \n    mov r0, #0                        @ return code\n    mov r7, #EXIT                     @ request to exit program\n    svc #0                            @ perform the system call\n \niAdrszCarriageReturn:     .int szCarriageReturn\niAdrszMessNotOK:          .int szMessNotOK\niAdrszMessOK:             .int szMessOK\niAdrszMessNewGame:        .int szMessNewGame\niAdrsZoneConv:            .int sZoneConv\niAdrszClear1:             .int szClear1\n/******************************************************************/\n/*     raz table cases                                                   */ \n/******************************************************************/\nrazTable:\n    push {r0-r2,lr}                  @ save  registers\n    ldr r1,iAdriTbCase\n    mov r0,#0\n    mov r2,#0\n1:\n    str r0,[r1,r2,lsl #2]\n    add r2,r2,#1\n    cmp r2,#SIZE * SIZE\n    blt 1b\n100:\n    pop {r0-r2,lr}                   @ restaur registers \n    bx lr                            @return\n/******************************************************************/\n/*     key move                                                   */ \n/******************************************************************/\n/* r0 contains key value               */\nkeyMove:\n    push {r1,lr}                  @ save  registers\n    cmp r0,#0x42                  @ down arrow \n    bne 1f\n    bl moveDown\n    b 100f\n1:\n    cmp r0,#0x41                  @ high arrow\n    bne 2f\n    bl moveUp\n    b 100f\n2:\n    cmp r0,#0x43                  @ right arrow\n    bne 3f\n    bl moveRight\n    b 100f\n3:\n    cmp r0,#0x44                  @ left arrow\n    bne 4f\n    bl moveLeft\n    b 100f\n4:\n    ldr r0,iAdriTouche\n    ldrb r0,[r0]\n    cmp r0,#'q'                   @ quit game\n    bne 5f\n    mov r0,#-1\n    b 100f\n5:\n    cmp r0,#'Q'                   @ quit game\n    bne 100f\n    mov r0,#-1\n    b 100f\n\n100:\n    pop {r1,lr}                   @ restaur registers \n    bx lr                         @return\n/******************************************************************/\n/*           move left                                   */ \n/******************************************************************/\n/* r0 return -1 if ok     */\nmoveLeft:\n    push {r1-r10,lr}            @ save registers\n    ldr r1,iAdriTbCase\n    mov r0,#0                   @ top move Ok\n    mov r2,#0                   @ line indice\n1:\n    mov r6,#0                   @ counter empty case\n    mov r7,#0                   @ first digit\n    mov r10,#0                  @ last digit to add\n    mov r3,#0                   @ column indice\n2:\n    lsl r5,r2,#2                @ change this if size <> 4\n    add r5,r5,r3                @ compute table indice\n    ldr r4,[r1,r5,lsl #2]\n    cmp r4,#0\n    addeq r6,r6,#1              @ positions vides\n    beq 5f\n    cmp r6,#0\n    beq 3f                      @ no empty left case\n    mov r8,#0\n    str r8,[r1,r5,lsl #2]       @ raz digit\n    sub r5,r5,r6\n    str r4,[r1,r5,lsl #2]       @ and store to left empty position\n    mov r0,#1                   @ move Ok\n    //sub r6,r6,#1\n3:\n    cmp r7,#0                   @ first digit\n    beq 4f\n    cmp r10,r4                  @ prec digit have to add \n    beq 4f\n    sub r8,r5,#1                @ prec digit \n    ldr r9,[r1,r8,lsl #2]\n    cmp r4,r9                   @ equal\u00a0?\n    bne 4f\n    mov r10,r4                  @ save digit \n    add r4,r4,r9                @ yes -> add\n    str r4,[r1,r8,lsl #2]\n    cmp r4,#TOTAL\n    moveq r0,#2\n    beq 100f\n    mov r4,#0\n    str r4,[r1,r5,lsl #2]\n    add r6,r6,#1                @ empty case + 1\n    mov r0,#1                   @ move Ok\n4:\n    add r7,r7,#1                @ no first digit\n\n5:                              @ and loop\n    add r3,r3,#1\n    cmp r3,#SIZE\n    blt 2b\n    add r2,r2,#1\n    cmp r2,#SIZE\n    blt 1b\n100:\n    pop {r1-r12,lr}\n    bx lr                       @ return \n/******************************************************************/\n/*           move right                                   */ \n/******************************************************************/\n/* r0 return -1 if ok     */\nmoveRight:\n    push {r1-r5,lr}                @ save registers\n    ldr r1,iAdriTbCase\n    mov r0,#0\n    mov r2,#0\n1:\n    mov r6,#0\n    mov r7,#0\n    mov r10,#0\n    mov r3,#SIZE-1\n2:\n    lsl r5,r2,#2                  @ change this if size <> 4\n    add r5,r5,r3\n    ldr r4,[r1,r5,lsl #2]\n    cmp r4,#0\n    addeq r6,r6,#1                @ positions vides\n    beq 5f\n\n    cmp r6,#0\n    beq 3f                      @ no empty right case\n    mov r0,#0\n    str r0,[r1,r5,lsl #2]       @ raz digit\n    add r5,r5,r6\n    str r4,[r1,r5,lsl #2]       @ and store to right empty position\n    mov r0,#1\n3:\n    cmp r7,#0                   @ first digit\n    beq 4f\n    add r8,r5,#1                @ next digit \n    ldr r9,[r1,r8,lsl #2]\n    cmp r4,r9                   @ equal\u00a0?\n    bne 4f\n    cmp r10,r4\n    beq 4f\n    mov r10,r4\n    add r4,r4,r9                @ yes -> add\n    str r4,[r1,r8,lsl #2]\n    cmp r4,#TOTAL\n    moveq r0,#2\n    beq 100f\n    mov r4,#0\n    str r4,[r1,r5,lsl #2]\n    add r6,r6,#1                @ empty case + 1\n    mov r0,#1\n4:\n    add r7,r7,#1                @ no first digit\n\n5:                              @ and loop\n    sub r3,r3,#1\n    cmp r3,#0\n    bge 2b\n    add r2,r2,#1\n    cmp r2,#SIZE\n    blt 1b\n    \n100:\n    pop {r1-r5,lr}\n    bx lr                          @ return \n/******************************************************************/\n/*           move down                                   */ \n/******************************************************************/\n/* r0 return -1 if ok     */\nmoveDown:\n    push {r1-r5,lr}                @ save registers\n    ldr r1,iAdriTbCase\n    mov r0,#0\n    mov r3,#0\n1:\n    mov r6,#0\n    mov r7,#0\n    mov r10,#0\n    mov r2,#SIZE-1\n2:\n    lsl r5,r2,#2                  @ change this if size <> 4\n    add r5,r5,r3\n    ldr r4,[r1,r5,lsl #2]\n    cmp r4,#0\n    addeq r6,r6,#1                @ positions vides\n    beq 5f\n    cmp r6,#0\n    beq 3f                      @ no empty right case\n    mov r0,#0\n    str r0,[r1,r5,lsl #2]       @ raz digit\n    lsl r0,r6,#2\n    add r5,r5,r0\n    str r4,[r1,r5,lsl #2]       @ and store to right empty position\n    mov r0,#1\n3:\n    cmp r7,#0                   @ first digit\n    beq 4f\n    add r8,r5,#SIZE                @ down digit \n    ldr r9,[r1,r8,lsl #2]\n    cmp r4,r9                   @ equal\u00a0?\n    bne 4f\n    cmp r10,r4\n    beq 4f\n    mov r10,r4\n    add r4,r4,r9                @ yes -> add\n    str r4,[r1,r8,lsl #2]\n    cmp r4,#TOTAL\n    moveq r0,#2\n    beq 100f\n    mov r4,#0\n    str r4,[r1,r5,lsl #2]\n    add r6,r6,#1                @ empty case + 1\n    mov r0,#1\n4:\n    add r7,r7,#1                   @ no first digit\n\n5:                           @ and loop\n    sub r2,r2,#1\n    cmp r2,#0\n    bge 2b\n    add r3,r3,#1\n    cmp r3,#SIZE\n    blt 1b\n\n100:\n    pop {r1-r5,lr}\n    bx lr                          @ return \n/******************************************************************/\n/*           move up                                   */ \n/******************************************************************/\n/* r0 return -1 if ok     */\nmoveUp:\n    push {r1-r5,lr}                @ save registers\n    ldr r1,iAdriTbCase\n    mov r0,#0\n    mov r3,#0\n1:\n    mov r6,#0\n    mov r7,#0\n    mov r10,#0\n    mov r2,#0\n2:\n    lsl r5,r2,#2                  @ change this if size <> 4\n    add r5,r5,r3\n    ldr r4,[r1,r5,lsl #2]\n    cmp r4,#0\n    addeq r6,r6,#1                @ positions vides\n    beq 5f\n    cmp r6,#0\n    beq 3f                      @ no empty right case\n    mov r0,#0\n    str r0,[r1,r5,lsl #2]       @ raz digit\n    lsl r0,r6,#2\n    sub r5,r5,r0\n    str r4,[r1,r5,lsl #2]       @ and store to right empty position\n    mov r0,#1\n3:\n    cmp r7,#0                   @ first digit\n    beq 4f\n    sub r8,r5,#SIZE             @ up digit \n    ldr r9,[r1,r8,lsl #2]\n    cmp r4,r9                   @ equal\u00a0?\n    bne 4f\n    cmp r10,r4\n    beq 4f\n    mov r10,r4\n    add r4,r4,r9                @ yes -> add\n    str r4,[r1,r8,lsl #2]\n    cmp r4,#TOTAL\n    moveq r0,#2\n    beq 100f\n    mov r4,#0\n    str r4,[r1,r5,lsl #2]\n    add r6,r6,#1                @ empty case + 1\n    mov r0,#1\n4:\n    add r7,r7,#1                @ no first digit\n\n5:                              @ and loop\n    add r2,r2,#1\n    cmp r2,#SIZE\n    blt 2b\n    add r3,r3,#1\n    cmp r3,#SIZE\n    blt 1b\n\n100:\n    pop {r1-r5,lr}\n    bx lr                          @ return \n/******************************************************************/\n/*           add new digit on game                                   */ \n/******************************************************************/\n/* r0 return -1 if ok     */\naddDigit:\n    push {r1-r5,lr}                @ save registers\n    sub sp,#4 * SIZE*SIZE\n    mov fp,sp\n    \n    mov r0,#100\n    bl genereraleas\n    cmp r0,#10\n    movlt r5,#4\n    movge r5,#2\n    ldr r1,iAdriTbCase\n    mov r3,#0\n    mov r4,#0\n1:  \n    ldr r2,[r1,r3,lsl #2]\n    cmp r2,#0\n    bne 2f\n    str r3,[fp,r4,lsl #2]\n    add r4,r4,#1\n2:\n    add r3,r3,#1\n    cmp r3,#SIZE*SIZE\n    blt 1b\n    cmp r4,#0              @ no empty case\n    moveq r0,#-1\n    beq 100f\n    cmp r4,#1             \n    bne 3f\n    ldr r2,[fp]            @ one case\n    str r5,[r1,r2,lsl #2]\n    mov r0,#0\n    b 100f\n3:                         @ multiple case\n    sub r0,r4,#1\n    bl genereraleas\n    ldr r2,[fp,r0,lsl #2]\n    str r5,[r1,r2,lsl #2]\n    mov r0,#0\n    \n100:\n    add sp,#4*  (SIZE*SIZE)    @ stack alignement\n    pop {r1-r5,lr}\n    bx lr                      @ return \niAdriTbCase:         .int iTbCase\n/******************************************************************/\n/*            display game                                      */ \n/******************************************************************/\ndisplayGame:\n    push {r1-r3,lr}            @ save registers\n    ldr r0,iAdrszClear1\n    bl affichageMess\n    ldr r0,iAdrszLineH\n    bl affichageMess\n    ldr r0,iAdrszLineVT\n    bl affichageMess\n    ldr r0,iAdrszLineV\n    bl affichageMess\n    ldr r1,iAdriTbCase\n    mov r2,#0\n1:\n    ldr r0,[r1,r2,lsl #2]\n    bl digitString\n    bl affichageMess\n    ldr r0,iAdrszLineV\n    bl affichageMess\n    add r2,r2,#1\n    cmp r2,#SIZE\n    blt 1b\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess\n    ldr r0,iAdrszLineVT\n    bl affichageMess\n    ldr r0,iAdrszLineH\n    bl affichageMess\n    ldr r0,iAdrszLineVT\n    bl affichageMess\n    ldr r0,iAdrszLineV\n    bl affichageMess\n2:\n    ldr r0,[r1,r2,lsl #2]\n    bl digitString\n    bl affichageMess\n    ldr r0,iAdrszLineV\n    bl affichageMess\n    add r2,r2,#1\n    cmp r2,#SIZE*2\n    blt 2b\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess\n    ldr r0,iAdrszLineVT\n    bl affichageMess\n    ldr r0,iAdrszLineH\n    bl affichageMess\n    ldr r0,iAdrszLineVT\n    bl affichageMess\n    ldr r0,iAdrszLineV\n    bl affichageMess\n3:\n    ldr r0,[r1,r2,lsl #2]\n    bl digitString\n    bl affichageMess\n    ldr r0,iAdrszLineV\n    bl affichageMess\n    add r2,r2,#1\n    cmp r2,#SIZE*3\n    blt 3b\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess\n    ldr r0,iAdrszLineVT\n    bl affichageMess\n    ldr r0,iAdrszLineH\n    bl affichageMess\n    ldr r0,iAdrszLineVT\n    bl affichageMess\n    ldr r0,iAdrszLineV\n    bl affichageMess\n4:\n    ldr r0,[r1,r2,lsl #2]\n    bl digitString\n    bl affichageMess\n    ldr r0,iAdrszLineV\n    bl affichageMess\n    add r2,r2,#1\n    cmp r2,#SIZE*4\n    blt 4b\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess\n    ldr r0,iAdrszLineVT\n    bl affichageMess\n    ldr r0,iAdrszLineH\n    bl affichageMess\n\n100:\n    pop {r1-r3,lr}\n    bx lr                       @ return \niAdrszLineH:         .int szLineH\niAdrszLineV:         .int szLineV\niAdrszLineVT:        .int szLineVT\n//iAdrszMessMovePos:   .int szMessMovePos\n/******************************************************************/\n/*            digits string                                       */ \n/******************************************************************/\n/* r0 contains number */\n/* r0 return address string */\ndigitString:\n    push {r1,lr}        @ save registers\n    cmp r0,#0\n    bne 1f\n    ldr r0,iAdrszMess0\n    b 100f\n1:\n    cmp r0,#2\n    bne 2f\n    ldr r0,iAdrszMess2\n    b 100f\n2:\n    cmp r0,#4\n    bne 3f\n    ldr r0,iAdrszMess4\n    b 100f\n3:\n    cmp r0,#8\n    bne 4f\n    ldr r0,iAdrszMess8\n    b 100f\n4:\n    cmp r0,#16\n    bne 5f\n    ldr r0,iAdrszMess16\n    b 100f\n5:\n    cmp r0,#32\n    bne 6f\n    ldr r0,iAdrszMess32\n    b 100f\n6:\n    cmp r0,#64\n    bne 7f\n    ldr r0,iAdrszMess64\n    b 100f\n7:\n    cmp r0,#128\n    bne 8f\n    ldr r0,iAdrszMess128\n    b 100f\n8:\n    cmp r0,#256\n    bne 9f\n    ldr r0,iAdrszMess256\n    b 100f\n9:\n    cmp r0,#512\n    bne 10f\n    ldr r0,iAdrszMess512\n    b 100f\n10:\n    cmp r0,#1024\n    bne 11f\n    ldr r0,iAdrszMess1024\n    b 100f\n11:\n    cmp r0,#2048\n    bne 12f\n    ldr r0,iAdrszMess2048\n    b 100f\n12:\n    ldr r1,iAdrszMessErreur                       @ error message\n    bl   displayError\n100:\n    pop {r1,lr}\n    bx lr                   @ return \niAdrszMess0:          .int szMess0\niAdrszMess2:          .int szMess2\niAdrszMess4:          .int szMess4\niAdrszMess8:          .int szMess8\niAdrszMess16:         .int szMess16\niAdrszMess32:         .int szMess32\niAdrszMess64:         .int szMess64\niAdrszMess128:        .int szMess128\niAdrszMess256:        .int szMess256\niAdrszMess512:        .int szMess512\niAdrszMess1024:       .int szMess1024\niAdrszMess2048:        .int szMess2048\n\n//iAdrsBuffer:         .int sBuffer\n/***************************************************/\n/*   Generation random number                  */\n/***************************************************/\n/* r0 contains limit  */\ngenereraleas:\n    push {r1-r4,lr}         @ save registers \n    ldr r4,iAdriGraine\n    ldr r2,[r4]\n    ldr r3,iNbDep1\n    mul r2,r3,r2\n    ldr r3,iNbDep2\n    add r2,r2,r3\n    str r2,[r4]             @ maj de la graine pour l appel suivant \n    cmp r0,#0\n    beq 100f\n    add r1,r0,#1            @ divisor\n    mov r0,r2               @ dividende\n    bl division\n    mov r0,r3               @ r\u00e9sult = remainder\n  \n100:                        @ end function\n    pop {r1-r4,lr}          @ restaur registers\n    bx lr                   @ return\n/*****************************************************/\niAdriGraine: .int iGraine\niNbDep1:     .int 0x343FD\niNbDep2:     .int 0x269EC3 \n/***************************************************/\n/* read touch                                      */\n/***************************************************/\nreadKey:\n    push {r1-r7,lr}\n    mov r5,#0\n    ldr r1,iAdriTouche                            @ buffer address\n    str r5,[r1]                                  @ raz 4 bytes iTouche\n    /* read terminal state */\n    mov r0,#STDIN                                @ input console\n    mov r1,#TCGETS\n    ldr r2,iAdrstOldtio\n    mov r7, #IOCTL                               @ call system Linux\n    svc #0 \n    cmp r0,#0                                    @ error\u00a0?\n    beq 1f\n    ldr r1,iAdrszMessErreur                      @ error message\n    bl   displayError\n    mov r0,#-1\n    b 100f\n1:\n    adr r0,sighandler                            @ adresse routine traitement signal\n    ldr r1,iAdrstSigAction                       @ adresse structure sigaction\n    str r0,[r1,#sa_handler]                      @ maj handler\n    mov r0,#SIGINT                               @ signal type\n    ldr r1,iAdrstSigAction\n    mov r2,#0                                    @ NULL\n    mov r7, #SIGACTION                           @ call system\n    svc #0 \n    cmp r0,#0                                    @ error\u00a0?\n    bne 97f\n    mov r0,#SIGQUIT\n    ldr r1,iAdrstSigAction\n    mov r2,#0                                    @ NULL\n    mov r7, #SIGACTION                           @ call system \n    svc #0 \n    cmp r0,#0                                    @ error\u00a0?\n    bne 97f\n    mov r0,#SIGTERM\n    ldr r1,iAdrstSigAction\n    mov r2,#0                                    @ NULL\n    mov r7, #SIGACTION                           @ appel systeme \n    svc #0 \n    cmp r0,#0\n    bne 97f\n    @\n    adr r0,iSIG_IGN                              @ address signal ignore function\n    ldr r1,iAdrstSigAction1\n    str r0,[r1,#sa_handler]\n    mov r0,#SIGTTOU                              @invalidate other process signal\n    ldr r1,iAdrstSigAction1\n    mov r2,#0                                    @ NULL\n    mov r7,#SIGACTION                            @ call system \n    svc #0 \n    cmp r0,#0\n    bne 97f\n    @\n    /* read terminal current state  */\n    mov r0,#STDIN\n    mov r1,#TCGETS\n    ldr r2,iAdrstCurtio                          @ address current termio\n    mov r7,#IOCTL                                @ call systeme \n    svc #0 \n    cmp r0,#0                                    @ error\u00a0?\n    bne 97f\n    mov r2,#ICANON | ECHO                        @ no key pressed echo on display\n    mvn r2,r2                                    @ and one key \n    ldr r1,iAdrstCurtio\n    ldr r3,[r1,#term_c_lflag]\n    and r3,r2                                    @ add flags \n    str r3,[r1,#term_c_lflag]                    @ and store\n    mov r0,#STDIN                                @ maj terminal current state \n    mov r1,#TCSETS\n    ldr r2,iAdrstCurtio\n    mov r7, #IOCTL                               @ call system\n    svc #0 \n    cmp r0,#0\n    bne 97f\n    @\n2:                                               @ loop waiting key\n    ldr r0,iAdriEnd                              @ if signal ctrl-c  -> end\n    ldr r0,[r0]\n    cmp r0,#0\n    movne r5,#-1\n    bne 98f\n    ldr r0,iAdrstPoll1                            @ address structure poll\n    mov r1,#STDIN\n    str r1,[r0,#poll_fd]                          @ maj FD\n    mov r1,#POLLIN                                @ action code\n    str r1,[r0,#poll_events]\n    mov r1,#1                                     @ items number structure poll\n    mov r2,#0                                     @ timeout = 0 \n    mov r7,#SYSPOLL                               @ call system POLL\n    svc #0 \n    cmp r0,#0                                     @ key pressed\u00a0?\n    ble 2b                                        @ no key pressed -> loop\n                                                  @ read key\n    mov r0,#STDIN                                 @ File Descriptor\n    ldr r1,iAdriTouche                            @ buffer address\n    mov r2,#BUFFERSIZE                            @ buffer size\n    mov r7,#READ                                  @ read key\n    svc #0\n    cmp r0,#0                                     @ error\u00a0?\n    bgt 98f\n \n97:                                               @ error detected\n    ldr r1,iAdrszMessErreur                       @ error message\n    bl   displayError\n    mov r5,#-1\n98:                                               @ end then restaur begin state terminal\n    mov r0,#STDIN\n    mov r1,#TCSETS\n    ldr r2,iAdrstOldtio\n    mov r7,#IOCTL                                 @ call system  \n    svc #0\n    cmp r0,#0\n    beq 99f                                       @ restaur ok\n    ldr r1,iAdrszMessErreur                       @ error message\n    bl   displayError\n    mov r0,#-1\n    b 100f\n99:\n    cmp r5,#0                                     @ no error or control-c\u00a0?\n    ldreq r2,iAdriTouche                          @ key address\n    ldreqb r0,[r2,#2]                             @ return key byte\n    movne r0,r5                                   @ or error\n100:\n    pop {r1-r7, lr}\n    bx lr\niSIG_IGN:                 .int 1\niAdriEnd:                 .int iEnd\niAdrstPoll1:              .int stPoll1\niAdriTouche:              .int iTouche\niAdrstOldtio:             .int stOldtio\niAdrstCurtio:             .int stCurtio\niAdrstSigAction:          .int stSigAction\niAdrstSigAction1:         .int stSigAction1\niAdrszMessErreur\u00a0:        .int szMessErreur \n/******************************************************************/\n/*     traitement du signal                                       */ \n/******************************************************************/\nsighandler:\n    push {r0,r1}\n    ldr r0,iAdriEnd\n    mov r1,#1                 @ maj zone end\n    str r1,[r0]\n    pop {r0,r1}\n    bx lr\n/***************************************************/\n/*      ROUTINES INCLUDE                           */\n/***************************************************/\n.include \"../affichage.inc\"",
        "safe": true
    },
    {
        "filename": "2048_21.txt",
        "content": "-----------------------------\n|      |      |      |      |\n|   8  |   4  |   4  |   2  |\n|      |      |      |      |\n-----------------------------\n|      |      |      |      |\n|  64  |  16  |      |      |\n|      |      |      |      |\n-----------------------------\n|      |      |      |      |\n|  16  |      |      |   2  |\n|      |      |      |      |\n-----------------------------\n|      |      |      |      |\n|   2  |      |      |      |\n|      |      |      |      |\n-----------------------------\n",
        "safe": true
    },
    {
        "filename": "2048_22.txt",
        "content": "Grid := [], s := 16, w := h := S * 4.5\nGui, font, s%s%\nGui, add, text, y1\nloop, 4\n{\n\trow := A_Index\n\tloop, 4\n\t{\n\t\tcol := A_Index\n\t\tif col = 1\n\t\t\tGui, add, button, v%row%_%col% xs  y+1 w%w% h%h% -TabStop, % Grid[row,col] := 0\n\t\telse\n\t\t\tGui, add, button, v%row%_%col% x+1 yp  w%w% h%h%  -TabStop, % Grid[row,col] := 0\n\t}\n}\nGui, show,, 2048\n;------------------------------\n\nStart:\nfor row, obj in Grid\n\tfor col, val in obj\n\t\tGrid[row,col] := 0\n\t\nGrid[1,1]:=2\nShowGrid()\nreturn\n\n;------------------------------\nGuiClose:\nExitApp\nreturn\n;------------------------------\n#IfWinActive, 2048\n;------------------------------\nup::\nmove := false\nloop, 4\n{\n\tcol := A_Index\n\tLoop, 3\n\t{\n\t\trow := A_Index\n\t\tif Grid[row, col] && (Grid[row, col] = Grid[row+1, col])\n\t\t\tGrid[row, col] *=2\t, Grid[row+1, col] := 0, move := true\n\t}\n}\n\nloop, 4\n{\n\trow := A_Index\n\tloop, 4\n\t{\n\t\tcol := A_Index\n\t\tloop, 4\n\t\t\tif !Grid[row, col]\n\t\t\t\tloop, 3\n\t\t\t\t\tif !Grid[row, col] && Grid[row+A_Index, col]\n\t\t\t\t\t{\n\t\t\t\t\t\tGrid[row, col] := Grid[row+A_Index, col]\t, Grid[row+A_Index, col] := 0, move := true\n\t\t\t\t\t\tif (Grid[row, col] = Grid[row-1, col])\n\t\t\t\t\t\t\tGrid[row-1, col] *=2\t, Grid[row, col] := 0, move := true\n\t\t\t\t\t}\n\t}\n}\ngosub, AddNew\nreturn\n;------------------------------\nDown::\nmove := false\nloop, 4\n{\n\tcol := A_Index\n\tLoop, 3\n\t{\n\t\trow := 5-A_Index\n\t\tif Grid[row, col] && (Grid[row, col] = Grid[row-1, col])\n\t\t\tGrid[row, col] *=2\t, Grid[row-1, col] := 0, move := true\n\t}\n}\n\nloop, 4\n{\n\trow := 5-A_Index\n\tloop, 4\n\t{\n\t\tcol := A_Index\n\t\tloop, 4\n\t\t\tif !Grid[row, col]\n\t\t\t\tloop, 3\n\t\t\t\t\tif !Grid[row, col] && Grid[row-A_Index, col]\n\t\t\t\t\t{\n\t\t\t\t\t\tGrid[row, col] := Grid[row-A_Index, col]\t, Grid[row-A_Index, col] := 0, move := true\n\t\t\t\t\t\tif (Grid[row, col] = Grid[row+1, col])\n\t\t\t\t\t\t\tGrid[row+1, col] *=2\t, Grid[row, col] := 0, move := true\n\t\t\t\t\t}\n\t}\n}\ngosub, AddNew\nreturn\n;------------------------------\nLeft::\nmove := false\nloop, 4\n{\n\trow := A_Index\n\tLoop, 3\n\t{\n\t\tcol := A_Index\n\t\tif Grid[row, col] && (Grid[row, col] = Grid[row, col+1])\n\t\t\tGrid[row, col] *=2\t, Grid[row, col+1] := 0, move := true\n\t}\n}\n\nloop, 4\n{\n\tcol := A_Index\n\tloop, 4\n\t{\n\t\trow := A_Index\n\t\tloop, 4\n\t\t\tif !Grid[row, col]\n\t\t\t\tloop, 3\n\t\t\t\t\tif !Grid[row, col] && Grid[row, col+A_Index]\n\t\t\t\t\t{\n\t\t\t\t\t\tGrid[row, col] := Grid[row, col+A_Index]\t, Grid[row, col+A_Index] := 0, move := true\n\t\t\t\t\t\tif (Grid[row, col] = Grid[row, col-1])\n\t\t\t\t\t\t\tGrid[row, col-1] *=2\t, Grid[row, col] := 0, move := true\n\t\t\t\t\t}\n\n\t}\n}\ngosub, AddNew\nreturn\n;------------------------------\nRight::\nmove := false\nloop, 4\n{\n\trow := A_Index\n\tLoop, 3\n\t{\n\t\tcol := 5-A_Index\n\t\tif Grid[row, col] && (Grid[row, col] = Grid[row, col-1])\n\t\t\tGrid[row, col] *=2\t, Grid[row, col-1] := 0, move := true\n\t}\n}\n\nloop, 4\n{\n\tcol := 5-A_Index\n\tloop, 4\n\t{\n\t\trow := A_Index\n\t\tloop, 4\n\t\t\tif !Grid[row, col]\n\t\t\t\tloop, 3\n\t\t\t\t\tif !Grid[row, col] && Grid[row, col-A_Index]\n\t\t\t\t\t{\n\t\t\t\t\t\tGrid[row, col] := Grid[row, col-A_Index]\t, Grid[row, col-A_Index] := 0, move := true\n\t\t\t\t\t\tif (Grid[row, col] = Grid[row, col+1])\n\t\t\t\t\t\t\tGrid[row, col+1] *=2\t, Grid[row, col] := 0, move := true\n\t\t\t\t\t}\n\t}\n}\ngosub, AddNew\nreturn\n\n;------------------------------\n#IfWinActive\n;------------------------------\nAddNew:\nif EndOfGame()\n{\n\tMsgBox Done `nPress OK to retry\n\tgoto start\n}\nreturn\n\n;------------------------------\nEndOfGame(){\n\tglobal\n\tif Move\n\t\tAddRandom()\n\tShowGrid()\n\tfor row, obj in Grid\n\t\tfor col, val in obj\n\t\t\tif !grid[row,col]\n\t\t\t\treturn 0\n\t\t\t\n\tfor row, obj in Grid\n\t\tfor col, val in obj\n\t\t\tif (grid[row,col] = grid[row+1,col]) || (grid[row,col] = grid[row-1,col]) || (grid[row,col] = grid[row,col+1]) || (grid[row,col] = grid[row,col-1])\n\t\t\t\treturn 0\n\treturn 1\n}\n\n;------------------------------\nShowGrid(){\n\tglobal Grid\n\tfor row, obj in Grid\n\t\tfor col, val in obj\n\t\t{\n\t\t\tGuiControl,, %row%_%col%, %val%\n\t\t\tif val\n\t\t\t\tGuiControl, Show, %row%_%col%\n\t\t\telse\n\t\t\t\tGuiControl, Hide, %row%_%col%\n\t\t}\n}\n\n;------------------------------\nAddRandom(){\n\tglobal Grid\n\tShowGrid()\n\tSleep, 200\n\tfor row, obj in Grid\n\t\tfor col, val in obj\n\t\t\tif !grid[row,col]\n\t\t\t\tlist .= (list?\"`n\":\"\") row \",\" col\n\tSort, list, random\n\tRnd := StrSplit(list, \"`n\").1\n\tGrid[StrSplit(rnd, \",\").1, StrSplit(rnd, \",\").2] := 2\n}\n;------------------------------\n",
        "safe": true
    },
    {
        "filename": "2048_23.txt",
        "content": ":: 2048 Game Task from RosettaCode\n:: Batch File Implementation v2.0.1\n\n@echo off\nsetlocal enabledelayedexpansion\n\nrem initialization\n:begin_game\nset \"size=4\"   %== board size ==%\nset \"score=0\"   %== current score ==%\nset \"won=0\"   %== boolean for winning ==%\nset \"target=2048\"   %== as the game title says ==%\nfor /l %%R in (1,1,%size%) do for /l %%C in (1,1,%size%) do set \"X_%%R_%%C=0\"\n\nrem add two numbers in the board\ncall :addtile\ncall :addtile\n\nrem main game loop\n:main_loop\ncall :display\necho(\necho(Keys: WASD (Slide Movement), N (New game), P (Exit)\n\nrem get keypress trick\nset \"key=\"\nfor /f \"delims=\" %%? in ('xcopy /w \"%~f0\" \"%~f0\" 2^>nul') do if not defined key set \"key=%%?\"\nset \"key=%key:~-1%\"\n\nset \"changed=0\"   %== boolean for changed board ==%\nset \"valid_key=0\"   %== boolean for pressing WASD ==%\nrem process keypress\nif /i \"!key!\" equ \"W\" (set \"valid_key=1\" & call :slide \"C\" \"1,1,%size%\" \"X\")\nif /i \"!key!\" equ \"A\" (set \"valid_key=1\" & call :slide \"R\" \"1,1,%size%\" \"X\")\nif /i \"!key!\" equ \"S\" (set \"valid_key=1\" & call :slide \"C\" \"%size%,-1,1\" \"X\")\nif /i \"!key!\" equ \"D\" (set \"valid_key=1\" & call :slide \"R\" \"%size%,-1,1\" \"X\")\nif /i \"!key!\" equ \"N\" goto begin_game\nif /i \"!key!\" equ \"P\" exit /b 0\nif \"%valid_key%\" equ \"0\" goto main_loop\n\nrem check if the board changed\nif %changed% neq 0 call :addtile\n\nrem check for win condition\nif %won% equ 1 (\n    set \"msg=Nice one... You WON^!^!\"\n    goto gameover\n)\n\nrem check for lose condition\nif %blank_count% equ 0 (\n    for /l %%R in (1,1,%size%) do for /l %%C in (1,1,%size%) do set \"LX_%%R_%%C=!X_%%R_%%C!\"\n    set \"save_changed=%changed%\" & set \"changed=0\"   %== save actual changed for test ==%\n    call :slide \"C\" \"1,1,%size%\" \"LX\"\n    call :slide \"R\" \"1,1,%size%\" \"LX\"\n    if !changed! equ 0 (\n        set \"msg=No moves are possible... Game Over\u00a0:(\"\n        goto gameover\n    ) else set \"changed=!save_changed!\"\n)\ngoto main_loop\n\nrem add number to a random blank tile\n:addtile\nset \"blank_count=0\"   %== blank tile counter ==%\nset \"new_tile=\"   %== clearing ==%\nrem create pseudo-array blank_tiles\nfor /l %%R in (1,1,%size%) do (\n    for /l %%C in (1,1,%size%) do (\n        if !X_%%R_%%C! equ 0 (\n            set \"blank_tiles[!blank_count!]=X_%%R_%%C\"\n            set /a \"blank_count+=1\"\n        )\n    )\n)\nif %blank_count% equ 0 goto :EOF\nset /a \"pick_tile=%random%%%%blank_count%\"\nset \"new_tile=!blank_tiles[%pick_tile%]!\"\nset /a \"rnd_newnum=%random%%%10\"\nrem 10% chance new number is 4, 90% chance it's 2\nif %rnd_newnum% equ 5 (set \"%new_tile%=4\") else (set \"%new_tile%=2\")\nset /a \"blank_count-=1\"   %== to be used for checking lose condition ==%\ngoto :EOF\n\nrem display the board\n:display\ncls\necho(2048 Game in Batch\necho(\nset \"wall=+\"\nfor /l %%C in (1,1,%size%) do set \"wall=!wall!----+\"\nfor /l %%R in (1,1,%size%) do (\n    set \"disp_row=|\"\n    for /l %%C in (1,1,%size%) do (\n        if \"!new_tile!\" equ \"X_%%R_%%C\" (set \"DX_%%R_%%C=  +!X_%%R_%%C!\") else (\n            set \"DX_%%R_%%C=!X_%%R_%%C!\" \n            if !X_%%R_%%C! lss 1000 set \"DX_%%R_%%C= !DX_%%R_%%C!\"\n            if !X_%%R_%%C! lss 100 set \"DX_%%R_%%C= !DX_%%R_%%C!\"\n            if !X_%%R_%%C! lss 10 set \"DX_%%R_%%C= !DX_%%R_%%C!\"\n            if !X_%%R_%%C! equ 0 set \"DX_%%R_%%C=    \"\n        )\n        set \"disp_row=!disp_row!!DX_%%R_%%C!|\"\n    )\n    echo(%wall%\n    echo(!disp_row!\n)\necho(%wall%\necho(\necho(Score: %score%\ngoto :EOF\n\nrem the main slider of numbers in tiles\n:slide\nrem\u00a0%%A and\u00a0%%B are used here because sliding direction is variable\nfor /l %%A in (1,1,%size%) do (\n    rem first slide: removing blank tiles in the middle\n    set \"slide_1=\"\n    set \"last_blank=0\"   %== boolean if last tile is blank ==%\n    for /l %%B in (%~2) do (\n        if \"%~1\" equ \"R\" (set \"curr_tilenum=!%~3_%%A_%%B!\"\n        ) else if \"%~1\" equ \"C\" (set \"curr_tilenum=!%~3_%%B_%%A!\")\n        if !curr_tilenum! equ 0 (set \"last_blank=1\") else (\n            set \"slide_1=!slide_1! !curr_tilenum!\"\n            if !last_blank! equ 1 set \"changed=1\"\n            set \"last_blank=0\"\n        )\n    )\n    rem second slide: addition of numbered tiles\n    rem slide_2 would be pseudo-array\n    set \"slide_2_count=0\"\n    set \"skip=1\"   %== boolean for skipping after previous summing ==%\n    if \"!slide_1!\" neq \"\" for %%S in (!slide_1! 0) do (\n        if !skip! equ 1 (\n            set \"prev_tilenum=%%S\" & set \"skip=0\"\n        ) else if !skip! equ 0 (\n            if %%S equ !prev_tilenum! (\n                set /a \"sum=%%S+!prev_tilenum!\"\n                if \"%~3\" equ \"X\" set /a \"score+=sum\"\n                set \"changed=1\" & set \"skip=1\"\n                rem check for winning condition!\n                if !sum! equ !target! set \"won=1\"\n            ) else (\n                set \"sum=!prev_tilenum!\"\n                set \"prev_tilenum=%%S\"\n            )\n            set \"slide_2[!slide_2_count!]=!sum!\"\n            set /a \"slide_2_count+=1\"\n        )\n    )\n    rem new values of tiles\n    set \"slide_2_run=0\"   %== running counter for slide_2 ==%\n    for /l %%B in (%~2) do (\n        if \"%~1\" equ \"R\" (set \"curr_tile=%~3_%%A_%%B\"\n        ) else if \"%~1\" equ \"C\" (set \"curr_tile=%~3_%%B_%%A\")\n        for %%? in (\"!slide_2_run!\") do (\n            if %%~? lss !slide_2_count! (set \"!curr_tile!=!slide_2[%%~?]!\"\n            ) else (set \"!curr_tile!=0\")\n        )\n        set /a \"slide_2_run+=1\"\n    )\n)\ngoto :EOF\n\nrem game over xD\n:gameover\ncall :display\necho(\necho(!msg!\necho(\necho(Press any key to exit . . .\npause>nul\nexit /b 0\n",
        "safe": true
    },
    {
        "filename": "2048_24.txt",
        "content": "2048 Game in Batch\n\n+----+----+----+----+\n|    |  +2|    |    |\n+----+----+----+----+\n|   4|    |    |    |\n+----+----+----+----+\n|   4|    |    |    |\n+----+----+----+----+\n|  16|   4|    |   2|\n+----+----+----+----+\n\nScore: 60\n\nKeys: WASD (Slide Movement), N (New game), P (Exit)",
        "safe": true
    },
    {
        "filename": "2048_25.txt",
        "content": "SCREEN 13\nPALETTE 1, pColor(35, 33, 31)\nPALETTE 2, pColor(46, 46, 51)\nPALETTE 3, pColor(59, 56, 50)\nPALETTE 4, pColor(61, 44, 30)\nPALETTE 5, pColor(61, 37, 25)\nPALETTE 6, pColor(62, 31, 24)\nPALETTE 7, pColor(62, 24, 15)\nPALETTE 8, pColor(59, 52, 29)\nPALETTE 9, pColor(59, 51, 24)\nPALETTE 10, pColor(59, 50, 20)\nPALETTE 11, pColor(59, 49, 16)\nPALETTE 12, pColor(59, 49, 12)\nPALETTE 13, pColor(15, 15, 13)\nPALETTE 14, pColor(23, 22, 20)\n\nDIM SHARED gDebug\nDIM SHARED gOriginX\nDIM SHARED gOriginY\nDIM SHARED gTextOriginX\nDIM SHARED gTextOriginY\nDIM SHARED gSquareSide\nDIM SHARED gGridSize\n\ngGridSize = 4  ' grid size (4 -> 4x4)\n\nDIM SHARED gGrid(gGridSize, gGridSize)\nDIM SHARED gScore\n\n' Don't touch these numbers, seriously\n\ngOriginX = 75 'pixel X of top left of grid\ngOriginY = 12 'pixel Y of top right of grid\ngTextOriginX = 11\ngTextOriginY = 3\ngSquareSide = 38 'width/height of block in pixels\n\n\n'set up all the things!\ngDebug = 0\n\nRANDOMIZE TIMER\nCLS\n\nstart:\ninitGrid\ninitGraphicGrid\nrenderGrid\nupdateScore\n\ngScore = 0\n\nLOCATE 23, 1\nPRINT \"Move with arrow keys. (R)estart, (Q)uit\"\n\n' keyboard input loop\nDO\n  DO\n    k$ = INKEY$\n  LOOP UNTIL k$ <> \"\"\n\n  SELECT CASE k$\n    CASE CHR$(0) + CHR$(72) 'up\n      processMove (\"u\")\n    CASE CHR$(0) + CHR$(80) 'down\n      processMove (\"d\")\n    CASE CHR$(0) + CHR$(77) 'right\n      processMove (\"r\")\n    CASE CHR$(0) + CHR$(75) 'left\n      processMove (\"l\")\n    CASE CHR$(27)           'escape\n      GOTO programEnd\n    CASE \"q\"\n      GOTO programEnd\n    CASE \"Q\"\n      GOTO programEnd\n    CASE \"r\"\n      GOTO start\n    CASE \"R\"\n      GOTO start\n  END SELECT\nLOOP\n\nprogramEnd:\n\nSUB addblock\n  DIM emptyCells(gGridSize * gGridSize, 2)\n  emptyCellCount = 0\n\n  FOR x = 0 TO gGridSize - 1\n    FOR y = 0 TO gGridSize - 1\n      IF gGrid(x, y) = 0 THEN\n        emptyCells(emptyCellCount, 0) = x\n        emptyCells(emptyCellCount, 1) = y\n        emptyCellCount = emptyCellCount + 1\n      END IF\n    NEXT y\n  NEXT x\n\n  IF emptyCellCount > 0 THEN\n    index = INT(RND * emptyCellCount)\n    num = CINT(RND + 1) * 2\n    gGrid(emptyCells(index, 0), emptyCells(index, 1)) = num\n  END IF\n\nEND SUB\n\nSUB drawNumber (num, xPos, yPos)\n  SELECT CASE num\n    CASE 0:    c = 16\n    CASE 2:    c = 2\n    CASE 4:    c = 3\n    CASE 8:    c = 4\n    CASE 16:   c = 5\n    CASE 32:   c = 6\n    CASE 64:   c = 7\n    CASE 128:  c = 8\n    CASE 256:  c = 9\n    CASE 512:  c = 10\n    CASE 1024: c = 11\n    CASE 2048: c = 12\n    CASE 4096: c = 13\n    CASE 8192: c = 13\n    CASE ELSE: c = 13\n  END SELECT\n\n  x = xPos * (gSquareSide + 2) + gOriginX + 1\n  y = yPos * (gSquareSide + 2) + gOriginY + 1\n  LINE (x + 1, y + 1)-(x + gSquareSide - 1, y + gSquareSide - 1), c, BF\n\n  IF num > 0 THEN\n    LOCATE gTextOriginY + 1 + (yPos * 5), gTextOriginX + (xPos * 5)\n    PRINT \"    \"\n    LOCATE gTextOriginY + 2 + (yPos * 5), gTextOriginX + (xPos * 5)\n    PRINT pad$(num)\n    LOCATE gTextOriginY + 3 + (yPos * 5), gTextOriginX + (xPos * 5)\n    'PRINT \"    \"\n  END IF\n\nEND SUB\n\nFUNCTION getAdjacentCell (x, y, d AS STRING)\n\n  IF (d = \"l\" AND x = 0) OR (d = \"r\" AND x = gGridSize - 1) OR (d = \"u\" AND y = 0) OR (d = \"d\" AND y = gGridSize - 1) THEN\n    getAdjacentCell = -1\n  ELSE\n    SELECT CASE d\n      CASE \"l\": getAdjacentCell = gGrid(x - 1, y)\n      CASE \"r\": getAdjacentCell = gGrid(x + 1, y)\n\n      CASE \"u\": getAdjacentCell = gGrid(x, y - 1)\n      CASE \"d\": getAdjacentCell = gGrid(x, y + 1)\n    END SELECT\n  END IF\n\nEND FUNCTION\n\n'Draws the outside grid (doesn't render tiles)\nSUB initGraphicGrid\n\n  gridSide = (gSquareSide + 2) * gGridSize\n\n  LINE (gOriginX, gOriginY)-(gOriginX + gridSide, gOriginY + gridSide), 14, BF 'outer square, 3 thick\n  LINE (gOriginX, gOriginY)-(gOriginX + gridSide, gOriginY + gridSide), 1, B 'outer square, 3 thick\n  LINE (gOriginX - 1, gOriginY - 1)-(gOriginX + gridSide + 1, gOriginY + gridSide + 1), 1, B\n  LINE (gOriginX - 2, gOriginY - 2)-(gOriginX + gridSide + 2, gOriginY + gridSide + 2), 1, B\n\n  FOR x = gOriginX + gSquareSide + 2 TO gOriginX + (gSquareSide + 2) * gGridSize STEP gSquareSide + 2  ' horizontal lines\n    LINE (x, gOriginY)-(x, gOriginY + gridSide), 1\n  NEXT x\n\n  FOR y = gOriginY + gSquareSide + 2 TO gOriginY + (gSquareSide + 2) * gGridSize STEP gSquareSide + 2 ' vertical lines\n    LINE (gOriginX, y)-(gOriginX + gridSide, y), 1\n  NEXT y\n\nEND SUB\n\n'Init the (data) grid with 0s\nSUB initGrid\n  FOR x = 0 TO 3\n    FOR y = 0 TO 3\n      gGrid(x, y) = 0\n    NEXT y\n  NEXT x\n\n  addblock\n  addblock\n\nEND SUB\n\nSUB moveBlock (sourceX, sourceY, targetX, targetY, merge)\n\n  IF sourceX < 0 OR sourceX >= gGridSize OR sourceY < 0 OR sourceY >= gGridSize AND gDebug = 1 THEN\n    LOCATE 0, 0\n    PRINT \"moveBlock: source coords out of bounds\"\n  END IF\n\n  IF targetX < 0 OR targetX >= gGridSize OR targetY < 0 OR targetY >= gGridSize AND gDebug = 1 THEN\n    LOCATE 0, 0\n    PRINT \"moveBlock: source coords out of bounds\"\n  END IF\n\n  sourceSquareValue = gGrid(sourceX, sourceY)\n  targetSquareValue = gGrid(targetX, targetY)\n\n  IF merge = 1 THEN\n\n    IF sourceSquareValue = targetSquareValue THEN\n      gGrid(sourceX, sourceY) = 0\n      gGrid(targetX, targetY) = targetSquareValue * 2\n      gScore = gScore + targetSquareValue * 2 ' Points!\n    ELSEIF gDebug = 1 THEN\n      LOCATE 0, 0\n      PRINT \"moveBlock: Attempted to merge unequal sqs\"\n    END IF\n\n  ELSE\n\n    IF targetSquareValue = 0 THEN\n      gGrid(sourceX, sourceY) = 0\n      gGrid(targetX, targetY) = sourceSquareValue\n    ELSEIF gDebug = 1 THEN\n      LOCATE 0, 0\n      PRINT \"moveBlock: Attempted to move to non-empty block\"\n    END IF\n\n  END IF\n\nEND SUB\n\nFUNCTION pad$ (num)\n  strNum$ = LTRIM$(STR$(num))\n\n  SELECT CASE LEN(strNum$)\n    CASE 1: pad = \"  \" + strNum$ + \" \"\n    CASE 2: pad = \" \" + strNum$ + \" \"\n    CASE 3: pad = \" \" + strNum$\n    CASE 4: pad = strNum$\n  END SELECT\n\nEND FUNCTION\n\nFUNCTION pColor (r, g, b)\n  pColor = (r + g * 256 + b * 65536)\nEND FUNCTION\n\nSUB processMove (dir AS STRING)\n  ' dir can be 'l', 'r', 'u', or 'd'\n\n  hasMoved = 0\n\n  IF dir = \"l\" THEN\n\n    FOR y = 0 TO gGridSize - 1\n      wasMerge = 0\n      FOR x = 0 TO gGridSize - 1\n        GOSUB processBlock\n      NEXT x\n    NEXT y\n\n  ELSEIF dir = \"r\" THEN\n\n    FOR y = 0 TO gGridSize - 1\n      wasMerge = 0\n      FOR x = gGridSize - 1 TO 0 STEP -1\n        GOSUB processBlock\n      NEXT x\n    NEXT y\n\n  ELSEIF dir = \"u\" THEN\n    FOR x = 0 TO gGridSize - 1\n      wasMerge = 0\n      FOR y = 0 TO gGridSize - 1\n        GOSUB processBlock\n      NEXT y\n    NEXT x\n\n  ELSEIF dir = \"d\" THEN\n    FOR x = 0 TO gGridSize - 1\n      wasMerge = 0\n      FOR y = gGridSize - 1 TO 0 STEP -1\n        GOSUB processBlock\n      NEXT y\n    NEXT x\n\n  END IF\n\n  GOTO processMoveEnd\n\nmoveToObstacle:\n    curX = x\n    curY = y\n\n    DO WHILE getAdjacentCell(curX, curY, dir) = 0\n      SELECT CASE dir\n        CASE \"l\": curX = curX - 1\n        CASE \"r\": curX = curX + 1\n        CASE \"u\": curY = curY - 1\n        CASE \"d\": curY = curY + 1\n      END SELECT\n    LOOP\n  RETURN\n\nprocessBlock:\n\n    merge = 0\n    IF gGrid(x, y) <> 0 THEN ' have block\n\n      GOSUB moveToObstacle ' figure out where it can be moved to\n      IF getAdjacentCell(curX, curY, dir) = gGrid(x, y) AND wasMerge = 0 THEN  ' obstacle can be merged with\n        merge = 1\n        wasMerge = 1\n      ELSE\n        wasMerge = 0\n      END IF\n\n      IF curX <> x OR curY <> y OR merge = 1 THEN\n        mergeDirX = 0\n        mergeDirY = 0\n        IF merge = 1 THEN\n          SELECT CASE dir\n            CASE \"l\": mergeDirX = -1\n            CASE \"r\": mergeDirX = 1\n            CASE \"u\": mergeDirY = -1\n            CASE \"d\": mergeDirY = 1\n          END SELECT\n        END IF\n\n        CALL moveBlock(x, y, curX + mergeDirX, curY + mergeDirY, merge) ' move to before obstacle or merge\n        hasMoved = 1\n      END IF\n    END IF\n  RETURN\n\nprocessMoveEnd:\n\n  IF hasMoved = 1 THEN addblock\n  renderGrid\n  updateScore\n\nEND SUB\n\nSUB renderGrid\n  FOR x = 0 TO gGridSize - 1\n    FOR y = 0 TO gGridSize - 1\n      CALL drawNumber(gGrid(x, y), x, y)\n    NEXT y\n  NEXT x\nEND SUB\n\nSUB updateScore\n  LOCATE 1, 10\n  PRINT \"Score:\" + STR$(gScore)\nEND SUB\n",
        "safe": true
    },
    {
        "filename": "2048_26.txt",
        "content": "      SIZE = 4     : MAX = SIZE-1\n      Won% = FALSE : Lost% = FALSE\n      @% = 5\n      DIM Board(MAX,MAX),Stuck% 3\n\n      PROCBreed\n      PROCPrint\n      REPEAT\n        Direction = GET-135\n        IF Direction > 0 AND Direction < 5 THEN\n          Moved% = FALSE\n          PROCShift\n          PROCMerge\n          PROCShift\n          IF Moved% THEN PROCBreed : !Stuck%=0 ELSE ?(Stuck%+Direction-1)=-1 : Lost% = !Stuck%=-1\n          PROCPrint\n        ENDIF\n      UNTIL Won% OR Lost%\n      IF Won% THEN PRINT \"You WON!\u00a0:-)\" ELSE PRINT \"You lost\u00a0:-(\"\n      END\n\n      REM -----------------------------------------------------------------------------------------------------------------------\n      DEF PROCPrint\n      FOR i = 0 TO SIZE*SIZE-1\n        IF Board(i DIV SIZE,i MOD SIZE) THEN PRINT Board(i DIV SIZE,i MOD SIZE); ELSE PRINT \"    _\";\n        IF i MOD SIZE = MAX THEN PRINT\n      NEXT\n      PRINT STRING$(SIZE,\"-----\")\n      ENDPROC\n\n      REM ----------------------------------------------------------------------------------------------------------------------\n      DEF PROCShift\n      IF Direction = 2 OR Direction = 3 THEN loopend = MAX : step = -1 ELSE loopend = 0 : step = 1\n      FOR row = loopend TO MAX-loopend STEP step\n        zeros = 0\n        FOR col = loopend TO MAX-loopend STEP step\n          IF Direction < 3 THEN\n            IF Board(row,col) = 0 THEN zeros += step ELSE IF zeros THEN SWAP Board(row,col),Board(row,col-zeros) : Moved% = TRUE\n          ELSE\n            IF Board(col,row) = 0 THEN zeros += step ELSE IF zeros THEN SWAP Board(col,row),Board(col-zeros,row) : Moved% = TRUE\n          ENDIF\n        NEXT\n      NEXT\n      ENDPROC\n\n      REM -----------------------------------------------------------------------------------------------------------------------\n      DEF PROCMerge\n      IF Direction = 1 THEN loopend =   0 : rowoff =  0 : coloff =  1 : step =  1\n      IF Direction = 2 THEN loopend = MAX : rowoff =  0 : coloff = -1 : step = -1\n      IF Direction = 3 THEN loopend = MAX : rowoff = -1 : coloff =  0 : step = -1\n      IF Direction = 4 THEN loopend =   0 : rowoff =  1 : coloff =  0 : step =  1\n      FOR row = loopend TO MAX-loopend-rowoff STEP step\n        FOR col = loopend TO MAX-loopend-coloff STEP step\n          IF Board(row,col) THEN IF Board(row,col) = Board(row+rowoff,col+coloff) THEN\n            Board(row,col) *= 2 : Board(row+rowoff,col+coloff) = 0\n            Moved% = TRUE\n            IF NOT Won% THEN Won% = Board(row,col)=2048\n          ENDIF\n        NEXT\n      NEXT\n      ENDPROC\n\n      REM -----------------------------------------------------------------------------------------------------------------------\n      DEF PROCBreed\n      cell = RND(SIZE*SIZE)-1\n      FOR i = 0 TO SIZE*SIZE-1\n        z = (cell+i) MOD (SIZE*SIZE)\n        IF Board(z DIV SIZE,z MOD SIZE) = 0 THEN Board(z DIV SIZE,z MOD SIZE) = 2-(RND(10)=1)*2 : EXIT FOR\n      NEXT\n      ENDPROC\n",
        "safe": true
    },
    {
        "filename": "2048_27.txt",
        "content": "    _    _    _    _\n    _    _    _    _\n    _    _    2    _\n    _    _    _    _\n--------------------\n    _    _    _    _\n    _    _    _    _\n    2    _    _    _\n    _    2    _    _\n--------------------\n    2    2    _    _\n    _    _    2    _\n    _    _    _    _\n    _    _    _    _\n--------------------\n    4    2    _    _\n    2    _    _    _\n    _    _    _    _\n    _    _    _    _\n--------------------\n.\n.\n.\n.\n    2    8    4    2\n    4    2   16    4\n   16    4    8   32\n    4   32    2    4\n--------------------\nYou lost\u00a0:-(",
        "safe": true
    },
    {
        "filename": "2048_28.txt",
        "content": "#!/usr/bin/env BQN\n# 2048 game\n# The game is controlled with the vim movement keys:\n# h: left, j: down, k: up, l: right, q: quit\n# needs a VT-100 compatible terminal\n\nMerge\u2190{\ud835\udd69 0\u22b8\u2260\u22b8/\u21a9 \u22c4 m\u2190<`=\u27dc\u00ab\ud835\udd69 \u22c4 4\u2191(\u00ac\u00bbm)/\ud835\udd69\u00d71+m}\u233e\u233d # Merge a single row to the right\nStep\u2190Merge\u02d8    # Merges each row of the board\nUp\u2190Step\u233e(\u233d\u2349\u2218\u233d) # Each direction merges the board\nDown\u2190Step\u233e\u2349    # by rotating it to the correct orientation, merging the rows\nRight\u2190Step     # and reversing the rotation\nLeft\u2190Step\u233e(\u233d\u02d8)    \n# Spawns a 2 or a 4 (10% chance) at a random empty position\nSpawn\u2190{i\u2190\u2022rand.Range\u2218\u2260\u22b8\u2291(0\u22b8= /\u25cb\u294a \u2195\u2218\u2262)\ud835\udd69 \u22c4 (\u2022rand.Range\u2218\u2260\u22b8\u22919\u203f1/2\u203f4)\u233e(i\u22b8\u2291) \ud835\udd69} \nLose\u2190Left\u2218Right\u2218Down\u2218Up\u22b8\u2261 # Losing condition, no moves change the board\nWin\u2190\u2228\u00b4\u00b7\u2228\u02dd2048\u22b8= #  Winning condition, 2048!\n\nQuit\u2190{\u2022Out e\u223e\"[?12l\"\u223ee\u223e\"[?25h\" \u22c4 \u2022Exit \ud835\udd69} # Restores the terminal and exits\nDisplay\u2190{ # Displays the board, score and controls\n    \u2022Out e\u223e\"[H\"\u223ee\u223e\"[2J\" # Cursor to origin and clear screen\n    \u2022Out \"Controls: h: left, j: down, k: up, l: right, q: quit\"\n    \u2022Show \ud835\udd69\n    \u2022Out \"score: \"\u223e\u2022Repr \u2308\u00b4\u2308\u02dd \ud835\udd69\n}\n\nboard\u2190Spawn 4\u203f4\u294a0\ne\u2190@+27 # Escape character for the ANSI escape codes\n\u2022term.RawMode 1\n\u2022Out e\u223e\"[?25l\"\u223ee\u223e\"[2J\"\u223ee\u223e\"[H\" # Cursor to origin, hide it and clear screen\n{\ud835\udd64\u22c4\n  Display board\n  {\ud835\udd64\u22c4\u2022Out \"You win!\" \u22c4 Quit 0}\u235fWin board\n  {\ud835\udd64\u22c4\u2022Out \"You lose!\"\u22c4 Quit 1}\u235fLose board\n  key\u2190\u2022term.CharB @ # Read key\n  \u2291key\u220a\"hjklq\"? # Valid key?\n    {\ud835\udd64\u22c4 Quit 0}\u235f(key='q')@ # Quit key?\n    move\u2190\u2291(key=\"hjkl\")/Left\u203fDown\u203fUp\u203fRight # Get movement function from the key\n    {\ud835\udd64\u22c4board\u21a9Spawn\u2218Move \ud835\udd69}\u235f(Move\u22b8\u2262) board # Generate the next board if the move is valid\n  ; @\n}\u2022_While_{\ud835\udd64\u22c41}@\n",
        "safe": true
    },
    {
        "filename": "2048_29.txt",
        "content": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <termios.h>\n#include <time.h>\n#include <unistd.h>\n\n#define D_INVALID -1\n#define D_UP       1\n#define D_DOWN     2\n#define D_RIGHT    3\n#define D_LEFT     4\n\nconst long values[] = {\n    0, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048\n};\n\nconst char *colors[] = {\n    \"39\", \"31\", \"32\", \"33\", \"34\", \"35\", \"36\", \"37\", \"91\", \"92\", \"93\", \"94\"\n};\n\nstruct gamestate_struct__ {\n    int grid[4][4];\n    int have_moved;\n    long total_score;\n    long score_last_move;\n    int blocks_in_play;\n} game;\n\nstruct termios oldt, newt;\n\nvoid do_draw(void)\n{\n    printf(\"\\033[2J\\033[HScore: %ld\", game.total_score);\n    if (game.score_last_move)\n        printf(\" (+%ld)\", game.score_last_move);\n    printf(\"\\n\");\n\n    for (int i = 0; i < 25; ++i)\n        printf(\"-\");\n    printf(\"\\n\");\n\n    for (int y = 0; y < 4; ++y) {\n        printf(\"|\");\n        for (int x = 0; x < 4; ++x) {\n            if (game.grid[x][y])\n                printf(\"\\033[7m\\033[%sm%*zd \\033[0m|\", colors[game.grid[x][y]],\n                        4, values[game.grid[x][y]]);\n            else\n                printf(\"%*s |\", 4, \"\");\n        }\n        printf(\"\\n\");\n    }\n\n    for (int i = 0; i < 25; ++i) {\n        printf(\"-\");\n    }\n    printf(\"\\n\");\n}\n\nvoid do_merge(int d)\n{\n/* These macros look pretty scary, but mainly demonstrate some space saving */\n#define MERGE_DIRECTION(_v1, _v2, _xs, _xc, _xi, _ys, _yc, _yi, _x, _y)     \\\n    do {                                                                    \\\n        for (int _v1 = _xs; _v1 _xc; _v1 += _xi) {                          \\\n            for (int _v2 = _ys; _v2 _yc; _v2 += _yi) {                      \\\n                if (game.grid[x][y] && (game.grid[x][y] ==                  \\\n                                    game.grid[x + _x][y + _y])) {           \\\n                    game.grid[x][y] += (game.have_moved = 1);               \\\n                    game.grid[x + _x][y + _y] = (0 * game.blocks_in_play--);\\\n                    game.score_last_move += values[game.grid[x][y]];        \\\n                    game.total_score += values[game.grid[x][y]];            \\\n                }                                                           \\\n            }                                                               \\\n        }                                                                   \\\n    } while (0)\n\n    game.score_last_move = 0;\n\n    switch (d) {\n        case D_LEFT:\n            MERGE_DIRECTION(x, y, 0, < 3, 1, 0, < 4, 1, 1, 0);\n            break;\n        case D_RIGHT:\n            MERGE_DIRECTION(x, y, 3, > 0, -1, 0, < 4, 1, -1, 0);\n            break;\n        case D_DOWN:\n            MERGE_DIRECTION(y, x, 3, > 0, -1, 0, < 4, 1, 0, -1);\n            break;\n        case D_UP:\n            MERGE_DIRECTION(y, x, 0, < 3, 1, 0, < 4, 1, 0, 1);\n            break;\n    }\n\n#undef MERGE_DIRECTION\n}\n\nvoid do_gravity(int d)\n{\n#define GRAVITATE_DIRECTION(_v1, _v2, _xs, _xc, _xi, _ys, _yc, _yi, _x, _y) \\\n    do {                                                                    \\\n        int break_cond = 0;                                                 \\\n        while (!break_cond) {                                               \\\n            break_cond = 1;                                                 \\\n            for (int _v1 = _xs; _v1 _xc; _v1 += _xi) {                      \\\n                for (int _v2 = _ys; _v2 _yc; _v2 += _yi) {                  \\\n                    if (!game.grid[x][y] && game.grid[x + _x][y + _y]) {    \\\n                        game.grid[x][y] = game.grid[x + _x][y + _y];        \\\n                        game.grid[x + _x][y + _y] = break_cond = 0;         \\\n                        game.have_moved = 1;                                \\\n                    }                                                       \\\n                }                                                           \\\n            }                                                               \\\n            do_draw(); usleep(40000);                                       \\\n        }                                                                   \\\n    } while (0)\n\n    switch (d) {\n        case D_LEFT:\n            GRAVITATE_DIRECTION(x, y, 0, < 3, 1, 0, < 4, 1, 1, 0);\n            break;\n        case D_RIGHT:\n            GRAVITATE_DIRECTION(x, y, 3, > 0, -1, 0, < 4, 1, -1, 0);\n            break;\n        case D_DOWN:\n            GRAVITATE_DIRECTION(y, x, 3, > 0, -1, 0, < 4, 1, 0, -1);\n            break;\n        case D_UP:\n            GRAVITATE_DIRECTION(y, x, 0, < 3, 1, 0, < 4, 1, 0, 1);\n            break;\n    }\n\n#undef GRAVITATE_DIRECTION\n}\n\nint do_check_end_condition(void)\n{\n    int ret = -1;\n    for (int x = 0; x < 4; ++x) {\n        for (int y = 0; y < 4; ++y) {\n            if (values[game.grid[x][y]] == 2048)\n                return 1;\n            if (!game.grid[x][y] ||\n                  ((x + 1 < 4) && (game.grid[x][y] == game.grid[x + 1][y])) ||\n                  ((y + 1 < 4) && (game.grid[x][y] == game.grid[x][y + 1])))\n                ret = 0;\n        }\n    }\n    return ret;\n}\n\nint do_tick(int d)\n{\n    game.have_moved = 0;\n    do_gravity(d);\n    do_merge(d);\n    do_gravity(d);\n    return game.have_moved;\n}\n\nvoid do_newblock(void) {\n    if (game.blocks_in_play >= 16) return;\n\n    int bn = rand() % (16 - game.blocks_in_play);\n    int pn = 0;\n\n    for (int x = 0; x < 4; ++x) {\n        for (int y = 0; y < 4; ++y) {\n            if (game.grid[x][y])\n                continue;\n\n            if (pn == bn){\n                game.grid[x][y] = rand() % 10 ? 1 : 2;\n                game.blocks_in_play += 1;\n                return;\n            }\n            else {\n                ++pn;\n            }\n        }\n    }\n}\n\nint main(void)\n{\n    /* Initialize terminal settings */\n    tcgetattr(STDIN_FILENO, &oldt);\n    newt = oldt;\n    newt.c_lflag &= ~(ICANON | ECHO);\n    tcsetattr(STDIN_FILENO, TCSANOW, &newt);\n\n    srand(time(NULL));\n    memset(&game, 0, sizeof(game));\n    do_newblock();\n    do_newblock();\n    do_draw();\n\n    while (1) {\n        int found_valid_key, direction, value;\n        do {\n            found_valid_key = 1;\n            direction       = D_INVALID;\n            value           = getchar();\n            switch (value) {\n                case 'h': case 'a':\n                    direction = D_LEFT;\n                    break;\n                case 'l': case 'd':\n                    direction = D_RIGHT;\n                    break;\n                case 'j': case 's':\n                    direction = D_DOWN;\n                    break;\n                case 'k': case 'w':\n                    direction = D_UP;\n                    break;\n                case 'q':\n                    goto game_quit;\n                    break;\n                case 27:\n                    if (getchar() == 91) {\n                        value = getchar();\n                        switch (value) {\n                            case 65:\n                                direction = D_UP;\n                                break;\n                            case 66:\n                                direction = D_DOWN;\n                                break;\n                            case 67:\n                                direction = D_RIGHT;\n                                break;\n                            case 68:\n                                direction = D_LEFT;\n                                break;\n                            default:\n                                found_valid_key = 0;\n                                break;\n                        }\n                    }\n                    break;\n                default:\n                    found_valid_key = 0;\n                    break;\n            }\n        }  while (!found_valid_key);\n\n        do_tick(direction);\n        if (game.have_moved != 0){\n                do_newblock();\n        }\n        do_draw();\n\n        switch (do_check_end_condition()) {\n            case -1:\n                goto game_lose;\n            case 1:\n                goto game_win;\n            case 0:\n                break;\n        }\n    }\n\n    if (0)\ngame_lose:\n    printf(\"You lose!\\n\");\n    goto game_quit;\n    if (0)\ngame_win:\n    printf(\"You win!\\n\");\n    goto game_quit;\n    if (0)\ngame_quit:\n\n    /* Restore terminal settings */\n    tcsetattr(STDIN_FILENO, TCSANOW, &oldt);\n    return 0;\n}\n",
        "safe": true
    },
    {
        "filename": "2048_3.txt",
        "content": "               .........[8] \n",
        "safe": true
    },
    {
        "filename": "2048_30.txt",
        "content": "Score: 1100 (+4)\n-------------------------\n|  64 |  32 |  64 |  32 |\n|  32 |  16 |   2 |   8 |\n|  16 |   4 |   8 |   4 |\n|   4 |   2 |   4 |   2 |\n-------------------------\nYou lose!\n",
        "safe": true
    },
    {
        "filename": "2048_31.txt",
        "content": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <time.h>\n#define EMPTY_TILE 0\n#define ROWS 4\n#define COLUMNS 4\n\n\n/* \n *                                     GENERAL CONCEPT\n * \n * How do you add up tiles when there is whitespace between them?\n * You sort the array so that there are no empty tiles between them while stacking them all to one side\n * then the addition function always adds up from left to right or up to bottom. It does not care\n * about the left movements or the down movement. This can be achieved by reversing the array\n * whenever the player chooses to move to the right or down, when the addition is finished\n * the array gets reversed back and its like it had been added from right to left or bottom to top\n * When the addition is done, the program scans for the number of empty tiles and uses that\n * in its selection of the next tile to be filled. 10% of times a tile gets occupied with a 4\n *\n*/\n\n\n\n/* \n * the remove_whitespace functions; it is pretty clear what they do.\n * they use a bubble short algorith to move the 0's or empty tiles to the end of the array\n * depending on the direction moved (without carring about going right or up\n *\n*/\n\nvoid remove_whitespace_horizontaly(int board[ROWS][COLUMNS], int rows, int columns)\n{\n  int a = columns;\n  int tmp;\n\n  \n  for (; a < COLUMNS - 1; ++a) {\n    tmp = board[rows][a];\n    board[rows][a] = board[rows][a+1];\n    board[rows][a+1] = tmp;\n  }\n}\n\nvoid remove_whitespace_verticaly(int board[ROWS][COLUMNS], int columns, int rows)\n{\n  int a = rows;\n  int tmp;\n\n  for (; a < ROWS - 1; ++a) {\n    tmp = board[a][columns];\n    board[a][columns] = board[a+1][columns];\n    board[a+1][columns] = tmp;\n  }\n}\n\n/*\n * the add_tiles functions. those functions do the heavy work of adding the tiles and\n * taking care of special situations such as when adding two equal tiles a 0 gets generated\n * they are quite difficult to understand i think (which means not that you need to be too clever\n * but that i have done a poor job of creating them) and it took around 4 hours to get the \n * proper result\n*/\n\nvoid add_tiles_horizontaly(int board[ROWS][COLUMNS])\n{\n  int a, b, flag;\n\n  for (a = 0; a < ROWS; ++a) {\n    for (b = 0, flag = 0; b < COLUMNS - 1 && flag != 4; ++b) {\n      if (board[a][b] == EMPTY_TILE) {\n\tremove_whitespace_horizontaly(board, a, b);\n\t--b;\n\t++flag;\n      }\n      else {\n\tif (board[a][b+1] == EMPTY_TILE) {\n\t  board[a][b+1] = board[a][b];\n\t  board[a][b] = EMPTY_TILE;\n\t  --b;\n\t} else if (board[a][b] == board[a][b+1]) {\n\t  board[a][b] += board[a][b+1];\n\t  board[a][b+1] = EMPTY_TILE;\n\t}\n      }\n    }\n  }\n}\n\nvoid add_tiles_verticaly(int board[ROWS][COLUMNS])\n{\n  int a, b, flag;\n\n  for (a = 0; a < COLUMNS; ++a) {\n    for (b = 0, flag = 0; b < ROWS-1 && flag != 4; ++b) {\n      if (board[b][a] == EMPTY_TILE) {\n\tremove_whitespace_verticaly(board, a, b);\n\t--b;\n\t++flag;\n      }\n      else {\n\tif (board[b+1][a] == EMPTY_TILE) {\n\t  board[b+1][a] = board[b][a];\n\t  board[b][a] = EMPTY_TILE;\n\t  --b;\n\t} else if (board[b][a] == board[b+1][a]) {\n\t  board[b][a] += board[b+1][a];\n\t  board[b+1][a] = EMPTY_TILE;\n\t}\n      }\n    }\n  }\n}\n\t  \n/*\n * ... print the board\n */\n\nvoid print_board(int board[ROWS][COLUMNS])\n{\n  int a, b;\n\n  for (a = 0; a < ROWS; ++a) {\n    printf(\"\\n\");\n    for (b = 0; b < COLUMNS; ++b) {\n      printf(\"%5i\", board[a][b]);\n    }\n  }\n  printf(\"\\n\");\n}\n\n/*\n * The reverse_board function reverses the array\n * if the movement is right or down reverse the array\n*/\n\nvoid reverse_board(char input[], int board[ROWS][COLUMNS])\n{\n  int a, b, c, tmp;\n\n  if (!strcmp(input, \"right\")) {\n    for (a = 0; a < ROWS; ++a) {\n      for (b = 0, c = 3; b < 2; ++b, --c) {\n\ttmp = board[a][b];\n\tboard[a][b] = board[a][c];\n\tboard[a][c] = tmp;\n      }\n    }\n  }\n  else if  (!strcmp(input, \"down\")) {\n    for (a = 0; a < COLUMNS; ++a) {\n      for (b = 0, c = 3; b < 2; ++b, --c) {\n\ttmp = board[b][a];\n\tboard[b][a] = board[c][a];\n\tboard[c][a] = tmp;\n      }\n    }\n  }\n}\n\n/*\n * the check_board function is the one which evaluates the win or lose condition\n * for each turn and at the same time providing the number of empty tiles for the random generator\n * function\n*/\n\nint check_board (int board[ROWS][COLUMNS])\n{\n  int a, b;\n\n  int result = 0;\n  int empty_tiles = 0;\n\n\n  for (a = 0; a < ROWS; ++a)\n    for (b = 0; b < COLUMNS; ++b)\n      if (board[a][b] == 2048)\n\tresult = -1;\n      else if (board[a][b] == EMPTY_TILE)\n\t++empty_tiles;\n\n  result = result == -1 ? result : empty_tiles;\n\n  return result;\n}\n\n/*\n * the generate_random functin generates a random number between 0 and the number of\n * empty tiles. the generated number will assign to the Nth empty tile = (random_number) \n * the new value, it also takes care of the 10% chance for producing a 4 tile\n*/\n\nvoid generate_random(int board[ROWS][COLUMNS], int empty_tiles )\n{\n\n  srand(time(NULL));\n\n  int a, b;\n  int random = 0;\n  int tile = 0;\n\n  random = rand() % empty_tiles;\n  tile = (rand() % 9 == 4) ? 4 : 2;\n\n  for (a = 0; a < ROWS; ++a)\n    for (b = 0; b < COLUMNS; ++b)\n      if (board[a][b] == EMPTY_TILE && random != 0)\n\t--random;\n      else if (board[a][b] == EMPTY_TILE && random == 0) {\n\tboard[a][b] = tile;\n\treturn;\n      }\n}\n\n/*\n * infinite loop, get the movements or exit code and act accordingly \n*/\n\nint play_game(int board[ROWS][COLUMNS])\n{\n\n  char movement[81];\n  int tiles = 0;\n  \n  printf(\"this is the 2048 game\\n\"\t\t\t\t\t\\\n\t \"The goal of this game is make a tile reach the value of 2048\\n\"\\\n\t \"The board starts of with only one occupied tile.\\n\"\\\n\t \"On each round a new tile gets added with the value of 2\\n\"\\\n\t \"or at 10%% of the times with the value of 4\\n\"\\\n\t \"If you run out of tiles you lose\\n\"\\\n\t \"There are 4 movements you can supply to the game\\n\"\\\n\t \"right, left, up, and down.\\n\"\\\n\t \"For each of this movements the tiles move to the direction specified\\n\"\\\n\t \"If two tiles have the same value the get added up just once.\\n\"\\\n\t \"If 2 occupied tiles share the same row or column but are seperated by empty tiles\\n\"\\\n\t \"then the occupied tiles travel along the empty tiles stacking in the direction\\n\"\\\n\t \"they were directed\\n\"\\\n\t \"For a more visual explanation you can check the wikipedia entry\\n\"\n\t \" if you search for 2058 board game\\n\"\t\\\n\t \"Here we go\\n\");\n\n  print_board(board);\n  while (1) {\n    printf(\"(enter: left,right,up,down,exit)>> \");\n    scanf(\"%s\", movement);\n    if (!strcmp(movement, \"down\")) {\n      reverse_board(movement,board);\n      add_tiles_verticaly(board);\n      tiles = check_board(board);\n      if (tiles == -1)\n\treturn -1;\n      else if (tiles == 0)\n\treturn 0;\n      generate_random(board,tiles);\n      reverse_board(movement, board);\n    }\n    else if (!strcmp(movement, \"up\")) {\n      add_tiles_verticaly(board);\n      tiles = check_board(board);\n      if (tiles == -1)\n\treturn -1;\n      else if (tiles == 0)\n\treturn 0;\n      generate_random(board,tiles);\n    }\n    else if (!strcmp(movement, \"right\")) {\n      reverse_board(movement,board);\n      add_tiles_horizontaly(board);\n      tiles = check_board(board);\n      if (tiles == -1)\n\treturn -1;\n      else if (tiles == 0)\n\treturn 0;\n      generate_random(board,tiles);\n      reverse_board(movement, board);\n    }\n    else if (!strcmp(movement, \"left\")) {\n      add_tiles_horizontaly(board);\n      tiles = check_board(board);\n      if (tiles == -1)\n\treturn -1;\n      else if (tiles == 0)\n\treturn 0;\n      generate_random(board,tiles);\n    }\n    else if (!strcmp(movement, \"exit\")) {\n      return 1;\n    }\n    else {\n      printf(\"Do not recognize this movement please type again\\n\");\n      continue;\n    }\n    print_board(board);\n  }\n}\n\n\nint main(void)\n{\n  int play_game(int board[ROWS][COLUMNS]);\n  void generate_random(int board[ROWS][COLUMNS], int empty_tiles );\n  int check_board (int board[ROWS][COLUMNS]);\n  void reverse_board(char input[], int board[ROWS][COLUMNS]);\n  void print_board(int board[ROWS][COLUMNS]);\n  void add_tiles_verticaly(int board[ROWS][COLUMNS]);\n  void add_tiles_horizontaly(int board[ROWS][COLUMNS]);\n  void remove_whitespace_verticaly(int board[ROWS][COLUMNS], int columns, int rows);\n  void remove_whitespace_horizontaly(int board[ROWS][COLUMNS], int rows, int columns);\n    \n  int win_condition;\n  int board[ROWS][COLUMNS] = {\n    {0,0,0,0},\n    {0,0,0,0},\n    {0,0,0,0},\n    {0,0,0,0}\n  };\n\n\n  generate_random(board, 16); /* initialize the board */\n\n  win_condition = play_game(board);\n  switch (win_condition) {\n  case 1:\n    printf(\"But you are not done yet!!!\\n\"\t\\\n\t   \"Fine, see you another day\\n\");\n    break;\n  case 0:\n    printf(\"Ohh noo, you run out of tiles\\n\"\t\\\n\t   \"Run me agan to play some more\\n\"\t\\\n\t   \"Byyyeee\\n\");\n    break;\n  case -1:\n    printf(\"WooooW you did it, Good job!!!\\n\"\t\\\n\t   \"See ya later homie\\n\");\n    break;\n  }\n\n  return 0;\n}\n",
        "safe": true
    },
    {
        "filename": "2048_32.txt",
        "content": "using System;\n\nnamespace g2048_csharp\n{\n    internal class Tile\n    {\n        public Tile()\n        {\n            Value = 0;\n            IsBlocked = false;\n        }\n\n        public int Value { get; set; }\n        public bool IsBlocked { get; set; }\n    }\n\n    internal enum MoveDirection\n    {\n        Up,\n        Down,\n        Left,\n        Right\n    }\n\n    internal class G2048\n    {\n        public G2048()\n        {\n            _isDone = false;\n            _isWon = false;\n            _isMoved = true;\n            _score = 0;\n            InitializeBoard();\n        }\n\n        private void InitializeBoard()\n        {\n            for (int y = 0; y < 4; y++)\n            {\n                for (int x = 0; x < 4; x++)\n                {\n                    _board[x, y] = new Tile();\n                }\n            }\n        }\n\n        private bool _isDone;\n        private bool _isWon;\n        private bool _isMoved;\n        private int _score;\n        private readonly Tile[,] _board = new Tile[4, 4];\n        private readonly Random _rand = new Random();\n\n        public void Loop()\n        {\n            AddTile();\n            while (true)\n            {\n                if (_isMoved)\n                {\n                    AddTile();\n                }\n\n                DrawBoard();\n                if (_isDone)\n                {\n                    break;\n                }\n\n                WaitKey();\n            }\n\n            string endMessage = _isWon ? \"You've made it!\" : \"Game Over!\";\n            Console.WriteLine(endMessage);\n        }\n\n        private void DrawBoard()\n        {\n            Console.Clear();\n            Console.WriteLine(\"Score: \" + _score + \"\\n\");\n            for (int y = 0; y < 4; y++)\n            {\n                Console.WriteLine(\"+------+------+------+------+\");\n                Console.Write(\"| \");\n                for (int x = 0; x < 4; x++)\n                {\n                    if (_board[x, y].Value == 0)\n                    {\n                        const string empty = \" \";\n                        Console.Write(empty.PadRight(4));\n                    }\n                    else\n                    {\n                        Console.Write(_board[x, y].Value.ToString().PadRight(4));\n                    }\n\n                    Console.Write(\" | \");\n                }\n\n                Console.WriteLine();\n            }\n\n            Console.WriteLine(\"+------+------+------+------+\\n\\n\");\n        }\n\n        private void WaitKey()\n        {\n            _isMoved = false;\n            Console.WriteLine(\"(W) Up (S) Down (A) Left (D) Right\");\n            char input;\n            char.TryParse(Console.ReadKey().Key.ToString(), out input);\n\n            switch (input)\n            {\n                case 'W':\n                    Move(MoveDirection.Up);\n                    break;\n                case 'A':\n                    Move(MoveDirection.Left);\n                    break;\n                case 'S':\n                    Move(MoveDirection.Down);\n                    break;\n                case 'D':\n                    Move(MoveDirection.Right);\n                    break;\n            }\n\n            for (int y = 0; y < 4; y++)\n            {\n                for (int x = 0; x < 4; x++)\n                {\n                    _board[x, y].IsBlocked = false;\n                }\n            }\n        }\n\n        private void AddTile()\n        {\n            for (int y = 0; y < 4; y++)\n            {\n                for (int x = 0; x < 4; x++)\n                {\n                    if (_board[x, y].Value != 0) continue;\n                    int a, b;\n                    do\n                    {\n                        a = _rand.Next(0, 4);\n                        b = _rand.Next(0, 4);\n                    } while (_board[a, b].Value != 0);\n\n                    double r = _rand.NextDouble();\n                    _board[a, b].Value = r > 0.89f ? 4 : 2;\n\n                    if (CanMove())\n                    {\n                        return;\n                    }\n                }\n            }\n\n            _isDone = true;\n        }\n\n        private bool CanMove()\n        {\n            for (int y = 0; y < 4; y++)\n            {\n                for (int x = 0; x < 4; x++)\n                {\n                    if (_board[x, y].Value == 0)\n                    {\n                        return true;\n                    }\n                }\n            }\n\n            for (int y = 0; y < 4; y++)\n            {\n                for (int x = 0; x < 4; x++)\n                {\n                    if (TestAdd(x + 1, y, _board[x, y].Value)\n                        || TestAdd(x - 1, y, _board[x, y].Value)\n                        || TestAdd(x, y + 1, _board[x, y].Value)\n                        || TestAdd(x, y - 1, _board[x, y].Value))\n                    {\n                        return true;\n                    }\n                }\n            }\n\n            return false;\n        }\n\n        private bool TestAdd(int x, int y, int value)\n        {\n            if (x < 0 || x > 3 || y < 0 || y > 3)\n            {\n                return false;\n            }\n\n            return _board[x, y].Value == value;\n        }\n\n        private void MoveVertically(int x, int y, int d)\n        {\n            if (_board[x, y + d].Value != 0\n                && _board[x, y + d].Value == _board[x, y].Value\n                && !_board[x, y].IsBlocked\n                && !_board[x, y + d].IsBlocked)\n            {\n                _board[x, y].Value = 0;\n                _board[x, y + d].Value *= 2;\n                _score += _board[x, y + d].Value;\n                _board[x, y + d].IsBlocked = true;\n                _isMoved = true;\n            }\n            else if (_board[x, y + d].Value == 0\n                     && _board[x, y].Value != 0)\n            {\n                _board[x, y + d].Value = _board[x, y].Value;\n                _board[x, y].Value = 0;\n                _isMoved = true;\n            }\n\n            if (d > 0)\n            {\n                if (y + d < 3)\n                {\n                    MoveVertically(x, y + d, 1);\n                }\n            }\n            else\n            {\n                if (y + d > 0)\n                {\n                    MoveVertically(x, y + d, -1);\n                }\n            }\n        }\n\n        private void MoveHorizontally(int x, int y, int d)\n        {\n            if (_board[x + d, y].Value != 0\n                && _board[x + d, y].Value == _board[x, y].Value\n                && !_board[x + d, y].IsBlocked\n                && !_board[x, y].IsBlocked)\n            {\n                _board[x, y].Value = 0;\n                _board[x + d, y].Value *= 2;\n                _score += _board[x + d, y].Value;\n                _board[x + d, y].IsBlocked = true;\n                _isMoved = true;\n            }\n            else if (_board[x + d, y].Value == 0\n                     && _board[x, y].Value != 0)\n            {\n                _board[x + d, y].Value = _board[x, y].Value;\n                _board[x, y].Value = 0;\n                _isMoved = true;\n            }\n\n            if (d > 0)\n            {\n                if (x + d < 3)\n                {\n                    MoveHorizontally(x + d, y, 1);\n                }\n            }\n            else\n            {\n                if (x + d > 0)\n                {\n                    MoveHorizontally(x + d, y, -1);\n                }\n            }\n        }\n\n        private void Move(MoveDirection direction)\n        {\n            switch (direction)\n            {\n                case MoveDirection.Up:\n                    for (int x = 0; x < 4; x++)\n                    {\n                        int y = 1;\n                        while (y < 4)\n                        {\n                            if (_board[x, y].Value != 0)\n                            {\n                                MoveVertically(x, y, -1);\n                            }\n\n                            y++;\n                        }\n                    }\n\n                    break;\n                case MoveDirection.Down:\n                    for (int x = 0; x < 4; x++)\n                    {\n                        int y = 2;\n                        while (y >= 0)\n                        {\n                            if (_board[x, y].Value != 0)\n                            {\n                                MoveVertically(x, y, 1);\n                            }\n\n                            y--;\n                        }\n                    }\n\n                    break;\n                case MoveDirection.Left:\n                    for (int y = 0; y < 4; y++)\n                    {\n                        int x = 1;\n                        while (x < 4)\n                        {\n                            if (_board[x, y].Value != 0)\n                            {\n                                MoveHorizontally(x, y, -1);\n                            }\n\n                            x++;\n                        }\n                    }\n\n                    break;\n                case MoveDirection.Right:\n                    for (int y = 0; y < 4; y++)\n                    {\n                        int x = 2;\n                        while (x >= 0)\n                        {\n                            if (_board[x, y].Value != 0)\n                            {\n                                MoveHorizontally(x, y, 1);\n                            }\n\n                            x--;\n                        }\n                    }\n\n                    break;\n            }\n        }\n    }\n\n    internal static class Program\n    {\n        public static void Main(string[] args)\n        {\n            RunGame();\n        }\n\n        private static void RunGame()\n        {\n            G2048 game = new G2048();\n            game.Loop();\n\n            CheckRestart();\n        }\n\n        private static void CheckRestart()\n        {\n            Console.WriteLine(\"(N) New game (P) Exit\");\n            while (true)\n            {\n                char input;\n                char.TryParse(Console.ReadKey().Key.ToString(), out input);\n                switch (input)\n                {\n                    case 'N':\n                        RunGame();\n                        break;\n                    case 'P':\n                        return;\n                    default:\n                        ClearLastLine();\n                        break;\n                }\n            }\n        }\n\n        private static void ClearLastLine()\n        {\n            Console.SetCursorPosition(0, Console.CursorTop);\n            Console.Write(new string(' ', Console.BufferWidth));\n            Console.SetCursorPosition(0, Console.CursorTop - 1);\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "2048_33.txt",
        "content": "Score: 572\n\n+------+------+------+------+\n|      | 2    | 16   | 4    |\n+------+------+------+------+\n|      | 2    | 4    | 64   |\n+------+------+------+------+\n| 4    | 16   | 32   | 4    |\n+------+------+------+------+\n| 2    | 4    | 2    | 16   |\n+------+------+------+------+\n\n\n(W) Up (S) Down (A) Left (D) Right\n",
        "safe": true
    },
    {
        "filename": "2048_34.txt",
        "content": "#include <time.h>\n#include <iostream>\n#include <string>\n#include <iomanip>\n#include <cstdlib>\n\ntypedef unsigned int uint;\nusing namespace std;\nenum movDir { UP, DOWN, LEFT, RIGHT };\n\nclass tile\n{\npublic:\n    tile() : val( 0 ), blocked( false ) {}\n    uint val;\n    bool blocked;\n};\n\nclass g2048\n{\npublic:\n    g2048() : done( false ), win( false ), moved( true ), score( 0 ) {}\n    void loop()\n    {\n\taddTile(); \n\twhile( true )\n\t{\n\t    if( moved ) addTile();\n\t    drawBoard(); \n\t    if( done ) break;\n\t    waitKey();\n\t}\n\tstring s = \"Game Over!\";\n\tif( win ) s = \"You've made it!\";\n\tcout << s << endl << endl;\n    }\nprivate:\n    void drawBoard()\n    {\n\tsystem( \"cls\" );\n\tcout << \"SCORE: \" << score << endl << endl;\n\tfor( int y = 0; y < 4; y++ )\n\t{\n\t    cout << \"+------+------+------+------+\" << endl << \"| \";\n\t    for( int x = 0; x < 4; x++ )\n\t    {\n\t\tif( !board[x][y].val ) cout << setw( 4 ) << \" \";\n\t\telse cout << setw( 4 ) << board[x][y].val;\n\t\tcout << \" | \";\n\t    }\n\t    cout << endl;\n\t}\n\tcout << \"+------+------+------+------+\" << endl << endl;\n    }\n    void waitKey()\n    {\n\tmoved = false; char c; \n\tcout << \"(W)Up (S)Down (A)Left (D)Right \"; cin >> c; c &= 0x5F;\n\tswitch( c )\n\t{\n\t    case 'W': move( UP );break;\n\t    case 'A': move( LEFT ); break;\n\t    case 'S': move( DOWN ); break;\n\t    case 'D': move( RIGHT );\n\t}\n\tfor( int y = 0; y < 4; y++ )\n\t    for( int x = 0; x < 4; x++ )\n\t\tboard[x][y].blocked = false;\n    }\n    void addTile()\n    {\n\tfor( int y = 0; y < 4; y++ )\n\t    for( int x = 0; x < 4; x++ )\n\t\tif( !board[x][y].val )\n\t\t{\n\t\t    uint a, b;\n\t\t    do\n\t\t    { a = rand() % 4; b = rand() % 4; }\n\t\t    while( board[a][b].val );\n\n\t\t    int s = rand() % 100;\n\t\t    if( s > 89 ) board[a][b].val = 4;\n\t\t    else board[a][b].val = 2;\n\t\t    if( canMove() ) return;\n\t\t}\n\tdone = true;\n    }\n    bool canMove()\n    {\n\tfor( int y = 0; y < 4; y++ )\n\t    for( int x = 0; x < 4; x++ )\n\t\tif( !board[x][y].val ) return true;\n\n\tfor( int y = 0; y < 4; y++ )\n\t    for( int x = 0; x < 4; x++ )\n\t    {\n\t\tif( testAdd( x + 1, y, board[x][y].val ) ) return true;\n\t\tif( testAdd( x - 1, y, board[x][y].val ) ) return true;\n\t\tif( testAdd( x, y + 1, board[x][y].val ) ) return true;\n\t\tif( testAdd( x, y - 1, board[x][y].val ) ) return true;\n\t    }\n\treturn false;\n    }\n    bool testAdd( int x, int y, uint v )\n    {\n\tif( x < 0 || x > 3 || y < 0 || y > 3 ) return false;\n\treturn board[x][y].val == v;\n    }\n    void moveVert( int x, int y, int d )\n    {\n\tif( board[x][y + d].val && board[x][y + d].val == board[x][y].val && !board[x][y].blocked && !board[x][y + d].blocked  )\n\t{\n\t    board[x][y].val = 0;\n\t    board[x][y + d].val *= 2;\n\t    score += board[x][y + d].val;\n\t    board[x][y + d].blocked = true;\n\t    moved = true;\n\t}\n\telse if( !board[x][y + d].val && board[x][y].val )\n\t{\n\t    board[x][y + d].val = board[x][y].val;\n\t    board[x][y].val = 0;\n\t    moved = true;\n\t}\n\tif( d > 0 ) { if( y + d < 3 ) moveVert( x, y + d,  1 ); }\n\telse        { if( y + d > 0 ) moveVert( x, y + d, -1 ); }\n    }\n    void moveHori( int x, int y, int d )\n    {\n\tif( board[x + d][y].val && board[x + d][y].val == board[x][y].val && !board[x][y].blocked && !board[x + d][y].blocked  )\n\t{\n\t    board[x][y].val = 0;\n\t    board[x + d][y].val *= 2;\n\t    score += board[x + d][y].val;\n\t    board[x + d][y].blocked = true;\n\t    moved = true;\n\t}\n\telse if( !board[x + d][y].val && board[x][y].val )\n\t{\n\t    board[x + d][y].val = board[x][y].val;\n\t    board[x][y].val = 0;\n\t    moved = true;\n\t}\n\tif( d > 0 ) { if( x + d < 3 ) moveHori( x + d, y,  1 ); }\n\telse        { if( x + d > 0 ) moveHori( x + d, y, -1 ); }\n    }\n    void move( movDir d )\n    {\n\tswitch( d )\n\t{\n\t    case UP:\n\t    \tfor( int x = 0; x < 4; x++ )\n\t\t{\n\t\t    int y = 1;\n\t\t    while( y < 4 )\n\t\t    { if( board[x][y].val ) moveVert( x, y, -1 ); y++;}\n\t\t}\n\t\tbreak;\n\t    case DOWN:\n\t\tfor( int x = 0; x < 4; x++ )\n\t\t{\n\t\t    int y = 2;\n\t\t    while( y >= 0 )\n\t\t    { if( board[x][y].val ) moveVert( x, y, 1 ); y--;}\n\t\t}\n\t\tbreak;\n\t    case LEFT:\n\t\tfor( int y = 0; y < 4; y++ )\n\t\t{\n\t\t    int x = 1;\n\t\t    while( x < 4 )\n\t\t    { if( board[x][y].val ) moveHori( x, y, -1 ); x++;}\n\t\t}\n\t\tbreak;\n\t    case RIGHT:\n\t\tfor( int y = 0; y < 4; y++ )\n\t\t{\n\t\t    int x = 2;\n\t\t    while( x >= 0 )\n\t\t    { if( board[x][y].val ) moveHori( x, y, 1 ); x--;}\n\t\t}\n\t}\n    }\n    tile board[4][4];\n    bool win, done, moved;\n    uint score;\n};\nint main( int argc, char* argv[] )\n{\n    srand( static_cast<uint>( time( NULL ) ) );\n    g2048 g; g.loop();\n    return system( \"pause\" );\n}\n",
        "safe": true
    },
    {
        "filename": "2048_35.txt",
        "content": "SCORE: 2024\n\n+------+------+------+------+\n|    2 |    8 |   32 |  256 |\n+------+------+------+------+\n|      |      |    4 |   32 |\n+------+------+------+------+\n|      |      |    2 |    8 |\n+------+------+------+------+\n|      |      |      |    2 |\n+------+------+------+------+\n\n(W)Up (S)Down (A)Left (D)Right\n",
        "safe": true
    },
    {
        "filename": "2048_36.txt",
        "content": "(ns 2048\n  (:require [clojure.string :as str]))\n\n;Preferences\n(def textures {:wall      \"----+\"\n               :cell      \"%4s|\"\n               :cell-edge \"|\"\n               :wall-edge \"+\"})\n\n(def directions {:w :up\n                 :s :down\n                 :a :left\n                 :d :right})\n\n(def field-size {:y 4 :x 4})\n\n;Output\n(defn cells->str [line]\n  (str (:cell-edge textures)\n       (str/join (map (partial format (:cell textures)) line))\n       \"\\n\"))\n\n(defn walls->str [width]\n  (str (:wall-edge textures)\n       (str/join (repeat width (:wall textures)))\n       \"\\n\"))\n\n(defn field->str [field]\n  (let [height (count field)\n        width (count (first field))]\n    (str (str/join (interleave (repeat height (walls->str width))\n                               (map cells->str field)))\n         (walls->str width))))\n\n;Misc\n(defn handle-input []\n  (let [input (read)\n        try-dir ((keyword input) directions)]\n    (if try-dir try-dir (recur))))\n\n(defn get-columns [field]\n  (vec (for [x (range (count (first field)))]\n         (vec (for [y (range (count field))]\n                (get-in field [y x]))))))\n\n(defn reverse-lines [field]\n  (mapv #(vec (reverse %)) field))\n\n(defn padding [coll n sym]\n  (vec (concat coll (repeat n sym))))\n\n(defn find-empties [field]\n  (remove\n    nil?\n    (for [y (range (count field))\n          x (range (count (nth field y)))]\n      (when (= (get-in field [y x]) \\space) [y x]))))\n\n(defn random-add [field]\n  (let [empties (vec (find-empties field))]\n    (assoc-in field\n              (rand-nth empties)\n              (rand-nth (conj (vec (repeat 9 2)) 4)))))\n\n(defn win-check [field]\n  (= 2048\n     (transduce\n       (filter number?)\n       (completing max)\n       0\n       (flatten field))))\n\n(defn lose-check [field]\n  (empty? (filter (partial = \\space) (flatten field))))\n\n(defn create-start-field [y x]\n  (->> (vec (repeat y (vec (repeat x \\space))))\n       (random-add)\n       (random-add)))\n\n;Algo\n(defn lines-by-dir [back? direction field]\n  (case direction\n    :left field\n    :right (reverse-lines field)\n    :down (if back?\n            (get-columns (reverse-lines field))\n            (reverse-lines (get-columns field)))\n    :up (get-columns field)))\n\n(defn shift-line [line]\n  (let [len (count line)\n        line (vec (filter number? line))\n        max-idx (dec (count line))]\n    (loop [new [] idx 0]\n      (if (> idx max-idx)\n          (padding new (- len (count new)) \\space)\n          (if (= (nth line idx) (get line (inc idx)))\n              (recur (conj new (* 2 (nth line idx))) (+ 2 idx))\n              (recur (conj new (nth line idx)) (inc idx)))))))\n\n(defn shift-field [direction field]\n  (->> (lines-by-dir false direction field)\n       (mapv shift-line)\n       (lines-by-dir true direction)))\n\n(defn handle-turn [field]\n  (let [direction (handle-input)]\n    (->> (shift-field direction field)\n         (random-add))))\n\n(defn play-2048 []\n  (loop [field (create-start-field (:y field-size) (:x field-size))]\n    (println (field->str field))\n    (cond (win-check field) (println \"You win\")\n          (lose-check field) (println \"You lose\")\n          :default (recur (handle-turn field)))))\n\n(play-2048)\n",
        "safe": true
    },
    {
        "filename": "2048_37.txt",
        "content": "+----+----+----+----+\n|    |   2|    |    |\n+----+----+----+----+\n|   2|    |    |    |\n+----+----+----+----+\n|   4|    |    |    |\n+----+----+----+----+\n|  16|   2|    |    |\n+----+----+----+----+",
        "safe": true
    },
    {
        "filename": "2048_38.txt",
        "content": "(ql:quickload '(cffi alexandria))\n\n(defpackage :2048-lisp\n  (:use :common-lisp :cffi :alexandria))\n\n(in-package :2048-lisp)\n\n(defvar *lib-loaded* nil)\n\n(unless *lib-loaded*\n  ;; Load msvcrt.dll to access _getch.\n  (define-foreign-library msvcrt\n    (:windows (:default \"msvcrt\")))\n\n  (use-foreign-library msvcrt)\n\n  (defcfun \"_getch\" :int)\n\n  (setf *lib-loaded* t))\n\n(defun read-arrow ()\n  \"Get an arrow key from input as UP, DOWN, LEFT, or RIGHT, otherwise\nreturn a char of whatever was pressed.\"\n  (let ((first-char (-getch)))\n    (if (= 224 first-char)\n        (case (-getch)\n          (75 'left)\n          (80 'down)\n          (77 'right)\n          (72 'up))\n        (code-char first-char))))\n\n(defmacro swap (place1 place2)\n  \"Exchange the values of two places.\"\n  (let ((temp (gensym \"TEMP\")))\n    `(cl:let ((,temp ,place1))\n       (cl:setf ,place1 ,place2)\n       (cl:setf ,place2 ,temp))))\n\n(defun nflip (board &optional (left-right t))\n  \"Flip the elements of a BOARD left and right or optionally up and down.\"\n  (let* ((y-len (array-dimension board 0))\n         (x-len (array-dimension board 1))\n         (y-max (if left-right y-len (truncate y-len 2)))\n         (x-max (if left-right (truncate x-len 2) x-len)))\n    (loop for y from 0 below y-max\n       for y-place = (- y-len 1 y) do\n         (loop for x from 0 below x-max\n            for x-place = (- x-len 1 x) do\n              (if left-right\n                  (swap (aref board y x) (aref board y x-place))\n                  (swap (aref board y x) (aref board y-place x)))))\n    board))\n\n(defun flip (board &optional (left-right t))\n  \"Flip the elements of a BOARD left and right or optionally up and down.\nNon-destructive version.\"\n  (nflip (copy-array board) left-right))\n\n(defun transpose (board)\n  \"Transpose the elements of BOARD into a new array.\"\n  (let* ((y-len (array-dimension board 0))\n         (x-len (array-dimension board 1))\n         (new-board (make-array (reverse (array-dimensions board)))))\n    (loop for y from 0 below y-len do\n         (loop for x from 0 below x-len do\n              (setf (aref new-board x y) (aref board y x))))\n    new-board))\n\n(defun add-random-piece (board)\n  \"Find a random empty spot on the BOARD to add a new piece.\nReturn T if successful, NIL otherwise.\"\n  (loop\n     for x from 0 below (array-total-size board)\n     unless (row-major-aref board x)\n     count 1 into count\n     and collect x into indices\n     finally\n       (unless (= 0 count)\n         (setf (row-major-aref board (nth (random count) indices))\n               (if (= 0 (random 10)) 4 2))\n         (return t))))\n\n(defun squash-line (line)\n  \"Reduce a sequence of numbers from left to right according to\nthe rules of 2048. Return the score of squashing as well.\"\n  (let* ((squashed\n          (reduce\n           (lambda (acc x)\n             (if (equal x (car acc))\n                 (cons (list (* 2 x)) (cdr acc))\n                 (cons x acc)))\n           (nreverse (remove-if #'null line))\n           :initial-value nil))\n         (new-line (flatten squashed)))\n    (list (append (make-list (- (length line) (length new-line))) new-line)\n          (reduce #'+ (flatten (remove-if-not #'listp squashed))))))\n\n(defun squash-board (board)\n  \"Reduce each row of a board from left to right according to\nthe rules of 2048. Return the total score of squashing the board as well.\"\n  (let ((y-len (array-dimension board 0))\n        (x-len (array-dimension board 1))\n        (total 0))\n    (list (make-array (array-dimensions board) :initial-contents\n                      (loop for y from 0 below y-len\n                         for (line score) =\n                           (squash-line\n                            (make-array x-len\n                                        :displaced-to board\n                                        :displaced-index-offset\n                                        (array-row-major-index board y 0)))\n                         collect line\n                         do (incf total score)))\n          total)))\n\n(defun make-move (board direction)\n  \"Make a move in the given DIRECTION on a new board.\"\n  ;; Move by always squashing right, but transforming the board as needed.\n  (destructuring-bind (new-board score)\n      (case direction\n        (up (squash-board (flip (transpose board))))\n        (down (squash-board (flip (transpose board) nil)))\n        (left (squash-board (nflip (flip board nil))))\n        (right (squash-board board)))\n    (let ((new-board\n           ;; Reverse the transformation.\n           (case direction\n             (up (transpose (nflip new-board)))\n             (down (transpose (nflip new-board nil)))\n             (left (nflip (nflip new-board nil)))\n             (right new-board))))\n      (unless (equalp board new-board)\n        (add-random-piece new-board)\n        (list new-board score)))))\n\n(defun winp (board winning-tile)\n  \"Determine if a BOARD is in a winning state.\"\n  (loop for x from 0 below (array-total-size board)\n     for val = (row-major-aref board x)\n     when (eql val winning-tile) do (return t)))\n\n(defun game-overp (board)\n  \"Determine if a BOARD is in a game over state.\"\n  ;; If a move is simulated in every direction and nothing changes,\n  ;; then we can assume there are no valid moves left.\n  (notany (lambda (dir) (car (make-move board dir)))\n          '(up down left right)))\n\n(defun print-divider (cells cell-size)\n  \"A print helper function for PRINT-BOARD.\"\n  (dotimes (_ cells)\n    (princ \"+\")\n    (dotimes (_ cell-size)\n      (princ \"-\")))\n  (princ \"+\")\n  (terpri))\n\n(defun print-board (board cell-size)\n  \"Pretty print the given BOARD with a particular CELL-SIZE.\"\n  (let* ((y-len (array-dimension board 0))\n         (x-len (array-dimension board 1))\n         (super-size (+ 2 cell-size)))\n    (loop for y from 0 below y-len do\n         (print-divider x-len super-size)\n         (loop for x from 0 below x-len\n            for val = (aref board y x)\n            do\n              (princ \"|\")\n              (if val\n                  (format t \" ~VD \" cell-size val)\n                  (dotimes (_ super-size) (princ \" \"))))\n         (princ \"|\")\n         (terpri))\n    (print-divider x-len super-size)))\n\n(defun init-board ()\n  (let ((board (make-array '(4 4) :initial-element nil)))\n    (setf (row-major-aref board (random (array-total-size board))) 2)\n    board))\n\n(defun prompt-input (board score &optional (check t))\n  (cond\n    ((and check (winp board 2048)) (format t \"You win!\"))\n    ((and check (game-overp board)) (format t \"Game over...\"))\n    (t (let ((choice (read-arrow)))\n         (cond\n           ((symbolp choice)\n            (destructuring-bind (&optional move (new-score 0))\n                (make-move board choice)\n              (if move\n                  (prompt move (+ score new-score))\n                  (prompt-input board score))))\n           ((find choice \"qQ\")\n            (format t \"Quitting.\"))\n           (t (prompt-input board score nil)))))))\n\n(defun prompt (&optional (board (init-board)) (score 0))\n  (format t \"~%   Score: ~D~%\" score)\n  (print-board board 4)\n  (prompt-input board score))\n",
        "safe": true
    },
    {
        "filename": "2048_39.txt",
        "content": "* (2048-lisp::prompt)\n\n   Score: 0\n+------+------+------+------+\n|      |      |      |      |\n+------+------+------+------+\n|      |      |      |      |\n+------+------+------+------+\n|      |      |    2 |      |\n+------+------+------+------+\n|      |      |      |      |\n+------+------+------+------+",
        "safe": true
    },
    {
        "filename": "2048_4.txt",
        "content": "               ...[2][2][2] \n",
        "safe": true
    },
    {
        "filename": "2048_40.txt",
        "content": "   Score: 336\n+------+------+------+------+\n|      |    4 |   16 |   32 |\n+------+------+------+------+\n|      |      |    4 |   16 |\n+------+------+------+------+\n|      |      |   32 |      |\n+------+------+------+------+\n|      |    2 |      |      |\n+------+------+------+------+",
        "safe": true
    },
    {
        "filename": "2048_41.txt",
        "content": "import std.stdio, std.string, std.random;\nimport core.stdc.stdlib: exit;\n\nstruct G2048 {\n    void gameLoop() {\n        addTile;\n        while (true) {\n            if (moved)\n                addTile;\n            drawBoard;\n            if (done)\n                break;\n            waitKey;\n        }\n        writeln(win ? \"You win!\" : \"Game Over!\");\n    }\n\nprivate:\n    struct Tile {\n        uint val = 0;\n        bool blocked = false;\n    }\n\n    enum moveDir { up, down, left, right }\n    enum uint side = 4;\n\n    Tile[side][side] board;\n    bool win = false, done = false, moved = true;\n    uint score = 0;\n\n    void drawBoard() const {\n        writeln(\"SCORE: \", score, \"\\n\");\n        foreach (y; 0 .. side) {\n            write(\"+------+------+------+------+\\n| \");\n            foreach (x; 0 .. side) {\n                if (board[x][y].val)\n                    writef(\"%4d\", board[x][y].val);\n                else\n                    writef(\"%4s\", \" \");\n                write(\" | \");\n            }\n            writeln;\n        }\n        writeln(\"+------+------+------+------+\\n\");\n    }\n\n    void waitKey() /*@safe*/ {\n        moved = false;\n        write(\"(W)Up (S)Down (A)Left (D)Right (Q)Quit: \");\n        auto c = readln.strip.toLower;\n\n        switch (c) {\n            case \"w\": move(moveDir.up);    break;\n            case \"a\": move(moveDir.left);  break;\n            case \"s\": move(moveDir.down);  break;\n            case \"d\": move(moveDir.right); break;\n            case \"q\": endGame;             break;\n            default:                       break;\n        }\n\n        foreach (y; 0 .. side)\n            foreach (x; 0 .. side)\n                board[x][y].blocked = false;\n    }\n\n    void endGame() const {\n        writeln(\"Game ended with score: \", score);\n        exit(0);\n    }\n\n    void addTile() {\n        foreach (y; 0 .. side) {\n            foreach (x; 0 .. side) {\n                if (!board[x][y].val) {\n                    uint a, b;\n                    do {\n                        a = uniform(0, side);\n                        b = uniform(0, side);\n                    } while (board[a][b].val);\n\n                    board[a][b].val = (uniform01 > 0.89) ? side : 2;\n                    if (canMove)\n                        return;\n                }\n            }\n        }\n        done = true;\n    }\n\n    bool canMove() const {\n        foreach (y; 0 .. side)\n            foreach (x; 0 .. side)\n                if (!board[x][y].val)\n                    return true;\n\n        foreach (y; 0 .. side) {\n            foreach (x; 0 .. side) {\n                if (testAdd(x + 1, y, board[x][y].val) ||\n                    testAdd(x - 1, y, board[x][y].val) ||\n                    testAdd(x, y + 1, board[x][y].val) ||\n                    testAdd(x, y - 1, board[x][y].val))\n                return true;\n            }\n        }\n        return false;\n    }\n\n    bool testAdd(uint x, uint y, uint v) const {\n        if (x > 3 || y > 3)\n            return false;\n        return board[x][y].val == v;\n    }\n\n    void moveVertically(uint x, uint y, uint d) {\n        if (board[x][y + d].val && board[x][y + d].val == board[x][y].val &&\n            !board[x][y].blocked && !board[x][y + d].blocked) {\n            board[x][y].val = 0;\n            board[x][y + d].val *= 2;\n            score += board[x][y + d].val;\n            board[x][y + d].blocked = true;\n            moved = true;\n        } else if (!board[x][y + d].val && board[x][y].val) {\n            board[x][y + d].val = board[x][y].val;\n            board[x][y].val = 0;\n            moved = true;\n        }\n\n        if (d > 0) {\n            if (y + d < 3)\n                moveVertically(x, y + d,  1);\n        } else {\n            if (y + d > 0)\n                moveVertically(x, y + d, -1);\n        }\n    }\n\n    void moveHorizontally(uint x, uint y, uint d) {\n        if (board[x + d][y].val && board[x + d][y].val == board[x][y].val &&\n            !board[x][y].blocked && !board[x + d][y].blocked) {\n            board[x][y].val = 0;\n            board[x + d][y].val *= 2;\n            score += board[x + d][y].val;\n            board[x + d][y].blocked = true;\n            moved = true;\n        } else if (!board[x + d][y].val && board[x][y].val) {\n            board[x + d][y].val = board[x][y].val;\n            board[x][y].val = 0;\n            moved = true;\n        }\n\n        if (d > 0) {\n            if (x + d < 3)\n                moveHorizontally(x + d, y,  1);\n        } else {\n            if (x + d > 0)\n                moveHorizontally(x + d, y, -1);\n        }\n    }\n\n    void move(moveDir d) {\n        final switch (d) with(moveDir) {\n            case up:\n                foreach (x; 0 .. side)\n                    foreach (y; 1 .. side)\n                        if (board[x][y].val)\n                            moveVertically(x, y, -1);\n                break;\n            case down:\n                foreach (x; 0 .. side)\n                    foreach_reverse (y; 0 .. 3)\n                        if (board[x][y].val)\n                            moveVertically(x, y, 1);\n                break;\n            case left:\n                foreach (y; 0 .. side)\n                    foreach (x; 1 .. side)\n                        if (board[x][y].val)\n                            moveHorizontally(x, y, -1);\n                break;\n            case right:\n                foreach (y; 0 .. side)\n                    foreach_reverse (x; 0 .. 3)\n                        if (board[x][y].val)\n                            moveHorizontally(x, y, 1);\n        }\n    }\n}\n\nvoid main() /*safe*/ {\n    G2048 g;\n    g.gameLoop;\n}\n",
        "safe": true
    },
    {
        "filename": "2048_42.txt",
        "content": "program Game2048;\n\n{$APPTYPE CONSOLE}\n\nuses\n  System.SysUtils,\n  System.Math,\n  Velthuis.Console;\n\ntype\n  TTile = class\n    Value: integer;\n    IsBlocked: Boolean;\n    constructor Create;\n  end;\n\n  TMoveDirection = (mdUp, mdDown, mdLeft, mdRight);\n\n  TG2048 = class\n    FisDone, FisWon, FisMoved: boolean;\n    Fscore: Cardinal;\n    FBoard: array[0..3, 0..3] of TTile;\n    function GetLine(aType: byte): string;\n  public\n    constructor Create;\n    destructor Destroy; override;\n    procedure InitializeBoard();\n    procedure FinalizeBoard();\n    procedure Loop;\n    procedure DrawBoard();\n    procedure WaitKey();\n    procedure AddTile();\n    function CanMove(): boolean;\n    function TestAdd(x, y, value: Integer): boolean;\n    procedure MoveHorizontally(x, y, d: integer);\n    procedure MoveVertically(x, y, d: integer);\n    procedure Move(direction: TMoveDirection);\n  end;\n\n\n{ TTile }\n\nconstructor TTile.Create;\nbegin\n  Value := 0;\n  IsBlocked := false;\nend;\n\n{ TG2048 }\n\nprocedure TG2048.AddTile;\nvar\n  y, x, a, b: Integer;\n  r: Double;\nbegin\n  for y := 0 to 3 do\n  begin\n    for x := 0 to 3 do\n    begin\n      if Fboard[x, y].Value <> 0 then\n        continue;\n      repeat\n        a := random(4);\n        b := random(4);\n      until not (Fboard[a, b].Value <> 0);\n      r := Random;\n      if r > 0.89 then\n        Fboard[a, b].Value := 4\n      else\n        Fboard[a, b].Value := 2;\n      if CanMove() then\n      begin\n        Exit;\n      end;\n    end;\n  end;\n  FisDone := true;\nend;\n\nfunction TG2048.CanMove: boolean;\nvar\n  y, x: Integer;\nbegin\n  for y := 0 to 3 do\n  begin\n    for x := 0 to 3 do\n    begin\n      if Fboard[x, y].Value = 0 then\n      begin\n        Exit(true);\n      end;\n    end;\n  end;\n  for y := 0 to 3 do\n  begin\n    for x := 0 to 3 do\n    begin\n      if TestAdd(x + 1, y, Fboard[x, y].Value) or TestAdd(x - 1, y, Fboard[x, y].Value)\n        or TestAdd(x, y + 1, Fboard[x, y].Value) or TestAdd(x, y - 1, Fboard[x,\n        y].Value) then\n      begin\n        Exit(true);\n      end;\n    end;\n  end;\n  Exit(false);\nend;\n\nconstructor TG2048.Create;\nbegin\n  FisDone := false;\n  FisWon := false;\n  FisMoved := true;\n  Fscore := 0;\n  InitializeBoard();\n  Randomize;\nend;\n\ndestructor TG2048.Destroy;\nbegin\n  FinalizeBoard;\n  inherited;\nend;\n\nprocedure TG2048.DrawBoard;\nvar\n  y, x: Integer;\n  color: byte;\n  lineFragment, line: string;\nbegin\n  ClrScr;\n  HighVideo;\n  writeln('Score: ', Fscore: 3, #10);\n  TextBackground(White);\n  TextColor(black);\n  for y := 0 to 3 do\n  begin\n    if y = 0 then\n      writeln(GetLine(0))\n    else\n      writeln(GetLine(1));\n\n    Write('  '#$2551' ');\n    for x := 0 to 3 do\n    begin\n      if Fboard[x, y].Value = 0 then\n      begin\n        Write('    ');\n      end\n      else\n      begin\n        color := Round(Log2(Fboard[x, y].Value));\n        TextColor(14 - color);\n        Write(Fboard[x, y].Value: 4);\n        TextColor(Black);\n      end;\n      Write(' '#$2551' ');\n    end;\n    writeln(' ');\n  end;\n  writeln(GetLine(2), #10#10);\n  TextBackground(Black);\n  TextColor(White);\nend;\n\nprocedure TG2048.FinalizeBoard;\nvar\n  y, x: integer;\nbegin\n  for y := 0 to 3 do\n    for x := 0 to 3 do\n      FBoard[x, y].Free;\nend;\n\nfunction TG2048.GetLine(aType: byte): string;\nvar\n  fragment, line: string;\n  bgChar, edChar, mdChar: char;\nbegin\n\n  case aType of\n    0:\n      begin\n        bgChar := #$2554;\n        edChar := #$2557;\n        mdChar := #$2566;\n      end;\n    1:\n      begin\n        bgChar := #$2560;\n        edChar := #$2563;\n        mdChar := #$256C;\n      end;\n\n    2:\n      begin\n        bgChar := #$255A;\n        edChar := #$255D;\n        mdChar := #$2569;\n      end;\n  end;\n  fragment := string.create(#$2550, 6);\n  line := fragment + mdChar + fragment + mdChar + fragment + mdChar + fragment;\n  Result := '  '+bgChar + line + edChar + '  ';\nend;\n\nprocedure TG2048.InitializeBoard;\nvar\n  y, x: integer;\nbegin\n  for y := 0 to 3 do\n    for x := 0 to 3 do\n      FBoard[x, y] := TTile.Create;\nend;\n\nprocedure TG2048.Loop;\nbegin\n  AddTile();\n  while (true) do\n  begin\n    if (FisMoved) then\n      AddTile();\n\n    DrawBoard();\n    if (FisDone) then\n      break;\n\n    WaitKey();\n  end;\n\n  if FisWon then\n    Writeln('You''ve made it!')\n  else\n    Writeln('Game Over!');\nend;\n\nprocedure TG2048.Move(direction: TMoveDirection);\nvar\n  x, y: Integer;\nbegin\n  case direction of\n    mdUp:\n      begin\n        for x := 0 to 3 do\n        begin\n          y := 1;\n          while y < 4 do\n          begin\n            if Fboard[x, y].Value <> 0 then\n              MoveVertically(x, y, -1);\n            Inc(y);\n          end;\n        end;\n      end;\n    mdDown:\n      begin\n        for x := 0 to 3 do\n        begin\n          y := 2;\n          while y >= 0 do\n          begin\n            if Fboard[x, y].Value <> 0 then\n              MoveVertically(x, y, 1);\n            Dec(y);\n          end;\n        end;\n      end;\n    mdLeft:\n      begin\n        for y := 0 to 3 do\n        begin\n          x := 1;\n          while x < 4 do\n          begin\n            if Fboard[x, y].Value <> 0 then\n              MoveHorizontally(x, y, -1);\n            Inc(x);\n          end;\n        end;\n      end;\n    mdRight:\n      begin\n        for y := 0 to 3 do\n        begin\n          x := 2;\n          while x >= 0 do\n          begin\n            if Fboard[x, y].Value <> 0 then\n              MoveHorizontally(x, y, 1);\n            Dec(x);\n          end;\n        end;\n      end;\n  end;\nend;\n\nprocedure TG2048.MoveHorizontally(x, y, d: integer);\nbegin\n  if (FBoard[x + d, y].Value <> 0) and (FBoard[x + d, y].Value = FBoard[x, y].Value)\n    and (not FBoard[x + d, y].IsBlocked) and (not FBoard[x, y].IsBlocked) then\n  begin\n    FBoard[x, y].Value := 0;\n    FBoard[x + d, y].Value := FBoard[x + d, y].Value * 2;\n    Fscore := Fscore + (FBoard[x + d, y].Value);\n    FBoard[x + d, y].IsBlocked := true;\n    FisMoved := true;\n  end\n  else if ((FBoard[x + d, y].Value = 0) and (FBoard[x, y].Value <> 0)) then\n  begin\n    FBoard[x + d, y].Value := FBoard[x, y].Value;\n    FBoard[x, y].Value := 0;\n    FisMoved := true;\n  end;\n  if d > 0 then\n  begin\n    if x + d < 3 then\n    begin\n      MoveHorizontally(x + d, y, 1);\n    end;\n  end\n  else\n  begin\n    if x + d > 0 then\n    begin\n      MoveHorizontally(x + d, y, -1);\n    end;\n  end;\nend;\n\nprocedure TG2048.MoveVertically(x, y, d: integer);\nbegin\n  if (Fboard[x, y + d].Value <> 0) and (Fboard[x, y + d].Value = Fboard[x, y].Value)\n    and (not Fboard[x, y].IsBlocked) and (not Fboard[x, y + d].IsBlocked) then\n  begin\n    Fboard[x, y].Value := 0;\n    Fboard[x, y + d].Value := Fboard[x, y + d].Value * 2;\n    Fscore := Fscore + (Fboard[x, y + d].Value);\n    Fboard[x, y + d].IsBlocked := true;\n    FisMoved := true;\n  end\n  else if ((Fboard[x, y + d].Value = 0) and (Fboard[x, y].Value <> 0)) then\n  begin\n    Fboard[x, y + d].Value := Fboard[x, y].Value;\n    Fboard[x, y].Value := 0;\n    FisMoved := true;\n  end;\n  if d > 0 then\n  begin\n    if y + d < 3 then\n    begin\n      MoveVertically(x, y + d, 1);\n    end;\n  end\n  else\n  begin\n    if y + d > 0 then\n    begin\n      MoveVertically(x, y + d, -1);\n    end;\n  end;\nend;\n\nfunction TG2048.TestAdd(x, y, value: Integer): boolean;\nbegin\n  if (x < 0) or (x > 3) or (y < 0) or (y > 3) then\n    Exit(false);\n\n  Exit(Fboard[x, y].value = value);\nend;\n\nprocedure TG2048.WaitKey;\nvar\n  y, x: Integer;\nbegin\n  FisMoved := false;\n  writeln('(W) Up (S) Down (A) Left (D) Right (ESC)Exit');\n  case ReadKey of\n    'W', 'w':\n      Move(TMoveDirection.mdUp);\n    'A', 'a':\n      Move(TMoveDirection.mdLeft);\n    'S', 's':\n      Move(TMoveDirection.mdDown);\n    'D', 'd':\n      Move(TMoveDirection.mdRight);\n    #27:\n      FisDone := true;\n  end;\n\n  for y := 0 to 3 do\n    for x := 0 to 3 do\n      Fboard[x, y].IsBlocked := false;\nend;\n\nvar\n  Game: TG2048;\nbegin\n  with TG2048.Create do\n  begin\n    Loop;\n    Free;\n  end;\n  Writeln('Press Enter to exit');\n  Readln;\nend.\n",
        "safe": true
    },
    {
        "filename": "2048_43.txt",
        "content": "Score: 6472\n\n  \u2554\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2557\n  \u2551    2 \u2551    8 \u2551    2 \u2551    4 \u2551\n  \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n  \u2551   16 \u2551   64 \u2551    8 \u2551   64 \u2551\n  \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n  \u2551    8 \u2551  512 \u2551  256 \u2551    2 \u2551\n  \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n  \u2551    2 \u2551    4 \u2551   16 \u2551    4 \u2551\n  \u255a\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u255d\n\n\nGame Over!\nPress Enter to exit\n",
        "safe": true
    },
    {
        "filename": "2048_44.txt",
        "content": "defmodule Game2048 do\n  @size 4\n  @range 0..@size-1\n  \n  def play(goal \\\\ 2048), do: setup() |> play(goal)\n  \n  defp play(board, goal) do\n    show(board)\n    cond do\n      goal in Map.values(board) ->\n          IO.puts \"You win!\"\n          exit(:normal)\n      0 in Map.values(board) or combinable?(board) ->\n          moved = move(board, keyin())\n          if moved == board, do: play(board, goal), else: add_tile(moved) |> play(goal)\n      true ->\n          IO.puts \"Game Over!\"\n          exit(:normal)\n    end\n  end\n  \n  defp setup do\n    (for i <- @range, j <- @range, into: %{}, do: {{i,j},0})\n    |> add_tile\n    |> add_tile\n  end\n  \n  defp add_tile(board) do\n    position = blank_space(board) |> Enum.random\n    tile = if :rand.uniform(10)==1, do: 4, else: 2\n    %{board | position => tile}\n  end\n  \n  defp blank_space(board) do\n    for {key, 0} <- board, do: key\n  end\n  \n  defp keyin do\n    key = IO.gets(\"key in wasd or q: \")\n    case String.first(key) do\n      \"w\" -> :up\n      \"a\" -> :left\n      \"s\" -> :down\n      \"d\" -> :right\n      \"q\" -> exit(:normal)\n      _   -> keyin()\n    end\n  end\n  \n  defp move(board, :up) do\n    Enum.reduce(@range, board, fn j,acc ->\n      Enum.map(@range, fn i -> acc[{i,j}] end)\n      |> move_and_combine\n      |> Enum.with_index\n      |> Enum.reduce(acc, fn {v,i},map -> Map.put(map, {i,j}, v) end)\n    end)\n  end\n  defp move(board, :down) do\n    Enum.reduce(@range, board, fn j,acc ->\n      Enum.map(@size-1..0, fn i -> acc[{i,j}] end)\n      |> move_and_combine\n      |> Enum.reverse\n      |> Enum.with_index\n      |> Enum.reduce(acc, fn {v,i},map -> Map.put(map, {i,j}, v) end)\n    end)\n  end\n  defp move(board, :left) do\n    Enum.reduce(@range, board, fn i,acc ->\n      Enum.map(@range, fn j -> acc[{i,j}] end)\n      |> move_and_combine\n      |> Enum.with_index\n      |> Enum.reduce(acc, fn {v,j},map -> Map.put(map, {i,j}, v) end)\n    end)\n  end\n  defp move(board, :right) do\n    Enum.reduce(@range, board, fn i,acc ->\n      Enum.map(@size-1..0, fn j -> acc[{i,j}] end)\n      |> move_and_combine\n      |> Enum.reverse\n      |> Enum.with_index\n      |> Enum.reduce(acc, fn {v,j},map -> Map.put(map, {i,j}, v) end)\n    end)\n  end\n  \n  defp move_and_combine(tiles) do\n    (Enum.filter(tiles, &(&1>0)) ++ [0,0,0,0])\n    |> Enum.take(@size)\n    |> case do\n         [a,a,b,b] -> [a*2, b*2, 0, 0]\n         [a,a,b,c] -> [a*2, b, c, 0]\n         [a,b,b,c] -> [a, b*2, c, 0]\n         [a,b,c,c] -> [a, b, c*2, 0]\n         x         -> x\n       end\n  end\n  \n  defp combinable?(board) do\n    Enum.any?(for i <- @range, j <- 0..@size-2, do: board[{i,j}]==board[{i,j+1}]) or\n    Enum.any?(for j <- @range, i <- 0..@size-2, do: board[{i,j}]==board[{i+1,j}])\n  end\n  \n  @frame   String.duplicate(\"+----\", @size) <> \"+\"\n  @format (String.duplicate(\"|~4w\", @size) <> \"|\") |> to_charlist   # before 1.3 to_char_list\n  \n  defp show(board) do\n    Enum.each(@range, fn i ->\n      IO.puts @frame\n      row = for j <- @range, do: board[{i,j}]\n      IO.puts (:io_lib.fwrite @format, row) |> to_string |> String.replace(\" 0|\", \"  |\")\n    end)\n    IO.puts @frame\n  end\nend\n\nGame2048.play 512\n",
        "safe": true
    },
    {
        "filename": "2048_45.txt",
        "content": "+----+----+----+----+\n|    |   2|    |    |\n+----+----+----+----+\n|    |    |    |    |\n+----+----+----+----+\n|   2|    |    |    |\n+----+----+----+----+\n|    |    |    |    |\n+----+----+----+----+\nkey in wasd or q: s\n.\n.\n.\n+----+----+----+----+\n|   2|   4|   2|    |\n+----+----+----+----+\n|  16|    |    |    |\n+----+----+----+----+\n|   8|  16|  32|   2|\n+----+----+----+----+\n|  64| 256| 128|   4|\n+----+----+----+----+\nkey in wasd or q: q\n",
        "safe": true
    },
    {
        "filename": "2048_46.txt",
        "content": "module Main exposing (..)\n\nimport Html exposing (Html, div, p, text, button, span, h2)\nimport Html.Attributes exposing (class, style)\nimport Html.Events exposing (onClick)\nimport Keyboard exposing (KeyCode)\nimport Random\nimport Tuple\n\n\nmain =\n    Html.program\n        { init = ( { initialModel | waitingForRandom = True }, generateRandomTiles 2 )\n        , view = view\n        , update = update\n        , subscriptions = always (Keyboard.downs KeyPress)\n        }\n\n\n\n-- MODEL\n\n\n-- tiles either have a value (2, 4, 8, ...) or are empty\ntype alias Tile =\n    Maybe Int\n\n\ntype alias Model =\n    { score : Int\n    , tiles : List Tile\n    , hasLost : Bool\n    , winKeepPlaying : Bool\n    , waitingForRandom : Bool -- prevent user from giving input while waiting for Random Cmd to return\n    }\n\n\ninitialModel : Model\ninitialModel =\n    { score = 0, tiles = List.repeat 16 Nothing, waitingForRandom = False, hasLost = False, winKeepPlaying = False}\n\n\n\n-- UPDATE\n\n\ntype alias RandomTileInfo =\n    ( Int, Int )\n\n\ntype Msg\n    = KeyPress KeyCode\n    | AddRandomTiles (List RandomTileInfo)\n    | NewGame\n    | KeepPlaying\n\n\n\n-- asks the random generator to generate the information required for later adding random tiles\n-- generate a random position for the and value (4 10%, 2 90%) for each tile \n-- this uses Random.pair and Random.list to get a variable number of such pairs with one Cmd\ngenerateRandomTiles : Int -> Cmd Msg\ngenerateRandomTiles num =\n    let\n        randomPosition =\n            Random.int 0 15\n\n        randomValue =\n            Random.int 1 10\n                |> Random.map\n                    (\\rnd ->\n                        if rnd == 10 then\n                            4\n                        else\n                            2\n                    )\n\n        -- 10% chance\n        randomPositionAndValue =\n            Random.pair randomPosition randomValue\n    in\n        Random.list num randomPositionAndValue |> Random.generate AddRandomTiles\n\n\n\n-- actually add a random tile to the model\naddRandomTile : RandomTileInfo -> List Tile -> List Tile\naddRandomTile ( newPosition, newValue ) tiles =\n    let\n        -- newPosition is a value between 0 and 15\n        -- go through the list and count the amount of empty tiles we've seen.\n        -- if we reached the newPosition\u00a0% emptyTileCount'th empty tile, set its value to newValue\n        emptyTileCount =\n            List.filter ((==) Nothing) tiles |> List.length\n\n        -- if there are less than 16 empty tiles this is the number of empty tiles we pass\n        targetCount =\n            newPosition % emptyTileCount\n\n        set_ith_empty_tile tile ( countEmpty, newList ) =\n            case tile of\n                Just value ->\n                    ( countEmpty, (Just value) :: newList )\n\n                Nothing ->\n                    if countEmpty == targetCount then\n                        -- replace this empty tile with the new value\n                        ( countEmpty + 1, (Just newValue) :: newList )\n                    else\n                        ( countEmpty + 1, Nothing :: newList )\n    in\n        List.foldr set_ith_empty_tile ( 0, [] ) tiles |> Tuple.second\n\n\n\n-- core game mechanic: move numbers (to the left,\n-- moving to the right is equivalent to moving left on the reversed array)\n-- this function works on single columns/rows\nmoveNumbers : List Tile -> ( List Tile, Int )\nmoveNumbers tiles =\n    let\n        last =\n            List.head << List.reverse\n    \n        -- init is to last what tail is to head\n        init =\n           List.reverse << List.drop 1 << List.reverse\n\n        doMove tile ( newTiles, addScore ) =\n            case tile of\n                -- omit empty tiles when shifting\n                Nothing ->\n                    ( newTiles, addScore )\n\n                Just value ->\n                    case last newTiles of\n                        -- if the last already moved tile ...\n                        Just (Just value2) ->\n                            -- ... has the same value, add a tile with the summed value\n                            if value == value2 then\n                                ( (init newTiles) ++ [ Just (2 * value) ]\n                                , addScore + 2 * value )\n                            else\n                                -- ... else just add the tile\n                                ( newTiles ++ [ Just value ], addScore )\n\n                        _ ->\n                            -- ... else just add the tile\n                            ( newTiles ++ [ Just value ], addScore )\n\n        ( movedTiles, addScore ) =\n            List.foldl doMove ( [], 0 ) tiles\n    in\n        ( movedTiles ++ List.repeat (4 - List.length movedTiles) Nothing, addScore )\n\n\nupdate : Msg -> Model -> ( Model, Cmd Msg )\nupdate msg model =\n    case msg of\n        -- new game button press\n        NewGame ->\n            if not model.waitingForRandom then\n                ( { initialModel | waitingForRandom = True }, generateRandomTiles 2 )\n            else\n                ( model, Cmd.none )\n\n        -- \"keep playing\" button on win screen\n        KeepPlaying ->\n            ( { model | winKeepPlaying = True }, Cmd.none)\n\n        -- Random generator Cmd response\n        AddRandomTiles tileInfos ->\n            let\n                newTiles =\n                    List.foldl addRandomTile model.tiles tileInfos\n            in\n                ( { model | tiles = newTiles, waitingForRandom = False }, Cmd.none )\n\n\n        KeyPress code ->\n            let\n                -- zip list and indices, apply filter, unzip\n                indexedFilter func list =\n                    List.map2 (,) (List.range 0 (List.length list - 1)) list\n                        |> List.filter func\n                        |> List.map Tuple.second\n\n                -- the i'th row (of 4) contains elements i*4, i*4+1, i*4+2, i*4+3\n                -- so all elements for which index//4 == i\n                i_th_row list i =\n                    indexedFilter (((==) i) << (flip (//) 4) << Tuple.first) list\n\n                -- the i'th col (of 4) contain elements i, i+4, i+2*4, i+3*4\n                -- so all elements for which index%4 == i\n                i_th_col list i =\n                    indexedFilter (((==) i) << (flip (%) 4) << Tuple.first) list\n            \n                -- rows and columns of the grid\n                rows list =\n                    List.map (i_th_row list) (List.range 0 3)\n\n                cols list =\n                    List.map (i_th_col list) (List.range 0 3)\n\n                -- move each row or column and unzip the results from each call to moveNumbers\n                move =\n                    List.unzip << List.map moveNumbers\n\n                moveReverse =\n                    List.unzip << List.map (Tuple.mapFirst List.reverse << moveNumbers << List.reverse)\n\n                -- concat rows back into a flat array and sum all addScores\n                unrows =\n                    Tuple.mapSecond List.sum << Tuple.mapFirst List.concat\n\n                -- turn columns back into a flat array and sum all addScores\n                uncols =\n                    Tuple.mapSecond List.sum << Tuple.mapFirst (List.concat << cols << List.concat)\n    \n    \n                -- when shifting left or right each row can be (reverse-) shifted separately\n                -- when shifting up or down each column can be (reveerse-) shifted separately\n                ( newTiles, addScore ) =\n                    case code of\n                        37 ->\n                            -- left\n                            unrows <| move <| rows model.tiles\n\n                        38 ->\n                            -- up\n                            uncols <| move <| cols model.tiles\n\n                        39 ->\n                            -- right\n                            unrows <| moveReverse <| rows model.tiles\n\n                        40 ->\n                            -- down\n                            uncols <| moveReverse <| cols model.tiles\n\n                        _ ->\n                            ( model.tiles, 0 )\n                \n               \n                containsEmptyTiles =\n                    List.any ((==) Nothing)\n                    \n                containsAnySameNeighbours : List Tile -> Bool\n                containsAnySameNeighbours list =\n                    let\n                        tail = List.drop 1 list\n                        init = List.reverse <| List.drop 1 <| List.reverse list\n                    in\n                        List.any (uncurry (==)) <| List.map2 (,) init tail\n                hasLost =\n                     -- grid full\n                    (not (containsEmptyTiles newTiles))\n                        -- and no left/right move possible\n                        && (not <| List.any containsAnySameNeighbours <| rows newTiles)\n                        -- and no up/down move possible\n                        && (not <| List.any containsAnySameNeighbours <| cols newTiles)\n\n                ( cmd, waiting ) =\n                    if List.all identity <| List.map2 (==) model.tiles newTiles then\n                        ( Cmd.none, False )\n                    else\n                        ( generateRandomTiles 1, True )\n\n                score =\n                    model.score + addScore\n            in\n                -- unsure whether this actually happens but regardless:\n                -- keep the program from accepting a new keyboard input when a new tile hasn't been spawned yet\n                if model.waitingForRandom then\n                    ( model, Cmd.none )\n                else\n                    ( { model | tiles = newTiles, waitingForRandom = waiting, score = score, hasLost = hasLost }, cmd )\n\n\n\n\n-- VIEW\n\n\ncontainerStyle : List ( String, String )\ncontainerStyle =\n    [ ( \"width\", \"450px\" )\n    , ( \"height\", \"450px\" )\n    , ( \"background-color\", \"#bbada0\" )\n    , ( \"float\", \"left\" )\n    , ( \"border-radius\", \"6px\")\n    ]\n\n\ntileStyle : Int -> List ( String, String )\ntileStyle value =\n    let\n        color =\n            case value of\n                0 ->\n                    \"#776e65\"\n\n                2 ->\n                    \"#eee4da\"\n\n                4 ->\n                    \"#ede0c8\"\n\n                8 ->\n                    \"#f2b179\"\n\n                16 ->\n                    \"#f59563\"\n\n                32 ->\n                    \"#f67c5f\"\n\n                64 ->\n                    \"#f65e3b\"\n\n                128 ->\n                    \"#edcf72\"\n\n                256 ->\n                    \"#edcc61\"\n\n                512 ->\n                    \"#edc850\"\n\n                1024 ->\n                    \"#edc53f\"\n\n                2048 ->\n                    \"#edc22e\"\n\n                _ ->\n                    \"#edc22e\"\n    in\n        [ ( \"width\", \"100px\" )\n        , ( \"height\", \"70px\" )\n        , ( \"background-color\", color )\n        , ( \"float\", \"left\" )\n        , ( \"margin-left\", \"10px\" )\n        , ( \"margin-top\", \"10px\" )\n        , ( \"padding-top\", \"30px\" )\n        , ( \"text-align\", \"center\" )\n        , ( \"font-size\", \"30px\" )\n        , ( \"font-weight\", \"bold\" )\n        , ( \"border-radius\", \"6px\")\n        ]\n\n\nviewTile : Tile -> Html Msg\nviewTile tile =\n    div [ style <| tileStyle <| Maybe.withDefault 0 tile ]\n        [ span [] [ text <| Maybe.withDefault \"\" <| Maybe.map toString tile ]\n        ]\n\n\nviewGrid : List Tile -> Html Msg\nviewGrid tiles =\n    div [ style containerStyle ] <| List.map viewTile tiles\n\n\nviewLost : Html Msg\nviewLost =\n    div\n        [ style containerStyle ]\n        [ div\n            [ style [ ( \"text-align\", \"center\" ) ] ]\n            [ h2 [] [ text \"You lost!\" ]\n            ]\n        ]\n\nviewWin : Html Msg\nviewWin =\n    div\n        [ style containerStyle ]\n        [ div\n            [ style [ ( \"text-align\", \"center\" ) ] ]\n            [ h2 [] [ text \"Congratulations, You won!\" ]\n            , button\n                [ style [ ( \"margin-bottom\", \"16px\" ), ( \"margin-top\", \"16px\" ) ], onClick KeepPlaying ]\n                [ text \"Keep playing\" ]\n            ]\n        ]\n\n\nview : Model -> Html Msg\nview model =\n    div [ style [ ( \"width\", \"450px\" ) ] ]\n        [ p [ style [ ( \"float\", \"left\" ) ] ] [ text <| \"Your Score: \" ++ toString model.score ]\n        , button\n            [ style [ ( \"margin-bottom\", \"16px\" ), ( \"margin-top\", \"16px\" ), ( \"float\", \"right\" ) ], onClick NewGame ]\n            [ text \"New Game\" ]\n        , if model.hasLost then\n            viewLost\n          else if List.any ((==) (Just 2048)) model.tiles && not model.winKeepPlaying then\n            viewWin\n          else\n            viewGrid model.tiles\n        ]\n",
        "safe": true
    },
    {
        "filename": "2048_47.txt",
        "content": "// the board is represented with a list of 16 integers\nlet empty = List.init 16 (fun _ -> 0)\nlet win = List.contains 2048 \n\n// a single movement (a hit) consists of stacking and then possible joining\nlet rec stack = function\n    | 0 :: t -> stack t @ [0]\n    | h :: t -> h :: stack t\n    | [] -> []\nlet rec join = function\n    | a :: b :: c when a = b -> (a + b :: join c) @ [0]\n    | a :: b -> a :: join b\n    | [] -> []\nlet hit = stack >> join\nlet hitBack = List.rev >> hit >> List.rev\nlet rows = List.chunkBySize 4\nlet left = rows >> List.map hit >> List.concat\nlet right = rows >> List.map hitBack >> List.concat\nlet up = rows >> List.transpose >> List.map hit >> List.transpose >> List.concat\nlet down = rows >> List.transpose >> List.map hitBack >> List.transpose >> List.concat\n\nlet lose g = left g = g && right g = g && up g = g && down g = g\n\n// spawn a 2 or occasionally a 4 at a random unoccupied position\nlet random = System.Random()\nlet spawnOn g =\n    let newTileValue = if random.Next 10 = 0 then 4 else 2\n    let numZeroes = List.filter ((=) 0) >> List.length\n    let newPosition = g |> numZeroes |> random.Next\n    let rec insert what where = function\n        | 0 :: tail when numZeroes tail = where -> what :: tail\n        | h :: t -> h :: insert what where t\n        | [] -> []\n    insert newTileValue newPosition g\n\nlet show =\n    let line = List.map (sprintf \"%4i\") >> String.concat \" \"\n    rows >> List.map line >> String.concat \"\\n\" >> printf \"\\n%s\\n\"\n\n// use an empty list as a sign of user interrupt\nlet quit _ = []\nlet quitted = List.isEmpty\n\nlet dispatch = function | 'i' -> up | 'j' -> left | 'k' -> down | 'l' -> right | 'q' -> quit | _ -> id\nlet key() = System.Console.ReadKey().KeyChar |> char\nlet turn state =\n    show state\n    let nextState = (key() |> dispatch) state\n    if nextState <> state && not (quitted nextState) then spawnOn nextState else nextState\n\nlet play() =\n    let mutable state = spawnOn empty\n    while not (win state || lose state || quitted state) do state <- turn state\n    if quitted state then printfn \"User interrupt\" else\n        show state\n        if win state then printf \"You win!\"\n        if lose state then printf \"You lose!\"\n\nplay()\n",
        "safe": true
    },
    {
        "filename": "2048_48.txt",
        "content": "USE: accessors\nFROM: arrays => <array> array ;\nFROM: assocs => assoc-filter keys zip ;\nFROM: combinators => case cleave cond ;\nFROM: combinators.short-circuit => 1|| 1&& 2&& ;\nFROM: continuations => cleanup ;\nFROM: formatting => printf sprintf ;\nFROM: fry => '[ _ ;\nFROM: grouping => all-equal? clump group ;\nFROM: io => bl flush nl readln write ;\nFROM: kernel => = 2bi 2dup 2drop and bi bi* bi@ boa boolean clone equal? dip drop dup if if* keep loop nip not over swap throw tri unless when with xor ;\nFROM: math => integer times * + > >= ;\nFROM: math.functions => ^ ;\nFROM: math.parser => hex> ;\nFROM: math.order => +lt+ +gt+ +eq+ ;\nFROM: random => random sample ;\nFROM: sequences => <iota> <repetition> any? all? append concat each first flip head if-empty interleave length map pop push reduce reverse second set-nth tail ;\nFROM: sorting => sort ;\nFROM: vectors => <vector> ;\nIN: 2048-game\n\n\nERROR: invalid-board ;\n\nSYMBOL: left\nSYMBOL: right\nSYMBOL: up\nSYMBOL: down\n\nTUPLE: tile\n{ level integer }\n;\n\nTUPLE: board\n{ width integer }\n{ height integer }\n{ tiles array }\n;\n\nM: tile equal?\n    {\n        [ and ] ! test for f\n        [ [ level>> ] bi@ = ]\n    }\n    2&&\n;\n\n: valid-board? ( w h -- ? )\n    * 0 > ! board with 0 tiles does not have a meaningful representation\n;\n\n: <board> ( w h -- board )\n    [ valid-board? [ invalid-board throw ] unless ]\n    [ 2dup * f <array> board boa ] 2bi\n;\n\n: <tile> ( n -- tile ) \n    tile boa\n;\n\n! 1 in 10 tile starts as 4\n: new-tile ( -- tile )\n    10 random 0 = [ 2 ] [ 1 ] if\n    <tile>\n;\n\n<PRIVATE\n\n: space-left? ( board -- ? )\n    tiles>> [ f = ] any?\n;\n\n: rows>> ( board -- seq )\n    dup tiles>>\n    [ drop { } ] [ swap width>> group ] if-empty\n;\n\n: rows<< ( seq board -- )\n    [ concat ] dip tiles<<\n;\n\n: columns>> ( board -- seq )\n    rows>> flip\n;\n\n: columns<< ( seq board -- )\n    [ flip concat ] dip tiles<<\n;\n\n: change-rows ( board quote -- board )\n    over [ rows>> swap call( seq -- seq ) ] [ rows<< ] bi \n; inline\n\n: change-columns ( board quote -- board )\n    over [ columns>> swap call( seq -- seq ) ] [ columns<< ] bi \n; inline\n\n: can-move-left? ( seq -- ? )\n    {   \n        ! one element seq cannot move\n        [ length 1 = not ]\n        ! empty seq cannot move\n        [ [ f = ] all? not ] \n        [ 2 clump \n            [\n                {\n                    ! test for identical adjescent tiles\n                    [ [ first ] [ second ] bi [ and ] [ = ] 2bi and ] \n                    ! test for empty space on the left and tile on the right\n                    [ [ first ] [ second ] bi [ xor ] [ drop f = ] 2bi and ]\n                } 1||\n            ] any?\n        ]\n    } 1&&\n;\n\n: can-move-direction? ( board direction -- ? )\n    {\n        { left  [ rows>>    [         can-move-left? ] any? ] }\n        { right [ rows>>    [ reverse can-move-left? ] any? ] }\n        { up    [ columns>> [         can-move-left? ] any? ] }\n        { down  [ columns>> [ reverse can-move-left? ] any? ] } \n    } case\n;\n\n: can-move-any? ( board -- ? )\n    { left right up down } [ can-move-direction? ] with any?\n;\n\n: empty-indices ( seq -- seq )\n    [ length <iota> ] keep zip\n    [ nip f = ] assoc-filter keys\n;\n\n: pick-random ( seq -- elem )\n    1 sample first\n;\n\n! create a new tile on an empty space\n: add-tile ( board -- )\n    [ new-tile swap [ empty-indices pick-random ] keep [ set-nth ] keep ] change-tiles drop\n;\n\n! combines equal tiles justified right or does nothing\n: combine-tiles ( tile1 tile2 -- tile3 tile4 )\n    2dup { [ and ] [ = ] } 2&& \n    [ drop [ 1 + ] change-level f swap ] when\n;\n\n: justify-left ( seq -- seq )\n    [   \n        {\n            { [ dup  f = ] [ 2drop +lt+ ] }\n            { [ over f = ] [ 2drop +gt+ ] }\n            [ 2drop +eq+ ]\n        } cond\n    ] sort\n;\n\n: collapse ( seq -- seq )\n    justify-left\n      \n    ! combine adjescent\n    dup length <vector> \n    [ over\n        [ swap [ push ] keep ]\n        [   \n            {\n                [ pop combine-tiles ]\n                [ push ]\n                [ push ] \n            } cleave\n        ] if-empty\n    ] reduce\n    \n    ! fill in the gaps after combination\n    justify-left\n;\n\n! draws an object\nGENERIC: draw ( obj -- )\n\nPRIVATE>\n\n! a single tile is higher than 2048 (level 10)\n: won? ( board -- ? ) \n    tiles>> [ dup [ level>> 11 >= ] when ] any? \n;\n\n! if there is no space left and no neightboring tiles are the same, end the board\n: lost? ( board -- ? ) \n    {\n        [ space-left? ]\n        [ won? ]\n        [ can-move-any? ] \n    } 1|| not\n;\n\n: serialize ( board -- str )\n    [ width>> ]\n    [ height>> ]\n    [ tiles>>\n        [ dup f = [ drop 0 ] [ level>> ] if \"%02x\" sprintf ] map concat\n    ] tri\n    \"%02x%02x%s\" sprintf\n;\n\n: deserialize ( str -- board )\n    [ 2 head hex> ] [ 2 tail ] bi\n    [ 2 head hex> ] [ 2 tail ] bi\n    2 group [ hex> dup 0 = [ drop f ] [ tile boa ] if ] map\n    board boa\n;\n\n: move ( board direction -- )\n    {\n        { left  [ [ [         collapse         ] map ] change-rows    ] }\n        { right [ [ [ reverse collapse reverse ] map ] change-rows    ] }\n        { up    [ [ [         collapse         ] map ] change-columns ] }\n        { down  [ [ [ reverse collapse reverse ] map ] change-columns ] }\n    } case drop\n;\n\n\n: get-input ( -- line )\n    readln\n;\n\n: parse-input ( line -- direction/f )\n    {\n        { \"a\" [ left  ] }\n        { \"d\" [ right ] }\n        { \"w\" [ up    ] }\n        { \"s\" [ down  ] }\n        { \"q\" [ f ] }\n        [ \"Wrong input: %s\\n\" printf flush\n          get-input parse-input ] \n    } case\n;\n\n<PRIVATE\n\n: init ( board -- )\n    '[ _ add-tile ] 2 swap times\n; \n\nM: tile draw ( tile -- )\n    level>> 2 swap ^ \"% 4d\" printf\n;\n\nM: boolean draw ( _ -- )\n    drop 4 [ bl ] times\n;\n\n: horizontal-line ( board -- )\n    width>>\n    \" \" write\n    \"+------\" <repetition> concat\n    write \"+ \" write nl\n;\n\n: separator ( -- )\n    \" | \" write\n;\n\nM: board draw ( board -- )\n    [ horizontal-line ] keep\n    [ rows>> ]\n    [ \n       '[ _ horizontal-line ]\n        [   separator\n            [ separator ] [ draw ] interleave\n            separator nl\n        ] interleave\n    ]\n    [ horizontal-line ]\n    tri\n    flush\n;\n\n: update ( board -- f )\n    {\n        [ \n            get-input parse-input [\n                {\n                    [ can-move-direction? ] \n                    [ over [ move ] [ add-tile ] bi* t ]\n                } 2&& drop t\n            ] [ drop f ] if*\n        ]\n        [ can-move-any? ] \n    } 1&&\n;\n\n: exit ( board -- )\n    { \n        { [ dup lost? ] [ \"You lost! Better luck next time.\" write nl ] }\n        { [ dup won?  ] [ \"You won! Congratulations!\" write nl ] }\n        [ \"Bye!\" write nl ]\n    } cond drop\n;\n\nPRIVATE>\n\n: start-2048 ( -- ) \n    4 4 <board>\n    [ \n        ! Initialization\n        [ init ]\n        [ draw ]\n        ! Event loop\n        [ [ dup [ update ] [ draw ] bi ] loop ] tri\n    ]\n    ! Cleanup\n    [ exit ]\n    [ ]\n    cleanup\n;\n\nMAIN: start-2048\n",
        "safe": true
    },
    {
        "filename": "2048_49.txt",
        "content": "\\ in Forth, you do many things on your own. This word is used to define 2D arrays\n: 2D-ARRAY ( height width )\n\tCREATE DUP ,\n\t* CELLS ALLOT\n\tDOES> ( y x baseaddress )\n\t\tROT    ( x baseaddress y )\n\t\tOVER @ ( x baseaddress y width )\n\t\t*      ( x baseaddress y*width )\n\t\tROT    ( baseaddress y*width x )\n\t\t+ 1+ CELLS +\n;\n\nrequire random.fs\nHERE SEED !\n\n0 CONSTANT D-INVALID\n1 CONSTANT D-UP\n2 CONSTANT D-DOWN\n3 CONSTANT D-LEFT\n4 CONSTANT D-RIGHT\n\n4 CONSTANT NROWS\n4 CONSTANT NCOLS\n\nNROWS NCOLS * CONSTANT GRIDSIZE\nNROWS NCOLS 2D-ARRAY GRID\nCREATE HAVE-MOVED CELL ALLOT\nCREATE TOTAL-SCORE CELL ALLOT\nCREATE MOVE-SCORE CELL ALLOT\n\n: DIE-DIRECTIONCONST .\" Unknown direction constant:\" . BYE ;\n: ESC #ESC EMIT ;\n: CLS\n\tESC .\" [2J\"\n\tESC .\" [H\"\n;\n\n: GRID-VALUE 1 SWAP LSHIFT ;\n: DASHES 0 ?DO [CHAR] - EMIT LOOP ;\n\n: DRAW ( -- )\n\tCLS .\" Score: \"\n\tTOTAL-SCORE @ 0 U.R\n\tMOVE-SCORE  @ ?DUP IF\n\t\t.\"  (+\" 0 U.R .\" )\"\n\tTHEN\n\tCR 25 DASHES CR\n\n\tNROWS 0 ?DO\n\t\t.\" |\"\n\t\tNCOLS 0 ?DO\n\t\t\tJ I GRID @ ?DUP IF\n\t\t\t\tGRID-VALUE 4 U.R\n\t\t\tELSE\n\t\t\t\t4 SPACES\n\t\t\tTHEN\n\t\t\t.\"  |\"\n\t\tLOOP\n\t\tCR\n\tLOOP\n\n\t25 DASHES CR\n;\n\n: COUNT-FREE-SPACES ( -- free-spaces )\n\t0 ( count )\n\tNROWS 0 ?DO\n\t\tNCOLS 0 ?DO\n\t\t\tJ I GRID @ 0= IF 1+ THEN\n\t\tLOOP\n\tLOOP\n;\n\n: GET-FREE-SPACE ( index -- addr )\n\t0 0 GRID SWAP ( curr-addr index )\n\t0 0 GRID @ 0<> IF 1+ THEN\n\t0 ?DO ( find the next free space index times )\n\t\tBEGIN\n\t\t\tCELL+ DUP @ 0=\n\t\tUNTIL\n\tLOOP\n;\n\n: NEW-BLOCK ( -- )\n\tCOUNT-FREE-SPACES\n\tDUP 0<= IF DROP EXIT THEN\n\tRANDOM GET-FREE-SPACE\n\t10 RANDOM 0= IF 2 ELSE 1 THEN SWAP !\n;\n\n: 2GRID ( a-y a-x b-y b-x -- a-addr b-addr ) GRID -ROT GRID SWAP ;\n: CAN-MERGE ( dest-addr other-addr -- can-merge? )\n\t@ SWAP @ ( other-val dest-val )\n\tDUP 0<> -ROT = AND\n;\n\n: CAN-GRAVITY ( dest-addr other-addr -- can-gravity? )\n\t@ SWAP @ ( other-val dest-val )\n\t0= SWAP 0<> AND\n;\n\n: TRY-MERGE ( dest-y dest-x other-y other-x -- )\n\t2GRID ( dest-addr other-addr )\n\t2DUP CAN-MERGE IF\n\t\tTRUE HAVE-MOVED !\n\t\t0 SWAP ! ( dest-addr )\n\t\tDUP @ 1+ DUP ( dest-addr dest-val dest-val )\n\t\tROT ! ( dest-val )\n\t\tGRID-VALUE DUP ( score-diff score-diff )\n\t\tMOVE-SCORE +!\n\t\tTOTAL-SCORE +!\n\tELSE\n\t\t2DROP\n\tTHEN\n;\n\n: TRY-GRAVITY ( did-something-before operator dest-y dest-x other-y other-x -- did-something-after operator )\n\t2GRID ( ... dest-addr other-addr )\n\t2DUP CAN-GRAVITY IF\n\t\tTRUE HAVE-MOVED !\n\t\tDUP @ ( ... dest-addr other-addr other-val )\n\t\tROT ( ... other-addr other-val dest-addr ) ! ( ... other-addr )\n\t\t0 SWAP !\n\t\tNIP TRUE SWAP\n\tELSE\n\t\t2DROP\n\tTHEN\n;\n\n: TRY-LOST? ( lost-before operator dy dx oy ox -- lost-after operator )\n\t2GRID CAN-MERGE INVERT ( lost-before operator lost-now )\n\tROT AND SWAP ( lost-after operator )\n;\n\n: MOVEMENT-LOOP ( direction operator -- ) CASE\n\tSWAP\n\tD-UP OF NROWS 1- 0 ?DO\n\t\tNCOLS 0 ?DO\n\t\t\tJ I J 1+ I 4 PICK EXECUTE\n\t\tLOOP\n\tLOOP ENDOF\n\tD-DOWN OF 1 NROWS 1- ?DO\n\t\tNCOLS 0 ?DO\n\t\t\tJ I J 1- I 4 PICK EXECUTE\n\t\tLOOP\n\t-1 +LOOP ENDOF\n\tD-LEFT OF NCOLS 1- 0 ?DO\n\t\tNROWS 0 ?DO\n\t\t\tI J I J 1+ 4 PICK EXECUTE\n\t\tLOOP\n\tLOOP ENDOF\n\tD-RIGHT OF 1 NCOLS 1- ?DO\n\t\tNROWS 0 ?DO\n\t\t\tI J I J 1- 4 PICK EXECUTE\n\t\tLOOP\n\t-1 +LOOP ENDOF\n\tDIE-DIRECTIONCONST\nENDCASE DROP ;\n\n: MERGE ( move -- ) ['] TRY-MERGE MOVEMENT-LOOP ;\n: GRAVITY-ONCE ( move -- success? ) FALSE SWAP ['] TRY-GRAVITY MOVEMENT-LOOP ;\n: GRAVITY ( move -- )\n\tBEGIN\n\t\tDUP GRAVITY-ONCE INVERT\n\tUNTIL DROP\n;\n\n: MOVE-LOST? ( move -- lost? ) TRUE SWAP ['] TRY-LOST? MOVEMENT-LOOP ;\n: END-IF-LOST ( -- lost? )\n\tCOUNT-FREE-SPACES 0= IF\n\t\tTRUE\n\t\t5 1 DO I MOVE-LOST? AND LOOP\n\t\tIF .\" You lose!\" CR BYE THEN\n\tTHEN\n;\n\n: END-IF-WON ( -- )\n\tNROWS 0 ?DO\n\t\tNCOLS 0 ?DO\n\t\t\tJ I GRID @ GRID-VALUE 2048 = IF .\" You win!\" CR BYE THEN\n\t\tLOOP\n\tLOOP\n;\n\n: TICK ( move -- )\n\tFALSE HAVE-MOVED !\n\t0 MOVE-SCORE !\n\tDUP GRAVITY DUP MERGE GRAVITY\n\tHAVE-MOVED @ IF NEW-BLOCK DRAW THEN\n\tEND-IF-WON\n\tEND-IF-LOST\n;\n\n: GET-MOVE ( -- move )\n\tBEGIN\n\t\tKEY CASE\n\t\t\t#EOF OF BYE ENDOF\n\t\t\t#ESC OF BYE ENDOF\n\t\t\t[CHAR] q OF BYE ENDOF\n\t\t\t[CHAR] Q OF BYE ENDOF\n\t\t\t[CHAR] k OF D-UP TRUE ENDOF\n\t\t\t[CHAR] K OF D-UP TRUE ENDOF\n\t\t\t[CHAR] j OF D-DOWN TRUE ENDOF\n\t\t\t[CHAR] J OF D-DOWN TRUE ENDOF\n\t\t\t[CHAR] h OF D-LEFT TRUE ENDOF\n\t\t\t[CHAR] H OF D-LEFT TRUE ENDOF\n\t\t\t[CHAR] l OF D-RIGHT TRUE ENDOF\n\t\t\t[CHAR] L OF D-RIGHT TRUE ENDOF\n\t\t\tFALSE SWAP\n\t\tENDCASE\n\tUNTIL\n;\n\n: INIT ( -- )\n\tNROWS 0 ?DO\n\t\tNCOLS 0 ?DO\n\t\t\t0 J I GRID !\n\t\tLOOP\n\tLOOP\n\n\t0 TOTAL-SCORE !\n\t0 MOVE-SCORE !\n\tNEW-BLOCK\n\tNEW-BLOCK\n\tDRAW\n;\n\n: MAIN-LOOP ( -- )\n\tBEGIN\n\t\tGET-MOVE TICK\n\tAGAIN\n;\n\nINIT\nMAIN-LOOP\n",
        "safe": true
    },
    {
        "filename": "2048_5.txt",
        "content": "               ......[2][4] \n",
        "safe": true
    },
    {
        "filename": "2048_50.txt",
        "content": "Score: 20136 (+2048)\n-------------------------\n|     |     |     |     |\n|   2 |     |     |     |\n|     |   8 |   2 |     |\n|2048 |   4 |   8 |   2 |\n-------------------------\nYou win!",
        "safe": true
    },
    {
        "filename": "2048_51.txt",
        "content": "        WRITE (MSG,1)\t\t!Roll forth a top/bottom boundary. No corner characters (etc.), damnit.\n    1   FORMAT (\"|\",<NC>(<W>(\"-\"),\"|\"))\t!Heavy reliance on runtime values in NC and W. But see FORMAT 22.\n    2     FORMAT (\"|\",<NC>(<W>(\" \"),\"|\"))\t!No horizontal markings within a tile. See FORMAT 1.\n          WRITE (MSG,22) ((\" \",L1  = 1,W),\"|\",C = 1,NC)\t!Compare to FORMAT 2.\n   22     FORMAT (\"|\",666A1)\t\t\t\t!A constant FORMAT, a tricky WRITE.\n    4     FORMAT (\"|\",<NC - 1>(<W>(\"-\"),\"+\"),<W>(\"-\"),\"|\")\t!With internal + rather than |.\n",
        "safe": true
    },
    {
        "filename": "2048_52.txt",
        "content": "      SUBROUTINE SHOW(NR,NC,BOARD)\t!Mess about.\n       INTEGER NR,NC\t\t!Number of rows and columns.\n       INTEGER BOARD(NR,NC)\t!The board. Actual storage is transposed!\n       INTEGER R,C \t\t!Steppers.\n       INTEGER L,L1\t\t!Fingers.\n       INTEGER W\t\t!A width.\n       PARAMETER (W = 6)\t!Six will suffice for 2048, even 524288.\n       CHARACTER*(NC*(W + 1) + 1) ALINE\n       CHARACTER*1 TL,TR,BL,BR\t!Corner characters: top left, etc. Code page 850, and 437?\n       CHARACTER*1 LR,RL,TD,BU\t!Side joining: Left rightwards, right leftwards, top downwards, bottom upwards.\n       CHARACTER*1 VL,HL,XX\t!Vertical and horizontal lines, line crossing.\n       PARAMETER (TL=CHAR(218),TR=CHAR(191),BL=CHAR(192),BR=CHAR(217))\t!Works for the \"code page\" 437, and 850.\n       PARAMETER (LR=CHAR(195),RL=CHAR(180),TD=CHAR(194),BU=CHAR(193))\t!Try the DOS command CHCP to see which is in use.\n       PARAMETER (VL=CHAR(179),HL=CHAR(196),XX=CHAR(197))\t\t!Attempts to change the code page no longer work...\n       INTEGER MSG\t\t!I/O unit number.\n       COMMON/IODEV/ MSG\t!I talk to the trees...\n        WRITE (MSG,1) TL,((HL,L = 1,W),TD,C = 1,NC - 1),(HL,L = 1,W),TR\t!Write the top edge, with downwards ticks.\n    1   FORMAT (666A1)\t\t!Surely long enough.\n        DO R = 1,NR\t\t!Chug down the rows.\n          WRITE (MSG,1) VL,((\" \",L=1,W),VL,C = 1,NC - 1),(\" \",L=1,W),VL\t!Space vertically to make the tile look less rectangular.\n          WRITE (ALINE,3) (VL,BOARD(R,C),C = 1,NC),VL\t!The columns of the row. Usage is BOARD(row,col) despite storage adjacency.\n    3     FORMAT (<NC>(A1,I<W>),A1)\t!Fixed sizes might suffice.\n          DO C = 1,NC\t\t\t!Now inspect each cell along the line.\n            L1  = 1 + (C - 1)*(W + 1) + 1\t!Locate the first interior character.\n            IF (BOARD(R,C).LE.0) THEN\t\t!Should this one be blank?\n              ALINE(L1 + W - 1:L1 + W - 1) = \" \"\t!Yes. Scrub the lone zero at the end of the span.\n             ELSE\t\t\t\t!Non blank, but, aligned right.\n              L = L1\t\t\t\t\t!So, look for the first digit.\n              DO WHILE(ALINE(L:L).EQ.\" \")\t\t!There is surely one digit to be found.\n                L = L + 1\t\t\t\t\t!Not yet. Advance.\n              END DO\t\t\t\t\t!End with L fingering the first digit.\n              IF (L.GT.L1) ALINE(L1 + (L - L1 + 1)/2:L1 + W - 1) =\t!Halve (approx.) the spare space at the start.\n     &                     ALINE(L:L1 + W - 1)\t\t!The first digit to the last digit.\n            END IF\t\t\t\t!So much for that line segment.\n          END DO\t\t\t!On to the next column.\n          WRITE (MSG,\"(A)\") ALINE\t!Roll the fancy line, all in one go.\n          WRITE (MSG,1) VL,((\" \",L=1,W),VL,C = 1,NC - 1),(\" \",L=1,W),VL\t!More vertical space.\n          IF (R.LT.NR) WRITE (MSG,1) LR,((HL,L = 1,W),XX,C = 1,NC - 1),\t!Write an internal horizontal seam.\n     &                                   (HL,L = 1,W),RL\t\t!Starting and ending with a horizontal tick.\n        END DO\t\t\t!On to the next row.\n        WRITE (MSG,1) BL,((HL,L = 1,W),BU,C = 1,NC - 1),(HL,L = 1,W),BR\t!Write the bottom edge, witrh upwards ticks.\n      END SUBROUTINE SHOW\t!That was nice.\n\n      PROGRAM PUZZLE\t!Some severe array juggling may indeed cause puzzlement.\n      INTEGER NR,NC,N\t\t\t!Describes the shape of the board.\n      PARAMETER (NR = 4, NC = 4, N = NR*NC)\t!Determines the shape of the board.\n      INTEGER BOARD(NR,NC)\t\t!Thus transpose furrytran's column-major usage. Beware!!!\n      INTEGER BORED(N)\t\t\t!This allows for consecutive comparisons.\n      EQUIVALENCE (BOARD,BORED)\t\t!Because the arrays are in the same place.\n      INTEGER BIJ,PB,CB\t\t\t!Juggles with the values of some  squares.\n      INTEGER STARTVALUE,STARTTILES,TARGET\t!Document the starting value.\n      PARAMETER (TARGET = 2048,STARTVALUE = 2,STARTTILES = 2)\t!Why not start with one?\n      INTEGER SCORE\t\t\t!Count them all.\n      INTEGER I,IT,TRY\t\t\t!Odds and ends.\n      INTEGER LIST(N)\t\t\t!A list.\n      CHARACTER*1 WAYS(4),WAYC(4)\t!In two dimensions, there are four possible ways to move.\n      CHARACTER*4 WAYI\t\t\t!There is no equivalent of INDEX for searching arrays.\n      EQUIVALENCE (WAYS,WAYI)\t\t!But this enables two interpretations of the same storage.\n      PARAMETER (WAYC = (/\"R\",\"U\",\"L\",\"D\"/))\t!These are the names for the available directions.\n      INTEGER W,M,RC,CR,CIJ(2),PIJ(2),WAY(4,2),YAW(4,2)\t!Directions in array index terms.\n      INTEGER RC1(4),RCN(4),RCI(4), CR1(4),CRN(4),CRI(4)\t!Loop control for the directions..\n      PARAMETER (RC1 = (/ 1, 1,NR,NC/), CR1 = (/ 1,NR,NC, 1/))\t!Start values of the first and second loops.\n      PARAMETER (RCN = (/NR,NC, 1, 1/), CRN = (/NC, 1, 1,NR/))\t!End values.\n      PARAMETER (RCI = (/+1,+1,-1,-1/), CRI = (/+1,-1,-1,+1/))\t!Incrementing or decrementing accordingly.\n      PARAMETER (WAY = (/ 1, 0, 1, 0,            0, 1, 0, 1/))\t!The first loop is either the row, or the column.\n      PARAMETER (YAW = (/ 0, 1, 0, 1,            1, 0, 1, 0/))\t!The second loop is the other way around.\n      REAL VALUE\t\t\t!Humph. Yet another interface to a \"random\" number generator.\n      CHARACTER*1 C\t\t!A monocharacter response is anticipated.\n      INTEGER MSG,KBD\t\t!I/O unit numbers.\n      COMMON/IODEV/ MSG,KBD\t!Pass the word.\n\n      KBD = 5\t!Standard input. (Keyboard -> Display screen)\n      MSG = 6\t!Standard output. (Display screen)\n      WRITE (MSG,1) TARGET,NR,NC,STARTVALUE\t!Announce.\n    1 FORMAT (\"To play '\",I0,\"' with \",I0,\" rows and \",I0,\" columns.\",/,\n     1\"On each move, choose a direction (Up, Down, Left, Right)\",/\n     2 \"by typing the single letter U, D, L, R, or, a space to quit.\"/\n     3 \"All squares will be pushed as far as possible that way.\",/\n     4 \"Those meeting with the same number will form one square\",/\n     5 \"with the sum of the numbers, and one becomes blank.\",/\n     6 \"After each move, a random blank square becomes \",I0,/)\n      WRITE (MSG,2)\t!Now for some annoyance.\n    2 FORMAT (\"An integer to start the 'random' number generator: \",$)\t!Not starting a new line.\n      READ (KBD,*) TRY\t!Could use a time-of-day in microseconds, or similar.\n      CALL SEED(TRY)\t!But this enables reproducibility. And cheating.\n\nConcoct a board layout.\n   10 BOARD = 0\t\t\t!Clear for action.\n      DO I = 1,STARTTILES\t!Place the initial tiles, with their starting values.\n   11   CALL RANDOM(VALUE)\t\t!0 <= VALUE < 1.\n        IT = VALUE*N + 1\t\t!1 <= IT <= N. Don't round up!\n        IF (BORED(IT).NE.0) GO TO 11\t!Oops! Flounder towards another tile.\n        BORED(IT) = STARTVALUE\t\t!The beginning.\n      END DO\t\t\t!On to the next.\n      SCORE = STARTVALUE*STARTTILES\t!Save some mental arithmetic.\n      TRY = 0\t\t!No moves made yet.\n\nConsider possible moves. Think in (x,y) but convert those thimks to (row,column). Eurghf.\n   20 TRY = TRY + 1\t\t!Here we go again.\n      CALL SHOW(NR,NC,BOARD)\t!The current state.\n      WAYS = \"\"\t\t\t!No moveable directions are known.\n      DO 21 W = 1,4\t\t!One way or another, consider each possible direction.\n        DO RC = RC1(W),RCN(W),RCI(W)\t!W = 1 = +x: consider each successive row.\n          CIJ = RC*WAY(W,1:2) + CR1(W)*YAW(W,1:2)\t!Finger the first position.\n          DO CR = CR1(W) + CRI(W),CRN(W),CRI(W)\t\t!W = 1; along the columns of the row.\n            PIJ = CIJ\t\t\t\t\t!Retain the previous position.\n            CIJ = RC*WAY(W,1:2) + CR*YAW(W,1:2)\t\t!Convert (RC,CR) to either (RC,CR) or (CR,RC).\n            BIJ = BOARD(CIJ(1),CIJ(2))\t\t\t!Grab the current position's board state.\n            IF ((BOARD(PIJ(1),PIJ(2)).GT.0   .AND. BIJ.EQ.0)\t\t!A non-empty tile to move to an empty one?\n     1      .OR.(BOARD(PIJ(1),PIJ(2)).EQ.BIJ .AND. BIJ.GT.0)) THEN\t!Or, there is a pair, BOARD(CIJ) = BOARD(PIJ),\n              WAYS(W) = WAYC(W)\t\t\t\t\t!Then this direction is available.\n              GO TO 21\t\t\t\t\t\t!No need to seek further opportunities for its use.\n            END IF\t\t\t\t\t!So much for the current position.\n          END DO\t\t\t\t!Advance the scan along direction W.\n        END DO\t\t\t\t!Advance to the next (row or column) at right angles to W.\n   21 CONTINUE\t\t\t!Try another way.\n\nCast forth an invitation, and obtain a choice.\n   30 WRITE (MSG,31) TRY,SCORE,WAYS\t!Summary.\n   31 FORMAT (\"Move\",I4,\", score \",I0,\". Moves \",4A1,$)\t!The $, of course, says \"don't end the line\".\n      IF (ALL(WAYS.EQ.\" \")) GO TO 600\t!A gridlock?\n      WRITE (MSG,32)\t\t\t!Nope. Invite a selection.\n   32 FORMAT (\" ... Your move: \",$)\t!Awaits input, with a new line after pressing \"enter\".\n      IF (COUNT(WAYS.NE.\" \").EQ.1) THEN\t!Or, perhaps it is a choice you can't refuse.\n        W = MAXLOC(ABS(ICHAR(WAYS) - ICHAR(\" \")),DIM = 1)\t!One element's value differes from \" \"...\n        WRITE (MSG,33) WAYS(W)\t\t\t!Sieze control!\n   33   FORMAT (A1,\" is the only possibility!\")\t!Just don't ask for input.\n       ELSE\t\t\t\t!But often, the human can decide.\n        READ (KBD,\"(A)\") C\t\t\t!Just one character. The first one typed.\n        IF (C.LE.\" \") STOP \"Oh well.\"\t\t!Bored, already?\n        I = INDEX(\"ruld\",C)\t\t\t!A lowercase letter may be presented.\n        IF (I.GT.0) C = \"RULD\"(I:I)\t\t!So, convert to uppercase, if worthy.\n        W = INDEX(WAYI,C)\t\t\t!What is it? There is no search of elements of the array WAYS.\n        IF (W.LE.0) THEN\t\t\t!Perhaps it is blocked.\n          WRITE (MSG,34) C\t\t\t\t!Alas.\n   34     FORMAT (\"Not a possible move! \",A)\t\t!Just so.\n          GO TO 30\t\t\t\t\t!Try again.\n        END IF\t\t\t\t\t!So much for suspicion.\n      END IF\t\t\t\t!A move has been chosen.\n\nComplete the selected move. Carefully avoid enabling cascades, so 1122 is pulled right to ..24, not .222 then ..42.\n   40 M = MOD(W + 1,4) + 1\t\t!W is the direction of movement, its inverse, M, faces arrivals.\n      DO RC = RC1(M),RCN(M),RCI(M)\t!Loop through the (rows/columns) at right angles to the selected anti-way.\n        PIJ = RC*WAY(M,1:2) + CR1(M)*YAW(M,1:2)\t!Finger the first square, which may be empty.\n        PB = BOARD(PIJ(1),PIJ(2))\t\t!Load it into my two-element buffer: PB and CB.\n        IF (PB.NE.0) BOARD(PIJ(1),PIJ(2)) = 0\t!It may be returned to the board somewhere else.\n        DO CR = CR1(M) + CRI(M),CRN(M),CRI(M)\t!Step along the (column/row) of the selected anti-direction.\n          CIJ = RC*WAY(M,1:2) + CR*YAW(M,1:2)\t\t!Convert (RC,CR) to either CIJ = (RC,CR) or CIJ = (CR,RC).\n          CB = BOARD(CIJ(1),CIJ(2))\t\t\t!Inspect this square.\n          IF (CB.EQ.0) CYCLE\t\t\t\t!From nothing comes nothing.\n          BOARD(CIJ(1),CIJ(2)) = 0\t\t\t!The board's value now lives precariously in CB.\n          IF (PB.EQ.0) THEN\t\t\t\t!A waiting hole? (And, CB is not empty)\n            PB = CB\t\t\t\t\t\t!Yes. Fill it. More may follow, after spaces.\n          ELSE\t\t\t\t\t\t!Otherwise, two non-zero values are in hand.\n            IF (PB.EQ.CB) THEN\t\t\t\t\t!If they match,\n              PB = PB + CB\t\t\t\t\t\t!Combine the new with the old.\n              CB = 0\t\t\t\t\t\t\t!The new one is gone.\n            END IF\t\t\t\t\t\t!So much for matches.\n            BOARD(PIJ(1),PIJ(2)) = PB\t\t\t\t!Roll the trailing value.\n            PIJ = PIJ + CRI(M)*YAW(M,1:2)\t\t\t!Advance the finger.\n            PB = CB\t\t\t\t\t\t!Shuffle along one.\n          END IF\t\t\t\t\t!So much for that square.\n        END DO\t\t\t\t\t!On to the next one along.\n        IF (PB.GT.0) BOARD(PIJ(1),PIJ(2)) = PB\t!A tail end value?\n      END DO\t\t\t\t!On to the next set.\n\nChoose a random blank square.\n   50 IT = 0\t\t!None have been located. (There is surely one, as a move was possible)\n      DO I = 1,N\t!Step through all the possible squares.\n        IF (BORED(I).LE.0) THEN\t!Empty?\n          IT = IT + 1\t\t\t!Yes. Augment my list.\n          LIST(IT) = I\t\t\t!Recording available squares.\n        END IF\t\t\t!So much for that square.\n      END DO\t\t!On to the next.\n      IF (IT.GT.1) THEN\t!If a choice s available,\n        CALL RANDOM(VALUE)\t!Concoct another: 0 <= VALUE < 1.\n        IT = VALUE*IT + 1\t!And thus with integer truncation, choose an empty square.\n      END IF\t\t!So much for choices.\n      BORED(LIST(IT)) = STARTVALUE\t!Fill the square.\n      SCORE = SCORE + STARTVALUE\t!Might as well keep count.\nCheck for success.\n   60 IF (ALL(BORED.LT.TARGET)) GO TO 20!Hi ho.\n      WRITE (MSG,61)\t\t\t!A success message.\n   61 FORMAT (I0,\" has been reached!\")\t!No fancy colours nor flashing lights, nor even bells.\n      GO TO 20\t\t\t\t!Carry on, anyway.\n\nCurses!\n  600 WRITE (MSG,601)\t\t!Alas.\n  601 FORMAT (\"None! Oh dear.\")\t!Nothing more can be done.\n      END\t!That was fun.\n",
        "safe": true
    },
    {
        "filename": "2048_53.txt",
        "content": "To play '2048' with 4 rows and 4 columns.\nOn each move, choose a direction (Up, Down, Left, Right)\nby typing the single letter U, D, L, R, or, a space to quit.\nAll squares will be pushed as far as possible that way.\nThose meeting with the same number will form one square\nwith the sum of the numbers, and one becomes blank.\nAfter each move, a random blank square becomes 2\n\nAn integer to start the 'random' number generator: 12345\n\u250c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u2510\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u2502      \u2502   2  \u2502      \u2502      \u2502\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u2502      \u2502      \u2502   2  \u2502      \u2502\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2518\nMove   1, score 4. Moves RULD ... Your move: d\n\u250c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u2510\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u2502      \u2502      \u2502   2  \u2502      \u2502\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u2502      \u2502   2  \u2502   2  \u2502      \u2502\n\u2502      \u2502      \u2502      \u2502      \u2502\n\u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2518\nMove   2, score 6. Moves RULD ... Your move:\n",
        "safe": true
    },
    {
        "filename": "2048_54.txt",
        "content": "#define EXTCHAR Chr(255)\n\n'--- Declaration of global variables ---\nDim Shared As Integer gGridSize = 4  'grid size (4 -> 4x4)\nDim Shared As Integer gGrid(gGridSize, gGridSize)\nDim Shared As Integer gScore\nDim Shared As Integer curX, curY\nDim Shared As Integer hasMoved, wasMerge  \n' Don't touch these numbers, seriously\nDim Shared As Integer gOriginX, gOriginY\ngOriginX = 75 'pixel X of top left of grid\ngOriginY = 12 'pixel Y of top right of grida\nDim Shared As Integer gTextOriginX, gTextOriginY, gSquareSide\ngTextOriginX = 11\ngTextOriginY = 3\ngSquareSide = 38 'width/height of block in pixels\n\n'set up all the things!\nDim Shared As Integer gDebug = 0\n\n'--- SUBroutines and FUNCtions ---\nSub addblock\n    Dim As Integer emptyCells(gGridSize * gGridSize, 2)\n    Dim As Integer emptyCellCount = 0\n    Dim As Integer x, y, index, num\n    \n    For x = 0 To gGridSize - 1\n        For y = 0 To gGridSize - 1\n            If gGrid(x, y) = 0 Then\n                emptyCells(emptyCellCount, 0) = x\n                emptyCells(emptyCellCount, 1) = y\n                emptyCellCount += 1\n            End If\n        Next y\n    Next x\n    \n    If emptyCellCount > 0 Then\n        index = Int(Rnd * emptyCellCount)\n        num = Cint(Rnd + 1) * 2\n        gGrid(emptyCells(index, 0), emptyCells(index, 1)) = num\n    End If\nEnd Sub\n\nFunction pad(num As Integer) As String\n    Dim As String strNum = Ltrim(Str(num))\n    \n    Select Case Len(strNum)\n    Case 1: Return \"  \" + strNum + \" \"\n    Case 2: Return \" \" + strNum + \" \"\n    Case 3: Return \" \" + strNum\n    Case 4: Return strNum\n    End Select\nEnd Function\n\nSub drawNumber(num As Integer, xPos As Integer, yPos As Integer)\n    Dim As Integer c, x, y\n    Select Case num\n    Case 0:    c = 16\n    Case 2:    c = 2\n    Case 4:    c = 3\n    Case 8:    c = 4\n    Case 16:   c = 5\n    Case 32:   c = 6\n    Case 64:   c = 7\n    Case 128:  c = 8\n    Case 256:  c = 9\n    Case 512:  c = 10\n    Case 1024: c = 11\n    Case 2048: c = 12\n    Case 4096: c = 13\n    Case 8192: c = 13\n    Case Else: c = 13\n    End Select\n    \n    x = xPos *(gSquareSide + 2) + gOriginX + 1\n    y = yPos *(gSquareSide + 2) + gOriginY + 1\n    Line(x + 1, y + 1)-(x + gSquareSide - 1, y + gSquareSide - 1), c, BF\n    \n    If num > 0 Then\n        Locate gTextOriginY + 1 +(yPos * 5), gTextOriginX +(xPos * 5) : Print \"    \"\n        Locate gTextOriginY + 2 +(yPos * 5), gTextOriginX +(xPos * 5) : Print pad(num)\n        Locate gTextOriginY + 3 +(yPos * 5), gTextOriginX +(xPos * 5)\n    End If\nEnd Sub\n\nFunction getAdjacentCell(x As Integer, y As Integer, d As String) As Integer\n    If (d = \"l\" And x = 0) Or (d = \"r\" And x = gGridSize - 1) Or (d = \"u\" And y = 0) Or (d = \"d\" And y = gGridSize - 1) Then\n        getAdjacentCell = -1\n    Else\n        Select Case d\n        Case \"l\": getAdjacentCell = gGrid(x - 1, y)\n        Case \"r\": getAdjacentCell = gGrid(x + 1, y)\n        Case \"u\": getAdjacentCell = gGrid(x, y - 1)\n        Case \"d\": getAdjacentCell = gGrid(x, y + 1)\n        End Select\n    End If\nEnd Function\n\n'Draws the outside grid(doesn't render tiles)\nSub initGraphicGrid\n    Dim As Integer x, y, gridSide =(gSquareSide + 2) * gGridSize\n    \n    Line(gOriginX, gOriginY)-(gOriginX + gridSide, gOriginY + gridSide), 14, BF 'outer square, 3 thick\n    Line(gOriginX, gOriginY)-(gOriginX + gridSide, gOriginY + gridSide), 1, B 'outer square, 3 thick\n    Line(gOriginX - 1, gOriginY - 1)-(gOriginX + gridSide + 1, gOriginY + gridSide + 1), 1, B\n    Line(gOriginX - 2, gOriginY - 2)-(gOriginX + gridSide + 2, gOriginY + gridSide + 2), 1, B\n    \n    For x = gOriginX + gSquareSide + 2 To gOriginX +(gSquareSide + 2) * gGridSize Step gSquareSide + 2  ' horizontal lines\n        Line(x, gOriginY)-(x, gOriginY + gridSide), 1\n    Next x\n    \n    For y = gOriginY + gSquareSide + 2 To gOriginY +(gSquareSide + 2) * gGridSize Step gSquareSide + 2 ' vertical lines\n        Line(gOriginX, y)-(gOriginX + gridSide, y), 1\n    Next y\nEnd Sub\n\n'Init the(data) grid with 0s\nSub initGrid\n    Dim As Integer x, y\n    For x = 0 To 3\n        For y = 0 To 3\n            gGrid(x, y) = 0\n        Next y\n    Next x\n    \n    addblock\n    addblock\nEnd Sub\n\nSub moveBlock(sourceX As Integer, sourceY As Integer, targetX As Integer, targetY As Integer, merge As Integer)\n    If sourceX < 0 Or sourceX >= gGridSize Or sourceY < 0 Or sourceY >= gGridSize And gDebug = 1 Then\n        Locate 0, 0 : Print \"moveBlock: source coords out of bounds\"\n    End If\n    \n    If targetX < 0 Or targetX >= gGridSize Or targetY < 0 Or targetY >= gGridSize And gDebug = 1 Then\n        Locate 0, 0 : Print \"moveBlock: source coords out of bounds\"\n    End If\n    \n    Dim As Integer sourceSquareValue = gGrid(sourceX, sourceY)\n    Dim As Integer targetSquareValue = gGrid(targetX, targetY)\n    \n    If merge = 1 Then\n        If sourceSquareValue = targetSquareValue Then\n            gGrid(sourceX, sourceY) = 0\n            gGrid(targetX, targetY) = targetSquareValue * 2\n            gScore += targetSquareValue * 2 ' Points!\n        Elseif gDebug = 1 Then\n            Locate 0, 0 : Print \"moveBlock: Attempted to merge unequal sqs\"\n        End If\n    Else\n        If targetSquareValue = 0 Then\n            gGrid(sourceX, sourceY) = 0\n            gGrid(targetX, targetY) = sourceSquareValue\n        Elseif gDebug = 1 Then\n            Locate 0, 0 : Print \"moveBlock: Attempted to move to non-empty block\"\n        End If\n    End If\nEnd Sub\n\nFunction pColor(r As Integer, g As Integer, b As Integer) As Integer\n    Return (r + g * 256 + b * 65536)\nEnd Function\n\nSub moveToObstacle(x As Integer, y As Integer, direcc As String)\n    curX = x : curY = y\n    \n    Do While getAdjacentCell(curX, curY, direcc) = 0\n        Select Case direcc\n        Case \"l\": curX -= 1\n        Case \"r\": curX += 1\n        Case \"u\": curY -= 1\n        Case \"d\": curY += 1\n        End Select\n    Loop\nEnd Sub\n\nSub processBlock(x As Integer, y As Integer, direcc As String)\n    Dim As Integer merge = 0, mergeDirX, mergeDirY\n    If gGrid(x, y) <> 0 Then ' have block\n        moveToObstacle(x, y, direcc) ' figure out where it can be moved to\n        If getAdjacentCell(curX, curY, direcc) = gGrid(x, y) And wasMerge = 0 Then  ' obstacle can be merged with\n            merge = 1\n            wasMerge = 1\n        Else\n            wasMerge = 0\n        End If\n        \n        If curX <> x Or curY <> y Or merge = 1 Then\n            mergeDirX = 0\n            mergeDirY = 0\n            If merge = 1 Then\n                Select Case direcc\n                Case \"l\": mergeDirX = -1\n                Case \"r\": mergeDirX = 1\n                Case \"u\": mergeDirY = -1\n                Case \"d\": mergeDirY = 1\n                End Select\n            End If\n            \n            moveBlock(x, y, curX + mergeDirX, curY + mergeDirY, merge) ' move to before obstacle or merge\n            hasMoved = 1\n        End If\n    End If\nEnd Sub\n\nSub renderGrid\n    Dim As Integer x, y\n    For x = 0 To gGridSize - 1\n        For y = 0 To gGridSize - 1\n            drawNumber(gGrid(x, y), x, y)\n        Next y\n    Next x\nEnd Sub\n\nSub updateScore\n    Locate 1, 10 : Print Using \"Score: #####\"; gScore\nEnd Sub\n\nSub processMove(direcc As String) '' direcc can be 'l', 'r', 'u', or 'd'\n    Dim As Integer x, y\n    hasMoved = 0\n    \n    If direcc = \"l\" Then\n        For y = 0 To gGridSize - 1\n            wasMerge = 0\n            For x = 0 To gGridSize - 1\n                processBlock(x,y,direcc)\n            Next x\n        Next y\n    Elseif direcc = \"r\" Then\n        For y = 0 To gGridSize - 1\n            wasMerge = 0\n            For x = gGridSize - 1 To 0 Step -1\n                processBlock(x,y,direcc)\n            Next x\n        Next y\n    Elseif direcc = \"u\" Then\n        For x = 0 To gGridSize - 1\n            wasMerge = 0\n            For y = 0 To gGridSize - 1\n                processBlock(x,y,direcc)\n            Next y\n        Next x\n    Elseif direcc = \"d\" Then\n        For x = 0 To gGridSize - 1\n            wasMerge = 0\n            For y = gGridSize - 1 To 0 Step -1\n                processBlock(x,y,direcc)\n            Next y\n        Next x\n    End If\n    \n    If hasMoved = 1 Then addblock\n    renderGrid\n    updateScore\nEnd Sub\n\n\n'--- Main Program ---\nScreen 8\nWindowtitle \"2048\"\nPalette 1, pColor(35, 33, 31)\nPalette 2, pColor(46, 46, 51)\nPalette 3, pColor(59, 56, 50)\nPalette 4, pColor(61, 44, 30)\nPalette 5, pColor(61, 37, 25)\nPalette 6, pColor(62, 31, 24)\nPalette 7, pColor(62, 24, 15)\nPalette 8, pColor(59, 52, 29)\nPalette 9, pColor(59, 51, 24)\nPalette 10, pColor(59, 50, 20)\nPalette 11, pColor(59, 49, 16)\nPalette 12, pColor(59, 49, 12)\nPalette 13, pColor(15, 15, 13)\nPalette 14, pColor(23, 22, 20)\n\nRandomize Timer\nCls\nDo\n    initGrid\n    initGraphicGrid\n    renderGrid\n    updateScore\n    \n    gScore = 0\n    \n    Locate 23, 10 : Print \"Move with arrow keys.\"\n    Locate 24, 12 : Print \"(R)estart, (Q)uit\"\n    \n    Dim As String k\n    Do\n        Do\n            k = Inkey\n        Loop Until k <> \"\"\n        \n        Select Case k\n        Case EXTCHAR + Chr(72) 'up\n            processMove(\"u\")\n        Case EXTCHAR + Chr(80) 'down\n            processMove(\"d\")\n        Case EXTCHAR + Chr(77) 'right\n            processMove(\"r\")\n        Case EXTCHAR + Chr(75) 'left\n            processMove(\"l\")\n        Case \"q\", \"Q\", Chr(27) 'escape\n            End\n        Case \"r\", \"R\"\n            Exit Do\n        End Select\n    Loop\nLoop\n",
        "safe": true
    },
    {
        "filename": "2048_55.txt",
        "content": "begin enum 123\n  _lf\n  _rt\n  _dn\n  _up\n  _new\n  _end\nend enum\nstr63 bd\ncolorref color(11)\nbyte zs\n\nvoid local fn initialize\n  subclass window 1, @\"2048\",(0,0,438,438)\n  fn WindowSetBackgroundColor( 1, fn ColorBlack )\n  color(0)  = fn ColorDarkGray\n  color(1)  = fn ColorGray\n  color(2)  = fn ColorLightGray\n  color(3)  = fn ColorBlue\n  color(4)  = fn ColorBrown\n  color(5)  = fn ColorCyan\n  color(6)  = fn ColorGreen\n  color(7)  = fn ColorMagenta\n  color(8)  = fn ColorOrange\n  color(9)  = fn ColorPurple\n  color(10) = fn ColorYellow\n  color(11) = fn ColorRed\nend fn\n\nvoid local  fn drawBoard\n  int x, y,r = 1, add\n  cls\n  for y = 320 to 20 step -100\n    for x = 20 to 320 step 100\n      rect fill (x,y,98,98),color( bd[r] )\n      select bd[r]\n        case <  4\u00a0: add = 40\n        case <  7\u00a0: add = 30\n        case < 10\u00a0: add = 20\n        case else\u00a0: add =  6\n      end select\n      if bd[r] then print\u00a0%(x+add, y+25)2^bd[r]\n      r++\n    next\n  next\nend fn\n\nlocal fn finish( won as bool )\n  CFStringRef s = @\"GAME OVER\"\n  CGRect r      = fn windowContentRect( 1 )\n  r.origin.y   += r.size.height - 20\n  r.size.height = 100\n  window 2,,r,NSwindowStyleMaskBorderless\n  if won\n    fn windowSetBackgroundColor( 2, color(11) )\n    s = @\"CONGRATULATIONS\u2014YOU DID IT!!\"\n    text,24,fn ColorBlack,,NSTextAlignmentCenter\n  else\n    fn windowSetBackgroundColor( 2, fn ColorBlack )\n    text,24,fn ColorWhite,,NSTextAlignmentCenter\n  end if\n  print s\n  button _new,,,@\"New Game\", (229,20,100,32)\n  button _end,,,@\"Quit\",     (109,20,100,32)\nend fn\n\nvoid local  fn newGame\n  int r\n  text @\"Arial bold\", 36, fn ColorBlack, fn ColorClear\n  bd = chr$(0)\n  for r = 1 to 4\n    bd += bd\n  next\n  bd[rnd(16)] ++\n  do\n    r = rnd(16)\n  until bd[r] == 0\n  bd[r]++\n  zs = 14\n  fn drawBoard\nend fn\n\nlocal fn play( st as short, rd as short, cd as short )\n  short a, b, c, t, moved = 0\n  \n  for a = st to st + rd * 3 step rd\n    //  SHIFT\n    t = a\n    for b = a to a + cd * 3 step cd\n      if bd[b]\n        if t <> b then swap bd[t], bd[b]\u00a0: moved ++\n        t += cd\n      end if\n    next\n    //  MERGE\n    for b = a to a + cd * 2 step cd\n      if bd[b] > 0 && bd[b] == bd[b+cd]\n        bd[b]++\u00a0: c = b + cd\n        //  FILL IN\n        while c <> a+cd*3\n          bd[c] = bd[c+cd]\u00a0: c += cd\n        wend\n        bd[c] = 0\n        //  CHECK FOR WIN\n        if bd[b] == 11 then fn drawBoard\u00a0: fn finish( yes )\u00a0: exit fn\n        zs ++\u00a0: moved ++\n      end if\n    next\n  next\n  \n  fn drawBoard\n  if moved == 0 then exit fn\n  \n  //  GROW\n  b = 0\u00a0: c = rnd(zs)\n  while c\n    b ++\n    if bd[b] == 0 then c--\n  wend\n  if rnd(10) - 1 then bd[b]++ else bd[b] = 2\n  zs--\n  timerbegin 0.25\n    fn drawBoard\n  timerend\n  if zs then exit fn\n  \n  //  IS GAME OVER?\n  for a = 1 to 12\n    if bd[a] == bd[a+4] then exit fn\n  next\n  for a = 1 to 13 step 4\n    if bd[a] == bd[a+1] || bd[a+1] == bd[a+2] || bd[a+2] == bd[a+3]\u00ac\n      then exit fn\n    next\n    \n    fn finish( no )\nend fn\n\nlocal fn doDialog(ev as long,tag as long, wnd as long)\n  select ev\n    case _windowKeyDown\u00a0: if window() == 2 then exit fn\n      select fn EventKeyCode\n        case _up \u00a0: fn play(13, 1, -4)\n        case _dn \u00a0: fn play( 1, 1,  4)\n        case _lf \u00a0: fn play( 1, 4,  1)\n        case _rt \u00a0: fn play( 4, 4, -1)\n        case else\u00a0: exit fn\n      end select\n      DialogEventSetBool(yes)\n    case _btnClick\u00a0: window close 2\n      if tag == _end then end\n      fn newGame\n    case _windowWillClose\u00a0: if wnd == 1 then end\n  end select\nend fn\n\nfn initialize\nfn newGame\non dialog fn doDialog\n\nhandleevents",
        "safe": true
    },
    {
        "filename": "2048_56.txt",
        "content": "package main\n\nimport (\n\t\"bufio\"\n\t\"fmt\"\n\t\"log\"\n\t\"math/rand\"\n\t\"os\"\n\t\"os/exec\"\n\t\"strconv\"\n\t\"strings\"\n\t\"text/template\"\n\t\"time\"\n\t\"unicode\"\n\n\t\"golang.org/x/crypto/ssh/terminal\"\n)\n\nconst maxPoints = 2048\nconst (\n\tfieldSizeX = 4\n\tfieldSizeY = 4\n)\nconst tilesAtStart = 2\nconst probFor2 = 0.9\n\ntype button int\n\nconst (\n\t_ button = iota\n\tup\n\tdown\n\tright\n\tleft\n\tquit\n)\n\nvar labels = func() map[button]rune {\n\tm := make(map[button]rune, 4)\n\tm[up] = 'W'\n\tm[down] = 'S'\n\tm[right] = 'D'\n\tm[left] = 'A'\n\treturn m\n}()\nvar keybinding = func() map[rune]button {\n\tm := make(map[rune]button, 8)\n\tfor b, r := range labels {\n\t\tm[r] = b\n\t\tif unicode.IsUpper(r) {\n\t\t\tr = unicode.ToLower(r)\n\t\t} else {\n\t\t\tr = unicode.ToUpper(r)\n\t\t}\n\t\tm[r] = b\n\t}\n\tm[0x03] = quit\n\treturn m\n}()\n\nvar model = struct {\n\tScore int\n\tField [fieldSizeY][fieldSizeX]int\n}{}\n\nvar view = func() *template.Template {\n\tmaxWidth := 1\n\tfor i := maxPoints; i >= 10; i /= 10 {\n\t\tmaxWidth++\n\t}\n\n\tw := maxWidth + 3\n\tr := make([]byte, fieldSizeX*w+1)\n\tfor i := range r {\n\t\tif i%w == 0 {\n\t\t\tr[i] = '+'\n\t\t} else {\n\t\t\tr[i] = '-'\n\t\t}\n\t}\n\trawBorder := string(r)\n\n\tv, err := template.New(\"\").Parse(`SCORE: {{.Score}}\n{{range .Field}}\n` + rawBorder + `\n|{{range .}} {{if .}}{{printf \"%` + strconv.Itoa(maxWidth) + `d\" .}}{{else}}` +\n\t\tstrings.Repeat(\" \", maxWidth) + `{{end}} |{{end}}{{end}}\n` + rawBorder + `\n\n(` + string(labels[up]) + `)Up (` +\n\t\tstring(labels[down]) + `)Down (` +\n\t\tstring(labels[left]) + `)Left (` +\n\t\tstring(labels[right]) + `)Right\n`)\n\tcheck(err)\n\treturn v\n}()\n\nfunc check(err error) {\n\tif err != nil {\n\t\tlog.Panicln(err)\n\t}\n}\n\nfunc clear() {\n\tc := exec.Command(\"clear\")\n\tc.Stdout = os.Stdout\n\tcheck(c.Run())\n}\n\nfunc draw() {\n\tclear()\n\tcheck(view.Execute(os.Stdout, model))\n}\n\nfunc addRandTile() (full bool) {\n\tfree := make([]*int, 0, fieldSizeX*fieldSizeY)\n\n\tfor x := 0; x < fieldSizeX; x++ {\n\t\tfor y := 0; y < fieldSizeY; y++ {\n\t\t\tif model.Field[y][x] == 0 {\n\t\t\t\tfree = append(free, &model.Field[y][x])\n\t\t\t}\n\t\t}\n\t}\n\n\tval := 4\n\tif rand.Float64() < probFor2 {\n\t\tval = 2\n\t}\n\t*free[rand.Intn(len(free))] = val\n\n\treturn len(free) == 1\n}\n\ntype point struct{ x, y int }\n\nfunc (p point) get() int      { return model.Field[p.y][p.x] }\nfunc (p point) set(n int)     { model.Field[p.y][p.x] = n }\nfunc (p point) inField() bool { return p.x >= 0 && p.y >= 0 && p.x < fieldSizeX && p.y < fieldSizeY }\nfunc (p *point) next(n point) { p.x += n.x; p.y += n.y }\n\nfunc controller(key rune) (gameOver bool) {\n\tb := keybinding[key]\n\n\tif b == 0 {\n\t\treturn false\n\t}\n\tif b == quit {\n\t\treturn true\n\t}\n\n\tvar starts []point\n\tvar next point\n\n\tswitch b {\n\tcase up:\n\t\tnext = point{0, 1}\n\t\tstarts = make([]point, fieldSizeX)\n\t\tfor x := 0; x < fieldSizeX; x++ {\n\t\t\tstarts[x] = point{x, 0}\n\t\t}\n\tcase down:\n\t\tnext = point{0, -1}\n\t\tstarts = make([]point, fieldSizeX)\n\t\tfor x := 0; x < fieldSizeX; x++ {\n\t\t\tstarts[x] = point{x, fieldSizeY - 1}\n\t\t}\n\tcase right:\n\t\tnext = point{-1, 0}\n\t\tstarts = make([]point, fieldSizeY)\n\t\tfor y := 0; y < fieldSizeY; y++ {\n\t\t\tstarts[y] = point{fieldSizeX - 1, y}\n\t\t}\n\tcase left:\n\t\tnext = point{1, 0}\n\t\tstarts = make([]point, fieldSizeY)\n\t\tfor y := 0; y < fieldSizeY; y++ {\n\t\t\tstarts[y] = point{0, y}\n\t\t}\n\t}\n\n\tmoved := false\n\twinning := false\n\n\tfor _, s := range starts {\n\t\tn := s\n\t\tmove := func(set int) {\n\t\t\tmoved = true\n\t\t\ts.set(set)\n\t\t\tn.set(0)\n\t\t}\n\t\tfor n.next(next); n.inField(); n.next(next) {\n\t\t\tif s.get() != 0 {\n\t\t\t\tif n.get() == s.get() {\n\t\t\t\t\tscore := s.get() * 2\n\t\t\t\t\tmodel.Score += score\n\t\t\t\t\twinning = score >= maxPoints\n\n\t\t\t\t\tmove(score)\n\t\t\t\t\ts.next(next)\n\t\t\t\t} else if n.get() != 0 {\n\t\t\t\t\ts.next(next)\n\t\t\t\t\tif s.get() == 0 {\n\t\t\t\t\t\tmove(n.get())\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else if n.get() != 0 {\n\t\t\t\tmove(n.get())\n\t\t\t}\n\t\t}\n\t}\n\n\tif !moved {\n\t\treturn false\n\t}\n\n\tlost := false\n\tif addRandTile() {\n\t\tlost = true\n\tOut:\n\t\tfor x := 0; x < fieldSizeX; x++ {\n\t\t\tfor y := 0; y < fieldSizeY; y++ {\n\t\t\t\tif (y > 0 && model.Field[y][x] == model.Field[y-1][x]) ||\n\t\t\t\t\t(x > 0 && model.Field[y][x] == model.Field[y][x-1]) {\n\t\t\t\t\tlost = false\n\t\t\t\t\tbreak Out\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tdraw()\n\n\tif winning {\n\t\tfmt.Println(\"You win!\")\n\t\treturn true\n\t}\n\tif lost {\n\t\tfmt.Println(\"Game Over\")\n\t\treturn true\n\t}\n\n\treturn false\n}\n\nfunc main() {\n\toldState, err := terminal.MakeRaw(0)\n\tcheck(err)\n\tdefer terminal.Restore(0, oldState)\n\n\trand.Seed(time.Now().Unix())\n\n\tfor i := tilesAtStart; i > 0; i-- {\n\t\taddRandTile()\n\t}\n\tdraw()\n\n\tstdin := bufio.NewReader(os.Stdin)\n\n\treadKey := func() rune {\n\t\tr, _, err := stdin.ReadRune()\n\t\tcheck(err)\n\t\treturn r\n\t}\n\n\tfor !controller(readKey()) {\n\t}\n}\n",
        "safe": true
    },
    {
        "filename": "2048_57.txt",
        "content": "import System.IO\nimport Data.List\nimport Data.Maybe\nimport Control.Monad\nimport Data.Random\nimport Data.Random.Distribution.Categorical\nimport System.Console.ANSI\nimport Control.Lens\n\n-- Logic\n\n-- probability to get a 4\nprob4 :: Double\nprob4 = 0.1\n\ntype Position = [[Int]]\n\ncombine, shift :: [Int]->[Int]\ncombine (x:y:l) | x==y = (2*x) : combine l\ncombine (x:l) = x : combine l\ncombine [] = []\n\nshift l = take (length l) $ combine (filter (>0) l) ++ [0,0..]\n\nreflect :: [[a]] ->[[a]]\nreflect = map reverse\n\ntype Move = Position -> Position\n\nleft, right, up, down :: Move\nleft = map shift\nright = reflect . left . reflect\nup = transpose . left . transpose\ndown = transpose . right . transpose\n\nprogress :: Eq a => (a -> a) -> a -> Maybe a\nprogress f pos = if pos==next_pos then Nothing else Just next_pos where next_pos= f pos\n\nlost, win:: Position -> Bool\nlost pos = all isNothing [progress move pos| move<-[left,right,up,down] ]\n\nwin = any $ any (>=2048)\n\ngo :: Position -> Maybe Move -> Maybe Position\ngo pos move = move >>= flip progress pos\n\n\n{-\n-- Adding 2 or 4 without lens:\nupdate l i a = l1 ++ a\u00a0: l2 where (l1,_:l2)=splitAt i l\nindicesOf l = [0..length l-1]\n\nadd a x y pos = update pos y $ update (pos\u00a0!! y) x a\n\nadd2or4\u00a0::  Position -> RVar Position\nadd2or4 pos = do\n  (x,y) <-  randomElement [(x,y) | y<-indicesOf pos, x<-indicesOf (pos!!y), pos!!y!!x ==0  ]\n  a <- categorical [(0.9::Double,2), (0.1,4) ]\n  return $ add a x y pos\n-}\n\n-- or with lens:\nindicesOf :: [a] -> [ReifiedTraversal' [a] a]\nindicesOf l = [ Traversal $ ix i | i <- [0..length l - 1] ]\n\nindices2Of :: [[a]] -> [ReifiedTraversal' [[a]] a]\nindices2Of ls = [ Traversal $ i.j | Traversal i <- indicesOf ls, let Just l = ls ^? i, Traversal j <- indicesOf l]\n\nadd2or4 ::  Position -> RVar Position\nadd2or4 pos = do\n  xy <-  randomElement [ xy | Traversal xy <- indices2Of pos, pos ^? xy == Just 0 ]\n  a <- categorical [(1-prob4, 2), (prob4, 4) ]\n  return $  pos & xy .~ a\n-- Easy, is'n it'?\n\n-- Main loop\nplay :: Position -> IO ()\nplay pos = do\n   c <- getChar\n   case go pos $ lookup c [('D',left),('C',right),('A',up),('B',down)] of\n      Nothing -> play pos\n      Just pos1 -> do\n         pos2 <- sample $ add2or4 pos1\n         draw pos2\n         when (win pos2 && not (win pos)) $ putStrLn $ \"You win! You may keep going.\"\n         if lost pos2 then putStrLn \"You lost!\"\n            else play pos2\n\nmain :: IO ()\nmain = do\n  pos <- sample $ add2or4 $ replicate 4 (replicate 4 0)\n  draw pos\n  play pos\n\n-- Rendering\n-- See https://en.wikipedia.org/wiki/ANSI_escape_code#Colors\ncolors =\n [(0,\"\\ESC[38;5;234;48;5;250m     \")\n ,(2,\"\\ESC[38;5;234;48;5;255m  2  \")\n ,(4,\"\\ESC[38;5;234;48;5;230m  4  \")\n ,(8,\"\\ESC[38;5;15;48;5;208m  8  \")\n ,(16,\"\\ESC[38;5;15;48;5;209m  16 \")\n ,(32,\"\\ESC[38;5;15;48;5;203m  32 \")\n ,(64,\"\\ESC[38;5;15;48;5;9m  64 \")\n ,(128,\"\\ESC[38;5;15;48;5;228m 128 \")\n ,(256,\"\\ESC[38;5;15;48;5;227m 256 \")\n ,(512,\"\\ESC[38;5;15;48;5;226m 512 \")\n ,(1024,\"\\ESC[38;5;15;48;5;221m 1024\")\n ,(2048,\"\\ESC[38;5;15;48;5;220m 2048\")\n ,(4096,\"\\ESC[38;5;15;48;5;0m 4096\")\n ,(8192,\"\\ESC[38;5;15;48;5;0m 8192\")\n ,(16384,\"\\ESC[38;5;15;48;5;0m16384\")\n ,(32768,\"\\ESC[38;5;15;48;5;0m32768\")\n ,(65536,\"\\ESC[38;5;15;48;5;0m65536\")\n ,(131072,\"\\ESC[38;5;15;48;5;90m131072\")\n ]\n\nshowTile x = fromJust (lookup x colors) ++ \"\\ESC[B\\^H\\^H\\^H\\^H\\^H     \\ESC[A\\ESC[C\"\n\ndraw :: Position -> IO ()\ndraw pos = do\n  setSGR [Reset]\n  clearScreen\n  hideCursor\n  hSetEcho stdin False\n  hSetBuffering stdin NoBuffering\n  setSGR [SetConsoleIntensity BoldIntensity]\n  putStr \"\\ESC[38;5;234;48;5;248m\" -- set board color\n  setCursorPosition 0 0\n  replicateM_ 13 $ putStrLn $ replicate 26 ' '\n  setCursorPosition 1 1\n  putStrLn $ intercalate \"\\n\\n\\n\\ESC[C\" $ concatMap showTile `map` pos\n",
        "safe": true
    },
    {
        "filename": "2048_58.txt",
        "content": "NB. 2048.ijs script\nNB. =========================================================\nNB. 2048 game engine\n\nrequire 'guid'\n([ 9!:1) _2 (3!:4) , guids 1            NB. randomly set initial random seed\n\ncoclass 'g2048'\nTarget=: 2048\n\nnew2048=: verb define\n  Gridsz=: 4 4\n  Points=: Score=: 0\n  Grid=: newnum^:2 ] Gridsz $ 0\n)\n\nnewnum=: verb define\n  num=. 2 4 {~ 0.1 > ?0   NB. 10% chance of 4\n  idx=. 4 $. $. 0 = y        NB. indicies of 0s\n  if. #idx do.               NB. handle full grid\n    idx=. ,/ ({~ 1 ? #) idx  NB. choose an index\n    num (<idx)} y\n  else. return. y\n  end.\n)\n\nmskmerge=: [: >/\\.&.|. 2 =/\\ ,&_1\nmergerow=: ((* >:) #~ _1 |. -.@]) mskmerge\nscorerow=: +/@(+: #~ mskmerge)\n\ncompress=: -.&0\ntoLeft=: 1 :'4&{.@(u@compress)\"1'\ntoRight=: 1 : '_4&{.@(u@compress&.|.)\"1'\ntoUp=: 1 : '(4&{.@(u@compress)\"1)&.|:'\ntoDown=: 1 : '(_4&{.@(u@compress&.|.)\"1)&.|:'\n\nmove=: conjunction define\n  Points=: +/@, v Grid\n  update newnum^:(Grid -.@-: ]) u Grid\n)\n\nnoMoves=: (0 -.@e. ,)@(mergerow toRight , mergerow toLeft , mergerow toUp ,: mergerow toDown)\nhasWon=: Target e. ,\n\neval=: verb define\n  Score=: Score + Points\n  isend=. (noMoves , hasWon) y\n  msg=. isend # 'You lost!!';'You Won!!'\n  if. -. isend=. +./ isend do.\n    Points=: 0\n    msg=. 'Score is ',(\": Score)\n  end.\n  isend;msg\n)\n\nshowGrid=: echo\n\nNB. =========================================================\nNB. Console user interface\n\ng2048Con_z_=: conew&'g2048con'\n\ncoclass 'g2048con'\ncoinsert 'g2048'\n\ncreate=: verb define\n  echo Instructions\n  startnew y\n)\n\ndestroy=: codestroy\nquit=: destroy\n\nstartnew=: update@new2048\n\nleft=: 3 :'mergerow toLeft move (scorerow toLeft)'\nright=: 3 :'mergerow toRight move (scorerow toRight)'\nup=: 3 :'mergerow toUp move (scorerow toUp)'\ndown=: 3 :'mergerow toDown move (scorerow toDown)'\n\nupdate=: verb define\n  Grid=: y       NB. update global Grid\n  'isend msg'=. eval y\n  echo msg\n  showGrid y\n  if. isend do. destroy '' end.\n  empty''\n)\n\nInstructions=: noun define\n=== 2048 ===\nObject:\n   Create the number 2048 by merging numbers.\n\nHow to play:\n  When 2 numbers the same touch, they merge.\n  - move numbers using the commands below:\n       right__grd ''\n       left__grd ''\n       up__grd ''\n       down__grd ''\n  - quit a game:\n       quit__grd ''\n  - start a new game:\n       grd=: g2048Con ''\n)\n",
        "safe": true
    },
    {
        "filename": "2048_59.txt",
        "content": "   grd=: g2048Con ''\n\nScore is 0\n0 0 0 2\n0 2 0 0\n0 0 0 0\n0 0 0 0\n   right__grd ''\nScore is 0\n0 0 0 2\n0 0 0 2\n0 0 0 0\n0 0 0 2\n   down__grd ''\nScore is 4\n0 0 0 0\n0 0 0 0\n0 0 4 4\n0 0 0 2\n...\n",
        "safe": true
    },
    {
        "filename": "2048_6.txt",
        "content": "               ......[4][2] \n",
        "safe": true
    },
    {
        "filename": "2048_60.txt",
        "content": "import java.awt.*;\nimport java.awt.event.*;\nimport java.util.Random;\nimport javax.swing.*;\n\npublic class Game2048 extends JPanel {\n\n    enum State {\n        start, won, running, over\n    }\n\n    final Color[] colorTable = {\n        new Color(0x701710), new Color(0xFFE4C3), new Color(0xfff4d3),\n        new Color(0xffdac3), new Color(0xe7b08e), new Color(0xe7bf8e),\n        new Color(0xffc4c3), new Color(0xE7948e), new Color(0xbe7e56),\n        new Color(0xbe5e56), new Color(0x9c3931), new Color(0x701710)};\n\n    final static int target = 2048;\n\n    static int highest;\n    static int score;\n\n    private Color gridColor = new Color(0xBBADA0);\n    private Color emptyColor = new Color(0xCDC1B4);\n    private Color startColor = new Color(0xFFEBCD);\n\n    private Random rand = new Random();\n\n    private Tile[][] tiles;\n    private int side = 4;\n    private State gamestate = State.start;\n    private boolean checkingAvailableMoves;\n\n    public Game2048() {\n        setPreferredSize(new Dimension(900, 700));\n        setBackground(new Color(0xFAF8EF));\n        setFont(new Font(\"SansSerif\", Font.BOLD, 48));\n        setFocusable(true);\n\n        addMouseListener(new MouseAdapter() {\n            @Override\n            public void mousePressed(MouseEvent e) {\n                startGame();\n                repaint();\n            }\n        });\n\n        addKeyListener(new KeyAdapter() {\n            @Override\n            public void keyPressed(KeyEvent e) {\n                switch (e.getKeyCode()) {\n                    case KeyEvent.VK_UP:\n                        moveUp();\n                        break;\n                    case KeyEvent.VK_DOWN:\n                        moveDown();\n                        break;\n                    case KeyEvent.VK_LEFT:\n                        moveLeft();\n                        break;\n                    case KeyEvent.VK_RIGHT:\n                        moveRight();\n                        break;\n                }\n                repaint();\n            }\n        });\n    }\n\n    @Override\n    public void paintComponent(Graphics gg) {\n        super.paintComponent(gg);\n        Graphics2D g = (Graphics2D) gg;\n        g.setRenderingHint(RenderingHints.KEY_ANTIALIASING,\n                RenderingHints.VALUE_ANTIALIAS_ON);\n\n        drawGrid(g);\n    }\n\n    void startGame() {\n        if (gamestate != State.running) {\n            score = 0;\n            highest = 0;\n            gamestate = State.running;\n            tiles = new Tile[side][side];\n            addRandomTile();\n            addRandomTile();\n        }\n    }\n\n    void drawGrid(Graphics2D g) {\n        g.setColor(gridColor);\n        g.fillRoundRect(200, 100, 499, 499, 15, 15);\n\n        if (gamestate == State.running) {\n\n            for (int r = 0; r < side; r++) {\n                for (int c = 0; c < side; c++) {\n                    if (tiles[r][c] == null) {\n                        g.setColor(emptyColor);\n                        g.fillRoundRect(215 + c * 121, 115 + r * 121, 106, 106, 7, 7);\n                    } else {\n                        drawTile(g, r, c);\n                    }\n                }\n            }\n        } else {\n            g.setColor(startColor);\n            g.fillRoundRect(215, 115, 469, 469, 7, 7);\n\n            g.setColor(gridColor.darker());\n            g.setFont(new Font(\"SansSerif\", Font.BOLD, 128));\n            g.drawString(\"2048\", 310, 270);\n\n            g.setFont(new Font(\"SansSerif\", Font.BOLD, 20));\n\n            if (gamestate == State.won) {\n                g.drawString(\"you made it!\", 390, 350);\n\n            } else if (gamestate == State.over)\n                g.drawString(\"game over\", 400, 350);\n\n            g.setColor(gridColor);\n            g.drawString(\"click to start a new game\", 330, 470);\n            g.drawString(\"(use arrow keys to move tiles)\", 310, 530);\n        }\n    }\n\n    void drawTile(Graphics2D g, int r, int c) {\n        int value = tiles[r][c].getValue();\n\n        g.setColor(colorTable[(int) (Math.log(value) / Math.log(2)) + 1]);\n        g.fillRoundRect(215 + c * 121, 115 + r * 121, 106, 106, 7, 7);\n        String s = String.valueOf(value);\n\n        g.setColor(value < 128 ? colorTable[0] : colorTable[1]);\n\n        FontMetrics fm = g.getFontMetrics();\n        int asc = fm.getAscent();\n        int dec = fm.getDescent();\n\n        int x = 215 + c * 121 + (106 - fm.stringWidth(s)) / 2;\n        int y = 115 + r * 121 + (asc + (106 - (asc + dec)) / 2);\n\n        g.drawString(s, x, y);\n    }\n\n\n    private void addRandomTile() {\n        int pos = rand.nextInt(side * side);\n        int row, col;\n        do {\n            pos = (pos + 1) % (side * side);\n            row = pos / side;\n            col = pos % side;\n        } while (tiles[row][col] != null);\n\n        int val = rand.nextInt(10) == 0 ? 4 : 2;\n        tiles[row][col] = new Tile(val);\n    }\n\n    private boolean move(int countDownFrom, int yIncr, int xIncr) {\n        boolean moved = false;\n\n        for (int i = 0; i < side * side; i++) {\n            int j = Math.abs(countDownFrom - i);\n\n            int r = j / side;\n            int c = j % side;\n\n            if (tiles[r][c] == null)\n                continue;\n\n            int nextR = r + yIncr;\n            int nextC = c + xIncr;\n\n            while (nextR >= 0 && nextR < side && nextC >= 0 && nextC < side) {\n\n                Tile next = tiles[nextR][nextC];\n                Tile curr = tiles[r][c];\n\n                if (next == null) {\n\n                    if (checkingAvailableMoves)\n                        return true;\n\n                    tiles[nextR][nextC] = curr;\n                    tiles[r][c] = null;\n                    r = nextR;\n                    c = nextC;\n                    nextR += yIncr;\n                    nextC += xIncr;\n                    moved = true;\n\n                } else if (next.canMergeWith(curr)) {\n\n                    if (checkingAvailableMoves)\n                        return true;\n\n                    int value = next.mergeWith(curr);\n                    if (value > highest)\n                        highest = value;\n                    score += value;\n                    tiles[r][c] = null;\n                    moved = true;\n                    break;\n                } else\n                    break;\n            }\n        }\n\n        if (moved) {\n            if (highest < target) {\n                clearMerged();\n                addRandomTile();\n                if (!movesAvailable()) {\n                    gamestate = State.over;\n                }\n            } else if (highest == target)\n                gamestate = State.won;\n        }\n\n        return moved;\n    }\n\n    boolean moveUp() {\n        return move(0, -1, 0);\n    }\n\n    boolean moveDown() {\n        return move(side * side - 1, 1, 0);\n    }\n\n    boolean moveLeft() {\n        return move(0, 0, -1);\n    }\n\n    boolean moveRight() {\n        return move(side * side - 1, 0, 1);\n    }\n\n    void clearMerged() {\n        for (Tile[] row : tiles)\n            for (Tile tile : row)\n                if (tile != null)\n                    tile.setMerged(false);\n    }\n\n    boolean movesAvailable() {\n        checkingAvailableMoves = true;\n        boolean hasMoves = moveUp() || moveDown() || moveLeft() || moveRight();\n        checkingAvailableMoves = false;\n        return hasMoves;\n    }\n\n    public static void main(String[] args) {\n        SwingUtilities.invokeLater(() -> {\n            JFrame f = new JFrame();\n            f.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);\n            f.setTitle(\"2048\");\n            f.setResizable(true);\n            f.add(new Game2048(), BorderLayout.CENTER);\n            f.pack();\n            f.setLocationRelativeTo(null);\n            f.setVisible(true);\n        });\n    }\n}\n\nclass Tile {\n    private boolean merged;\n    private int value;\n\n    Tile(int val) {\n        value = val;\n    }\n\n    int getValue() {\n        return value;\n    }\n\n    void setMerged(boolean m) {\n        merged = m;\n    }\n\n    boolean canMergeWith(Tile other) {\n        return !merged && other != null && !other.merged && value == other.getValue();\n    }\n\n    int mergeWith(Tile other) {\n        if (canMergeWith(other)) {\n            value *= 2;\n            merged = true;\n            return value;\n        }\n        return -1;\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "2048_61.txt",
        "content": "/* Tile object: */\n\nfunction Tile(pos, val, puzzle){\n\tthis.pos     = pos;\n\tthis.val     = val;\n\tthis.puzzle  = puzzle;\n\tthis.merging = false;\n\t\n\tthis.getCol = () => Math.round(this.pos % 4);\n\tthis.getRow = () => Math.floor(this.pos / 4);\n\t\n\t/* draw tile on a P5.js canvas: */\n\t\n\tthis.show = function(){\n\t\tlet padding = this.merging ? 0 : 5;\n\t\tlet size = 0.25*width;\n\t\tnoStroke();\n\t\tcolorMode(HSB, 255);\n\t\tfill(10*(11 - Math.log2(this.val)), 50 + 15*Math.log2(this.val), 200);\n\t\trect(this.getCol()*size + padding, this.getRow()*size + padding, size - 2*padding, size - 2*padding);\n\t\tfill(255);\n\t\ttextSize(0.1*width);\n\t\ttextAlign(CENTER, CENTER);\n\t\ttext(this.val, (this.getCol() + 0.5)*size, (this.getRow() + 0.5)*size);\n\t}\n\t\n\t/* move tile in a given direction: */\n\t\n\tthis.move = function(dir){\n\t\tlet col = this.getCol() + (1 - 2*(dir < 0))*Math.abs(dir)%4;\n\t\tlet row = this.getRow() + (1 - 2*(dir < 0))*Math.floor(Math.abs(dir)/4);\n\t\tlet target = this.puzzle.getTile(this.pos + dir);\n\t\t\n\t\tif (col < 0 || col > 3 || row < 0 || row > 3) {\n\t\t\t/* target position out of bounds */\n\t\t\treturn false;\n\t\t} else if (target){\n\t\t\t/* tile blocked by other tile */\n\t\t\tif(this.merging || target.merging || target.val !== this.val)\n\t\t\t\treturn false;\n\t\t\t\n\t\t\t/* merge with target tile (equal values):*/ \n\t\t\ttarget.val += this.val;\n\t\t\ttarget.merging = true;\n\t\t\tthis.puzzle.score += target.val;\n\t\t\tthis.puzzle.removeTile(this);\n\t\t\treturn true;\n\t\t}\n\t\n\t\t/* move tile: */\n\t\tthis.pos += dir;\n\t\treturn true;\n\t}\n}\n\n/* Puzzle object: */\n\nfunction Puzzle(){\n\tthis.tiles    = [];\n\tthis.dir      = 0;\n\tthis.score    = 0;\n\tthis.hasMoved = false;\n\tthis.validPositions = [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15];\n\t\n\tthis.getOpenPositions = () => this.validPositions.filter(i => this.tiles.map(x => x.pos).indexOf(i) === -1);\n\tthis.getTile          = pos => this.tiles.filter(x => x.pos === pos)[0];\n\tthis.removeTile       = tile => this.tiles.splice(this.tiles.indexOf(tile), 1);\n\tthis.winCondition     = () => this.tiles.some(x => x.val === 2048);\n\n\t/* check for valid moves: */\n\t\n\tthis.validMoves = function(){\n\t\t/* return true if there are empty spaces */\n\t\tif(this.tiles.length < 16)\n\t\t\treturn true;\n\t\t\n\t\t/* otherwise check for neighboring tiles with the same value */\n\t\tlet res = false;\n\t\tthis.tiles.sort((x,y) => x.pos - y.pos);\n\t\tfor(let i = 0; i < 16; i++)\n\t\t\tres = res || ( (i%4 < 3) ? this.tiles[i].val === this.tiles[i+1].val : false )\n\t\t\t\t\t  || ( (i  < 12) ? this.tiles[i].val === this.tiles[i+4].val : false );\n\t\treturn res;\n\t}\n\t\n\t/* check win and lose condition: */\n\t\n\tthis.checkGameState = function(){\n\t\tif(this.winCondition()){\n\t\t\talert('You win!');\n\t\t} else if (!this.validMoves()){\n\t\t\talert('You Lose!');\n\t\t\tthis.restart();\n\t\t}\n\t}\n\t\n\tthis.restart = function(){\n\t\tthis.tiles    = [];\n\t\tthis.dir      = 0;\n\t\tthis.score    = 0;\n\t\tthis.hasMoved = false;\n\t\tthis.generateTile();\n\t\tthis.generateTile();\n\t}\n\t\n\t/* draw the board on the p5.js canvas: */\n\t\n\tthis.show = function(){\n\t\tbackground(200);\n\t\tfill(255);\n\t\ttextSize(0.05*width);\n\t\ttextAlign(CENTER, TOP);\n\t\ttext(\"SCORE: \" + this.score, 0.5*width, width);\n\t\t\n\t\tfor(let tile of this.tiles)\n\t\t\ttile.show();\n\t}\n\t\n\t/* update the board: */\n\t\n\tthis.animate = function(){\n\t\tif(this.dir === 0)\n\t\t\treturn;\n\t\t\n\t\t/* move all tiles in a given direction */\n\t\tlet moving = false;\n\t\tthis.tiles.sort((x,y) => this.dir*(y.pos - x.pos));\n\t\tfor(let tile of this.tiles)\n\t\t\tmoving = moving || tile.move(this.dir);\n\t\t\n\t\t/* check if the move is finished and generate a new tile */\n\t\tif(this.hasMoved && !moving){\n\t\t\tthis.dir = 0;\n\t\t\tthis.generateTile();\n\t\t\t\n\t\t\tfor(let tile of this.tiles)\n\t\t\t\ttile.merging = false;\n\t\t} \n\t\tthis.hasMoved = moving;\n\t}\n\t\n\tthis.generateTile = function(){\n\t\tlet positions = this.getOpenPositions();\n\t\tlet pos       = positions[Math.floor(Math.random()*positions.length)];\n\t\tlet val       = 2 + 2*Math.floor(Math.random()*1.11);\n\t\tthis.tiles.push(new Tile(pos, val, this));\n\t}\n\tthis.generateTile();\n\tthis.generateTile();\n\t\n\t/* process key inputs: */\n\t\n\tthis.keyHandler = function(key){\n\t\tif      (key === UP_ARROW)    this.dir = -4\n\t\telse if (key === DOWN_ARROW)  this.dir = 4\n\t\telse if (key === RIGHT_ARROW) this.dir = 1\n\t\telse if (key === LEFT_ARROW)  this.dir = -1;\n\t}\n}\n\n\nlet game;\n\nfunction setup() {\n\tcreateCanvas(400, 420);\t\n\tgame = new Puzzle();\n}\n\n/* game loop: */\n\nfunction draw() {\n\tgame.checkGameState();\n\tgame.animate();\n\tgame.show();\n}\n\nfunction keyPressed(){\n\tgame.keyHandler(keyCode);\n}\n",
        "safe": true
    },
    {
        "filename": "2048_62.txt",
        "content": "include \"MRG32k3a\" {search: \".\"};  # see comment above\n\n### Generic functions\n\ndef lpad($len): tostring | ($len - length) as $l | (\" \" * $l) + .;\n\n# Create an m x n matrix with initial values specified by .\ndef matrix($m; $n):\n  if $m == 0 then []\n  else . as $init\n  | if $m == 1 then [range(0;$n) | $init]\n    elif $m > 0 then\n    matrix(1; $n) as $row\n    | [range(0; $m) | $row ]\n    else error(\"matrix\\($m);\\($n)) invalid\")\n    end\n  end;\n\n\n### The 2048 Game\n# Left-squish the input array in accordance with the game requirements for a single row\ndef squish:\n  def squish($n):\n    def s:\n      if length == 0 then [range(0;$n)|null]\n      elif .[0] == null then .[1:] | s\n      elif length == 1 then . + [range(0; $n - 1)|null]\n      elif .[0] == .[1] then [.[0] + .[1]] + (.[2:]|squish($n-1))\n      else .[0:1] + (.[1:]|squish($n-1))\n      end;\n    s;\n  squish(length);\n\n# Input: a matrix of rows\ndef squish_left:\n  [.[] | squish];\n\ndef squish_right:\n  [.[] | reverse | squish | reverse];\n\ndef squish_up:\n  transpose\n  | [.[] | squish]\n  | transpose;\n\ndef squish_down:\n  transpose\n  | [.[] | reverse | squish | reverse]\n  | transpose;\n\n# Gather the [i,j] co-ordinates of all the null values in the input matrix\ndef gather:\n  if length == 0 then error end\n  | (.[0] | length) as $cols\n  | [range(0;length) as $i\n     | range(0; $cols) as $j\n     | select(.[$i][$j] == null) | [$i,$j]]\n  | if length == 0 then error end\u00a0;\n\n# Input: {matrix}\n# Add a random 2 or 4 if possible, else error\n# Output: includes .prng for the PRN generator\ndef add_random:\n  (.matrix | gather) as $gather\n  | ($gather | length) as $n\n  | if $n == 0 then error end\n  | if .prng == null then .prng = seed(now | tostring | sub(\"^.*[.]\";\"\") | tonumber) end\n  | .prng |= nextFloat\n  | $gather[.prng.nextFloat * $n | trunc] as [$i,$j]\n  | .prng |= nextFloat\n  |  (if (.prng.nextFloat) < 0.1 then 4 else 2 end) as $exmachina\n  | .matrix[$i][$j] = $exmachina\u00a0;\n\ndef prompt: \"[ijkl] or [wasd] or q to quit or n to restart:\";\n\ndef direction:\n  {\"i\": \"up\", \"j\": \"left\", \"k\": \"down\", \"l\": \"right\",\n   \"w\": \"up\", \"a\": \"left\", \"s\": \"down\", \"d\": \"right\",\n   \"q\": \"quit\",\n   \"n\": \"restart\"\n  };\n\n# Recognize $goal as the goal\ndef play($goal):\n\n  # Pretty print\n  def pp:\n    .matrix[] | map(. // \".\" | lpad(4))  | join(\" \");\n\n  def won:\n    any(.matrix[][]; . == $goal);\n\n  def lost:\n    .matrix\n    | (squish_left == .) and (squish_right == .) and\n      (squish_up   == .) and (squish_down == .);\n\n  def round:\n    pp,\n    if lost then \"Sorry!  Better luck next time.\", play($goal)\n    else prompt,\n    ( (try input catch halt) as $in\n    | .matrix as $matrix   # for checking if a move is legal\n    | .emit = null\n    | direction[$in | ascii_downcase] as $direction\n    | if   $direction == \"up\"    then .matrix |= squish_up\n      elif $direction == \"down\"  then .matrix |= squish_down\n      elif $direction == \"left\"  then .matrix |= squish_left\n      elif $direction == \"right\" then .matrix |= squish_right\n      elif $direction == \"quit\"  then .emit = \"bye\"\n      elif $direction == \"restart\" then .emit = \"restart\"\n      else .emit = \"unknown direction \\($direction) ... please try again.\" \n      end\n    | if   .emit == \"bye\"     then .emit, halt\n      elif .emit == \"restart\" then \"Restarting...\", play($goal)\n      elif .emit\u00a0!= null      then .emit, round\n      elif .matrix == $matrix then \"Disallowed direction!  Please try again.\", round\n      elif won then pp, \"Congratulations!\", play($goal)\n      else add_random | round\n      end)\n    end;\n\n  { matrix: (null | matrix(4;4))}\n  | .matrix[2] = [null,2,2,2]\n  | round;\n\nplay(2048)",
        "safe": true
    },
    {
        "filename": "2048_63.txt",
        "content": "   .    .    .    .\n   .    .    .    .\n   .    2    2    2\n   .    .    .    .\n[ijkl] or [wasd] or q to quit or n to restart:\nl\n   2    .    .    .\n   .    .    .    .\n   .    .    2    4\n   .    .    .    .\n[ijkl] or [wasd] or q to quit or n to restart:\n\n...etc...\n",
        "safe": true
    },
    {
        "filename": "2048_64.txt",
        "content": "using Gtk.ShortNames\n\n@enum Direction2048 Right Left Up Down\n\n\"\"\"\n    shifttiles!\nThe adding and condensing code is for a leftward shift, so if the move is not\nleftward, this will rotate matrix to make move leftward, move, then undo rotation.\n\"\"\"\nfunction shifttiles!(b, siz, direction)\n    if direction == Right\n        tmpb = rot180(b); points, winner = leftshift!(tmpb, siz); tmpb = rot180(tmpb)\n    elseif direction == Up\n        tmpb = rotl90(b); points, winner = leftshift!(tmpb, siz); tmpb = rotr90(tmpb)\n    elseif direction == Down\n        tmpb = rotr90(b); points, winner = leftshift!(tmpb, siz); tmpb = rotl90(tmpb)\n    else # left movement function as coded\n        return leftshift!(b, siz)\n    end\n    for i in 1:siz, j in 1:siz\n        b[i,j] = tmpb[i,j]   # copy tmpb contents back to b (modifies b)\n    end\n    points, winner\nend\n\n\nfunction compactleft!(b, siz, row)\n    tmprow = zeros(Int, siz)\n    tmppos = 1\n    for j in 1:siz\n        if b[row,j] != 0\n            tmprow[tmppos] = b[row,j]\n            tmppos += 1\n        end\n    end\n    b[row,:] = tmprow\nend\n\n\"\"\"\n    leftshift!\nWork row by row. First, compact tiles to the left if possible. Second, find and\nreplace paired tiles in the row, then re-compact. Keep score of merges and return\nas pointsgained. If a 2048 value tile is created, return a winner true value.\n\"\"\"\nfunction leftshift!(b, siz)\n    pointsgained = 0\n    winner = false\n    for i in 1:siz\n        compactleft!(b, siz, i)\n        tmprow = zeros(Int, siz)\n        tmppos = 1\n        for j in 1:siz-1\n            if b[i,j] == b[i,j+1]\n                b[i,j] = 2 * b[i,j]\n                b[i,j+1] = 0\n                pointsgained += b[i,j]\n                if b[i,j] == 2048     # made a 2048 tile, which wins game\n                    winner = true\n                end\n            end\n            if b[i,j] != 0\n                tmprow[tmppos] = b[i,j]\n                tmppos += 1\n            end\n        end\n        tmprow[siz] = b[i,siz]\n        b[i,:] = tmprow\n        compactleft!(b, siz, i)\n    end\n    pointsgained, winner\nend\n\n\"\"\"\n    app2048\nRun game app, with boardsize (choose 4 for original game) as an argument.\n\"\"\"\nfunction app2048(bsize)\n    win = Window(\"2048 Game\", 400, 400) |> (Frame() |> (box = Box(:v)))\n    toolbar = Toolbar()\n    newgame = ToolButton(\"New Game\")\n    set_gtk_property!(newgame, :label, \"New Game\")\n    set_gtk_property!(newgame, :is_important, true)\n    undomove = ToolButton(\"Undo Move\")\n    set_gtk_property!(undomove, :label, \"Undo Move\")\n    set_gtk_property!(undomove, :is_important, true)\n    map(w->push!(toolbar,w),[newgame,undomove])\n    grid = Grid()\n    map(w -> push!(box, w),[toolbar, grid])\n    buttons = Array{Gtk.GtkButtonLeaf,2}(undef, bsize, bsize)\n    for i in 1:bsize, j in 1:bsize\n        grid[i,j] = buttons[i,j] = Button()\n        set_gtk_property!(buttons[i,j], :expand, true)\n    end\n    board = zeros(Int, (bsize,bsize))\n    pastboardstates = []\n    score = 0\n    gameover = false\n    condition = Condition()\n    won = \"\"\n\n    function update!()\n        for i in 1:bsize, j in 1:bsize\n            label = (board[i,j] > 0) ? board[i,j] : \" \"\n            set_gtk_property!(buttons[i,j], :label, label)\n        end\n        set_gtk_property!(win, :title, \"$won 2048 Game  (Score: $score)\")\n    end\n    function newrandomtile!()\n        blanks = Array{Tuple{Int,Int},1}()\n        for i in 1:bsize, j in 1:bsize\n            if board[i,j] == 0\n                push!(blanks, (i,j))\n            end\n        end\n        if length(blanks) == 0\n            gameover = true\n        else\n            i,j = rand(blanks)\n            board[i,j] = (rand() > 0.8) ? 4 : 2\n        end\n    end\n    function initialize!(w)\n        won = \"\"\n        gameover = false\n        for i in 1:bsize, j in 1:bsize\n            board[i,j] = 0\n            set_gtk_property!(buttons[i,j], :label, \" \")\n        end\n        newrandomtile!()\n        update!()\n    end\n    function undo!(w)\n        if gameover == false\n            board = pop!(pastboardstates)\n            update!()\n        end\n    end\n    function keypress(w, event)\n        presses = Dict(37 => Up,    # code rotated 90 degrees\n                       38 => Left,  # because of Gtk coordinates\n                       39 => Down,  # y is downward positive\n                       40 => Right)\n        keycode = event.hardware_keycode\n        if haskey(presses, keycode) && gameover == false\n            push!(pastboardstates, copy(board))\n            newpoints, havewon = shifttiles!(board, bsize, presses[keycode])\n            score += newpoints\n            if havewon && won != \"Winning\"\n                won = \"Winning\"\n                info_dialog(\"You have won the game.\")\n            end\n            newrandomtile!()\n            update!()\n            if gameover\n                info_dialog(\"Game over.\\nScore: $score\")\n            end\n        end\n    end\n    endit(w) = notify(condition)\n    initialize!(win)\n    signal_connect(initialize!, newgame, :clicked)\n    signal_connect(undo!,undomove, :clicked)\n    signal_connect(endit, win, :destroy)\n    signal_connect(keypress, win, \"key-press-event\")\n    Gtk.showall(win)\n    wait(condition)\nend\n\n\nconst boardsize = 4\napp2048(boardsize)\n",
        "safe": true
    },
    {
        "filename": "2048_65.txt",
        "content": "import std/num/random\nimport std/os/readline\n\nval empty = list(0, 15).map(fn(_) 0)\nfun win(l)\n  l.any(fn(x) x == 2048)\n\nfun stack(l)\n  match l\n    Cons(0, tl) -> tl.stack ++ [0]\n    Cons(hd, tl) -> Cons(hd, tl.stack)\n    Nil -> Nil\n\nfun join(l: list<int>)\n  match l\n    Cons(a, Cons(b, c)) | a == b -> Cons((a + b), c.join) ++ [0]\n    Cons(a, b) -> Cons(a, b.join)\n    Nil -> Nil\n\nfun hit(l)\n  l.stack.join\n\nfun hitBack(l)\n  l.reverse.hit.reverse\n\nfun splitBy(l: list<a>, i: int): div list<list<a>>\n  val (a, b) = l.split(i)\n  match b\n    Cons -> Cons(a, b.splitBy(i))\n    Nil -> Cons(a, Nil)\n\nfun transpose(l: list<list<a>>): <exn> list<list<a>>\n  match l\n    Cons(Cons(a, b), c) -> Cons(Cons(a, c.map(fn(x) x.head.unjust)), transpose(Cons(b, c.map(fn(x) x.tail)).unsafe-decreasing))\n    Cons(Nil, b) -> transpose(b)\n    Nil -> Nil\n\nfun rows(l)\n  l.splitBy(4)\n\nfun left(l)\n  l.rows.map(hit).concat\n\nfun right(l)\n  l.rows.map(hitBack).concat\n\nfun up(l)\n  l.rows.transpose.map(hit).transpose.concat\n\nfun down(l)\n  l.rows.transpose.map(hitBack).transpose.concat\n\nfun (==)(l1: list<int>, l2: list<int>): bool\n  match l1\n    Cons(a, b) -> match l2\n      Cons(c, d) -> a == c && b == d\n      Nil -> False\n    Nil -> match l2\n      Cons -> False\n      Nil -> True\n\nfun lose(l)\n  l.left == l && l.right == l && l.up == l && l.down == l\n\nfun numZeros(l: list<int>): int \n  l.filter(fn(x) x == 0).length\n\nfun insert(l: list<int>, what: int, toWhere: int)\n  match l\n    Cons(0, tail) | tail.numZeros == toWhere -> Cons(what, tail)\n    Cons(head, tail) -> Cons(head, tail.insert(what, toWhere))\n    Nil -> Nil\n\nfun spawnOn(l)\n  val newTileValue = if random-int() % 10 == 0 then 4 else 2\n  val newPosition = random-int() % (l.numZeros - 1)\n  l.insert(newTileValue, newPosition)\n\nfun show-board(l: list<int>): div string\n  \"\\n\" ++ l.rows.map(fn(r) r.map(fn(x) x.show.pad-left(4)).join(\"\")).intersperse(\"\\n\").join(\"\") ++ \"\\n\"\n\nfun quit(l)\n  []\n\nfun quitted(l)\n  l.is-nil\n\nfun dispatch(c)\n  match c\n    'i' -> up\n    'j' -> left\n    'k' -> down\n    'l' -> right\n    'q' -> quit\n    _ -> \n      println(\"Unknown command: keys are ijkl to move, q to quit\")\n      id\n\nfun key()\n  readline().head-char.default('_')\n\nfun turn(l)\n  l.show-board.println \n  val next = dispatch(key())(l)\n  if !(next == l) && next.quitted.not then\n    spawnOn(next)\n  else\n    next\n\nfun play(state)\n  if state.win || state.lose || state.quitted then \n    if state.quitted then\n      \"You quit!\".println\n    else if state.win then\n      \"You won!\".println\n    else\n      \"You lost!\".println\n  else \n    \"play\".println\n    play(turn(state))\n\nfun main()\n  print(\"ijkl to move, q to quit\\n\")\n  val initial = empty.spawnOn\n  println(\"Starting game...\")\n  play(initial)\n",
        "safe": true
    },
    {
        "filename": "2048_66.txt",
        "content": "import java.io.BufferedReader\nimport java.io.InputStreamReader\n\nconst val positiveGameOverMessage = \"So sorry, but you won the game.\"\nconst val negativeGameOverMessage = \"So sorry, but you lost the game.\"\n\nfun main(args: Array<String>) {\n    val grid = arrayOf(\n            arrayOf(0, 0, 0, 0),\n            arrayOf(0, 0, 0, 0),\n            arrayOf(0, 0, 0, 0),\n            arrayOf(0, 0, 0, 0)\n    )\n\n    val gameOverMessage = run2048(grid)\n    println(gameOverMessage)\n}\n\nfun run2048(grid: Array<Array<Int>>): String {\n    if (isGridSolved(grid)) return positiveGameOverMessage\n    else if (isGridFull(grid)) return negativeGameOverMessage\n\n    val populatedGrid = spawnNumber(grid)\n    display(populatedGrid)\n\n    return run2048(manipulateGrid(populatedGrid, waitForValidInput()))\n}\n\nfun isGridSolved(grid: Array<Array<Int>>): Boolean = grid.any { row -> row.contains(2048) }\nfun isGridFull(grid: Array<Array<Int>>): Boolean = grid.all { row -> !row.contains(0) }\n\nfun spawnNumber(grid: Array<Array<Int>>): Array<Array<Int>> {\n    val coordinates = locateSpawnCoordinates(grid)\n    val number = generateNumber()\n\n    return updateGrid(grid, coordinates, number)\n}\n\nfun locateSpawnCoordinates(grid: Array<Array<Int>>): Pair<Int, Int> {\n    val emptyCells = arrayListOf<Pair<Int, Int>>()\n    grid.forEachIndexed { x, row ->\n        row.forEachIndexed { y, cell ->\n            if (cell == 0) emptyCells.add(Pair(x, y))\n        }\n    }\n\n    return emptyCells[(Math.random() * (emptyCells.size - 1)).toInt()]\n}\n\nfun generateNumber(): Int = if (Math.random() > 0.10) 2 else 4\n\nfun updateGrid(grid: Array<Array<Int>>, at: Pair<Int, Int>, value: Int): Array<Array<Int>> {\n    val updatedGrid = grid.copyOf()\n    updatedGrid[at.first][at.second] = value\n    return updatedGrid\n}\n\nfun waitForValidInput(): String {\n    val input = waitForInput()\n    return if (isValidInput(input)) input else waitForValidInput()\n}\n\nfun isValidInput(input: String): Boolean = arrayOf(\"a\", \"s\", \"d\", \"w\").contains(input)\n\nfun waitForInput(): String {\n    val reader = BufferedReader(InputStreamReader(System.`in`))\n    println(\"Direction?  \")\n    return reader.readLine()\n}\n\nfun manipulateGrid(grid: Array<Array<Int>>, input: String): Array<Array<Int>> = when (input) {\n    \"a\" -> shiftCellsLeft(grid)\n    \"s\" -> shiftCellsDown(grid)\n    \"d\" -> shiftCellsRight(grid)\n    \"w\" -> shiftCellsUp(grid)\n    else -> throw IllegalArgumentException(\"Expected one of [a, s, d, w]\")\n}\n\nfun shiftCellsLeft(grid: Array<Array<Int>>): Array<Array<Int>> =\n        grid.map(::mergeAndOrganizeCells).toTypedArray()\n\nfun shiftCellsRight(grid: Array<Array<Int>>): Array<Array<Int>> =\n        grid.map { row -> mergeAndOrganizeCells(row.reversed().toTypedArray()).reversed().toTypedArray() }.toTypedArray()\n\nfun shiftCellsUp(grid: Array<Array<Int>>): Array<Array<Int>> {\n    val rows: Array<Array<Int>> = arrayOf(\n            arrayOf(grid[0][0], grid[1][0], grid[2][0], grid[3][0]),\n            arrayOf(grid[0][1], grid[1][1], grid[2][1], grid[3][1]),\n            arrayOf(grid[0][2], grid[1][2], grid[2][2], grid[3][2]),\n            arrayOf(grid[0][3], grid[1][3], grid[2][3], grid[3][3])\n    )\n\n    val updatedGrid = grid.copyOf()\n\n    rows.map(::mergeAndOrganizeCells).forEachIndexed { rowIdx, row ->\n        updatedGrid[0][rowIdx] = row[0]\n        updatedGrid[1][rowIdx] = row[1]\n        updatedGrid[2][rowIdx] = row[2]\n        updatedGrid[3][rowIdx] = row[3]\n    }\n\n    return updatedGrid\n}\n\nfun shiftCellsDown(grid: Array<Array<Int>>): Array<Array<Int>> {\n    val rows: Array<Array<Int>> = arrayOf(\n            arrayOf(grid[3][0], grid[2][0], grid[1][0], grid[0][0]),\n            arrayOf(grid[3][1], grid[2][1], grid[1][1], grid[0][1]),\n            arrayOf(grid[3][2], grid[2][2], grid[1][2], grid[0][2]),\n            arrayOf(grid[3][3], grid[2][3], grid[1][3], grid[0][3])\n    )\n\n    val updatedGrid = grid.copyOf()\n\n    rows.map(::mergeAndOrganizeCells).forEachIndexed { rowIdx, row ->\n        updatedGrid[3][rowIdx] = row[0]\n        updatedGrid[2][rowIdx] = row[1]\n        updatedGrid[1][rowIdx] = row[2]\n        updatedGrid[0][rowIdx] = row[3]\n    }\n\n    return updatedGrid\n}\n\nfun mergeAndOrganizeCells(row: Array<Int>): Array<Int> = organize(merge(row.copyOf()))\n\nfun merge(row: Array<Int>, idxToMatch: Int = 0, idxToCompare: Int = 1): Array<Int> {\n    if (idxToMatch >= row.size) return row\n    if (idxToCompare >= row.size) return merge(row, idxToMatch + 1, idxToMatch + 2)\n    if (row[idxToMatch] == 0) return merge(row, idxToMatch + 1, idxToMatch + 2)\n\n    return if (row[idxToMatch] == row[idxToCompare]) {\n        row[idxToMatch] *= 2\n        row[idxToCompare] = 0\n        merge(row, idxToMatch + 1, idxToMatch + 2)\n    } else {\n        if (row[idxToCompare] != 0) merge(row, idxToMatch + 1, idxToMatch + 2)\n        else merge(row, idxToMatch, idxToCompare + 1)\n    }\n}\n\nfun organize(row: Array<Int>, idxToMatch: Int = 0, idxToCompare: Int = 1): Array<Int> {\n    if (idxToMatch >= row.size) return row\n    if (idxToCompare >= row.size) return organize(row, idxToMatch + 1, idxToMatch + 2)\n    if (row[idxToMatch] != 0) return organize(row, idxToMatch + 1, idxToMatch + 2)\n\n    return if (row[idxToCompare] != 0) {\n        row[idxToMatch] = row[idxToCompare]\n        row[idxToCompare] = 0\n        organize(row, idxToMatch + 1, idxToMatch + 2)\n    } else {\n        organize(row, idxToMatch, idxToCompare + 1)\n    }\n}\n\nfun display(grid: Array<Array<Int>>) {\n    val prettyPrintableGrid = grid.map { row ->\n        row.map { cell ->\n            if (cell == 0) \"    \" else java.lang.String.format(\"%4d\", cell)\n        }\n    }\n\n    println(\"New Grid:\")\n    prettyPrintableGrid.forEach { row ->\n        println(\"+----+----+----+----+\")\n        row.forEach { print(\"|$it\") }\n        println(\"|\")\n    }\n    println(\"+----+----+----+----+\")\n}\n",
        "safe": true
    },
    {
        "filename": "2048_67.txt",
        "content": "New Grid:\n+----+----+----+----+\n|   2|    |    |    |\n+----+----+----+----+\n|    |    |    |   2|\n+----+----+----+----+\n|   4|  16|    |    |\n+----+----+----+----+\n|  16|   4|   2|    |\n+----+----+----+----+\nDirection?  \n",
        "safe": true
    },
    {
        "filename": "2048_68.txt",
        "content": "use 'format import '[format].\nuse 'random.\n\nPos\u00a0:= Object clone tap {\n\n  self x\u00a0:= 0.\n  self y\u00a0:= 0.\n\n  self move\u00a0:= {\n    localize.\n    case ($1) do {\n      when 'left  do { pos (this x - 1, this y). }.\n      when 'right do { pos (this x + 1, this y). }.\n      when 'down  do { pos (this x, this y + 1). }.\n      when 'up    do { pos (this x, this y - 1). }.\n    }.\n  }.\n\n  self ==\u00a0:= {\n    (self x == $1 x) and (self y == $1 y).\n  }.\n\n  self inBounds?\u00a0:= {\n    (self x >= 0) and (self x < 4) and (self y >= 0) and (self y < 4).\n  }.\n\n  self toString\u00a0:= {\n    format \"pos (~S, ~S)\" call (self x, self y).\n  }.\n\n}.\n\npos\u00a0:= {\n  takes '[x, y].\n  Pos clone tap {\n    self x\u00a0:= x.\n    self y\u00a0:= y.\n  }.\n}.\n\nallSquares\u00a0:= [] tap {\n  localize.\n  0 upto 4 visit {\n    takes '[y].\n    0 upto 4 visit {\n      takes '[x].\n      this pushBack (pos (x, y)).\n    }.\n  }.\n}.\n\nsample\u00a0:= {\n  $1 nth (random nextInt mod ($1 length)).\n}.\n\nGrid\u00a0::= Object clone tap {\n\n  self grid\u00a0:= 16 times to (Array) map { 0. }.\n\n  self clone\u00a0:= {\n    Parents above (parent self, 'clone) call tap {\n      self grid\u00a0:= self grid clone.\n    }.\n  }.\n\n  toIndex\u00a0:= {\n    $1 x + 4 * $1 y.\n  }.\n\n  self at\u00a0:= {\n    self grid nth (toIndex).\n  }.\n\n  self at=\u00a0:= {\n    self grid nth= (toIndex).\n  }.\n\n  self isBlank?\u00a0:= {\n    self at == 0.\n  }.\n\n  self spawnNew\u00a0:= {\n    localize.\n    candidates\u00a0:= allSquares filter { this isBlank?. } to (Array).\n    if (candidates empty?) then {\n      'gameover.\n    } else {\n      p\u00a0:= sample (candidates).\n      this at (p) = if (random nextInt mod 10 == 0) then 4 else 2.\n      'okay.\n    }.\n  }.\n\n  canMoveCell\u00a0:= {\n    takes '[grid, src, dir].\n    dest\u00a0:= src move (dir).\n    if (dest inBounds?) then {\n      vs\u00a0:= grid at (src).\n      vd\u00a0:= grid at (dest).\n      (vs /= 0) and ((vd == 0) or (vs == vd)).\n    } else {\n      False.\n    }.\n  }.\n\n  self canMove\u00a0:= {\n    localize.\n    takes '[dir].\n    allSquares any { canMoveCell (this, $1, dir). }.\n  }.\n\n  self validMoves\u00a0:= {\n    '[left, right, up, down] filter { parent self canMove. } to (Array).\n  }.\n\n \u00a0;; Calculates the order of iteration for performing the moves\n  axisCalc\u00a0:= {\n    takes '[dir, major, minor].\n    case (dir) do {\n      when 'left do { pos (major, minor). }.\n      when 'right do { pos (3 - major, minor). }.\n      when 'up do { pos (minor, major). }.\n      when 'down do { pos (minor, 3 - major). }.\n    }.\n  }.\n\n  moveFrom\u00a0:= {\n    takes '[grid, src, dir, locked].\n    dest\u00a0:= src move (dir).\n    local 'result = Nil.\n    dest inBounds? ifTrue {\n      locked contains (dest) ifFalse {\n        vs\u00a0:= grid at (src).\n        vd\u00a0:= grid at (dest).\n        cond {\n          when (vd == 0) do {\n            grid at (dest) = vs.\n            grid at (src) = 0.\n            result = moveFrom (grid, dest, dir, locked).\n          }.\n          when (vd == vs) do {\n            grid at (dest) = vs + vd.\n            grid at (src) = 0.\n            result = moveFrom (grid, dest, dir, locked).\n           \u00a0;; We merged, so lock the final result cell.\n            locked pushBack (result).\n          }.\n        }.\n      }.\n    }.\n    (result) or (src).\n  }.\n\n  self doMove\u00a0:= {\n    localize.\n    takes '[dir].\n    locked\u00a0:= [].\n    0 upto 4 do {\n      takes '[major].\n      0 upto 4 do {\n        takes '[minor].\n        src\u00a0:= axisCalc (dir, major, minor).\n        moveFrom: this, src, dir, locked.\n      }.\n    }.\n  }.\n\n  self pretty\u00a0:= {\n    localize.\n    lines\u00a0:= [].\n    row\u00a0:= \"+----+----+----+----+\".\n    lines pushBack (row).\n    0 upto 4 visit {\n      takes '[y].\n      local 'line = \"|\".\n      0 upto 4 visit {\n        takes '[x].\n        n\u00a0:= this at (pos (x, y)).\n        if (n == 0) then {\n          line = line ++ \"    |\".\n        } else {\n          line = line ++ n toString padRight (\" \", 4) ++ \"|\".\n        }.\n      }.\n      lines pushBack (line).\n      lines pushBack (row).\n    }.\n    lines joinText \"\\n\".\n  }.\n\n  self toArray\u00a0:= {\n    allSquares map { parent self at. }.\n  }.\n\n}.\n\ngrid\u00a0:= Grid clone.\nendgame\u00a0:= loop* {\n \u00a0;; Check for victory\n  (grid toArray any { $1 >= 2048. }) ifTrue {\n    last 'victory.\n  }.\n \u00a0;; Check for game over\n  result\u00a0:= grid spawnNew.\n  (result == 'gameover) ifTrue {\n    last 'gameover.\n  }.\n  valid\u00a0:= grid validMoves.\n  valid empty? ifTrue {\n    last 'gameover.\n  }.\n  $stdout putln: grid pretty.\n  move\u00a0:= loop* {\n    $stdout puts: \"Your move (left, right, up, down)> \".\n    move\u00a0:= $stdin readln intern.\n    valid contains (move) ifTrue { last (move). }.\n  }.\n  grid doMove (move).\n}.\n$stdout putln: grid pretty.\n\nif (endgame == 'victory) then {\n  $stdout putln: \"You win!\".\n} else {\n  $stdout putln: \"Better luck next time!\".\n}.",
        "safe": true
    },
    {
        "filename": "2048_69.txt",
        "content": "+----+----+----+----+\n|16  |4   |    |    |\n+----+----+----+----+\n|4   |    |    |    |\n+----+----+----+----+\n|    |    |    |    |\n+----+----+----+----+\n|    |2   |    |    |\n+----+----+----+----+\nYour move (left, right, up, down)>",
        "safe": true
    },
    {
        "filename": "2048_7.txt",
        "content": "/* ARM assembly AARCH64 Raspberry PI 3B */\n/*  program 2048_64.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.equ SIZE,       4       \n.equ TOTAL,      2048\n.equ BUFFERSIZE, 80\n\n.equ KEYSIZE,    8\n.equ IOCTL,     0x1D  // Linux syscall\n.equ SIGACTION, 0x86  // Linux syscall\n.equ SYSPOLL,   0x16  // Linux syscall\n.equ CREATPOLL, 0x14  // Linux syscall\n.equ CTLPOLL,   0x15  // Linux syscall\n \n.equ TCGETS,    0x5401\n.equ TCSETS,    0x5402\n.equ ICANON,    2\n.equ ECHO,     10\n.equ POLLIN,    1\n.equ EPOLL_CTL_ADD,    1\n \n.equ SIGINT,   2      // Issued if the user sends an interrupt signal (Ctrl + C)\n.equ SIGQUIT,  3      // Issued if the user sends a quit signal (Ctrl + D)\n.equ SIGTERM, 15      // Software termination signal (sent by kill by default)\n.equ SIGTTOU, 22\n\n/*******************************************/\n/* Structures                               */\n/********************************************/\n/* structure termios see doc linux*/\n    .struct  0\nterm_c_iflag:                    // input modes\n    .struct  term_c_iflag + 4 \nterm_c_oflag:                    // output modes\n    .struct  term_c_oflag + 4 \nterm_c_cflag:                    // control modes\n    .struct  term_c_cflag + 4 \nterm_c_lflag:                    // local modes\n    .struct  term_c_lflag + 4 \nterm_c_cc:                       // special characters\n    .struct  term_c_cc + 40      // see length if necessary \nterm_fin:\n \n/* structure sigaction see doc linux */\n    .struct  0\nsa_handler:\n    .struct  sa_handler + 8 \nsa_mask:\n    .struct  sa_mask + 8 \nsa_flags:\n    .struct  sa_flags + 8\nsa_sigaction:\n    .struct  sa_sigaction + 8\nsa_fin:\n \n/* structure poll see doc linux */\n    .struct  0\npoll_event:                        //  events mask\n    .struct  poll_event + 8\npoll_fd:                           // events returned\n    .struct  poll_fd  + 8\npoll_fin:\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nszMessOK:           .asciz \"Bravo\u00a0!! You win. \\n\"\nszMessNotOK:        .asciz \"You lost\u00a0!! \\n\"\nszMessNewGame:      .asciz \"New game (y/n)\u00a0? \\n\"\nszMessErreur:       .asciz \"Error detected.\\n\"\nszMessErrInitTerm:  .asciz \"Error terminal init.\\n\"\nszMessErrInitPoll:  .asciz \"Error poll init.\\n\"\nszMessErreurKey:    .asciz \"Error read key.\\n\"\nszMessErr:          .asciz    \"Error code hexa\u00a0: @ d\u00e9cimal\u00a0: @ \\n\"\nszCarriageReturn:   .asciz \"\\n\"\nszMess0:            .asciz \"      \"\nszMess2:            .asciz \"   2  \"\nszMess4:            .asciz \"   4  \"\nszMess8:            .asciz \"   8  \"\nszMess16:           .asciz \"  16  \"\nszMess32:           .asciz \"  32  \"\nszMess64:           .asciz \"  64  \"\nszMess128:          .asciz \" 128  \"\nszMess256:          .asciz \" 256  \"\nszMess512:          .asciz \" 512  \"\nszMess1024:         .asciz \" 1024 \"\nszMess2048:         .asciz \" 2048 \"\nszCleax1:           .byte 0x1B \n                    .byte 'c'           // other console clear\n                    .byte 0\n\nszLineH:            .asciz \"-----------------------------\\n\"\nszLineV:            .asciz \"|\"\nszLineVT:           .asciz \"|      |      |      |      |\\n\"\n.align 4\nqGraine:            .quad 123456\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\n.align 4\nsZoneConv:      .skip 24\nsBuffer:        .skip BUFFERSIZE\nqTbCase:        .skip 8 * SIZE * SIZE\nqEnd:           .skip 8                        // 0 loop  1 = end loop\nqTouche:        .skip KEYSIZE                  // value key pressed\nstOldtio:       .skip term_fin                 // old terminal state\nstCurtio:       .skip term_fin                 // current terminal state\nstSigAction:    .skip sa_fin                   // area signal structure\nstSigAction1:   .skip sa_fin\nstSigAction2:   .skip sa_fin\nstSigAction3:   .skip sa_fin\nstPoll1:        .skip poll_fin                 // area poll structure\nstPoll2:        .skip poll_fin\nstevents:       .skip 16\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main\nmain:                                // entry of program \n    mov x0,#0\n    bl initTerm                      // terminal init\n    cmp x0,0                         // error\u00a0?\n    blt 100f\n    bl initPoll                      // epoll instance init\n    cmp x0,0\n    blt 99f\n    mov x22,x0                        // save epfd\n1:                                    // begin game loop\n    ldr x0,qAdrszCleax1\n    bl affichageMess\n    bl razTable\n2:\n    bl addDigit   \n    cmp x0,#-1\n    beq 5f                            // end game\n    bl displayGame\n3:\n    mov x0,x22\n    bl waitKey\n    cmp x0,0\n    beq 3b\n    bl readKey\n    cmp x0,#-1\n    beq 99f                          // error\n    bl keyMove\n    cmp x0,#0\n    beq 3b                            // no change -> loop\n    cmp x0,#2                         // last addition = 2048\u00a0?\n    beq 4f\n    cmp x0,#-1                        // quit\u00a0?\n    bne 2b                            // loop\n    \n    b 10f\n4:                                    // last addition = 2048 \n    ldr x0,qAdrszMessOK\n    bl affichageMess\n    b 10f\n5:                                    // display message no solution\n    ldr x0,qAdrszMessNotOK\n    bl affichageMess\n\n10:                                   // display new game\u00a0?\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess\n    ldr x0,qAdrszMessNewGame\n    bl affichageMess\n11:\n    mov x0,x22\n    bl waitKey\n    cmp x0,0\n    beq 11b\n    bl readKey\n    ldr x0,qAdrqTouche\n    ldrb w0,[x0]\n    cmp w0,#'y'\n    beq 1b\n    cmp w0,#'Y'\n    beq 1b\n99:\n    bl restauTerm                     // terminal restaur\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 \nqAdrszCarriageReturn:     .quad szCarriageReturn\nqAdrszMessNotOK:          .quad szMessNotOK\nqAdrszMessOK:             .quad szMessOK\nqAdrszMessNewGame:        .quad szMessNewGame\nqAdrsZoneConv:            .quad sZoneConv\nqAdrszCleax1:             .quad szCleax1\nqAdrszMessErrInitTerm:    .quad szMessErrInitTerm\nqAdrszMessErrInitPoll:    .quad szMessErrInitPoll\nqAdrszMessErreurKey:      .quad szMessErreurKey\nqAdrstOldtio:             .quad stOldtio\nqAdrstCurtio:             .quad stCurtio\nqAdrstSigAction:          .quad stSigAction\nqAdrstSigAction1:         .quad stSigAction1\nqAdrSIG_IGN:              .quad 1\nqAdrqEnd:                 .quad qEnd\nqAdrqTouche:              .quad qTouche\nqAdrstevents:             .quad stevents\n/******************************************************************/\n/*     raz table cases                                                   */ \n/******************************************************************/\nrazTable:\n    stp x0,lr,[sp,-16]!     // save  registres\n    stp x1,x2,[sp,-16]!     // save  registres\n    ldr x1,qAdrqTbCase\n    mov x2,#0\n1:\n    str xzr,[x1,x2,lsl #3]\n    add x2,x2,#1\n    cmp x2,#SIZE * SIZE\n    blt 1b\n100:\n    ldp x1,x2,[sp],16       // restaur des  2 registres\n    ldp x0,lr,[sp],16       // restaur des  2 registres\n    ret\n/******************************************************************/\n/*     key move                                                   */ \n/******************************************************************/\n/* x0 contains key value               */\nkeyMove:\n    stp x1,lr,[sp,-16]!     // save  registres\n    lsr x0,x0,#16\n    cmp x0,#0x42                  // down arrow \n    bne 1f\n    bl moveDown\n    b 100f\n1:\n    cmp x0,#0x41                  // high arrow\n    bne 2f\n    bl moveUp\n    b 100f\n2:\n    cmp x0,#0x43                  // right arrow\n    bne 3f\n    bl moveRight\n    b 100f\n3:\n    cmp x0,#0x44                  // left arrow\n    bne 4f\n    bl moveLeft\n    b 100f\n4:\n    ldr x0,qAdrqTouche\n    ldrb w0,[x0]\n    cmp w0,#'q'                   // quit game\n    bne 5f\n    mov x0,#-1\n    b 100f\n5:\n    cmp w0,#'Q'                   // quit game\n    bne 100f\n    mov x0,#-1\n    b 100f\n\n100:\n    ldp x1,lr,[sp],16       // restaur des  2 registres\n    ret\n/******************************************************************/\n/*           move left                                   */ \n/******************************************************************/\n/* x0 return -1 if ok     */\nmoveLeft:\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    stp x10,x11,[sp,-16]!        // save  registres\n    ldr x1,qAdrqTbCase\n    mov x0,#0                   // top move Ok\n    mov x2,#0                   // line indice\n1:\n    mov x6,#0                   // counter empty case\n    mov x7,#0                   // first digit\n    mov x10,#0                  // last digit to add\n    mov x3,#0                   // column indice\n2:\n    lsl x5,x2,#2                // change this if size <> 4\n    add x5,x5,x3                // compute table indice\n    ldr x4,[x1,x5,lsl #3]\n    cmp x4,#0\n    cinc x6,x6,eq               // positions vides\n    beq 5f\n    cmp x6,#0\n    beq 3f                      // no empty left case\n    mov x8,#0\n    str x8,[x1,x5,lsl #3]       // raz digit\n    sub x5,x5,x6\n    str x4,[x1,x5,lsl #3]       // and store to left empty position\n    mov x0,#1                   // move Ok\n3:\n    cmp x7,#0                   // first digit\n    beq 4f\n    cmp x10,x4                  // prec digit have to add \n    beq 4f\n    sub x8,x5,#1                // prec digit \n    ldr x9,[x1,x8,lsl #3]\n    cmp x4,x9                   // equal\u00a0?\n    bne 4f\n    mov x10,x4                  // save digit \n    add x4,x4,x9                // yes -> add\n    str x4,[x1,x8,lsl #3]\n    cmp x4,#TOTAL\n    beq 6f\n    mov x4,#0\n    str x4,[x1,x5,lsl #3]\n    add x6,x6,#1                // empty case + 1\n    mov x0,#1                   // move Ok\n4:\n    add x7,x7,#1                // no first digit\n\n5:                              // and loop\n    add x3,x3,#1\n    cmp x3,#SIZE\n    blt 2b\n    add x2,x2,#1\n    cmp x2,#SIZE\n    blt 1b\n    b 100f\n6:\n    mov x0,#2                   // total = 2048\n100:\n    ldp x10,x11,[sp],16         // restaur des  2 registres\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*           move right                                   */ \n/******************************************************************/\n/* x0 return -1 if ok     */\nmoveRight:\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    stp x10,x11,[sp,-16]!        // save  registres\n    ldr x1,qAdrqTbCase\n    mov x0,#0\n    mov x2,#0\n1:\n    mov x6,#0\n    mov x7,#0\n    mov x10,#0\n    mov x3,#SIZE-1\n2:\n    lsl x5,x2,#2                  // change this if size <> 4\n    add x5,x5,x3\n    ldr x4,[x1,x5,lsl #3]\n    cmp x4,#0\n    cinc x6,x6,eq               // positions vides\n    beq 5f\n\n    cmp x6,#0\n    beq 3f                      // no empty right case\n    mov x0,#0\n    str x0,[x1,x5,lsl #3]       // raz digit\n    add x5,x5,x6\n    str x4,[x1,x5,lsl #3]       // and store to right empty position\n    mov x0,#1\n3:\n    cmp x7,#0                   // first digit\n    beq 4f\n    add x8,x5,#1                // next digit \n    ldr x9,[x1,x8,lsl #3]\n    cmp x4,x9                   // equal\u00a0?\n    bne 4f\n    cmp x10,x4\n    beq 4f\n    mov x10,x4\n    add x4,x4,x9                // yes -> add\n    str x4,[x1,x8,lsl #3]\n    cmp x4,#TOTAL\n    beq 6f\n    mov x4,#0\n    str x4,[x1,x5,lsl #3]\n    add x6,x6,#1                // empty case + 1\n    mov x0,#1\n4:\n    add x7,x7,#1                // no first digit\n\n5:                              // and loop\n    sub x3,x3,#1\n    cmp x3,#0\n    bge 2b\n    add x2,x2,#1\n    cmp x2,#SIZE\n    blt 1b\n    b 100f\n6:\n    mov x0,#2\n100:\n    ldp x10,x11,[sp],16         // restaur des  2 registres\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*           move down                                   */ \n/******************************************************************/\n/* x0 return -1 if ok     */\nmoveDown:\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    stp x10,x11,[sp,-16]!        // save  registres\n    ldr x1,qAdrqTbCase\n    mov x0,#0\n    mov x3,#0\n1:\n    mov x6,#0\n    mov x7,#0\n    mov x10,#0\n    mov x2,#SIZE-1\n2:\n    lsl x5,x2,#2                  // change this if size <> 4\n    add x5,x5,x3\n    ldr x4,[x1,x5,lsl #3]\n    cmp x4,#0\n    cinc x6,x6,eq               // positions vides\n    beq 5f\n    cmp x6,#0\n    beq 3f                      // no empty right case\n    mov x0,#0\n    str x0,[x1,x5,lsl #3]       // raz digit\n    lsl x0,x6,#2\n    add x5,x5,x0\n    str x4,[x1,x5,lsl #3]       // and store to right empty position\n    mov x0,#1\n3:\n    cmp x7,#0                   // first digit\n    beq 4f\n    add x8,x5,#SIZE                // down digit \n    ldr x9,[x1,x8,lsl #3]\n    cmp x4,x9                   // equal\u00a0?\n    bne 4f\n    cmp x10,x4\n    beq 4f\n    mov x10,x4\n    add x4,x4,x9                // yes -> add\n    str x4,[x1,x8,lsl #3]\n    cmp x4,#TOTAL\n    beq 6f\n    mov x4,#0\n    str x4,[x1,x5,lsl #3]\n    add x6,x6,#1                // empty case + 1\n    mov x0,#1\n4:\n    add x7,x7,#1                   // no first digit\n\n5:                           // and loop\n    sub x2,x2,#1\n    cmp x2,#0\n    bge 2b\n    add x3,x3,#1\n    cmp x3,#SIZE\n    blt 1b\n    b 100f\n6:\n    mov x0,#2\n100:\n    ldp x10,x11,[sp],16         // restaur des  2 registres\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*           move up                                   */ \n/******************************************************************/\n/* x0 return -1 if ok     */\nmoveUp:\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    stp x10,x11,[sp,-16]!        // save  registres\n    ldr x1,qAdrqTbCase\n    mov x0,#0\n    mov x3,#0\n1:\n    mov x6,#0\n    mov x7,#0\n    mov x10,#0\n    mov x2,#0\n2:\n    lsl x5,x2,#2                  // change this if size <> 4\n    add x5,x5,x3\n    ldr x4,[x1,x5,lsl #3]\n    cmp x4,#0\n    cinc x6,x6,eq               // positions vides\n    beq 5f\n    cmp x6,#0\n    beq 3f                      // no empty right case\n    mov x0,#0\n    str x0,[x1,x5,lsl #3]       // raz digit\n    lsl x0,x6,#2\n    sub x5,x5,x0\n    str x4,[x1,x5,lsl #3]       // and store to right empty position\n    mov x0,#1\n3:\n    cmp x7,#0                   // first digit\n    beq 4f\n    sub x8,x5,#SIZE             // up digit \n    ldr x9,[x1,x8,lsl #3]\n    cmp x4,x9                   // equal\u00a0?\n    bne 4f\n    cmp x10,x4\n    beq 4f\n    mov x10,x4\n    add x4,x4,x9                // yes -> add\n    str x4,[x1,x8,lsl #3]\n    cmp x4,#TOTAL\n    beq 6f\n    mov x4,#0\n    str x4,[x1,x5,lsl #3]\n    add x6,x6,#1                // empty case + 1\n    mov x0,#1\n4:\n    add x7,x7,#1                // no first digit\n\n5:                              // and loop\n    add x2,x2,#1\n    cmp x2,#SIZE\n    blt 2b\n    add x3,x3,#1\n    cmp x3,#SIZE\n    blt 1b\n    b 100f\n6:\n    mov x0,#2\n100:\n    ldp x10,x11,[sp],16         // restaur des  2 registres\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*           add new digit on game                                   */ \n/******************************************************************/\n/* x0 return -1 if ok     */\naddDigit:\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    sub sp,sp,#8 * SIZE*SIZE\n    mov fp,sp\n    \n    mov x0,#100\n    bl genereraleas\n    cmp x0,#10\n    mov x1,#4\n    mov x5,#2\n    csel x5,x5,x1,ge\n   // movlt x5,#4\n    //movge x5,#2\n    ldr x1,qAdrqTbCase\n    mov x3,#0\n    mov x4,#0\n1:  \n    ldr x2,[x1,x3,lsl 3]\n    cmp x2,#0\n    bne 2f\n    str x3,[fp,x4,lsl 3]\n    add x4,x4,#1\n2:\n    add x3,x3,#1\n    cmp x3,#SIZE*SIZE\n    blt 1b\n    cmp x4,#0                 // no empty case\n    beq 4f\n    cmp x4,#1\n    bne 3f\n    ldr x2,[fp]               // one case\n    str x5,[x1,x2,lsl 3]\n    mov x0,#0\n    b 100f\n3:                            // multiple case\n    sub x0,x4,#1\n    bl genereraleas\n    ldr x2,[fp,x0,lsl 3]\n    str x5,[x1,x2,lsl 3]\n    mov x0,#0\n    b 100f\n4:\n    mov x0,#-1\n100:\n    add sp,sp,#8*  (SIZE*SIZE)  // stack alignement\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\nqAdrqTbCase:         .quad qTbCase\n/******************************************************************/\n/*            display game                                      */ \n/******************************************************************/\ndisplayGame:\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    ldr x0,qAdrszCleax1\n    bl affichageMess\n    ldr x0,qAdrszLineH\n    bl affichageMess\n    ldr x0,qAdrszLineVT\n    bl affichageMess\n    ldr x0,qAdrszLineV\n    bl affichageMess\n    ldr x1,qAdrqTbCase\n    mov x2,#0\n1:\n    ldr x0,[x1,x2,lsl #3]\n    bl digitString\n    bl affichageMess\n    ldr x0,qAdrszLineV\n    bl affichageMess\n    add x2,x2,#1\n    cmp x2,#SIZE\n    blt 1b\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess\n    ldr x0,qAdrszLineVT\n    bl affichageMess\n    ldr x0,qAdrszLineH\n    bl affichageMess\n    ldr x0,qAdrszLineVT\n    bl affichageMess\n    ldr x0,qAdrszLineV\n    bl affichageMess\n2:\n    ldr x0,[x1,x2,lsl #3]\n    bl digitString\n    bl affichageMess\n    ldr x0,qAdrszLineV\n    bl affichageMess\n    add x2,x2,#1\n    cmp x2,#SIZE*2\n    blt 2b\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess\n    ldr x0,qAdrszLineVT\n    bl affichageMess\n    ldr x0,qAdrszLineH\n    bl affichageMess\n    ldr x0,qAdrszLineVT\n    bl affichageMess\n    ldr x0,qAdrszLineV\n    bl affichageMess\n3:\n    ldr x0,[x1,x2,lsl #3]\n    bl digitString\n    bl affichageMess\n    ldr x0,qAdrszLineV\n    bl affichageMess\n    add x2,x2,#1\n    cmp x2,#SIZE*3\n    blt 3b\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess\n    ldr x0,qAdrszLineVT\n    bl affichageMess\n    ldr x0,qAdrszLineH\n    bl affichageMess\n    ldr x0,qAdrszLineVT\n    bl affichageMess\n    ldr x0,qAdrszLineV\n    bl affichageMess\n4:\n    ldr x0,[x1,x2,lsl #3]\n    bl digitString\n    bl affichageMess\n    ldr x0,qAdrszLineV\n    bl affichageMess\n    add x2,x2,#1\n    cmp x2,#SIZE*4\n    blt 4b\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess\n    ldr x0,qAdrszLineVT\n    bl affichageMess\n    ldr x0,qAdrszLineH\n    bl affichageMess\n\n100:\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\nqAdrszLineH:         .quad szLineH\nqAdrszLineV:         .quad szLineV\nqAdrszLineVT:        .quad szLineVT\n/******************************************************************/\n/*            digits string                                       */ \n/******************************************************************/\n/* x0 contains number */\n/* x0 return address string */\ndigitString:\n    stp x1,lr,[sp,-16]!          // save  registres\n    cmp x0,#0\n    bne 1f\n    ldr x0,qAdrszMess0\n    b 100f\n1:\n    cmp x0,#2\n    bne 2f\n    ldr x0,qAdrszMess2\n    b 100f\n2:\n    cmp x0,#4\n    bne 3f\n    ldr x0,qAdrszMess4\n    b 100f\n3:\n    cmp x0,#8\n    bne 4f\n    ldr x0,qAdrszMess8\n    b 100f\n4:\n    cmp x0,#16\n    bne 5f\n    ldr x0,qAdrszMess16\n    b 100f\n5:\n    cmp x0,#32\n    bne 6f\n    ldr x0,qAdrszMess32\n    b 100f\n6:\n    cmp x0,#64\n    bne 7f\n    ldr x0,qAdrszMess64\n    b 100f\n7:\n    cmp x0,#128\n    bne 8f\n    ldr x0,qAdrszMess128\n    b 100f\n8:\n    cmp x0,#256\n    bne 9f\n    ldr x0,qAdrszMess256\n    b 100f\n9:\n    cmp x0,#512\n    bne 10f\n    ldr x0,qAdrszMess512\n    b 100f\n10:\n    cmp x0,#1024\n    bne 11f\n    ldr x0,qAdrszMess1024\n    b 100f\n11:\n    cmp x0,#2048\n    bne 12f\n    ldr x0,qAdrszMess2048\n    b 100f\n12:\n    ldr x1,qAdrszMessErreur                       // error message\n    bl   displayError\n100:\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\nqAdrszMess0:          .quad szMess0\nqAdrszMess2:          .quad szMess2\nqAdrszMess4:          .quad szMess4\nqAdrszMess8:          .quad szMess8\nqAdrszMess16:         .quad szMess16\nqAdrszMess32:         .quad szMess32\nqAdrszMess64:         .quad szMess64\nqAdrszMess128:        .quad szMess128\nqAdrszMess256:        .quad szMess256\nqAdrszMess512:        .quad szMess512\nqAdrszMess1024:       .quad szMess1024\nqAdrszMess2048:        .quad szMess2048\n\n//qAdrsBuffer:         .quad sBuffer\nqAdrszMessErreur\u00a0:        .quad szMessErreur \n\n/***************************************************/\n/*   Generation random number                  */\n/***************************************************/\n/* x0 contains limit  */\ngenereraleas:\n    stp x1,lr,[sp,-16]!            // save  registers\n    stp x2,x3,[sp,-16]!            // save  registers\n    ldr x1,qAdrqGraine\n    ldr x2,[x1]\n    ldr x3,qNbDep1\n    mul x2,x3,x2\n    ldr x3,qNbDep2\n    add x2,x2,x3\n    str x2,[x1]                    // maj de la graine pour l appel suivant \n    cmp x0,#0\n    beq 100f\n    udiv x3,x2,x0\n    msub x0,x3,x0,x2               // r\u00e9sult = remainder\n \n100:                               // end function\n    ldp x2,x3,[sp],16              // restaur  2 registers\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n/*****************************************************/\nqAdrqGraine: .quad qGraine\nqNbDep1:     .quad 0x0019660d\nqNbDep2:     .quad 0x3c6ef35f\n \n/******************************************************************/\n/*     traitement du signal                                       */ \n/******************************************************************/\nsighandler:\n    stp x0,lr,[sp,-16]!            // save  registers\n    str x1,[sp,-16]! \n    ldr x0,qAdrqEnd\n    mov x1,#1                      // maj zone end\n    str x1,[x0]\n    ldr x1,[sp],16\n    ldp x0,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n/***************************************************/\n/*   display error message                         */\n/***************************************************/\n/* x0 contains error code  x1\u00a0: message address */\ndisplayError:\n    stp x2,lr,[sp,-16]!            // save  registers\n    mov x2,x0                      // save error code\n    mov x0,x1\n    bl affichageMess\n    mov x0,x2                      // error code\n    ldr x1,qAdrsZoneConv\n    bl conversion16                // conversion hexa\n    ldr x0,qAdrszMessErr           // display error message\n    ldr x1,qAdrsZoneConv\n    bl strInsertAtCharInc               // insert result at @ character\n    mov x3,x0\n    mov x0,x2                      // error code\n    ldr x1,qAdrsZoneConv               // result address\n    bl conversion10S                // conversion decimale\n    mov x0,x3\n    ldr x1,qAdrsZoneConv\n    bl strInsertAtCharInc               // insert result at @ character\n    bl affichageMess\n100:\n    ldp x2,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\nqAdrszMessErr:                 .quad szMessErr\n/*********************************/\n/* init terminal state            */\n/*********************************/\ninitTerm:\n    stp x1,lr,[sp,-16]!            // save  registers\n    /* read terminal state */\n    mov x0,STDIN                   // input console\n    mov x1,TCGETS\n    ldr x2,qAdrstOldtio\n    mov x8,IOCTL                   // call system Linux\n    svc 0 \n    cbnz x0,98f                    // error\u00a0?\n \n    adr x0,sighandler              // adresse routine traitement signal\n    ldr x1,qAdrstSigAction         // adresse structure sigaction\n    str x0,[x1,sa_handler]         // maj handler\n    mov x0,SIGINT                  // signal type\n    ldr x1,qAdrstSigAction\n    mov x2,0\n    mov x3,8\n    mov x8,SIGACTION               // call system\n    svc 0 \n \n    cmp x0,0                       // error\u00a0?\n    bne 98f\n    mov x0,SIGQUIT\n    ldr x1,qAdrstSigAction\n    mov x2,0                       // NULL\n    mov x8,SIGACTION               // call system \n    svc 0 \n    cmp x0,0                       // error\u00a0?\n    bne 98f\n    mov x0,SIGTERM\n    ldr x1,qAdrstSigAction\n    mov x2,0                       // NULL\n    mov x8,SIGACTION               // appel systeme \n    svc 0 \n    cmp x0,0\n    bne 98f\n    //\n    adr x0,qAdrSIG_IGN             // address signal igonre function\n    ldr x1,qAdrstSigAction1\n    str x0,[x1,sa_handler]\n    mov x0,SIGTTOU                 //invalidate other process signal\n    ldr x1,qAdrstSigAction1\n    mov x2,0                       // NULL\n    mov x8,SIGACTION               // call system \n    svc 0 \n    cmp x0,0\n    bne 98f\n    //\n    /* read terminal current state  */\n    mov x0,STDIN\n    mov x1,TCGETS\n    ldr x2,qAdrstCurtio            // address current termio\n    mov x8,IOCTL                   // call systeme \n    svc 0 \n    cmp x0,0                       // error\u00a0?\n    bne 98f\n    mov x2,ICANON | ECHO           // no key pressed echo on display\n    mvn x2,x2                      // and one key \n    ldr x1,qAdrstCurtio\n    ldr x3,[x1,#term_c_lflag]\n    and x3,x2,x2                   // add flags \n    str x3,[x1,#term_c_lflag]      // and store\n    mov x0,STDIN                   // maj terminal current state \n    mov x1,TCSETS\n    ldr x2,qAdrstCurtio\n    mov x8,IOCTL                   // call system\n    svc 0 \n    cbz x0,100f\n98:                                // error display\n    ldr x1,qAdrszMessErrInitTerm\n    bl   displayError\n    mov x0,-1\n100:\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\nqAdrstSigAction2:    .quad stSigAction2\nqAdrstSigAction3:    .quad stSigAction3\n/*********************************/\n/* init instance epool            */\n/*********************************/\ninitPoll:\n    stp x1,lr,[sp,-16]!            // save  registers\n    ldr x0,qAdrstevents\n    mov x1,STDIN                   // maj structure events\n    str x1,[x0,#poll_fd]           // maj FD\n    mov x1,POLLIN                  // action code\n    str x1,[x0,#poll_event]\n    mov x0,0\n    mov x8,CREATPOLL               // create epoll instance\n    svc 0\n    cmp x0,0                       // error\u00a0?\n    ble 98f\n    mov x10,x0                     // return FD epoll instance\n    mov x1,EPOLL_CTL_ADD\n    mov x2,STDIN                   // Fd to we want add\n    ldr x3,qAdrstevents            // structure events address\n    mov x8,CTLPOLL                 // call system control epoll\n    svc 0\n    cmp x0,0                       // error\u00a0?\n    blt 98f                       // no\n    mov x0,x10                     // return FD epoll instance\n    b 100f\n98:                                // error display\n    ldr x1,qAdrszMessErrInitPoll   // error message\n    bl   displayError\n    mov x0,-1\n100:\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n/*********************************/\n/* wait key                      */\n/*********************************/\n/* x0 contains FD poll    */\nwaitKey:\n    stp x1,lr,[sp,-16]!            // save  registers\n    ldr x11,qAdrqTouche            // key address\n    str xzr,[x11]                  // raz key\n1:\n    ldr x1,qAdrqEnd                // if signal ctrl-c  -> end\n    ldr x1,[x1]\n    cbnz x1,100f\n \n    ldr x1,qAdrstevents\n    mov x2,12                      // size events\n    mov x3,1                       // timeout = 1  TODO:\u00a0??\n    mov x4,0\n    mov x8,SYSPOLL                 // call system wait POLL\n    svc 0 \n    cmp x0,0                       // key pressed\u00a0?\n    bge 100f\n98:                                // error display\n    ldr x1,qAdrszMessErreurKey        // error message\n    bl   displayError\n    mov x0,-1\n100:\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n/*********************************/\n/* read key                      */\n/*********************************/\n/* x0 returns key value */\nreadKey:\n    stp x1,lr,[sp,-16]!            // save  registers\n    mov x0,STDIN                   // File Descriptor\n    ldr x1,qAdrqTouche             // buffer address\n    mov x2,KEYSIZE                 // key size\n    mov x8,READ                    // read key\n    svc #0\n    cmp x0,0                       // error\u00a0?\n    ble 98f\n    ldr x2,qAdrqTouche             // key address\n    ldr x0,[x2]\n    b 100f\n98:                                // error display\n    ldr x1,qAdrszMessErreur        // error message\n    bl   displayError\n    mov x0,-1\n100:\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n/*********************************/\n/* restaur terminal state        */\n/*********************************/\nrestauTerm:\n    stp x1,lr,[sp,-16]!            // save  registers\n    mov x0,STDIN                   // end then restaur begin state terminal\n    mov x1,TCSETS\n    ldr x2,qAdrstOldtio\n    mov x8,IOCTL                   // call system  \n    svc 0\n    cbz x0,100f\n    ldr x1,qAdrszMessErreur        // error message\n    bl   displayError\n100:\n    ldp x1,lr,[sp],16              // restaur  2 registers\n    ret                            // return to address lr x30\n/********************************************************/\n/*        File Include fonctions                        */\n/********************************************************/\n/* for this file see task include a file in language AArch64 assembly */\n.include \"../includeARM64.inc\"",
        "safe": true
    },
    {
        "filename": "2048_70.txt",
        "content": "-- 2048 for Lua 5.1-5.4, 12/3/2020 db\nlocal unpack = unpack or table.unpack -- for 5.3 +/- compatibility\ngame = {\n  cell = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},\n  best = 0,\n  draw = function(self)\n    local t = self.cell\n    print(\"+----+----+----+----+\")\n    for r=0,12,4 do\n      print(string.format(\"|%4d|%4d|%4d|%4d|\\n+----+----+----+----+\",t[r+1],t[r+2],t[r+3],t[r+4]))\n    end\n  end,\n  incr = function(self)\n    local t,open = self.cell,{}\n    for i=1,16 do if t[i]==0 then open[#open+1]=i end end\n    t[open[math.random(#open)]] = math.random()<0.1 and 4 or 2\n  end,\n  pack = function(self,ofr,oto,ost,ifr,ito,ist)\n    local t = self.cell\n    for outer=ofr,oto,ost do\n      local skip = 0\n      for inner=ifr,ito,ist do\n        local i = outer+inner\n        if t[i]==0 then skip=skip+1 else if skip>0 then t[i-skip*ist],t[i],self.diff = t[i],0,true end end\n      end\n    end\n  end,\n  comb = function(self,ofr,oto,ost,ifr,ito,ist)\n    local t = self.cell\n    for outer=ofr,oto,ost do\n      for inner=ifr,ito-ist,ist do\n        local i,j = outer+inner,outer+inner+ist\n        if t[i]>0 and t[i]==t[j] then t[i],t[j],self.diff,self.best = t[i]*2,0,true,math.max(self.best,t[i]*2) end\n      end\n    end\n  end,\n  move = function(self,dir)\n    local loopdata = {{0,12,4,1,4,1},{0,12,4,4,1,-1},{1,4,1,0,12,4},{1,4,1,12,0,-4}}\n    local ofr,oto,ost,ifr,ito,ist = unpack(loopdata[dir])\n    self:pack(ofr,oto,ost,ifr,ito,ist)\n    self:comb(ofr,oto,ost,ifr,ito,ist)\n    self:pack(ofr,oto,ost,ifr,ito,ist)\n  end,\n  full = function(self)\n    local t = self.cell\n    for r=0,12,4 do\n      for c=1,4 do\n        local i,v = r+c,t[r+c]\n        if (v==0) or (c>1 and t[i-1]==v) or (c<4 and t[i+1]==v) or (r>0 and t[i-4]==v) or (r<12 and t[i+4]==v) then\n          return false\n        end\n      end\n    end\n    return true\n  end,\n  play = function(self)\n    math.randomseed(os.time())\n    self:incr()\n    self:incr()\n    while true do\n      self:draw()\n      if self.best==2048 then print(\"WIN!\") break end\n      if self:full() then print(\"LOSE!\") break end\n      io.write(\"Your move (wasd + enter, or q + enter to quit):  \")\n      local char = io.read()\n      self.diff = false\n      if (char==\"a\") then self:move(1)\n      elseif (char==\"d\") then self:move(2)\n      elseif (char==\"w\") then self:move(3)\n      elseif (char==\"s\") then self:move(4)\n      elseif (char==\"q\") then break end\n      if self.diff then self:incr() end\n    end\n  end\n}\ngame:play()\n",
        "safe": true
    },
    {
        "filename": "2048_71.txt",
        "content": "+----+----+----+----+\n|   2|   0|   0|   0|\n+----+----+----+----+\n|   4|   0|   0|   0|\n+----+----+----+----+\n|   2|   2|  16|   4|\n+----+----+----+----+\n|   4|  32|  64| 128|\n+----+----+----+----+\nYour move (wasd + enter, or q + enter to quit):",
        "safe": true
    },
    {
        "filename": "2048_72.txt",
        "content": "Module Game2048 {\n      \\\\ 10% 4 and 90% 2\n      Def GetTlleNumber()=If(Random(10)<2->4, 2)\n      \\\\ tile\n      Def Tile$(x)=If$(x=0->\"[    ]\", format$(\"[{0::-4}]\", x))\n      \\\\ empty board\n      BoardTileRight=lambda (x, y)->x+y*4\n      BoardTileLeft=lambda (x, y)->3-x+y*4\n      BoardTileUp=lambda (x, y)->x*4+y\n      BoardTileDown=lambda (x, y)->(3-x)*4+y\n      Dim Board(0 to 15)\n      Inventory EmptyTiles\n      \\\\ Score is a statement but we can use it as a variable too.\n      Score=0\n      \\\\ Win is also a statement but we can use it as a variable too.\n      Win=False\n      ExitNow=False\n      BoardDirection=BoardtileRight\n      Process(BoardDirection)\n      \\\\ Split Rem lines to insert start condition to check valid moves\n      Rem\u00a0: board(0)=2\n      Rem\u00a0: board(1)=2, 2, 2   ' place to (1), (2), (3)\n            While len(EmptyTiles) {\n            NewTile()\n            DrawBoard()\n            Action=False\n            do {\n                  a$=key$\n                  if len(a$)=2 then {\n                        Action=true            \n                        Select case Asc(mid$(a$,2))\n                        Case 72\n                        BoardDirection=BoardTileUp\n                        Case 75\n                        BoardDirection=BoardTileRight\n                        Case 77\n                        BoardDirection=BoardTileLeft\n                        Case 80\n                        BoardDirection=BoardTileDown\n                        Case 79 ' End key\n                              ExitNow=True\n                        Else\n                        Action=false\n                        end select     \n                  }\n            } until Action\n            If ExitNow then exit\n            Process(BoardDirection)\n      }\n      If Win then {\n            Print \"You Win\"\n      } Else {\n            Print \"You Loose\"\n      }\n      End\n      Sub Process(Boardtile)\n      Inventory EmptyTiles   ' clear inventory\n      local where, i, j, k\n      For i=0 to 3\n            Gravity()\n            k=boardtile(0,i)\n            For j=1 to 3\n                  where=boardtile(j,i)\n                  if Board(where)<>0 then {\n                        if board(k)=board(where) then {\n                               board(k)*=2\u00a0: score+=board(where): board(where)=0\n                               if board(k)=2048 Then Win=True\u00a0: ExitNow=true\n                        }\n                  }\n                  k=where \n            Next j\n            Gravity()\n            For j=0 to 3\n                  where=boardtile(j,i)\n                  if board(where)=0 then Append EmptyTiles, where\n            Next j\n      Next i\n      End Sub\n      Sub NewTile()\n            local m=EmptyTiles(Random(0, len(EmptyTiles)-1)!)\n            Board(m)=GetTlleNumber()\n            Delete EmptyTiles, m\n      End Sub\n      Sub DrawBoard()\n            Refresh 2000\n            Cls\n            Cursor 0, 10\n            Local Doc$, line$\n            Document Doc$\n            Doc$=Format$(\"Game 2048 Score {0}\", score)\n            \\\\ Using Report 2 we use rendering as text, with center justify\n            Report 2, Doc$\n            Doc$={\n            }\n            Local i, j\n            For i=0 to 3\n                  line$=\"\"\n                  For j=0 to 3\n                        line$+=Tile$(Board(BoardTileRight(j, i)))\n                  Next j\n                  Print Over $(2), Line$\n                  Print\n                  Doc$=Line$+{\n                  }\n            Next i\n            Report 2, \"Next:Use Arrows | Exit: Press End\"\n            Refresh\n            ClipBoard Doc$\n      End Sub     \n      Sub Gravity()\n            k=-1\n            for j=0 to 3 {\n                  where=boardtile(j,i)\n                  if k=-1 then if board(where)=0 then k=j\u00a0: continue\n                  if board(where)=0  then continue\n                  if k=-1 then continue\n                  board(boardtile(k,i))=board(where)\n                  board(where)=0\n                  k++\n            }  \n      End Sub\n}\nGame2048",
        "safe": true
    },
    {
        "filename": "2048_73.txt",
        "content": "Game 2048 Score 14\n[   2][   4][   8][   8]\n[    ][   2][   2][   2]\n[    ][    ][    ][    ]\n[    ][    ][    ][    ]\nGame 2048 Score 24\n[    ][   2][   4][  16]\n[    ][    ][   2][   4]\n[    ][    ][    ][    ]\n[    ][    ][   2][    ]\nGame 2048 Score 26\n[    ][    ][    ][    ]\n[    ][    ][    ][    ]\n[   2][    ][   4][  16]\n[    ][   2][   4][   4]\nGame 2048 Score 30\n[    ][    ][    ][    ]\n[    ][    ][    ][    ]\n[    ][   2][    ][  16]\n[   2][   2][   8][   4]\n\n",
        "safe": true
    },
    {
        "filename": "2048_74.txt",
        "content": "macro(SP=DocumentTools:-SetProperty, GP=DocumentTools:-GetProperty);\nG\u00a0:= module()\n\t\n\texport reset,f,getname;\n\tlocal a:=Matrix(4):\n\tlocal buttonpress:=\"False\";\n\tlocal score:=0;\n\tlocal highscoreM,highscore,hscore,hname,M,j,k,z,e,move,r,c,q,w,checklose,loss,matrixtotextarea;\n\t\n\tgetname:=proc();\t\n\t\thname:=GP(\"Name\",value);\n\t\tbuttonpress:=\"True\";\n\t\tif score>hscore then\n\t\t\tM:=Matrix(1, 2, [[score, hname]]):\n\t\t\tExportMatrix(\"this:///Score.csv\",M);\n\t\t\treset();\n\t\telse\n\t\t\treset();\n\t\tend if;\n\tend proc;\n\n\tmatrixtotextarea:=proc(m)\n\t\tlocal m2,colors;\n\t\tcolors:=[\"White\",\"Beige\",\"LightGrey\",ColorTools:-Color(\"RGB\", [255/255, 127/255,  80/255]),ColorTools:-Color(\"RGB\", [255/255, 99/255,  71/255]),ColorTools:-Color(\"RGB\", [255/255, 69/255,  0/255]),ColorTools:-Color(\"RGB\", [255/255, 0/255,  0/255]),ColorTools:-Color(\"RGB\", [255/255, 215/255,  0/255]), ColorTools:-Color(\"RGB\", [255/255, 255/255,  0/255]),ColorTools:-Color(\"RGB\", [204/255, 204/255,  0/255]),ColorTools:-Color(\"RGB\", [153/255, 153/255,  0/255]),ColorTools:-Color(\"RGB\", [102/255, 102/255,  0/255]), ColorTools:-Color(\"RGB\", [0/255, 0/255,  0/255])]; \n\t\tm2\u00a0:= ArrayTools:-Reshape(m^%T, [16,1]):\n\t\tSP(seq([cat(\"TextArea\",i),value,m2[i+1,1]],i=0..15));\n\t\tSP(seq([\"Table1\",fillcolor[(`if`(i+1<5,1,`if`(i+1<9 and i+1>4,2,`if`(i+1<13 and i+1>8,3, `if`(i+1<17 and i+1>12,4,1))))),(i mod 4)+1],`if`(m2[i+1,1]=0,colors[1],`if`(m2[i+1,1]=2,colors[2],`if`(m2[i+1,1]=4,colors[3],`if`(m2[i+1,1]=8,colors[4],`if`(m2[i+1,1]=16,colors[5],`if`(m2[i+1,1]=32,colors[6],`if`(m2[i+1,1]=64,colors[7],`if`(m2[i+1,1]=128,colors[8],`if`(m2[i+1,1]=256,colors[9],`if`(m2[i+1,1]=512,colors[10],`if`(m2[i+1,1]=1024,colors[11],`if`(m2[i+1,1]=2048,colors[12],`if`(m2[i+1,1]>2048,colors[13],\"White\")))))))))))))],i=0..15));\n\t\tSP(seq([cat(\"TextArea\",i),fillcolor,`if`(m2[i+1,1]=0,colors[1],`if`(m2[i+1,1]=2,colors[2],`if`(m2[i+1,1]=4,colors[3],`if`(m2[i+1,1]=8,colors[4],`if`(m2[i+1,1]=16,colors[5],`if`(m2[i+1,1]=32,colors[6],`if`(m2[i+1,1]=64,colors[7],`if`(m2[i+1,1]=128,colors[8],`if`(m2[i+1,1]=256,colors[9],`if`(m2[i+1,1]=512,colors[10],`if`(m2[i+1,1]=1024,colors[11],`if`(m2[i+1,1]=2048,colors[12],`if`(m2[i+1,1]>2048,colors[13],\"White\")))))))))))))],i=0..15),refresh);\n\t\tSP(seq([cat(\"TextArea\",i),fontcolor,`if`(m2[i+1,1]=0,colors[1],`if`(m2[i+1,1]=2,colors[13],`if`(m2[i+1,1]=4,colors[13],\"White\")))],i=0..15),refresh);\n\tend proc:\n\t\n\treset:=proc();\n\t\thighscoreM\u00a0:= Import(\"this:///Score.csv\", output = Matrix);\n\t\thscore\u00a0:= highscoreM[1,1];\n\t\thname\u00a0:= highscoreM[1,2];\n\t\thighscore:=sprintf(\"%s\",cat(hscore,\"\\n\",hname));\n\t\tbuttonpress:=\"False\";\n\t\ta:=Matrix(4, 4, [[0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]]):\n\t\tscore:=0;\n\t\tmatrixtotextarea(a);\n\t\tSP(\"Score/Lose\",visible,true);\n\t\tSP(\"Score/Lose\",enabled,true);\n\t\tSP(\"Score/Lose\",caption,\"Click an Arrow to begin.\");\n\t\tSP(\"Score\",value,score);\n\t\tSP(\"Highscore\",value,highscore);\n\t\tSP(seq([j, enabled, false], j in [\"Name\",\"Enter\"])); \n\t\tSP(seq([j, visible, false], j in [\"Name\",\"Enter\"])); \n\t\tSP(seq([j, enabled, true], j in [\"Score\",\"Highscore\", seq(cat(\"Button\",k),k=0..4)]));\t\n\t\tSP(seq([j, visible, true], j in [\"Score\",\"Highscore\", seq(cat(\"Button\",k),k=0..4)]));\n\tend proc;\n\n\tchecklose:=proc();\n\t\tfor q from 2 to 4 do\n\t\t\tfor w from 4 to 1 by -1  do\n\t\t\t\tif a[q,w]=a[q-1,w] then\n\t\t\t\t\tloss:=\"False\";\n\t\t\t\t\treturn loss;\t\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\tend if;\n\t\t\tend do;\n\t\tend do;\n\t\treturn loss;\n\tend proc;\t\t\n\n\tf:=proc(keypress);\n\t\tSP(\"Score/Lose\",visible,false);\n\t\tSP(\"Score/Lose\",enabled,false);\n\t\tj\u00a0:= rand(1 .. 4); \n\t\tk\u00a0:= rand(1 .. 4); \n\t\tz\u00a0:= rand(1 .. 10); \n\t\te\u00a0:= 0; \n\t\tmove:=proc();\t\n\t\t\tfor q from 4 to 2 by -1 do\n\t\t\t\tfor w from 4 to 1 by -1  do\n\t\t\t\t\tif a[q,w]=a[q-1,w] then\n\t\t\t\t\t\ta[q-1,w]:=a[q-1,w]+a[q,w];\n\t\t\t\t\t\tscore:=score+a[q-1,w];\n\t\t\t\t\t\ta[q,w]:=0;\n\t\t\t\t\t\tif q-1>1 and a[q-2,w]=0 then\n\t\t\t\t\t\t\ta[q-2,w]:=a[q-1,w];\n\t\t\t\t\t\t\ta[q-1,w]:=0;\n\t\t\t\t\t\t\tif q-2>1 and a[q-3,w]=0 then\n\t\t\t\t\t\t\t\ta[q-3,w]:=a[q-2,w];\n\t\t\t\t\t\t\t\ta[q-2,w]:=0;\n\t\t\t\t\t\t\tend if;\n\t\t\t\t\t\tend if;\t\t\t\t\t\n\t\t\t\t\telif q-1>1 and a[q,w]=a[q-2,w] and a[q-1,w]=0 then\n\t\t\t\t\t\ta[q-2,w]:=a[q-2,w]+a[q,w];\n\t\t\t\t\t\tscore:=score+a[q-2,w];\n\t\t\t\t\t\ta[q,w]:=0;\n\t\t\t\t\t\tif q-2>1 and a[q-3,w]=0 then\n\t\t\t\t\t\t\ta[q-3,w]:=a[q-2,w];\n\t\t\t\t\t\t\ta[q-2,w]:=0;\n\t\t\t\t\t\tend if;\t\t\t\t\t\n\t\t\t\t\telif q-2>1 and a[q,w]=a[q-3,w] and a[q-1,w]=0 and a[q-2,w]=0 then\n\t\t\t\t\t\ta[q-3,w]:=a[q-3,w]+a[q,w];\n\t\t\t\t\t\tscore:=score+a[q-3,w];\n\t\t\t\t\t\ta[q,w]:=0;\t\n\t\t\t\t\telif a[q-1,w]=0 then\n\t\t\t\t\t\ta[q-1,w]:=a[q-1,w]+a[q,w];\n\t\t\t\t\t\ta[q,w]:=0;\n\t\t\t\t\t\tif q-1>1 and a[q-2,w]=0 then\n\t\t\t\t\t\t\ta[q-2,w]:=a[q-1,w];\n\t\t\t\t\t\t\ta[q-1,w]:=0;\n\t\t\t\t\t\t\tif q-2>1 and a[q-3,w]=0 then\n\t\t\t\t\t\t\t\ta[q-3,w]:=a[q-2,w];\n\t\t\t\t\t\t\t\ta[q-2,w]:=0;\n\t\t\t\t\t\t\tend if;\n\t\t\t\t\t\tend if;\t\t\t\t\t\n\t\t\t\t\telif q-1>1 and a[q-2,w]=0 and a[q-1,w]=0 then\n\t\t\t\t\t\ta[q-2,w]:=a[q-2,w]+a[q,w];\n\t\t\t\t\t\ta[q,w]:=0;\n\t\t\t\t\t\tif q-2>1 and a[q-3,w]=0 then\n\t\t\t\t\t\t\ta[q-3,w]:=a[q-2,w];\n\t\t\t\t\t\t\ta[q-2,w]:=0;\n\t\t\t\t\t\tend if;\t\t\t\t\t\n\t\t\t\t\telif q-2>1 and a[q-3,w]=0 and a[q-1,w]=0 and a[q-2,w]=0 then\n\t\t\t\t\t\ta[q-3,w]:=a[q-3,w]+a[q,w];\n\t\t\t\t\t\ta[q,w]:=0;\n\t\t\t\t\tend if;\n\t\t\t\tend do;\n\t\t\tend do;\t\t\n\t\tend proc;\n\t\n \t\tr\u00a0:= j(); \n          c\u00a0:= k();  \n\t\tif keypress=\"Up\" then\n\t\t\tmove();\t\t\t\t\t\n\t\t\n\t\telif keypress=\"Left\" then\n\t\t\ta:=LinearAlgebra:-Transpose(a);\n\t\t\tmove();\n\t\t\ta:=LinearAlgebra:-Transpose(a);\n\t\t\n\t\telif keypress=\"Right\" then\n\t\t\ta\u00a0:= ArrayTools:-FlipDimension(LinearAlgebra:-Transpose(a),1);\n\t\t\tmove();\n\t\t\ta\u00a0:= LinearAlgebra:-Transpose(ArrayTools:-FlipDimension(a,1));\n\t\t\t\n\t\telif keypress=\"Down\" then\n\t\t\ta\u00a0:= ArrayTools:-FlipDimension(a, 1);\n\t\t\tmove();\n\t\t\ta\u00a0:= ArrayTools:-FlipDimension(a, 1);\t\t\n\t\tend if;\n        \n\t\tif a[r, c] = 0 then \n\t\t\tif z() > 3 then \n\t\t\t\ta[r, c]\u00a0:= 2; \n\t\t\telse; \n\t\t\t\ta[r, c]\u00a0:= 4; \n\t\t\tend if; \n\t\telse\n\t\t\tfor q to 4 do \n\t\t\t\tfor w to 4 do \n\t\t\t\t\tif a[q, w] <> 0 then;\n\t\t\t\t\t\te:=e+1; \n\t\t\t\t\tend if; \n\t\t\t\tend do; \n\t\t\tend do; \n\t\t\tif e = 16 then\n\t\t\t\tloss:=\"True\";\n\t\t\t\tchecklose();\t\t\t\t\t\n\t\t\t\ta:=LinearAlgebra:-Transpose(a);\n\t\t\t\tchecklose();\n\t\t\t\ta:=LinearAlgebra:-Transpose(a);\n\t\t\t\ta\u00a0:= ArrayTools:-FlipDimension(LinearAlgebra:-Transpose(a),1);\n\t\t\t\tchecklose();\n\t\t\t\ta\u00a0:= LinearAlgebra:-Transpose(ArrayTools:-FlipDimension(a,1));\t\t\t\n\t\t\t\ta\u00a0:= ArrayTools:-FlipDimension(a, 1);\n\t\t\t\tchecklose();\n\t\t\t\ta\u00a0:= ArrayTools:-FlipDimension(a, 1);\n\t\t\t\tif loss=\"True\" then\t\t \n\t\t\t\t\tSP(\"Score/Lose\",visible,\"True\");\n\t\t\t\t\tSP(\"Score/Lose\",enabled,\"True\");\n\t\t\t\t\tSP(\"Score/Lose\",caption,\"You Lose!\");\n\t\t\t\t\tif score>hscore then\n\t\t\t\t\t\tSP(\"Score/Lose\",caption,\"Highscore! Enter your name below!\");\n\t\t\t\t\t\tSP(\"Enter\",caption,\"Confirm\");\n\t\t\t\t\t\tSP(seq([j, enabled, true], j in [\"Name\",\"Enter\",\"Score/Lose\"])); \n\t\t\t\t\t\tSP(seq([j, visible, true], j in [\"Name\",\"Enter\",\"Score/Lose\"])); \n\t\t\t\t\t\tSP(seq([j, enabled, false], j in [seq(cat(\"Button\",k),k=0..4)]));\n\t\t\t\t\t\tSP(seq([j, visible, false], j in [seq(cat(\"Button\",k),k=0..4)]));\n\t\t\t\t\t\tif buttonpress=\"True\" then\n\t\t\t\t\t\t\tM:=Matrix(1, 2, [[score, hname]]):\n\t\t\t\t\t\t\tExportMatrix(\"this:///Score.csv\",M);\n\t\t\t\t\t\t\tbuttonpress:=\"False\";\n\t\t\t\t\t\t\treset();\n\t\t\t\t\t\tend if;\n\t\t\t\t\telse\n\t\t\t\t\t\tSP(\"Score/Lose\",caption,\"Sorry, please try again.\");\n\t\t\t\t\t\tSP(\"Enter\",caption,\"Restart\");\n\t\t\t\t\t\tSP(\"Enter\",visible,\"True\");\n\t\t\t\t\t\tSP(\"Enter\",enabled,\"True\");\n\t\t\t\t\t\tSP(seq([j, enabled, false], j in [seq(cat(\"Button\",k),k=0..4)]));\n\t\t\t\t\t\tSP(seq([j, visible, false], j in [seq(cat(\"Button\",k),k=0..4)]));\t\t\t\n\t\t\t\t\t\tif buttonpress=\"True\" then\n\t\t\t\t\t\t\tbuttonpress:=\"False\";\n\t\t\t\t\t\t\treset();\n\t\t\t\t\t\tend if;\n\t\t\t\t\tend if;\n\t\t\t\tend if;\t\n\t\t\telse \n                  e:=0;\n                  while a[r, c] <> 0 do \n                      r\u00a0:= j(); \n                      c\u00a0:= k(); \n                  end do; \n                  if z() > 1 then \n                      a[r, c]\u00a0:= 2; \n                  else \n                      a[r, c]\u00a0:= 4; \n                  end if; \n\t\t\tend if; \n\t\tend if;  \n\t\tmatrixtotextarea(a); \n          SP(\"Score\",value,score,refresh);    \n          return a;  \n\tend proc;\nend module;\nG:-reset();SP(\"Score/Lose\",caption,\"Click an Arrow to begin.\");",
        "safe": true
    },
    {
        "filename": "2048_75.txt",
        "content": "SetOptions[InputNotebook[],NotebookEventActions->{\n\"LeftArrowKeyDown\":>(stat=Coalesce[stat];AddNew[]),\n\"RightArrowKeyDown\":>(stat=Reverse/@Coalesce[Reverse/@stat];AddNew[]),\n\"UpArrowKeyDown\":>(stat=Coalesce[stat\\[Transpose]]\\[Transpose];AddNew[]),\n\"DownArrowKeyDown\":>(stat=(Reverse/@(Coalesce[Reverse/@(stat\\[Transpose])]))\\[Transpose];AddNew[])\n}\n];\n\nn=4;\nbgcolor=GrayLevel[0.84];\ncolorfunc=Blend[{{0,Gray},{1/2,Red},{1,Blend[{Yellow,Orange}]}},#]&;\n\nClearAll[AddNew,PrintStat,Coalesce,SubCoalesce,AddRandomNumber]\nAddNew[]:=(stat=AddRandomNumber[stat])\nPrintStat[stat_]:=Module[{gr1,gr2,gr3,dr=0.2,cols,nstat=stat,positions},\ngr1={bgcolor,Rectangle[-dr{1,1},n+dr{1,1},RoundingRadius->dr]};\ncols=Map[If[#==0,0,Log2[#]]&,nstat,{2}];\ncols=Map[If[#==0,Lighter@bgcolor,colorfunc[#/Max[cols]]]&,cols,{2}];\npositions=Table[{i,n-j+1},{j,n},{i,n}];\ngr2=MapThread[{#2,Rectangle[#3-{1,1}(1-dr/3),#3-{1,1}dr/3,RoundingRadius->dr/2]}&,{stat,cols,positions},2];\ngr3=MapThread[If[#1>0,Style[Text[#1,#2-0.5{1,1}],20,White],{}]&,{stat,positions},2];\nGraphics[{gr1,gr2,gr3},PlotRange->{{-0.5,n+0.5},{-0.5,n+0.5}},ImageSize->500]\n]\nCoalesce[stat_]:=SubCoalesce/@stat\nSubCoalesce[statlist_]:=Module[{st=statlist,n=Length[statlist],pairs},\nst=Split[DeleteCases[st,0]];\nst=Partition[#,2,2,1,{}]&/@st;\nst=Map[If[Length[#]==2,Total[#],#]&,st,{2}];\nJoin[Flatten[st],ConstantArray[0,n-Length[Flatten[st]]]]\n]\nAddRandomNumber[stat_,n_:2]:=With[{pos=Position[stat,0,{2}]},If[Length[pos]>0,ReplacePart[stat,RandomChoice[pos]->n],stat]]\n\nstat=Nest[AddRandomNumber[#,RandomChoice[{2,4}]]&,ConstantArray[0,{n,n}],4];\nDynamic[PrintStat@stat]\n",
        "safe": true
    },
    {
        "filename": "2048_76.txt",
        "content": "function field = puzzle2048(field)\n\nif nargin < 1 || isempty(field)\n    field = zeros(4);\n    field = addTile(field);\nend\n\nclc\nrng('shuffle')\n\nwhile true\n    oldField = field;\n    clc\n    score = displayField(field);\n    \n    % check losing condition\n    if isGameLost(field)\n        sprintf('You lose with a score of %g.',score)\n        return\n    end\n    \n    direction = input('Which direction? (w,a,s,d) (x for exit)\\n','s');\n    switch direction\n        case 'w'\n            field = moveUp(field);\n        case 'a'\n            field = rot90( moveUp( rot90(field,-1) ) );\n        case 's'\n            field = flipud( moveUp( flipud(field) ) );\n        case 'd'\n            field = rot90( moveUp( rot90(field) ), -1);\n        case 'x'\n            return\n    end\n    \n    if any(field>=2048,'all')\n        disp('You win!')\n        return\n    end\n    \n    if ~all(field==oldField,'all')\n        field = addTile(field);\n    end\n\nend\n\nend\n\nfunction gameIsLost = isGameLost(field)\n\nif all(field,'all') && ...\n        all(conv2(field,[1, -1],'same'),'all') && ...\n        all(conv2(field,[1; -1],'same'),'all')\n    gameIsLost = true;\nelse\n    gameIsLost = false;\nend\n\nend\n\nfunction field = addTile(field)\n\nfreeIndices = find(~field);\nnewIndex = freeIndices( randi(length(freeIndices)) );\nnewNumber = 2 + 2 * (rand < 0.1);\nfield(newIndex) = newNumber;\n\nend\n\nfunction score = displayField(field)\n\n% Unicode characters for box drawings\n% 9484: U+250C Box Drawings Light Down and Right\n% 9472: U+2500 Box Drawings Light Horizontal\n% 9474: U+2502 Box Drawings Light Vertical\n% 9488: U+2510 Box Drawings Light Down and Left\n% 9492: U+2515 Box Drawings Light Up and Right\n% 9496: U+2518 Box Drawings Light Up and Left\n% 9500: U+251C Box Drawings Light Vertical and Right\n% 9508: U+2524 Box Drawings Light Vertical and Left\n% 9516: U+252C Box Drawings Light Down and Horizontal\n% 9524: U+2534 Box Drawings Light Up and Horizontal\n% 9532: U+253C Box Drawings Light Vertical and Horizontal\nscore = sum(field(:));\ncellField = arrayfun(@num2str, field, 'UniformOutput', false);\ncellField = cellfun(@(x) [ char(9474) blanks(5-length(x)) x ' ' ], ...\n    cellField, 'UniformOutput', false);\ntopRow = repmat('-',1,7*size(field,2)+1);\ntopRow(1:7:end) = char(9516);\ntopRow([1 end]) = [ char(9484) char(9488) ];\nmidRow = topRow;\nmidRow(1:7:end) = char(9532);\nmidRow([1 end]) = [ char(9500) char(9508) ];\nbotRow = topRow;\nbotRow(1:7:end) = char(9524);\nbotRow([1 end]) = [ char(9492) char(9496) ];\ncharField = topRow;\nfor iRow = cellField'\n    charField = [ charField; iRow{:} char(9474); midRow ];\nend\ncharField(end,:) = botRow;\ncharField(charField == '0') = ' ';\n\ndisp(charField)\nfprintf('\\nYour score: %g\\n', score)\n\nend\n\nfunction field = moveUp(field)\n\nfor iCol = 1:size(field,2)\n    col = field(:,iCol);\n    col = removeZeros(col);\n    for iRow = 1:length(col)-1\n        if col(iRow)==col(iRow+1)\n            col(iRow:iRow+1) = [ 2*col(iRow); 0 ];\n        end\n    end\n    col = removeZeros(col);\n    if length(col) < length(field)\n        col(end+1:length(field)) = 0;\n    end\n    field(:,iCol) = col;\nend\n\nend\n\nfunction vector = removeZeros(vector)\n\nvector(vector==0) = [];\n\nend\n",
        "safe": true
    },
    {
        "filename": "2048_77.txt",
        "content": "field = puzzle2048();\n",
        "safe": true
    },
    {
        "filename": "2048_78.txt",
        "content": "field = puzzle2048(savedField);\n",
        "safe": true
    },
    {
        "filename": "2048_79.txt",
        "content": "import random, strutils, terminal\n\nconst\n  BoardLength = 4\n  BoardSize = BoardLength * BoardLength\n  Target = 2048\n\ntype\n  Operation = enum\n    opInvalid\n    opUp\n    opDown\n    opLeft\n    opRight\n    opQuit\n    opRestart\n\n  Board = object\n    len: Natural\n    largestNumber: Natural\n    score: Natural\n    rows: array[BoardLength, array[BoardLength, Natural]]\n\nfunc handleKey(c: char): Operation =\n  case c\n  of 'w', 'W': opUp\n  of 'a', 'A': opLeft\n  of 's', 'S': opDown\n  of 'd', 'D': opRight\n  of 'q', 'Q': opQuit\n  of 'r', 'R': opRestart\n  else: opInvalid\n\nproc getKey(): Operation =\n  var c = getch()\n  if c == '\\e':\n    c = getch()\n    if c == '[':\n      case getch()\n      of 'A': opUp\n      of 'D': opLeft\n      of 'B': opDown\n      of 'C': opRight\n      else: opInvalid\n    else: handleKey c\n  else: handleKey c\n\nproc spawnRandom(b: var Board) =\n  if b.len < BoardSize:\n    var\n      x = rand 0..<BoardLength\n      y = rand 0..<BoardLength\n    while b.rows[y][x] != 0:\n      x = rand 0..<BoardLength\n      y = rand 0..<BoardLength\n    b.rows[y][x] = if rand(1.0) < 0.9: 2 else: 4\n    inc b.len\n    b.largestNumber = max(b.rows[y][x], b.largestNumber)\n\nproc initBoard(): Board =\n  spawnRandom result\n\nfunc `$`(b: Board): string =\n  result = \"\u250c\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2510\\n\"\n  for idx, val in b.rows:\n    for v in val:\n      result.add \"\u2502\"\n      result.add center(if v != 0: $v else: \"\", 4)\n    result.add \"\u2502\\n\"\n    if idx < high(b.rows):\n      result.add \"\u251c\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2524\\n\"\n    else:\n      result.add \"\u2514\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2518\"\n\nfunc shift(b: var Board; o: Operation; merge = true): bool =\n  const BoardRange = 0..<BoardLength\n  var\n    x = 0\n    y = 0\n    vecX: range[-1..1] = 0\n    vecY: range[-1..1] = 0\n  case o\n  of opUp:\n    vecY = 1\n  of opDown:\n    vecY = -1\n    y = BoardLength - 1\n  of opLeft: vecX = 1\n  of opRight:\n    vecX = -1\n    x = BoardLength - 1\n  else: return\n\n  let\n    startX = x\n    startY = y\n  while x in BoardRange and y in BoardRange:\n    while b.len < BoardSize and x in BoardRange and y in BoardRange:\n      let\n        nextX = x + vecX\n        nextY = y + vecY\n        prevX = x - vecX\n        prevY = y - vecY\n      if b.rows[y][x] == 0:\n        if nextX in BoardRange and nextY in BoardRange and\n           b.rows[nextY][nextX] != 0:\n          result = true\n          swap b.rows[y][x], b.rows[nextY][nextX]\n          if prevX in BoardRange and prevY in BoardRange:\n            x = prevX\n            y = prevY\n            continue\n      x = nextX\n      y = nextY\n\n    if merge:\n      x = if vecX != 0: startX else: x\n      y = if vecY != 0: startY else: y\n      while x in BoardRange and y in BoardRange:\n        let\n          nextX = x + vecX\n          nextY = y + vecY\n        if b.rows[y][x] != 0:\n          if nextX in BoardRange and nextY in BoardRange and\n             b.rows[nextY][nextX] == b.rows[y][x]:\n            result = true\n            b.rows[y][x] *= 2\n            b.largestNumber = max(b.rows[y][x], b.largestNumber)\n            b.score += b.rows[y][x]\n            b.rows[nextY][nextX] = 0\n            dec b.len\n        x = nextX\n        y = nextY\n\n    if vecX == 0:\n      inc x\n      y = startY\n    elif vecY == 0:\n      inc y\n      x = startX\n  if merge and result: discard b.shift(o, false)\n\nfunc shiftable(b: Board): bool =\n  for row in 0..<BoardLength:\n    for col in 0..<BoardLength:\n      result = result or b.rows[row][col] == 0\n      if result: break\n      if row < BoardLength - 1:\n        result = result or b.rows[row][col] == b.rows[row + 1][col]\n      if col < BoardLength - 1:\n        result = result or b.rows[row][col] == b.rows[row][col + 1]\n\nwhen isMainModule:\n  randomize()\n  var\n    board = initBoard()\n    highscore = 0\n  block gameLoop:\n    while true:\n      let gameover = not board.shiftable or board.largestNumber >= Target\n      echo board\n      highscore = max(highscore, board.score)\n      echo \"Score = \", board.score, \"  Highscore = \", highscore\n      if not gameover:\n        echo \"Press arrow keys or WASD to move, R to Restart, Q to Quit\"\n      elif board.largestNumber >= Target:\n        echo \"You win! Press R to Restart, Q to Quit\"\n      else:\n        echo \"Game over! Press R to Restart, Q to Quit\"\n      while true:\n        let op = getKey()\n        case op\n        of opRestart:\n          board = initBoard()\n          break\n        of opQuit: break gameLoop\n        of opInvalid: continue\n        elif gameover: continue\n        else:\n          if board.shift op:\n            board.spawnRandom\n            break\n      for i in 1..BoardLength + 7:\n        eraseLine()\n        cursorUp()\n",
        "safe": true
    },
    {
        "filename": "2048_8.txt",
        "content": "with Ada.Text_IO; use Ada.Text_IO;\nwith System.Random_Numbers;\nprocedure Play_2048 is\n   -- ----- Keyboard management\n   type t_Keystroke is (Up, Down, Right, Left, Quit, Restart, Invalid);\n   -- Redefining this standard procedure as function to allow Get_Keystroke as an expression function\n   function Get_Immediate return Character is\n   begin\n      return Answer : Character do Ada.Text_IO.Get_Immediate(Answer);\n      end return;\n   end Get_Immediate;\n   Arrow_Prefix : constant Character := Character'Val(224); -- works for windows\n   function Get_Keystroke return t_Keystroke is\n     (case Get_Immediate is\n         when 'Q' | 'q' => Quit,\n         when 'R' | 'r' => Restart,\n         when 'W' | 'w' => Left,\n         when 'A' | 'a' => Up,\n         when 'S' | 's' => Down,\n         when 'D' | 'd' => Right,\n         -- Windows terminal\n         when Arrow_Prefix => (case Character'Pos(Get_Immediate) is\n                                  when 72 => Up,\n                                  when 75 => Left,\n                                  when 77 => Right,\n                                  when 80 => Down,\n                                  when others => Invalid),\n         -- Unix escape sequences\n         when ASCII.ESC => (case Get_Immediate is\n                               when '[' => (case Get_Immediate is\n                                               when 'A' => Up,\n                                               when 'B' => Down,\n                                               when 'C' => Right,\n                                               when 'D' => Left,\n                                               when others => Invalid),\n                               when others => Invalid),\n         when others => Invalid);\n \n   -- ----- Game data\n   function Random_Int is new System.Random_Numbers.Random_Discrete(Integer);\n   type    t_List  is array (Positive range <>) of Natural;\n   subtype t_Row   is t_List (1..4);\n   type    t_Board is array  (1..4) of t_Row;\n   Board     : t_Board;\n   New_Board : t_Board;\n   Blanks    : Natural;\n   Score     : Natural;\n   Generator : System.Random_Numbers.Generator;\n \n   -- ----- Displaying the board\n   procedure Display_Board is\n      Horizontal_Rule : constant String := \"+----+----+----+----+\";\n      function Center (Value : in String) return String is\n        ((1..(2-(Value'Length-1)/2) => ' ') & -- Add leading spaces\n         Value(Value'First+1..Value'Last)   & -- Trim the leading space of the raw number image\n         (1..(2-Value'Length/2) => ' '));     -- Add trailing spaces\n   begin\n      Put_Line (Horizontal_Rule);\n      for Row of Board loop\n         for Cell of Row loop\n            Put('|' & (if Cell = 0 then \"    \" else Center(Cell'Img)));\n         end loop;\n         Put_Line(\"|\");\n         Put_Line (Horizontal_Rule);\n      end loop;\n      Put_Line(\"Score =\" & Score'Img);\n   end Display_Board;\n \n   -- ----- Game mechanics\n   procedure Add_Block is\n      Block_Offset : Positive := Random_Int(Generator, 1, Blanks);\n   begin\n      Blanks := Blanks-1;\n      for Row of Board loop\n         for Cell of Row loop\n            if Cell = 0 then\n               if Block_Offset = 1 then\n                  Cell := (if Random_Int(Generator,1,10) = 1 then 4 else 2);\n                  return;\n               else\n                  Block_Offset := Block_Offset-1;\n               end if;\n            end if;\n         end loop;\n      end loop;\n   end Add_Block;\n \n   procedure Reset_Game is\n   begin\n      Board  := (others => (others => 0));\n      Blanks := 16;\n      Score  := 0;\n      Add_Block;\n      Add_Block;\n   end Reset_Game;\n \n   -- Moving and merging will always be performed leftward, hence the following transforms\n   function HFlip (What : in t_Row) return t_Row is\n     (What(4),What(3),What(2),What(1));\n   function VFlip (What : in t_Board) return t_Board is\n     (HFlip(What(1)),HFlip(What(2)),HFlip(What(3)),HFlip(What(4)));\n   function Transpose (What : in t_Board) return t_Board is\n   begin\n      return Answer : t_Board do\n         for Row in t_Board'Range loop\n            for Column in t_Row'Range loop\n               Answer(Column)(Row) := What(Row)(Column);\n            end loop;\n         end loop;\n      end return;\n   end Transpose;\n \n   -- For moving/merging, recursive expression functions will be used, but they\n   -- can't contain statements, hence the following sub-function used by Merge\n   function Add_Blank (Delta_Score : in Natural) return t_List is\n   begin\n      Blanks := Blanks+1;\n      Score  := Score+Delta_Score;\n      return (1 => 0);\n   end Add_Blank;\n \n   function Move_Row (What : in t_List) return t_List is\n     (if What'Length = 1 then What\n      elsif What(What'First) = 0\n      then Move_Row(What(What'First+1..What'Last)) & (1 => 0)\n      else (1 => What(What'First)) & Move_Row(What(What'First+1..What'Last)));\n \n   function Merge (What : in t_List) return t_List is\n     (if What'Length <= 1 or else What(What'First) = 0 then What\n      elsif What(What'First) = What(What'First+1)\n      then (1 => 2*What(What'First)) & Merge(What(What'First+2..What'Last)) & Add_Blank(What(What'First))\n      else (1 => What(What'First)) & Merge(What(What'First+1..What'Last)));\n \n   function Move (What : in t_Board) return t_Board is\n     (Merge(Move_Row(What(1))),Merge(Move_Row(What(2))),Merge(Move_Row(What(3))),Merge(Move_Row(What(4))));\n \nbegin\n   System.Random_Numbers.Reset(Generator);\n   \n   Main_Loop: loop\n      Reset_Game;\n      Game_Loop: loop    \n         Display_Board;\n         case Get_Keystroke is\n            when Restart => exit Game_Loop;\n            when Quit    => exit Main_Loop;\n            when Left    => New_Board := Move(Board);\n            when Right   => New_Board := VFlip(Move(VFlip(Board)));\n            when Up      => New_Board := Transpose(Move(Transpose(Board)));\n            when Down    => New_Board := Transpose(VFlip(Move(VFlip(Transpose(Board)))));\n            when others  => null;\n         end case;\n         \n         if New_Board = Board then\n            Put_Line (\"Invalid move...\");\n         elsif (for some Row of New_Board => (for some Cell of Row => Cell = 2048)) then\n            Display_Board;\n            Put_Line (\"Win\u00a0!\");\n            exit Main_Loop;\n         else\n            Board := New_Board;\n            Add_Block; -- OK since the board has changed\n            if Blanks = 0\n               and then (for all Row in 1..4 =>\n                           (for all Column in 1..3 =>\n                                (Board(Row)(Column) /= Board(Row)(Column+1))))\n               and then (for all Row in 1..3 =>\n                           (for all Column in 1..4 =>\n                                (Board(Row)(Column) /= Board(Row+1)(Column)))) then\n               Display_Board;\n               Put_Line (\"Lost\u00a0!\");\n               exit Main_Loop;\n            end if;\n         end if;\n      end loop Game_Loop;\n   end loop Main_Loop;\nend Play_2048;\n",
        "safe": true
    },
    {
        "filename": "2048_80.txt",
        "content": "let list_make x v =\n  let rec aux acc i =\n    if i <= 0 then acc else aux (v::acc) (i-1)\n  in\n  aux [] x\n\n\nlet pad_right n line =\n  let len = List.length line in\n  let x = n - len in\n  line @ (list_make x 0)\n\n\nlet _move_left line =\n  let n = List.length line in\n  let line = List.filter ((<>) 0) line in\n  let rec aux acc = function\n  | x::y::tl ->\n      if x = y\n      then aux (x+y::acc) tl\n      else aux (x::acc) (y::tl)\n  | x::[] ->\n      aux (x::acc) []\n  | [] ->\n      List.rev acc\n  in\n  pad_right n (aux [] line)\n\n\nlet move_left grid =\n  List.map _move_left grid\n\n\nlet move_right grid =\n  grid\n    |> List.map List.rev\n    |> List.map _move_left\n    |> List.map List.rev\n\n\nlet rec replace g n v =\n  match g with\n  | x::xs -> if n = 0 then v::xs else x::(replace xs (n-1) v)\n  | [] -> raise (Invalid_argument \"replace\")\n\n\n(* add a new value in a random cell containing zero *)\nlet rec new_value grid =\n  let zeros = ref [] in\n  List.iteri (fun y line ->\n    List.iteri (fun x v ->\n      if v = 0 then zeros := (x, y) :: !zeros\n    ) line;\n  ) grid;\n  let n = List.length !zeros in\n  if n = 0 then raise Exit;\n  let x, y = List.nth !zeros (Random.int n) in\n  let v = if Random.int 10 = 0 then 4 else 2 in\n  let line = List.nth grid y in\n  let new_line = replace line x v in\n  replace grid y new_line\n\n\n(* turn counterclockwise *)\nlet turn_ccw grid =\n  let y = List.length grid in\n  let x = List.length (List.nth grid 0) in\n  List.init x (fun i ->\n    List.init y (fun j ->\n      List.nth (List.nth grid j) (x-i-1)\n    )\n  )\n\n\n(* turn clockwise *)\nlet turn_cw grid =\n  let y = List.length grid in\n  let x = List.length (List.nth grid 0) in\n  List.init x (fun i ->\n    List.init y (fun j ->\n      List.nth (List.nth grid (y-j-1)) (i)\n    )\n  )\n\n\nlet move_up grid =\n  grid\n    |> turn_ccw\n    |> move_left\n    |> turn_cw\n\n\nlet move_down grid =\n  grid\n    |> turn_cw\n    |> move_left\n    |> turn_ccw\n\n\nlet display grid =\n  List.iter (fun line ->\n    print_string \" [\";\n    line\n      |> List.map (Printf.sprintf \"%4d\")\n      |> String.concat \"; \"\n      |> print_string;\n    print_endline \"]\"\n  ) grid\n\n\nlet () =\n  Random.self_init ();\n  let width =\n    try int_of_string Sys.argv.(1)\n    with _ -> 4\n  in\n  let line = list_make width 0 in\n  let grid = list_make width line in\n\n  let grid = new_value grid in\n  let grid = new_value grid in\n\n  print_endline {|\n    s -> left\n    f -> right\n    e -> up\n    d -> down\n    q -> quit\n  |};\n  let rec loop grid =\n    display grid;\n    let grid =\n      match read_line () with\n      | \"s\" -> move_left grid\n      | \"f\" -> move_right grid\n      | \"e\" -> move_up grid\n      | \"d\" -> move_down grid\n      | \"q\" -> exit 0\n      | _ -> grid\n    in\n    let grid =\n      try new_value grid\n      with Exit ->\n        print_endline \"Game Over\";\n        exit 0\n    in\n    loop grid\n  in\n  loop grid\n",
        "safe": true
    },
    {
        "filename": "2048_81.txt",
        "content": "$ ocaml game2048.ml 4\n\n    s -> left\n    f -> right\n    e -> up\n    d -> down\n    q -> quit\n  \n [   0;    0;    0;    4]\n [   0;    0;    0;    0]\n [   0;    0;    0;    0]\n [   0;    2;    0;    0]\nd\n [   0;    0;    0;    0]\n [   2;    0;    0;    0]\n [   0;    0;    0;    0]\n [   0;    2;    0;    4]\nd\n [   0;    0;    0;    0]\n [   4;    0;    0;    0]\n [   0;    0;    0;    0]\n [   2;    2;    0;    4]\nf\n [   0;    2;    0;    0]\n [   0;    0;    0;    4]\n [   0;    0;    0;    0]\n [   0;    0;    4;    4]\nf\n [   0;    0;    0;    2]\n [   0;    2;    0;    4]\n [   0;    0;    0;    0]\n [   0;    0;    0;    8]\n",
        "safe": true
    },
    {
        "filename": "2048_82.txt",
        "content": "program game2048;\nuses Crt;\nconst\n    SIZE_MAP = 4;\n    SIZETOPBOT = SIZE_MAP*6+6; (* Calculate the length of the top and bottom to create a box around the game  *)\n    NOTHING = 0;\n    UP = 93;\n    RIGHT = 92;\n    LEFT = 91;\n    DOWN = 90;\ntype \n    type_vector = array [1..SIZE_MAP] of integer;\n    type_game = record \n\tlin,col:integer;\n\tmap: array [1..SIZE_MAP,1..SIZE_MAP] of integer;\n\tscore:integer;\n    end;\n    type_coord = record\n\tlin,col:integer;\n    end;\n\nvar \n    game:type_game;\n    end_game,movement:boolean;\n\nprocedure Create_Number(var game:type_game);\n(* Create the number(2 or 4) in a random position on the map *)\n(* The number 4 had a 10% of chance to be created *)\nvar \n    number:integer;\n    RanP:type_coord;\nbegin\n    randomize;\n    if random(9) = 1 then\n\tnumber:=4\n    else\n\tnumber:=2;\n    RanP.lin:=random(game.lin)+1;\n    RanP.col:=random(game.col)+1;\n    while game.map[RanP.lin,RanP.col] <> NOTHING do \n\tbegin\n\t    RanP.lin:=random(game.lin)+1;\n\t    RanP.col:=random(game.col)+1;\n\tend;\n    game.map[RanP.lin,Ranp.Col]:=number;\nend;\n\nprocedure initializing_game(var game:type_game);\nvar i,j:integer;\nbegin\n    game.lin:=SIZE_MAP;\n    game.col:=SIZE_MAP;\n    game.score:=0;\n    for i:=1 to game.lin do\n\tfor j:=1 to game.col do\n\t    game.map[i,j]:=NOTHING;\n\n    Create_Number(game);\n    Create_Number(game);\nend;\n\nfunction CountDigit(number:integer):integer;\nbegin\n    if number <> 0 then\n\tbegin\n\t    CountDigit:=0;\n\t    while number <> 0 do\n\t\tbegin\n\t\t    CountDigit:=CountDigit+1;\n\t\t    number:=number div 10;\n\t\tend;\n\tend\n    else\n\tCountDigit:=1;\nend;\n\nprocedure print_number(number:integer);\n(* Print the number aligned with other numbers in the matrix  *)\nvar k,hwdigit:integer;\nbegin\n    hwdigit:=CountDigit(number);\n    write(' ');\n    write(number);\n    (* The 4 is used to aling the numbers because the greatest number *)\n    (* possible is 2048, which have 4 digits *)\n    for k:=1 to 4-hwdigit do\n\twrite(' ');\n    write(' ');\nend;\n\nprocedure print_line(lengthL:integer; ch:string);\nvar i:integer;\nbegin\n    write('+');\n    for i:=1 to (lengthL-2) do\n\tbegin\n\t    if i mod 7 = 0 then\n\t\twrite('+')\n\t    else\n\t\twrite(ch);\n    end;\n    writeln;\nend;\n\nprocedure print_map(var game:type_game);\nvar i,j:integer;\nbegin\n    print_line(SIZETOPBOT,'-');\n    for i:=1 to game.lin do\n\tbegin\n\t    write('|');\n\t    for j:=1 to game.col do\n\t\tif game.map[i,j] >= 0 then\n\t\t    begin\n\t\t\tprint_number(game.map[i,j]);\n\t\t\twrite('|');\n\t\t    end;\n\t    writeln;\n\t    print_line(SIZETOPBOT,'-');\n\tend;\nend;\n\nfunction CanMove(var v_lin:type_vector; i:integer):integer;\n(* Returns 1 if the next position is free *)\n(* Returns 2 if the next position has an equal number *)\n(* Returns 0 if the next position is not free *)\nbegin\n    if v_lin[i-1] = NOTHING then\n        CanMove:=1\n    else if v_lin[i] = v_lin[i-1] then\n        CanMove:=2\n    else\n        CanMove:=0;\nend;\n\nfunction MoveAndSum(var game:type_game; var v_lin:type_vector; size:integer):boolean;\n(* Move and Sum the elements of the vector *)\n(* The direction of the move is to the left *) \n(* Returns TRUE if a number was moved *)\n(* Returns FALSE if a number was not moved *)\nvar\n    i,e,ResultM:integer;\n    v:type_vector;\nbegin\n    MoveAndSum:=FALSE;\n    (* Initializing the vector *)\n    (* This Vector is to know what number sum and what not sum *)\n    for i:=1 to size do\n        v[i]:=0;\n\n    for i:=2 to size do\n        begin\n\t    if v_lin[i] <> 0 then\n\t\tbegin\n\t\t    (* Move the number in v_lin[i] to the left as much as possible *)\n\t\t    e:=i;\n\t\t    ResultM:=CanMove(v_lin,e);\n\t\t    while (ResultM <> 0)and(e>1) do\n\t\t\tbegin\n\t\t\t    case ResultM of\n\t\t\t\t1:begin\n\t\t\t\t    v_lin[e-1]:=v_lin[e];\n\t\t\t\t    v_lin[e]:=NOTHING;\n\t\t\t\tend;\n\t\t\t\t2:begin\n\t\t\t\t    if v[e] = 0 then \n\t\t\t\t\tbegin\n\t\t\t\t\t    v_lin[e-1]:=v_lin[e-1]*2;\n\t\t\t\t\t    game.score:=game.score+v_lin[e-1];\n\t\t\t\t\t    v_lin[e]:=NOTHING;\n\t\t\t\t\t    (* This number will not be sum again *)\n\t\t\t\t\t    v[e-1]:=1;\n\t\t\t\t\tend;\n\t\t\t\tend;\n\t\t\t    end;\n\t\t\t    e:=e-1;\n\t\t\t    ResultM:=CanMove(v_lin,e);\n\t\t\tend;\n\t\t    if e <> i then\n\t\t\tMoveAndSum:=TRUE;\n\t\t    v[e-1]:=1;\n\t\tend;\n        end;\nend;\n\n\nfunction move_left(var game:type_game):boolean;\nvar \n    i,j:integer;\n    v:type_vector;\nbegin\n    move_left:=FALSE;\n    for i:=1 to game.lin do\n\tbegin\n\t    for j:=1 to game.col do\n\t\tv[j]:=game.map[i,j];\n\n\t    if MoveAndSum(game,v,game.lin) then\n\t\tmove_left:=TRUE;\n\n\t    for j:=1 to game.col do\n\t\tgame.map[i,j]:=v[j];\n\tend;\nend;\n\n\nfunction move_right(var game:type_game):boolean;\nvar \n    i,j,k:integer;\n    v:type_vector;\nbegin\n    move_right:=FALSE;\n    for i:=1 to game.lin do\n\tbegin\n\t    (* The side which will be move had to be at the beginning of the vector *)\n\t    (* For example, I want to move this line to the right: 0 2 0 3 6 *)\n\t    (* The procedure \"MoveAndSum\" has to receive this vector: 6 3 0 2 0 *)\n\t    k:=1;\n\t    for j:=game.col downto 1 do\n\t\tbegin\n\t\t    v[k]:=game.map[i,j];\n\t\t    k:=k+1;\n\t\tend;\n\t    if MoveAndSum(game,v,game.lin) then\n\t\tmove_right:=TRUE;\n\t    (* Copy to the right place in the matrix *)\n\t    k:=1;\n\t    for j:=game.col downto 1 do\n\t\tbegin\n\t\t    game.map[i,k]:=v[j];\n\t\t    k:=k+1;\n\t\tend;\n\tend;\nend;\n\n\nfunction move_down(var game:type_game):boolean;\nvar \n    i,j,k:integer;\n    v:type_vector;\nbegin\n    move_down:=FALSE;\n    for j:=1 to game.col do\n\tbegin\n\t    k:=1;\n\t    for i:=game.lin downto 1 do\n\t\tbegin\n\t\t    v[k]:=game.map[i,j];\n\t\t    k:=k+1;\n\t\tend;\n\t    if MoveAndSum(game,v,game.lin) then\n\t\tmove_down:=TRUE;\n\t    k:=1;\n\t    for i:=game.lin downto 1 do\n\t\tbegin\n\t\t    game.map[k,j]:=v[i];\n\t\t    k:=k+1;\n\t\tend;\n\tend;\nend;\n\nfunction move_up(var game:type_game):boolean;\nvar \n    i,j:integer;\n    v:type_vector;\nbegin\n    move_up:=FALSE;\n    for j:=1 to game.col do\n\tbegin\n\t    for i:=1 to game.lin do\n\t\tv[i]:=game.map[i,j];\n\t    if MoveAndSum(game,v,game.lin) then\n\t\tmove_up:=TRUE;\n\t    for i:=1 to game.lin do\n\t\tgame.map[i,j]:=v[i];\n\tend;\nend;\n\nfunction CheckWinLose(var game:type_game):integer;\n(* Returns 2 if the player win the game *)\n(* Returns 1 if the player lose the game *)\n(* Returns 0 if has a valid move*)\nvar i,j:integer; \nbegin\n    with game do\n\tbegin\n\t    CheckWinLose:=1;\n\t    i:=1;\n\t    while (i<=game.lin)and(CheckWinLose<>2) do\n\t\tbegin\n\t\t    j:=1;\n\t\t    while (j<=game.col)and(CheckWinLose<>2) do\n\t\t\tbegin\n\t\t\t    if map[i,j] = 2048 then\n\t\t\t\tCheckWinLose:=2\n\t\t\t    else\n\t\t\t       if map[i,j] = NOTHING then\n\t\t\t\tCheckWinLose:=0\n\t\t\t    else\n\t\t\t\tif (map[i,j] = map[i,j+1])and(j<>col) then\n\t\t\t\t    CheckWinLose:=0\n\t\t\t    else\n\t\t\t\tif (map[i,j] = map[i,j-1])and(j<>1) then\n\t\t\t\t    CheckWinLose:=0\n\t\t\t    else\n\t\t\t\tif (map[i,j] = map[i+1,j])and(i<>lin) then\n\t\t\t\t    CheckWinLose:=0\n\t\t\t    else\n\t\t\t\tif (map[i,j] = map[i-1,j])and(i<>1) then\n\t\t\t\t    CheckWinLose:=0;\n\t\t\t    j:=j+1;\n\t\t\tend;\n\t\t    i:=i+1;\n\t\tend;\n    end;\nend;\n\nbegin\n    movement:=false;\n    end_game:=false;\n    initializing_game(game);\n    repeat \n\tClrScr;\n\tif movement then\n\t    Create_Number(game);\n\tmovement:=false;\n\n\twriteln('SCORE: ',game.score);\n\tprint_map(game);\n\twriteln(' Use the arrow keys to move ');\n\twriteln(' Press ESC to quit the game ');\n\n\tcase CheckWinLose(game) of\n\t    1:begin\n\t\tprint_line(SIZETOPBOT,'-');\n\t\twriteln('|         Game Over!        |');\n\t\tprint_line(SIZETOPBOT,'-');\n\t\tend_game:=TRUE;\n\t    end;\n\t    2:begin\n\t\tprint_line(SIZETOPBOT,'-');\n\t\twriteln('|          You Win!         |');\n\t\tprint_line(SIZETOPBOT,'-');\n\t\tend_game:=TRUE;\n\t    end;\n\tend;\n\n\trepeat \n\tuntil KeyPressed;\n\tcase ReadKey of\n\t     #0:begin\n\t\tcase ReadKey of\n\t\t    #72:movement:=move_up(game);\n\t\t    #77:movement:=move_right(game); \n\t\t    #75:movement:=move_left(game);\n\t\t    #80:movement:=move_down(game);\n\t\tend;\n\t    end;\n\t    #27:end_game:=true;\n\tend;\n    until end_game;\nend.\n",
        "safe": true
    },
    {
        "filename": "2048_83.txt",
        "content": "#!/usr/bin/perl\n\nuse strict; # https://rosettacode.org/wiki/2048\nuse warnings;\nuse Tk;\n\nmy $N = shift // 4;\n$N < 2 and $N = 2;\nmy @squares = 1 .. $N*$N;\nmy %n2ch = (' ' => ' ');\n@n2ch{ map 2**$_, 1..26} = 'a'..'z';\nmy %ch2n = reverse %n2ch;\nmy $winner = '';\nmy @arow = 0 .. $N - 1;\nmy @acol = map $_ * $N, @arow;\n\nmy $mw = MainWindow->new;\n$mw->geometry( '+300+0' );\n$mw->title( 2048 );\n$mw->focus;\n$mw->bind('<KeyPress-Left>' => sub { arrow($N, @arow) } );\n$mw->bind('<KeyPress-Right>' => sub { arrow($N, reverse @arow) } );\n$mw->bind('<KeyPress-Up>' => sub { arrow(1, @acol) } );\n$mw->bind('<KeyPress-Down>' => sub { arrow(1, reverse @acol) } );\nmy $grid = $mw->Frame()->pack;\nfor my $i ( 0 .. $#squares )\n  {\n  $grid->Label(-textvariable => \\$squares[$i],\n    -width => 5, -height => 2, -font => 'courierbold 30',\n    -relief => 'ridge', -borderwidth => 5,\n    )->grid(-row => int $i / $N, -column => $i % $N );\n  }\nmy $buttons = $mw->Frame()->pack(-fill => 'x', -expand => 1);\n$buttons->Button(-text => 'Exit', -command => sub {$mw->destroy},\n  -font => 'courierbold 14',\n  )->pack(-side => 'right');\n$buttons->Button(-text => 'New Game', -command => \\&newgame,\n  -font => 'courierbold 14',\n  )->pack(-side => 'left');\n$buttons->Label(-textvariable => \\$winner,\n  -font => 'courierbold 18', -fg => 'red2',\n  )->pack;\n\nnewgame();\nMainLoop;\n-M $0 < 0 and exec $0;\n\nsub losecheck\n  {\n  local $_ = join '', @n2ch{ @squares };\n  / / || ($_ ^ substr $_, $N) =~ tr/\\0// and return;\n  /(.)\\1/ and return for /.{$N}/g;\n  $winner = 'You Lost';\n  }\n\nsub arrow\n  {\n  $winner and return;                                   # you won, no more play\n  my ($inc, @ix) = @_;\n  my $oldboard = \"@squares\";\n  for ( 1 .. $N )\n    {\n    local $_ = join '', @n2ch{ @squares[@ix] };         # extract 4 squares\n    tr/ //d;                                            # force left\n    s/(\\w)\\1/ chr 1 + ord $1 /ge;                       # group by twos\n    @squares[@ix] = @ch2n{ split //, $_ . ' ' x $N };   # replace\n    $_ += $inc for @ix;                                 # next row or col\n    }\n  $oldboard eq \"@squares\" and return;\n  add2();\n  losecheck();\n  grep $_ eq 2048, @squares and $winner = 'WINNER\u00a0!!';\n  }\n\nsub add2\n  {\n  my @blanks = grep $squares[$_] eq ' ', 0 .. $#squares;\n  @blanks and $squares[ $blanks[rand @blanks] ] =\n    $_[0] // (rand() < 0.1 ? 4 : 2);\n  }\n\nsub newgame\n  {\n  $_ = ' ' for @squares;\n  add2(2) for 1, 2;\n  $winner = '';\n  }\n",
        "safe": true
    },
    {
        "filename": "2048_84.txt",
        "content": "-- demo\\rosetta\\2048.exw\nwith javascript_semantics\ninclude pGUI.e\n\nIhandle canvas, dialog\ncdCanvas cddbuffer, cdcanvas\n\nconstant tile_colours = {#CCC0B4,   -- blank\n                         #EEE4DA,   -- 2\n                         #EDE0C8,   -- 4\n                         #F2B179,   -- 8\n                         #F59563,   -- 16\n                         #F67C5F,   -- 32\n                         #F65E3B,   -- 64\n                         #EDCF72,   -- 128\n                         #EDCC61,   -- 256\n                         #EDC850,   -- 512\n                         #EDC53F,   -- 1024\n                         #EDC22E}   -- 2048\n\n-- the 4x4 board.\n--  note that values are [1..12] for [blank,2,4,8,..2048].\n--  (merging two eights is not 8+8->16 but 4+1->5, internally)\nsequence board\n\ninteger newgame = 1,\n        valid = 0, \n        prev, nxt\n\nprocedure add_rand(integer count)\n-- (nb infinite loop if board is full)\n    while count do\n        integer x = rand(4),\n                y = rand(4)\n        if board[y][x]=1 then   -- blank\n            board[y][x] = 2+(rand(10)=10)\n            count -= 1\n        end if\n    end while   \nend procedure\n\nprocedure move_x(integer x, y, d)\n    integer bxy = board[x][y]\n    if bxy!=1 then -- (not blank)\n        if bxy=prev then\n            board[x][y] = 1\n            bxy += 1\n            board[x][nxt] = bxy\n            nxt += d\n            prev = 13\n            valid = 1 \n        else\n            if prev=1 -- (blank)\n            or y!=nxt then\n                if prev!=1\n                and prev!=13 then\n                    nxt += d\n                end if\n                if y!=nxt then\n                    board[x][y] = 1\n                    board[x][nxt] = bxy\n                    valid = 1\n                end if\n            end if\n            prev = bxy\n        end if\n    end if\nend procedure\n\nprocedure move_y(integer x, y, d)\n    integer bxy = board[x][y]\n    if bxy!=1 then -- (not blank)\n        if bxy=prev then\n            board[x][y] = 1\n            bxy += 1\n            board[nxt][y] = bxy\n            nxt += d\n            prev = 13\n            valid = 1 \n        else\n            if prev=1 -- (blank)\n            or x!=nxt then\n                if prev!=1\n                and prev!=13 then\n                    nxt += d\n                end if\n                if x!=nxt then\n                    board[x][y] = 1\n                    board[nxt][y] = bxy\n                    valid = 1\n                end if\n            end if\n            prev = bxy\n        end if\n    end if\nend procedure\n\nfunction move(integer key)\n-- a non-zero result means it changed something.\n    valid = 0\n    if key=K_LEFT then\n        for x=1 to 4 do\n            prev = 13\n            nxt = 1\n            for y=1 to 4 do\n                move_x(x,y,+1)\n            end for\n        end for\n    elsif key=K_UP then\n        for y=1 to 4 do\n            prev = 13\n            nxt = 4\n            for x=4 to 1 by -1 do\n                move_y(x,y,-1)\n            end for\n        end for\n    elsif key=K_RIGHT then\n        for x=1 to 4 do\n            prev = 13\n            nxt = 4\n            for y=4 to 1 by -1 do\n                move_x(x,y,-1)\n            end for\n        end for\n    elsif key=K_DOWN then\n        for y=1 to 4 do\n            prev = 13\n            nxt = 1\n            for x=1 to 4 do\n                move_y(x,y,+1)\n            end for\n        end for\n    end if\n    return valid\nend function\n\nfunction game_won()\n    for i=1 to length(board) do\n        if find(12,board[i]) then return 1 end if\n    end for\n    return 0\nend function\n\nconstant valid_keys = {K_LEFT,K_DOWN,K_RIGHT,K_UP}\n\nfunction no_valid_moves()\n    sequence saved_board = deep_copy(board)\n    for i=1 to length(valid_keys) do\n        if move(valid_keys[i]) then\n            board = saved_board\n            return 0    -- OK\n        end if\n    end for\n    return 1 -- game over...\nend function\n\nfunction redraw_cb(Ihandle /*ih*/)\n    integer ox,oy,              -- top right coords\n            os,ts,              -- overall and tile size\n            ts2,                -- half tile, for number positioning\n            {dw,dh} = IupGetIntInt(canvas, \"DRAWSIZE\")\n    if dw>=dh then\n        ox = floor((dw-dh)/2)\n        oy = 0\n        os = dh\n    else\n        ox = 0\n        oy = floor((dh-dw)/2)\n        os = dw\n    end if\n    ts = floor((os-10)/4-7)\n    ts2 = floor(ts/2+5)-10\n\n    if newgame then\n        board = repeat(repeat(1,4),4)\n        add_rand(2)\n        newgame = 0\n    end if\n\n    cdCanvasActivate(cddbuffer)\n    cdCanvasSetBackground(cddbuffer, #FAF8EF)\n    cdCanvasClear(cddbuffer)\n    cdCanvasSetForeground(cddbuffer, #BBADA0)\n    cdCanvasRoundedBox(cddbuffer, ox+5, ox+os-5, oy+5, oy+os-5, 10, 10)\n\n    integer tx = ox+15\n    for y=1 to 4 do\n        integer ty = oy+15\n        for x=1 to 4 do\n            integer bxy = board[x][y]\n            cdCanvasSetForeground(cddbuffer, tile_colours[bxy])\n            cdCanvasRoundedBox(cddbuffer, tx, tx+ts-10, ty, ty+ts-10, 5, 5)\n            if bxy>1 then\n                cdCanvasSetForeground(cddbuffer, iff(bxy<=3?#776E65:#F9F6F2))\n                cdCanvasFont(cddbuffer, \"Calibri\", CD_BOLD, iff(bxy>10?32:40))\n                cdCanvasText(cddbuffer, tx+ts2, ty+ts2-25-iff(bxy<11?7:0), sprint(power(2,bxy-1))) \n            end if\n            ty += ts+5\n        end for\n        tx += ts+5\n    end for\n    cdCanvasFlush(cddbuffer)\n    return IUP_DEFAULT\nend function\n\nfunction map_cb(Ihandle ih)\n    cdcanvas = cdCreateCanvas(CD_IUP, ih)\n    cddbuffer = cdCreateCanvas(CD_DBUFFER, cdcanvas)\n    cdCanvasSetTextAlignment(cddbuffer, CD_SOUTH) \n    return IUP_DEFAULT\nend function\n\nfunction key_cb(Ihandle /*ih*/, atom c)\n    if c=K_ESC then return IUP_CLOSE end if\n    if find(c,valid_keys) then\n        if move(c) then\n            IupUpdate(canvas)\n            string mbmsg = \"\"\n            if game_won() then\n                mbmsg = \"!!!YOU WON!!!\\n\\nAnother Go?\"\n            else\n                add_rand(1)\n                IupUpdate(canvas)\n                if no_valid_moves() then\n                    mbmsg = \"You Lost.\\n\\nAnother Go?\"\n                end if\n            end if\n            if length(mbmsg) then\n                if platform()=JS then\n                    IupMessage(\"Game Over\",mbmsg);\n                    newgame=1\n                else\n                    if IupAlarm(\"Game Over\",mbmsg,\"Yes\",\"No\")=1 then\n                        newgame=1\n                    else\n                        return IUP_CLOSE\n                    end if\n                end if\n            end if\n        end if\n        IupUpdate(canvas)\n    end if\n    return IUP_CONTINUE\nend function\n\nprocedure main()\n\n    IupOpen()\n\n    canvas = IupCanvas(\"RASTERSIZE=520x540\")\n    IupSetCallback(canvas, \"MAP_CB\", Icallback(\"map_cb\"))\n    IupSetCallback(canvas, \"ACTION\", Icallback(\"redraw_cb\"))\n\n    dialog = IupDialog(canvas,\"MINSIZE=440x450\")\n    IupSetAttribute(dialog,\"TITLE\",\"2048\");\n    IupSetCallback(dialog, \"K_ANY\", Icallback(\"key_cb\"));\n\n    IupShow(dialog)\n    IupSetAttribute(canvas, \"RASTERSIZE\", NULL)\n\n    if platform()!=JS then\n        IupMainLoop()\n        IupClose()\n    end if\nend procedure\nmain()\n",
        "safe": true
    },
    {
        "filename": "2048_85.txt",
        "content": "<?php\n\n$game = new Game();\n\nwhile(true) {\n    $game->cycle();\n}\n\nclass Game {\n\tprivate $field;\n\tprivate $fieldSize;\n\tprivate $command;\n\tprivate $error;\n\tprivate $lastIndexX, $lastIndexY;\n\tprivate $score;\n\tprivate $finishScore;\n\n\tfunction __construct() {\n\t\t$this->field = array();\n\t\t$this->fieldSize = 4;\n\t\t$this->finishScore = 2048;\n\t\t$this->score = 0;\n\t\t$this->addNumber();\n\t\t$this->render();\n\t}\n\n\tpublic function cycle() {\n\t\t$this->command = strtolower($this->readchar('Use WASD, q exits'));\n\t\t$this->cls();\n\n\t\tif($this->processCommand()) {\n\t\t\t$this->addNumber();\n\t\t} else {\n\t\t\tif(count($this->getFreeList()) == 0 ) {\n\t\t\t\t$this->error = 'No options left!, You Lose!!';\n\t\t\t} else {\n\t\t\t\t$this->error = 'Invalid move, try again!';\n\t\t\t}\n\t\t}\n\t\t$this->render();\n\t}\n\n\tprivate function readchar($prompt) {\n\t\treadline_callback_handler_install($prompt, function() {});\n\t\t$char = stream_get_contents(STDIN, 1);\n\t\treadline_callback_handler_remove();\n\t\treturn $char;\n\t}\n\n\t/**\n\t * Insert a number in an empty spot on the field\n\t */\n\tprivate function addNumber() {\n\t\t$freeList = $this->getFreeList();\n\t\tif(count($freeList) == 0) {\n\t\t\treturn;\n\t\t}\n\t\t$index = mt_rand(0, count($freeList)-1);\n\t\t$nr = (mt_rand(0,9) == 0)? 4 : 2;\n\t\t$this->field[$freeList[$index]['x']][$freeList[$index]['y']] = $nr;\n\t\treturn;\n\t}\n\n\t/**\n\t * @return array(array('x' => <x>, 'y' => <y>)) with empty positions in the field\n\t */\n\tprivate function getFreeList() {\n\t\t$freeList = array();\n\t\tfor($y =0; $y< $this->fieldSize;$y++) {\n\t\t\tfor($x=0; $x < $this->fieldSize; $x++) {\n\t\t\t\tif(!isset($this->field[$x][$y])) {\n\t\t\t\t\t$freeList[] = array('x' => $x, 'y' => $y);\n\t\t\t\t} elseif($this->field[$x][$y] == $this->finishScore) {\n\t\t\t\t\t$this->error = 'You Win!!';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn $freeList;\n\t}\n\n\t/**\n\t * Process a command:\n\t * @return is the command valid (Did it cause a change in the field)\n\t */\n\tprivate function processCommand() {\n\t\tif(!in_array($this->command, array('w','a','s','d','q'))) {\n\t\t\t$this->error = 'Invalid Command';\n\t\t\treturn false;\n\t\t}\n\t\tif($this->command == 'q') {\n\t\t\techo PHP_EOL. 'Bye!'. PHP_EOL;\n\t\t\texit;\n\t\t}\n\n\t\t// Determine over which axis and in which direction we move:\n\t\t$axis = 'x';\n\t\t$sDir = 1;\n\n\t\tswitch($this->command) {\n\t\t\tcase 'w':\n\t\t\t\t$axis = 'y';\n\t\t\t\t$sDir = -1;\n\t\t\t\tbreak;\n\t\t\tcase 'a':\n\t\t\t\t$sDir = -1;\n\t\t\t\tbreak;\n\t\t\tcase 's':\n\t\t\t\t$axis = 'y';\n\t\t\t\tbreak;\n\t\t\tcase 'd':\n\t\t\tbreak;\n\t\t}\n\n\t\t$done = 0;\n\t\t// shift all numbers in that direction\n\t\t$done += $this->shift($axis, $sDir);\n\t\t// merge equal numbers in opposite direction\n\t\t$done += $this->merge($axis, $sDir * -1);\n\t\t// shift merged numbers in that direction\n\t\t$done += $this->shift($axis, $sDir);\n\t\treturn $done >0;\n\t}\n\n\tprivate function shift($axis, $dir) {\n\t\t$totalDone = 0;\n\t\tfor($i = 0; $i <$this->fieldSize; $i++) {\n\t\t\t$done = 0;\n\t\t\tforeach($this->iterate($axis,$dir) as $xy) {\n\t\t\t\tif($xy['vDest'] === NULL && $xy['vSrc'] !== NULL) {\n\t\t\t\t\t$this->field[$xy['dX']][$xy['dY']] = $xy['vSrc'];\n\t\t\t\t\t$this->field[$xy['sX']][$xy['sY']] = NULL;\n\t\t\t\t\t$done++;\n\t\t\t\t}\n\t\t\t}\n\t\t\t$totalDone += $done;\n\t\t\tif($done == 0) {\n\t\t\t\t// nothing to shift anymore\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\treturn $totalDone;\n\t}\n\n\tprivate function merge($axis, $dir) {\n\t\t$done = 0;\n\t\tforeach($this->iterate($axis,$dir) as $xy) {\n\t\t\tif($xy['vDest'] !== NULL && $xy['vDest'] === $xy['vSrc']) {\n\t\t\t\t$this->field[$xy['sX']][$xy['sY']] += $xy['vDest'];\n\t\t\t\t$this->field[$xy['dX']][$xy['dY']] = NULL;\n\t\t\t\t$this->score += $this->field[$xy['sX']][$xy['sY']];\n\t\t\t\t$done ++;\n\t\t\t}\n\t\t}\n\t\treturn $done;\n\t}\n\n\t/**\n\t * @return array List of src, dest pairs and their values to iterate over.\n\t */\n\tprivate function iterate($axis, $dir) {\n\t\t$res = array();\n\t\tfor($y = 0; $y < $this->fieldSize; $y++) {\n\t\t\tfor($x=0; $x < $this->fieldSize; $x++) {\n\t\t\t\t$item = array('sX'=> $x,'sY' => $y, 'dX' => $x, 'dY' => $y, 'vDest' => NULL,'vSrc' => NULL);\n\t\t\t\t\n\t\t\t\tif($axis == 'x') {\n\t\t\t\t\t$item['dX'] += $dir;\n\t\t\t\t} else {\n\t\t\t\t\t$item['dY'] += $dir;\n\t\t\t\t}\n\n\t\t\t\tif($item['dX'] >= $this->fieldSize || $item['dY'] >=$this->fieldSize || $item['dX'] < 0 || $item['dY'] < 0) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\t$item['vDest'] = (isset($this->field[$item['dX']][$item['dY']]))? $this->field[$item['dX']][$item['dY']] : NULL;\n\t\t\t\t$item['vSrc'] = (isset($this->field[$item['sX']][$item['sY']]))? $this->field[$item['sX']][$item['sY']] : NULL;\n\t\t\t\t$res[] = $item;\n\t\t\t}\n\t\t}\n\t\tif($dir < 0) {\n\t\t\t$res = array_reverse($res);\n\t\t}\n\t\treturn $res;\n\t}\n\n\t/// RENDER ///\n\n\t/**\n\t * Clear terminal screen\n\t */\n\tprivate function cls() {\n\t\techo chr(27).chr(91).'H'.chr(27).chr(91).'J';\n\t}\n\n\tprivate function render() {\n\t\techo $this->finishScore . '! Current score: '. $this->score .PHP_EOL;\n\n\t\tif(!empty($this->error)) {\n\t\t\techo $this->error . PHP_EOL;\n\t\t\t$this->error = NULL;\n\t\t}\n\t\t$this->renderField();\n\t}\n\n\tprivate function renderField() {\n\t\t$width = 5;\n\t\t$this->renderVSeperator($width);\n\t\tfor($y =0; $y < $this->fieldSize; $y ++) {\n\t\t\tfor($x = 0;$x < $this->fieldSize; $x++) {\n\t\t\t\techo '|';\n\t\t\t\tif(!isset($this->field[$x][$y])) {\n\t\t\t\t\techo str_repeat(' ', $width);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tprintf('%'.$width.'s', $this->field[$x][$y]);\n\t\t\t}\n\t\t\techo '|'. PHP_EOL;\n\t\t\t$this->renderVSeperator($width);\n\t\t}\n\t}\n\n\tprivate function renderVSeperator($width) {\n\t\techo str_repeat('+'. str_repeat('-', $width), $this->fieldSize) .'+' .PHP_EOL;\n\t}\n\n}\n",
        "safe": true
    },
    {
        "filename": "2048_86.txt",
        "content": "(load \"@lib/simul.l\")\n\n(symbols 'simul 'pico)\n\n(seed (in \"/dev/urandom\" (rd 8)))\n\n(setq *G (grid 4 4)  *D NIL)\n\n(de cell ()\n   (use This\n      (while\n         (get\n            (setq This\n               (intern\n                  (pack\n                     (char (+ 96 (rand 1 4)))\n                     (rand 1 4) ) ) )\n            'N ) )\n      (=: N (if (> 90 (rand 1 100)) 2 4) ) )\n   (setq *D (fish '((This) (: N)) *G)) )\n\n(de redraw (G S D)\n   # zeroize *G\n   (mapc\n      '((I)\n         (mapc '((This) (=: N NIL)) I) )\n      *G )\n   # draw again\n   (mapc\n      '((X This)\n         (while (and This X)\n            (=: N (pop 'X))\n            (setq This (D This)) ) )\n      G\n      S ) )\n\n(de summ (Lst)\n   (mapcar\n      '((L)\n         (make\n            (while L\n               (ifn (= (car L) (cadr L))\n                  (link (car L))\n                  (link (+ (car L) (cadr L)))\n                  (pop 'L) )\n               (pop 'L) ) ) )\n      Lst ) )\n\n(de vertical ()\n   (mapcar\n      '((X) (extract '((This) (: N)) X))\n      *G ) )\n\n(de horizontal ()\n   (mapcar\n      '((This)\n         (make\n            (while This\n               (when (: N) (link @))\n               (setq This (east This)) ) ) )\n      (car *G) ) )\n\n(de finish? ()\n   (nor\n      (fish\n         '((This)\n            (when (atom This) (= NIL (: N))) )\n         *G )\n      (find\n         '((L)\n            (find\n               '((This)\n                  (when (: N)\n                     (find\n                        '((D)\n                           (= (: N) (get (D This) 'N)) )\n                        (quote north south west east) ) ) )\n               L ) )\n         *G ) ) )\n\n(de board (D)\n   (space 3)\n   (prin '+)\n   (for I G\n      (prin (if (D (car I)) \"   +\" \"---+\")) )\n   (prinl) )\n\n(de display ()\n   (let G (mapcar reverse *G)\n      (board north)\n      (while (caar G)\n         (space 3)\n         (prin '|)\n         (for I G\n            (with (car I)\n               (prin\n                  (if (: N) (align 3 (: N)) \"   \")\n                  (if (east This) \" \" '|) ) ) )\n         (prinl)\n         (board south)\n         (map pop G) )\n      (do 2\n         (prinl) ) ) )\n\n(do 2\n   (cell) )\n(display)\n(loop\n   (case\n      (pack\n         (make\n            (link (key))\n            (while (key 100)\n               (link @) ) ) )\n      (\"^[[D\" #left\n         (redraw (summ (horizontal)) '(a1 a2 a3 a4) east) )\n      (\"^[[C\" #rigth\n         (redraw\n            (summ (mapcar reverse (horizontal)))\n            '(d1 d2 d3 d4)\n            west) )\n      (\"^[[B\" #down\n         (redraw (summ (vertical)) '(a1 b1 c1 d1) north) )\n      (\"^[[A\" #up\n         (redraw\n            (summ (mapcar reverse (vertical)))\n            '(a4 b4 c4 d4)\n            south) ) )\n   (when (diff *D (fish '((This) (: N)) *G))\n      (cell) )\n   (display)\n   (T (finish?) (println 'Finish))\n   (T (fish '((This) (= 512 (: N))) *G)\n      (println 'Maximum) ) )\n(bye)",
        "safe": true
    },
    {
        "filename": "2048_87.txt",
        "content": "use \"term\"\nuse \"random\"\nuse \"time\"\n\ninterface EdgeRow\n  fun val row() : Iterator[U32] ref\n  fun val inc() : I32\n\nprimitive TopRow is EdgeRow\n  fun row() : Iterator[U32] ref => let r : Array[U32] box = [0,1,2,3]\n    r.values()\n  fun inc() : I32 => 4\n\nprimitive LeftRow is EdgeRow\n  fun row() : Iterator[U32] ref => let r : Array[U32] box = [0,4,8,12]\n    r.values()\n  fun inc() : I32 => 1\n\nprimitive RightRow is EdgeRow\n  fun row() : Iterator[U32] ref => let r : Array[U32] box = [3,7,11,15]\n    r.values()\n  fun inc() : I32 => -1\n\nprimitive BottomRow is EdgeRow\n  fun row() : Iterator[U32] ref => let r : Array[U32] box = [12,13,14,15]\n    r.values()\n  fun inc() : I32 =>  -4\n\nprimitive LEFT\nprimitive RIGHT\nprimitive UP\nprimitive DOWN\ntype Move is (LEFT|RIGHT|UP|DOWN)\n\nclass  KeyboardHandler is ANSINotify\n   let _game : Game tag\n   new iso create(game : Game tag) => _game = game\n\n   fun ref apply(term: ANSITerm ref, input: U8 val) =>\n     if input == 113 then\n       _game.quit()\n       term.dispose()\n     end\n   fun ref left(ctrl: Bool, alt: Bool, shift: Bool)  => _game.move(LEFT)\n   fun ref down(ctrl: Bool, alt: Bool, shift: Bool)  => _game.move(DOWN)\n   fun ref up(ctrl: Bool, alt: Bool, shift: Bool)    => _game.move(UP)\n   fun ref right(ctrl: Bool, alt: Bool, shift: Bool) => _game.move(RIGHT)\n\ntype ROW is (U32,U32,U32,U32)\n\nprimitive Merger\n  fun tag apply(r : ROW) : ROW =>\n    match r\n    | (0,0,0,_)            => (r._4,0,0,0)\n    | (0,0,_,r._3)         => (r._3<<1,0,0,0)\n    | (0,0,_,_)            => (r._3,r._4,0,0)\n    | (0,_,r._2,_)         => (r._2<<1,r._4,0,0)\n    | (0,_,0,r._2)         => (r._2<<1,0,0,0)\n    | (0,_,0,_)            => (r._2,r._4,0,0)\n    | (0,_,_,r._3)         => (r._2,r._3<<1,0,0)\n    | (0,_,_,_)            => (r._2,r._3,r._4,0)\n    | (_, r._1, _, r._3)   => (r._1<<1, r._3<<1, 0, 0)\n    | (_, r._1, 0, _)      => (r._1<<1, r._4, 0, 0)\n    | (_, r._1, _, _)      => (r._1<<1, r._3, r._4, 0)\n    | (_, 0,r._1, _)       => (r._1<<1,r._4,0,0)\n    | (_, 0,0, r._1)       => (r._1<<1,0,0,0)\n    | (_, 0,0, _)          => (r._1,r._4,0,0)\n    | (_, 0,_, r._3)       => (r._1, r._3<<1,0,0)\n    | (_, 0,_, _)          => (r._1, r._3,r._4,0)\n    | (_,_,r._2,_)         => (r._1, r._2<<1,r._4,0)\n    | (_,_,0,r._2)         => (r._1, r._2<<1,0,0)\n    | (_,_,0,_)            => (r._1, r._2,r._4,0)\n    | (_,_,_,r._3)         => (r._1, r._2,r._3<<1,0)\n    else\n       r\n    end\n/**\n* Game actor\n*/\nactor Game\n  embed _grid : Array[U32] = Array[U32].init(0, 16)\n  let _rand : Random = MT(Time.millis())\n  let _env : Env\n  let _board : String ref = recover String(1024) end\n\n  new create(env: Env)=>\n    _env = env\n    _add_block()\n    _add_block()\n    _draw()\n\n  fun _merge(start : U32, inc : I32) : (ROW | None) =>\n    var st = start.i32()\n    let rval : ROW = (_get(st),             _get(st + inc),\n                      _get(st + (inc * 2)), _get(st + (inc * 3)))\n    let rout = Merger(rval)\n    if rout is rval then None else rout end\n\n  fun ref _update(start : U32, inc : I32) : Bool =>\n    match _merge(start, inc)\n    | let rout : ROW =>\n        var st = start.i32()\n        _set(st,             rout._1)\n        _set(st +  inc,      rout._2)\n        _set(st + (inc * 2), rout._3)\n        _set(st + (inc * 3), rout._4)\n        true\n    else\n      false\n    end\n\n  fun ref _shift_to(edge : EdgeRow val) : Bool =>\n    var updated = false\n    for r in edge.row() do\n      if _update(r, edge.inc()) then\n        updated = true\n      end\n    end\n    updated\n\n  fun _fmt(i : U32) : String =>\n    match i\n    | 0 => \" __ \"\n    | 2 => \"\\x1B[31m  2 \\x1B[0m\"\n    | 4 => \"\\x1B[32m  4 \\x1B[0m\"\n    | 8 => \"\\x1B[33m  8 \\x1B[0m\"\n    | 16 => \"\\x1B[34m 16 \\x1B[0m\"\n    | 32 => \"\\x1B[35m 32 \\x1B[0m\"\n    | 64 => \"\\x1B[36m 64 \\x1B[0m\"\n    | 128 => \"\\x1B[37m128 \\x1B[0m\"\n    | 256 => \"\\x1B[41m\\x1B[37m256 \\x1B[0m\"\n    | 512 => \"\\x1B[42m\\x1B[37m512 \\x1B[0m\"\n    | 1024 => \"\\x1B[43m\\x1B[37m1024\\x1B[0m\"\n    | 2048 => \"\\x1B[47m\\x1B[35m\\x1B[1m\\x1B[5m2048\\x1B[0m\"\n    else\n      i.string()\n    end\n\n  fun ref _draw() =>\n    let s : String ref = _board\n    s.truncate(0)\n    var i : U32 = 0\n    repeat\n      if (i % 4) == 0 then\n          s.append(\"---------------------\\n\")\n      end\n      s.append(_fmt(_get(i)))\n      s.append(\" \")\n      i = i + 1\n      if (i % 4) == 0 then\n          s.append(\"\\n\")\n      end\n    until i==16 end\n    _env.out.print(s.string())\n    _env.out.print(\"Arrow keys to move. Press (q)uit key to quit.\")\n\n   fun ref _set(i:(I32|U32), v : U32) =>\n     try\n       _grid.update(i.usize(),v)\n     else\n       _env.out.print(\"cant update!\")\n     end\n\n  fun _count() : U64 =>\n     var c : U64 = 0\n     for v in _grid.values() do\n       c = c + if v == 0 then 0 else 1 end\n     end\n     c\n\n  fun ref _add_block() =>\n    let c = _count()\n    if c == 16 then return end\n\n    var hit =  _rand.int(16 - c)\n    var i : U32 = 0\n    while i < 16 do\n      if (_get(i) == 0) then\n        if hit == 0 then\n          _set(i, if _rand.int(10) > 0 then 2 else 4 end)\n          break\n        end\n        hit = hit - 1\n      end\n      i = i + 1\n    end\n\n  fun _get(i : (I32|U32)) : U32 => try  _grid(i.usize()) else 0  end\n\n  fun _win() : Bool =>\n    for v in _grid.values() do\n      if v == 2048 then return true end\n    end\n    false\n\n  fun _no_moves(edge : EdgeRow val) : Bool =>\n    for r in edge.row() do\n      match _merge(r, edge.inc())\n      | let rout : ROW =>\n        if (rout._1 == 0) or (rout._2 == 0) or\n            (rout._3 == 0) or (rout._4 == 0) then\n              return false\n        end\n      end\n    end\n    true\n\n  fun _lose() : Bool =>\n    (_grid.size() >= 16) and\n    _no_moves(LeftRow) and\n    _no_moves(RightRow) and\n    _no_moves(TopRow) and\n    _no_moves(BottomRow)\n\n  be quit()=>\n    _env.out.print(\"Exiting.. some terminals may require <ctrl-c>\")\n    _env.exitcode(0)\n    _env.input.dispose()\n\n  be move(m: Move) =>\n    let updated =\n      match m\n      | LEFT =>  _shift_to(LeftRow)\n      | RIGHT => _shift_to(RightRow)\n      | UP =>    _shift_to(TopRow)\n      | DOWN =>  _shift_to(BottomRow)\n      else\n        false\n      end\n\n    if _win() then\n      _draw()\n      _env.out.print(\"You win\u00a0:)\")\n      quit()\n    else\n      if updated then\n        _add_block()\n        _draw()\n      end\n      if _lose() then\n        _env.out.print(\"You lose\u00a0:(\")\n        quit()\n      end\n    end\n\nactor Main\n  new create(env: Env) =>\n    // unit test\n    ifdef \"test\" then\n      TestMain(env)\n      return\n    end\n    // else game\n    let input : Stdin tag = env.input\n    env.out.print(\"Welcome to ponylang-2048...\")\n    let game = Game(env)\n    let term = ANSITerm(KeyboardHandler(game), input)\n\n    let notify : StdinNotify iso = object iso\n        let term: ANSITerm = term\n        let _in: Stdin tag = input\n        fun ref apply(data: Array[U8] iso) => term(consume data)\n        fun ref dispose() => _in.dispose()\n    end\n\n    input(consume notify)\n",
        "safe": true
    },
    {
        "filename": "2048_88.txt",
        "content": "/* -------------------------------------------------------------\n   Entry point, just create a blank grid and enter a 'game loop'\n   -------------------------------------------------------------*/\nplay_2048 :- \n\twelcome_msg,\n\tlength(Grid, 16), maplist(=(' '), Grid), % create a blank grid\n\tplay(Grid, yes), !. % don't have to cut here but it makes the exit cleaner\n\n\n/* -----------------------------------------------\n   Messages that will be printed at various points \n   -----------------------------------------------*/\nwelcome_msg :- \t\n\tformat('~nWelcome to the Prolog version of 2048~n~n'),\n\tformat('To play using w,s,a,d keys for movement, q to quit~n~n').\t\ncontrats_msg :- format('Congratulations, you reached 2048!~n~n').\nloser_msg :- format('Uh Oh, you could not quite make it to 2048...~n~n').\nquit_msg :- format('Bye then!~n~n').\n\t\n\t\n/* -------------------\n   End game conditions \n   -------------------*/\nplayer_not_won_yet(Grid) :- maplist(dif(2048), Grid).\nplayer_wins(Grid) :- member(2048, Grid).\nplayer_loses(G) :- move(up, G, G), move(down, G, G), move(left, G, G), move(right, G, G).\n\n\t\n/* ---------\n   Game loop \n   ---------*/\t\n% First check if the player has reached the win condition, if not find how many spaces are left\nplay(Grid, _) :- \t\n\tplayer_wins(Grid), \n\tdraw_grid(Grid),\n\tcontrats_msg.\nplay(Grid, CreateNewNum) :- \n\tplayer_not_won_yet(Grid), \n\tinclude(=(' '), Grid, Spaces), length(Spaces, NSpaces), % the number of spaces in the grid\n\tplay(Grid, CreateNewNum, NSpaces).\n\n% knowing the number of spaces, determine if there is a space, and if we need a new number, and generate.\t\nplay(Grid, no, _) :- play(Grid).\nplay(Grid, yes, 0) :- play(Grid).\nplay(Grid, yes, NSpaces) :- \n\tdif(NSpaces, 0), \n\trandom_space(NSpaces, Grid, GridWithRandom), \n\tplay(GridWithRandom).\n\n% with the new number on the grid we can tell if the player has lost the game yet\n% if not, draw the grid and get the next action by the player \nplay(Grid) :- \n\tplayer_loses(Grid), \n\tdraw_grid(Grid), \n\tloser_msg.\t\t\nplay(Grid) :- \n\t\\+ player_loses(Grid),\n\tdraw_grid(Grid),\n\tnext_move_by_player(Move),\n\tplayer_made_move(Grid, Move).\n\n% determine the result of player move\t\nplayer_made_move(_, quit).\nplayer_made_move(Grid, Move) :- \n\tdif(Move, quit), \n\tmove(Move, Grid, Grid), % The move creating the same grid indicates that no merge was done\n\tplay(Grid, no). % don't create a new number\nplayer_made_move(Grid, Move) :- \n\tdif(Move, quit), \n\tmove(Move, Grid, MovedGrid), \n\tdif(Grid, MovedGrid),\n\tplay(MovedGrid, yes).\n\n\t\n/* ---------------------------------------\n   Get the next move from the player input \n   ---------------------------------------*/\t\nnext_move_by_player(Move) :- \n\trepeat, \n\tget_single_char(Char), \n\tkey_move(Char, Move).\n\n% valid keys are: up = 'w', down = 's', left = 'a' right = 'd', quit = 'q'\nkey_move(119, up). key_move(115, down).\tkey_move(97, left). key_move(100, right). key_move(113, quit).\n\n\n/* ------------------\n   Draw the Game grid \n   ------------------*/\ndraw_grid([A1,A2,A3,A4,B1,B2,B3,B4,C1,C2,C3,C4,D1,D2,D3,D4]) :-\n\tformat(   '+-------------------+~n'),\n\trow([A1,A2,A3,A4]), \n\trow([B1,B2,B3,B4]), \n\trow([C1,C2,C3,C4]), \n\tmaplist(draw, [D1,D2,D3,D4]),\n\tformat('\u00a6~n+-------------------+~n~n~n').\n\nrow([A,B,C,D]) :- maplist(draw, [A,B,C,D]), format('\u00a6~n\u00a6----+----+----+----\u00a6~n').\t\n\t\ndraw(' ') :- format('\u00a6    ').\ndraw(X) :- member(X,[2,4,8]), format('\u00a6  ~d ', X).\ndraw(X) :- member(X,[16,32,64]), format('\u00a6 ~d ', X).\ndraw(X) :- member(X,[128,256,512]), format('\u00a6 ~d', X).\ndraw(X) :- member(X,[1024,2048]), format('\u00a6~d', X).\n\n\t\n/* ----------------------------------------\n   Populate a random space with a new value \n   ----------------------------------------*/\nrandom_space(0, G, G).\nrandom_space(1, Grid, GridWithRandom) :- \n\tfour_or_two(V), \n\tselect(' ', Grid, V, GridWithRandom).\nrandom_space(N, Grid, GridWithRandom) :-\n\tN > 1,\n\tfour_or_two(V),\n\trandom(1, N, P),\t\n\treplace_space(P, V, Grid, GridWithRandom).\n\t\nreplace_space(0, V, [' '|T], [V|T]).\nreplace_space(P, V, [' '|T], [' '|R]) :-\tsucc(NextP, P),\treplace_space(NextP, V, T, R).\nreplace_space(P, V, [H|T], [H|R]) :-\tdif(' ', H), replace_space(P, V, T, R).\n\t\nfour_or_two(V) :- random(1, 10, IsFour), IsFour = 1 -> V = 4 ; V = 2.\n\t\n\n/* ------------------------------------------\n   Process a game move based on the direction \n   ------------------------------------------*/\nmove(Direction, UnMoved, Moved) :-\n\tmap_move(Direction, UnMoved, UnMovedMapped),\n\tmaplist(combine_row, UnMovedMapped, MovedMapped),\n\tmap_move(Direction, Moved, MovedMapped).\n\t\n% convert the array to a set of lists that can be moved in the same\n% direction. This can be reversed after the move is completed.\nmap_move(up, [A1,A2,A3,A4,B1,B2,B3,B4,C1,C2,C3,C4,D1,D2,D3,D4], [[D1,C1,B1,A1],[D2,C2,B2,A2],[D3,C3,B3,A3],[D4,C4,B4,A4]]).\nmap_move(down, [A1,A2,A3,A4,B1,B2,B3,B4,C1,C2,C3,C4,D1,D2,D3,D4], [[A1,B1,C1,D1],[A2,B2,C2,D2],[A3,B3,C3,D3],[A4,B4,C4,D4]]).\nmap_move(left, [A1,A2,A3,A4,B1,B2,B3,B4,C1,C2,C3,C4,D1,D2,D3,D4], [[A4,A3,A2,A1],[B4,B3,B2,B1],[C4,C3,C2,C1],[D4,D3,D2,D1]]).\nmap_move(right, [A1,A2,A3,A4,B1,B2,B3,B4,C1,C2,C3,C4,D1,D2,D3,D4], [[A1,A2,A3,A4],[B1,B2,B3,B4],[C1,C2,C3,C4],[D1,D2,D3,D4]]).\n\n% remove all the spaces, then put them at the front of the list\ncombine_row(UnMoved, Moved) :-\n\tpartition(=(' '), UnMoved, Blank, Set),\n\tappend(Blank, Set, ReadyToMove),\n\tcombine(ReadyToMove, Moved).\n\n% combine based on the rules of the game.\ncombine([A,B,C,D], [A,B,C,D]) :- dif(A,B), dif(B,C), dif(C,D).\t\ncombine([A,A,B,B], [' ',' ',Ad,Bd]) :- dbl(A,Ad), dbl(B,Bd).\ncombine([A,B,C,C], [' ',A,B,Cd]) :- dif(A,B), dbl(C,Cd).\ncombine([A,B,B,C], [' ',A,Bd,C]) :-\tdif(B,C), dbl(B,Bd).\ncombine([A,A,B,C], [' ',Ad,B,C]) :- dif(A,B), dif(B,C), dbl(A, Ad).\ncombine([A,B,C,C], [' ',A,B,Cd]) :- dif(A,B), dif(B,C), dbl(C,Cd).\n\n% this could be done using maths, but it is more prology this way.\ndbl(' ', ' '). \ndbl(2,4). dbl(4,8). dbl(8,16). dbl(16,32). dbl(32,64). dbl(64,128). dbl(128,256). dbl(256,512). dbl(512,1028). dbl(1028,2048).\n",
        "safe": true
    },
    {
        "filename": "2048_89.txt",
        "content": "?- play_2048.\n\nWelcome to the Prolog version of 2048\n\nTo play using w,s,a,d keys for movement, q to quit\n\n+-------------------+\n\u00a6    \u00a6    \u00a6    \u00a6    \u00a6\n\u00a6----+----+----+----\u00a6\n\u00a6    \u00a6    \u00a6    \u00a6  2 \u00a6\n\u00a6----+----+----+----\u00a6\n\u00a6    \u00a6    \u00a6    \u00a6    \u00a6\n\u00a6----+----+----+----\u00a6\n\u00a6    \u00a6    \u00a6    \u00a6    \u00a6\n+-------------------+",
        "safe": true
    },
    {
        "filename": "2048_9.txt",
        "content": "+----+----+----+----+\n|  2 | 16 |  2 |  2 |\n+----+----+----+----+\n| 64 |    |    |    |\n+----+----+----+----+\n|  4 |    |    |    |\n+----+----+----+----+\n|    |    |    |    |\n+----+----+----+----+\nScore = 184",
        "safe": true
    },
    {
        "filename": "2048_90.txt",
        "content": "#!/usr/bin/env python3\n\nimport curses\nfrom random import randrange, choice # generate and place new tile\nfrom collections import defaultdict\n\nletter_codes = [ord(ch) for ch in 'WASDRQwasdrq']\nactions = ['Up', 'Left', 'Down', 'Right', 'Restart', 'Exit']\nactions_dict = dict(zip(letter_codes, actions * 2))\n\ndef get_user_action(keyboard):    \n\tchar = \"N\"\n\twhile char not in actions_dict:    \n\t\tchar = keyboard.getch()\n\treturn actions_dict[char]\n\ndef transpose(field):\n\treturn [list(row) for row in zip(*field)]\n\ndef invert(field):\n\treturn [row[::-1] for row in field]\n\nclass GameField(object):\n\tdef __init__(self, height=4, width=4, win=2048):\n\t\tself.height = height\n\t\tself.width = width\n\t\tself.win_value = win\n\t\tself.score = 0\n\t\tself.highscore = 0\n\t\tself.reset()\n\n\tdef reset(self):\n\t\tif self.score > self.highscore:\n\t\t\tself.highscore = self.score\n\t\tself.score = 0\n\t\tself.field = [[0 for i in range(self.width)] for j in range(self.height)]\n\t\tself.spawn()\n\t\tself.spawn()\n\n\tdef move(self, direction):\n\t\tdef move_row_left(row):\n\t\t\tdef tighten(row): # squeese non-zero elements together\n\t\t\t\tnew_row = [i for i in row if i != 0]\n\t\t\t\tnew_row += [0 for i in range(len(row) - len(new_row))]\n\t\t\t\treturn new_row\n\n\t\t\tdef merge(row):\n\t\t\t\tpair = False\n\t\t\t\tnew_row = []\n\t\t\t\tfor i in range(len(row)):\n\t\t\t\t\tif pair:\n\t\t\t\t\t\tnew_row.append(2 * row[i])\n\t\t\t\t\t\tself.score += 2 * row[i]\n\t\t\t\t\t\tpair = False\n\t\t\t\t\telse:\n\t\t\t\t\t\tif i + 1 < len(row) and row[i] == row[i + 1]:\n\t\t\t\t\t\t\tpair = True\n\t\t\t\t\t\t\tnew_row.append(0)\n\t\t\t\t\t\telse:\n\t\t\t\t\t\t\tnew_row.append(row[i])\n\t\t\t\tassert len(new_row) == len(row)\n\t\t\t\treturn new_row\n\t\t\treturn tighten(merge(tighten(row)))\n\n\t\tmoves = {}\n\t\tmoves['Left']  = lambda field:\t\t\t\t\t\t\t\t\\\n\t\t\t\t[move_row_left(row) for row in field]\n\t\tmoves['Right'] = lambda field:\t\t\t\t\t\t\t\t\\\n\t\t\t\tinvert(moves['Left'](invert(field)))\n\t\tmoves['Up']    = lambda field:\t\t\t\t\t\t\t\t\\\n\t\t\t\ttranspose(moves['Left'](transpose(field)))\n\t\tmoves['Down']  = lambda field:\t\t\t\t\t\t\t\t\\\n\t\t\t\ttranspose(moves['Right'](transpose(field)))\n\n\t\tif direction in moves:\n\t\t\tif self.move_is_possible(direction):\n\t\t\t\tself.field = moves[direction](self.field)\n\t\t\t\tself.spawn()\n\t\t\t\treturn True\n\t\t\telse:\n\t\t\t\treturn False\n\n\tdef is_win(self):\n\t\treturn any(any(i >= self.win_value for i in row) for row in self.field)\n\n\tdef is_gameover(self):\n\t\treturn not any(self.move_is_possible(move) for move in actions)\n\n\tdef draw(self, screen):\n\t\thelp_string1 = '(W)Up (S)Down (A)Left (D)Right'\n\t\thelp_string2 = '     (R)Restart (Q)Exit'\n\t\tgameover_string = '           GAME OVER'\n\t\twin_string = '          YOU WIN!'\n\t\tdef cast(string):\n\t\t\tscreen.addstr(string + '\\n')\n\n\t\tdef draw_hor_separator():\n\t\t\ttop = '\u250c' + ('\u252c\u2500\u2500\u2500\u2500\u2500\u2500' * self.width + '\u2510')[1:]\n\t\t\tmid = '\u251c' + ('\u253c\u2500\u2500\u2500\u2500\u2500\u2500' * self.width + '\u2524')[1:]\n\t\t\tbot = '\u2514' + ('\u2534\u2500\u2500\u2500\u2500\u2500\u2500' * self.width + '\u2518')[1:]\n\t\t\tseparator = defaultdict(lambda: mid)\n\t\t\tseparator[0], separator[self.height] = top, bot\n\t\t\tif not hasattr(draw_hor_separator, \"counter\"):\n\t\t\t\tdraw_hor_separator.counter = 0\n\t\t\tcast(separator[draw_hor_separator.counter])\n\t\t\tdraw_hor_separator.counter += 1\n\n\t\tdef draw_row(row):\n\t\t\tcast(''.join('\u2502{: ^5} '.format(num) if num > 0 else '|      ' for num in row) + '\u2502')\n\n\t\tscreen.clear()\n\t\tcast('SCORE: ' + str(self.score))\n\t\tif 0 != self.highscore:\n\t\t\tcast('HIGHSCORE: ' + str(self.highscore))\n\t\tfor row in self.field:\n\t\t\tdraw_hor_separator()\n\t\t\tdraw_row(row)\n\t\tdraw_hor_separator()\n\t\tif self.is_win():\n\t\t\tcast(win_string)\n\t\telse:\n\t\t\tif self.is_gameover():\n\t\t\t\tcast(gameover_string)\n\t\t\telse:\n\t\t\t\tcast(help_string1)\n\t\tcast(help_string2)\n\n\tdef spawn(self):\n\t\tnew_element = 4 if randrange(100) > 89 else 2\n\t\t(i,j) = choice([(i,j) for i in range(self.width) for j in range(self.height) if self.field[i][j] == 0])\n\t\tself.field[i][j] = new_element\n\n\tdef move_is_possible(self, direction):\n\t\tdef row_is_left_movable(row): \n\t\t\tdef change(i): # true if there'll be change in i-th tile\n\t\t\t\tif row[i] == 0 and row[i + 1] != 0: # Move\n\t\t\t\t\treturn True\n\t\t\t\tif row[i] != 0 and row[i + 1] == row[i]: # Merge\n\t\t\t\t\treturn True\n\t\t\t\treturn False\n\t\t\treturn any(change(i) for i in range(len(row) - 1))\n\n\t\tcheck = {}\n\t\tcheck['Left']  = lambda field:\t\t\t\t\t\t\t\t\\\n\t\t\t\tany(row_is_left_movable(row) for row in field)\n\n\t\tcheck['Right'] = lambda field:\t\t\t\t\t\t\t\t\\\n\t\t\t\t check['Left'](invert(field))\n\n\t\tcheck['Up']    = lambda field:\t\t\t\t\t\t\t\t\\\n\t\t\t\tcheck['Left'](transpose(field))\n\n\t\tcheck['Down']  = lambda field:\t\t\t\t\t\t\t\t\\\n\t\t\t\tcheck['Right'](transpose(field))\n\n\t\tif direction in check:\n\t\t\treturn check[direction](self.field)\n\t\telse:\n\t\t\treturn False\n\ndef main(stdscr):\n\tcurses.use_default_colors()\n\tgame_field = GameField(win=32)\n\tstate_actions = {} # Init, Game, Win, Gameover, Exit\n\tdef init():\n\t\tgame_field.reset()\n\t\treturn 'Game'\n\n\tstate_actions['Init'] = init\n\n\tdef not_game(state):\n\t\tgame_field.draw(stdscr)\n\t\taction = get_user_action(stdscr)\n\t\tresponses = defaultdict(lambda: state)\n\t\tresponses['Restart'], responses['Exit'] = 'Init', 'Exit'\n\t\treturn responses[action]\n\n\tstate_actions['Win'] = lambda: not_game('Win')\n\tstate_actions['Gameover'] = lambda: not_game('Gameover')\n\n\tdef game():\n\t\tgame_field.draw(stdscr)\n\t\taction = get_user_action(stdscr)\n\t\tif action == 'Restart':\n\t\t\treturn 'Init'\n\t\tif action == 'Exit':\n\t\t\treturn 'Exit'\n\t\tif game_field.move(action): # move successful\n\t\t\tif game_field.is_win():\n\t\t\t\treturn 'Win'\n\t\t\tif game_field.is_gameover():\n\t\t\t\treturn 'Gameover'\n\t\treturn 'Game'\n\t\t\n\tstate_actions['Game'] = game\n\n\tstate = 'Init'\n\twhile state != 'Exit':\n\t\tstate = state_actions[state]()\n\ncurses.wrapper(main)\n",
        "safe": true
    },
    {
        "filename": "2048_91.txt",
        "content": "#!/usr/bin/env python3\n\n''' Python 3.6.5 code using Tkinter graphical user interface.\n    Option to set goal to powers of 2 from 128 to 2048. '''\nfrom tkinter import *\nfrom tkinter import messagebox\nfrom tkinter import ttk\nimport random\n\n# ************************************************\n\nclass Board:\n\n    def __init__(self):\n        self.bd = ['']* 16\n        self.goal = 2048\n        self.choices = '2222222224'\n        \n    # place 2 random squares on empty board:\n    def place_two(self):\n        idx = range(15)\n        a, b = random.sample(idx, 2)\n        self.bd[a] = random.choice(self.choices)        \n        self.bd[b] = random.choice(self.choices)       \n\n    # return text on square at index=idx of board:    \n    def get_text(self, idx):\n        return self.bd[idx]\n\n    # move squares on board based on arrow key entered:\n    def move_squares(self, key):\n        if key in ('LR'):\n            # generate 4x4 2D array for row processing:\n            rows = [[self.bd[0],  self.bd[1],  self.bd[2],  self.bd[3]],\n                    [self.bd[4],  self.bd[5],  self.bd[6],  self.bd[7]],\n                    [self.bd[8],  self.bd[9],  self.bd[10], self.bd[11]],\n                    [self.bd[12], self.bd[13], self.bd[14], self.bd[15]]]\n        else:\n            # generate transposed 4x4 2D array instead:\n            rows = [[self.bd[0],  self.bd[4],  self.bd[8],  self.bd[12]],\n                    [self.bd[1],  self.bd[5],  self.bd[9],  self.bd[13]],\n                    [self.bd[2],  self.bd[6],  self.bd[10], self.bd[14]],\n                    [self.bd[3],  self.bd[7],  self.bd[11], self.bd[15]]]\n\n        # build a new 4x4 array of \"moved\" rows:\n        nrows = []       \n        for row in rows:\n            if key in 'RD':\n                # reverse these rows and slide to left:\n                row = row[::-1]\n            nrow = self.slide_squares(row)\n            if key in 'RD':\n                # restore reversed rows:\n                nrow = nrow[::-1]\n            nrows.append(nrow)\n        if key in ('UD'):\n            # transpose arrays that were transposed:\n            nrows = list(map(list, zip(*nrows)))\n\n        # flatten 4x4 2D array:\n        newbd = []\n        for row in nrows:\n            for r in row:\n                newbd.append(r)\n\n        # place a '2' or '4' in random open square of newbd:\n        if newbd != self.bd and '' in newbd:\n            loi = []\n            for i in range(16):\n                if newbd[i] == '':\n                    loi.append(i)\n            i = random.choice(loi)\n            newbd[i] = random.choice(self.choices)\n        \n        self.bd = newbd\n        return\n\n    # slide squares in row to the left:                  \n    def slide_squares(self, row):\n        new = ['']  * 4\n        icmb = -1\n        inew = 0\n        for x in row:\n            if x:\n                if (inew > 0         and\n                    x == new[inew-1] and\n                    icmb != inew-1):\n                    new[inew-1] = str(2*int(x))\n                    icmb = inew-1\n                else:\n                    new[inew] = x\n                    inew += 1\n        return new\n\n    # check if game won, lost, or continuing:\n    def is_end(self):\n        if self.goal in self.bd:\n            return 'W'\n        if '' in self.bd:\n            return 'C'\n        for i in [0, 1, 2, 4, 5, 6, 8, 9, 10, 12, 13, 14]:\n            if self.bd[i] == self.bd[i+1]:\n                return 'C'\n        for i in range(12):\n            if self.bd[i] == self.bd[i+4]:\n                return 'C'\n        return 'L'\n                \n# ************************************************\n\nclass Game:\n    def __init__(self, gw):\n        self.window = gw\n\n        self.rosybrown1 = '#ffc1c1'\n        self.lemonchiffon = '#fffacd'\n        self.skyblue1 = '#87ceff'\n        self.springgreen = '#00ff7f'\n        self.tomato1 = '#ff6347'\n        self.hotpink = '#ff69b4'\n        self.brilliantlavender = '#edcaf6'\n        self.cobaltgreen = '#3d9140'\n        self.dodgerblue = '#1e90ff'\n        self.darkgoldenrod1 = '#ffb90f'\n        self.yellow = '#ffff00'\n        self.imperialred = '#ed2939'\n        self.navyblue = '#000080'\n        self.lightgreen = '#90ee90'\n        self.lightsteelblue = '#b0c4de'\n        self.white = '#ffffff'\n        self.palegreen4 = '#548b54'\n        self.darkgreen = '#013220'\n        self.black = '#000000'\n\n        self.doc = {'':self.rosybrown1,\n                    '2':self.lemonchiffon,\n                    '4':self.skyblue1,\n                    '8':self.springgreen,\n                    '16':self.tomato1,\n                    '32':self.hotpink,\n                    '64':self.brilliantlavender,\n                    '128':self.cobaltgreen,\n                    '256':self.dodgerblue,\n                    '512':self.darkgoldenrod1,\n                    '1024':self.yellow,\n                    '2048':self.imperialred}\n\n        # game data:\n        self.bd = None\n        self.playable = False\n\n        # top frame:\n        self.top_fr = Frame(gw,\n                            width=600,\n                            height=100,\n                            bg=self.lightgreen)\n        self.top_fr.pack(fill=X)\n\n        self.hdg = Label(self.top_fr,\n                         text='  2048  ',\n                         font='arial 22 bold',\n                         fg=self.navyblue,\n                         bg=self.white)\n        self.hdg.place(relx=0.5, rely=0.4,\n                       anchor=CENTER)\n\n        self.dir = Label(self.top_fr,\n                 text=\"(Select a 'Goal' & Click 'New Game')\",\n                 font='arial 12 ',\n                 fg=self.navyblue,\n                 bg=self.lightgreen)\n        self.dir.place(relx=0.5, rely=0.8,\n                       anchor=CENTER)\n\n        self.play_btn = Button(self.top_fr,\n                               text='New \\nGame',\n                               bd=5,\n                               bg=self.palegreen4,\n                               fg=self.white,\n                               font='times 12 bold',\n                               command=self.new_game)\n        self.play_btn.place(relx=0.92, rely=0.5,\n                       anchor=E)\n\n        self.lbl_cb = Label(self.top_fr,\n                            text='     Goal',\n                            font='arial 12 bold ',\n                            fg=self.darkgreen,\n                            bg=self.lightgreen)\n        self.lbl_cb.place(relx=0.08, rely=0.35,\n                       anchor=W)\n\n        goals = ['2048', '1024', '512', '256', '128']\n        self.cur_goal = StringVar()\n        self.goal_cb = ttk.Combobox(self.top_fr,\n                                    foreground=self.darkgreen,\n                                    values=goals,\n                                    font='times 12 bold',\n                                    justify='left',\n                                    state='readonly',\n                                    textvariable=self.cur_goal, \n                                    width=7,\n                                    height=30)\n        self.goal_cb.place(relx=0.08, rely=0.6,\n                       anchor=W)\n        self.goal_cb.current(0)\n\n        # bottom frame:\n        self.btm_fr = Frame(gw,\n                            width=600,\n                            height=500,\n                            bg=self.lightsteelblue)\n        self.btm_fr.pack(fill=X)\n\n        # board frame:\n        self.bd_fr = Frame(self.btm_fr,\n                           width=400+2,\n                           height=400+2,\n                           relief='solid',\n                           bd=1,\n                           bg=self.lemonchiffon)\n        self.bd_fr.place(relx=0.5, rely=0.5,\n                         anchor=CENTER)\n\n        self.bd = Board()\n        self.play_game()\n\n# ************************************************\n\n    # action to take if 'new game' button is clicked\n    # or if 'play again' is chosen after win or loss:\n    def new_game(self):   \n        self.playable = True\n        self.bd = Board()\n        self.bd.place_two()\n        self.bd.goal = self.goal_cb.get()\n        self.goal_cb.config(state='disabled')\n        self.dir.config(text='(Use arrow keys to play game)')\n        self.play_game()\n\n    # show current contents of board:\n    def play_game(self):\n        objh = 100  # widget height\n        objw = 100  # widget width\n        objx = 0    # x-position of widget in frame\n        objy = 0    # y-position of widget in frame\n\n        i = 0\n        for r in range(4):\n            for c in range(4):\n                txt = self.bd.get_text(i)\n                bg_color = self.doc[txt]         \n                game_sq = Label(self.bd_fr,\n                                text=txt,\n                                relief='solid',\n                                bd=1,\n                                fg=self.black,\n                                bg=bg_color,\n                                font='times 16 bold')\n                game_sq.place(x=objx, y=objy,\n                              height=objh, width=objw)\n                i += 1\n                objx = objx + objw\n            objx = 0\n            objy = objy + objh\n\n    # control play when an arrow key is pressed:\n    def key(self, event):\n        if event.keysym in ('Left', 'Right', 'Up', 'Down'):\n            if self.playable:\n                self.bd.move_squares(event.keysym[0])\n                self.play_game()\n                x = self.bd.is_end()\n                if x == 'C':\n                    return\n                elif x == 'W':\n                    msg = 'You won!!!   Play again?'\n                elif x == 'L':\n                    msg = 'You lost!!!   Play again?'\n                ans = messagebox.askquestion(msg)\n                if ans == 'no':\n                    self.window.destroy()\n                else:\n                    self.new_game()\n\n# ************************************************\n\nroot = Tk()\nroot.title('2048')\nroot.geometry('600x600+100+50')\nroot.resizable(False, False)\ng = Game(root)\nroot.bind_all('<Key>', g.key)\nroot.mainloop()\n",
        "safe": true
    },
    {
        "filename": "2048_92.txt",
        "content": "_DEFINE A-Z AS _INTEGER64\nDIM SHARED Grid(0 TO 5, 0 TO 5) AS INTEGER\nCONST Left = 19200\nCONST Right = 19712\nCONST Down = 20480\nCONST Up = 18432\nCONST ESC = 27\nCONST LCtrl = 100306\nCONST RCtrl = 100305\n\nInit\nMakeNewGame\nDO\n    _LIMIT 30\n    ShowGrid\n    CheckInput flag\n    IF flag THEN GetNextNumber\n    _DISPLAY\nLOOP\n\nSUB CheckInput (flag)\nflag = 0\nk = _KEYHIT\nSELECT CASE k\n    CASE ESC: SYSTEM\n    CASE 83, 115 'S\n        IF _KEYDOWN(LCtrl) OR _KEYDOWN(RCtrl) THEN MakeNewGame\n    CASE Left\n        MoveLeft\n        flag = -1 'we hit a valid move key.  Even if we don't move, get a new number\n    CASE Up\n        MoveUp\n        flag = -1\n    CASE Down\n        MoveDown\n        flag = -1\n    CASE Right\n        MoveRight\n        flag = -1\nEND SELECT\nEND SUB\n\nSUB MoveDown\n'first move everything left to cover the blank spaces\nDO\n    moved = 0\n    FOR y = 4 TO 1 STEP -1\n        FOR x = 1 TO 4\n            IF Grid(x, y) = 0 THEN 'every point above this moves down\n                FOR j = y TO 1 STEP -1\n                    Grid(x, j) = Grid(x, j - 1)\n                    IF Grid(x, j) <> 0 THEN moved = -1\n                NEXT\n            END IF\n        NEXT\n    NEXT\n    IF moved THEN y = y + 1 'recheck the same column\nLOOP UNTIL NOT moved\nFOR y = 4 TO 1 STEP -1\n    FOR x = 1 TO 4\n        IF Grid(x, y) <> 0 AND Grid(x, y) = Grid(x, y - 1) THEN 'add them together and every point above this moves\n            Grid(x, y) = Grid(x, y) * 2\n            FOR j = y - 1 TO 1\n                Grid(x, j) = Grid(x, j - 1)\n            NEXT\n        END IF\n    NEXT\nNEXT\nEND SUB\n\nSUB MoveLeft\n'first move everything to cover the blank spaces\nDO\n    moved = 0\n    FOR x = 1 TO 4\n        FOR y = 1 TO 4\n            IF Grid(x, y) = 0 THEN 'every point right of this moves left\n                FOR j = x TO 4\n                    Grid(j, y) = Grid(j + 1, y)\n                    IF Grid(j, y) <> 0 THEN moved = -1\n                NEXT\n            END IF\n        NEXT\n    NEXT\n    IF moved THEN x = x - 1 'recheck the same row\nLOOP UNTIL NOT moved\nFOR x = 1 TO 4\n    FOR y = 1 TO 4\n        IF Grid(x, y) <> 0 AND Grid(x, y) = Grid(x + 1, y) THEN 'add them together and every point right of this moves left\n            Grid(x, y) = Grid(x, y) * 2\n            FOR j = x + 1 TO 4\n                Grid(j, y) = Grid(j + 1, y)\n            NEXT\n        END IF\n    NEXT\nNEXT\nEND SUB\n\nSUB MoveUp\n'first move everything to cover the blank spaces\nDO\n    moved = 0\n    FOR y = 1 TO 4\n        FOR x = 1 TO 4\n            IF Grid(x, y) = 0 THEN 'every point below of this moves up\n                FOR j = y TO 4\n                    Grid(x, j) = Grid(x, j + 1)\n                    IF Grid(x, j) <> 0 THEN moved = -1\n                NEXT\n            END IF\n        NEXT\n    NEXT\n    IF moved THEN y = y - 1 'recheck the same column\nLOOP UNTIL NOT moved\nFOR y = 1 TO 4\n    FOR x = 1 TO 4\n        IF Grid(x, y) <> 0 AND Grid(x, y) = Grid(x, y + 1) THEN 'add them together and every point below this moves\n            Grid(x, y) = Grid(x, y) * 2\n            FOR j = y + 1 TO 4\n                Grid(x, j) = Grid(x, j + 1)\n            NEXT\n            Grid(x, 4) = 0\n        END IF\n    NEXT\nNEXT\nEND SUB\n\nSUB MoveRight\n'first move everything to cover the blank spaces\nDO\n    moved = 0\n    FOR x = 4 TO 1 STEP -1\n        FOR y = 1 TO 4\n            IF Grid(x, y) = 0 THEN 'every point right of this moves left\n                FOR j = x TO 1 STEP -1\n                    Grid(j, y) = Grid(j - 1, y)\n                    IF Grid(j, y) <> 0 THEN moved = -1\n                NEXT\n            END IF\n        NEXT\n    NEXT\n    IF moved THEN x = x - 1 'recheck the same row\nLOOP UNTIL NOT moved\n\nFOR x = 4 TO 1 STEP -1\n    FOR y = 1 TO 4\n        IF Grid(x, y) <> 0 AND Grid(x, y) = Grid(x - 1, y) THEN 'add them together and every point right of this moves left\n            Grid(x, y) = Grid(x, y) * 2\n            FOR j = x - 1 TO 1 STEP -1\n                Grid(j, y) = Grid(j - 1, y)\n            NEXT\n        END IF\n    NEXT\nNEXT\nEND SUB\n\nSUB ShowGrid\n'SUB MakeBox (Mode AS INTEGER, x1 AS INTEGER, y1 AS INTEGER, x2 AS INTEGER, y2 AS INTEGER,\n'Caption AS STRING, FontColor AS _UNSIGNED LONG, FontBackground AS _UNSIGNED LONG,\n'BoxColor AS _UNSIGNED LONG, BoxHighLight AS _UNSIGNED LONG, XOffset AS INTEGER, YOffset AS INTEGER)\nw = 120\nh = 120\nFOR x = 1 TO 4\n    FOR y = 1 TO 4\n        t$ = LTRIM$(STR$(Grid(x, y)))\n        IF t$ = \"0\" THEN t$ = \"\"\n        MakeBox 4, (x - 1) * w, (y - 1) * h, w, h, t$, -1, 0, 0, -1, 0, 0\n    NEXT\nNEXT\nEND SUB\n\nSUB Init\nws = _NEWIMAGE(480, 480, 32)\nSCREEN ws\n_DELAY 1\n_TITLE \"Double Up\"\n_SCREENMOVE _MIDDLE\nRANDOMIZE TIMER\nf& = _LOADFONT(\"C:\\Windows\\Fonts\\courbd.ttf\", 32, \"MONOSPACE\")\n_FONT f&\n\nEND SUB\n\nSUB MakeNewGame\nFOR x = 1 TO 4\n    FOR y = 1 TO 4\n        Grid(x, y) = 0\n    NEXT\nNEXT\nGetNextNumber\nGetNextNumber\nEND SUB\n\nSUB GetNextNumber\nFOR x = 1 TO 4\n    FOR y = 1 TO 4\n        IF Grid(x, y) = 0 THEN valid = -1\n    NEXT\nNEXT\nIF valid THEN 'If all the grids are full, we can't add any more numbers\n    'This doesn't mean the game is over, as the player may be able to\n    DO\n        x = _CEIL(RND * 4)\n        y = _CEIL(RND * 4)\n    LOOP UNTIL Grid(x, y) = 0\n    Grid(x, y) = 2\nEND IF\nEND SUB\n\nSUB MakeBox (Mode AS INTEGER, x1 AS INTEGER, y1 AS INTEGER, x2 AS INTEGER, y2 AS INTEGER, Caption AS STRING, FontColor AS _UNSIGNED LONG, FontBackground AS _UNSIGNED LONG, BoxColor AS _UNSIGNED LONG, BoxHighLight AS _UNSIGNED LONG, XOffset AS INTEGER, YOffset AS INTEGER)\n\n'This is an upgrade version of my original Button routine.\n'It's more versitile (but complex) than the original.\n'Mode 0 (or any unsupported number) will tell the box to size itself from X1,Y1 to X2,Y2\n'Mode 1 will tell the box to autosize itself according to whatever text is placed within it.\n'Mode 2 will tell the box to use X2 and Y2 as relative coordinates and not absolute coordinates.\n'Mode 3 will tell the box to autocenter text with X2, Y2 being absolute coordinates.\n'Mode 4 will tell the box to autocenter text with X2, Y2 being relative coordinates.\n'Mode otherwise is unused, but available for expanded functionality.\n'X1 carries the X location of where we want to place our box on the screen.\n'Y2 carries the Y location of where we want to place our box on the screen.\n'X2 is the X boundry of our box on the screen, depending on our mode.\n'Y2 is the Y boundry of our box on the screen, depending on our mode.\n\n'Caption is the text that we want our box to contain.\n\n'FontColor is our font color for our caption\n'FontBackground is the font background color for our caption\n'NOTE: IF FONTCOLOR OR FONTBACKGROUND IS SET TO ZERO, THEY WILL **NOT** AFFECT THE COLOR BEHIND THEM.\n'This can be used to mimic the function of _KEEPBACKGROUND, _FILLBACKGROUND, or _ONLYBACKGROUND\n\n'BoxColor is our box color\n'BoxHighlight is our box highligh colors\n'NOTE: SAME WITH BOXCOLOR AND BOXHIGHLIGHT.  IF SET TO ZERO, THEY WILL HAVE **NO** COLOR AT ALL TO THEM, AND WILL NOT AFFECT THE BACKGROUND OF ANYTHING BEHIND THEM.\n\n'XOffset is used to offset our text # pixels from the X1 top.\n'YOffset is used to offset our text # pixels from the Y1 top.\n'These can be used to place our text wherever we want on our box.\n'But remember, if Mode = 3 or 4, the box will autocenter the text and ignore these parameters completely.\n\nDIM BoxBlack AS _UNSIGNED LONG\n\ndc& = _DEFAULTCOLOR: bg& = _BACKGROUNDCOLOR\nIF Black <> 0 THEN\n    'We have black either as a CONST or a SHARED color\n    BoxBlack = Black\nELSE\n    'We need to define what Black is for our box.\n    BoxBlack = _RGB32(0, 0, 0)\nEND IF\n\nIF _FONTWIDTH <> 0 THEN cw = _FONTWIDTH * LEN(Caption) ELSE cw = _PRINTWIDTH(Caption)\nch = _FONTHEIGHT\n\ntx1 = x1: tx2 = x2: ty1 = y1: ty2 = y2\nSELECT CASE Mode\n    CASE 0\n        'We use the X2, Y2 coordinates provided as absolute coordinates\n    CASE 1\n        tx2 = tx1 + cw + 8\n        ty2 = ty1 + ch + 8\n        XOffset = 5: YOffset = 5\n    CASE 2\n        tx2 = tx1 + x2\n        ty2 = ty1 + y2\n    CASE 3\n        XOffset = (tx2 - tx1 - cw) \\ 2\n        YOffset = (ty2 - ty1 - ch) \\ 2\n    CASE 4\n        tx2 = tx1 + x2\n        ty2 = ty1 + y2\n        XOffset = (tx2 - tx1) \\ 2 - cw \\ 2\n        YOffset = (ty2 - ty1 - ch) \\ 2\nEND SELECT\nLINE (tx1, ty1)-(tx2, ty2), BoxBlack, BF\nLINE (tx1 + 1, ty1 + 1)-(tx2 - 1, ty2 - 1), BoxHighLight, B\nLINE (tx1 + 2, ty1 + 2)-(tx2 - 2, ty2 - 2), BoxHighLight, B\nLINE (tx1 + 3, ty1 + 3)-(tx2 - 3, ty2 - 3), BoxBlack, B\nLINE (tx1, ty1)-(tx1 + 3, ty1 + 3), BoxBlack\nLINE (tx2, ty1)-(tx2 - 3, ty1 + 3), BoxBlack\nLINE (tx1, ty2)-(tx1 + 3, ty2 - 3), BoxBlack\nLINE (tx2, ty2)-(tx2 - 3, ty2 - 3), BoxBlack\nLINE (tx1 + 3, y1 + 3)-(tx2 - 3, ty2 - 3), BoxColor, BF\nCOLOR FontColor, FontBackground\n_PRINTSTRING (tx1 + XOffset, ty1 + YOffset), Caption$\nCOLOR dc&, bg&\nEND SUB",
        "safe": true
    },
    {
        "filename": "2048_93.txt",
        "content": "GD <- function(vec) {\n    c(vec[vec != 0], vec[vec == 0])\n}\nDG <- function(vec) {\n    c(vec[vec == 0], vec[vec != 0])\n}\n\nDG_ <- function(vec, v = TRUE) {\n    if (v) \n        print(vec)\n    rev(GD_(rev(vec), v = FALSE))\n}\n\nGD_ <- function(vec, v = TRUE) {\n    if (v) {\n        print(vec)\n    }\n    vec2 <- GD(vec)\n    # on cherche les 2 cote a cote\n    pos <- which(vec2 == c(vec2[-1], 9999))\n    # put pas y avoir cons\u00e9cutif dans pos\n    pos[-1][which(abs(pos - c(pos[-1], 999)) == 1)]\n    av <- which(c(0, c(pos[-1], 9) - pos) == 1)\n    if (length(av) > 0) {\n        pos <- pos[-av]\n    }\n    vec2[pos] <- vec2[pos] + vec2[pos + 1]\n    vec2[pos + 1] <- 0\n    GD(vec2)\n    \n}\n\nH_ <- function(base) {\n    apply(base, MARGIN = 2, FUN = GD_, v = FALSE)\n}\nB_ <- function(base) {\n    apply(base, MARGIN = 2, FUN = DG_, v = FALSE)\n}\nG_ <- function(base) {\n    t(apply(base, MARGIN = 1, FUN = GD_, v = FALSE))\n}\nD_ <- function(base) {\n    t(apply(base, MARGIN = 1, FUN = DG_, v = FALSE))\n}\n\nH <- function(base) {\n    apply(base, MARGIN = 2, FUN = GD, v = FALSE)\n}\nB <- function(base) {\n    apply(base, MARGIN = 2, FUN = DG, v = FALSE)\n}\nG <- function(base) {\n    t(apply(base, MARGIN = 1, FUN = GD, v = FALSE))\n}\nD <- function(base) {\n    t(apply(base, MARGIN = 1, FUN = DG, v = FALSE))\n}\n\nadd2or4 <- function(base, p = 0.9) {\n    lw <- which(base == 0)\n    if (length(lw) > 1) {\n        tirage <- sample(lw, 1)\n    } else {\n        tirage <- lw\n    }\n    base[tirage] <- sample(c(2, 4), 1, prob = c(p, 1 - p))\n    base\n}\nprint.dqh <- function(base) {\n    cat(\"\\n\\n\")\n    for (i in 1:nrow(base)) {\n        cat(paste(\"     \", base[i, ], \" \"))\n        cat(\"\\n\")\n    }\n    cat(\"\\n\")\n}\n\n\n\n# -*- coding: utf-8 -*-\n#' @encoding UTF-8\n#' @title run_2048\n#' @description The 2048 game\n#' @param nrow nomber of row\n#' @param ncol numver of col\n#' @param p probability to obtain a 2 (1-p) is the probability to obtain a 4\n#' @examples\n#' \\dontrun{\n#' run_2048()\n#' }\n#' @export\n\n\nrun_2048 <- function(nrow, ncol, p = 0.9) {\n    \n    \n    \n    help <- function() {\n        cat(\"   *** KEY BINDING ***  \\n\\n\")\n        cat(\"press ECHAP to quit\\n\\n\")\n        cat(\"choose moove E (up)\u00a0; D (down)\u00a0; S (left); F (right) \\n\")\n        cat(\"choose moove 8 (up)\u00a0; 2 (down)\u00a0; 4 (left); 6 (right) \\n\")\n        cat(\"choose moove I (up)\u00a0; K (down)\u00a0; J (left); L (right) \\n\\n\\n\")\n        \n    }\n    \n    \n    if (missing(nrow) & missing(ncol)) {\n        nrow <- ncol <- 4\n    }\n    if (missing(nrow)) {\n        nrow <- ncol\n    }\n    if (missing(ncol)) {\n        ncol <- nrow\n    }\n    \n    base <- matrix(0, nrow = nrow, ncol = ncol)\n    \n    while (length(which(base == 2048)) == 0) {\n        base <- add2or4(base, p = p)\n        # print(base)\n        \n        class(base) <- \"dqh\"\n        print(base)\n        flag <- sum((base == rbind(base[-1, ], 0)) + (base == rbind(0, \n            base[-nrow(base), ])) + (base == cbind(base[, -1], 0)) + (base == \n            cbind(0, base[, -nrow(base)])))\n        if (flag == 0) {\n  \n            break\n        }\n        \n        y <- character(0)\n        while (length(y) == 0) {\n            cat(\"\\n\", \"choose moove E (up)\u00a0; D (down)\u00a0; s (left); f (right) OR H for help\", \n                \"\\n\")  # prompt\n            y <- scan(n = 1, what = \"character\")\n        }\n        \n        \n        baseSAVE <- base\n        base <- switch(EXPR = y, E = H_(base), D = B_(base), S = G_(base), \n            F = D_(base), e = H_(base), d = B_(base), s = G_(base), f = D_(base), \n            `8` = H_(base), `2` = B_(base), `4` = G_(base), `6` = D_(base), \n            H = help(), h = help(), i = H_(base), k = B_(base), j = G_(base), \n            l = D_(base), I = H_(base), K = B_(base), J = G_(base), L = D_(base))\n        if (is.null(base)) {\n            cat(\" wrong KEY \\n\")\n            base <- baseSAVE\n        }\n        \n        \n        \n    }\n    \n    if (sum(base >= 2048) > 1) {\n        cat(\"YOU WIN\u00a0! \\n\")\n    } else {\n        cat(\"YOU LOOSE \\n\")\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "2048_94.txt",
        "content": ";; LICENSE: See License file LICENSE (MIT license)\n;;\n;; Repository: https://github.com/danprager/2048\n;;\n;; Copyright 2014: Daniel Prager\n;;                 daniel.a.prager@gmail.com\n;;\n;; This is a largely clean-room, functional implementation in Racket \n;; of the game 2048 by Gabriele Cirulli, based on 1024 by Veewo Studio,\n;; and conceptually similar to Threes by Asher Vollmer.\n;;\n;;\n;; HOW TO PLAY: \n;;   * Use your arrow keys to slide the tiles. \n;;   * When two tiles with the same number touch, they merge into one!\n;;   * Press <space> to rotate the board.\n;;\n\n#lang racket\n\n(require rackunit\n         2htdp/image\n         (rename-in 2htdp/universe\n                    [left left-arrow]\n                    [right right-arrow]\n                    [up up-arrow]\n                    [down down-arrow]))\n\n\n(define *side* 4)              ; Side-length of the grid\n(define *time-limit* #f)       ; Use #f for no time limit, or number of seconds\n\n(define *amber-alert* 60)      ; Time indicator goes orange when less than this number of seconds remaining\n(define *red-alert* 10)        ; Time indicator goes red when less than this number of seconds remaining\n\n(define *tile-that-wins* 2048) ; You win when you get a tile = this number\n(define *magnification* 2)     ; Scales the game board\n\n(define (set-side! n)\n  (set! *side* n))\n\n;;\n;; Numbers can be displayed with substiture text. Just edit this table...\n;;\n(define *text*\n  '((0 \"\")\n    (2 \"2\")))\n\n;; Color scheme \n;;\n;; From https://github.com/gabrielecirulli/2048/blob/master/style/main.css\n;;\n(define *grid-color* (color #xbb #xad #xa0))\n\n(define *default-tile-bg-color* (color #x3c #x3a #x32))\n(define *default-tile-fg-color* 'white)\n\n(define *tile-bg-colors*\n  (map (lambda (x)\n         (match-define (list n r g b) x)\n         (list n (color r g b)))\n       '((0 #xcc #xc0 #xb3)\n         (2 #xee #xe4 #xda)\n         (4 #xed #xe0 #xc8)\n         (8 #xf2 #xb1 #x79)\n         (16 #xf5 #x95 #x63)\n         (32 #xf6 #x7c #x5f)\n         (64 #xf6 #x5e #x3b)\n         (128 #xed #xcf #x72)\n         (256 #xed #xcc #x61)\n         (512 #xed #xc8 #x50)\n         (1024 #xed #xc5 #x3f)\n         (2048 #xed #xc2 #x2e))))\n\n(define *tile-fg-colors*\n  '((0 dimgray)\n    (2 dimgray)\n    (4 dimgray)\n    (8 white)\n    (16 white)\n    (32 white)\n    (64 white)\n    (128 white)\n    (256 white)\n    (512 white)\n    (1024 white)\n    (2048 white)))\n\n;;--------------------------------------------------------------------\n;; Rows may be represented as lists, with 0s representing empty spots.\n;;\n\n(define (nonzero? x) (not (zero? x)))\n\n;; Append padding to lst to make it n items long\n;;\n(define (pad-right lst padding n)\n  (append lst (make-list (- n (length lst)) padding)))\n\n;; Slide items towards the head of the list, doubling adjacent pairs\n;; when no item is a 0.\n;;\n;; E.g. (combine '(2 2 2 4 4)) -> '(4 2 8)\n;;\n(define (combine lst)\n  (cond [(<= (length lst) 1) lst]\n        [(= (first lst) (second lst))\n         (cons (* 2 (first lst)) (combine (drop lst 2)))]\n        [else (cons (first lst) (combine (rest lst)))]))\n\n;; Total of new elements introduced by combining.\n;;\n;; E.g. (combine-total '(2 2 2 4 4)) -> 4 + 8 = 12\n;;\n(define (combine-total lst)\n  (cond [(<= (length lst) 1) 0]\n        [(= (first lst) (second lst))\n         (+ (* 2 (first lst)) (combine-total (drop lst 2)))]\n        [else (combine-total (rest lst))]))\n\n;; Slide towards the head of the list, doubling pairs, 0 are\n;; allowed (and slid through), and length is preserved by\n;; padding with 0s.\n;;\n;; E.g. (slide-left '(2 2 2 0 4 4)) -> '(4 2 8 0 0 0)\n;;\n(define (slide-left row)\n  (pad-right (combine (filter nonzero? row)) 0 (length row)))\n\n;; Slide towards the tail of the list:\n;;\n;; E.g. (slide-right '(2 2 0 0 4 4)) -> '(0 0 0 0 0 4 8)\n;;\n(define (slide-right row) (reverse (slide-left (reverse row))))\n\n\n;;--------------------------------------------------------------------\n;; We use a sparse representation for transitions in a row.\n;;\n;; Moves take the form '(value initial-position final-position) \n;;\n(define (moves-row-left row [last #f] [i 0] [j -1])\n  (if (null? row) \n      null\n      (let ([head (first row)])\n        (cond [(zero? head) (moves-row-left (rest row) last (add1 i) j)]\n              [(equal? last head) \n               (cons (list head i j)\n                     (moves-row-left (rest row) #f (add1 i) j))]\n              [else (cons (list head i (add1 j))\n                          (moves-row-left (rest row) head (add1 i) (add1 j)))]))))\n\n;; Convert a row into the sparse representaiton without any sliding.\n;;\n;; E.g. (moves-row-none '(0 2 0 4)) -> '((2 1 1) (4 3 3))\n;;\n(define (moves-row-none row)\n  (for/list ([value row]\n             [i (in-naturals)]\n             #:when (nonzero? value))\n    (list value i i)))\n\n;; Reverse all moves so that:\n;;\n;; '(value initial final) -> '(value (- n initial 1) (- n final 1)\n;;\n(define (reverse-moves moves n)\n  (define (flip i) (- n i 1))\n  (map (\u03bb (m)\n         (match-define (list a b c) m)\n         (list a (flip b) (flip c)))\n       moves))\n\n(define (transpose-moves moves)\n  (for/list ([m moves])\n    (match-define (list v (list a b) (list c d)) m)\n    (list v (list b a) (list d c))))\n\n(define (moves-row-right row [n *side*])\n  (reverse-moves (moves-row-left (reverse row)) n))\n\n;;--------------------------------------------------------------------\n;; Lift the sparse representation for transitions\n;; up to two dimensions...\n;;\n;; '(value initial final) -> '(value (x initial) (x final))\n;;\n(define (add-row-coord i rows)\n  (for/list ([r rows])\n    (match-define (list a b c) r)\n    (list a (list i b) (list i c))))\n\n(define (transpose lsts)\n  (apply map list lsts))\n\n;; Slide the entire grid in the specified direction\n;;\n(define (left grid)\n  (map slide-left grid))\n\n(define (right grid)\n  (map slide-right grid))\n\n(define (up grid)\n  ((compose transpose left transpose) grid))\n\n(define (down grid)\n  ((compose transpose right transpose) grid))\n\n;; Calculate the change to score from sliding the grid left or right.\n;;\n(define (score-increment grid)\n  (apply + (map (\u03bb (row) \n                  (combine-total (filter nonzero? row)))\n                grid)))\n\n;; Slide the grid in the specified direction and \n;; determine the transitions of the tiles. \n;;\n;; We'll use these operations to animate the sliding of the tiles.\n;;\n(define (moves-grid-action grid action)\n  (let ([n (length (first grid))])\n    (apply append\n           (for/list ([row grid]\n                      [i (in-range n)])\n             (add-row-coord i (action row))))))\n\n(define (moves-grid-left grid)\n  (moves-grid-action grid moves-row-left))\n\n(define (moves-grid-right grid)\n  (moves-grid-action grid moves-row-right))\n\n(define (moves-grid-up grid)\n  ((compose transpose-moves moves-grid-left transpose) grid))\n\n(define (moves-grid-down grid)\n  ((compose transpose-moves moves-grid-right transpose) grid))\n\n;; Rotating the entire grid doesn't involve sliding.\n;; It's a convenience to allow the player to view the grid from a different\n;; orientation.\n(define (moves-grid-rotate grid)\n  (let ([n (length (first grid))])\n    (for/list ([item (moves-grid-action grid moves-row-none)])\n      (match-define (list v (list i j) _) item)\n      (list v (list i j) (list j (- n i 1))))))\n\n;; Chop a list into a list of sub-lists of length n. Used to move from\n;; a flat representation of the grid into a list of rows.\n;; \n;;\n(define (chop lst [n *side*])\n  (if (<= (length lst) n) \n      (list lst)\n      (cons (take lst n) (chop (drop lst n) n)))) \n\n;; The next few functions are used to determine where to place a new\n;; number in the grid...\n;;\n\n;; How many zeros in the current state?\n;;\n(define (count-zeros state)\n  (length (filter zero? state)))\n\n;; What is the absolute index of the nth zero in lst?\n;;\n;; E.g. (index-of-nth-zero '(0 2 0 4) 1 2)) 1) -> 2\n;;\n(define (index-of-nth-zero lst n)\n  (cond [(null? lst) #f]\n        [(zero? (first lst)) \n         (if (zero? n)\n             0\n             (add1 (index-of-nth-zero (rest lst) (sub1 n))))]\n        [else (add1 (index-of-nth-zero (rest lst) n))]))\n\n;; Place the nth zero in the lst with val.\n;;\n;; E.g. (replace-nth-zero '(0 2 0 4) 1 2)) -> '(0 2 2 4)\n;;\n(define (replace-nth-zero lst n val)\n  (let ([i (index-of-nth-zero lst n)])\n    (append (take lst i) (cons val (drop lst (add1 i))))))\n\n;; There's a 90% chance that a new tile will be a two; 10% a four.\n;;\n(define (new-tile)\n  (if (> (random) 0.9) 4 2))\n\n;; Create a random initial game-board with two non-zeros (2 or 4) \n;; and the rest 0s.\n;;\n;; E.g. '(0 0 0 0  \n;;        0 2 0 0  \n;;        2 0 0 0  \n;;        0 0 0 0)\n;;\n(define (initial-state [side *side*])\n  (shuffle (append (list (new-tile) (new-tile))\n                   (make-list (- (sqr side) 2) 0))))\n\n;; The game finishes when no matter which way you slide, the board doesn't\n;; change.\n;;\n(define (finished? state [n *side*])\n  (let ([grid (chop state n)])\n    (for/and ([op (list left right up down)])\n      (equal? grid (op grid)))))\n\n;;--------------------------------------------------------------------\n;; Graphics\n;;\n(define *text-size* 30)\n(define *max-text-width* 40)\n(define *tile-side* 50)\n(define *grid-spacing* 5)\n(define *grid-side* (+ (* *side* *tile-side*)\n                       (* (add1 *side*) *grid-spacing*)))\n\n;; Memoization - caching images takes the strain off the gc\n;;\n(define-syntax define-memoized\n  (syntax-rules ()\n    [(_ (f args ...) bodies ...)\n     (define f\n       (let ([results (make-hash)])\n         (lambda (args ...)\n           ((\u03bb vals\n              (when (not (hash-has-key? results vals))\n                (hash-set! results vals (begin bodies ...)))\n              (hash-ref results vals))\n            args ...))))]))\n\n;; Look-up the (i,j)th element in the flat representation.\n;;\n(define (square/ij state i j)\n  (list-ref state (+ (* *side* i) j)))\n\n;; Linear interpolation between a and b:\n;;\n;;   (interpolate 0.0 a b) -> a\n;;   (interpolate 1.0 a b) -> b\n;;\n(define (interpolate k a b)\n  (+ (* (- 1 k) a)\n     (* k b)))\n\n;; Key value lookup with default return - is there an out-of-the-box function\n;; for this?\n;;\n(define (lookup key lst default)\n  (let ([value (assoc key lst)])\n    (if value (second value) default)))\n\n\n;; Make a tile without a number on it in the appropriate color.\n;;\n(define (plain-tile n)\n  (square *tile-side* \n          'solid \n          (lookup n *tile-bg-colors* *default-tile-bg-color*)))\n\n;; Make text for a tile\n;;\n(define (tile-text n)\n  (let* ([t (text (lookup n *text* (number->string n))\n                  *text-size*\n                  (lookup n *tile-fg-colors* *default-tile-fg-color*))]\n         [side (max (image-width t) (image-height t))])\n    (scale (if (> side *max-text-width*) (/ *max-text-width* side) 1) t)))\n\n(define-memoized (make-tile n)\n  (overlay\n   (tile-text n)\n   (plain-tile n)))\n\n;; Place a tile on an image of the grid at (i,j)\n;;\n(define (place-tile/ij tile i j grid-image)\n  (define (pos k)\n    (+ (* (add1 k) *grid-spacing*)\n       (* k *tile-side*)))\n  (underlay/xy grid-image (pos j) (pos i) tile))\n\n;; Make an image of the grid from the flat representation\n;;\n(define *last-state* null) ; Cache the previous grid to avoid\n(define *last-grid* null)  ; senseless regeneration\n\n(define (state->image state)\n  (unless (equal? state *last-state*)\n    (set! *last-grid*\n          (for*/fold ([im (square *grid-side* 'solid *grid-color*)])\n            ([i (in-range *side*)]\n             [j (in-range *side*)])\n            (place-tile/ij (make-tile (square/ij state i j))\n                           i j\n                           im)))\n    (set! *last-state* state))\n  *last-grid*)\n\n(define *empty-grid-image*\n  (state->image (make-list (sqr *side*) 0)))\n\n;; Convert the sparse representation of moves into a single frame in an \n;; animation at time k, where k is between 0.0 (start state) and 1.0\n;; (final state).\n;;\n(define (moves->frame moves k)\n  (for*/fold ([grid *empty-grid-image*])\n    ([m moves])\n    (match-define (list value (list i1 j1) (list i2 j2)) m)\n    (place-tile/ij (make-tile value)\n                   (interpolate k i1 i2) (interpolate k j1 j2)\n                   grid)))\n\n;; Animation of simultaneously moving tiles.\n;;\n(define (animate-moving-tiles state op)\n  (let ([grid (chop state)])\n    (build-list 9 (\u03bb (i) \n                    (\u03bb () \n                      (moves->frame (op grid) \n                                    (* 0.1 (add1 i))))))))\n\n;; Animation of a tile appearing in a previously blank square.\n;;\n(define (animate-appearing-tile state value index)\n  (let ([start (state->image state)]\n        [tile (make-tile value)]\n        [i (quotient index *side*)]\n        [j (remainder index *side*)])\n    (build-list 4 (\u03bb (m) \n                    (\u03bb () \n                      (place-tile/ij (overlay \n                                      (scale (* 0.2 (add1 m)) tile)\n                                      (plain-tile 0))\n                                     i j\n                                     start))))))\n\n;;--------------------------------------------------------------\n;;\n;; The Game\n;;\n\n;; an image-procedure is a procedure of no arguments that produces an image\n\n;; a world contains:\n;; state is a\u00a0?\n;; score is a number\n;; winning-total is #f or a number, representing the final score <-- is this\n;;  necessary?\n;; frames is a (list-of image-procedure)\n;; start-time is a number, in seconds\n(define-struct world (state score winning-total frames start-time) #:transparent)\n\n;; The game is over when any animations have been finished and \n;; no more moves are possible.\n;;\n;; note that winning the game does *not* end the game.\n;;\n(define (game-over? w)\n  (match-define (world state score wt frames start-time) w)\n  (and (null? frames) ; Finish animations to reach final state and show the banner\n       (or (finished? state)\n           (out-of-time? (world-start-time w)))))\n\n;; Is the player out of time?\n(define (out-of-time? start-time)\n  (and *time-limit* (< (+ start-time *time-limit*) (current-seconds))))\n\n;; Given an arrow key return the operations to change the state and\n;; produce the sliding animation.\n;;\n(define (key->ops a-key)\n  (cond\n    [(key=? a-key \"left\")  (list left moves-grid-left)]\n    [(key=? a-key \"right\") (list right moves-grid-right)]\n    [(key=? a-key \"up\")    (list up moves-grid-up)]\n    [(key=? a-key \"down\")  (list down moves-grid-down)]\n    [else (list #f #f)]))\n\n;; Respond to a key-press\n;;\n(define (change w a-key)\n  (match-let ([(list op moves-op) (key->ops a-key)]\n              [(world st score wt frames start-time) w])\n    (cond [(out-of-time? start-time) w] ; Stop accepting key-presses \n          [op\n           (let* ([grid (chop st)]\n                  [slide-state (flatten (op grid))])\n             (if (equal? slide-state st)\n                 w                       ; sliding had no effect\n                 (let* ([replace (random (count-zeros slide-state))]\n                        [index (index-of-nth-zero slide-state replace)]\n                        [value (new-tile)]\n                        [new-state (replace-nth-zero slide-state replace value)]\n                        [horizontal? (member a-key (list \"left\" \"right\"))])\n                   (make-world new-state\n                               (+ score (score-increment \n                                         (if horizontal? grid (transpose grid))))\n                               (cond [wt wt]\n                                     [(won-game? new-state) \n                                      (apply + (flatten new-state))]\n                                     [else #f])\n                               (append frames\n                                       (animate-moving-tiles st moves-op)\n                                       (animate-appearing-tile slide-state value index))\n                               start-time))))]\n          [(key=? a-key \" \")             ; rotate the board\n           (make-world ((compose flatten transpose reverse) (chop st))\n                       score wt\n                       (append frames\n                               (animate-moving-tiles st moves-grid-rotate))\n                       start-time)] \n          [else w])))                    ; unrecognised key - no effect\n\n;; Are we there yet?\n;;\n(define (won-game? state)\n  (= (apply max state) *tile-that-wins*))\n\n;; Banner overlay text: e.g. You won! / Game Over, etc.\n;;\n(define (banner txt state [color 'black])\n  (let ([b-text (text txt 30 color)])\n    (overlay\n     b-text\n     (rectangle (* 1.2 (image-width b-text))\n                (* 1.4 (image-height b-text))\n                'solid 'white)\n     (state->image state))))\n\n;; Convert number of seconds to \"h:mm:ss\" or \"m:ss\" format\n;;\n(define (number->time-string s)\n  (define hrs (quotient s 3600))\n  (define mins (quotient (remainder s 3600) 60))\n  (define secs (remainder s 60))\n  (define (xx n)\n    (cond [(<= n 0) \"00\"]\n          [(<= n 9) (format \"0~a\" n)]\n          [else (remainder n 60)]))\n  (if (>= s 3600)\n      (format \"~a:~a:~a\" hrs (xx mins) (xx secs))\n      (format \"~a:~a\" mins (xx secs))))\n      \n(define (time-remaining start)\n  (+ *time-limit* start (- (current-seconds))))\n\n(define (time-elapsed start)\n  (- (current-seconds) start))\n\n;; Display the grid with score below.\n;;\n;; If there are frames, show the next one. Otherwise show the steady state.\n;;\n(define (show-world w)\n  (match-define (world state score wt frames start-time) w)\n  (let* ([board (if (null? frames)\n                    (cond [(finished? state) (banner \"Game over\" state)]\n                          [(out-of-time? start-time) (banner \"Out of Time\" state 'red)]\n                          \n                          ;; Q: Why wt (i.e. winning-total) rather than won-game? \n                          ;; A: wt allows the keen player to continue playing...\n                          [(equal? (apply + (flatten state)) wt) (banner \"You won!\" state)]\n                          [else (state->image state)])\n                    ((first frames)))]\n         [score-text (text (format \"Score: ~a\" score) 16 'dimgray)]\n         [seconds ((if *time-limit* time-remaining time-elapsed) start-time)]\n         [time-text (text (format \"Time: ~a\" \n                                  (number->time-string seconds)) \n                          16\n                          (cond [(or (> seconds *amber-alert*) (not *time-limit*)) 'gray]\n                                [(> seconds *red-alert*) 'orange] \n                                [else 'red]))])        \n    (scale *magnification*\n           (above\n            board\n            (rectangle 0 5 'solid 'white)\n            (beside\n             score-text\n             (rectangle (- (image-width board)\n                           (image-width score-text)\n                           (image-width time-text)) 0 'solid 'white)\n             time-text)))))\n\n;; Move to the next frame in the animation.\n;;\n(define (advance-frame w)\n  (match-define (world state score wt frames start-time) w)\n  (if (null? frames)\n      w\n      (make-world state score wt (rest frames) start-time)))\n\n;; Use this state to preview the appearance of all the tiles\n;;\n(define (all-tiles-state)\n  (let ([all-tiles '(0 2 4 8 16 32 64 128 256 512 1024 2048 4096)])\n    (append all-tiles (make-list (- (sqr *side*) (length all-tiles)) 0))))\n\n;; The event loop\n;;\n(define (start)\n  (big-bang (make-world (initial-state) \n                        ;(all-tiles-state) \n                        0 #f null (current-seconds))\n            (to-draw show-world)\n            (on-key change)\n            (on-tick advance-frame 0.01)\n            (stop-when game-over? show-world)\n            (name \"2048 - Racket edition\")))\n\n;; \n;; TESTS\n;;\n(module+ test\n  (set-side! 4)\n  \n  (check-equal? (slide-left '(0 0 0 0)) '(0 0 0 0))\n  (check-equal? (slide-left '(1 2 3 4)) '(1 2 3 4))\n  (check-equal? (slide-left '(2 0 4 0)) '(2 4 0 0))\n  (check-equal? (slide-left '(0 0 2 4)) '(2 4 0 0))\n  (check-equal? (slide-left '(2 0 2 0)) '(4 0 0 0))\n  (check-equal? (slide-left '(0 8 8 0)) '(16 0 0 0))\n  (check-equal? (slide-left '(4 4 8 8)) '(8 16 0 0))\n  (check-equal? (slide-right '(4 4 8 8)) '(0 0 8 16))\n  (check-equal? (slide-right '(4 4 4 0)) '(0 0 4 8))\n  \n  (check-equal? (moves-row-left '(0 0 0 0)) '())\n  (check-equal? (moves-row-left '(1 2 3 4)) \n                '((1 0 0)\n                  (2 1 1)\n                  (3 2 2)\n                  (4 3 3)))\n  \n  (check-equal? (moves-row-left '(2 0 4 0)) '((2 0 0)\n                                              (4 2 1)))\n  \n  (check-equal? (moves-row-right '(2 0 4 0)) '((4 2 3)\n                                               (2 0 2)))\n  \n  (check-equal? (moves-row-left '(0 0 2 4)) '((2 2 0)\n                                              (4 3 1)))\n  \n  (check-equal? (moves-row-left '(2 0 2 0)) '((2 0 0)\n                                              (2 2 0)))\n  \n  (check-equal? (moves-row-left '(2 2 2 0)) '((2 0 0)\n                                              (2 1 0)\n                                              (2 2 1)))\n  \n  (check-equal? (moves-row-right '(2 2 2 0)) '((2 2 3)\n                                               (2 1 3)\n                                               (2 0 2)))\n  \n  (check-equal? (moves-row-left '(2 2 4 4)) '((2 0 0)\n                                              (2 1 0)\n                                              (4 2 1)\n                                              (4 3 1)))\n  \n  (check-equal? (moves-row-right '(2 2 4 4)) '((4 3 3)\n                                               (4 2 3)\n                                               (2 1 2)\n                                               (2 0 2)))\n  \n  (check-equal? (add-row-coord 7 '((2 0 0)\n                                   (2 1 0)\n                                   (4 2 1)))\n                '((2 (7 0) (7 0))\n                  (2 (7 1) (7 0))\n                  (4 (7 2) (7 1))))\n  \n  (check-equal? (left '(( 0 8 8 0)\n                        (16 0 0 0)\n                        ( 2 2 4 4)\n                        ( 0 2 2 2)))\n                '((16 0 0 0)\n                  (16 0 0 0)\n                  ( 4 8 0 0)\n                  ( 4 2 0 0)))\n  (check-equal? (right '(( 0 8 8 0)\n                         (16 0 0 0)\n                         ( 2 2 4 4)\n                         ( 0 2 2 2)))\n                '((0 0 0 16)\n                  (0 0 0 16)\n                  (0 0 4  8)\n                  (0 0 2  4)))\n  (check-equal? (up '((0 16 2 0) \n                      (8  0 2 2) \n                      (8  0 4 2) \n                      (0  0 4 2)))\n                '((16 16 4 4) \n                  (0  0  8 2) \n                  (0  0  0 0) \n                  (0  0  0 0)))\n  (check-equal? (down '((0 16 2 0) \n                        (8  0 2 2) \n                        (8  0 4 2) \n                        (0  0 4 2)))\n                '((0  0  0 0) \n                  (0  0  0 0) \n                  (0  0  4 2) \n                  (16 16 8 4)))\n  \n  (check-equal? (left '(( 0 8 8 0)\n                        (16 0 0 0)\n                        ( 2 2 4 4)\n                        ( 0 2 2 2)))\n                '((16 0 0 0)\n                  (16 0 0 0)\n                  ( 4 8 0 0)\n                  ( 4 2 0 0)))\n  \n  (check-equal? (moves-grid-left '(( 0 8 8 0)\n                                   (16 0 0 0)\n                                   ( 2 2 4 4)\n                                   ( 0 2 2 2)))\n                '((8  (0 1) (0 0))\n                  (8  (0 2) (0 0))\n                  (16 (1 0) (1 0))\n                  (2  (2 0) (2 0))\n                  (2  (2 1) (2 0))\n                  (4  (2 2) (2 1))\n                  (4  (2 3) (2 1))\n                  (2  (3 1) (3 0))\n                  (2  (3 2) (3 0))\n                  (2  (3 3) (3 1))))\n  \n  (check-equal? (moves-grid-right '(( 0 8 8 0)\n                                    (16 0 0 0)\n                                    ( 2 2 4 4)\n                                    ( 0 2 2 2)))\n                '((8  (0 2) (0 3))\n                  (8  (0 1) (0 3))\n                  (16 (1 0) (1 3))\n                  (4  (2 3) (2 3))\n                  (4  (2 2) (2 3))\n                  (2  (2 1) (2 2))\n                  (2  (2 0) (2 2))\n                  (2  (3 3) (3 3))\n                  (2  (3 2) (3 3))\n                  (2  (3 1) (3 2))))\n  \n  \n  (check-equal? (moves-grid-up '(( 0 8 8 0)\n                                 (16 0 0 0)\n                                 ( 2 2 4 4)\n                                 ( 0 2 2 2)))\n                '((16 (1 0) (0 0))\n                  (2  (2 0) (1 0))\n                  (8  (0 1) (0 1))\n                  (2  (2 1) (1 1))\n                  (2  (3 1) (1 1))\n                  (8  (0 2) (0 2))\n                  (4  (2 2) (1 2))\n                  (2  (3 2) (2 2))\n                  (4  (2 3) (0 3))\n                  (2  (3 3) (1 3))))\n  \n  (check-equal? (moves-grid-down '(( 0 8 8 0)\n                                   (16 0 0 0)\n                                   ( 2 2 4 4)\n                                   ( 0 2 2 2)))\n                '((2  (2 0) (3 0))\n                  (16 (1 0) (2 0))\n                  (2  (3 1) (3 1))\n                  (2  (2 1) (3 1))\n                  (8  (0 1) (2 1))\n                  (2  (3 2) (3 2))\n                  (4  (2 2) (2 2))\n                  (8  (0 2) (1 2))\n                  (2  (3 3) (3 3))\n                  (4  (2 3) (2 3)))) \n  \n  (check-equal? (chop '(1 2 3 4 5 6 7 8) 4)\n                '((1 2 3 4) (5 6 7 8)))\n  \n  (check-equal? (length (initial-state 5)) 25)\n  \n  (let* ([initial (initial-state)]\n         [initial-sum (apply + initial)]\n         [largest-3 (take (sort initial >) 3)])\n    (check-equal? (length initial) 16)\n    (check-true (or (= initial-sum 4)\n                    (= initial-sum 6)\n                    (= initial-sum 8)))\n    (check-true (or (equal? largest-3  '(2 2 0))\n                    (equal? largest-3  '(4 2 0))\n                    (equal? largest-3  '(4 4 0)))))\n  \n  (check-equal? (count-zeros '(1 0 1 0 0 0 1)) 4)\n  (check-equal? (count-zeros '(1 1)) 0)\n  (check-equal? (replace-nth-zero '(0 0 0 1 2 0) 2 5)\n                '(0 0 5 1 2 0))\n  \n  (check-true (finished? '(1 2 3 4) 2))\n  (check-false (finished? '(2 2 3 4) 2)))\n\n(start)\n",
        "safe": true
    },
    {
        "filename": "2048_95.txt",
        "content": "use Term::termios;\n\nconstant $saved   = Term::termios.new(fd => 1).getattr;\nconstant $termios = Term::termios.new(fd => 1).getattr;\n# raw mode interferes with carriage returns, so\n# set flags needed to emulate it manually\n$termios.unset_iflags(<BRKINT ICRNL ISTRIP IXON>);\n$termios.unset_lflags(< ECHO ICANON IEXTEN ISIG>);\n$termios.setattr(:DRAIN);\n\n# reset terminal to original setting on exit\nEND { $saved.setattr(:NOW) }\n\nconstant n    = 4; # board size\nconstant cell = 6; # cell width\nconstant ansi = True; # color!\n\nmy @board = ( ['' xx n] xx n );\nmy $save  = '';\nmy $score = 0;\n\nconstant $top = join '\u2500' x cell, '\u250c', '\u252c' xx n-1, '\u2510';\nconstant $mid = join '\u2500' x cell, '\u251c', '\u253c' xx n-1, '\u2524';\nconstant $bot = join '\u2500' x cell, '\u2514', '\u2534' xx n-1, '\u2518';\n\nmy %dir = (\n   \"\\e[A\" => 'up',\n   \"\\e[B\" => 'down',\n   \"\\e[C\" => 'right',\n   \"\\e[D\" => 'left',\n);\n\nmy @ANSI = <0 1;97 1;93 1;92 1;96 1;91 1;95 1;94 1;30;47 1;43\n    1;42 1;46 1;41 1;45 1;44 1;33;43 1;33;42 1;33;41 1;33;44>;\n\nsub row (@row) { '\u2502' ~ (join '\u2502', @row\u00bb.&center) ~ '\u2502' }\n\nsub center ($s){\n    my $c   = cell - $s.chars;\n    my $pad = ' ' x ceiling($c/2);\n    my $tile = sprintf \"%{cell}s\", \"$s$pad\";\n    my $idx = $s\u00a0?? $s.log(2)\u00a0!! 0;\n    ansi\u00a0?? \"\\e[{@ANSI[$idx]}m$tile\\e[0m\"\u00a0!! $tile;\n}\n\nsub draw-board {\n    run('clear');\n    print qq:to/END/;\n\n\n\tPress direction arrows to move.\n\n\tPress q to quit.\n\n\t$top\n\t{ join \"\\n\\t$mid\\n\\t\", map { .&row }, @board }\n\t$bot\n\n\tScore: $score\n\nEND\n}\n\nsub squash (@c) {\n    my @t = grep { .chars }, @c;\n    map { combine(@t[$_], @t[$_+1]) if @t[$_] && @t[$_+1] == @t[$_] }, ^@t-1;\n    @t = grep { .chars }, @t;\n    @t.push: '' while @t < n;\n    @t;\n}\n\nsub combine ($v is rw, $w is rw) { $v += $w; $w = ''; $score += $v; }\n\nproto sub move (|) {*};\n\nmulti move('up') {\n    map { @board[*;$_] = squash @board[*;$_] }, ^n;\n}\n\nmulti move('down') {\n    map { @board[*;$_] = reverse squash reverse @board[*;$_] }, ^n;\n}\n\nmulti move('left') {\n    map { @board[$_] = squash @board[$_] }, ^n;\n}\n\nmulti move('right') {\n    map { @board[$_;*] = reverse squash reverse @board[$_] }, ^n;\n}\n\nsub another {\n    my @empties;\n    for @board.kv -> $r, @row {\n        @empties.push(($r, $_)) for @row.grep(:k, '');\n    }\n    my ( $x, $y ) = @empties.roll;\n    @board[$x; $y] = (flat 2 xx 9, 4).roll;\n}\n\nsub save () { join '|', flat @board\u00bb.list }\n\nloop {\n    another if $save ne save();\n    draw-board;\n    $save = save();\n\n    # Read up to 4 bytes from keyboard buffer.\n    # Page navigation keys are 3-4 bytes each.\n    # Specifically, arrow keys are 3.\n    my $key = $*IN.read(4).decode;\n\n    move %dir{$key} if so %dir{$key};\n    last if $key eq 'q'; # (q)uit\n}\n",
        "safe": true
    },
    {
        "filename": "2048_96.txt",
        "content": "\n\n\tPress direction arrows to move.\n\n\tPress q to quit. \n\n\t\u250c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u252c\u2500\u2500\u2500\u2500\u2500\u2500\u2510\n\t\u2502  4   \u2502  2   \u2502      \u2502      \u2502\n\t\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\t\u2502  16  \u2502  8   \u2502      \u2502      \u2502\n\t\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\t\u2502  64  \u2502  32  \u2502  16  \u2502      \u2502\n\t\u251c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u253c\u2500\u2500\u2500\u2500\u2500\u2500\u2524\n\t\u2502 128  \u2502 512  \u2502 128  \u2502  64  \u2502\n\t\u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2534\u2500\u2500\u2500\u2500\u2500\u2500\u2518\n\n\tScore: 6392\n",
        "safe": true
    },
    {
        "filename": "2048_97.txt",
        "content": "Red [Needs: 'View]\n\nrandom/seed now\nboard: random [2 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0]\n\n; ----------- move engine -----------\ntasse: function [b] [\n    forall b [while [b/1 = 0] [remove b]]\n    head append/dup b 0 4 - length? b\n]\nsomme: function [b] [\n    tasse b\n    repeat n 3 [\n        m: n + 1\n        if all [b/:n <> 0 b/:n = b/:m] [\n            poke b n b/:n * 2\n            poke b m 0\n        ]\n    ]\n    tasse b\n]\nreshape: function [b d][\n    res: copy []\n    switch d [\n        up    [repeat n 4 [extract/index/into b 4 n res] res]\n        down  [repeat n 4 [extract/index/into b 4 n res] reverse res]\n        left [res: copy b]\n        right  [res: reverse copy b]\n    ]\n]\nmov: function [b d][\n    b1: reshape b d\n    moved: copy []\n    foreach [x y z t] b1 [append moved somme reduce [x y z t]]\n    reshape moved d\n]\n\n; --------- GUI ---------\ncolors: [0 gray 2 snow 4 linen 8 brick 16 brown 32 sienna \n    64 water 128 teal 256 olive 512 khaki 1024 tanned 2028 wheat]\ntsize: 110x110\npadsize: 4x4\npadlen: 114\nmainsize: tsize * 4 + (padsize * 5)\ntfont: make font! [size: 30 color: black style: 'bold]\n\ndisplay: does [\n    foreach face lay/pane [\n        n: face/data\n        face/text: either board/:n = 0 [\"\"] [form board/:n]\n        face/color: reduce select colors board/:n\n    ]\n]\nlay: layout [\n    size mainsize\n    title \"2048 game\"\n    backdrop white\n    on-key [ \n        if find [up down left right] d: event/key [            \n            if board <> newboard: mov board d [\n                board: newboard\n                if find board 2048 [alert \"You win!\"]\n                until [\n                    pos: random 16\n                    0 = board/:pos\n                ]\n                poke board pos either 1 = random 10 [4] [2]\n                display\n                conds: reduce [not find board 0]\n                foreach d [up down left right] [\n                    append conds board = mov board d\n                ]\n                if all conds [alert \"You lose!\"]\n            ]\n        ]\n    ]\n    space padsize\n]\nrepeat n length? board [append lay/pane make face! [\n    type: 'base\n    offset: padsize + padlen * as-pair (n - 1 % 4) (n - 1 / 4)\n    size: tsize\n    color: reduce select colors board/:n\n    data: n\n    font: tfont\n]]\ndisplay\nview lay\n",
        "safe": true
    },
    {
        "filename": "2048_98.txt",
        "content": "/*REXX program lets a user play the  2048  game on an  NxN  grid  (default is 4x4 grid).*/\nparse arg N win seed .                           /*obtain optional arguments from the CL*/\nif   N=='' |   N==\",\"  then    N=     4          /*Not specified?  Then use the default.*/\nif win=='' | win==\",\"  then  win= 2**11          /* \"      \"         \"   \"   \"      \"   */\nif datatype(seed, 'W') then call random ,,seed   /*Specified?  Then use seed for RANDOM.*/\nL= length(win) + 2                               /*L:  used for displaying the grid #'s.*/\neye=copies(\"\u2500\", 8);  pad=left('', length(eye)+2) /*eye catchers; and perusable perusing.*/\nb= ' '                                           /*comfortable readable name for a blank*/\n@cls= 'CLS'                                      /*hardcoded command to clear the screen*/\nprompt= eye \"Please enter a direction  (Up, Down, Right, Left)       \u2500\u2500\u2500or\u2500\u2500\u2500    Quit:\"\nmove= 1;     moves= 0;      score= 0;      ok= 1 /*simulation that a move was performed.*/\n@.= b                                            /*define all grid elements to a blank. */\n     do  until any(win);  if ok  then call put;   ok= 1;   say;    call showGrid\n     say;  say prompt;   parse pull a x . 1 d 2 1 way xx   /*show prompt; obtain answer.*/\n     if datatype(a, 'U')     then @cls           /*if uppercase, then clear the screen. */\n     if a==''  then do;  ok= 0                   /*the user entered blank(s) or nothing.*/\n                         say copies(eye, 5)   'moves:'   moves    eye     \"score:\"   score\n                         iterate                 /* [\u2191]  display # of moves & the score.*/\n                    end\n     upper d a x                                 /*uppercase contents of three variables*/\n     if x\\==''               then call err  \"too many arguments entered: \"   xx\n     if abbrev('QUIT',a,1)   then do;  say;  say eye  \"quitting the game\".;  exit 1;   end\n     good=abbrev('UP',a,1) | abbrev(\"DOWN\",a,1) | abbrev('RIGHT',a,1) | abbrev(\"LEFT\",a,1)\n     if \\good                then call err  \"invalid direction: \"       way\n     if \\ok  then  iterate;       moves= moves + 1;                call mov\n     end   /*until*/\nsay\nsay translate(eye  \"Congrats!!  You've won the\"  win  'game!' eye,\"\u2550\",'\u2500')  \"score:\" score\nexit 0                                           /*stick a fork in it,  we're all done. */\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\n@:   procedure expose @.;  parse arg row,col;                return @.row.col\nany: arg ?; do r=1  for N; do c=1  for N;  if @.r.c==?  then return 1; end; end;  return 0\nerr: say;   say eye  '***error*** '   arg(1);       say;                  ok=0;   return\no_c: $=;  do k=1  for N; $=$ word(@.k.c .,1); end;  !=space(translate($,,.))==''; return $\no_r: $=;  do k=1  for N; $=$ word(@.r.k .,1); end;  !=space(translate($,,.))==''; return $\nput: if \\any(b) then call err ,\"game over, no more moves.\"; if move then call two; return\nrow: if r==0 | r>N  then return copies('\u2550', L);                    return center(@.r.c, L)\nten: if random(9)==4  then return 4;   return 2  /*10% of the time,  use 4 instead of 2.*/\ntwo:   do  until @.p.q==b;  p= random(1,N);  q= random(1,N);  end;   @.p.q= ten();  return\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nshowGrid:     do    r=0  for N+2;    _= '\u2551';                 __= \"\u2560\"\n                 do c=1  for N;      _= _  ||  row()'\u2551';     __= __  ||  copies(\"\u2550\", L)'\u256c'\n                 end   /*c*/\n              if r==0  then _= '\u2554'translate( substr(_, 2, length(_) - 2),  \"\u2566\",  '\u2551')\"\u2557\"\n              if r >N  then _= '\u255a'translate( substr(_, 2, length(_) - 2),  \"\u2569\",  '\u2551')\"\u255d\"\n                                 say pad _\n              if r<N & r>0  then say pad substr(__, 1, length(__) - 1)\"\u2563\"\n              end      /*r*/;        return\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nmov: move= 0;    if d=='R'  then call moveLR N, 1, -1    /*move (slide) numbers    \u25ba    */\n                 if d=='L'  then call moveLR 1, N, +1    /*  \"     \"       \"       \u25c4    */\n                 if d=='U'  then call moveUD 1, N, +1    /*  \"     \"       \"       \u2191    */\n                 if d=='D'  then call moveUD N, 1, -1    /*  \"     \"       \"       \u2193    */\n     if \\move  then call err 'moving '    way    \" doesn't change anything.\";       return\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nmoveLR: parse arg start, sTo, #                                   /*slide   \u25c4   or   \u25ba  */\n          do   r=1  for N;    old= o_r();      if !  then iterate /*is this row blank?  */\n            do N-1;           call packLR                         /*pack    \u25c4  or   \u25ba   */\n            end        /*N-1*/                                    /* [\u2193]  get new tiles.*/\n          new= o_r();              move= move | (old\\==new)       /*indicate tiles moved*/\n              do c=start  for N-1  by #  while @.r.c\\==b          /*slide   \u25c4  or   \u25ba   */\n              if @.r.c\\==@(r,c+#)  then iterate                   /*not a duplicate\u00a0?   */\n              @.r.c= @.r.c * 2;    score= score + @.r.c           /*double;  bump score */\n              c= c + #        ;    @.r.c= b;         move= 1      /*bump C; blank dup 2.*/\n              end      /*c*/                                      /* [\u2191]  indicate move.*/\n          call packLR                                             /*pack    \u25c4  or    \u25ba  */\n          end          /*r*/;                        return\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nmoveUD: parse arg start, Sto, #                                   /*slide   \u2191   or   \u2193  */\n          do   c=1  for N;    old= o_c();      if !  then iterate /*is this col blank?  */\n            do N-1;           call packUD                         /*pack  up or down.   */\n            end        /*N-1*/                                    /* [\u2193]  get new tiles.*/\n          new= o_c();              move= move | (old\\==new)       /*indicate tiles moved*/\n              do r=start  for N-1  by #  while @.r.c\\==b          /*slide   \u2191   or   \u2193  */\n              if @.r.c\\==@(r+#,c)  then iterate                   /*not a duplicate\u00a0?   */\n              @.r.c= @.r.c * 2;    score= score + @.r.c           /*double;  bump score */\n              r= r + #        ;    @.r.c= b;         move= 1      /*bump R; blank dup 2.*/\n              end      /*r*/                                      /* [\u2191]  indicate move.*/\n          call packUD                                             /*pack    \u2191   or   \u2193  */\n          end          /*c*/;                        return\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\npackLR:   do c=start  for N-1  by #;   if @.r.c\\==b  then iterate /*Not a blank?  Skip. */\n             do s=c  to sTo  by #;     @.r.s= @(r, s + #)         /*slide   \u25c4   or   \u25ba  */\n             end   /*s*/;              @.r.sTo= b                 /*handle the last one.*/\n          end      /*c*/;                            return\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\npackUD:   do r=start  for N-1  by #;   if @.r.c\\==b  then iterate /*Not a blank?  Skip. */\n             do s=r  to sTo  by #;     @.s.c= @(s + #, c)         /*slide   \u2191   or   \u2193  */\n             end   /*s*/;              @.sTo.c= b                 /*handle the last one.*/\n          end      /*r*/;                            return\n",
        "safe": true
    },
    {
        "filename": "2048_99.txt",
        "content": "           \u2554\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2557\n           \u2551      \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551  2   \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551      \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551      \u2551      \u2551      \u2551      \u2551\n           \u255a\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u255d\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a direction  (Up, Down, Right, Left)       \u2500\u2500\u2500or\u2500\u2500\u2500    Quit:\nright                                         \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input\n\n           \u2554\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2557\n           \u2551      \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551      \u2551      \u2551      \u2551  2   \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551      \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551      \u2551      \u2551      \u2551  2   \u2551\n           \u255a\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u255d\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a direction  (Up, Down, Right, Left)       \u2500\u2500\u2500or\u2500\u2500\u2500    Quit:\nup                                            \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input\n\n           \u2554\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2557\n           \u2551      \u2551      \u2551      \u2551  4   \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551      \u2551      \u2551      \u2551  2   \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551      \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551      \u2551      \u2551      \u2551      \u2551\n           \u255a\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u255d\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a direction  (Up, Down, Right, Left)       \u2500\u2500\u2500or\u2500\u2500\u2500    Quit:\n                                              \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input (a blank)\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 moves: 2 \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 score: 4\n\n           \u2554\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2557\n           \u2551      \u2551      \u2551      \u2551  4   \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551      \u2551      \u2551      \u2551  2   \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551      \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551      \u2551      \u2551      \u2551      \u2551\n           \u255a\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u255d\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a direction  (Up, Down, Right, Left)       \u2500\u2500\u2500or\u2500\u2500\u2500    Quit:\nleft                                          \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input \n\n           \u2554\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2557\n           \u2551  4   \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551  2   \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551      \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551      \u2551      \u2551      \u2551  2   \u2551\n           \u255a\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u255d\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a direction  (Up, Down, Right, Left)       \u2500\u2500\u2500or\u2500\u2500\u2500    Quit:\nl                                             \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input\n\n           \u2554\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2557\n           \u2551  4   \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551  2   \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551      \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551  2   \u2551  4   \u2551      \u2551      \u2551\n           \u255a\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u255d\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a direction  (Up, Down, Right, Left)       \u2500\u2500\u2500or\u2500\u2500\u2500    Quit:\ndow                                           \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input\n\n           \u2554\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2557\n           \u2551      \u2551      \u2551      \u2551  2   \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551      \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551  4   \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551  4   \u2551  4   \u2551      \u2551      \u2551\n           \u255a\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u255d\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a direction  (Up, Down, Right, Left)       \u2500\u2500\u2500or\u2500\u2500\u2500    Quit:\nleft                                          \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input\n\n           \u2554\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2557\n           \u2551  2   \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551      \u2551      \u2551      \u2551  2   \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551  4   \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551  8   \u2551      \u2551      \u2551      \u2551\n           \u255a\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u255d\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a direction  (Up, Down, Right, Left)       \u2500\u2500\u2500or\u2500\u2500\u2500    Quit:\nlef                                           \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input\n\n           \u2554\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2557\n           \u2551  2   \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551  2   \u2551      \u2551      \u2551  2   \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551  4   \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551  8   \u2551      \u2551      \u2551      \u2551\n           \u255a\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u255d\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a direction  (Up, Down, Right, Left)       \u2500\u2500\u2500or\u2500\u2500\u2500    Quit:\nd                                             \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input\n\n           \u2554\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2557\n           \u2551      \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551  4   \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551  4   \u2551      \u2551      \u2551  2   \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551  8   \u2551      \u2551      \u2551  2   \u2551\n           \u255a\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u255d\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a direction  (Up, Down, Right, Left)       \u2500\u2500\u2500or\u2500\u2500\u2500    Quit:\nd                                             \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input \n\n           \u2554\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2557\n           \u2551      \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551      \u2551  2   \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551  8   \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551  8   \u2551      \u2551      \u2551  4   \u2551\n           \u255a\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u255d\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a direction  (Up, Down, Right, Left)       \u2500\u2500\u2500or\u2500\u2500\u2500    Quit:\n                                              \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input (a blank)\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 moves: 9 \u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 score: 32\n\n           \u2554\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2566\u2550\u2550\u2550\u2550\u2550\u2550\u2557\n           \u2551      \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551      \u2551  2   \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551  8   \u2551      \u2551      \u2551      \u2551\n           \u2560\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u256c\u2550\u2550\u2550\u2550\u2550\u2550\u2563\n           \u2551  8   \u2551      \u2551      \u2551  4   \u2551\n           \u255a\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u2569\u2550\u2550\u2550\u2550\u2550\u2550\u255d\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a direction  (Up, Down, Right, Left)       \u2500\u2500\u2500or\u2500\u2500\u2500    Quit:\nq                                             \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 quitting the game\n",
        "safe": true
    },
    {
        "filename": "21 game_1.txt",
        "content": "F select_count(game_count)\n   \u2018selects a random number if the game_count is less than 18. otherwise chooses the winning number\u2019\n   Int t\n   I game_count < 18\n      t = random:(1..3)\n   E\n      t = 21 - game_count\n   print(\u2018The computer chooses #.\u2019.format(t))\n   R t\n\nF request_count()\n   \u2018request user input between 1,2 and 3. It will continue till either quit(q) or one of those numbers is requested.\u2019\n   V t = \u2018\u2019\n   L\n      X.try\n         t = input(\u2018Your choice 1 to 3\u00a0:\u2019)\n         I Int(t) C [1, 2, 3]\n            R Int(t)\n         E\n            print(\u2018Out of range, try again\u2019)\n      X.catch\n         I t == \u2018q\u2019\n            R 0\n         E\n            print(\u2018Invalid Entry, try again\u2019)\n\nF start()\n   V game_count = 0\n   print(\"Enter q to quit at any time.\\nThe computer will choose first.\\nRunning total is now #.\".format(game_count))\n   V roundno = 1\n   L\n      print(\"\\nROUND #.: \\n\".format(roundno))\n      V t = select_count(game_count)\n      game_count = game_count + t\n      print(\"Running total is now #.\\n\".format(game_count))\n      I game_count >= 21\n         print(\u2018So, commiserations, the computer has won!\u2019)\n         R 0\n      t = request_count()\n      I t == 0\n         print(\u2018OK,quitting the game\u2019)\n         R -1\n      game_count = game_count + t\n      print(\"Running total is now #.\\n\".format(game_count))\n      I game_count >= 21\n         print(\u2018So, congratulations, you've won!\u2019)\n         R 1\n      roundno++\n\nV c = 0\nV m = 0\nL\n   V o = start()\n   I o == -1\n      L.break\n   E\n      c += I o == 0 {1} E 0\n      m += I o == 1 {1} E 0\n   print(\u2018Computer wins #. game, human wins #. games\u2019.format(c, m))\n   V t = input(\u2018Another game?(press y to continue):\u2019)\n   I t\u00a0!= \u2018y\u2019\n      L.break",
        "safe": true
    },
    {
        "filename": "21 game_10.txt",
        "content": "#  Game 21 - an example in AWK language for Rosseta Code.\n\nBEGIN {\n    srand();\n    GOAL = 21;\n    best[0] = 1; best[1] = 1; best[2] = 3; best[3] = 2;\n\n    print\\\n        \"21 Game                                                          \\n\"\\\n        \"                                                                 \\n\"\\\n        \"21 is a two player game, the game is played by choosing a number \\n\"\\\n        \"(1, 2, or 3) to be added to the running total. The game is won by\\n\"\\\n        \"the player whose chosen number causes the running total to reach \\n\"\\\n        \"exactly 21. The running total starts at zero.                    \\n\\n\";\n\n    newgame();\n    prompt();\n\n}\n\n/[123]/ {\n    move = strtonum($0);\n    if (move + total <= GOAL) {\n        update(\"human\", strtonum($0));\n        update(\"ai\", best[total % 4]);\n    }\n    else\n        invalid();\n    prompt();\n}\n/[^123]/ {\n    if ($0 == \"quit\") {\n        print \"goodbye\";\n        exit;\n    }\n    else {\n        invalid();\n        prompt();\n    }\n}\n\nfunction prompt(){\n    print \"enter your choice (or type quit to exit): \";\n}\n\nfunction invalid(){\n    print \"invalid move\";\n}\n\nfunction newgame() {\n    print \"\\n---- NEW GAME ----\\n\";\n    print \"\\nThe running total is currently zero.\\n\";\n    total = 0;\n    if (rand() < 0.5) {\n        print \"The first move is AI move.\\n\";\n        update(\"ai\", best[total % 4]);\n    }\n    else\n        print \"The first move is human move.\\n\";\n}\n\nfunction update(player, move) {\n    printf \"%8s:  %d = %d + %d\\n\\n\", player, total + move, total, move;\n    total += move;\n    if (total == GOAL) {\n        printf \"The winner is %s.\\n\\n\", player;\n        newgame();\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "21 game_11.txt",
        "content": "gawk -f Game21.awk\n21 Game\n\n21 is a two player game, the game is played by choosing a number\n(1, 2, or 3) to be added to the running total. The game is won by\nthe player whose chosen number causes the running total to reach\nexactly 21. The running total starts at zero.\n\n\n\n---- NEW GAME ----\n\n\nThe running total is currently zero.\n\nThe first move is human move.\n\nenter your choice (or type quit to exit):\n1\n   human:  1 = 0 + 1\n\n      ai:  2 = 1 + 1\n\nenter your choice (or type quit to exit):\n2\n   human:  4 = 2 + 2\n\n      ai:  5 = 4 + 1\n\nenter your choice (or type quit to exit):\n3\n   human:  8 = 5 + 3\n\n      ai:  9 = 8 + 1\n\nenter your choice (or type quit to exit):\n1\n   human:  10 = 9 + 1\n\n      ai:  13 = 10 + 3\n\nenter your choice (or type quit to exit):\n2\n   human:  15 = 13 + 2\n\n      ai:  17 = 15 + 2\n\nenter your choice (or type quit to exit):\n1\n   human:  18 = 17 + 1\n\n      ai:  21 = 18 + 3\n\nThe winner is ai.\n\n\n---- NEW GAME ----\n\n\nThe running total is currently zero.\n\nThe first move is human move.\n\nenter your choice (or type quit to exit):\nwow\ninvalid move\n222\ninvalid move\nenter your choice (or type quit to exit):\n1\n   human:  1 = 0 + 1\n\n      ai:  2 = 1 + 1\n\nenter your choice (or type quit to exit):\nquit\ngoodbye",
        "safe": true
    },
    {
        "filename": "21 game_12.txt",
        "content": "PLAYER = 1\nCOMP   = 0\n\nsum = 0\ntotal = 0\nturn = int(rand + 0.5)\ndim precomp = {1, 1, 3, 2}\n\nwhile sum < 21\n    turn = 1 - turn\n    print \"The sum is \"; sum\n    if turn = PLAYER then\n        print \"It is your turn.\"\n        while total < 1 or total > 3 or total + sum > 21\n            input \"How many would you like to total? \", total\n        end while\n    else\n        print \"It is the computer's turn.\"\n        total = precomp[sum mod 4]\n        print \"The computer totals \", total, \".\"\n    end if\n    print\n    sum += total\n    total = 0\nend while\n\nif turn = PLAYER then\n    print \"Congratulations. You win.\"\nelse\n    print \"Bad luck. The computer wins.\"\nend if\n",
        "safe": true
    },
    {
        "filename": "21 game_13.txt",
        "content": "100 rem 21 game\n110 rem for rosetta code\n120 '\n130 rem initialization\n140 l$ = chr$(157) : rem left cursor\n150 dim p$(2),hc(2),ca(4) : hc(1) = 0 : hc(2) = 0 : rem players\n160 ca(0) = 1 : ca(1) = 1 : ca(2) = 3 : ca(3) = 2 : rem computer answers\n170 dim cn$(6) : for i = 1 to 6 : read cn$(i) : next i : rem computer names\n180 def fnm(X)=(X-(INT(X/4))*4):REM modulo function\n190 '\n200 rem optionally set screen colors here\n210 cls\n220 print \"                21 GAME\"\n230 print : print \" The goal of this game is to take turns\"\n240 print \" adding the value of either 1, 2, or 3\"\n250 print \" to a running total. The first player\"\n260 print \" to bring the total to 21...\"\n270 print : print \"          ... WINS THE GAME!\"\n280 print : gosub 1110\n290 for p = 1 to 2\n300 '\n310  rem game setup and get players\n320  for p = 1 to 2\n330   print : print \"Player \";p;l$;\", [H]uman or [C]omputer? \";\n340   k$ = inkey$ : if k$ <> \"c\" and k$ <> \"h\" then 340\n350   print k$ : hc(p) = (k$ = \"c\")\n360   print : print \"Player\";p;l$ \",\" : print \"Enter your name\"; : if hc(p) then goto 400\n370   input p$(p)\n380  next p\n390  goto 420\n400  gosub 1340 : print \"? \";p$(p)\n410 next p\n420 print\n430 for p = 1 to 2 : print p;l$;\". \";p$(p) : next p\n440 print : print \"Is this correct (y/n)? \";\n450 k$ = inkey$ : if k$ <> \"y\" and k$ <> \"n\" then 450\n460 print k$ : if k$ = \"n\" then goto 290\n470 print : print \"Who will play first (1 or 2)? \";\n480 k$ = inkey$ : if k$ < \"1\" or k$ > \"2\" then 480\n490 fp = asc(k$)-48 : print k$ : print\n500 print \"Okay, \";p$(fp);\" will play first.\" : print : gosub 1110\n510 cls\n520 '\n530 rem start main game loop\n540 pi = fp : rt = 0\n550 print \"Total so far:\";rt\n560 print : print p$(pi);\"'s turn.\"\n570 if hc(pi) then gosub 1240\n580 if not hc(pi) then gosub 1170\n590 rt = rt+ad\n600 if rt = 21 then goto 680\n610 if rt > 21 then print : print p$(pi);\" loses by going over 21!!\" : goto 700\n620 pi = pi+1 : if pi > 2 then pi = 1\n630 goto 550\n640 print : print \"          ... WINS THE GAME!\"\n650 print : gosub 1110\n660 '\n670 for p = 1 to 2\n680  rem winner winner chicken dinner\n690  print : print \"21! \";p$(pi);\" wins the game!!!\"\n700  print : print \"Would you like to play again? \";\n710  k$ = inkey$ : if k$ <> \"n\" and k$ <> \"y\" then 710\n720  print k$\n730  if k$ = \"n\" then print : print \"Okay, maybe another time. Bye!\" : end\n740  goto 200\n750  print k$ : hc(p) = (k$ = \"c\")\n760  print : print \"Player\";p;l$ \",\" : print \"Enter your name\"; : if hc(p) then goto 800\n770  input p$(p)\n780 next p\n790 goto 820\n800 gosub 1340 : print \"? \";p$(p)\n810 next p\n820 print : for p = 1 to 2 : print p;l$;\". \";p$(p) : next p\n830 print : print \"Is this correct (y/n)? \";\n840 k$ = inkey$ : if k$ <> \"y\" and k$ <> \"n\" then 840\n850 print k$ : if k$ = \"n\" then goto 660\n860 print : print \"Who will play first (1 or 2)? \";\n870 k$ = inkey$ : if k$ < \"1\" or k$ > \"2\" then 870\n880 fp = asc(k$)-48 : print k$ : print\n890 print \"Okay, \";p$(fp);\" will play first.\" : print : gosub 1110\n900 '\n910 rem start main game loop\n920 pi = fp : rt = 0\n930 print chr$(147);\"Total so far: \";rt\n940 print : print p$(pi);\"'s turn.\"\n950 if hc(pi) then gosub 1240\n960 if not hc(pi) then gosub 1170\n970 rt = rt+ad\n980 if rt = 21 then goto 1030\n990 if rt > 21 then print : print p$(pi);\" loses by going over 21!!\" : goto 1050\n1000 pi = pi+1 : if pi > 2 then pi = 1\n1010 goto 930\n1020 '\n1030 rem winner winner chicken dinner\n1040 print : print \"21! \";p$(pi);\" wins the game!!!\"\n1050 print : print \"Would you like to play again? \";\n1060 k$ = inkey$ : if k$ <> \"n\" and k$ <> \"y\" then 1060\n1070 print k$\n1080 if k$ = \"n\" then print : print \"Okay, maybe another time. Bye!\" : end\n1090 goto 490\n1100 '\n1110 rem pause for keypress\n1120 z$ = \" Press a key to continue. \"\n1130 print z$\n1140 k$ = inkey$ : if k$ = \"\" then 1140\n1150 return\n1160 '\n1170 rem human player move\n1180 print : print \"How much to add,\"\n1190 print \"1, 2, or 3 (0 to quit)\"; : input ad\n1200 if ad < 0 or ad > 3 then print : print \"Illegal amount. Try again.\" : goto 1180\n1210 if ad = 0 then print : print \"Game was ended by \";p$(pi);\".\" : end\n1220 return\n1230 '\n1240 rem computer player move\n1250 print : print \"Thinking...\";\n1260 tt = int(rnd(1)*10)\n1270 for t = 1 to tt : print \".\"; : for i = 1 to 250 : next i : next t : print\n1280 rm = fn m(rt)\n1290 ad = ca(rm)\n1300 print : print p$(pi);\" adds \";ca(rm);l$;\".\"\n1310 for t = 1 to 1000 : next t\n1320 return\n1330 '\n1340 rem pick a computer name\n1350 pn = int(rnd(1)*6)+1 : t$ = cn$(pn)\n1360 if t$ = p$(p-1) then goto 1350\n1370 p$(p) = t$\n1380 return\n1390 '\n1400 rem some computer names to pick from\n1410 data \"Commodore 64\",\"VIC-20\",\"Commodore 128\"\n1420 data \"PET\",\"Plus/4\",\"Commodore 16\"\n",
        "safe": true
    },
    {
        "filename": "21 game_14.txt",
        "content": "100 PROGRAM \"21Game.bas\"\n110 RANDOMIZE \n120 LET SUM,ADD=0\n130 LET TURN=RND(2)-1\n140 CLEAR SCREEN\n150 PRINT \"21 is a two player game, the game is played by choosing a number (1, 2, or 3) to be added to the running total. The game is won by the player whose chosen number causes the running total to reach exactly 21.\"\n160 PRINT \"The running total starts at zero. One player will be the computer.\":PRINT \n170 DO \n180   LET TURN=NOT TURN\n190   SET #102:INK 3:PRINT \"The sum is\";SUM:SET #102:INK 1\n200   IF TURN THEN\n210     PRINT \"It is your turn.\":PRINT \"How many would you like to add? (1-3): \";\n220     LET ADD=READKEY\n230     IF ADD>21-SUM THEN PRINT \"You can only add\";21-SUM\n240   ELSE \n250     LET ADD=4-MOD(SUM-1,4)\n260     IF ADD=4 THEN LET ADD=RND(3)+1\n270     PRINT \"It is the computer's turn.\":PRINT \"The computer adds\";ADD\n280   END IF \n290   PRINT :LET SUM=SUM+ADD\n300 LOOP WHILE SUM<21\n310 IF TURN THEN\n320   PRINT \"Congratulations. You win.\"\n330 ELSE \n340   PRINT \"Bad luck. The computer wins.\"\n350 END IF \n360 END \n370 DEF READKEY\n380   DO \n390     LET T$=INKEY$\n400   LOOP WHILE T$>\"3\" OR T$<\"1\"\n410   PRINT T$:LET READKEY=VAL(T$)\n420 END DEF",
        "safe": true
    },
    {
        "filename": "21 game_15.txt",
        "content": "If OpenConsole()\n  PLAYER.i = 1\n  COMP.i   = 0\n  \n  sum.i = 0\n  total.i = 0\n  turn.i = Random(1) + 0.5\n  Dim precomp.i(3)\n  precomp(0) = 1 \n  precomp(1) = 1\n  precomp(2) = 3\n  precomp(3) = 2\n  \n  While sum < 21\n    turn = 1 - turn\n    PrintN(\"The sum is \" + Str(sum))\n    If turn = PLAYER\n      PrintN(\"It is your turn.\")\n      While total < 1 Or total > 3 Or total + sum > 21\n        Print(\"How many would you like to total? \")\n        total = Val(Input())\n      Wend\n    Else\n      PrintN(\"It is the computer's turn.\")\n      total = precomp(sum % 4)\n      PrintN(\"The computer totals \" + Str(total) + \".\")\n    EndIf\n    PrintN(\"\")\n    sum + total\n    total = 0\n  Wend\n  \n  If turn = PLAYER\n    PrintN(\"Congratulations. You win.\")\n  Else\n    PrintN(\"Bad luck. The computer wins.\")\n  EndIf\n  \n  Input()\nEndIf\n",
        "safe": true
    },
    {
        "filename": "21 game_16.txt",
        "content": "PLAYER = 1\nCOMP   = 0\nRANDOMIZE TIMER\n\nsum = 0\ntotal = 0\nturn = INT(RND + 0.5)\nDIM precomp(0 TO 3)\nprecomp(0) = 1 : precomp(1) = 1\nprecomp(2) = 3 : precomp(3) = 2\n\nWHILE sum < 21\n    turn = 1 - turn\n    PRINT \"The sum is \"; sum\n    IF turn = PLAYER THEN\n        PRINT \"It is your turn.\"\n        WHILE total < 1 OR total > 3 OR total + sum > 21\n            INPUT \"How many would you like to total? \", total\n        WEND\n    ELSE\n        PRINT \"It is the computer's turn.\"\n        total = precomp(sum MOD 4)\n        PRINT \"The computer totals\"; total; \".\"\n    END IF\n    PRINT\n    sum = sum + total\n    total = 0\nWEND\n\nIF turn = PLAYER THEN\n    PRINT \"Congratulations. You win.\"\nELSE\n    PRINT \"Bad luck. The computer wins.\"\nEND IF\n",
        "safe": true
    },
    {
        "filename": "21 game_17.txt",
        "content": "LET player = 1\nLET comp = 0\nRANDOMIZE\nLET sum = 0\nLET total = 0\nLET turn = INT(RND+0.5)\nDIM precomp(0 TO 3)\nLET precomp(0) = 1\nLET precomp(1) = 1\nLET precomp(2) = 3\nLET precomp(3) = 2\nDO WHILE sum < 21\n   LET turn = 1-turn\n   PRINT \"The sum is \"; sum\n   IF turn = player THEN\n      PRINT \"It is your turn.\"\n      DO WHILE total < 1 OR total > 3 OR total+sum > 21\n         INPUT prompt \"How many would you like to total? \": total\n      LOOP\n   ELSE\n      PRINT \"It is the computer's turn.\"\n      LET total = precomp(remainder(round(sum),4))\n      PRINT USING \"The computer totals #.\": total\n   END IF\n   PRINT\n   LET sum = sum+total\n   LET total = 0\nLOOP\nIF turn = player THEN PRINT \"Congratulations. You win.\" ELSE PRINT \"Bad luck. The computer wins.\"\nEND\n",
        "safe": true
    },
    {
        "filename": "21 game_18.txt",
        "content": "If OpenConsole()\n  PLAYER.i = 1\n  COMP.i   = 0\n  \n  sum.i = 0\n  total.i = 0\n  turn.i = Random(1) + 0.5\n  Dim precomp.i(3)\n  precomp(0) = 1 \n  precomp(1) = 1\n  precomp(2) = 3\n  precomp(3) = 2\n  \n  While sum < 21\n    turn = 1 - turn\n    PrintN(\"The sum is \" + Str(sum))\n    If turn = PLAYER\n      PrintN(\"It is your turn.\")\n      While total < 1 Or total > 3 Or total + sum > 21\n        Print(\"How many would you like to total? \")\n        total = Val(Input())\n      Wend\n    Else\n      PrintN(\"It is the computer's turn.\")\n      total = precomp(sum % 4)\n      PrintN(\"The computer totals \" + Str(total) + \".\")\n    EndIf\n    PrintN(\"\")\n    sum + total\n    total = 0\n  Wend\n  \n  If turn = PLAYER\n    PrintN(\"Congratulations. You win.\")\n  Else\n    PrintN(\"Bad luck. The computer wins.\")\n  EndIf\n  \n  Input()\nEndIf\n",
        "safe": true
    },
    {
        "filename": "21 game_19.txt",
        "content": "PLAYER = 1\nCOMP   = 0\n\nsum = 0 \ntotal = 0\nturn = int(ran() + 0.5)\ndim precomp(3)\nprecomp(0) = 1 : precomp(1) = 1\nprecomp(2) = 3 : precomp(3) = 2\n\nwhile sum < 21\n    turn = 1 - turn\n    print \"The sum is \", sum\n    if turn = PLAYER then\n        print \"It is your turn.\"\n        while total < 1 or total > 3 or total + sum > 21\n            input \"How many would you like to total? \" total\n        wend\n    else\n        print \"It is the computer's turn.\"\n        total = precomp(mod(sum, 4))\n        print \"The computer totals \", total, \".\"\n    fi\n    print\n    sum = sum + total\n    total = 0\nwend\n\nif turn = PLAYER then\n    print \"Congratulations. You win.\"\nelse\n    print \"Bad luck. The computer wins.\"\nfi\n",
        "safe": true
    },
    {
        "filename": "21 game_2.txt",
        "content": "/* ARM assembly AARCH64 Raspberry PI 3B */\n/*  program game21_64.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 HITTOTAL,   21\n.equ BUFFERSIZE, 10\n\n\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nszMessRules:         .ascii \"21 Game\\n\"\n                    .ascii \"21 is a two player game, the game is played by choosing a number \\n\"\n                    .ascii \"(1, 2, or 3) to be added to the running total. The game is won by\\n\"\n                    .ascii \"the player whose chosen number causes the running total to reach \\n\"\n                    .asciz \"exactly 21. The running total starts at zero.\\n\\n\\n\"\n\nszMessHumanChoice:  .asciz \"Enter your choice (1,2, 3 or type (q)uit to exit): \"\nszMessErrChoise:    .asciz \"invalid choice.\\n  \"\nszMessHumanBegin:   .asciz \"The first move is human move.\\n\"\nszMessPiBegin:      .asciz \"The first move is Raspberry pi. \\n\"\nszMessHumanWon:     .asciz \"You won. \\n\"\nszMessHumanLost:    .asciz \"You lost. \\n\"\nszMessTotal:        .asciz \"The running total is @ \\n\"\nszMessPiChoice:     .asciz \"Raspberry choice is  @ \\n\" \nszMessNewGame:      .asciz \"New game (y/n)\u00a0? \\n\"\nszCarriageReturn:   .asciz \"\\n\"\n.align 4\nqGraine:  .quad 123456\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\nsZoneConv:        .skip 24\nsBuffer:          .skip BUFFERSIZE\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                 // entry of program \n    \n    ldr x0,qAdrszMessRules\n    bl affichageMess\n1:\n    mov x10,#0                         // total = 0\n    mov x0,#100\n    bl genereraleas \n    cmp x0,#50\n    blt 2f\n    ldr x0,qAdrszMessHumanBegin        // human begin\n    bl affichageMess\n    b 4f\n2:                                     // Rasp begin\n    ldr x0,qAdrszMessPiBegin\n    bl affichageMess\n    mov x0,#1\n3:                                    // rasp turn\n    add x10,x10,x0\n    ldr x1,qAdrsZoneConv\n    bl conversion10                   // call decimal conversion\n    ldr x0,qAdrszMessPiChoice\n    ldr x1,qAdrsZoneConv              // insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n    cmp x10,#HITTOTAL\n    bne 4f\n    ldr x0,qAdrszMessHumanLost\n    bl affichageMess\n    b 12f\n4:                                    // display current total\n    mov x0,x10\n    ldr x1,qAdrsZoneConv\n    bl conversion10                   // call decimal conversion\n    ldr x0,qAdrszMessTotal\n    ldr x1,qAdrsZoneConv              // insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n\n5:                                    // human turn\n    ldr x0,qAdrszMessHumanChoice\n    bl affichageMess\n    bl saisie\n    cmp x0,#'q'                       // quit\u00a0?\n    beq 100f\n    cmp x0,#'Q'\n    beq 100f\n    cmp x0,#'1'\n    add x9,x10,1\n    csel x10,x9,x10,eq\n    beq 6f\n    cmp x0,#'2'\n    add x9,x10,2\n    csel x10,x9,x10,eq\n    beq 6f\n    cmp x0,#'3'\n    add x9,x10,3\n    csel x10,x9,x10,eq\n    beq 6f\n    ldr x0,qAdrszMessErrChoise\n    bl affichageMess\n    b 5b\n6:\n    cmp x10,#HITTOTAL                // total = maxi\u00a0?\n    beq 11f                           // yes -> human won\n    cmp x10,#5                       // else compute rasp number\n    mov x9,5                         // compare total and optimun\n7:\n    cmp x10,x9\n    ble 8f\n    add x9,x9,4\n    b 7b\n8:\n    sub x0,x9,x10                   // compute number rasp\n9:                                  // control number rasp\n    cmp x0,#0\n    ble 10f\n    cmp x0,#3\n    ble 3b\n10:                                  // if not ok, generate random number\n    mov x0,#2\n    bl genereraleas\n    add x0,x0,#1\n    b 3b                            // and loop\n    \n11:                                  // display human won\n    ldr x0,qAdrszMessHumanWon\n    bl affichageMess\n12:                                 // display new game\u00a0?\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess\n    ldr x0,qAdrszMessNewGame\n    bl affichageMess\n    bl saisie\n    cmp x0,#'y'\n    beq 1b\n    cmp x0,#'Y'\n    beq 1b\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 \nqAdrszCarriageReturn:     .quad szCarriageReturn\nqAdrszMessRules:          .quad szMessRules\nqAdrszMessHumanBegin:     .quad szMessHumanBegin\nqAdrszMessPiBegin:        .quad szMessPiBegin\nqAdrszMessPiChoice:       .quad szMessPiChoice\nqAdrszMessTotal:          .quad szMessTotal\nqAdrszMessHumanChoice:    .quad szMessHumanChoice\nqAdrszMessHumanLost:      .quad szMessHumanLost\nqAdrszMessHumanWon:       .quad szMessHumanWon\nqAdrszMessNewGame:        .quad szMessNewGame\nqAdrszMessErrChoise:      .quad szMessErrChoise\nqAdrsZoneConv:            .quad sZoneConv\n/******************************************************************/\n/*            string saisie                                       */ \n/******************************************************************/\n/* x0 return the first character of human entry */\nsaisie:\n    stp x1,lr,[sp,-16]!    // save  registers\n    stp x2,x8,[sp,-16]!    // save  registers\n    mov x0,#STDIN          // Linux input console\n    ldr x1,qAdrsBuffer     // buffer address \n    mov x2,#BUFFERSIZE     // buffer size \n    mov x8,#READ           // request to read datas\n    svc 0                  // call system\n    ldr x1,qAdrsBuffer     // buffer address \n    ldrb w0,[x1]           // load first character\n100:\n    ldp x2,x8,[sp],16      // restaur  2 registers\n    ldp x1,lr,[sp],16      // restaur  2 registers\n    ret                    // return to address lr x30\n    \nqAdrsBuffer:         .quad sBuffer\n/***************************************************/\n/*   Generation random number                  */\n/***************************************************/\n/* x0 contains limit  */\ngenereraleas:\n    stp x1,lr,[sp,-16]!        // save  registers\n    stp x2,x3,[sp,-16]!        // save  registers\n    stp x4,x5,[sp,-16]!        // save  registers\n    ldr x4,qAdrqGraine\n    ldr x2,[x4]\n    ldr x3,qNbDep1\n    mul x2,x3,x2\n    ldr x3,qNbDep2\n    add x2,x2,x3\n    str x2,[x4]                // maj de la graine pour l appel suivant \n    cmp x0,#0\n    beq 100f\n    udiv x3,x2,x0\n    msub x0,x3,x0,x2           // r\u00e9sult = remainder\n  \n100:                           // end function\n    ldp x4,x5,[sp],16          // restaur  2 registers\n    ldp x2,x3,[sp],16          // restaur  2 registers\n    ldp x1,lr,[sp],16          // restaur  2 registers\n    ret                        // return to address lr x30\n/*****************************************************/\nqAdrqGraine: .quad qGraine\nqNbDep1:     .quad 0x0019660d\nqNbDep2:     .quad 0x3c6ef35f\n\n/********************************************************/\n/*        File Include fonctions                        */\n/********************************************************/\n/* for this file see task include a file in language AArch64 assembly */\n.include \"../includeARM64.inc\"",
        "safe": true
    },
    {
        "filename": "21 game_20.txt",
        "content": "shopt -s expand_aliases\nalias bind_variables='\n{\n  local -ri goal_count=21\n  local -ri player_human=0\n  local -ri player_computer=1\n  local -i turn=1\n  local -i total_count=0\n  local -i input_number=0\n  local -i choose_turn=0\n}\n'\nwhose_turn() {\n  case $(( ( turn + choose_turn ) % 2 )) in\n   ${player_human}) echo \"player\";;\n   ${player_computer}) echo \"computer\";;\n  esac\n}\nnext_turn() {\n  let turn++\n}\nvalidate_number() {\n  ! test ${input_number} -ge 1 -a ${input_number} -le $( max_guess )\n}\nprompt_number() {\n  local prompt_str\n  test $( max_guess ) -eq 1 && {\n    prompt_str=\"enter the number 1 to win\"\n  true\n  } || {\n    prompt_str=\"enter a number between 1 and $( max_guess )\"\n  }\n  while [ ! ]\n  do\n   read -p \"${prompt_str} (or quit): \"\n   input_number=${REPLY}\n   case ${REPLY} in\n    \"quit\") {\n      false\n      return\n    } ;;\n   esac\n   validate_number || break\n   echo \"try again\"\n  done\n}\nupdate_count() {\n  let total_count+=input_number\n}\nremaining_count() {\n  echo $(( goal_count - total_count ))\n}\nmax_guess() {\n  local -i remaining_count\n  remaining_count=$( remaining_count )\n  case $( remaining_count ) in\n    1|2|3) echo ${remaining_count} ;;\n    *) echo 3 ;;\n  esac\n}\niter() {\n  update_count\n  next_turn\n}\non_game_over() {\n  test ! ${input_number} -eq $( remaining_count ) || {\n    test ! \"$( whose_turn )\" = \"player\" && {\n      echo -ne \"\\nYou won!\\n\\n\"\n    true\n    } || {\n      echo -ne \"\\nThe computer won!\\nGAME OVER\\n\\n\"\n    }\n    false\n  }\n}\non_game_start() {\n  echo 21 Game\n  read -p \"Press enter key to start\"\n}\nchoose_turn() {\n  let choose_turn=${RANDOM}%2\n}\nchoose_number() {\n  local -i remaining_count\n  remaining_count=$( remaining_count )\n  case ${remaining_count} in\n   1|2|3) {  \n     input_number=${remaining_count}\n   } ;;\n   5|6|7) {  \n     let input_number=remaining_count-4\n   } ;;\n   *) {  \n     let input_number=${RANDOM}%$(( $( max_guess ) - 1 ))+1\n   }\n  esac\n}\ngame_play() {\n  choose_turn\n  while [ ! ]\n  do\n    echo \"Total now ${total_count} (remaining: $( remaining_count ))\"\n    echo -ne \"Turn: ${turn} (\"\n    test ! \"$( whose_turn )\" = \"player\" && {\n      echo -n \"Your\"\n    true\n    } || {\n      echo -n \"Computer\"\n    }\n    echo \" turn)\"\n    test ! \"$( whose_turn )\" = \"player\" && {\n      prompt_number || break\n    true\n    } || {\n      choose_number\n      sleep 2\n      echo \"Computer chose ${input_number}\"\n    }\n    on_game_over || break\n    sleep 1\n    iter\n  done\n}\n21_Game() {\n  bind_variables\n  on_game_start\n  game_play\n}\nif [ ${#} -eq 0 ] \nthen\n true\nelse\n exit 1\nfi\n21_Game\n",
        "safe": true
    },
    {
        "filename": "21 game_21.txt",
        "content": "/**\n * Game 21 - an example in C language for Rosseta Code.\n *\n * A simple game program whose rules are described below\n * - see DESCRIPTION string.\n *\n * This program should be compatible with C89 and up.\n */\n\n\n/*\n * Turn off MS Visual Studio panic warnings which disable to use old gold\n * library functions like printf, scanf etc. This definition should be harmless\n * for non-MS compilers.\n */\n#define _CRT_SECURE_NO_WARNINGS\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n\n/*\n * Define bool, true and false as needed. The stdbool.h is a standard header\n * in C99, therefore for older compilers we need DIY booleans. BTW, there is\n * no __STDC__VERSION__ predefined macro in MS Visual C, therefore we need\n * check also _MSC_VER.\n */\n#if __STDC_VERSION__ >= 199901L || _MSC_VER >= 1800\n#include <stdbool.h>\n#else\n#define bool int\n#define true  1\n#define false 0\n#endif\n\n#define GOAL               21\n#define NUMBER_OF_PLAYERS   2\n#define MIN_MOVE            1\n#define MAX_MOVE            3\n#define BUFFER_SIZE       256\n\n#define _(STRING) STRING\n\n\n/*\n * Spaces are meaningful: on some systems they can be visible.\n */\nstatic char DESCRIPTION[] = \n    \"21 Game                                                          \\n\"\n    \"                                                                 \\n\"\n    \"21 is a two player game, the game is played by choosing a number \\n\"\n    \"(1, 2, or 3) to be added to the running total. The game is won by\\n\"\n    \"the player whose chosen number causes the running total to reach \\n\"\n    \"exactly 21. The running total starts at zero.                    \\n\\n\";\n\nstatic int total;\n\n\nvoid update(char* player, int move)\n{\n    printf(\"%8s:  %d = %d + %d\\n\\n\", player, total + move, total, move);\n    total += move;\n    if (total == GOAL)\n        printf(_(\"The winner is %s.\\n\\n\"), player);\n}\n\n\nint ai()\n{\n/*\n * There is a winning strategy for the first player. The second player can win\n * then and only then the frist player does not use the winning strategy.\n * \n * The winning strategy may be defined as best move for the given running total.\n * The running total is a number from 0 to GOAL. Therefore, for given GOAL, best\n * moves may be precomputed (and stored in a lookup table). Actually (when legal\n * moves are 1 or 2 or 3) the table may be truncated to four first elements.\n */\n#if GOAL < 32 && MIN_MOVE == 1 && MAX_MOVE == 3\n    static const int precomputed[] = { 1, 1, 3, 2, 1, 1, 3, 2, 1, 1, 3, 2, 1, 1,\n        3, 2, 1, 1, 3, 2, 1, 1, 3, 2, 1, 1, 3, 2, 1, 1, 3 };\n    update(_(\"ai\"), precomputed[total]);\n#elif MIN_MOVE == 1 && MAX_MOVE == 3\n    static const int precomputed[] = { 1, 1, 3, 2};\n    update(_(\"ai\"), precomputed[total % (MAX_MOVE + 1)]);\n#else\n    int i;\n    int move = 1;\n    for (i = MIN_MOVE; i <= MAX_MOVE; i++)\n        if ((total + i - 1) % (MAX_MOVE + 1) == 0)\n            move = i;\n    for (i = MIN_MOVE; i <= MAX_MOVE; i++)\n        if (total + i == GOAL)\n            move = i;\n    update(_(\"ai\"), move);\n#endif\n}\n\n\nvoid human(void)\n{\n    char buffer[BUFFER_SIZE];\n    int move;\n \n    while ( printf(_(\"enter your move to play (or enter 0 to exit game): \")),\n            fgets(buffer, BUFFER_SIZE, stdin), \n            sscanf(buffer, \"%d\", &move) != 1 ||\n            (move && (move < MIN_MOVE || move > MAX_MOVE || total+move > GOAL)))\n        puts(_(\"\\nYour answer is not a valid choice.\\n\"));\n    putchar('\\n');\n    if (!move) exit(EXIT_SUCCESS);\n    update(_(\"human\"), move);\n}\n\n\nint main(int argc, char* argv[])\n{\n    srand(time(NULL));\n    puts(_(DESCRIPTION));\n    while (true)\n    {\n        puts(_(\"\\n---- NEW GAME ----\\n\"));\n        puts(_(\"\\nThe running total is currently zero.\\n\"));\n        total = 0;\n\n        if (rand() % NUMBER_OF_PLAYERS)\n        {\n            puts(_(\"The first move is AI move.\\n\"));\n            ai();\n        }\n        else\n            puts(_(\"The first move is human move.\\n\"));\n\n        while (total < GOAL)\n        {\n            human();\n            ai();\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "21 game_22.txt",
        "content": "21 Game\n\n21 is a two player game, the game is played by choosing a number\n(1, 2, or 3) to be added to the running total. The game is won by\nthe player whose chosen number causes the running total to reach\nexactly 21. The running total starts at zero.\n\n\n\n---- NEW GAME ----\n\n\nThe running total is currently zero.\n\nThe first move is AI move.\n\n      AI:  1 = 0 + 1\n\nenter your move to play (or enter 0 to exit game): 1\n\n   human:  2 = 1 + 1\n\n      AI:  5 = 2 + 3\n\nenter your move to play (or enter 0 to exit game): 3\n\n   human:  6 = 5 + 1\n\n      AI:  9 = 6 + 3\n\nenter your move to play (or enter 0 to exit game): asd\u00a0?\n\nYour answer is not a valid choice.\n\nenter your move to play (or enter 0 to exit game): -1\n\nYour answer is not a valid choice.\n\nenter your move to play (or enter 0 to exit game): 4\n\nYour answer is not a valid choice.\n\nenter your move to play (or enter 0 to exit game): 2\n\n   human:  10 = 9 + 1\n\n      AI:  13 = 10 + 3\n\nenter your move to play (or enter 0 to exit game): 3\n\n   human:  14 = 13 + 1\n\n      AI:  17 = 14 + 3\n\nenter your move to play (or enter 0 to exit game): 2\n\n   human:  18 = 17 + 1\n\n      AI:  21 = 18 + 3\n\nThe winner is AI.\n\n\n---- NEW GAME ----\n\n\nThe running total is currently zero.\n\nThe first move is AI move.\n\n      AI:  1 = 0 + 1\n\nenter your move to play (or enter 0 to exit game): 1\n\n   human:  2 = 1 + 1\n\n      AI:  5 = 2 + 3\n\nenter your move to play (or enter 0 to exit game): 2\n\n   human:  6 = 5 + 1\n\n      AI:  9 = 6 + 3\n\nenter your move to play (or enter 0 to exit game): 3\n\n   human:  10 = 9 + 1\n\n      AI:  13 = 10 + 3\n\nenter your move to play (or enter 0 to exit game): 0",
        "safe": true
    },
    {
        "filename": "21 game_23.txt",
        "content": "/**\n *  Game 21 - an example in C++ language for Rosseta Code.\n *\n *  This version is an example of MVC architecture. It seems be a little cleaner\n *  than MVP. The friendship has broken encapsulations to avoid getters.\n */\n\n#include <cstdlib>\n#include <ctime>\n#include <iostream>\n#include <iomanip>\n#include <limits>\n\nusing namespace std;\n#define _(STR) STR\n\n\nclass Model\n{\npublic:\n    static const int GOAL = 21;\n    static const int NUMBER_OF_PLAYERS = 2;\n    static const int MIN_MOVE = 1;\n    static const int MAX_MOVE = 3;\n    int bestMove();\n    bool update(const char* player, int move);\n    bool isGameBegin();\n    bool isGameOver();\nprotected:\n    friend class View;\n    View* view = nullptr;\n    const char* player = nullptr;\n    int oldTotal = 0;\n    int newTotal = 0;\n    int lastMove = 0;\n};\n\n\nclass View\n{\nprotected:\n    Model* model;\npublic:\n    View(Model* model);\n    void init(const char* player);\n    void update();\n};\n\n\nclass Controller\n{\nprotected:\n    Model* model;\n    View* view;\npublic:\n    Controller(Model* model, View* view);\n    int input();\n    void clear();\n    void run();\n};\n\n\nint Model::bestMove()\n{\n    // This is not the fastest algorithm. There is possible to precompute\n    // and memorize all answers before game begin or even hard code them.\n\n    int move = MIN_MOVE;\n    for (int i = MIN_MOVE; i <= MAX_MOVE; i++)\n        if ((newTotal + i - 1) % (MAX_MOVE + 1) == 0)\n            move = i;\n    for (int i = MIN_MOVE; i <= MAX_MOVE; i++)\n        if (newTotal + i == GOAL)\n            move = i;\n    return move;\n}\n\nbool Model::update(const char* player, int move)\n{\n    if (move >= MIN_MOVE && move <= MAX_MOVE && newTotal + move <= GOAL)\n    {\n        this->player = player;\n        oldTotal = newTotal;\n        newTotal = oldTotal + move;\n        lastMove = move;\n        view->update();\n        return true;\n    }\n    else\n        return false;\n}\n\nbool Model::isGameBegin()\n{\n    return oldTotal == 0;\n}\n\nbool Model::isGameOver()\n{\n    return newTotal == GOAL;\n}\n\n\nView::View(Model* model)\n{\n    this->model = model;\n    model->view = this;\n}\n\nvoid View::init(const char* player)\n{\n    if (model->newTotal == 0)\n        cout << _(\"----NEW GAME----\\n\\n\")\n             << _(\"The running total is currently zero.\\n\")\n             << _(\"The first move is \") << player << _(\" move.\\n\\n\");\n}\n\nvoid View::update()\n{\n    cout << setw(8) << model->player << \": \" << model->newTotal << \" = \"\n         << model->oldTotal << \" + \" << model->lastMove << endl << endl;\n    if (model->isGameOver())\n        cout << endl << _(\"The winner is \") << model->player << _(\".\\n\\n\\n\");\n}\n\n\nController::Controller(Model* model, View* view)\n{\n    this->model = model;\n    this->view = view;\n}\n\nvoid Controller::run()\n{\n    if (rand() % Model::NUMBER_OF_PLAYERS == 0)\n    {\n        view->init(\"AI\");\n        model->update(\"AI\", model->bestMove());\n    }\n    else\n        view->init(\"human\");\n\n    while (!model->isGameOver())\n    {\n        while (!model->update(\"human\", input()))\n            clear();\n        model->update(\"AI\", model->bestMove());\n    }\n}\n\nint Controller::input()\n{\n    int value;\n    cout << _(\"enter a valid number to play (or enter 0 to exit game): \");\n    cin >> value;\n    cout << endl;\n    if (!cin.fail())\n    {\n        if (value == 0)\n            exit(EXIT_SUCCESS);\n        else\n            return value;\n    }\n    else\n        return model->MIN_MOVE - 1;\n}\n\nvoid Controller::clear()\n{\n    cout << _(\"Your answer is not a valid choice.\") << endl;\n    cin.clear();\n    cin.ignore((streamsize)numeric_limits<int>::max, '\\n');\n}\n\n\nint main(int argc, char* argv)\n{\n    srand(time(NULL));\n\n    cout << _(\n        \"21 Game                                                          \\n\"\n        \"                                                                 \\n\"\n        \"21 is a two player game, the game is played by choosing a number \\n\"\n        \"(1, 2, or 3) to be added to the running total. The game is won by\\n\"\n        \"the player whose chosen number causes the running total to reach \\n\"\n        \"exactly 21. The running total starts at zero.                    \\n\\n\");\n\n    while (true)\n    {\n        Model* model = new Model();\n        View* view = new View(model);\n        Controller* controler = new  Controller(model, view);\n\n        controler->run();\n\n        delete controler;\n        delete model;\n        delete view;\n    }\n    return EXIT_SUCCESS; // dead code\n}\n",
        "safe": true
    },
    {
        "filename": "21 game_24.txt",
        "content": "/**\n *  Game 21 - an example in C++ language for Rosseta Code.\n *\n *  This version is an example of MVP architecture. The user input, as well as\n *  the AI opponent, is handled by separate passive subclasses of abstract class\n *  named Controller. It can be noticed that the architecture support OCP,\n *  for an example the AI module can be \"easily\" replaced by another AI etc.\n *\n *  BTW, it would be better to place each class in its own file. But it would\n *  be less convinient for Rosseta Code, where \"one solution\" mean \"one file\".\n */\n\n#include <cstdlib>\n#include <ctime>\n#include <iostream>\n#include <iomanip>\n#include <limits>\n\n\nusing namespace std;\n\n#define _(STR) STR\n\n\nclass Model\n{\nprotected:\n\n    int oldTotal;\n    int newTotal;\n    int lastMove;\n\npublic:\n\n    static const int GOAL = 21;\n    static const int NUMBER_OF_PLAYERS = 2;\n\n    Model()\n    {\n        newTotal = 0;\n        oldTotal = 0;\n        lastMove = 0;\n    }\n\n    void update(int move)\n    {\n        oldTotal = newTotal;\n        newTotal = oldTotal + move;\n        lastMove = move;\n    }\n\n    int getOldTotal()\n    {\n        return oldTotal;\n    }\n\n    int getNewTotal()\n    {\n        return newTotal;\n    }\n\n    int getLastMove()\n    {\n        return lastMove;\n    }\n\n    bool isEndGame()\n    {\n        return newTotal == GOAL;\n    }\n};\n\n\nclass View\n{\npublic:\n\n    void update(string comment, Model* model)\n    {\n        cout << setw(8) << comment << \": \"\n            << model->getNewTotal()\n            << \" = \"\n            << model->getOldTotal()\n            << \" + \"\n            << model->getLastMove() << endl\n            << endl;\n    }\n\n    void newGame(string player)\n    {\n        cout << _(\"----NEW GAME----\") << endl\n            << endl\n            << _(\"The running total is currently zero.\") << endl\n            << endl\n            << _(\"The first move is \") << player << _(\" move.\") << endl\n            << endl;\n    }\n\n    void endGame(string name)\n    {\n        cout << endl << _(\"The winner is \") << name << _(\".\") << endl\n            << endl\n            << endl;\n    }\n};\n\n\nclass Controller\n{\npublic:\n\n    virtual string getName() = 0;\n    virtual int getMove(Model* model) = 0;\n};\n\n\nclass AI : public Controller\n{\npublic:\n\n    string getName()\n    {\n        return _(\"AI\");\n    }\n\n    int getMove(Model* model)\n    {\n        int n = model->getNewTotal();\n        for (int i = 1; i <= 3; i++)\n            if (n + i == Model::GOAL)\n                return i;\n        for (int i = 1; i <= 3; i++)\n            if ((n + i - 1) % 4 == 0)\n                return i;\n        return 1 + rand() % 3;\n    }\n};\n\n\nclass Human : public Controller\n{\npublic:\n\n    string getName()\n    {\n        return _(\"human\");\n    }\n\n    int getMove(Model* model)\n    {\n        int n = model->getNewTotal();\n        int value;\n        while (true) {\n            if (n == Model::GOAL - 1)\n                cout << _(\"enter 1 to play (or enter 0 to exit game): \");\n            else if (n == Model::GOAL - 2)\n                cout << _(\"enter 1 or 2 to play (or enter 0 to exit game): \");\n            else\n                cout << _(\"enter 1 or 2 or 3 to play (or enter 0 to exit game): \");\n            cin >> value;\n            if (!cin.fail()) {\n                if (value == 0)\n                    exit(0);\n                else if (value >= 1 && value <= 3 && n + value <= Model::GOAL)\n                {\n                    cout << endl;\n                    return value;\n                }\n            }\n            cout << _(\"Your answer is not a valid choice.\") << endl;\n            cin.clear();\n            cin.ignore((streamsize)numeric_limits<int>::max, '\\n');\n        }\n    }\n};\n\n\nclass Presenter\n{\nprotected:\n\n    Model* model;\n    View* view;\n    Controller** controllers;\n\npublic:\n\n    Presenter(Model* model, View* view, Controller** controllers)\n    {\n        this->model = model;\n        this->view = view;\n        this->controllers = controllers;\n    }\n\n    void run()\n    {\n        int player = rand() % Model::NUMBER_OF_PLAYERS;\n        view->newGame(controllers[player]->getName());\n\n        while (true)\n        {\n            Controller* controller = controllers[player];\n            model->update(controller->getMove(model));\n            view->update(controller->getName(), model);\n            if (model->isEndGame())\n            {\n                view->endGame(controllers[player]->getName());\n                break;\n            }\n            player = (player + 1) % Model::NUMBER_OF_PLAYERS;\n        }\n    }\n};\n\n\nint main(int argc, char* argv)\n{\n    srand(time(NULL));\n\n    while (true)\n    {\n        Model* model = new Model();\n        View* view = new View();\n        Controller* controllers[Model::NUMBER_OF_PLAYERS];\n        controllers[0] = new Human();\n        for (int i = 1; i < Model::NUMBER_OF_PLAYERS; i++)\n            controllers[i] = new AI();\n        Presenter* presenter = new Presenter(model, view, controllers);\n\n        presenter->run();\n\n        delete model;\n        delete view;\n        delete controllers[0];\n        delete controllers[1];\n        delete presenter;\n    }\n    return EXIT_SUCCESS; // dead code\n}\n",
        "safe": true
    },
    {
        "filename": "21 game_25.txt",
        "content": "----NEW GAME----\n\nThe running total is currently zero.\n\nThe first move is human move.\n\nenter 1 or 2 or 3 to play (or enter 0 to exit game): 1\n\n   human: 1 = 0 + 1\n\n      AI: 4 = 1 + 3\n\nenter 1 or 2 or 3 to play (or enter 0 to exit game): 2\n\n   human: 6 = 4 + 2\n\n      AI: 9 = 6 + 3\n\nenter 1 or 2 or 3 to play (or enter 0 to exit game): nope\nYour answer is not a valid choice.\nenter 1 or 2 or 3 to play (or enter 0 to exit game): 8\nYour answer is not a valid choice.\nenter 1 or 2 or 3 to play (or enter 0 to exit game): 3\n\n   human: 12 = 9 + 3\n\n      AI: 13 = 12 + 1\n\nenter 1 or 2 or 3 to play (or enter 0 to exit game): 2\n\n   human: 15 = 13 + 2\n\n      AI: 17 = 15 + 2\n\nenter 1 or 2 or 3 to play (or enter 0 to exit game): 3\n\n   human: 20 = 17 + 3\n\n      AI: 21 = 20 + 1\n\n\nThe winner is AI.\n\n\n----NEW GAME----\n\nThe running total is currently zero.\n\nThe first move is human move.\n\nenter 1 or 2 or 3 to play (or enter 0 to exit game): 1\n\n   human: 1 = 0 + 1\n\n      AI: 4 = 1 + 3\n\nenter 1 or 2 or 3 to play (or enter 0 to exit game): 2\n\n   human: 6 = 4 + 2\n\n      AI: 9 = 6 + 3\n\nenter 1 or 2 or 3 to play (or enter 0 to exit game): 3\n\n   human: 12 = 9 + 3\n\n      AI: 13 = 12 + 1\n\nenter 1 or 2 or 3 to play (or enter 0 to exit game): 0\n",
        "safe": true
    },
    {
        "filename": "21 game_26.txt",
        "content": "// 21 Game \n\nusing System;\n\nnamespace _21Game\n{\n    public class Program\n    {\n        private const string computerPlayer = \"Computer\";\n        private const string humanPlayer = \"Player 1\";\n\n        public static string SwapPlayer(string currentPlayer)\n        {\n            if (currentPlayer == computerPlayer)\n            {\n                currentPlayer = humanPlayer;\n            }\n            else\n            {\n                currentPlayer = computerPlayer;\n            }\n\n            return currentPlayer;\n        }\n\n        public static void PlayGame()\n        {\n            bool playAnother = true;\n            int total = 0;\n            int final = 21;\n            int roundChoice = 0;\n            string currentPlayer = RandomPLayerSelect();\n            int compWins = 0;\n            int humanWins = 0;\n\n            while (playAnother)\n            {\n                Console.WriteLine($\"Now playing: {currentPlayer}\");\n                try\n                {\n                    if (currentPlayer == computerPlayer)\n                    {\n                       roundChoice =  CompMove(total);\n                    }\n                    else\n                    {\n                        roundChoice = int.Parse(Console.ReadLine());\n                    }\n                    \n\n                    if (roundChoice != 1 && roundChoice != 2 && roundChoice != 3)\n                    {\n                        throw new Exception();\n                    }\n\n                    total += roundChoice;\n                }\n                catch (Exception)\n                {\n                    Console.WriteLine(\"Invalid choice! Choose from numbers: 1, 2, 3.\");\n                    continue;\n                }\n\n                Console.WriteLine(total);\n\n                if (total == final)\n                {\n                    if (currentPlayer == computerPlayer)\n                    {\n                        compWins++;\n                    }\n                    if (currentPlayer == humanPlayer)\n                    {\n                        humanWins++;\n                    }\n                    Console.WriteLine($\"Winner: {currentPlayer}\");\n                    Console.WriteLine($\"Comp wins: {compWins}. Human wins: {humanWins}\");\n                    Console.WriteLine($\"do you wan to play another round? y/n\");\n                    var choice = Console.ReadLine();\n                    if (choice == \"y\")\n                    {\n                        total = 0;\n                    }\n                    else if (choice == \"n\")\n                    {\n                        break;\n                    }\n                    else\n                    {\n                        Console.WriteLine(\"Invalid choice! Choose from y or n\");\n                        continue;\n                    }\n                }\n\n                else if (total > 21)\n                {\n                    Console.WriteLine(\"Not the right time to play this game\u00a0:)\");\n                    break;\n                }\n\n                currentPlayer = SwapPlayer(currentPlayer);\n            }\n        }\n\n        public static bool CheckIfCanWin(int total)\n        {\n            bool result = false;\n            if (total == 18)\n            {\n                result = true;\n            }\n            return result;\n        }\n\n        public static int CompMove(int total)\n        {\n            int choice = 0;\n\n            if (CheckIfCanWin(total))\n            {\n                choice = 21 - total;\n            }\n            else\n            {\n                choice = new Random().Next(1,4);\n            }\n\n            return choice;\n        }\n\n        public static string RandomPLayerSelect()\n        {\n            string[] players = new string[] { computerPlayer, humanPlayer };\n            var random = new Random().Next(0,2);\n            return players[random];\n        }\n\n        public static void Main(string[] args)\n        {\n            // welcome message and rules\n            Console.WriteLine(\"Welcome to 21 game \\n\");\n            Console.WriteLine(@\"21 is a two player game. \nThe game is played by choosing a number.\n1, 2, or 3 to be added a total sum. \\n\nThe game is won by the player reaches exactly 21. \\n\" );            \n            Console.WriteLine(\"Choose your number: (1, 2 or 3)\");\n\n            PlayGame();\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "21 game_27.txt",
        "content": "1 rem 21 game\n2 rem for rosetta code\n\n3 rem initialization\n4 l$=chr$(157):rem left cursor\n5 dim p$(2),hc(2),ca(4):hc(1)=0:hc(2)=0:rem players\n6 ca(0)=1:ca(1)=1:ca(2)=3:ca(3)=2:rem computer answers\n7 dim cn$(6):for i=1 to 6:read cn$(i):next:rem computer names\n8 def fn m(x)=(x-(int(x/4))*4):rem modulo function\n\n10 rem optionally set screen colors here\n20 print chr$(147);chr$(14):print spc(16);\"21 GAME\"\n25 print:print \" The goal of this game is to take turns\"\n26 print \" adding the value of either 1, 2, or 3\"\n27 print \" to a running total. The first player\"\n28 print \" to bring the total to 21...\"\n29 print:print spc(10);\"... WINS THE GAME!\"\n30 print:gosub 1000\n35 print chr$(147):for p=1 to 2\n\n40 rem game setup and get players\n42 for p=1 to 2\n44 print:print \"Player\";p;l$;\", [H]uman or [C]omputer? \";\n45 get k$:if k$<>\"c\" and k$<>\"h\" then 45\n46 print k$:hc(p)=(k$=\"c\")\n50 print:print\"Player\";p;l$\",\":print\"Enter your name\";:if hc(p)then goto54\n52 input p$(p):next p:goto 60\n54 gosub 1500:print \"? \";p$(p):next p\n60 print:for p=1 to 2:print p;l$;\". \";p$(p):next\n65 print:print \"Is this correct (y/n)? \";\n70 get k$:if k$<>\"y\" and k$<>\"n\" then 70\n75 print k$:if k$=\"n\" then goto 35\n80 print:print \"Who will play first (1 or 2)? \";\n85 get k$:if k$<\"1\" or k$>\"2\" then 85\n90 fp=asc(k$)-48:print k$:print\n95 print \"Okay, \";p$(fp);\" will play first.\":print:gosub 1000\n\n100 rem start main game loop\n105 pi=fp:rt=0\n110 print chr$(147);\"Total so far:\";rt\n115 print:print p$(pi);\"'s turn.\"\n120 if hc(pi) then gosub 1200\n125 if not hc(pi) then gosub 1100\n130 rt=rt+ad\n135 if rt=21 then goto 200\n140 if rt>21 then print:print p$(pi);\" loses by going over 21!!\":goto 210\n145 pi=pi+1:if pi>2 then pi=1\n150 goto 110\n\n200 rem winner winner chicken dinner\n205 print:print \"21! \";p$(pi);\" wins the game!!!\"\n210 print:print \"Would you like to play again? \";\n215 get k$:if k$<>\"n\" and k$<>\"y\" then 215\n220 print k$\n225 if k$=\"n\" then print:print \"Okay, maybe another time. Bye!\":end\n230 goto 10\n\n1000 rem pause for keypress\n1010 z$=\" Press a key to continue. \"\n1015 print spc(20-int(len(z$)/2));\n1016 print chr$(18);z$;chr$(146)\n1020 get k$:if k$=\"\" then 1020\n1025 return\n\n1100 rem human player move\n1105 print:print \"How much to add,\"\n1110 print \"1, 2, or 3 (0 to quit)\";:input ad\n1115 if ad<0 or ad>3 then print:print\"Illegal amount. Try again.\":goto1105\n1120 if ad=0 then print:print \"Game was ended by \";p$(pi);\".\":end\n1125 return\n\n1200 rem computer player move\n1205 print:print \"Thinking...\";\n1210 tt=int(rnd(1)*10)\n1215 for t=1 to tt:print \".\";:for i=1 to 250:next i,t:print\n1220 rm=fn m(rt)\n1225 ad=ca(rm)\n1230 print:print p$(pi);\" adds\";ca(rm);l$;\".\"\n1235 for t=1 to 1000:next t\n1240 return\n\n1500 rem pick a computer name\n1505 pn=int(rnd(1)*6)+1:t$=cn$(pn)\n1510 if t$=p$(p-1) then goto 1505\n1515 p$(p)=t$\n1520 return\n\n2000 rem some computer names to pick from\n2010 data \"Commodore 64\",\"VIC-20\",\"Commodore 128\",\"PET\"\n2020 data \"Plus/4\",\"Commodore 16\"\n",
        "safe": true
    },
    {
        "filename": "21 game_28.txt",
        "content": "                21 GAME                 \n                                        \n The goal of this game is to take turns \n adding the value of either 1, 2, or 3  \n to a running total. The first player   \n to bring the total to 21...            \n                                        \n          ... WINS THE GAME!            \n                                        \n        Press a key to continue.        \n\n\nPlayer 1, [H]uman or [C]omputer? h      \n                                        \nPlayer 1,                               \nEnter your name? Mike                   \n                                        \nPlayer 2, [H]uman or [C]omputer? c      \n                                        \nPlayer 2,                               \nEnter your name? Commodore 64           \n                                        \n 1. Mike                                \n 2. Commodore 64                        \n                                        \nIs this correct (y/n)? y                \n                                        \nWho will play first (1 or 2)? 1         \n                                        \nOkay, Mike will play first.             \n                                        \n        Press a key to continue.        \n\n\nTotal so far: 0\n\nMike's turn.                            \n                                        \nHow much to add,                        \n1, 2, or 3 (0 to quit)? 1               \n\nTotal so far: 1                         \n                                        \nCommodore 64's turn.                    \n                                        \nThinking..........                      \n                                        \nCommodore 64 adds 1.       \n\nTotal so far: 2\n\nMike's turn.                            \n                                        \nHow much to add,                        \n1, 2, or 3 (0 to quit)? 3               \n\nTotal so far: 5                         \n                                        \nCommodore 64's turn.                    \n                                        \nThinking..........                      \n                                        \nCommodore 64 adds 1.       \n\n\n\n...[LATER IN THE GAME]...\n\nTotal so far: 17                        \n                                        \nCommodore 64's turn.                    \n                                        \nThinking.........                       \n                                        \nCommodore 64 adds 1.\n\nTotal so far: 18\n\nMike's turn.                            \n                                        \nHow much to add,                        \n1, 2, or 3 (0 to quit)? 3 \n\n21! Mike wins the game!!!               \n                                        \nWould you like to play again? n         \n                                        \nOkay, maybe another time. Bye!          \n                                        \nready.                                  \n\u2588\n",
        "safe": true
    },
    {
        "filename": "21 game_29.txt",
        "content": "print \"Who reaches 21, wins\"\nprint \"Do you want to begin (y/n)\"\nwho = 1\nif input = \"n\"\n  who = 2\n.\nwho$[] = [ \"Human\" \"Computer\" ]\nrepeat\n  if who = 1\n    repeat\n      print \"\"\n      print \"Choose 1,2 or 3 (q for quit)\"\n      a$ = input\n      n = number a$\n      until a$ = \"q\" or (n >= 1 and n <= 3)\n    .\n  else\n    sleep 1\n    if sum mod 4 = 1\n      n = random 3\n    else\n      n = 4 - (sum + 3) mod 4\n    .\n  .\n  sum += n\n  print who$[who] & \": \" & n & \" --> \" & sum\n  until sum >= 21 or a$ = \"q\"\n  who = who mod 2 + 1\n.\nif a$ <> \"q\"\n  print \"\"\n  if who = 0\n    print \"Congratulation, you won\"\n  else\n    print \"Sorry, you lost\"\n  .\n.\n",
        "safe": true
    },
    {
        "filename": "21 game_3.txt",
        "content": "with Ada.Text_IO;\nwith Ada.Numerics.Discrete_Random;\n\nprocedure Game_21 is\n\n   procedure Put (Item : String) is\n   begin\n      for Char of Item loop\n         Ada.Text_IO.Put (Char);\n         delay 0.010;\n      end loop;\n   end Put;\n\n   procedure New_Line is\n   begin\n      Ada.Text_IO.New_Line;\n   end New_Line;\n\n   procedure Put_Line (Item : String) is\n   begin\n      Put (Item);\n      New_Line;\n   end Put_LIne;\n\n   type Player_Kind is (Human, Computer);\n   type Score_Type  is range 0 .. 21;\n   subtype Amount_Range is Score_Type range 1 .. 3;\n\n   package Amount_Generators is\n     new Ada.Numerics.Discrete_Random (Amount_Range);\n\n   Gen    : Amount_Generators.Generator;\n   Total  : Score_Type := 0;\n   Choice : Character;\n   Player : Player_Kind;\n   Amount : Amount_Range;\nbegin\n   Amount_Generators.Reset (Gen);\n\n   Put_Line (\"--- The 21 Game ---\"); New_Line;\n\n   Put (\"Who is starting human or computer (h/c)\u00a0? \");\n   Ada.Text_IO.Get_Immediate (Choice);\n   New_Line;\n\n   case Choice is\n      when 'c' | 'C' =>  Player := Computer;\n      when 'h' | 'H' =>  Player := Human;\n      when others => return;\n   end case;\n\n   Play_Loop : loop\n      New_Line;\n      Put (\"Runing total is \"); Put (Total'Image); New_Line;\n      New_Line;\n\n      case Player is\n\n         when Human =>\n            Put_Line (\"It is your turn\u00a0!\");\n            Input_Loop : loop\n               Put (\"Enter choice 1 .. 3 (0 to end)\u00a0: \");\n               Ada.Text_IO.Get_Immediate (Choice);\n\n               case Choice is\n                  when '1' .. '3' =>\n                     Amount := Amount_Range'Value (\"\" & Choice);\n                     exit Input_Loop;\n\n                  when '0' =>\n                     exit Play_Loop;\n\n                  when others =>\n                     Put_Line (\"Choice must be in 1 .. 3\");\n               end case;\n            end loop Input_Loop;\n            New_Line;\n\n         when Computer =>\n            delay 1.500;\n            Amount := Amount_Generators.Random (Gen);\n            Put (\"Computer chooses: \"); Put (Amount'Image); New_Line;\n            delay 0.800;\n\n      end case;\n\n      New_Line;\n      Amount := Score_Type'Min (Amount, Score_Type'Last - Total);\n      Put (\"  \"); Put (Total'Image); Put (\" + \");  Put (Amount'Image); Put (\" = \");\n      Total := Total + Amount;\n      Put (Total'Image);\n      New_Line;\n\n      if Total = 21 then\n         New_Line;\n         Put (\"... and we have a WINNER\u00a0!!\"); New_Line;\n         delay 0.500;\n         Put_Line (\"   ... and the winner is ...\");\n         delay 1.000;\n         Put_Line (\"      \" & Player'Image);\n         exit;\n      end if;\n\n      Player := (case Player is\n                 when Computer => Human,\n                 when Human    => Computer);\n   end loop Play_Loop;\nend Game_21;\n",
        "safe": true
    },
    {
        "filename": "21 game_30.txt",
        "content": "USING: accessors combinators.random continuations formatting io\nkernel math math.functions math.parser multiline qw random\nsequences ;\nIN: rosetta-code.21-game\n\nSTRING: welcome\n21 is a two-player game. The game is played by choosing a number\n(1, 2, or 3) to be added to the running total.\n\nThe game is won by the player whose chosen number causes the\nrunning total to reach 21.\n\nOne player will be the computer. Players alternate supplying a\nnumber to be added to the running total.\n;\n\n: .welcome ( -- ) welcome print ;\n\nSYMBOLS: +computer+ +human+ ;\n\nTUPLE: game total difficulty who ;\n\n! Instead of saying something dry like 'invalid input,' spice\n! it up a little.\n: insult ( -- )\n    {\n        \"No.\" \"Er...\" \"Learn to read.\" \"I think not.\"\n        \"Come on, is it really this difficult?\"\n    } random print ;\n\n: get-input ( options-seq prompt-str -- str )\n    dup \"%s: \" printf flush readln dup reach member?\n    [ 2nip ] [ drop insult get-input ] if ;\n\n: get-integer ( options-seq prompt-str -- n )\n    get-input string>number ;\n\n: get-difficulty ( -- x )\n    qw{ 1 2 3 4 5 6 7 8 9 10 }\n    \"Difficulty (1-10)\" get-integer 10 / ;\n\n: human-move ( game -- n )\n    drop qw{ q 1 2 3 } \"Your move (1-3) or q to quit\" get-input\n    dup \"q\" = [ drop return ] when string>number ;\n\n: choose-first-player ( difficulty -- player )\n    [ +computer+ ] [ +human+ ] ifp ;\n\n: <game> ( -- game )\n    0 get-difficulty dup choose-first-player game boa ;\n\n: swap-player ( game -- )\n    [ +human+ = +computer+ +human+ ? ] change-who drop ;\n\n: .total ( game -- ) total>> \"Running total: %d\\n\" printf ;\n\n: random-move ( game -- n ) drop 3 random 1 + ;\n\n: boundary? ( n -- ? ) 1 - 4 divisor? ;\n\n: (optimal-move) ( m -- n ) dup 4 / ceiling 4 * 1 + swap - ;\n\n: optimal-move ( game -- n )\n    total>> dup boundary? [ random-move ] [ (optimal-move) ] if ;\n\n: computer-move ( game -- n )\n    dup difficulty>> [ optimal-move ] [ random-move ] ifp\n    dup \"Computer chose %d.\\n\" printf ;\n\n: do-turn ( game -- )\n    dup dup who>> +human+ = [ human-move ] [ computer-move ] if\n    [ + ] curry change-total dup .total swap-player ;\n\n: do-turns ( game -- )\n    [ dup total>> 20 > ] [ dup do-turn ] until\n    dup swap-player who>> \"%u wins!\\n\" printf ;\n\n: play-21-game ( -- )\n    .welcome nl [ <game> do-turns ] with-return ;\n\nMAIN: play-21-game\n",
        "safe": true
    },
    {
        "filename": "21 game_31.txt",
        "content": "21 is a two-player game. The game is played by choosing a number\n(1, 2, or 3) to be added to the running total.\n\nThe game is won by the player whose chosen number causes the\nrunning total to reach 21.\n\nOne player will be the computer. Players alternate supplying a\nnumber to be added to the running total.\n\nDifficulty (1-10): 3\nYour move (1-3) or q to quit: 3\nRunning total: 3\nComputer chose 2.\nRunning total: 5\nYour move (1-3) or q to quit: 2\nRunning total: 7\nComputer chose 2.\nRunning total: 9\nYour move (1-3) or q to quit: 1\nRunning total: 10\nComputer chose 3.\nRunning total: 13\nYour move (1-3) or q to quit: apple\nEr...\nYour move (1-3) or q to quit: 3\nRunning total: 16\nComputer chose 1.\nRunning total: 17\nYour move (1-3) or q to quit: 1\nRunning total: 18\nComputer chose 1.\nRunning total: 19\nYour move (1-3) or q to quit: 2\nRunning total: 21\n+human+ wins!\n",
        "safe": true
    },
    {
        "filename": "21 game_32.txt",
        "content": "type Player =\n    | Computer\n    | Person\ntype Play = {runningTotal:int; nextTurn:Player}\ntype Win =\n    | ByExact of Player\n    | ByOtherExceeded of Player\ntype Status =\n    | Start\n    | Playing of Play\n    | Winner of Win\n    | Exit\n\nlet rnd = System.Random ()\nlet randomFirstPlayer () =\n    let selection = rnd.Next 2\n    if selection = 0 then Computer else Person\nlet computerChose current =\n    if current > 17 then 21-current // win strategy\n    else if current > 13 && current < 17 then 17-current // naive thwart opponent strategy\n    else rnd.Next(1, (min 4 (21-current+1)))\n\nlet (|Exact|Exceeded|Under|) i = if i = 21 then Exact else if i > 21 then Exceeded else Under\nlet (|ValidNumber|InvalidInput|Quit|) (s:string) =\n    let trimmed = s.Trim().ToLower()\n    if trimmed = \"1\" || trimmed = \"2\" || trimmed = \"3\" then ValidNumber \n    else if trimmed = \"q\" then Quit\n    else InvalidInput\n    \nlet readable = function | Computer -> \"Computer is\" | Person -> \"You are\"\n\nlet rec looper = function\n    | Start ->\n        let firstPlayer = randomFirstPlayer ()\n        printfn $\"{readable firstPlayer} randomly selected to go first.\"\n        looper (Playing {runningTotal=0; nextTurn=firstPlayer})\n    | Playing play ->\n        match play with\n        | {runningTotal=Exact; nextTurn=Person} -> looper (Winner (ByExact Computer))\n        | {runningTotal=Exact; nextTurn=Computer} -> looper (Winner (ByExact Person))\n        | {runningTotal=Exceeded; nextTurn=player} -> looper (Winner (ByOtherExceeded player))\n        | {runningTotal=r; nextTurn=player} ->\n            match player with\n            | Computer ->\n                let computerChoice = computerChose r\n                let total = r+computerChoice\n                printfn $\"Computer entered {computerChoice}. Current total now: {total}.\"\n                looper (Playing {runningTotal=total; nextTurn=Person})\n            | Person ->\n                let input = printf \"Enter number 1, 2, or 3 (or q to exit): \"; System.Console.ReadLine ()\n                match input with\n                | ValidNumber ->\n                    let playerChoice = System.Int32.Parse input\n                    let total = r+playerChoice\n                    printfn $\"Player entered {playerChoice}. Current total now: {total}.\"\n                    looper (Playing {runningTotal=total; nextTurn=Computer})\n                | Quit -> looper Exit\n                | InvalidInput -> printfn \"Invalid input. Try again.\"; looper (Playing play)\n    | Winner win ->\n        match win with\n        | ByExact player -> printfn $\"{readable player} the winner by getting to 21.\"; looper Exit\n        | ByOtherExceeded player -> printfn $\"{readable player} the winner by not exceeding 21.\"; looper Exit\n    | Exit -> printfn \"Thanks for playing!\"\n    \nlet run () = looper Start\n",
        "safe": true
    },
    {
        "filename": "21 game_33.txt",
        "content": "You are randomly selected to go first.\nEnter number 1, 2, or 3 (or q to exit): 5\nInvalid input. Try again.\nEnter number 1, 2, or 3 (or q to exit): a\nInvalid input. Try again.\nEnter number 1, 2, or 3 (or q to exit): 3\nPlayer entered 3. Current total now: 3.\nComputer entered 3. Current total now: 6.\nEnter number 1, 2, or 3 (or q to exit): 3\nPlayer entered 3. Current total now: 9.\nComputer entered 1. Current total now: 10.\nEnter number 1, 2, or 3 (or q to exit): 2\nPlayer entered 2. Current total now: 12.\nComputer entered 2. Current total now: 14.\nEnter number 1, 2, or 3 (or q to exit): 1\nPlayer entered 1. Current total now: 15.\nComputer entered 2. Current total now: 17.\nEnter number 1, 2, or 3 (or q to exit): 2\nPlayer entered 2. Current total now: 19.\nComputer entered 2. Current total now: 21.\nComputer is the winner by getting to 21.\nThanks for playing!\n\n",
        "safe": true
    },
    {
        "filename": "21 game_34.txt",
        "content": ": READKEY\n  1+ BEGIN\n    KEY DUP 27 = ABORT\" Bye!\"\n    48 - 2DUP > OVER 0 > AND IF\n      DUP 48 + EMIT CR SWAP DROP EXIT\n    THEN DROP\n  REPEAT\n;\n: 21GAME CLS\n  0 2 RND 1-\n  .\" 21 is a two player game.\" CR\n  .\" The game is played by choosing a number (1, 2 or 3) to be added to the running total. \"\n  .\" The game is won by the player whose chosen number causes the running total to reach exactly 21.\"\n  .\" The running total starts at zero. One player will be the computer.\"\n  BEGIN\n    NOT\n    CR .\" The sum is \" OVER . CR\n    SWAP OVER IF\n      .\" How many would you like add?\"\n      .\"  (1-3) \" 3 READKEY\n    ELSE\n      .\" It is the computer's turn.\"\n      4 OVER 1- 4 MOD -\n      DUP 4 = IF 3 RND 1+ MIN THEN\n      DUP CR .\" Computer adds \" . CR\n    THEN + SWAP\n  OVER 21 < NOT UNTIL\n  CR\n  IF .\" Congratulations. You win.\"\n  ELSE .\" Bad Luck. Computer wins.\"\n  THEN CR DROP\n;\n",
        "safe": true
    },
    {
        "filename": "21 game_35.txt",
        "content": "! game 21 - an example in modern fortran language for rosseta code.\n\nsubroutine ai\n  common itotal, igoal\n  if (itotal .lt. igoal) then\n    move = 1\n    do i = 1, 3\n      if (mod(itotal + i - 1 , 4) .eq. 0) then\n        move = i\n      end if\n    end do\n    do i = 1, 3\n      if (itotal + i .eq. igoal) then\n        move = i\n      end if\n    end do\n    print *, \"      ai  \", itotal + move, \" = \", itotal, \" + \", move\n    itotal = itotal + move\n    if (itotal .eq. igoal) then\n      print *, \"\"\n      print *, \"the winner is ai\"\n      print *, \"\"\n    end if\n  end if\nend subroutine ai\n\nsubroutine human\n  common itotal, igoal\n  print *, \"\"\n  do while (.true.)\n    if (itotal + 1 .eq. igoal) then\n      print *, \"enter 1 (or 0 to exit): \"\n    else if (itotal + 2 .eq. igoal) then\n      print *, \"enter 1 or 2 (or 0 to exit): \"\n    else\n      print *, \"enter 1 or 2 or 3 (or 0 to exit)\"\n    end if\n    read(*,*) move\n    if (move .eq. 0) then\n      stop\n    else if (move .ge. 1 .and. move .le. 3 .and. move + itotal .le. igoal) then\n      print *, \"   human  \", itotal + move, \" = \", itotal, \" + \", move\n      itotal = itotal + move\n      if (itotal .eq. igoal) then\n        print *, \"\"\n        print *, \"the winner is human\"\n        print *, \"\"\n      end if\n      return\n    else\n      print *, \"a bad choice\"\n    end if\n  end do\nend subroutine human\n\nprogram main\n  common itotal, igoal\n  print *,\"game 21 - an example in fortran iv language for rosseta code.\"\n  print *,\"\"\n  print *,\"21 is a two player game, the game is played by choosing a number\"\n  print *,\"(1, 2, or 3) to be added to the running total. the game is won\"\n  print *,\"by the player whose chosen number causes the running total to reach\"\n  print *,\"exactly 21. the running total starts at zero.\"\n  print *,\"\"\n  i = irand(1)\n  igoal = 21\n  do while(.true.)\n    print *, \"---- new game ----\"\n    print *, \"\"\n    print *, \"the running total is currently zero.\"\n    print *, \"\"\n    itotal = 0\n    if (mod(irand(0), 2) .eq. 0) then\n      print *, \"the first move is ai move.\"\n      call ai\n    else\n      print *, \"the first move is human move.\"\n    end if\n    print *, \"\"\n    do while(itotal .lt. igoal)\n      call human\n      call ai\n    end do\nend do\nend program main\n",
        "safe": true
    },
    {
        "filename": "21 game_36.txt",
        "content": "game 21 - an example in fortran language for rosseta code.\n \n 21 is a two player game, the game is played by choosing a number\n (1, 2, or 3) to be added to the running total. the game is won\n by the player whose chosen number causes the running total to reach\n exactly 21. the running total starts at zero.\n \n ---- new game ----\n \n the running total is currently zero.\n \n the first move is human move.\n \n \n enter 1 or 2 or 3 (or 0 to exit)\n1\n    human             1  =            0  +            1\n       ai             2  =            1  +            1\n \n enter 1 or 2 or 3 (or 0 to exit)\n3\n    human             5  =            2  +            3\n       ai             6  =            5  +            1\n \n enter 1 or 2 or 3 (or 0 to exit)\n4\n a bad choice\n enter 1 or 2 or 3 (or 0 to exit)\n3\n    human             9  =            6  +            3\n       ai            10  =            9  +            1\n \n enter 1 or 2 or 3 (or 0 to exit)\n2\n    human            12  =           10  +            2\n       ai            13  =           12  +            1\n \n enter 1 or 2 or 3 (or 0 to exit)\n3\n    human            16  =           13  +            3\n       ai            17  =           16  +            1\n \n enter 1 or 2 or 3 (or 0 to exit)\n2\n    human            19  =           17  +            2\n       ai            21  =           19  +            2\n\n the winner is ai\n \n ---- new game ----\n \n the running total is currently zero.\n \n the first move is human move.\n \n \n enter 1 or 2 or 3 (or 0 to exit)\n0",
        "safe": true
    },
    {
        "filename": "21 game_37.txt",
        "content": "#define PLAYER 1\n#define COMP   0\nrandomize timer\n\ndim as uinteger sum, add = 0\ndim as uinteger turn = int(rnd+0.5)\ndim as uinteger precomp(0 to 3) = { 1, 1, 3, 2 } \n\nwhile sum < 21:\n    turn = 1 - turn\n    print using \"The sum is ##\"; sum\n    if turn = PLAYER then\n        print \"It is your turn.\"\n        while add < 1 orelse add > 3 orelse add+sum > 21\n            input \"How many would you like to add? \", add\n        wend\n    else\n        print \"It is the computer's turn.\"\n        add = precomp(sum mod 4)\n        print using \"The computer adds #.\"; add\n    end if\n    print\n    sum = sum + add\n    add = 0\nwend\n\nif turn = PLAYER then\n    print \"Congratulations. You win.\"\nelse\n    print \"Bad luck. The computer wins.\"\nend if\n",
        "safe": true
    },
    {
        "filename": "21 game_38.txt",
        "content": "begin globals\nbegin enum 1\n  _btn1\n  _btn2\n  _btn3\n  _sum\n  _msg\n  _popup\n  _skill\n  _human = 0\n  _robot\nend enum\nstr15 cr\u00a0: cr = chr$(13)\nstr255 string(1)\u00a0:  short who = _human\nbyte best(3), sum, num, skill = 1 //Medium skill\npoke int @best(0), 33751297 //Initialize computer responses\nend globals\n\nlocal fn buildWindow\n  subclass window 1,      @\"21 Game in FutureBasic\" , (  0,  0,640,200 )\n  popupbutton _popup,, 1, @\"Minimum;Medium;Maximum\" , ( 80, 17,100, 32 )\n  textlabel   _msg   ,    @\"Original code: J. Reeve\", ( 20,160,600, 32 )\n  textlabel   _skill ,    @\"Skill level:\",            ( 20, 12, 75, 32 )\n  textfield   _sum  ,,    @\"0\",( 530,85,90,60 )\n  button      _btn1 ,,  , @\"1\",( 245,20,50,50 ),,NSBezelStyleRegularSquare\n  button      _btn2 ,,  , @\"2\",( 295,20,50,50 ),,NSBezelStyleRegularSquare\n  button      _btn3 ,,  , @\"3\",( 345,20,50,50 ),,NSBezelStyleRegularSquare\n  ControlSetAlignment(    _msg, NSTextAlignmentCenter )\n  ControlSetAlignment(    _sum, NSTextAlignmentCenter )\n  TextFieldSetEditable(   _sum, no )\n  ControlSetFontWithName( _msg,  @\"Menlo\", 15.0 )\n  ControlSetFontWithName( _btn1, @\"Menlo\", 20.0 )\n  ControlSetFontWithName( _btn2, @\"Menlo\", 20.0 )\n  ControlSetFontWithName( _btn3, @\"Menlo\", 20.0 )\n  ControlSetFontWithName( _sum,  @\"Menlo\", 32.0 )\n  text @\"menlo\", 15.0\nend fn\n\nlocal fn show( add as byte )\n  CFStringRef msg\n  if (sum + add) > 21 then beep\u00a0: exit fn\n  button 1, who\u00a0: button 2, who\u00a0: button 3, who\n  sum += add\u00a0: cls\n  ControlSetIntegerValue( _sum, sum )\n  string( who ) +=  \"+\" + chr$( add or 48 ) + \"    \"\n  print cr;cr;cr;string( _human );cr;cr;string( _robot )\n  if sum < 21\n    if who == _robot then msg = @\"Your turn...\" else msg = @\"My turn...\"\n  else\n    if who == _robot\n      msg = @\"Too bad. I win. Press any key to play again.\"\n    else\n      msg = @\"Congratulations! YOU WIN! Press any key to play again.\"\n    end if\n  end if\n  if peek( @string( who ) ) > 20 then textlabel _msg, msg\n  who = who xor _robot\nend fn\n\nlocal fn play( add as byte )\n  if sum + add > 21 then beep\u00a0: exit fn\n  fn show( add )       //Show human's play\n  if sum < 21\n    if (skill + maybe) > 0 then num = best(sum mod 4) else num = rnd(3)\n    if sum + num > 21 then num = 21 - sum\n    timerbegin 1.0, NO //wait a sec before playing\n      fn show( num )   //Show computer's play\n    timerend\n  end if\nend fn\n\nlocal fn start\n  sum = 0\u00a0: cls\n  string( _human ) = \"       You: \"\u00a0: string( _robot ) = \"  Computer: \"\n  string( 1-who ) += \"   \"\n  if who == _robot\n    if skill == 2 then num = 1 else num = rnd( 3 )\n    textlabel _msg, fn StringWithFormat( @\"I'll start with %i.\", num )\n    fn show( num )\n  else\n    ControlSetIntegerValue( _sum, sum )\n    textlabel _msg, @\"You start. Type or click 1, 2, or 3.\"\n  end if\nend fn\n\nlocal fn DoDialog( evt as long, tag as long)\n  byte key\n  select ( evt )\n    case _windowKeyUp\n      if sum == 21 then fn start\u00a0: exit fn\n      if who == _robot then exit fn\n      key = intval( fn EventCharacters )\n      if key > 0 && key < 4 then fn play( key )\n    case _btnClick\n      if tag < _popup then beep\u00a0: fn play( tag )\u00a0: exit fn\n      skill = popupbutton( _popup )\n    case _windowWillClose\u00a0: end\n  end select\nend fn\n\nfn buildWindow\nfn start\non dialog fn doDialog\nhandleevents",
        "safe": true
    },
    {
        "filename": "21 game_39.txt",
        "content": "' Gambas module file\n\nPrivate gameConunt As Integer = 0\nPrivate numRound As Integer = 1\nPrivate winPlayer As Integer = 0\nPrivate winComputer As Integer = 0\n\n\nPublic Sub Main()\n\n  Dim entra As String\n\n  Print \"Enter q to quit at any time\\nThe computer will choose first\"\n\n  While gameConunt < 21\n    Print \"ROUND: \" & numRound & \"\\n\"\n    gameConunt += selectCount(gameConunt)\n    Print Subst(\"Running total is now &1 \\n \", gameConunt)\n    If gameConunt = 21 Then\n      Inc winComputer\n      Print \"The computer has won\u00a0!\\n\"\n      endGame()\n    Endif\n    gameConunt += humanCount(gameConunt)\n    Print Subst(\"Running total is now &1\", gameConunt)\n    If gameConunt = 21 Then\n      Inc winPlayer\n      Print \"Congratulations! You've won!\\n\"\n      endGame()\n    Endif\n    Inc numRound\n  Wend\n\nEnd\n\nPrivate Function selectCount(cou As Integer) As Integer\n\n  Dim a As Integer\n\n  Randomize\n\n  If cou < 18 Then\n    a = Int(Rnd(1, 4))\n  Else\n    a = 21 - cou\n  Endif\n\n  Print \"The computer choose \" & a\n\n  Return a\n\nEnd\n\nPrivate Function humanCount(cou As Integer) As Integer\n\n  Dim entra As String\n  Dim a As Integer\n\n  While True\n    Print \"Your choice 1 to 3\"\n    Input entra\n    If entra = \"q\" Then\n      Print \"Good Bye!\"\n      Quit\n    Endif\n    Try a = CInt(entra)\n    If Error Then\n      Print \"Invalid entry, try again\"\n      Continue\n    Endif\n    If a < 1 Or a > 3 Then\n      Print \"Out of range, try again\"\n      Continue\n    Endif\n    If a + cou > 21 Then\n      Print \"The sum is greater than 21, try again\"\n      Continue\n    Endif    \n    Return a\n  Wend\n\nEnd\n\n\nPrivate Sub endGame()\n\n  Dim entra As String\n\n  Print Subst(\"Computer wins &1 games, human wins &2 games\", winComputer, winPlayer)\n  Print \"\\nPlay again? (y/n)\"\n  Input entra\n  If entra = \"y\" Or entra = \"Y\" Then\n    numRound = 1\n    gameConunt = 0\n    Print \"Enter q to quit at any time\\nThe computer will choose first\"\n  Else\n    Print \"Good Bye!\"\n    Quit\n  Endif\n\nEnd\n",
        "safe": true
    },
    {
        "filename": "21 game_4.txt",
        "content": " 5  DIM P$(2),HC(2),CA(4),CN$(6): READ CA(0),CA(1),CA(2),CA(3): FOR I = 1 TO 6: READ CN$(I): NEXT : DEF  FN M(X) = (X - ( INT (X / 4)) * 4): DEF  FN U(K) = K - (K > 95) * 32:L$ = \" \":M$ =  CHR$ (13): DATA 1,1,3,2\n 9  FOR PLAY = 0 TO 1\n 10     REM SET SCREEN COLORS HERE\n 11     LET C% =  INT ( RND (1) * 16)\n 12     LET B% =  INT ( RND (1) * 15 + C% + 1): IF B% > 15 THEN B% = B% - 16\n 13     POKE 49186,C% + B% * 16: REM FOREGROUND&BACKGROUND\n 14     POKE 49204, INT ( RND (1) * 16): REM BORDER\n 20     HOME : PRINT M$ SPC( 16);\"21 GAME\"M$M$\" THE GOAL OF THIS GAME IS TO TAKE TURNS\"M$\" ADDING THE VALUE OF EITHER 1, 2, OR 3\"M$\" TO A RUNNING TOTAL. THE FIRST PLAYER\"M$\" TO BRING THE TOTAL TO 21...\"M$M$ SPC( 10);\"... WINS THE GAME!\"M$\n 30     GOSUB 1000\n 40     FOR SETUP = 0 TO 1: HOME : PRINT \n 42         FOR P = 1 TO 2\n 44             PRINT M$\"PLAYER\";L$;P;\", [H]UMAN OR [C]OMPUTER? \";\n 45             FOR K = 0 TO 1: GET K$:K$ =  CHR$ ( FN U( ASC (K$))):K = K$ = \"C\" OR K$ = \"H\": NEXT K\n 46              PRINT K$M$M$\"PLAYER\";L$;P;\",\": PRINT \"ENTER YOUR NAME\";\n 50              LET HC(P) = (K$ = \"C\"): IF HC(P) THEN  FOR PC = 0 TO 1:PN =  INT ( RND (1) * 6) + 1:T$ = CN$(PN):PC = T$ <  > P$(P - 1): NEXT PC:P$(P) = T$: PRINT \"? \";P$(P)\n 52              IF  NOT HC(P) THEN  INPUT P$(P)\n 54          NEXT P\n 60          FOR P = 1 TO 2: PRINT M$L$;P;\". \";P$(P);: NEXT P: PRINT M$M$\"IS THIS CORRECT (Y/N)? \";: FOR K = 0 TO 1: GET K$:K$ =  CHR$ ( FN U( ASC (K$))):K = K$ = \"Y\" OR K$ = \"N\": NEXT K: PRINT K$:SETUP = K$ <  > \"N\"\n 70      NEXT SETUP\n 80      PRINT M$\"WHO WILL PLAY FIRST (1 OR 2)? \";: FOR K = 0 TO 1: GET K$:K = K$ = \"1\" OR K$ = \"2\": NEXT K\n 90     FP =  VAL (K$): PRINT K$M$M$\"OKAY, \";P$(FP);\" WILL PLAY FIRST.\"M$: GOSUB 1000\n 100    LET RT = 0:PI = FP - 1\n 110    FOR GAME = 0 TO 1\n 115        PI = PI * (PI < 2) + 1: HOME : PRINT \"TOTAL SO FAR:\";L$;RT;M$M$P$(PI);\"'S TURN.\"\n 120        IF HC(PI) THEN  PRINT M$\"THINKING...\";:TT =  INT ( RND (1) * 10): FOR T = 1 TO TT: PRINT \".\";: FOR I = 1 TO 250: NEXT I,T:RM =  FN M(RT):AD = CA(RM): PRINT M$M$P$(PI);\" ADDS\";L$;CA(RM);\".\": FOR T = 1 TO 1000: NEXT T\n 125        IF  NOT HC(PI) THEN  FOR AMOUNT = 0 TO 1: PRINT  MID$ (M$ + \"ILLEGAL AMOUNT. TRY AGAIN.\" + M$,1,AMOUNT * 255)M$\"HOW MUCH TO ADD,\": INPUT \"1, 2, OR 3 (0 TO QUIT)\u00a0?\";AD:AMOUNT = AD >  = 0 AND AD <  = 3: NEXT AMOUNT\n 128        LET RT = RT + AD:GAME = RT >  = 21 OR AD = 0\n 130      NEXT GAME\n 140      IF RT > 21 THEN  PRINT M$P$(PI);\" LOSES BY GOING OVER 21!!\"\n 150      IF RT = 21 THEN  PRINT M$\"21! \";P$(PI);\" WINS THE GAME!!!\"\n 160      IF  NOT AD THEN  PRINT M$\"GAME WAS ENDED BY \";P$(PI);\".\":PLAY = 1\n 210      IF AD THEN  PRINT : PRINT \"WOULD YOU LIKE TO PLAY AGAIN? \";: FOR K = 0 TO 1: GET K$:K$ =  CHR$ ( FN U( ASC (K$))):K = K$ = \"N\" OR K$ = \"Y\": NEXT K: PRINT K$:PLAY = K$ = \"N\"\n 220  NEXT PLAY\n 230  IF AD THEN  PRINT M$\"OKAY, MAYBE ANOTHER TIME. BYE!\"\n 240  END \n 1000 Z$ = \" PRESS A KEY TO CONTINUE. \": PRINT  SPC( 20 -  INT ( LEN (Z$) / 2));: INVERSE : PRINT Z$;: NORMAL : WAIT 49152,128:K =  PEEK (49168): RETURN \n 2010  DATA \"APPLE IIE\",\"APPLE II PLUS\",\"APPLE IIC\",\"APPLE II\",\"APPLE IIGS\",\"MACINTOSH LC\"\n",
        "safe": true
    },
    {
        "filename": "21 game_40.txt",
        "content": "Enter q to quit at any time\nThe computer will choose first\nROUND: 1\n\nThe computer choose 2\nRunning total is now 2 \n \nYour choice 1 to 3\n4\nOut of range, try again\nYour choice 1 to 3\n0\nOut of range, try again\nYour choice 1 to 3\ng\nInvalid entry, try again\nYour choice 1 to 3\n1\nRunning total is now 3\nROUND: 2\n\nThe computer choose 2\nRunning total is now 5 \n \nYour choice 1 to 3\n3\nRunning total is now 8\nROUND: 3\n\nThe computer choose 2\nRunning total is now 10 \n \nYour choice 1 to 3\n3\nRunning total is now 13\nROUND: 4\n\nThe computer choose 2\nRunning total is now 15 \n \nYour choice 1 to 3\n3\nRunning total is now 18\nROUND: 5\n\nThe computer choose 3\nRunning total is now 21 \n \nThe computer has won\u00a0!\n\ncomputer wins 1 games, human wins 0 games\n\nPlay again? (y/n)\n\nGood Bye!\n",
        "safe": true
    },
    {
        "filename": "21 game_41.txt",
        "content": "extends MainLoop\n\n\nenum Player {Human, Computer}\n\nconst target: int = 21\n\n\n# -1 is returned to request quit\nfunc get_player_choice(total: int) -> int:\n\twhile true:\n\t\tprintraw(\"Player's choice: \")\n\t\tvar input: String = OS.read_string_from_stdin().strip_edges()\n\n\t\tif input == \"quit\":\n\t\t\treturn -1\n\n\t\tif not input.is_valid_int():\n\t\t\tprint(\"Please input an integer.\")\n\t\t\tcontinue\n\n\t\tvar input_int := int(input)\n\t\tif input_int < 1 or input_int > 3:\n\t\t\tprint(\"Please pick a number from 1 to 3\")\n\t\t\tcontinue\n\n\t\tif input_int + total > target:\n\t\t\tprint(\"Please do not exceed a total of %d\" % target)\n\t\t\tcontinue\n\n\t\treturn input_int\n\n\t# This is required since Godot does not detect the unreachable code path\n\tOS.crash(\"unreachable\")\n\treturn 0\n\n\nfunc get_computer_choice(total: int) -> int:\n\t# This can be shortened using max() if you do not have type checking OCD\n\tvar remaining: int = target - total\n\treturn randi_range(1, 3 if remaining > 3 else remaining)\n\n\nfunc play() -> void:\n\tprint(\"\"\"\\\nWelcome to the 21 game.\nType quit to exit.\"\"\")\n\tvar total: int = 0\n\tvar player: Player\n\tmatch randi_range(1, 2):\n\t\t1:\n\t\t\tplayer = Player.Human\n\t\t\tprint(\"You will go first.\")\n\t\t2:\n\t\t\tplayer = Player.Computer\n\t\t\tprint(\"The computer will go first.\")\n\n\twhile true:\n\t\tprint(\"\\nThe total is %d\" % total)\n\n\t\tvar choice: int\n\t\tmatch player:\n\t\t\tPlayer.Human:\n\t\t\t\tchoice = get_player_choice(total)\n\t\t\t\tif choice == -1:\n\t\t\t\t\treturn\n\t\t\tPlayer.Computer:\n\t\t\t\tchoice = get_computer_choice(total)\n\t\t\t\tprint(\"The computer plays %d\" % choice)\n\t\tassert(1 <= choice and choice <= 3)\n\n\t\ttotal += choice\n\t\tif total == target:\n\t\t\tmatch player:\n\t\t\t\tPlayer.Human: print(\"You win!\")\n\t\t\t\tPlayer.Computer: print(\"The computer won, you lose.\")\n\t\t\treturn\n\t\tassert(total < target)\n\n\t\tmatch player:\n\t\t\tPlayer.Human: player = Player.Computer\n\t\t\tPlayer.Computer: player = Player.Human\n\n\nfunc _process(_delta: float) -> bool:\n\trandomize()\n\tplay()\n\treturn true\n",
        "safe": true
    },
    {
        "filename": "21 game_42.txt",
        "content": "package main\n\nimport (\n    \"bufio\"\n    \"fmt\"\n    \"log\"\n    \"math/rand\"\n    \"os\"\n    \"strconv\"\n    \"time\"\n)\n\nvar scanner = bufio.NewScanner(os.Stdin)\n\nvar (\n    total = 0\n    quit  = false\n)\n\nfunc itob(i int) bool {\n    if i == 0 {\n        return false\n    }\n    return true\n}\n\nfunc getChoice() {\n    for {\n        fmt.Print(\"Your choice 1 to 3\u00a0: \")\n        scanner.Scan()\n        if scerr := scanner.Err(); scerr != nil {\n            log.Fatalln(scerr, \"when choosing number\")\n        }\n        text := scanner.Text()\n        if text == \"q\" || text == \"Q\" {\n            quit = true\n            return\n        }\n        input, err := strconv.Atoi(text)\n        if err != nil {\n            fmt.Println(\"Invalid number, try again\")\n            continue\n        }\n        newTotal := total + input\n        switch {\n        case input < 1 || input > 3:\n            fmt.Println(\"Out of range, try again\")\n        case newTotal > 21:\n            fmt.Println(\"Too big, try again\")\n        default:\n            total = newTotal\n            fmt.Println(\"Running total is now\", total)\n            return\n        }\n    }\n}\n\nfunc main() {\n    rand.Seed(time.Now().UnixNano())\n    computer := itob(rand.Intn(2))\n    fmt.Println(\"Enter q to quit at any time\\n\")\n    if computer {\n        fmt.Println(\"The computer will choose first\")\n    } else {\n        fmt.Println(\"You will choose first\")\n    }\n    fmt.Println(\"\\nRunning total is now 0\\n\")\n    var choice int\n    for round := 1; ; round++ {\n        fmt.Printf(\"ROUND %d:\\n\\n\", round)\n        for i := 0; i < 2; i++ {\n            if computer {\n                if total < 18 {\n                    choice = 1 + rand.Intn(3)\n                } else {\n                    choice = 21 - total\n                }\n                total += choice\n                fmt.Println(\"The computer chooses\", choice)\n                fmt.Println(\"Running total is now\", total)\n                if total == 21 {\n                    fmt.Println(\"\\nSo, commiserations, the computer has won!\")\n                    return\n                }\n            } else {\n                getChoice()\n                if quit {\n                    fmt.Println(\"OK, quitting the game\")\n                    return\n                }\n                if total == 21 {\n                    fmt.Println(\"\\nSo, congratulations, you've won!\")\n                    return\n                }\n            }\n            fmt.Println()\n            computer = !computer\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "21 game_43.txt",
        "content": "Enter q to quit at any time\n\nThe computer will choose first\n\nRunning total is now 0\n\nROUND 1:\n\nThe computer chooses 1\nRunning total is now 1\n\nYour choice 1 to 3\u00a0: 3\nRunning total is now 4\n\nROUND 2:\n\nThe computer chooses 2\nRunning total is now 6\n\nYour choice 1 to 3\u00a0: 4\nOut of range, try again\nYour choice 1 to 3\u00a0: 3\nRunning total is now 9\n\nROUND 3:\n\nThe computer chooses 2\nRunning total is now 11\n\nYour choice 1 to 3\u00a0: 2\nRunning total is now 13\n\nROUND 4:\n\nThe computer chooses 2\nRunning total is now 15\n\nYour choice 1 to 3\u00a0: 2\nRunning total is now 17\n\nROUND 5:\n\nThe computer chooses 1\nRunning total is now 18\n\nYour choice 1 to 3\u00a0: 3\nRunning total is now 21\n\nSo, congratulations, you've won!\n",
        "safe": true
    },
    {
        "filename": "21 game_44.txt",
        "content": "Enter q to quit at any time\n\nThe computer will choose first\n\nRunning total is now 0\n\nROUND 1:\n\nThe computer chooses 3\nRunning total is now 3\n\nYour choice 1 to 3\u00a0: 3\nRunning total is now 6\n\nROUND 2:\n\nThe computer chooses 3\nRunning total is now 9\n\nYour choice 1 to 3\u00a0: 3\nRunning total is now 12\n\nROUND 3:\n\nThe computer chooses 1\nRunning total is now 13\n\nYour choice 1 to 3\u00a0: 3\nRunning total is now 16\n\nROUND 4:\n\nThe computer chooses 1\nRunning total is now 17\n\nYour choice 1 to 3\u00a0: 1\nRunning total is now 18\n\nROUND 5:\n\nThe computer chooses 3\nRunning total is now 21\n\nSo, commiserations, the computer has won!\n",
        "safe": true
    },
    {
        "filename": "21 game_45.txt",
        "content": "import System.Random\nimport System.IO\nimport System.Exit\nimport Control.Monad\nimport Text.Read\nimport Data.Maybe\n\npromptAgain :: IO Int\npromptAgain = do\n  putStrLn \"Invalid input - must be a number among 1,2 or 3. Try again.\"\n  playerMove\n\nplayerMove :: IO Int\nplayerMove = do\n  putStr \"Your choice(1 to 3):\"\n  number <- getLine\n  when (number == \"q\") $ do\n    exitWith ExitSuccess\n  let n = readMaybe number :: Maybe Int\n  x <- if isNothing n\n             then promptAgain\n             else let val = read number\n                   in if (val > 3 || val < 1)\n                      then promptAgain\n                      else return val\n  return x\n\ncomputerMove :: IO Int\ncomputerMove = do\n  x <- randomRIO (1, 3)\n  putStrLn $ \"Computer move:\" ++ (show x)\n  return x\n\ngameLoop :: (IO Int, IO Int) -> IO Int\ngameLoop moveorder = loop moveorder 0\n  where loop moveorder total = do\n        number <- fst moveorder\n        let total1 = number + total\n        putStrLn $ \"Running total:\" ++ (show total1)\n        if total1 >= 21\n           then return 0\n           else do\n             number <- snd moveorder\n             let total2 = number + total1\n             putStrLn $ \"Running total:\" ++ (show total2)\n             if total2 >= 21\n                then return 1\n                else loop moveorder total2\n\nmain :: IO ()\nmain = do\n  hSetBuffering stdout $ BlockBuffering $ Just 1\n  putStrLn \"Enter q to quit at any time\"\n  x <- randomRIO (0, 1) :: IO Int\n  let (moveorder, names) = if x == 0\n                 then ((playerMove, computerMove), (\"Player\", \"Computer\"))\n                 else ((computerMove, playerMove), (\"Computer\", \"Player\"))\n  when (x == 1) $ do\n    putStrLn \"Computer will start the game\"\n  y <- gameLoop moveorder\n  when (y == 0) $ do\n    putStrLn $ (fst names) ++ \" has won the game\"\n  when (y == 1) $ do\n    putStrLn $ (snd names) ++ \" has won the game\"\n",
        "safe": true
    },
    {
        "filename": "21 game_46.txt",
        "content": "g21=: summarize@play@setup ::'g21: error termination'\n\nUntil=: {{u^:(0-:v)^:_}}\n\n'score turn choice'=: 0 1 2\n\nplay=: move Until done\nmove=: [: update you`it@.(turn&{) \ndone=: 21 <: score&{\n\n\nupdate=: swap@display@add\nadd=: score}~ score&{ + choice&{\ndisplay=: [ 'sum: {}' echo@format~ score&{\nswap=: turn}~ [: -. turn&{\n\nit=: ([ 'It chose {}.' echo@format~ choice&{)@(choice}~ cb)\ncb=: 1:`(>:@?@3)`3:`2:@.(4 | score&{)     NB. computer brain\n\nyou=: qio1@check@acquire@prompt\nprompt=: [ echo@'your choice?'\nacquire=: choice}~'123'i.0{' ',~read\ncheck=: (choice}~ 665 - score&{)@([ echo@'g21: early termination')^:(3 = choice&{)\nqio1=: choice}~ ([: >: choice&{)\n\nsetup=: ([ echo@'On your turn enter 1 2 or 3, other entries exit')@(?@2 turn} ])@0 0 0  NB. choose first player randomly\n\nsummarize=: ' won',~ ];._2@'it you '{~turn&{\n\nread=: 1!:1@1\nwrite=: 1!:2&4 NB. unused\nformat=: ''&$: : ([: ; (a: , [: \":&.> [) ,. '{}' ([ (E. <@}.;._1 ]) ,) ])\n",
        "safe": true
    },
    {
        "filename": "21 game_47.txt",
        "content": "   g21''\nOn your turn enter 1 2 or 3, other entries exit\nIt chose 1.\nsum: 1\nyour choice?\nq\ng21: early termination\nsum: 666\nyou won\n\n   \n   g21''\nOn your turn enter 1 2 or 3, other entries exit\nyour choice?\n2\nsum: 2\nIt chose 3.\nsum: 5\nyour choice?\n1\nsum: 6\nIt chose 3.\nsum: 9\nyour choice?\n2\nsum: 11\nIt chose 2.\nsum: 13\nyour choice?\n3\nsum: 16\nIt chose 1.\nsum: 17\nyour choice?\n1\nsum: 18\nIt chose 3.\nsum: 21\nit  won\n",
        "safe": true
    },
    {
        "filename": "21 game_48.txt",
        "content": "import java.util.Random;\nimport java.util.Scanner;\n\npublic class TwentyOneGame {\n\n    public static void main(String[] args) {\n        new TwentyOneGame().run(true, 21, new int[] {1, 2, 3});\n    }\n    \n    public void run(boolean computerPlay, int max, int[] valid) {\n        String comma = \"\";\n        for ( int i = 0 ; i < valid.length ; i++ ) {\n            comma += valid[i];\n            if ( i < valid.length - 2 && valid.length >= 3 ) {\n                comma += \", \";\n            }\n            if ( i == valid.length - 2 ) {\n                comma += \" or \";\n            }\n        }\n        System.out.printf(\"The %d game.%nEach player chooses to add %s to a running total.%n\" + \n                \"The player whose turn it is when the total reaches %d will win the game.%n\" + \n                \"Winner of the game starts the next game.  Enter q to quit.%n%n\", max, comma, max);\n        int cGames = 0;\n        int hGames = 0;\n        boolean anotherGame = true;\n        try (Scanner scanner = new Scanner(System.in);) {\n            while ( anotherGame ) {\n                Random r = new Random();\n                int round = 0;\n                int total = 0;\n                System.out.printf(\"Start game %d%n\", hGames + cGames + 1);\n                DONE:\n                    while ( true ) {\n                        round++;\n                        System.out.printf(\"ROUND %d:%n%n\", round);\n                        for ( int play = 0 ; play < 2 ; play++ ) {\n                            if ( computerPlay ) {\n                                int guess = 0;\n                                //  try find one equal\n                                for ( int test : valid ) {\n                                    if ( total + test == max ) {\n                                        guess = test;\n                                        break;\n                                    }\n                                }\n                                //  try find one greater than\n                                if ( guess == 0 ) {\n                                    for ( int test : valid ) {\n                                        if ( total + test >= max ) {\n                                            guess = test;\n                                            break;\n                                        }\n                                    }\n                                }\n                                if ( guess == 0 ) {\n                                    guess = valid[r.nextInt(valid.length)];\n                                }\n                                total += guess;\n                                System.out.printf(\"The computer chooses %d%n\", guess);\n                                System.out.printf(\"Running total is now %d%n%n\", total);\n                                if ( total >= max ) {\n                                    break DONE;\n                                }\n                            }\n                            else {\n                                while ( true ) {\n                                    System.out.printf(\"Your choice among %s: \", comma);\n                                    String line = scanner.nextLine();\n                                    if ( line.matches(\"^[qQ].*\") ) {\n                                        System.out.printf(\"Computer wins %d game%s, human wins %d game%s.  One game incomplete.%nQuitting.%n\", cGames, cGames == 1 ? \"\" : \"s\", hGames, hGames == 1 ? \"\" : \"s\");\n                                        return;\n                                    }\n                                    try {\n                                        int input = Integer.parseInt(line);\n                                        boolean inputOk = false;\n                                        for ( int test : valid ) {\n                                            if ( input == test ) {\n                                                inputOk = true;\n                                                break;\n                                            }\n                                        }\n                                        if ( inputOk ) {\n                                            total += input;\n                                            System.out.printf(\"Running total is now %d%n%n\", total);\n                                            if ( total >= max ) {\n                                                break DONE;\n                                            }\n                                            break;\n                                        }\n                                        else {\n                                            System.out.printf(\"Invalid input - must be a number among %s.  Try again.%n\", comma);\n                                        }\n                                    }\n                                    catch (NumberFormatException e) {\n                                        System.out.printf(\"Invalid input - must be a number among %s.  Try again.%n\", comma);\n                                    }\n                                }\n                            }\n                            computerPlay = !computerPlay;\n                        }\n                    }\n                String win;\n                if ( computerPlay ) {\n                    win = \"Computer wins!!\";\n                    cGames++;\n                }\n                else {\n                    win = \"You win and probably had help from another computer!!\";\n                    hGames++;\n                }\n                System.out.printf(\"%s%n\", win);\n                System.out.printf(\"Computer wins %d game%s, human wins %d game%s%n%n\", cGames, cGames == 1 ? \"\" : \"s\", hGames, hGames == 1 ? \"\" : \"s\");\n                while ( true ) {\n                    System.out.printf(\"Another game (y/n)? \");\n                    String line = scanner.nextLine();\n                    if ( line.matches(\"^[yY]$\") ) {\n                        //  OK\n                        System.out.printf(\"%n\");\n                        break;\n                    }\n                    else if ( line.matches(\"^[nN]$\") ) {\n                        anotherGame = false;\n                        System.out.printf(\"Quitting.%n\");\n                        break;\n                    }\n                    else {\n                        System.out.printf(\"Invalid input - must be a y or n.  Try again.%n\");\n                    }\n                }\n            }\n        }\n    }\n\n}\n",
        "safe": true
    },
    {
        "filename": "21 game_49.txt",
        "content": "The 21 game.\nEach player chooses to add 1, 2 or 3 to a running total.\nThe player whose turn it is when the total reaches 21 will win the game.\nWinner of the game starts the next game.  Enter q to quit.\n\nStart game 1\nROUND 1:\n\nThe computer chooses 3\nRunning total is now 3\n\nYour choice among 1, 2 or 3: 4\nInvalid input - must be a number among 1, 2 or 3.  Try again.\nYour choice among 1, 2 or 3: r\nInvalid input - must be a number among 1, 2 or 3.  Try again.\nYour choice among 1, 2 or 3: 1\nRunning total is now 4\n\nROUND 2:\n\nThe computer chooses 1\nRunning total is now 5\n\nYour choice among 1, 2 or 3: 3\nRunning total is now 8\n\nROUND 3:\n\nThe computer chooses 1\nRunning total is now 9\n\nYour choice among 1, 2 or 3: 3\nRunning total is now 12\n\nROUND 4:\n\nThe computer chooses 3\nRunning total is now 15\n\nYour choice among 1, 2 or 3: 2\nRunning total is now 17\n\nROUND 5:\n\nThe computer chooses 3\nRunning total is now 20\n\nYour choice among 1, 2 or 3: 1\nRunning total is now 21\n\nYou win and probably had help from another computer!!\nComputer wins 0 games, human wins 1 game\n\nAnother game (y/n)? y\n\nStart game 2\nROUND 1:\n\nYour choice among 1, 2 or 3: 3\nRunning total is now 3\n\nThe computer chooses 1\nRunning total is now 4\n\nROUND 2:\n\nYour choice among 1, 2 or 3: 3\nRunning total is now 7\n\nThe computer chooses 3\nRunning total is now 10\n\nROUND 3:\n\nYour choice among 1, 2 or 3: 3\nRunning total is now 13\n\nThe computer chooses 2\nRunning total is now 15\n\nROUND 4:\n\nYour choice among 1, 2 or 3: 2\nRunning total is now 17\n\nThe computer chooses 1\nRunning total is now 18\n\nROUND 5:\n\nYour choice among 1, 2 or 3: 3\nRunning total is now 21\n\nYou win and probably had help from another computer!!\nComputer wins 0 games, human wins 2 games\n\nAnother game (y/n)? y\n\nStart game 3\nROUND 1:\n\nYour choice among 1, 2 or 3: 3\nRunning total is now 3\n\nThe computer chooses 3\nRunning total is now 6\n\nROUND 2:\n\nYour choice among 1, 2 or 3: 3\nRunning total is now 9\n\nThe computer chooses 2\nRunning total is now 11\n\nROUND 3:\n\nYour choice among 1, 2 or 3: 3\nRunning total is now 14\n\nThe computer chooses 2\nRunning total is now 16\n\nROUND 4:\n\nYour choice among 1, 2 or 3: 3\nRunning total is now 19\n\nThe computer chooses 2\nRunning total is now 21\n\nComputer wins!!\nComputer wins 1 game, human wins 2 games\n\nAnother game (y/n)? n\nQuitting.\n",
        "safe": true
    },
    {
        "filename": "21 game_5.txt",
        "content": "/* ARM assembly Raspberry PI  */\n/*  program game21.s   */ \n\n/* REMARK 1\u00a0: this program use routines in a include file \n   see task Include a file language arm assembly \n   for the routine affichageMess conversion10 \n   see at end of this program the instruction include */\n/* for constantes see task include a file in arm assembly */\n/************************************/\n/* Constantes                       */\n/************************************/\n.include \"../constantes.inc\"\n.equ STDIN,  0       @ Linux input console\n.equ READ,   3       @ Linux syscall\n.equ HITTOTAL,   21\n.equ BUFFERSIZE, 10\n\n\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nszMessRules:         .ascii \"21 Game\\n\"\n                    .ascii \"21 is a two player game, the game is played by choosing a number \\n\"\n                    .ascii \"(1, 2, or 3) to be added to the running total. The game is won by\\n\"\n                    .ascii \"the player whose chosen number causes the running total to reach \\n\"\n                    .asciz \"exactly 21. The running total starts at zero.\\n\\n\\n\"\n\nszMessHumanChoice:  .asciz \"Enter your choice (1,2, 3 or type (q)uit to exit): \"\nszMessErrChoise:    .asciz \"invalid choice.\\n \"\nszMessHumanBegin:   .asciz \"The first move is human move.\\n\"\nszMessPiBegin:      .asciz \"The first move is Raspberry pi. \\n\"\nszMessHumanWon:     .asciz \"You won. \\n\"\nszMessHumanLost:    .asciz \"You lost. \\n\"\nszMessTotal:        .asciz \"The running total is @ \\n\"\nszMessPiChoice:     .asciz \"Raspberry choice if  @ \\n\" \nszMessNewGame:      .asciz \"New game (y/n)\u00a0? \\n\"\nszCarriageReturn:   .asciz \"\\n\"\n.align 4\niGraine:  .int 123456\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\nsZoneConv:        .skip 24\nsBuffer:          .skip BUFFERSIZE\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                 @ entry of program \n    \n    ldr r0,iAdrszMessRules\n    bl affichageMess\n1:\n    mov r10,#0                         @ total = 0\n    mov r0,#100\n    bl genereraleas \n    cmp r0,#50\n    blt 2f\n    ldr r0,iAdrszMessHumanBegin        @ human begin\n    bl affichageMess\n    b 4f\n2:                                     @ Rasp begin\n    ldr r0,iAdrszMessPiBegin\n    bl affichageMess\n    mov r0,#1\n3:                                    @ rasp turn\n    add r10,r10,r0\n    ldr r1,iAdrsZoneConv\n    bl conversion10                   @ call decimal conversion\n    ldr r0,iAdrszMessPiChoice\n    ldr r1,iAdrsZoneConv              @ insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n    cmp r10,#HITTOTAL\n    bne 4f\n    ldr r0,iAdrszMessHumanLost\n    bl affichageMess\n    b 10f\n4:                                    @ display current total\n    mov r0,r10\n    ldr r1,iAdrsZoneConv\n    bl conversion10                   @ call decimal conversion\n    ldr r0,iAdrszMessTotal\n    ldr r1,iAdrsZoneConv              @ insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n\n5:                                    @ human turn\n    ldr r0,iAdrszMessHumanChoice\n    bl affichageMess\n    bl saisie\n    cmp r0,#'q'                       @ quit\u00a0?\n    beq 100f\n    cmp r0,#'Q'\n    beq 100f\n    cmp r0,#'1'\n    addeq r10,r10,#1\n    beq 6f\n    cmp r0,#'2'\n    addeq r10,r10,#2\n    beq 6f\n    cmp r0,#'3'\n    addeq r10,r10,#3\n    beq 6f\n    ldr r0,iAdrszMessErrChoise\n    bl affichageMess\n    b 5b\n6:\n    cmp r10,#HITTOTAL                @ total = maxi\u00a0?\n    beq 9f                           @ yes -> human won\n    cmp r10,#5                       @ else compute rasp number\n    rsble r0,r10,#5\n    ble 7f\n    cmp r10,#9\n    rsble r0,r10,#9\n    ble 7f\n    cmp r10,#13\n    rsble r0,r10,#13\n    ble 7f\n    cmp r10,#17\n    rsble r0,r10,#17\n    ble 7f\n    cmp r10,#21\n    rsble r0,r10,#21\n    ble 7f\n7:                                  @ control number rasp\n    cmp r0,#0\n    ble 8f\n    cmp r0,#3\n    ble 3b\n8:                                  @ if not ok, generate random number\n    mov r0,#2\n    bl genereraleas\n    add r0,r0,#1\n    b 3b                            @ and loop\n    \n9:                                  @ display human won\n    ldr r0,iAdrszMessHumanWon\n    bl affichageMess\n10:                                 @ display new game\u00a0?\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess\n    ldr r0,iAdrszMessNewGame\n    bl affichageMess\n    bl saisie\n    cmp r0,#'y'\n    beq 1b\n    cmp r0,#'Y'\n    beq 1b\n    \n100:                                  @ standard end of the program \n    mov r0, #0                        @ return code\n    mov r7, #EXIT                     @ request to exit program\n    svc #0                            @ perform the system call\n \niAdrszCarriageReturn:     .int szCarriageReturn\niAdrszMessRules:          .int szMessRules\niAdrszMessHumanBegin:     .int szMessHumanBegin\niAdrszMessPiBegin:        .int szMessPiBegin\niAdrszMessPiChoice:       .int szMessPiChoice\niAdrszMessTotal:          .int szMessTotal\niAdrszMessHumanChoice:    .int szMessHumanChoice\niAdrszMessHumanLost:      .int szMessHumanLost\niAdrszMessHumanWon:       .int szMessHumanWon\niAdrszMessNewGame:        .int szMessNewGame\niAdrszMessErrChoise:      .int szMessErrChoise\niAdrsZoneConv:            .int sZoneConv\n/******************************************************************/\n/*            string saisie                                       */ \n/******************************************************************/\n/* r0 return the first character of human entry */\nsaisie:\n    push {r1-r7,lr}        @ save registers\n    mov r0,#STDIN          @ Linux input console\n    ldr r1,iAdrsBuffer     @ buffer address \n    mov r2,#BUFFERSIZE     @ buffer size \n    mov r7,#READ           @ request to read datas\n    svc 0                  @ call system\n    ldr r1,iAdrsBuffer     @ buffer address \n    ldrb r0,[r1]           @ load first character\n100:\n    pop {r1-r7,lr}\n    bx lr                   @ return \niAdrsBuffer:         .int sBuffer\n/***************************************************/\n/*   Generation random number                  */\n/***************************************************/\n/* r0 contains limit  */\ngenereraleas:\n    push {r1-r4,lr}                   @ save registers \n    ldr r4,iAdriGraine\n    ldr r2,[r4]\n    ldr r3,iNbDep1\n    mul r2,r3,r2\n    ldr r3,iNbDep1\n    add r2,r2,r3\n    str r2,[r4]                       @ maj de la graine pour l appel suivant \n    cmp r0,#0\n    beq 100f\n    mov r1,r0                         @ divisor\n    mov r0,r2                         @ dividende\n    bl division\n    mov r0,r3                         @ r\u00e9sult = remainder\n  \n100:                                  @ end function\n    pop {r1-r4,lr}                    @ restaur registers\n    bx lr                             @ return\n/*****************************************************/\niAdriGraine: .int iGraine\niNbDep1:     .int 0x343FD\niNbDep2:     .int 0x269EC3 \n/***************************************************/\n/*      ROUTINES INCLUDE                           */\n/***************************************************/\n.include \"../affichage.inc\"",
        "safe": true
    },
    {
        "filename": "21 game_50.txt",
        "content": "<!DOCTYPE html><html lang=\"en\">\n\n<head>\n    <meta charset=\"UTF-8\">\n    <meta name=\"keywords\"    content=\"Game 21\">\n    <meta name=\"description\" content=\"\n      21 is a two player game, the game is played by choosing a number\n      (1, 2, or 3) to be added to the running total. The game is won by\n      the player whose chosen number causes the running total to reach\n      exactly 21. The running total starts at zero.\n    \">\n    <!--DCMI metadata (Dublin Core Metadata Initiative)-->\n    <meta name=\"dc.publisher\" content=\"Rosseta Code\">\n    <meta name=\"dc.date\"      content=\"2020-07-23\">\n    <meta name=\"dc.created\"   content=\"2020-07-23\">\n    <meta name=\"dc.modified\"  content=\"2020-07-30\">\n    <title>\n        21 Game\n    </title>\n    <!-- Remove the line below in the final/production version. -->\n    <meta http-equiv=\"cache-control\" content=\"no-cache\">\n\n    <style>\n      .ui div   { width: 50%; display: inline-flex; justify-content: flex-end; }\n      div.total { margin-bottom: 1ch; }\n      label     { padding-right: 1ch; }\n      button + button { margin-left: 1em; }\n    </style>\n</head>\n\n<body>\n  <h1>\n    21 Game in ECMA Script (Java Script)\n  </h1>\n\n  <p>\n    21 is a two player game, the game is played by choosing a number\n    (1, 2, or 3) to be added to the running total. The game is won by\n    the player whose chosen number causes the running total to reach\n    exactly 21. The running total starts at zero.\n  </p>\n\n  <p><span id=\"first\"></span> Use buttons to play.</p>\n\n  <div class=\"ui\">\n    <div class=\"total\">\n      <label for=\"human\">human last choice:</label>\n      <input type=\"text\" id=\"human\" readonly>\n    </div>\n    <div class=\"total\">\n      <label for=\"AI\">AI last choice:</label>\n      <input type=\"text\" id=\"AI\" readonly>\n    </div>\n    <div class=\"total\">\n      <label for=\"runningTotalText\">running total:</label>\n      <input type=\"text\" id=\"runningTotalText\" readonly>\n    </div>\n    <div class=\"buttons\">\n      <button onclick=\"choice(1);\" id=\"choice1\"> one   </button>\n      <button onclick=\"choice(2);\" id=\"choice2\"> two   </button>\n      <button onclick=\"choice(3);\" id=\"choice3\"> three </button>\n      <button onclick=\"restart();\"> restart </button>\n    </div>\n  </div>\n\n  <p id=\"message\"></p>\n\n  <noscript>\n    No script, no fun. Turn on Javascript on.\n  </noscript>\n\n  <script>\n    // I really dislike global variables, but in any (?) WWW browser the global\n    // variables are in the window (separately for each tab) context space.\n    //\n    var runningTotal = 0;\n    const human = document.getElementById('human');\n    const AI = document.getElementById('AI');\n    const runningTotalText = document.getElementById('runningTotalText');\n    const first = document.getElementById('first')\n    const message = document.getElementById('message');\n    const choiceButtons = new Array(3);\n\n    // An function to restart game in any time, should be called as a callback\n    // from the WWW page, see above for an example.\n    //\n    function restart()\n    {\n      runningTotal = 0;\n      runningTotalText.value = runningTotal;\n      human.value = '';\n      AI.value = '';\n      for (let i = 1; i <= 3; i++)\n      {\n        let button = document.getElementById('choice' + i);\n        button.disabled = false;\n        choiceButtons[i] = button;\n      }\n      message.innerText = '';\n      if (Math.random() > 0.5)\n      {\n        update(AI, ai());\n        first.innerText = 'The first move is AI move.'\n      }\n      else\n        first.innerText = 'The first move is human move.'\n    }\n\n    // This function update an (read-only for a user) two text boxes\n    // as well as runningTotal. It should be called only once per a move/turn.\n    //\n    function update(textBox, n)\n    {\n      textBox.value = n;\n      runningTotal = runningTotal + n;\n      runningTotalText.value = runningTotal;\n      for (let i = 1; i <= 3; i++)\n        if (runningTotal + i > 21)\n          choiceButtons[i].disabled = true;\n    }\n\n    // An callback function called when the human player click the button.\n    //\n    function choice(n)\n    {\n      update(human, n);\n      if (runningTotal == 21)\n        message.innerText = 'The winner is human.';\n      else\n      {\n        update(AI, ai());\n        if (runningTotal == 21)\n          message.innerText = 'The winner is AI.';\n      }\n    }\n\n    // A rather simple function to calculate a computer move for the given total.\n    //\n    function ai()\n    {\n      for (let i = 1; i <= 3; i++)\n        if (runningTotal + i == 21)\n          return i;\n\n      for (let i = 1; i <= 3; i++)\n        if ((runningTotal + i - 1) % 4 == 0)\n          return i;\n\n      return 1;\n    }\n\n    // Run the script - actually this part do only some initialization, because\n    // the game is interactively driven by events from an UI written in HTML.\n    //\n    restart();\n  </script>\n\n</body>\n</html>\n",
        "safe": true
    },
    {
        "filename": "21 game_51.txt",
        "content": "function trytowin(n)\n    if 21 - n < 4\n        println(\"Computer chooses $(21 - n) and wins. GG!\")\n        exit(0)\n    end\nend\n\nfunction choosewisely(n)\n    trytowin(n)\n    targets = [1, 5, 9, 13, 17, 21]\n    pos = findfirst(x -> x > n, targets)\n    bestmove = targets[pos] - n\n    if bestmove > 3\n        println(\"Looks like I could lose. Choosing a 1, total now $(n + 1).\")\n        return n + 1\n    end\n    println(\"On a roll, choosing a $bestmove, total now $(n + bestmove).\")\n    n + bestmove\nend\n\nfunction choosefoolishly(n)\n    trytowin(n)\n    move = rand([1, 2, 3])\n    println(\"Here goes, choosing $move, total now $(n + move).\")\n    n + move\nend\n\nfunction choosesemiwisely(n)\n    trytowin(n)\n    if rand() > 0.75\n        choosefoolishly(n)\n    else\n        choosewisely(n)\n    end\nend\n\nprompt(s) = (println(s, \": => \"); return readline())\n\nfunction playermove(n)\n    rang = (n > 19) ? \"1 is all\" : ((n > 18) ? \"1 or 2\" : \"1, 2 or 3\")\n    choice = 0\n    while true\n        nstr = prompt(\"Your choice ($rang), 0 to exit\")\n        if nstr == \"0\"\n            exit(0)\n        elseif nstr == \"1\"\n            return n + 1\n        elseif nstr == \"2\" && n < 20\n            return n + 2\n        elseif nstr == \"3\" && n < 19\n            return n + 3\n        end\n    end\nend\n\n\nfunction play21game()\n    n = 0\n    level = prompt(\"Level of play (1=dumb, 3=smart)\")\n    algo = choosewisely\n    if level == \"1\"\n        algo = choosefoolishly\n    elseif level == \"2\"\n        algo = choosesemiwisely\n    elseif level != \"3\"\n        println(\"Bad choice syntax--default to smart choice\")\n    end\n    whofirst = prompt(\"Does computer go first? (y or n)\")\n    if whofirst[1] == 'y' || whofirst[1] == 'Y'\n        n = algo(n)\n    end\n    while n < 21\n        n = playermove(n)\n        if n == 21\n            println(\"Player wins! Game over, gg!\")\n            break\n        end\n        n = algo(n)\n    end\nend\n\nplay21game()\n",
        "safe": true
    },
    {
        "filename": "21 game_52.txt",
        "content": "import std/num/random\nimport std/os/readline\n\neffect exit\n  final ctl exit(): ()\n\ntype player\n  Player\n  Computer\n\nfun other(p: player): player\n  match p\n    Player -> Computer\n    Computer -> Player\n\nfun show(p: player): string\n  match p\n    Player -> \"Player\"\n    Computer -> \"Computer\"\n\nfun get-selection(max-int: int)\n  val i = readline().trim().parse-int()\n  match i\n    Just(x) | x >= 1 && x <= max-int -> x\n    _ ->\n      println(\"Please enter a number between 1 and \" ++ max-int.show ++ \" or press q to quit\")\n      get-selection(max-int)\n\nfun play(p: player, total: int)\n  println(\"Total: \" ++ total.show)\n  match total\n    21 ->\n      // The player who reaches 21 wins the game, which is the player in the last loop\n      println(p.other.show ++ \" wins!\")\n      return ()\n    _ -> ()\n  val max = if total + 3 > 21 then 21 - total else 3\n  match p\n    Player ->\n      println(\"Player's turn\")\n      val selection = get-selection(max)\n      play(p.other, total + selection)\n    Computer ->\n      println(\"Computer's turn\")\n      val selection = (random-int() % max) + 1\n      println(\"Computer chooses \" ++ selection.show)\n      play(p.other, total + selection)\n\nfun main()\n  with final ctl exit() ()\n  \"21 is a two player game. The game is played by choosing a number (1, 2, 3) to\".println\n  \"be added to the running total. The game is won by the player whose chosen number\".println\n  \"causes the running total to reach exactly 21. The running total starts at zero.\".println\n  \"\".println\n  \"You can quit the game at any time by typing 'q'.\".println\n  val playerGoesFirst = random-bool()\n  val p1 = if playerGoesFirst then Player else Computer\n  play(p1, 0)\n",
        "safe": true
    },
    {
        "filename": "21 game_53.txt",
        "content": "gamewon = false\nrunning_total = 0\nplayer = 1\nopponent = 2\n\nwhile not gamewon do\n  num = 0\n  \n  if player == 1 then\n    opponent = 2\n    repeat\n      print(\"Enter a number between 1 and 3 (0 to quit):\")\n      num = io.read(\"*n\")\n      if num == 0 then\n          os.exit()\n      end\n    until (num > 0) and (num <=3)\n  end\n  \n  if player == 2 and not (gamewon) then\n      opponent = 1\n      if (21 - running_total <= 3) then\n        num = 21 - running_total\n      else\n        num = math.random(1,3)\n      end\n      print(\"Player 2 picks number \"..num)\n  end\n  \n  running_total = running_total + num\n  print(\"Total: \"..running_total)\n  \n  if running_total == 21 then\n    print(\"Player \"..player..\" wins!\")\n    gamewon = true\n  end\n  \n  if running_total > 21 then\n    print(\"Player \"..player..\" lost...\")\n    print(\"Player \"..opponent..\" wins!\")\n    gamewon = true\n  end\n  \n  if player == 1 then\n    player = 2\n  else player = 1 \n  end\n\nend\n",
        "safe": true
    },
    {
        "filename": "21 game_54.txt",
        "content": "SeedRandom[1234];\nClearAll[ComputerChoose, HumanChoose]\nComputerChoose[n_] := If[n < 18, RandomChoice[{1, 2, 3}], 21 - n]\nHumanChoose[] := ChoiceDialog[\"How many?\", {1 -> 1, 2 -> 2, 3 -> 3, \"Quit\" -> -1}]\nrunningtotal = 0;\nwhofirst = ChoiceDialog[\"Who goes first?\", {\"You\" -> 1, \"Computer\" -> 2}];\nWhile[runningtotal < 21,\n If[whofirst == 1,\n   choice = HumanChoose[];\n   If[choice == -1, Break[]];\n   Print[\"You choose = \", choice];\n   runningtotal += choice;\n   Print[\"Running total = \", runningtotal];\n   If[runningtotal == 21, Print[\"You won!\"]; Break[]];\n   choice = ComputerChoose[runningtotal];\n   Print[\"Computer choose = \", choice];\n   runningtotal += choice;\n   Print[\"Running total = \", runningtotal];\n   If[runningtotal == 21, Print[\"Computer won!\"]; Break[]];\n   ,\n   choice = ComputerChoose[runningtotal];\n   Print[\"Computer choose = \", choice];\n   runningtotal += choice;\n   Print[\"Running total = \", runningtotal];\n   If[runningtotal == 21, Print[\"Computer won!\"]; Break[]];\n   choice = HumanChoose[];\n   If[choice == -1, Break[]];\n   Print[\"You choose = \", choice];\n   runningtotal += choice;\n   Print[\"Running total = \", runningtotal];\n   If[runningtotal == 21, Print[\"You won!\"]; Break[]];\n   ];\n ]\n",
        "safe": true
    },
    {
        "filename": "21 game_55.txt",
        "content": "You choose = 2\nRunning total = 2\nComputer choose = 3\nRunning total = 5\nYou choose = 3\nRunning total = 8\nComputer choose = 1\nRunning total = 9\nYou choose = 3\nRunning total = 12\nComputer choose = 1\nRunning total = 13\nYou choose = 1\nRunning total = 14\nComputer choose = 2\nRunning total = 16\nYou choose = 1\nRunning total = 17\nComputer choose = 3\nRunning total = 20\nYou choose = 1\nRunning total = 21\nYou won!",
        "safe": true
    },
    {
        "filename": "21 game_56.txt",
        "content": "# 21 game.\n\nimport random\nimport strformat\nimport strutils\n\nconst\n  Target = 21\n  PossibleChoices: array[18..20, seq[string]] = [@[\"1\", \"2\", \"3\"], @[\"1\", \"2\"], @[\"1\"]]\n  Targets = [1, 5, 9, 13, 17, 21]     # Totals that a player must obtain to win.\n\n#---------------------------------------------------------------------------------------------------\n\nproc printTotal(total: int) =\n  ## Print the running total.\n  echo fmt\"Running total is now {total}.\"\n\n#---------------------------------------------------------------------------------------------------\n\nproc computerPlays(total: var int) =\n  ## Make the computer play.\n  var choice: int\n  if total in Targets:\n    # No winning choice. Choose a random value.\n    choice = rand(1..3)\n  else:\n    # Find the running total to get.\n    for val in Targets:\n      if val > total:\n        choice = val - total\n        break\n  inc total, choice\n  echo fmt\"I choose {choice}.\"\n  printTotal(total)\n\n#---------------------------------------------------------------------------------------------------\n\nproc prompt(message: string; answers: openArray[string]): int =\n  ## Prompt a message and get an answer checking its validity against possible answers.\n\n  while true:\n    stdout.write(message & ' ')\n    try:\n      result = answers.find(stdin.readLine())\n      if result >= 0:\n        break\n      echo fmt\"Please answer one of: {answers.join(\"\", \"\")}.\"\n    except EOFError:\n      echo \"\"\n      return  # Quit.\n\n#---------------------------------------------------------------------------------------------------\n\nrandomize()\n\necho \"21 is a two player game. The game is played by choosing a number (1, 2, 3) to\\n\" &\n     \"be added to the running total. The game is won by the player whose chosen number\\n\" &\n     \"causes the running total to reach exactly 21. The running total starts at zero.\\n\"\necho \"You can quit the game at any time by typing 'q'.\"\n\nblock mainLoop:\n\n  while true:\n    var total = 0\n\n    # Choose the player who will play first.\n    var answer = prompt(\"Who will play first ('you', 'me')?\", [\"q\", \"you\", \"me\"])\n    if answer == 0:\n      echo \"Quitting game.\"\n      break\n    elif answer == 1:\n      computerPlays(total)\n\n    # Internal game loop.\n    while true:\n\n      # Ask player its choice.\n      let choices = if total > 18: PossibleChoices[total] else: PossibleChoices[18]\n      let choice = prompt(fmt\"Your choice ({choices.join(\"\", \"\")})?\", \"q\" & choices)\n      if choice == 0:\n        echo \"Quitting game.\"\n        break mainLoop\n\n      # Update running total and check if player win.\n      inc total, choice\n      printTotal(total)\n      if total == Target:\n        echo \"Congratulations, you win.\"\n        break\n\n      # Make computer play.\n      computerPlays(total)\n      if total == Target:\n        echo \"Sorry, I win.\"\n        break\n\n    # Ask player for another game.\n    answer = prompt(\"Do you want to play another game (y, n)\", [\"q\", \"y\", \"n\"])\n    if answer != 1:\n      echo \"Quitting game.\"\n      break\n",
        "safe": true
    },
    {
        "filename": "21 game_57.txt",
        "content": "21 is a two player game. The game is played by choosing a number (1, 2, 3) to\nbe added to the running total. The game is won by the player whose chosen number\ncauses the running total to reach exactly 21. The running total starts at zero.\n\nYou can quit the game at any time by typing 'q'.\nWho will play first (you, me)? x\nPlease, answer one of: q, you, me.\nWho will play first ('you', 'me')? you\nI choose 1.\nRunning total is now 1.\nYour choice (1, 2, 3)? 4\nPlease answer one of: q, 1, 2, 3.\nYour choice (1, 2, 3)? 3\nRunning total is now 4.\nI choose 1.\nRunning total is now 5.\nYour choice (1, 2, 3)? 3\nRunning total is now 8.\nI choose 1.\nRunning total is now 9.\nYour choice (1, 2, 3)? 3\nRunning total is now 12.\nI choose 1.\nRunning total is now 13.\nYour choice (1, 2, 3)? 3\nRunning total is now 16.\nI choose 1.\nRunning total is now 17.\nYour choice (1, 2, 3)? 3\nRunning total is now 20.\nI choose 1.\nRunning total is now 21.\nSorry, I win.\nDo you want to play another game (y, n) y\nWho will play first (you, me)? me\nYour choice (1, 2, 3)? 1\nRunning total is now 1.\nI choose 2.\nRunning total is now 3.\nYour choice (1, 2, 3)? 2\nRunning total is now 5.\nI choose 2.\nRunning total is now 7.\nYour choice (1, 2, 3)? 2\nRunning total is now 9.\nI choose 1.\nRunning total is now 10.\nYour choice (1, 2, 3)? 3\nRunning total is now 13.\nI choose 3.\nRunning total is now 16.\nYour choice (1, 2, 3)? 1\nRunning total is now 17.\nI choose 2.\nRunning total is now 19.\nYour choice (1, 2)? 2\nRunning total is now 21.\nCongratulations, you win.\nDo you want to play another game (y, n) n\nQuitting game.\n",
        "safe": true
    },
    {
        "filename": "21 game_58.txt",
        "content": "class TwentyOne {\n  @quit\u00a0: Bool;\n  @player_total\u00a0: Int;\n  @computer_total\u00a0: Int;\n\n  function\u00a0: Main(args\u00a0: String[]) ~ Nil {\n    TwentyOne->New()->Play();\n  }\n\n  New() {\n  }\n\n  method\u00a0: Play() ~ Nil {\n    player_first\u00a0:= Int->Random(1) = 1;\n\n    \"Enter 'q' to quit\\n===\"->PrintLine();\n    do {\n      if(player_first) {\n        PlayerTurn();\n        if(<>@quit) {\n          \"---\"->PrintLine();\n          ComputerTurn();\n        };\n      }\n      else {\n        ComputerTurn();\n        \"---\"->PrintLine();\n        PlayerTurn();\n      };\n      \"===\"->PrintLine();\n    }\n    while(<>@quit);\n  }\n\n  method\u00a0: ComputerTurn() ~ Nil {\n    input\u00a0:= Int->Random(1, 3);\n    \n    \"Computer choose: {$input}\"->PrintLine();\n    @computer_total += input;\n\n    if(@computer_total = 21) {\n      \"Computer Wins!\"->PrintLine();\n      @quit\u00a0:= true;\n    }\n    else if(@computer_total > 21) {\n      \"Computer Loses.\"->PrintLine();\n      @quit\u00a0:= true;\n    }\n    else {\n      \"Computer total is {$@computer_total}.\"->PrintLine();\n    };\n  }\n\n  method\u00a0: PlayerTurn() ~ Nil {\n    input\u00a0:= GetInput();\n\n    if(input = -1) {\n      \"Quit\"->PrintLine();\n      @quit\u00a0:= true;\n    }\n    else if(input = 0) {\n      \"Invalid Input!\"->PrintLine();\n    }\n    else {\n      @player_total += input;\n    };\n\n    if(@player_total = 21) {\n      \"Player Wins!\"->PrintLine();\n      @quit\u00a0:= true;\n    }\n    else if(@player_total > 21) {\n      \"Player Loses.\"->PrintLine();\n      @quit\u00a0:= true;\n    }\n    else {\n      \"Player total is {$@player_total}.\"->PrintLine();\n    };\n  }\n\n  function\u00a0: GetInput() ~ Int {\n    \"Choosing a number beween 1-3: \"->Print();\n\n    input\u00a0:= System.IO.Console->ReadString();\n    if(input->Size() = 1) {\n      if(input->Get(0) = 'q') {\n        return -1;\n      };\n\n      return input->ToInt();\n    };\n\n    return 0;\n  }\n}",
        "safe": true
    },
    {
        "filename": "21 game_59.txt",
        "content": "program Game21;\n\n{$APPTYPE CONSOLE}\n\n{$R *.res}\n\nuses\n  System.SysUtils,\n  System.StrUtils, // for IfThen\n  Winapi.Windows;  // for ClearScreen\n\nconst\n  HARD_MODE = True;\n\nvar\n  computerPlayer: string = 'Computer';\n  humanPlayer: string = 'Player 1';\n\n  // for change color\n  ConOut: THandle;\n  BufInfo: TConsoleScreenBufferInfo;\n\nprocedure ClearScreen;\nvar\n  stdout: THandle;\n  csbi: TConsoleScreenBufferInfo;\n  ConsoleSize: DWORD;\n  NumWritten: DWORD;\n  Origin: TCoord;\nbegin\n  stdout := GetStdHandle(STD_OUTPUT_HANDLE);\n  Win32Check(stdout <> INVALID_HANDLE_VALUE);\n  Win32Check(GetConsoleScreenBufferInfo(stdout, csbi));\n  ConsoleSize := csbi.dwSize.X * csbi.dwSize.Y;\n  Origin.X := 0;\n  Origin.Y := 0;\n  Win32Check(FillConsoleOutputCharacter(stdout, ' ', ConsoleSize, Origin, NumWritten));\n  Win32Check(FillConsoleOutputAttribute(stdout, csbi.wAttributes, ConsoleSize,\n    Origin, NumWritten));\n  Win32Check(SetConsoleCursorPosition(stdout, Origin));\nend;\n\nprocedure ResetColor;\nbegin\n  SetConsoleTextAttribute(ConOut, BufInfo.wAttributes);\nend;\n\nprocedure ChangeColor(color: Word);\nbegin\n  ConOut := TTextRec(Output).Handle;\n  GetConsoleScreenBufferInfo(ConOut, BufInfo);\n  SetConsoleTextAttribute(TTextRec(Output).Handle, color);\nend;\n\nfunction SwapPlayer(currentPlayer: string): string;\nbegin\n  Result := IfThen(currentPlayer = humanPlayer, computerPlayer, humanPlayer);\nend;\n\nfunction RandomPlayerSelect(): string;\nbegin\n  Result := IfThen(Random() < 0.5, computerPlayer, humanPlayer);\nend;\n\nfunction CheckIfCanWin(total: Integer): Boolean;\nbegin\n  result := (total >= 18);\nend;\n\nfunction CheckIfCanLose(total: Integer; var choose: Integer; hardMode: Boolean =\n  False): Boolean;\nvar\n  range: Integer;\nbegin\n  range := 17 - total;\n  Result := false;\n  if (range > 0) and (range < 4) then\n  begin\n    Result := true;\n    if hardMode then\n      choose := range\n    else\n      choose := Random(range - 1) + 1;\n  end;\nend;\n\nfunction CompMove(total: Integer): Integer;\nbegin\n  if (CheckIfCanWin(total)) then\n  begin\n    exit(21 - total);\n  end;\n\n  if CheckIfCanLose(total, Result, HARD_MODE) then\n    exit;\n\n  Result := Random(3) + 1;\nend;\n\nfunction HumanMove: Integer;\nvar\n  choice: string;\nbegin\n  repeat\n    Writeln('Choose from numbers: 1, 2, 3');\n    Readln(choice);\n  until TryStrToInt(choice, Result) and (Result in [1..3]);\nend;\n\nprocedure PlayGame();\nvar\n  playAnother: Boolean;\n  total, final_, roundChoice, compWins, humanWins: Integer;\n  choice, currentPlayer: string;\nbegin\n  playAnother := True;\n  total := 0;\n  final_ := 21;\n  roundChoice := 0;\n  Randomize;\n  currentPlayer := RandomPLayerSelect();\n  compWins := 0;\n  humanWins := 0;\n\n  while (playAnother) do\n  begin\n    ClearScreen;\n    ChangeColor(FOREGROUND_INTENSITY or FOREGROUND_GREEN);\n    Writeln(total);\n    ResetColor;\n    Writeln('');\n\n    Writeln('Now playing: ' + currentPlayer);\n    if currentPlayer = computerPlayer then\n      roundChoice := CompMove(total)\n    else\n      roundChoice := HumanMove;\n    inc(total, roundChoice);\n\n    if (total = final_) then\n    begin\n      if (currentPlayer = computerPlayer) then\n      begin\n        inc(compWins);\n      end\n      else\n      begin\n        inc(humanWins);\n      end;\n\n      ClearScreen;\n      Writeln('Winner: ' + currentPlayer);\n      Writeln('Comp wins: ', compWins, '. Human wins: ', humanWins, #10);\n      Writeln('Do you wan to play another round? y/n');\n\n      readln(choice);\n\n      if choice = 'y' then\n      begin\n        total := 0;\n        ClearScreen;\n      end\n      else if choice = 'n' then\n        playAnother := false\n      else\n      begin\n        Writeln('Invalid choice! Choose from y or n');\n        Continue;\n      end;\n    end\n    else if total > 21 then\n    begin\n      Writeln('Not the right time to play this game\u00a0:)');\n      break;\n    end;\n\n    currentPlayer := SwapPlayer(currentPlayer);\n  end;\n\nend;\n\nconst\n  WELLCOME_MSG: array[0..5] of string = ('Welcome to 21 game'#10,\n    '21 is a two player game.', 'The game is played by choosing a number.',\n    '1, 2, or 3 to be added a total sum.'#10,\n    'The game is won by the player reaches exactly 21.'#10, 'Press ENTER to start!'#10);\n\nvar\n  i: Integer;\n\nbegin\n  try\n    for i := 0 to High(WELLCOME_MSG) do\n      Writeln(WELLCOME_MSG[i]);\n    ResetColor;\n    Readln; // Wait press enter\n\n    PlayGame();\n  except\n    on E: Exception do\n      Writeln(E.ClassName, ': ', E.Message);\n  end;\nend.\n",
        "safe": true
    },
    {
        "filename": "21 game_6.txt",
        "content": "The first move is human move.\nThe running total is 0\nEnter your choice (1,2, 3 or type (q)uit to exit): 4\ninvalid choice.\n Enter your choice (1,2, 3 or type (q)uit to exit): 1\nRaspberry choice if  1\nThe running total is 2\nEnter your choice (1,2, 3 or type (q)uit to exit): 3\nRaspberry choice if  2\nThe running total is 7\nEnter your choice (1,2, 3 or type (q)uit to exit): 1\nRaspberry choice if  1\nThe running total is 9\nEnter your choice (1,2, 3 or type (q)uit to exit): 2\nRaspberry choice if  2\nThe running total is 13\nEnter your choice (1,2, 3 or type (q)uit to exit): 3\nRaspberry choice if  1\nThe running total is 17\nEnter your choice (1,2, 3 or type (q)uit to exit): 1\nRaspberry choice if  3\nYou lost.\n\nNew game (y/n)\u00a0?\ny\nThe first move is Raspberry pi.\n",
        "safe": true
    },
    {
        "filename": "21 game_60.txt",
        "content": "print <<'HERE';\nThe 21 game. Each player chooses to add 1, 2, or 3 to a running total.\nThe player whose turn it is when the total reaches 21 wins. Enter q to quit.\nHERE\n\nmy $total = 0;\n\nwhile () {\n    print \"Running total is: $total\\n\";\n    my ($me,$comp);\n    while () {\n        print 'What number do you play> ';\n        $me = <>; chomp $me;\n        last if $me =~ /^[123]$/;\n        insult($me);\n    }\n    $total += $me;\n    win('Human') if $total >= 21;\n    print \"Computer plays: \" . ($comp = 1+int(rand(3))) . \"\\n\";\n    $total += $comp;\n    win('Computer') if $total >= 21;\n}\n\nsub win {\n    my($player) = @_;\n    print \"$player wins.\\n\";\n    exit;\n}\n\nsub insult {\n    my($g) = @_;\n    exit if $g =~ /q/i;\n    my @insults = ('Yo mama', 'Jeez', 'Ummmm', 'Grow up');\n    my $i = $insults[1+int rand($#insults)];\n    print \"$i, $g is not an integer between 1 and 3...\\n\"\n}\n",
        "safe": true
    },
    {
        "filename": "21 game_61.txt",
        "content": "The 21 game. Each player chooses to add 1, 2, or 3 to a running total.\nThe player whose turn it is when the total reaches 21 wins. Enter q to quit.\nRunning total is: 0\nWhat number do you play> 3\nComputer plays: 3\nRunning total is: 6\nWhat number do you play> 3\nComputer plays: 3\nRunning total is: 12\nWhat number do you play> 3\nComputer plays: 2\nRunning total is: 17\nWhat number do you play> 1\nComputer plays: 1\nRunning total is: 19\nWhat number do you play> 2\nHuman wins.",
        "safe": true
    },
    {
        "filename": "21 game_62.txt",
        "content": "--\n-- demo\\rosetta\\21_Game.exw\n-- ========================\n--\nwith javascript_semantics -- DEV NORMALIZESIZE, CANFOCUS, \"You\" not checked, VALUE_HANDLE.\n                          -- The radio_texts simply don't do anything at all in p2js.\nconstant title = \"21 Game\",\n         help_text = \"\"\"\nPlay by choosing 1, 2, or 3 to add to the running total (initially 0).\n\nThe first player to reach 21 wins.\n\nIf the computer goes first you cannot win.\n\nIf you leave your opponent on 18, 19, or 20, they will play {3,2,1} and win.\nIf you leave your opponent on 17, simply match their play {1,2,3} with {3,2,1} and win.\nIf you leave your opponent on 14, 15, or 16, they'll leave you on 17 and win.\nSo the aim is 21 (doh), and before that 17, 13, 9, 5, and 1. Anything else loses.\n\"\"\",\n         radio_texts = {\"You\",\"Computer\",\"Random\"},\n         button_text = {\"one\",\"two\",\"three\",\"concede\",\"new game\",\"quit\"}\ninteger total = 0\n\ninclude pGUI.e\nIhandle dlg, vbox, frame, radios, playstate\nsequence radioset, buttons\n\nfunction show_help()\n    IupMessage(title,help_text)\n    return IUP_IGNORE -- (don't open browser help!)\nend function\n\nfunction play(integer n)\n    if n!=0 then\n        if n=6 then return IUP_CLOSE end if\n        string title\n        if n>3 then\n            -- concede or new_game\n            total = 0\n            title = iff(n=4?\"(conceded) \":\"\")\n            title &= \"Total is 0\"\n            Ihandle r = IupGetAttributePtr(radios,\"VALUE_HANDLE\")\n            n = find(r,radioset)\n            if n=2 or (n=3 and rand(2)=1) then\n                title &= \",\" -- trigger a computer move\n            end if\n            IupSetInt(buttons[1..3],\"ACTIVE\",true)\n        else\n            -- n = 1..3\n            title = sprintf(\"Total is %d\",total)\n            if total=21      -- (from key_cb)\n            or total+n>21 then -- (invalid)\n                return IUP_IGNORE\n            end if\n            total += n\n            title &= sprintf(\", you play %d (-> %d),\",{n,total})\n            if total=21 then title &= \" you win\" end if\n        end if\n        if find(',',title) and total!=21 then\n            -- computer move\n            sequence moves = {1,rand(3),3,2}\n            n = moves[mod(total,4)+1]\n            total += n\n            title &= sprintf(\" computer plays %d (-> %d)\",{n,total})\n            if total=21 then\n                title &= \", computer wins\"\n            elsif mod(total,4)=1 then\n                title &= \", (you've already lost)\"\n            end if\n        end if      \n        if total=21 then\n            title &= \" GAME OVER\"\n            IupSetInt(buttons[1..4],\"ACTIVE\",false)\n        else\n            if total>18 then\n                IupSetInt(buttons[22-total..3],\"ACTIVE\",false)\n            end if\n            IupSetInt(buttons[4],\"ACTIVE\",total!=0)\n        end if      \n        IupSetFocus(dlg) -- (stops inactive button beeping)\n        IupSetStrAttribute(playstate,\"TITLE\",title)\n    end if\n    return IUP_IGNORE\nend function\n\nfunction button_cb(Ihandle ih)\n    string title = IupGetAttribute(ih,\"TITLE\")\n    return play(find(title,button_text))\nend function\nconstant cb_button = Icallback(\"button_cb\")\n\nfunction key_cb(Ihandle /*dlg*/, atom c)\n    if c=K_ESC then return IUP_CLOSE end if -- (standard practice for me)\n    if c=K_F5 then return IUP_DEFAULT end if -- (let browser reload work)\n    if c=K_F1 then return show_help() end if\n    return play(find(upper(c),\"123CNQ\"))\nend function\n\nIupOpen()\nplaystate = IupLabel(\"\",\"EXPAND=HORIZONTAL, PADDING=10x10\")\nradioset = apply(true,IupToggle,{radio_texts,{\"RIGHTBUTTON=YES, CANFOCUS=NO\"}})\nbuttons = apply(true,IupButton,{button_text,cb_button,{\"PADDING=5x5\"}})\nradios = IupRadio(IupHbox(radioset,\"GAP=45\"))\nframe = IupHbox({IupLabel(`First Player:`),radios},\"NORMALIZESIZE=VERTICAL\")\nvbox = IupVbox({frame,playstate,IupHbox(buttons,\"GAP=10\")},\"MARGIN=20x10\")\ndlg = IupDialog(vbox,`TITLE=\"%s\", MINSIZE=540x200`,{title})\nIupShow(dlg)\nIupSetCallback({dlg,buttons},\"KEY_CB\",Icallback(\"key_cb\"))\nIupSetAttributeHandle(NULL,\"PARENTDIALOG\",dlg)\n{} = play(find(\"new game\",button_text))\nif platform()!=JS then\n    IupMainLoop()\n    IupClose()\nend if\n",
        "safe": true
    },
    {
        "filename": "21 game_63.txt",
        "content": "<!DOCTYPE html>\n<html lang=\"en\">\n\n<head>\n    <meta charset=\"UTF-8\">\n    <meta name=\"keywords\"    content=\"Game 21\">\n    <meta name=\"description\" content=\"\n      21 is a two player game, the game is played by choosing a number\n      (1, 2, or 3) to be added to the running total. The game is won by\n      the player whose chosen number causes the running total to reach\n      exactly 21. The running total starts at zero.\n    \">\n    <!--DCMI metadata (Dublin Core Metadata Initiative)-->\n    <meta name=\"dc.publisher\" content=\"Rosseta Code\">\n    <meta name=\"dc.date\"      content=\"2020-07-31\">\n    <meta name=\"dc.created\"   content=\"2020-07-31\">\n    <meta name=\"dc.modified\"  content=\"2020-08-01\">\n    <title>\n        21 Game\n    </title>\n    <!-- Remove the line below in the final/production version. -->\n    <meta http-equiv=\"cache-control\" content=\"no-cache\">\n\n    <style>\n      .ui div   { width: 50%; display: inline-flex; justify-content: flex-end; }\n      div.total { margin-bottom: 1ch; }\n      label     { padding-right: 1ch; }\n      button + button { margin-left: 1em; }\n    </style>\n</head>\n\n<body>\n\n  <h1>\n    21 Game in PHP 7\n  </h1>\n\n  <p>\n    21 is a two player game, the game is played by choosing a number\n    (1, 2, or 3) to be added to the running total. The game is won by\n    the player whose chosen number causes the running total to reach\n    exactly 21. The running total starts at zero.\n  </p>\n\n\n  <?php\n\n    const GOAL = 21;\n    const PLAYERS = array('AI', 'human');\n\n    function best_move($n)\n    {\n      for ($i = 1; $i <= 3; $i++)\n        if ($n + $i == GOAL)\n          return $i;\n      for ($i = 1; $i <= 3; $i++)\n        if (($n + $i - 1) % 4 == 0)\n          return $i;\n      return 1;\n    }\n\n    if (isset($_GET['reset']) || !isset($_GET['total']))\n    {\n      $first = PLAYERS[rand(0, 1)];\n      $total = 0;\n      $human = 0;\n      $ai = 0;\n      $message = '';\n      if ($first == 'AI')\n      {\n        $move = best_move($total);\n        $ai = $move;\n        $total = $total + $move;\n      }\n    }\n    else\n    {\n      $first   = $_GET['first'];\n      $total   = $_GET['total'];\n      $human   = $_GET['human'];\n      $ai      = $_GET['ai'];\n      $message = $_GET['message'];\n    }\n\n    if (isset($_GET['move']))\n    {\n      $move = (int)$_GET['move'];\n      $human = $move;\n      $total = $total + $move;\n      if ($total == GOAL)\n        $message = 'The winner is human.';\n      else\n      {\n        $move = best_move($total);\n        $ai = $move;\n        $total = $total + $move;\n        if ($total == GOAL)\n          $message = 'The winner is AI.';\n      }\n    }\n\n    $state = array();\n    for ($i = 1; $i <= 3; $i++)\n      $state[$i] = $total + $i > GOAL ? 'disabled' : '';\n\n    echo <<< END\n      <p>\n        The first player is $first.\n        Use buttons to play.\n      </p>\n      <form class=\"ui\">\n        <div>\n          <input type='hidden' id='first' name='first' value='$first'>\n          <input type='hidden' name='message' value='$message'>\n        </div>\n        <div class='total'>\n          <label for='human'>human last choice:</label>\n          <input type='text' name='human' readonly value='$human'>\n        </div>\n        <div class='total'>\n          <label for='AI'>AI last choice:</label>\n          <input type='text' name='ai' readonly value='$ai'>\n        </div>\n        <div class='total'>\n          <label for='runningTotalText'>running total:</label>\n          <input type='text' name='total' readonly value='$total'>\n        </div>\n        <div class='buttons'>\n          <button type='submit' name='move' value='1' {$state[1]}> one   </button>\n          <button type='submit' name='move' value='2' {$state[2]}> two   </button>\n          <button type='submit' name='move' value='3' {$state[3]}> three </button>\n          <button type='submit' name='reset' value='reset'> reset </button>\n        </div>\n      </form>\n      <p>\n        $message\n      </p>\n    END\n  ?>\n\n</body>\n",
        "safe": true
    },
    {
        "filename": "21 game_64.txt",
        "content": "import util.\n\nmain =>\n    N = 0,\n    Level = prompt(\"Level of play (1=dumb, 3=smart)\"),\n    Algo = choosewisely,\n    if Level == \"1\" then\n        Algo\u00a0:= choosefoolishly\n    elseif Level == \"2\" then\n        Algo\u00a0:= choosesemiwisely\n    elseif Level\u00a0!= \"3\" then\n        println(\"Bad choice syntax--default to smart choice\")\n    end,\n    Whofirst = prompt(\"Does computer go first? (y or n)\"),\n    if Whofirst[1] == 'y' || Whofirst[1] == 'Y' then\n        N\u00a0:= apply(Algo, N)\n    end,\n    while (N < 21)\n        N\u00a0:= playermove(N),\n        if N == 21 then\n            println(\"Player wins! Game over, gg!\"),\n            halt\n        end,\n        N\u00a0:= apply(Algo,N)\n    end.\n \ntrytowin(N) =>\n    if 21 - N < 4 then \n        printf(\"Computer chooses %w and wins. GG!\\n\", 21 - N),\n        halt\n    end.\n\nchoosewisely(N) = NextN =>\n    trytowin(N),\n    Targets = [1, 5, 9, 13, 17, 21],\n    once ((member(Target, Targets), Target > N)),\n    Bestmove = Target - N,\n    if Bestmove > 3 then\n        printf(\"Looks like I could lose. Choosing a 1, total now %w.\\n\", N + 1),\n        NextN = N+1\n    else \n        printf(\"On a roll, choosing a %w, total now %w.\\n\", Bestmove, N + Bestmove),\n        NextN = N + Bestmove\n    end.\n \nchoosefoolishly(N) = NextN =>\n    trytowin(N),\n    Move = random() mod 3 + 1,\n    printf(\"Here goes, choosing %w, total now %w.\", Move, N+Move),\n    NextN = N+Move.\n \nchoosesemiwisely(N) = NextN =>\n    trytowin(N),\n    if frand() > 0.75 then\n        NextN = choosefoolishly(N)\n    else\n        NextN = choosewisely(N)\n    end.\n \nprompt(S) = Input =>\n    printf(S ++ \": => \"),\n    Input = strip(read_line()).\n \nplayermove(N) = NextN =>\n    Rang = cond(N > 19, \"1 is all\", cond(N > 18, \"1 or 2\", \"1, 2 or 3\")),\n    Prompt = to_fstring(\"Your choice (%s), 0 to exit\", Rang),\n    Nstr = prompt(Prompt),\n    if Nstr == \"0\" then\n        halt\n    elseif Nstr == \"1\" then\n        NextN = N+1\n    elseif Nstr == \"2\" && N < 20 then\n        NextN = N + 2\n    elseif Nstr == \"3\" && N < 19 then\n        NextN = N + 3\n    else\n        NextN = playermove(N)\n    end.",
        "safe": true
    },
    {
        "filename": "21 game_65.txt",
        "content": "from random import randint\ndef start():\n\tgame_count=0\n\tprint(\"Enter q to quit at any time.\\nThe computer will choose first.\\nRunning total is now {}\".format(game_count))\n\troundno=1\n\twhile game_count<21:\n\t\tprint(\"\\nROUND {}: \\n\".format(roundno))\n\t\tt = select_count(game_count)\n\t\tgame_count = game_count+t\n\t\tprint(\"Running total is now {}\\n\".format(game_count))\n\t\tif game_count>=21:\n\t\t\tprint(\"So, commiserations, the computer has won!\")\n\t\t\treturn 0\n\t\tt = request_count()\n\t\tif not t:\n\t\t\tprint('OK,quitting the game')\n\t\t\treturn -1\n\t\tgame_count = game_count+t\n\t\tprint(\"Running total is now {}\\n\".format(game_count))\n\t\tif game_count>=21:\n\t\t\tprint(\"So, congratulations, you've won!\")\n\t\t\treturn 1\n\t\troundno+=1\n\ndef select_count(game_count):\n\t'''selects a random number if the game_count is less than 18. otherwise chooses the winning number'''\n\tif game_count<18:\n\t\tt= randint(1,3)\n\telse:\n\t\tt = 21-game_count\n\tprint(\"The computer chooses {}\".format(t))\n\treturn t\n\ndef request_count():\n\t'''request user input between 1,2 and 3. It will continue till either quit(q) or one of those numbers is requested.'''\n\tt=\"\"\n\twhile True:\n\t\ttry:\n\t\t\tt = raw_input('Your choice 1 to 3\u00a0:')\n\t\t\tif int(t) in [1,2,3]:\n\t\t\t\treturn int(t)\n\t\t\telse:\n\t\t\t\tprint(\"Out of range, try again\")\n\t\texcept:\n\t\t\tif t==\"q\":\n\t\t\t\treturn None\n\t\t\telse:\n\t\t\t\tprint(\"Invalid Entry, try again\")\n\nc=0\nm=0\nr=True\nwhile r:\n\to = start()\n\tif o==-1:\n\t\tbreak\n\telse:\n\t\tc+=1 if o==0 else 0\n\t\tm+=1 if o==1 else 0\n\tprint(\"Computer wins {0} game, human wins {1} games\".format(c,m))\n\tt = raw_input(\"Another game?(press y to continue):\")\n\tr = (t==\"y\")\n",
        "safe": true
    },
    {
        "filename": "21 game_66.txt",
        "content": "Enter q to quit at any time.\nThe computer will choose first.\nRunning total is now 0\n\nROUND 1: \n\nThe computer chooses 1\nRunning total is now 1\n\nYour choice 1 to 3 :4\nOut of range, try again\nYour choice 1 to 3 :w\nInvalid Entry, try again\nYour choice 1 to 3 :3\nRunning total is now 4\n\n\nROUND 2: \n\nThe computer chooses 1\nRunning total is now 5\n\nYour choice 1 to 3 :2\nRunning total is now 7\n\n\nROUND 3: \n\nThe computer chooses 3\nRunning total is now 10\n\nYour choice 1 to 3 :3\nRunning total is now 13\n\n\nROUND 4: \n\nThe computer chooses 1\nRunning total is now 14\n\nYour choice 1 to 3 :2\nRunning total is now 16\n\n\nROUND 5: \n\nThe computer chooses 1\nRunning total is now 17\n\nYour choice 1 to 3 :1\nRunning total is now 18\n\n\nROUND 6: \n\nThe computer chooses 3\nRunning total is now 21\n\nSo, commiserations, the computer has won!\nComputer wins 1 game, human wins 0 games\nAnother game?(press y to continue):y\nEnter q to quit at any time.\nThe computer will choose first.\nRunning total is now 0\n\nROUND 1: \n\nThe computer chooses 1\nRunning total is now 1\n\nYour choice 1 to 3 :3\nRunning total is now 4\n\n\nROUND 2: \n\nThe computer chooses 3\nRunning total is now 7\n\nYour choice 1 to 3 :3\nRunning total is now 10\n\n\nROUND 3: \n\nThe computer chooses 3\nRunning total is now 13\n\nYour choice 1 to 3 :5\nOut of range, try again\nYour choice 1 to 3 :3\nRunning total is now 16\n\n\nROUND 4: \n\nThe computer chooses 2\nRunning total is now 18\n\nYour choice 1 to 3 :3\nRunning total is now 21\n\nSo, congratulations, you've won!\nComputer wins 1 game, human wins 1 games\nAnother game?(press y to continue):y\nEnter q to quit at any time.\nThe computer will choose first.\nRunning total is now 0\n\nROUND 1: \n\nThe computer chooses 3\nRunning total is now 3\n\nYour choice 1 to 3 :4\nOut of range, try again\nYour choice 1 to 3 :3\nRunning total is now 6\n\n\nROUND 2: \n\nThe computer chooses 3\nRunning total is now 9\n\nYour choice 1 to 3 :q\nOK,quitting the game\n",
        "safe": true
    },
    {
        "filename": "21 game_67.txt",
        "content": "''' Python 3.6.5 code using Tkinter graphical user interface.\n    Starting player chosen randomly. ''' \nfrom tkinter import *\nfrom tkinter import messagebox\nimport random\n\n# ************************************************\n\nclass Game:\n    def __init__(self, gw):\n        self.window = gw\n        self.won = 0\n        self.lost = 0\n        self.score = 0\n        self.puter_turn = None\n        self.var123 = IntVar()\n        self.varsub = IntVar()\n\n        # top frame:\n        self.top_fr = Frame(gw,\n                            width=600,\n                            height=100,\n                            bg='dodger blue')\n        self.top_fr.pack(fill=X)\n\n        self.hdg = Label(self.top_fr,\n                         text='  21 Game  ',\n                         font='arial 22 bold',\n                         fg='navy',\n                         bg='lemon chiffon')\n        self.hdg.place(relx=0.5, rely=0.5,\n                       anchor=CENTER)\n\n        self.play_btn = Button(self.top_fr,\n                               text='Play\\nGame',\n                               bd=5,\n                               bg='navy',\n                               fg='lemon chiffon',\n                               font='arial 12 bold',\n                               command=self.play_game)\n        self.play_btn.place(relx=0.92, rely=0.5,\n                            anchor=E)\n\n        self.quit_btn = Button(self.top_fr,\n                               text='Quit\\nGame',\n                               bd=5,\n                               bg='navy',\n                               fg='lemon chiffon',\n                               font='arial 12 bold',\n                               command=self.quit_game)\n        self.quit_btn.place(relx=0.07, rely=0.5,\n                            anchor=W)\n\n        # bottom frame:\n        self.btm_fr = Frame(gw,\n                            width=600,\n                            height=500,\n                            bg='lemon chiffon')\n        self.btm_fr.pack(fill=X)\n\n        self.msg = Label(self.btm_fr,\n                         text=\"(Click 'Play' or 'Quit')\",\n                         font='arial 16 bold',\n                         fg='navy',\n                         bg='lemon chiffon')\n        self.msg.place(relx=0.5, rely=0.1,\n                       anchor=CENTER)\n\n        self.hdg = Label(self.btm_fr,\n                         text=\"Scoreboard\",\n                         font='arial 16 bold',\n                         fg='navy',\n                         bg='lemon chiffon')\n        self.hdg.place(relx=0.5, rely=0.2,\n                       anchor=CENTER)\n\n        self.score_msg = Label(self.btm_fr,\n                               text=\"0\",\n                               font='arial 16 bold',\n                               fg='navy',\n                               bg='dodger blue',\n                               width=8)\n        \n        self.score_msg.place(relx=0.5, rely=0.27,\n                             anchor=CENTER)\n\n        self.ch_fr = LabelFrame(self.btm_fr,\n                                text='Choose a number',\n                                bg='dodger blue',\n                                fg='navy',\n                                bd=8,\n                                relief=RIDGE,\n                                font='arial 16 bold')\n        self.ch_fr.place(relx=0.5, rely=0.5,\n                         anchor=CENTER)\n\n        self.radio1 = Radiobutton(self.ch_fr,\n                                  text='1',\n                                  state='disabled',\n                                  font='arial 16 bold',\n                                  fg='navy',\n                                  bg='dodger blue',\n                                  variable=self.var123,\n                                  value=1)\n        self.radio1.pack()\n\n        self.radio2 = Radiobutton(self.ch_fr,\n                                  text='2',\n                                  state='disabled',\n                                  font='arial 16 bold',\n                                  fg='navy', \n                                  bg='dodger blue',\n                                  variable=self.var123,\n                                  value=2)\n        self.radio2.pack()\n\n        self.radio3 = Radiobutton(self.ch_fr,\n                                  text='3',\n                                  state='disabled',\n                                  font='arial 16 bold ',\n                                  fg='navy', \n                                  bg='dodger blue',\n                                  variable=self.var123,\n                                  value=3)\n        self.radio3.pack()\n\n        self.submit_btn = Button(self.btm_fr,\n                                 text='SUBMIT',\n                                 state='disabled',\n                                 bd=5,\n                                 bg='navy',\n                                 fg='lemon chiffon',\n                                 font='arial 12 bold',\n                                 command=self.submit)\n        self.submit_btn.place(relx=0.5, rely=0.75,\n                              anchor=CENTER)\n\n        self.won_lbl = Label(self.btm_fr,\n                             text=\"Won: 0\",\n                             font='arial 16 bold',\n                             fg='navy',\n                             bg='lemon chiffon')\n        self.won_lbl.place(relx=0.85, rely=0.88,\n                           anchor=W)\n\n        self.lost_lbl = Label(self.btm_fr,\n                              text=\"Lost: 0\",\n                              font='arial 16 bold',\n                              fg='navy',\n                              bg='lemon chiffon')\n        self.lost_lbl.place(relx=0.85, rely=0.93,\n                            anchor=W)\n\n    # play one game:    \n    def play_game(self):\n        self.play_btn.config(state='disabled')\n        # pick who goes first randomly:\n        self.puter_turn = random.choice([True, False])\n        self.score = 0\n        self.score_msg.config(text=self.score)\n        if not self.puter_turn:\n            m = 'your turn'\n            self.msg.config(text=m)\n        # alternate turns until 21 is reached:\n        while self.score != 21:\n            if self.puter_turn:\n                self.puter_plays()\n            else:\n                self.user_plays()\n            self.puter_turn = not self.puter_turn\n        self.play_btn.config(state='normal')\n        return\n\n    # computer picks a number:\n    def puter_plays(self):\n        if self.score == 20:\n            x = 1\n        elif self.score == 19:\n                x = random.choice([1, 2])\n        else:\n            x = random.choice([1, 2, 3])\n        self.score += x\n        self.score_msg.config(text=self.score)\n        if self.score == 21:\n            m = 'Computer won!'\n            self.lost += 1\n            self.lost_lbl.config(text='Lost: ' + str(self.lost))\n        else:\n            m = 'Computer chose ' + str(x) + ', your turn'\n        self.msg.config(text=m)\n        return\n\n    # user picks a number:\n    def user_plays(self):\n        self.set_user_state('normal')\n        while True:\n            # wait for submit button to be pressed:\n            self.submit_btn.wait_variable(self.varsub)\n            x = self.var123.get()\n            if x + self.score > 21:\n                m = 'Score cannot exceed 21, try again'\n                messagebox.showerror('Error', m)\n            elif x not in (1,2,3):\n                m = 'No selection made'\n                messagebox.showerror('Error', m)\n            else:\n                break\n        self.score += x\n        if self.score == 21:\n            m = 'You won!'\n            self.msg.config(text=m)\n            self.score_msg.config(text=self.score)\n            self.won += 1\n            self.won_lbl.config(text='Won: ' + str(self.won))\n        # reset and disable radio buttons:   \n        self.var123.set(0)  \n        self.set_user_state('disabled')                     \n        return\n\n    # set radio buttons to 'disabled' or 'normal':\n    def set_user_state(self, state):\n        self.radio1.config(state=state)\n        self.radio2.config(state=state)\n        self.radio3.config(state=state)\n        self.submit_btn.config(state=state)\n        return\n        \n                            \n    def quit_game(self):\n        self.window.destroy()\n\n    # indicate that submit button was pressed:\n    def submit(self):\n        self.varsub.set(0)\n\n# ************************************************\n\nroot = Tk()\nroot.title('21 Game')\nroot.geometry('600x600+100+50')\nroot.resizable(False, False)\ng = Game(root)\nroot.mainloop()\n",
        "safe": true
    },
    {
        "filename": "21 game_68.txt",
        "content": "  [ say\n    \"Who goes first: Computer, Player\"\n    say \" or Random?\"  cr\n    [ $ \"Enter C, P or R: \" input\n      dup size 1\u00a0!= iff drop again\n      0 peek\n      dup char C = iff [ drop 0 ] done\n      dup char P = iff [ drop 1 ] done\n      char R = iff [ 2 random ] done\n       again ]\n    cr\n    dup iff [ say \"You go first.\" ]\n    else [ say \"I will go first.\" ]\n    cr ]                                  is chooseplayer (   --> n   )\n\n                                  forward is player       ( n --> n x )\n\n  [ [ dup 17 > iff 1 done\n      4 over 4 mod\n      dup 0 = if [ drop 3 ]\n      - ]\n    dup say \"Computer chooses \" echo\n    say \".\" cr\n    + ' player ]                          is computer     ( n --> n x )\n\n  [ say \"Choose 1 2 or 3 (running \"\n    $ \"total must not exceed 21, Q to quit): \" input\n    dup $ \"Q\" = iff [ drop 21 999 ] done\n    trim reverse trim reverse\n    $->n not iff drop again\n    dup 1 4 within not iff drop again\n    2dup + 21 > iff drop again\n    + ' computer ]                  resolves player       ( n --> n x )\n\n  [ say \"The player who makes 21 loses.\" cr\n    0 chooseplayer\n    iff [ ' player ] else [ ' computer ]\n    [ say \"Running total is \"\n      over echo say \".\" cr cr\n      do\n      over 21 = until ]\n    cr\n    dup 999 = iff\n      [ drop 2drop say \"Quitter!\" ] done\n    ' computer = iff\n        [ say \"The computer won!\" ]\n    else [ say \"You won! Well done!\" ]\n    drop ]                                 is play        (   -->     )",
        "safe": true
    },
    {
        "filename": "21 game_69.txt",
        "content": "/O> play\n... \nThe player who makes 21 loses.\nWho goes first: Computer, Player or Random?\nEnter C, P or R: C\n\nI will go first.\nRunning total is 0.\n\nComputer chooses 1.\nRunning total is 1.\n\nChoose 1 2 or 3 (running total must not exceed 21, Q to quit): Q\n\nQuitter!\nStack empty.\n\n/O> play\n... \nThe player who makes 21 loses.\nWho goes first: Computer, Player or Random?\nEnter C, P or R: R\n\nYou go first.\nRunning total is 0.\n\nChoose 1 2 or 3 (running total must not exceed 21, Q to quit): 2\nRunning total is 2.\n\nComputer chooses 2.\nRunning total is 4.\n\nChoose 1 2 or 3 (running total must not exceed 21, Q to quit): 3\nRunning total is 7.\n\nComputer chooses 1.\nRunning total is 8.\n\nChoose 1 2 or 3 (running total must not exceed 21, Q to quit): 1\nRunning total is 9.\n\nComputer chooses 3.\nRunning total is 12.\n\nChoose 1 2 or 3 (running total must not exceed 21, Q to quit): 4\nChoose 1 2 or 3 (running total must not exceed 21, Q to quit): 1\nRunning total is 13.\n\nComputer chooses 3.\nRunning total is 16.\n\nChoose 1 2 or 3 (running total must not exceed 21, Q to quit): 3\nRunning total is 19.\n\nComputer chooses 1.\nRunning total is 20.\n\nChoose 1 2 or 3 (running total must not exceed 21, Q to quit): 2\nChoose 1 2 or 3 (running total must not exceed 21, Q to quit): 1\n\nThe computer won!\nStack empty.\n\n/O> ",
        "safe": true
    },
    {
        "filename": "21 game_7.txt",
        "content": "print \"-----------------------------\"\nprint \" Welcome to 21 Game\"\nprint \"-----------------------------\"\n\nplayers: [\"A\" \"B\"]\ncurrentPlayer: sample players\nnextPlayer: first players -- currentPlayer\nrunningTotal: new 0\nnum: 0\n\ngetNum: function [][\n    result: strip input \"Enter a number (1,2,3) / x to exit: \"\n    if result=\"x\" -> exit\n    return result\n]\n\nloop.forever @[currentPlayer nextPlayer] 'plays [\n    print [\"Running total:\" runningTotal]\n    print [\"Player\" plays \"turn\"]\n\n    num: getNum\n\n    while [or? [not? numeric? num][not? contains? 1..3 to :integer num]][\n        num: getNum\n    ]\n\n    runningTotal: runningTotal + to :integer num\n\n    print \"\"\n\n    if runningTotal=21 [\n        print [\"Running total is 21. Player\" plays \"won!\"]\n        exit\n    ]\n]\n",
        "safe": true
    },
    {
        "filename": "21 game_70.txt",
        "content": "game21<-function(first = c(\"player\",\"ai\",\"random\"),sleep=.5){\n  state = 0\n  finished = F\n  turn = 1\n  if(length(first)==1 && startsWith(tolower(first),\"r\")){\n    first = rbinom(1,1,.5)\n  }else{\n    first = (length(first)>1 || startsWith(tolower(first),\"p\"))\n  }\n  while(!finished){\n    if(turn>1 || first){\n      cat(\"The total is now\",state,\"\\n\");Sys.sleep(sleep)\n      while(T){\n        player.move = readline(prompt = \"Enter move: \")\n        if((player.move==\"1\"||player.move==\"2\"||player.move==\"3\") && state+as.numeric(player.move)<=21){\n          player.move = as.numeric(player.move)\n          state = state + player.move\n          break\n        }else if(tolower(player.move)==\"exit\"|tolower(player.move)==\"quit\"|tolower(player.move)==\"end\"){\n          cat(\"Goodbye.\\n\")\n          finished = T\n          break\n        }else{\n          cat(\"Error: invaid entry.\\n\")\n        }\n      }\n    }\n    if(state == 21){\n      cat(\"You win!\\n\")\n      finished = T\n    }\n    if(!finished){\n      cat(\"The total is now\",state,\"\\n\");Sys.sleep(sleep)\n      while(T){\n        ai.move = sample(1:3,1)\n        if(state+ai.move<=21){\n          break\n        }\n      }\n      state = state + ai.move\n      cat(\"The AI chooses\",ai.move,\"\\n\");Sys.sleep(sleep)\n      if(state == 21){\n        cat(\"The AI wins!\\n\")\n        finished = T\n      }\n    }\n    turn = turn + 1\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "21 game_71.txt",
        "content": "game21()\n",
        "safe": true
    },
    {
        "filename": "21 game_72.txt",
        "content": "The total is now 0 \nEnter move: 3\nThe total is now 3 \nThe AI chooses 2 \nThe total is now 5 \nEnter move: 3\nThe total is now 8 \nThe AI chooses 3 \nThe total is now 11 \nEnter move: 3\nThe total is now 14 \nThe AI chooses 2 \nThe total is now 16 \nEnter move: 1\nThe total is now 17 \nThe AI chooses 3 \nThe total is now 20 \nEnter move: 1\nThe total is now 21 \nYou win!",
        "safe": true
    },
    {
        "filename": "21 game_73.txt",
        "content": "game21(first = \"ai\")\n",
        "safe": true
    },
    {
        "filename": "21 game_74.txt",
        "content": "The total is now 0 \nThe AI chooses 2 \nThe total is now 2\nEnter move: quit\nGoodbye.\n",
        "safe": true
    },
    {
        "filename": "21 game_75.txt",
        "content": "#lang racket\n\n(define limit 21)\n(define max-resp 3)\n\n(define (get-resp)\n  (let loop ()\n    (match (read-line)\n      [(app (conjoin string? string->number) n)\n       #:when (and (exact-integer? n) (<= 1 n max-resp))\n       n]\n      [\"q\" (exit)]\n      [n (printf \"~a is not in range 1 and ~a\\n\" n max-resp)\n         (loop)])))\n\n(define (win human?) (printf \"~a wins\\n\" (if human? \"Human\" \"Computer\")))\n\n(printf \"The ~a game. Each player chooses to add a number\nin range 1 and ~a to a running total.\nThe player whose turn it is when the total reaches exactly ~a wins.\nEnter q to quit.\\n\\n\" limit max-resp limit)\n\n(let loop ([total 0] [human-turn? (= 0 (random 2))])\n  (define new-total\n    (+ total\n       (cond\n         [human-turn? (printf \"Running total is: ~a\\n\" total)\n                      (printf \"Your turn:\\n\")\n                      (get-resp)]\n         [else (define resp (random 1 (add1 max-resp)))\n               (printf \"Computer plays: ~a\\n\" resp)\n               resp])))\n  (cond\n    [(= new-total limit) (win human-turn?)]\n    [(> new-total limit) (win (not human-turn?))]\n    [else (loop new-total (not human-turn?))]))\n",
        "safe": true
    },
    {
        "filename": "21 game_76.txt",
        "content": "The 21 game. Each player chooses to add an integer\nin range 1 and 3 to a running total.\nThe player whose turn it is when the total reaches exactly 21 wins.\nEnter q to quit.\n\nRunning total is: 0\nYour turn:\n1\nComputer plays: 3\nRunning total is: 4\nYour turn:\nfoo\nfoo is not an integer in range 1 and 3\nYour turn:\nbar\nbar is not an integer in range 1 and 3\nYour turn:\n3\nComputer plays: 1\nRunning total is: 8\nYour turn:\n1\nComputer plays: 1\nRunning total is: 10\nYour turn:\n1\nComputer plays: 2\nRunning total is: 13\nYour turn:\n1\nComputer plays: 3\nRunning total is: 17\nYour turn:\n1\nComputer plays: 2\nRunning total is: 20\nYour turn:\n1\nHuman wins\n",
        "safe": true
    },
    {
        "filename": "21 game_77.txt",
        "content": "say qq :to 'HERE';\n    The 21 game. Each player chooses to add 1, 2, or 3 to a running total.\n    The player whose turn it is when the total reaches 21 wins. Enter q to quit.\n    HERE\n\nmy $total = 0;\nloop {\n    say \"Running total is: $total\";\n    my ($me,$comp);\n    loop {\n        $me = prompt 'What number do you play> ';\n        last if $me ~~ /^<[123]>$/;\n        insult $me;\n    }\n    $total += $me;\n    win('Human') if $total >= 21;\n    say \"Computer plays: { $comp = (1,2,3).roll }\\n\";\n    $total += $comp;\n    win('Computer') if $total >= 21;\n}\n\nsub win ($player) {\n    say \"$player wins.\";\n    exit;\n}\n\nsub insult ($g) {\n    exit if $g eq 'q';\n    print ('Yo mama,', 'Jeez,', 'Ummmm,', 'Grow up,', 'Did you even READ the instructions?').roll;\n    say \" $g is not an integer between 1 & 3...\"\n}\n",
        "safe": true
    },
    {
        "filename": "21 game_78.txt",
        "content": "The 21 game. Each player chooses to add 1, 2, or 3 to a running total.\nThe player whose turn it is when the total reaches 21 wins. Enter q to quit.\n\nRunning total is: 0\nWhat number do you play> 5\nDid you even READ the instructions? 5 is not an integer between 1 & 3...\nWhat number do you play> g\nYo mama, g is not an integer between 1 & 3...\nWhat number do you play> 12\nJeez, 12 is not an integer between 1 & 3...\nWhat number do you play> 3\nComputer plays: 2\n\nRunning total is: 5\nWhat number do you play> 3\nComputer plays: 3\n\nRunning total is: 11\nWhat number do you play> 1\nComputer plays: 1\n\nRunning total is: 13\nWhat number do you play> 3\nComputer plays: 2\n\nRunning total is: 18\nWhat number do you play> 3\nHuman wins.",
        "safe": true
    },
    {
        "filename": "21 game_79.txt",
        "content": "/*REXX program plays the  21  game with a human,  each player chooses 1, 2, or 3  which */\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 is added to the current sum, the first player to reach  21  exactly wins.*/\nsep= copies('\u2500', 8);  sep2= \" \"copies('\u2550', 8)\" \" /*construct an eye\u2500catching msg fences.*/\nsay sep  'Playing the  21  game.'                /*tell what's happening here at the zoo*/\n$=0;                       goal= 21              /*the sum [or running total]  (so far).*/\n    do j=1  while $<goal;  call g                /*obtain the user's number via a prompt*/\n    if x\\==0    then call tot x, 1               /*Not 0?   The user wants to go first. */\n    if $==goal  then leave                       /*the user won the game with the last #*/\n    call ?;     if y==.  then y= random(1, 3)    /*get computer's choice  or  a random #*/\n    say sep 'The computer chooses '     y     \" as its choice.\"         /*inform player.*/\n    call tot y, 0                                /*call subroutine to show the total.   */\n    end   /*j*/\nsay\nif who  then say sep  'Congratulations!   You have won the  21  game.'\n        else say sep  'The computer has won the  21  game.'\nexit 0                                           /*stick a fork in it,  we're all done. */\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\n?:   y=.;   do c=1  for 3  until y\\==.;  if (c+$) // 4 == 1  then y= c;    end;     return\nser: if bad  then return;  bad=1;  say;  say;  say sep '***error***' arg(1);  say;  return\ntot: arg q,who; $=$+q; say sep 'The game total is now' sep2 $ sep2; /*add; show $*/ return\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\ng: low = (j \\== 1)                               /*allow user to have computer go first.*/\n     do until \\bad;   bad= 0;     say            /*prompt 'til user gives a good number.*/\n     say sep  'Please enter a number from ' low \" \u2500\u2500\u2500\u25ba 3               (or Quit):\"\n     if j=1  then say sep '[A value of 0 (zero) means you want the computer to go first.]'\n     parse pull x _ . 1 ox;   upper x            /*obtain user's lowercase response(s). */\n     if   x=''             then call ser \"Nothing entered.\"\n     if _\\==''             then call ser \"Too many arguments entered: \"       ox\n     if abbrev('QUIT', x, 1)  then do;   say;      say sep  \"quitting.\";      exit 1;  end\n     if \\datatype(x, 'N')  then call ser \"Argument isn't numeric: \"           ox\n     if \\datatype(x, 'W')  then call ser \"Number isn't an integer: \"          ox\n     if x<0                then call ser \"Number can't be negative: \"          x\n     if x=0  &  j>1        then call ser \"Number can't be zero: \"              x\n     if x>3                then call ser \"Number is too large  (>3): \"         x\n     if bad                then iterate          /*Had an error? Then get another number*/\n     x= x/1; if $+x>goal   then call ser \"Number will cause the sum to exceed \" goal': ' x\n     end   /*until*/;           return\n",
        "safe": true
    },
    {
        "filename": "21 game_8.txt",
        "content": "-----------------------------\n Welcome to 21 Game\n-----------------------------\nRunning total: 0 \nPlayer B turn \nEnter a number (1,2,3) / x to exit: 1\n\nRunning total: 1 \nPlayer A turn \nEnter a number (1,2,3) / x to exit: 2\n\nRunning total: 3 \nPlayer B turn \nEnter a number (1,2,3) / x to exit: 1\n\nRunning total: 4 \nPlayer A turn \nEnter a number (1,2,3) / x to exit: 3\n\nRunning total: 7 \nPlayer B turn \nEnter a number (1,2,3) / x to exit: 4\nEnter a number (1,2,3) / x to exit: 2\n\nRunning total: 9 \nPlayer A turn \nEnter a number (1,2,3) / x to exit: 3\n\nRunning total: 12 \nPlayer B turn \nEnter a number (1,2,3) / x to exit: 1\n\nRunning total: 13 \nPlayer A turn \nEnter a number (1,2,3) / x to exit: 2\n\nRunning total: 15 \nPlayer B turn \nEnter a number (1,2,3) / x to exit: 3\n\nRunning total: 18 \nPlayer A turn \nEnter a number (1,2,3) / x to exit: 3\n\nRunning total is 21. Player A won!",
        "safe": true
    },
    {
        "filename": "21 game_80.txt",
        "content": "\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Playing the  21  game.\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a number from  0  \u2500\u2500\u2500\u25ba 3               (or Quit):\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 [A value of 0 (zero) means you want the computer to go first.]\n3                                                                         \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The game total is now  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550  3  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The computer chooses  2  as its choice.\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The game total is now  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550  5  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a number from  1  \u2500\u2500\u2500\u25ba 3               (or Quit):\n3                                                                         \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The game total is now  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550  8  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The computer chooses  1  as its choice.\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The game total is now  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550  9  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a number from  1  \u2500\u2500\u2500\u25ba 3               (or Quit):\n3                                                                         \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The game total is now  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550  12  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The computer chooses  1  as its choice.\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The game total is now  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550  13  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a number from  1  \u2500\u2500\u2500\u25ba 3               (or Quit):\n3                                                                         \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The game total is now  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550  16  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The computer chooses  1  as its choice.\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The game total is now  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550  17  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a number from  1  \u2500\u2500\u2500\u25ba 3               (or Quit):\n1                                                                          \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The game total is now  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550  18  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The computer chooses  3  as its choice.\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The game total is now  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550  21  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The computer has won the  21  game.\n",
        "safe": true
    },
    {
        "filename": "21 game_81.txt",
        "content": "# Project\u00a0: 21 Game\n\nload \"guilib.ring\"\n\nlimit = 21\nposold = 0\nbutton = list(limit)\nmynum = list(3)\nyournum = list(3)\n\nnew qapp \n        {\n        win1 = new qwidget() {\n                  setwindowtitle(\"21 Game\")\n                  setgeometry(100,100,1000,600)\n                  label1 = new qlabel(win1) {\n                              setgeometry(10,10,1000,600)\n                              settext(\"\")\n                  }\n\n                  label2 = new qlabel(win1) {\n                              setgeometry(240,50,120,40)\n                              setAlignment(Qt_AlignHCenter)\n                              setFont(new qFont(\"Verdana\",12,100,0))\n                              settext(\"my number:\")\n                  }\n\n                  label3 = new qlabel(win1) {\n                              setgeometry(640,50,120,40)\n                              setAlignment(Qt_AlignHCenter)\n                              setFont(new qFont(\"Verdana\",12,100,0))\n                              settext(\"your number:\")\n                  }\n\n                  for p = 1 to 3\n                       mynum[p] = new qpushbutton(win1) {\n                                          setgeometry(200+p*40,100,40,40)\n                                          setstylesheet(\"background-color:orange\")\n                                          settext(string(p))\n                                          setclickevent(\"choose(\" + string(p) + \",1)\")\n                                          }\n                   next\n\n                   for p = 1 to 3\n                        yournum[p] = new qpushbutton(win1) {\n                                             setgeometry(600+p*40,100,40,40)\n                                             setstylesheet(\"background-color:white\")\n                                             settext(string(p))\n                                             setclickevent(\"choose(\" + string(p) + \",2)\")\n                                             }\n                   next\n\n                   for n = 1 to limit\n                        button[n] = new qpushbutton(win1) {\n                                          setgeometry(40+n*40,190,40,40)\n                                          settext(string(n))\n                                          }\n                    next\n                    show()\n        }\n        exec()\n        }\n\nfunc choose(ch,ym)\n        pos = posold + ch\n        if pos > limit\n           msg = \"You must choose number from 1 to \" + string(limit - posold)\n           msgBox(msg)\n           for n = 1 to 3\n                mynum[n].setenabled(false)\n                yournum[n].setenabled(false)\n           next\n           return\n        ok\n        for n = posold+1 to pos\n             if ym = 1\n                button[n] { setstylesheet(\"background-color:orange\") }\n             else\n                button[n] { setstylesheet(\"background-color:white\") }\n             ok\n        next\n        posold = pos\n        if ym = 1\n           for n = 1 to 3\n                mynum[n].setenabled(false)\n                yournum[n].setenabled(true)\n           next\n         else\n           for n = 1 to 3\n                mynum[n].setenabled(true)\n                yournum[n].setenabled(false)\n           next\n         ok\n         if pos = 21\n            if ym = 1\n               msgBox(\"I won!\")\n            else\n               msgBox(\"You won!\")\n            ok\n         ok\n\nfunc msgBox(text) {\n\tm = new qMessageBox(win1) {\n\t       setWindowTitle(\"21 Game\")\n\t       setText(text)\n\t       show()\n\t       }\n        }",
        "safe": true
    },
    {
        "filename": "21 game_82.txt",
        "content": "# 21 Game - an example in Ruby for Rosetta Code.\n\nGOAL = 21\nMIN_MOVE = 1\nMAX_MOVE = 3\n\nDESCRIPTION = \"\n*** Welcome to the 21 Game! ***\n21 is a two player game.\nEach player chooses to add 1, 2 or 3 to a running total.\nThe player whose turn it is when the total reaches 21 will win the game.\nThe running total starts at zero.\n\nThe players start the game in turn.\nEnter q to quit at any time.\n\"\n\n#\n# Returns the best move to play.\n#\ndef best_move(total)\n  move = rand(1..3)\n  MIN_MOVE.upto(MAX_MOVE) do |i|\n    move = i if (total + i - 1) % (MAX_MOVE + 1) == 0\n  end\n  MIN_MOVE.upto(MAX_MOVE) do |i|\n    move = i if total + i == GOAL\n  end\n  move\nend\n\n#\n# Gets the move of the player.\n#\ndef get_move\n  print \"Your choice between #{MIN_MOVE} and #{MAX_MOVE}: \"\n  answer = gets\n  move = answer.to_i\n  until move.between?(MIN_MOVE, MAX_MOVE)\n    exit if answer.chomp == 'q'\n    print 'Invalid choice. Try again: '\n    answer = gets\n    move = answer.to_i\n  end\n  move\nend\n\n#\n# Asks the player to restart a game and returns the answer.\n#\ndef restart?\n  print 'Do you want to restart (y/n)? '\n  restart = gets.chomp\n  until ['y', 'n'].include?(restart)\n    print 'Your answer is not a valid choice. Try again: '\n    restart = gets.chomp\n  end\n  restart == 'y'\nend\n\n#\n# Run a game. The +player+ argument is the player that starts:\n# * 1 for human\n# * 0 for computer\n#\ndef game(player)\n  total = round = 0\n  while total < GOAL\n    round += 1\n    puts \"--- ROUND #{round} ---\\n\\n\"\n    player = (player + 1) % 2\n    if player == 0\n      move = best_move(total)\n      puts \"The computer chooses #{move}.\"\n    else\n      move = get_move\n    end\n    total += move\n    puts \"Running total is now #{total}.\\n\\n\"\n  end\n  if player == 0\n    puts 'Sorry, the computer has won!'\n    return false\n  end\n  puts 'Well done, you have won!'\n  true\nend\n\n# MAIN\nputs DESCRIPTION\nrun = true\ncomputer_wins = human_wins = 0\ngames_counter = player = 1\nwhile run\n  puts \"\\n=== START GAME #{games_counter} ===\"\n  player = (player + 1) % 2\n  if game(player)\n    human_wins += 1\n  else\n    computer_wins += 1\n  end\n  puts \"\\nComputer wins #{computer_wins} games, you wins #{human_wins} game.\"\n  games_counter += 1\n  run = restart?\nend\nputs 'Good bye!'\n",
        "safe": true
    },
    {
        "filename": "21 game_83.txt",
        "content": "use rand::Rng;\nuse std::io;\n\n#[derive(Clone)]\nenum PlayerType {\n    Human,\n    Computer,\n}\n\n#[derive(Clone)]\nstruct Player {\n    name: String,\n    wins: u32,  // holds wins\n    level: u32, // difficulty level of Computer\n    player_type: PlayerType, \n}\n\ntrait Choose {\n    fn choose(&self, game: &Game) -> u8;\n}\n\nimpl Player {\n    fn new(name: &str, player_type: PlayerType, level: u32) -> Player {\n        Player {\n            name: String::from(name),\n            wins: 0,\n            level,\n            player_type,\n        }\n    }\n    fn get_name(&self) -> &str {\n        &self.name[..]\n    }\n    fn get_level(&self) -> u32 {\n        self.level\n    }\n    fn add_win(&mut self) {\n        self.wins += 1\n    }\n    fn level_up(&mut self) {\n        self.level += 1\n    }\n}\n\nimpl Choose for Player {\n    fn choose(&self, game: &Game) -> u8 {\n        match self.player_type {\n            PlayerType::Human => loop {\n                let max_choice = game.max_choice();\n                match max_choice {\n                    1 => println!(\"Enter a number 1 to win (or quit):\"),\n                    _ => println!(\"Enter a number between 1 and {} (or quit):\", max_choice)\n                }\n                let mut guess = String::new();\n                io::stdin()\n                    .read_line(&mut guess)\n                    .expect(\"Failed to read line\");\n                if guess.trim() == \"quit\" {\n                    return 0\n                }\n                let guess: u8 = match guess.trim().parse() {\n                    Ok(num) if num >= 1 && num <= max_choice => num,\n                    Ok(_) => continue,\n                    Err(_) => continue,\n                };\n                return guess;\n            },\n            PlayerType::Computer => match self.level {\n                5 => match game.get_total() {\n                    total if total == 20 => 1,\n                    total if total == 19 => 2,\n                    total if total == 18 => 3,\n                    _ => 1,\n                },\n                4 => match game.get_total() {\n                    total if total == 20 => 1,\n                    total if total == 19 => 2,\n                    total if total == 18 => 3,\n                    _ => rand::thread_rng().gen_range(1, 3),\n                },\n                3 => match game.get_total() {\n                    total if total == 20 => 1,\n                    total if total == 19 => 2,\n                    total if total == 18 => 3,\n                    _ => rand::thread_rng().gen_range(1, 4),\n                },\n                2 => match game.get_total() {\n                    total if total == 20 => 1,\n                    total if total == 19 => 2,\n                    _ => rand::thread_rng().gen_range(1, 3),\n                },\n                1 => 1,\n                _ => match game.get_total() {\n                    total if total == 20 => 1,\n                    total if total == 19 => 2,\n                    total if total == 18 => 3,\n                    _ => match game.get_remaining() % 4 {\n                        0 => rand::thread_rng().gen_range(1, 4),\n                        _ => game.get_remaining() % 4,\n                    },\n                },\n            },\n        }\n    }\n}\n\nstruct Game {\n    players: Vec<Player>,\n    turn: u8,  \n    total: u8, \n    start: u8, // determines which player goes first\n}\n\nimpl Game {\n    fn init(players: &Vec<Player>) -> Game {\n        Game {\n            players: players.to_vec(),\n            turn: 1,\n            total: 0,\n            start: rand::thread_rng().gen_range(0, 2),\n        }\n    }\n    fn play(&mut self) -> &Player {\n        loop {\n            println!(\n                \"Total now {} (remaining: {})\",\n                self.get_total(),\n                self.get_remaining()\n            );\n            {\n                let player = self.whose_turn();\n                println!(\"Turn: {} ({} turn)\", self.get_turn(), player.get_name());\n                let choice = player.choose(&self);\n                if choice == 0 {\n                    self.next_turn();\n                    break; // quit\n                }\n                println!(\"{} choose {}\", player.get_name(), choice);\n                self.add_total(choice)\n            }\n            if self.get_total() >= 21 {\n                break;\n            }\n            println!(\"\");\n            self.next_turn();\n        }\n        self.whose_turn()\n    }\n    fn add_total(&mut self, choice: u8) {\n        self.total += choice;\n    }\n    fn next_turn(&mut self) {\n        self.turn += 1;\n    }\n    fn whose_turn(&self) -> &Player {\n        let index: usize = ((self.turn + self.start) % 2).into();\n        &self.players[index]\n    }\n    fn get_total(&self) -> u8 {\n        self.total\n    }\n    fn get_remaining(&self) -> u8 {\n        21 - self.total\n    }\n    fn max_choice(&self) -> u8 {\n        match self.get_remaining() {\n            1 => 1,\n            2 => 2,\n            _ => 3\n        }\n    }\n    fn get_turn(&self) -> u8 {\n        self.turn\n    }\n}\n\nfn main() {\n    let mut game_count = 0;\n    let mut players = vec![\n        Player::new(\"human\", PlayerType::Human, 0),\n        Player::new(\"computer\", PlayerType::Computer, 1),\n    ];\n    println!(\"21 Game\");\n    println!(\"Press enter key to start\");\n    {\n        let _ = io::stdin().read_line(&mut String::new());\n    }\n    loop {\n        game_count += 1;\n        let mut game = Game::init(&players);\n        let winner = game.play();\n        {\n            let mut index = 0;\n            while index < players.len() {\n                if players[index].get_name() == winner.get_name() {\n                    players[index].add_win();\n                }\n                index += 1\n            }\n        }\n        println!(\"\\n{} won game {}\\n\", winner.get_name(), game_count);\n        // limit game count\n        if game_count >= 10000 {\n            break;\n        }\n        // ask player if they want to keep on playing\n        println!(\"Press enter key to play again (or quit):\");\n        let mut reply = String::new();\n        io::stdin()\n            .read_line(&mut reply)\n            .expect(\"Failed to read line\");\n        if reply.trim() == \"quit\" {\n            break;\n        }\n        // level up computer\n        if winner.get_name() != \"computer\" {\n            println!(\"Computer leveling up ...\");\n            players[1].level_up();\n            println!(\"Computer now level {}!\", players[1].get_level());\n            println!(\"Beware!\\n\");\n        }\n    }\n    println!(\"player: {} win: {}\", players[0].get_name(), players[0].wins);\n    println!(\"player: {} win: {}\", players[1].get_name(), players[1].wins);\n}\n",
        "safe": true
    },
    {
        "filename": "21 game_84.txt",
        "content": "object Game21 {\n\n  import scala.collection.mutable.ListBuffer\n  import scala.util.Random\n\n  val N = 21 // the same game would also work for N other than 21...\n\n  val RND = new Random() // singular random number generator; add a seed number, if you want reproducibility\n\n  /** tuple: name and a play function: (rest: remaining number, last: value of opponent's last move) => new move\n    */\n  type Player = (String, (Int,Int) => Int)\n\n  // indeed, the following could also be written using a class and instances, I've choosen a\n  // more functional and math way (using tuples)...\n  val playerRandom:Player = (\"RandomRobot\", { (rest, last) =>\n    if (rest <= 3) rest\n    else 1 + RND.nextInt(3)\n  })\n  val playerBest:Player = (\"BestRobot\", { (rest, last) =>\n    val i = rest % 4\n    if (i > 0) i else 1 + RND.nextInt(3)\n  })\n  val playerHuman:Player = (\"YOU\", { (rest, last) =>\n    println(\"Rest: \"+rest)\n    println(\"Last: \"+last)\n    var in = \"\"\n    while (in!=\"1\" && in!=\"2\" && in!=\"3\") {\n      in = scala.io.StdIn.readLine(\"Your move (1,2,3,q)> \").trim\n      if (\"q\" == in)\n        throw new Exception(\"q => quit\")\n    }\n    in.toInt\n  })\n\n  /** Execute a whole game. NOTE that we're counting DOWN from N to 0!\n    * @param players\n    * @return list of all moves\n    */\n  def play(players:Seq[Player]):Seq[Int] = {\n    require(players.size == 2)\n    var last = -1\n    var rest = N\n    var p = 0 // player 0 always starts\n    val l = ListBuffer[Int]() // list of all moves\n    while (rest > 0) {\n      last = players(p)._2(rest,last)\n      require(1<=last && last<=3,\"Player must always play 1,2,3: \"+last)\n      l += last\n      rest -= last\n      p = 1 - p // other player's turn\n    }\n    l.toSeq\n  }\n\n  /** Evaluate a whole game.\n    * @param game list of moves of one game\n    * @param rest mainly for recursion\n    * @return evaluation, for each move a tuple: (rest, what was played, whether this player won in the end)\n    */\n  def evaluate(game:Seq[Int],rest:Int=N):Seq[(Int,Int,Boolean)] = {\n    if (game.size == 0) Seq()\n    else Seq((rest,game.head,game.size%2 == 1)) ++ evaluate(game.tail,rest - game.head)\n  }\n\n  def main(args: Array[String]): Unit = {\n    // here you can put whatever player combination you like\n    val players = Seq(playerRandom,playerRandom) // random robot vs random robot\n    //val players = Seq(playerRandom,playerBest) // random robot vs best robot\n    //val players = Seq(playerHuman,playerBest) // You vs best robot\n    var p0won = 0\n    val n = 1000 // number of games to play\n    var m = 0 // games actually played (a human player might quit before n)\n    try {\n      (1 to n).foreach { i =>\n        val g = play(players)\n        require(g.sum == N) // some validity checks\n        val e = evaluate(g)\n        require(e.size == g.size && e.last._3 && e(0)._3 != e(1)._3) // some validity checks\n        if (e(0)._3) p0won += 1\n        m += 1\n        println(i + \": \" + players(0)._1 + \" \" + (if (e(0)._3) \"won\" else \"lost\") + \" against \" + players(1)._1 + \". \" + g + \" => \" + e)\n      }\n    } catch {\n      case t:Throwable => println(t.getMessage)\n    }\n    println(\"Player0: \"+players(0)._1)\n    println(\"Player1: \"+players(1)._1)\n    println(f\"Player0 won ${p0won} times out of ${m}, or ${p0won * 100.0 / m}%%\")\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "21 game_85.txt",
        "content": "dim @p(4) \n\npush 1, 1, 3, 2\nfor i = 3 to 0 step -1\u00a0: @p(i) = pop()\u00a0: next\na = 0\u00a0: t = rnd(2)\n \ndo while s < 21\n  t = 1 - t\n  print using \"The sum is _#\"; s\n  if t = 1 then\n    print \"It is your turn.\"\n    do \n      while (a < 1) + (a > 3) + (a+s > 21)\n      input \"How many would you like to add? \", a\n    loop\n  else\n    print \"It is the computer's turn.\"\n    a = @p(s\u00a0% 4)\n    print using \"The computer adds #.\"; a\n  endif\n\n  print\n  s = s + a\n  a = 0\nloop\n \nif t = 1 then\n  print \"Congratulations. You win.\"\nelse\n  print \"Bad luck. The computer wins.\"\nendif\n",
        "safe": true
    },
    {
        "filename": "21 game_86.txt",
        "content": "' Game 21 in VB.NET - an example for Rosetta Code\n\nClass MainWindow\n    Private Const GOAL As Integer = 21\n    Private total As Integer = 0\n    Private random As New Random\n\n    Private Sub Update(box As TextBox, player As String, move As Integer)\n        total = total + move\n        box.Text = move\n        boxTotal.Text = total\n        If total + 1 > GOAL Then button1.IsEnabled = False\n        If total + 2 > GOAL Then button2.IsEnabled = False\n        If total + 3 > GOAL Then button3.IsEnabled = False\n        If total = GOAL Then\n            winner.Content = $\"The winner is {player}.\"\n        End If\n    End Sub\n\n    Private Sub Ai()\n        Dim move As Integer = 1\n        For i = 1 To 3\n            If (total + i - 1) Mod 4 = 0 Then move = i\n        Next i\n        For i = 1 To 3\n            If total + i = GOAL Then move = i\n        Next i\n        Update(boxAI, \"AI\", move)\n    End Sub\n\n    Private Sub Choice(sender As Object, e As RoutedEventArgs) _\n            Handles button1.Click, button2.Click, button3.Click\n        Update(boxHuman, \"human\", sender.Content)\n        If total < GOAL Then Ai()\n    End Sub\n\n    ' StartGame method handles both OnLoad (WM_INIT?) event \n    ' as well as the restart of the game after user press the 'restart' button.\n    '\n    Private Sub StartGame(sender As Object, e As RoutedEventArgs) Handles restart.Click\n\n        total = 0\n\n        boxAI.Text = \"\"\n        boxHuman.Text = \"\"\n        boxTotal.Text = \"\"\n        'first.Content = \"\" ' It is not necessary, see below.\n        winner.Content = \"\"\n\n        button1.IsEnabled = True\n        button2.IsEnabled = True\n        button3.IsEnabled = True\n\n        ' The random.Next(2) return pseudorandomly either 0 or 1. Generally\n        ' random.Next(n) Return a value from 0 (inclusive) To n - 1 (inclusive).\n        '\n        If random.Next(2) = 0 Then\n            first.Content = \"First player is AI player.\"\n            Ai()\n        Else\n            first.Content = \"First player is human player.\"\n        End If\n    End Sub\nEnd Class\n",
        "safe": true
    },
    {
        "filename": "21 game_87.txt",
        "content": "<Window x:Class=\"MainWindow\"\n        xmlns=\"http://schemas.microsoft.com/winfx/2006/xaml/presentation\"\n        xmlns:x=\"http://schemas.microsoft.com/winfx/2006/xaml\"\n        xmlns:d=\"http://schemas.microsoft.com/expression/blend/2008\"\n        xmlns:mc=\"http://schemas.openxmlformats.org/markup-compatibility/2006\"\n        xmlns:local=\"clr-namespace:Game21vb\"\n        mc:Ignorable=\"d\"\n        Title=\"Game 21\" Height=\"292\" Width=\"409\" Loaded=\"StartGame\">\n    <Grid>\n        <TextBlock \n            HorizontalAlignment=\"Left\" Margin=\"10,10,0,0\" TextWrapping=\"Wrap\" VerticalAlignment=\"Top\" Height=\"64\" Width=\"376\">\n            Game 21 is a two player game, the game is played by choosing a number (1, 2, or 3) to be added to the running total.\n            The game is won by the player whose chosen number causes the running total to reach exactly 21.\n            The running total starts at zero.\n        </TextBlock>\n        <Label Content=\"AI\" HorizontalAlignment=\"Left\" Margin=\"60,121,0,0\" VerticalAlignment=\"Top\" Width=\"49\" HorizontalContentAlignment=\"Right\"/>\n        <Label Content=\"Human\" HorizontalAlignment=\"Left\" Margin=\"60,152,0,0\" VerticalAlignment=\"Top\" HorizontalContentAlignment=\"Right\"/>\n        <Label Content=\"Total\" HorizontalAlignment=\"Left\" Margin=\"60,183,0,0\" VerticalAlignment=\"Top\" Width=\"49\" HorizontalContentAlignment=\"Right\"/>\n        <TextBox x:Name=\"boxAI\" HorizontalAlignment=\"Left\" Height=\"23\" Margin=\"114,125,0,0\" TextWrapping=\"Wrap\" VerticalAlignment=\"Top\" Width=\"120\" IsReadOnly=\"True\"/>\n        <TextBox x:Name=\"boxHuman\" HorizontalAlignment=\"Left\" Height=\"23\" Margin=\"114,156,0,0\" TextWrapping=\"Wrap\" VerticalAlignment=\"Top\" Width=\"120\" IsReadOnly=\"True\"/>\n        <TextBox x:Name=\"boxTotal\" HorizontalAlignment=\"Left\" Height=\"23\" Margin=\"114,187,0,0\" TextWrapping=\"Wrap\" VerticalAlignment=\"Top\" Width=\"120\" IsReadOnly=\"True\"/>\n        <Button x:Name=\"button1\" Content=\"1\" HorizontalAlignment=\"Left\" Margin=\"114,220,0,0\" VerticalAlignment=\"Top\" Width=\"25\"/>\n        <Button x:Name=\"button2\" Content=\"2\" HorizontalAlignment=\"Left\" Margin=\"144,220,0,0\" VerticalAlignment=\"Top\" Width=\"25\"/>\n        <Button x:Name=\"button3\" Content=\"3\" HorizontalAlignment=\"Left\" Margin=\"174,220,0,0\" VerticalAlignment=\"Top\" Width=\"25\"/>\n        <Button x:Name=\"restart\" Content=\"restart\" HorizontalAlignment=\"Left\" Margin=\"215,220,0,0\" VerticalAlignment=\"Top\" Width=\"75\"/>\n        <Label x:Name=\"winner\" HorizontalAlignment=\"Left\" Margin=\"245,184,0,0\" VerticalAlignment=\"Top\" Width=\"133\"/>\n        <Label x:Name=\"first\" HorizontalAlignment=\"Left\" Margin=\"10,79,0,0\" VerticalAlignment=\"Top\"/>\n    </Grid>\n</Window>\n",
        "safe": true
    },
    {
        "filename": "21 game_88.txt",
        "content": "import os\nimport rand\nimport rand.seed\nimport strconv\n\nfn get_choice(mut total &int) bool {\n    for {\n        text := os.input(\"Your choice 1 to 3\u00a0: \")\n        if text == \"q\" || text == \"Q\" {\n            return true\n        }\n        input := strconv.atoi(text) or {-1}\n        if input == -1 {\n            println(\"Invalid number, try again\")\n            continue\n        }\n        new_total := *total + input\n        match true {\n            input < 1 || input > 3 {\n                println(\"Out of range, try again\")\n            }\n            new_total > 21 {\n                println(\"Too big, try again\")\n            }\n            else {\n                total = new_total\n                println(\"Running total is now ${*total}\")\n                return false\n            }\n        }\n    }\n    return false\n}\n \nfn main() {\n    rand.seed(seed.time_seed_array(2))\n    mut computer := rand.intn(2) or {0} != 0\n    println(\"Enter q to quit at any time\\n\")\n    if computer {\n        println(\"The computer will choose first\")\n    } else {\n        println(\"You will choose first\")\n    }\n    println(\"\\nRunning total is now 0\\n\")\n    mut choice := 0\n    mut total := 0\n    for round := 1; ; round++ {\n        println(\"ROUND $round:\\n\")\n        for i := 0; i < 2; i++ {\n            if computer {\n                if total < 18 {\n                    choice = 1 + rand.intn(3) or {1}\n                } else {\n                    choice = 21 - total\n                }\n                total += choice\n                println(\"The computer chooses $choice\")\n                println(\"Running total is now $total\")\n                if total == 21 {\n                    println(\"\\nSo, commiserations, the computer has won!\")\n                    return\n                }\n            } else {\n                quit := get_choice(mut total)\n                if quit {\n                    println(\"OK, quitting the game\")\n                    return\n                }\n                if total == 21 {\n                    println(\"\\nSo, congratulations, you've won!\")\n                    return\n                }\n            }\n            println('')\n            computer = !computer\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "21 game_89.txt",
        "content": "Enter 0 to quit at any time\n\nYou will choose first\n\nRunning total is now 0\n\nROUND 1:\n\nYour choice 1 to 3: 3\nRunning total is now 3\n\nThe computer chooses 2\nRunning total is now 5\n\nROUND 2:\n\nYour choice 1 to 3: 3\nRunning total is now 8\n\nThe computer chooses 1\nRunning total is now 9\n\nROUND 3:\n\nYour choice 1 to 3: 3\nRunning total is now 12\n\nThe computer chooses 3\nRunning total is now 15\n\nROUND 4:\n\nYour choice 1 to 3: 2\nRunning total is now 17\n\nThe computer chooses 3\nRunning total is now 20\n\nROUND 5:\n\nYour choice 1 to 3: 1\nRunning total is now 21\n\nSo, congratulations, you've won!\n",
        "safe": true
    },
    {
        "filename": "21 game_9.txt",
        "content": "Gui, font, S16\nGui, add, Radio, vRadioC , Cake\nGui, add, Radio, vRadioE x+0 Checked, Easy\nGui, add, Radio, vRadioH x+0, Hard\nGui, add, text, xs vT, Total : 00\nGui, add, text, xs vComputer, Computer Dealt 00\nGui, add, text, xs Section, Player 1\nloop, 3\n\tGui, add, button, x+5 vPlayer1_%A_Index% gTotal, % A_Index \nGui, add, button, xs vReset gReset, reset\nGui show,, 21 Game\nWinners := [1,5,9,13,17,21]\ngosub, reset\nreturn\n;-----------------------------------\nreset:\ntotal := 0\nGuiControl,, T, % \"Total\u00a0: \" SubStr(\"00\" Total, -1)\nGuiControl,, Computer, % \"Computer Waiting\"\nLoop 3\n\tGuiControl, Enable, % \"Player1_\" A_Index\nRandom, rnd, 0, 1\nif rnd\n{\n\tLoop 3\n\t\tGuiControl, Disable, % \"Player1_\" A_Index\n\tgosub ComputerTurn\n}\nreturn\n;-----------------------------------\nTotal:\nAdded := SubStr(A_GuiControl, 9,1)\nTotal += Added\nGuiControl,, T, % \"Total\u00a0: \" SubStr(\"00\" Total, -1)\nif (total >= 21)\n{\n\tMsgBox % \"Player 1 Wins\"\n\tgosub reset\n\treturn\n}\nLoop 3\n\tGuiControl, Disable, % \"Player1_\" A_Index\ngosub, ComputerTurn\nreturn\n;-----------------------------------\nComputerTurn:\nGui, Submit, NoHide\nSleep 500\nif RadioE\n{\n\tif (total < 13)\n\t\tRadioC := true\n\telse\n\t\tRadioH := true\t\t\n}\nif RadioC\n{\n\tRandom, Deal, 1, 3\n\ttotal += Deal\n}\nif RadioH\n{\n\tfor i, v in Winners\n\t\tif (total >= v)\n\t\t\tcontinue\n\t\telse\n\t\t{\n\t\t\tDeal := v - total\n\t\t\tif Deal > 3\n\t\t\t\tRandom, Deal, 1, 3\n\t\t\ttotal += Deal\n\t\t\tbreak\n\t\t}\n}\nGuiControl,, T, % \"Total\u00a0: \" SubStr(\"00\" Total, -1)\nGuiControl,, Computer, % \"Computer Dealt \" Deal\nif (total=21)\n{\n\tMsgBox Computer Wins\n\tgosub, reset\n}\nelse\n\tLoop 3\n\t\tGuiControl, Enable, % \"Player1_\" A_Index\nreturn\n",
        "safe": true
    },
    {
        "filename": "21 game_90.txt",
        "content": "import \"./fmt\" for Conv\nimport \"./ioutil\" for Input\nimport \"random\" for Random\n\nvar total = 0\nvar quit = false\n\nvar getChoice = Fn.new {\n    while (true) {\n        var input = Input.integer(\"Your choice 1 to 3: \", 0, 3)\n        if (input == 0) {\n            quit = true\n            return\n        }\n        var newTotal = total + input\n        if (newTotal > 21) {\n            System.print(\"Too big, try again\")\n        } else {\n            total = newTotal\n            System.print(\"Running total is now %(total)\")\n            return\n        }\n    }\n}\n\nvar rand = Random.new()\nvar computer = Conv.itob(rand.int(2))\nSystem.print(\"Enter 0 to quit at any time\\n\")\nif (computer) {\n    System.print(\"The computer will choose first\")\n} else {\n    System.print(\"You will choose first\")\n}\nSystem.print(\"\\nRunning total is now 0\\n\")\nvar round = 1\nwhile (true) {\n    System.print(\"ROUND %(round):\\n\")\n    for (i in 0..1) {\n        if (computer) {\n            var choice = (total < 18) ? 1 + rand.int(3) : 21 - total\n            total = total + choice\n            System.print(\"The computer chooses %(choice)\")\n            System.print(\"Running total is now %(total)\")\n            if (total == 21) {\n                System.print(\"\\nSo, commiserations, the computer has won!\")\n                return\n            }\n        } else {\n            getChoice.call()\n            if (quit) {\n                System.print(\"OK, quitting the game\")\n                return\n            }\n            if (total == 21) {\n                System.print(\"\\nSo, congratulations, you've won!\")\n                return\n            }\n        }\n        System.print()\n        computer = !computer\n    }\n    round = round + 1\n}\n",
        "safe": true
    },
    {
        "filename": "21 game_91.txt",
        "content": "Enter 0 to quit at any time\n\nYou will choose first\n\nRunning total is now 0\n\nROUND 1:\n\nYour choice 1 to 3: 3\nRunning total is now 3\n\nThe computer chooses 2\nRunning total is now 5\n\nROUND 2:\n\nYour choice 1 to 3: 3\nRunning total is now 8\n\nThe computer chooses 1\nRunning total is now 9\n\nROUND 3:\n\nYour choice 1 to 3: 3\nRunning total is now 12\n\nThe computer chooses 3\nRunning total is now 15\n\nROUND 4:\n\nYour choice 1 to 3: 2\nRunning total is now 17\n\nThe computer chooses 3\nRunning total is now 20\n\nROUND 5:\n\nYour choice 1 to 3: 1\nRunning total is now 21\n\nSo, congratulations, you've won!\n",
        "safe": true
    },
    {
        "filename": "21_game_1.txt",
        "content": "F select_count(game_count)\n   \u2018selects a random number if the game_count is less than 18. otherwise chooses the winning number\u2019\n   Int t\n   I game_count < 18\n      t = random:(1..3)\n   E\n      t = 21 - game_count\n   print(\u2018The computer chooses #.\u2019.format(t))\n   R t\n\nF request_count()\n   \u2018request user input between 1,2 and 3. It will continue till either quit(q) or one of those numbers is requested.\u2019\n   V t = \u2018\u2019\n   L\n      X.try\n         t = input(\u2018Your choice 1 to 3\u00a0:\u2019)\n         I Int(t) C [1, 2, 3]\n            R Int(t)\n         E\n            print(\u2018Out of range, try again\u2019)\n      X.catch\n         I t == \u2018q\u2019\n            R 0\n         E\n            print(\u2018Invalid Entry, try again\u2019)\n\nF start()\n   V game_count = 0\n   print(\"Enter q to quit at any time.\\nThe computer will choose first.\\nRunning total is now #.\".format(game_count))\n   V roundno = 1\n   L\n      print(\"\\nROUND #.: \\n\".format(roundno))\n      V t = select_count(game_count)\n      game_count = game_count + t\n      print(\"Running total is now #.\\n\".format(game_count))\n      I game_count >= 21\n         print(\u2018So, commiserations, the computer has won!\u2019)\n         R 0\n      t = request_count()\n      I t == 0\n         print(\u2018OK,quitting the game\u2019)\n         R -1\n      game_count = game_count + t\n      print(\"Running total is now #.\\n\".format(game_count))\n      I game_count >= 21\n         print(\u2018So, congratulations, you've won!\u2019)\n         R 1\n      roundno++\n\nV c = 0\nV m = 0\nL\n   V o = start()\n   I o == -1\n      L.break\n   E\n      c += I o == 0 {1} E 0\n      m += I o == 1 {1} E 0\n   print(\u2018Computer wins #. game, human wins #. games\u2019.format(c, m))\n   V t = input(\u2018Another game?(press y to continue):\u2019)\n   I t\u00a0!= \u2018y\u2019\n      L.break",
        "safe": true
    },
    {
        "filename": "21_game_10.txt",
        "content": "#  Game 21 - an example in AWK language for Rosseta Code.\n\nBEGIN {\n    srand();\n    GOAL = 21;\n    best[0] = 1; best[1] = 1; best[2] = 3; best[3] = 2;\n\n    print\\\n        \"21 Game                                                          \\n\"\\\n        \"                                                                 \\n\"\\\n        \"21 is a two player game, the game is played by choosing a number \\n\"\\\n        \"(1, 2, or 3) to be added to the running total. The game is won by\\n\"\\\n        \"the player whose chosen number causes the running total to reach \\n\"\\\n        \"exactly 21. The running total starts at zero.                    \\n\\n\";\n\n    newgame();\n    prompt();\n\n}\n\n/[123]/ {\n    move = strtonum($0);\n    if (move + total <= GOAL) {\n        update(\"human\", strtonum($0));\n        update(\"ai\", best[total % 4]);\n    }\n    else\n        invalid();\n    prompt();\n}\n/[^123]/ {\n    if ($0 == \"quit\") {\n        print \"goodbye\";\n        exit;\n    }\n    else {\n        invalid();\n        prompt();\n    }\n}\n\nfunction prompt(){\n    print \"enter your choice (or type quit to exit): \";\n}\n\nfunction invalid(){\n    print \"invalid move\";\n}\n\nfunction newgame() {\n    print \"\\n---- NEW GAME ----\\n\";\n    print \"\\nThe running total is currently zero.\\n\";\n    total = 0;\n    if (rand() < 0.5) {\n        print \"The first move is AI move.\\n\";\n        update(\"ai\", best[total % 4]);\n    }\n    else\n        print \"The first move is human move.\\n\";\n}\n\nfunction update(player, move) {\n    printf \"%8s:  %d = %d + %d\\n\\n\", player, total + move, total, move;\n    total += move;\n    if (total == GOAL) {\n        printf \"The winner is %s.\\n\\n\", player;\n        newgame();\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "21_game_11.txt",
        "content": "gawk -f Game21.awk\n21 Game\n\n21 is a two player game, the game is played by choosing a number\n(1, 2, or 3) to be added to the running total. The game is won by\nthe player whose chosen number causes the running total to reach\nexactly 21. The running total starts at zero.\n\n\n\n---- NEW GAME ----\n\n\nThe running total is currently zero.\n\nThe first move is human move.\n\nenter your choice (or type quit to exit):\n1\n   human:  1 = 0 + 1\n\n      ai:  2 = 1 + 1\n\nenter your choice (or type quit to exit):\n2\n   human:  4 = 2 + 2\n\n      ai:  5 = 4 + 1\n\nenter your choice (or type quit to exit):\n3\n   human:  8 = 5 + 3\n\n      ai:  9 = 8 + 1\n\nenter your choice (or type quit to exit):\n1\n   human:  10 = 9 + 1\n\n      ai:  13 = 10 + 3\n\nenter your choice (or type quit to exit):\n2\n   human:  15 = 13 + 2\n\n      ai:  17 = 15 + 2\n\nenter your choice (or type quit to exit):\n1\n   human:  18 = 17 + 1\n\n      ai:  21 = 18 + 3\n\nThe winner is ai.\n\n\n---- NEW GAME ----\n\n\nThe running total is currently zero.\n\nThe first move is human move.\n\nenter your choice (or type quit to exit):\nwow\ninvalid move\n222\ninvalid move\nenter your choice (or type quit to exit):\n1\n   human:  1 = 0 + 1\n\n      ai:  2 = 1 + 1\n\nenter your choice (or type quit to exit):\nquit\ngoodbye",
        "safe": true
    },
    {
        "filename": "21_game_12.txt",
        "content": "PLAYER = 1\nCOMP   = 0\n\nsum = 0\ntotal = 0\nturn = int(rand + 0.5)\ndim precomp = {1, 1, 3, 2}\n\nwhile sum < 21\n    turn = 1 - turn\n    print \"The sum is \"; sum\n    if turn = PLAYER then\n        print \"It is your turn.\"\n        while total < 1 or total > 3 or total + sum > 21\n            input \"How many would you like to total? \", total\n        end while\n    else\n        print \"It is the computer's turn.\"\n        total = precomp[sum mod 4]\n        print \"The computer totals \", total, \".\"\n    end if\n    print\n    sum += total\n    total = 0\nend while\n\nif turn = PLAYER then\n    print \"Congratulations. You win.\"\nelse\n    print \"Bad luck. The computer wins.\"\nend if\n",
        "safe": true
    },
    {
        "filename": "21_game_13.txt",
        "content": "100 rem 21 game\n110 rem for rosetta code\n120 '\n130 rem initialization\n140 l$ = chr$(157) : rem left cursor\n150 dim p$(2),hc(2),ca(4) : hc(1) = 0 : hc(2) = 0 : rem players\n160 ca(0) = 1 : ca(1) = 1 : ca(2) = 3 : ca(3) = 2 : rem computer answers\n170 dim cn$(6) : for i = 1 to 6 : read cn$(i) : next i : rem computer names\n180 def fnm(X)=(X-(INT(X/4))*4):REM modulo function\n190 '\n200 rem optionally set screen colors here\n210 cls\n220 print \"                21 GAME\"\n230 print : print \" The goal of this game is to take turns\"\n240 print \" adding the value of either 1, 2, or 3\"\n250 print \" to a running total. The first player\"\n260 print \" to bring the total to 21...\"\n270 print : print \"          ... WINS THE GAME!\"\n280 print : gosub 1110\n290 for p = 1 to 2\n300 '\n310  rem game setup and get players\n320  for p = 1 to 2\n330   print : print \"Player \";p;l$;\", [H]uman or [C]omputer? \";\n340   k$ = inkey$ : if k$ <> \"c\" and k$ <> \"h\" then 340\n350   print k$ : hc(p) = (k$ = \"c\")\n360   print : print \"Player\";p;l$ \",\" : print \"Enter your name\"; : if hc(p) then goto 400\n370   input p$(p)\n380  next p\n390  goto 420\n400  gosub 1340 : print \"? \";p$(p)\n410 next p\n420 print\n430 for p = 1 to 2 : print p;l$;\". \";p$(p) : next p\n440 print : print \"Is this correct (y/n)? \";\n450 k$ = inkey$ : if k$ <> \"y\" and k$ <> \"n\" then 450\n460 print k$ : if k$ = \"n\" then goto 290\n470 print : print \"Who will play first (1 or 2)? \";\n480 k$ = inkey$ : if k$ < \"1\" or k$ > \"2\" then 480\n490 fp = asc(k$)-48 : print k$ : print\n500 print \"Okay, \";p$(fp);\" will play first.\" : print : gosub 1110\n510 cls\n520 '\n530 rem start main game loop\n540 pi = fp : rt = 0\n550 print \"Total so far:\";rt\n560 print : print p$(pi);\"'s turn.\"\n570 if hc(pi) then gosub 1240\n580 if not hc(pi) then gosub 1170\n590 rt = rt+ad\n600 if rt = 21 then goto 680\n610 if rt > 21 then print : print p$(pi);\" loses by going over 21!!\" : goto 700\n620 pi = pi+1 : if pi > 2 then pi = 1\n630 goto 550\n640 print : print \"          ... WINS THE GAME!\"\n650 print : gosub 1110\n660 '\n670 for p = 1 to 2\n680  rem winner winner chicken dinner\n690  print : print \"21! \";p$(pi);\" wins the game!!!\"\n700  print : print \"Would you like to play again? \";\n710  k$ = inkey$ : if k$ <> \"n\" and k$ <> \"y\" then 710\n720  print k$\n730  if k$ = \"n\" then print : print \"Okay, maybe another time. Bye!\" : end\n740  goto 200\n750  print k$ : hc(p) = (k$ = \"c\")\n760  print : print \"Player\";p;l$ \",\" : print \"Enter your name\"; : if hc(p) then goto 800\n770  input p$(p)\n780 next p\n790 goto 820\n800 gosub 1340 : print \"? \";p$(p)\n810 next p\n820 print : for p = 1 to 2 : print p;l$;\". \";p$(p) : next p\n830 print : print \"Is this correct (y/n)? \";\n840 k$ = inkey$ : if k$ <> \"y\" and k$ <> \"n\" then 840\n850 print k$ : if k$ = \"n\" then goto 660\n860 print : print \"Who will play first (1 or 2)? \";\n870 k$ = inkey$ : if k$ < \"1\" or k$ > \"2\" then 870\n880 fp = asc(k$)-48 : print k$ : print\n890 print \"Okay, \";p$(fp);\" will play first.\" : print : gosub 1110\n900 '\n910 rem start main game loop\n920 pi = fp : rt = 0\n930 print chr$(147);\"Total so far: \";rt\n940 print : print p$(pi);\"'s turn.\"\n950 if hc(pi) then gosub 1240\n960 if not hc(pi) then gosub 1170\n970 rt = rt+ad\n980 if rt = 21 then goto 1030\n990 if rt > 21 then print : print p$(pi);\" loses by going over 21!!\" : goto 1050\n1000 pi = pi+1 : if pi > 2 then pi = 1\n1010 goto 930\n1020 '\n1030 rem winner winner chicken dinner\n1040 print : print \"21! \";p$(pi);\" wins the game!!!\"\n1050 print : print \"Would you like to play again? \";\n1060 k$ = inkey$ : if k$ <> \"n\" and k$ <> \"y\" then 1060\n1070 print k$\n1080 if k$ = \"n\" then print : print \"Okay, maybe another time. Bye!\" : end\n1090 goto 490\n1100 '\n1110 rem pause for keypress\n1120 z$ = \" Press a key to continue. \"\n1130 print z$\n1140 k$ = inkey$ : if k$ = \"\" then 1140\n1150 return\n1160 '\n1170 rem human player move\n1180 print : print \"How much to add,\"\n1190 print \"1, 2, or 3 (0 to quit)\"; : input ad\n1200 if ad < 0 or ad > 3 then print : print \"Illegal amount. Try again.\" : goto 1180\n1210 if ad = 0 then print : print \"Game was ended by \";p$(pi);\".\" : end\n1220 return\n1230 '\n1240 rem computer player move\n1250 print : print \"Thinking...\";\n1260 tt = int(rnd(1)*10)\n1270 for t = 1 to tt : print \".\"; : for i = 1 to 250 : next i : next t : print\n1280 rm = fn m(rt)\n1290 ad = ca(rm)\n1300 print : print p$(pi);\" adds \";ca(rm);l$;\".\"\n1310 for t = 1 to 1000 : next t\n1320 return\n1330 '\n1340 rem pick a computer name\n1350 pn = int(rnd(1)*6)+1 : t$ = cn$(pn)\n1360 if t$ = p$(p-1) then goto 1350\n1370 p$(p) = t$\n1380 return\n1390 '\n1400 rem some computer names to pick from\n1410 data \"Commodore 64\",\"VIC-20\",\"Commodore 128\"\n1420 data \"PET\",\"Plus/4\",\"Commodore 16\"\n",
        "safe": true
    },
    {
        "filename": "21_game_14.txt",
        "content": "100 PROGRAM \"21Game.bas\"\n110 RANDOMIZE \n120 LET SUM,ADD=0\n130 LET TURN=RND(2)-1\n140 CLEAR SCREEN\n150 PRINT \"21 is a two player game, the game is played by choosing a number (1, 2, or 3) to be added to the running total. The game is won by the player whose chosen number causes the running total to reach exactly 21.\"\n160 PRINT \"The running total starts at zero. One player will be the computer.\":PRINT \n170 DO \n180   LET TURN=NOT TURN\n190   SET #102:INK 3:PRINT \"The sum is\";SUM:SET #102:INK 1\n200   IF TURN THEN\n210     PRINT \"It is your turn.\":PRINT \"How many would you like to add? (1-3): \";\n220     LET ADD=READKEY\n230     IF ADD>21-SUM THEN PRINT \"You can only add\";21-SUM\n240   ELSE \n250     LET ADD=4-MOD(SUM-1,4)\n260     IF ADD=4 THEN LET ADD=RND(3)+1\n270     PRINT \"It is the computer's turn.\":PRINT \"The computer adds\";ADD\n280   END IF \n290   PRINT :LET SUM=SUM+ADD\n300 LOOP WHILE SUM<21\n310 IF TURN THEN\n320   PRINT \"Congratulations. You win.\"\n330 ELSE \n340   PRINT \"Bad luck. The computer wins.\"\n350 END IF \n360 END \n370 DEF READKEY\n380   DO \n390     LET T$=INKEY$\n400   LOOP WHILE T$>\"3\" OR T$<\"1\"\n410   PRINT T$:LET READKEY=VAL(T$)\n420 END DEF",
        "safe": true
    },
    {
        "filename": "21_game_15.txt",
        "content": "If OpenConsole()\n  PLAYER.i = 1\n  COMP.i   = 0\n  \n  sum.i = 0\n  total.i = 0\n  turn.i = Random(1) + 0.5\n  Dim precomp.i(3)\n  precomp(0) = 1 \n  precomp(1) = 1\n  precomp(2) = 3\n  precomp(3) = 2\n  \n  While sum < 21\n    turn = 1 - turn\n    PrintN(\"The sum is \" + Str(sum))\n    If turn = PLAYER\n      PrintN(\"It is your turn.\")\n      While total < 1 Or total > 3 Or total + sum > 21\n        Print(\"How many would you like to total? \")\n        total = Val(Input())\n      Wend\n    Else\n      PrintN(\"It is the computer's turn.\")\n      total = precomp(sum % 4)\n      PrintN(\"The computer totals \" + Str(total) + \".\")\n    EndIf\n    PrintN(\"\")\n    sum + total\n    total = 0\n  Wend\n  \n  If turn = PLAYER\n    PrintN(\"Congratulations. You win.\")\n  Else\n    PrintN(\"Bad luck. The computer wins.\")\n  EndIf\n  \n  Input()\nEndIf\n",
        "safe": true
    },
    {
        "filename": "21_game_16.txt",
        "content": "PLAYER = 1\nCOMP   = 0\nRANDOMIZE TIMER\n\nsum = 0\ntotal = 0\nturn = INT(RND + 0.5)\nDIM precomp(0 TO 3)\nprecomp(0) = 1 : precomp(1) = 1\nprecomp(2) = 3 : precomp(3) = 2\n\nWHILE sum < 21\n    turn = 1 - turn\n    PRINT \"The sum is \"; sum\n    IF turn = PLAYER THEN\n        PRINT \"It is your turn.\"\n        WHILE total < 1 OR total > 3 OR total + sum > 21\n            INPUT \"How many would you like to total? \", total\n        WEND\n    ELSE\n        PRINT \"It is the computer's turn.\"\n        total = precomp(sum MOD 4)\n        PRINT \"The computer totals\"; total; \".\"\n    END IF\n    PRINT\n    sum = sum + total\n    total = 0\nWEND\n\nIF turn = PLAYER THEN\n    PRINT \"Congratulations. You win.\"\nELSE\n    PRINT \"Bad luck. The computer wins.\"\nEND IF\n",
        "safe": true
    },
    {
        "filename": "21_game_17.txt",
        "content": "LET player = 1\nLET comp = 0\nRANDOMIZE\nLET sum = 0\nLET total = 0\nLET turn = INT(RND+0.5)\nDIM precomp(0 TO 3)\nLET precomp(0) = 1\nLET precomp(1) = 1\nLET precomp(2) = 3\nLET precomp(3) = 2\nDO WHILE sum < 21\n   LET turn = 1-turn\n   PRINT \"The sum is \"; sum\n   IF turn = player THEN\n      PRINT \"It is your turn.\"\n      DO WHILE total < 1 OR total > 3 OR total+sum > 21\n         INPUT prompt \"How many would you like to total? \": total\n      LOOP\n   ELSE\n      PRINT \"It is the computer's turn.\"\n      LET total = precomp(remainder(round(sum),4))\n      PRINT USING \"The computer totals #.\": total\n   END IF\n   PRINT\n   LET sum = sum+total\n   LET total = 0\nLOOP\nIF turn = player THEN PRINT \"Congratulations. You win.\" ELSE PRINT \"Bad luck. The computer wins.\"\nEND\n",
        "safe": true
    },
    {
        "filename": "21_game_18.txt",
        "content": "If OpenConsole()\n  PLAYER.i = 1\n  COMP.i   = 0\n  \n  sum.i = 0\n  total.i = 0\n  turn.i = Random(1) + 0.5\n  Dim precomp.i(3)\n  precomp(0) = 1 \n  precomp(1) = 1\n  precomp(2) = 3\n  precomp(3) = 2\n  \n  While sum < 21\n    turn = 1 - turn\n    PrintN(\"The sum is \" + Str(sum))\n    If turn = PLAYER\n      PrintN(\"It is your turn.\")\n      While total < 1 Or total > 3 Or total + sum > 21\n        Print(\"How many would you like to total? \")\n        total = Val(Input())\n      Wend\n    Else\n      PrintN(\"It is the computer's turn.\")\n      total = precomp(sum % 4)\n      PrintN(\"The computer totals \" + Str(total) + \".\")\n    EndIf\n    PrintN(\"\")\n    sum + total\n    total = 0\n  Wend\n  \n  If turn = PLAYER\n    PrintN(\"Congratulations. You win.\")\n  Else\n    PrintN(\"Bad luck. The computer wins.\")\n  EndIf\n  \n  Input()\nEndIf\n",
        "safe": true
    },
    {
        "filename": "21_game_19.txt",
        "content": "PLAYER = 1\nCOMP   = 0\n\nsum = 0 \ntotal = 0\nturn = int(ran() + 0.5)\ndim precomp(3)\nprecomp(0) = 1 : precomp(1) = 1\nprecomp(2) = 3 : precomp(3) = 2\n\nwhile sum < 21\n    turn = 1 - turn\n    print \"The sum is \", sum\n    if turn = PLAYER then\n        print \"It is your turn.\"\n        while total < 1 or total > 3 or total + sum > 21\n            input \"How many would you like to total? \" total\n        wend\n    else\n        print \"It is the computer's turn.\"\n        total = precomp(mod(sum, 4))\n        print \"The computer totals \", total, \".\"\n    fi\n    print\n    sum = sum + total\n    total = 0\nwend\n\nif turn = PLAYER then\n    print \"Congratulations. You win.\"\nelse\n    print \"Bad luck. The computer wins.\"\nfi\n",
        "safe": true
    },
    {
        "filename": "21_game_2.txt",
        "content": "/* ARM assembly AARCH64 Raspberry PI 3B */\n/*  program game21_64.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 HITTOTAL,   21\n.equ BUFFERSIZE, 10\n\n\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nszMessRules:         .ascii \"21 Game\\n\"\n                    .ascii \"21 is a two player game, the game is played by choosing a number \\n\"\n                    .ascii \"(1, 2, or 3) to be added to the running total. The game is won by\\n\"\n                    .ascii \"the player whose chosen number causes the running total to reach \\n\"\n                    .asciz \"exactly 21. The running total starts at zero.\\n\\n\\n\"\n\nszMessHumanChoice:  .asciz \"Enter your choice (1,2, 3 or type (q)uit to exit): \"\nszMessErrChoise:    .asciz \"invalid choice.\\n  \"\nszMessHumanBegin:   .asciz \"The first move is human move.\\n\"\nszMessPiBegin:      .asciz \"The first move is Raspberry pi. \\n\"\nszMessHumanWon:     .asciz \"You won. \\n\"\nszMessHumanLost:    .asciz \"You lost. \\n\"\nszMessTotal:        .asciz \"The running total is @ \\n\"\nszMessPiChoice:     .asciz \"Raspberry choice is  @ \\n\" \nszMessNewGame:      .asciz \"New game (y/n)\u00a0? \\n\"\nszCarriageReturn:   .asciz \"\\n\"\n.align 4\nqGraine:  .quad 123456\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\nsZoneConv:        .skip 24\nsBuffer:          .skip BUFFERSIZE\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                 // entry of program \n    \n    ldr x0,qAdrszMessRules\n    bl affichageMess\n1:\n    mov x10,#0                         // total = 0\n    mov x0,#100\n    bl genereraleas \n    cmp x0,#50\n    blt 2f\n    ldr x0,qAdrszMessHumanBegin        // human begin\n    bl affichageMess\n    b 4f\n2:                                     // Rasp begin\n    ldr x0,qAdrszMessPiBegin\n    bl affichageMess\n    mov x0,#1\n3:                                    // rasp turn\n    add x10,x10,x0\n    ldr x1,qAdrsZoneConv\n    bl conversion10                   // call decimal conversion\n    ldr x0,qAdrszMessPiChoice\n    ldr x1,qAdrsZoneConv              // insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n    cmp x10,#HITTOTAL\n    bne 4f\n    ldr x0,qAdrszMessHumanLost\n    bl affichageMess\n    b 12f\n4:                                    // display current total\n    mov x0,x10\n    ldr x1,qAdrsZoneConv\n    bl conversion10                   // call decimal conversion\n    ldr x0,qAdrszMessTotal\n    ldr x1,qAdrsZoneConv              // insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n\n5:                                    // human turn\n    ldr x0,qAdrszMessHumanChoice\n    bl affichageMess\n    bl saisie\n    cmp x0,#'q'                       // quit\u00a0?\n    beq 100f\n    cmp x0,#'Q'\n    beq 100f\n    cmp x0,#'1'\n    add x9,x10,1\n    csel x10,x9,x10,eq\n    beq 6f\n    cmp x0,#'2'\n    add x9,x10,2\n    csel x10,x9,x10,eq\n    beq 6f\n    cmp x0,#'3'\n    add x9,x10,3\n    csel x10,x9,x10,eq\n    beq 6f\n    ldr x0,qAdrszMessErrChoise\n    bl affichageMess\n    b 5b\n6:\n    cmp x10,#HITTOTAL                // total = maxi\u00a0?\n    beq 11f                           // yes -> human won\n    cmp x10,#5                       // else compute rasp number\n    mov x9,5                         // compare total and optimun\n7:\n    cmp x10,x9\n    ble 8f\n    add x9,x9,4\n    b 7b\n8:\n    sub x0,x9,x10                   // compute number rasp\n9:                                  // control number rasp\n    cmp x0,#0\n    ble 10f\n    cmp x0,#3\n    ble 3b\n10:                                  // if not ok, generate random number\n    mov x0,#2\n    bl genereraleas\n    add x0,x0,#1\n    b 3b                            // and loop\n    \n11:                                  // display human won\n    ldr x0,qAdrszMessHumanWon\n    bl affichageMess\n12:                                 // display new game\u00a0?\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess\n    ldr x0,qAdrszMessNewGame\n    bl affichageMess\n    bl saisie\n    cmp x0,#'y'\n    beq 1b\n    cmp x0,#'Y'\n    beq 1b\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 \nqAdrszCarriageReturn:     .quad szCarriageReturn\nqAdrszMessRules:          .quad szMessRules\nqAdrszMessHumanBegin:     .quad szMessHumanBegin\nqAdrszMessPiBegin:        .quad szMessPiBegin\nqAdrszMessPiChoice:       .quad szMessPiChoice\nqAdrszMessTotal:          .quad szMessTotal\nqAdrszMessHumanChoice:    .quad szMessHumanChoice\nqAdrszMessHumanLost:      .quad szMessHumanLost\nqAdrszMessHumanWon:       .quad szMessHumanWon\nqAdrszMessNewGame:        .quad szMessNewGame\nqAdrszMessErrChoise:      .quad szMessErrChoise\nqAdrsZoneConv:            .quad sZoneConv\n/******************************************************************/\n/*            string saisie                                       */ \n/******************************************************************/\n/* x0 return the first character of human entry */\nsaisie:\n    stp x1,lr,[sp,-16]!    // save  registers\n    stp x2,x8,[sp,-16]!    // save  registers\n    mov x0,#STDIN          // Linux input console\n    ldr x1,qAdrsBuffer     // buffer address \n    mov x2,#BUFFERSIZE     // buffer size \n    mov x8,#READ           // request to read datas\n    svc 0                  // call system\n    ldr x1,qAdrsBuffer     // buffer address \n    ldrb w0,[x1]           // load first character\n100:\n    ldp x2,x8,[sp],16      // restaur  2 registers\n    ldp x1,lr,[sp],16      // restaur  2 registers\n    ret                    // return to address lr x30\n    \nqAdrsBuffer:         .quad sBuffer\n/***************************************************/\n/*   Generation random number                  */\n/***************************************************/\n/* x0 contains limit  */\ngenereraleas:\n    stp x1,lr,[sp,-16]!        // save  registers\n    stp x2,x3,[sp,-16]!        // save  registers\n    stp x4,x5,[sp,-16]!        // save  registers\n    ldr x4,qAdrqGraine\n    ldr x2,[x4]\n    ldr x3,qNbDep1\n    mul x2,x3,x2\n    ldr x3,qNbDep2\n    add x2,x2,x3\n    str x2,[x4]                // maj de la graine pour l appel suivant \n    cmp x0,#0\n    beq 100f\n    udiv x3,x2,x0\n    msub x0,x3,x0,x2           // r\u00e9sult = remainder\n  \n100:                           // end function\n    ldp x4,x5,[sp],16          // restaur  2 registers\n    ldp x2,x3,[sp],16          // restaur  2 registers\n    ldp x1,lr,[sp],16          // restaur  2 registers\n    ret                        // return to address lr x30\n/*****************************************************/\nqAdrqGraine: .quad qGraine\nqNbDep1:     .quad 0x0019660d\nqNbDep2:     .quad 0x3c6ef35f\n\n/********************************************************/\n/*        File Include fonctions                        */\n/********************************************************/\n/* for this file see task include a file in language AArch64 assembly */\n.include \"../includeARM64.inc\"",
        "safe": true
    },
    {
        "filename": "21_game_20.txt",
        "content": "shopt -s expand_aliases\nalias bind_variables='\n{\n  local -ri goal_count=21\n  local -ri player_human=0\n  local -ri player_computer=1\n  local -i turn=1\n  local -i total_count=0\n  local -i input_number=0\n  local -i choose_turn=0\n}\n'\nwhose_turn() {\n  case $(( ( turn + choose_turn ) % 2 )) in\n   ${player_human}) echo \"player\";;\n   ${player_computer}) echo \"computer\";;\n  esac\n}\nnext_turn() {\n  let turn++\n}\nvalidate_number() {\n  ! test ${input_number} -ge 1 -a ${input_number} -le $( max_guess )\n}\nprompt_number() {\n  local prompt_str\n  test $( max_guess ) -eq 1 && {\n    prompt_str=\"enter the number 1 to win\"\n  true\n  } || {\n    prompt_str=\"enter a number between 1 and $( max_guess )\"\n  }\n  while [ ! ]\n  do\n   read -p \"${prompt_str} (or quit): \"\n   input_number=${REPLY}\n   case ${REPLY} in\n    \"quit\") {\n      false\n      return\n    } ;;\n   esac\n   validate_number || break\n   echo \"try again\"\n  done\n}\nupdate_count() {\n  let total_count+=input_number\n}\nremaining_count() {\n  echo $(( goal_count - total_count ))\n}\nmax_guess() {\n  local -i remaining_count\n  remaining_count=$( remaining_count )\n  case $( remaining_count ) in\n    1|2|3) echo ${remaining_count} ;;\n    *) echo 3 ;;\n  esac\n}\niter() {\n  update_count\n  next_turn\n}\non_game_over() {\n  test ! ${input_number} -eq $( remaining_count ) || {\n    test ! \"$( whose_turn )\" = \"player\" && {\n      echo -ne \"\\nYou won!\\n\\n\"\n    true\n    } || {\n      echo -ne \"\\nThe computer won!\\nGAME OVER\\n\\n\"\n    }\n    false\n  }\n}\non_game_start() {\n  echo 21 Game\n  read -p \"Press enter key to start\"\n}\nchoose_turn() {\n  let choose_turn=${RANDOM}%2\n}\nchoose_number() {\n  local -i remaining_count\n  remaining_count=$( remaining_count )\n  case ${remaining_count} in\n   1|2|3) {  \n     input_number=${remaining_count}\n   } ;;\n   5|6|7) {  \n     let input_number=remaining_count-4\n   } ;;\n   *) {  \n     let input_number=${RANDOM}%$(( $( max_guess ) - 1 ))+1\n   }\n  esac\n}\ngame_play() {\n  choose_turn\n  while [ ! ]\n  do\n    echo \"Total now ${total_count} (remaining: $( remaining_count ))\"\n    echo -ne \"Turn: ${turn} (\"\n    test ! \"$( whose_turn )\" = \"player\" && {\n      echo -n \"Your\"\n    true\n    } || {\n      echo -n \"Computer\"\n    }\n    echo \" turn)\"\n    test ! \"$( whose_turn )\" = \"player\" && {\n      prompt_number || break\n    true\n    } || {\n      choose_number\n      sleep 2\n      echo \"Computer chose ${input_number}\"\n    }\n    on_game_over || break\n    sleep 1\n    iter\n  done\n}\n21_Game() {\n  bind_variables\n  on_game_start\n  game_play\n}\nif [ ${#} -eq 0 ] \nthen\n true\nelse\n exit 1\nfi\n21_Game\n",
        "safe": true
    },
    {
        "filename": "21_game_21.txt",
        "content": "/**\n * Game 21 - an example in C language for Rosseta Code.\n *\n * A simple game program whose rules are described below\n * - see DESCRIPTION string.\n *\n * This program should be compatible with C89 and up.\n */\n\n\n/*\n * Turn off MS Visual Studio panic warnings which disable to use old gold\n * library functions like printf, scanf etc. This definition should be harmless\n * for non-MS compilers.\n */\n#define _CRT_SECURE_NO_WARNINGS\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n\n/*\n * Define bool, true and false as needed. The stdbool.h is a standard header\n * in C99, therefore for older compilers we need DIY booleans. BTW, there is\n * no __STDC__VERSION__ predefined macro in MS Visual C, therefore we need\n * check also _MSC_VER.\n */\n#if __STDC_VERSION__ >= 199901L || _MSC_VER >= 1800\n#include <stdbool.h>\n#else\n#define bool int\n#define true  1\n#define false 0\n#endif\n\n#define GOAL               21\n#define NUMBER_OF_PLAYERS   2\n#define MIN_MOVE            1\n#define MAX_MOVE            3\n#define BUFFER_SIZE       256\n\n#define _(STRING) STRING\n\n\n/*\n * Spaces are meaningful: on some systems they can be visible.\n */\nstatic char DESCRIPTION[] = \n    \"21 Game                                                          \\n\"\n    \"                                                                 \\n\"\n    \"21 is a two player game, the game is played by choosing a number \\n\"\n    \"(1, 2, or 3) to be added to the running total. The game is won by\\n\"\n    \"the player whose chosen number causes the running total to reach \\n\"\n    \"exactly 21. The running total starts at zero.                    \\n\\n\";\n\nstatic int total;\n\n\nvoid update(char* player, int move)\n{\n    printf(\"%8s:  %d = %d + %d\\n\\n\", player, total + move, total, move);\n    total += move;\n    if (total == GOAL)\n        printf(_(\"The winner is %s.\\n\\n\"), player);\n}\n\n\nint ai()\n{\n/*\n * There is a winning strategy for the first player. The second player can win\n * then and only then the frist player does not use the winning strategy.\n * \n * The winning strategy may be defined as best move for the given running total.\n * The running total is a number from 0 to GOAL. Therefore, for given GOAL, best\n * moves may be precomputed (and stored in a lookup table). Actually (when legal\n * moves are 1 or 2 or 3) the table may be truncated to four first elements.\n */\n#if GOAL < 32 && MIN_MOVE == 1 && MAX_MOVE == 3\n    static const int precomputed[] = { 1, 1, 3, 2, 1, 1, 3, 2, 1, 1, 3, 2, 1, 1,\n        3, 2, 1, 1, 3, 2, 1, 1, 3, 2, 1, 1, 3, 2, 1, 1, 3 };\n    update(_(\"ai\"), precomputed[total]);\n#elif MIN_MOVE == 1 && MAX_MOVE == 3\n    static const int precomputed[] = { 1, 1, 3, 2};\n    update(_(\"ai\"), precomputed[total % (MAX_MOVE + 1)]);\n#else\n    int i;\n    int move = 1;\n    for (i = MIN_MOVE; i <= MAX_MOVE; i++)\n        if ((total + i - 1) % (MAX_MOVE + 1) == 0)\n            move = i;\n    for (i = MIN_MOVE; i <= MAX_MOVE; i++)\n        if (total + i == GOAL)\n            move = i;\n    update(_(\"ai\"), move);\n#endif\n}\n\n\nvoid human(void)\n{\n    char buffer[BUFFER_SIZE];\n    int move;\n \n    while ( printf(_(\"enter your move to play (or enter 0 to exit game): \")),\n            fgets(buffer, BUFFER_SIZE, stdin), \n            sscanf(buffer, \"%d\", &move) != 1 ||\n            (move && (move < MIN_MOVE || move > MAX_MOVE || total+move > GOAL)))\n        puts(_(\"\\nYour answer is not a valid choice.\\n\"));\n    putchar('\\n');\n    if (!move) exit(EXIT_SUCCESS);\n    update(_(\"human\"), move);\n}\n\n\nint main(int argc, char* argv[])\n{\n    srand(time(NULL));\n    puts(_(DESCRIPTION));\n    while (true)\n    {\n        puts(_(\"\\n---- NEW GAME ----\\n\"));\n        puts(_(\"\\nThe running total is currently zero.\\n\"));\n        total = 0;\n\n        if (rand() % NUMBER_OF_PLAYERS)\n        {\n            puts(_(\"The first move is AI move.\\n\"));\n            ai();\n        }\n        else\n            puts(_(\"The first move is human move.\\n\"));\n\n        while (total < GOAL)\n        {\n            human();\n            ai();\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "21_game_22.txt",
        "content": "21 Game\n\n21 is a two player game, the game is played by choosing a number\n(1, 2, or 3) to be added to the running total. The game is won by\nthe player whose chosen number causes the running total to reach\nexactly 21. The running total starts at zero.\n\n\n\n---- NEW GAME ----\n\n\nThe running total is currently zero.\n\nThe first move is AI move.\n\n      AI:  1 = 0 + 1\n\nenter your move to play (or enter 0 to exit game): 1\n\n   human:  2 = 1 + 1\n\n      AI:  5 = 2 + 3\n\nenter your move to play (or enter 0 to exit game): 3\n\n   human:  6 = 5 + 1\n\n      AI:  9 = 6 + 3\n\nenter your move to play (or enter 0 to exit game): asd\u00a0?\n\nYour answer is not a valid choice.\n\nenter your move to play (or enter 0 to exit game): -1\n\nYour answer is not a valid choice.\n\nenter your move to play (or enter 0 to exit game): 4\n\nYour answer is not a valid choice.\n\nenter your move to play (or enter 0 to exit game): 2\n\n   human:  10 = 9 + 1\n\n      AI:  13 = 10 + 3\n\nenter your move to play (or enter 0 to exit game): 3\n\n   human:  14 = 13 + 1\n\n      AI:  17 = 14 + 3\n\nenter your move to play (or enter 0 to exit game): 2\n\n   human:  18 = 17 + 1\n\n      AI:  21 = 18 + 3\n\nThe winner is AI.\n\n\n---- NEW GAME ----\n\n\nThe running total is currently zero.\n\nThe first move is AI move.\n\n      AI:  1 = 0 + 1\n\nenter your move to play (or enter 0 to exit game): 1\n\n   human:  2 = 1 + 1\n\n      AI:  5 = 2 + 3\n\nenter your move to play (or enter 0 to exit game): 2\n\n   human:  6 = 5 + 1\n\n      AI:  9 = 6 + 3\n\nenter your move to play (or enter 0 to exit game): 3\n\n   human:  10 = 9 + 1\n\n      AI:  13 = 10 + 3\n\nenter your move to play (or enter 0 to exit game): 0",
        "safe": true
    },
    {
        "filename": "21_game_23.txt",
        "content": "/**\n *  Game 21 - an example in C++ language for Rosseta Code.\n *\n *  This version is an example of MVC architecture. It seems be a little cleaner\n *  than MVP. The friendship has broken encapsulations to avoid getters.\n */\n\n#include <cstdlib>\n#include <ctime>\n#include <iostream>\n#include <iomanip>\n#include <limits>\n\nusing namespace std;\n#define _(STR) STR\n\n\nclass Model\n{\npublic:\n    static const int GOAL = 21;\n    static const int NUMBER_OF_PLAYERS = 2;\n    static const int MIN_MOVE = 1;\n    static const int MAX_MOVE = 3;\n    int bestMove();\n    bool update(const char* player, int move);\n    bool isGameBegin();\n    bool isGameOver();\nprotected:\n    friend class View;\n    View* view = nullptr;\n    const char* player = nullptr;\n    int oldTotal = 0;\n    int newTotal = 0;\n    int lastMove = 0;\n};\n\n\nclass View\n{\nprotected:\n    Model* model;\npublic:\n    View(Model* model);\n    void init(const char* player);\n    void update();\n};\n\n\nclass Controller\n{\nprotected:\n    Model* model;\n    View* view;\npublic:\n    Controller(Model* model, View* view);\n    int input();\n    void clear();\n    void run();\n};\n\n\nint Model::bestMove()\n{\n    // This is not the fastest algorithm. There is possible to precompute\n    // and memorize all answers before game begin or even hard code them.\n\n    int move = MIN_MOVE;\n    for (int i = MIN_MOVE; i <= MAX_MOVE; i++)\n        if ((newTotal + i - 1) % (MAX_MOVE + 1) == 0)\n            move = i;\n    for (int i = MIN_MOVE; i <= MAX_MOVE; i++)\n        if (newTotal + i == GOAL)\n            move = i;\n    return move;\n}\n\nbool Model::update(const char* player, int move)\n{\n    if (move >= MIN_MOVE && move <= MAX_MOVE && newTotal + move <= GOAL)\n    {\n        this->player = player;\n        oldTotal = newTotal;\n        newTotal = oldTotal + move;\n        lastMove = move;\n        view->update();\n        return true;\n    }\n    else\n        return false;\n}\n\nbool Model::isGameBegin()\n{\n    return oldTotal == 0;\n}\n\nbool Model::isGameOver()\n{\n    return newTotal == GOAL;\n}\n\n\nView::View(Model* model)\n{\n    this->model = model;\n    model->view = this;\n}\n\nvoid View::init(const char* player)\n{\n    if (model->newTotal == 0)\n        cout << _(\"----NEW GAME----\\n\\n\")\n             << _(\"The running total is currently zero.\\n\")\n             << _(\"The first move is \") << player << _(\" move.\\n\\n\");\n}\n\nvoid View::update()\n{\n    cout << setw(8) << model->player << \": \" << model->newTotal << \" = \"\n         << model->oldTotal << \" + \" << model->lastMove << endl << endl;\n    if (model->isGameOver())\n        cout << endl << _(\"The winner is \") << model->player << _(\".\\n\\n\\n\");\n}\n\n\nController::Controller(Model* model, View* view)\n{\n    this->model = model;\n    this->view = view;\n}\n\nvoid Controller::run()\n{\n    if (rand() % Model::NUMBER_OF_PLAYERS == 0)\n    {\n        view->init(\"AI\");\n        model->update(\"AI\", model->bestMove());\n    }\n    else\n        view->init(\"human\");\n\n    while (!model->isGameOver())\n    {\n        while (!model->update(\"human\", input()))\n            clear();\n        model->update(\"AI\", model->bestMove());\n    }\n}\n\nint Controller::input()\n{\n    int value;\n    cout << _(\"enter a valid number to play (or enter 0 to exit game): \");\n    cin >> value;\n    cout << endl;\n    if (!cin.fail())\n    {\n        if (value == 0)\n            exit(EXIT_SUCCESS);\n        else\n            return value;\n    }\n    else\n        return model->MIN_MOVE - 1;\n}\n\nvoid Controller::clear()\n{\n    cout << _(\"Your answer is not a valid choice.\") << endl;\n    cin.clear();\n    cin.ignore((streamsize)numeric_limits<int>::max, '\\n');\n}\n\n\nint main(int argc, char* argv)\n{\n    srand(time(NULL));\n\n    cout << _(\n        \"21 Game                                                          \\n\"\n        \"                                                                 \\n\"\n        \"21 is a two player game, the game is played by choosing a number \\n\"\n        \"(1, 2, or 3) to be added to the running total. The game is won by\\n\"\n        \"the player whose chosen number causes the running total to reach \\n\"\n        \"exactly 21. The running total starts at zero.                    \\n\\n\");\n\n    while (true)\n    {\n        Model* model = new Model();\n        View* view = new View(model);\n        Controller* controler = new  Controller(model, view);\n\n        controler->run();\n\n        delete controler;\n        delete model;\n        delete view;\n    }\n    return EXIT_SUCCESS; // dead code\n}\n",
        "safe": true
    },
    {
        "filename": "21_game_24.txt",
        "content": "/**\n *  Game 21 - an example in C++ language for Rosseta Code.\n *\n *  This version is an example of MVP architecture. The user input, as well as\n *  the AI opponent, is handled by separate passive subclasses of abstract class\n *  named Controller. It can be noticed that the architecture support OCP,\n *  for an example the AI module can be \"easily\" replaced by another AI etc.\n *\n *  BTW, it would be better to place each class in its own file. But it would\n *  be less convinient for Rosseta Code, where \"one solution\" mean \"one file\".\n */\n\n#include <cstdlib>\n#include <ctime>\n#include <iostream>\n#include <iomanip>\n#include <limits>\n\n\nusing namespace std;\n\n#define _(STR) STR\n\n\nclass Model\n{\nprotected:\n\n    int oldTotal;\n    int newTotal;\n    int lastMove;\n\npublic:\n\n    static const int GOAL = 21;\n    static const int NUMBER_OF_PLAYERS = 2;\n\n    Model()\n    {\n        newTotal = 0;\n        oldTotal = 0;\n        lastMove = 0;\n    }\n\n    void update(int move)\n    {\n        oldTotal = newTotal;\n        newTotal = oldTotal + move;\n        lastMove = move;\n    }\n\n    int getOldTotal()\n    {\n        return oldTotal;\n    }\n\n    int getNewTotal()\n    {\n        return newTotal;\n    }\n\n    int getLastMove()\n    {\n        return lastMove;\n    }\n\n    bool isEndGame()\n    {\n        return newTotal == GOAL;\n    }\n};\n\n\nclass View\n{\npublic:\n\n    void update(string comment, Model* model)\n    {\n        cout << setw(8) << comment << \": \"\n            << model->getNewTotal()\n            << \" = \"\n            << model->getOldTotal()\n            << \" + \"\n            << model->getLastMove() << endl\n            << endl;\n    }\n\n    void newGame(string player)\n    {\n        cout << _(\"----NEW GAME----\") << endl\n            << endl\n            << _(\"The running total is currently zero.\") << endl\n            << endl\n            << _(\"The first move is \") << player << _(\" move.\") << endl\n            << endl;\n    }\n\n    void endGame(string name)\n    {\n        cout << endl << _(\"The winner is \") << name << _(\".\") << endl\n            << endl\n            << endl;\n    }\n};\n\n\nclass Controller\n{\npublic:\n\n    virtual string getName() = 0;\n    virtual int getMove(Model* model) = 0;\n};\n\n\nclass AI : public Controller\n{\npublic:\n\n    string getName()\n    {\n        return _(\"AI\");\n    }\n\n    int getMove(Model* model)\n    {\n        int n = model->getNewTotal();\n        for (int i = 1; i <= 3; i++)\n            if (n + i == Model::GOAL)\n                return i;\n        for (int i = 1; i <= 3; i++)\n            if ((n + i - 1) % 4 == 0)\n                return i;\n        return 1 + rand() % 3;\n    }\n};\n\n\nclass Human : public Controller\n{\npublic:\n\n    string getName()\n    {\n        return _(\"human\");\n    }\n\n    int getMove(Model* model)\n    {\n        int n = model->getNewTotal();\n        int value;\n        while (true) {\n            if (n == Model::GOAL - 1)\n                cout << _(\"enter 1 to play (or enter 0 to exit game): \");\n            else if (n == Model::GOAL - 2)\n                cout << _(\"enter 1 or 2 to play (or enter 0 to exit game): \");\n            else\n                cout << _(\"enter 1 or 2 or 3 to play (or enter 0 to exit game): \");\n            cin >> value;\n            if (!cin.fail()) {\n                if (value == 0)\n                    exit(0);\n                else if (value >= 1 && value <= 3 && n + value <= Model::GOAL)\n                {\n                    cout << endl;\n                    return value;\n                }\n            }\n            cout << _(\"Your answer is not a valid choice.\") << endl;\n            cin.clear();\n            cin.ignore((streamsize)numeric_limits<int>::max, '\\n');\n        }\n    }\n};\n\n\nclass Presenter\n{\nprotected:\n\n    Model* model;\n    View* view;\n    Controller** controllers;\n\npublic:\n\n    Presenter(Model* model, View* view, Controller** controllers)\n    {\n        this->model = model;\n        this->view = view;\n        this->controllers = controllers;\n    }\n\n    void run()\n    {\n        int player = rand() % Model::NUMBER_OF_PLAYERS;\n        view->newGame(controllers[player]->getName());\n\n        while (true)\n        {\n            Controller* controller = controllers[player];\n            model->update(controller->getMove(model));\n            view->update(controller->getName(), model);\n            if (model->isEndGame())\n            {\n                view->endGame(controllers[player]->getName());\n                break;\n            }\n            player = (player + 1) % Model::NUMBER_OF_PLAYERS;\n        }\n    }\n};\n\n\nint main(int argc, char* argv)\n{\n    srand(time(NULL));\n\n    while (true)\n    {\n        Model* model = new Model();\n        View* view = new View();\n        Controller* controllers[Model::NUMBER_OF_PLAYERS];\n        controllers[0] = new Human();\n        for (int i = 1; i < Model::NUMBER_OF_PLAYERS; i++)\n            controllers[i] = new AI();\n        Presenter* presenter = new Presenter(model, view, controllers);\n\n        presenter->run();\n\n        delete model;\n        delete view;\n        delete controllers[0];\n        delete controllers[1];\n        delete presenter;\n    }\n    return EXIT_SUCCESS; // dead code\n}\n",
        "safe": true
    },
    {
        "filename": "21_game_25.txt",
        "content": "----NEW GAME----\n\nThe running total is currently zero.\n\nThe first move is human move.\n\nenter 1 or 2 or 3 to play (or enter 0 to exit game): 1\n\n   human: 1 = 0 + 1\n\n      AI: 4 = 1 + 3\n\nenter 1 or 2 or 3 to play (or enter 0 to exit game): 2\n\n   human: 6 = 4 + 2\n\n      AI: 9 = 6 + 3\n\nenter 1 or 2 or 3 to play (or enter 0 to exit game): nope\nYour answer is not a valid choice.\nenter 1 or 2 or 3 to play (or enter 0 to exit game): 8\nYour answer is not a valid choice.\nenter 1 or 2 or 3 to play (or enter 0 to exit game): 3\n\n   human: 12 = 9 + 3\n\n      AI: 13 = 12 + 1\n\nenter 1 or 2 or 3 to play (or enter 0 to exit game): 2\n\n   human: 15 = 13 + 2\n\n      AI: 17 = 15 + 2\n\nenter 1 or 2 or 3 to play (or enter 0 to exit game): 3\n\n   human: 20 = 17 + 3\n\n      AI: 21 = 20 + 1\n\n\nThe winner is AI.\n\n\n----NEW GAME----\n\nThe running total is currently zero.\n\nThe first move is human move.\n\nenter 1 or 2 or 3 to play (or enter 0 to exit game): 1\n\n   human: 1 = 0 + 1\n\n      AI: 4 = 1 + 3\n\nenter 1 or 2 or 3 to play (or enter 0 to exit game): 2\n\n   human: 6 = 4 + 2\n\n      AI: 9 = 6 + 3\n\nenter 1 or 2 or 3 to play (or enter 0 to exit game): 3\n\n   human: 12 = 9 + 3\n\n      AI: 13 = 12 + 1\n\nenter 1 or 2 or 3 to play (or enter 0 to exit game): 0\n",
        "safe": true
    },
    {
        "filename": "21_game_26.txt",
        "content": "// 21 Game \n\nusing System;\n\nnamespace _21Game\n{\n    public class Program\n    {\n        private const string computerPlayer = \"Computer\";\n        private const string humanPlayer = \"Player 1\";\n\n        public static string SwapPlayer(string currentPlayer)\n        {\n            if (currentPlayer == computerPlayer)\n            {\n                currentPlayer = humanPlayer;\n            }\n            else\n            {\n                currentPlayer = computerPlayer;\n            }\n\n            return currentPlayer;\n        }\n\n        public static void PlayGame()\n        {\n            bool playAnother = true;\n            int total = 0;\n            int final = 21;\n            int roundChoice = 0;\n            string currentPlayer = RandomPLayerSelect();\n            int compWins = 0;\n            int humanWins = 0;\n\n            while (playAnother)\n            {\n                Console.WriteLine($\"Now playing: {currentPlayer}\");\n                try\n                {\n                    if (currentPlayer == computerPlayer)\n                    {\n                       roundChoice =  CompMove(total);\n                    }\n                    else\n                    {\n                        roundChoice = int.Parse(Console.ReadLine());\n                    }\n                    \n\n                    if (roundChoice != 1 && roundChoice != 2 && roundChoice != 3)\n                    {\n                        throw new Exception();\n                    }\n\n                    total += roundChoice;\n                }\n                catch (Exception)\n                {\n                    Console.WriteLine(\"Invalid choice! Choose from numbers: 1, 2, 3.\");\n                    continue;\n                }\n\n                Console.WriteLine(total);\n\n                if (total == final)\n                {\n                    if (currentPlayer == computerPlayer)\n                    {\n                        compWins++;\n                    }\n                    if (currentPlayer == humanPlayer)\n                    {\n                        humanWins++;\n                    }\n                    Console.WriteLine($\"Winner: {currentPlayer}\");\n                    Console.WriteLine($\"Comp wins: {compWins}. Human wins: {humanWins}\");\n                    Console.WriteLine($\"do you wan to play another round? y/n\");\n                    var choice = Console.ReadLine();\n                    if (choice == \"y\")\n                    {\n                        total = 0;\n                    }\n                    else if (choice == \"n\")\n                    {\n                        break;\n                    }\n                    else\n                    {\n                        Console.WriteLine(\"Invalid choice! Choose from y or n\");\n                        continue;\n                    }\n                }\n\n                else if (total > 21)\n                {\n                    Console.WriteLine(\"Not the right time to play this game\u00a0:)\");\n                    break;\n                }\n\n                currentPlayer = SwapPlayer(currentPlayer);\n            }\n        }\n\n        public static bool CheckIfCanWin(int total)\n        {\n            bool result = false;\n            if (total == 18)\n            {\n                result = true;\n            }\n            return result;\n        }\n\n        public static int CompMove(int total)\n        {\n            int choice = 0;\n\n            if (CheckIfCanWin(total))\n            {\n                choice = 21 - total;\n            }\n            else\n            {\n                choice = new Random().Next(1,4);\n            }\n\n            return choice;\n        }\n\n        public static string RandomPLayerSelect()\n        {\n            string[] players = new string[] { computerPlayer, humanPlayer };\n            var random = new Random().Next(0,2);\n            return players[random];\n        }\n\n        public static void Main(string[] args)\n        {\n            // welcome message and rules\n            Console.WriteLine(\"Welcome to 21 game \\n\");\n            Console.WriteLine(@\"21 is a two player game. \nThe game is played by choosing a number.\n1, 2, or 3 to be added a total sum. \\n\nThe game is won by the player reaches exactly 21. \\n\" );            \n            Console.WriteLine(\"Choose your number: (1, 2 or 3)\");\n\n            PlayGame();\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "21_game_27.txt",
        "content": "1 rem 21 game\n2 rem for rosetta code\n\n3 rem initialization\n4 l$=chr$(157):rem left cursor\n5 dim p$(2),hc(2),ca(4):hc(1)=0:hc(2)=0:rem players\n6 ca(0)=1:ca(1)=1:ca(2)=3:ca(3)=2:rem computer answers\n7 dim cn$(6):for i=1 to 6:read cn$(i):next:rem computer names\n8 def fn m(x)=(x-(int(x/4))*4):rem modulo function\n\n10 rem optionally set screen colors here\n20 print chr$(147);chr$(14):print spc(16);\"21 GAME\"\n25 print:print \" The goal of this game is to take turns\"\n26 print \" adding the value of either 1, 2, or 3\"\n27 print \" to a running total. The first player\"\n28 print \" to bring the total to 21...\"\n29 print:print spc(10);\"... WINS THE GAME!\"\n30 print:gosub 1000\n35 print chr$(147):for p=1 to 2\n\n40 rem game setup and get players\n42 for p=1 to 2\n44 print:print \"Player\";p;l$;\", [H]uman or [C]omputer? \";\n45 get k$:if k$<>\"c\" and k$<>\"h\" then 45\n46 print k$:hc(p)=(k$=\"c\")\n50 print:print\"Player\";p;l$\",\":print\"Enter your name\";:if hc(p)then goto54\n52 input p$(p):next p:goto 60\n54 gosub 1500:print \"? \";p$(p):next p\n60 print:for p=1 to 2:print p;l$;\". \";p$(p):next\n65 print:print \"Is this correct (y/n)? \";\n70 get k$:if k$<>\"y\" and k$<>\"n\" then 70\n75 print k$:if k$=\"n\" then goto 35\n80 print:print \"Who will play first (1 or 2)? \";\n85 get k$:if k$<\"1\" or k$>\"2\" then 85\n90 fp=asc(k$)-48:print k$:print\n95 print \"Okay, \";p$(fp);\" will play first.\":print:gosub 1000\n\n100 rem start main game loop\n105 pi=fp:rt=0\n110 print chr$(147);\"Total so far:\";rt\n115 print:print p$(pi);\"'s turn.\"\n120 if hc(pi) then gosub 1200\n125 if not hc(pi) then gosub 1100\n130 rt=rt+ad\n135 if rt=21 then goto 200\n140 if rt>21 then print:print p$(pi);\" loses by going over 21!!\":goto 210\n145 pi=pi+1:if pi>2 then pi=1\n150 goto 110\n\n200 rem winner winner chicken dinner\n205 print:print \"21! \";p$(pi);\" wins the game!!!\"\n210 print:print \"Would you like to play again? \";\n215 get k$:if k$<>\"n\" and k$<>\"y\" then 215\n220 print k$\n225 if k$=\"n\" then print:print \"Okay, maybe another time. Bye!\":end\n230 goto 10\n\n1000 rem pause for keypress\n1010 z$=\" Press a key to continue. \"\n1015 print spc(20-int(len(z$)/2));\n1016 print chr$(18);z$;chr$(146)\n1020 get k$:if k$=\"\" then 1020\n1025 return\n\n1100 rem human player move\n1105 print:print \"How much to add,\"\n1110 print \"1, 2, or 3 (0 to quit)\";:input ad\n1115 if ad<0 or ad>3 then print:print\"Illegal amount. Try again.\":goto1105\n1120 if ad=0 then print:print \"Game was ended by \";p$(pi);\".\":end\n1125 return\n\n1200 rem computer player move\n1205 print:print \"Thinking...\";\n1210 tt=int(rnd(1)*10)\n1215 for t=1 to tt:print \".\";:for i=1 to 250:next i,t:print\n1220 rm=fn m(rt)\n1225 ad=ca(rm)\n1230 print:print p$(pi);\" adds\";ca(rm);l$;\".\"\n1235 for t=1 to 1000:next t\n1240 return\n\n1500 rem pick a computer name\n1505 pn=int(rnd(1)*6)+1:t$=cn$(pn)\n1510 if t$=p$(p-1) then goto 1505\n1515 p$(p)=t$\n1520 return\n\n2000 rem some computer names to pick from\n2010 data \"Commodore 64\",\"VIC-20\",\"Commodore 128\",\"PET\"\n2020 data \"Plus/4\",\"Commodore 16\"\n",
        "safe": true
    },
    {
        "filename": "21_game_28.txt",
        "content": "                21 GAME                 \n                                        \n The goal of this game is to take turns \n adding the value of either 1, 2, or 3  \n to a running total. The first player   \n to bring the total to 21...            \n                                        \n          ... WINS THE GAME!            \n                                        \n        Press a key to continue.        \n\n\nPlayer 1, [H]uman or [C]omputer? h      \n                                        \nPlayer 1,                               \nEnter your name? Mike                   \n                                        \nPlayer 2, [H]uman or [C]omputer? c      \n                                        \nPlayer 2,                               \nEnter your name? Commodore 64           \n                                        \n 1. Mike                                \n 2. Commodore 64                        \n                                        \nIs this correct (y/n)? y                \n                                        \nWho will play first (1 or 2)? 1         \n                                        \nOkay, Mike will play first.             \n                                        \n        Press a key to continue.        \n\n\nTotal so far: 0\n\nMike's turn.                            \n                                        \nHow much to add,                        \n1, 2, or 3 (0 to quit)? 1               \n\nTotal so far: 1                         \n                                        \nCommodore 64's turn.                    \n                                        \nThinking..........                      \n                                        \nCommodore 64 adds 1.       \n\nTotal so far: 2\n\nMike's turn.                            \n                                        \nHow much to add,                        \n1, 2, or 3 (0 to quit)? 3               \n\nTotal so far: 5                         \n                                        \nCommodore 64's turn.                    \n                                        \nThinking..........                      \n                                        \nCommodore 64 adds 1.       \n\n\n\n...[LATER IN THE GAME]...\n\nTotal so far: 17                        \n                                        \nCommodore 64's turn.                    \n                                        \nThinking.........                       \n                                        \nCommodore 64 adds 1.\n\nTotal so far: 18\n\nMike's turn.                            \n                                        \nHow much to add,                        \n1, 2, or 3 (0 to quit)? 3 \n\n21! Mike wins the game!!!               \n                                        \nWould you like to play again? n         \n                                        \nOkay, maybe another time. Bye!          \n                                        \nready.                                  \n\u2588\n",
        "safe": true
    },
    {
        "filename": "21_game_29.txt",
        "content": "print \"Who reaches 21, wins\"\nprint \"Do you want to begin (y/n)\"\nwho = 1\nif input = \"n\"\n  who = 2\n.\nwho$[] = [ \"Human\" \"Computer\" ]\nrepeat\n  if who = 1\n    repeat\n      print \"\"\n      print \"Choose 1,2 or 3 (q for quit)\"\n      a$ = input\n      n = number a$\n      until a$ = \"q\" or (n >= 1 and n <= 3)\n    .\n  else\n    sleep 1\n    if sum mod 4 = 1\n      n = random 3\n    else\n      n = 4 - (sum + 3) mod 4\n    .\n  .\n  sum += n\n  print who$[who] & \": \" & n & \" --> \" & sum\n  until sum >= 21 or a$ = \"q\"\n  who = who mod 2 + 1\n.\nif a$ <> \"q\"\n  print \"\"\n  if who = 0\n    print \"Congratulation, you won\"\n  else\n    print \"Sorry, you lost\"\n  .\n.\n",
        "safe": true
    },
    {
        "filename": "21_game_3.txt",
        "content": "with Ada.Text_IO;\nwith Ada.Numerics.Discrete_Random;\n\nprocedure Game_21 is\n\n   procedure Put (Item : String) is\n   begin\n      for Char of Item loop\n         Ada.Text_IO.Put (Char);\n         delay 0.010;\n      end loop;\n   end Put;\n\n   procedure New_Line is\n   begin\n      Ada.Text_IO.New_Line;\n   end New_Line;\n\n   procedure Put_Line (Item : String) is\n   begin\n      Put (Item);\n      New_Line;\n   end Put_LIne;\n\n   type Player_Kind is (Human, Computer);\n   type Score_Type  is range 0 .. 21;\n   subtype Amount_Range is Score_Type range 1 .. 3;\n\n   package Amount_Generators is\n     new Ada.Numerics.Discrete_Random (Amount_Range);\n\n   Gen    : Amount_Generators.Generator;\n   Total  : Score_Type := 0;\n   Choice : Character;\n   Player : Player_Kind;\n   Amount : Amount_Range;\nbegin\n   Amount_Generators.Reset (Gen);\n\n   Put_Line (\"--- The 21 Game ---\"); New_Line;\n\n   Put (\"Who is starting human or computer (h/c)\u00a0? \");\n   Ada.Text_IO.Get_Immediate (Choice);\n   New_Line;\n\n   case Choice is\n      when 'c' | 'C' =>  Player := Computer;\n      when 'h' | 'H' =>  Player := Human;\n      when others => return;\n   end case;\n\n   Play_Loop : loop\n      New_Line;\n      Put (\"Runing total is \"); Put (Total'Image); New_Line;\n      New_Line;\n\n      case Player is\n\n         when Human =>\n            Put_Line (\"It is your turn\u00a0!\");\n            Input_Loop : loop\n               Put (\"Enter choice 1 .. 3 (0 to end)\u00a0: \");\n               Ada.Text_IO.Get_Immediate (Choice);\n\n               case Choice is\n                  when '1' .. '3' =>\n                     Amount := Amount_Range'Value (\"\" & Choice);\n                     exit Input_Loop;\n\n                  when '0' =>\n                     exit Play_Loop;\n\n                  when others =>\n                     Put_Line (\"Choice must be in 1 .. 3\");\n               end case;\n            end loop Input_Loop;\n            New_Line;\n\n         when Computer =>\n            delay 1.500;\n            Amount := Amount_Generators.Random (Gen);\n            Put (\"Computer chooses: \"); Put (Amount'Image); New_Line;\n            delay 0.800;\n\n      end case;\n\n      New_Line;\n      Amount := Score_Type'Min (Amount, Score_Type'Last - Total);\n      Put (\"  \"); Put (Total'Image); Put (\" + \");  Put (Amount'Image); Put (\" = \");\n      Total := Total + Amount;\n      Put (Total'Image);\n      New_Line;\n\n      if Total = 21 then\n         New_Line;\n         Put (\"... and we have a WINNER\u00a0!!\"); New_Line;\n         delay 0.500;\n         Put_Line (\"   ... and the winner is ...\");\n         delay 1.000;\n         Put_Line (\"      \" & Player'Image);\n         exit;\n      end if;\n\n      Player := (case Player is\n                 when Computer => Human,\n                 when Human    => Computer);\n   end loop Play_Loop;\nend Game_21;\n",
        "safe": true
    },
    {
        "filename": "21_game_30.txt",
        "content": "USING: accessors combinators.random continuations formatting io\nkernel math math.functions math.parser multiline qw random\nsequences ;\nIN: rosetta-code.21-game\n\nSTRING: welcome\n21 is a two-player game. The game is played by choosing a number\n(1, 2, or 3) to be added to the running total.\n\nThe game is won by the player whose chosen number causes the\nrunning total to reach 21.\n\nOne player will be the computer. Players alternate supplying a\nnumber to be added to the running total.\n;\n\n: .welcome ( -- ) welcome print ;\n\nSYMBOLS: +computer+ +human+ ;\n\nTUPLE: game total difficulty who ;\n\n! Instead of saying something dry like 'invalid input,' spice\n! it up a little.\n: insult ( -- )\n    {\n        \"No.\" \"Er...\" \"Learn to read.\" \"I think not.\"\n        \"Come on, is it really this difficult?\"\n    } random print ;\n\n: get-input ( options-seq prompt-str -- str )\n    dup \"%s: \" printf flush readln dup reach member?\n    [ 2nip ] [ drop insult get-input ] if ;\n\n: get-integer ( options-seq prompt-str -- n )\n    get-input string>number ;\n\n: get-difficulty ( -- x )\n    qw{ 1 2 3 4 5 6 7 8 9 10 }\n    \"Difficulty (1-10)\" get-integer 10 / ;\n\n: human-move ( game -- n )\n    drop qw{ q 1 2 3 } \"Your move (1-3) or q to quit\" get-input\n    dup \"q\" = [ drop return ] when string>number ;\n\n: choose-first-player ( difficulty -- player )\n    [ +computer+ ] [ +human+ ] ifp ;\n\n: <game> ( -- game )\n    0 get-difficulty dup choose-first-player game boa ;\n\n: swap-player ( game -- )\n    [ +human+ = +computer+ +human+ ? ] change-who drop ;\n\n: .total ( game -- ) total>> \"Running total: %d\\n\" printf ;\n\n: random-move ( game -- n ) drop 3 random 1 + ;\n\n: boundary? ( n -- ? ) 1 - 4 divisor? ;\n\n: (optimal-move) ( m -- n ) dup 4 / ceiling 4 * 1 + swap - ;\n\n: optimal-move ( game -- n )\n    total>> dup boundary? [ random-move ] [ (optimal-move) ] if ;\n\n: computer-move ( game -- n )\n    dup difficulty>> [ optimal-move ] [ random-move ] ifp\n    dup \"Computer chose %d.\\n\" printf ;\n\n: do-turn ( game -- )\n    dup dup who>> +human+ = [ human-move ] [ computer-move ] if\n    [ + ] curry change-total dup .total swap-player ;\n\n: do-turns ( game -- )\n    [ dup total>> 20 > ] [ dup do-turn ] until\n    dup swap-player who>> \"%u wins!\\n\" printf ;\n\n: play-21-game ( -- )\n    .welcome nl [ <game> do-turns ] with-return ;\n\nMAIN: play-21-game\n",
        "safe": true
    },
    {
        "filename": "21_game_31.txt",
        "content": "21 is a two-player game. The game is played by choosing a number\n(1, 2, or 3) to be added to the running total.\n\nThe game is won by the player whose chosen number causes the\nrunning total to reach 21.\n\nOne player will be the computer. Players alternate supplying a\nnumber to be added to the running total.\n\nDifficulty (1-10): 3\nYour move (1-3) or q to quit: 3\nRunning total: 3\nComputer chose 2.\nRunning total: 5\nYour move (1-3) or q to quit: 2\nRunning total: 7\nComputer chose 2.\nRunning total: 9\nYour move (1-3) or q to quit: 1\nRunning total: 10\nComputer chose 3.\nRunning total: 13\nYour move (1-3) or q to quit: apple\nEr...\nYour move (1-3) or q to quit: 3\nRunning total: 16\nComputer chose 1.\nRunning total: 17\nYour move (1-3) or q to quit: 1\nRunning total: 18\nComputer chose 1.\nRunning total: 19\nYour move (1-3) or q to quit: 2\nRunning total: 21\n+human+ wins!\n",
        "safe": true
    },
    {
        "filename": "21_game_32.txt",
        "content": "type Player =\n    | Computer\n    | Person\ntype Play = {runningTotal:int; nextTurn:Player}\ntype Win =\n    | ByExact of Player\n    | ByOtherExceeded of Player\ntype Status =\n    | Start\n    | Playing of Play\n    | Winner of Win\n    | Exit\n\nlet rnd = System.Random ()\nlet randomFirstPlayer () =\n    let selection = rnd.Next 2\n    if selection = 0 then Computer else Person\nlet computerChose current =\n    if current > 17 then 21-current // win strategy\n    else if current > 13 && current < 17 then 17-current // naive thwart opponent strategy\n    else rnd.Next(1, (min 4 (21-current+1)))\n\nlet (|Exact|Exceeded|Under|) i = if i = 21 then Exact else if i > 21 then Exceeded else Under\nlet (|ValidNumber|InvalidInput|Quit|) (s:string) =\n    let trimmed = s.Trim().ToLower()\n    if trimmed = \"1\" || trimmed = \"2\" || trimmed = \"3\" then ValidNumber \n    else if trimmed = \"q\" then Quit\n    else InvalidInput\n    \nlet readable = function | Computer -> \"Computer is\" | Person -> \"You are\"\n\nlet rec looper = function\n    | Start ->\n        let firstPlayer = randomFirstPlayer ()\n        printfn $\"{readable firstPlayer} randomly selected to go first.\"\n        looper (Playing {runningTotal=0; nextTurn=firstPlayer})\n    | Playing play ->\n        match play with\n        | {runningTotal=Exact; nextTurn=Person} -> looper (Winner (ByExact Computer))\n        | {runningTotal=Exact; nextTurn=Computer} -> looper (Winner (ByExact Person))\n        | {runningTotal=Exceeded; nextTurn=player} -> looper (Winner (ByOtherExceeded player))\n        | {runningTotal=r; nextTurn=player} ->\n            match player with\n            | Computer ->\n                let computerChoice = computerChose r\n                let total = r+computerChoice\n                printfn $\"Computer entered {computerChoice}. Current total now: {total}.\"\n                looper (Playing {runningTotal=total; nextTurn=Person})\n            | Person ->\n                let input = printf \"Enter number 1, 2, or 3 (or q to exit): \"; System.Console.ReadLine ()\n                match input with\n                | ValidNumber ->\n                    let playerChoice = System.Int32.Parse input\n                    let total = r+playerChoice\n                    printfn $\"Player entered {playerChoice}. Current total now: {total}.\"\n                    looper (Playing {runningTotal=total; nextTurn=Computer})\n                | Quit -> looper Exit\n                | InvalidInput -> printfn \"Invalid input. Try again.\"; looper (Playing play)\n    | Winner win ->\n        match win with\n        | ByExact player -> printfn $\"{readable player} the winner by getting to 21.\"; looper Exit\n        | ByOtherExceeded player -> printfn $\"{readable player} the winner by not exceeding 21.\"; looper Exit\n    | Exit -> printfn \"Thanks for playing!\"\n    \nlet run () = looper Start\n",
        "safe": true
    },
    {
        "filename": "21_game_33.txt",
        "content": "You are randomly selected to go first.\nEnter number 1, 2, or 3 (or q to exit): 5\nInvalid input. Try again.\nEnter number 1, 2, or 3 (or q to exit): a\nInvalid input. Try again.\nEnter number 1, 2, or 3 (or q to exit): 3\nPlayer entered 3. Current total now: 3.\nComputer entered 3. Current total now: 6.\nEnter number 1, 2, or 3 (or q to exit): 3\nPlayer entered 3. Current total now: 9.\nComputer entered 1. Current total now: 10.\nEnter number 1, 2, or 3 (or q to exit): 2\nPlayer entered 2. Current total now: 12.\nComputer entered 2. Current total now: 14.\nEnter number 1, 2, or 3 (or q to exit): 1\nPlayer entered 1. Current total now: 15.\nComputer entered 2. Current total now: 17.\nEnter number 1, 2, or 3 (or q to exit): 2\nPlayer entered 2. Current total now: 19.\nComputer entered 2. Current total now: 21.\nComputer is the winner by getting to 21.\nThanks for playing!\n\n",
        "safe": true
    },
    {
        "filename": "21_game_34.txt",
        "content": ": READKEY\n  1+ BEGIN\n    KEY DUP 27 = ABORT\" Bye!\"\n    48 - 2DUP > OVER 0 > AND IF\n      DUP 48 + EMIT CR SWAP DROP EXIT\n    THEN DROP\n  REPEAT\n;\n: 21GAME CLS\n  0 2 RND 1-\n  .\" 21 is a two player game.\" CR\n  .\" The game is played by choosing a number (1, 2 or 3) to be added to the running total. \"\n  .\" The game is won by the player whose chosen number causes the running total to reach exactly 21.\"\n  .\" The running total starts at zero. One player will be the computer.\"\n  BEGIN\n    NOT\n    CR .\" The sum is \" OVER . CR\n    SWAP OVER IF\n      .\" How many would you like add?\"\n      .\"  (1-3) \" 3 READKEY\n    ELSE\n      .\" It is the computer's turn.\"\n      4 OVER 1- 4 MOD -\n      DUP 4 = IF 3 RND 1+ MIN THEN\n      DUP CR .\" Computer adds \" . CR\n    THEN + SWAP\n  OVER 21 < NOT UNTIL\n  CR\n  IF .\" Congratulations. You win.\"\n  ELSE .\" Bad Luck. Computer wins.\"\n  THEN CR DROP\n;\n",
        "safe": true
    },
    {
        "filename": "21_game_35.txt",
        "content": "! game 21 - an example in modern fortran language for rosseta code.\n\nsubroutine ai\n  common itotal, igoal\n  if (itotal .lt. igoal) then\n    move = 1\n    do i = 1, 3\n      if (mod(itotal + i - 1 , 4) .eq. 0) then\n        move = i\n      end if\n    end do\n    do i = 1, 3\n      if (itotal + i .eq. igoal) then\n        move = i\n      end if\n    end do\n    print *, \"      ai  \", itotal + move, \" = \", itotal, \" + \", move\n    itotal = itotal + move\n    if (itotal .eq. igoal) then\n      print *, \"\"\n      print *, \"the winner is ai\"\n      print *, \"\"\n    end if\n  end if\nend subroutine ai\n\nsubroutine human\n  common itotal, igoal\n  print *, \"\"\n  do while (.true.)\n    if (itotal + 1 .eq. igoal) then\n      print *, \"enter 1 (or 0 to exit): \"\n    else if (itotal + 2 .eq. igoal) then\n      print *, \"enter 1 or 2 (or 0 to exit): \"\n    else\n      print *, \"enter 1 or 2 or 3 (or 0 to exit)\"\n    end if\n    read(*,*) move\n    if (move .eq. 0) then\n      stop\n    else if (move .ge. 1 .and. move .le. 3 .and. move + itotal .le. igoal) then\n      print *, \"   human  \", itotal + move, \" = \", itotal, \" + \", move\n      itotal = itotal + move\n      if (itotal .eq. igoal) then\n        print *, \"\"\n        print *, \"the winner is human\"\n        print *, \"\"\n      end if\n      return\n    else\n      print *, \"a bad choice\"\n    end if\n  end do\nend subroutine human\n\nprogram main\n  common itotal, igoal\n  print *,\"game 21 - an example in fortran iv language for rosseta code.\"\n  print *,\"\"\n  print *,\"21 is a two player game, the game is played by choosing a number\"\n  print *,\"(1, 2, or 3) to be added to the running total. the game is won\"\n  print *,\"by the player whose chosen number causes the running total to reach\"\n  print *,\"exactly 21. the running total starts at zero.\"\n  print *,\"\"\n  i = irand(1)\n  igoal = 21\n  do while(.true.)\n    print *, \"---- new game ----\"\n    print *, \"\"\n    print *, \"the running total is currently zero.\"\n    print *, \"\"\n    itotal = 0\n    if (mod(irand(0), 2) .eq. 0) then\n      print *, \"the first move is ai move.\"\n      call ai\n    else\n      print *, \"the first move is human move.\"\n    end if\n    print *, \"\"\n    do while(itotal .lt. igoal)\n      call human\n      call ai\n    end do\nend do\nend program main\n",
        "safe": true
    },
    {
        "filename": "21_game_36.txt",
        "content": "game 21 - an example in fortran language for rosseta code.\n \n 21 is a two player game, the game is played by choosing a number\n (1, 2, or 3) to be added to the running total. the game is won\n by the player whose chosen number causes the running total to reach\n exactly 21. the running total starts at zero.\n \n ---- new game ----\n \n the running total is currently zero.\n \n the first move is human move.\n \n \n enter 1 or 2 or 3 (or 0 to exit)\n1\n    human             1  =            0  +            1\n       ai             2  =            1  +            1\n \n enter 1 or 2 or 3 (or 0 to exit)\n3\n    human             5  =            2  +            3\n       ai             6  =            5  +            1\n \n enter 1 or 2 or 3 (or 0 to exit)\n4\n a bad choice\n enter 1 or 2 or 3 (or 0 to exit)\n3\n    human             9  =            6  +            3\n       ai            10  =            9  +            1\n \n enter 1 or 2 or 3 (or 0 to exit)\n2\n    human            12  =           10  +            2\n       ai            13  =           12  +            1\n \n enter 1 or 2 or 3 (or 0 to exit)\n3\n    human            16  =           13  +            3\n       ai            17  =           16  +            1\n \n enter 1 or 2 or 3 (or 0 to exit)\n2\n    human            19  =           17  +            2\n       ai            21  =           19  +            2\n\n the winner is ai\n \n ---- new game ----\n \n the running total is currently zero.\n \n the first move is human move.\n \n \n enter 1 or 2 or 3 (or 0 to exit)\n0",
        "safe": true
    },
    {
        "filename": "21_game_37.txt",
        "content": "#define PLAYER 1\n#define COMP   0\nrandomize timer\n\ndim as uinteger sum, add = 0\ndim as uinteger turn = int(rnd+0.5)\ndim as uinteger precomp(0 to 3) = { 1, 1, 3, 2 } \n\nwhile sum < 21:\n    turn = 1 - turn\n    print using \"The sum is ##\"; sum\n    if turn = PLAYER then\n        print \"It is your turn.\"\n        while add < 1 orelse add > 3 orelse add+sum > 21\n            input \"How many would you like to add? \", add\n        wend\n    else\n        print \"It is the computer's turn.\"\n        add = precomp(sum mod 4)\n        print using \"The computer adds #.\"; add\n    end if\n    print\n    sum = sum + add\n    add = 0\nwend\n\nif turn = PLAYER then\n    print \"Congratulations. You win.\"\nelse\n    print \"Bad luck. The computer wins.\"\nend if\n",
        "safe": true
    },
    {
        "filename": "21_game_38.txt",
        "content": "begin globals\nbegin enum 1\n  _btn1\n  _btn2\n  _btn3\n  _sum\n  _msg\n  _popup\n  _skill\n  _human = 0\n  _robot\nend enum\nstr15 cr\u00a0: cr = chr$(13)\nstr255 string(1)\u00a0:  short who = _human\nbyte best(3), sum, num, skill = 1 //Medium skill\npoke int @best(0), 33751297 //Initialize computer responses\nend globals\n\nlocal fn buildWindow\n  subclass window 1,      @\"21 Game in FutureBasic\" , (  0,  0,640,200 )\n  popupbutton _popup,, 1, @\"Minimum;Medium;Maximum\" , ( 80, 17,100, 32 )\n  textlabel   _msg   ,    @\"Original code: J. Reeve\", ( 20,160,600, 32 )\n  textlabel   _skill ,    @\"Skill level:\",            ( 20, 12, 75, 32 )\n  textfield   _sum  ,,    @\"0\",( 530,85,90,60 )\n  button      _btn1 ,,  , @\"1\",( 245,20,50,50 ),,NSBezelStyleRegularSquare\n  button      _btn2 ,,  , @\"2\",( 295,20,50,50 ),,NSBezelStyleRegularSquare\n  button      _btn3 ,,  , @\"3\",( 345,20,50,50 ),,NSBezelStyleRegularSquare\n  ControlSetAlignment(    _msg, NSTextAlignmentCenter )\n  ControlSetAlignment(    _sum, NSTextAlignmentCenter )\n  TextFieldSetEditable(   _sum, no )\n  ControlSetFontWithName( _msg,  @\"Menlo\", 15.0 )\n  ControlSetFontWithName( _btn1, @\"Menlo\", 20.0 )\n  ControlSetFontWithName( _btn2, @\"Menlo\", 20.0 )\n  ControlSetFontWithName( _btn3, @\"Menlo\", 20.0 )\n  ControlSetFontWithName( _sum,  @\"Menlo\", 32.0 )\n  text @\"menlo\", 15.0\nend fn\n\nlocal fn show( add as byte )\n  CFStringRef msg\n  if (sum + add) > 21 then beep\u00a0: exit fn\n  button 1, who\u00a0: button 2, who\u00a0: button 3, who\n  sum += add\u00a0: cls\n  ControlSetIntegerValue( _sum, sum )\n  string( who ) +=  \"+\" + chr$( add or 48 ) + \"    \"\n  print cr;cr;cr;string( _human );cr;cr;string( _robot )\n  if sum < 21\n    if who == _robot then msg = @\"Your turn...\" else msg = @\"My turn...\"\n  else\n    if who == _robot\n      msg = @\"Too bad. I win. Press any key to play again.\"\n    else\n      msg = @\"Congratulations! YOU WIN! Press any key to play again.\"\n    end if\n  end if\n  if peek( @string( who ) ) > 20 then textlabel _msg, msg\n  who = who xor _robot\nend fn\n\nlocal fn play( add as byte )\n  if sum + add > 21 then beep\u00a0: exit fn\n  fn show( add )       //Show human's play\n  if sum < 21\n    if (skill + maybe) > 0 then num = best(sum mod 4) else num = rnd(3)\n    if sum + num > 21 then num = 21 - sum\n    timerbegin 1.0, NO //wait a sec before playing\n      fn show( num )   //Show computer's play\n    timerend\n  end if\nend fn\n\nlocal fn start\n  sum = 0\u00a0: cls\n  string( _human ) = \"       You: \"\u00a0: string( _robot ) = \"  Computer: \"\n  string( 1-who ) += \"   \"\n  if who == _robot\n    if skill == 2 then num = 1 else num = rnd( 3 )\n    textlabel _msg, fn StringWithFormat( @\"I'll start with %i.\", num )\n    fn show( num )\n  else\n    ControlSetIntegerValue( _sum, sum )\n    textlabel _msg, @\"You start. Type or click 1, 2, or 3.\"\n  end if\nend fn\n\nlocal fn DoDialog( evt as long, tag as long)\n  byte key\n  select ( evt )\n    case _windowKeyUp\n      if sum == 21 then fn start\u00a0: exit fn\n      if who == _robot then exit fn\n      key = intval( fn EventCharacters )\n      if key > 0 && key < 4 then fn play( key )\n    case _btnClick\n      if tag < _popup then beep\u00a0: fn play( tag )\u00a0: exit fn\n      skill = popupbutton( _popup )\n    case _windowWillClose\u00a0: end\n  end select\nend fn\n\nfn buildWindow\nfn start\non dialog fn doDialog\nhandleevents",
        "safe": true
    },
    {
        "filename": "21_game_39.txt",
        "content": "' Gambas module file\n\nPrivate gameConunt As Integer = 0\nPrivate numRound As Integer = 1\nPrivate winPlayer As Integer = 0\nPrivate winComputer As Integer = 0\n\n\nPublic Sub Main()\n\n  Dim entra As String\n\n  Print \"Enter q to quit at any time\\nThe computer will choose first\"\n\n  While gameConunt < 21\n    Print \"ROUND: \" & numRound & \"\\n\"\n    gameConunt += selectCount(gameConunt)\n    Print Subst(\"Running total is now &1 \\n \", gameConunt)\n    If gameConunt = 21 Then\n      Inc winComputer\n      Print \"The computer has won\u00a0!\\n\"\n      endGame()\n    Endif\n    gameConunt += humanCount(gameConunt)\n    Print Subst(\"Running total is now &1\", gameConunt)\n    If gameConunt = 21 Then\n      Inc winPlayer\n      Print \"Congratulations! You've won!\\n\"\n      endGame()\n    Endif\n    Inc numRound\n  Wend\n\nEnd\n\nPrivate Function selectCount(cou As Integer) As Integer\n\n  Dim a As Integer\n\n  Randomize\n\n  If cou < 18 Then\n    a = Int(Rnd(1, 4))\n  Else\n    a = 21 - cou\n  Endif\n\n  Print \"The computer choose \" & a\n\n  Return a\n\nEnd\n\nPrivate Function humanCount(cou As Integer) As Integer\n\n  Dim entra As String\n  Dim a As Integer\n\n  While True\n    Print \"Your choice 1 to 3\"\n    Input entra\n    If entra = \"q\" Then\n      Print \"Good Bye!\"\n      Quit\n    Endif\n    Try a = CInt(entra)\n    If Error Then\n      Print \"Invalid entry, try again\"\n      Continue\n    Endif\n    If a < 1 Or a > 3 Then\n      Print \"Out of range, try again\"\n      Continue\n    Endif\n    If a + cou > 21 Then\n      Print \"The sum is greater than 21, try again\"\n      Continue\n    Endif    \n    Return a\n  Wend\n\nEnd\n\n\nPrivate Sub endGame()\n\n  Dim entra As String\n\n  Print Subst(\"Computer wins &1 games, human wins &2 games\", winComputer, winPlayer)\n  Print \"\\nPlay again? (y/n)\"\n  Input entra\n  If entra = \"y\" Or entra = \"Y\" Then\n    numRound = 1\n    gameConunt = 0\n    Print \"Enter q to quit at any time\\nThe computer will choose first\"\n  Else\n    Print \"Good Bye!\"\n    Quit\n  Endif\n\nEnd\n",
        "safe": true
    },
    {
        "filename": "21_game_4.txt",
        "content": " 5  DIM P$(2),HC(2),CA(4),CN$(6): READ CA(0),CA(1),CA(2),CA(3): FOR I = 1 TO 6: READ CN$(I): NEXT : DEF  FN M(X) = (X - ( INT (X / 4)) * 4): DEF  FN U(K) = K - (K > 95) * 32:L$ = \" \":M$ =  CHR$ (13): DATA 1,1,3,2\n 9  FOR PLAY = 0 TO 1\n 10     REM SET SCREEN COLORS HERE\n 11     LET C% =  INT ( RND (1) * 16)\n 12     LET B% =  INT ( RND (1) * 15 + C% + 1): IF B% > 15 THEN B% = B% - 16\n 13     POKE 49186,C% + B% * 16: REM FOREGROUND&BACKGROUND\n 14     POKE 49204, INT ( RND (1) * 16): REM BORDER\n 20     HOME : PRINT M$ SPC( 16);\"21 GAME\"M$M$\" THE GOAL OF THIS GAME IS TO TAKE TURNS\"M$\" ADDING THE VALUE OF EITHER 1, 2, OR 3\"M$\" TO A RUNNING TOTAL. THE FIRST PLAYER\"M$\" TO BRING THE TOTAL TO 21...\"M$M$ SPC( 10);\"... WINS THE GAME!\"M$\n 30     GOSUB 1000\n 40     FOR SETUP = 0 TO 1: HOME : PRINT \n 42         FOR P = 1 TO 2\n 44             PRINT M$\"PLAYER\";L$;P;\", [H]UMAN OR [C]OMPUTER? \";\n 45             FOR K = 0 TO 1: GET K$:K$ =  CHR$ ( FN U( ASC (K$))):K = K$ = \"C\" OR K$ = \"H\": NEXT K\n 46              PRINT K$M$M$\"PLAYER\";L$;P;\",\": PRINT \"ENTER YOUR NAME\";\n 50              LET HC(P) = (K$ = \"C\"): IF HC(P) THEN  FOR PC = 0 TO 1:PN =  INT ( RND (1) * 6) + 1:T$ = CN$(PN):PC = T$ <  > P$(P - 1): NEXT PC:P$(P) = T$: PRINT \"? \";P$(P)\n 52              IF  NOT HC(P) THEN  INPUT P$(P)\n 54          NEXT P\n 60          FOR P = 1 TO 2: PRINT M$L$;P;\". \";P$(P);: NEXT P: PRINT M$M$\"IS THIS CORRECT (Y/N)? \";: FOR K = 0 TO 1: GET K$:K$ =  CHR$ ( FN U( ASC (K$))):K = K$ = \"Y\" OR K$ = \"N\": NEXT K: PRINT K$:SETUP = K$ <  > \"N\"\n 70      NEXT SETUP\n 80      PRINT M$\"WHO WILL PLAY FIRST (1 OR 2)? \";: FOR K = 0 TO 1: GET K$:K = K$ = \"1\" OR K$ = \"2\": NEXT K\n 90     FP =  VAL (K$): PRINT K$M$M$\"OKAY, \";P$(FP);\" WILL PLAY FIRST.\"M$: GOSUB 1000\n 100    LET RT = 0:PI = FP - 1\n 110    FOR GAME = 0 TO 1\n 115        PI = PI * (PI < 2) + 1: HOME : PRINT \"TOTAL SO FAR:\";L$;RT;M$M$P$(PI);\"'S TURN.\"\n 120        IF HC(PI) THEN  PRINT M$\"THINKING...\";:TT =  INT ( RND (1) * 10): FOR T = 1 TO TT: PRINT \".\";: FOR I = 1 TO 250: NEXT I,T:RM =  FN M(RT):AD = CA(RM): PRINT M$M$P$(PI);\" ADDS\";L$;CA(RM);\".\": FOR T = 1 TO 1000: NEXT T\n 125        IF  NOT HC(PI) THEN  FOR AMOUNT = 0 TO 1: PRINT  MID$ (M$ + \"ILLEGAL AMOUNT. TRY AGAIN.\" + M$,1,AMOUNT * 255)M$\"HOW MUCH TO ADD,\": INPUT \"1, 2, OR 3 (0 TO QUIT)\u00a0?\";AD:AMOUNT = AD >  = 0 AND AD <  = 3: NEXT AMOUNT\n 128        LET RT = RT + AD:GAME = RT >  = 21 OR AD = 0\n 130      NEXT GAME\n 140      IF RT > 21 THEN  PRINT M$P$(PI);\" LOSES BY GOING OVER 21!!\"\n 150      IF RT = 21 THEN  PRINT M$\"21! \";P$(PI);\" WINS THE GAME!!!\"\n 160      IF  NOT AD THEN  PRINT M$\"GAME WAS ENDED BY \";P$(PI);\".\":PLAY = 1\n 210      IF AD THEN  PRINT : PRINT \"WOULD YOU LIKE TO PLAY AGAIN? \";: FOR K = 0 TO 1: GET K$:K$ =  CHR$ ( FN U( ASC (K$))):K = K$ = \"N\" OR K$ = \"Y\": NEXT K: PRINT K$:PLAY = K$ = \"N\"\n 220  NEXT PLAY\n 230  IF AD THEN  PRINT M$\"OKAY, MAYBE ANOTHER TIME. BYE!\"\n 240  END \n 1000 Z$ = \" PRESS A KEY TO CONTINUE. \": PRINT  SPC( 20 -  INT ( LEN (Z$) / 2));: INVERSE : PRINT Z$;: NORMAL : WAIT 49152,128:K =  PEEK (49168): RETURN \n 2010  DATA \"APPLE IIE\",\"APPLE II PLUS\",\"APPLE IIC\",\"APPLE II\",\"APPLE IIGS\",\"MACINTOSH LC\"\n",
        "safe": true
    },
    {
        "filename": "21_game_40.txt",
        "content": "Enter q to quit at any time\nThe computer will choose first\nROUND: 1\n\nThe computer choose 2\nRunning total is now 2 \n \nYour choice 1 to 3\n4\nOut of range, try again\nYour choice 1 to 3\n0\nOut of range, try again\nYour choice 1 to 3\ng\nInvalid entry, try again\nYour choice 1 to 3\n1\nRunning total is now 3\nROUND: 2\n\nThe computer choose 2\nRunning total is now 5 \n \nYour choice 1 to 3\n3\nRunning total is now 8\nROUND: 3\n\nThe computer choose 2\nRunning total is now 10 \n \nYour choice 1 to 3\n3\nRunning total is now 13\nROUND: 4\n\nThe computer choose 2\nRunning total is now 15 \n \nYour choice 1 to 3\n3\nRunning total is now 18\nROUND: 5\n\nThe computer choose 3\nRunning total is now 21 \n \nThe computer has won\u00a0!\n\ncomputer wins 1 games, human wins 0 games\n\nPlay again? (y/n)\n\nGood Bye!\n",
        "safe": true
    },
    {
        "filename": "21_game_41.txt",
        "content": "extends MainLoop\n\n\nenum Player {Human, Computer}\n\nconst target: int = 21\n\n\n# -1 is returned to request quit\nfunc get_player_choice(total: int) -> int:\n\twhile true:\n\t\tprintraw(\"Player's choice: \")\n\t\tvar input: String = OS.read_string_from_stdin().strip_edges()\n\n\t\tif input == \"quit\":\n\t\t\treturn -1\n\n\t\tif not input.is_valid_int():\n\t\t\tprint(\"Please input an integer.\")\n\t\t\tcontinue\n\n\t\tvar input_int := int(input)\n\t\tif input_int < 1 or input_int > 3:\n\t\t\tprint(\"Please pick a number from 1 to 3\")\n\t\t\tcontinue\n\n\t\tif input_int + total > target:\n\t\t\tprint(\"Please do not exceed a total of %d\" % target)\n\t\t\tcontinue\n\n\t\treturn input_int\n\n\t# This is required since Godot does not detect the unreachable code path\n\tOS.crash(\"unreachable\")\n\treturn 0\n\n\nfunc get_computer_choice(total: int) -> int:\n\t# This can be shortened using max() if you do not have type checking OCD\n\tvar remaining: int = target - total\n\treturn randi_range(1, 3 if remaining > 3 else remaining)\n\n\nfunc play() -> void:\n\tprint(\"\"\"\\\nWelcome to the 21 game.\nType quit to exit.\"\"\")\n\tvar total: int = 0\n\tvar player: Player\n\tmatch randi_range(1, 2):\n\t\t1:\n\t\t\tplayer = Player.Human\n\t\t\tprint(\"You will go first.\")\n\t\t2:\n\t\t\tplayer = Player.Computer\n\t\t\tprint(\"The computer will go first.\")\n\n\twhile true:\n\t\tprint(\"\\nThe total is %d\" % total)\n\n\t\tvar choice: int\n\t\tmatch player:\n\t\t\tPlayer.Human:\n\t\t\t\tchoice = get_player_choice(total)\n\t\t\t\tif choice == -1:\n\t\t\t\t\treturn\n\t\t\tPlayer.Computer:\n\t\t\t\tchoice = get_computer_choice(total)\n\t\t\t\tprint(\"The computer plays %d\" % choice)\n\t\tassert(1 <= choice and choice <= 3)\n\n\t\ttotal += choice\n\t\tif total == target:\n\t\t\tmatch player:\n\t\t\t\tPlayer.Human: print(\"You win!\")\n\t\t\t\tPlayer.Computer: print(\"The computer won, you lose.\")\n\t\t\treturn\n\t\tassert(total < target)\n\n\t\tmatch player:\n\t\t\tPlayer.Human: player = Player.Computer\n\t\t\tPlayer.Computer: player = Player.Human\n\n\nfunc _process(_delta: float) -> bool:\n\trandomize()\n\tplay()\n\treturn true\n",
        "safe": true
    },
    {
        "filename": "21_game_42.txt",
        "content": "package main\n\nimport (\n    \"bufio\"\n    \"fmt\"\n    \"log\"\n    \"math/rand\"\n    \"os\"\n    \"strconv\"\n    \"time\"\n)\n\nvar scanner = bufio.NewScanner(os.Stdin)\n\nvar (\n    total = 0\n    quit  = false\n)\n\nfunc itob(i int) bool {\n    if i == 0 {\n        return false\n    }\n    return true\n}\n\nfunc getChoice() {\n    for {\n        fmt.Print(\"Your choice 1 to 3\u00a0: \")\n        scanner.Scan()\n        if scerr := scanner.Err(); scerr != nil {\n            log.Fatalln(scerr, \"when choosing number\")\n        }\n        text := scanner.Text()\n        if text == \"q\" || text == \"Q\" {\n            quit = true\n            return\n        }\n        input, err := strconv.Atoi(text)\n        if err != nil {\n            fmt.Println(\"Invalid number, try again\")\n            continue\n        }\n        newTotal := total + input\n        switch {\n        case input < 1 || input > 3:\n            fmt.Println(\"Out of range, try again\")\n        case newTotal > 21:\n            fmt.Println(\"Too big, try again\")\n        default:\n            total = newTotal\n            fmt.Println(\"Running total is now\", total)\n            return\n        }\n    }\n}\n\nfunc main() {\n    rand.Seed(time.Now().UnixNano())\n    computer := itob(rand.Intn(2))\n    fmt.Println(\"Enter q to quit at any time\\n\")\n    if computer {\n        fmt.Println(\"The computer will choose first\")\n    } else {\n        fmt.Println(\"You will choose first\")\n    }\n    fmt.Println(\"\\nRunning total is now 0\\n\")\n    var choice int\n    for round := 1; ; round++ {\n        fmt.Printf(\"ROUND %d:\\n\\n\", round)\n        for i := 0; i < 2; i++ {\n            if computer {\n                if total < 18 {\n                    choice = 1 + rand.Intn(3)\n                } else {\n                    choice = 21 - total\n                }\n                total += choice\n                fmt.Println(\"The computer chooses\", choice)\n                fmt.Println(\"Running total is now\", total)\n                if total == 21 {\n                    fmt.Println(\"\\nSo, commiserations, the computer has won!\")\n                    return\n                }\n            } else {\n                getChoice()\n                if quit {\n                    fmt.Println(\"OK, quitting the game\")\n                    return\n                }\n                if total == 21 {\n                    fmt.Println(\"\\nSo, congratulations, you've won!\")\n                    return\n                }\n            }\n            fmt.Println()\n            computer = !computer\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "21_game_43.txt",
        "content": "Enter q to quit at any time\n\nThe computer will choose first\n\nRunning total is now 0\n\nROUND 1:\n\nThe computer chooses 1\nRunning total is now 1\n\nYour choice 1 to 3\u00a0: 3\nRunning total is now 4\n\nROUND 2:\n\nThe computer chooses 2\nRunning total is now 6\n\nYour choice 1 to 3\u00a0: 4\nOut of range, try again\nYour choice 1 to 3\u00a0: 3\nRunning total is now 9\n\nROUND 3:\n\nThe computer chooses 2\nRunning total is now 11\n\nYour choice 1 to 3\u00a0: 2\nRunning total is now 13\n\nROUND 4:\n\nThe computer chooses 2\nRunning total is now 15\n\nYour choice 1 to 3\u00a0: 2\nRunning total is now 17\n\nROUND 5:\n\nThe computer chooses 1\nRunning total is now 18\n\nYour choice 1 to 3\u00a0: 3\nRunning total is now 21\n\nSo, congratulations, you've won!\n",
        "safe": true
    },
    {
        "filename": "21_game_44.txt",
        "content": "Enter q to quit at any time\n\nThe computer will choose first\n\nRunning total is now 0\n\nROUND 1:\n\nThe computer chooses 3\nRunning total is now 3\n\nYour choice 1 to 3\u00a0: 3\nRunning total is now 6\n\nROUND 2:\n\nThe computer chooses 3\nRunning total is now 9\n\nYour choice 1 to 3\u00a0: 3\nRunning total is now 12\n\nROUND 3:\n\nThe computer chooses 1\nRunning total is now 13\n\nYour choice 1 to 3\u00a0: 3\nRunning total is now 16\n\nROUND 4:\n\nThe computer chooses 1\nRunning total is now 17\n\nYour choice 1 to 3\u00a0: 1\nRunning total is now 18\n\nROUND 5:\n\nThe computer chooses 3\nRunning total is now 21\n\nSo, commiserations, the computer has won!\n",
        "safe": true
    },
    {
        "filename": "21_game_45.txt",
        "content": "import System.Random\nimport System.IO\nimport System.Exit\nimport Control.Monad\nimport Text.Read\nimport Data.Maybe\n\npromptAgain :: IO Int\npromptAgain = do\n  putStrLn \"Invalid input - must be a number among 1,2 or 3. Try again.\"\n  playerMove\n\nplayerMove :: IO Int\nplayerMove = do\n  putStr \"Your choice(1 to 3):\"\n  number <- getLine\n  when (number == \"q\") $ do\n    exitWith ExitSuccess\n  let n = readMaybe number :: Maybe Int\n  x <- if isNothing n\n             then promptAgain\n             else let val = read number\n                   in if (val > 3 || val < 1)\n                      then promptAgain\n                      else return val\n  return x\n\ncomputerMove :: IO Int\ncomputerMove = do\n  x <- randomRIO (1, 3)\n  putStrLn $ \"Computer move:\" ++ (show x)\n  return x\n\ngameLoop :: (IO Int, IO Int) -> IO Int\ngameLoop moveorder = loop moveorder 0\n  where loop moveorder total = do\n        number <- fst moveorder\n        let total1 = number + total\n        putStrLn $ \"Running total:\" ++ (show total1)\n        if total1 >= 21\n           then return 0\n           else do\n             number <- snd moveorder\n             let total2 = number + total1\n             putStrLn $ \"Running total:\" ++ (show total2)\n             if total2 >= 21\n                then return 1\n                else loop moveorder total2\n\nmain :: IO ()\nmain = do\n  hSetBuffering stdout $ BlockBuffering $ Just 1\n  putStrLn \"Enter q to quit at any time\"\n  x <- randomRIO (0, 1) :: IO Int\n  let (moveorder, names) = if x == 0\n                 then ((playerMove, computerMove), (\"Player\", \"Computer\"))\n                 else ((computerMove, playerMove), (\"Computer\", \"Player\"))\n  when (x == 1) $ do\n    putStrLn \"Computer will start the game\"\n  y <- gameLoop moveorder\n  when (y == 0) $ do\n    putStrLn $ (fst names) ++ \" has won the game\"\n  when (y == 1) $ do\n    putStrLn $ (snd names) ++ \" has won the game\"\n",
        "safe": true
    },
    {
        "filename": "21_game_46.txt",
        "content": "g21=: summarize@play@setup ::'g21: error termination'\n\nUntil=: {{u^:(0-:v)^:_}}\n\n'score turn choice'=: 0 1 2\n\nplay=: move Until done\nmove=: [: update you`it@.(turn&{) \ndone=: 21 <: score&{\n\n\nupdate=: swap@display@add\nadd=: score}~ score&{ + choice&{\ndisplay=: [ 'sum: {}' echo@format~ score&{\nswap=: turn}~ [: -. turn&{\n\nit=: ([ 'It chose {}.' echo@format~ choice&{)@(choice}~ cb)\ncb=: 1:`(>:@?@3)`3:`2:@.(4 | score&{)     NB. computer brain\n\nyou=: qio1@check@acquire@prompt\nprompt=: [ echo@'your choice?'\nacquire=: choice}~'123'i.0{' ',~read\ncheck=: (choice}~ 665 - score&{)@([ echo@'g21: early termination')^:(3 = choice&{)\nqio1=: choice}~ ([: >: choice&{)\n\nsetup=: ([ echo@'On your turn enter 1 2 or 3, other entries exit')@(?@2 turn} ])@0 0 0  NB. choose first player randomly\n\nsummarize=: ' won',~ ];._2@'it you '{~turn&{\n\nread=: 1!:1@1\nwrite=: 1!:2&4 NB. unused\nformat=: ''&$: : ([: ; (a: , [: \":&.> [) ,. '{}' ([ (E. <@}.;._1 ]) ,) ])\n",
        "safe": true
    },
    {
        "filename": "21_game_47.txt",
        "content": "   g21''\nOn your turn enter 1 2 or 3, other entries exit\nIt chose 1.\nsum: 1\nyour choice?\nq\ng21: early termination\nsum: 666\nyou won\n\n   \n   g21''\nOn your turn enter 1 2 or 3, other entries exit\nyour choice?\n2\nsum: 2\nIt chose 3.\nsum: 5\nyour choice?\n1\nsum: 6\nIt chose 3.\nsum: 9\nyour choice?\n2\nsum: 11\nIt chose 2.\nsum: 13\nyour choice?\n3\nsum: 16\nIt chose 1.\nsum: 17\nyour choice?\n1\nsum: 18\nIt chose 3.\nsum: 21\nit  won\n",
        "safe": true
    },
    {
        "filename": "21_game_48.txt",
        "content": "import java.util.Random;\nimport java.util.Scanner;\n\npublic class TwentyOneGame {\n\n    public static void main(String[] args) {\n        new TwentyOneGame().run(true, 21, new int[] {1, 2, 3});\n    }\n    \n    public void run(boolean computerPlay, int max, int[] valid) {\n        String comma = \"\";\n        for ( int i = 0 ; i < valid.length ; i++ ) {\n            comma += valid[i];\n            if ( i < valid.length - 2 && valid.length >= 3 ) {\n                comma += \", \";\n            }\n            if ( i == valid.length - 2 ) {\n                comma += \" or \";\n            }\n        }\n        System.out.printf(\"The %d game.%nEach player chooses to add %s to a running total.%n\" + \n                \"The player whose turn it is when the total reaches %d will win the game.%n\" + \n                \"Winner of the game starts the next game.  Enter q to quit.%n%n\", max, comma, max);\n        int cGames = 0;\n        int hGames = 0;\n        boolean anotherGame = true;\n        try (Scanner scanner = new Scanner(System.in);) {\n            while ( anotherGame ) {\n                Random r = new Random();\n                int round = 0;\n                int total = 0;\n                System.out.printf(\"Start game %d%n\", hGames + cGames + 1);\n                DONE:\n                    while ( true ) {\n                        round++;\n                        System.out.printf(\"ROUND %d:%n%n\", round);\n                        for ( int play = 0 ; play < 2 ; play++ ) {\n                            if ( computerPlay ) {\n                                int guess = 0;\n                                //  try find one equal\n                                for ( int test : valid ) {\n                                    if ( total + test == max ) {\n                                        guess = test;\n                                        break;\n                                    }\n                                }\n                                //  try find one greater than\n                                if ( guess == 0 ) {\n                                    for ( int test : valid ) {\n                                        if ( total + test >= max ) {\n                                            guess = test;\n                                            break;\n                                        }\n                                    }\n                                }\n                                if ( guess == 0 ) {\n                                    guess = valid[r.nextInt(valid.length)];\n                                }\n                                total += guess;\n                                System.out.printf(\"The computer chooses %d%n\", guess);\n                                System.out.printf(\"Running total is now %d%n%n\", total);\n                                if ( total >= max ) {\n                                    break DONE;\n                                }\n                            }\n                            else {\n                                while ( true ) {\n                                    System.out.printf(\"Your choice among %s: \", comma);\n                                    String line = scanner.nextLine();\n                                    if ( line.matches(\"^[qQ].*\") ) {\n                                        System.out.printf(\"Computer wins %d game%s, human wins %d game%s.  One game incomplete.%nQuitting.%n\", cGames, cGames == 1 ? \"\" : \"s\", hGames, hGames == 1 ? \"\" : \"s\");\n                                        return;\n                                    }\n                                    try {\n                                        int input = Integer.parseInt(line);\n                                        boolean inputOk = false;\n                                        for ( int test : valid ) {\n                                            if ( input == test ) {\n                                                inputOk = true;\n                                                break;\n                                            }\n                                        }\n                                        if ( inputOk ) {\n                                            total += input;\n                                            System.out.printf(\"Running total is now %d%n%n\", total);\n                                            if ( total >= max ) {\n                                                break DONE;\n                                            }\n                                            break;\n                                        }\n                                        else {\n                                            System.out.printf(\"Invalid input - must be a number among %s.  Try again.%n\", comma);\n                                        }\n                                    }\n                                    catch (NumberFormatException e) {\n                                        System.out.printf(\"Invalid input - must be a number among %s.  Try again.%n\", comma);\n                                    }\n                                }\n                            }\n                            computerPlay = !computerPlay;\n                        }\n                    }\n                String win;\n                if ( computerPlay ) {\n                    win = \"Computer wins!!\";\n                    cGames++;\n                }\n                else {\n                    win = \"You win and probably had help from another computer!!\";\n                    hGames++;\n                }\n                System.out.printf(\"%s%n\", win);\n                System.out.printf(\"Computer wins %d game%s, human wins %d game%s%n%n\", cGames, cGames == 1 ? \"\" : \"s\", hGames, hGames == 1 ? \"\" : \"s\");\n                while ( true ) {\n                    System.out.printf(\"Another game (y/n)? \");\n                    String line = scanner.nextLine();\n                    if ( line.matches(\"^[yY]$\") ) {\n                        //  OK\n                        System.out.printf(\"%n\");\n                        break;\n                    }\n                    else if ( line.matches(\"^[nN]$\") ) {\n                        anotherGame = false;\n                        System.out.printf(\"Quitting.%n\");\n                        break;\n                    }\n                    else {\n                        System.out.printf(\"Invalid input - must be a y or n.  Try again.%n\");\n                    }\n                }\n            }\n        }\n    }\n\n}\n",
        "safe": true
    },
    {
        "filename": "21_game_49.txt",
        "content": "The 21 game.\nEach player chooses to add 1, 2 or 3 to a running total.\nThe player whose turn it is when the total reaches 21 will win the game.\nWinner of the game starts the next game.  Enter q to quit.\n\nStart game 1\nROUND 1:\n\nThe computer chooses 3\nRunning total is now 3\n\nYour choice among 1, 2 or 3: 4\nInvalid input - must be a number among 1, 2 or 3.  Try again.\nYour choice among 1, 2 or 3: r\nInvalid input - must be a number among 1, 2 or 3.  Try again.\nYour choice among 1, 2 or 3: 1\nRunning total is now 4\n\nROUND 2:\n\nThe computer chooses 1\nRunning total is now 5\n\nYour choice among 1, 2 or 3: 3\nRunning total is now 8\n\nROUND 3:\n\nThe computer chooses 1\nRunning total is now 9\n\nYour choice among 1, 2 or 3: 3\nRunning total is now 12\n\nROUND 4:\n\nThe computer chooses 3\nRunning total is now 15\n\nYour choice among 1, 2 or 3: 2\nRunning total is now 17\n\nROUND 5:\n\nThe computer chooses 3\nRunning total is now 20\n\nYour choice among 1, 2 or 3: 1\nRunning total is now 21\n\nYou win and probably had help from another computer!!\nComputer wins 0 games, human wins 1 game\n\nAnother game (y/n)? y\n\nStart game 2\nROUND 1:\n\nYour choice among 1, 2 or 3: 3\nRunning total is now 3\n\nThe computer chooses 1\nRunning total is now 4\n\nROUND 2:\n\nYour choice among 1, 2 or 3: 3\nRunning total is now 7\n\nThe computer chooses 3\nRunning total is now 10\n\nROUND 3:\n\nYour choice among 1, 2 or 3: 3\nRunning total is now 13\n\nThe computer chooses 2\nRunning total is now 15\n\nROUND 4:\n\nYour choice among 1, 2 or 3: 2\nRunning total is now 17\n\nThe computer chooses 1\nRunning total is now 18\n\nROUND 5:\n\nYour choice among 1, 2 or 3: 3\nRunning total is now 21\n\nYou win and probably had help from another computer!!\nComputer wins 0 games, human wins 2 games\n\nAnother game (y/n)? y\n\nStart game 3\nROUND 1:\n\nYour choice among 1, 2 or 3: 3\nRunning total is now 3\n\nThe computer chooses 3\nRunning total is now 6\n\nROUND 2:\n\nYour choice among 1, 2 or 3: 3\nRunning total is now 9\n\nThe computer chooses 2\nRunning total is now 11\n\nROUND 3:\n\nYour choice among 1, 2 or 3: 3\nRunning total is now 14\n\nThe computer chooses 2\nRunning total is now 16\n\nROUND 4:\n\nYour choice among 1, 2 or 3: 3\nRunning total is now 19\n\nThe computer chooses 2\nRunning total is now 21\n\nComputer wins!!\nComputer wins 1 game, human wins 2 games\n\nAnother game (y/n)? n\nQuitting.\n",
        "safe": true
    },
    {
        "filename": "21_game_5.txt",
        "content": "/* ARM assembly Raspberry PI  */\n/*  program game21.s   */ \n\n/* REMARK 1\u00a0: this program use routines in a include file \n   see task Include a file language arm assembly \n   for the routine affichageMess conversion10 \n   see at end of this program the instruction include */\n/* for constantes see task include a file in arm assembly */\n/************************************/\n/* Constantes                       */\n/************************************/\n.include \"../constantes.inc\"\n.equ STDIN,  0       @ Linux input console\n.equ READ,   3       @ Linux syscall\n.equ HITTOTAL,   21\n.equ BUFFERSIZE, 10\n\n\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nszMessRules:         .ascii \"21 Game\\n\"\n                    .ascii \"21 is a two player game, the game is played by choosing a number \\n\"\n                    .ascii \"(1, 2, or 3) to be added to the running total. The game is won by\\n\"\n                    .ascii \"the player whose chosen number causes the running total to reach \\n\"\n                    .asciz \"exactly 21. The running total starts at zero.\\n\\n\\n\"\n\nszMessHumanChoice:  .asciz \"Enter your choice (1,2, 3 or type (q)uit to exit): \"\nszMessErrChoise:    .asciz \"invalid choice.\\n \"\nszMessHumanBegin:   .asciz \"The first move is human move.\\n\"\nszMessPiBegin:      .asciz \"The first move is Raspberry pi. \\n\"\nszMessHumanWon:     .asciz \"You won. \\n\"\nszMessHumanLost:    .asciz \"You lost. \\n\"\nszMessTotal:        .asciz \"The running total is @ \\n\"\nszMessPiChoice:     .asciz \"Raspberry choice if  @ \\n\" \nszMessNewGame:      .asciz \"New game (y/n)\u00a0? \\n\"\nszCarriageReturn:   .asciz \"\\n\"\n.align 4\niGraine:  .int 123456\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\nsZoneConv:        .skip 24\nsBuffer:          .skip BUFFERSIZE\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                 @ entry of program \n    \n    ldr r0,iAdrszMessRules\n    bl affichageMess\n1:\n    mov r10,#0                         @ total = 0\n    mov r0,#100\n    bl genereraleas \n    cmp r0,#50\n    blt 2f\n    ldr r0,iAdrszMessHumanBegin        @ human begin\n    bl affichageMess\n    b 4f\n2:                                     @ Rasp begin\n    ldr r0,iAdrszMessPiBegin\n    bl affichageMess\n    mov r0,#1\n3:                                    @ rasp turn\n    add r10,r10,r0\n    ldr r1,iAdrsZoneConv\n    bl conversion10                   @ call decimal conversion\n    ldr r0,iAdrszMessPiChoice\n    ldr r1,iAdrsZoneConv              @ insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n    cmp r10,#HITTOTAL\n    bne 4f\n    ldr r0,iAdrszMessHumanLost\n    bl affichageMess\n    b 10f\n4:                                    @ display current total\n    mov r0,r10\n    ldr r1,iAdrsZoneConv\n    bl conversion10                   @ call decimal conversion\n    ldr r0,iAdrszMessTotal\n    ldr r1,iAdrsZoneConv              @ insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n\n5:                                    @ human turn\n    ldr r0,iAdrszMessHumanChoice\n    bl affichageMess\n    bl saisie\n    cmp r0,#'q'                       @ quit\u00a0?\n    beq 100f\n    cmp r0,#'Q'\n    beq 100f\n    cmp r0,#'1'\n    addeq r10,r10,#1\n    beq 6f\n    cmp r0,#'2'\n    addeq r10,r10,#2\n    beq 6f\n    cmp r0,#'3'\n    addeq r10,r10,#3\n    beq 6f\n    ldr r0,iAdrszMessErrChoise\n    bl affichageMess\n    b 5b\n6:\n    cmp r10,#HITTOTAL                @ total = maxi\u00a0?\n    beq 9f                           @ yes -> human won\n    cmp r10,#5                       @ else compute rasp number\n    rsble r0,r10,#5\n    ble 7f\n    cmp r10,#9\n    rsble r0,r10,#9\n    ble 7f\n    cmp r10,#13\n    rsble r0,r10,#13\n    ble 7f\n    cmp r10,#17\n    rsble r0,r10,#17\n    ble 7f\n    cmp r10,#21\n    rsble r0,r10,#21\n    ble 7f\n7:                                  @ control number rasp\n    cmp r0,#0\n    ble 8f\n    cmp r0,#3\n    ble 3b\n8:                                  @ if not ok, generate random number\n    mov r0,#2\n    bl genereraleas\n    add r0,r0,#1\n    b 3b                            @ and loop\n    \n9:                                  @ display human won\n    ldr r0,iAdrszMessHumanWon\n    bl affichageMess\n10:                                 @ display new game\u00a0?\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess\n    ldr r0,iAdrszMessNewGame\n    bl affichageMess\n    bl saisie\n    cmp r0,#'y'\n    beq 1b\n    cmp r0,#'Y'\n    beq 1b\n    \n100:                                  @ standard end of the program \n    mov r0, #0                        @ return code\n    mov r7, #EXIT                     @ request to exit program\n    svc #0                            @ perform the system call\n \niAdrszCarriageReturn:     .int szCarriageReturn\niAdrszMessRules:          .int szMessRules\niAdrszMessHumanBegin:     .int szMessHumanBegin\niAdrszMessPiBegin:        .int szMessPiBegin\niAdrszMessPiChoice:       .int szMessPiChoice\niAdrszMessTotal:          .int szMessTotal\niAdrszMessHumanChoice:    .int szMessHumanChoice\niAdrszMessHumanLost:      .int szMessHumanLost\niAdrszMessHumanWon:       .int szMessHumanWon\niAdrszMessNewGame:        .int szMessNewGame\niAdrszMessErrChoise:      .int szMessErrChoise\niAdrsZoneConv:            .int sZoneConv\n/******************************************************************/\n/*            string saisie                                       */ \n/******************************************************************/\n/* r0 return the first character of human entry */\nsaisie:\n    push {r1-r7,lr}        @ save registers\n    mov r0,#STDIN          @ Linux input console\n    ldr r1,iAdrsBuffer     @ buffer address \n    mov r2,#BUFFERSIZE     @ buffer size \n    mov r7,#READ           @ request to read datas\n    svc 0                  @ call system\n    ldr r1,iAdrsBuffer     @ buffer address \n    ldrb r0,[r1]           @ load first character\n100:\n    pop {r1-r7,lr}\n    bx lr                   @ return \niAdrsBuffer:         .int sBuffer\n/***************************************************/\n/*   Generation random number                  */\n/***************************************************/\n/* r0 contains limit  */\ngenereraleas:\n    push {r1-r4,lr}                   @ save registers \n    ldr r4,iAdriGraine\n    ldr r2,[r4]\n    ldr r3,iNbDep1\n    mul r2,r3,r2\n    ldr r3,iNbDep1\n    add r2,r2,r3\n    str r2,[r4]                       @ maj de la graine pour l appel suivant \n    cmp r0,#0\n    beq 100f\n    mov r1,r0                         @ divisor\n    mov r0,r2                         @ dividende\n    bl division\n    mov r0,r3                         @ r\u00e9sult = remainder\n  \n100:                                  @ end function\n    pop {r1-r4,lr}                    @ restaur registers\n    bx lr                             @ return\n/*****************************************************/\niAdriGraine: .int iGraine\niNbDep1:     .int 0x343FD\niNbDep2:     .int 0x269EC3 \n/***************************************************/\n/*      ROUTINES INCLUDE                           */\n/***************************************************/\n.include \"../affichage.inc\"",
        "safe": true
    },
    {
        "filename": "21_game_50.txt",
        "content": "<!DOCTYPE html><html lang=\"en\">\n\n<head>\n    <meta charset=\"UTF-8\">\n    <meta name=\"keywords\"    content=\"Game 21\">\n    <meta name=\"description\" content=\"\n      21 is a two player game, the game is played by choosing a number\n      (1, 2, or 3) to be added to the running total. The game is won by\n      the player whose chosen number causes the running total to reach\n      exactly 21. The running total starts at zero.\n    \">\n    <!--DCMI metadata (Dublin Core Metadata Initiative)-->\n    <meta name=\"dc.publisher\" content=\"Rosseta Code\">\n    <meta name=\"dc.date\"      content=\"2020-07-23\">\n    <meta name=\"dc.created\"   content=\"2020-07-23\">\n    <meta name=\"dc.modified\"  content=\"2020-07-30\">\n    <title>\n        21 Game\n    </title>\n    <!-- Remove the line below in the final/production version. -->\n    <meta http-equiv=\"cache-control\" content=\"no-cache\">\n\n    <style>\n      .ui div   { width: 50%; display: inline-flex; justify-content: flex-end; }\n      div.total { margin-bottom: 1ch; }\n      label     { padding-right: 1ch; }\n      button + button { margin-left: 1em; }\n    </style>\n</head>\n\n<body>\n  <h1>\n    21 Game in ECMA Script (Java Script)\n  </h1>\n\n  <p>\n    21 is a two player game, the game is played by choosing a number\n    (1, 2, or 3) to be added to the running total. The game is won by\n    the player whose chosen number causes the running total to reach\n    exactly 21. The running total starts at zero.\n  </p>\n\n  <p><span id=\"first\"></span> Use buttons to play.</p>\n\n  <div class=\"ui\">\n    <div class=\"total\">\n      <label for=\"human\">human last choice:</label>\n      <input type=\"text\" id=\"human\" readonly>\n    </div>\n    <div class=\"total\">\n      <label for=\"AI\">AI last choice:</label>\n      <input type=\"text\" id=\"AI\" readonly>\n    </div>\n    <div class=\"total\">\n      <label for=\"runningTotalText\">running total:</label>\n      <input type=\"text\" id=\"runningTotalText\" readonly>\n    </div>\n    <div class=\"buttons\">\n      <button onclick=\"choice(1);\" id=\"choice1\"> one   </button>\n      <button onclick=\"choice(2);\" id=\"choice2\"> two   </button>\n      <button onclick=\"choice(3);\" id=\"choice3\"> three </button>\n      <button onclick=\"restart();\"> restart </button>\n    </div>\n  </div>\n\n  <p id=\"message\"></p>\n\n  <noscript>\n    No script, no fun. Turn on Javascript on.\n  </noscript>\n\n  <script>\n    // I really dislike global variables, but in any (?) WWW browser the global\n    // variables are in the window (separately for each tab) context space.\n    //\n    var runningTotal = 0;\n    const human = document.getElementById('human');\n    const AI = document.getElementById('AI');\n    const runningTotalText = document.getElementById('runningTotalText');\n    const first = document.getElementById('first')\n    const message = document.getElementById('message');\n    const choiceButtons = new Array(3);\n\n    // An function to restart game in any time, should be called as a callback\n    // from the WWW page, see above for an example.\n    //\n    function restart()\n    {\n      runningTotal = 0;\n      runningTotalText.value = runningTotal;\n      human.value = '';\n      AI.value = '';\n      for (let i = 1; i <= 3; i++)\n      {\n        let button = document.getElementById('choice' + i);\n        button.disabled = false;\n        choiceButtons[i] = button;\n      }\n      message.innerText = '';\n      if (Math.random() > 0.5)\n      {\n        update(AI, ai());\n        first.innerText = 'The first move is AI move.'\n      }\n      else\n        first.innerText = 'The first move is human move.'\n    }\n\n    // This function update an (read-only for a user) two text boxes\n    // as well as runningTotal. It should be called only once per a move/turn.\n    //\n    function update(textBox, n)\n    {\n      textBox.value = n;\n      runningTotal = runningTotal + n;\n      runningTotalText.value = runningTotal;\n      for (let i = 1; i <= 3; i++)\n        if (runningTotal + i > 21)\n          choiceButtons[i].disabled = true;\n    }\n\n    // An callback function called when the human player click the button.\n    //\n    function choice(n)\n    {\n      update(human, n);\n      if (runningTotal == 21)\n        message.innerText = 'The winner is human.';\n      else\n      {\n        update(AI, ai());\n        if (runningTotal == 21)\n          message.innerText = 'The winner is AI.';\n      }\n    }\n\n    // A rather simple function to calculate a computer move for the given total.\n    //\n    function ai()\n    {\n      for (let i = 1; i <= 3; i++)\n        if (runningTotal + i == 21)\n          return i;\n\n      for (let i = 1; i <= 3; i++)\n        if ((runningTotal + i - 1) % 4 == 0)\n          return i;\n\n      return 1;\n    }\n\n    // Run the script - actually this part do only some initialization, because\n    // the game is interactively driven by events from an UI written in HTML.\n    //\n    restart();\n  </script>\n\n</body>\n</html>\n",
        "safe": true
    },
    {
        "filename": "21_game_51.txt",
        "content": "function trytowin(n)\n    if 21 - n < 4\n        println(\"Computer chooses $(21 - n) and wins. GG!\")\n        exit(0)\n    end\nend\n\nfunction choosewisely(n)\n    trytowin(n)\n    targets = [1, 5, 9, 13, 17, 21]\n    pos = findfirst(x -> x > n, targets)\n    bestmove = targets[pos] - n\n    if bestmove > 3\n        println(\"Looks like I could lose. Choosing a 1, total now $(n + 1).\")\n        return n + 1\n    end\n    println(\"On a roll, choosing a $bestmove, total now $(n + bestmove).\")\n    n + bestmove\nend\n\nfunction choosefoolishly(n)\n    trytowin(n)\n    move = rand([1, 2, 3])\n    println(\"Here goes, choosing $move, total now $(n + move).\")\n    n + move\nend\n\nfunction choosesemiwisely(n)\n    trytowin(n)\n    if rand() > 0.75\n        choosefoolishly(n)\n    else\n        choosewisely(n)\n    end\nend\n\nprompt(s) = (println(s, \": => \"); return readline())\n\nfunction playermove(n)\n    rang = (n > 19) ? \"1 is all\" : ((n > 18) ? \"1 or 2\" : \"1, 2 or 3\")\n    choice = 0\n    while true\n        nstr = prompt(\"Your choice ($rang), 0 to exit\")\n        if nstr == \"0\"\n            exit(0)\n        elseif nstr == \"1\"\n            return n + 1\n        elseif nstr == \"2\" && n < 20\n            return n + 2\n        elseif nstr == \"3\" && n < 19\n            return n + 3\n        end\n    end\nend\n\n\nfunction play21game()\n    n = 0\n    level = prompt(\"Level of play (1=dumb, 3=smart)\")\n    algo = choosewisely\n    if level == \"1\"\n        algo = choosefoolishly\n    elseif level == \"2\"\n        algo = choosesemiwisely\n    elseif level != \"3\"\n        println(\"Bad choice syntax--default to smart choice\")\n    end\n    whofirst = prompt(\"Does computer go first? (y or n)\")\n    if whofirst[1] == 'y' || whofirst[1] == 'Y'\n        n = algo(n)\n    end\n    while n < 21\n        n = playermove(n)\n        if n == 21\n            println(\"Player wins! Game over, gg!\")\n            break\n        end\n        n = algo(n)\n    end\nend\n\nplay21game()\n",
        "safe": true
    },
    {
        "filename": "21_game_52.txt",
        "content": "import std/num/random\nimport std/os/readline\n\neffect exit\n  final ctl exit(): ()\n\ntype player\n  Player\n  Computer\n\nfun other(p: player): player\n  match p\n    Player -> Computer\n    Computer -> Player\n\nfun show(p: player): string\n  match p\n    Player -> \"Player\"\n    Computer -> \"Computer\"\n\nfun get-selection(max-int: int)\n  val i = readline().trim().parse-int()\n  match i\n    Just(x) | x >= 1 && x <= max-int -> x\n    _ ->\n      println(\"Please enter a number between 1 and \" ++ max-int.show ++ \" or press q to quit\")\n      get-selection(max-int)\n\nfun play(p: player, total: int)\n  println(\"Total: \" ++ total.show)\n  match total\n    21 ->\n      // The player who reaches 21 wins the game, which is the player in the last loop\n      println(p.other.show ++ \" wins!\")\n      return ()\n    _ -> ()\n  val max = if total + 3 > 21 then 21 - total else 3\n  match p\n    Player ->\n      println(\"Player's turn\")\n      val selection = get-selection(max)\n      play(p.other, total + selection)\n    Computer ->\n      println(\"Computer's turn\")\n      val selection = (random-int() % max) + 1\n      println(\"Computer chooses \" ++ selection.show)\n      play(p.other, total + selection)\n\nfun main()\n  with final ctl exit() ()\n  \"21 is a two player game. The game is played by choosing a number (1, 2, 3) to\".println\n  \"be added to the running total. The game is won by the player whose chosen number\".println\n  \"causes the running total to reach exactly 21. The running total starts at zero.\".println\n  \"\".println\n  \"You can quit the game at any time by typing 'q'.\".println\n  val playerGoesFirst = random-bool()\n  val p1 = if playerGoesFirst then Player else Computer\n  play(p1, 0)\n",
        "safe": true
    },
    {
        "filename": "21_game_53.txt",
        "content": "gamewon = false\nrunning_total = 0\nplayer = 1\nopponent = 2\n\nwhile not gamewon do\n  num = 0\n  \n  if player == 1 then\n    opponent = 2\n    repeat\n      print(\"Enter a number between 1 and 3 (0 to quit):\")\n      num = io.read(\"*n\")\n      if num == 0 then\n          os.exit()\n      end\n    until (num > 0) and (num <=3)\n  end\n  \n  if player == 2 and not (gamewon) then\n      opponent = 1\n      if (21 - running_total <= 3) then\n        num = 21 - running_total\n      else\n        num = math.random(1,3)\n      end\n      print(\"Player 2 picks number \"..num)\n  end\n  \n  running_total = running_total + num\n  print(\"Total: \"..running_total)\n  \n  if running_total == 21 then\n    print(\"Player \"..player..\" wins!\")\n    gamewon = true\n  end\n  \n  if running_total > 21 then\n    print(\"Player \"..player..\" lost...\")\n    print(\"Player \"..opponent..\" wins!\")\n    gamewon = true\n  end\n  \n  if player == 1 then\n    player = 2\n  else player = 1 \n  end\n\nend\n",
        "safe": true
    },
    {
        "filename": "21_game_54.txt",
        "content": "SeedRandom[1234];\nClearAll[ComputerChoose, HumanChoose]\nComputerChoose[n_] := If[n < 18, RandomChoice[{1, 2, 3}], 21 - n]\nHumanChoose[] := ChoiceDialog[\"How many?\", {1 -> 1, 2 -> 2, 3 -> 3, \"Quit\" -> -1}]\nrunningtotal = 0;\nwhofirst = ChoiceDialog[\"Who goes first?\", {\"You\" -> 1, \"Computer\" -> 2}];\nWhile[runningtotal < 21,\n If[whofirst == 1,\n   choice = HumanChoose[];\n   If[choice == -1, Break[]];\n   Print[\"You choose = \", choice];\n   runningtotal += choice;\n   Print[\"Running total = \", runningtotal];\n   If[runningtotal == 21, Print[\"You won!\"]; Break[]];\n   choice = ComputerChoose[runningtotal];\n   Print[\"Computer choose = \", choice];\n   runningtotal += choice;\n   Print[\"Running total = \", runningtotal];\n   If[runningtotal == 21, Print[\"Computer won!\"]; Break[]];\n   ,\n   choice = ComputerChoose[runningtotal];\n   Print[\"Computer choose = \", choice];\n   runningtotal += choice;\n   Print[\"Running total = \", runningtotal];\n   If[runningtotal == 21, Print[\"Computer won!\"]; Break[]];\n   choice = HumanChoose[];\n   If[choice == -1, Break[]];\n   Print[\"You choose = \", choice];\n   runningtotal += choice;\n   Print[\"Running total = \", runningtotal];\n   If[runningtotal == 21, Print[\"You won!\"]; Break[]];\n   ];\n ]\n",
        "safe": true
    },
    {
        "filename": "21_game_55.txt",
        "content": "You choose = 2\nRunning total = 2\nComputer choose = 3\nRunning total = 5\nYou choose = 3\nRunning total = 8\nComputer choose = 1\nRunning total = 9\nYou choose = 3\nRunning total = 12\nComputer choose = 1\nRunning total = 13\nYou choose = 1\nRunning total = 14\nComputer choose = 2\nRunning total = 16\nYou choose = 1\nRunning total = 17\nComputer choose = 3\nRunning total = 20\nYou choose = 1\nRunning total = 21\nYou won!",
        "safe": true
    },
    {
        "filename": "21_game_56.txt",
        "content": "# 21 game.\n\nimport random\nimport strformat\nimport strutils\n\nconst\n  Target = 21\n  PossibleChoices: array[18..20, seq[string]] = [@[\"1\", \"2\", \"3\"], @[\"1\", \"2\"], @[\"1\"]]\n  Targets = [1, 5, 9, 13, 17, 21]     # Totals that a player must obtain to win.\n\n#---------------------------------------------------------------------------------------------------\n\nproc printTotal(total: int) =\n  ## Print the running total.\n  echo fmt\"Running total is now {total}.\"\n\n#---------------------------------------------------------------------------------------------------\n\nproc computerPlays(total: var int) =\n  ## Make the computer play.\n  var choice: int\n  if total in Targets:\n    # No winning choice. Choose a random value.\n    choice = rand(1..3)\n  else:\n    # Find the running total to get.\n    for val in Targets:\n      if val > total:\n        choice = val - total\n        break\n  inc total, choice\n  echo fmt\"I choose {choice}.\"\n  printTotal(total)\n\n#---------------------------------------------------------------------------------------------------\n\nproc prompt(message: string; answers: openArray[string]): int =\n  ## Prompt a message and get an answer checking its validity against possible answers.\n\n  while true:\n    stdout.write(message & ' ')\n    try:\n      result = answers.find(stdin.readLine())\n      if result >= 0:\n        break\n      echo fmt\"Please answer one of: {answers.join(\"\", \"\")}.\"\n    except EOFError:\n      echo \"\"\n      return  # Quit.\n\n#---------------------------------------------------------------------------------------------------\n\nrandomize()\n\necho \"21 is a two player game. The game is played by choosing a number (1, 2, 3) to\\n\" &\n     \"be added to the running total. The game is won by the player whose chosen number\\n\" &\n     \"causes the running total to reach exactly 21. The running total starts at zero.\\n\"\necho \"You can quit the game at any time by typing 'q'.\"\n\nblock mainLoop:\n\n  while true:\n    var total = 0\n\n    # Choose the player who will play first.\n    var answer = prompt(\"Who will play first ('you', 'me')?\", [\"q\", \"you\", \"me\"])\n    if answer == 0:\n      echo \"Quitting game.\"\n      break\n    elif answer == 1:\n      computerPlays(total)\n\n    # Internal game loop.\n    while true:\n\n      # Ask player its choice.\n      let choices = if total > 18: PossibleChoices[total] else: PossibleChoices[18]\n      let choice = prompt(fmt\"Your choice ({choices.join(\"\", \"\")})?\", \"q\" & choices)\n      if choice == 0:\n        echo \"Quitting game.\"\n        break mainLoop\n\n      # Update running total and check if player win.\n      inc total, choice\n      printTotal(total)\n      if total == Target:\n        echo \"Congratulations, you win.\"\n        break\n\n      # Make computer play.\n      computerPlays(total)\n      if total == Target:\n        echo \"Sorry, I win.\"\n        break\n\n    # Ask player for another game.\n    answer = prompt(\"Do you want to play another game (y, n)\", [\"q\", \"y\", \"n\"])\n    if answer != 1:\n      echo \"Quitting game.\"\n      break\n",
        "safe": true
    },
    {
        "filename": "21_game_57.txt",
        "content": "21 is a two player game. The game is played by choosing a number (1, 2, 3) to\nbe added to the running total. The game is won by the player whose chosen number\ncauses the running total to reach exactly 21. The running total starts at zero.\n\nYou can quit the game at any time by typing 'q'.\nWho will play first (you, me)? x\nPlease, answer one of: q, you, me.\nWho will play first ('you', 'me')? you\nI choose 1.\nRunning total is now 1.\nYour choice (1, 2, 3)? 4\nPlease answer one of: q, 1, 2, 3.\nYour choice (1, 2, 3)? 3\nRunning total is now 4.\nI choose 1.\nRunning total is now 5.\nYour choice (1, 2, 3)? 3\nRunning total is now 8.\nI choose 1.\nRunning total is now 9.\nYour choice (1, 2, 3)? 3\nRunning total is now 12.\nI choose 1.\nRunning total is now 13.\nYour choice (1, 2, 3)? 3\nRunning total is now 16.\nI choose 1.\nRunning total is now 17.\nYour choice (1, 2, 3)? 3\nRunning total is now 20.\nI choose 1.\nRunning total is now 21.\nSorry, I win.\nDo you want to play another game (y, n) y\nWho will play first (you, me)? me\nYour choice (1, 2, 3)? 1\nRunning total is now 1.\nI choose 2.\nRunning total is now 3.\nYour choice (1, 2, 3)? 2\nRunning total is now 5.\nI choose 2.\nRunning total is now 7.\nYour choice (1, 2, 3)? 2\nRunning total is now 9.\nI choose 1.\nRunning total is now 10.\nYour choice (1, 2, 3)? 3\nRunning total is now 13.\nI choose 3.\nRunning total is now 16.\nYour choice (1, 2, 3)? 1\nRunning total is now 17.\nI choose 2.\nRunning total is now 19.\nYour choice (1, 2)? 2\nRunning total is now 21.\nCongratulations, you win.\nDo you want to play another game (y, n) n\nQuitting game.\n",
        "safe": true
    },
    {
        "filename": "21_game_58.txt",
        "content": "class TwentyOne {\n  @quit\u00a0: Bool;\n  @player_total\u00a0: Int;\n  @computer_total\u00a0: Int;\n\n  function\u00a0: Main(args\u00a0: String[]) ~ Nil {\n    TwentyOne->New()->Play();\n  }\n\n  New() {\n  }\n\n  method\u00a0: Play() ~ Nil {\n    player_first\u00a0:= Int->Random(1) = 1;\n\n    \"Enter 'q' to quit\\n===\"->PrintLine();\n    do {\n      if(player_first) {\n        PlayerTurn();\n        if(<>@quit) {\n          \"---\"->PrintLine();\n          ComputerTurn();\n        };\n      }\n      else {\n        ComputerTurn();\n        \"---\"->PrintLine();\n        PlayerTurn();\n      };\n      \"===\"->PrintLine();\n    }\n    while(<>@quit);\n  }\n\n  method\u00a0: ComputerTurn() ~ Nil {\n    input\u00a0:= Int->Random(1, 3);\n    \n    \"Computer choose: {$input}\"->PrintLine();\n    @computer_total += input;\n\n    if(@computer_total = 21) {\n      \"Computer Wins!\"->PrintLine();\n      @quit\u00a0:= true;\n    }\n    else if(@computer_total > 21) {\n      \"Computer Loses.\"->PrintLine();\n      @quit\u00a0:= true;\n    }\n    else {\n      \"Computer total is {$@computer_total}.\"->PrintLine();\n    };\n  }\n\n  method\u00a0: PlayerTurn() ~ Nil {\n    input\u00a0:= GetInput();\n\n    if(input = -1) {\n      \"Quit\"->PrintLine();\n      @quit\u00a0:= true;\n    }\n    else if(input = 0) {\n      \"Invalid Input!\"->PrintLine();\n    }\n    else {\n      @player_total += input;\n    };\n\n    if(@player_total = 21) {\n      \"Player Wins!\"->PrintLine();\n      @quit\u00a0:= true;\n    }\n    else if(@player_total > 21) {\n      \"Player Loses.\"->PrintLine();\n      @quit\u00a0:= true;\n    }\n    else {\n      \"Player total is {$@player_total}.\"->PrintLine();\n    };\n  }\n\n  function\u00a0: GetInput() ~ Int {\n    \"Choosing a number beween 1-3: \"->Print();\n\n    input\u00a0:= System.IO.Console->ReadString();\n    if(input->Size() = 1) {\n      if(input->Get(0) = 'q') {\n        return -1;\n      };\n\n      return input->ToInt();\n    };\n\n    return 0;\n  }\n}",
        "safe": true
    },
    {
        "filename": "21_game_59.txt",
        "content": "program Game21;\n\n{$APPTYPE CONSOLE}\n\n{$R *.res}\n\nuses\n  System.SysUtils,\n  System.StrUtils, // for IfThen\n  Winapi.Windows;  // for ClearScreen\n\nconst\n  HARD_MODE = True;\n\nvar\n  computerPlayer: string = 'Computer';\n  humanPlayer: string = 'Player 1';\n\n  // for change color\n  ConOut: THandle;\n  BufInfo: TConsoleScreenBufferInfo;\n\nprocedure ClearScreen;\nvar\n  stdout: THandle;\n  csbi: TConsoleScreenBufferInfo;\n  ConsoleSize: DWORD;\n  NumWritten: DWORD;\n  Origin: TCoord;\nbegin\n  stdout := GetStdHandle(STD_OUTPUT_HANDLE);\n  Win32Check(stdout <> INVALID_HANDLE_VALUE);\n  Win32Check(GetConsoleScreenBufferInfo(stdout, csbi));\n  ConsoleSize := csbi.dwSize.X * csbi.dwSize.Y;\n  Origin.X := 0;\n  Origin.Y := 0;\n  Win32Check(FillConsoleOutputCharacter(stdout, ' ', ConsoleSize, Origin, NumWritten));\n  Win32Check(FillConsoleOutputAttribute(stdout, csbi.wAttributes, ConsoleSize,\n    Origin, NumWritten));\n  Win32Check(SetConsoleCursorPosition(stdout, Origin));\nend;\n\nprocedure ResetColor;\nbegin\n  SetConsoleTextAttribute(ConOut, BufInfo.wAttributes);\nend;\n\nprocedure ChangeColor(color: Word);\nbegin\n  ConOut := TTextRec(Output).Handle;\n  GetConsoleScreenBufferInfo(ConOut, BufInfo);\n  SetConsoleTextAttribute(TTextRec(Output).Handle, color);\nend;\n\nfunction SwapPlayer(currentPlayer: string): string;\nbegin\n  Result := IfThen(currentPlayer = humanPlayer, computerPlayer, humanPlayer);\nend;\n\nfunction RandomPlayerSelect(): string;\nbegin\n  Result := IfThen(Random() < 0.5, computerPlayer, humanPlayer);\nend;\n\nfunction CheckIfCanWin(total: Integer): Boolean;\nbegin\n  result := (total >= 18);\nend;\n\nfunction CheckIfCanLose(total: Integer; var choose: Integer; hardMode: Boolean =\n  False): Boolean;\nvar\n  range: Integer;\nbegin\n  range := 17 - total;\n  Result := false;\n  if (range > 0) and (range < 4) then\n  begin\n    Result := true;\n    if hardMode then\n      choose := range\n    else\n      choose := Random(range - 1) + 1;\n  end;\nend;\n\nfunction CompMove(total: Integer): Integer;\nbegin\n  if (CheckIfCanWin(total)) then\n  begin\n    exit(21 - total);\n  end;\n\n  if CheckIfCanLose(total, Result, HARD_MODE) then\n    exit;\n\n  Result := Random(3) + 1;\nend;\n\nfunction HumanMove: Integer;\nvar\n  choice: string;\nbegin\n  repeat\n    Writeln('Choose from numbers: 1, 2, 3');\n    Readln(choice);\n  until TryStrToInt(choice, Result) and (Result in [1..3]);\nend;\n\nprocedure PlayGame();\nvar\n  playAnother: Boolean;\n  total, final_, roundChoice, compWins, humanWins: Integer;\n  choice, currentPlayer: string;\nbegin\n  playAnother := True;\n  total := 0;\n  final_ := 21;\n  roundChoice := 0;\n  Randomize;\n  currentPlayer := RandomPLayerSelect();\n  compWins := 0;\n  humanWins := 0;\n\n  while (playAnother) do\n  begin\n    ClearScreen;\n    ChangeColor(FOREGROUND_INTENSITY or FOREGROUND_GREEN);\n    Writeln(total);\n    ResetColor;\n    Writeln('');\n\n    Writeln('Now playing: ' + currentPlayer);\n    if currentPlayer = computerPlayer then\n      roundChoice := CompMove(total)\n    else\n      roundChoice := HumanMove;\n    inc(total, roundChoice);\n\n    if (total = final_) then\n    begin\n      if (currentPlayer = computerPlayer) then\n      begin\n        inc(compWins);\n      end\n      else\n      begin\n        inc(humanWins);\n      end;\n\n      ClearScreen;\n      Writeln('Winner: ' + currentPlayer);\n      Writeln('Comp wins: ', compWins, '. Human wins: ', humanWins, #10);\n      Writeln('Do you wan to play another round? y/n');\n\n      readln(choice);\n\n      if choice = 'y' then\n      begin\n        total := 0;\n        ClearScreen;\n      end\n      else if choice = 'n' then\n        playAnother := false\n      else\n      begin\n        Writeln('Invalid choice! Choose from y or n');\n        Continue;\n      end;\n    end\n    else if total > 21 then\n    begin\n      Writeln('Not the right time to play this game\u00a0:)');\n      break;\n    end;\n\n    currentPlayer := SwapPlayer(currentPlayer);\n  end;\n\nend;\n\nconst\n  WELLCOME_MSG: array[0..5] of string = ('Welcome to 21 game'#10,\n    '21 is a two player game.', 'The game is played by choosing a number.',\n    '1, 2, or 3 to be added a total sum.'#10,\n    'The game is won by the player reaches exactly 21.'#10, 'Press ENTER to start!'#10);\n\nvar\n  i: Integer;\n\nbegin\n  try\n    for i := 0 to High(WELLCOME_MSG) do\n      Writeln(WELLCOME_MSG[i]);\n    ResetColor;\n    Readln; // Wait press enter\n\n    PlayGame();\n  except\n    on E: Exception do\n      Writeln(E.ClassName, ': ', E.Message);\n  end;\nend.\n",
        "safe": true
    },
    {
        "filename": "21_game_6.txt",
        "content": "The first move is human move.\nThe running total is 0\nEnter your choice (1,2, 3 or type (q)uit to exit): 4\ninvalid choice.\n Enter your choice (1,2, 3 or type (q)uit to exit): 1\nRaspberry choice if  1\nThe running total is 2\nEnter your choice (1,2, 3 or type (q)uit to exit): 3\nRaspberry choice if  2\nThe running total is 7\nEnter your choice (1,2, 3 or type (q)uit to exit): 1\nRaspberry choice if  1\nThe running total is 9\nEnter your choice (1,2, 3 or type (q)uit to exit): 2\nRaspberry choice if  2\nThe running total is 13\nEnter your choice (1,2, 3 or type (q)uit to exit): 3\nRaspberry choice if  1\nThe running total is 17\nEnter your choice (1,2, 3 or type (q)uit to exit): 1\nRaspberry choice if  3\nYou lost.\n\nNew game (y/n)\u00a0?\ny\nThe first move is Raspberry pi.\n",
        "safe": true
    },
    {
        "filename": "21_game_60.txt",
        "content": "print <<'HERE';\nThe 21 game. Each player chooses to add 1, 2, or 3 to a running total.\nThe player whose turn it is when the total reaches 21 wins. Enter q to quit.\nHERE\n\nmy $total = 0;\n\nwhile () {\n    print \"Running total is: $total\\n\";\n    my ($me,$comp);\n    while () {\n        print 'What number do you play> ';\n        $me = <>; chomp $me;\n        last if $me =~ /^[123]$/;\n        insult($me);\n    }\n    $total += $me;\n    win('Human') if $total >= 21;\n    print \"Computer plays: \" . ($comp = 1+int(rand(3))) . \"\\n\";\n    $total += $comp;\n    win('Computer') if $total >= 21;\n}\n\nsub win {\n    my($player) = @_;\n    print \"$player wins.\\n\";\n    exit;\n}\n\nsub insult {\n    my($g) = @_;\n    exit if $g =~ /q/i;\n    my @insults = ('Yo mama', 'Jeez', 'Ummmm', 'Grow up');\n    my $i = $insults[1+int rand($#insults)];\n    print \"$i, $g is not an integer between 1 and 3...\\n\"\n}\n",
        "safe": true
    },
    {
        "filename": "21_game_61.txt",
        "content": "The 21 game. Each player chooses to add 1, 2, or 3 to a running total.\nThe player whose turn it is when the total reaches 21 wins. Enter q to quit.\nRunning total is: 0\nWhat number do you play> 3\nComputer plays: 3\nRunning total is: 6\nWhat number do you play> 3\nComputer plays: 3\nRunning total is: 12\nWhat number do you play> 3\nComputer plays: 2\nRunning total is: 17\nWhat number do you play> 1\nComputer plays: 1\nRunning total is: 19\nWhat number do you play> 2\nHuman wins.",
        "safe": true
    },
    {
        "filename": "21_game_62.txt",
        "content": "--\n-- demo\\rosetta\\21_Game.exw\n-- ========================\n--\nwith javascript_semantics -- DEV NORMALIZESIZE, CANFOCUS, \"You\" not checked, VALUE_HANDLE.\n                          -- The radio_texts simply don't do anything at all in p2js.\nconstant title = \"21 Game\",\n         help_text = \"\"\"\nPlay by choosing 1, 2, or 3 to add to the running total (initially 0).\n\nThe first player to reach 21 wins.\n\nIf the computer goes first you cannot win.\n\nIf you leave your opponent on 18, 19, or 20, they will play {3,2,1} and win.\nIf you leave your opponent on 17, simply match their play {1,2,3} with {3,2,1} and win.\nIf you leave your opponent on 14, 15, or 16, they'll leave you on 17 and win.\nSo the aim is 21 (doh), and before that 17, 13, 9, 5, and 1. Anything else loses.\n\"\"\",\n         radio_texts = {\"You\",\"Computer\",\"Random\"},\n         button_text = {\"one\",\"two\",\"three\",\"concede\",\"new game\",\"quit\"}\ninteger total = 0\n\ninclude pGUI.e\nIhandle dlg, vbox, frame, radios, playstate\nsequence radioset, buttons\n\nfunction show_help()\n    IupMessage(title,help_text)\n    return IUP_IGNORE -- (don't open browser help!)\nend function\n\nfunction play(integer n)\n    if n!=0 then\n        if n=6 then return IUP_CLOSE end if\n        string title\n        if n>3 then\n            -- concede or new_game\n            total = 0\n            title = iff(n=4?\"(conceded) \":\"\")\n            title &= \"Total is 0\"\n            Ihandle r = IupGetAttributePtr(radios,\"VALUE_HANDLE\")\n            n = find(r,radioset)\n            if n=2 or (n=3 and rand(2)=1) then\n                title &= \",\" -- trigger a computer move\n            end if\n            IupSetInt(buttons[1..3],\"ACTIVE\",true)\n        else\n            -- n = 1..3\n            title = sprintf(\"Total is %d\",total)\n            if total=21      -- (from key_cb)\n            or total+n>21 then -- (invalid)\n                return IUP_IGNORE\n            end if\n            total += n\n            title &= sprintf(\", you play %d (-> %d),\",{n,total})\n            if total=21 then title &= \" you win\" end if\n        end if\n        if find(',',title) and total!=21 then\n            -- computer move\n            sequence moves = {1,rand(3),3,2}\n            n = moves[mod(total,4)+1]\n            total += n\n            title &= sprintf(\" computer plays %d (-> %d)\",{n,total})\n            if total=21 then\n                title &= \", computer wins\"\n            elsif mod(total,4)=1 then\n                title &= \", (you've already lost)\"\n            end if\n        end if      \n        if total=21 then\n            title &= \" GAME OVER\"\n            IupSetInt(buttons[1..4],\"ACTIVE\",false)\n        else\n            if total>18 then\n                IupSetInt(buttons[22-total..3],\"ACTIVE\",false)\n            end if\n            IupSetInt(buttons[4],\"ACTIVE\",total!=0)\n        end if      \n        IupSetFocus(dlg) -- (stops inactive button beeping)\n        IupSetStrAttribute(playstate,\"TITLE\",title)\n    end if\n    return IUP_IGNORE\nend function\n\nfunction button_cb(Ihandle ih)\n    string title = IupGetAttribute(ih,\"TITLE\")\n    return play(find(title,button_text))\nend function\nconstant cb_button = Icallback(\"button_cb\")\n\nfunction key_cb(Ihandle /*dlg*/, atom c)\n    if c=K_ESC then return IUP_CLOSE end if -- (standard practice for me)\n    if c=K_F5 then return IUP_DEFAULT end if -- (let browser reload work)\n    if c=K_F1 then return show_help() end if\n    return play(find(upper(c),\"123CNQ\"))\nend function\n\nIupOpen()\nplaystate = IupLabel(\"\",\"EXPAND=HORIZONTAL, PADDING=10x10\")\nradioset = apply(true,IupToggle,{radio_texts,{\"RIGHTBUTTON=YES, CANFOCUS=NO\"}})\nbuttons = apply(true,IupButton,{button_text,cb_button,{\"PADDING=5x5\"}})\nradios = IupRadio(IupHbox(radioset,\"GAP=45\"))\nframe = IupHbox({IupLabel(`First Player:`),radios},\"NORMALIZESIZE=VERTICAL\")\nvbox = IupVbox({frame,playstate,IupHbox(buttons,\"GAP=10\")},\"MARGIN=20x10\")\ndlg = IupDialog(vbox,`TITLE=\"%s\", MINSIZE=540x200`,{title})\nIupShow(dlg)\nIupSetCallback({dlg,buttons},\"KEY_CB\",Icallback(\"key_cb\"))\nIupSetAttributeHandle(NULL,\"PARENTDIALOG\",dlg)\n{} = play(find(\"new game\",button_text))\nif platform()!=JS then\n    IupMainLoop()\n    IupClose()\nend if\n",
        "safe": true
    },
    {
        "filename": "21_game_63.txt",
        "content": "<!DOCTYPE html>\n<html lang=\"en\">\n\n<head>\n    <meta charset=\"UTF-8\">\n    <meta name=\"keywords\"    content=\"Game 21\">\n    <meta name=\"description\" content=\"\n      21 is a two player game, the game is played by choosing a number\n      (1, 2, or 3) to be added to the running total. The game is won by\n      the player whose chosen number causes the running total to reach\n      exactly 21. The running total starts at zero.\n    \">\n    <!--DCMI metadata (Dublin Core Metadata Initiative)-->\n    <meta name=\"dc.publisher\" content=\"Rosseta Code\">\n    <meta name=\"dc.date\"      content=\"2020-07-31\">\n    <meta name=\"dc.created\"   content=\"2020-07-31\">\n    <meta name=\"dc.modified\"  content=\"2020-08-01\">\n    <title>\n        21 Game\n    </title>\n    <!-- Remove the line below in the final/production version. -->\n    <meta http-equiv=\"cache-control\" content=\"no-cache\">\n\n    <style>\n      .ui div   { width: 50%; display: inline-flex; justify-content: flex-end; }\n      div.total { margin-bottom: 1ch; }\n      label     { padding-right: 1ch; }\n      button + button { margin-left: 1em; }\n    </style>\n</head>\n\n<body>\n\n  <h1>\n    21 Game in PHP 7\n  </h1>\n\n  <p>\n    21 is a two player game, the game is played by choosing a number\n    (1, 2, or 3) to be added to the running total. The game is won by\n    the player whose chosen number causes the running total to reach\n    exactly 21. The running total starts at zero.\n  </p>\n\n\n  <?php\n\n    const GOAL = 21;\n    const PLAYERS = array('AI', 'human');\n\n    function best_move($n)\n    {\n      for ($i = 1; $i <= 3; $i++)\n        if ($n + $i == GOAL)\n          return $i;\n      for ($i = 1; $i <= 3; $i++)\n        if (($n + $i - 1) % 4 == 0)\n          return $i;\n      return 1;\n    }\n\n    if (isset($_GET['reset']) || !isset($_GET['total']))\n    {\n      $first = PLAYERS[rand(0, 1)];\n      $total = 0;\n      $human = 0;\n      $ai = 0;\n      $message = '';\n      if ($first == 'AI')\n      {\n        $move = best_move($total);\n        $ai = $move;\n        $total = $total + $move;\n      }\n    }\n    else\n    {\n      $first   = $_GET['first'];\n      $total   = $_GET['total'];\n      $human   = $_GET['human'];\n      $ai      = $_GET['ai'];\n      $message = $_GET['message'];\n    }\n\n    if (isset($_GET['move']))\n    {\n      $move = (int)$_GET['move'];\n      $human = $move;\n      $total = $total + $move;\n      if ($total == GOAL)\n        $message = 'The winner is human.';\n      else\n      {\n        $move = best_move($total);\n        $ai = $move;\n        $total = $total + $move;\n        if ($total == GOAL)\n          $message = 'The winner is AI.';\n      }\n    }\n\n    $state = array();\n    for ($i = 1; $i <= 3; $i++)\n      $state[$i] = $total + $i > GOAL ? 'disabled' : '';\n\n    echo <<< END\n      <p>\n        The first player is $first.\n        Use buttons to play.\n      </p>\n      <form class=\"ui\">\n        <div>\n          <input type='hidden' id='first' name='first' value='$first'>\n          <input type='hidden' name='message' value='$message'>\n        </div>\n        <div class='total'>\n          <label for='human'>human last choice:</label>\n          <input type='text' name='human' readonly value='$human'>\n        </div>\n        <div class='total'>\n          <label for='AI'>AI last choice:</label>\n          <input type='text' name='ai' readonly value='$ai'>\n        </div>\n        <div class='total'>\n          <label for='runningTotalText'>running total:</label>\n          <input type='text' name='total' readonly value='$total'>\n        </div>\n        <div class='buttons'>\n          <button type='submit' name='move' value='1' {$state[1]}> one   </button>\n          <button type='submit' name='move' value='2' {$state[2]}> two   </button>\n          <button type='submit' name='move' value='3' {$state[3]}> three </button>\n          <button type='submit' name='reset' value='reset'> reset </button>\n        </div>\n      </form>\n      <p>\n        $message\n      </p>\n    END\n  ?>\n\n</body>\n",
        "safe": true
    },
    {
        "filename": "21_game_64.txt",
        "content": "import util.\n\nmain =>\n    N = 0,\n    Level = prompt(\"Level of play (1=dumb, 3=smart)\"),\n    Algo = choosewisely,\n    if Level == \"1\" then\n        Algo\u00a0:= choosefoolishly\n    elseif Level == \"2\" then\n        Algo\u00a0:= choosesemiwisely\n    elseif Level\u00a0!= \"3\" then\n        println(\"Bad choice syntax--default to smart choice\")\n    end,\n    Whofirst = prompt(\"Does computer go first? (y or n)\"),\n    if Whofirst[1] == 'y' || Whofirst[1] == 'Y' then\n        N\u00a0:= apply(Algo, N)\n    end,\n    while (N < 21)\n        N\u00a0:= playermove(N),\n        if N == 21 then\n            println(\"Player wins! Game over, gg!\"),\n            halt\n        end,\n        N\u00a0:= apply(Algo,N)\n    end.\n \ntrytowin(N) =>\n    if 21 - N < 4 then \n        printf(\"Computer chooses %w and wins. GG!\\n\", 21 - N),\n        halt\n    end.\n\nchoosewisely(N) = NextN =>\n    trytowin(N),\n    Targets = [1, 5, 9, 13, 17, 21],\n    once ((member(Target, Targets), Target > N)),\n    Bestmove = Target - N,\n    if Bestmove > 3 then\n        printf(\"Looks like I could lose. Choosing a 1, total now %w.\\n\", N + 1),\n        NextN = N+1\n    else \n        printf(\"On a roll, choosing a %w, total now %w.\\n\", Bestmove, N + Bestmove),\n        NextN = N + Bestmove\n    end.\n \nchoosefoolishly(N) = NextN =>\n    trytowin(N),\n    Move = random() mod 3 + 1,\n    printf(\"Here goes, choosing %w, total now %w.\", Move, N+Move),\n    NextN = N+Move.\n \nchoosesemiwisely(N) = NextN =>\n    trytowin(N),\n    if frand() > 0.75 then\n        NextN = choosefoolishly(N)\n    else\n        NextN = choosewisely(N)\n    end.\n \nprompt(S) = Input =>\n    printf(S ++ \": => \"),\n    Input = strip(read_line()).\n \nplayermove(N) = NextN =>\n    Rang = cond(N > 19, \"1 is all\", cond(N > 18, \"1 or 2\", \"1, 2 or 3\")),\n    Prompt = to_fstring(\"Your choice (%s), 0 to exit\", Rang),\n    Nstr = prompt(Prompt),\n    if Nstr == \"0\" then\n        halt\n    elseif Nstr == \"1\" then\n        NextN = N+1\n    elseif Nstr == \"2\" && N < 20 then\n        NextN = N + 2\n    elseif Nstr == \"3\" && N < 19 then\n        NextN = N + 3\n    else\n        NextN = playermove(N)\n    end.",
        "safe": true
    },
    {
        "filename": "21_game_65.txt",
        "content": "from random import randint\ndef start():\n\tgame_count=0\n\tprint(\"Enter q to quit at any time.\\nThe computer will choose first.\\nRunning total is now {}\".format(game_count))\n\troundno=1\n\twhile game_count<21:\n\t\tprint(\"\\nROUND {}: \\n\".format(roundno))\n\t\tt = select_count(game_count)\n\t\tgame_count = game_count+t\n\t\tprint(\"Running total is now {}\\n\".format(game_count))\n\t\tif game_count>=21:\n\t\t\tprint(\"So, commiserations, the computer has won!\")\n\t\t\treturn 0\n\t\tt = request_count()\n\t\tif not t:\n\t\t\tprint('OK,quitting the game')\n\t\t\treturn -1\n\t\tgame_count = game_count+t\n\t\tprint(\"Running total is now {}\\n\".format(game_count))\n\t\tif game_count>=21:\n\t\t\tprint(\"So, congratulations, you've won!\")\n\t\t\treturn 1\n\t\troundno+=1\n\ndef select_count(game_count):\n\t'''selects a random number if the game_count is less than 18. otherwise chooses the winning number'''\n\tif game_count<18:\n\t\tt= randint(1,3)\n\telse:\n\t\tt = 21-game_count\n\tprint(\"The computer chooses {}\".format(t))\n\treturn t\n\ndef request_count():\n\t'''request user input between 1,2 and 3. It will continue till either quit(q) or one of those numbers is requested.'''\n\tt=\"\"\n\twhile True:\n\t\ttry:\n\t\t\tt = raw_input('Your choice 1 to 3\u00a0:')\n\t\t\tif int(t) in [1,2,3]:\n\t\t\t\treturn int(t)\n\t\t\telse:\n\t\t\t\tprint(\"Out of range, try again\")\n\t\texcept:\n\t\t\tif t==\"q\":\n\t\t\t\treturn None\n\t\t\telse:\n\t\t\t\tprint(\"Invalid Entry, try again\")\n\nc=0\nm=0\nr=True\nwhile r:\n\to = start()\n\tif o==-1:\n\t\tbreak\n\telse:\n\t\tc+=1 if o==0 else 0\n\t\tm+=1 if o==1 else 0\n\tprint(\"Computer wins {0} game, human wins {1} games\".format(c,m))\n\tt = raw_input(\"Another game?(press y to continue):\")\n\tr = (t==\"y\")\n",
        "safe": true
    },
    {
        "filename": "21_game_66.txt",
        "content": "Enter q to quit at any time.\nThe computer will choose first.\nRunning total is now 0\n\nROUND 1: \n\nThe computer chooses 1\nRunning total is now 1\n\nYour choice 1 to 3 :4\nOut of range, try again\nYour choice 1 to 3 :w\nInvalid Entry, try again\nYour choice 1 to 3 :3\nRunning total is now 4\n\n\nROUND 2: \n\nThe computer chooses 1\nRunning total is now 5\n\nYour choice 1 to 3 :2\nRunning total is now 7\n\n\nROUND 3: \n\nThe computer chooses 3\nRunning total is now 10\n\nYour choice 1 to 3 :3\nRunning total is now 13\n\n\nROUND 4: \n\nThe computer chooses 1\nRunning total is now 14\n\nYour choice 1 to 3 :2\nRunning total is now 16\n\n\nROUND 5: \n\nThe computer chooses 1\nRunning total is now 17\n\nYour choice 1 to 3 :1\nRunning total is now 18\n\n\nROUND 6: \n\nThe computer chooses 3\nRunning total is now 21\n\nSo, commiserations, the computer has won!\nComputer wins 1 game, human wins 0 games\nAnother game?(press y to continue):y\nEnter q to quit at any time.\nThe computer will choose first.\nRunning total is now 0\n\nROUND 1: \n\nThe computer chooses 1\nRunning total is now 1\n\nYour choice 1 to 3 :3\nRunning total is now 4\n\n\nROUND 2: \n\nThe computer chooses 3\nRunning total is now 7\n\nYour choice 1 to 3 :3\nRunning total is now 10\n\n\nROUND 3: \n\nThe computer chooses 3\nRunning total is now 13\n\nYour choice 1 to 3 :5\nOut of range, try again\nYour choice 1 to 3 :3\nRunning total is now 16\n\n\nROUND 4: \n\nThe computer chooses 2\nRunning total is now 18\n\nYour choice 1 to 3 :3\nRunning total is now 21\n\nSo, congratulations, you've won!\nComputer wins 1 game, human wins 1 games\nAnother game?(press y to continue):y\nEnter q to quit at any time.\nThe computer will choose first.\nRunning total is now 0\n\nROUND 1: \n\nThe computer chooses 3\nRunning total is now 3\n\nYour choice 1 to 3 :4\nOut of range, try again\nYour choice 1 to 3 :3\nRunning total is now 6\n\n\nROUND 2: \n\nThe computer chooses 3\nRunning total is now 9\n\nYour choice 1 to 3 :q\nOK,quitting the game\n",
        "safe": true
    },
    {
        "filename": "21_game_67.txt",
        "content": "''' Python 3.6.5 code using Tkinter graphical user interface.\n    Starting player chosen randomly. ''' \nfrom tkinter import *\nfrom tkinter import messagebox\nimport random\n\n# ************************************************\n\nclass Game:\n    def __init__(self, gw):\n        self.window = gw\n        self.won = 0\n        self.lost = 0\n        self.score = 0\n        self.puter_turn = None\n        self.var123 = IntVar()\n        self.varsub = IntVar()\n\n        # top frame:\n        self.top_fr = Frame(gw,\n                            width=600,\n                            height=100,\n                            bg='dodger blue')\n        self.top_fr.pack(fill=X)\n\n        self.hdg = Label(self.top_fr,\n                         text='  21 Game  ',\n                         font='arial 22 bold',\n                         fg='navy',\n                         bg='lemon chiffon')\n        self.hdg.place(relx=0.5, rely=0.5,\n                       anchor=CENTER)\n\n        self.play_btn = Button(self.top_fr,\n                               text='Play\\nGame',\n                               bd=5,\n                               bg='navy',\n                               fg='lemon chiffon',\n                               font='arial 12 bold',\n                               command=self.play_game)\n        self.play_btn.place(relx=0.92, rely=0.5,\n                            anchor=E)\n\n        self.quit_btn = Button(self.top_fr,\n                               text='Quit\\nGame',\n                               bd=5,\n                               bg='navy',\n                               fg='lemon chiffon',\n                               font='arial 12 bold',\n                               command=self.quit_game)\n        self.quit_btn.place(relx=0.07, rely=0.5,\n                            anchor=W)\n\n        # bottom frame:\n        self.btm_fr = Frame(gw,\n                            width=600,\n                            height=500,\n                            bg='lemon chiffon')\n        self.btm_fr.pack(fill=X)\n\n        self.msg = Label(self.btm_fr,\n                         text=\"(Click 'Play' or 'Quit')\",\n                         font='arial 16 bold',\n                         fg='navy',\n                         bg='lemon chiffon')\n        self.msg.place(relx=0.5, rely=0.1,\n                       anchor=CENTER)\n\n        self.hdg = Label(self.btm_fr,\n                         text=\"Scoreboard\",\n                         font='arial 16 bold',\n                         fg='navy',\n                         bg='lemon chiffon')\n        self.hdg.place(relx=0.5, rely=0.2,\n                       anchor=CENTER)\n\n        self.score_msg = Label(self.btm_fr,\n                               text=\"0\",\n                               font='arial 16 bold',\n                               fg='navy',\n                               bg='dodger blue',\n                               width=8)\n        \n        self.score_msg.place(relx=0.5, rely=0.27,\n                             anchor=CENTER)\n\n        self.ch_fr = LabelFrame(self.btm_fr,\n                                text='Choose a number',\n                                bg='dodger blue',\n                                fg='navy',\n                                bd=8,\n                                relief=RIDGE,\n                                font='arial 16 bold')\n        self.ch_fr.place(relx=0.5, rely=0.5,\n                         anchor=CENTER)\n\n        self.radio1 = Radiobutton(self.ch_fr,\n                                  text='1',\n                                  state='disabled',\n                                  font='arial 16 bold',\n                                  fg='navy',\n                                  bg='dodger blue',\n                                  variable=self.var123,\n                                  value=1)\n        self.radio1.pack()\n\n        self.radio2 = Radiobutton(self.ch_fr,\n                                  text='2',\n                                  state='disabled',\n                                  font='arial 16 bold',\n                                  fg='navy', \n                                  bg='dodger blue',\n                                  variable=self.var123,\n                                  value=2)\n        self.radio2.pack()\n\n        self.radio3 = Radiobutton(self.ch_fr,\n                                  text='3',\n                                  state='disabled',\n                                  font='arial 16 bold ',\n                                  fg='navy', \n                                  bg='dodger blue',\n                                  variable=self.var123,\n                                  value=3)\n        self.radio3.pack()\n\n        self.submit_btn = Button(self.btm_fr,\n                                 text='SUBMIT',\n                                 state='disabled',\n                                 bd=5,\n                                 bg='navy',\n                                 fg='lemon chiffon',\n                                 font='arial 12 bold',\n                                 command=self.submit)\n        self.submit_btn.place(relx=0.5, rely=0.75,\n                              anchor=CENTER)\n\n        self.won_lbl = Label(self.btm_fr,\n                             text=\"Won: 0\",\n                             font='arial 16 bold',\n                             fg='navy',\n                             bg='lemon chiffon')\n        self.won_lbl.place(relx=0.85, rely=0.88,\n                           anchor=W)\n\n        self.lost_lbl = Label(self.btm_fr,\n                              text=\"Lost: 0\",\n                              font='arial 16 bold',\n                              fg='navy',\n                              bg='lemon chiffon')\n        self.lost_lbl.place(relx=0.85, rely=0.93,\n                            anchor=W)\n\n    # play one game:    \n    def play_game(self):\n        self.play_btn.config(state='disabled')\n        # pick who goes first randomly:\n        self.puter_turn = random.choice([True, False])\n        self.score = 0\n        self.score_msg.config(text=self.score)\n        if not self.puter_turn:\n            m = 'your turn'\n            self.msg.config(text=m)\n        # alternate turns until 21 is reached:\n        while self.score != 21:\n            if self.puter_turn:\n                self.puter_plays()\n            else:\n                self.user_plays()\n            self.puter_turn = not self.puter_turn\n        self.play_btn.config(state='normal')\n        return\n\n    # computer picks a number:\n    def puter_plays(self):\n        if self.score == 20:\n            x = 1\n        elif self.score == 19:\n                x = random.choice([1, 2])\n        else:\n            x = random.choice([1, 2, 3])\n        self.score += x\n        self.score_msg.config(text=self.score)\n        if self.score == 21:\n            m = 'Computer won!'\n            self.lost += 1\n            self.lost_lbl.config(text='Lost: ' + str(self.lost))\n        else:\n            m = 'Computer chose ' + str(x) + ', your turn'\n        self.msg.config(text=m)\n        return\n\n    # user picks a number:\n    def user_plays(self):\n        self.set_user_state('normal')\n        while True:\n            # wait for submit button to be pressed:\n            self.submit_btn.wait_variable(self.varsub)\n            x = self.var123.get()\n            if x + self.score > 21:\n                m = 'Score cannot exceed 21, try again'\n                messagebox.showerror('Error', m)\n            elif x not in (1,2,3):\n                m = 'No selection made'\n                messagebox.showerror('Error', m)\n            else:\n                break\n        self.score += x\n        if self.score == 21:\n            m = 'You won!'\n            self.msg.config(text=m)\n            self.score_msg.config(text=self.score)\n            self.won += 1\n            self.won_lbl.config(text='Won: ' + str(self.won))\n        # reset and disable radio buttons:   \n        self.var123.set(0)  \n        self.set_user_state('disabled')                     \n        return\n\n    # set radio buttons to 'disabled' or 'normal':\n    def set_user_state(self, state):\n        self.radio1.config(state=state)\n        self.radio2.config(state=state)\n        self.radio3.config(state=state)\n        self.submit_btn.config(state=state)\n        return\n        \n                            \n    def quit_game(self):\n        self.window.destroy()\n\n    # indicate that submit button was pressed:\n    def submit(self):\n        self.varsub.set(0)\n\n# ************************************************\n\nroot = Tk()\nroot.title('21 Game')\nroot.geometry('600x600+100+50')\nroot.resizable(False, False)\ng = Game(root)\nroot.mainloop()\n",
        "safe": true
    },
    {
        "filename": "21_game_68.txt",
        "content": "  [ say\n    \"Who goes first: Computer, Player\"\n    say \" or Random?\"  cr\n    [ $ \"Enter C, P or R: \" input\n      dup size 1\u00a0!= iff drop again\n      0 peek\n      dup char C = iff [ drop 0 ] done\n      dup char P = iff [ drop 1 ] done\n      char R = iff [ 2 random ] done\n       again ]\n    cr\n    dup iff [ say \"You go first.\" ]\n    else [ say \"I will go first.\" ]\n    cr ]                                  is chooseplayer (   --> n   )\n\n                                  forward is player       ( n --> n x )\n\n  [ [ dup 17 > iff 1 done\n      4 over 4 mod\n      dup 0 = if [ drop 3 ]\n      - ]\n    dup say \"Computer chooses \" echo\n    say \".\" cr\n    + ' player ]                          is computer     ( n --> n x )\n\n  [ say \"Choose 1 2 or 3 (running \"\n    $ \"total must not exceed 21, Q to quit): \" input\n    dup $ \"Q\" = iff [ drop 21 999 ] done\n    trim reverse trim reverse\n    $->n not iff drop again\n    dup 1 4 within not iff drop again\n    2dup + 21 > iff drop again\n    + ' computer ]                  resolves player       ( n --> n x )\n\n  [ say \"The player who makes 21 loses.\" cr\n    0 chooseplayer\n    iff [ ' player ] else [ ' computer ]\n    [ say \"Running total is \"\n      over echo say \".\" cr cr\n      do\n      over 21 = until ]\n    cr\n    dup 999 = iff\n      [ drop 2drop say \"Quitter!\" ] done\n    ' computer = iff\n        [ say \"The computer won!\" ]\n    else [ say \"You won! Well done!\" ]\n    drop ]                                 is play        (   -->     )",
        "safe": true
    },
    {
        "filename": "21_game_69.txt",
        "content": "/O> play\n... \nThe player who makes 21 loses.\nWho goes first: Computer, Player or Random?\nEnter C, P or R: C\n\nI will go first.\nRunning total is 0.\n\nComputer chooses 1.\nRunning total is 1.\n\nChoose 1 2 or 3 (running total must not exceed 21, Q to quit): Q\n\nQuitter!\nStack empty.\n\n/O> play\n... \nThe player who makes 21 loses.\nWho goes first: Computer, Player or Random?\nEnter C, P or R: R\n\nYou go first.\nRunning total is 0.\n\nChoose 1 2 or 3 (running total must not exceed 21, Q to quit): 2\nRunning total is 2.\n\nComputer chooses 2.\nRunning total is 4.\n\nChoose 1 2 or 3 (running total must not exceed 21, Q to quit): 3\nRunning total is 7.\n\nComputer chooses 1.\nRunning total is 8.\n\nChoose 1 2 or 3 (running total must not exceed 21, Q to quit): 1\nRunning total is 9.\n\nComputer chooses 3.\nRunning total is 12.\n\nChoose 1 2 or 3 (running total must not exceed 21, Q to quit): 4\nChoose 1 2 or 3 (running total must not exceed 21, Q to quit): 1\nRunning total is 13.\n\nComputer chooses 3.\nRunning total is 16.\n\nChoose 1 2 or 3 (running total must not exceed 21, Q to quit): 3\nRunning total is 19.\n\nComputer chooses 1.\nRunning total is 20.\n\nChoose 1 2 or 3 (running total must not exceed 21, Q to quit): 2\nChoose 1 2 or 3 (running total must not exceed 21, Q to quit): 1\n\nThe computer won!\nStack empty.\n\n/O> ",
        "safe": true
    },
    {
        "filename": "21_game_7.txt",
        "content": "print \"-----------------------------\"\nprint \" Welcome to 21 Game\"\nprint \"-----------------------------\"\n\nplayers: [\"A\" \"B\"]\ncurrentPlayer: sample players\nnextPlayer: first players -- currentPlayer\nrunningTotal: new 0\nnum: 0\n\ngetNum: function [][\n    result: strip input \"Enter a number (1,2,3) / x to exit: \"\n    if result=\"x\" -> exit\n    return result\n]\n\nloop.forever @[currentPlayer nextPlayer] 'plays [\n    print [\"Running total:\" runningTotal]\n    print [\"Player\" plays \"turn\"]\n\n    num: getNum\n\n    while [or? [not? numeric? num][not? contains? 1..3 to :integer num]][\n        num: getNum\n    ]\n\n    runningTotal: runningTotal + to :integer num\n\n    print \"\"\n\n    if runningTotal=21 [\n        print [\"Running total is 21. Player\" plays \"won!\"]\n        exit\n    ]\n]\n",
        "safe": true
    },
    {
        "filename": "21_game_70.txt",
        "content": "game21<-function(first = c(\"player\",\"ai\",\"random\"),sleep=.5){\n  state = 0\n  finished = F\n  turn = 1\n  if(length(first)==1 && startsWith(tolower(first),\"r\")){\n    first = rbinom(1,1,.5)\n  }else{\n    first = (length(first)>1 || startsWith(tolower(first),\"p\"))\n  }\n  while(!finished){\n    if(turn>1 || first){\n      cat(\"The total is now\",state,\"\\n\");Sys.sleep(sleep)\n      while(T){\n        player.move = readline(prompt = \"Enter move: \")\n        if((player.move==\"1\"||player.move==\"2\"||player.move==\"3\") && state+as.numeric(player.move)<=21){\n          player.move = as.numeric(player.move)\n          state = state + player.move\n          break\n        }else if(tolower(player.move)==\"exit\"|tolower(player.move)==\"quit\"|tolower(player.move)==\"end\"){\n          cat(\"Goodbye.\\n\")\n          finished = T\n          break\n        }else{\n          cat(\"Error: invaid entry.\\n\")\n        }\n      }\n    }\n    if(state == 21){\n      cat(\"You win!\\n\")\n      finished = T\n    }\n    if(!finished){\n      cat(\"The total is now\",state,\"\\n\");Sys.sleep(sleep)\n      while(T){\n        ai.move = sample(1:3,1)\n        if(state+ai.move<=21){\n          break\n        }\n      }\n      state = state + ai.move\n      cat(\"The AI chooses\",ai.move,\"\\n\");Sys.sleep(sleep)\n      if(state == 21){\n        cat(\"The AI wins!\\n\")\n        finished = T\n      }\n    }\n    turn = turn + 1\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "21_game_71.txt",
        "content": "game21()\n",
        "safe": true
    },
    {
        "filename": "21_game_72.txt",
        "content": "The total is now 0 \nEnter move: 3\nThe total is now 3 \nThe AI chooses 2 \nThe total is now 5 \nEnter move: 3\nThe total is now 8 \nThe AI chooses 3 \nThe total is now 11 \nEnter move: 3\nThe total is now 14 \nThe AI chooses 2 \nThe total is now 16 \nEnter move: 1\nThe total is now 17 \nThe AI chooses 3 \nThe total is now 20 \nEnter move: 1\nThe total is now 21 \nYou win!",
        "safe": true
    },
    {
        "filename": "21_game_73.txt",
        "content": "game21(first = \"ai\")\n",
        "safe": true
    },
    {
        "filename": "21_game_74.txt",
        "content": "The total is now 0 \nThe AI chooses 2 \nThe total is now 2\nEnter move: quit\nGoodbye.\n",
        "safe": true
    },
    {
        "filename": "21_game_75.txt",
        "content": "#lang racket\n\n(define limit 21)\n(define max-resp 3)\n\n(define (get-resp)\n  (let loop ()\n    (match (read-line)\n      [(app (conjoin string? string->number) n)\n       #:when (and (exact-integer? n) (<= 1 n max-resp))\n       n]\n      [\"q\" (exit)]\n      [n (printf \"~a is not in range 1 and ~a\\n\" n max-resp)\n         (loop)])))\n\n(define (win human?) (printf \"~a wins\\n\" (if human? \"Human\" \"Computer\")))\n\n(printf \"The ~a game. Each player chooses to add a number\nin range 1 and ~a to a running total.\nThe player whose turn it is when the total reaches exactly ~a wins.\nEnter q to quit.\\n\\n\" limit max-resp limit)\n\n(let loop ([total 0] [human-turn? (= 0 (random 2))])\n  (define new-total\n    (+ total\n       (cond\n         [human-turn? (printf \"Running total is: ~a\\n\" total)\n                      (printf \"Your turn:\\n\")\n                      (get-resp)]\n         [else (define resp (random 1 (add1 max-resp)))\n               (printf \"Computer plays: ~a\\n\" resp)\n               resp])))\n  (cond\n    [(= new-total limit) (win human-turn?)]\n    [(> new-total limit) (win (not human-turn?))]\n    [else (loop new-total (not human-turn?))]))\n",
        "safe": true
    },
    {
        "filename": "21_game_76.txt",
        "content": "The 21 game. Each player chooses to add an integer\nin range 1 and 3 to a running total.\nThe player whose turn it is when the total reaches exactly 21 wins.\nEnter q to quit.\n\nRunning total is: 0\nYour turn:\n1\nComputer plays: 3\nRunning total is: 4\nYour turn:\nfoo\nfoo is not an integer in range 1 and 3\nYour turn:\nbar\nbar is not an integer in range 1 and 3\nYour turn:\n3\nComputer plays: 1\nRunning total is: 8\nYour turn:\n1\nComputer plays: 1\nRunning total is: 10\nYour turn:\n1\nComputer plays: 2\nRunning total is: 13\nYour turn:\n1\nComputer plays: 3\nRunning total is: 17\nYour turn:\n1\nComputer plays: 2\nRunning total is: 20\nYour turn:\n1\nHuman wins\n",
        "safe": true
    },
    {
        "filename": "21_game_77.txt",
        "content": "say qq :to 'HERE';\n    The 21 game. Each player chooses to add 1, 2, or 3 to a running total.\n    The player whose turn it is when the total reaches 21 wins. Enter q to quit.\n    HERE\n\nmy $total = 0;\nloop {\n    say \"Running total is: $total\";\n    my ($me,$comp);\n    loop {\n        $me = prompt 'What number do you play> ';\n        last if $me ~~ /^<[123]>$/;\n        insult $me;\n    }\n    $total += $me;\n    win('Human') if $total >= 21;\n    say \"Computer plays: { $comp = (1,2,3).roll }\\n\";\n    $total += $comp;\n    win('Computer') if $total >= 21;\n}\n\nsub win ($player) {\n    say \"$player wins.\";\n    exit;\n}\n\nsub insult ($g) {\n    exit if $g eq 'q';\n    print ('Yo mama,', 'Jeez,', 'Ummmm,', 'Grow up,', 'Did you even READ the instructions?').roll;\n    say \" $g is not an integer between 1 & 3...\"\n}\n",
        "safe": true
    },
    {
        "filename": "21_game_78.txt",
        "content": "The 21 game. Each player chooses to add 1, 2, or 3 to a running total.\nThe player whose turn it is when the total reaches 21 wins. Enter q to quit.\n\nRunning total is: 0\nWhat number do you play> 5\nDid you even READ the instructions? 5 is not an integer between 1 & 3...\nWhat number do you play> g\nYo mama, g is not an integer between 1 & 3...\nWhat number do you play> 12\nJeez, 12 is not an integer between 1 & 3...\nWhat number do you play> 3\nComputer plays: 2\n\nRunning total is: 5\nWhat number do you play> 3\nComputer plays: 3\n\nRunning total is: 11\nWhat number do you play> 1\nComputer plays: 1\n\nRunning total is: 13\nWhat number do you play> 3\nComputer plays: 2\n\nRunning total is: 18\nWhat number do you play> 3\nHuman wins.",
        "safe": true
    },
    {
        "filename": "21_game_79.txt",
        "content": "/*REXX program plays the  21  game with a human,  each player chooses 1, 2, or 3  which */\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 is added to the current sum, the first player to reach  21  exactly wins.*/\nsep= copies('\u2500', 8);  sep2= \" \"copies('\u2550', 8)\" \" /*construct an eye\u2500catching msg fences.*/\nsay sep  'Playing the  21  game.'                /*tell what's happening here at the zoo*/\n$=0;                       goal= 21              /*the sum [or running total]  (so far).*/\n    do j=1  while $<goal;  call g                /*obtain the user's number via a prompt*/\n    if x\\==0    then call tot x, 1               /*Not 0?   The user wants to go first. */\n    if $==goal  then leave                       /*the user won the game with the last #*/\n    call ?;     if y==.  then y= random(1, 3)    /*get computer's choice  or  a random #*/\n    say sep 'The computer chooses '     y     \" as its choice.\"         /*inform player.*/\n    call tot y, 0                                /*call subroutine to show the total.   */\n    end   /*j*/\nsay\nif who  then say sep  'Congratulations!   You have won the  21  game.'\n        else say sep  'The computer has won the  21  game.'\nexit 0                                           /*stick a fork in it,  we're all done. */\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\n?:   y=.;   do c=1  for 3  until y\\==.;  if (c+$) // 4 == 1  then y= c;    end;     return\nser: if bad  then return;  bad=1;  say;  say;  say sep '***error***' arg(1);  say;  return\ntot: arg q,who; $=$+q; say sep 'The game total is now' sep2 $ sep2; /*add; show $*/ return\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\ng: low = (j \\== 1)                               /*allow user to have computer go first.*/\n     do until \\bad;   bad= 0;     say            /*prompt 'til user gives a good number.*/\n     say sep  'Please enter a number from ' low \" \u2500\u2500\u2500\u25ba 3               (or Quit):\"\n     if j=1  then say sep '[A value of 0 (zero) means you want the computer to go first.]'\n     parse pull x _ . 1 ox;   upper x            /*obtain user's lowercase response(s). */\n     if   x=''             then call ser \"Nothing entered.\"\n     if _\\==''             then call ser \"Too many arguments entered: \"       ox\n     if abbrev('QUIT', x, 1)  then do;   say;      say sep  \"quitting.\";      exit 1;  end\n     if \\datatype(x, 'N')  then call ser \"Argument isn't numeric: \"           ox\n     if \\datatype(x, 'W')  then call ser \"Number isn't an integer: \"          ox\n     if x<0                then call ser \"Number can't be negative: \"          x\n     if x=0  &  j>1        then call ser \"Number can't be zero: \"              x\n     if x>3                then call ser \"Number is too large  (>3): \"         x\n     if bad                then iterate          /*Had an error? Then get another number*/\n     x= x/1; if $+x>goal   then call ser \"Number will cause the sum to exceed \" goal': ' x\n     end   /*until*/;           return\n",
        "safe": true
    },
    {
        "filename": "21_game_8.txt",
        "content": "-----------------------------\n Welcome to 21 Game\n-----------------------------\nRunning total: 0 \nPlayer B turn \nEnter a number (1,2,3) / x to exit: 1\n\nRunning total: 1 \nPlayer A turn \nEnter a number (1,2,3) / x to exit: 2\n\nRunning total: 3 \nPlayer B turn \nEnter a number (1,2,3) / x to exit: 1\n\nRunning total: 4 \nPlayer A turn \nEnter a number (1,2,3) / x to exit: 3\n\nRunning total: 7 \nPlayer B turn \nEnter a number (1,2,3) / x to exit: 4\nEnter a number (1,2,3) / x to exit: 2\n\nRunning total: 9 \nPlayer A turn \nEnter a number (1,2,3) / x to exit: 3\n\nRunning total: 12 \nPlayer B turn \nEnter a number (1,2,3) / x to exit: 1\n\nRunning total: 13 \nPlayer A turn \nEnter a number (1,2,3) / x to exit: 2\n\nRunning total: 15 \nPlayer B turn \nEnter a number (1,2,3) / x to exit: 3\n\nRunning total: 18 \nPlayer A turn \nEnter a number (1,2,3) / x to exit: 3\n\nRunning total is 21. Player A won!",
        "safe": true
    },
    {
        "filename": "21_game_80.txt",
        "content": "\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Playing the  21  game.\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a number from  0  \u2500\u2500\u2500\u25ba 3               (or Quit):\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 [A value of 0 (zero) means you want the computer to go first.]\n3                                                                         \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The game total is now  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550  3  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The computer chooses  2  as its choice.\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The game total is now  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550  5  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a number from  1  \u2500\u2500\u2500\u25ba 3               (or Quit):\n3                                                                         \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The game total is now  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550  8  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The computer chooses  1  as its choice.\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The game total is now  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550  9  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a number from  1  \u2500\u2500\u2500\u25ba 3               (or Quit):\n3                                                                         \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The game total is now  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550  12  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The computer chooses  1  as its choice.\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The game total is now  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550  13  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a number from  1  \u2500\u2500\u2500\u25ba 3               (or Quit):\n3                                                                         \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The game total is now  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550  16  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The computer chooses  1  as its choice.\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The game total is now  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550  17  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Please enter a number from  1  \u2500\u2500\u2500\u25ba 3               (or Quit):\n1                                                                          \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 user input\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The game total is now  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550  18  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The computer chooses  3  as its choice.\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The game total is now  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550  21  \u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\n\n\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 The computer has won the  21  game.\n",
        "safe": true
    },
    {
        "filename": "21_game_81.txt",
        "content": "# Project\u00a0: 21 Game\n\nload \"guilib.ring\"\n\nlimit = 21\nposold = 0\nbutton = list(limit)\nmynum = list(3)\nyournum = list(3)\n\nnew qapp \n        {\n        win1 = new qwidget() {\n                  setwindowtitle(\"21 Game\")\n                  setgeometry(100,100,1000,600)\n                  label1 = new qlabel(win1) {\n                              setgeometry(10,10,1000,600)\n                              settext(\"\")\n                  }\n\n                  label2 = new qlabel(win1) {\n                              setgeometry(240,50,120,40)\n                              setAlignment(Qt_AlignHCenter)\n                              setFont(new qFont(\"Verdana\",12,100,0))\n                              settext(\"my number:\")\n                  }\n\n                  label3 = new qlabel(win1) {\n                              setgeometry(640,50,120,40)\n                              setAlignment(Qt_AlignHCenter)\n                              setFont(new qFont(\"Verdana\",12,100,0))\n                              settext(\"your number:\")\n                  }\n\n                  for p = 1 to 3\n                       mynum[p] = new qpushbutton(win1) {\n                                          setgeometry(200+p*40,100,40,40)\n                                          setstylesheet(\"background-color:orange\")\n                                          settext(string(p))\n                                          setclickevent(\"choose(\" + string(p) + \",1)\")\n                                          }\n                   next\n\n                   for p = 1 to 3\n                        yournum[p] = new qpushbutton(win1) {\n                                             setgeometry(600+p*40,100,40,40)\n                                             setstylesheet(\"background-color:white\")\n                                             settext(string(p))\n                                             setclickevent(\"choose(\" + string(p) + \",2)\")\n                                             }\n                   next\n\n                   for n = 1 to limit\n                        button[n] = new qpushbutton(win1) {\n                                          setgeometry(40+n*40,190,40,40)\n                                          settext(string(n))\n                                          }\n                    next\n                    show()\n        }\n        exec()\n        }\n\nfunc choose(ch,ym)\n        pos = posold + ch\n        if pos > limit\n           msg = \"You must choose number from 1 to \" + string(limit - posold)\n           msgBox(msg)\n           for n = 1 to 3\n                mynum[n].setenabled(false)\n                yournum[n].setenabled(false)\n           next\n           return\n        ok\n        for n = posold+1 to pos\n             if ym = 1\n                button[n] { setstylesheet(\"background-color:orange\") }\n             else\n                button[n] { setstylesheet(\"background-color:white\") }\n             ok\n        next\n        posold = pos\n        if ym = 1\n           for n = 1 to 3\n                mynum[n].setenabled(false)\n                yournum[n].setenabled(true)\n           next\n         else\n           for n = 1 to 3\n                mynum[n].setenabled(true)\n                yournum[n].setenabled(false)\n           next\n         ok\n         if pos = 21\n            if ym = 1\n               msgBox(\"I won!\")\n            else\n               msgBox(\"You won!\")\n            ok\n         ok\n\nfunc msgBox(text) {\n\tm = new qMessageBox(win1) {\n\t       setWindowTitle(\"21 Game\")\n\t       setText(text)\n\t       show()\n\t       }\n        }",
        "safe": true
    },
    {
        "filename": "21_game_82.txt",
        "content": "# 21 Game - an example in Ruby for Rosetta Code.\n\nGOAL = 21\nMIN_MOVE = 1\nMAX_MOVE = 3\n\nDESCRIPTION = \"\n*** Welcome to the 21 Game! ***\n21 is a two player game.\nEach player chooses to add 1, 2 or 3 to a running total.\nThe player whose turn it is when the total reaches 21 will win the game.\nThe running total starts at zero.\n\nThe players start the game in turn.\nEnter q to quit at any time.\n\"\n\n#\n# Returns the best move to play.\n#\ndef best_move(total)\n  move = rand(1..3)\n  MIN_MOVE.upto(MAX_MOVE) do |i|\n    move = i if (total + i - 1) % (MAX_MOVE + 1) == 0\n  end\n  MIN_MOVE.upto(MAX_MOVE) do |i|\n    move = i if total + i == GOAL\n  end\n  move\nend\n\n#\n# Gets the move of the player.\n#\ndef get_move\n  print \"Your choice between #{MIN_MOVE} and #{MAX_MOVE}: \"\n  answer = gets\n  move = answer.to_i\n  until move.between?(MIN_MOVE, MAX_MOVE)\n    exit if answer.chomp == 'q'\n    print 'Invalid choice. Try again: '\n    answer = gets\n    move = answer.to_i\n  end\n  move\nend\n\n#\n# Asks the player to restart a game and returns the answer.\n#\ndef restart?\n  print 'Do you want to restart (y/n)? '\n  restart = gets.chomp\n  until ['y', 'n'].include?(restart)\n    print 'Your answer is not a valid choice. Try again: '\n    restart = gets.chomp\n  end\n  restart == 'y'\nend\n\n#\n# Run a game. The +player+ argument is the player that starts:\n# * 1 for human\n# * 0 for computer\n#\ndef game(player)\n  total = round = 0\n  while total < GOAL\n    round += 1\n    puts \"--- ROUND #{round} ---\\n\\n\"\n    player = (player + 1) % 2\n    if player == 0\n      move = best_move(total)\n      puts \"The computer chooses #{move}.\"\n    else\n      move = get_move\n    end\n    total += move\n    puts \"Running total is now #{total}.\\n\\n\"\n  end\n  if player == 0\n    puts 'Sorry, the computer has won!'\n    return false\n  end\n  puts 'Well done, you have won!'\n  true\nend\n\n# MAIN\nputs DESCRIPTION\nrun = true\ncomputer_wins = human_wins = 0\ngames_counter = player = 1\nwhile run\n  puts \"\\n=== START GAME #{games_counter} ===\"\n  player = (player + 1) % 2\n  if game(player)\n    human_wins += 1\n  else\n    computer_wins += 1\n  end\n  puts \"\\nComputer wins #{computer_wins} games, you wins #{human_wins} game.\"\n  games_counter += 1\n  run = restart?\nend\nputs 'Good bye!'\n",
        "safe": true
    },
    {
        "filename": "21_game_83.txt",
        "content": "use rand::Rng;\nuse std::io;\n\n#[derive(Clone)]\nenum PlayerType {\n    Human,\n    Computer,\n}\n\n#[derive(Clone)]\nstruct Player {\n    name: String,\n    wins: u32,  // holds wins\n    level: u32, // difficulty level of Computer\n    player_type: PlayerType, \n}\n\ntrait Choose {\n    fn choose(&self, game: &Game) -> u8;\n}\n\nimpl Player {\n    fn new(name: &str, player_type: PlayerType, level: u32) -> Player {\n        Player {\n            name: String::from(name),\n            wins: 0,\n            level,\n            player_type,\n        }\n    }\n    fn get_name(&self) -> &str {\n        &self.name[..]\n    }\n    fn get_level(&self) -> u32 {\n        self.level\n    }\n    fn add_win(&mut self) {\n        self.wins += 1\n    }\n    fn level_up(&mut self) {\n        self.level += 1\n    }\n}\n\nimpl Choose for Player {\n    fn choose(&self, game: &Game) -> u8 {\n        match self.player_type {\n            PlayerType::Human => loop {\n                let max_choice = game.max_choice();\n                match max_choice {\n                    1 => println!(\"Enter a number 1 to win (or quit):\"),\n                    _ => println!(\"Enter a number between 1 and {} (or quit):\", max_choice)\n                }\n                let mut guess = String::new();\n                io::stdin()\n                    .read_line(&mut guess)\n                    .expect(\"Failed to read line\");\n                if guess.trim() == \"quit\" {\n                    return 0\n                }\n                let guess: u8 = match guess.trim().parse() {\n                    Ok(num) if num >= 1 && num <= max_choice => num,\n                    Ok(_) => continue,\n                    Err(_) => continue,\n                };\n                return guess;\n            },\n            PlayerType::Computer => match self.level {\n                5 => match game.get_total() {\n                    total if total == 20 => 1,\n                    total if total == 19 => 2,\n                    total if total == 18 => 3,\n                    _ => 1,\n                },\n                4 => match game.get_total() {\n                    total if total == 20 => 1,\n                    total if total == 19 => 2,\n                    total if total == 18 => 3,\n                    _ => rand::thread_rng().gen_range(1, 3),\n                },\n                3 => match game.get_total() {\n                    total if total == 20 => 1,\n                    total if total == 19 => 2,\n                    total if total == 18 => 3,\n                    _ => rand::thread_rng().gen_range(1, 4),\n                },\n                2 => match game.get_total() {\n                    total if total == 20 => 1,\n                    total if total == 19 => 2,\n                    _ => rand::thread_rng().gen_range(1, 3),\n                },\n                1 => 1,\n                _ => match game.get_total() {\n                    total if total == 20 => 1,\n                    total if total == 19 => 2,\n                    total if total == 18 => 3,\n                    _ => match game.get_remaining() % 4 {\n                        0 => rand::thread_rng().gen_range(1, 4),\n                        _ => game.get_remaining() % 4,\n                    },\n                },\n            },\n        }\n    }\n}\n\nstruct Game {\n    players: Vec<Player>,\n    turn: u8,  \n    total: u8, \n    start: u8, // determines which player goes first\n}\n\nimpl Game {\n    fn init(players: &Vec<Player>) -> Game {\n        Game {\n            players: players.to_vec(),\n            turn: 1,\n            total: 0,\n            start: rand::thread_rng().gen_range(0, 2),\n        }\n    }\n    fn play(&mut self) -> &Player {\n        loop {\n            println!(\n                \"Total now {} (remaining: {})\",\n                self.get_total(),\n                self.get_remaining()\n            );\n            {\n                let player = self.whose_turn();\n                println!(\"Turn: {} ({} turn)\", self.get_turn(), player.get_name());\n                let choice = player.choose(&self);\n                if choice == 0 {\n                    self.next_turn();\n                    break; // quit\n                }\n                println!(\"{} choose {}\", player.get_name(), choice);\n                self.add_total(choice)\n            }\n            if self.get_total() >= 21 {\n                break;\n            }\n            println!(\"\");\n            self.next_turn();\n        }\n        self.whose_turn()\n    }\n    fn add_total(&mut self, choice: u8) {\n        self.total += choice;\n    }\n    fn next_turn(&mut self) {\n        self.turn += 1;\n    }\n    fn whose_turn(&self) -> &Player {\n        let index: usize = ((self.turn + self.start) % 2).into();\n        &self.players[index]\n    }\n    fn get_total(&self) -> u8 {\n        self.total\n    }\n    fn get_remaining(&self) -> u8 {\n        21 - self.total\n    }\n    fn max_choice(&self) -> u8 {\n        match self.get_remaining() {\n            1 => 1,\n            2 => 2,\n            _ => 3\n        }\n    }\n    fn get_turn(&self) -> u8 {\n        self.turn\n    }\n}\n\nfn main() {\n    let mut game_count = 0;\n    let mut players = vec![\n        Player::new(\"human\", PlayerType::Human, 0),\n        Player::new(\"computer\", PlayerType::Computer, 1),\n    ];\n    println!(\"21 Game\");\n    println!(\"Press enter key to start\");\n    {\n        let _ = io::stdin().read_line(&mut String::new());\n    }\n    loop {\n        game_count += 1;\n        let mut game = Game::init(&players);\n        let winner = game.play();\n        {\n            let mut index = 0;\n            while index < players.len() {\n                if players[index].get_name() == winner.get_name() {\n                    players[index].add_win();\n                }\n                index += 1\n            }\n        }\n        println!(\"\\n{} won game {}\\n\", winner.get_name(), game_count);\n        // limit game count\n        if game_count >= 10000 {\n            break;\n        }\n        // ask player if they want to keep on playing\n        println!(\"Press enter key to play again (or quit):\");\n        let mut reply = String::new();\n        io::stdin()\n            .read_line(&mut reply)\n            .expect(\"Failed to read line\");\n        if reply.trim() == \"quit\" {\n            break;\n        }\n        // level up computer\n        if winner.get_name() != \"computer\" {\n            println!(\"Computer leveling up ...\");\n            players[1].level_up();\n            println!(\"Computer now level {}!\", players[1].get_level());\n            println!(\"Beware!\\n\");\n        }\n    }\n    println!(\"player: {} win: {}\", players[0].get_name(), players[0].wins);\n    println!(\"player: {} win: {}\", players[1].get_name(), players[1].wins);\n}\n",
        "safe": true
    },
    {
        "filename": "21_game_84.txt",
        "content": "object Game21 {\n\n  import scala.collection.mutable.ListBuffer\n  import scala.util.Random\n\n  val N = 21 // the same game would also work for N other than 21...\n\n  val RND = new Random() // singular random number generator; add a seed number, if you want reproducibility\n\n  /** tuple: name and a play function: (rest: remaining number, last: value of opponent's last move) => new move\n    */\n  type Player = (String, (Int,Int) => Int)\n\n  // indeed, the following could also be written using a class and instances, I've choosen a\n  // more functional and math way (using tuples)...\n  val playerRandom:Player = (\"RandomRobot\", { (rest, last) =>\n    if (rest <= 3) rest\n    else 1 + RND.nextInt(3)\n  })\n  val playerBest:Player = (\"BestRobot\", { (rest, last) =>\n    val i = rest % 4\n    if (i > 0) i else 1 + RND.nextInt(3)\n  })\n  val playerHuman:Player = (\"YOU\", { (rest, last) =>\n    println(\"Rest: \"+rest)\n    println(\"Last: \"+last)\n    var in = \"\"\n    while (in!=\"1\" && in!=\"2\" && in!=\"3\") {\n      in = scala.io.StdIn.readLine(\"Your move (1,2,3,q)> \").trim\n      if (\"q\" == in)\n        throw new Exception(\"q => quit\")\n    }\n    in.toInt\n  })\n\n  /** Execute a whole game. NOTE that we're counting DOWN from N to 0!\n    * @param players\n    * @return list of all moves\n    */\n  def play(players:Seq[Player]):Seq[Int] = {\n    require(players.size == 2)\n    var last = -1\n    var rest = N\n    var p = 0 // player 0 always starts\n    val l = ListBuffer[Int]() // list of all moves\n    while (rest > 0) {\n      last = players(p)._2(rest,last)\n      require(1<=last && last<=3,\"Player must always play 1,2,3: \"+last)\n      l += last\n      rest -= last\n      p = 1 - p // other player's turn\n    }\n    l.toSeq\n  }\n\n  /** Evaluate a whole game.\n    * @param game list of moves of one game\n    * @param rest mainly for recursion\n    * @return evaluation, for each move a tuple: (rest, what was played, whether this player won in the end)\n    */\n  def evaluate(game:Seq[Int],rest:Int=N):Seq[(Int,Int,Boolean)] = {\n    if (game.size == 0) Seq()\n    else Seq((rest,game.head,game.size%2 == 1)) ++ evaluate(game.tail,rest - game.head)\n  }\n\n  def main(args: Array[String]): Unit = {\n    // here you can put whatever player combination you like\n    val players = Seq(playerRandom,playerRandom) // random robot vs random robot\n    //val players = Seq(playerRandom,playerBest) // random robot vs best robot\n    //val players = Seq(playerHuman,playerBest) // You vs best robot\n    var p0won = 0\n    val n = 1000 // number of games to play\n    var m = 0 // games actually played (a human player might quit before n)\n    try {\n      (1 to n).foreach { i =>\n        val g = play(players)\n        require(g.sum == N) // some validity checks\n        val e = evaluate(g)\n        require(e.size == g.size && e.last._3 && e(0)._3 != e(1)._3) // some validity checks\n        if (e(0)._3) p0won += 1\n        m += 1\n        println(i + \": \" + players(0)._1 + \" \" + (if (e(0)._3) \"won\" else \"lost\") + \" against \" + players(1)._1 + \". \" + g + \" => \" + e)\n      }\n    } catch {\n      case t:Throwable => println(t.getMessage)\n    }\n    println(\"Player0: \"+players(0)._1)\n    println(\"Player1: \"+players(1)._1)\n    println(f\"Player0 won ${p0won} times out of ${m}, or ${p0won * 100.0 / m}%%\")\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "21_game_85.txt",
        "content": "dim @p(4) \n\npush 1, 1, 3, 2\nfor i = 3 to 0 step -1\u00a0: @p(i) = pop()\u00a0: next\na = 0\u00a0: t = rnd(2)\n \ndo while s < 21\n  t = 1 - t\n  print using \"The sum is _#\"; s\n  if t = 1 then\n    print \"It is your turn.\"\n    do \n      while (a < 1) + (a > 3) + (a+s > 21)\n      input \"How many would you like to add? \", a\n    loop\n  else\n    print \"It is the computer's turn.\"\n    a = @p(s\u00a0% 4)\n    print using \"The computer adds #.\"; a\n  endif\n\n  print\n  s = s + a\n  a = 0\nloop\n \nif t = 1 then\n  print \"Congratulations. You win.\"\nelse\n  print \"Bad luck. The computer wins.\"\nendif\n",
        "safe": true
    },
    {
        "filename": "21_game_86.txt",
        "content": "' Game 21 in VB.NET - an example for Rosetta Code\n\nClass MainWindow\n    Private Const GOAL As Integer = 21\n    Private total As Integer = 0\n    Private random As New Random\n\n    Private Sub Update(box As TextBox, player As String, move As Integer)\n        total = total + move\n        box.Text = move\n        boxTotal.Text = total\n        If total + 1 > GOAL Then button1.IsEnabled = False\n        If total + 2 > GOAL Then button2.IsEnabled = False\n        If total + 3 > GOAL Then button3.IsEnabled = False\n        If total = GOAL Then\n            winner.Content = $\"The winner is {player}.\"\n        End If\n    End Sub\n\n    Private Sub Ai()\n        Dim move As Integer = 1\n        For i = 1 To 3\n            If (total + i - 1) Mod 4 = 0 Then move = i\n        Next i\n        For i = 1 To 3\n            If total + i = GOAL Then move = i\n        Next i\n        Update(boxAI, \"AI\", move)\n    End Sub\n\n    Private Sub Choice(sender As Object, e As RoutedEventArgs) _\n            Handles button1.Click, button2.Click, button3.Click\n        Update(boxHuman, \"human\", sender.Content)\n        If total < GOAL Then Ai()\n    End Sub\n\n    ' StartGame method handles both OnLoad (WM_INIT?) event \n    ' as well as the restart of the game after user press the 'restart' button.\n    '\n    Private Sub StartGame(sender As Object, e As RoutedEventArgs) Handles restart.Click\n\n        total = 0\n\n        boxAI.Text = \"\"\n        boxHuman.Text = \"\"\n        boxTotal.Text = \"\"\n        'first.Content = \"\" ' It is not necessary, see below.\n        winner.Content = \"\"\n\n        button1.IsEnabled = True\n        button2.IsEnabled = True\n        button3.IsEnabled = True\n\n        ' The random.Next(2) return pseudorandomly either 0 or 1. Generally\n        ' random.Next(n) Return a value from 0 (inclusive) To n - 1 (inclusive).\n        '\n        If random.Next(2) = 0 Then\n            first.Content = \"First player is AI player.\"\n            Ai()\n        Else\n            first.Content = \"First player is human player.\"\n        End If\n    End Sub\nEnd Class\n",
        "safe": true
    },
    {
        "filename": "21_game_87.txt",
        "content": "<Window x:Class=\"MainWindow\"\n        xmlns=\"http://schemas.microsoft.com/winfx/2006/xaml/presentation\"\n        xmlns:x=\"http://schemas.microsoft.com/winfx/2006/xaml\"\n        xmlns:d=\"http://schemas.microsoft.com/expression/blend/2008\"\n        xmlns:mc=\"http://schemas.openxmlformats.org/markup-compatibility/2006\"\n        xmlns:local=\"clr-namespace:Game21vb\"\n        mc:Ignorable=\"d\"\n        Title=\"Game 21\" Height=\"292\" Width=\"409\" Loaded=\"StartGame\">\n    <Grid>\n        <TextBlock \n            HorizontalAlignment=\"Left\" Margin=\"10,10,0,0\" TextWrapping=\"Wrap\" VerticalAlignment=\"Top\" Height=\"64\" Width=\"376\">\n            Game 21 is a two player game, the game is played by choosing a number (1, 2, or 3) to be added to the running total.\n            The game is won by the player whose chosen number causes the running total to reach exactly 21.\n            The running total starts at zero.\n        </TextBlock>\n        <Label Content=\"AI\" HorizontalAlignment=\"Left\" Margin=\"60,121,0,0\" VerticalAlignment=\"Top\" Width=\"49\" HorizontalContentAlignment=\"Right\"/>\n        <Label Content=\"Human\" HorizontalAlignment=\"Left\" Margin=\"60,152,0,0\" VerticalAlignment=\"Top\" HorizontalContentAlignment=\"Right\"/>\n        <Label Content=\"Total\" HorizontalAlignment=\"Left\" Margin=\"60,183,0,0\" VerticalAlignment=\"Top\" Width=\"49\" HorizontalContentAlignment=\"Right\"/>\n        <TextBox x:Name=\"boxAI\" HorizontalAlignment=\"Left\" Height=\"23\" Margin=\"114,125,0,0\" TextWrapping=\"Wrap\" VerticalAlignment=\"Top\" Width=\"120\" IsReadOnly=\"True\"/>\n        <TextBox x:Name=\"boxHuman\" HorizontalAlignment=\"Left\" Height=\"23\" Margin=\"114,156,0,0\" TextWrapping=\"Wrap\" VerticalAlignment=\"Top\" Width=\"120\" IsReadOnly=\"True\"/>\n        <TextBox x:Name=\"boxTotal\" HorizontalAlignment=\"Left\" Height=\"23\" Margin=\"114,187,0,0\" TextWrapping=\"Wrap\" VerticalAlignment=\"Top\" Width=\"120\" IsReadOnly=\"True\"/>\n        <Button x:Name=\"button1\" Content=\"1\" HorizontalAlignment=\"Left\" Margin=\"114,220,0,0\" VerticalAlignment=\"Top\" Width=\"25\"/>\n        <Button x:Name=\"button2\" Content=\"2\" HorizontalAlignment=\"Left\" Margin=\"144,220,0,0\" VerticalAlignment=\"Top\" Width=\"25\"/>\n        <Button x:Name=\"button3\" Content=\"3\" HorizontalAlignment=\"Left\" Margin=\"174,220,0,0\" VerticalAlignment=\"Top\" Width=\"25\"/>\n        <Button x:Name=\"restart\" Content=\"restart\" HorizontalAlignment=\"Left\" Margin=\"215,220,0,0\" VerticalAlignment=\"Top\" Width=\"75\"/>\n        <Label x:Name=\"winner\" HorizontalAlignment=\"Left\" Margin=\"245,184,0,0\" VerticalAlignment=\"Top\" Width=\"133\"/>\n        <Label x:Name=\"first\" HorizontalAlignment=\"Left\" Margin=\"10,79,0,0\" VerticalAlignment=\"Top\"/>\n    </Grid>\n</Window>\n",
        "safe": true
    },
    {
        "filename": "21_game_88.txt",
        "content": "import os\nimport rand\nimport rand.seed\nimport strconv\n\nfn get_choice(mut total &int) bool {\n    for {\n        text := os.input(\"Your choice 1 to 3\u00a0: \")\n        if text == \"q\" || text == \"Q\" {\n            return true\n        }\n        input := strconv.atoi(text) or {-1}\n        if input == -1 {\n            println(\"Invalid number, try again\")\n            continue\n        }\n        new_total := *total + input\n        match true {\n            input < 1 || input > 3 {\n                println(\"Out of range, try again\")\n            }\n            new_total > 21 {\n                println(\"Too big, try again\")\n            }\n            else {\n                total = new_total\n                println(\"Running total is now ${*total}\")\n                return false\n            }\n        }\n    }\n    return false\n}\n \nfn main() {\n    rand.seed(seed.time_seed_array(2))\n    mut computer := rand.intn(2) or {0} != 0\n    println(\"Enter q to quit at any time\\n\")\n    if computer {\n        println(\"The computer will choose first\")\n    } else {\n        println(\"You will choose first\")\n    }\n    println(\"\\nRunning total is now 0\\n\")\n    mut choice := 0\n    mut total := 0\n    for round := 1; ; round++ {\n        println(\"ROUND $round:\\n\")\n        for i := 0; i < 2; i++ {\n            if computer {\n                if total < 18 {\n                    choice = 1 + rand.intn(3) or {1}\n                } else {\n                    choice = 21 - total\n                }\n                total += choice\n                println(\"The computer chooses $choice\")\n                println(\"Running total is now $total\")\n                if total == 21 {\n                    println(\"\\nSo, commiserations, the computer has won!\")\n                    return\n                }\n            } else {\n                quit := get_choice(mut total)\n                if quit {\n                    println(\"OK, quitting the game\")\n                    return\n                }\n                if total == 21 {\n                    println(\"\\nSo, congratulations, you've won!\")\n                    return\n                }\n            }\n            println('')\n            computer = !computer\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "21_game_89.txt",
        "content": "Enter 0 to quit at any time\n\nYou will choose first\n\nRunning total is now 0\n\nROUND 1:\n\nYour choice 1 to 3: 3\nRunning total is now 3\n\nThe computer chooses 2\nRunning total is now 5\n\nROUND 2:\n\nYour choice 1 to 3: 3\nRunning total is now 8\n\nThe computer chooses 1\nRunning total is now 9\n\nROUND 3:\n\nYour choice 1 to 3: 3\nRunning total is now 12\n\nThe computer chooses 3\nRunning total is now 15\n\nROUND 4:\n\nYour choice 1 to 3: 2\nRunning total is now 17\n\nThe computer chooses 3\nRunning total is now 20\n\nROUND 5:\n\nYour choice 1 to 3: 1\nRunning total is now 21\n\nSo, congratulations, you've won!\n",
        "safe": true
    },
    {
        "filename": "21_game_9.txt",
        "content": "Gui, font, S16\nGui, add, Radio, vRadioC , Cake\nGui, add, Radio, vRadioE x+0 Checked, Easy\nGui, add, Radio, vRadioH x+0, Hard\nGui, add, text, xs vT, Total : 00\nGui, add, text, xs vComputer, Computer Dealt 00\nGui, add, text, xs Section, Player 1\nloop, 3\n\tGui, add, button, x+5 vPlayer1_%A_Index% gTotal, % A_Index \nGui, add, button, xs vReset gReset, reset\nGui show,, 21 Game\nWinners := [1,5,9,13,17,21]\ngosub, reset\nreturn\n;-----------------------------------\nreset:\ntotal := 0\nGuiControl,, T, % \"Total\u00a0: \" SubStr(\"00\" Total, -1)\nGuiControl,, Computer, % \"Computer Waiting\"\nLoop 3\n\tGuiControl, Enable, % \"Player1_\" A_Index\nRandom, rnd, 0, 1\nif rnd\n{\n\tLoop 3\n\t\tGuiControl, Disable, % \"Player1_\" A_Index\n\tgosub ComputerTurn\n}\nreturn\n;-----------------------------------\nTotal:\nAdded := SubStr(A_GuiControl, 9,1)\nTotal += Added\nGuiControl,, T, % \"Total\u00a0: \" SubStr(\"00\" Total, -1)\nif (total >= 21)\n{\n\tMsgBox % \"Player 1 Wins\"\n\tgosub reset\n\treturn\n}\nLoop 3\n\tGuiControl, Disable, % \"Player1_\" A_Index\ngosub, ComputerTurn\nreturn\n;-----------------------------------\nComputerTurn:\nGui, Submit, NoHide\nSleep 500\nif RadioE\n{\n\tif (total < 13)\n\t\tRadioC := true\n\telse\n\t\tRadioH := true\t\t\n}\nif RadioC\n{\n\tRandom, Deal, 1, 3\n\ttotal += Deal\n}\nif RadioH\n{\n\tfor i, v in Winners\n\t\tif (total >= v)\n\t\t\tcontinue\n\t\telse\n\t\t{\n\t\t\tDeal := v - total\n\t\t\tif Deal > 3\n\t\t\t\tRandom, Deal, 1, 3\n\t\t\ttotal += Deal\n\t\t\tbreak\n\t\t}\n}\nGuiControl,, T, % \"Total\u00a0: \" SubStr(\"00\" Total, -1)\nGuiControl,, Computer, % \"Computer Dealt \" Deal\nif (total=21)\n{\n\tMsgBox Computer Wins\n\tgosub, reset\n}\nelse\n\tLoop 3\n\t\tGuiControl, Enable, % \"Player1_\" A_Index\nreturn\n",
        "safe": true
    },
    {
        "filename": "21_game_90.txt",
        "content": "import \"./fmt\" for Conv\nimport \"./ioutil\" for Input\nimport \"random\" for Random\n\nvar total = 0\nvar quit = false\n\nvar getChoice = Fn.new {\n    while (true) {\n        var input = Input.integer(\"Your choice 1 to 3: \", 0, 3)\n        if (input == 0) {\n            quit = true\n            return\n        }\n        var newTotal = total + input\n        if (newTotal > 21) {\n            System.print(\"Too big, try again\")\n        } else {\n            total = newTotal\n            System.print(\"Running total is now %(total)\")\n            return\n        }\n    }\n}\n\nvar rand = Random.new()\nvar computer = Conv.itob(rand.int(2))\nSystem.print(\"Enter 0 to quit at any time\\n\")\nif (computer) {\n    System.print(\"The computer will choose first\")\n} else {\n    System.print(\"You will choose first\")\n}\nSystem.print(\"\\nRunning total is now 0\\n\")\nvar round = 1\nwhile (true) {\n    System.print(\"ROUND %(round):\\n\")\n    for (i in 0..1) {\n        if (computer) {\n            var choice = (total < 18) ? 1 + rand.int(3) : 21 - total\n            total = total + choice\n            System.print(\"The computer chooses %(choice)\")\n            System.print(\"Running total is now %(total)\")\n            if (total == 21) {\n                System.print(\"\\nSo, commiserations, the computer has won!\")\n                return\n            }\n        } else {\n            getChoice.call()\n            if (quit) {\n                System.print(\"OK, quitting the game\")\n                return\n            }\n            if (total == 21) {\n                System.print(\"\\nSo, congratulations, you've won!\")\n                return\n            }\n        }\n        System.print()\n        computer = !computer\n    }\n    round = round + 1\n}\n",
        "safe": true
    },
    {
        "filename": "21_game_91.txt",
        "content": "Enter 0 to quit at any time\n\nYou will choose first\n\nRunning total is now 0\n\nROUND 1:\n\nYour choice 1 to 3: 3\nRunning total is now 3\n\nThe computer chooses 2\nRunning total is now 5\n\nROUND 2:\n\nYour choice 1 to 3: 3\nRunning total is now 8\n\nThe computer chooses 1\nRunning total is now 9\n\nROUND 3:\n\nYour choice 1 to 3: 3\nRunning total is now 12\n\nThe computer chooses 3\nRunning total is now 15\n\nROUND 4:\n\nYour choice 1 to 3: 2\nRunning total is now 17\n\nThe computer chooses 3\nRunning total is now 20\n\nROUND 5:\n\nYour choice 1 to 3: 1\nRunning total is now 21\n\nSo, congratulations, you've won!\n",
        "safe": true
    },
    {
        "filename": "24 game_1.txt",
        "content": "T Error\n   String message\n   F (message)\n      .message = message\n\nT RPNParse\n   [Float] stk\n   [Int] digits\n\n   F op(f)\n      I .stk.len < 2\n         X.throw Error(\u2018Improperly written expression\u2019)\n      V b = .stk.pop()\n      V a = .stk.pop()\n      .stk.append(f(a, b))\n\n   F parse(s)\n      L(c) s\n         I c C \u20180\u2019..\u20189\u2019\n            .stk.append(Float(c))\n            .digits.append(Int(c))\n         E I c == \u2018+\u2019 {.op((a, b) -> a + b)}\n         E I c == \u2018-\u2019 {.op((a, b) -> a - b)}\n         E I c == \u2018*\u2019 {.op((a, b) -> a * b)}\n         E I c == \u2018/\u2019 {.op((a, b) -> a / b)}\n         E I c\u00a0!= \u2018 \u2019\n            X.throw Error(\u2018Wrong char: \u2019c)\n\n   F get_result()\n      I .stk.len\u00a0!= 1\n         X.throw Error(\u2018Improperly written expression\u2019)\n      R .stk.last\n\n[Int] digits\nprint(\u2018Make 24 with the digits:\u2019, end' \u2018\u2019)\nL 4\n   V n = random:(1..9)\n   print(\u2018 \u2019n, end' \u2018\u2019)\n   digits.append(n)\nprint()\n\nV parser = RPNParse()\n\nX.try\n   parser.parse(input())\n   V r = parser.get_result()\n\n   I sorted(digits)\u00a0!= sorted(parser.digits)\n      print(\u2018Error: Not using the given digits\u2019)\n   E\n      print(\u2018Result: \u2019r)\n\n      I r C 23.999<.<24.001\n         print(\u2018Good job!\u2019)\n      E\n         print(\u2018Try again.\u2019)\n\nX.catch Error error\n   print(\u2018Error: \u2019error.message)",
        "safe": true
    },
    {
        "filename": "24 game_10.txt",
        "content": " 0 BH =  PEEK (104):BL =  PEEK (103)\n 1  GOSUB 1200: CALL  - 868\n 10  LET N$ = \"\"\n 20 R =  RND ( - ( PEEK (78) +  PEEK (79) * 256)): REM RANDOMIZE \n 30  FOR I = 1 TO 4\n 40      LET N$ = N$ +  STR$ ( INT ( RND (1) * 9) + 1)\n 50  NEXT I\n 60  PRINT \" PRESS A KEY TO CONTINUE. \";: GET A$\n 65  LET I$ = \"\": LET F$ = \"\": LET P$ = \"\"\n 70  HOME \n 80  PRINT M$M$ SPC( 16)\"24 GAME\"\n 90  PRINT M$\"ALLOWED CHARACTERS:\"M$\n 100  LET I$ = N$ + \"+-*/()\"\n 110  HTAB 20\n 120  FOR I = 1 TO 10\n 130      PRINT  MID$ (I$,I,1)\" \";\n 140  NEXT I\n 150  PRINT M$ TAB( 7)\"0 TO END\"M$\n 160  INPUT \"ENTER THE FORMULA: \";F$\n 170  IF F$ = \"0\" THEN  END\u00a0: GOTO 65\n 180  PRINT M$ TAB( 7)F$\" = \";\n 190  FOR I = 1 TO  LEN (F$)\n 200      LET C$ =  MID$ (F$,I,1)\n 210      IF C$ = \" \" THEN  LET F$ =  MID$ (F$,1,I - 1) +  MID$ (F$,I + 1): GOTO 250\n 220      IF C$ = \"+\" OR C$ = \"-\" OR C$ = \"*\" OR C$ = \"/\" THEN  LET P$ = P$ + \"O\": GOTO 250\n 230      IF C$ = \"(\" OR C$ = \")\" THEN  LET P$ = P$ + C$: GOTO 250\n 240      LET P$ = P$ + \"N\"\n 250  NEXT I\n 260  RESTORE \n 270  FOR I = 1 TO 11\n 280      READ T$\n 290      IF T$ = P$ THEN  LET I = 11\n 300  NEXT I\n 310  IF T$ <  > P$ THEN  INVERSE\u00a0: PRINT \"BAD CONSTRUCTION!\"G$M$: NORMAL\u00a0: GOTO 60\n 320  FOR I = 1 TO  LEN (F$)\n 330      FOR J = 1 TO 10\n 340      IF ( MID$ (F$,I,1) =  MID$ (I$,J,1)) AND  MID$ (F$,I,1) > \"0\" AND  MID$ (F$,I,1) <  = \"9\" THEN  LET I$ =  MID$ (I$,1,J - 1) + \" \" +  MID$ (I$,J + 1, LEN (I$))\n 350  NEXT J,I\n 370  IF  MID$ (I$,1,4) <  > \"    \" THEN  INVERSE\u00a0: PRINT \"INVALID ARGUMENTS!\"G$M$: NORMAL\u00a0: GOTO 60\n 380  GOSUB 600: REM LET R = VAL(F$)\n 390  PRINT R\" \";\n 400  IF R <  > 24 THEN  INVERSE\u00a0: PRINT \"WRONG!\"G$M$: NORMAL\u00a0: GOTO 60\n 410  INVERSE\u00a0: PRINT \"CORRECT!\"M$: NORMAL\u00a0: GOTO 10\n 420  DATA\"NONONON\"\n 430  DATA\"(NON)ONON\"\n 440  DATA\"NONO(NON)\"\n 450  DATA\"NO(NO(NON))\"\n 460  DATA\"((NON)ON)ON\"\n 470  DATA\"NO(NON)ON\"\n 480  DATA\"(NON)O(NON)\"\n 485  DATA\"NO((NON)ON)\"\n 490  DATA\"(NONON)ON\"\n 495  DATA\"(NO(NON))ON\"\n 500  DATA\"NO(NONON)\"\n 600  REMGET BASIC TO EVALUATE OUR EXPRESSION\n 605 A$ = \"R=\" + F$: GOSUB 1440\n 610  FOR I = 1 TO  LEN (A$)\n 615      REMSIMPLE TOKEN TRANSLATION\n 620     B =  ASC ( MID$ (A$,I,1))\n 625      IF (B > 41 AND B < 48) OR B = 61 OR B = 94 THEN B = T(B)\n 630      POKE (AD + I - 1),B\n 635  NEXT \n 640  GOSUB 2000\n 645  REM  GOSUB 1440:REM UNCOMMENT TO CLEAR EVALUATION LINE AFTER USE\n 650  RETURN \n 1200 M$ =  CHR$ (13)\n 1210 G$ =  CHR$ (7)\n 1220  HOME \n 1230  PRINT  SPC( 16)\"24 GAME\"\n 1240  PRINT M$\" THE GOAL OF THIS GAME IS TO FORMULATE\"\n 1250  PRINT M$\" AN ARITHMETIC EXPRESSION THAT\"\n 1260  PRINT M$\" EVALUATES TO A VALUE OF 24, HOWEVER\"\n 1270  PRINT M$\" YOU MAY USE ONLY THE FOUR NUMBERS\"\n 1280  PRINT M$\" GIVEN AT RANDOM BY THE COMPUTER AND\"\n 1290  PRINT M$\" THE STANDARD ARITHMETIC OPERATIONS OF\"\n 1300  PRINT M$\" ADD, SUBTRACT, MULTIPLY, AND DIVIDE.\"\n 1310  PRINT M$\" EACH DIGIT MUST BE USED BY ITSELF. \"\n 1320  PRINT M$\" (E.G. IF GIVEN 1, 2, 3, 4, YOU CANNOT\"\n 1330  PRINT M$\" COMBINE 1 AND 2 TO MAKE 12.)\"\n 1340  PRINT M$\n 1350  PRINT \"INITIALIZING...\";\n 1360  HTAB 1\n 1400  DIM T(94)\n 1401 T( ASC (\"+\")) = 200: REM $C8\n 1402 T( ASC (\"-\")) = 201: REM $C9\n 1403 T( ASC (\"*\")) = 202: REM $CA\n 1404 T( ASC (\"/\")) = 203: REM $CB\n 1405 T( ASC (\"=\")) = 208: REM $D0\n 1406 T( ASC (\"^\")) = 204: REM $CC\n 1409  REMLOCATE LINE 2005 IN RAM\n 1410 LH = BH:LL = BL:NH = 0:NL = 0\n 1415 AD = LH * 256 + LL\n 1420 LH =  PEEK (AD + 1):LL =  PEEK (AD)\n 1425 NL =  PEEK (AD + 2):NH =  PEEK (AD + 3):N = NH * 256 + NL\n 1430  IF N <  > 2005 THEN  GOTO 1415\n 1435 AD = AD + 4: RETURN \n 1440  FOR J = AD TO AD + 12: POKE J, ASC (\":\"): NEXT \n 1445  RETURN \n 2000  REMPUT 13 COLONS ON THE NEXT LINE\n 2005\u00a0:::::::::::::\n 2010  RETURN",
        "safe": true
    },
    {
        "filename": "24 game_100.txt",
        "content": "  function twentyfour()\n  N = 4;\n  n = ceil(rand(1,N)*9);\n  printf('Generate a equation with the numbers %i, %i, %i, %i and +, -, *, /, () operators\u00a0! \\n',n);\n  s = input(': ','s');\n  t = s;\n  for k = 1:N,\n    [x,t] = strtok(t,'+-*/() \\t');\n     if length(x)~=1,\n       error('invalid sign %s\\n',x);\n     end; \n     y = x-'0';\n     if ~(0 < y & y < 10) \n       error('invalid sign %s\\n',x);\n     end;\n     z(1,k) = y;  \t\n  end; \n  if any(sort(z)-sort(n)) \n    error('numbers do not match.\\n');\t\n  end; \n\n  val =  eval(s);\n  if val==24,\n    fprintf('expression \"%s\" results in %i.\\n',s,val);\t\n  else\n    fprintf('expression \"%s\" does not result in 24 but %i.\\n',s,val);\n  end;\n",
        "safe": true
    },
    {
        "filename": "24 game_101.txt",
        "content": "evalAddSub = function()\n    result = evalMultDiv\n    while true\n        if not tokens then return result\n        op = tokens[0]\n        if op != \"+\" and op != \"-\" then return result\n        tokens.pull  // (discard operator)\n        rhs = evalMultDiv\n        if result == null or rhs == null then return null\n        if op == \"+\" then result = result + rhs\n        if op == \"-\" then result = result - rhs\n    end while\nend function\n\nevalMultDiv = function()\n    result = evalAtom\n    while true\n        if not tokens then return result\n        op = tokens[0]\n        if op != \"*\" and op != \"/\" then return result\n        tokens.pull  // (discard operator)\n        rhs = evalAtom\n        if result == null or rhs == null then return null\n        if op == \"*\" then result = result * rhs\n        if op == \"/\" then result = result / rhs\n    end while\nend function\n    \nevalAtom = function()\n    if tokens[0] == \"(\" then\n        tokens.pull\n        result = evalAddSub\n        if not tokens or tokens.pull != \")\" then\n            print \"Unbalanced parantheses\"\n            return null\n        end if\n        return result\n    end if\n    num = val(tokens.pull)\n    idx = availableDigits.indexOf(num)\n    if idx == null then\n        print str(num) + \" is not available\"\n        return null\n    else\n        availableDigits.remove idx\n    end if\n    return num\nend function\n\nchoices = []\nfor i in range(1, 4)\n    choices.push ceil(rnd*9)\nend for\nresult = null\nwhile result != 24\n    availableDigits = choices[:]  // (clones the list)\n    print \"Using only the digits \" + availableDigits + \",\"\n    tokens = input(\"enter an expression that comes to 24: \").replace(\" \",\"\").values\n    result = evalAddSub\n    if availableDigits then\n        print \"You forgot to use: \" + availableDigits\n        result = null\n    end if\n    if result != null then print \"That equals \" + result + \".\"\nend while\nprint \"Great job!\"\n",
        "safe": true
    },
    {
        "filename": "24 game_102.txt",
        "content": "Using only the digits [5, 5, 2, 7],\nenter an expression that comes to 24:\n(7+5)*2\nYou forgot to use: [5]\nUsing only the digits [5, 5, 2, 7],\nenter an expression that comes to 24:\n5*7-5*2\nThat equals 25.\nUsing only the digits [5, 5, 2, 7],\nenter an expression that comes to 24:\n5+5+7*2\nThat equals 24.\nGreat job!",
        "safe": true
    },
    {
        "filename": "24 game_103.txt",
        "content": "alias 24 {\n  dialog -m 24-Game 24-Game\n}\n\ndialog 24-Game {\n  title \"24-Game\"\n  size -1 -1 100 70\n  option dbu\n  text \"\", 1, 29 7 42 8\n  text \"Equation\", 2, 20 21 21 8\n  edit \"\", 3, 45 20 40 10\n  text \"Status\", 4, 10 34 80 8, center\n  button \"Calculate\", 5, 5 45 40 20\n  button \"New\", 6, 57 47 35 15\n}\n\non *:DIALOG:24-Game:init:*: {\n  did -o 24-Game 1 1 Numbers: $rand(1,9) $rand(1,9) $rand(1,9) $rand(1,9)\n}\n\non *:DIALOG:24-Game:sclick:*: {\n  if ($did == 5) {\n    if ($regex($did(3),/^[ (]*\\d *[-+*/][ (]*\\d[ ()]*[-+*/][ ()]*\\d[ )]*[-+*/] *\\d[ )]*$/)) && ($sorttok($regsubex($did(3),/[^\\d]+/g,$chr(32)),32) == $sorttok($remove($did(1),Numbers:),32)) {\n      did -o 24-Game 4 1 $iif($calc($did(3)) == 24,Correct,Wrong)\n    }\n    else {\n      did -o 24-Game 4 1 Wrong Numbers or Syntax\n    }\n  }\n  elseif ($did == 6) {\n    did -o 24-Game 1 1 Numbers: $rand(1,9) $rand(1,9) $rand(1,9) $rand(1,9)\n  }\n}",
        "safe": true
    },
    {
        "filename": "24 game_104.txt",
        "content": "MODULE TwentyFour;\n\nFROM\tInOut\t\t\tIMPORT WriteString, WriteLn, Write, ReadString, WriteInt;\nFROM\tRandomGenerator IMPORT Random;\n\nTYPE\toperator_t \t\t= (add, sub, mul, div);\n\t\texpr_t\t\t\t= RECORD\n\t\t\t\t\t\t\toperand\t\t: ARRAY[0..3] OF CARDINAL;\n\t\t\t\t\t  \t\toperator \t: ARRAY[1..3] OF operator_t;\n\t\t\t\t\t\t  END;(*of RECORD*)\n\t\tnumbers_t\t\t= SET OF CHAR;\n\nVAR\t\texpr \t: expr_t;\n\t\tnumbers\t: numbers_t;\n(*******************************************************************createExpr*)\n(*analyse the input string                                                    *)\nPROCEDURE createExpr(s: ARRAY OF CHAR);\n\nVAR index, counter\t: INTEGER;\n\ttoken \t\t\t: CHAR;\n\ttemp_expr \t\t: expr_t;\n\toperand   \t\t: CARDINAL;\n\toperator\t\t: operator_t;\n\t\n\t(************************************nextToken*)\n\t(* returns the next CHAR that isn`t a space    *)\n\tPROCEDURE nextToken(): CHAR;\n\tBEGIN\n\t\tINC(index);\n\t\tWHILE (s[index] = ' ') DO\n\t\t\tINC(index);\n\t\tEND;(*of WHILE*)\n\t\tRETURN(s[index]);\n\tEND nextToken;\n\t(***********************************set_operand*)\n\t(* checks if the CHAR o inerhits a valid number*)\n\t(* and sets 'operand' to its value             *)\t\n\tPROCEDURE set_operand(o: CHAR);\n\tBEGIN\n\t\tCASE o OF\n\t\t\t'0'..'9':\tIF o IN numbers THEN\n\t\t\t\t\t\t\toperand := ORD(o)-48;\n\t\t\t\t\t\t\tnumbers := numbers - numbers_t{o};\n\t\t\t\t\t\tELSE\n\t\t\t\t\t\t\tWriteString(\"ERROR: '\");\n\t\t\t\t\t\t\tWrite(\t\t\t\t\to);\n\t\t\t\t\t\t\tWriteString(\t\t\t\t\"' isn`t a available number \");\n\t\t\t\t\t\t\tWriteLn;\n\t\t\t\t\t\t\tHALT;\n\t\t\t\t\t\tEND;(*of IF*)|\n\t\t\t0  : WriteString(\"ERROR: error in input \");\n\t\t\t\t\tWriteLn;\n\t\t\t\t\tHALT;\n\t\t\tELSE\n\t\t\t\tWriteString(\"ERROR: '\");\n\t\t\t\tWrite(\t\t\t\t\to);\n\t\t\t\tWriteString(\t\t\t\t\"' isn`t a number \");\n\t\t\t\tWriteLn;\n\t\t\t\tHALT;\n\t\tEND;(*of CASE*)\n\tEND set_operand;\n\t(**********************************set_operator*)\n\t(* checks if the CHAR o inerhits a valid       *)\n\t(* operator and sets 'operator' to its value   *)\n\tPROCEDURE set_operator(o: CHAR);\n\tBEGIN\n\t\tCASE o OF\n\t\t\t'+' : operator := add;|\n\t\t\t'-' : operator := sub;|\n\t\t\t'*' : operator := mul;|\n\t\t\t'/' : operator := div;|\n\t\t\t0  : WriteString(\"ERROR: error in input \");\n\t\t\t\t\tWriteLn;\n\t\t\t\t\tHALT;\n\t\tELSE\n\t\t\tWriteString(\"ERROR: '\");\n\t\t\t\tWrite(\t\t\t\t\to);\n\t\t\t\tWriteString(\t\t\t\t\"' isn`t a operator \");\n\t\t\t\tWriteLn;\n\t\t\t\tHALT;\n\t\tEND;(*of CASE*)\n\tEND set_operator;\n\t(************************************************)\nBEGIN\n\tindex := -1;\n\t\n\ttoken := nextToken();\n\tset_operand(token);\n\texpr.operand[0] := operand;\n\t\n\ttoken := nextToken();\n\tset_operator(token);\n\texpr.operator[1] := operator;\n\t\n\t\n\ttoken := nextToken();\n\tset_operand(token);\n\texpr.operand[1] := operand;\n\t\n\ttoken := nextToken();\n\tset_operator(token);\n\texpr.operator[2] := operator;\n\t\n\ttoken := nextToken();\n\tset_operand(token);\n\texpr.operand[2] := operand;\n\t\n\ttoken := nextToken();\n\tset_operator(token);\n\texpr.operator[3] := operator;\n\t\n\ttoken := nextToken();\n\tset_operand(token);\n\texpr.operand[3] := operand;\nEND createExpr;\n\n(*****************************************************************evaluateExpr*)\n(* evaluate the expresion that was createt by 'createExpr'                    *)\n\nPROCEDURE evaluateExpr(VAR num: REAL);\n\nVAR\tindex\t: INTEGER;\nBEGIN\n\tWITH expr DO\n\t\tnum := VAL(REAL,operand[0]);\n\t\tFOR index := 1 TO 3 DO\n\t\t\tCASE operator[index] OF\n\t\t\t\tadd : num := num + VAL(REAL,operand[index]);|\n\t\t\t\tsub : num := num - VAL(REAL,operand[index]);|\n\t\t\t\tmul : num := num * VAL(REAL,operand[index]);|\n\t\t\t\tdiv : num := num / VAL(REAL,operand[index]);\n\t\t\tEND;(*of CASE*)\n\t\tEND;(*of FOR*)\n\tEND;(*of WITH*)\nEND evaluateExpr;\n\n(**************************************************************generateNumbers*)\n(* generates the 4 random numbers ond write them                              *)\nPROCEDURE generateNumbers;\nVAR\tindex,ran : INTEGER;\nBEGIN\n\tnumbers := numbers_t{};\n\tran := Random(0,9);\n\tFOR index := 1 TO 4 DO\n\t\tWHILE (CHR(ran+48) IN numbers )DO\n\t\t\tran := Random(0,9);\n\t\tEND;(*of While*)\n\t\tWrite(CHR(ran+48));\n\t\tWriteLn;\n\t\tnumbers := numbers + numbers_t{CHR(ran+48)}\n\tEND;(*of FOR*)\nEND generateNumbers;\n(****************************************************************Main Programm*)\nVAR\tstr : ARRAY[0..255] OF CHAR;\n\tsum : REAL;\nBEGIN\n\tWriteString(\"Welcome to the 24 game in MODULA-2\");\n\tWriteLn;\n\tWriteString(\"Here are your numbers:\");\n\tWriteLn;\n\tgenerateNumbers;\n\tWriteString(\"Enter your equation(This implementation dosn`t support brackets yet): \");\n\tWriteLn;\n\tReadString(str);\n\tcreateExpr(str);\n\tevaluateExpr(sum);\n\tWriteLn;\n\tWriteString(\"Result:\");\n\tWriteLn;\n\tWriteInt(TRUNC(sum),0);\n\tWriteLn;\n\tCASE (TRUNC(sum) - 24) OF\n\t\t0 : WriteString(\"Perfect!\");|\n\t\t1 : WriteString(\"Almost perfect.\");\n\t\tELSE \n\t\t\tWriteString(\"You loose!\");\n\tEND;(*of CASE*)\n\tWriteLn;\nEND TwentyFour.\n",
        "safe": true
    },
    {
        "filename": "24 game_105.txt",
        "content": "24Game\n\tk number, operator, bracket\n\t; generate 4 random numbers each between 1 & 9\n\t; duplicates allowed!\n\ts n1=$r(9)+1, n2=$r(9)+1, n3=$r(9)+1, n4=$r(9)+1\n\t; save a copy of them so that we can keep restarting\n\t; if the user gets it wrong\n\ts s1=n1,s2=n2,s3=n3,s4=n4\nQuestion\n\ts (numcount,opcount,lbrackcount,rbrackcount)=0\n\t; restart with the random numbers already found\n\ts n1=s1,n2=s2,n3=s3,n4=s4\n\tw\u00a0!,\"Enter an arithmetic expression that evaluates to 24 using (\",\n\tn1,\" \",n2,\" \",n3,\" \",n4,\"): \"\n\tr\u00a0!,expr\n\tq:expr=\"\"\n\t; validate numbers and operators\n\ts error=\"\"\n\tf n=1:1:$l(expr) {\n\t\ts char=$e(expr,n)\n\t\tif char?1n {\n\t\t\ts number($i(numcount))=char\n\t\t\tw\u00a0!\n\t\t\tzw char\n\t\t}\n\t\telseif char?1(1\"*\",1\"/\",1\"+\",1\"-\") {\n\t\t\ts operator($i(opcount))=char\n\t\t}\n\t\telseif char?1\"(\" {\n\t\t\ts bracket($i(lbrackcount))=char\n\t\t}\n\t\telseif char?1\")\" {\n\t\t\ts bracket($i(rbrackcount))=char\n\t\t}\n\t\telse {\n\t\t\ts error=\"That ain't no character I wanted to see\"\n\t\t\tq\n\t\t}\n\t}\n\tif error'=\"\" w error g Question\n\tif numcount'=4 {\n\t\tw \"Does not have 4 numbers, do it again.\"\n\t\tg Question\n\t}\n\ts error=\"\"\n\tf n=1:1:4 {\n\t\tif number(n)=n1 {\n\t\t\ts n1=\"dont use again\" continue\n\t\t}\n\t\tif number(n)=n2 {\n\t\t\ts n2=\"dont use again\" continue\n\t\t}\n\t\tif number(n)=n3 {\n\t\t\ts n3=\"dont use again\" continue\n\t\t}\n\t\tif number(n)=n4 {\n\t\t\ts n4=\"dont use again\" continue\n\t\t}\n\t\ts error=\"Numbers entered do not match all of the randomly generated numbers.\"\n\t\tq\n\t}\n\tif error'=\"\" {\n\t\tw error\n\t\tg Question\n\t}\n\tif opcount'=3 {\n\t\tw \"Does not have 3 operators.\"\n\t\tg Question\n\t}\n\tif lbrackcount'=rbrackcount {\n\t\tw \"brackets must be in pairs.\"\n\t\tg Question\n\t}\n\tx \"s x=\"_expr\n\tif x'=24 {\n\t\tw\u00a0!,\"Answer does not = 24\"\n\t\tg Question\n\t}\n\tw x\n\tq",
        "safe": true
    },
    {
        "filename": "24 game_106.txt",
        "content": "import Nanoquery.Lang\nimport Nanoquery.Util\n\n// a function to get the digits from an arithmetic expression\ndef extract_digits(input)\n\tinput = str(input)\n\tdigits = {}\n\n\tloc = 0\n\tdigit = \"\"\n\twhile (loc < len(input))\n\t\tif input[loc] in \"0123456789\"\n\t\t\tdigit += input[loc]\n\t\telse\n\t\t\tif len(digit) > 0\n\t\t\t\tdigits.append(int(digit))\n\t\t\t\tdigit = \"\"\n\t\t\tend\n\t\tend\n\t\tloc += 1\n\tend\n\t// check if there's a final digit\n\tif len(digit) > 0\n\t\tdigits.append(int(digit))\n\tend\n\n\treturn digits\nend\n\n// a function to duplicate a digit list\ndef dup(list)\n\tnlist = {}\n\t\n\tfor n in list\n\t\tnlist.append(new(Integer, n))\n\tend\n\t\n\treturn nlist\nend\n\n// generate four random digits and output them\nrandom = new(Random)\nrandDigits = {}\nfor i in range(1, 4)\n\trandDigits.append(random.getInt(8) + 1)\nend\nprintln \"Your digits are: \" + randDigits + \"\\n\"\n\n// get expressions from the user until a valid one is found\nwon = false\nwhile !won\n\tprint \"> \"\n\texpr = input()\n\ttempDigits = dup(randDigits)\n\n\t// check for invalid digits in the expression\n\tinvalid = false\n\tdigits = extract_digits(expr)\n\tfor (i = 0) (!invalid and (i < len(digits))) (i += 1)\n\t\tif not digits[i] in tempDigits\n\t\t\tinvalid = true\n\t\t\tprintln \"Invalid digit \" + digits[i]\n\t\telse\n\t\t\ttempDigits.remove(tempDigits)\n\t\tend\n\tend\n\n\t// if there were no invalid digits, check if the expression\n\t// evaluates to 24\n\tif !invalid\n\t\ta = null\n\t\ttry\n\t\t\texec(\"a = \" + expr)\n\t\tcatch\n\t\t\tprintln \"Invalid expression \" + expr\n\t\tend\n\t\tprintln a\n\n\t\tif a = 24\n\t\t\tprintln \"Success!\"\n\t\t\twon = true\n\t\tend\n\tend\nend",
        "safe": true
    },
    {
        "filename": "24 game_107.txt",
        "content": "Your digits are: [2, 5, 4, 6]\n\n> 2*5+(4*6)\n34\n> 2*4+5*6\n38\n> 5*6-(2*4)\n22\n> 5*6-(2+4)\n24\nSuccess!",
        "safe": true
    },
    {
        "filename": "24 game_108.txt",
        "content": "from random import randomize, rand\nfrom strutils import Whitespace\nfrom algorithm import sort\nfrom sequtils import newSeqWith\n\nrandomize()\n \nvar\n  problem = newSeqWith(4, rand(1..9))\n  stack: seq[float]\n  digits: seq[int]\n \necho \"Make 24 with the digits: \", problem\n \ntemplate op(c: untyped) =\n  let a = stack.pop\n  stack.add c(stack.pop, a)\n \nfor c in stdin.readLine:\n  case c\n  of '1'..'9':\n    digits.add c.ord - '0'.ord\n    stack.add float(c.ord - '0'.ord)\n  of '+': op `+`\n  of '*': op `*`\n  of '-': op `-`\n  of '/': op `/`\n  of Whitespace: discard\n  else: raise newException(ValueError, \"Wrong char: \" & c)\n \nsort digits\nsort problem\nif digits != problem:\n  raise newException(ValueError, \"Not using the given digits.\")\nif stack.len != 1:\n  raise newException(ValueError, \"Wrong expression.\")\necho \"Result: \", stack[0]\necho if abs(stack[0] - 24) < 0.001: \"Good job!\" else: \"Try again.\"\n",
        "safe": true
    },
    {
        "filename": "24 game_109.txt",
        "content": "Make 24 with the digits: @[8, 1, 3, 1]\n8 3 * 1 + 1 -\nResult: 24.0\nGood job!",
        "safe": true
    },
    {
        "filename": "24 game_11.txt",
        "content": "use std, array, list\n\ndo\n  generate random digits\n  show random digits\n  let result = parse expression (get input line)\n  if result\u00a0!= ERROR\n    if some digits are unused\n      print \"Wrong\u00a0! (you didn't use all digits)\"\u00a0; failure++\n    else if result == 24.0\n      print \"Correct\u00a0!\"\u00a0; success++\n    else\n      print \"Wrong\u00a0! (you got \"result\")\"\u00a0; failure++\n while play again\u00a0?\nprint \"success:\"success\" failure:\"failure\" total:\"(success+failure) as int\n\nlet success = 0, failure = 0.\n\n.: generate random digits\u00a0:.\n   our nat seed = 0xc6f31 (: default seed when /dev/urandom doesn't exist\u00a0:)\n   let urandom = fopen \"/dev/urandom\" \"r\"\n   if  urandom isn't nil\n     fread &seed size of seed 1 urandom\n     fclose urandom\n   Cfunc srandom seed\n   seed = (Cfunc random) as nat\n   for each (val int d) from 0 to 3\n     digits[d] = '1' + (seed\u00a0% 9)\n     seed /= 9\n\nlet digits be an array of 4 byte\n\n.: show random digits\u00a0:.\n   print \"Enter an expression that equates to 24 using only all these digits:\"\n   printf \"%c , %c , %c , %c\\n\"(digits[0])(digits[1])(digits[2])(digits[3])\n   printf \"24 = \"\n\n.: some digits are unused\u00a0:. -> bool\n   for each (val int d) from 0 to 3\n     return true if digits[d]\u00a0!= '\\0'\n   false\n\n.: get input line\u00a0:. -> text\n   our array of 64 byte line\n   Cfunc fgets (line) (size of line) (stdin)\n   let int i\n   for (i = 0) (line[i]\u00a0!= 0) (i++)\n     line[i] = '\\0' if (line[i] == '\\n')\n   line as text\n\n.: play again\u00a0?\u00a0:. -> bool\n   while true\n     printf \"Play again\u00a0? (y/n) \"\u00a0; Cfunc fflush stdout\n     let answer = get input line\n     switch answer[0]\n       case 'n' {return false}\n       case 'y' {return true }\n       default  {continue    }\n   false\n\n=: ERROR\u00a0:= -> real {-32202.0}\n\n.: parse expression <text expr>\u00a0:. -> real\n   let x = 0.0, x_is_set = false, op = ' '.\n   let stack be a list of State\u00a0; class State {byte op; real x}\n   for (stack = nil) (*expr\u00a0!= 0) (expr++)\n     switch *expr\n       case '+'\u00a0; case '-'\u00a0; case '*'\u00a0; case '/'\n         error \"bad syntax\" if not x_is_set\n\t op = *expr\n       case '1'\u00a0; case '2'\u00a0; case '3'\u00a0; case '4'\u00a0; case '5'\n       case '6'\u00a0; case '7'\u00a0; case '8'\u00a0; case '9'\n\t error \"missing operator\" if (x_is_set and op == ' ')\n\t error \"unavailable digit\" unless consume digit expr[0]\n\t do operation with (expr[0] - '0') as real\n       case (Cgen \"'('\")\n\t error \"missing operator\" if (op == ' ' but x_is_set)\n\t (new list (new State) (code of del State())) << stack\n\t op = ' '\u00a0; x_is_set = false (: start fresh state\u00a0:)\n       case (Cgen \"')'\")\n         error \"mismatched parenthesis\" if stack is nil\n\t error \"wrong syntax\" if not x_is_set\n\t let y = x\n\t x = stack.data.x\u00a0; op = stack.data.op\n\t delete pop stack\n\t do operation with y\n       default {error \"disallowed character\"}\n\n       .:new State         \u00a0:. -> State {let s=new(State); s.x=x; s.op=op; s}\n       .:del State <State s>:.          {               free s              }\n       .:do operation with <real y>:.\n  \t switch op\n\t   case '+' {x += y}\n\t   case '-' {x -= y}\n\t   case '*' {x *= y}\n\t   case '/' {x /= y}\n\t   default  {x  = y; x_is_set = true}\n         op = ' '\n   =:error<text msg>:= ->real {eprint \"Error: \"msg\" at [\"expr\"]\";return ERROR}\n   .:consume digit <byte b>:. -> bool\n     for each (val int d) from 0 to 3\n       if digits[d] == b\n         digits[d] = '\\0'\n       \t return true\n     false\n\n   if stack isn't nil\n     delete all stack\n     error \"unclosed parenthesis\"\n   return x",
        "safe": true
    },
    {
        "filename": "24 game_110.txt",
        "content": "redef class Char\n\tfun is_op: Bool do return \"-+/*\".has(self)\nend\n\n# Get `numbers` and `operands` from string `operation` collect with `gets` in `main` function\n# Fill `numbers` and `operands` array with previous extraction\nfun exportation(operation: String, numbers: Array[Int], operands: Array[Char]) do\n\tvar previous_char: nullable Char = null\n\tvar number: nullable Int = null\n\tvar negative = false\n\n\tfor i in operation.length.times do\n\t\tvar current_char = operation[i]\n\t\tvar current_int = current_char.to_i\n\n\t\tif (previous_char == null or previous_char.is_op) and current_char == '-' then\n\t\t\tnegative = true\n\t\t\tcontinue\n\t\tend\n\n\t\tif current_char.is_digit then\n\t\t\tif number == null then\n\t\t\t\tnumber = current_int\n\t\t\telse\n\t\t\t\tnumber = number * 10 + current_int\n\t\t\tend\n\t\tend\n\n\t\tif negative and (current_char.is_op or i == operation.length - 1) then\n\t\t\tnumber = number - number * 2\n\t\t\tnegative = false\n\t\tend\n\n\t\tif (current_char.is_op or i == operation.length - 1) and number != null then\n\t\t\tnumbers.add(number)\n\t\t\tnumber = null\n\t\tend\n\n\t\tif not negative and current_char.is_op then\n\t\t\toperands.add(current_char)\n\t\tend\n\t\tprevious_char = current_char\n\tend\n\t# Update `numbers` and `operands` array in main function with pointer\nend\n\n# Create random numbers between 1 to 9\nfun random: Array[Int] do\n\treturn [for i in 4.times do 1 + 9.rand]\nend\n\n# Make mathematical operation with `numbers` and `operands` and add the operation result into `random_numbers`\nfun calculation(random_numbers, numbers: Array[Int], operands: Array[Char]) do\n\tvar number = 0\n\tvar temp_numbers = numbers.clone\n\n\twhile temp_numbers.length > 1 do\n\t\tvar operand = operands.shift\n\t\tvar a = temp_numbers.shift\n\t\tvar b = temp_numbers.shift\n\n\t\tif operand == '+' then number = a + b\n\t\tif operand == '-' then number = a - b\n\t\tif operand == '*' then number = a * b\n\t\tif operand == '/' then number = a / b\n\n\t\ttemp_numbers.unshift(number)\n\tend\n\tif number != 0 then random_numbers.add(number)\nend\n\n# Check if used `numbers` exist in the `random_numbers` created\nfun numbers_exists(random_numbers, numbers: Array[Int]): Bool do\n\tfor number in numbers do\n\t\tif not random_numbers.count(number) >= numbers.count(number) then return false\n\tend\n\treturn true\nend\n\n# Remove `numbers` when they are used\nfun remove_numbers(random_numbers, numbers: Array[Int]) do\n\tfor number in numbers do random_numbers.remove(number)\nend\n\n# Check if the mathematical `operation` is valid\nfun check(operation: String): Bool do\n\tvar previous_char: nullable Char = null\n\tvar next_char: nullable Char = null\n\tvar next_1_char: nullable Char = null\n\n\tfor i in operation.length.times do\n\t\tvar current_char = operation[i]\n\n\t\tif i + 1 < operation.length then\n\t\t\tnext_char = operation[i + 1]\n\t\t\tif i + 2 < operation.length then\n\t\t\t\tnext_1_char = operation[i + 2]\n\t\t\telse\n\t\t\t\tnext_1_char = null\n\t\t\tend\n\t\telse\n\t\t\tnext_char = null\n\t\tend\n\n\t\tif not current_char.is_op and not current_char.is_digit then return false\n\t\tif next_char == null and current_char.is_op then return false\n\n\t\tif previous_char == null  then\n\t\t\tif next_char == null or next_1_char == null then return false\n\t\t\tif current_char == '-' and not next_char.is_digit then return false\n\t\t\tif current_char != '-' and not current_char.is_digit then return false\n\t\telse\n\t\t\tif next_char != null then\n\t\t\t\tif previous_char.is_digit and current_char.is_op and\n\t\t\t\tnot (next_char == '-' and next_1_char != null and\n\t\t\t\tnext_1_char.is_digit or next_char.is_digit) then\n\t\t\t\t\treturn false\n\t\t\t\tend\n\t\t\tend\n\t\tend\n\t\tprevious_char = current_char\n\tend\n\treturn true\nend\n\nvar random_numbers = new Array[Int]\nvar operation = \"\"\n\nrandom_numbers = random\nwhile not random_numbers.has(24) and random_numbers.length > 1 do\n\tvar numbers = new Array[Int]\n\tvar operands = new Array[Char]\n\n\tprint \"numbers: \" + random_numbers.join(\", \")\n\toperation = gets\n\tif check(operation) then\n\t\texportation(operation, numbers, operands)\n\t\tif numbers_exists(random_numbers, numbers) then\n\t\t\tcalculation(random_numbers, numbers, operands)\n\t\t\tremove_numbers(random_numbers, numbers)\n\t\telse\n\t\t\tprint \"NUMBERS ERROR!\"\n\t\tend\n\telse\n\t\tprint \"STRING ERROR!\"\n\tend\nend\n\nif random_numbers.has(24) then print \"CONGRATULATIONS\" else print \"YOU LOSE\"\n",
        "safe": true
    },
    {
        "filename": "24 game_111.txt",
        "content": "use Collection.Generic;\nuse System.Matrix;\n\nclass RPNParser {\n  @stk\u00a0: Stack<IntHolder>;\n  @digits\u00a0: List<IntHolder>;\n\n  function\u00a0: Main(args\u00a0: String[]) ~ Nil {\n    digits\u00a0:= List->New()<IntHolder>;\n    \"Make 24 with the digits: \"->Print();\n    for(i\u00a0:= 0; i < 4; i += 1;) {\n      n\u00a0: Int\u00a0:= Int->Random(1, 9);\n        \" {$n}\"->Print();\n        digits->AddBack(n);\n    };\n    '\\n'->Print();\n\n    parser\u00a0:= RPNParser->New();\n    if(parser->Parse(System.IO.Console->ReadString(), digits)) {\n      result\u00a0:= parser->GetResult();\n      if(result = 24) {\n        \"Good job!\"->PrintLine();\n      }\n      else {\n        \"{$result}, Try again.\"->PrintLine();\n      };\n    }\n    else {\n      \"Invalid sequence\"->PrintLine();\n    };\n  }\n\n  New() {\n    @stk\u00a0:= Stack->New()<IntHolder>;\n    @digits\u00a0:= List->New()<IntHolder>;\n  }\n\n  method\u00a0: Op(f\u00a0: \\Func->Calc) ~ Nil {\n    if(@stk->Size() < 2) { \"Improperly written expression\"->ErrorLine(); Runtime->Exit(1); };\n    b\u00a0:= @stk->Pop();\n    a\u00a0:= @stk->Pop();\n    @stk->Push(f(a, b));\n  }\n\n  method\u00a0: Parse(c\u00a0: Char) ~ Nil {\n    if(c >= '0' & c <= '9') {\n      value\u00a0: Int\u00a0:= c - '0';\n      @stk->Push(value);\n      @digits->AddBack(value);\n    }\n    else if(c = '+') {\n      Op(\\Func->Calc\u00a0: (a, b) => a + b);\n    }\n    else if(c = '-') {\n      Op(\\Func->Calc\u00a0: (a, b) => a - b);\n    }\n    else if(c = '*') {\n      Op(\\Func->Calc\u00a0: (a, b) => a * b);\n    }\n    else if(c = '/') {\n      Op(\\Func->Calc\u00a0: (a, b) => { if(b <> 0) { return a / b;  } else { return 0; }; });\n    };\n  }\n\n  method\u00a0: GetResult() ~ Int {\n    if(@stk->Size() = 1) {\n      return @stk->Top();\n    };\n\n    return 0;\n  }\n\n  method\u00a0: Parse(s\u00a0: String, digits\u00a0: List<IntHolder>) ~ Bool {\n    each(i\u00a0: s) {\n      Parse(s->Get(i));\n    };\n\n    @digits->Rewind();    \n    while(@digits->More()) {      \n      left\u00a0:= @digits->Get()->Get();\n      digits->Rewind();\n      found\u00a0:= false;\n      while(digits->More() & found = false) {\n        right\u00a0:= digits->Get()->Get();\n        if(left = right) { \n          digits->Remove(); found\u00a0:= true;  \n        }\n        else { \n          digits->Next(); \n        };\n      };\n      @digits->Next();\n    };\n\n    return digits->IsEmpty();\n  }\n}\n\nalias Func {\n  Calc\u00a0: (IntHolder, IntHolder) ~ IntHolder\n}",
        "safe": true
    },
    {
        "filename": "24 game_112.txt",
        "content": "ocamlopt -pp camlp4o g24.ml -o g24.opt\n",
        "safe": true
    },
    {
        "filename": "24 game_113.txt",
        "content": "type expression =\n  | Const of float\n  | Sum  of expression * expression   (* e1 + e2 *)\n  | Diff of expression * expression   (* e1 - e2 *)\n  | Prod of expression * expression   (* e1 * e2 *)\n  | Quot of expression * expression   (* e1 / e2 *)\n\nlet rec eval = function\n  | Const c -> c\n  | Sum (f, g) -> eval f +. eval g\n  | Diff(f, g) -> eval f -. eval g\n  | Prod(f, g) -> eval f *. eval g\n  | Quot(f, g) -> eval f /. eval g\n\nlet rec extract acc = function\n  | Const c -> (c::acc)\n  | Sum (f, g) -> (extract acc f) @ (extract [] g)\n  | Diff(f, g) -> (extract acc f) @ (extract [] g)\n  | Prod(f, g) -> (extract acc f) @ (extract [] g)\n  | Quot(f, g) -> (extract acc f) @ (extract [] g)\n\nopen Genlex\n\nlet lexer = make_lexer [\"(\"; \")\"; \"+\"; \"-\"; \"*\"; \"/\"]\n\nlet rec parse_expr = parser\n     [< e1 = parse_mult; e = parse_more_adds e1 >] -> e\n and parse_more_adds e1 = parser\n     [< 'Kwd \"+\"; e2 = parse_mult; e = parse_more_adds (Sum(e1, e2)) >] -> e\n   | [< 'Kwd \"-\"; e2 = parse_mult; e = parse_more_adds (Diff(e1, e2)) >] -> e\n   | [< >] -> e1\n and parse_mult = parser\n     [< e1 = parse_simple; e = parse_more_mults e1 >] -> e\n and parse_more_mults e1 = parser\n     [< 'Kwd \"*\"; e2 = parse_simple; e = parse_more_mults (Prod(e1, e2)) >] -> e\n   | [< 'Kwd \"/\"; e2 = parse_simple; e = parse_more_mults (Quot(e1, e2)) >] -> e\n   | [< >] -> e1\n and parse_simple = parser\n   | [< 'Int i >] -> Const(float i)\n   | [< 'Float f >] -> Const f\n   | [< 'Kwd \"(\"; e = parse_expr; 'Kwd \")\" >] -> e\n\n\nlet parse_expression = parser [< e = parse_expr; _ = Stream.empty >] -> e\n\nlet read_expression s = parse_expression(lexer(Stream.of_string s))\n\n\nlet () =\n  Random.self_init();\n  print_endline \"\n  The 24 Game\n\n  Given any four digits in the range 1 to 9, which may have repetitions,\n  Using just the +, -, *, and / operators; and the possible use of\n  brackets, (), show how to make an answer of 24.\n\n  An answer of 'q' will quit the game.\n  An answer of '!' will generate a new set of four digits.\n  Otherwise you are repeatedly asked for an expression until it evaluates to 24\n\n  Note: you cannot form multiple digit numbers from the supplied digits,\n  so an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\\n\";\n\n  let sort = List.sort compare in\n  let digits = ref [] in\n  let digit_set () =\n    let ar = Array.init 4 (fun _ -> 1 + Random.int 9) in\n    digits := Array.to_list(Array.map float_of_int ar);\n    print_string \"The four digits: \";\n    List.iter (Printf.printf \" %g\") !digits;\n    print_newline();\n  in\n\n  digit_set();\n  while true do\n    print_string \"Expression: \";\n    let str = read_line() in\n    if str = \"q\" then exit 0;\n    if str = \"!\" then digit_set()\n    else begin\n      let expr = read_expression str in\n      let res = eval expr in\n      Printf.printf \" = %g\\n%!\" res;\n      if res = 24.\n      && (sort !digits) = (sort (extract [] expr))\n      then (print_endline \"Congratulations!\"; digit_set())\n      else print_endline \"Try again\"\n    end\n  done\n",
        "safe": true
    },
    {
        "filename": "24 game_114.txt",
        "content": "import: mapping\n\n: game\n| l expr w n i |\n   4 #[ 9 rand ] Array init ->l\n \n   System.Out \"Digits\u00a0: \" << l << \" --> RPN Expression for 24\u00a0: \" << drop \n   System.Console accept ->expr\n \n   expr words forEach: w [\n      w \"+\" == ifTrue: [ + continue ]\n      w \"-\" == ifTrue: [ - continue ]\n      w \"*\" == ifTrue: [ * continue ]\n      w \"/\" == ifTrue: [ >float / continue ]\n \n      w >integer dup ->n  ifNull: [ System.Out \"Word \" << w << \" not allowed \" << cr break ]\n      n l indexOf dup ->i ifNull: [ System.Out \"Integer \" << n << \" is wrong \" << cr break ]\n      n l put(i, null)\n      ]\n   #null? l conform? ifFalse: [ \"Sorry, all numbers must be used...\" . return ]\n   24 if=: [ \"You won\u00a0!\" ] else: [ \"You loose...\" ] .\n;",
        "safe": true
    },
    {
        "filename": "24 game_115.txt",
        "content": "DEFINE TEMP-TABLE tt NO-UNDO FIELD ii AS INTEGER.\n\nDEFINE VARIABLE p_deanswer    AS DECIMAL     NO-UNDO.\nDEFINE VARIABLE idigits       AS INTEGER     NO-UNDO EXTENT 4.\nDEFINE VARIABLE ii            AS INTEGER     NO-UNDO.\nDEFINE VARIABLE Digits        AS CHARACTER   NO-UNDO FORMAT \"x(7)\".\nDEFINE VARIABLE Answer        AS CHARACTER   NO-UNDO FORMAT \"x(7)\".\nDEFINE VARIABLE cexpression   AS CHARACTER   NO-UNDO.\nDEFINE VARIABLE cmessage      AS CHARACTER   NO-UNDO.\nDEFINE VARIABLE cchar         AS CHARACTER   NO-UNDO.\n\nFUNCTION calculate RETURNS LOGICAL (\n   i_de AS DECIMAL\n):\n   p_deanswer = i_de.\nEND FUNCTION.\n\n/* generate problem */\nDO ii = 1 TO 4:\n   ASSIGN\n      idigits [ii]   =  RANDOM( 1, 9 ).\n      Digits         =  Digits + STRING( idigits [ii] ) + \" \"\n      .\nEND.\n\n/* ui */\nDISPLAY Digits.\nUPDATE Answer.\n\n/* check valid input */\nDO ii = 1 TO 7:\n   cchar = SUBSTRING( Answer, ii, 1 ).\n   IF cchar > \"\" THEN DO:\n      IF ii MODULO 2 = 1 THEN DO:\n         IF LOOKUP( cchar, Digits, \" \" ) = 0 THEN\n            cmessage = cmessage + SUBSTITUTE( \"Invalid digit: &1.~r\", cchar ).\n         ELSE \n            ENTRY( LOOKUP( cchar, Digits, \" \" ), Digits, \" \" ) = \"\".\n      END.\n      ELSE DO:\n         IF LOOKUP( cchar, \"+,-,/,*\" ) = 0 THEN\n            cmessage = cmessage + SUBSTITUTE( \"&1 is not a valid operator.~r\", cchar ).\n      END.\n   END.\nEND.\nIF TRIM( Digits ) > \"\" THEN\n   cmessage = cmessage + SUBSTITUTE( \"You did not use digits: &1\":U, TRIM( Digits ) ).\n\nIF cmessage = \"\" THEN DO:\n   /* expressions need spacing */\n   DO ii = 1 TO 7:\n      cexpression = cexpression + SUBSTRING( Answer, ii, 1 ) + \" \".\n   END.\n   /* use dynamic query to parse expression */\n   TEMP-TABLE tt:DEFAULT-BUFFER-HANDLE:FIND-FIRST( \n      SUBSTITUTE(\n         \"WHERE NOT DYNAMIC-FUNCTION( 'calculate', DECIMAL( &1 ) )\",\n         cexpression\n      )\n   ) NO-ERROR.\n   IF p_deanswer <> 24 THEN\n      cmessage = cmessage + SUBSTITUTE( \"The expression evaluates to &1.\", p_deanswer ).\n   ELSE \n      cmessage = \"Solved!\".\nEND.\n\nMESSAGE cmessage VIEW-AS ALERT-BOX.\n",
        "safe": true
    },
    {
        "filename": "24 game_116.txt",
        "content": "game()={\n  my(v=vecsort(vector(4,i,random(8)+1)));\n  print(\"Form 24 using */+-() and: \"v);\n  while(1,\n    my(ans=input);\n    if (!valid(s,v), next);\n    trap(,\n      print(\"Arithmetic error\");\n      next\n    ,\n      if(eval(s)==24, break, print(\"Bad sum\"))\n    )\n  );\n  print(\"You win!\")\n};\nvalid(s,v)={\n  my(op=vecsort(Vec(\"+-*/()\")),u=[]);\n  s=Vec(s);\n  for(i=1,#s,\n    if(setsearch(op,s[i]),next);\n    trap(,\n      print(\"Invalid character \"s[i]);\n      return(0)\n    ,\n      if(setsearch(v,eval(s[i])),\n        u=concat(u,eval(s[i]))\n      ,\n        print(s[i]\" not allowed\");\n        return(0)\n      )\n    )\n  );\n  for(i=2,#s,\n    if(!setsearch(op,s[i])&!setsearch(op,s[i-1]),\n      print(\"Concatenating digits is not allowed!\");\n      return(0)\n    )\n  );\n  if(vecsort(u)!=v,\n    print(\"Invalid digits\");\n    0\n  ,\n    1\n  )\n};",
        "safe": true
    },
    {
        "filename": "24 game_117.txt",
        "content": "#!/usr/bin/env perl\nuse warnings;\nuse strict;\nuse feature 'say';\n\nprint <<'EOF';\nThe 24 Game\n\nGiven any four digits in the range 1 to 9, which may have repetitions,\nUsing just the +, -, *, and / operators; and the possible use of\nparentheses, (), show how to make an answer of 24.\n\nAn answer of \"q\" or EOF will quit the game.\nA blank answer will generate a new set of four digits.\nOtherwise you are repeatedly asked for an expression until it evaluates to 24.\n\nNote: you cannot form multiple digit numbers from the supplied digits,\nso an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\nEOF\n\nmy $try = 1;\nwhile (1) {\n  my @digits = map { 1+int(rand(9)) } 1..4;\n  say \"\\nYour four digits: \", join(\" \", @digits);\n  print \"Expression (try \", $try++, \"): \";\n\n  my $entry = <>;\n  if (!defined $entry || $entry eq 'q') \n    { say \"Goodbye.  Sorry you couldn't win.\"; last; }\n  $entry =~ s/\\s+//g;  # remove all white space\n  next if $entry eq '';\n\n  my $given_digits = join \"\", sort @digits;\n  my $entry_digits = join \"\", sort grep { /\\d/ } split(//, $entry);\n  if ($given_digits ne $entry_digits ||  # not correct digits\n      $entry =~ /\\d\\d/ ||                # combined digits\n      $entry =~ m|[-+*/]{2}| ||          # combined operators\n      $entry =~ tr|-0-9()+*/||c)         # Invalid characters\n    { say \"That's not valid\";  next; }\n\n  my $n = eval $entry;\n\n  if    (!defined $n) { say \"Invalid expression\"; }\n  elsif ($n == 24)    { say \"You win!\"; last; }\n  else                { say \"Sorry, your expression is $n, not 24\"; }\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_118.txt",
        "content": "-- Note this uses simple/strict left association, so for example:\n--  1+2*1*8 is ((1+2)*1)*8 not 1+((2*1)*8) [or 1+(2*(1*8))], and\n--  7-(2*2)*8 is (7-(2*2))*8 not 7-((2*2)*8)\n--  Does not allow unary minus on the first digit.\n-- Uses solve24() from the next task, when it can.\n--  (you may want to comment out the last 2 lines/uncomment the if 0, in that file)\n--\n--include 24_game_solve.exw\n \n--with trace\nforward function eval(string equation, sequence unused, integer idx=1)\n-- (the above definition is entirely optional, but good coding style)\n \nconstant errorcodes = {\"digit expected\",                    -- 1\n                       \"')' expected\",                      -- 2\n                       \"digit already used\",                -- 3\n                       \"digit not offered\",                 -- 4\n                       \"operand expected\"}                  -- 5\n \nfunction card(integer idx)  -- (for error handling)\n    if idx=1 then return \"1st\" end if\n    if idx=2 then return \"2nd\" end if\n    -- (assumes expression is less than 21 characters)\n    return sprintf(\"%dth\",idx)\nend function\n \nfunction errorchar(sequence equation, integer idx)\n    if idx>length(equation) then return \"\" end if\n    return sprintf(\"(%s)\",equation[idx])\nend function\n \nsequence rset = repeat(0,4)\n \nprocedure new_rset()\n    for i=1 to length(rset) do\n        rset[i] = rand(9)\n    end for\nend procedure\n \nfunction get_operand(string equation, integer idx, sequence unused)\n    integer error = 1 -- \"digit expected\"\n    atom res\n \n    if idx<=length(equation) then\n        integer ch = equation[idx]\n        if ch='(' then\n            {error,res,unused,idx} = eval(equation,unused,idx+1)\n            if error=0\n            and idx<=length(equation) then\n                ch = equation[idx]\n                if ch=')' then\n                    return {0,res,unused,idx+1}\n                end if\n            end if\n            if error=0 then\n                error = 2   -- \"')' expected\"\n            end if\n        elsif ch>='0' and ch<='9' then\n            res = ch-'0'\n            integer k = find(res,unused)\n            if k!=0 then\n                unused[k..k] = {}\n                return {0,res,unused,idx+1}\n            end if\n            if find(res,rset) then\n                error = 3  -- \"digit already used\"\n            else\n                error = 4  -- \"digit not offered\"\n            end if\n        end if\n    end if\n    return {error,0,unused,idx}\nend function\n \nfunction get_operator(string equation, integer idx)\n    integer error = 5 -- \"operand expected\"\n    if idx<=length(equation) then\n        integer ch = equation[idx]\n        if find(ch,\"+-/*\") then\n            return {0,ch,idx+1}\n        end if\n    end if\n    return {error,0,idx}\nend function\n \nfunction eval(string equation, sequence unused, integer idx=1)\n    atom lhs, rhs\n    integer ch, error\n    {error,lhs,unused,idx} = get_operand(equation,idx,unused)\n    if error=0 then\n        while 1 do\n            {error,ch,idx} = get_operator(equation,idx)\n            if error!=0 then exit end if\n            {error,rhs,unused,idx} = get_operand(equation,idx,unused)\n            if error!=0 then exit end if\n            if    ch='+' then       lhs += rhs\n            elsif ch='-' then       lhs -= rhs\n            elsif ch='/' then       lhs /= rhs\n            elsif ch='*' then       lhs *= rhs\n            else ?9/0 -- (should not happen)\n            end if\n            if idx>length(equation) then\n                return {0,lhs,unused,idx}\n            end if\n            ch = equation[idx]\n            if ch=')' then\n                return {0,lhs,unused,idx}\n            end if\n        end while\n    end if\n    return {error,0,unused,idx}\nend function\n \nfunction strip(string equation)\n    for i=length(equation) to 1 by -1 do\n        if find(equation[i],\" \\t\\r\\n\") then\n            equation[i..i] = \"\"\n        end if\n    end for\n    return equation\nend function\n \nfunction strip0(atom a) -- (for error handling)\n    string res = sprintf(\"%f\",a)\n    for i=length(res) to 2 by -1 do\n        integer ch = res[i]\n        if ch='.' then return res[1..i-1] end if\n        if ch!='0' then return res[1..i] end if\n    end for\n    return res\nend function\n \nprocedure play()\n    sequence unused\n    string equation\n    integer error,idx\n    atom res\n \n    new_rset()\n    printf(1,\"Enter an expression which evaluates to exactly 24\\n\"&\n             \"Use all of, and only, the digits %d, %d, %d, and %d\\n\"&\n             \"You may only use the operators + - * /\\n\"&\n             \"Parentheses and spaces are allowed\\n\",rset)\n    while 1 do\n        equation = strip(gets(0))\n        if upper(equation)=\"Q\" then exit end if\n        if equation=\"?\" then\n            puts(1,\"\\n\")\n            integer r_solve24 = routine_id(\"solve24\") -- see below\n            if r_solve24=-1 then -- (someone copied just this code out?)\n                puts(1,\"no solve24 routine\\n\")\n            else\n                call_proc(r_solve24,{rset})\n            end if\n        else\n            {error,res,unused,idx} = eval(equation, rset)\n            if error!=0 then\n                printf(1,\"  %s on the %s character%s\\n\",{errorcodes[error],card(idx),errorchar(equation,idx)})\n            elsif idx<=length(equation) then\n                printf(1,\"\\neval() returned only having processed %d of %d characters\\n\",{idx,length(equation)})\n            elsif length(unused) then\n                printf(1,\" not all the digits were used\\n\",error)\n            elsif res!=24 then\n                printf(1,\"\\nresult is %s, not 24\\n\",{strip0(res)})\n            else\n                puts(1,\" correct!  Press any key to quit\\n\")\n                {} = wait_key()\n                exit\n            end if\n        end if\n        puts(1,\"enter Q to give up and quit\\n\")\n    end while\nend procedure\n \nplay()\n",
        "safe": true
    },
    {
        "filename": "24 game_119.txt",
        "content": "#!/usr/bin/env php\nThe 24 Game\n \nGiven any four digits in the range 1 to 9, which may have repetitions,\nUsing just the +, -, *, and / operators; and the possible use of\nbrackets, (), show how to make an answer of 24.\n \nAn answer of \"q\" will quit the game.\nAn answer of \"!\" will generate a new set of four digits.\nOtherwise you are repeatedly asked for an expression until it evaluates to 24\n \nNote: you cannot form multiple digit numbers from the supplied digits,\nso an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\n\n<?php\n\nwhile (true) {\n    $numbers = make_numbers();\n\n    for ($iteration_num = 1; ; $iteration_num++) {\n        echo \"Expresion $iteration_num: \";\n\n        $entry = rtrim(fgets(STDIN));\n\n        if ($entry === '!') break;\n        if ($entry === 'q') exit;\n\n        $result = play($numbers, $entry);\n\n        if ($result === null) {\n            echo \"That's not valid\\n\";\n            continue;\n        }\n        elseif ($result != 24) {\n            echo \"Sorry, that's $result\\n\";\n            continue;\n        }\n        else {\n            echo \"That's right! 24!!\\n\";\n            exit;\n        }\n    }\n}\n\nfunction make_numbers() {\n    $numbers = array();\n\n    echo \"Your four digits: \";\n\n    for ($i = 0; $i < 4; $i++) {\n        $number = rand(1, 9);\n        // The check is needed to avoid E_NOTICE from PHP\n        if (!isset($numbers[$number])) {\n            $numbers[$number] = 0;\n        }\n        $numbers[$number]++;\n        print \"$number \";\n    }\n\n    print \"\\n\";\n\n    return $numbers;\n}\n\nfunction play($numbers, $expression) {\n    $operator = true;\n    for ($i = 0, $length = strlen($expression); $i < $length; $i++) {\n        $character = $expression[$i];\n\n        if (in_array($character, array('(', ')', ' ', \"\\t\"))) continue;\n\n        $operator = !$operator;\n\n        if (!$operator) {\n            if (!empty($numbers[$character])) {\n                $numbers[$character]--;\n                continue;\n            }\n            return;\n        }\n        elseif (!in_array($character, array('+', '-', '*', '/'))) {\n            return;\n        }\n    }\n\n    foreach ($numbers as $remaining) {\n        if ($remaining > 0) {\n            return;\n        }\n    }\n    \n    return eval(\"return $expression;\");\n}\n?>\n",
        "safe": true
    },
    {
        "filename": "24 game_12.txt",
        "content": "/* ARM assembly Raspberry PI  */\n/*  program game24.s   */ \n\n/* REMARK 1\u00a0: this program use routines in a include file \n   see task Include a file language arm assembly \n   for the routine affichageMess conversion10 \n   see at end of this program the instruction include */\n/* for constantes see task include a file in arm assembly */\n/************************************/\n/* Constantes                       */\n/************************************/\n.include \"../constantes.inc\"\n.equ STDIN,      0       @ Linux input console\n.equ READ,       3       @ Linux syscall\n.equ NBDIGITS,   4       @ digits number\n.equ TOTAL,      24\n.equ BUFFERSIZE, 100\n.equ STACKSIZE,  10      @ operator and digits number items in stacks\n\n\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nszMessRules:         .ascii \"24 Game\\n\"\n                    .ascii \"The program will display four randomly-generated \\n\"\n                    .ascii \"single-digit numbers and will then prompt you to enter\\n\"\n                    .ascii \"an arithmetic expression followed by <enter> to sum \\n\"\n                    .ascii \"the given numbers to 24.\\n\"\n                    .asciz \"Exemple\u00a0: 9+8+3+4   or (7+5)+(3*4) \\n\\n\"\n\nszMessExpr:         .asciz \"Enter your expression (or type (q)uit to exit or (n) for other digits): \\n\"\n//szMessErrChoise:    .asciz \"invalid choice.\\n \"\nszMessDigits:       .asciz \"The four digits are @ @ @ @ and the score is 24. \\n\"\nszMessNoDigit:      .asciz \"Error\u00a0: One digit is not in digits list\u00a0!! \\n\"\nszMessSameDigit:    .asciz \"Error\u00a0: Two digits are same\u00a0!! \\n\"\nszMessOK:           .asciz \"It is OK. \\n\"\nszMessNotOK:        .asciz \"Error, it is not ok  total = @ \\n\"\nszMessErrOper:      .asciz \"Unknow Operator (+,-,$,/,(,)) \\n\"\nszMessNoparen:      .asciz \"no opening parenthesis\u00a0!! \\n\"\nszMessErrParen:     .asciz \"Error parenthesis number\u00a0!! \\n\"\nszMessNoalldigits:  .asciz \"One or more digits not used\u00a0!!\\n\"\nszMessNewGame:      .asciz \"New game (y/n)\u00a0? \\n\"\nszCarriageReturn:   .asciz \"\\n\"\n.align 4\niGraine:  .int 123456\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\nsZoneConv:        .skip 24\nsBuffer:          .skip BUFFERSIZE\niTabDigit:        .skip 4 * NBDIGITS\niTabTopDigit:     .skip 4 * NBDIGITS\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                 @ entry of program \n    \n    ldr r0,iAdrszMessRules            @ display rules\n    bl affichageMess\n1:\n    mov r3,#0\n    ldr r12,iAdriTabDigit\n    ldr r11,iAdriTabTopDigit\n    ldr r5,iAdrszMessDigits\n2:                                    @ loop generate random digits \n    mov r0,#8\n    bl genereraleas \n    add r0,r0,#1\n    str r0,[r12,r3,lsl #2]            @ store in table\n    mov r1,#0\n    str r1,[r11,r3,lsl #2]            @ raz top table\n    ldr r1,iAdrsZoneConv\n    bl conversion10                   @ call decimal conversion\n    mov r2,#0\n    strb r2,[r1,r0]                   @ reduce size display area with z\u00e9ro final\n    mov r0,r5\n    ldr r1,iAdrsZoneConv              @ insert conversion in message\n    bl strInsertAtCharInc\n    mov r5,r0\n    add r3,r3,#1\n    cmp r3,#NBDIGITS                  @ end\u00a0?\n    blt 2b                            @ no -> loop\n    mov r0,r5\n    bl affichageMess\n3:                                    @ loop human entry\n    ldr r0,iAdrszMessExpr\n    bl affichageMess\n    bl saisie                         @ entry\n    cmp r0,#'q'\n    beq 100f\n    cmp r0,#'Q'\n    beq 100f\n    cmp r0,#'n'\n    beq 1b\n    cmp r0,#'N'\n    beq 1b\n \n    bl evalExpr                      @ expression evaluation\n    cmp r0,#0                        @ ok ?\n    bne 3b                           @ no - > loop\n\n10:                                  @ display new game ?\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess\n    ldr r0,iAdrszMessNewGame\n    bl affichageMess\n    bl saisie\n    cmp r0,#'y'\n    beq 1b\n    cmp r0,#'Y'\n    beq 1b\n    \n100:                                  @ standard end of the program \n    mov r0, #0                        @ return code\n    mov r7, #EXIT                     @ request to exit program\n    svc #0                            @ perform the system call\n \niAdrszCarriageReturn:     .int szCarriageReturn\niAdrszMessRules:          .int szMessRules\niAdrszMessDigits:         .int szMessDigits\niAdrszMessExpr:           .int szMessExpr\niAdrszMessNewGame:        .int szMessNewGame\niAdrsZoneConv:            .int sZoneConv\niAdriTabDigit:            .int iTabDigit\niAdriTabTopDigit:         .int iTabTopDigit\n/******************************************************************/\n/*            evaluation expression                                       */ \n/******************************************************************/\n/* r0 return 0 if ok -1 else */\nevalExpr:\n    push {r1-r11,lr}           @ save registers\n    \n    mov r0,#0\n    ldr r1,iAdriTabTopDigit\n    mov r2,#0\n1:                             @ loop init table top digits\n    str r0,[r1,r2,lsl #2]\n    add r2,r2,#1\n    cmp r2,#NBDIGITS\n    blt 1b\n    \n    sub sp,sp,#STACKSIZE * 4   @ stack operator\n    mov fp,sp\n    sub sp,sp,#STACKSIZE * 4   @ stack digit\n    mov r1,sp\n    ldr r10,iAdrsBuffer\n    mov r8,#0                  @ indice character in buffer\n    mov r7,#0                  @ indice digits stack\n    mov r2,#0                  @ indice operator stack\n1:                             @ begin loop\n    ldrb r9,[r10,r8]\n    cmp r9,#0xA               @ end expression ?\n    beq 90f\n    cmp r9,#' '               @ space \u00a0?\n    addeq r8,r8,#1             @ loop\n    beq 1b\n    cmp r9,#'('               @ left parenthesis -> store in operator stack\n    streq r9,[fp,r2,lsl #2]\n    addeq r2,r2,#1\n    addeq r8,r8,#1             @ and loop\n    beq 1b\n    cmp r9,#')'               @ right parenthesis\u00a0?\n    bne 3f\n    mov r0,fp                  @ compute operator stack until left parenthesis\n    sub r2,r2,#1\n2:\n    ldr r6,[fp,r2,lsl #2]\n    cmp r6,#'('                @ left parenthesis\n    addeq r8,r8,#1             @ end ?\n    beq 1b                     @ and loop\n    sub r7,r7,#1               @ last digit\n    mov r3,r7\n    bl compute\n    sub r2,r2,#1\n    cmp r2,#0\n    bge 2b\n    ldr r0,iAdrszMessNoparen   @ no left parenthesis in stack\n    bl affichageMess\n    mov r0,#-1\n    b 100f\n3:\n    cmp r9,#'+'               @ addition\n    beq 4f\n    cmp r9,#'-'               @ soustraction\n    beq 4f\n    cmp r9,#'*'               @ multiplication\n    beq 4f\n    cmp r9,#'/'               @ division\n    beq 4f\n\n    b 5f                       @ not operator\n\n4:                             @ control priority and depile stacks\n    mov r0,fp\n    mov r3,r7\n    mov r4,r9\n    bl depileOper\n    mov r7,r3\n    add r8,r8,#1\n    b 1b                       @ and loop \n \n5:                             @  digit\n    sub r9,r9,#0x30\n    mov r0,r9\n    bl digitControl\n    cmp r0,#0                  @ error ?\n    bne 100f\n    str r9,[r1,r7,lsl #2]     @ store digit in digits stack\n    add r7,r7,#1\n\n    add r8,r8,#1\n    beq 1b    \n\n    b 100f\n90:                            @ compute all stack operators\n    mov r0,fp\n    sub r7,r7,#1\n91:\n    subs r2,r2,#1\n    blt 92f\n    mov r3,r7\n    bl compute\n    sub r7,r7,#1\n    b 91b\n92: \n    ldr r0,[r1]                 @ total = first value on digits stack\n    cmp r0,#TOTAL               @ control total \n    beq 93f                     @ ok \n    ldr r1,iAdrsZoneConv\n    bl conversion10             @ call decimal conversion\n    mov r2,#0\n    strb r2,[r1,r0]\n    ldr r0,iAdrszMessNotOK\n    ldr r1,iAdrsZoneConv        @ insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n    mov r0,#-1\n    b 100f\n93:                             @ control use all digits\n    ldr r1,iAdriTabTopDigit\n    mov r2,#0\n94:                             @ begin loop\n    ldr r0,[r1,r2,lsl #2]       @ load top\n    cmp r0,#0            \n    bne 95f\n    ldr r0,iAdrszMessNoalldigits\n    bl affichageMess\n    mov r0,#-1\n    b 100f\n95:\n    add r2,r2,#1\n    cmp r2,#NBDIGITS\n    blt 94b\n96:                             @ display message OK\n    ldr r0,iAdrszMessOK\n    bl affichageMess\n    mov r0,#0\n    b 100f\n    \n100:\n    add sp,sp,#80               @ stack algnement\n    pop {r1-r11,lr}\n    bx lr                       @ return \niAdrszMessNoparen:        .int szMessNoparen\niAdrszMessNotOK:          .int szMessNotOK\niAdrszMessOK:             .int szMessOK\niAdrszMessNoalldigits:    .int szMessNoalldigits\n/******************************************************************/\n/*            depile operator                                     */ \n/******************************************************************/\n/* r0 operator stack address  */\n/* r1 digits stack address */\n/* r2 operator indice */\n/* r3 digits indice */\n/* r4 operator */\n/* r2 return a new operator indice */\n/* r3 return a new digits indice */\ndepileOper:\n    push {r4-r8,lr}        @ save registers\n    cmp r2,#0              @ first operator ?\n    beq 60f\n    sub r5,r2,#1\n1:\n    ldr r6,[r0,r5,lsl #2]  @ load stack operator\n    cmp r6,r4              @ same operators\n    beq 50f\n    cmp r6,#'*'            @ multiplication\n    beq 50f\n    cmp r6,#'/'            @ division\n    beq 50f\n    cmp r6,#'-'            @ soustraction\n    beq 50f\n    \n    b 60f\n50:                        @ depile operators stack and compute\n    sub r2,r2,#1\n    sub r3,r3,#1\n    bl compute\n    sub r5,r5,#1\n    cmp r5,#0\n    bge 1b\n60:\n    str r4,[r0,r2,lsl #2]  @ add operator in stack\n    add r2,r2,#1\n    \n100:\n    pop {r4-r8,lr}\n    bx lr                  @ return \n/******************************************************************/\n/*            compute                                             */ \n/******************************************************************/\n/* r0 operator stack address  */\n/* r1 digits stack address */\n/* r2 operator indice */\n/* r3 digits indice */\ncompute:\n    push {r1-r8,lr}        @ save registers\n    ldr r6,[r1,r3,lsl #2]  @ load second digit\n    sub r5,r3,#1\n    ldr r7,[r1,r5,lsl #2]  @ load first digit\n    \n    ldr r8,[r0,r2,lsl #2]  @ load operator\n    cmp r8,#'+'\n    bne 1f\n    add r7,r7,r6           @ addition\n    str r7,[r1,r5,lsl #2] \n    b 100f\n1:     \n    cmp r8,#'-'\n    bne 2f\n    sub r7,r7,r6           @ soustaction\n    str r7,[r1,r5,lsl #2] \n    b 100f\n2:\n    cmp r8,#'*'\n    bne 3f                 @ multiplication\n    mul r7,r6,r7\n    str r7,[r1,r5,lsl #2] \n    b 100f\n3:\n    cmp r8,#'/'\n    bne 4f\n    udiv r7,r7,r6          @ division\n    str r7,[r1,r5,lsl #2]\n    b 100f\n4:\n    cmp r8,#'('            @ left parenthesis\u00a0?\n    bne 5f\n    ldr r0,iAdrszMessErrParen @  error \n    bl affichageMess\n    mov r0,#-1\n    b 100f\n5:\n    ldr r0,iAdrszMessErrOper\n    bl affichageMess\n    mov r0,#-1\n100:\n    pop {r1-r8,lr}\n    bx lr                   @ return \niAdrszMessErrOper:   .int szMessErrOper\niAdrszMessErrParen:  .int szMessErrParen\n/******************************************************************/\n/*            control digits                                       */ \n/******************************************************************/\n/* r0 return 0 if OK 1 if  not digit   */\ndigitControl:\n    push {r1-r4,lr}        @ save registers\n    ldr r1,iAdriTabTopDigit\n    ldr r2,iAdriTabDigit\n    mov r3,#0\n1:\n    ldr r4,[r2,r3,lsl #2]  @ load digit\n    cmp r0,r4              @ equal ?\n    beq 2f                 @ yes\n    add r3,r3,#1           @ no -> loop\n    cmp r3,#NBDIGITS       @ end\u00a0?\n    blt 1b\n    ldr r0,iAdrszMessNoDigit @ error\n    bl affichageMess\n    mov r0,#1\n    b 100f\n2:                         @ control prev use \n    ldr r4,[r1,r3,lsl #2]\n    cmp r4,#0\n    beq 3f\n    add r3,r3,#1\n    cmp r3,#NBDIGITS\n    blt 1b\n    ldr r0,iAdrszMessSameDigit\n    bl affichageMess\n    mov r0,#1\n    b 100f\n3:\n    mov r4,#1\n    str r4,[r1,r3,lsl #2]\n    mov r0,#0\n100:\n    pop {r1-r4,lr}\n    bx lr                   @ return \niAdrszMessNoDigit:     .int szMessNoDigit\niAdrszMessSameDigit:   .int szMessSameDigit\n/******************************************************************/\n/*            string entry                                       */ \n/******************************************************************/\n/* r0 return the first character of human entry */\nsaisie:\n    push {r1-r7,lr}        @ save registers\n    mov r0,#STDIN          @ Linux input console\n    ldr r1,iAdrsBuffer     @ buffer address \n    mov r2,#BUFFERSIZE     @ buffer size \n    mov r7,#READ           @ request to read datas\n    svc 0                  @ call system\n    ldr r1,iAdrsBuffer     @ buffer address \n    ldrb r0,[r1]           @ load first character\n100:\n    pop {r1-r7,lr}\n    bx lr                   @ return \niAdrsBuffer:         .int sBuffer\n/***************************************************/\n/*   Generation random number                  */\n/***************************************************/\n/* r0 contains limit  */\ngenereraleas:\n    push {r1-r4,lr}         @ save registers \n    ldr r4,iAdriGraine\n    ldr r2,[r4]\n    ldr r3,iNbDep1\n    mul r2,r3,r2\n    ldr r3,iNbDep2\n    add r2,r2,r3\n    str r2,[r4]             @ maj de la graine pour l appel suivant \n    cmp r0,#0\n    beq 100f\n    add r1,r0,#1            @ divisor\n    mov r0,r2               @ dividende\n    bl division\n    mov r0,r3               @ r\u00e9sult = remainder\n  \n100:                        @ end function\n    pop {r1-r4,lr}          @ restaur registers\n    bx lr                   @ return\n/*****************************************************/\niAdriGraine: .int iGraine\niNbDep1:     .int 0x343FD\niNbDep2:     .int 0x269EC3 \n/***************************************************/\n/*      ROUTINES INCLUDE                           */\n/***************************************************/\n.include \"../affichage.inc\"\n",
        "safe": true
    },
    {
        "filename": "24 game_120.txt",
        "content": "import util.\n\nmain =>\n    play.\n\nplay =>\n    nl,\n    Digits = [random() mod 9 + 1\u00a0: _ in 1..4].sort(),\n    println(\"Enter \\\"q\\\" to quit\"),\n    println(\"Enter \\\"!\\\" to request a new set of four digits.\"),\n    printf(\"Or enter expression using %w => \", Digits),\n    Exp = read_line().strip(),\n    evaluate(Digits,Exp).\n\nevaluate(_Digits,\"q\") => halt.\nevaluate(_Digits,\"!\") => play.\nevaluate(Digits,Exp) => \n    Operands = [to_int(D)\u00a0: D in Exp, digit(D)].sort(),\n    (Digits\u00a0!== Operands ->\n        println(\"You must use the given digits:\" ++ to_string(Digits))\n   \u00a0;\n        catch(Term = parse_term(Exp), Exception, println(Exception)),\n        Res is Term,\n        (Res =:= 24 ->\n            println(\"Good work!\")\n       \u00a0;\n            println(\"Wong expression\")\n        )\n    ),\n    play.",
        "safe": true
    },
    {
        "filename": "24 game_121.txt",
        "content": "(load \"@lib/frac.l\")\n\n(de random4digits ()\n   (setq Numbers (make (do 4 (link (rand 1 9)))))\n   Numbers )\n\n(de prompt ()\n   (prinl\n      \"^JPlease enter a 'Lisp' expression (integer or fractional math) that equals 24,^J\"\n      \"using (, ), frac, + or f+, - or f-, * or f*, / or f/, and \" Numbers \"^J\"\n      \"(use each number only once). Enter . to quit.\" ) )\n\n(de getinput ()\n   (setq Expression (catch \u2019NIL (in NIL (read))))\n   Expression )\n\n(de checkexpression (Numbers Expression)\n   (make\n      (when (diff Numbers (fish num? Expression))\n         (link \"Not all numbers used.\") )\n      (when (diff (fish num? Expression) Numbers)\n         (link \"Using wrong number(s).\"))\n      (if (sub? \"f\" (pack Expression))\n         (when (diff (fish sym? Expression) '(frac f+ f- f* f/))\n            (link \"Illegal operator(s). If fractional expression, must use frac, f+, f-, f*, f/ only.\") )\n         (when (diff (fish sym? Expression) '(+ - * /))\n            (link \"Using illegal operator(s).\") ) ) ) )\n\n(de instructions ()\n   (prinl \"Example 'Lisp' expression: (- (* 3 9) (+ 1 2))\")\n   (prinl\n      \"Example 'Lisp' fractional expression:^J\"\n      \"(f- (f* (frac 3 1)(frac 9 1)) (f+ (frac 1 1)(frac 2 1)))\" )\n   (prinl\n      \"Use a fractional expression 'just for fun (as above)' OR if your solution^J\"\n      \"would lose remainder value(s) otherwise (through integer division).\" ) )\n\n(de loopuntilquit ()\n   (instructions)\n   (loop\n      (set 'Numbers (random4digits))\n      (prompt)\n      (set 'Expression (getinput))\n      (if (= Expression \".\") (prog (prinl \"bye!\") (bye)))\n      (set 'Check (checkexpression Numbers Expression))\n      (if (car Check)\n         (mapcar prinl Check)\n         (prog\n            (set 'Evaluated (eval Expression))\n            (if (or (= Evaluated 24) (= Evaluated (24 . 1)))\n               (prinl \"Congratulations!\")\n               (prinl \"That evaluated to \" Evaluated \" Try again!\") ) ) ) ) )\n\n(loopuntilquit)",
        "safe": true
    },
    {
        "filename": "24 game_122.txt",
        "content": "pil 24game.l +\nExample 'Lisp' expression: (+ (* 4 5) (- 1 2))\nExample 'Lisp' fractional expression: (f+ (f* (frac 4 1)(frac 5 1)) (f- (frac 1 1)(frac 2 1)))\nUse a fractional expression if your solution would lose remainder value(s) otherwise.\n\nPlease enter a 'Lisp' expression (regular or fractional math style) that equals 24,\nusing (, ), frac, + or f+, - or f-, * or f*, / or f/, and 1329.\nEnter . to quit.\n(f- (f* (frac 3 1)(frac 9 1)) (f+ (frac 1 1)(frac 2 1)))\nCongratulations!\n\nPlease enter a 'Lisp' expression (regular or fractional math style) that equals 24,\nusing (, ), frac, + or f+, - or f-, * or f*, / or f/, and 3758.\nEnter . to quit.\n(+ (* (- 8 5) 7) 3)\nCongratulations!\n\nPlease enter a 'Lisp' expression (regular or fractional math style) that equals 24,\nusing (, ), frac, + or f+, - or f-, * or f*, / or f/, and 3758.\nEnter . to quit.\n(f- (f* (frac 3 1)(frac 7 1)) (+ (frac 5 1)(frac 8 1))) \nUsing wrong number(s).\nIllegal operator(s). If fractional expression, must use frac, f+, f-, f*, f/ only.\n\nPlease enter a 'Lisp' expression (regular or fractional math style) that equals 24,\nusing (, ), frac, + or f+, - or f-, * or f*, / or f/, and 2713.\nEnter . to quit.\n(^ 2 7 1 3)\nUsing illegal operator(s).\n\nPlease enter a 'Lisp' expression (regular or fractional math style) that equals 24,\nusing (, ), frac, + or f+, - or f-, * or f*, / or f/, and 8367.\nEnter . to quit.\n(+ 8 3 6)\nNot all numbers used.\n\nPlease enter a 'Lisp' expression (regular or fractional math style) that equals 24,\nusing (, ), frac, + or f+, - or f-, * or f*, / or f/, and 1635.\nEnter . to quit.\n.\nbye!\n\n",
        "safe": true
    },
    {
        "filename": "24 game_123.txt",
        "content": "/* Plays the game of 24. */\n\nTWENTYFOUR: procedure options (main);            /* 14 August 2010 */\n\nCTP: procedure (E) returns (character(50) varying);\n   declare E character (*) varying;\n   declare OUT character (length(E)) varying;\n   declare S character (length(E)) varying controlled;\n   declare c character (1);\n   declare i fixed binary;\n\n/* This procedure converts an arithmetic expression to Reverse Polish Form. */\n/* A push-down pop-up stack is used for operators. */\npriority: procedure (a) returns (fixed decimal (1));\n   declare a character (1);\n   declare ops character (10) initial ('#+-*/') varying static;\n   declare pri(6) fixed decimal (1) initial (1,2,2,3,3,4) static;\n   declare i fixed binary;\n\n   i = index(ops,a);\n   return (pri(i));\nend priority;\n\n   allocate S; S = '#'; out = '';\n   do i = 1 to length(E);\n      c = substr(E, i, 1);\n      if index('+-*/', c) > 0 then\n         do;\n            /* Copy any higher priority operators on the stack to the output. */\n            do while ( priority(c) <= priority((S)) );\n               out = out || S;\n               free S;\n            end;\n            /* Copy the input character to the stack. */\n            allocate S; S = c;\n         end;\n\n      if index('123456789', c) > 0 then\n         out = out || c;\n   end;\n   do while (allocation(S) > 1);\n      out = out || s;\n      free S;\n   end;\n   return (out);\nend CTP;\n\n/* Given a push-down pop-up stack, and an expresion in  */\n/* Reverse Polish notation, evaluate the expression.    */\nEVAL: procedure (E) returns (fixed decimal(15));\n   declare E character (*) varying;\n   declare S fixed decimal (15) controlled;\n   declare (a, b) fixed decimal (15);\n   declare c character (1);\n   declare p fixed binary;\n   declare (empty_stack, invalid_expression) condition;\n\n   on condition (empty_stack) begin;\n      put skip list ('Your expression is not valid.');\n      stop;\n   end;\n   on condition (invalid_expression) begin;\n      put skip list ('Your expression is not valid.');\n      stop;\n   end;\n\n   do p = 1 to length(E);\n      c = substr(E, p, 1);\n      if index('123456789', c) > 0 then\n         do; allocate S; S = c; end;\n      else\n         do;\n            if allocation(S) = 0 then signal condition (empty_stack);\n            b = S; free S;\n            if allocation(S) = 0 then signal condition (empty_stack);\n            a = S;\n            select (c);\n               when ('+') S = a + b; \n               when ('-') S = a - b;\n               when ('*') S = a * b;\n               when ('/') S = a / b;\n               when ('^') S = a ** b;\n               otherwise signal condition (invalid_expression);\n            end;\n         end;\n   end;\n   if allocation(S) ^= 1 then signal condition (invalid_expression);\n   return (S);\nEND eval;\n\n/* Check that the player has used every digit and no others. */\nVALIDATE: procedure (E);\n   declare E character (*) varying;\n   declare E2 character (length(E)), (i, j) fixed binary;\n   declare digits(9) character (1) static initial\n      ('1', '2', '3', '4', '5', '6', '7', '8', '9');\n\n   E2 = translate(E, '    ', '+-*/' );\n   do i = 1 to 4;\n      j = index(E2, digits(k(i)));\n      if j > 0 then\n         substr(E2, j, 1) = ' ';\n      else\n         do; put skip list ('You must use the digits supplied.'); stop; end;\n   end;\n   if E2 ^= '' then\n      do; put skip list ('You must use every digit supplied, and no others.'); stop; end;\nend VALIDATE;\n\n   declare E character (40) varying;\n   declare k(4) fixed decimal;\n   declare (time, random) builtin;\n   declare V fixed decimal (15);\n\n   k = random(TIME);\n   k = 9*random() + 1;\n   put skip edit ('Here are four integers:', k) (a);\n   put skip list ('With these integers, make up an arithmetic expression' ||\n      ' that evaluates to 24.');\n   put skip list ('You can use any of the operators +, -, *, and /');\n   put skip list ('E.g., Given the integers 1, 3, 7, and 6,' ||\n      ' the expression 6*3+7-1 evaluates to 24.');\n\n   put skip list ('Please type an arithmetic expression\u00a0:');\n   get edit (E) (L) COPY;\n\n   CALL VALIDATE (E); /* Check that the player has used every digit and no others. */\n\n   E = CTP(E);\n   V = EVAL (E);\n   if V = 24 then\n      put skip list ('Congratulations: the expression evaluates to 24.');\n   else\n      put skip edit ('The result is ', trim(V), ' which is not correct') (a);\n\nend TWENTYFOUR;",
        "safe": true
    },
    {
        "filename": "24 game_124.txt",
        "content": "is_num = (s):\n  x = s ord(0)\n  if (x >= \"0\"ord && x <= \"9\"ord): true.\n  else: false.\n  .\n\nnums = (s):\n  res = ()\n  0 to (s length, (b):\n    c = s(b)\n    if (is_num(c)):\n      res push(c).\n  .)\n  res.\n\ntry = 1\nwhile (true):\n  r = rand string\n  digits = (r(0),r(1),r(2),r(3))\n  \"\\nMy next four digits: \" print\n  digits join(\" \") say\n  digit_s = digits ins_sort string\n\n  (\"Your expression to create 24 (try \", try, \"): \") print\n  entry = read slice(0,-1)\n  expr = entry eval\n  parse = nums(entry)\n  parse_s = parse clone ins_sort string\n  try++\n  if (parse length\u00a0!= 4):\n    (\"Wrong number of digits:\", parse) say.\n  elsif (parse_s\u00a0!= digit_s):\n    (\"Wrong digits:\", parse) say.\n  elsif (expr == 24):\n    \"You won!\" say\n    entry print, \" => 24\" say\n    return().\n  else:\n    (entry, \" => \", expr string, \"\u00a0!= 24\") join(\"\") say.\n.",
        "safe": true
    },
    {
        "filename": "24 game_125.txt",
        "content": "CLS\n\nFunction isNumeric ($x)\n{\n    $x2 = 0    \n    $isNum = [System.Int32]::TryParse($x,[ref]$x2)\nReturn $isNum\n}\n\n$NumberArray = @()\nWhile( $NumberArray.Count -lt 4 ){\n    $NumberArray += Random -Minimum 1 -Maximum 10\n}\n\nWrite-Host @\"\nWelcome to the 24 game!\n\nHere are your numbers: $($NumberArray -join \",\").\nUse division, multiplication, subtraction and addition to get 24 as a result with these 4 numbers.\n\"@\n\nDo\n{\n$Wrong = 0\n$EndResult = $null\n$TempChar = $null\n$TempChar2 = $null\n$Count = $null\n\n$AllowableCharacters = $NumberArray + \"+-*/()\".ToCharArray()\n    $Result = Read-Host\n        Foreach($Char in $Result.ToCharArray())\n        {\n            If( $AllowableCharacters -notcontains $Char ){ $Wrong = 1 }\n        }\n\n        If($Wrong -eq 1)\n        {\n            Write-Warning \"Wrong input! Please use only the given numbers.\"\n        }\n        Foreach($Char in $Result.ToCharArray())\n        {\n            If((IsNumeric $TempChar) -AND (IsNumeric $Char))\n            {\n                Write-Warning \"Wrong input! Combining two or more numbers together is not allowed!\"\n            }\n            $TempChar = $Char\n        }\n        Foreach($Char in $Result.ToCharArray())\n        {\n            If(IsNumeric $Char)\n            {\n                $Count++\n            }\n        }\n        If($Count -eq 4)\n        {\n            $EndResult = Invoke-Expression $Result\n                If($EndResult -eq 24)\n                {\n                    Write-Host \"`nYou've won the game!\"\n                }\n                Else\n                {\n                    Write-Host \"`n$EndResult is not 24! Too bad.\"\n                }\n        }\n        Else\n        {\n            Write-Warning \"Wrong input! You did not supply four numbers.\"\n        }\n}\nWhile($EndResult -ne 24)\n",
        "safe": true
    },
    {
        "filename": "24 game_126.txt",
        "content": ":a\neditvar /modify -random- = <10\nprintline These are your four digits: -random- -random- -random- -random-\nprintline Use an algorithm to make the number 24.\neditvar /newvar /value=a /userinput=1 /title=Algorithm:\ndo -a-\nif -a- /hasvalue 24 printline Your algorithm worked! & goto :b (\n) else printline Your algorithm did not work.\n:b \neditvar /newvar /value=b /userinput=1 /title=Do you want to play again?\nif -b- /hasvalue y goto :a else exitcurrentprogram",
        "safe": true
    },
    {
        "filename": "24 game_127.txt",
        "content": ":- initialization(main).\n\n\nanswer(24).\nplay :- round, play ; true.\n\nround :-\n    prompt(Ns), get_line(Input), Input \\= \"stop\"\n  , ( phrase(parse(Ns,[]), Input) -> Result = 'correct'\n                                   ; Result = 'wrong'\n    ), write(Result), nl, nl\n  . % where\n    prompt(Ns)  :- length(Ns,4), maplist(random(1,10), Ns)\n                 , write('Digits: '), write(Ns), nl\n                 .\n\nparse([],[X])     --> { answer(X) }.\nparse(Ns,[Y,X|S]) --> \"+\", { Z is X  +  Y }, parse(Ns,[Z|S]).\nparse(Ns,[Y,X|S]) --> \"-\", { Z is X  -  Y }, parse(Ns,[Z|S]).\nparse(Ns,[Y,X|S]) --> \"*\", { Z is X  *  Y }, parse(Ns,[Z|S]).\nparse(Ns,[Y,X|S]) --> \"/\", { Z is X div Y }, parse(Ns,[Z|S]).\nparse(Ns,Stack)   --> \" \", parse(Ns,Stack).\nparse(Ns,Stack)   --> { select(N,Ns,Ns1), number_codes(N,[Code]) }\n                    , [Code], parse(Ns1,[N|Stack])\n                    .\n\nget_line(Xs) :- get_code(X)\n              , ( X == 10 -> Xs = [] ; Xs = [X|Ys], get_line(Ys) )\n              .\nmain :- randomize, play, halt.\n",
        "safe": true
    },
    {
        "filename": "24 game_128.txt",
        "content": "Digits: [9,4,6,9]\n46*9-9+\ncorrect\n\nDigits: [7,4,7,8]\n8 4 7 7 / - *\ncorrect\n\nDigits: [7,2,8,2]\n7282---\nwrong\n\nDigits: [2,6,7,1]\n4611***\nwrong\n\nDigits: [3,6,5,8]\n+\nwrong\n\nDigits: [2,1,7,7]\nstop",
        "safe": true
    },
    {
        "filename": "24 game_129.txt",
        "content": "#digitCount = 4\nGlobal Dim digits(#digitCount - 1) ;holds random digits\n\nProcedure showDigits()\n  Print(#CRLF$ + \"These are your four digits: \")\n  Protected i\n  For i = 0 To #digitCount - 1\n    Print(Str(digits(i)))\n    If i < (#digitCount - 1)\n      Print(\", \")\n    Else\n      PrintN(\"\")\n    EndIf\n  Next\n  Print(\"24 = \")\nEndProcedure\n\nProcedure playAgain()\n  Protected answer.s\n  Repeat \n    Print(\"Play again (y/n)? \")\n    answer = LCase(Left(Trim(Input()), 1))\n    Select answer\n      Case \"n\"\n        ProcedureReturn #False\n      Case \"y\"\n        ProcedureReturn #True\n      Default\n        PrintN(\"\")\n        Continue\n    EndSelect\n  ForEver\nEndProcedure\n\nProcedure allDigitsUsed()\n  Protected i\n  For i = 0 To #digitCount - 1\n    If digits(i) <> 0\n      ProcedureReturn #False\n    EndIf\n  Next \n  ProcedureReturn #True \nEndProcedure\n\nProcedure isValidDigit(d)\n  For i = 0 To #digitCount - 1\n    If digits(i) = d\n      digits(i) = 0\n      ProcedureReturn #True\n    EndIf \n  Next \n  ProcedureReturn #False\nEndProcedure\n\nProcedure doOperation(List op.c(), List operand.f())\n  Protected x.f, y.f, op.c\n  op = op(): DeleteElement(op())\n  If op = '('\n    ProcedureReturn #False ;end of sub-expression\n  EndIf \n  \n  y = operand(): DeleteElement(operand())\n  x = operand()\n  Select op\n    Case '+'\n      x + y\n    Case '-'\n      x - y\n    Case '*' \n      x * y\n    Case '/' \n      x / y\n  EndSelect\n  operand() = x\n  ProcedureReturn #True ;operation completed\nEndProcedure \n\n;returns error if present and the expression results in *result\\f\nProcedure.s parseExpression(expr.s, *result.Float)\n  NewList op.c()\n  NewList operand.f()\n  expr = ReplaceString(expr, \" \", \"\") ;remove spaces\n  \n  If Len(expr) = 0: *result\\f = 0: ProcedureReturn \"\": EndIf ;no expression, return zero\n  \n  Protected *ech.Character = @expr, lastWasDigit, lastWasOper, parenCheck, c.c\n  While *ech\\c\n    c = *ech\\c\n    Select c\n      Case '*', '/', '-', '+'\n        If Not lastWasDigit: ProcedureReturn \"Improper syntax, need a digit between operators.\": EndIf\n        If ListSize(op()) And (FindString(\"*/\", Chr(op()), 1) Or (FindString(\"+-\", Chr(op()), 1) And FindString(\"+-\", Chr(c), 1)))\n          doOperation(op(), operand())\n        EndIf \n        AddElement(op()): op() = c\n        lastWasOper = #True: lastWasDigit = #False\n      Case '('\n        If lastWasDigit: ProcedureReturn \"Improper syntax, need an operator before left paren.\": EndIf\n        AddElement(op()): op() = c\n        parenCheck + 1: lastWasOper = #False\n      Case ')'\n        parenCheck - 1: If parenCheck < 0: ProcedureReturn \"Improper syntax, missing a left paren.\": EndIf\n        If Not lastWasDigit: ProcedureReturn \"Improper syntax, missing a digit before right paren.\": EndIf\n        Repeat: Until Not doOperation(op(),operand())\n        lastWasDigit = #True\n      Case '1' To '9'\n        If lastWasDigit: ProcedureReturn \"Improper syntax, need an operator between digits.\": EndIf\n        AddElement(operand()): operand() = c - '0'\n        If Not isValidDigit(operand()): ProcedureReturn \"'\" + Chr(c) + \"' is not a valid digit.\": EndIf\n        lastWasDigit = #True: lastWasOper = #False\n      Default\n        ProcedureReturn \"'\" + Chr(c) + \"' is not allowed in the expression.\"\n    EndSelect\n    *ech + SizeOf(Character)\n  Wend \n  \n  If parenCheck <> 0 Or lastWasOper: ProcedureReturn \"Improper syntax, missing a right paren or digit.\": EndIf\n  Repeat\n    If Not ListSize(op()): Break: EndIf\n  Until Not doOperation(op(),operand())\n  *result\\f = operand()\n  ProcedureReturn \"\" ;no error\nEndProcedure\n\nDefine success, failure, result.f, error.s, i\nIf OpenConsole()\n  PrintN(\"The 24 Game\" + #CRLF$)\n  PrintN(\"Given four digits and using just the +, -, *, and / operators; and the\")\n  PrintN(\"possible use of brackets, (), enter an expression that equates to 24.\")\n  Repeat\n    For i = 0 To #digitCount - 1\n      digits(i) = 1 + Random(8)\n    Next\n    \n    showDigits()\n    error = parseExpression(Input(), @result)\n    If error = \"\"\n      If Not allDigitsUsed()\n        PrintN( \"Wrong! (you didn't use all digits)\"): failure + 1\n      ElseIf result = 24.0\n        PrintN(\"Correct!\"): success + 1\n      Else\n        Print(\"Wrong! (you got \")\n        If result <> Int(result)\n          PrintN(StrF(result, 2) + \")\")\n        Else\n          PrintN(Str(result) + \")\")\n        EndIf \n        failure + 1\n      EndIf \n    Else\n      PrintN(error): failure + 1\n    EndIf \n  Until Not playAgain()\n  \n  PrintN(\"success:\" + Str(success) + \" failure:\" + Str(failure) + \" total:\" + Str(success + failure))\n  \n  Print(#CRLF$ + \"Press ENTER to exit\"): Input()\n  CloseConsole()\nEndIf\n",
        "safe": true
    },
    {
        "filename": "24 game_13.txt",
        "content": "24 Game\nThe program will display four randomly-generated\nsingle-digit numbers and will then prompt you to enter\nan arithmetic expression followed by <enter> to sum\nthe given numbers to 24.\nExemple\u00a0: 9+8+3+4   or (7+5)+(3*4)\n\nThe four digits are 5 1 1 5 and the score is 24.\nEnter your expression (or type (q)uit to exit or (n) for other digits):\nn\nThe four digits are 8 2 5 3 and the score is 24.\nEnter your expression (or type (q)uit to exit or (n) for other digits):\n(8*2)+5+3\nIt is OK.\n\nNew game (y/n)\u00a0?\n\n",
        "safe": true
    },
    {
        "filename": "24 game_130.txt",
        "content": "The 24 Game\n\nGiven four digits and using just the +, -, *, and / operators; and the\npossible use of brackets, (), enter an expression that equates to 24.\n\nThese are your four digits: 9, 2, 8, 7\n24 = 9*8/2-7\nWrong! (you got 29)\nPlay again (y/n)? y\n\nThese are your four digits: 5, 5, 5, 6\n24 = 5*5+5-6\nCorrect!\nPlay again (y/n)? n\nsuccess:1 failure:1 total:2",
        "safe": true
    },
    {
        "filename": "24 game_131.txt",
        "content": "'''\n The 24 Game\n\n Given any four digits in the range 1 to 9, which may have repetitions,\n Using just the +, -, *, and / operators; and the possible use of\n brackets, (), show how to make an answer of 24.\n\n An answer of \"q\" will quit the game.\n An answer of \"!\" will generate a new set of four digits.\n Otherwise you are repeatedly asked for an expression until it evaluates to 24\n\n Note: you cannot form multiple digit numbers from the supplied digits,\n so an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\n\n'''\n\nfrom __future__ import division, print_function\nimport random, ast, re\nimport sys\n\nif sys.version_info[0] < 3: input = raw_input\n\ndef choose4():\n    'four random digits >0 as characters'\n    return [str(random.randint(1,9)) for i in range(4)]\n\ndef welcome(digits):\n    print (__doc__)\n    print (\"Your four digits: \" + ' '.join(digits))\n\ndef check(answer, digits):\n    allowed = set('() +-*/\\t'+''.join(digits))\n    ok = all(ch in allowed for ch in answer) and \\\n         all(digits.count(dig) == answer.count(dig) for dig in set(digits)) \\\n         and not re.search('\\d\\d', answer)\n    if ok:\n        try:\n            ast.parse(answer)\n        except:\n            ok = False\n    return ok\n\ndef main():    \n    digits = choose4()\n    welcome(digits)\n    trial = 0\n    answer = ''\n    chk = ans = False\n    while not (chk and ans == 24):\n        trial +=1\n        answer = input(\"Expression %i: \" % trial)\n        chk = check(answer, digits)\n        if answer.lower() == 'q':\n            break\n        if answer == '!':\n            digits = choose4()\n            print (\"New digits:\", ' '.join(digits))\n            continue\n        if not chk:\n            print (\"The input '%s' was wonky!\" % answer)\n        else:\n            ans = eval(answer)\n            print (\" = \", ans)\n            if ans == 24:\n                print (\"Thats right!\")\n    print (\"Thank you and goodbye\")   \n\nif __name__ == '__main__': main()\n",
        "safe": true
    },
    {
        "filename": "24 game_132.txt",
        "content": " The 24 Game\n\n Given any four digits in the range 1 to 9, which may have repetitions,\n Using just the +, -, *, and / operators; and the possible use of\n brackets, (), show how to make an answer of 24.\n\n An answer of \"q\" will quit the game.\n An answer of \"!\" will generate a new set of four digits.\n\n Note: you cannot form multiple digit numbers from the supplied digits,\n so an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\n\n\nYour four digits: 3 2 4 6\nExpression 1: (3 - 1)*(6*4)\nThe input '(3 - 1)*(6*4)' was wonky!\nExpression 2: (3 - 2) * 6 * 4\n =  24\nThat's right!\nThank you and goodbye.",
        "safe": true
    },
    {
        "filename": "24 game_133.txt",
        "content": "import random, re\nchars = [\"(\",\")\",\"/\",\"+\",\"-\",\"*\"]  \nwhile True:\n    charsandints, ints = [], []\n    for x in range(4):\n        ints.append(str(random.randrange(1,10)))\n    charsandints = chars + ints\n    print \"Numbers are:\", ints\n    guess = raw_input(\"Enter your guess:\")\n    if guess.lower() == \"q\":\n        break\n    elif guess.lower() == \"|\":\n        pass\n    else:\n        flag = True\n        for a in guess:\n            if a not in charsandints or guess.count(a) > charsandints.count(a):\n                flag = False\n        if re.search(\"\\d\\d\", guess):\n            print \"You cannot combine digits.\"\n            break\n        if flag:\n            print \"Your result is: \", eval(guess)\n            if eval(guess) == 24:\n                print \"You won\"\n                break\n            else:\n                print \"You lost\"\n                break\n        else:\n            print \"You cannot use anthing other than\", charsandints\n            break\nprint \"Thanks for playing\"\n",
        "safe": true
    },
    {
        "filename": "24 game_134.txt",
        "content": "  [ stack ]                                       is operators       (   --> s )\n\n  0 $ \"*/+-\" witheach [ bit | ]\n  operators put\n\n  [ stack ]                                       is numbers         (   --> s )\n\n  [ 0 swap\n    witheach [ bit | ]\n    numbers put ]                                 is putnumbers      ( $ -->   )\n\n  [ $ \"123456789\" shuffle 4 split drop sort ]     is choosenumbers   (   --> $ )\n\n  [ say \"Using any of the operators * / + -\" cr\n    say \"and each of the numbers \"\n    witheach [ emit sp ] say \"once,\" cr\n    say \"enter an RPN expression equal to 24.\" cr\n    $ \"Spaces between characters are optional: \"\n    input ]                                       is getexpression   ( $ --> $ )\n\n  [ $ \"\" swap witheach\n      [ dup space = iff drop else join ] ]        is stripspaces     ( $ --> $ )\n\n  [ stack ]                                       is opcount         (   --> s )\n  [ stack ]                                       is numcount        (   --> s )\n  [ stack ]                                       is numsused        (   --> s )\n\n  [ true swap\n    0 opcount put\n    0 numcount put\n    0 numsused put\n    witheach\n      [ bit dup numbers share & iff\n          [ 1 numcount tally\n            numsused take | numsused put ]\n        else\n          [ operators share & if\n              [ 1 opcount tally ] ]\n        opcount share numcount share < not if\n          [ drop false conclude ] ]\n    numsused take\n    numbers share\u00a0!= if [ drop false ]\n    numcount take 4\u00a0!= if [ drop false ] \n    opcount take 3\u00a0!= if [ drop false ] ]         is checkexpression ( $ --> b )\n\n  [ $ \"\" swap\n    witheach\n      [ dup char 0 char 9 1+ within iff\n          [ join $ \" n->v \" join ] done\n        [ switch\n          char * case [ $ \"v* \" join ]\n          char / case [ $ \"v/ \" join ]\n          char + case [ $ \"v+ \" join ]\n          char - case [ $ \"v- \" join ]\n          otherwise [ $ \"Error!\" fail ] ] ] ]     is quackerise      ( $ --> [ )\n\n    [ choosenumbers\n      dup putnumbers\n      [ dup getexpression\n        stripspaces\n        dup checkexpression not while\n        cr\n        say \"Badly formed expression. Try again.\"\n        cr cr\n        drop again ]\n      nip\n      quackerise\n      quackery\n      cr\n      say \"Your expression is equal to \"\n      2dup 10 point$ echo$\n      24 n->v v- v0= iff\n      [ say \".\u00a0:-)\" ] else [ say \".\u00a0:-(\" ] \n      numbers release ]                           is game            (   -->   )",
        "safe": true
    },
    {
        "filename": "24 game_135.txt",
        "content": "O> game\n... \nUsing any of the operators * / + -\nand each of the numbers 2 3 8 9 once,\nenter an RPN expression equal to 24.\nSpaces between characters are optional: 5 7 6 2 * + +\n\nYour expression is equal to 24.\u00a0:-)\nStack empty.\n\n/O> game\n... \nUsing any of the operators * / + -\nand each of the numbers 2 3 8 9 once,\nenter an RPN expression equal to 24.\nSpaces between characters are optional: 2 + 5 + 8 + 9\n\nBadly formed expression. Try again.\n\nUsing any of the operators * / + -\nand each of the numbers 2 5 8 9 once,\nenter an RPN expression equal to 24.\nSpaces between characters are optional: 25+8+9+\n\nYour expression is equal to 24.\u00a0:-)\nStack empty.\n\n/O> game\n... \nUsing any of the operators * / + -\nand each of the numbers 1 3 4 7 once,\nenter an RPN expression equal to 24.\nSpaces between characters are optional: 1 3 * 4 / 7 +\n\nYour expression is equal to 7.75.\u00a0:-(\nStack empty.\n",
        "safe": true
    },
    {
        "filename": "24 game_136.txt",
        "content": "twenty.four <- function(operators=c(\"+\", \"-\", \"*\", \"/\", \"(\"),\n                        selector=function() sample(1:9, 4, replace=TRUE),\n                        arguments=selector(),\n                        goal=24) {\n  newdigits <- function() {\n    arguments <<- selector()\n    cat(\"New digits:\", paste(arguments, collapse=\", \"), \"\\n\")\n  } \n  help <- function() cat(\"Make\", goal,\n      \"out of the numbers\",paste(arguments, collapse=\", \"),\n      \"and the operators\",paste(operators, collapse=\", \"), \".\",\n      \"\\nEnter 'q' to quit, '!' to select new digits,\",\n      \"or '?' to repeat this message.\\n\")\n  help()\n  repeat {\n    switch(input <- readline(prompt=\"> \"),\n           q={ cat(\"Goodbye!\\n\"); break },\n           `?`=help(),\n           `!`=newdigits(),\n           tryCatch({\n             expr <- parse(text=input, n=1)[[1]]\n             check.call(expr, operators, arguments)\n             result <- eval(expr)\n             if (isTRUE(all.equal(result, goal))) {\n               cat(\"Correct!\\n\")\n               newdigits()\n             } else {\n               cat(\"Evaluated to\", result, \"( goal\", goal, \")\\n\")\n             }\n           },error=function(e) cat(e$message, \"\\n\")))\n  }\n}\n\ncheck.call <- function(expr, operators, arguments) {\n  unexpr <- function(x) {\n    if (is.call(x))\n      unexpr(as.list(x))\n    else if (is.list(x))\n      lapply(x,unexpr)\n    else x\n  }\n  leaves <- unlist(unexpr(expr))\n  if (any(disallowed <-\n          !leaves %in% c(lapply(operators, as.name),\n                         as.list(arguments)))) {\n    stop(\"'\", paste(sapply(leaves[disallowed], as.character),\n                    collapse=\", \"),\n         \"' not allowed. \")\n  }\n  numbers.used <- unlist(leaves[sapply(leaves, mode) == 'numeric'])\n  \n  if (! isTRUE(all.equal(sort(numbers.used), sort(arguments))))\n   stop(\"Must use each number once.\")\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_137.txt",
        "content": "> twenty.four()\n\nMake 24 out of the numbers 1, 6, 7, 5 and the operators +, -, *, /, ( . \nEnter 'q' to quit, '!' to select new digits, or '?' to repeat this message.\n> 6*(5-1)\nMust use each number once. \n> 1 + 6*5 - 7\nCorrect!\nNew digits: 7, 2, 9, 3 \n> (7+9)/2*3\nCorrect!\nNew digits: 1, 4, 1, 7 \n> 4*(7-1)\nMust use each number once. \n> (7-1)*4*1\nCorrect!\nNew digits: 1, 5, 2, 8 \n> (5-1)^2+8\n'^' not allowed.\n> !\nNew digits: 2, 8, 5, 2 \n> 52-28\n'52, 28' not allowed.\n> (8-2)*(5-2/2)\nMust use each number once. \n> (8+2)*2+5\nEvaluated to 25 ( goal 24 )\n> q\nGoodbye!\n",
        "safe": true
    },
    {
        "filename": "24 game_138.txt",
        "content": "#lang racket\n\n(define (interprete expr numbers)\n  ;; the cashe for used numbers\n  (define cashe numbers)\n\n  ;; updating the cashe and handling invalid cases\n  (define (update-cashe! x)\n    (unless (member x numbers) (error \"Number is not in the given set:\" x))\n    (unless (member x cashe)   (error \"Number is used more times then it was given:\" x))\n    (set! cashe (remq x cashe)))\n\n  ;; the parser\n  (define parse\n    (match-lambda\n      ;; parsing arythmetics\n      [`(,x ... + ,y ...) (+ (parse x) (parse y))]\n      [`(,x ... - ,y ...) (- (parse x) (parse y))]\n      [`(,x ... * ,y ...) (* (parse x) (parse y))]\n      [`(,x ... / ,y ...) (/ (parse x) (parse y))]\n      [`(,x ,op ,y ...)   (error \"Unknown operator: \" op)]\n      ;; opening redundant brackets\n      [`(,expr)           (parse expr)]\n      ;; parsing numbers\n      [(? number? x)      (update-cashe! x) x]\n      ;; unknown token\n      [x                  (error \"Not a number: \" x)]))\n\n  ;; parse the expresion\n  (define result (parse expr))\n\n  ;; return the result if cashe is empty\n  (if (empty? cashe)\n      result\n      (error \"You didn`t use all numbers!\")))\n",
        "safe": true
    },
    {
        "filename": "24 game_139.txt",
        "content": "> (interprete '(1 - 2 * 3 + 8) '(1 2 3 8))\n3\n> (interprete '(1 - 2 * (3 + 8)) '(1 2 3 8))\n-21\n> (interprete '((1 - 2) * (3 + 8)) '(1 2 3 8))\n-11\n> (interprete '((1 - 2) * 3 + 8) '(1 2 3 8))\n5\n> (interprete '((1 - 2) * 3 + 8) '(1 2 3 4))\n Number is not in the given set: 8\n> (interprete '((1 - 2) * 3 + 2) '(1 2 3 3))\n Number is used more times then it was given: 2\n> (interprete '((1 - 2) ^ 3 + 2) '(1 2 3 2))\n Unknown operator:  ^\n> (interprete '((1 - 2) * 3) '(1 2 3 2))\n You didn`t use all numbers!\n",
        "safe": true
    },
    {
        "filename": "24 game_14.txt",
        "content": "print \"-----------------------------\"\nprint \" Welcome to 24 Game\"\nprint \"-----------------------------\"\n\ndigs: map 1..4 'x -> random 1 9\n\nprint [\"The numbers you can use are:\" join.with:\" \" digs]\n\nprint \"\"\n\nvalidExpression?: function [expr][\n    loop expr 'item [\n        if or? inline? item block? item [\n            if not? validExpression? item -> return false\n        ]\n        if symbol? item [\n            if not? contains? [+ / - *] item -> return false\n        ]\n        if integer? item [\n            if not? contains? digs item -> return false\n        ]\n    ]\n    return true\n]\n\nresult: 0\n\nwhile [result<>24][\n    got: input \"Enter an expression to form 24: \"\n    blo: to :block got\n    if? validExpression? blo [\n        result: do blo\n        print [\"The result is:\" result]\n    ]\n    else [\n        print \"Invalid expression. Please try again!\"\n    ]\n    print \"\"\n]\n\nprint \"Well done!\"\n",
        "safe": true
    },
    {
        "filename": "24 game_140.txt",
        "content": ";; starting the program\n(define (start)\n  (displayln \"Combine given four numbers using operations + - * / to get 24.\")\n  (displayln \"Input 'q' to quit or your answer like '1 - 3 * (2 + 3)'\")\n  (new-game))\n\n;; starting a new game\n(define (new-game)\n  ;; create a new number set\n  (define numbers (build-list 4 (\u03bb (_) (+ 1 (random 9)))))\n  (apply printf \"Your numbers: ~a  ~a  ~a  ~a\\n\" numbers)\n  (new-input numbers))\n\n;; processing a new user input\n(define (new-input numbers)\n  ;; if an exception is raized while processing, show the exeption message\n  ;; and prompt for another input, but do not stop the program.\n  (with-handlers ([exn? (\u03bb (exn)\n                          (displayln (exn-message exn))\n                          (new-input numbers))])\n    ;; get the answer\n    (define user-expr (read-the-answer))\n    ;; interprete it\n    (case user-expr\n      [(q) (display \"Good buy!\")]\n      [(n) (new-game)]\n      [else (define ans (interprete user-expr numbers))\n            (case ans\n              [(24) (printf \"Indeed! ~a = 24\\n\" user-expr)\n                    (new-game)]\n              [else (error \"Wrong!\" user-expr '= ans)])])))\n\n;; reading and preparing the user's answer\n;; \"1 + 2 * (3 + 4)\" --> '(1 + 2 * (3 + 4))\n(define (read-the-answer)\n  (read (open-input-string (format \"(~a)\" (read-line)))))\n",
        "safe": true
    },
    {
        "filename": "24 game_141.txt",
        "content": "use MONKEY-SEE-NO-EVAL;\n\nsay \"Here are your digits: \", \nconstant @digits = (1..9).roll(4)\u00bb.Str;\n \ngrammar Exp24 {\n    token TOP { ^ <exp> $ { fail unless EVAL($/) == 24 } }\n    rule exp { <term>+\u00a0% <op> }\n    rule term { '(' <exp> ')' | <@digits> }\n    token op { < + - * / > }\n}\n \nwhile my $exp = prompt \"\\n24? \" {\n    if try Exp24.parse: $exp {\n        say \"You win\u00a0:)\";\n        last;\n    } else {\n        say (\n            'Sorry.  Try again.' xx 20,\n            'Try harder.' xx 5,\n            'Nope.  Not even close.' xx 2,\n            'Are you five or something?',\n            'Come on, you can do better than that.'\n        ).flat.pick\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_142.txt",
        "content": "Red []\nprint \"Evaluation from left to right with no precedence, unless you use parenthesis.\" print \"\"\na: \"123456789\"\nguess: \"\"\nvalid: \"\"\nsucess: false\nrandom/seed now/time\nloop 4 [append valid last random a]\nprint [\"The numbers are: \" valid/1 \", \" valid/2 \", \" valid/3 \" and \" valid/4]\nsort valid\ninsert valid \" \"\n\nexpr:    [term [\"+\" | \"-\"] expr | term]\nterm:    [primary [\"*\" | \"/\"] term | primary]\nprimary: [some digit | \"(\" expr \")\"]\ndigit:   charset valid\n\nwhile [not sucess] [\n\tguess: ask \"Enter your expression: \"\n\tif guess = \"q\" [halt]\n\tnumbers: copy guess\n\tsort numbers\n\tnumbers: take/last/part numbers 4\n\tinsert numbers \" \"\n\teither (parse guess expr) and (valid = numbers) [\n\t\trepeat i length? guess [insert at guess (i * 2) \" \"]\n\t\tresult: do guess\n\t\tprint [\"The result of your expression is: \" result]\n\t\tif (result = 24) [sucess: true]\n\t][\n\tprint \"Something is wrong with the expression, try again.\"\n\t]\n]\nprint \"You got it right!\"\n",
        "safe": true
    },
    {
        "filename": "24 game_143.txt",
        "content": "Evaluation from left to right with no precedence, unless you use parenthesis.\n\nThe numbers are:  7 ,  1 ,  9  and  3\nEnter your expression: 7+1+9\nSomething is wrong with the expression, try again.\nEnter your expression: 7+1+8+3\nSomething is wrong with the expression, try again.\nEnter your expression: 1+7*(9/3)\nThe result of your expression is:  24\nYou got it right!\n>> \n",
        "safe": true
    },
    {
        "filename": "24 game_144.txt",
        "content": "Red [\n    Title: \"24 Game\"\n    Author: \"gltewalt\"\n]\n    \nop: charset \"*/+-\"\nterm: [opt \"(\" num opt \")\"]\nvalid-expression: [term op term op term op term]\n\nexplode: func [val][\n    extract/into val 1 c: copy []\n]\n\ncheck-expression: does [\n    if \"q\" = e: ask \"Enter expression: \" [halt]\n    either parse trim/all e valid-expression [\n        either 24 = m: math to-block form explode e [\n            print [\"You got it!\" m]\n        ][\n            print [\"Not quite correct. That's\" m]]\n    ][\n        print \"Invalid expression.\"\n    ]\n]\n\nmain: does [\n    numbers: collect [loop 4 [keep random 9]]\n    num: charset form numbers\n    print [newline \"Using the following numbers, enter an expression that equals 24: (pmdas)\" numbers]\n    if none? attempt [check-expression][print \"Invalid expression.\"]\n]\n\nforever [main]\n",
        "safe": true
    },
    {
        "filename": "24 game_145.txt",
        "content": "/*REXX program helps the user find solutions to the game of  24.\n\n\u2554\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2557\n\u2551 Argument is either of these forms:     (blank)                              \u2551\u2302\n\u2551                                         ssss                                \u2551\u2302\n\u2551                                         ssss,total,limit                    \u2551\u2302\n\u2551                                         ssss-ffff                           \u2551\u2302\n\u2551                                         ssss-ffff,total,limit               \u2551\u2302\n\u2551                                        -ssss                                \u2551\u2302\n\u2551                                        +ssss                                \u2551\u2302\n\u2551                                                                             \u2551\u2302\n\u2551 where   SSSS   and/or  FFFF  must be exactly four numerals (decimal digits) \u2551\u2302\n\u2551 comprised soley of the numerals (digits)   1 \u2500\u2500\u25ba 9     (no zeroes).         \u2551\u2302\n\u2551                                                                             \u2551\u2302\n\u2551         SSSS   is the start,   and     FFFF    is the  end   (inclusive).   \u2551\u2302\n\u2551                                                                             \u2551\u2302\n\u2551 If  ssss  has a leading plus (+) sign,  it's used as the digits,  and       \u2551\u2302\n\u2551 the user is prompted to enter a solution  (using those decimal digits).     \u2551\u2302\n\u2551                                                                             \u2551\u2302\n\u2551 If  ssss  has a leading minus (-) sign,  a solution is searched for and     \u2551\u2302\n\u2551 the user is told there is a solution (or not),  but no solutions are shown).\u2551\u2302\n\u2551                                                                             \u2551\u2302\n\u2551 If no argument is specified,  this program generates four digits (no zeros) \u2551\u2302\n\u2551 which has at least one solution,  and shows the sorted digits to the user,  \u2551\u2302\n\u2551 requesting that they enter a solution (the digits used may be in any order).\u2551\u2302\n\u2551                                                                             \u2551\u2302\n\u2551 If   TOTAL   is entered,  it's the desired answer.     The default is  24.  \u2551\u2302\n\u2551 If   LIMIT   is entered,  it limits the number of solutions shown.          \u2551\u2302\n\u2551                                                                             \u2551\u2302\n\u2551 A solution to be entered can be in the form of:                             \u2551\n\u2551                                                                             \u2551\n\u2551    digit1   operator   digit2   operator   digit3   operator  digit4        \u2551\n\u2551                                                                             \u2551\n\u2551 where    DIGITn     is one of the digits shown  (in any order),   and       \u2551\n\u2551          OPERATOR   can be any one of:     +   -   *   /                    \u2551\n\u2551                                                                             \u2551\n\u2551 Parentheses  ()  may be used in the normal manner for grouping,  as well as \u2551\n\u2551 brackets  []  or  braces  {}.       Blanks can be used anywhere.            \u2551\n\u2551                                                                             \u2551\n\u2551 I.E.:  for the digits   3448   the following could be entered:  3*8 + (4-4) \u2551\n\u255a\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u255d         */\n\nnumeric digits 30                                /*where rational arithmetic is needed. */\nparse arg orig;              uargs= orig         /*get the  guess  from the command line*/\norig= space(orig, 0)                             /*remove all the blanks from  ORIG.    */\nnegatory=  left(orig, 1)=='-'                    /*=1, suppresses showing.              */\npository=  left(orig, 1)=='+'                    /*=1, force pgm to use specific number.*/\nif pository | negatory  then orig=substr(orig,2) /*now, just use the absolute vaue.     */\nparse var orig orig  ','   $  \",\"  limit         /*get optional total ($)  and/or  limit*/\nparse var orig start '-' finish                  /*get start and finish  (maybe).       */\nopers= '*'  ||  \"/+-\"                            /*arithmetic opers; order is important.*/\nops= length(opers)                               /*the number of arithmetic operators.  */\ngroupsym= space('  ( )   [ ]   { }   \u00ab\u00a0\u00bb  ',  0) /*the allowable grouping symbols.      */\nindent= left('', 30)                             /*indents the display of solutions.    */\nshow= 1                                          /*=1,  shows solutions  (a semifore).  */\ndigs= 123456789                                  /*numerals  (digits)  that can be used.*/\nif $==''      then $= 24                         /*the name (goal) of the game:  (24)   */\nif limit==''  then limit= 1                      /*=1,  shows only  one  solution.      */\n__= copies('\u2500', 8)                               /*used for output messages to the user.*/\nabuttals = 0                                     /*=1,  allows digit abuttal:   12+12   */\n      do j=1  for ops;  o.j= substr(opers, j, 1) /*these are used for fast execution.   */\n      end  /*j*/\nif \\datatype(limit, 'N')   then do;  call ger  limit  \"isn't numeric\";   exit 13;    end\nlimit= limit / 1                                 /*normalize the number for limit.      */\nif \\datatype($, 'N')       then do;  call ger    $    \"isn't numeric\";   exit 13;    end\n$= $ / 1                                         /*normalize the number for total.      */\nif start\\=='' & \\pository  then do;  call ranger start,finish;           exit 1;     end\nshow= 0                                          /*stop blabbing solutions in SOLVE.    */\n              do forever  while  \\negatory       /*keep truckin' until a solution.      */\n              x.= 0                              /*way to hold unique expressions.      */\n              rrrr= random(1111, 9999)           /*get a random set of digits.          */\n              if pos(0, rrrr)\\==0  then iterate  /*but don't the use of zeroes.         */\n              if solve(rrrr)\\==0   then leave    /*try to solve for these digits.       */\n              end   /*forever*/\nshow= 1                                          /*enable SOLVE to show solutions.      */\nif pository  then rrrr= start                    /*use what's specified.                */\nrrrr= sortc(rrrr)                                /*sort four elements.                  */\nrd.= x.\n                  do j=1  for 9;    _= substr(rrrr, j, 1);         rd._= #chrs(rrrr, _)\n                  end   /*j*/                    /* [\u2191]  count for each digit in  RRRR. */\n  do guesses=1;                 say\n  say __   \"Using the numerals (digits) \"   rrrr\", enter an expression that equals \"   $\n  say right('(or \u00a0?  or  Quit):', 79)\n  pull y;        uargs= y;      y= space(y, 0)   /*obtain user's response (expression). */\n  if abbrev('QUIT', y, 1)  then exit 0           /*does the user want to quit this game?*/\n  if y=='?'  then do j=2  for sourceline()-1;  _= sourceline(j)   /*get  a line of pgm. */\n                  if right(_, 1)=='\u2302'  then iterate               /*ignore this doc part*/\n                  say '  '  strip( left(_, 79), 'T')              /*show \"   \"   \" doc. */\n                  if left(_, 1)=='\u255a'  then iterate guesses\n                  end   /*j*/                    /* [\u2191]  use an in\u2500line way to show help*/\n  _v= verify(y, digs || opers || groupsym)       /*any illegal characters?              */\n  if _v\\==0  then do;   call ger 'invalid character:'  substr(y, _v, 1);   iterate;    end\n  if   y=''  then do;   call validate y;   iterate;    end\n\n    do j=1  for length(y)-1  while \\abuttals     /*check for two adjacent decimal digits*/\n    if datatype( substr(y, j, 1), 'W')   &   datatype( substr(y, j+1, 1), 'W')  then ,\n                           do;  call ger 'invalid use of digit abuttal:'   substr(y, j, 2)\n                                iterate guesses\n                           end\n    end   /*j*/\n\n  yy= translate(y, ')))', \"]}\u00bb\")                 /*use a simlier form for the expression*/\n\n    do j=1  for 9  while \\abuttals               /*check for a dig following a group sym*/\n    _= pos(')'j, yy)                             /*is there a string with:   )DIGIT  \u00a0? */\n    if _>0  then do;  call ger 'invalid use of digit abuttal' substr(y, _, 2)\n                      iterate guesses\n                 end\n    end   /*j*/\n\n  yd= #chrs(y, digs)                             /*count of legal digits  123456789     */\n  if yd<4  then do;  call ger 'not enough numerals were entered.';  iterate guesses;   end\n  if yd>4  then do;  call ger 'too many numerals were entered.'  ;  iterate guesses;   end\n\n      do j=1  for length(groupsym)  by 2\n      if #chrs(y, substr(groupsym, j  , 1))\\==,\n         #chrs(y, substr(groupsym, j+1, 1))  then do;   call ger 'mismatched' ,\n                                                                  substr(groupsym, j, 2)\n                                                        iterate guesses\n                                                  end\n      end   /*j*/\n\n        do k=1  for 2                            /*check for     **     and     //      */\n        _= copies( substr( opers, k, 1), 2)      /*only examine the first two operators.*/\n        if pos(_, y)\\==0  then do;  call ger 'illegal operator:' _;  iterate guesses;  end\n        end   /*k*/\n\n    do j=1  for 9;    if rd.j==0  then iterate;       _d= #chrs(y, j)\n    if _d==rd.j  then iterate\n    if _d<rd.j   then call ger  'not enough'   j   \"numerals were entered, must be\"   rd.j\n                 else call ger  'too many'     j   \"numerals were entered, must be\"   rd.j\n    iterate guesses\n    end   /*j*/\n\n  y= translate(y, '()()', \"[]{}\")                /*change extended grouping symbols\u2500\u2500\u25ba()*/\n  interpret  'ans=('  y   \") / 1\"                /*evalualte a normalized expression.   */\n  oldDigs= digits()                              /*save current decimal digit setting.  */\n  numeric digits digits()%2                      /*normalize expresssion to less digits.*/\n  if ans/1=$  then leave guesses                 /*the expression calculates to  24.    */\n  say __   \"incorrect, \"   y\"=\"ans               /*issue an error message  (incorrect). */\n  numeric digits oldDigs                         /*re\u2500instate the decimal digs precision*/\n  end   /*guesses*/\n\nsay;             say center('\u250c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2510', 79)\n                 say center('\u2502                     \u2502', 79)\n                 say center('\u2502  congratulations\u00a0!  \u2502', 79)\n                 say center('\u2502                     \u2502', 79)\n                 say center('\u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2518', 79);     say\nexit                                             /*stick a fork in it,  we're all done. */\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\n#chrs:procedure; parse arg x,c;  return length(x) - length( space( translate(x, , c), 0) )\ndiv:  procedure; parse arg q; if q=0  then q=1e9; return q  /*tests if dividing by zero.*/\nger:  say __ '***error*** for argument: '  uargs;   say __  arg(1);  errCode= 1;  return 0\ns:    if arg(1)==1  then return arg(3);           return word( arg(2) 's', 1)\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nranger: parse arg ssss,ffff                      /*parse args passed to this sub.       */\n        ffff= word(ffff ssss, 1)                 /*create a   FFFF   if necessary.      */\n               do g=ssss  to ffff                /*process possible range of values.    */\n               if pos(0, g)\\==0  then iterate    /*ignore any   G   number with zeroes. */\n               sols= solve(g);  wols= sols\n               if sols==0  then wols= 'No'       /*un\u2500geek number of solutions (if any).*/\n               if negatory & sols\\==0  then wols= 'A'  /*found only the first solution? */\n               if sols==1  & limit==1  then wols= 'A'\n               say;            say wols   'solution's(sols)    \"found for\"    g\n               if $\\==24  then say  'for answers that equal'    $\n               end   /*g*/\n       return\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nsolve: parse arg qqqq; finds= 0;  x.=0;  nq.= x. /*parse args passed to this function.  */\n       if \\validate(qqqq)  then return -1\n       parse value '( (( )) )'   with  L LL RR R /*assign some static variables (fastly)*/\n\n           do jq=1  for 4;  _= substr(qqqq,jq,1) /*count the   number   of each digit.  */\n           nq._= nq._ + 1\n           end   /*jq*/\n\n                    gLO= 1111;  gHI= 9999\nif $==24  then do;  gLO= 1118;  gHI= 9993;  end  /*24:  lowest poss.# that has solutions*/\n\n  do gggg=gLO  to gHI;  if pos(0, gggg)\\==0  then iterate   /*ignore values with zeroes.*/\n  if verify(gggg, qqqq)\\==0  then iterate\n  if verify(qqqq, gggg)\\==0  then iterate\n  ng.= 0\n         do jg=1  for 4;  _= substr(gggg, jg, 1);       g.jg= _;            ng._= ng._ + 1\n         end   /*jg*/                            /* [\u2191]  count the number of each digit.*/\n                          do kg=1  for 9;   if nq.kg\\==ng.kg  then iterate gggg\n                          end   /*kg*/           /* [\u2191]  verify number has same # digits*/\n    do       i=1  for ops                        /*insert operator after 1st numeral.   */\n      do     j=1  for ops                        /*  \"        \"      \"   2nd    \"       */\n        do   k=1  for ops                        /*  \"        \"      \"   3rd    \"       */\n          do m=0  for 10;       !.=              /*nullify all grouping symbols (parens)*/\n            select                               /*used to generate grouped expressions.*/\n            when m==1  then do; !.1=L;           !.3=R;                                end\n            when m==2  then do; !.1=L;                              !.5=R;             end\n            when m==3  then do; !.1=L;           !.3=R;   !.4=L;              !.6=R;   end\n            when m==4  then do;          !.2=L;                     !.5=R;             end\n            when m==5  then do;          !.2=L;                               !.6=R;   end\n            when m==6  then do; !.1=LL;                             !.5=R;    !.6=R;   end\n            when m==7  then do;          !.2=LL;                    !.5=R;    !.6=R;   end\n            when m==8  then do; !.1=L;   !.2=L;                               !.6=RR;  end\n            when m==9  then do;          !.2=L;           !.4=L;              !.6=RR;  end\n            otherwise  nop\n            end   /*select*/\n\n          e= space(!.1 g.1 o.i     !.2 g.2 !.3 o.j      !.4 g.3 !.5 o.k      g.4  !.6,  0)\n          if x.e  then iterate                   /*was the expression already used?     */\n          x.e= 1                                 /*mark this expression as being used.  */\n          origE= e                               /*keep original version for the display*/\n          pd= pos('/(', e)                       /*find pos of     /(      in  E.       */\n          if pd\\==0  then do                     /*Found?  Might have possible \u00f7 by zero*/\n                          eo= e\n                          lr= lastpos(')', e)    /*find the last right parenthesis.     */\n                          lm= pos('-', e, pd+1)  /*find a minus sign (-)    after  (    */\n                          if lm>pd & lm<lr  then e= changestr('/(',e,\"/div(\")   /*change*/\n                          if eo\\==e then if x.e  then iterate /*expression already used?*/\n                          x.e= 1                 /*mark this expression as being used.  */\n                          end\n          interpret 'x=('   e   \") / 1\"          /*have REXX do the heavy lifting here. */\n          if x\\==$  then do                      /*Not correct?   Then try again.       */\n                         numeric digits 9;    x= x / 1               /*re\u2500do evaluation.*/\n                         numeric digits 12                           /*re\u2500instate digits*/\n                         if x\\==$  then iterate  /*Not correct?   Then try again.       */\n                         end\n          finds= finds + 1                       /*bump number of found solutions.      */\n          if \\show | negatory  then return finds\n          _= translate(origE, '][', \")(\")                      /*display  [],  not  (). */\n          if show  then say indent   'a solution for'  gggg':'  $\"=\"  _ /*show solution.*/\n          if limit==1 & finds==limit  then leave gggg                   /*leave big loop*/\n          end     /*m*/\n        end       /*k*/\n      end         /*j*/\n    end           /*i*/\n  end             /*gggg*/\nreturn finds\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nsortc: procedure;  arg nnnn;           @.=        /*sorts the digits of   NNNN          */\n              do i=1  for length(nnnn); _= substr(nnnn, i, 1);   @._= @._||_;   end  /*i*/\n       return @.0 || @.1 || @.2 || @.3 || @.4 || @.5 || @.6 || @.7 || @.8 || @.9\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nvalidate: parse arg y;               errCode= 0;                       _v= verify(y, digs)\n                  select\n                  when y==''         then call ger 'no digits were entered.'\n                  when length(y)<4   then call ger 'not enough digits entered, must be 4'\n                  when length(y)>4   then call ger 'too many digits entered, must be 4'\n                  when pos(0,y)\\==0  then call ger \"can't use the digit  0 (zero)\"\n                  when _v\\==0        then call ger 'illegal character:'  substr(y, _v, 1)\n                  otherwise          nop\n                  end   /*select*/\n",
        "safe": true
    },
    {
        "filename": "24 game_146.txt",
        "content": "\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Using the numerals (digits)  1689, enter an expression that equals  24\n                                                             (or \u00a0?  or  Quit):\n8 * {9-6} / 1               \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 this is the user input.\n\n                            \u250c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2510\n                            \u2502                     \u2502\n                            \u2502  congratulations\u00a0!  \u2502\n                            \u2502                     \u2502\n                            \u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2518\n",
        "safe": true
    },
    {
        "filename": "24 game_147.txt",
        "content": "# Project\u00a0: 24 game\n\nload \"stdlib.ring\"\ndigits = list(4)\ncheck = list(4)\nfor choice = 1 to 4\n     digits[choice] = random(9)\nnext \n \nsee \"enter an equation (using all of, and only, the single digits \" + nl\nfor index = 1 to 4\n     see digits[index] \n     if index\u00a0!= 4 \n        see \" \"\n    ok\nnext\nsee \")\"\nsee \" which evaluates to exactly 24. only multiplication (*), division (/),\" + nl\nsee \"addition (+) & subtraction (-) operations and parentheses are allowed:\" + nl\nsee \"24 = \"\ngive equation\nsee \"equation = \" + equation + nl\n \nwhile true\n        for char = 1 to len(equation)\n             digit = substr(\"0123456789\", equation[char]) - 1\n             if digit >= 0\n                for index = 1 to 4\n                     if digit = digits[index] \n                        if not check[index]\n                           check[index] = 1\n                           exit\n                        ok\n                     ok\n                next \n                if index > 4 \n                   see \"sorry, you used the illegal digit \" + digit + nl\n                   exit 2 \n                ok\n            ok\n        next \n        for index = 1 to 4\n             if check[index] = 0\n                see \"sorry, you failed to use the digit \" + digits[index] + nl\n                exit 2\n             ok\n        next \n        for pair = 11 to 99\n             if substr(equation, string(pair))\n                see \"sorry, you may not use a pair of digits \" + pair + nl\n             ok \n        next \n        eval(\"result = \" + equation)\n        if result = 24\n           see \"congratulations, you succeeded in the task!\" + nl\n           exit\n        else\n           see \"sorry, your equation evaluated to \" + result + \" rather than 24!\" + nl\n        ok\nend",
        "safe": true
    },
    {
        "filename": "24 game_148.txt",
        "content": "enter an equation (using all of, and only, the single digits \n3 1 4 5) which evaluates to exactly 24. only multiplication (*), division (/),\naddition (+) & subtraction (-) operations and parentheses are allowed:\n24 = 4*5+3+1\nequation = 4*5+3+1\ncongratulations, you succeeded in the task!\n\nenter an equation (using all of, and only, the single digits \n5 7 2 5) which evaluates to exactly 24. only multiplication (*), division (/),\naddition (+) & subtraction (-) operations and parentheses are allowed:\n24 = 98+72\nequation = 98+72\nsorry, you used the illegal digit 9\n",
        "safe": true
    },
    {
        "filename": "24 game_149.txt",
        "content": "\u00ab\u00a0IF DUP TYPE 9. \u2260 THEN { } +                        @ stack contains a number\n  ELSE \n     CASE OBJ\u2192 SWAP 2. \u2260           THEN DROP 0 END   @ stack contains a monadic operator\n          \"+-*/\" SWAP \u2192STR POS NOT THEN DROP 0 END   @ stack contains a forbidden dyadic operator\n     END\n     GET4 SWAP GET4 +\n  END\n\u00bb 'GET4' STO                                         @ ( 'expression' \u2192 { numbers } )\n\n\u00ab\u00a01 CF\n  \u00ab\u00a0RAND 9 * CEIL R\u2192I\u00a0\u00bb 'x' 1 4 1 SEQ SORT           @ generate 4 numbers  \n  WHILE 1 FC? REPEAT \n    \"Make 24 with\" OVER \u2192STR 2 OVER SIZE 2 - SUB + \n    { \"'\" ALG V } INPUT                              @ asks for an evaluable string\n    CLLCD DUP TAIL 1 DISP \n    STR\u2192 DUP GET4\n    CASE DUP 0 POS                  THEN DROP2 \"Forbidden operator\" END \n         SORT 3 PICK \u2260              THEN DROP \"Bad number\" END \n         EVAL DUP \u2192NUM 3 DISP 24 == THEN 1 SF \"You won!\" END \n         \"Failed to get 24\"\n    END \n    2 DISP 2 WAIT\n  END DROP\n\u00bb 'GAM24' STO\n",
        "safe": true
    },
    {
        "filename": "24 game_15.txt",
        "content": "-----------------------------\n Welcome to 24 Game\n-----------------------------\nThe numbers you can use are: 3 2 2 1 \n\nEnter an expression to form 24: 3+2+2+1\\\nInvalid expression. Please try again!\n\nEnter an expression to form 24: 3+2+2+1\nThe result is: 8 \n\nEnter an expression to form 24: (3+3+3+3+3)+2+2+1+1\nThe result is: 21 \n\nEnter an expression to form 24: (3+3+3+3+3)+2+2+1+1+1          \nThe result is: 22 \n\nEnter an expression to form 24: 3+3+3+3+3+2+2+2+2+1+1\nThe result is: 25 \n\nEnter an expression to form 24: 3+3+3+3+3+2+2+2+2+1\nThe result is: 24 \n\nWell done!",
        "safe": true
    },
    {
        "filename": "24 game_150.txt",
        "content": "class Guess < String\n  def self.play\n    nums = Array.new(4){rand(1..9)}\n    loop do\n      result = get(nums).evaluate!\n      break if result == 24.0\n      puts \"Try again! That gives #{result}!\"\n    end\n    puts \"You win!\"\n  end\n  \n  def self.get(nums)\n    loop do\n      print \"\\nEnter a guess using #{nums}: \"\n      input = gets.chomp\n      return new(input) if validate(input, nums)\n    end\n  end\n  \n  def self.validate(guess, nums)\n    name, error =\n      {\n        invalid_character:  ->(str){ !str.scan(%r{[^\\d\\s()+*/-]}).empty? },\n        wrong_number:       ->(str){ str.scan(/\\d/).map(&:to_i).sort != nums.sort },\n        multi_digit_number: ->(str){ str.match(/\\d\\d/) }\n      }\n        .find {|name, validator| validator[guess] }\n    \n    error ? puts(\"Invalid input of a(n) #{name.to_s.tr('_',' ')}!\") : true\n  end\n  \n  def evaluate!\n    as_rat = gsub(/(\\d)/, '\\1r')        # r\u00a0: Rational suffix\n    eval \"(#{as_rat}).to_f\"\n  rescue SyntaxError\n    \"[syntax error]\"\n  end\nend\n\nGuess.play\n",
        "safe": true
    },
    {
        "filename": "24 game_151.txt",
        "content": "use std::io::{self,BufRead};\nextern crate rand;\nuse rand::Rng;\n\nfn op_type(x: char) -> i32{\n    match x {\n        '-' | '+' => return 1,\n        '/' | '*' => return 2,\n        '(' | ')' => return -1,\n        _   => return 0,\n    }\n}\n\nfn to_rpn(input: &mut String){\n\n    let mut rpn_string : String = String::new();\n    let mut rpn_stack : String = String::new();\n    let mut last_token = '#';\n    for token in input.chars(){\n        if token.is_digit(10) {\n            rpn_string.push(token);\n        }\n        else if op_type(token) == 0 {\n            continue;\n        }\n        else if op_type(token) > op_type(last_token) || token == '(' {\n                rpn_stack.push(token);\n                last_token=token;\n        }\n        else {\n            while let Some(top) = rpn_stack.pop() {\n                if top=='(' {\n                    break;\n                }\n                rpn_string.push(top);\n            }\n            if token != ')'{\n                rpn_stack.push(token);\n            }\n        }\n    }\n    while let Some(top) = rpn_stack.pop() {\n        rpn_string.push(top);\n    }\n\n    println!(\"you formula results in {}\", rpn_string);\n\n    *input=rpn_string;\n}\n\nfn calculate(input: &String, list : &mut [u32;4]) -> f32{\n    let mut stack : Vec<f32> = Vec::new();\n    let mut accumulator : f32 = 0.0;\n\n    for token in input.chars(){\n        if token.is_digit(10) {\n            let test = token.to_digit(10).unwrap() as u32;\n            match list.iter().position(|&x| x == test){\n                Some(idx) => list[idx]=10 ,\n                _         => println!(\" invalid digit: {} \",test),\n            }\n            stack.push(accumulator);\n            accumulator = test as f32;\n        }else{\n            let a = stack.pop().unwrap();\n            accumulator = match token {\n                '-' => a-accumulator,\n                '+' => a+accumulator,\n                '/' => a/accumulator,\n                '*' => a*accumulator,\n                _ => {accumulator},//NOP\n            };\n        }\n    }\n    println!(\"you formula results in {}\",accumulator);\n    accumulator\n}\n\nfn main() {\n\n    let mut rng = rand::thread_rng();\n    let mut list :[u32;4]=[rng.gen::<u32>()%10,rng.gen::<u32>()%10,rng.gen::<u32>()%10,rng.gen::<u32>()%10];\n\n    println!(\"form 24 with using + - / * {:?}\",list);\n    //get user input\n    let mut input = String::new();\n    io::stdin().read_line(&mut input).unwrap();\n    //convert to rpn\n    to_rpn(&mut input);\n    let result = calculate(&input, &mut list);\n\n    if list.iter().any(|&list| list !=10){\n        println!(\"and you used all numbers\");\n        match result {\n            24.0 => println!(\"you won\"),\n            _ => println!(\"but your formulla doesn't result in 24\"),\n        }\n    }else{\n        println!(\"you didn't use all the numbers\");\n    }\n\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_152.txt",
        "content": "object TwentyFourGame {\n  def main(args: Array[String]) {\n    import Parser.TwentyFourParser\n    \n    println(welcome)\n    \n    var parser = new TwentyFourParser(problemsIterator.next)\n    println(\"Your four digits: \"+parser+\".\")\n    \n    var finished = false\n    var expressionCount = 1\n    do {\n      val line = Console.readLine(\"Expression \"+expressionCount+\": \")\n      line match {\n        case \"!\" =>\n          parser = new TwentyFourParser(problemsIterator.next)\n          println(\"New digits: \"+parser+\".\")\n          \n        case \"q\" =>\n          finished = true\n        \n        case _ =>\n          parser readExpression line match {\n            case Some(24) => println(\"That's right!\"); finished = true\n            case Some(n) => println(\"Sorry, that's \"+n+\".\")\n            case None =>\n          }\n      }\n      expressionCount += 1\n    } while (!finished)\n    \n    println(\"Thank you and goodbye!\")\n  }\n  \n  val welcome = \"\"\"|The 24 Game\n                   |\n                   |Given any four digits in the range 1 to 9, which may have repetitions,\n                   |Using just the +, -, *, and / operators; and the possible use of\n                   |brackets, (), show how to make an answer of 24.\n                   |\n                   |An answer of \"q\" will quit the game.\n                   |An answer of \"!\" will generate a new set of four digits.\n                   |Otherwise you are repeatedly asked for an expression until it evaluates to 24\n                   |\n                   |Note: you cannot form multiple digit numbers from the supplied digits,\n                   |so an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\n                   |\"\"\".stripMargin\n  \n  val problemsIterator = (\n    Iterator \n    continually List.fill(4)(scala.util.Random.nextInt(9) + 1 toDouble) \n    filter hasSolution\n  )\n  \n  def hasSolution(l: List[Double]) = permute(l) flatMap computeAllOperations exists (_ == 24)\n  \n  def computeAllOperations(l: List[Double]): List[Double] = l match {\n    case Nil => Nil\n    case x :: Nil => l\n    case x :: xs =>\n      for {\n        y <- computeAllOperations(xs)\n        z <- if (y == 0) List(x*y, x+y, x-y) else List(x*y, x/y, x+y, x-y)\n      } yield z\n  }\n  \n  def permute(l: List[Double]): List[List[Double]] = l match {\n    case Nil => List(Nil)\n    case x :: xs =>\n      for {\n        ys <- permute(xs)\n        position <- 0 to ys.length\n        (left, right) = ys splitAt position\n      } yield left ::: (x :: right)\n  }\n  \n  object Parser {\n    /*  Arithmetic expression grammar production rules in EBNF form:\n     *\n     * <expr> --> <term> ( '+' <term> | '-' <term> )*\n     * <term> --> <factor> ( '*'  <factor> | '/'  <factor> )*\n     * <factor> --> '(' <expr> ')' | <digit>\n     * <digit> --> 0 | 1  | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9\n     * \n     * Semantically, <digit> can only be a digit from the list of remaining digits.\n     */\n    \n    class TwentyFourParser(digits: List[Double]) extends scala.util.parsing.combinator.RegexParsers {\n      require(digits.length == 4 && digits.forall(d => 0 <= d && d <= 9))\n      override val toString = digits.map(_.toInt).mkString(\", \")\n      \n      // Grammar\n      def exprConsumingAllDigits = expr ^? (remainingDigits.allDigitsConsumed, digitsRemainingError) // Guarantees all digits consumed\n      def expr : Parser[Double] = term ~ rep( \"+\" ~ term | \"-\" ~ term) ^^ solveOperationChain\n      def term = factor ~ rep( \"*\" ~ factor | \"/\" ~ factor) ^^ solveOperationChain\n      def factor = \"(\" ~> expr <~ \")\" | digit\n      def digit = digitRegex ^? (remainingDigits.consumeDigit, digitNotAllowedError) \n      def digitRegex = \"\\\\d\".r | digitExpected\n      def digitExpected: Parser[String] = \".\".r <~ failure(expectedDigitError) // Produces clear error messages\n    \n      // Evaluate expressions\n      def readExpression(input: String): Option[Double] = {\n        remainingDigits = new DigitList(digits) // Initialize list of digits to be consumed\n        parseAll(exprConsumingAllDigits, input) match {\n          case Success(result, _) => Some(result)\n          case NoSuccess(msg, next) =>\n            println(ParsingErrorFormatter(msg, next))\n            None\n        }\n      }\n      \n      // List of digits to be consumed\n      private var remainingDigits: DigitList = _\n      \n      // Solve partial results from parsing\n      private def solveOperationChain(partialResult: ~[Double,List[~[String,Double]]]): Double = partialResult match {\n        case first ~ chain => chain.foldLeft(first)(doOperation)\n      }\n      private def doOperation(acc: Double, op: ~[String, Double]): Double = op match {\n        case \"+\" ~ operand => acc + operand\n        case \"-\" ~ operand => acc - operand\n        case \"*\" ~ operand => acc * operand\n        case \"/\" ~ operand => acc / operand\n        case x => error(\"Unknown operation \"+x+\".\") \n      }\n      \n      // Error messages\n      private def digitNotAllowedError(d: String) = \"Digit \"+d+\" is not allowed here. Available digits: \"+remainingDigits+\".\"\n      private def digitsRemainingError(x: Any) = \"Not all digits were consumed. Digits remaining: \"+remainingDigits+\".\"\n      private def expectedDigitError = \"Unexpected input. Expected a digit from the list: \"+remainingDigits+\".\"\n    }\n    \n    private object ParsingErrorFormatter {\n      def apply[T](msg: String, next: scala.util.parsing.input.Reader[T]) =\n        \"%s\\n%s\\n%s\\n\" format (msg, next.source.toString.trim, \" \"*(next.offset - 1)+\"^\")\n    }\n    \n    private class DigitList(digits: List[Double]) {\n      private var remainingDigits = digits\n      override def toString = remainingDigits.map(_.toInt).mkString(\", \")\n      \n      def consumeDigit: PartialFunction[String, Double] = {\n        case d if remainingDigits contains d.toDouble =>\n          val n = d.toDouble\n          remainingDigits = remainingDigits diff List(n)\n          n\n      }\n      \n      def allDigitsConsumed: PartialFunction[Double, Double] = {\n        case n if remainingDigits.isEmpty => n\n      }\n    }\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_153.txt",
        "content": "C:\\Workset>scala TwentyFourGame\nThe 24 Game\n\nGiven any four digits in the range 1 to 9, which may have repetitions,\nUsing just the +, -, *, and / operators; and the possible use of\nbrackets, (), show how to make an answer of 24.\n\nAn answer of \"q\" will quit the game.\nAn answer of \"!\" will generate a new set of four digits.\nOtherwise you are repeatedly asked for an expression until it evaluates to 24\n\nNote: you cannot form multiple digit numbers from the supplied digits,\nso an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\n\nYour four digits: 2, 7, 7, 2.\nExpression 1: 2*7+2+7\nSorry, that's 23.0.\nExpression 2: 7*7/2-2\nSorry, that's 22.5.\nExpression 3: 2*7+(7-2)\nSorry, that's 19.0.\nExpression 4: 2*(7+7-2)\nThat's right!\nThank you and goodbye!\n",
        "safe": true
    },
    {
        "filename": "24 game_154.txt",
        "content": "#lang scheme\n(require srfi/27 srfi/1) ;; random-integer, every\n\n(define (play)\n  (let* ([numbers (build-list 4 (lambda (n)\n                                  (add1 (random-integer 9))))]\n         [valid?  (curryr valid? numbers)])\n    (printf startup-message numbers)\n    (let loop ([exp (read)])\n      (with-handlers ([exn:fail? (lambda (err)\n                                   (printf error-message exp (exn-message err))\n                                   (loop (read)))])\n       (cond [(eq? exp '!) (play)]\n             \n             [(or (eq? exp 'q)\n                  (eof-object? exp)) (printf quit-message)]\n             \n             [(not (valid? exp))\n              (printf bad-exp-message exp)\n              (loop (read))]\n            \n             [(not (= (eval exp) 24))\n              (printf bad-result-message exp (eval exp))\n              (loop (read))]\n            \n             [else (printf winning-message)])))))\n\n(define (valid? exp numbers)\n  ;; must contain each number exactly once and only valid symbols\n  (define (valid-symbol? sym)\n    ;; only +, -, *, and / are valid\n    (case sym\n      [(+ - * /) #t]\n      [else #f]))\n  \n  (let* ([ls (flatten exp)]\n         [numbers* (filter number? ls)]\n         [symbols  (remove number? ls)])\n    (and (equal? (sort numbers <)\n                 (sort numbers* <))\n         (every valid-symbol? symbols))))\n\n(define startup-message \"\nWrite a lisp expression that evaluates to 24\nusing only (, ), +, -, *, /\nand these four numbers: ~a\n\nor '!' to get a new set of numbers\nor 'q' to quit\")\n\n(define error-message \"\nYour expression ~a raised an exception:\n\n  \\\"~a\\\"\n\nPlease try again\")\n\n(define bad-exp-message \"Sorry, ~a is a bad expression.\")\n(define bad-result-message \"Sorry, ~a evaluates to ~a, not 24.\")\n(define quit-message \"Thanks for playing...\")\n(define winning-message \"You win!\")\n\n(provide play)\n",
        "safe": true
    },
    {
        "filename": "24 game_155.txt",
        "content": "> (require \"24game.ss\")\n> (play)\n\nWrite a lisp expression that evaluates to 24\nusing only (, ), +, -, *, /\nand these four numbers: (2 7 2 5)\n\nor '!' to get a new set of numbers\nor 'q' to quit\n!\n\nWrite a lisp expression that evaluates to 24\nusing only (, ), +, -, *, /\nand these four numbers: (9 2 7 6)\n\nor '!' to get a new set of numbers\nor 'q' to quit\n(9 7 6 2)\n\nYour expression (9 7 6 2) raised an exception:\n\n  \"procedure application: expected procedure, given: 9; arguments were: 7 6 2\"\n\nPlease try again\n(+ 9 7 6 2)\nYou win!\n",
        "safe": true
    },
    {
        "filename": "24 game_156.txt",
        "content": "const digits  = (1..9 -> pick(4))\nconst grammar = Regex(\n    '^ (?&exp) \\z\n      (?(DEFINE)\n          (?<exp> ( (?&term) (?&op) (?&term) )+ )\n          (?<term> \\( (?&exp) \\) | [' + digits.join + '])\n          (?<op> [\\-+*/] )\n      )', 'x'\n)\n\nsay \"Here are your digits: #{digits.join(' ')}\"\n\nloop {\n    var input = read(\"Expression: \", String)\n\n    var expr = input\n    expr -= /\\s+/g     # remove all whitespace\n\n    if (input == 'q') {\n        say \"Goodbye.  Sorry you couldn't win.\"\n        break\n    }\n\n    var given_digits = digits.map{.to_s}.sort.join\n    var entry_digits = input.scan(/\\d/).sort.join\n\n    if ((given_digits != entry_digits) || (expr !~ grammar)) {\n        say \"That's not valid\"\n        next\n    }\n\n    given(var n = eval(input)) {\n        when (24) { say \"You win!\"; break }\n        default   { say \"Sorry, your expression is #{n}, not 24\" }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_157.txt",
        "content": "Here are your digits: 8 2 3 4\nExpression: 8 * (2 - (3 + 4))    \nSorry, your expression is -40, not 24\nExpression: 8 * (2 - (3 -            \nThat's not valid\nExpression: 8 * (2 - (3 - 4))\nYou win!\n",
        "safe": true
    },
    {
        "filename": "24 game_158.txt",
        "content": "BEGIN\n\n    CLASS EXPR;\n    BEGIN\n\n\n        REAL PROCEDURE POP;\n        BEGIN\n            IF STACKPOS > 0 THEN\n            BEGIN STACKPOS\u00a0:= STACKPOS - 1; POP\u00a0:= STACK(STACKPOS); END;\n        END POP;\n\n\n        PROCEDURE PUSH(NEWTOP); REAL NEWTOP;\n        BEGIN\n            STACK(STACKPOS)\u00a0:= NEWTOP;\n            STACKPOS\u00a0:= STACKPOS + 1;\n        END PUSH;\n\n\n        REAL PROCEDURE CALC(OPERATOR, ERR); CHARACTER OPERATOR; LABEL ERR;\n        BEGIN\n            REAL X, Y; X\u00a0:= POP; Y\u00a0:= POP;\n            IF      OPERATOR = '+' THEN PUSH(Y + X)\n            ELSE IF OPERATOR = '-' THEN PUSH(Y - X)\n            ELSE IF OPERATOR = '*' THEN PUSH(Y * X)\n            ELSE IF OPERATOR = '/' THEN BEGIN\n                                            IF X = 0 THEN\n                                            BEGIN\n                                                EVALUATEDERR\u00a0:- \"DIV BY ZERO\";\n                                                GOTO ERR;\n                                            END;\n                                            PUSH(Y / X);\n                                        END\n            ELSE\n            BEGIN\n                EVALUATEDERR\u00a0:- \"UNKNOWN OPERATOR\";\n                GOTO ERR;\n            END\n        END CALC;\n\n\n        PROCEDURE READCHAR(CH); NAME CH; CHARACTER CH;\n        BEGIN\n            IF T.MORE THEN CH\u00a0:= T.GETCHAR ELSE CH\u00a0:= EOT;\n        END READCHAR;\n\n\n        PROCEDURE SKIPWHITESPACE(CH); NAME CH; CHARACTER CH;\n        BEGIN\n            WHILE (CH = SPACE) OR (CH = TAB) OR (CH = CR) OR (CH = LF) DO\n                READCHAR(CH);\n        END SKIPWHITESPACE;\n\n\n        PROCEDURE BUSYBOX(OP, ERR); INTEGER OP; LABEL ERR;\n        BEGIN\n            CHARACTER OPERATOR;\n            REAL NUMBR;\n            BOOLEAN NEGATIVE;\n\n            SKIPWHITESPACE(CH);\n\n            IF OP = EXPRESSION THEN\n            BEGIN\n\n                NEGATIVE\u00a0:= FALSE;\n                WHILE (CH = '+') OR (CH = '-') DO\n                BEGIN\n                    IF CH = '-' THEN NEGATIVE\u00a0:=  NOT NEGATIVE;\n                    READCHAR(CH);\n                END;\n\n                BUSYBOX(TERM, ERR);\n\n                IF NEGATIVE THEN\n                BEGIN\n                    NUMBR\u00a0:= POP; PUSH(0 - NUMBR);\n                END;\n\n                WHILE (CH = '+') OR (CH = '-') DO\n                BEGIN\n                    OPERATOR\u00a0:= CH; READCHAR(CH);\n                    BUSYBOX(TERM, ERR); CALC(OPERATOR, ERR);\n                END;\n\n            END\n            ELSE IF OP = TERM THEN\n            BEGIN\n\n                BUSYBOX(FACTOR, ERR);\n                WHILE (CH = '*') OR (CH = '/') DO\n                BEGIN\n                    OPERATOR\u00a0:= CH; READCHAR(CH);\n                    BUSYBOX(FACTOR, ERR); CALC(OPERATOR, ERR)\n                END\n\n            END\n            ELSE IF OP = FACTOR THEN\n            BEGIN\n\n                IF (CH = '+') OR (CH = '-') THEN\n                  BUSYBOX(EXPRESSION, ERR)\n                ELSE IF (CH >= '0') AND (CH <= '9') THEN\n                  BUSYBOX(NUMBER, ERR)\n                ELSE IF CH = '(' THEN\n                BEGIN\n                    READCHAR(CH);\n                    BUSYBOX(EXPRESSION, ERR);\n                    IF CH = ')' THEN READCHAR(CH) ELSE GOTO ERR;\n                END\n                ELSE GOTO ERR;\n\n            END\n            ELSE IF OP = NUMBER THEN\n            BEGIN\n\n                NUMBR\u00a0:= 0;\n                WHILE (CH >= '0') AND (CH <= '9') DO\n                BEGIN\n                    NUMBR\u00a0:= 10 * NUMBR + RANK(CH) - RANK('0'); READCHAR(CH);\n                END;\n                IF CH = '.' THEN\n                BEGIN\n                    REAL FAKTOR;\n                    READCHAR(CH);\n                    FAKTOR\u00a0:= 10;\n                    WHILE (CH >= '0') AND (CH <= '9') DO\n                    BEGIN\n                        NUMBR\u00a0:= NUMBR + (RANK(CH) - RANK('0')) / FAKTOR;\n                        FAKTOR\u00a0:= 10 * FAKTOR;\n                        READCHAR(CH);\n                    END;\n                END;\n                PUSH(NUMBR);\n\n            END;\n\n            SKIPWHITESPACE(CH);\n\n        END BUSYBOX;\n\n\n        BOOLEAN PROCEDURE EVAL(INP); TEXT INP;\n        BEGIN\n            EVALUATEDERR\u00a0:- NOTEXT;\n            STACKPOS\u00a0:= 0;\n            T\u00a0:- COPY(INP.STRIP);\n            READCHAR(CH);\n            BUSYBOX(EXPRESSION, ERRORLABEL);\n         \u00a0! OUTTEXT(\"T = '\");\n         \u00a0! OUTTEXT(T);\n         \u00a0! OUTTEXT(\"'\");\n         \u00a0! OUTTEXT(\", T.POS = \");\n         \u00a0! OUTINT(T.POS, 0);\n         \u00a0! OUTTEXT(\", STACKPOS = \");\n         \u00a0! OUTINT(STACKPOS, 0);\n         \u00a0! OUTTEXT(\", T.MORE = \");\n         \u00a0! OUTCHAR(IF T.MORE THEN 'T' ELSE 'F');\n         \u00a0! OUTTEXT(\", CH = \");\n         \u00a0! OUTCHAR(CH);\n         \u00a0! OUTIMAGE;\n            IF NOT T.MORE AND STACKPOS = 1 AND CH = EOT THEN\n            BEGIN\n                EVALUATED\u00a0:= POP;\n                EVAL\u00a0:= TRUE;\n                GOTO NOERRORLABEL;\n            END;\n    ERRORLABEL:\n            EVAL\u00a0:= FALSE;\n            IF EVALUATEDERR = NOTEXT THEN\n                EVALUATEDERR\u00a0:- \"INVALID EXPRESSION: \" & INP;\n    NOERRORLABEL:\n        END EVAL;\n\n        \n        REAL PROCEDURE RESULT;\n            RESULT\u00a0:= EVALUATED;\n\n        TEXT PROCEDURE ERR;\n            ERR\u00a0:- EVALUATEDERR;\n\n        TEXT T;\n\n        INTEGER EXPRESSION;\n        INTEGER TERM;\n        INTEGER FACTOR;\n        INTEGER NUMBER;\n\n        CHARACTER TAB;\n        CHARACTER LF;\n        CHARACTER CR;\n        CHARACTER SPACE;\n        CHARACTER EOT;\n\n        CHARACTER CH;\n        REAL ARRAY STACK(0:31);\n        INTEGER STACKPOS;\n\n        REAL EVALUATED;\n        TEXT EVALUATEDERR;\n\n        EXPRESSION\u00a0:= 1;\n        TERM\u00a0:= 2;\n        FACTOR\u00a0:= 3;\n        NUMBER\u00a0:= 4;\n\n        TAB\u00a0:= CHAR(9);\n        LF\u00a0:= CHAR(10);\n        CR\u00a0:= CHAR(13);\n        SPACE\u00a0:= CHAR(32);\n        EOT\u00a0:= CHAR(0);\n\n    END EXPR;\n\n    INTEGER ARRAY DIGITS(1:4);\n    INTEGER SEED, I;\n    REF(EXPR) E;\n\n    E\u00a0:- NEW EXPR;\n    OUTTEXT(\"ENTER RANDOM SEED: \");\n    OUTIMAGE;\n    SEED\u00a0:= ININT;\n    FOR I\u00a0:= 1 STEP 1 UNTIL 4 DO DIGITS(I)\u00a0:= RANDINT(0, 9, SEED);\n\nL:  BEGIN\n        INTEGER ARRAY DIGITSUSED(0:9);\n        INTEGER ARRAY DIGITSTAKEN(0:9);\n        CHARACTER C, LASTC;\n        TEXT INP;\n\n        LASTC\u00a0:= CHAR(0);\n        OUTTEXT(\"MAKE 24 USING THESE DIGITS: \");\n        FOR I\u00a0:= 1 STEP 1 UNTIL 4 DO\n        BEGIN\n            OUTINT(DIGITS(I), 2);\n            DIGITSUSED( DIGITS(I) )\u00a0:= DIGITSUSED( DIGITS(I) ) + 1;\n        END;\n        OUTIMAGE;\n        INIMAGE;\n        INP\u00a0:- COPY(SYSIN.IMAGE.STRIP);\n        OUTIMAGE;\n        WHILE INP.MORE DO\n        BEGIN\n            C\u00a0:= INP.GETCHAR;\n            IF (C >= '0') AND (C <= '9') THEN\n            BEGIN\n                INTEGER D;\n                IF (LASTC >= '0') AND (LASTC <= '9') THEN\n                BEGIN\n                    OUTTEXT(\"NUMBER HAS TOO MANY DIGITS: \");\n                    OUTCHAR(LASTC);\n                    OUTCHAR(C);\n                    OUTIMAGE;\n                    GOTO L;\n                END;\n                D\u00a0:= RANK(C) - RANK('0');\n                DIGITSTAKEN(D)\u00a0:= DIGITSTAKEN(D) + 1;\n            END\n            ELSE IF NOT ((C = '+') OR (C = '-') OR (C = '/') OR (C = '*') OR\n                         (C = ' ') OR (C = '(') OR (C = ')')) THEN\n            BEGIN\n                OUTTEXT(\"ILLEGAL INPUT CHARACTER: \");\n                OUTCHAR(C);\n                OUTIMAGE;\n                GOTO L;\n            END;\n            LASTC\u00a0:= C;\n        END;\n        FOR I\u00a0:= 0 STEP 1 UNTIL 9 DO\n        BEGIN\n            IF DIGITSUSED(I) <> DIGITSTAKEN(I) THEN\n            BEGIN\n                OUTTEXT(\"NOT THE SAME DIGITS.\");\n                OUTIMAGE;\n                GOTO L;\n            END;\n        END;\n        IF E.EVAL(INP) THEN\n        BEGIN\n            OUTTEXT(\"RESULT IS \");\n            OUTFIX(E.RESULT, 4, 10);\n            OUTIMAGE;\n            OUTTEXT(IF ABS(E.RESULT - 24) < 0.001\n                    THEN \"YOU WIN\"\n                    ELSE \"YOU LOOSE\");\n            OUTIMAGE;\n        END\n        ELSE\n        BEGIN\n            OUTTEXT(E.ERR);\n            OUTIMAGE;\n        END;\n    END;\n\nEND.",
        "safe": true
    },
    {
        "filename": "24 game_159.txt",
        "content": "ENTER RANDOM SEED:\n",
        "safe": true
    },
    {
        "filename": "24 game_16.txt",
        "content": "AutoExecute: \n    Title := \"24 Game\" \n    Gui, -MinimizeBox \n    Gui, Add, Text, w230 vPuzzle \n    Gui, Add, Edit, wp vAnswer \n    Gui, Add, Button, w70, &Generate \n    Gui, Add, Button, x+10 wp Default, &Submit \n    Gui, Add, Button, x+10 wp, E&xit \n\n\nButtonGenerate:\u00a0; new set of numbers \n    Loop, 4 \n        Random, r%A_Index%, 1, 9 \n    Puzzle = %r1%, %r2%, %r3%, and %r4% \n    GuiControl,, Puzzle, The numbers are:  %Puzzle%  - Good luck! \n    GuiControl,, Answer\u00a0; empty the edit box \n    ControlFocus, Edit1 \n    Gui, -Disabled \n    Gui, Show,, %Title% \nReturn\u00a0; end of auto execute section \n\n\nButtonSubmit:\u00a0; check solution \n    Gui, Submit, NoHide \n    Gui, +Disabled \n\n   \u00a0; check numbers used \n    RegExMatch(Answer, \"(\\d)\\D+(\\d)\\D+(\\d)\\D+(\\d)\", $) \n    ListPuzzle := r1 \",\" r2 \",\" r3 \",\" r4 \n    ListAnswer := $1 \",\" $2 \",\" $3 \",\" $4 \n    Sort, ListPuzzle, D, \n    Sort, ListAnswer, D, \n    If Not ListPuzzle = ListAnswer { \n        MsgBox, 48, Error - %Title%, Numbers used!`n%Answer% \n        Goto, TryAgain \n    } \n\n   \u00a0; check operators used \n    StringReplace, $, $, +,, All \n    StringReplace, $, $, -,, All \n    StringReplace, $, $, *,, All \n    StringReplace, $, $, /,, All \n    StringReplace, $, $, (,, All \n    StringReplace, $, $, ),, All \n    Loop, 9 \n        StringReplace, $, $, %A_Index%,, All \n    If StrLen($) > 0 \n    Or InStr(Answer, \"**\") \n    Or InStr(Answer, \"//\") \n    Or InStr(Answer, \"++\") \n    Or InStr(Answer, \"--\") { \n        MsgBox, 48, Error - %Title%, Operators used!`n%Answer% \n        Goto, TryAgain \n    } \n\n   \u00a0; check result \n    Result := Eval(Answer) \n    If Not Result = 24 { \n        MsgBox, 48, Error - %Title%, Result incorrect!`n%Result% \n        Goto, TryAgain \n    } \n\n   \u00a0; if we are sill here \n    MsgBox, 4, %Title%, Correct solution! Play again? \n    IfMsgBox, Yes \n        Gosub, ButtonGenerate \n    Else \n        ExitApp \nReturn \n\n\nTryAgain:\u00a0; alternative ending of routine ButtonSubmit \n    ControlFocus, Edit1 \n    Gui, -Disabled \n    Gui, Show \nReturn \n\n\nGuiClose: \nGuiEscape: \nButtonExit: \n    ExitApp \nReturn \n\n\n;--------------------------------------------------------------------------- \nEval(Expr) {\u00a0; evaluate expression using separate AHK process \n;--------------------------------------------------------------------------- \n   \u00a0; credit for this function goes to AutoHotkey forum member Laszlo \n   \u00a0; http://www.autohotkey.com/forum/topic9578.html \n   \u00a0;----------------------------------------------------------------------- \n    static File := \"24$Temp.ahk\" \n\n   \u00a0; delete old temporary file, and write new \n    FileDelete, %File% \n    FileContent := \"#NoTrayIcon`r`n\" \n                .  \"FileDelete, \" File \"`r`n\" \n                .  \"FileAppend, `% \" Expr \", \" File \"`r`n\" \n    FileAppend, %FileContent%, %File% \n\n   \u00a0; run AHK to execute temp script, evaluate expression \n    RunWait, %A_AhkPath% %File% \n\n   \u00a0; get result \n    FileRead, Result, %File% \n    FileDelete, %File% \n    Return, Result \n}\n",
        "safe": true
    },
    {
        "filename": "24 game_160.txt",
        "content": "787\n",
        "safe": true
    },
    {
        "filename": "24 game_161.txt",
        "content": "MAKE 24 USING THESE DIGITS:  6 7 3 9\n",
        "safe": true
    },
    {
        "filename": "24 game_162.txt",
        "content": "(9 - 7 + 6) * 3\n",
        "safe": true
    },
    {
        "filename": "24 game_163.txt",
        "content": "RESULT IS    24.0000\nYOU WIN\n",
        "safe": true
    },
    {
        "filename": "24 game_164.txt",
        "content": "import Darwin\nimport Foundation\n\nprintln(\"24 Game\")\nprintln(\"Generating 4 digits...\")\n\nfunc randomDigits() -> Int[] {\n    var result = Int[]();\n    for var i = 0; i < 4; i++ {\n        result.append(Int(arc4random_uniform(9)+1))\n    }\n    return result;\n}\n\n// Choose 4 digits\nlet digits = randomDigits()\n\nprint(\"Make 24 using these digits\u00a0: \")\n\nfor digit in digits {\n    print(\"\\(digit) \")\n}\nprintln()\n\n// get input from operator\nvar input = NSString(data:NSFileHandle.fileHandleWithStandardInput().availableData, encoding:NSUTF8StringEncoding)\n\nvar enteredDigits = Int[]()\n\nvar enteredOperations = Character[]()\n\nlet inputString = input as String\n\n// store input in the appropriate table\nfor character in inputString {\n    switch character {\n        case \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\":\n            let digit = String(character)\n            enteredDigits.append(digit.toInt()!)\n        case \"+\", \"-\", \"*\", \"/\":\n            enteredOperations.append(character)\n        case \"\\n\":\n            println()\n        default:\n            println(\"Invalid expression\")\n    }\n}\n\n// check value of expression provided by the operator\nvar value = Int()\n\nif enteredDigits.count == 4 && enteredOperations.count == 3 {\n    value = enteredDigits[0]\n    for (i, operation) in enumerate(enteredOperations) {\n        switch operation {\n            case \"+\":\n                value = value + enteredDigits[i+1]\n            case \"-\":\n                value = value - enteredDigits[i+1]\n            case \"*\":\n                value = value * enteredDigits[i+1]\n            case \"/\":\n                value = value / enteredDigits[i+1]\n            default:\n                println(\"This message should never happen!\")\n        }\n    }\n}\n\nif value != 24 {\n    println(\"The value of the provided expression is \\(value) instead of 24!\")\n} else {\n    println(\"Congratulations, you found a solution!\")\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_165.txt",
        "content": "# Four random non-zero digits\nproc choose4 {} {\n    set digits {}\n    foreach x {1 2 3 4} {lappend digits [expr {int(1+rand()*9)}]}\n    return [lsort $digits]\n}\n\n# Print out a welcome message\nproc welcome digits {\n    puts [string trim \"\nThe 24 Game\n\nGiven any four digits in the range 1 to 9, which may have repetitions,\nUsing just the +, -, *, and / operators; and the possible use of\nbrackets, (), show how to make an answer of 24.\n\nAn answer of \\\"q\\\" will quit the game.\nAn answer of \\\"!\\\" will generate a new set of four digits.\nOtherwise you are repeatedly asked for an expression until it evaluates to 24\n\nNote: you cannot form multiple digit numbers from the supplied digits,\nso an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\n    \"]\n    puts \"\\nYour four digits: $digits\"\n}\n\n# Check whether we've got a legal answer\nproc check {answer digits} {\n    if {\n\t[regexp \"\\[^-+*/() \\t[join $digits {}]\\]\" $answer]\n\t|| [regexp {\\d\\d} $answer]\n    } then {\n\treturn false\n    }\n    set digs [lsort [regexp -inline -all {\\d} $answer]]\n    if {$digs ne $digits} {\n\treturn false\n    }\n    expr {![catch {expr $answer}]}\n}\n\n# The main game loop\nproc main {} {\n    fconfigure stdout -buffering none\n\n    set digits [choose4]\n    welcome $digits\n    set trial 0\n    while true {\n\tputs -nonewline \"Expression [incr trial]: \"\n\tgets stdin answer\n\n        # Check for various types of non-answer\n\tif {[eof stdin] || $answer eq \"q\" || $answer eq \"Q\"} {\n\t    break\n\t} elseif {$answer eq \"!\"} {\n\t    set digits [choose4]\n\t    puts \"New digits: $digits\"\n\t    continue\n\t} elseif {![check $answer $digits]} {\n\t    puts \"The input '$answer' was wonky!\"\n            continue\n\t}\n\n        # Check to see if it is the right answer\n\tset ans [expr [regsub {\\d} $answer {&.0}]]\n\tputs \" = [string trimright $ans .0]\"\n\tif {$ans == 24.0} {\n\t    puts \"That's right!\"\n            break\n\t}\n    }\n    puts \"Thank you and goodbye\"\n}\nmain\n",
        "safe": true
    },
    {
        "filename": "24 game_166.txt",
        "content": "function startTwentyFourGame()\n{\n\tif($numbers\u00a0!$= \"\")\n\t{\n\t\techo(\"Ending current 24 game...\");\n\t\tendTwentyFourGame();\n\t}\n\t\n\techo(\"Welcome to the 24 game!\");\n\techo(\"Generating 4 numbers...\");\n\tfor(%a = 0; %a < 4; %a++)\n\t\t$numbers = setWord($numbers, %a, getRandom(0, 9));\n\t\n\techo(\"Numbers generated! Here are your numbers:\");\n\techo($numbers);\n\techo(\"Use try24Equation( equation ); to try and guess the equation.\");\n\t\n\t$TwentyFourGame = 1;\n}\n\nfunction endTwentyFourGame()\n{\n\tif(!$TwentyFourGame)\n\t{\n\t\techo(\"No 24 game is active!\");\n\t\treturn false;\n\t}\n\t\n\techo(\"Ending the 24 game.\");\n\t$numbers = \"\";\n\t$TwentyFourGame = 0;\n}\n\nfunction try24Equation(%equ)\n{\n\tif(!$TwentyFourGame)\n\t{\n\t\techo(\"No 24 game is active!\");\n\t\treturn false;\n\t}\n\t%numbers = \"0123456789\";\n\t%operators = \"+-*x/()\";\n\t%tempchars = $numbers;\n\t%other = strReplace(%tempchars, \" \", \"\");\n\t\n\t//Check it and make sure it has all the stuff\n\t%equ = strReplace(%equ, \" \", \"\");\n\t%length = strLen(%equ);\n\t\n\tfor(%a = 0; %a < %Length; %a++)\n\t{\n\t\t%Char = getSubStr(%equ, %a, 1);\n\t\tif(%a+1\u00a0!= %Length)\n\t\t\t%Next = getSubStr(%equ, %a+1, 1);\n\t\telse\n\t\t\t%Next = \" \";\n\t\t\n\t\tif(strPos(%numbers @ %operators, %char) < 0)\n\t\t{\n\t\t\techo(\"The equation you entered is invalid! Try again.\");\n\t\t\treturn false;\n\t\t}\n\t\tif(strPos(%tempchars, %char) < 0 && strPos(%operators, %char) < 0)\n\t\t{\n\t\t\techo(\"The equation you entered uses a number you were not given! Try again.\");\n\t\t\treturn false;\n\t\t}\n\t\telse if(strPos(%numbers, %next) >= 0 && strPos(%numbers, %char) >= 0)\n\t\t{\n\t\t\techo(\"No numbers above 9 please! Try again.\");\n\t\t\techo(%next SPC %char SPC %a);\n\t\t\treturn false;\n\t\t}\n\t\telse if(strPos(%operators, %char) > 0)\n\t\t\tcontinue;\n\t\t\n\t\t%pos = 2*strPos(%other, %char);\n\t\tif(%pos < 0)\n\t\t\treturn \"ERROROMG\";\n\t\t\n\t\t//Remove it from the allowed numbers\n\t\t%tempchars = removeWord(%tempchars, %pos/2);\n\t\t%other = getSubStr(%other, 0, %pos) @ getSubStr(%other, %pos+1, strLen(%other));\n    }\n    \n    %result = doEquation(%equ);\n    \n    if(%result\u00a0!= 24)\n    {\n        echo(\"Your equation resulted to\" SPC %result @ \", not 24! Try again.\");\n        return false;\n    }\n    \n    for(%a = 0; %a < 4; %a++)\n        $numbers = setWord($numbers, %a, getRandom(0, 9));\n    \n    echo(\"Great job!\" SPC %equ SPC \"Does result to 24! Here's another set for you:\");\n    echo($numbers);\n}\n\n//Evaluates an equation without using eval.\nfunction doEquation(%equ)\n{   //Validate the input\n    %equ = strReplace(%equ, \" \", \"\");%equ = strReplace(%equ, \"*\", \"x\");\n    %equ = strReplace(%equ, \"+\", \" + \");%equ = strReplace(%equ, \"x\", \" x \");\n    %equ = strReplace(%equ, \"/\", \" / \");%equ = strReplace(%equ, \"-\", \" - \");\n    \n    //Parenthesis'\n    while(strPos(%equ, \"(\") > -1 && strPos(%equ, \")\") > 0)\n    {\n        %start = strPos(%equ, \"(\");\n        %end = %start;\n        %level = 1;\n        while(%level\u00a0!= 0 && %end\u00a0!= strLen(%equ))\n        {\n            %end++;\n            if(getsubStr(%equ, %end, 1) $= \"(\") %level++;\n            if(getsubStr(%equ, %end, 1) $= \")\") %level--;\n        }\n        if(%level\u00a0!= 0)\n            return \"ERROR\";\n        %inbrackets = getsubStr(%equ, %start+1, %end - strLen(getsubStr(%equ, 0, %start + 1)));\n        %leftofbrackets = getsubStr(%equ, 0, %start);\n        %rightofbrackets = getsubStr(%equ, %end + 1, strLen(%equ) - %end);\n        %equ = %leftofbrackets @ doEquation(%inbrackets) @ %rightofbrackets;\n    }\n    \n    if(strPos(%equ, \"ERROR\") >= 0)\n        return \"ERROR\";\n    \n    //Multiplication/Division loop\n    for(%a = 0; %a < getWordCount(%equ); %a++)\n    {\n        if(getWord(%equ, %a) $= \"x\" || getWord(%equ, %a) $= \"/\" && %a\u00a0!= 0)\n        {\n            %f = getWord(%equ, %a - 1);\n            %l = getWord(%equ, %a + 1);\n            %o = getWord(%equ, %a);\n            switch$(%o)\n            {\n                case \"x\": %a--;\n                    %equ = removeWord(removeWord(setWord(%equ, %a+1, %f * %l), %a+2), %a);\n                case \"/\": %a--;\n                    %equ = removeWord(removeWord(setWord(%equ, %a+1, %f / %l), %a+2), %a);\n            }\n        }\n    }\n    \n    //Addition/Subraction loop\n    for(%a = 0; %a < getWordCount(%equ); %a++)\n    {\n        if(getWord(%equ, %a) $= \"+\" || getWord(%equ, %a) $= \"-\" && %a\u00a0!= 0)\n        {\n            %f = getWord(%equ, %a - 1);\n            %l = getWord(%equ, %a + 1);\n            %o = getWord(%equ, %a);\n            switch$(%o)\n            {\n                case \"+\": %a--;\n                    %equ = removeWord(removeWord(setWord(%equ, %a+1, %f + %l), %a+2), %a);\n                case \"-\": %a--;\n                    %equ = removeWord(removeWord(setWord(%equ, %a+1, %f - %l), %a+2), %a);\n            }\n        }\n    }\n    return %equ;\n}",
        "safe": true
    },
    {
        "filename": "24 game_167.txt",
        "content": "$$ MODE TUSCRIPT\nBUILD X_TABLE blanks = \":':\u00a0:\"\n\nSECTION game\noperators=\"*'/'+'-'(')\",numbers=\"\"\n\nLOOP n=1,4\nnumber=RANDOM_NUMBERS (1,9,1)\nnumbers=APPEND(numbers,number)\nENDLOOP\n\nSET allowed=APPEND (numbers,operators)\nSET allowed=MIXED_SORT (allowed)\nSET allowed=REDUCE (allowed)\nBUILD S_TABLE ALLOWED =*\nDATA '{allowed}'\n\nSET checksum=DIGIT_SORT (numbers)\n\nprintnumbers=EXCHANGE (numbers,blanks)\nprintoperat=EXCHANGE (operators,blanks)\n\nPRINT \"Your numbers \", printnumbers\nPRINT \"Use only these operators \", printoperat\nPRINT \"Enter an expression that equates to 24\"\nPRINT \"Enter 'l' for new numbers\"\nPRINT \"Your 4 digits: \",printnumbers\n\nDO play\nENDSECTION\n\nSECTION check_expr\n SET pos = VERIFY (expr,allowed)\n IF (pos!=0) THEN\n  PRINT \"wrong entry on position \",pos\n  DO play\n  STOP\n ELSE\n  SET yourdigits   = STRINGS (expr,\":>/:\")\n  SET yourchecksum = DIGIT_SORT (yourdigits)\n   IF (checksum!=yourchecksum) THEN\n    PRINT/ERROR \"wrong digits\"\n    DO play\n    STOP\n   ELSE\n    CONTINUE\n   ENDIF\n ENDIF\nENDSECTION\n\nSECTION play\nLOOP n=1,3\nASK   \"Expression {n}\": expr=\"\"\nIF (expr==\"l\") THEN\nRELEASE S_TABLE allowed\nPRINT \"Your new numbers\"\nDO game\nELSEIF (expr!=\"\") THEN\nDO check_expr\nsum={expr}\n IF (sum!=24) THEN\n  PRINT/ERROR expr,\" not equates 24 but \",sum\n  CYCLE\n ELSE\n  PRINT \"BINGO \", expr,\" equates \", sum\n  STOP\n ENDIF\nELSE\n CYCLE\nENDIF\nENDLOOP\nENDSECTION\nDO game",
        "safe": true
    },
    {
        "filename": "24 game_168.txt",
        "content": "Your numbers 2 8 9 9\nUse only these operators * / + - ( )\nEnter an expression that equates to 24\nEnter 'l' for new numbers\nYour 4 digits: 2 8 9 9\nExpression 1 >l\nYour new numbers\nYour numbers 2 4 2 3\nUse only these operators * / + - ( )\nEnter an expression that equates to 24\nEnter 'l' for new numbers\nYour 4 digits: 2 4 2 3\nExpression 1 >2+4+2+3\n@@@@@@@@  2+4+2+3 not equates 24 but 11                                @@@@@@@@\nExpression 2 >2+2+2+3\n@@@@@@@@  wrong digits                                                 @@@@@@@@\nExpression 1 >2+2+a+3\nwrong entry on position 5\nExpression 1 >(2+4+2)*3\nBINGO (2+4+2)*3 equates 24\n",
        "safe": true
    },
    {
        "filename": "24 game_169.txt",
        "content": "gen_digits() {\n    awk 'BEGIN { srand()\n                 for(i = 1; i <= 4; i++) print 1 + int(9 * rand())\n         }' | sort\n}\n\nsame_digits() {\n    [ \"$(tr -dc 0-9 | sed 's/./&\\n/g' | grep . | sort)\" = \"$*\" ]\n}\n\nguessed() {\n    [ \"$(echo \"$1\" | tr -dc '\\n0-9()*/+-' | bc 2>/dev/null)\" = 24 ]\n}\n    \n\nwhile :\ndo\n    digits=$(gen_digits)\n    echo\n    echo Digits: $digits\n    read -r expr\n\n    echo \" $expr\" | same_digits \"$digits\" || \\\n        { echo digits should be: $digits; continue; }\n\n    guessed \"$expr\" && message=correct \\\n                    || message=wrong\n\n    echo $message\ndone\n",
        "safe": true
    },
    {
        "filename": "24 game_17.txt",
        "content": ";AutoIt Script Example\n;by Daniel Barnes\n;spam me at djbarnes at orcon dot net dot en zed\n;13/08/2012\n\n;Choose four random digits (1-9) with repetitions allowed:\nglobal $digits\nFOR $i = 1 TO 4\n\t$digits &= Random(1,9,1)\nNEXT\n\nWhile 1\n\tmain()\nWEnd\n\nFunc main()\n\t$text  = \"Enter an equation (using all of, and only, the single digits \"&$digits &\")\"&@CRLF\n\t$text &= \"which evaluates to exactly 24. Only multiplication (*) division (/)\"&@CRLF\n\t$text &= \"addition (+) and subtraction (-) operations and parentheses are allowed:\"\n\t$input = InputBox (\"24 Game\",$text,\"\",\"\",400,150)\n\tIf @error Then exit\n\n\t;remove any spaces in input\n\t$input = StringReplace($input,\" \",\"\")\n\n\t;check correct characters were used\n\tFor $i = 1 To StringLen($input)\n\t\t$chr = StringMid($input,$i,1)\n\t\tIf Not StringInStr(\"123456789*/+-()\",$chr) Then\n\t\t\tMsgBox (0, \"ERROR\",\"Invalid character used: '\"&$chr&\"'\")\n\t\t\treturn\n\t\tendif\n\tNext\n\n\t;validate the equation uses all of the 4 characters, and nothing else\n\t$test = $input\n\t$test = StringReplace($test,\"(\",\"\")\n\t$test = StringReplace($test,\")\",\"\")\n\n\t;validate the length of the input - if its not 7 characters long then the user has done something wrong\n\tIf StringLen ($test) <> 7 Then\n\t\tMsgBox (0,\"ERROR\",\"The equation \"&$test&\" is invalid\")\n\t\treturn\n\tendif\n\n\t$test = StringReplace($test,\"/\",\"\")\n\t$test = StringReplace($test,\"*\",\"\")\n\t$test = StringReplace($test,\"-\",\"\")\n\t$test = StringReplace($test,\"+\",\"\")\n\n\tFor $i = 1 To StringLen($digits)\n\t\t$digit = StringMid($digits,$i,1)\n\t\tFor $ii = 1 To StringLen($test)\n\t\t\tIf  StringMid($test,$ii,1) = $digit Then\n\t\t\t\t$test = StringLeft($test,$ii-1) & StringRight($test,StringLen($test)-$ii)\n\t\t\t\tExitLoop\n\t\t\tendif\n\t\tNext\n\tNext\n\tIf $test <> \"\" Then\n\t\tMsgBox (0, \"ERROR\", \"The equation didn't use all 4 characters, and nothing else!\")\n\t\treturn\n\tendif\n\n\t$try = Execute($input)\n\n\tIf $try = 24 Then\n\t\tMsgBox (0, \"24 Game\",\"Well done. Your equation (\"&$input&\") = 24!\")\n\t\tExit\n\tElse\n\t\tMsgBox (0, \"24 Game\",\"Fail. Your equation (\"&$input&\") = \"&$try&\"!\")\n\t\treturn\n\tendif\nEndFunc\n",
        "safe": true
    },
    {
        "filename": "24 game_170.txt",
        "content": "Sub Rosetta_24game()\n\nDim Digit(4) As Integer, i As Integer, iDigitCount As Integer\nDim stUserExpression As String\nDim stFailMessage As String, stFailDigits As String\nDim bValidExpression As Boolean, bValidDigits As Boolean, bValidChars As Boolean\nDim vResult As Variant, vTryAgain As Variant, vSameDigits As Variant\n\n' Generate 4 random digits\nGenerateNewDigits:\n    For i = 1 To 4\n        Digit(i) = [randbetween(1,9)]\n    Next i\n\n' Get user expression\nGetUserExpression:\n    bValidExpression = True\n    stFailMessage = \"\"\n    stFailDigits = \"\"\n    stUserExpression = InputBox(\"Enter a mathematical expression which results in 24, using the following digits: \" & _\n        Digit(1) & \", \" & Digit(2) & \", \" & Digit(3) & \" and \" & Digit(4), \"Rosetta Code | 24 Game\")\n\n' Check each digit is included in user expression\n    bValidDigits = True\n    stFailDigits = \"\"\n    For i = 1 To 4\n        If InStr(stUserExpression, Digit(i)) = 0 Then\n            bValidDigits = False\n            stFailDigits = stFailDigits & \" \" & Digit(i)\n        End If\n    Next i\n    If bValidDigits = False Then\n        bValidExpression = False\n        stFailMessage = \"Your expression excluded the following required digits: \" & stFailDigits & vbCr & vbCr\n    End If\n\n' Check each character of user expression is a valid character type\n    bValidDigits = True\n    stFailDigits = \"\"\n    For i = 1 To Len(stUserExpression)\n        If InStr(\"0123456789+-*/()\", Mid(stUserExpression, i, 1)) = 0 Then\n            bValidDigits = False\n            stFailDigits = stFailDigits & \" \" & Mid(stUserExpression, i, 1)\n        End If\n    Next i\n    If bValidDigits = False Then\n        bValidExpression = False\n        stFailMessage = stFailMessage & \"Your expression contained invalid characters:\" & stFailDigits & vbCr & vbCr\n    End If\n\n' Check no disallowed integers entered\n    bValidDigits = True\n    stFailDigits = \"\"\n    iDigitCount = 0\n    For i = 1 To Len(stUserExpression)\n        If Not InStr(\"0123456789\", Mid(stUserExpression, i, 1)) = 0 Then\n            iDigitCount = iDigitCount + 1\n            If IsError(Application.Match(--(Mid(stUserExpression, i, 1)), Digit, False)) Then\n                bValidDigits = False\n                stFailDigits = stFailDigits & \" \" & Mid(stUserExpression, i, 1)\n            End If\n        End If\n    Next i\n    If iDigitCount > 4 Then\n        bValidExpression = False\n        stFailMessage = stFailMessage & \"Your expression contained more than 4 digits\" & vbCr & vbCr\n    End If\n        If iDigitCount < 4 Then\n        bValidExpression = False\n        stFailMessage = stFailMessage & \"Your expression contained less than 4 digits\" & vbCr & vbCr\n    End If\n    If bValidDigits = False Then\n        bValidExpression = False\n        stFailMessage = stFailMessage & \"Your expression contained invalid digits:\" & stFailDigits & vbCr & vbCr\n    End If\n\n' Check no double digit numbers entered\n    bValidDigits = True\n    stFailDigits = \"\"\n    For i = 11 To 99\n        If Not InStr(stUserExpression, i) = 0 Then\n            bValidDigits = False\n            stFailDigits = stFailDigits & \" \" & i\n        End If\n    Next i\n    If bValidDigits = False Then\n        bValidExpression = False\n        stFailMessage = stFailMessage & \"Your expression contained invalid numbers:\" & stFailDigits & vbCr & vbCr\n    End If\n\n' Check result of user expression\n    On Error GoTo EvalFail\n    vResult = Evaluate(stUserExpression)\n    If Not vResult = 24 Then\n        bValidExpression = False\n        stFailMessage = stFailMessage & \"Your expression did not result in 24. It returned: \" & vResult\n    End If\n\n' Return results\n    If bValidExpression = False Then\n        vTryAgain = MsgBox(stFailMessage & vbCr & vbCr & \"Would you like to try again?\", vbCritical + vbRetryCancel, \"Rosetta Code | 24 Game | FAILED\")\n            If vTryAgain = vbRetry Then\n                vSameDigits = MsgBox(\"Do you want to use the same numbers?\", vbQuestion + vbYesNo, \"Rosetta Code | 24 Game | RETRY\")\n                If vSameDigits = vbYes Then\n                    GoTo GetUserExpression\n                Else\n                    GoTo GenerateNewDigits\n                End If\n            End If\n    Else\n        vTryAgain = MsgBox(\"You entered: \" & stUserExpression & vbCr & vbCr & \"which resulted in: \" & vResult, _\n            vbInformation + vbRetryCancel, \"Rosetta Code | 24 Game | SUCCESS\")\n        If vTryAgain = vbRetry Then\n            GoTo GenerateNewDigits\n        End If\n    End If\n    Exit Sub\nEvalFail:\n    bValidExpression = False\n    vResult = Err.Description\n    Resume\nEnd Sub\n",
        "safe": true
    },
    {
        "filename": "24 game_171.txt",
        "content": "import os\nimport rand\nimport rand.seed\nimport math\n\nfn main() {\n    rand.seed(seed.time_seed_array(2))\n    mut n := []int{len: 4}\n    for i in 0.. n.len {\n        n[i] = rand.intn(9) or {0}\n    }\n    println(\"Your numbers: $n\")\n    expr := os.input(\"Enter RPN: \")\n    if expr.len != 7 {\n        println(\"invalid. expression length must be 7.\" +\n            \" (4 numbers, 3 operators, no spaces)\")\n        return\n    }\n    mut stack := []f64{len: 0, cap:4}\n    for r in expr.split('') {\n        if r >= '0' && r <= '9' {\n            if n.len == 0 {\n                println(\"too many numbers.\")\n                return\n            }\n            mut i := 0\n            for n[i] != r.int() {\n                i++\n                if i == n.len {\n                    println(\"wrong numbers.\")\n                    return\n                }\n            }\n            n.delete(n.index(r.int()))\n            stack << f64(r[0]-'0'[0])\n            continue\n        }\n        if stack.len < 2 {\n            println(\"invalid expression syntax.\")\n            return\n        }\n        match r {\n            '+' {\n                stack[stack.len-2] += stack[stack.len-1]\n            }\n            '-' {\n                stack[stack.len-2] -= stack[stack.len-1]\n            }\n            '*' {\n                stack[stack.len-2] *= stack[stack.len-1]\n            }\n            '/' {\n                stack[stack.len-2] /= stack[stack.len-1]\n            }\n            else {\n                println(\"$r invalid.\")\n                return\n            }\n        }\n        stack = stack[..stack.len-1]\n    }\n    if math.abs(stack[0]-24) > 1e-6 {\n        println(\"incorrect. ${stack[0]}\u00a0!= 24\")\n    } else {\n        println(\"correct.\")\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_172.txt",
        "content": "Make 24 using these digits: [2, 3, 5, 1]\n> 23*51-*\nCorrect!\n",
        "safe": true
    },
    {
        "filename": "24 game_173.txt",
        "content": "import \"random\" for Random\nimport \"./ioutil\" for Input\nimport \"./seq\" for Stack\n\nvar R = Random.new()\n\nclass Game24 {\n    static run() {\n        var digits = List.filled(4, 0)\n        for (i in 0..3) digits[i] = R.int(1, 10)\n        System.print(\"Make 24 using these digits: %(digits)\")\n        var cin = Input.text(\"> \")\n        var s = Stack.new()\n        var total = 0\n        for (c in cin) {\n            var d = c.bytes[0]\n            if (d >= 48 && d <= 57) {\n                d = d - 48\n                total = total + (1 << (d*5))\n                s.push(d)\n            } else if (\"+-*/\".indexOf(c) != -1) s.push(applyOperator_(s.pop(), s.pop(), c))\n        }\n        if (tallyDigits_(digits) != total) {\n            System.write(\"Not the same digits.\")\n        } else if ((24 - s.peek()).abs < 0.001) {\n            System.print(\"Correct!\")\n        } else {\n            System.write(\"Not correct.\")\n        }\n    }\n\n    static applyOperator_(a, b, c) {\n        if (c == \"+\") return a + b\n        if (c == \"-\") return b - a\n        if (c == \"*\") return a * b\n        if (c == \"/\") return b / a\n        return 0/0\n    }\n\n    static tallyDigits_(a) {\n        var total = 0\n        for (i in 0...a.count) total = total + (1 << (a[i]*5))\n        return total\n    }\n}\n\nGame24.run()\n",
        "safe": true
    },
    {
        "filename": "24 game_174.txt",
        "content": "Make 24 using these digits: [2, 3, 5, 1]\n> 23*51-*\nCorrect!\n",
        "safe": true
    },
    {
        "filename": "24 game_175.txt",
        "content": "real Stack(10), A, B;\nint  SP, I, Char, Digit, Digits(10);\n\nproc Push(X);\nreal X;\n[Stack(SP):= X;  SP:= SP+1];\n\nfunc real Pop;\n[SP:= SP-1;  return Stack(SP)];\n\n[SP:= 0;\nfor I:= 0 to 9 do Digits(I):= 0;\nText(0, \"Enter an RPN expression that equals 24 using all these digits:\");\nfor I:= 0 to 3 do\n        [Digit:= Ran(9)+1;\n        ChOut(0, ^ );  ChOut(0, Digit+^0);\n        Digits(Digit):= Digits(Digit)+1;\n        ];\nText(0, \"^m^j> \");\nloop    [Char:= ChIn(1);\n        ChOut(0, Char);\n        if Char >= ^1 and Char <=^9 then\n                [Digit:= Char - ^0;\n                Push(float(Digit));\n                Digits(Digit):= Digits(Digit) - 1;\n                ]\n        else    [if SP >= 2 then [A:= Pop;  B:= Pop] else quit;\n                case Char of\n                  ^+:   Push(B+A);\n                  ^-:   Push(B-A);\n                  ^*:   Push(B*A);\n                  ^/:   Push(B/A)\n                other   quit;\n                ];\n        ];\nCrLf(0);\nfor I:= 0 to 9 do\n    if Digits(I) # 0 then\n        [Text(0, \"Must use each of the given digits.^m^j\");  exit];\nText(0, if abs(Pop-24.0) < 0.001 then \"Correct!\" else \"Wrong.\");\nCrLf(0);\n]",
        "safe": true
    },
    {
        "filename": "24 game_176.txt",
        "content": "Enter an RPN expression that equals 24 using all these digits: 1 4 4 9\n> 44*9+1-\nCorrect!\n",
        "safe": true
    },
    {
        "filename": "24 game_177.txt",
        "content": "operadores$ = \"*/+-\"\nespacios$ = \"                                                                                \"\n\nclear screen\nprint \"24 Game\"\nprint \"============\\n\"\nprint \"The player is provided with 4 numbers with which to perform operations\"\nprint \"of addition (+), subtraction (-), multiplication (*) or division (/) to attempt\"\nprint \"to get 24 as result.\"\nprint \"Use reverse Polish notation (first the operands and then the operators).\"\nprint \"For example: instead of 2 + 4, type 2 4 +\\n\\n\"\n\nrepeat\n\tprint at(0,9) espacios$, espacios$, espacios$, espacios$, espacios$, espacios$\n\tprint at(0,9);\n\tserie$ = ordenaCadena$(genSerie$())\n\tvalidos$ = serie$+operadores$\n\tline input \"Enter your formula in reverse Polish notation: \" entrada$\n\tentrada$ = quitaEspacios$(entrada$)\n\tentradaOrd$ = ordenaCadena$(entrada$)\n\tif (right$(entradaOrd$,4) <> serie$) or (len(entradaOrd$)<>7) then\n\t\tprint \"Error in the entered series\"\n\telse\n\t\tresultado = evaluaEntrada(entrada$)\n\t\tprint \"The result is = \",resultado,\" \"\n\t\tif resultado = 24 then\n\t\t\tprint \"Correct!\"\n\t\telse\n\t\t\tprint \"Error!\"\n\t\tend if\n\tend if\n\tprint \"Want to try again? (press N to exit, or another key to continue)\"\nuntil(upper$(left$(inkey$(),1)) = \"N\")\n\nsub genSerie$()\n\tlocal i, c$, s$\n\t\n\tprint \"The numbers to be used are: \";\n\ti = ran()\n\tfor i = 1 to 4\n\t\tc$ = str$(int(ran(9))+1)\n\t\tprint c$,\" \";\n\t\ts$ = s$ + c$\n\tnext i\n\tprint\n\treturn s$\nend sub\n\n\nsub evaluaEntrada(entr$)\n\tlocal d1, d2, c$, n(4), i\n\t\n\twhile(entr$<>\"\")\n\t\tc$ = left$(entr$,1)\n\t\tentr$ = mid$(entr$,2)\t\t\n\t\tif instr(serie$,c$) then\n\t\t\ti = i + 1\n\t\t\tn(i) = val(c$)\n\t\telseif instr(operadores$,c$) then\n\t\t\td2 = n(i)\n\t\t\tn(i) = 0\n\t\t\ti = i - 1\n\t\t\td1 = n(i)\n\t\t\tn(i) = evaluador(d1, d2, c$)\n\t\telse\n\t\t\tprint \"Invalid sign\"\n\t\t\treturn\n\t\tend if\n\twend\n\t\n\treturn n(i)\n\t\t\nend sub\n\n\nsub evaluador(d1, d2, op$)\n\tlocal t\n\t\n\tswitch op$\n\t\tcase \"+\": t = d1 + d2\u00a0: break\n\t\tcase \"-\": t = d1 - d2\u00a0: break\n\t\tcase \"*\": t = d1 * d2\u00a0: break\n\t\tcase \"/\": t = d1 / d2\u00a0: break\n\tend switch\n\t\n\treturn t\nend sub\n\n\nsub quitaEspacios$(entr$)\n\tlocal n, i, s$, t$(1)\n\t\n\tn = token(entr$,t$(),\" \")\n\t\n\tfor i=1 to n\n\t\ts$ = s$ + t$(i)\n\tnext i\n\treturn s$\nend sub\n\n\nsub ordenaCadena$(cadena$)\n\tlocal testigo, n, fin, c$\n\t\n\tfin = len(cadena$)-1\n\trepeat\n\t\ttestigo = false\n\t\tfor n = 1 to fin\n\t\t\tif mid$(cadena$,n,1) > mid$(cadena$,n+1,1) then\n\t\t\t\ttestigo = true\n\t\t\t\tc$ = mid$(cadena$,n,1)\n\t\t\t\tmid$(cadena$,n,1) = mid$(cadena$,n+1,1)\n\t\t\t\tmid$(cadena$,n+1,1) = c$\n\t\t\tend if\n\t\tnext n\n\tuntil(testigo = false)\n\treturn cadena$\nend sub",
        "safe": true
    },
    {
        "filename": "24 game_178.txt",
        "content": "do\n\tclear screen\n\tn$=\"\"\n\tfor i=1 to 4\n\t\tn$=n$+str$(int(ran(9)+1))\n\tnext i\n\tprint at(35,0) \"24 GAME\\n\"\n\tprint \"Combine numbers and operators for obtain 24.\"\n\tprint \"Allowed characters: \";\n\ti$=n$+\"+-*/()\"\n\tfor i=1 to 10\n\t\tprint mid$(i$,i,1),\" \";\n\tnext i\n\tprint \"[nothing to end program]\\n\"\nlabel accept\n\tp$=\"\"\n\ti$=n$+\"+-*/()\"\n\tprint at(0,4);:input \"Enter the formula: \" f$\n\tif f$=\"\" end\n\tfor i=1 to len(f$)\n\t\tc$=mid$(f$,i,1)\n\t\tswitch c$\n\t\t\tcase \" \": f$=left$(f$,i-1)+right$(f$,len(f$)-i): break\n\t\t\tcase \"+\":case \"-\":case \"*\":case \"/\": p$=p$+\"o\": break\n\t\t\tcase \"(\":case \")\": p$=p$+c$: break\n\t\t\tcase mid$(i$,1,1): p$=p$+\"n\": mid$(i$,1,1)=\" \": break\n\t\t\tcase mid$(i$,2,1): p$=p$+\"n\": mid$(i$,2,1)=\" \": break\n\t\t\tcase mid$(i$,3,1): p$=p$+\"n\": mid$(i$,3,1)=\" \": break\n\t\t\tcase mid$(i$,4,1): p$=p$+\"n\": mid$(i$,4,1)=\" \": break\n\t\t\tdefault: message(\" = Invalid argument!  \"): break\n\t\tend switch\n\t\tif f$=\"\" goto accept\n\tnext i\n\trestore\n\tfor i=1 to 11\n\t\tread t$\n\t\tif t$=p$ break\n\tnext i\n\tif t$<>p$ then\n\t\tmessage(\" = Bad construction!  \")\n\t\tgoto accept\n\tend if\n\tlet r=eval(f$)\n\tprint \"\\n\",f$,\" = \",r,\" \";\n\tif r<>24 then\n\t\tmessage(\" = Wrong!             \")\n\t\tgoto accept\n\telse\n\t\tmessage(\" = Correct!           \")\n\t\tpause 5\n\tend if\nloop\n\nDATA \"nononon\"\nDATA \"(non)onon\"\nDATA \"nono(non)\"\nDATA \"no(no(non))\"\nDATA \"((non)on)on\"\nDATA \"no(non)on\"\nDATA \"(non)o(non)\"\nDATA \"no((non)on)\"\nDATA \"(nonon)on\"\nDATA \"(no(non))on\"\nDATA \"no(nonon)\"\n\nsub message(m$)\n\tprint at(0,7) f$,m$\n\tbeep: beep: beep\n\tpause 1\n\tprint at(19,4) \"                     \"\n\tf$=\"\"\nend sub\n\nsub eval(c$)\n\tstatic linea\n\t\n\tlinea=linea+1\n\tc$=\"sub s\"+str$(linea+1000000,\"#######\")+\"():return \"+c$+\":end sub\"\n\tcompile c$\n\treturn execute(mid$(c$,5,8))\nend sub",
        "safe": true
    },
    {
        "filename": "24 game_179.txt",
        "content": "while(1){\n   digits\u00a0:= [1..4].pump(String,(0).random.fpM(\"11-\",1,9));\n   exp\u00a0:= ask(\"Enter an expression using the digits \",digits,\n\t      \" that evals to 24: \") - \" \\n\";\n   expf:=exp.apply(fcn(c){if (\"1\"<=c<=\"9\") \"(%s).toFloat()\".fmt(c) else c});\n   reg r;\n   try { Compiler.Compiler.compileText(expf).__constructor(); r=vm.regX }\n   catch { println(\"bad expression\"); continue; }\n   else{ \n      extra\u00a0:= (exp - \"+-/*()\" - digits);\n      if (extra) { println(\"Extra goodies in expression: \",extra); continue; }\n      (digits.split(\"\").sort()\u00a0!= (exp - \"+-/*()\").split(\"\").sort())\u00a0:\n         if(_) { println(\"You can only use the digits \",digits,\" once each\"); continue; };\n      if (exp.matches(\"*[1-9][1-9]*\"))\n\t { println(\"no repeated digits\"); continue; }\n      if (r.closeTo(24,0.001)) \"nice!\".println();\n      else println(\"That evaled to \",r,\", not 24\");\n   }\n}",
        "safe": true
    },
    {
        "filename": "24 game_18.txt",
        "content": "      REM Choose four random digits (1-9) with repetitions allowed:\n      DIM digits%(4), check%(4)\n      FOR choice% = 1 TO 4\n        digits%(choice%) = RND(9)\n      NEXT choice%\n      \n      REM Prompt the player:\n      PRINT \"Enter an equation (using all of, and only, the single digits \";\n      FOR index% = 1 TO 4\n        PRINT ; digits%(index%) ;\n        IF index%<>4 PRINT \" \" ;\n      NEXT\n      PRINT \")\"\n      PRINT \"which evaluates to exactly 24.  Only multiplication (*), division (/),\"\n      PRINT \"addition (+) & subtraction (-) operations and parentheses are allowed:\"\n      INPUT \"24 = \" equation$\n      \n      REPEAT\n        \n        REM Check that the correct digits are used:\n        check%() = 0\n        FOR char% = 1 TO LEN(equation$)\n          digit% = INSTR(\"0123456789\", MID$(equation$, char%, 1)) - 1\n          IF digit% >= 0 THEN\n            FOR index% = 1 TO 4\n              IF digit% = digits%(index%) THEN\n                IF NOT check%(index%) check%(index%) = TRUE : EXIT FOR\n              ENDIF\n            NEXT index%\n            IF index% > 4 THEN\n              PRINT \"Sorry, you used the illegal digit \"; digit%\n              EXIT REPEAT\n            ENDIF\n          ENDIF\n        NEXT char%\n        \n        FOR index% = 1 TO 4\n          IF NOT check%(index%) THEN\n            PRINT \"Sorry, you failed to use the digit \" ; digits%(index%)\n            EXIT REPEAT\n          ENDIF\n        NEXT index%\n        \n        REM Check that no pairs of digits are used:\n        FOR pair% = 11 TO 99\n          IF INSTR(equation$, STR$(pair%)) THEN\n            PRINT \"Sorry, you may not use a pair of digits \"; pair%\n            EXIT REPEAT\n          ENDIF\n        NEXT pair%\n        \n        REM Check whether the equation evaluates to 24:\n        ON ERROR LOCAL PRINT \"Sorry, there was an error in the equation\" : EXIT REPEAT\n        result = EVAL(equation$)\n        RESTORE ERROR\n        IF result = 24 THEN\n          PRINT \"Congratulations, you succeeded in the task!\"\n        ELSE\n          PRINT \"Sorry, your equation evaluated to \" ; result \" rather than 24!\"\n        ENDIF\n        \n      UNTIL TRUE\n      \n      INPUT '\"Play again\", answer$\n      IF LEFT$(answer$,1) = \"y\" OR LEFT$(answer$,1) = \"Y\" THEN CLS : RUN\n      QUIT\n",
        "safe": true
    },
    {
        "filename": "24 game_180.txt",
        "content": "Enter an expression using the digits 8833 that evals to 24: (8/(3-(8/3)))\nnice!\nEnter an expression using the digits 8833 that evals to 24: (8/(3-(8/9)))\nExtra goodies in expression: 9\nEnter an expression using the digits 8833 that evals to 24: (8/(3-(8/8)))\nYou can only use the digits 8833 once each\nEnter an expression using the digits 7155 that evals to 24: 7+1+5+5\nThat evaled to 18, not 24\nEnter an expression using the digits 8332 that evals to 24: 8*3*(3-2)\nnice!\n",
        "safe": true
    },
    {
        "filename": "24 game_181.txt",
        "content": "10 LET n$=\"\"\n20 RANDOMIZE \n30 FOR i=1 TO 4\n40 LET n$=n$+STR$ (INT (RND*9)+1)\n50 NEXT i\n60 LET i$=\"\": LET f$=\"\": LET p$=\"\"\n70 CLS \n80 PRINT \"24 game\"\n90 PRINT \"Allowed characters:\"\n100 LET i$=n$+\"+-*/()\"\n110 PRINT AT 4,0;\n120 FOR i=1 TO 10\n130 PRINT i$(i);\" \";\n140 NEXT i\n150 PRINT \"(0 to end)\"\n160 INPUT \"Enter the formula\";f$\n170 IF f$=\"0\" THEN STOP \n180 PRINT AT 6,0;f$;\" = \";\n190 FOR i=1 TO LEN f$\n200 LET c$=f$(i)\n210 IF c$=\" \" THEN LET f$(i)=\"\": GO TO 250\n220 IF c$=\"+\" OR c$=\"-\" OR c$=\"*\" OR c$=\"/\" THEN LET p$=p$+\"o\": GO TO 250\n230 IF c$=\"(\" OR c$=\")\" THEN LET p$=p$+c$: GO TO 250\n240 LET p$=p$+\"n\"\n250 NEXT i\n260 RESTORE \n270 FOR i=1 TO 11\n280 READ t$\n290 IF t$=p$ THEN LET i=11\n300 NEXT i\n310 IF t$<>p$ THEN PRINT INVERSE 1;\"Bad construction!\": BEEP 1,.1: PAUSE 0: GO TO 60\n320 FOR i=1 TO LEN f$\n330 FOR j=1 TO 10\n340 IF (f$(i)=i$(j)) AND f$(i)>\"0\" AND f$(i)<=\"9\" THEN LET i$(j)=\" \"\n350 NEXT j\n360 NEXT i\n370 IF i$( TO 4)<>\"    \" THEN PRINT FLASH 1;\"Invalid arguments!\": BEEP 1,.01: PAUSE 0: GO TO 60\n380 LET r=VAL f$\n390 PRINT r;\" \";\n400 IF r<>24 THEN PRINT FLASH 1;\"Wrong!\": BEEP 1,1: PAUSE 0: GO TO 60\n410 PRINT FLASH 1;\"Correct!\": PAUSE 0: GO TO 10\n420 DATA \"nononon\"\n430 DATA \"(non)onon\"\n440 DATA \"nono(non)\"\n450 DATA \"no(no(non))\"\n460 DATA \"((non)on)on\"\n470 DATA \"no(non)on\"\n480 DATA \"(non)o(non)\"\n485 DATA \"no((non)on)\"\n490 DATA \"(nonon)on\"\n495 DATA \"(no(non))on\"\n500 DATA \"no(nonon)\"\n",
        "safe": true
    },
    {
        "filename": "24 game_19.txt",
        "content": "v         > > >> v\n2           2                   1234\n4         ^1?3^4\n>8*00p10p> >?  ?5> 68*+00g10gpv\n          v9?7v6              0\n            8                 0\n          > > >> ^            g\n         ^p00  _v#   `\\*49:+1 <\n_>\"rorrE\",,,,,$ >~:67*-!#v_:167*+-!#v_:95*-!#v_:295*+-!#v_:586*+\\`#v_:97*2--!#v\n                         $          $        $          $          :          $\n                         *          +        -          /          1          :\n\t\t^        <          <        <          <          8          .\n                                                                   6          6\n                                                                   *          4\n                                                                   +          *\n                                                                   \\          -\n                                                                   `    >    v_v\n                                                                             \"\n ^                                       <                         _v        e\n\t\t^                       _^#+*28:p2\\*84\\-*86g2:-+*441<        s\n                                                                             o\n                                                                             L\n                                                  >    1                |-*49\"#<\n                                                  |   -*84gg01g00<p00*84<v   <\n                                                  >00g:1+00p66*`#^_ \"niW\">:#,_@\n",
        "safe": true
    },
    {
        "filename": "24 game_2.txt",
        "content": "\\ Generate four random digits and display to the user\n\\ then get an expression from the user using +, -, / and * and the digits\n\\ the result must equal 24\n\\ http://8th-dev.com/24game.html\n \n\\ Only the words in namespace 'game' are available to the player:\nns: game\n \n: + n:+ ;\n: - n:- ;\n: * n:* ;\n: / n:/ ;\n \nns: G\n \nvar random-digits\nvar user-input\n \n: one-digit \\ a -- a\n\trand n:abs 9 n:mod n:1+ a:push ;\n \n: gen-digits \\ - a\n\t[] clone nip \\ the clone nip is not needed in versions past 1.0.2...\n\t' one-digit 4 times\n\t' n:cmp a:sort\n\trandom-digits !  ;\n \n: prompt-user \n\tcr \"The digits are: \" .  random-digits @ . cr ;\n \n: goodbye\n\tcr \"Thanks for playing!\\n\" . cr 0 die ;\n \n: get-input\n\t70 null con:accept dup user-input !\n\tnull? if drop goodbye then ;\n \n: compare-digits\n\ttrue swap\n\t(\n\t\t\\ inputed-array index\n\t\tdup >r\n\t\ta:@ \n\t\trandom-digits @ r> a:@ nip\n\t\tn:= not if\n\t\t\tbreak\n\t\t\tswap drop false swap\n\t\tthen\n\t) 0 3 loop drop ;\n \n/^\\D*(\\d)\\D+(\\d)\\D+(\\d)\\D+(\\d)\\D*$/  var, digits-regex\n \n: all-digits? \n\tuser-input @ digits-regex @ r:match \n\tnull? if drop false else\n\t\t5 = not if\n\t\t\tfalse\n\t\telse\n\t\t\t\\ convert the captured digits in the regex into a sorted array:\n\t\t\tdigits-regex @ \n\t\t\t( r:@ >n swap ) 1 4 loop drop\n\t\t\t4 a:close ' n:cmp a:sort\n\t\t\tcompare-digits\n\t\tthen\n\tthen ;\n \n: does-eval?\n\t0 user-input @ eval 24 n:= \n\tdup not if\n\t\tcr \"Sorry, that expression is wrong\" . cr\n\tthen ;\n \n: check-input\n\treset\n\tall-digits?  if \n\t\tdoes-eval? if\n\t\t\tcr \"Excellent!  Your expression: \\\"\" .\n\t\t\tuser-input @ .\n\t\t\t\"\\\" worked!\" . cr\n\t\tthen\n\telse\n\t\tcr \"You did not use the digits properly, try again.\" . cr\n\tthen ;\n \n: intro quote |\n \nWelcome to the '24 game'!\n \nYou will be shown four digits each time.  Using only the + - * and / operators\nand all the digits (and only the digits), produce the number '24'\n \nEnter your result in 8th syntax, e.g.:  4 4 + 2 1 + *\n \nTo quit the game, just hit enter by itself. Enjoy!\n \n\t| . ;\n \n: start\n\t\\ don't allow anything but the desired words\n\tns:game only\n\tintro\n\trepeat\n\t\tgen-digits\n\t\tprompt-user\n\t\tget-input\n\t\tcheck-input\n\tagain ;\n \nstart\n",
        "safe": true
    },
    {
        "filename": "24 game_20.txt",
        "content": "213/-4*=\n",
        "safe": true
    },
    {
        "filename": "24 game_21.txt",
        "content": "24 Win\n",
        "safe": true
    },
    {
        "filename": "24 game_22.txt",
        "content": "  ( 24-game\n  =     m-w m-z 4numbers answer expr numbers\n      , seed get-random convertBinaryMinusToUnary\n      , convertDivisionToMultiplication isExpresssion reciprocal\n    .   (seed=.!arg:(~0:~/#?m-w.~0:~/#?m-z))\n      & seed$!arg\n      & ( get-random\n        =   \n          .   36969*mod$(!m-z.65536)+div$(!m-z.65536):?m-z\n            & 18000*mod$(!m-w.65536)+div$(!m-w.65536):?m-w\n            & mod$(!m-z*65536+!m-w.9)+1\n        )\n      & ( convertBinaryMinusToUnary\n        =   a z\n          .     @(!arg:%?a \"-\" ?z)\n              & str$(!a \"+-1*\" convertBinaryMinusToUnary$!z)\n            | !arg\n        )\n      & (reciprocal=.!arg^-1)\n      & ( convertDivisionToMultiplication\n        =   a z\n          .     @(!arg:?a \"/\" ?z)\n              & str$(!a \"*reciprocal$\" convertDivisionToMultiplication$!z)\n            | !arg\n        )\n      & ( isExpresssion\n        =   A Z expr\n          .   @( !arg\n              \u00a0:   ?A\n                   (\"+\"|\"-\"|\"*\"|\"/\")\n                   ( ?Z\n                   & isExpresssion$!A\n                   & isExpresssion$!Z\n                   )\n               )\n            |   !numbers:?A !arg ?Z\n              & !A !Z:?numbers\n            |   ( @(!arg:\"(\" ?expr \")\")\n                | @(!arg:(\" \"|\\t) ?expr)\n                | @(!arg:?expr (\" \"|\\t))\n                )\n              & isExpresssion$!expr\n        )\n      &   out\n        $ \"Enter an expression that evaluates to 24 by combining the following numbers.\"\n      & out$\"You may only use the operators + - * /\"\n      & out$\"Parentheses and spaces are allowed.\"\n      &   whl\n        ' (   get-random$() get-random$() get-random$() get-random$\n           \u00a0: ?4numbers\n          & out$!4numbers\n          &   whl\n            ' ( get'(,STR):?expr:~\n              & !4numbers:?numbers\n              & ~(isExpresssion$!expr&!numbers:)\n              &   out\n                $ ( str\n                  $ ( \"[\"\n                      !expr\n                      \"] is not a valid expression. Try another expression.\"\n                    )\n                  )\n              )\n          & !expr:~\n          & convertBinaryMinusToUnary$!expr:?expr\n          & convertDivisionToMultiplication$!expr:?expr\n          & get$(!expr,MEM):?answer\n          & out$(str$(!expr \" = \" !answer))\n          &   !answer\n           \u00a0: ( 24&out$Right!\n              | #&out$Wrong!\n              )\n          & out$\"Try another one:\"\n          )\n      & out$bye\n  )\n& 24-game$(13.14)\n&\u00a0;",
        "safe": true
    },
    {
        "filename": "24 game_23.txt",
        "content": "Enter an expression that evaluates to 24 by combining the following numbers.\nYou may only use the operators + - * /\nParentheses and spaces are allowed.\n4 2 2 7\n4*7 - 2-2\n4*7 +-1* 2+-1*2 = 24\nRight!\nTry another one:\n4 7 9 8\n((4) *(8 - (9- 7))\n[((4) *(8 - (9- 7))] is not a valid expression. Try another expression.\n((4) *(8 - (9- 7)))\n((4) *(8 +-1* (9+-1* 7))) = 24\nRight!\nTry another one:\n9 5 8 5\n5 * 5 - (9 - 8)\n5 * 5 +-1* (9 +-1* 8) = 24\nRight!\nTry another one:\n5 9 7 8\n5*8 - 9 - 7\n5*8 +-1* 9 +-1* 7 = 24\nRight!\nTry another one:\n7 8 6 2\n8 * ((7 - 6) + 2)\n8 * ((7 +-1* 6) + 2) = 24\nRight!\nTry another one:\n8 6 8 1\n8 * (1 + 8 - 6)\n8 * (1 + 8 +-1* 6) = 24\nRight!\nTry another one:\n8 2 2 4\n8 * (2 + 4)/2\n8 * (2 + 4)*reciprocal$2 = 24\nRight!\nTry another one:\n8 4 6 7\n\nbye",
        "safe": true
    },
    {
        "filename": "24 game_24.txt",
        "content": "#include <stdio.h>\n#include <ctype.h>\n#include <stdlib.h>\n#include <setjmp.h>\n#include <time.h>\n \njmp_buf ctx;\nconst char *msg;\n \nenum { OP_NONE = 0, OP_NUM, OP_ADD, OP_SUB, OP_MUL, OP_DIV };\n \ntypedef struct expr_t *expr, expr_t;\nstruct expr_t {\n\tint op, val, used;\n\texpr left, right;\n};\n \n#define N_DIGITS 4\nexpr_t digits[N_DIGITS];\n \nvoid gen_digits()\n{\n\tint i;\n\tfor (i = 0; i < N_DIGITS; i++)\n\t\tdigits[i].val = 1 + rand() % 9;\n}\n \n#define MAX_INPUT 64\nchar str[MAX_INPUT];\nint pos;\n \n#define POOL_SIZE 8\nexpr_t pool[POOL_SIZE];\nint pool_ptr;\n \nvoid reset()\n{\n\tint i;\n\tmsg = 0;\n\tpool_ptr = pos = 0;\n\tfor (i = 0; i < POOL_SIZE; i++) {\n\t\tpool[i].op = OP_NONE;\n\t\tpool[i].left = pool[i].right = 0;\n\t}\n\tfor (i = 0; i < N_DIGITS; i++)\n\t\tdigits[i].used = 0;\n}\n \n/* longish jumpish back to input cycle */\nvoid bail(const char *s)\n{\n\tmsg = s;\n\tlongjmp(ctx, 1);\n}\n \nexpr new_expr()\n{\n\tif (pool_ptr < POOL_SIZE)\n\t\treturn pool + pool_ptr++;\n\treturn 0;\n}\n \n/* check next input char */\nint next_tok()\n{\n\twhile (isspace(str[pos])) pos++;\n\treturn str[pos];\n}\n \n/* move input pointer forward */\nint take()\n{\n\tif (str[pos] != '\\0') return ++pos;\n\treturn 0;\n}\n \n/* BNF(ish)\nexpr = term { (\"+\")|(\"-\") term }\nterm = fact { (\"*\")|(\"/\") expr }\nfact =\tnumber\n\t| '(' expr ')'\n*/\n \nexpr get_fact();\nexpr get_term();\nexpr get_expr();\n \nexpr get_expr()\n{\n\tint c;\n\texpr l, r, ret;\n\tif (!(ret = get_term())) bail(\"Expected term\");\n\twhile ((c = next_tok()) == '+' || c == '-') {\n\t\tif (!take()) bail(\"Unexpected end of input\");\n\t\tif (!(r = get_term())) bail(\"Expected term\");\n \n\t\tl = ret;\n\t\tret = new_expr();\n\t\tret->op = (c == '+') ? OP_ADD : OP_SUB;\n\t\tret->left = l;\n\t\tret->right = r;\n\t}\n\treturn ret;\n}\n \nexpr get_term()\n{\n\tint c;\n\texpr l, r, ret;\n\tret = get_fact();\n\twhile((c = next_tok()) == '*' || c == '/') {\n\t\tif (!take()) bail(\"Unexpected end of input\");\n \n\t\tr = get_fact();\n\t\tl = ret;\n\t\tret = new_expr();\n\t\tret->op = (c == '*') ? OP_MUL : OP_DIV;\n\t\tret->left = l;\n\t\tret->right = r;\n\t}\n\treturn ret;\n}\n \nexpr get_digit()\n{\n\tint i, c = next_tok();\n\texpr ret;\n\tif (c >= '0' && c <= '9') {\n\t\ttake();\n\t\tret = new_expr();\n\t\tret->op = OP_NUM;\n\t\tret->val = c - '0';\n\t\tfor (i = 0; i < N_DIGITS; i++)\n\t\t\tif (digits[i].val == ret->val && !digits[i].used) {\n\t\t\t\tdigits[i].used = 1;\n\t\t\t\treturn ret;\n\t\t\t}\n\t\tbail(\"Invalid digit\");\n\t}\n\treturn 0;\n}\n \nexpr get_fact()\n{\n\tint c;\n\texpr l = get_digit();\n\tif (l) return l;\n\tif ((c = next_tok()) == '(') {\n\t\ttake();\n\t\tl = get_expr();\n\t\tif (next_tok() != ')') bail(\"Unbalanced parens\");\n\t\ttake();\n\t\treturn l;\n\t}\n\treturn 0;\n}\n \nexpr parse()\n{\n\tint i;\n\texpr ret = get_expr();\n\tif (next_tok() != '\\0')\n\t\tbail(\"Trailing garbage\");\n\tfor (i = 0; i < N_DIGITS; i++)\n\t\tif (!digits[i].used)\n\t\t\tbail(\"Not all digits are used\");\n\treturn ret;\n}\n \ntypedef struct frac_t frac_t, *frac;\nstruct frac_t { int denom, num; };\n \nint gcd(int m, int n)\n{\n\tint t;\n\twhile (m) {\n\t\tt = m; m = n % m; n = t;\n\t}\n\treturn n;\n}\n \n/* evaluate expression tree.  result in fraction form */\nvoid eval_tree(expr e, frac res)\n{\n\tfrac_t l, r;\n\tint t;\n\tif (e->op == OP_NUM) {\n\t\tres->num = e->val;\n\t\tres->denom = 1;\n\t\treturn;\n\t}\n \n\teval_tree(e->left, &l);\n\teval_tree(e->right, &r);\n \n\tswitch(e->op) {\n\tcase OP_ADD:\n\t\tres->num = l.num * r.denom + l.denom * r.num;\n\t\tres->denom = l.denom * r.denom;\n\t\tbreak;\n\tcase OP_SUB:\n\t\tres->num = l.num * r.denom - l.denom * r.num;\n\t\tres->denom = l.denom * r.denom;\n\t\tbreak;\n\tcase OP_MUL:\n\t\tres->num = l.num * r.num;\n\t\tres->denom = l.denom * r.denom;\n\t\tbreak;\n\tcase OP_DIV:\n\t\tres->num = l.num * r.denom;\n\t\tres->denom = l.denom * r.num;\n\t\tbreak;\n\t}\n\tif ((t = gcd(res->denom, res->num))) {\n\t\tres->denom /= t;\n\t\tres->num /= t;\n\t}\n}\n \nvoid get_input()\n{\n\tint i;\nreinput:\n\treset();\n\tprintf(\"\\nAvailable digits are:\");\n\tfor (i = 0; i < N_DIGITS; i++) \n\t\tprintf(\" %d\", digits[i].val);\n\tprintf(\". Type an expression and I'll check it for you, or make new numbers.\\n\"\n\t\t\"Your choice? [Expr/n/q] \");\n \n\twhile (1) {\n\t\tfor (i = 0; i < MAX_INPUT; i++) str[i] = '\\n';\n\t\tfgets(str, MAX_INPUT, stdin);\n\t\tif (*str == '\\0') goto reinput;\n\t\tif (str[MAX_INPUT - 1] != '\\n')\n\t\t\tbail(\"string too long\");\n \n\t\tfor (i = 0; i < MAX_INPUT; i++)\n\t\t\tif (str[i] == '\\n') str[i] = '\\0';\n\t\tif (str[0] == 'q') {\n\t\t\tprintf(\"Bye\\n\");\n\t\t\texit(0);\n\t\t}\n\t\tif (str[0] == 'n') {\n\t\t\tgen_digits();\n\t\t\tgoto reinput;\n\t\t}\n\t\treturn;\n\t}\n}\n \nint main()\n{\n\tfrac_t f;\n\tsrand(time(0));\n \n\tgen_digits();\n\twhile(1) {\n\t\tget_input();\n\t\tsetjmp(ctx); /* if parse error, jump back here with err msg set */\n\t\tif (msg) {\n\t\t\t/* after error jump; announce, reset, redo */\n\t\t\tprintf(\"%s at '%.*s'\\n\", msg, pos, str);\n\t\t\tcontinue;\n\t\t}\n \n\t\teval_tree(parse(), &f);\n \n\t\tif (f.denom == 0) bail(\"Divide by zero\");\n\t\tif (f.denom == 1 && f.num == 24)\n\t\t\tprintf(\"You got 24.  Very good.\\n\");\n\t\telse {\n\t\t\tif (f.denom == 1)\n\t\t\t\tprintf(\"Eval to: %d, \", f.num);\n\t\t\telse\n\t\t\t\tprintf(\"Eval to: %d/%d, \", f.num, f.denom);\n\t\t\tprintf(\"no good.  Try again.\\n\");\n\t\t}\n\t}\n\treturn 0;\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_25.txt",
        "content": "Available digits are: 5 2 3 9. Type an expression and I'll check it for you, or make new numbers.\nYour choice? [Expr/n/q] 5*2*3/9\nEval to: 10/3, no good.  Try again.\n\nAvailable digits are: 5 2 3 9. Type an expression and I'll check it for you, or make new numbers.\nYour choice? [Expr/n/q] (5*(2+3)-9\nUnbalanced parens at '(5*(2+3)-9'\n\nAvailable digits are: 5 2 3 9. Type an expression and I'll check it for you, or make new numbers.\nYour choice? [Expr/n/q] 3*9-(5-2)\nYou got 24.  Very good.\n\nAvailable digits are: 5 2 3 9. Type an expression and I'll check it for you, or make new numbers.\nYour choice? [Expr/n/q] n\n\nAvailable digits are: 4 4 4 7. Type an expression and I'll check it for you, or make new numbers.\nYour choice? [Expr/n/q] q\nBye",
        "safe": true
    },
    {
        "filename": "24 game_26.txt",
        "content": "#include <random>\n#include <iostream>\n#include <stack>\n#include <set>\n#include <string>\n#include <functional>\nusing namespace std;\n\nclass RPNParse\n{\npublic:\n  stack<double> stk;\n  multiset<int> digits;\n\n  void op(function<double(double,double)> f)\n  {\n    if(stk.size() < 2)\n      throw \"Improperly written expression\";\n    int b = stk.top(); stk.pop();\n    int a = stk.top(); stk.pop();\n    stk.push(f(a, b));\n  }\n\n  void parse(char c)\n  {\n    if(c >= '0' && c <= '9')\n    {\n      stk.push(c - '0');\n      digits.insert(c - '0');\n    }\n    else if(c == '+')\n      op([](double a, double b) {return a+b;});\n    else if(c == '-')\n      op([](double a, double b) {return a-b;});\n    else if(c == '*')\n      op([](double a, double b) {return a*b;});\n    else if(c == '/')\n      op([](double a, double b) {return a/b;});\n  }\n\n  void parse(string s)\n  {\n    for(int i = 0; i < s.size(); ++i)\n      parse(s[i]);\n  }\n\n  double getResult()\n  {\n    if(stk.size() != 1)\n      throw \"Improperly written expression\";\n    return stk.top();\n  }\n};\n\nint main()\n{\n  random_device seed;\n  mt19937 engine(seed());\n  uniform_int_distribution<> distribution(1, 9);\n  auto rnd = bind(distribution, engine);\n\n  multiset<int> digits;\n  cout << \"Make 24 with the digits: \";\n  for(int i = 0; i < 4; ++i)\n  {\n    int n = rnd();\n    cout << \" \" << n;\n    digits.insert(n);\n  }\n  cout << endl;\n\n  RPNParse parser;\n\n  try\n  {\n    string input;\n    getline(cin, input);\n    parser.parse(input);\n\n    if(digits != parser.digits)\n      cout << \"Error: Not using the given digits\" << endl;\n    else\n    {\n      double r = parser.getResult();\n      cout << \"Result: \" << r << endl;\n\n      if(r > 23.999 && r < 24.001)\n        cout << \"Good job!\" << endl;\n      else\n        cout << \"Try again.\" << endl;\n    }\n  }\n  catch(char* e)\n  {\n    cout << \"Error: \" << e << endl;\n  }\n  return 0;\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_27.txt",
        "content": "Make 24 with the digits:  1 4 9 9\n9 9 + 4 * 1 +\nResult: 73\nTry again.\n\nMake 24 with the digits:  3 9 9 2\n9 9 + 3 2 * +\nResult: 24\nGood job!\n",
        "safe": true
    },
    {
        "filename": "24 game_28.txt",
        "content": "import ceylon.random {\n\tDefaultRandom\n}\n\nclass Rational(shared Integer numerator, shared Integer denominator = 1) satisfies Numeric<Rational> {\n\t\n\tassert (denominator != 0);\n\t\n\tInteger gcd(Integer a, Integer b) => if (b == 0) then a else gcd(b, a % b);\n\t\n\tshared Rational inverted => Rational(denominator, numerator);\n\t\n\tshared Rational simplified =>\n\t\tlet (largestFactor = gcd(numerator, denominator))\n\t\t\tRational(numerator / largestFactor, denominator / largestFactor);\n\t\n\tdivided(Rational other) => (this * other.inverted).simplified;\n\t\n\tnegated => Rational(-numerator, denominator).simplified;\n\t\n\tplus(Rational other) =>\n\t\t\tlet (top = numerator*other.denominator + other.numerator*denominator,\n\t\t\t\tbottom = denominator * other.denominator)\n\t\t\tRational(top, bottom).simplified;\n\t\n\ttimes(Rational other) =>\n\t\tRational(numerator * other.numerator, denominator * other.denominator).simplified;\n\t\n\tshared Integer integer => numerator / denominator;\n\tshared Float float => numerator.float / denominator.float;\n\t\n\tstring => denominator == 1 then numerator.string else \"``numerator``/``denominator``\";\n\t\n\tshared actual Boolean equals(Object that) {\n\t\tif (is Rational that) {\n\t\t\tvalue simplifiedThis = this.simplified;\n\t\t\tvalue simplifiedThat = that.simplified;\n\t\t\treturn simplifiedThis.numerator==simplifiedThat.numerator && \n\t\t\t\t\tsimplifiedThis.denominator==simplifiedThat.denominator;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\ninterface Expression {\n\tshared formal Rational evaluate();\n}\n\nclass NumberExpression(Rational number) satisfies Expression {\n\tevaluate() => number;\n\tstring => number.string;\n}\n\nclass OperatorExpression(Expression left, Character operator, Expression right) satisfies Expression {\n\tshared actual Rational evaluate() {\n\t\tswitch (operator)\n\t\tcase ('*') {\n\t\t\treturn left.evaluate() * right.evaluate();\n\t\t}\n\t\tcase ('/') {\n\t\t\treturn left.evaluate() / right.evaluate();\n\t\t}\n\t\tcase ('-') {\n\t\t\treturn left.evaluate() - right.evaluate();\n\t\t}\n\t\tcase ('+') {\n\t\t\treturn left.evaluate() + right.evaluate();\n\t\t}\n\t\telse {\n\t\t\tthrow Exception(\"unknown operator ``operator``\");\n\t\t}\n\t}\n\t\n\tstring => \"(``left.string`` ``operator.string`` ``right.string``)\";\n}\n\n\"A simplified top down operator precedence parser. There aren't any right\n binding operators so we don't have to worry about that.\"\nclass PrattParser(String input) {\n\t\n\tvalue tokens = input.replace(\" \", \"\");\n\tvariable value index = -1;\n\t\n\tshared Expression expression(Integer precedence = 0) {\n\t\tvalue token = advance();\n\t\tvariable value left = parseUnary(token);\n\t\twhile (precedence < getPrecedence(peek())) {\n\t\t\tvalue nextToken = advance();\n\t\t\tleft = parseBinary(left, nextToken);\n\t\t}\n\t\treturn left;\n\t}\n\t\n\tInteger getPrecedence(Character op) =>\n\t\tswitch (op)\n\t\t\tcase ('*' | '/') 2\n\t\t\tcase ('+' | '-') 1\n\t\t\telse 0;\n\t\n\tCharacter advance(Character? expected = null) {\n\t\tindex++;\n\t\tvalue token = tokens[index] else ' ';\n\t\tif (exists expected, token != expected) {\n\t\t\tthrow Exception(\"unknown character ``token``\");\n\t\t}\n\t\treturn token;\n\t}\n\t\n\tCharacter peek() => tokens[index + 1] else ' ';\n\t\n\tExpression parseBinary(Expression left, Character operator) =>\n\t\tlet (right = expression(getPrecedence(operator)))\n\t\t\tOperatorExpression(left, operator, right);\n\t\n\tExpression parseUnary(Character token) {\n\t\tif (token.digit) {\n\t\t\tassert (is Integer int = Integer.parse(token.string));\n\t\t\treturn NumberExpression(Rational(int));\n\t\t} \n\t\telse if (token == '(') {\n\t\t\tvalue exp = expression();\n\t\t\tadvance(')');\n\t\t\treturn exp;\n\t\t} \n\t\telse {\n\t\t\tthrow Exception(\"unknown character ``token``\");\n\t\t}\n\t}\n}\n\nshared void run() {\n\t\n\tvalue random = DefaultRandom();\n\t\n\tfunction random4Numbers() =>\n\t\trandom.elements(1..9).take(4).sequence();\n\t\n\tfunction isValidGuess(String input, {Integer*} allowedNumbers) {\n\t\tvalue allowedOperators = set { *\"()+-/*\" };\n\t\tvalue extractedNumbers = input\n\t\t\t.split((Character ch) => ch in allowedOperators || ch.whitespace)\n\t\t\t.map((String element) => Integer.parse(element))\n\t\t\t.narrow<Integer>();\n\t\tif (extractedNumbers.any((Integer element) => element > 9)) {\n\t\t\tprint(\"number too big!\");\n\t\t\treturn false;\n\t\t}\n\t\tif (extractedNumbers.any((Integer element) => element < 1)) {\n\t\t\tprint(\"number too small!\");\n\t\t\treturn false;\n\t\t}\n\t\tif (extractedNumbers.sort(increasing) != allowedNumbers.sort(increasing)) {\n\t\t\tprint(\"use all the numbers, please!\");\n\t\t\treturn false;\n\t\t}\n\t\tif (!input.every((Character element) => element in allowedOperators || element.digit || element.whitespace)) {\n\t\t\tprint(\"only digits and mathematical operators, please\");\n\t\t\treturn false;\n\t\t}\n\t\tvariable value leftParens = 0;\n\t\tfor (c in input) {\n\t\t\tif (c == '(') {\n\t\t\t\tleftParens++;\n\t\t\t} else if (c == ')') {\n\t\t\t\tleftParens--;\n\t\t\t\tif (leftParens < 0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (leftParens != 0) {\n\t\t\tprint(\"unbalanced brackets!\");\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tfunction evaluate(String input) =>\n\t\tlet (parser = PrattParser(input),\n\t\t\texp = parser.expression())\n\t\t\texp.evaluate();\n\t\n\tprint(\"Welcome to The 24 Game.\n\t          Create a mathematical equation with four random\n\t          numbers that evaluates to 24.\n\t          You must use all the numbers once and only once,\n\t          but in any order.\n\t          Also, only + - / * and parentheses are allowed.\n\t          For example: (1 + 2 + 3) * 4\n\t          Also: enter n for new numbers and q to quit.\n\t          -----------------------------------------------\");\n\t\n\tvalue twentyfour = Rational(24);\n\t\n\twhile (true) {\n\t\t\n\t\tvalue chosenNumbers = random4Numbers();\n\t\tvoid pleaseTryAgain() => print(\"Sorry, please try again. (Your numbers are ``chosenNumbers``)\");\n\t\t\n\t\tprint(\"Your numbers are ``chosenNumbers``. Please turn them into 24.\");\n\t\t\n\t\twhile (true) {\n\t\t\tvalue line = process.readLine()?.trimmed;\n\t\t\tif (exists line) {\n\t\t\t\tif (line.uppercased == \"Q\") { // quit\n\t\t\t\t\tprint(\"bye!\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (line.uppercased == \"N\") { // new game\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (isValidGuess(line, chosenNumbers)) {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tvalue result = evaluate(line);\n\t\t\t\t\t\tprint(\"= ``result``\");\n\t\t\t\t\t\tif (result == twentyfour) {\n\t\t\t\t\t\t\tprint(\"You did it!\");\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t} \n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tpleaseTryAgain();\n\t\t\t\t\t\t}\n\t\t\t\t\t} \n\t\t\t\t\tcatch (Exception e) {\n\t\t\t\t\t\tprint(e.message);\n\t\t\t\t\t\tpleaseTryAgain();\n\t\t\t\t\t}\n\t\t\t\t} \n\t\t\t\telse {\n\t\t\t\t\tpleaseTryAgain();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_29.txt",
        "content": "(ns rosettacode.24game)\n\n(def ^:dynamic *luser*\n\"You guessed wrong, or your input was not in prefix notation.\")\n\n(def ^:private start #(println \n\"Your numbers are: \" %1 \". Your goal is \" %2 \".\\n\"\n\"Use the ops [+ - * /] in prefix notation to reach\" %2 \".\\n\"\n\"q[enter] to quit.\"))\n\n(defn play\n  ([] (play 24))\n  ([goal] (play goal (repeatedly 4 #(inc (rand-int 9)))))\n  ([goal gns]\n     (start gns goal)\n     (let [input (read-string (read-line))\n           flat  (flatten input)]\n      (println\n        (if (and (re-find #\"^\\([\\d\\s+*/-]+\\d?\\)$\" (pr-str flat))\n                 (= (set gns) (set (filter integer? flat)))\n                 (= goal (eval input)))\n         \"You won the game!\"\n         *luser*))\n      (when (not= input 'q) (recur goal gns)))))\n\n; * checks prefix form, then checks to see that the numbers used\n; and the numbers generated by the game are the same.\n",
        "safe": true
    },
    {
        "filename": "24 game_3.txt",
        "content": "/* ARM assembly AARCH64 Raspberry PI 3B */\n/*  program game24_64.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 NBDIGITS,   4       // digits number\n.equ TOTAL,      24\n.equ BUFFERSIZE, 100\n.equ STACKSIZE,  10      // operator and digits number items in stacks\n\n\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nszMessRules:         .ascii \"24 Game  64 bits.\\n\"\n                    .ascii \"The program will display four randomly-generated \\n\"\n                    .ascii \"single-digit numbers and will then prompt you to enter\\n\"\n                    .ascii \"an arithmetic expression followed by <enter> to sum \\n\"\n                    .ascii \"the given numbers to 24.\\n\"\n                    .asciz \"Exemple\u00a0: 9+8+3+4   or (7+5)+(3*4) \\n\\n\"\n\nszMessExpr:         .asciz \"Enter your expression (or type (q)uit to exit or (n) for other digits): \\n\"\nszMessDigits:       .asciz \"The four digits are @ @ @ @ and the score is 24. \\n\"\nszMessNoDigit:      .asciz \"Error\u00a0: One digit is not in digits list\u00a0!! \\n\"\nszMessSameDigit:    .asciz \"Error\u00a0: Two digits are same\u00a0!! \\n\"\nszMessOK:           .asciz \"It is OK. \\n\"\nszMessNotOK:        .asciz \"Error, it is not ok  total = @ \\n\"\nszMessErrOper:      .asciz \"Unknow Operator (+,-,$,/,(,)) \\n\"\nszMessNoparen:      .asciz \"no opening parenthesis\u00a0!! \\n\"\nszMessErrParen:     .asciz \"Error parenthesis number\u00a0!! \\n\"\nszMessNoalldigits:  .asciz \"One or more digits not used\u00a0!!\\n\"\nszMessNewGame:      .asciz \"New game (y/n)\u00a0? \\n\"\nszCarriageReturn:   .asciz \"\\n\"\n.align 4\nqGraine:  .quad 123456\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\nsZoneConv:        .skip 24\nsBuffer:          .skip BUFFERSIZE\niTabDigit:        .skip 8 * NBDIGITS\niTabTopDigit:     .skip 8 * NBDIGITS\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                 // entry of program \n    \n    ldr x0,qAdrszMessRules            // display rules\n    bl affichageMess\n1:\n    mov x3,#0\n    ldr x12,qAdriTabDigit\n    ldr x11,qAdriTabTopDigit\n    ldr x5,qAdrszMessDigits\n2:                                    // loop generate random digits \n    mov x0,#8\n    bl genereraleas \n    add x0,x0,#1\n    str x0,[x12,x3,lsl #3]            // store in table\n    mov x1,#0\n    str x1,[x11,x3,lsl #3]            // raz top table\n    ldr x1,qAdrsZoneConv\n    bl conversion10                   // call decimal conversion\n    //mov x2,#0\n    //strb w2,[x1,x0]                   // reduce size display area with z\u00e9ro final\n    mov x0,x5\n    ldr x1,qAdrsZoneConv              // insert conversion in message\n    bl strInsertAtCharInc\n    mov x5,x0\n    add x3,x3,#1\n    cmp x3,#NBDIGITS                  // end\u00a0?\n    blt 2b                            // no -> loop\n    mov x0,x5\n    bl affichageMess\n3:                                    // loop human entry\n    ldr x0,qAdrszMessExpr\n    bl affichageMess\n    bl saisie                         // entry\n    cmp x0,#'q'\n    beq 100f\n    cmp x0,#'Q'\n    beq 100f\n    cmp x0,#'n'\n    beq 1b\n    cmp x0,#'N'\n    beq 1b\n \n    bl evalExpr                      // expression evaluation\n    cmp x0,#0                        // ok\u00a0?\n    bne 3b                           // no - > loop\n\n10:                                  // display new game\u00a0?\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess\n    ldr x0,qAdrszMessNewGame\n    bl affichageMess\n    bl saisie\n    cmp x0,#'y'\n    beq 1b\n    cmp x0,#'Y'\n    beq 1b\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 \nqAdrszCarriageReturn:     .quad szCarriageReturn\nqAdrszMessRules:          .quad szMessRules\nqAdrszMessDigits:         .quad szMessDigits\nqAdrszMessExpr:           .quad szMessExpr\nqAdrszMessNewGame:        .quad szMessNewGame\nqAdrsZoneConv:            .quad sZoneConv\nqAdriTabDigit:            .quad iTabDigit\nqAdriTabTopDigit:         .quad iTabTopDigit\n/******************************************************************/\n/*            evaluation expression                                       */ \n/******************************************************************/\n/* x0 return 0 if ok -1 else */\nevalExpr:\n    stp x1,lr,[sp,-16]!        // save  registres\n    stp x2,x3,[sp,-16]!        // save  registres\n    stp x4,x5,[sp,-16]!        // save  registres\n    stp x6,x7,[sp,-16]!        // save  registres\n    stp x8,x9,[sp,-16]!        // save  registres\n    stp x10,fp,[sp,-16]!       // save  registres\n    mov x0,#0\n    ldr x1,qAdriTabTopDigit\n    mov x2,#0\n1:                             // loop init table top digits\n    str x0,[x1,x2,lsl #3]\n    add x2,x2,#1\n    cmp x2,#NBDIGITS\n    blt 1b\n    \n    sub sp,sp,#STACKSIZE * 8   // stack operator\n    mov fp,sp\n    sub sp,sp,#STACKSIZE * 8   // stack digit\n    mov x1,sp\n    ldr x10,qAdrsBuffer\n    mov x8,#0                  // indice character in buffer\n    mov x7,#0                  // indice digits stack\n    mov x2,#0                  // indice operator stack\n    mov x9,0\n1:                             // begin loop\n    ldrb w9,[x10,x8]\n    cmp x9,#0xA               // end expression\u00a0?\n    beq 90f\n    cmp x9,#' '               // space \u00a0?\n    cinc x8,x8,eq             // loop\n    beq 1b\n    cmp x9,#'('               // left parenthesis -> store in operator stack\n    bne 11f\n    str x9,[fp,x2,lsl 3]\n    add x2,x2,#1\n    add x8,x8,#1             // and loop\n    b 1b\n11:\n    cmp x9,#')'               // right parenthesis\u00a0?\n    bne 3f\n    mov x0,fp                  // compute operator stack until left parenthesis\n    sub x2,x2,#1\n2:\n    ldr x6,[fp,x2,lsl 3]\n    cmp x6,#'('                // left parenthesis\n    cinc x8,x8,eq              //  end\u00a0?\n    beq 1b                     // and loop\n    sub x7,x7,#1               // last digit\n    mov x3,x7\n    bl compute\n    sub x2,x2,#1\n    cmp x2,#0\n    bge 2b\n    ldr x0,qAdrszMessNoparen   // no left parenthesis in stack\n    bl affichageMess\n    mov x0,#-1\n    b 100f\n3:\n    cmp x9,#'+'               // addition\n    beq 4f\n    cmp x9,#'-'               // soustraction\n    beq 4f\n    cmp x9,#'*'               // multiplication\n    beq 4f\n    cmp x9,#'/'               // division\n    beq 4f\n\n    b 5f                       // not operator\n\n4:                             // control priority and depile stacks\n    mov x0,fp\n    mov x3,x7\n    mov x4,x9\n    bl depileOper\n    mov x7,x3\n    add x8,x8,#1\n    b 1b                       // and loop \n \n5:                             //  digit\n    sub x9,x9,#0x30\n    mov x0,x9\n    bl digitControl\n    cmp x0,#0                  // error\u00a0?\n    bne 100f\n    str x9,[x1,x7,lsl #3]     // store digit in digits stack\n    add x7,x7,#1\n\n    add x8,x8,#1\n    beq 1b    \n\n    b 100f\n90:                            // compute all stack operators\n    mov x0,fp\n    sub x7,x7,#1\n91:\n    subs x2,x2,#1\n    blt 92f\n    mov x3,x7\n    bl compute\n    sub x7,x7,#1\n    b 91b\n92: \n    ldr x0,[x1]                 // total = first value on digits stack\n    cmp x0,#TOTAL               // control total \n    beq 93f                     // ok \n    ldr x1,qAdrsZoneConv\n    bl conversion10             // call decimal conversion\n    mov x2,#0\n    strb w2,[x1,x0]\n    ldr x0,qAdrszMessNotOK\n    ldr x1,qAdrsZoneConv        // insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n    mov x0,#-1\n    b 100f\n93:                             // control use all digits\n    ldr x1,qAdriTabTopDigit\n    mov x2,#0\n94:                             // begin loop\n    ldr x0,[x1,x2,lsl #3]       // load top\n    cmp x0,#0            \n    bne 95f\n    ldr x0,qAdrszMessNoalldigits\n    bl affichageMess\n    mov x0,#-1\n    b 100f\n95:\n    add x2,x2,#1\n    cmp x2,#NBDIGITS\n    blt 94b\n96:                             // display message OK\n    ldr x0,qAdrszMessOK\n    bl affichageMess\n    mov x0,#0\n    b 100f\n    \n100:\n    add sp,sp,8 * (STACKSIZE *2)    // stack algnement\n    ldp x10,fp,[sp],16          // restaur des  2 registres\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\nqAdrszMessNoparen:        .quad szMessNoparen\nqAdrszMessNotOK:          .quad szMessNotOK\nqAdrszMessOK:             .quad szMessOK\nqAdrszMessNoalldigits:    .quad szMessNoalldigits\n/******************************************************************/\n/*            depile operator                                     */ \n/******************************************************************/\n/* x0 operator stack address  */\n/* x1 digits stack address */\n/* x2 operator indice */\n/* x3 digits indice */\n/* x4 operator */\n/* x2 return a new operator indice */\n/* x3 return a new digits indice */\ndepileOper:\n    stp x4,lr,[sp,-16]!    // save  registres\n    stp x5,x6,[sp,-16]!    // save  registres\n    stp x7,x8,[sp,-16]!    // save  registres\n    cmp x2,#0              // first operator\u00a0?\n    beq 60f\n    sub x5,x2,#1\n1:\n    ldr x6,[x0,x5,lsl #3]  // load stack operator\n    cmp x6,x4              // same operators\n    beq 50f\n    cmp x6,#'*'            // multiplication\n    beq 50f\n    cmp x6,#'/'            // division\n    beq 50f\n    cmp x6,#'-'            // soustraction\n    beq 50f\n    \n    b 60f\n50:                        // depile operators stack and compute\n    sub x2,x2,#1\n    sub x3,x3,#1\n    bl compute\n    sub x5,x5,#1\n    cmp x5,#0\n    bge 1b\n60:\n    str x4,[x0,x2,lsl #3]  // add operator in stack\n    add x2,x2,#1\n    \n100:\n    ldp x7,x8,[sp],16           // restaur des  2 registres\n    ldp x5,x6,[sp],16           // restaur des  2 registres\n    ldp x4,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*            compute                                             */ \n/******************************************************************/\n/* x0 operator stack address  */\n/* x1 digits stack address */\n/* x2 operator indice */\n/* x3 digits indice */\ncompute:\n    stp x1,lr,[sp,-16]!   // save  registres\n    stp x2,x3,[sp,-16]!   // save  registres\n    stp x4,x5,[sp,-16]!   // save  registres\n    stp x6,x7,[sp,-16]!   // save  registres\n    stp x8,x9,[sp,-16]!   // save  registres\n    ldr x6,[x1,x3,lsl 3]  // load second digit\n    sub x5,x3,#1\n    ldr x7,[x1,x5,lsl 3]  // load first digit\n    \n    ldr x8,[x0,x2,lsl 3]  // load operator\n    cmp x8,#'+'\n    bne 1f\n    add x7,x7,x6           // addition\n    str x7,[x1,x5,lsl 3] \n    b 100f\n1:     \n    cmp x8,#'-'\n    bne 2f\n    sub x7,x7,x6           // soustaction\n    str x7,[x1,x5,lsl 3] \n    b 100f\n2:\n    cmp x8,#'*'\n    bne 3f                 // multiplication\n    mul x7,x6,x7\n    str x7,[x1,x5,lsl 3] \n    b 100f\n3:\n    cmp x8,#'/'\n    bne 4f\n    udiv x7,x7,x6          // division\n    str x7,[x1,x5,lsl 3]\n    b 100f\n4:\n    cmp x8,#'('            // left parenthesis\u00a0?\n    bne 5f\n    ldr x0,qAdrszMessErrParen //  error \n    bl affichageMess\n    mov x0,#-1\n    b 100f\n5:\n    ldr x0,qAdrszMessErrOper\n    bl affichageMess\n    mov x0,#-1\n100:\n    ldp x8,x9,[sp],16     // restaur des  2 registres\n    ldp x6,x7,[sp],16     // restaur des  2 registres\n    ldp x4,x5,[sp],16     // restaur des  2 registres\n    ldp x2,x3,[sp],16     // restaur des  2 registres\n    ldp x1,lr,[sp],16     // restaur des  2 registres\n    ret\nqAdrszMessErrOper:   .quad szMessErrOper\nqAdrszMessErrParen:  .quad szMessErrParen\n/******************************************************************/\n/*            control digits                                       */ \n/******************************************************************/\n/* x0 return 0 if OK 1 if  not digit   */\ndigitControl:\n    stp x1,lr,[sp,-16]!   // save  registres\n    stp x2,x3,[sp,-16]!   // save  registres\n    stp x4,x5,[sp,-16]!   // save  registres\n    ldr x1,qAdriTabTopDigit\n    ldr x2,qAdriTabDigit\n    mov x3,#0\n1:\n    ldr x4,[x2,x3,lsl #3]  // load digit\n    cmp x0,x4              // equal\u00a0?\n    beq 2f                 // yes\n    add x3,x3,#1           // no -> loop\n    cmp x3,#NBDIGITS       // end\u00a0?\n    blt 1b\n    ldr x0,qAdrszMessNoDigit // error\n    bl affichageMess\n    mov x0,#1\n    b 100f\n2:                         // control prev use \n    ldr x4,[x1,x3,lsl #3]\n    cmp x4,#0\n    beq 3f\n    add x3,x3,#1\n    cmp x3,#NBDIGITS\n    blt 1b\n    ldr x0,qAdrszMessSameDigit\n    bl affichageMess\n    mov x0,#1\n    b 100f\n3:\n    mov x4,#1\n    str x4,[x1,x3,lsl #3]\n    mov x0,#0\n100:\n    ldp x4,x5,[sp],16     // restaur des  2 registres\n    ldp x2,x3,[sp],16     // restaur des  2 registres\n    ldp x1,lr,[sp],16     // restaur des  2 registres\n    ret\nqAdrszMessNoDigit:     .quad szMessNoDigit\nqAdrszMessSameDigit:   .quad szMessSameDigit\n/******************************************************************/\n/*            string entry                                       */ \n/******************************************************************/\n/* x0 return the first character of human entry */\nsaisie:\n    stp x1,lr,[sp,-16]!   // save  registres\n    stp x2,x3,[sp,-16]!   // save  registres\n    stp x4,x5,[sp,-16]!   // save  registres\n    stp x6,x7,[sp,-16]!   // save  registres\n    mov x0,STDIN          // Linux input console\n    ldr x1,qAdrsBuffer    // buffer address \n    mov x2,BUFFERSIZE     // buffer size \n    mov x8,READ           // request to read datas\n    svc 0                 // call system\n    ldr x1,qAdrsBuffer    // buffer address \n    ldrb w0,[x1]          // load first character\n100:\n    ldp x6,x7,[sp],16     // restaur des  2 registres\n    ldp x4,x5,[sp],16     // restaur des  2 registres\n    ldp x2,x3,[sp],16     // restaur des  2 registres\n    ldp x1,lr,[sp],16     // restaur des  2 registres\n    ret\nqAdrsBuffer:         .quad sBuffer\n/***************************************************/\n/*   Generation random number                  */\n/***************************************************/\n/* x0 contains limit  */\ngenereraleas:\n    stp x1,lr,[sp,-16]!   // save  registres\n    stp x2,x3,[sp,-16]!   // save  registres\n    stp x4,x5,[sp,-16]!   // save  registres\n    ldr x4,qAdrqGraine\n    ldr x2,[x4]\n    ldr x3,qNbDep1\n    mul x2,x3,x2\n    ldr x3,qNbDep2\n    add x2,x2,x3\n    str x2,[x4]           // maj de la graine pour l appel suivant \n    cmp x0,#0\n    beq 100f\n    add x0,x0,#1\n    udiv x3,x2,x0\n    msub x0,x3,x0,x2      // r\u00e9sult = remainder\n    \n    ldp x4,x5,[sp],16     // restaur des  2 registres\n    ldp x2,x3,[sp],16     // restaur des  2 registres\n    ldp x1,lr,[sp],16     // restaur des  2 registres\n    ret\n\n/*****************************************************/\nqAdrqGraine: .quad qGraine\nqNbDep1:     .quad 0x0019660d\nqNbDep2:     .quad 0x3c6ef35f\n/********************************************************/\n/*        File Include fonctions                        */\n/********************************************************/\n/* for this file see task include a file in language AArch64 assembly */\n.include \"../includeARM64.inc\"",
        "safe": true
    },
    {
        "filename": "24 game_30.txt",
        "content": "        >>SOURCE FORMAT FREE\n*> This code is dedicated to the public domain\n*> This is GNUCobol 2.0\nidentification division.\nprogram-id. twentyfour.\nenvironment division.\nconfiguration section.\nrepository. function all intrinsic.\ndata division.\nworking-storage section.\n01  p pic 999.\n01  p1 pic 999.\n01  p-max pic 999 value 38.\n01  program-syntax pic x(494) value\n*>statement = expression;\n        '001 001 000 n'\n    &   '002 000 004 ='\n    &   '003 005 000 n'\n    &   '004 000 002\u00a0;'\n*>expression = term, {('+'|'-') term,};\n    &   '005 005 000 n'\n    &   '006 000 016 ='\n    &   '007 017 000 n'\n    &   '008 000 015 {'\n    &   '009 011 013 ('\n    &   '010 001 000 t'\n    &   '011 013 000 |'\n    &   '012 002 000 t'\n    &   '013 000 009 )'\n    &   '014 017 000 n'\n    &   '015 000 008 }'\n    &   '016 000 006\u00a0;'\n*>term = factor, {('*'|'/') factor,};\n    &   '017 017 000 n'\n    &   '018 000 028 ='\n    &   '019 029 000 n'\n    &   '020 000 027 {'\n    &   '021 023 025 ('\n    &   '022 003 000 t'\n    &   '023 025 000 |'\n    &   '024 004 000 t'\n    &   '025 000 021 )'\n    &   '026 029 000 n'\n    &   '027 000 020 }'\n    &   '028 000 018\u00a0;'\n*>factor = ('(' expression, ')' | digit,);\n    &   '029 029 000 n'\n    &   '030 000 038 ='\n    &   '031 035 037 ('\n    &   '032 005 000 t'\n    &   '033 005 000 n'\n    &   '034 006 000 t'\n    &   '035 037 000 |'\n    &   '036 000 000 n'\n    &   '037 000 031 )'\n    &   '038 000 030\u00a0;'.\n01  filler redefines program-syntax.\n    03  p-entry occurs 038.\n        05  p-address pic 999.\n        05  filler pic x.\n        05  p-definition pic 999.\n        05  p-alternate redefines p-definition pic 999.\n        05  filler pic x.\n        05  p-matching pic 999.\n        05  filler pic x.\n        05  p-symbol pic x.\n\n01  t pic 999.\n01  t-len pic 99 value 6.\n01  terminal-symbols\n    pic x(210) value\n        '01 +                               '                                                               \n    &   '01 -                               '                                                               \n    &   '01 *                               '\n    &   '01 /                               '\n    &   '01 (                               '\n    &   '01 )                               '.\n01  filler redefines terminal-symbols.\n    03  terminal-symbol-entry occurs 6.\n        05  terminal-symbol-len pic 99.\n        05  filler pic x.\n        05  terminal-symbol pic x(32).\n\n01  nt pic 999.\n01  nt-lim pic 99 value 5.\n01  nonterminal-statements pic x(294) value\n        \"000 ....,....,....,....,....,....,....,....,....,\"\n    &   \"001 statement = expression;                      \"                                                       \n    &   \"005 expression = term, {('+'|'-') term,};        \"                                                      \n    &   \"017 term = factor, {('*'|'/') factor,};          \"                                                             \n    &   \"029 factor = ('(' expression, ')' | digit,);     \"                                                           \n    &   \"036 digit;                                       \".                                                            \n01  filler redefines nonterminal-statements.\n    03  nonterminal-statement-entry occurs 5.\n        05  nonterminal-statement-number pic 999.\n        05  filler pic x.\n        05  nonterminal-statement pic x(45).\n\n01  indent pic x(64) value all '|  '. \n01  interpreter-stack.\n    03  r pic 99. *> previous top of stack\n    03  s pic 99. *> current top of stack\n    03  s-max pic 99 value 32.\n    03  s-entry occurs 32.\n        05  filler pic x(2) value 'p='.\n        05  s-p pic 999. *> callers return address\n        05  filler pic x(4) value ' sc='.\n        05  s-start-control pic 999. *> sequence start address\n        05  filler pic x(4) value ' ec='.\n        05  s-end-control pic 999. *> sequence end address\n        05  filler pic x(4) value ' al='.\n        05  s-alternate pic 999. *> the next alternate \n        05  filler pic x(3) value ' r='.\n        05  s-result pic x. *> S success, F failure, N no result\n        05  filler pic x(3) value ' c='.\n        05  s-count pic 99. *> successes in a sequence\n        05  filler pic x(3) value ' x='.\n        05  s-repeat pic 99. *> repeats in a {} sequence\n        05  filler pic x(4) value ' nt='.\n        05  s-nt pic 99. *> current nonterminal\n\n01  language-area.\n    03  l pic 99.\n    03  l-lim pic 99.\n    03  l-len pic 99 value 1.\n    03  nd pic 9.\n    03  number-definitions.\n        05  n occurs 4 pic 9.\n    03  nu pic 9.\n    03  number-use.\n        05  u occurs 4 pic x.\n    03  statement.\n        05  c occurs 32.\n            07  c9 pic 9.\n\n01  number-validation.\n    03  p4 pic 99.\n    03  p4-lim pic 99 value 24.\n    03  permutations-4 pic x(96) value\n          '1234'\n        & '1243'\n        & '1324'\n        & '1342'\n        & '1423'\n        & '1432'\n        & '2134'\n        & '2143'\n        & '2314'\n        & '2341'\n        & '2413'\n        & '2431'\n        & '3124'\n        & '3142'\n        & '3214'\n        & '3241'\n        & '3423'\n        & '3432'\n        & '4123'\n        & '4132'\n        & '4213'\n        & '4231'\n        & '4312'\n        & '4321'.\n     03  filler redefines permutations-4.\n         05  permutation-4 occurs 24 pic x(4).\n     03  current-permutation-4 pic x(4).\n     03  cpx pic 9.\n     03  od1 pic 9.\n     03  od2 pic 9.\n     03  odx pic 9.\n     03  od-lim pic 9 value 4.\n     03  operator-definitions pic x(4) value '+-*/'.\n     03  current-operators pic x(3).\n     03  co3 pic 9.\n     03  rpx pic 9.\n     03  rpx-lim pic 9 value 4.\n     03  valid-rpn-forms pic x(28) value\n          'nnonono'\n        & 'nnnonoo'\n        & 'nnnoono'\n        & 'nnnnooo'.\n    03  filler redefines valid-rpn-forms.\n        05  rpn-form occurs 4 pic x(7).\n    03  current-rpn-form pic x(7).\n\n01  calculation-area.\n    03  osx pic 99.\n    03  operator-stack pic x(32).\n    03  oqx pic 99.\n    03  oqx1 pic 99.\n    03  output-queue pic x(32).\n    03  work-number pic s9999.\n    03  top-numerator pic s9999 sign leading separate.\n    03  top-denominator pic s9999 sign leading separate.\n    03  rsx pic 9.\n    03  result-stack occurs 8.\n        05  numerator pic s9999.\n        05  denominator pic s9999.\n\n01  error-found pic x.\n01  divide-by-zero-error pic x.\n\n*>  diagnostics\n01  NL pic x value x'0A'.\n01  NL-flag pic x value space.\n01  display-level pic x value '0'.\n01  loop-lim pic 9999 value 1500.\n01  loop-count pic 9999 value 0.\n01  message-area value spaces.\n    03  message-level pic x.\n    03  message-value pic x(128).\n\n*>  input and examples\n01  instruction pic x(32) value spaces.\n01  tsx pic 99.\n01  tsx-lim pic 99 value 14.\n01  test-statements.\n    03  filler pic x(32) value '1234;1 + 2 + 3 + 4'.\n    03  filler pic x(32) value '1234;1 * 2 * 3 * 4'. \n    03  filler pic x(32) value '1234;((1)) * (((2 * 3))) * 4'. \n    03  filler pic x(32) value '1234;((1)) * ((2 * 3))) * 4'. \n    03  filler pic x(32) value '1234;(1 + 2 + 3 + 4'. \n    03  filler pic x(32) value '1234;)1 + 2 + 3 + 4'. \n    03  filler pic x(32) value '1234;1 * * 2 * 3 * 4'. \n    03  filler pic x(32) value '5679;6 - (5 - 7) * 9'. \n    03  filler pic x(32) value '1268;((1 * (8 * 6) / 2))'. \n    03  filler pic x(32) value '4583;-5-3+(8*4)'. \n    03  filler pic x(32) value '4583;8 * 4 - 5 - 3'. \n    03  filler pic x(32) value '4583;8 * 4 - (5 + 3)'. \n    03  filler pic x(32) value '1223;1 * 3 / (2 - 2)'. \n    03  filler pic x(32) value '2468;(6 * 8) / 4 / 2'. \n01  filler redefines test-statements.\n    03  filler occurs 14.\n        05  test-numbers pic x(4).\n        05  filler pic x.\n        05  test-statement pic x(27).\n\nprocedure division.\nstart-twentyfour.\n    display 'start twentyfour'\n    perform generate-numbers\n    display 'type h <enter> to see instructions'\n    accept instruction\n    perform until instruction = spaces or 'q'\n        evaluate true\n        when instruction = 'h'\n            perform display-instructions\n        when instruction = 'n'\n            perform generate-numbers\n        when instruction(1:1) = 'm'\n            move instruction(2:4) to number-definitions\n            perform validate-number\n            if divide-by-zero-error = space\n            and 24 * top-denominator = top-numerator\n                display number-definitions ' is solved by ' output-queue(1:oqx)\n            else\n                display number-definitions ' is not solvable'\n            end-if\n        when instruction = 'd0' or 'd1' or 'd2' or 'd3'\n            move instruction(2:1) to display-level\n        when instruction = 'e'\n            display 'examples:'\n            perform varying tsx from 1 by 1\n            until tsx > tsx-lim\n                move spaces to statement\n                move test-numbers(tsx) to number-definitions\n                move test-statement(tsx) to statement\n                perform evaluate-statement\n                perform show-result\n            end-perform\n        when other\n            move instruction to statement\n            perform evaluate-statement\n            perform show-result\n        end-evaluate\n        move spaces to instruction\n        display 'instruction? ' with no advancing\n        accept instruction\n    end-perform\n\n    display 'exit twentyfour'\n    stop run\n    .\ngenerate-numbers.\n    perform with test after until divide-by-zero-error = space\n    and 24 * top-denominator = top-numerator\n        compute n(1) = random(seconds-past-midnight) * 10 *> seed\n        perform varying nd from 1 by 1 until nd > 4\n            compute n(nd) = random() * 10\n            perform until n(nd) <> 0\n                compute n(nd) = random() * 10\n            end-perform\n        end-perform\n        perform validate-number\n    end-perform\n    display NL 'numbers:' with no advancing\n    perform varying nd from 1 by 1 until nd > 4\n        display space n(nd) with no advancing\n    end-perform\n    display space\n    .\nvalidate-number.\n    perform varying p4 from 1 by 1 until p4 > p4-lim\n        move permutation-4(p4) to current-permutation-4 \n        perform varying od1 from 1 by 1 until od1 > od-lim\n            move operator-definitions(od1:1) to current-operators(1:1)\n            perform varying od2 from 1 by 1 until od2 > od-lim\n                move operator-definitions(od2:1) to current-operators(2:1)\n                perform varying odx from 1 by 1 until odx > od-lim\n                    move operator-definitions(odx:1) to current-operators(3:1)\n                    perform varying rpx from 1 by 1 until rpx > rpx-lim\n                        move rpn-form(rpx) to current-rpn-form\n                        move 0 to cpx co3\n                        move spaces to output-queue\n                        move 7 to oqx\n                        perform varying oqx1 from 1 by 1 until oqx1 > oqx\n                            if current-rpn-form(oqx1:1) = 'n'\n                                add 1 to cpx\n                                move current-permutation-4(cpx:1) to nd\n                                move n(nd) to output-queue(oqx1:1)\n                            else\n                                add 1 to co3\n                                move current-operators(co3:1) to output-queue(oqx1:1)\n                            end-if\n                        end-perform\n                    end-perform\n                    perform evaluate-rpn\n                    if divide-by-zero-error = space\n                    and 24 * top-denominator = top-numerator\n                        exit paragraph\n                    end-if\n                end-perform\n            end-perform\n        end-perform\n    end-perform\n    .  \ndisplay-instructions.\n    display '1)  Type h <enter> to repeat these instructions.'\n    display '2)  The program will display four randomly-generated'\n    display '    single-digit numbers and will then prompt you to enter'\n    display '    an arithmetic expression followed by <enter> to sum'\n    display '    the given numbers to 24.'\n    display '    The four numbers may contain duplicates and the entered'\n    display '    expression must reference all the generated numbers and duplicates.'\n    display '    Warning:  the program converts the entered infix expression'\n    display '    to a reverse polish notation (rpn) expression'\n    display '    which is then interpreted from RIGHT to LEFT.'\n    display '    So, for instance, 8*4 - 5 - 3 will not sum to 24.' \n    display '3)  Type n <enter> to generate a new set of four numbers.'\n    display '    The program will ensure the generated numbers are solvable.'\n    display '4)  Type m#### <enter> (e.g. m1234) to create a fixed set of numbers'\n    display '    for testing purposes.'\n    display '    The program will test the solvability of the entered numbers.'\n    display '    For example, m1234 is solvable and m9999 is not solvable.'\n    display '5)  Type d0, d1, d2 or d3 followed by <enter> to display none or'\n    display '    increasingly detailed diagnostic information as the program evaluates' \n    display '    the entered expression.'\n    display '6)  Type e <enter> to see a list of example expressions and results'\n    display '7)  Type <enter> or q <enter> to exit the program' \n    .\nshow-result.\n    if error-found = 'y'\n    or divide-by-zero-error = 'y'\n        exit paragraph\n    end-if\n    display 'statement in RPN is' space output-queue\n    evaluate true\n    when top-numerator = 0\n    when top-denominator = 0\n    when 24 * top-denominator <> top-numerator\n        display 'result (' top-numerator '/' top-denominator ') is not 24'\n    when other\n        display 'result is 24'\n    end-evaluate\n    .\nevaluate-statement.\n    compute l-lim = length(trim(statement))\n\n    display NL 'numbers:' space n(1) space n(2) space n(3) space n(4)\n    move number-definitions to number-use\n    display 'statement is' space statement  \n\n    move 1 to l\n    move 0 to loop-count\n    move space to error-found\n\n    move 0 to osx oqx\n    move spaces to output-queue\n\n    move 1 to p\n    move 1 to nt\n    move 0 to s\n    perform increment-s\n    perform display-start-nonterminal\n    perform increment-p\n\n    *>===================================\n    *> interpret ebnf\n    *>=================================== \n    perform until s = 0 \n    or error-found = 'y'\n\n        evaluate true\n\n        when p-symbol(p) = 'n'\n        and p-definition(p) = 000 *> a variable\n           perform test-variable\n       if s-result(s) = 'S'\n               perform increment-l\n           end-if\n           perform increment-p\n\n       when p-symbol(p) = 'n'\n       and p-address(p) <> p-definition(p) *> nonterminal reference\n           move p to s-p(s)\n           move p-definition(p) to p\n\n       when p-symbol(p) = 'n'\n       and p-address(p) = p-definition(p) *> nonterminal definition\n           perform increment-s\n           perform display-start-nonterminal\n           perform increment-p\n\n        when p-symbol(p) = '=' *> nonterminal control\n            move p to s-start-control(s)\n            move p-matching(p) to s-end-control(s)\n            perform increment-p\n\n        when p-symbol(p) = ';' *> end nonterminal\n            perform display-end-control\n            perform display-end-nonterminal\n            perform decrement-s\n            if s > 0\n                evaluate true\n                when s-result(r) = 'S'\n                    perform set-success\n                when s-result(r) = 'F'\n                    perform set-failure\n                end-evaluate\n                move s-p(s) to p\n                perform increment-p\n                perform display-continue-nonterminal\n            end-if\n\n    when p-symbol(p) = '{' *> start repeat sequence\n            perform increment-s\n            perform display-start-control\n            move p to s-start-control(s)\n            move p-alternate(p) to s-alternate(s)\n            move p-matching(p) to s-end-control(s)\n            move 0 to s-count(s)\n            perform increment-p\n\n        when p-symbol(p) = '}' *> end repeat sequence\n            perform display-end-control\n            evaluate true\n            when s-result(s) = 'S' *> repeat the sequence\n                perform display-repeat-control\n                perform set-nothing\n                add 1 to s-repeat(s)\n                move s-start-control(s) to p\n                perform increment-p\n           when other\n               perform decrement-s\n               evaluate true\n               when s-result(r) = 'N'\n               and s-repeat(r) = 0 *> no result\n                   perform increment-p\n               when s-result(r) = 'N'\n               and s-repeat(r) > 0 *> no result after success\n                   perform set-success\n                   perform increment-p\n               when other *> fail the sequence\n                   perform increment-p\n               end-evaluate\n           end-evaluate\n\n        when p-symbol(p) = '(' *> start sequence\n            perform increment-s\n            perform display-start-control\n            move p to s-start-control(s)\n            move p-alternate(p) to s-alternate(s)\n            move p-matching(p) to s-end-control(s)\n            move 0 to s-count(s)\n            perform increment-p\n\n       when p-symbol(p) = ')' *> end sequence\n           perform display-end-control\n           perform decrement-s\n           evaluate true\n           when s-result(r) = 'S' *> success\n               perform set-success\n               perform increment-p\n           when s-result(r) = 'N' *> no result\n               perform set-failure\n               perform increment-p\n            when other *> fail the sequence\n               perform set-failure\n               perform increment-p\n           end-evaluate\n\n        when p-symbol(p) = '|' *> alternate\n            evaluate true\n            when s-result(s) = 'S' *> exit the sequence\n                perform display-skip-alternate\n                move s-end-control(s) to p\n            when other\n                perform display-take-alternate\n                move p-alternate(p) to s-alternate(s) *> the next alternate\n                perform increment-p\n                perform set-nothing\n            end-evaluate\n\n        when p-symbol(p) = 't' *> terminal\n            move p-definition(p) to t\n            move terminal-symbol-len(t) to t-len\n            perform display-terminal\n            evaluate true\n            when statement(l:t-len) = terminal-symbol(t)(1:t-len) *> successful match\n               perform set-success\n               perform display-recognize-terminal\n               perform process-token\n               move t-len to l-len\n               perform increment-l\n               perform increment-p\n            when s-alternate(s) <> 000 *> we are in an alternate sequence\n               move s-alternate(s) to p\n            when other *> fail the sequence\n               perform set-failure\n               move s-end-control(s) to p\n            end-evaluate\n\n        when other *> end control\n            perform display-control-failure *> shouldnt happen\n\n        end-evaluate\n\n     end-perform\n\n     evaluate true *> at end of evaluation\n     when error-found = 'y'\n         continue\n     when l <= l-lim *> not all tokens parsed\n         display 'error: invalid statement'\n         perform statement-error\n     when number-use <> spaces\n         display 'error:  not all numbers were used: ' number-use\n         move 'y' to error-found\n     end-evaluate\n    .\nincrement-l.\n    evaluate true\n    when l > l-lim *> end of statement\n        continue\n    when other\n        add l-len to l\n        perform varying l from l by 1 \n        until c(l) <> space\n        or l > l-lim\n            continue\n        end-perform\n        move 1 to l-len\n        if l > l-lim\n            perform end-tokens\n        end-if\n    end-evaluate\n    .\nincrement-p.\n    evaluate true\n    when p >= p-max\n        display 'at' space p ' parse overflow'\n            space 's=<' s space s-entry(s) '>'\n        move 'y' to error-found\n    when other\n        add 1 to p\n        perform display-statement\n    end-evaluate\n    .\nincrement-s.\n    evaluate true\n    when s >= s-max\n        display 'at' space p ' stack overflow '\n            space 's=<' s space s-entry(s) '>'\n        move 'y' to error-found\n    when other\n        move s to r\n        add 1 to s\n        initialize s-entry(s)\n        move 'N' to s-result(s)\n        move p to s-p(s)\n        move nt to s-nt(s)\n    end-evaluate\n    .\ndecrement-s.\n    if s > 0\n        move s to r\n        subtract 1 from s\n        if s > 0\n            move s-nt(s) to nt\n        end-if\n    end-if\n    .\nset-failure.\n    move 'F' to s-result(s)\n    if s-count(s) > 0\n        display 'sequential parse failure'\n        perform statement-error\n    end-if\n    .\nset-success.\n    move 'S' to s-result(s)\n    add 1 to s-count(s)\n    .\nset-nothing.\n    move 'N' to s-result(s)\n    move 0 to s-count(s)\n    .\nstatement-error.\n    display statement\n    move spaces to statement\n    move '^ syntax error' to statement(l:)\n    display statement\n    move 'y' to error-found\n    .\n*>=====================\n*> twentyfour semantics\n*>=====================\ntest-variable.\n    *> check validity\n    perform varying nd from 1 by 1 until nd > 4\n    or c(l) = n(nd)\n        continue\n    end-perform\n    *> check usage\n    perform varying nu from 1 by 1 until nu > 4\n    or c(l) = u(nu)\n        continue\n    end-perform\n    evaluate true\n    when l > l-lim\n        perform set-failure\n    when c9(l) not numeric\n        perform set-failure\n    when nd > 4\n        display 'invalid number'\n        perform statement-error\n    when nu > 4\n        display 'number already used'\n        perform statement-error\n    when other\n        move space to u(nu)\n        perform set-success\n        add 1 to oqx\n        move c(l) to output-queue(oqx:1)\n    end-evaluate\n    .\n*> ==================================\n*> Dijkstra Shunting-Yard Algorithm\n*> to convert infix to rpn\n*> ==================================\nprocess-token.\n    evaluate true\n    when c(l) = '('\n        add 1 to osx\n        move c(l) to operator-stack(osx:1)\n    when c(l) = ')'\n        perform varying osx from osx by -1 until osx < 1\n        or operator-stack(osx:1) = '('\n            add 1 to oqx\n            move operator-stack(osx:1) to output-queue(oqx:1)\n        end-perform\n        if osx < 1\n            display 'parenthesis error'\n            perform statement-error\n            exit paragraph\n        end-if\n        subtract 1 from osx\n    when (c(l) = '+' or '-') and (operator-stack(osx:1) = '*' or '/')\n        *> lesser operator precedence\n        add 1 to oqx\n        move operator-stack(osx:1) to output-queue(oqx:1) \n        move c(l) to operator-stack(osx:1)\n    when other\n        *> greater operator precedence\n        add 1 to osx\n        move c(l) to operator-stack(osx:1)\n    end-evaluate\n    . \nend-tokens.\n    *> 1) copy stacked operators to the output-queue\n    perform varying osx from osx by -1 until osx < 1\n    or operator-stack(osx:1) = '('\n        add 1 to oqx\n        move operator-stack(osx:1) to output-queue(oqx:1)\n    end-perform\n    if osx > 0\n        display 'parenthesis error'\n        perform statement-error\n        exit paragraph\n    end-if\n    *> 2) evaluate the rpn statement\n    perform evaluate-rpn\n    if divide-by-zero-error = 'y'\n        display 'divide by zero error'\n    end-if\n    .\nevaluate-rpn.\n    move space to divide-by-zero-error\n    move 0 to rsx *> stack depth\n    perform varying oqx1 from 1 by 1 until oqx1 > oqx\n        if output-queue(oqx1:1) >= '1' and <= '9'\n            *> push current data onto the stack\n            add 1 to rsx\n            move top-numerator to numerator(rsx)\n            move top-denominator to denominator(rsx)\n            move output-queue(oqx1:1) to top-numerator\n            move 1 to top-denominator\n        else\n            *> apply the operation\n            evaluate true\n            when output-queue(oqx1:1) = '+'\n                compute top-numerator = top-numerator * denominator(rsx)\n                    + top-denominator * numerator(rsx)\n                compute top-denominator = top-denominator * denominator(rsx)  \n            when output-queue(oqx1:1) = '-' \n                compute top-numerator = top-denominator * numerator(rsx)\n                    - top-numerator * denominator(rsx)\n                compute top-denominator = top-denominator * denominator(rsx)  \n            when output-queue(oqx1:1) = '*' \n                compute top-numerator = top-numerator * numerator(rsx)\n                compute top-denominator = top-denominator * denominator(rsx)  \n            when output-queue(oqx1:1) = '/'\n                compute work-number = numerator(rsx) * top-denominator\n                compute top-denominator = denominator(rsx) * top-numerator\n                if top-denominator = 0\n                    move 'y' to divide-by-zero-error\n                    exit paragraph\n                end-if\n                move work-number to top-numerator\n            end-evaluate\n            *> pop the stack\n            subtract 1 from rsx\n        end-if\n    end-perform \n    .\n*>====================\n*> diagnostic displays\n*>====================\ndisplay-start-nonterminal.\n    perform varying nt from nt-lim by -1 until nt < 1\n    or p-definition(p) = nonterminal-statement-number(nt)\n        continue\n    end-perform\n    if nt > 0\n        move '1' to NL-flag\n        string '1' indent(1:s + s) 'at ' s space p ' start ' trim(nonterminal-statement(nt))\n            into message-area perform display-message\n        move nt to s-nt(s)\n    end-if\n    .\ndisplay-continue-nonterminal.\n    move s-nt(s) to nt\n    string '1' indent(1:s + s) 'at ' s space p space p-symbol(p) ' continue ' trim(nonterminal-statement(nt)) ' with result ' s-result(s)\n            into message-area perform display-message\n    .\ndisplay-end-nonterminal.\n    move s-nt(s) to nt\n    move '2' to NL-flag\n    string '1' indent(1:s + s) 'at ' s space p ' end ' trim(nonterminal-statement(nt)) ' with result ' s-result(s)\n            into message-area perform display-message\n    .\ndisplay-start-control.\n    string '2' indent(1:s + s) 'at ' s space p ' start ' p-symbol(p) ' in ' trim(nonterminal-statement(nt))\n        into message-area perform display-message\n    .\ndisplay-repeat-control.\n    string '2' indent(1:s + s) 'at ' s space p ' repeat ' p-symbol(p) ' in ' trim(nonterminal-statement(nt))  ' with result ' s-result(s)\n        into message-area perform display-message\n    .\ndisplay-end-control.\n    string '2' indent(1:s + s) 'at ' s space p ' end ' p-symbol(p)  ' in ' trim(nonterminal-statement(nt)) ' with result ' s-result(s)\n        into message-area perform display-message\n    .\ndisplay-take-alternate.\n    string '2' indent(1:s + s) 'at ' s space p ' take alternate' ' in ' trim(nonterminal-statement(nt))\n        into message-area perform display-message\n    .\ndisplay-skip-alternate.\n    string '2' indent(1:s + s) 'at ' s space p ' skip alternate' ' in ' trim(nonterminal-statement(nt))\n        into message-area perform display-message\n    .\ndisplay-terminal.\n    string '1' indent(1:s + s) 'at ' s space p\n        ' compare ' statement(l:t-len) ' to ' terminal-symbol(t)(1:t-len)\n        ' in ' trim(nonterminal-statement(nt))\n        into message-area perform display-message\n    .\ndisplay-recognize-terminal.\n    string '1' indent(1:s + s) 'at ' s space p ' recognize terminal: ' c(l) ' in ' trim(nonterminal-statement(nt))\n        into message-area perform display-message\n    .\ndisplay-recognize-variable.\n    string '1' indent(1:s + s) 'at ' s space p ' recognize digit: ' c(l) ' in ' trim(nonterminal-statement(nt))\n        into message-area perform display-message\n    .\ndisplay-statement.\n    compute p1 = p - s-start-control(s)\n    string '3' indent(1:s + s) 'at ' s space p\n        ' statement: ' s-start-control(s) '/' p1\n        space p-symbol(p) space s-result(s)\n        ' in ' trim(nonterminal-statement(nt))\n        into message-area perform display-message\n    .\ndisplay-control-failure.\n    display loop-count space indent(1:s + s) 'at' space p ' control failure' ' in ' trim(nonterminal-statement(nt))\n    display loop-count space indent(1:s + s) '   ' 'p=<' p p-entry(p) '>'\n    display loop-count space indent(1:s + s) '   ' 's=<' s space s-entry(s) '>'\n    display loop-count space indent(1:s + s) '   ' 'l=<' l space c(l)'>'\n    perform statement-error\n    .\ndisplay-message.\n    if display-level = 1\n        move space to NL-flag\n    end-if\n    evaluate true\n    when loop-count > loop-lim *> loop control\n        display 'display count exceeds ' loop-lim\n        stop run\n    when message-level <= display-level\n        evaluate true\n        when NL-flag = '1'\n             display NL loop-count space trim(message-value)\n        when NL-flag = '2'\n             display loop-count space trim(message-value) NL\n        when other\n             display loop-count space trim(message-value)\n        end-evaluate\n    end-evaluate\n    add 1 to loop-count\n    move spaces to message-area\n    move space to NL-flag\n    .\nend program twentyfour.\n",
        "safe": true
    },
    {
        "filename": "24 game_31.txt",
        "content": "tty = require 'tty'\ntty.setRawMode true\n\nbuffer  = \"\"\nnumbers = []\n\nfor n in [0...4]\n    numbers.push Math.max 1, Math.floor(Math.random() * 9)\n    \nconsole.log \"You can use the numbers: #{numbers.join ' '}\"\n\nprocess.stdin.on 'keypress', (char, key) ->\n\n    # accept operator\n    if char and isNaN(char) and /[()*\\/+-]/.test(char) and buffer.substr(-1) isnt char\n        buffer += char\n        process.stdout.write char\n    # accept number\n    else if !isNaN(+char) and (buffer == '' or isNaN(buffer.substr -1))\n        buffer += char\n        process.stdout.write char\n    \n    # check then evaluate expression\n    if key?.name is 'enter'\n        result = calculate()\n        process.stdout.write '\\n'\n        if result and result is 24\n            console.log \" = 24! congratulations.\"\n        else\n            console.log \"#{result}. nope.\"\n        process.exit 0\n    \n    # quit\n    if key?.name is 'escape' or (key?.name == 'c' and key.ctrl)\n        process.exit 0\n\ncalculate = () ->\n\n    if /[^\\d\\s()+*\\/-]/.test buffer\n        console.log \"invalid characters\"\n        process.exit 1\n    \n    used = buffer.match(/\\d/g)\n    if used?.length != 4 or used.sort().join() != numbers.sort().join()\n        console.log \"you must use the 4 numbers provided\"\n        process.exit 1\n    \n    res = try eval buffer catch e\n    return res or 'invalid expression'\n\n    \n# begin taking input\nprocess.stdin.resume()\n",
        "safe": true
    },
    {
        "filename": "24 game_32.txt",
        "content": "1 rem 24 game\n2 rem for rosetta code\n10 rem use appropriate basic base address\n11 bh=08:bl=01: rem $0801 commodore 64\n12 rem bh=16:bl=01: rem $1001 commodore +4\n13 rem bh=18:bl=01: rem $1201 commodore vic-20 (35k ram)\n14 rem bh=04:bl=01: rem $0401 commodore pet\n15 rem bh=28:bl=01: rem $1c01 commodore 128 (bank 0)\n\n35 print chr$(147);chr$(14);\"Initializing...\":gosub 1400\n40 n$=\"\":x=rnd(-ti):rem similar to 'randomize'\n45 for i=1 to 4\n50 t$=str$(int(rnd(1)*9)+1)\n55 n$=n$+mid$(t$,2,1)\n60 next i\n\n65 print chr$(147)\n70 print spc(16);\"24 Game\"\n71 print:print \" The goal of this game is to formulate\"\n72 print:print \" an arithmetic expression that\"\n73 print:print \" evaluates to a value of 24, however\"\n74 print:print \" you may use only the four numbers\"\n75 print:print \" given at random by the computer and\"\n76 print:print \" the standard arithmetic operations of\"\n77 print:print \" add, subtract, multiply, and divide.\"\n78 print:print \" Each digit must be used by itself. \"\n79 print:print \" (e.g. if given 1, 2, 3, 4, you cannot\"\n80 print:print \" combine 1 and 2 to make 12.)\"\n89 gosub 1000\n\n90 i$=\"\":f$=\"\":p$=\"\"\n95 print chr$(147);\"Allowed characters:\"\n100 i$=n$+\"+-*/()\"\n110 print\n120 for i=1 to len(i$)\n130 print mid$(i$,i,1);\" \";\n140 next i:print\n150 print:print \"Spaces are ignored.\"\n155 print \"Enter 'end' to end.\":print\n160 input \"Enter the formula\";f$\n170 if f$=\"end\" then print \"Program terminated.\":end \n\n180 print:print \"Checking syntax... \";tab(34);\n190 for i=1 to len(f$)\n200 if mid$(f$,i,1)=\" \" then next i\n210 c$=mid$(f$,i,1)\n220 if c$=\"+\" or c$=\"-\" or c$=\"*\" or c$=\"/\" then p$=p$+\"o\":goto 250\n230 if c$=\"(\" or c$=\")\" then p$=p$+c$:goto 250\n240 p$=p$+\"n\"\n250 next i\n260 restore\n270 for i=1 to 11\n280 read t$\n290 if t$=p$ then i=11\n300 next i\n310 if t$<>p$ then gosub 1100:gosub 1000:goto 90\n\n315 print \"OK\":print \"Checking for illegal numbers... \";tab(34);\n320 for i=1 to len(f$)\n330 for j=1 to 10\n335 ft$=mid$(f$,i,1)\n336 il$=left$(i$,j-1):it$=mid$(i$,j,1):ir$=mid$(i$,j+1,len(i$))\n340 if ft$=it$ and ft$>\"0\" and ft$<=\"9\" then i$=il$+\" \"+ir$\n350 next j\n360 next i\n370 if mid$(i$,1,4)<>\"    \" then gosub 1200:gosub 1000:goto 90\n\n375 print \"OK\":print \"Evaluating expression...\":print:print tab(10);f$;\" =\";\n380 gosub 600:rem r=val(f$)\n390 print r;\" \"\n400 if r<>24 then gosub 1300:gosub 1000:goto 90\n410 print \"Correct!\"\n\n420 print:print \"Would you like to go again (y/n)? \";\n425 get k$:if k$<>\"y\" and k$<>\"n\" then 425\n430 print k$\n435 if k$=\"y\" then goto 40\n440 print:print \"Very well. Have a nice day!\"\n450 end\n\n500 rem pattern matching\n501 data \"nononon\",\"(non)onon\",\"nono(non)\"\n504 data \"no(no(non))\",\"((non)on)on\",\"no(non)on\"\n507 data \"(non)o(non)\",\"no((non)on)\",\"(nonon)on\"\n510 data \"(no(non))on\",\"no(nonon)\"\n\n600 rem get basic to evaluate our expression\n605 a$=\"r=\"+f$:gosub 1440\n610 for i=1 to len(a$)\n615 rem simple token translation\n620 b=asc(mid$(a$,i,1))\n625 if (b>41 and b<48) or b=61 or b=94 then b=t(b)\n630 poke (ad+i-1),b\n635 next\n640 gosub 2000\n645 rem gosub 1440:rem uncomment to clear evaluation line after use\n650 return\n\n1000 rem screen pause\n1005 pt$=\" Press a key to continue. \"\n1010 print:print spc(20-int(len(pt$)/2));\n1015 print chr$(18);pt$;chr$(146);\n1020 get k$:if k$=\"\"then 1020\n1030 return\n\n1100 rem syntax error\n1105 print \"ERROR\":print\n1110 print \"Maybe something is out of place...\"\n1120 return\n\n1200 rem invalid arguments\n1205 print \"ERROR\":print\n1210 print \"?Invalid Arguments - \"\n1215 print \"You used a number that is not allowed.\"\n1220 return\n\n1300 rem wrong formula\n1305 print:print \"Wrong answer. Try again.\"\n1310 return\n\n1400 dim t(94):t(43)=170:t(45)=171:t(42)=172:t(47)=173:t(61)=178:t(94)=174\n1405 rem locate line 2005 in ram\n1410 lh=bh:ll=bl:nh=0:nl=0\n1415 ad=lh*256+ll\n1420 lh=peek(ad+1):ll=peek(ad)\n1425 nl=peek(ad+2):nh=peek(ad+3):n=nh*256+nl\n1430 if n<>2005 then goto 1415\n1435 ad=ad+4:return\n\n1440 for j=ad to ad+73:poke j,asc(\":\"):next\n1445 return\n\n2000 rem put 74 colons on the next line\n2005 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::\n2010 return\n",
        "safe": true
    },
    {
        "filename": "24 game_33.txt",
        "content": "Initializing...\n\n                24 Game\n\n The goal of this game is to formulate\n\n an arithmetic expression that\n\n evaluates to a value of 24, however\n\n you may only use four numbers provided\n\n at random by the computer and the\n\n standard arithmetic operations of add,\n\n subtract, multiply, and divide. Each\n\n digit must be used by itself. (e.g. if\n\n given 1, 2, 3, 4, you cannot combine\n\n 1 and 2 to make 12.)\n\n        Press a key to continue.\n\nAllowed characters:\n\n6 3 3 5 + - * / ( )\n\nSpaces are ignored.\nEnter 'end' to end.\n\nEnter the formula? (6-3)*(3+5)\n\nChecking syntax...               OK\nChecking for illegal numbers...  OK\nEvaluating expression...\n\n          (6-3)*(3+5) = 24\nCorrect!\n\nWould you like to go again (y/n)? n\n\nVery well. Have a nice day!\n\nready.\nlist 2005\n\n2005 r=(6-3)*(3+5)::::::::::::::::::::::\n:::::::::::::::::::::::::::::::::::::::\n\nready.\n\u2588",
        "safe": true
    },
    {
        "filename": "24 game_34.txt",
        "content": "(define-condition choose-digits () ())\n(define-condition bad-equation (error) ())\n\n(defun 24-game ()\n  (let (chosen-digits)\n    (labels ((prompt ()\n               (format t \"Chosen digits: ~{~D~^, ~}~%~\n                          Enter expression (or `bye' to quit, `!' to choose new digits): \"\n                       chosen-digits)\n               (read))\n             (lose () (error 'bad-equation))\n             (choose () (setf chosen-digits (loop repeat 4 collecting (1+ (random 9)))))\n             (check (e)\n               (typecase e\n                 ((eql bye) (return-from 24-game))\n                 ((eql !) (signal 'choose-digits))\n                 (atom (lose))\n                 (cons (check-sub (car e) (check-sub (cdr e) chosen-digits)) e)))\n             (check-sub (sub allowed-digits)\n               (typecase sub\n                 ((member nil + - * /) allowed-digits)\n                 (integer\n                  (if (member sub allowed-digits)\n                      (remove sub allowed-digits :count 1)\n                      (lose)))\n                 (cons (check-sub (car sub) (check-sub (cdr sub) allowed-digits)))\n                 (t (lose))))\n             (win ()\n               (format t \"You win.~%\")\n               (return-from 24-game)))\n      (choose)\n      (loop\n       (handler-case\n           (if (= 24 (eval (check (prompt)))) (win) (lose))\n         (error () (format t \"Bad equation, try again.~%\"))\n         (choose-digits () (choose)))))))\n",
        "safe": true
    },
    {
        "filename": "24 game_35.txt",
        "content": "(defconstant +ops+ '(* / + -))\n\n(defun expr-numbers (e &optional acc)\n  \"Return all the numbers in argument positions in the expression.\"\n  (cond\n   ((numberp e) (cons e acc))\n   ((consp e)\n    (append (apply #'append\n                   (mapcar #'expr-numbers (cdr e)))\n            acc))))\n\n(defun expr-well-formed-p (e)\n  \"Return non-nil if the given expression is well-formed.\"\n  (cond\n   ((numberp e) t)\n   ((consp e)\n    (and (member (car e) +ops+)\n         (every #'expr-well-formed-p (cdr e))))\n   (t nil)))\n\n(defun expr-valid-p (e available-digits)\n  \"Return non-nil if the expression is well-formed and uses exactly\nthe digits specified.\"\n  (and (expr-well-formed-p e)\n       (equalp (sort (copy-seq available-digits) #'<)\n               (sort (expr-numbers e) #'<))))\n\n(defun expr-get (&optional using)\n  (emit \"Enter lisp form~@[ using the digit~P ~{~D~^ ~}~]: \"\n        (when using\n          (length using)) using)\n  (let (*read-eval*)\n    (read)))\n\n(defun digits ()\n  (sort (loop repeat 4 collect (1+ (random 9))) #'<))\n\n(defun emit (fmt &rest args)\n  (format t \"~&~?\" fmt args))\n\n(defun prompt (digits)\n  (emit \"Using only these operators:~%~%~\n           ~2T~{~A~^ ~}~%~%~\n         And exactly these numbers \\(no repetition\\):~%~%~\n           ~2T~{~D~^ ~}~%~%~\n         ~A\"\n        +ops+ digits (secondary-prompt)))\n\n(defun secondary-prompt ()\n  (fill-to 50 \"Enter a lisp form which evaluates to ~\n               the integer 24, or \\\"!\\\" to get fresh ~\n               digits, or \\\"q\\\" to abort.\"))\n\n(defun fill-to (n fmt &rest args)\n  \"Poor-man's text filling mechanism.\"\n  (loop with s = (format nil \"~?\" fmt args)\n        for c across s\n        and i from 0\n        and j = 0 then (1+ j) ; since-last-newline ctr\n\n        when (char= c #\\Newline)\n        do (setq j 0)\n\n        else when (and (not (zerop j))\n                       (zerop (mod j n)))\n        do (loop for k from i below (length s)\n                 when (char= #\\Space (schar s k))\n                 do (progn\n                      (setf (schar s k) #\\Newline\n                            j 0)\n                      (loop-finish)))\n        finally (return s)))\n\n(defun 24-game ()\n  (loop with playing-p = t\n        and initial-digits = (digits)\n\n        for attempts from 0\n        and digits = initial-digits then (digits)\n\n        while playing-p\n\n        do (loop for e = (expr-get (unless (zerop attempts)\n                                     digits))\n                 do\n                 (case e\n                   (! (loop-finish))\n                   (Q (setq playing-p nil)\n                      (loop-finish))\n                   (R (emit \"Current digits: ~S\" digits))\n                   (t\n                    (if (expr-valid-p e digits)\n                        (let ((v (eval e)))\n                          (if (eql v 24)\n                              (progn\n                                (emit \"~%~%---> A winner is you! <---~%~%\")\n                                (setq playing-p nil)\n                                (loop-finish))\n                            (emit \"Sorry, the form you entered ~\n                                   computes to ~S, not 24.~%~%\"\n                                  v)))\n                      (emit \"Sorry, the form you entered did not ~\n                             compute.~%~%\")))))\n        initially (prompt initial-digits)))\n",
        "safe": true
    },
    {
        "filename": "24 game_36.txt",
        "content": "CL-USER 97 > (24-game)\nUsing only these operators:\n\n  * / + -\n\nAnd exactly these numbers (no repetition):\n\n  3 7 7 9\n\nEnter a lisp form which evaluates to the integer 24,\nor \"!\" to get fresh digits, or \"q\" to abort.\nEnter lisp form: (eval (read-from-string \"(/ 1 0)\"))\nSorry, the form you entered did not compute.\n\nEnter lisp form:\u00a0!\nEnter lisp form using the digits 4 5 7 8:\u00a0!\nEnter lisp form using the digits 1 2 4 5: (* 4 (* 5 (- 2 1)))\nSorry, the form you entered computes to 20, not 24.\n\nEnter lisp form using the digits 1 2 4 5: (* 4 (+ 5 (- 2 1)))\n\n\n---> A winner is you! <---\n\nNIL",
        "safe": true
    },
    {
        "filename": "24 game_37.txt",
        "content": "import std.stdio, std.random, std.math, std.algorithm, std.range,\n       std.typetuple;\n\nvoid main() {\n    void op(char c)() {\n        if (stack.length < 2)\n            throw new Exception(\"Wrong expression.\");\n        stack[$ - 2] = mixin(\"stack[$ - 2]\" ~ c ~ \"stack[$ - 1]\");\n        stack.popBack();\n    }\n\n    const problem = iota(4).map!(_ => uniform(1, 10))().array();\n    writeln(\"Make 24 with the digits: \", problem);\n\n    double[] stack;\n    int[] digits;\n    foreach (const char c; readln())\n        switch (c) {\n            case ' ', '\\t', '\\n': break;\n            case '1': .. case '9':\n                stack ~= c - '0';\n                digits ~= c - '0';\n                break;\n            foreach (o; TypeTuple!('+', '-', '*', '/')) {\n                case o: op!o(); break;\n            }\n            break;\n            default: throw new Exception(\"Wrong char: \" ~ c);\n        }\n\n    if (!digits.sort().equal(problem.dup.sort()))\n        throw new Exception(\"Not using the given digits.\");\n    if (stack.length != 1)\n        throw new Exception(\"Wrong expression.\");\n    writeln(\"Result: \", stack[0]);\n    writeln(abs(stack[0] - 24) < 0.001 ? \"Good job!\" : \"Try again.\");\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_38.txt",
        "content": "Make 24 with the digits: [1, 8, 9, 8]\n8 1 - 9 + 8 +\nResult: 24\nGood job!",
        "safe": true
    },
    {
        "filename": "24 game_39.txt",
        "content": "var ErrorFlag: boolean;\nvar ErrorStr: string;\n\n\nfunction EvaluateExpression(Express: string): double;\n{ Recursive descent expression evaluator }\nvar Atom: char;\nvar ExpressStr: string;\nvar ExpressInx: integer;\nconst Tab_Char = #$09; SP_char = #$20;\n\n\tprocedure HandleError(S: string);\n\tbegin\n\tErrorStr:=S;\n\tErrorFlag:=True;\n\tAbort;\n\tend;\n\n\n\tprocedure GetChar;\n\tbegin\n\tif ExpressInx > Length(ExpressStr) then\n\t\tbegin\n\t\tAtom:= ')';\n\t\tend\n\t else\tbegin\n\t\tAtom:= ExpressStr[ExpressInx];\n\t\tInc(ExpressInx);\n\t\tend;\n\tend;\n\n\n\n\tprocedure SkipWhiteSpace;\n\t{ Skip Tabs And Spaces In Expression }\n\tbegin\n\twhile (Atom=TAB_Char) or (Atom=SP_char) do GetChar;\n\tend;\n\n\n\n\tprocedure SkipSpaces;\n\t{ Get Next Character, Ignoring Any Space Characters }\n\tbegin\n\trepeat GetChar until Atom <> SP_CHAR;\n\tend;\n\n\n\n\tfunction GetDecimal: integer;\n\t{ Read In A Decimal String And Return Its Value }\n\tvar S: string;\n\tbegin\n\tResult:=0;\n\tS:='';\n\twhile True do\n\t\tbegin\n\t\tif not (Atom in ['0'..'9']) then break;\n\t\tS:=S+Atom;\n\t\tGetChar;\n\t\tend;\n\tif S='' then HandleError('Number Expected')\n\telse Result:=StrToInt(S);\n\tif Result>9 then HandleError('Only Numbers 0..9 allowed')\n\tend;\n\n\n\tfunction Expression: double;\n\t{ Returns The Value Of An Expression }\n\n\n\n\t\tfunction Factor: double;\n\t\t{ Returns The Value Of A Factor }\n\t\tvar NEG: boolean;\n\t\tbegin\n\t\tResult:=0;\n\t\twhile Atom='+' do SkipSpaces;\t\t{ Ignore Unary \"+\" }\n\t\tNEG:= False;\n\t\twhile Atom ='-' do\t\t\t{ Unary \"-\" }\n\t\t\tbegin\n\t\t\tSkipSpaces;\n\t\t\tNEG:= not NEG;\n\t\t\tend;\n\n\t\tif (Atom>='0') and (Atom<='9') then Result:= GetDecimal\t{ Unsigned Integer }\n\t\telse case Atom of\n\t\t  '(':\tbegin\t\t\t\t{ Subexpression }\n\t\t\tSkipSpaces;\n\t\t\tResult:= Expression;\n\t\t\tif Atom<>')' then HandleError('Mismatched Parenthesis');\n\t\t\tSkipSpaces;\n\t\t\tend;\n\t\t  else\tHandleError('Syntax Error');\n\t\t  end;\n\t\t{ Numbers May Terminate With A Space Or Tab }\n\t\tSkipWhiteSpace;\n\t\tif NEG then Result:=-Result;\n\t\tend;\t{ Factor }\n\n\n\n\t\tfunction Term: double;\n\t\t{ Returns Factor * Factor, Etc. }\n\t\tvar R: double;\n\t\tbegin\n\t\tResult:= Factor;\n\t\twhile True do\n\t\t\tcase Atom of\n\t\t\t  '*':\tbegin\n\t\t\t  \tSkipSpaces;\n\t\t\t  \tResult:= Result * Factor;\n\t\t\t  \tend;\n\t\t\t  '/':\tbegin\n\t\t\t  \tSkipSpaces;\n\t\t\t  \tR:=Factor;\n\t\t\t  \tif R=0 then HandleError('Divide By Zero');\n\t\t\t  \tResult:= Result / R;\n\t\t\t  \tend;\n\t\t\t  else\tbreak;\n\t\t\tend;\n\t\tend;\n\t\t{ Term }\n\n\n\n\t\tfunction AlgebraicExpression: double;\n\t\t{ Returns Term + Term, Etc. }\n\t\tbegin\n\t\tResult:= Term;\n\t\twhile True do\n\t\t\tcase Atom of\n\t\t\t  '+':\tbegin SkipSpaces; Result:= Result + Term; end;\n\t\t\t  '-':\tbegin SkipSpaces; Result:= Result - Term; end\n\t\t\telse\tbreak;\n\t\t\tend;\n\t\tend; { Algexp }\n\n\n\n\tbegin\t{ Expression }\n\tSkipWhiteSpace;\n\tResult:= AlgebraicExpression;\n\tend;\t{ Expression }\n\n\n\nbegin\t{ EvaluateExpression }\nErrorFlag:=False;\nErrorStr:='';\nExpressStr:=Express;\nExpressInx:=1;\ntry\nGetChar;\nResult:= Expression;\nexcept end;\nend;\n\n\nfunction WaitForString(Memo: TMemo; Prompt: string): string;\n{Wait for key stroke on TMemo component}\nvar MW: TMemoWaiter;\nvar C: char;\nvar Y: integer;\nbegin\n{Use custom object to wait and capture key strokes}\nMW:=TMemoWaiter.Create(Memo);\ntry\nMemo.Lines.Add(Prompt);\nMemo.SelStart:=Memo.SelStart-1;\nMemo.SetFocus;\nResult:=MW.WaitForLine;\nfinally MW.Free; end;\nend;\n\n\n\n\n\nprocedure Play24Game(Memo: TMemo);\n{Play the 24 game}\nvar R: double;\nvar Nums: array [0..4-1] of char;\nvar I: integer;\nvar Express,RS: string;\nvar RB: boolean;\n\n\tprocedure GenerateNumbers;\n\t{Generate and display four random number 1..9}\n\tvar S: string;\n\tvar I: integer;\n\tbegin\n\t{Generate random numbers}\n\tfor I:=0 to High(Nums) do\n\t Nums[I]:=char(Random(9)+$31);\n\t{Display them}\n\tS:='';\n\tfor I:=0 to High(Nums) do\n\t S:=S+' '+Nums[I];\n\tMemo.Lines.Add('Your Digits: '+S);\n\tend;\n\n\tfunction TestMatchingNums: boolean;\n\t{Make sure numbers entered by user match the target numbers}\n\tvar SL1,SL2: TStringList;\n\tvar I: integer;\n\tbegin\n\tResult:=False;\n\tSL1:=TStringList.Create;\n\tSL2:=TStringList.Create;\n\ttry\n\t{Load target numbers into string list}\n\tfor I:=0 to High(Nums) do SL1.Add(Nums[I]);\n\t{Load users expression number int string list}\n\tfor I:=1 to Length(Express) do\n\t if Express[I] in ['0'..'9'] then SL2.Add(Express[I]);\n\t{There should be the same number }\n\tif SL1.Count<>SL2.Count then exit;\n\t{Sort them to facilitate testing}\n\tSL1.Sort; SL2.Sort;\n\t{Are number identical, if not exit}\n\tfor I:=0 to SL1.Count-1 do\n\t if SL1[I]<>SL2[I] then exit;\n\t{Users numbers passed all tests}\n\tResult:=True;\n\tfinally\n\t SL2.Free;\n\t SL1.Free;\n\t end;\n\tend;\n\n\tfunction TestUserExpression(var S: string): boolean;\n\t{Test expression user entered }\n\tbegin\n\tResult:=False;\n\tif not TestMatchingNums then\n\t\tbegin\n\t\tS:='Numbers Do not Match';\n\t\texit;\n\t\tend;\n\n\tR:=EvaluateExpression(Express);\n\tS:='Expression Value = '+FloatToStrF(R,ffFixed,18,0)+CRLF;\n\tif ErrorFlag then\n\t\tbegin\n\t\tS:=S+'Expression Problem: '+ErrorStr;\n\t\texit;\n\t\tend;\n\tif R<>24 then\n\t\tbegin\n\t\tS:=S+'Expression is incorrect value';\n\t\texit;\n\t\tend;\n\tS:=S+'!!!!!! Winner\u00a0!!!!!!!';\n\tResult:=True;\n\tend;\n\n\nbegin\nRandomize;\nMemo.Lines.Add('=========== 24 Game ===========');\nGenerateNumbers;\nwhile true do\n\tbegin\n\tif Application.Terminated then exit;\n\tExpress:=WaitForString(Memo,'Enter expression, Q = quit, N = New numbers: '+CRLF);\n\tif Pos('N',UpperCase(Express))>0 then\n\t\tbegin\n\t\tGenerateNumbers;\n\t\tContinue;\n\t\tend;\n\tif Pos('Q',UpperCase(Express))>0 then exit;\n\tRB:=TestUserExpression(RS);\n\tMemo.Lines.Add(RS);\n\tif not RB then continue;\n\tRS:=WaitForString(Memo,'Play again Y=Yes, N=No'+CRLF);\n\tif Pos('N',UpperCase(RS))>0 then exit;\n\tGenerateNumbers;\n\tend;\nend;\n",
        "safe": true
    },
    {
        "filename": "24 game_4.txt",
        "content": "with Ada.Float_Text_IO;\nwith Ada.Text_IO;\nwith Ada.Numerics.Discrete_Random;\nprocedure Game_24 is\n   subtype Digit is Character range '1' .. '9';\n   package Random_Digit is new Ada.Numerics.Discrete_Random (Digit);\n   Exp_Error : exception;\n   Digit_Generator : Random_Digit.Generator;\n   Given_Digits : array (1 .. 4) of Digit;\n   Float_Value : constant array (Digit) of Float :=\n      (1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0);\n   function Apply_Op (L, R : Float; Op : Character) return Float is\n   begin\n      case Op is\n         when '+' =>\n            return L + R;\n         when '-' =>\n            return L - R;\n         when '*' =>\n            return L * R;\n         when '/' =>\n            return L / R;\n         when others =>\n            Ada.Text_IO.Put_Line (\"Unexpected operator: \" & Op);\n            raise Exp_Error;\n      end case;\n   end Apply_Op;\n   function Eval_Exp (E : String) return Float is\n      Flt : Float;\n      First : Positive := E'First;\n      Last : Positive;\n      function Match_Paren (Start : Positive) return Positive is\n         Pos : Positive := Start + 1;\n         Level : Natural := 1;\n      begin\n         loop\n            if Pos > E'Last then\n               Ada.Text_IO.Put_Line (\"Unclosed parentheses.\");\n               raise Exp_Error;\n            elsif E (Pos) = '(' then\n               Level := Level + 1;\n            elsif E (Pos) = ')' then\n               Level := Level - 1;\n               exit when Level = 0;\n            end if;\n            Pos := Pos + 1;\n         end loop;\n         return Pos;\n      end Match_Paren;\n   begin\n      if E (First) = '(' then\n         Last := Match_Paren (First);\n         Flt := Eval_Exp (E (First + 1 .. Last - 1));\n      elsif E (First) in Digit then\n         Last := First;\n         Flt := Float_Value (E (First));\n      else\n         Ada.Text_IO.Put_Line (\"Unexpected character: \" & E (First));\n         raise Exp_Error;\n      end if;\n      loop\n         if Last = E'Last then\n            return Flt;\n         elsif Last = E'Last - 1 then\n            Ada.Text_IO.Put_Line (\"Unexpected end of expression.\");\n            raise Exp_Error;\n         end if;\n         First := Last + 2;\n         if E (First) = '(' then\n            Last := Match_Paren (First);\n            Flt := Apply_Op (Flt, Eval_Exp (E (First + 1 .. Last - 1)),\n                             Op => E (First - 1));\n         elsif E (First) in Digit then\n            Last := First;\n            Flt := Apply_Op (Flt, Float_Value (E (First)),\n                             Op => E (First - 1));\n         else\n            Ada.Text_IO.Put_Line (\"Unexpected character: \" & E (First));\n            raise Exp_Error;\n         end if;\n      end loop;\n   end Eval_Exp;\nbegin\n   Ada.Text_IO.Put_Line (\"24 Game\");\n   Ada.Text_IO.Put_Line (\"- Enter Q to Quit\");\n   Ada.Text_IO.Put_Line (\"- Enter N for New digits\");\n   Ada.Text_IO.Put_Line (\"Note: Operators are evaluated left-to-right\");\n   Ada.Text_IO.Put_Line (\"      (use parentheses to override)\");\n   Random_Digit.Reset (Digit_Generator);\n   <<GEN_DIGITS>>\n   Ada.Text_IO.Put_Line (\"Generating 4 digits...\");\n   for I in Given_Digits'Range loop\n      Given_Digits (I) := Random_Digit.Random (Digit_Generator);\n   end loop;\n   <<GET_EXP>>\n   Ada.Text_IO.Put (\"Your Digits:\");\n   for I in Given_Digits'Range loop\n      Ada.Text_IO.Put (\" \" & Given_Digits (I));\n   end loop;\n   Ada.Text_IO.New_Line;\n   Ada.Text_IO.Put (\"Enter your Expression: \");\n   declare\n      Value : Float;\n      Response : constant String := Ada.Text_IO.Get_Line;\n      Prev_Ch : Character := ' ';\n      Unused_Digits : array (Given_Digits'Range) of Boolean :=\n        (others => True);\n   begin\n      if Response = \"n\" or Response = \"N\" then\n         goto GEN_DIGITS;\n      end if;\n      if Response = \"q\" or Response = \"Q\" then\n         return;\n      end if;\n      -- check input\n      for I in Response'Range loop\n         declare\n            Ch : constant Character := Response (I);\n            Found : Boolean;\n         begin\n            if Ch in Digit then\n               if Prev_Ch in Digit then\n                  Ada.Text_IO.Put_Line (\"Illegal multi-digit number used.\");\n                  goto GET_EXP;\n               end if;\n               Found := False;\n               for J in Given_Digits'Range loop\n                  if Unused_Digits (J) and then\n                        Given_Digits (J) = Ch then\n                     Unused_Digits (J) := False;\n                     Found := True;\n                     exit;\n                  end if;\n               end loop;\n               if not Found then\n                  Ada.Text_IO.Put_Line (\"Illegal number used: \" & Ch);\n                  goto GET_EXP;\n               end if;\n            elsif Ch /= '(' and Ch /= ')' and Ch /= '+' and\n                  Ch /= '-' and Ch /= '*' and Ch /= '/' then\n               Ada.Text_IO.Put_Line (\"Illegal character used: \" & Ch);\n               goto GET_EXP;\n            end if;\n            Prev_Ch := Ch;\n         end;\n      end loop;\n      -- check all digits used\n      for I in Given_Digits'Range loop\n         if Unused_Digits (I) then\n            Ada.Text_IO.Put_Line (\"Digit not used: \" & Given_Digits (I));\n            goto GET_EXP;\n         end if;\n      end loop;\n      -- check value\n      begin\n         Value := Eval_Exp (Response);\n      exception\n         when Exp_Error =>\n            goto GET_EXP; -- Message displayed by Eval_Exp;\n      end;\n      if abs (Value - 24.0) > 0.001 then\n         Ada.Text_IO.Put (\"Value \");\n         Ada.Float_Text_IO.Put (Value, Fore => 0, Aft => 3, Exp => 0);\n         Ada.Text_IO.Put_Line (\" is not 24!\");\n         goto GET_EXP;\n      else\n         Ada.Text_IO.Put_Line (\"You won!\");\n         Ada.Text_IO.Put_Line (\"Enter N for a new game, or try another solution.\");\n         goto GET_EXP;\n      end if;\n   end;\nend Game_24;\n",
        "safe": true
    },
    {
        "filename": "24 game_40.txt",
        "content": "=========== 24 Game ===========\nYour Digits:  8 2 5 5\nEnter expression, Q = quit, N = New numbers: \n\nn\n\nYour Digits:  3 1 9 3\nEnter expression, Q = quit, N = New numbers: \n\n3 * 9 -3\n\nNumbers Do not Match\nEnter expression, Q = quit, N = New numbers: \n\n3 * 9 - 3 * 1\n\nExpression Value = 24\n!!!!!! Winner\u00a0!!!!!!!\nPlay again Y=Yes, N=No\n\n\n",
        "safe": true
    },
    {
        "filename": "24 game_41.txt",
        "content": "print \"Enter an equation in RPN form using all of, and only \"\nprint \"the following single digits which evaluates to 24:\"\nfunc game .\n   len cnt[] 9\n   write \">> \"\n   for i to 4\n      h = random 9\n      write h & \" \"\n      cnt[h] += 1\n   .\n   print \"\"\n   s$ = input\n   print s$\n   if s$ = \"\"\n      return 1\n   .\n   for c$ in strchars s$\n      if c$ = \"+\" or c$ = \"-\" or c$ = \"*\" or c$ = \"/\"\n         if len st[] < 2\n            print \"Stack empty\"\n            return 1\n         .\n         if c$ = \"+\"\n            st[$ - 1] = st[$ - 1] + st[$]\n         elif c$ = \"-\"\n            st[$ - 1] = st[$ - 1] - st[$]\n         elif c$ = \"*\"\n            st[$ - 1] = st[$ - 1] * st[$]\n         else\n            st[$ - 1] = st[$ - 1] / st[$]\n         .\n         len st[] -1\n      elif c$ <> \" \"\n         h = strcode c$ - 48\n         if h < 1 or h > 9\n            print \"Wrong command \" & c$\n            return 0\n         .\n         if cnt[h] = 0\n            print \"Wrong number \" & h\n            return 0\n         .\n         cnt[h] -= 1\n         st[] &= h\n      .\n   .\n   for c in cnt[]\n      s += c\n   .\n   if s > 0\n      print \"Not all numbers used\"\n      return 0\n   .\n   if len st[] > 1\n      print \"Calculation not finished\"\n      return 0\n   .\n   print st[1]\n   if abs (st[1] - 24) < 1e-10\n      print \"Well done\"\n   else\n      print \"Wrong result\"\n   .\n.\nrepeat\n   print \"\"\n   until game = 1\n.\n",
        "safe": true
    },
    {
        "filename": "24 game_42.txt",
        "content": "Enter an equation in RPN form using all of, and only \nthe following single digits which evaluates to 24:\n\n>> 5 1 8 4 \n8 4 - 5 1 + *\n24\nWell done\n",
        "safe": true
    },
    {
        "filename": "24 game_43.txt",
        "content": "(string-delimiter \"\")\n;; check that nums are in expr, and only once\n(define (is-valid? expr sorted: nums)\n    (when (equal? 'q expr) (error \"24-game\" \"Thx for playing\"))\n    (unless (and \n        (list? expr) \n        (equal? nums (list-sort < (filter number? (flatten expr)))))\n    (writeln \"\ud83c\udf83 Please use\" nums)\n    #f))\n    \n;; 4 random  digits\n(define (gen24)\n     (->> (append (range 1 10)(range 1 10)) shuffle (take 4) (list-sort < )))\n    \n(define (is-24? num)\n    (unless (= 24 num)\n    (writeln \"\ud83d\ude27 Sorry - Result = \" num)\n    #f))\n\n(define (check-24 expr)\n    (if (and \n        (is-valid? expr nums) \n        (is-24?  (js-eval (string expr)))) ;; use js evaluator\n        \"\ud83c\udf40 \ud83c\udf38 Congrats - (play24) for another one.\"\n        (input-expr check-24 (string nums))))\n        \n(define nums null)\n(define (play24)\n    (set! nums (gen24))\n    (writeln \"24-game - Can you combine\" nums \"to get 24 \u2753 (q to exit)\")\n    (input-expr check-24 (string-append  (string nums) \" -> 24 \u2753\")))\n",
        "safe": true
    },
    {
        "filename": "24 game_44.txt",
        "content": "24-game - Can you combine     (2 5 6 7)     to get 24 \u2753 (q to exit) \ndifficult game\n\ud83c\udf83 Please use     (2 5 6 7)    \n12 * 2\n\ud83c\udf83 Please use     (2 5 6 7)    \n6 * (7 - 5 + 2)\n\ud83c\udf40 \ud83c\udf38 Congrats - (play24) for another one.\n    \n(play24)\n24-game - Can you combine     (3 5 8 9)     to get 24 \u2753 (q to exit)    \n3 + 5 + 8 * 9\n\ud83d\ude27 Sorry - Result =      80    \n9 * 3 - (8 - 5)\n\ud83c\udf40 \ud83c\udf38 Congrats - (play24) for another one.\n    \n(play24)\n24-game - Can you combine     (1 8 8 9)     to get 24 \u2753 (q to exit)    \n9 + 8 + 8 - 1\n\ud83c\udf40 \ud83c\udf38 Congrats - (play24) for another one.\n",
        "safe": true
    },
    {
        "filename": "24 game_45.txt",
        "content": "import system'routines;\nimport system'collections;\nimport system'dynamic;\nimport extensions;\n\n// --- Expression ---\n\nclass ExpressionTree\n{\n    object _tree;\n    \n    constructor(s)\n    {\n        auto level\u00a0:= new Integer(0);\n        \n        s.forEach::(ch)\n        {\n            var node\u00a0:= new DynamicStruct();\n            \n            ch =>\n                $43 { node.Level\u00a0:= level + 1; node.Operation\u00a0:= mssg add }        // +\n                $45 { node.Level\u00a0:= level + 1; node.Operation\u00a0:= mssg subtract }   // -\n                $42 { node.Level\u00a0:= level + 2; node.Operation\u00a0:= mssg multiply }   // *\n                $47 { node.Level\u00a0:= level + 2; node.Operation\u00a0:= mssg divide }     // /\n                $40 { level.append(10); ^ self }                               // (\n                $41 { level.reduce(10); ^ self }                               // )\n               \u00a0! {\n                    node.Leaf\u00a0:= ch.toString().toReal();\n                    node.Level\u00a0:= level + 3\n                };\n                    \n            if (nil == _tree)\n            { \n                _tree\u00a0:= node \n            }\n            else\n            {\n                if (_tree.Level >= node.Level)\n                {\n                    node.Left\u00a0:= _tree;\n                    node.Right\u00a0:= nil;\n                    \n                    _tree\u00a0:= node\n                }\n                else\n                {\n                    var top\u00a0:= _tree;\n                    while ((nil\u00a0!= top.Right)&&(top.Right.Level < node.Level))\n                       { top\u00a0:= top.Right };\n                                 \n                    node.Left\u00a0:= top.Right;\n                    node.Right\u00a0:= nil;\n                                 \n                    top.Right\u00a0:= node\n                }\n            }\n        }\n    }\n    \n    eval(node)\n    {\n        if (node.containsProperty(mssg Leaf))\n        { \n            ^ node.Leaf \n        }\n        else\n        {\n            var left\u00a0:= self.eval(node.Left);\n            var right\u00a0:= self.eval(node.Right);\n            \n            var op\u00a0:= node.Operation;\n            \n            ^ op(left, right);\n        }\n    }\n    \n    get Value()\n        <= eval(_tree);\n        \n    readLeaves(list, node)\n    {\n        if (nil == node)\n            { InvalidArgumentException.raise() };\n        \n        if (node.containsProperty(mssg Leaf))\n        { \n            list.append(node.Leaf) \n        }\n        else\n        {\n            self.readLeaves(list, node.Left);\n            self.readLeaves(list, node.Right)\n        }\n    }        \n    \n    readLeaves(list)\n        <= readLeaves(list,_tree);\n}\n\n// --- Game ---\n\nclass TwentyFourGame\n{\n    object theNumbers;\n    \n    constructor()\n    {\n        self.newPuzzle();\n    }\n    \n    newPuzzle()\n    {\n        theNumbers\u00a0:= new object[]\n        {\n            1 + randomGenerator.nextInt(9), \n            1 + randomGenerator.nextInt(9), \n            1 + randomGenerator.nextInt(9), \n            1 + randomGenerator.nextInt(9)\n        }\n    }\n    \n    help()\n    {\n        console \n            .printLine(\"------------------------------- Instructions ------------------------------\")\n            .printLine(\"Four digits will be displayed.\")\n            .printLine(\"Enter an equation using all of those four digits that evaluates to 24\")\n            .printLine(\"Only * / + - operators and () are allowed\")\n            .printLine(\"Digits can only be used once, but in any order you need.\")\n            .printLine(\"Digits cannot be combined - i.e.: 12 + 12 when given 1,2,2,1 is not allowed\")\n            .printLine(\"Submit a blank line to skip the current puzzle.\")\n            .printLine(\"Type 'q' to quit\")\n            .writeLine()\n            .printLine(\"Example: given 2 3 8 2, answer should resemble 8*3-(2-2)\")\n            .printLine(\"------------------------------- --------------------------------------------\")\n    }\n    \n    prompt()\n    {\n        theNumbers.forEach::(n){ console.print(n,\" \") };\n        \n        console.print(\": \")\n    }\n    \n    resolve(expr)\n    {\n        var tree\u00a0:= new ExpressionTree(expr);\n        \n        var leaves\u00a0:= new ArrayList();\n        tree.readLeaves(leaves);\n        \n        ifnot (leaves.ascendant().sequenceEqual(theNumbers.ascendant()))\n            { console.printLine(\"Invalid input. Enter an equation using all of those four digits. Try again.\"); ^ self };\n            \n        var result\u00a0:= tree.Value;\n        if (result == 24)\n        {\n            console.printLine(\"Good work. \",expr,\"=\",result);\n            \n            self.newPuzzle()\n        }\n        else\n        {\n            console.printLine(\"Incorrect. \",expr,\"=\",result)\n        }\n    }    \n}\n\nextension gameOp\n{\n    playRound(expr)\n    {\n        if (expr == \"q\")\n        {\n            ^ false\n        }\n        else\n        {\n            if (expr == \"\")\n            {\n                console.printLine(\"Skipping this puzzle\"); self.newPuzzle()\n            }\n            else\n            {\n                try\n                {\n                    self.resolve(expr)\n                }\n                catch(Exception e)\n                {\n                    console.printLine(e)\n                    //console.printLine:\"An error occurred.  Check your input and try again.\"\n                }\n            };\n                \n            ^ true\n        }\n    }\n}\n\n// --- program ---\n\npublic program()\n{\n    var game\u00a0:= new TwentyFourGame().help();\n\n    while (game.prompt().playRound(console.readLine())) {}\n}",
        "safe": true
    },
    {
        "filename": "24 game_46.txt",
        "content": "------------------------------- Instructions ------------------------------\nFour digits will be displayed.\nEnter an equation using all of those four digits that evaluates to 24\nOnly * / + - operators and () are allowed\nDigits can only be used once, but in any order you need.\nDigits cannot be combined - i.e.: 12 + 12 when given 1,2,2,1 is not allowed\nSubmit a blank line to skip the current puzzle.\nType 'q' to quit\n\nExample: given 2 3 8 2, answer should resemble 8*3-(2-2)\n------------------------------- --------------------------------------------\n7 6 9 6\u00a0:\nSkipping this puzzle\n8 6 2 6\u00a0: 6*6-8-2\nIncorrect. 6*6-8-2=26.0\n8 6 2 6\u00a0:\nSkipping this puzzle\n5 2 7 7\u00a0: 7+7+(5*2)\nGood work. 7+7+(5*2)=24.0\n",
        "safe": true
    },
    {
        "filename": "24 game_47.txt",
        "content": "defmodule Game24 do\n  def main do\n    IO.puts \"24 Game\"\n    play\n  end\n  \n  defp play do\n    IO.puts \"Generating 4 digits...\"\n    digts = for _ <- 1..4, do: Enum.random(1..9)\n    IO.puts \"Your digits\\t#{inspect digts, char_lists: :as_lists}\"\n    read_eval(digts)\n    play\n  end\n  \n  defp read_eval(digits) do\n    exp = IO.gets(\"Your expression: \") |> String.strip\n    if exp in [\"\",\"q\"], do: exit(:normal)        # give up\n    case {correct_nums(exp, digits), eval(exp)} do\n      {:ok, x} when x==24 -> IO.puts \"You Win!\"\n      {:ok, x} -> IO.puts \"You Lose with #{inspect x}!\"\n      {err, _} -> IO.puts \"The following numbers are wrong: #{inspect err, char_lists: :as_lists}\"\n    end\n  end\n  \n  defp correct_nums(exp, digits) do\n    nums = String.replace(exp, ~r/\\D/, \" \") |> String.split |> Enum.map(&String.to_integer &1)\n    if length(nums)==4 and (nums--digits)==[], do: :ok, else: nums\n  end\n  \n  defp eval(exp) do\n    try do\n      Code.eval_string(exp) |> elem(0)\n    rescue\n      e -> Exception.message(e)\n    end\n  end\nend\n\nGame24.main\n",
        "safe": true
    },
    {
        "filename": "24 game_48.txt",
        "content": "24 Game\nGenerating 4 digits...\nYour digits     [9, 6, 7, 4]\nYour expression: (9+7)*6/4\nYou Win!\nGenerating 4 digits...\nYour digits     [3, 2, 2, 4]\nYour expression: 3*(2+2+4)\nYou Win!",
        "safe": true
    },
    {
        "filename": "24 game_49.txt",
        "content": "-module(g24).\n-export([main/0]).\n\nmain() ->\n    random:seed(now()),\n    io:format(\"24 Game~n\"),\n    play().\n\nplay() ->\n    io:format(\"Generating 4 digits...~n\"),\n    Digts = [random:uniform(X) || X <- [9,9,9,9]],\n    io:format(\"Your digits\\t~w~n\", [Digts]),\n    read_eval(Digts),\n    play().\n\nread_eval(Digits) ->\n    Exp = string:strip(io:get_line(standard_io, \"Your expression: \"), both, $\\n),\n    case {correct_nums(Exp, Digits), eval(Exp)} of\n        {ok, X} when X == 24 -> io:format(\"You Win!~n\");\n        {ok, X} -> io:format(\"You Lose with ~p!~n\",[X]);\n        {List, _} -> io:format(\"The following numbers are wrong: ~p~n\", [List])\n    end.\n\ncorrect_nums(Exp, Digits) ->\n    case re:run(Exp, \"([0-9]+)\", [global, {capture, all_but_first, list}]) of\n        nomatch ->\n            \"No number entered\";\n        {match, IntLs} ->\n            case [X || [X] <- IntLs, not lists:member(list_to_integer(X), Digits)] of\n                [] -> ok;\n                L -> L\n            end\n    end.\n\neval(Exp) ->\n    {X, _} = eval(re:replace(Exp, \"\\\\s\", \"\", [{return, list},global]),\n                  0),\n    X.\n\neval([], Val) ->\n    {Val,[]};\neval([$(|Rest], Val) ->\n    {NewVal, Exp} = eval(Rest, Val),\n    eval(Exp, NewVal);\neval([$)|Rest], Val) ->\n    {Val, Rest};\neval([$[|Rest], Val) ->\n    {NewVal, Exp} = eval(Rest, Val),\n    eval(Exp, NewVal);\neval([$]|Rest], Val) ->\n    {Val, Rest};\neval([$+|Rest], Val) ->\n    {NewOperand, Exp} = eval(Rest, 0),\n    eval(Exp, Val + NewOperand);\neval([$-|Rest], Val) ->\n    {NewOperand, Exp} = eval(Rest, 0),\n    eval(Exp, Val - NewOperand);\neval([$*|Rest], Val) ->\n    {NewOperand, Exp} = eval(Rest, 0),\n    eval(Exp, Val * NewOperand);\neval([$/|Rest], Val) ->\n    {NewOperand, Exp} = eval(Rest, 0),\n    eval(Exp, Val / NewOperand);\neval([X|Rest], 0) when X >= $1, X =< $9 ->\n    eval(Rest, X-$0).\n",
        "safe": true
    },
    {
        "filename": "24 game_5.txt",
        "content": "24 Game\n- Enter Q to Quit\n- Enter N for New digits\nNote: Operators are evaluated left-to-right\n      (use parentheses to override)\nGenerating 4 digits...\nYour Digits: 2 9 5 9\nEnter your Expression: 9+9+5-2\nValue 21.000 is not 24!\nYour Digits: 2 9 5 9\nEnter your Expression: N\nGenerating 4 digits...\nYour Digits: 7 7 1 3\nEnter your Expression: (7-1)*(7-3)\nYou won!\nEnter N for a new game, or try another solution.",
        "safe": true
    },
    {
        "filename": "24 game_50.txt",
        "content": "9 + 1 = 10\n10 * 2 = 20\n2 + 2 = 4\n20 + 4\n",
        "safe": true
    },
    {
        "filename": "24 game_51.txt",
        "content": "1> c(g24).    \n{ok,g24}\n2> g24:main().\n24 Game\nGenerating 4 digits...\nYour digits     [7,4,6,8]\nYour expression: 6*4\nYou Win!\nGenerating 4 digits...\nYour digits     [4,1,5,8]\nYour expression: 6*4\nThe following numbers are wrong: [\"6\"]\nGenerating 4 digits...\nYour digits     [8,5,8,2]\nYour expression: 2*([8/5]*2)\nYou Lose with 6.4!\nGenerating 4 digits...\nYour digits     [7,4,8,1]",
        "safe": true
    },
    {
        "filename": "24 game_52.txt",
        "content": "open System\nopen System.Text.RegularExpressions\n\n// Some utilities\nlet (|Parse|_|) regex str =\n   let m = Regex(regex).Match(str)\n   if m.Success then Some ([for g in m.Groups -> g.Value]) else None\nlet rec gcd x y = if x = y || x = 0 then y else if x < y then gcd y x else gcd y (x-y)\nlet abs (x : int) = Math.Abs x\nlet sign (x: int) = Math.Sign x\nlet cint s = Int32.Parse(s)\nlet replace m (s : string) t = Regex.Replace(t, m, s)\n\n// computing in Rationals\ntype Rat(x : int, y : int) =\n    let g = if y <> 0 then gcd (abs x) (abs y) else raise <| DivideByZeroException()\n    member this.n = sign y * x / g   // store a minus sign in the numerator\n    member this.d =\n        if y <> 0 then sign y * y / g else raise <| DivideByZeroException()\n    static member (~-) (x : Rat) = Rat(-x.n, x.d)\n    static member (+) (x : Rat, y : Rat) = Rat(x.n * y.d + y.n * x.d, x.d * y.d)\n    static member (-) (x : Rat, y : Rat) = x + Rat(-y.n, y.d)\n    static member (*) (x : Rat, y : Rat) = Rat(x.n * y.n, x.d * y.d)\n    static member (/) (x : Rat, y : Rat) = x * Rat(y.d, y.n)\n    override this.ToString() = sprintf @\"<%d,%d>\" this.n this.d\n    new(x : string, y : string) = if y = \"\" then Rat(cint x, 1) else Rat(cint x, cint y)\n\n// Due to the constraints imposed by the game (reduced set\n// of operators, all left associativ) we can get away with a repeated reduction\n// to evaluate the algebraic expression.\nlet rec reduce (str :string) =\n    let eval (x : Rat) (y : Rat) = function\n    | \"*\" -> x * y | \"/\" -> x / y | \"+\" -> x + y | \"-\" -> x - y | _ -> failwith \"unknown op\"\n    let subst s r = str.Replace(s, r.ToString())\n    let rstr =\n        match str with\n        | Parse @\"\\(<(-?\\d+),(\\d+)>([*/+-])<(-?\\d+),(\\d+)>\\)\" [matched; xn; xd; op; yn; yd] -> \n            subst matched <| eval (Rat(xn,xd)) (Rat(yn,yd)) op\n        | Parse @\"<(-?\\d+),(\\d+)>([*/])<(-?\\d+),(\\d+)>\" [matched; xn; xd; op; yn; yd] -> \n            subst matched <| eval (Rat(xn,xd)) (Rat(yn,yd)) op\n        | Parse @\"<(-?\\d+),(\\d+)>([+-])<(-?\\d+),(\\d+)>\" [matched; xn; xd; op; yn; yd] -> \n            subst matched <| eval (Rat(xn,xd)) (Rat(yn,yd)) op\n        | Parse @\"\\(<(-?\\d+),(\\d+)>\\)\" [matched; xn; xd] -> \n            subst matched <| Rat(xn,xd)\n        | Parse @\"(?<!>)-<(-?\\d+),(\\d+)>\" [matched; xn; xd] -> \n            subst matched <| -Rat(xn,xd)\n        | _ -> str\n    if str = rstr then str else reduce rstr\n\nlet gameLoop() =\n    let checkInput dddd input =\n        match input with\n        | \"n\" | \"q\" -> Some(input)\n        | Parse @\"[^1-9()*/+-]\" [c] ->\n            printfn \"You used an illegal character in your expression: %s\" c\n            None\n        | Parse @\"^\\D*(\\d)\\D+(\\d)\\D+(\\d)\\D+(\\d)(?:\\D*(\\d))*\\D*$\" [m; d1; d2; d3; d4; d5] ->\n            if d5 = \"\" && (String.Join(\" \", Array.sort [|d1;d2;d3;d4|])) = dddd then Some(input)\n            elif d5 = \"\" then\n                printfn \"Use this 4 digits with operators in between: %s.\" dddd\n                None\n            else \n                printfn \"Use only this 4 digits with operators in between: %s.\" dddd\n                None\n        | _ ->\n            printfn \"Use all 4 digits with operators in between: %s.\" dddd\n            None\n        \n    let rec userLoop dddd  =\n        let tryAgain msg =\n            printfn \"%s\" msg\n            userLoop dddd\n        printf \"[Expr|n|q]: \"\n        match Console.ReadLine() |> replace @\"\\s\" \"\" |> checkInput dddd with\n        | Some(input) -> \n            let data = input |> replace @\"((?<!\\d)-)?\\d+\" @\"<$&,1>\"\n            match data with\n            | \"n\" -> true | \"q\" -> false\n            | _ ->\n                try\n                    match reduce data with\n                    | Parse @\"^<(-?\\d+),(\\d+)>$\" [_; x; y] ->\n                        let n, d = (cint x), (cint y)\n                        if n = 24 then\n                            printfn \"Correct!\"\n                            true\n                        elif d=1 then tryAgain <| sprintf \"Wrong! Value = %d.\" n\n                        else tryAgain <| sprintf \"Wrong! Value = %d/%d.\" n d\n                    | _ -> tryAgain \"Wrong! not a well-formed expression!\"\n                with\n                    | :? System.DivideByZeroException ->\n                        tryAgain \"Wrong! Your expression results in a division by zero!\"\n                    | ex ->\n                        tryAgain <| sprintf \"There is an unforeseen problem with yout input: %s\" ex.Message\n        | None -> userLoop dddd\n\n    let random = new Random(DateTime.Now.Millisecond)\n    let rec loop() =\n        let dddd = String.Join(\" \", Array.init 4 (fun _ -> 1 + random.Next 9) |> Array.sort)\n        printfn \"\\nCompute 24 from the following 4 numbers: %s\" dddd\n        printfn \"Use them in any order with * / + - and parentheses; n = new numbers; q = quit\"\n        if userLoop dddd then loop()\n\n    loop()\n\ngameLoop()\n",
        "safe": true
    },
    {
        "filename": "24 game_53.txt",
        "content": "Compute 24 from the following 4 numbers: 3 3 3 5\nUse them in any order with * / + - and parentheses; n = new numbers; q = quit\n[Expr|n|q]: n\n\nCompute 24 from the following 4 numbers: 3 5 6 7\nUse them in any order with * / + - and parentheses; n = new numbers; q = quit\n[Expr|n|q]: (7 + 5) + 6/3\nWrong! Value = 14.\n[Expr|n|q]: (7 + 5) * 6/3\nCorrect!\n\nCompute 24 from the following 4 numbers: 3 3 4 5\nUse them in any order with * / + - and parentheses; n = new numbers; q = quit\n[Expr|n|q]: q\n",
        "safe": true
    },
    {
        "filename": "24 game_54.txt",
        "content": "USING:\n    combinators.short-circuit\n    continuations\n    eval\n    formatting\n    fry\n    kernel\n    io\n    math math.ranges\n    prettyprint\n    random\n    sequences\n    sets ;\nIN: 24game\n\n: choose4 ( -- seq )\n    4 [ 9 [1,b] random ] replicate ;\n\n: step ( numbers -- ? )\n    readln\n    [\n        parse-string\n        {\n            ! Is only allowed tokens used?\n            [ swap { + - / * } append subset? ]\n            ! Digit count in expression should be equal to the given numbers.\n            [ [ number? ] count swap length = ]\n            ! Of course it must evaluate to 24\n            [ nip call( -- x ) 24 = ]\n        } 2&&\n        [ f \"You got it!\" ]\n        [ t \"Expression isnt valid, or doesnt evaluate to 24.\" ]\n        if\n    ]\n    [ 3drop f \"Could not parse that.\" ]\n    recover print flush ;\n\n: main ( -- )\n    choose4\n    [ \"Your numbers are\u00a0%[%s,\u00a0%], make an expression\\n\" printf flush ]\n    [ '[ _ step ] loop ]\n    bi ;\n",
        "safe": true
    },
    {
        "filename": "24 game_55.txt",
        "content": "IN: scratchpad main\nYour numbers are { 4, 1, 8, 2 }, make an expression\n8 4 + 2 * 1 /\nYou got it!\n",
        "safe": true
    },
    {
        "filename": "24 game_56.txt",
        "content": "load compiler\n\nfunction genRandomNumbers( amount )\n  rtn = []\n  for i in [ 0\u00a0: amount ]: rtn += random( 1, 9 )\n  return( rtn )\nend\n\nfunction getAnswer( exp )\n  ic = ICompiler()\n  ic.compileAll(exp)\n\n  return( ic.result )\nend\n\nfunction validInput( str )\n  for i in [ 0\u00a0: str.len() ]\n    if str[i] notin ' ()[]0123456789-+/*'\n      > 'INVALID Character = ', str[i]\n      return( false )\n    end\n  end\n\n  return( true )\nend\n\nprintl('\nThe 24 Game\n\nGiven any four digits in the range 1 to 9, which may have repetitions,\nUsing just the +, -, *, and / operators; and the possible use of\nbrackets, (), show how to make an answer of 24.\n\nAn answer of \"q\" will quit the game.\nAn answer of \"!\" will generate a new set of four digits.\nOtherwise you are repeatedly asked for an expression until it evaluates to 24\n\nNote: you cannot form multiple digit numbers from the supplied digits,\nso an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\n')\n\nnum = genRandomNumbers( 4 )\n\nwhile( true )\n\n  >>  \"Here are the numbers to choose from: \"\n  map({ a => print(a, \" \") }, num)\n  >\n\n  exp = input()\n\n  switch exp\n    case \"q\", \"Q\"\n      exit()\n\n    case \"!\"\n      > 'Generating new numbers list'\n      num = genRandomNumbers( 4 )\n\n    default\n      if not validInput( exp ): continue\n\n      answer = getAnswer( exp )\n\n      if answer == 24\n        > \"By George you GOT IT! Your expression equals 24\"\n      else\n        > \"Ahh Sorry, So Sorry your answer of \", answer, \" does not equal 24.\"\n      end\n  end\nend",
        "safe": true
    },
    {
        "filename": "24 game_57.txt",
        "content": "program game_24\n  implicit none\n  real               :: vector(4), reals(11), result, a, b, c, d\n  integer            :: numbers(4), ascii(11), i\n  character(len=11)  :: expression\n  character          :: syntax(11)\n  ! patterns:\n  character, parameter :: one(11)   = (/ '(','(','1','x','1',')','x','1',')','x','1' /)\n  character, parameter :: two(11)   = (/ '(','1','x','(','1','x','1',')',')','x','1' /)\n  character, parameter :: three(11) = (/ '1','x','(','(','1','x','1',')','x','1',')' /)\n  character, parameter :: four(11)  = (/ '1','x','(','1','x','(','1','x','1',')',')' /)\n  character, parameter :: five(11)  = (/ '(','1','x','1',')','x','(','1','x','1',')' /)\n  \n  do\n    call random_number(vector)\n    numbers = 9 * vector + 1\n    write (*,*) 'Digits: ',numbers\n    write (*,'(a)',advance='no') 'Your expression: '\n    read (*,'(a11)') expression\n\n    forall (i=1:11) syntax(i) = expression(i:i)\n    ascii = iachar(syntax)\n    where (syntax >= '0' .and. syntax <= '9')\n      syntax = '1'  ! number\n    elsewhere (syntax == '+' .or. syntax == '-' .or. syntax == '*' .or. syntax == '/')\n      syntax = 'x'  ! op\n    elsewhere (syntax /= '(' .and. syntax /= ')')\n      syntax = '-'  ! error\n    end where\n\n    reals = real(ascii-48)\n    if ( all(syntax == one) ) then\n      a = reals(3); b = reals(5); c = reals(8); d = reals(11)\n      call check_numbers(a,b,c,d)\n      result = op(op(op(a,4,b),7,c),10,d)\n    else if ( all(syntax == two) ) then\n      a = reals(2); b = reals(5); c = reals(7); d = reals(11)\n      call check_numbers(a,b,c,d)\n      result = op(op(a,3,op(b,6,c)),10,d)\n    else if ( all(syntax == three) ) then\n      a = reals(1); b = reals(5); c = reals(7); d = reals(10)\n      call check_numbers(a,b,c,d)\n      result = op(a,2,op(op(b,6,c),9,d))\n    else if ( all(syntax == four) ) then\n      a = reals(1); b = reals(4); c = reals(7); d = reals(9)\n      call check_numbers(a,b,c,d)\n      result = op(a,2,op(b,5,op(c,8,d)))\n    else if ( all(syntax == five) ) then\n      a = reals(2); b = reals(4); c = reals(8); d = reals(10)\n      call check_numbers(a,b,c,d)\n      result = op(op(a,3,b),6,op(c,9,d))\n    else\n      stop 'Input string: incorrect syntax.'\n    end if\n\n    if ( abs(result-24.0) < epsilon(1.0) ) then\n      write (*,*) 'You won!'\n    else\n      write (*,*) 'Your result (',result,') is incorrect!'\n    end if\n  \n    write (*,'(a)',advance='no') 'Another one? [y/n] '\n    read (*,'(a1)') expression\n    if ( expression(1:1) == 'n' .or. expression(1:1) == 'N' ) then\n      stop\n    end if  \n  end do\n  \ncontains\n\n  pure real function op(x,c,y)\n    integer, intent(in) :: c\n    real, intent(in) :: x,y\n    select case ( char(ascii(c)) )\n      case ('+')\n        op = x+y\n      case ('-')\n        op = x-y\n      case ('*')\n        op = x*y\n      case ('/')\n        op = x/y\n    end select\n  end function op\n  \n  subroutine check_numbers(a,b,c,d)\n    real, intent(in) :: a,b,c,d\n    integer          :: test(4)\n    test = (/ nint(a),nint(b),nint(c),nint(d) /)\n    call Insertion_Sort(numbers)\n    call Insertion_Sort(test)\n    if ( any(test /= numbers) ) then\n      stop 'You cheat\u00a0;-) (Incorrect numbers)'\n    end if\n  end subroutine check_numbers\n  \n  pure subroutine Insertion_Sort(a)\n    integer, intent(inout) :: a(:)\n    integer                :: temp, i, j\n    do i=2,size(a)\n      j = i-1\n      temp = a(i)\n      do while ( j>=1 .and. a(j)>temp )\n        a(j+1) = a(j)\n        j = j - 1\n      end do\n      a(j+1) = temp\n    end do\n  end subroutine Insertion_Sort\n\nend program game_24\n",
        "safe": true
    },
    {
        "filename": "24 game_58.txt",
        "content": "! implement a recursive descent parser\nmodule evaluate_algebraic_expression\n\n  integer, parameter :: size = 124\n  character, parameter :: statement_end = achar(0)\n  character(len=size) :: text_to_parse\n  integer :: position\n  data position/0/,text_to_parse/' '/\n\ncontains\n\n  character function get_token()\n    ! return the current token\n    implicit none\n    if (position <= size) then\n       get_token = text_to_parse(position:position)\n       do while (get_token <= ' ')\n          call advance\n          if (size < position) exit\n          get_token = text_to_parse(position:position)\n       end do\n    end if\n    if (size < position) get_token = statement_end\n  end function get_token\n\n  subroutine advance ! consume a token.  Move to the next token.  consume_token would have been a better name.\n    position = position + 1    \n  end subroutine advance\n  \n  logical function unfinished()\n    unfinished = get_token() /= statement_end\n  end function unfinished\n\n  subroutine parse_error()\n    write(6,*)'\"'//get_token()//'\" unexpected in expression at',position\n    stop 1\n  end subroutine parse_error\n\n  function precedence3() result(a)\n    implicit none\n    real :: a\n    character :: token\n    character(len=10), parameter :: digits = '0123456789'\n    token = get_token()\n    if (verify(token,digits) /= 0) call parse_error()\n    a = index(digits, token) - 1\n    call advance()\n  end function precedence3\n\n  recursive function precedence2() result(a)\n    real :: a\n    character :: token\n    token = get_token()\n    if (token /= '(') then\n       a = precedence3()\n    else\n       call advance\n       a = precedence0()\n       token = get_token()\n       if (token /= ')') call parse_error()\n       call advance\n    end if\n  end function precedence2\n\n  recursive function precedence1() result(a)\n    implicit none\n    real :: a\n    real, dimension(2) :: argument\n    character(len=2), parameter :: tokens = '*/'\n    character :: token\n    a = 0\n    token = get_token()\n    argument(1) = precedence2()\n    token = get_token()\n    do while (verify(token,tokens) == 0)\n       call advance()\n       argument(2) = precedence2()\n       if (token == '/') argument(2) = 1 / argument(2)\n       argument(1) = product(argument)       \n       token = get_token()\n    end do\n    a = argument(1)\n  end function precedence1\n\n  recursive function precedence0() result(a)\n    implicit none\n    real :: a\n    real, dimension(2) :: argument\n    character(len=2), parameter :: tokens = '+-'\n    character :: token\n    a = 0\n    token = get_token()\n    argument(1) = precedence1()\n    token = get_token()\n    do while (verify(token,tokens) == 0)\n       call advance()\n       argument(2) = precedence1()\n       if (token == '-') argument = argument * (/1, -1/)\n       argument(1) = sum(argument)\n       token = get_token()\n    end do\n    a = argument(1)\n  end function precedence0\n\n  real function statement()\n    implicit none\n    if (unfinished()) then\n       statement = precedence0()\n    else                        !empty okay\n       statement = 0\n    end if\n    if (unfinished()) call parse_error()\n  end function statement\n\n  real function evaluate(expression)\n    implicit none\n    character(len=*), intent(in) :: expression\n    text_to_parse = expression\n    evaluate = statement()\n  end function evaluate\n  \nend module evaluate_algebraic_expression\n\n\nprogram g24\n  use evaluate_algebraic_expression\n  implicit none\n  integer, dimension(4) :: digits\n  character(len=78) :: expression\n  real :: result\n  ! integer\u00a0:: i\n  call random_seed!easily found internet examples exist to seed by /dev/urandom or time\n  call deal(digits)\n  ! do i=1, 9999\u00a0! produce the data to test digit distribution\n  !   call deal(digits)\n  !   write(6,*) digits\n  ! end do\n  write(6,'(a13,4i2,a26)')'Using digits',digits,', and the algebraic dyadic'\n  write(6,*)'operators +-*/() enter an expression computing 24.'\n  expression = ' '\n  read(5,'(a78)') expression\n  if (invalid_digits(expression, digits)) then\n     write(6,*)'invalid digits'\n  else\n     result = evaluate(expression)\n     if (nint(result) == 24) then\n        write(6,*) result, ' close enough'\n     else\n        write(6,*) result, ' no good'\n     end if\n  end if\n\ncontains\n\n  logical function invalid_digits(e,d) !verify the digits\n    implicit none\n    character(len=*), intent(in) :: e\n    integer, dimension(4), intent(inout) :: d\n    integer :: i, j, k, count\n    logical :: unfound\n    count = 0\n    invalid_digits = .false. !validity assumed\n    !write(6,*)'expression:',e(1:len_trim(e))\n    do i=1, len_trim(e)\n       if (verify(e(i:i),'0123456789') == 0) then\n          j = index('0123456789',e(i:i))-1\n          unfound = .true.\n          do k=1, 4\n             if (j == d(k)) then\n                unfound = .false.\n                exit\n             end if\n          end do\n          if (unfound) then\n             invalid_digits = .true.\n             !return or exit is okay here\n          else\n             d(k) = -99\n             count = count + 1\n          end if\n       end if\n    end do\n    invalid_digits = invalid_digits .or. (count /= 4)\n  end function invalid_digits\n\n  subroutine deal(digits)\n    implicit none\n    integer, dimension(4), intent(out) :: digits\n    integer :: i\n    real :: harvest\n    call random_number(harvest)\n    do i=1, 4\n       digits(i) = int(mod(harvest*9**i, 9.0))   + 1\n    end do\n    !    NB. computed with executable Iverson notation, www.jsoftware.oom\n    !    #B NB. B are the digits from 9999 deals\n    ! 39996\n    !    ({.,#)/.~/:~B  # show the distribution of digits\n    ! 0 4380\n    ! 1 4542\n    ! 2 4348\n    ! 3 4395\n    ! 4 4451\n    ! 5 4474\n    ! 6 4467\n    ! 7 4413\n    ! 8 4526\n    !    NB. this also shows that I forgot to add 1.  Inserting now...\n  end subroutine deal\nend program g24\n",
        "safe": true
    },
    {
        "filename": "24 game_59.txt",
        "content": "$ gfortran -g -O0 -std=f2008 -Wall f.f08 -o f.exe && echo '8*(9/9+2)' | ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n   24.000000      close enough\n$ \n$ \n$ \n$ ./f.exe \n$  Using digits 9 9 8 2, and the algebraic dyadic\n$  operators +-*/() enter an expression computing 24.\n$     8 *   ( 9 / 9  +    2   )\n$    24.000000      close enough\n$ \n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n(((2+8+9+9)))\n   28.000000      no good\n$ \n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n(((8+9-2+9)))\n   24.000000      close enough\n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n8929\n \"9\" unexpected in expression at           2\nSTOP 1\n$ \n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n12348\n invalid digits\n$ \n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n892\n invalid digits\n$ \n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n8921\n invalid digits\n$ \n$ \n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n89291\n invalid digits\n$ \n$ \n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n9+x-2+8+9\n \"x\" unexpected in expression at           3\nSTOP 1\n$ \n$ \n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n(9-2)+8+(9\n \"^@\" unexpected in expression at         125\nSTOP 1\n$ \n$ \n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n(9-2)+8+(9)\n   24.000000      close enough\n$ \n$ \n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n(9-2)+8/(9)\n   7.8888888      no good\n$ \n",
        "safe": true
    },
    {
        "filename": "24 game_6.txt",
        "content": "BEGIN # play the 24 game - present the user with 4 digits and invite them to  #\n      # enter an expression using the digits that evaluates to 24             #\n\n    [ 0\u00a0: 9 ]INT expression digits;          # the digits entered by the user #\n    [ 0\u00a0: 9 ]INT puzzle digits;                   # the digits for the puzzle #\n    PROC eval = ( STRING expr )REAL:              # parses and evaluates expr #\n         BEGIN\n            # syntax: expression = term ( ( \"+\" | \"-\" ) term )*               #\n            #         term       = factor ( ( \"*\" | \"/\" ) factor ) *          #\n            #         factor     = \"0\" | \"1\" | \"2\" | ... | \"9\"                #\n            #                    | \"(\" expression \")\"                         #\n            INT  x pos\u00a0:= LWB expr - 1;\n            INT  x end\u00a0:= UPB expr;\n            BOOL ok   \u00a0:= TRUE;\n            PROC error = ( STRING msg )VOID:\n                 IF ok THEN                        # this is the firstt error #\n                    ok\u00a0:= FALSE;\n                    print( ( msg, newline ) );\n                    x pos\u00a0:= x end + 1\n                 FI # error #\u00a0;                    \n            PROC curr ch = CHAR: IF x pos > x end THEN REPR 0 ELSE expr[ x pos ] FI;\n            PROC next ch = VOID: WHILE x pos +:= 1; curr ch = \" \" DO SKIP OD;\n            PROC factor = REAL:\n                 IF curr ch >= \"0\" AND curr ch <= \"9\" THEN\n                    INT  digit  = ABS curr ch - ABS \"0\";\n                    REAL result = digit;\n                    expression digits[ digit ] +:= 1;\n                    next ch;\n                    result\n                 ELIF curr ch = \"(\" THEN\n                    next ch;\n                    REAL result = expression;\n                    IF curr ch = \")\" THEN\n                        next ch\n                    ELSE\n                        error( \"\"\")\"\" expected after sub-expression\" )\n                    FI;\n                    result\n                 ELSE\n                    error( \"Unexpected \"\"\" + curr ch + \"\"\"\" );\n                    0\n                 FI # factor #\u00a0;\n            PROC expr term = REAL:\n                 BEGIN\n                    REAL result\u00a0:= factor;\n                    WHILE curr ch = \"*\" OR curr ch = \"/\" DO\n                        CHAR op = curr ch;\n                        next ch;\n                        IF op = \"*\" THEN result *:= factor ELSE result /:= factor FI\n                    OD;\n                    result\n                 END # expr term #\u00a0;\n            PROC expression = REAL:\n                 BEGIN\n                    REAL result\u00a0:= expr term;\n                    WHILE curr ch = \"+\" OR curr ch = \"-\" DO\n                        CHAR op = curr ch;\n                        next ch;\n                        IF op = \"+\" THEN result +:= expr term ELSE result -:= expr term FI\n                    OD;\n                    result\n                 END # expression #\u00a0;\n\n            next ch;\n            IF curr ch = REPR 0 THEN\n                error( \"Missing expression\" );\n                0\n            ELSE\n                REAL result = expression;\n                IF curr ch /= REPR 0 THEN\n                   error( \"Unexpected text: \"\"\" + expr[ x pos\u00a0: ] + \"\"\" after expression\" )\n                FI;\n                result\n            FI\n         END # eval #\u00a0;\n\n    WHILE\n        FOR i FROM 0 TO 9 DO                   # initialise the digit counts #\n            expression digits[ i ]\u00a0:= 0;\n            puzzle digits[     i ]\u00a0:= 0\n        OD;\n        print( ( \"Enter an expression using these digits:\" ) );\n        TO 4 DO                                       # pick 4 random digits #\n            INT digit\u00a0:= 1 + ENTIER ( next random * 9 );\n            IF digit > 9 THEN digit\u00a0:= 9 FI;\n            puzzle digits[ digit ] +:= 1;\n            print( ( whole( digit, - 2 ) ) )\n        OD;\n        print( ( \" that evaluates to 24: \" ) );\n        # get and check the expression                                       #\n        STRING expr;\n        read( ( expr, newline ) );\n        REAL result = eval( expr ); \n        BOOL same \u00a0:= TRUE;\n        FOR i FROM 0 TO 9 WHILE same\u00a0:= puzzle digits[ i ] = expression digits[ i ] DO SKIP OD;\n        IF NOT same THEN\n            print( ( \"That expression didn't contain the puzzle digits\", newline ) )\n        ELIF result = 24 THEN\n            print( ( \"Yes! That expression evaluates to 24\", newline ) )\n        ELSE\n            print( ( \"No - that expression evaluates to \", fixed( result, -8, 4 ), newline ) )\n        FI;\n        print( ( newline, \"Play again [y/n]? \" ) );\n        STRING play again;\n        read( ( play again, newline ) );\n        play again = \"y\" OR play again = \"Y\" OR play again = \"\"\n    DO SKIP OD\n\nEND",
        "safe": true
    },
    {
        "filename": "24 game_60.txt",
        "content": "' The 24 game en FreeBASIC\n\nConst operaciones = \"*/+-\"\n\nDeclare Sub Encabezado\nDeclare Function escoge4() As String\nDeclare Function quitaEspacios(cadena As String, subcadena1 As String, subcadena2 As String) As String   \nDeclare Function evaluaEntrada(cadena As String) As Integer\nDeclare Function evaluador(oper1 As Byte, oper2 As Byte, operacion As String) As Integer\n\nDim Shared As String serie, entrada, cadena\nDim As Integer resultado\n\nSub Encabezado\n    Cls: Color 15\n    Print \"The 24 Game\"\n    Print \"============\" + Chr(13) + Chr(10)\n    Print \"Dados cuatro d\u00edgitos en el rango de 1 a 9, que pueden repetirse, \"\n    Print \"usando solo los operadores aritm\u00e9ticos suma (+), resta (-), \"\n    Print \"multiplicaci\u00f3n (*) y divisi\u00f3n (/) intentar obtener un resultado de 24.\" + Chr(13) + Chr(10)\n    Print \"Use la notaci\u00f3n polaca inversa (primero los operandos y luego los operadores).\"\n    Print \"Por ejemplo: en lugar de 2 + 4, escriba 2 4 +\" + Chr(13) + Chr(10)\nEnd Sub \n\nFunction escoge4() As String\n    Dim As Byte i\n    Dim As String a, b\n    \n    Print \"Los d\u00edgitos a utilizar son:   \";\n    For i = 1 To 4\n\ta = Str(Int(Rnd*9)+1)\n\tPrint a;\"      \";\n\tb = b + a\n    Next i\n    escoge4 = b\nEnd Function\n\nFunction evaluaEntrada(cadena As String) As Integer\n    Dim As Byte oper1, oper2, n(4), i\n    Dim As String op\n    oper1 = 0: oper2 = 0: i = 0\n    \n    While cadena <> \"\"\n\top = Left(cadena, 1)\n\tentrada = Mid(cadena, 2)\t\n\tIf Instr(serie, op) Then\n\t\ti = i + 1\n\t\tn(i) = Val(op)\n        Elseif Instr(operaciones, op) Then\n\t\toper2 = n(i)\n\t\tn(i) = 0\n\t\ti = i - 1\n\t\toper1 = n(i)\n\t\tn(i) = evaluador(oper1, oper2, op)\n        Else\n\t\tPrint \"Signo no v\u00a0lido\"\n        End If\n    Wend   \n    evaluaEntrada = n(i)\nEnd Function\n\nFunction evaluador(oper1 As Byte, oper2 As Byte, operacion As String) As Integer\n    Dim As Integer t\n    \n    Select Case operacion\n    Case \"+\": t = oper1 + oper2\n    Case \"-\": t = oper1 - oper2\n    Case \"*\": t = oper1 * oper2\n    Case \"/\": t = oper1 / oper2\n    End Select\n    \n    evaluador = t\nEnd Function\n\nFunction quitaEspacios(cadena As String, subcadena1 As String, subcadena2 As String) As String   \n    Dim As Byte len1 = Len(subcadena1), len2 = Len(subcadena2)\n    Dim As Byte i\n    \n    i = Instr(cadena, subcadena1)\n    While i\n        cadena = Left(cadena, i - 1) & subcadena2 & Mid(cadena, i + len1)\n        i = Instr(i + len2, cadena, subcadena1)\n    Wend\n    quitaEspacios = cadena\nEnd Function\n\n'--- Programa Principal ---\nRandomize Timer\nDo\n    Encabezado\n    serie = escoge4\n    Print: Line Input \"Introduzca su f\u00f3rmula en notaci\u00f3n polaca inversa: \", entrada\n    entrada = quitaEspacios(entrada, \" \", \"\")\n    If (Len(entrada) <> 7) Then\n        Print \"Error en la serie introducida.\"\n    Else\n        resultado = evaluaEntrada(entrada)\n        Print \"El resultado es = \"; resultado\n        If resultado = 24 Then\n            Print \"\u00a1Correcto!\"\n        Else\n            Print \"\u00a1Error!\"\n        End If\n    End If\n    Print \"\u00bfOtra ronda? (Pulsa S para salir, u otra tecla para continuar)\"\nLoop Until (Ucase(Input(1)) = \"S\")\nEnd\n'--------------------------\n",
        "safe": true
    },
    {
        "filename": "24 game_61.txt",
        "content": "The 24 Game\n============\n\nDados cuatro d\u00edgitos en el rango de 1 a 9, que pueden repetirse,\nusando solo los operadores aritm\u00daticos suma (+), resta (-),\nmultiplicaci\u00f3n (*) y divisi\u00f3n (/) intentar obtener un resultado de 24.\n\nUse la notaci\u00f3n polaca inversa (primero los operandos y luego los operadores).\nPor ejemplo: en lugar de 2 + 4, escriba 2 4 +\n\nLos d\u00edgitos a utilizar son:   4      9      7      5\nIntroduzca su f\u00f3rmula en notaci\u00f3n polaca inversa: 49*57+-\nEl resultado es =  24\nCorrecto!\n\u00bfOtra ronda? (Pulsa S para salir, u otra tecla para continuar)\n\n",
        "safe": true
    },
    {
        "filename": "24 game_62.txt",
        "content": "ops = [\"+\", \"-\", \"*\", \"/\"]\n\nchosen = new array[[4], {|x| random[1,9]}]\nprintln[chosen]\n\nfor d = chosen.lexicographicPermute[]\n   multifor o = [ops, ops, ops]\n   {\n      str = \"((\" + d@0 + o@0 + d@1 + \")\" + o@1 + d@2 + \")\" + o@2 + d@3\n      if eval[str] == 24\n         println[str]\n      str = \"(\" + d@0 + o@0 + d@1 + \")\" + o@1 + \"(\" + d@2 + + o@2 + d@3 + \")\"\n      if eval[str] == 24\n         println[str]\n   }",
        "safe": true
    },
    {
        "filename": "24 game_63.txt",
        "content": "[9, 8, 7, 4]\n(4+8)*(9-7)\n((7+8)-9)*4\n((7-9)+8)*4\n(8+4)*(9-7)\n((8+7)-9)*4\n((8-9)+7)*4\n(8*9)/(7-4)\n(9-7)*(4+8)\n(9-7)*(8+4)\n(9*8)/(7-4)\n",
        "safe": true
    },
    {
        "filename": "24 game_64.txt",
        "content": "include resources \"24 Game Icon.icns\"\n\n#build CompilerOptions @\"-Wno-unused-variable\"\n\n_mEdit = 2\neditmenu _mEdit\n\nbegin globals\nlong gPosition\nend globals\n\nvoid local fn EraseErrorText\n  \n  CGRect r\n  r = fn CGRectMake(10, 200, 400, 15)\n  rect fill r,fn ColorBlack\n  \nend fn\n\nlocal fn ArcRandom( a as long, b as long ) as long\n  long i\n  cln i = (arc4random()%(b-a+1))+a;\nend fn = fn floor(i)\n\nlocal fn GetRandomNumbers as CFStringRef\n  \n  // 96 number groups\n  \n  CFArrayRef combos = @[\u00ac\n  \n  // The first 32 are easy\n  @\"1 2 3 4\", @\"2 4 6 8\", @\"1 2 4 8\", @\"1 3 4 6\", @\"1 2 6 8\",\n  @\"2 3 4 8\", @\"1 3 6 9\", @\"1 2 7 8\", @\"2 3 6 8\", @\"1 4 6 8\",\n  @\"2 2 3 9\", @\"3 4 6 6\", @\"2 3 3 8\", @\"1 5 6 6\", @\"2 4 4 6\",\n  @\"1 3 8 8\", @\"2 2 6 9\", @\"3 3 6 9\", @\"1 2 5 9\", @\"2 4 5 5\",\n  @\"1 3 5 9\", @\"2 2 4 9\", @\"1 2 3 6\", @\"1 2 2 9\", @\"1 2 3 9\",\n  @\"1 2 4 6\", @\"1 2 4 4\", @\"1 2 2 6\", @\"1 3 3 6\", @\"1 1 4 6\",\n  @\"1 1 2 8\", @\"1 1 3 8\",\n  // The middle 32 are medium\n  @\"1 5 5 9\", @\"4 4 6 9\", @\"2 3 7 9\",@\"3 5 8 8\", @\"1 6 6 8\",\n  @\"3 3 5 6\", @\"1 4 5 8\", @\"3 3 6 7\",@\"2 5 5 8\", @\"4 4 7 9\",\n  @\"1 5 6 9\", @\"3 3 8 9\", @\"2 6 6 7\",@\"4 5 7 8\", @\"2 2 5 9\",\n  @\"2 4 6 7\", @\"1 5 6 8\", @\"3 4 7 7\",@\"2 5 6 6\", @\"3 4 5 9\",\n  @\"1 6 7 9\", @\"2 3 7 8\", @\"1 4 6 9\",@\"2 3 5 9\", @\"3 4 4 8\",\n  @\"2 5 8 9\", @\"1 4 8 9\", @\"3 3 4 9\",@\"2 6 7 9\", @\"1 3 5 7\",\n  @\"1 3 6 6\", @\"2 2 5 7\",\n  // The last 32 are hard\n  @\"1 5 7 9\",@\"3 4 7 9\", @\"2 5 7 8\", @\"3 4 8 9\", @\"3 4 5 8\",\n  @\"2 6 6 9\",@\"4 4 5 7\", @\"2 4 6 9\", @\"1 4 7 7\", @\"2 3 8 9\",\n  @\"2 3 4 7\",@\"3 3 4 8\", @\"1 3 7 9\", @\"2 4 5 9\", @\"1 3 6 8\",\n  @\"2 4 4 9\",@\"1 5 8 9\", @\"3 3 5 9\", @\"2 6 8 9\", @\"1 4 4 7\",\n  @\"2 3 6 7\",@\"1 3 5 8\", @\"2 4 7 8\", @\"1 3 4 7\", @\"2 3 5 6\",\n  @\"1 4 5 6\",@\"3 3 5 7\", @\"2 2 3 6\", @\"3 3 7 7\", @\"3 3 7 9\",\n  @\"4 4 8 9\",@\"2 4 8 9\"]\n  \n  long i = fn ArcRandom( 0, len(combos) - 1 )\n  gPosition = i\n  \nend fn = combos[i]\n\n\nlocal fn EvaluateMath( equation as CFStringRef ) as CFStringRef\n  equation = fn StringByReplacingOccurrencesOfString( lcase(equation), @\"x\", @\"*\" )\n  \n  CFStringRef           result = NULL\n  RegularExpressionRef   regex = fn RegularExpressionWithPattern( @\"[0-9.]+\", NSRegularExpressionCaseInsensitive, NULL )\n  CFArrayRef           matches = fn RegularExpressionMatches( regex, equation, 0, fn CFRangeMake( 0, len(equation) ) )\n  NSInteger     intConversions = 0\n  TextCheckingResultRef  match\n  CFRange originalRange\n  CFRange adjustedRange\n  CFStringRef     value\n  \n  for match in matches\n    originalRange = fn TextCheckingResultRange( match )\n    adjustedRange = fn CFRangeMake( ( originalRange.location + ( intConversions * len( @\".0\") ) ), originalRange.length )\n    value = fn StringSubstringWithRange( equation, adjustedRange )\n    if fn StringContainsString( value, @\".\" )\n      continue\n    else\n      equation = fn StringByReplacingCharactersInRange( equation, adjustedRange, fn StringWithFormat( @\"%@.0\", value ) )\n      intConversions++\n    end if\n  next\n  ExceptionRef e\n  try\n    ExpressionRef expression = fn ExpressionWithFormat( equation )\n    CFNumberRef       number = fn ExpressionValueWithObject( expression, NULL, NULL )\n    result = fn StringWithFormat( @\"%.3f\", dblval( number ) )\n  end try\n  \n  catch (e)\n    result = fn StringWithFormat( @\"%@\", e )\u00a0: exit fn\n  end catch\n  // Test if result is an integer and, if so, return result as an integer\n  if( fn StringDoubleValue( result ) == fn floorf( fn StringDoubleValue( result ) ) )\n    result = fn ArrayFirstObject( fn StringComponentsSeparatedByString( result, @\".\" ) )\n  end if\nend fn = result\n\n\nlocal fn QuitOrPlayAlert(GameResult as CFStringRef)\n  alert -2,,GameResult,@\"You won!\",@\"Quit;Play Again\"\n  AlertButtonSetKeyEquivalent( 2, 2, @\"\\e\" )\n  short result\n  result = alert 2\n  if ( result\u00a0!= NSAlertSecondButtonReturn ) then appterminate\nend fn\n\n\nlocal fn BuildWindow\n  CGRect r = fn CGRectMake( 0, 0, 580, 250)\n  window 1, @\"24 Game\", r\n  windowcenter(1)\n  WindowSetBackgroundColor(1,fn ColorBlack)\n  \nend fn\n\n/////////  Start  //////////\n\nfn BuildWindow\n\n\nshort d(4), i\nCFStringRef CheckForDuplicates(97)\nfor i = 1 to 96\n  CheckForDuplicates(i) = @\"\"\nnext i\n\nshort DuplicatesCounter\nDuplicatesCounter = 0\n\n\n\"Main\"\n\ncls\ntext ,,fn colorWhite\n\nprint\nprint\u00a0%(10,15),\"Given four numbers and using just the +, -, *, and / operators; and the\"\nprint\u00a0%(10,30),\"possible use of parenthesis (), enter an expression that equates to 24.\"\nprint\u00a0%(10,45),\"You must use all your numbers and only those numbers.\"\nprint\u00a0%(10,60),\"Examples: 9618 Solution 9 + 6 + 1 + 8 or 3173 Solution (3 * 7) - (1 - 4)\"\nprint\nprint\u00a0%(10,85),\"Enter Q to quit or S to skip to the next number.\"\n\n\"GetFourNumbers\"\n\nCFArrayRef randomNumbers\u00a0: randomNumbers= fn StringComponentsSeparatedByString( fn GetRandomNumbers, @\" \" )\nCFStringRef  RandomNumberblock\u00a0: RandomNumberblock = @\"\"\nCFStringRef  RandomNumberblockAdd\u00a0: RandomNumberblockAdd = @\"\"\n\nfor i = 0 to 3\n  // create a string from the 4 numbers\n  RandomNumberblockAdd = randomNumbers[i]\n  RandomNumberblock = fn StringByAppendingString(RandomNumberblock,RandomNumberblockAdd)\n  RandomNumberblock = fn StringByAppendingString(RandomNumberblock,@\" \")\nnext i\n\n\nif DuplicatesCounter = > 96\n  // reset counter when last number is retrieved and start from the first number block\n  DuplicatesCounter = 0\n  for i = 1 to 96\n    CheckForDuplicates(i) = @\"\"\n  next i\nend if\n\nfor i = 1 to 96\n  // check the current numbers with the numbers already used\n  if fn StringIsEqual(RandomNumberblock,CheckForDuplicates(i))\n    RandomNumberblock = fn StringWithString(CheckForDuplicates(DuplicatesCounter))\n    goto \"GetFourNumbers\"\n  end if\nnext i\n\nDuplicatesCounter ++\nCheckForDuplicates(DuplicatesCounter)  = fn StringWithString(RandomNumberblock)\n\nd(1) = fn StringIntegerValue( randomNumbers[0] )\nd(2) = fn StringIntegerValue( randomNumbers[1] )\nd(3) = fn StringIntegerValue( randomNumbers[2] )\nd(4) = fn StringIntegerValue( randomNumbers[3] )\n\nshort dots = 0\n\n//d(1) = 9:d(2) = 6:d(3) = 1:d(4) = 8  // Uncomment to test with 9618 numbers. Solution 9 + 6 + 1 + 8\n//d(1) = 6:d(2) = 5:d(3) = 3:d(4) = 8  // Uncomment to test with 6538 numbers. Solution 6 / ( 5 - 3 ) * 8\n//d(1) = 3:d(2) = 1:d(3) = 7:d(4) = 3 // Uncomment to test with 3773 numbers. Solution ((3 * 1) * 7) + 3\n//d(1) = 4:d(2) = 2:d(3) = 7:d(4) = 1 // Uncomment to test with 4271 numbers. Solution (4 * ( 7 - 2 + 1 )\n// NOTE: When using these test numbers, also uncomment dots = 0 below here to prevent misleading dot displays\n\n\nif gPosition <= 32 then dots = 1\nif gPosition > 32 and gPosition < 65 then dots = 2\nif gPosition > 64 then dots = 3\n\n//dots = 0  uncomment when testing the numbers above to prevent misleading dot displays\n\nprint\ntext ,,fn colorGreen\nprint\u00a0%(15,110),\"These are your numbers, difficulty level \";\n//  @\"\\U000026AA\" is white unicode dot - Easy difficulty (One-Dot)\n//  @\"\\U0001F534\" is red unicode dot - Medium difficulty (Two-Dots)\n//  @\"\\U0001F7E1\" is yellow unicode dot - Hard difficulty (Three-Dots)\n\nif dots = 1 then print @\"\\U000026AA Easy\"\nif dots = 2 then print @\"\\U0001F534 \\U0001F534 Medium\"\nif dots = 3 then print @\"\\U0001F7E1 \\U0001F7E1 \\U0001F7E1 Hard\"\n\nprint\u00a0%(55,125)\ntext ,18,fn colorGreen\nfor i = 1 to 4\n  print d(i); \" \";\nnext\n\nprint\n\ntext ,12,fn colorWhite\nprintf @\"\\n\\n\\n\"\n\nCFStringRef expr\nbool        TryAgain\u00a0: TryAgain = _false\nCFStringRef MessageText\nCFStringRef UserInput = NULL\n\n\"InputExpression\"\n\nif TryAgain\n  MessageText = fn StringWithFormat( @\"Enter math expression: [ '%@' was incorrect ]\", expr )\n  UserInput = input\u00a0%(10, 190), MessageText, @\"123456789+-*/()qs\", YES,, 0\nelse\n  UserInput = input\u00a0%(10, 190), @\"Enter math expression:\", @\"123456789+-*/()qs\", YES,, 0\nend if\n\nif ( UserInput == NULL ) then \"InputExpression\"\nexpr = UserInput\nif expr = @\"\" then \"InputExpression\"\nif fn StringIsEqual(ucase(expr) , @\"Q\") then appterminate\nif fn StringIsEqual(ucase(expr) , @\"S\") then \"Main\"\n\n\n//check expr for validity\n\nshort                  j\nbool       GotAllNumbers\u00a0: GotAllNumbers = _false\nshort ThisNumberPosition\u00a0: ThisNumberPosition = 0\nshort         GotaNumber\u00a0: GotaNumber = 0\nshort       TotalNumbers\u00a0: TotalNumbers = 0\n\nshort ExtraNumbers:ExtraNumbers = 0\n\nfor i = 1 to len$(fn stringpascalstring(expr))\n  if asc(mid$(fn stringpascalstring(expr),i,1)) > 48 && asc(mid$(fn stringpascalstring(expr),i,1)) < 58\n    ExtraNumbers ++\n  end if\nnext i\n\nif ExtraNumbers > 4\n  fn EraseErrorText\n  text ,,fn colorRed\n  TryAgain = _true\n  print\u00a0%(10,200);\"Error! Extra numbers not allowed\": goto \"InputExpression\"\n  text ,,fn colorWhite\nend if\n\n\nfor i = 1 to 4\n  GotaNumber = 0\n  for j = 0 to len(expr) -1\n    ThisNumberPosition = instr( j, expr, right(str( d(i)),1 ))\n    ThisNumberPosition ++\n    if ThisNumberPosition then GotaNumber = _true\n  next j\n  if GotaNumber then TotalNumbers ++\nnext i\n\nif TotalNumbers => 4 then GotAllNumbers = _true\n\nif GotAllNumbers = _false\n  fn EraseErrorText\n  text ,,fn colorRed\n  TryAgain = _true\n  print\u00a0%(10,200);\"ERROR! Must use all your numbers and only those numbers.\"\u00a0: goto \"InputExpression\"\n  text ,,fn colorWhite\nend if\n\nfn EraseErrorText\n\n\nif fn EvaluateMath( expr ) = _false\n  text ,,fn colorRed\n  TryAgain = _true\n  Print\u00a0%(10,200);\"Error! Incorrect math sequence.\"\n  goto \"InputExpression\"\n  text ,,fn colorWhite\nend if\n\nCFStringRef GameResult\nif fn StringIntegerValue( fn EvaluateMath( expr ) ) == 24 then GameResult =  @\"Correct\" else GameResult =  @\"Incorrect\"\n\nif GameResult =  @\"Incorrect\"\n  TryAgain = _true\n  goto \"InputExpression\"\nend if\n\nfn QuitOrPlayAlert(GameResult)\ngoto \"Main\"\n\nhandleevents",
        "safe": true
    },
    {
        "filename": "24 game_65.txt",
        "content": "Play24 := function()\n\tlocal input, digits, line, c, chars, stack, stackptr, cur, p, q, ok, a, b, run;\n\tinput := InputTextUser();\n\trun := true;\n\twhile run do\n\t\tdigits := List([1 .. 4], n -> Random(1, 9));\n\t\twhile true do\n\t\t\tDisplay(digits);\n\t\t\tline := ReadLine(input);\n\t\t\tline := Chomp(line);\n\t\t\tif line = \"end\" then\n\t\t\t\trun := false;\n\t\t\t\tbreak;\n\t\t\telif line = \"next\" then\n\t\t\t\tbreak;\n\t\t\telse\n\t\t\t\tok := true;\n\t\t\t\tstack := [ ];\n\t\t\t\tstackptr := 0;\n\t\t\t\tchars := \"123456789+-*/ \";\n\t\t\t\tcur := ShallowCopy(digits);\n\t\t\t\tfor c in line do\n\t\t\t\t\tif c = ' ' then\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tfi;\n\t\t\t\t\tp := Position(chars, c);\n\t\t\t\t\tif p = fail then\n\t\t\t\t\t\tok := false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tfi;\n\t\t\t\t\tif p < 10 then\n\t\t\t\t\t\tq := Position(cur, p);\n\t\t\t\t\t\tif q = fail then\n\t\t\t\t\t\t\tok := false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tfi;\n\t\t\t\t\t\tUnbind(cur[q]);\n\t\t\t\t\t\tstackptr := stackptr + 1;\n\t\t\t\t\t\tstack[stackptr] := p;\n\t\t\t\t\telse\n\t\t\t\t\t\tif stackptr < 2 then\n\t\t\t\t\t\t\tok := false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tfi;\n\t\t\t\t\t\tb := stack[stackptr];\n\t\t\t\t\t\ta := stack[stackptr - 1];\n\t\t\t\t\t\tstackptr := stackptr - 1;\n\t\t\t\t\t\tif c = '+' then\n\t\t\t\t\t\t\ta := a + b;\n\t\t\t\t\t\telif c = '-' then\n\t\t\t\t\t\t\ta := a - b;\n\t\t\t\t\t\telif c = '*' then\n\t\t\t\t\t\t\ta := a * b;\n\t\t\t\t\t\telif c = '/' then\n\t\t\t\t\t\t\tif b = 0 then\n\t\t\t\t\t\t\t\tok := false;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tfi;\n\t\t\t\t\t\t\ta := a / b;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tok := false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tfi;\n\t\t\t\t\t\tstack[stackptr] := a;\n\t\t\t\t\tfi;\n\t\t\t\tod;\n\t\t\t\tif ok and stackptr = 1 and Size(cur) = 0 then\n\t\t\t\t\tif stack[1] = 24 then\n\t\t\t\t\t\tPrint(\"Good\u00a0!\\n\");\n\t\t\t\t\t\tbreak;\n\t\t\t\t\telse\n\t\t\t\t\t\tPrint(\"Bad value: \", stack[1], \"\\n\");\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tfi;\n\t\t\t\tfi;\n\t\t\t\tPrint(\"Invalid expression\\n\");\n\t\t\tfi;\n\t\tod;\n\tod;\n\tCloseStream(input);\nend;\n\n# example session\n# type \"end\" to quit the game, \"next\" to try another list of digits\ngap> Play24();\n[ 7, 6, 8, 5 ]\n86*75-/\nGood\u00a0!\n[ 5, 9, 2, 7 ]\nend\ngap>\n",
        "safe": true
    },
    {
        "filename": "24 game_66.txt",
        "content": "package main\n\nimport (\n    \"fmt\"\n    \"math\"\n    \"math/rand\"\n    \"time\"\n)\n\nfunc main() {\n    rand.Seed(time.Now().Unix())\n    n := make([]rune, 4)\n    for i := range n {\n        n[i] = rune(rand.Intn(9) + '1')\n    }\n    fmt.Printf(\"Your numbers: %c\\n\", n)\n    fmt.Print(\"Enter RPN: \")\n    var expr string\n    fmt.Scan(&expr)\n    if len(expr) != 7 {\n        fmt.Println(\"invalid. expression length must be 7.\" +\n            \" (4 numbers, 3 operators, no spaces)\")\n        return\n    }\n    stack := make([]float64, 0, 4)\n    for _, r := range expr {\n        if r >= '0' && r <= '9' {\n            if len(n) == 0 {\n                fmt.Println(\"too many numbers.\")\n                return\n            }\n            i := 0\n            for n[i] != r {\n                i++\n                if i == len(n) {\n                    fmt.Println(\"wrong numbers.\")\n                    return\n                }\n            }\n            n = append(n[:i], n[i+1:]...)\n            stack = append(stack, float64(r-'0'))\n            continue\n        }\n        if len(stack) < 2 {\n            fmt.Println(\"invalid expression syntax.\")\n            return\n        }\n        switch r {\n        case '+':\n            stack[len(stack)-2] += stack[len(stack)-1]\n        case '-':\n            stack[len(stack)-2] -= stack[len(stack)-1]\n        case '*':\n            stack[len(stack)-2] *= stack[len(stack)-1]\n        case '/':\n            stack[len(stack)-2] /= stack[len(stack)-1]\n        default:\n            fmt.Printf(\"%c invalid.\\n\", r)\n            return\n        }\n        stack = stack[:len(stack)-1]\n    }\n    if math.Abs(stack[0]-24) > 1e-6 {\n        fmt.Println(\"incorrect.\", stack[0], \"!= 24\")\n    } else {\n        fmt.Println(\"correct.\")\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_67.txt",
        "content": "Your numbers: [5 8 1 3]\nEnter RPN: 83-5*1-\ncorrect.\n",
        "safe": true
    },
    {
        "filename": "24 game_68.txt",
        "content": "uses java.lang.Double\nuses java.lang.Integer\nuses java.util.ArrayList\nuses java.util.List\nuses java.util.Scanner\nuses java.util.Stack\n\nfunction doEval( scanner : Scanner, allowed : List<Integer> ) : double {\n    var stk = new Stack<Double>()\n\n    while( scanner.hasNext() ) {\n        if( scanner.hasNextInt() ) {\n            var n = scanner.nextInt()\n\n            // Make sure they're allowed to use n\n            if( n <= 0 || n >= 10 ) {\n                print( n + \" isn't allowed\" )\n                return 0\n            }\n            var idx = allowed.indexOf( n )\n            if( idx == -1 ) {\n                print( \"You aren't allowed to use so many \" + n + \"s!\" )\n                return 0\n            }\n\n            // Add the input number to the stack\n            stk.push( new Double( n ) )\n\n            // Mark n as used\n            allowed.remove( idx )\n        } else {\n            // It has to be an operator...\n            if( stk.size() < 2 ) {\n                print( \"Invalid Expression: Stack underflow!\" )\n                return 0\n            }\n\n            // Gets the next operator as a single character token\n            var s = scanner.next(\"[\\\\+-/\\\\*]\")\n\n            // Get the operands\n            var r = stk.pop().doubleValue()\n            var l = stk.pop().doubleValue()\n\n            // Determine which operator and invoke it\n            if( s.equals( \"+\" ) ) {\n                stk.push( new Double( l + r ) )\n            } else if( s.equals( \"-\" ) ) {\n                stk.push( new Double( l - r ) )\n            } else if( s.equals( \"*\" ) ) {\n                stk.push( new Double( l * r ) )\n            } else if( s.equals( \"/\" ) ) {\n                if( r == 0.0 ) {\n                    print( \"Invalid Expression: Division by zero!\" )\n                    return 0\n                }\n                stk.push( new Double( l / r ) )\n            } else {\n                print( \"Internal Error: looking for operator yielded '\" + s + \"'\" )\n                return 0\n            }\n        }\n    }\n\n    // Did they skip any numbers?\n    if( allowed.size() != 0 ) {\n        print( \"You didn't use ${allowed}\" )\n        return 0\n    }\n\n    // Did they use enough operators?\n    if( stk.size() != 1 ) {\n        print( \"Invalid Expression: Not enough operators!\" )\n        return 0\n    }\n\n    return stk.pop().doubleValue()\n}\n\n// Pick 4 random numbers from [1..9]\nvar nums = new ArrayList<Integer>()\nvar gen = new java.util.Random( new java.util.Date().getTime() )\nfor( i in 0..3 ) {\n    nums.add( gen.nextInt(9) + 1 )\n}\n\n// Prompt the user\nprint( \"Using addition, subtraction, multiplication and division, write an\" )\nprint( \"expression that evaluates to 24 using\" )\nprint( \"${nums.get(0)}, ${nums.get(1)}, ${nums.get(2)} and ${nums.get(3)}\" )\nprint( \"\" )\nprint( \"Please enter your expression in RPN\" )\n\n// Build a tokenizer over a line of input\nvar sc = new Scanner( new java.io.BufferedReader( new java.io.InputStreamReader( java.lang.System.in ) ).readLine() )\n\n// eval the expression\nvar val = doEval( sc, nums )\n\n// winner?\nif( java.lang.Math.abs( val - 24.0 ) < 0.001 ) {\n    print( \"You win!\" )\n} else {\n    print( \"You lose!\" )\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_69.txt",
        "content": "final random = new Random()\nfinal input = new Scanner(System.in)\n\n\ndef evaluate = { expr ->\n    if (expr == 'QUIT') {\n        return 'QUIT'\n    } else {\n        try { Eval.me(expr.replaceAll(/(\\d)/, '$1.0')) }\n        catch (e) { 'syntax error' }\n    }\n}\n\n\ndef readGuess = { digits ->\n    while (true) {\n        print \"Enter your guess using ${digits} (q to quit): \"\n        def expr = input.nextLine()\n        \n        switch (expr) {\n            case ~/^[qQ].*/:\n                return 'QUIT'\n\n            case ~/.*[^\\d\\s\\+\\*\\/\\(\\)-].*/:\n                def badChars = expr.replaceAll(~/[\\d\\s\\+\\*\\/\\(\\)-]/, '')\n                println \"invalid characters in input: ${(badChars as List) as Set}\"\n                break\n\n            case { (it.replaceAll(~/\\D/, '') as List).sort() != ([]+digits).sort() }:\n                println '''you didn't use the right digits'''\n                break\n\n            case ~/.*\\d\\d.*/:\n                println 'no multi-digit numbers allowed'\n                break\n\n            default:\n                return expr\n        }\n    }\n}\n\n\ndef digits = (1..4).collect { (random.nextInt(9) + 1) as String }\n\nwhile (true) {\n    def guess = readGuess(digits)\n    def result = evaluate(guess)\n    \n    switch (result) {\n        case 'QUIT':\n            println 'Awwww. Maybe next time?'\n            return\n            \n        case 24:\n            println 'Yes! You got it.'\n            return\n            \n        case 'syntax error':\n            println \"A ${result} was found in ${guess}\" \n            break\n            \n        default:\n            println \"Nope: ${guess} == ${result}, not 24\"\n            println 'One more try, then?'\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_7.txt",
        "content": "Enter an expression using these digits: 2 5 3 5 that evaluates to 24: (3+5)*(5-2)\nYes! That expression evaluates to 24\n\nPlay again [y/n]?\nEnter an expression using these digits: 8 8 6 6 that evaluates to 24: 8+6+8/6\nNo - that expression evaluates to  15.3333\n\nPlay again [y/n]?\nEnter an expression using these digits: 2 1 5 1 that evaluates to 24: (1+1)*(7+5)\nThat expression didn't contain the puzzle digits\n\nPlay again [y/n]? n\n",
        "safe": true
    },
    {
        "filename": "24 game_70.txt",
        "content": "$ groovy TwentyFour.gsh\nEnter your guess using [4, 8, 3, 6] (q to quit): 4836\nno multi-digit numbers allowed\nEnter your guess using [4, 8, 3, 6] (q to quit): 4  ++ ++ 8/ 3-6\nA syntax error was found in 4  ++ ++ 8/ 3-6\nEnter your guess using [4, 8, 3, 6] (q to quit): btsjsb\ninvalid characters in input: [t, s, b, j]\nEnter your guess using [4, 8, 3, 6] (q to quit): 1+3+2+2\nyou didn't use the right digits\nEnter your guess using [4, 8, 3, 6] (q to quit): q\nAwwww. Maybe next time?\n\n$ groovy TwentyFour.gsh\nEnter your guess using [6, 3, 2, 6] (q to quit): 6+6+3+2\nNope: 6+6+3+2 == 17.0, not 24\nOne more try, then?\nEnter your guess using [6, 3, 2, 6] (q to quit): (6*3 - 6) * 2\nYes! You got it.",
        "safe": true
    },
    {
        "filename": "24 game_71.txt",
        "content": "import Data.List (sort)\nimport Data.Char (isDigit)\nimport Data.Maybe (fromJust)\nimport Control.Monad (foldM)\nimport System.Random (randomRs, getStdGen)\nimport System.IO (hSetBuffering, stdout, BufferMode(NoBuffering))\n\nmain = do\n  hSetBuffering stdout NoBuffering\n  mapM_\n    putStrLn\n    [ \"THE 24 GAME\\n\"\n    , \"Given four digits in the range 1 to 9\"\n    , \"Use the +, -, *, and / operators in reverse polish notation\"\n    , \"To show how to make an answer of 24.\\n\"\n    ]\n  digits <- fmap (sort . take 4 . randomRs (1, 9)) getStdGen :: IO [Int]\n  putStrLn (\"Your digits: \" ++ unwords (fmap show digits))\n  guessLoop digits\n  where\n    guessLoop digits =\n      putStr \"Your expression: \" >> fmap (processGuess digits . words) getLine >>=\n      either (\\m -> putStrLn m >> guessLoop digits) putStrLn\n\nprocessGuess _ [] = Right \"\"\nprocessGuess digits xs\n  | not matches = Left \"Wrong digits used\"\n  where\n    matches = digits == (sort . fmap read $ filter (all isDigit) xs)\nprocessGuess digits xs = calc xs >>= check\n  where\n    check 24 = Right \"Correct\"\n    check x = Left (show (fromRational (x :: Rational)) ++ \" is wrong\")\n\n-- A Reverse Polish Notation calculator with full error handling\ncalc xs =\n  foldM simplify [] xs >>=\n  \\ns ->\n     (case ns of\n        [n] -> Right n\n        _ -> Left \"Too few operators\")\n\nsimplify (a:b:ns) s\n  | isOp s = Right ((fromJust $ lookup s ops) b a : ns)\nsimplify _ s\n  | isOp s = Left (\"Too few values before \" ++ s)\nsimplify ns s\n  | all isDigit s = Right (fromIntegral (read s) : ns)\nsimplify _ s = Left (\"Unrecognized symbol: \" ++ s)\n\nisOp v = elem v $ fmap fst ops\n\nops = [(\"+\", (+)), (\"-\", (-)), (\"*\", (*)), (\"/\", (/))]\n",
        "safe": true
    },
    {
        "filename": "24 game_72.txt",
        "content": "DIMENSION digits(4), input_digits(100), difference(4)\nCHARACTER expression*100, prompt*100, answers='Wrong,Correct,', protocol='24 game.txt'\n\n1  digits = CEILING( RAN(9) )\n2  DLG(Edit=expression, Text=digits, TItle=prompt)\n\n   READ(Text=expression, ItemS=n) input_digits\n   IF(n == 4) THEN\n     ALIAS(input_digits,1,  input,4)\n     SORT(Vector=digits, Sorted=digits)\n     SORT(Vector=input, Sorted=input)\n     difference = ABS(digits - input)\n     IF( SUM(difference) == 0 ) THEN\n       EDIT(Text=expression, ScaNnot='123456789+-*/ ()', GetPos=i, CoPyto=prompt)\n       IF( i > 0 ) THEN\n         prompt = TRIM(expression) // ': ' //TRIM(prompt) // ' is an illegal character'\n       ELSE\n         prompt = TRIM(expression) // ': Syntax error'\n         result = XEQ(expression, *2)\u00a0! on error branch to label 2\n         EDIT(Text=answers, ITeM=(result==24)+1, Parse=answer)\n         WRITE(Text=prompt, Name) TRIM(expression)//': ', answer, result\n       ENDIF\n     ELSE\n       WRITE(Text=prompt) TRIM(expression), ': You used ', input, ' instead ', digits\n     ENDIF\n   ELSE\n     prompt = TRIM(expression) // ': Instead 4 digits you used ' // n\n   ENDIF\n\n   OPEN(FIle=protocol, APPend)\n   WRITE(FIle=protocol, CLoSe=1) prompt\n\n   DLG(TItle=prompt, Button='>2:Try again', B='>1:New game', B='Quit')\n\nEND",
        "safe": true
    },
    {
        "filename": "24 game_73.txt",
        "content": "4 + 8 + 7 + 5: You used 4 5 7 8  instead 4 4 7 8\n4 + 8 + 7 + a: Instead 4 digits you used 3\n4 + 8 + 7 + a + 4: a is an illegal character\n4 + 8 + 7a + 4: a is an illegal character\n4 + 8 + 7 + 4:; answer=Wrong; result=23;\n4 * 7 - 8 + 4:; answer=Correct; result=24;",
        "safe": true
    },
    {
        "filename": "24 game_74.txt",
        "content": "#! /bin/sh\nexec huginn --no-argv -E \"${0}\"\n#! huginn\n\nimport Algorithms as algo;\nimport Mathematics as math;\nimport RegularExpressions as re;\n\nmake_game( rndGen_ ) {\n  board = \"\";\n  for ( i\u00a0: algo.range( 4 ) ) {\n    board += ( \" \" + string( character( rndGen_.next() + integer( '1' ) ) ) );\n  }\n  return ( board.strip() );\n}\n\nmain() {\n  rndGen = math.randomizer( 9 );\n  no = 0;\n  dd = re.compile( \"\\\\d\\\\d\" );\n  while ( true ) {\n    no += 1;\n    board = make_game( rndGen );\n    print( \"Your four digits: {}\\nExpression {}: \".format( board, no ) );\n    line = input();\n    if ( line == none ) {\n      print( \"\\n\" );\n      break;\n    }\n    line = line.strip();\n    try {\n      if ( line == \"q\" ) {\n        break;\n      }\n      if ( ( pos = line.find_other_than( \"{}+-*/() \".format( board ) ) ) >= 0 ) {\n        print( \"Invalid input found at: {}, `{}`\\n\".format( pos, line ) );\n        continue;\n      }\n      if ( dd.match( line ).matched() ) {\n        print( \"Digit concatenation is forbidden.\\n\" );\n        continue;\n      }\n      res = real( line );\n      if ( res == 24.0 ) {\n        print( \"Thats right!\\n\" );\n      } else {\n        print( \"Bad answer!\\n\" );\n      }\n    } catch ( Exception e ) {\n      print( \"Not an expression: {}\\n\".format( e.what() ) );\n    }\n  }\n  return ( 0 );\n}",
        "safe": true
    },
    {
        "filename": "24 game_75.txt",
        "content": "invocable all \nlink strings   # for csort, deletec\n\nprocedure main() \nhelp()  \nrepeat { \n   every (n := \"\") ||:= (1 to 4, string(1+?8))\n   writes(\"Your four digits are\u00a0: \")\n   every writes(!n,\" \") \n   write()\n   \n   e := trim(read()) | fail\n   case e of {\n      \"q\"|\"quit\": return\n      \"?\"|\"help\": help()\n      default: {\n         e := deletec(e,' \\t')         # no whitespace\n         d := deletec(e,~&digits)      # just digits\n         if csort(n) ~== csort(d) then # and only the 4 given digits\n            write(\"Invalid repsonse.\") & next \n\n         if e ? (ans := eval(E()), pos(0)) then # parse and evaluate\n            if ans = 24 then write(\"Congratulations you win!\") \n            else write(\"Your answer was \",ans,\". Try again.\")\n         else write(\"Invalid expression.\")\n         }\n      }\n   }\nend\n\nprocedure eval(X)    #: return the evaluated AST\n   if type(X) == \"list\" then {\n      x := eval(get(X))\n      while x := get(X)(real(x), real(eval(get(X) | stop(\"Malformed expression.\"))))\n   }\n   return \\x | X\nend\n\nprocedure E()    #: expression\n   put(lex := [],T())\n   while put(lex,tab(any('+-*/'))) do\n      put(lex,T())  \n   suspend if *lex = 1 then lex[1] else lex     # strip useless []  \nend   \n \nprocedure T()                   #: Term\n   suspend 2(=\"(\", E(), =\")\") | # parenthesized subexpression, or ...\n       tab(any(&digits))        # just a value\nend\n\nprocedure help()\nreturn write(\n   \"Welcome to 24\\n\\n\",\n   \"Combine the 4 given digits to make 24 using only + - * / and ( ).\\n \",\n   \"All operations have equal precedence and are evaluated left to right.\\n\",\n   \"Combining (concatenating) digits is not allowed.\\n\",\n   \"Enter 'help', 'quit', or an expression.\\n\")  \nend\n",
        "safe": true
    },
    {
        "filename": "24 game_76.txt",
        "content": "Welcome to 24\n\nThe object of the game is to combine the 4 given digits using only + - * / and ( ).\nAll operations have equal precedence and are evaluated left to right.\nCombining (concatenating) digits is not allowed.\nEnter 'help', 'quit', or an expression.\n\nYour four digits are\u00a0: 8 1 7 2\n8*2+(7+1)\nCongratulations you win!\nYour four digits are\u00a0: 4 2 7 6\n7*6+(4*2)\nYour answer was 50. Try again.\nYour four digits are\u00a0: 7 7 8 8\n77-88\nInvalid expression.\nYour four digits are\u00a0: 9 3 2 3\n9+3+2+3+\nMalformed expression.",
        "safe": true
    },
    {
        "filename": "24 game_77.txt",
        "content": "require'misc'\ndeal=: 1 + ? bind 9 9 9 9\nrules=: smoutput bind 'see http://en.wikipedia.org/wiki/24_Game'\ninput=: prompt @ ('enter 24 expression using ', \":, ': '\"_)\n\nwellformed=: (' '<;._1@, \":@[) -:&(/:~)  '(+-*%)' -.&;:~ ]\nis24=: 24 -: \". ::0:@]\n\nrespond=: (;:'no yes') {::~ wellformed * is24\n\ngame24=: (respond input)@deal@rules\n",
        "safe": true
    },
    {
        "filename": "24 game_78.txt",
        "content": "   game24 ''\nsee http://en.wikipedia.org/wiki/24_Game\nenter 24 expression using 6 5 9 4: 6+5+9+4\nyes\n   game24 ''\nsee http://en.wikipedia.org/wiki/24_Game\nenter 24 expression using 3 3 3 3: 3+3+3+3+3+3+3+3\nno\n",
        "safe": true
    },
    {
        "filename": "24 game_79.txt",
        "content": "import java.util.*;\n\npublic class Game24 {\n    static Random r = new Random();\n\n    public static void main(String[] args) {\n\n        int[] digits = randomDigits();\n        Scanner in = new Scanner(System.in);\n\n        System.out.print(\"Make 24 using these digits: \");\n        System.out.println(Arrays.toString(digits));\n        System.out.print(\"> \");\n\n        Stack<Float> s = new Stack<>();\n        long total = 0;\n        for (char c : in.nextLine().toCharArray()) {\n            if ('0' <= c && c <= '9') {\n                int d = c - '0';\n                total += (1 << (d * 5));\n                s.push((float) d);\n            } else if (\"+/-*\".indexOf(c) != -1) {\n                s.push(applyOperator(s.pop(), s.pop(), c));\n            }\n        }\n        if (tallyDigits(digits) != total)\n            System.out.print(\"Not the same digits. \");\n        else if (Math.abs(24 - s.peek()) < 0.001F)\n            System.out.println(\"Correct!\");\n        else\n            System.out.print(\"Not correct.\");\n    }\n\n    static float applyOperator(float a, float b, char c) {\n        switch (c) {\n            case '+':\n                return a + b;\n            case '-':\n                return b - a;\n            case '*':\n                return a * b;\n            case '/':\n                return b / a;\n            default:\n                return Float.NaN;\n        }\n    }\n\n    static long tallyDigits(int[] a) {\n        long total = 0;\n        for (int i = 0; i < 4; i++)\n            total += (1 << (a[i] * 5));\n        return total;\n    }\n\n    static int[] randomDigits() {        \n        int[] result = new int[4];\n        for (int i = 0; i < 4; i++)\n            result[i] = r.nextInt(9) + 1;\n        return result;\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_8.txt",
        "content": "tfgame\u2190{\u2395IO\u21901\n    \u2395\u2190d\u2190?\u2375\u23749\n    i\u2190\u235e\n    u[\u234bu\u2190{\u234e\u00a8\u2363(0\u2260\u2262\u2375)\u22a2\u2375}(i\u220a'1234567890')\u2286i]\u2262d[\u234bd]:'nope'\n    ~\u2227/((~b\u2190i\u220a'1234567890')/i)\u220a'+-\u00d7\u00f7()':'nope'\n    24\u2260\u234ei:'nope'\n    'Yeah!'\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_80.txt",
        "content": "Make 24 using these digits: [1, 2, 4, 8]\n> 12*48+*\nCorrect!",
        "safe": true
    },
    {
        "filename": "24 game_81.txt",
        "content": "function twentyfour(numbers, input) {\n    var invalidChars = /[^\\d\\+\\*\\/\\s-\\(\\)]/;\n\n    var validNums = function(str) {\n        // Create a duplicate of our input numbers, so that\n        // both lists will be sorted.\n        var mnums = numbers.slice();\n        mnums.sort();\n\n        // Sort after mapping to numbers, to make comparisons valid.\n        return str.replace(/[^\\d\\s]/g, \" \")\n            .trim()\n            .split(/\\s+/)\n            .map(function(n) { return parseInt(n, 10); })\n            .sort()\n            .every(function(v, i) { return v === mnums[i]; });\n    };\n\n    var validEval = function(input) {\n        try {\n            return eval(input);\n        } catch (e) {\n            return {error: e.toString()};\n        }\n    };\n\n    if (input.trim() === \"\") return \"You must enter a value.\";\n    if (input.match(invalidChars)) return \"Invalid chars used, try again. Use only:\\n + - * / ( )\";\n    if (!validNums(input)) return \"Wrong numbers used, try again.\";\n    var calc = validEval(input);\n    if (typeof calc !== 'number') return \"That is not a valid input; please try again.\";\n    if (calc !== 24) return \"Wrong answer: \" + String(calc) + \"; please try again.\";\n    return input + \" == 24.  Congratulations!\";\n};\n\n// I/O below.\n\nwhile (true) {\n    var numbers = [1, 2, 3, 4].map(function() {\n        return Math.floor(Math.random() * 8 + 1);\n    });\n\n    var input = prompt(\n        \"Your numbers are:\\n\" + numbers.join(\" \") +\n        \"\\nEnter expression. (use only + - * / and parens).\\n\", +\"'x' to exit.\", \"\");\n\n    if (input === 'x') {\n        break;\n    }\n    alert(twentyfour(numbers, input));\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_82.txt",
        "content": "### The MRG32k3a combined recursive PRNG - see above\nimport \"MRG32k3a\" as MRG {search: \".\"};\n\n### Generic utilities\ndef sum(stream): reduce stream as $x (0; .+$x);\n\n# like while/2 but emit the final term rather than the first one\ndef whilst(cond; update):\n  def _whilst:\n    if cond then update | (., _whilst) else empty end;\n  _whilst;\n\n### Reverse Polish Notation\n# An array of the allowed operators\ndef operators: \"+-*/\" | split(\"\");\n\n# If $a and $b are numbers and $c an operator, then \"$a $b $c\" is evaluated as an RPN expression.\n# Output: {emit, result} with .emit == null if there is a valid result.\ndef applyOperator($a; $b; $c):\n  if ([$a,$b] | map(type) | unique) == [\"number\"] \n  then\n    if   $c == \"+\" then   {result: ($a + $b)}\n    elif $c == \"-\" then   {result: ($a - $b)}\n    elif $c == \"*\" then   {result: ($a * $b)}\n    elif ($c == \"/\") then {result: ($b / $a)}\n    else {emit: \"unrecognized operator: \\($c)\"}\n    end\n  else {emit: \"invalid number\"}\n  end;\n\n# Input: an array representing an RPN expression.\n# Output: {emit, result} as per applyOperator/3\n# Example: [1,2,3,\"+\",\"+\"] | evaluate #=> 6\ndef evaluate:\n  if length == 1\n  then if .[0]|type == \"number\" then {result: .[0]}\n       else {emit: \"invalid RPN expression\"}\n       end\n  elif length < 3 then {emit: \"invalid RPN expression: \\(. | join(\" \"))\"}\n  else . as $in\n  | (first( range(0; length) as $i | select(any( operators[]; . == $in[$i]) ) | $i) // null) as $ix\n  | if $ix == null then {emit: \"invalid RPN expression\"}\n    else applyOperator(.[$ix-2]; .[$ix-1]; .[$ix]) as $result\n    | if $result.result then .[:$ix-2] + [$result.result] + .[$ix+1:] | evaluate\n      else $result\n      end\n    end\n  end;\n\n### The \"24 Game\"\n\n# . is the putative RPN string to be checked.\n# $four is the string of the four expected digits, in order.\n# Output: {emit, result} with .emit set to \"Correct!\" if .result == 24\ndef check($four):\n  if (gsub(\"[^1-9]\";\"\") | explode | sort | implode)\u00a0!= $four\n  then {emit: \"You must use each of the four digits \\($four | split(\"\") | join(\" \")) exactly once:\"}\n  else . as $in\n        | {s: [], emit: null}\n        | [$in | split(\"\")[] | select(.\u00a0!= \" \")\n           | . as $in | explode[0] | if . >= 48 and . <= 57 then . - 48 else $in end]\n        | evaluate\n        | if .result\n          then if .result|round == 24 then .emit = \"Correct!\"\n               else .emit = \"Value \\(.result) is not 24.\" \n               end\n          else .emit += \"\\nTry again, or enter . to start again, or q to quit.\"\n          end\n   end\u00a0;\n\ndef run:\n  # Populate .digits with four non-negative digits selected at random, with replacement:\n  {digits: (9 | MRG::prn(4) | map(. + 1))}\n  | (.digits | sort | join(\"\")) as $four\n  | \"At the prompt, enter an RPN string (e.g. 64*1+1-), or . for a new set of four digits, or q to quit.\",\n    \"Make 24 using these digits, once each, in any order: \\(.digits):\",\n    ( whilst( .stop | not;\n         .emit = null\n         | . as $state\n         | try input catch halt\n         | if IN( \"q\", \"quit\") then halt\n           elif . == \".\" then $state | .stop = true\n           else check($four)\n           | if .result then .stop = true end\n           end )\n     | select(.emit).emit ),\n       # rerun\n       run;\n\nrun",
        "safe": true
    },
    {
        "filename": "24 game_83.txt",
        "content": "$ jq -nRr -f 24-game.jq \nAt the prompt, enter an RPN string (e.g. 64*1+1-), or . for a new set of four digits, or q to quit.\nMake 24 using these digits, once each, in any order: [7,7,6,8]:\n7768+++\nValue 28 is not 24.\nAt the prompt, enter an RPN string (e.g. 64*1+1-), or . for a new set of four digits, or q to quit.\nMake 24 using these digits, once each, in any order: [7,8,6,8]:\n.\nAt the prompt, enter an RPN string (e.g. 64*1+1-), or . for a new set of four digits, or q to quit.\nMake 24 using these digits, once each, in any order: [7,2,1,8]:\n82*71++\nCorrect!\nAt the prompt, enter an RPN string (e.g. 64*1+1-), or . for a new set of four digits, or q to quit.\nMake 24 using these digits, once each, in any order: [6,4,2,6]:\nq\n$\n",
        "safe": true
    },
    {
        "filename": "24 game_84.txt",
        "content": "validexpr(ex::Expr) = ex.head == :call && ex.args[1] in [:*,:/,:+,:-] && all(validexpr, ex.args[2:end])\nvalidexpr(ex::Int) = true\nvalidexpr(ex::Any) = false\nfindnumbers(ex::Number) = Int[ex]\nfindnumbers(ex::Expr) = vcat(map(findnumbers, ex.args)...)\nfindnumbers(ex::Any) = Int[]\nfunction twentyfour()\n    digits = sort!(rand(1:9, 4))\n    while true\n        print(\"enter expression using $digits => \")\n        ex = parse(readline())\n        try\n            validexpr(ex) || error(\"only *, /, +, - of integers is allowed\")\n            nums = sort!(findnumbers(ex))\n            nums == digits || error(\"expression $ex used numbers $nums\u00a0!= $digits\")\n            val = eval(ex)\n            val == 24 || error(\"expression $ex evaluated to $val, not 24\")\n            println(\"you won!\")\n            return\n        catch e\n            if isa(e, ErrorException)\n                println(\"incorrect: \", e.msg)\n            else\n                rethrow()\n            end\n        end\n    end\nend\n",
        "safe": true
    },
    {
        "filename": "24 game_85.txt",
        "content": "julia> twentyfour()\nenter expression using [2,5,8,9] => 5 * 2 - 8 + 9\nincorrect: expression (5 * 2 - 8) + 9 evaluated to 11, not 24\nenter expression using [2,5,8,9] => 5 * 5 + 2 + 8 - 9\nincorrect: expression (5 * 5 + 2 + 8) - 9 used numbers [2,5,5,8,9]\u00a0!= [2,5,8,9]\nenter expression using [2,5,8,9] => 8*2*2\nincorrect: expression 8 * 2 * 2 used numbers [2,2,8]\u00a0!= [2,5,8,9]\nenter expression using [2,5,8,9] => (8 + 9) + (5 + 2)\nyou won!",
        "safe": true
    },
    {
        "filename": "24 game_86.txt",
        "content": "import std/num/random\nimport std/os/readline\n\ntype expr\n  Num(i: int)\n  Add(e1: expr, e2: expr)\n  Sub(e1: expr, e2: expr)\n  Mul(e1: expr, e2: expr)\n  Div(e1: expr, e2: expr)\n\nfun genNum()\n  random-int() % 9 + 1\n\nfun parseFact(s: string): <div,exn> (expr, string)\n  match s.head\n    \"(\" -> \n      val (e, rest) = s.tail.parseExpr()\n      match rest.head\n        \")\" -> (e, rest.tail)\n        _ -> throw(\"expected ')'\")\n    x | x.head-char.default('_').is-digit -> (Num(x.parse-int.unjust), s.tail)\n    _ -> throw(\"No factor\")\n\nfun parseTerm(s): <div,exn> (expr, string)\n  val (e', n) = s.parseFact()\n  match n.head\n    \"*\" -> \n      val (e'', n') = n.tail.parseTerm()\n      (Mul(e', e''), n')\n    \"/\" ->\n      val (e'', n') = n.tail.parseTerm()\n      (Div(e', e''), n')\n    _ -> (e', n)\n\nfun parseExpr(s): <div,exn> (expr, string)\n  val (e', n) = s.parseTerm()\n  match n.head\n    \"+\" -> \n      val (e'', n') = n.tail.parseExpr()\n      (Add(e', e''), n')\n    \"-\" ->\n      val (e'', n') = n.tail.parseExpr()\n      (Sub(e', e''), n')\n    _ -> (e', n)\n\nfun numbers(e: expr): div list<int>\n  match e\n    Num(i) -> [i]\n    Add(e1, e2) -> numbers(e1) ++ numbers(e2)\n    Sub(e1, e2) -> numbers(e1) ++ numbers(e2)\n    Mul(e1, e2) -> numbers(e1) ++ numbers(e2)\n    Div(e1, e2) -> numbers(e1) ++ numbers(e2)\n\nfun check(e: expr, l: list<int>): <div,exn> ()\n  val ns = numbers(e)\n  if (ns.length == 4) then\n    if l.all(fn(n) ns.any(fn(x) x == n)) then\n      ()\n    else\n      throw(\"wrong numbers\")\n  else\n    throw(\"wrong number of numbers\")\n\nfun evaluate(e: expr): float64\n  match e\n    Num(i) -> i.float64\n    Add(e1, e2) -> evaluate(e1) + evaluate(e2)\n    Sub(e1, e2) -> evaluate(e1) - evaluate(e2)\n    Mul(e1, e2) -> evaluate(e1) * evaluate(e2)\n    Div(e1, e2) -> evaluate(e1) / evaluate(e2)\n\nfun main()\n  println(\"\\nGoal: \")\n  println(\"- Create an expression that evaluates to 24\")\n  println(\"- Using the four given numbers each number once\")\n  println(\"- Using the operators (+-/*) with no spaces\")\n  println(\"Example 2 3 4 1: (2+3)*4*1\\n\")\n  println(\"Here are your numbers!\")\n  var l: list<int> := Nil\n  repeat(4) fn()\n    val n = genNum()\n    l := Cons(n, l)\n    (n.show ++ \" \").print\n  println(\"\")\n  var found := False\n  while { !found } fn()\n    val (expr, r) = readline().parseExpr()\n    if r.count > 0 then\n      println(\"Expected EOF but got: \" ++ r ++ \" please try again\")\n      return ()\n    expr.check(l)\n    val result = expr.evaluate()\n    if result == 24.0 then\n      println(\"You got it!\")\n      found := True\n    else\n      println(\"Try again, your expression evaluated to: \" ++ result.show)\n",
        "safe": true
    },
    {
        "filename": "24 game_87.txt",
        "content": "import java.util.Random\nimport java.util.Scanner\nimport java.util.Stack\n\ninternal object Game24 {\n    fun run() {\n        val r = Random()\n        val digits = IntArray(4).map { r.nextInt(9) + 1 }\n        println(\"Make 24 using these digits: $digits\")\n        print(\"> \")\n\n        val s = Stack<Float>()\n        var total = 0L\n        val cin = Scanner(System.`in`)\n        for (c in cin.nextLine()) {\n            when (c) {\n                in '0'..'9' -> {\n                    val d = c - '0'\n                    total += (1 shl (d * 5)).toLong()\n                    s += d.toFloat()\n                }\n                else ->\n                    if (\"+/-*\".indexOf(c) != -1) {\n                        s += c.applyOperator(s.pop(), s.pop())\n                    }\n            }\n        }\n\n        when {\n            tally(digits) != total ->\n                print(\"Not the same digits. \")\n            s.peek().compareTo(target) == 0 ->\n                println(\"Correct!\")\n            else ->\n                print(\"Not correct.\")\n        }\n    }\n\n    private fun Char.applyOperator(a: Float, b: Float) = when (this) {\n        '+' -> a + b\n        '-' -> b - a\n        '*' -> a * b\n        '/' -> b / a\n        else -> Float.NaN\n    }\n\n    private fun tally(a: List<Int>): Long = a.reduce({ t, i -> t + (1 shl (i * 5)) }).toLong()\n\n    private val target = 24\n}\n\nfun main(args: Array<String>) = Game24.run()\n",
        "safe": true
    },
    {
        "filename": "24 game_88.txt",
        "content": "[\nif(sys_listunboundmethods !>> 'randoms') => {\n\tdefine randoms()::array => {\n\t\tlocal(out = array)\n\t\tloop(4) => { #out->insert(math_random(9,1)) }\n\t\treturn #out\n\t}\n}\nif(sys_listunboundmethods !>> 'checkvalid') => {\n\tdefine checkvalid(str::string, nums::array)::boolean => {\n\t\tlocal(chk = array('*','/','+','-','(',')',' '), chknums = array, lastintpos = -1, poscounter = 0)\n\t\tloop(9) => { #chk->insert(loop_count) }\n\t\twith s in #str->values do => {\n\t\t\t#poscounter++\n\t\t\t#chk !>> #s && #chk !>> integer(#s) ? return false\n\t\t\tinteger(#s) > 0 && #lastintpos + 1 >= #poscounter ? return false\n\t\t\tinteger(#s) > 0 ? #chknums->insert(integer(#s))\n\t\t\tinteger(#s) > 0 ? #lastintpos = #poscounter\n\t\t}\n\t\t#chknums->size != 4 ? return false\n\t\t#nums->sort\n\t\t#chknums->sort\n\t\tloop(4) => { #nums->get(loop_count) != #chknums(loop_count) ? return false }\n\t\treturn true\n\t}\n}\nif(sys_listunboundmethods !>> 'executeexpr') => {\n\tdefine executeexpr(expr::string)::integer => {\n\t\tlocal(keep = string)\n\t\twith i in #expr->values do => {\n\t\t\tif(array('*','/','+','-','(',')') >> #i) => {\n\t\t\t\t#keep->append(#i)\n\t\t\telse\n\t\t\t\tinteger(#i) > 0 ? #keep->append(decimal(#i))\n\t\t\t}\n\t\t}\n\t\treturn integer(sourcefile('['+#keep+']','24game',true,true)->invoke)\n\t}\n}\n\nlocal(numbers = array, exprsafe = true, exprcorrect = false, exprresult = 0)\nif(web_request->param('nums')->asString->size) => {\n\twith n in web_request->param('nums')->asString->split(',') do => { #numbers->insert(integer(#n->trim&)) }\n}\n#numbers->size != 4 ? #numbers = randoms()\nif(web_request->param('nums')->asString->size) => {\n\t#exprsafe = checkvalid(web_request->param('expr')->asString,#numbers)\n\tif(#exprsafe) => {\n\t\t#exprresult = executeexpr(web_request->param('expr')->asString)\n\t\t#exprresult == 24 ? #exprcorrect = true\n\t}\n}\n\n]<h1>24 Game</h1>\n<p><b>Rules:</b><br>\nEnter an expression that evaluates to 24</p>\n<ul>\n<li>Only multiplication, division, addition, and subtraction operators/functions are allowed.</li>\n<li>Brackets are allowed.</li>\n<li>Forming multiple digit numbers from the supplied digits is disallowed. (So an answer of 12+12 when given 1, 2, 2, and 1 is wrong).</li>\n<li>The order of the digits when given does not have to be preserved.</li>\n</ul>\n\n<h2>Numbers</h2>\n<p>[#numbers->join(', ')] (<a href=\"?\">Reload</a>)</p>\n[!#exprsafe ? '<p>Please provide a valid expression</p>']\n<form><input type=\"hidden\" value=\"[#numbers->join(',')]\" name=\"nums\"><input type=\"text\" name=\"expr\" value=\"[web_request->param('expr')->asString]\"><input type=\"submit\" name=\"submit\" value=\"submit\"></form>\n[if(#exprsafe)]\n<p>Result: <b>[#exprresult]</b> [#exprcorrect ? 'is CORRECT!' | 'is incorrect']</p>\n[/if]\n",
        "safe": true
    },
    {
        "filename": "24 game_89.txt",
        "content": "dim d(4)\ndim chk(4)\nprint \"The 24 Game\"\nprint\nprint \"Given four digits and using just the +, -, *, and / operators; and the\"\nprint \"possible use of brackets, (), enter an expression that equates to 24.\"\n\ndo\n    d$=\"\"\n    for i = 1 to 4\n        d(i)=int(rnd(1)*9)+1    '1..9\n        chk(i)=d(i)\n        d$=d$;d(i)  'valid digits, to check with Instr\n    next\n\n    print\n    print \"These are your four digits: \";\n    for i = 1 to 4\n        print d(i);left$(\",\",i<>4);\n    next\n    print\n\n    Print \"Enter expression:\"\n    Input \"24 = \";expr$\n    'check expr$ for validity\n\n    'check right digits used\n    failed = 0\n    for i = 1 to len(expr$)\n        c$=mid$(expr$,i,1)\n        if instr(\"123456789\", c$)<>0 then 'digit\n            if instr(d$, c$)=0 then failed = 1: exit for\n            if i>1 and instr(\"123456789\", mid$(expr$,i-1,1))<>0 then failed = 2: exit for\n            for j =1 to 4\n                if chk(j)=val(c$) then chk(j)=0: exit for\n            next\n        end if\n    next\n    if failed=1 then\n        print \"Wrong digit (\";c$;\")\"\n        goto [fail]\n    end if\n\n    if failed=2 then\n        print \"Multiple digit numbers is disallowed.\"\n        goto [fail]\n    end if\n\n    'check all digits used\n    if chk(1)+ chk(2)+ chk(3)+ chk(4)<>0 then\n        print \"Not all digits used\"\n        goto [fail]\n    end if\n\n    'check valid operations\n    failed = 0\n    for i = 1 to len(expr$)\n        c$=mid$(expr$,i,1)\n        if instr(\"+-*/()\"+d$, c$)=0 then failed = 1: exit for\n    next\n    if failed then\n        print \"Wrong operation (\";c$;\")\"\n        goto [fail]\n    end if\n    'some errors (like brackets) trapped by error handler\n    Err$=\"\"\n    res=evalWithErrCheck(expr$)\n    if Err$<>\"\" then\n        print \"Error in expression\"\n        goto [fail]\n    end if\n    if res = 24 then\n        print \"Correct!\"\n    else\n        print \"Wrong! (you got \";res\u00a0;\")\"\n    end if\n[fail]\n    Input \"Play again (y/n)? \"; ans$\nloop while ans$=\"y\"\nend\n\nfunction evalWithErrCheck(expr$)\n    on error goto [handler]\n    evalWithErrCheck=eval(expr$)\n    exit function\n[handler]\nend function",
        "safe": true
    },
    {
        "filename": "24 game_9.txt",
        "content": "      tfgame 4\n6 9 4 5\n6+9+4+5\nYeah!\n\n      tfgame 6\n4 9 7 9 1 1\nUmmm... I'm too tired.\nnope\n",
        "safe": true
    },
    {
        "filename": "24 game_90.txt",
        "content": "on mouseUp\n    put empty into fld \"EvalField\"\n    put empty into fld \"AnswerField\"\n    put random(9) & comma & random(9) & comma & random(9) & comma & random(9) into fld \"YourNumbersField\"\nend mouseUp",
        "safe": true
    },
    {
        "filename": "24 game_91.txt",
        "content": "on keyDown k\n    local ops, nums, allowedKeys, numsCopy, expr\n    put \"+,-,/,*,(,)\" into ops\n    put the text of fld \"YourNumbersField\" into nums\n    put the text of fld \"EvalField\" into expr\n    if matchText(expr & k,\"\\d\\d\") then \n        answer \"You can't enter 2 digits together\"\n        exit keyDown\n    end if\n    repeat with n = 1 to the number of chars of expr\n        if offset(char n of expr, nums) > 0 then\n            delete char offset(char n of expr, nums) of nums\n        end if\n    end repeat\n    put ops & comma & nums into allowedKeys\n    if k is among the items of allowedKeys then\n        put k after expr\n        delete char offset(k, nums) of nums\n        replace comma with empty in nums\n        try\n            put the value of merge(\"[[expr]]\") into fld \"AnswerField\"\n            if the value of fld \"AnswerField\" is 24 and nums is empty then\n                answer \"You win!\"\n            end if\n        end try\n        pass keyDown\n    else\n        exit keyDown\n    end if\nend keyDown",
        "safe": true
    },
    {
        "filename": "24 game_92.txt",
        "content": "10 CLS:RANDOMIZE TIME\n20 PRINT \"The 24 Game\"\n30 PRINT \"===========\":PRINT\n40 PRINT \"Enter an arithmetic expression\"\n50 PRINT \"that evaluates to 24,\"\n60 PRINT \"using only the provided digits\"\n70 PRINT \"and +, -, *, /, (, ).\"\n80 PRINT \"(Just hit Return for new digits.)\"\n90 ' create new digits\n100 FOR i=1 TO 4:a(i)=INT(RND*9)+1:NEXT\n110 PRINT\n120 PRINT \"The digits are\";a(1);a(2);a(3);a(4)\n130 PRINT\n140 ' user enters solution\n150 INPUT \"Your solution\";s$\n160 IF s$=\"\" THEN PRINT \"Creating new digits...\":GOTO 100\n170 GOTO 300\n180 ' a little hack to create something like an EVAL function\n190 OPENOUT \"exp.bas\"\n200 PRINT #9,\"1000 x=\"s$\":return\"\n210 CLOSEOUT\n220 CHAIN MERGE \"exp\",240\n230 ' now evaluate the expression\n240 ON ERROR GOTO 530\n250 GOSUB 1000\n260 IF x=24 THEN PRINT \"Well done!\":END\n270 PRINT \"No, this evaluates to\"x:PRINT \"Please try again.\"\n280 GOTO 150\n290 ' check input for correctness\n300 FOR i=1 TO LEN(s$)\n310 q=ASC(MID$(s$,i,1))\n320 IF q=32 OR (q>39 AND q<44) OR q=45 OR (q>46 AND q<58) THEN NEXT\n330 IF i-1=LEN(s$) THEN 370\n340 PRINT \"Bad character in expression:\"CHR$(q)\n350 PRINT \"Try again\":GOTO 150\n360 ' new numbers in solution?\n370 FOR i=1 TO LEN(s$)-1\n380 q=ASC(MID$(s$,i,1)):p=ASC(MID$(s$,i+1,1))\n390 IF q>47 AND q<58 AND p>47 AND p<58 THEN PRINT \"No forming of new numbers, please!\":GOTO 150\n400 NEXT\n410 FOR i=1 TO 9:orig(i)=0:guess(i)=0:NEXT\n420 FOR i=1 TO 4:orig(a(i))=orig(a(i))+1:NEXT\n430 FOR i=1 TO LEN(s$)\n440 v$=MID$(s$,i,1)\n450 va=ASC(v$)-48\n460 IF va>0 AND va<10 THEN guess(va)=guess(va)+1\n470 NEXT\n480 FOR i=1 TO 9\n490 IF guess(i)<>orig(i) THEN PRINT \"Only use all the provided digits!\":GOTO 150\n500 NEXT\n510 GOTO 190\n520 ' syntax error, e.g. non-matching parentheses\n530 PRINT \"Error in expression, please try again.\"\n540 RESUME 150\n",
        "safe": true
    },
    {
        "filename": "24 game_93.txt",
        "content": "; useful constants\nmake \"false 1=0\nmake \"true  1=1\nmake \"lf char 10\nmake \"sp char 32\n\n; non-digits legal in expression\nmake \"operators (lput sp [+ - * / \\( \\)])\n\n; display help message\nto show_help :digits\n  type lf\n  print sentence quoted [Using only these digits:] :digits \n  print sentence quoted [and these operators:] [* / + -]\n  print quoted [\\(and parentheses as needed\\),]\n  print quoted [enter an arithmetic expression \n     which evaluates to exactly 24.]\n  type lf\n  print quoted [Enter \\\"!\\\" to get fresh numbers.]\n  print quoted [Enter \\\"q\\\" to quit.]\n  type lf\nend\n\nmake \"digits []\nmake \"done false\nuntil [done] [\n\n  if empty? digits [\n    make \"digits (map [(random 9) + 1] [1 2 3 4])\n  ]\n\n  (type \"Solution sp \"for sp digits \"? sp )\n  make \"expression readrawline\n\n  ifelse [expression = \"?] [\n\n    show_help digits\n\n  ] [ifelse [expression = \"q] [\n\n    print \"Bye!\n    make \"done true\n\n  ] [ifelse [expression = \"!] [\n\n    make \"digits []\n\n  ] [\n    make \"exprchars ` expression\n    make \"allowed (sentence digits operators)\n\n    ifelse (member? false (map [[c] member? c allowed] exprchars)) [\n      (print quoted [Illegal character in input.])\n    ] [\n      catch \"error [\n        make \"syntax_error true\n        make \"testval (run expression)\n        make \"syntax_error false\n      ]\n      ifelse syntax_error [\n        (print quoted [Invalid expression.])\n      ] [\n        ifelse (testval = 24) [\n          print quoted [You win!]\n          make \"done true\n        ] [\n          (print (sentence \n            quoted [Incorrect \\(got ] testval quoted [instead of 24\\).]))\n        ]\n      ]\n    ]\n  ]]]\n] \nbye",
        "safe": true
    },
    {
        "filename": "24 game_94.txt",
        "content": "Solution for 3 8 9 5?\u00a0?\n\nUsing only these digits: 3 8 9 5\nand these operators: * / + -\n(and parentheses as needed),\nenter an arithmetic expression which evaluates to exactly 24.\n\nEnter \"!\" to get fresh numbers.\nEnter \"q\" to quit.\n\nSolution for 3 8 9 5?\u00a0!\nSolution for 9 2 8 5? 9+2+8+5\nYou win!\n",
        "safe": true
    },
    {
        "filename": "24 game_95.txt",
        "content": "local function help()\n\tprint [[\n The 24 Game\n\n Given any four digits in the range 1 to 9, which may have repetitions,\n Using just the +, -, *, and / operators; and the possible use of\n brackets, (), show how to make an answer of 24.\n\n An answer of \"q\" will quit the game.\n An answer of \"!\" will generate a new set of four digits.\n\n Note: you cannot form multiple digit numbers from the supplied digits,\n so an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\n\n ]]\nend\n\nlocal function generate(n)\n\tresult = {}\n\tfor i=1,n do\n\t\tresult[i] = math.random(1,9)\n\tend\n\treturn result\nend\n\nlocal function check(answer, digits)\n\tlocal adig = {}\n\tlocal ddig = {}\n\tlocal index\n\tlocal lastWasDigit = false\n\tfor i=1,9 do adig[i] = 0 ddig[i] = 0 end\n\tallowed = {['(']=true,[')']=true,[' ']=true,['+']=true,['-']=true,['*']=true,['/']=true,['\\t']=true,['1']=true,['2']=true,['3']=true,['4']=true,['5']=true,['6']=true,['7']=true,['8']=true,['9']=true}\n\tfor i=1,string.len(answer) do\n\t\tif not allowed[string.sub(answer,i,i)] then\n\t\t\treturn false\n\t\tend\n\t\tindex = string.byte(answer,i)-48\n\t\tif index > 0 and index < 10 then\n\t\t\tif lastWasDigit then\n\t\t\t\treturn false\n\t\t\tend\n\t\t\tlastWasDigit = true\n\t\t\tadig[index] = adig[index] + 1\n\t\telse\n\t\t\tlastWasDigit = false\n\t\tend\n\tend\n\tfor i,digit in next,digits do\n\t\tddig[digit] = ddig[digit]+1\n\tend\n\tfor i=1,9 do\n\t\tif adig[i] ~= ddig[i] then\n\t\t\treturn false\n\t\tend\n\tend\n\treturn loadstring('return '..answer)()\nend\n\nlocal function game24()\n\thelp()\n\tmath.randomseed(os.time())\n\tmath.random()\n\tlocal digits = generate(4)\n\tlocal trial = 0\n\tlocal answer = 0\n\tlocal ans = false\n\tio.write 'Your four digits:'\n\tfor i,digit in next,digits do\n\t\tio.write (' ' .. digit)\n\tend\n\tprint()\n\twhile ans ~= 24 do\n\t\ttrial = trial + 1\n\t\tio.write(\"Expression \"..trial..\": \")\n\t\tanswer = io.read()\n\t\tif string.lower(answer) == 'q' then\n\t\t\tbreak\n\t\tend\n\t\tif answer == '!' then\n\t\t\tdigits = generate(4)\n\t\t\tio.write (\"New digits:\")\n\t\t\tfor i,digit in next,digits do\n\t\t\t\tio.write (' ' .. digit)\n\t\t\tend\n\t\t\tprint()\n\t\telse\n\t\t\tans = check(answer,digits)\n\t\t\tif ans == false then\n\t\t\t\tprint ('The input '.. answer ..' was wonky!')\n\t\t\telse\n\t\t\t\tprint (' = '.. ans)\n\t\t\t\tif ans == 24 then\n\t\t\t\t\tprint (\"Thats right!\")\n\t\t\t\tend\n\t\t\tend\n\t\tend\n\tend\nend\ngame24()\n",
        "safe": true
    },
    {
        "filename": "24 game_96.txt",
        "content": "function twentyfour()\n   print [[\n The 24 Game\n \n Given any four digits in the range 1 to 9, which may have repetitions,\n Using just the +, -, *, and / operators; and the possible use of\n brackets, (), show how to make an answer of 24.\n \n An answer of \"q\" will quit the game.\n An answer of \"!\" will generate a new set of four digits.\n \n Note: you cannot form multiple digit numbers from the supplied digits,\n so an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\n \n ]]\n   expr = re.compile[[   --matches properly formatted infix expressions and returns all numerals as captures\n         expr <- (!.) / (<paren> / <number>) (<ws> <oper> <ws> <expr>)?\n         number <- {[0-9]}\n         ws <- \" \"*\n         oper <- [-+/*]\n         paren <- \"(\" <ws> <expr> <ws> \")\"   ]]\n   local val_t = {math.random(9), math.random(9), math.random(9), math.random(9)}\n   table.sort(val_t)\n   print(\"the digits are \" .. table.concat(val_t, \", \"))\n   local ex = io.read()\n   a, b, c, d, e = expr:match(ex)\n   if a and b and c and d and not e then --if there is a fifth numeral the player is cheating\n      local digs = {a + 0, b + 0, c + 0, d + 0}\n      local flag = false -- (terrorism!)\n      table.sort(digs)\n      for i = 1, 4 do\n\t   flag = digs[i] ~= val_t[i] and not print\"Wrong digits!\" or flag\n      end\n      if not flag and loadstring(\"return \" .. ex)() == 24 then\n         print\"You win!\"\n      else\n         print\"You lose.\"\n      end\n   else print\"wat\" --expression could not be interpreted as arithmetic\n   end\nend\ntwentyfour()\n",
        "safe": true
    },
    {
        "filename": "24 game_97.txt",
        "content": "play24\u00a0:= module()\n\texport ModuleApply;\n\tlocal cheating;\n\tcheating\u00a0:= proc(input, digits)\n\t\tlocal i, j, stringDigits;\n\t\tuse StringTools in\n\t\t\tstringDigits\u00a0:= Implode([seq(convert(i, string), i in digits)]);\n\t\t\tfor i in digits do\n\t\t\t\tfor j in digits do\n\t\t\t\t\tif Search(cat(convert(i, string), j), input) > 0 then\n\t\t\t\t\t\treturn true, \": Please don't combine digits to form another number.\"\n\t\t\t\t\tend if;\n\t\t\t\tend do;\n\t\t\tend do;\n\t\t\tfor i in digits do\n\t\t\t\tif CountCharacterOccurrences(input, convert(i, string)) < CountCharacterOccurrences(stringDigits, convert(i, string)) then\n\t\t\t\t\treturn true, \": Please use all digits.\";\n\t\t\t\tend if;\n\t\t\tend do;\n\t\t\tfor i in digits do\n\t\t\t\tif CountCharacterOccurrences(input, convert(i, string)) > CountCharacterOccurrences(stringDigits, convert(i, string)) then\n\t\t\t\t\treturn true, \": Please only use a digit once.\";\n\t\t\t\tend if;\n\t\t\tend do;\n\t\t\tfor i in input do\n\t\t\t\ttry\n\t\t\t\t\tif type(parse(i), numeric) and not member(parse(i), digits) then\n\t\t\t\t\t\treturn true, \": Please only use the digits you were given.\";\n\t\t\t\t\tend if;\n\t\t\t\tcatch:\n\t\t\t\tend try;\n\t\t\tend do;\n\t\t\treturn false, \"\";\n\t\tend use;\n\tend proc:\n\t\n\tModuleApply\u00a0:= proc()\n\t\tlocal replay, digits, err, message, answer;\n\t\trandomize():\n\t\treplay\u00a0:= \"\":\n\t\twhile not replay = \"END\" do\n\t\t\tif not replay = \"YES\" then\n\t\t\t\tdigits\u00a0:= [seq(rand(1..9)(), i = 1..4)]:\n\t\t\tend if;\n\t\t\terr\u00a0:= true:\n\t\t\twhile err do\n\t\t\t\tmessage\u00a0:= \"\";\n\t\t\t\tprintf(\"Please make 24 from the digits: %a. Press enter for a new set of numbers or type END to quit\\n\", digits);\n\t\t\t\tanswer\u00a0:= StringTools[UpperCase](readline());\n\t\t\t\tif not answer = \"\" and not answer = \"END\" then\n\t\t\t\t\ttry\n\t\t\t\t\t\tif not type(parse(answer), numeric) then\n\t\t\t\t\t\t\terror;\n\t\t\t\t\t\telif cheating(answer, digits)[1] then\n\t\t\t\t\t\t\tmessage\u00a0:= cheating(answer, digits)[2];\n\t\t\t\t\t\t\terror;\n\t\t\t\t\t\tend if;\n\t\t\t\t\t\terr\u00a0:= false;\n\t\t\t\t\tcatch:\n\t\t\t\t\t\tprintf(\"Invalid Input%s\\n\\n\", message);\n\t\t\t\t\tend try;\n\t\t\t\telse\n\t\t\t\t\terr\u00a0:= false;\n\t\t\t\tend if;\n\t\t\tend do:\n\t\t\tif not answer = \"\" and not answer = \"END\" then\n\t\t\t\tif parse(answer) = 24 then\n\t\t\t\t\tprintf(\"You win! Do you wish to play another game? (Press enter for a new set of numbers or END to quit.)\\n\");\n\t\t\t\t\treplay\u00a0:= StringTools[UpperCase](readline());\n\t\t\t\telse \n\t\t\t\t\tprintf(\"Your expression evaluated to %a. Try again!\\n\", parse(answer));\n\t\t\t\t\treplay\u00a0:= \"YES\";\n\t\t\t\tend if;\n\t\t\telse\n\t\t\t\treplay\u00a0:= answer;\n\t\t\tend if;\n\t\t\t\n\t\t\tprintf(\"\\n\");\n\t\tend do:\n\t\tprintf(\"GAME OVER\\n\");\n\tend proc:\nend module:\n\nplay24();",
        "safe": true
    },
    {
        "filename": "24 game_98.txt",
        "content": "Please make 24 from the digits: [4, 7, 6, 8]. Press enter for a new set of numbers or type END to quit\nYou win! Do you wish to play another game? (Press enter for a new set of numbers or END to quit.)\n\nPlease make 24 from the digits: [3, 7, 4, 7]. Press enter for a new set of numbers or type END to quit\nYour expression evaluated to 21. Try again!\n\nPlease make 24 from the digits: [3, 7, 4, 7]. Press enter for a new set of numbers or type END to quit\n\nGAME OVER\n",
        "safe": true
    },
    {
        "filename": "24 game_99.txt",
        "content": "isLegal[n_List, x_String] := \n Quiet[Check[\n   With[{h = ToExpression[x, StandardForm, HoldForm]}, \n    If[Cases[Level[h, {2, \\[Infinity]}, Hold, Heads -> True], \n        Except[_Integer | Plus | _Plus | Times | _Times | Power | \n          Power[_, -1]]] === {} && \n      Sort[Level[h /. Power[q_, -1] -> q, {-1}] /. \n         q_Integer -> Abs[q]] === Sort[n], ReleaseHold[h]]], Null]]\nGrid[{{Button[\n    \"new numbers\", {a, b, c, d} = Table[RandomInteger[{1, 9}], {4}]], \n   InputField[Dynamic[x], String]}, {Dynamic[{a, b, c, d}], \n   Dynamic[Switch[isLegal[{a, b, c, d}, x], Null, \n     \"Sorry, that is invalid.\", 24, \"Congrats! That's 24!\", _, \n     \"Sorry, that makes \" <> ToString[ToExpression@x, InputForm] <> \n      \", not 24.\"]]}}]\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_1.txt",
        "content": "[Char = ((Float, Float) -> Float)] op\nop[Char(\u2018+\u2019)] = (x, y) -> x + y\nop[Char(\u2018-\u2019)] = (x, y) -> x - y\nop[Char(\u2018*\u2019)] = (x, y) -> x * y\nop[Char(\u2018/\u2019)] = (x, y) -> I y\u00a0!= 0 {x / y} E 9999999\n\nF almost_equal(a, b)\n   R abs(a - b) <= 1e-5\n\nF solve(nums)\n   V syms = \u2018+-*/\u2019\n   V sorted_nums = sorted(nums).map(Float)\n   L(x, y, z) cart_product(syms, syms, syms)\n      V n = copy(sorted_nums)\n      L\n         V (a, b, c, d) = (n[0], n[1], n[2], n[3])\n         I almost_equal(:op[x](:op[y](a, b), :op[z](c, d)), 24.0)\n            R \u2018(\u2019a\u2018 \u2019y\u2018 \u2019b\u2018) \u2019x\u2018 (\u2019c\u2018 \u2019z\u2018 \u2019d\u2018)\u2019\n         I almost_equal(:op[x](a, :op[y](b, :op[z](c, d))), 24.0)\n            R a\u2018 \u2019x\u2018 (\u2019b\u2018 \u2019y\u2018 (\u2019c\u2018 \u2019z\u2018 \u2019d\u2018))\u2019\n         I almost_equal(:op[x](:op[y](:op[z](c, d), b), a), 24.0)\n            R \u2018((\u2019c\u2018 \u2019z\u2018 \u2019d\u2018) \u2019y\u2018 \u2019b\u2018) \u2019x\u2018 \u2019a\n         I almost_equal(:op[x](:op[y](b, :op[z](c, d)), a), 24.0)\n            R \u2018(\u2019b\u2018 \u2019y\u2018 (\u2019c\u2018 \u2019z\u2018 \u2019d\u2018)) \u2019x\u2018\u2019a\n         I !n.next_permutation()\n            L.break\n   R \u2018not found\u2019\n\nL(nums) [[9, 4, 4, 5],\n         [1, 7, 2, 7],\n         [5, 7, 5, 4],\n         [1, 4, 6, 6],\n         [2, 3, 7, 3],\n         [8, 7, 9, 7],\n         [1, 6, 2, 6],\n         [7, 9, 4, 1],\n         [6, 4, 2, 2],\n         [5, 7, 9, 7],\n         [3, 3, 8, 8]]\n   print(\u2018solve(\u2019nums\u2018) -> \u2019solve(nums))",
        "safe": true
    },
    {
        "filename": "24 game_Solve_10.txt",
        "content": "New game (y/n)\u00a0?\ny\nThe four digits are 8 3 9 1 and the score is 24.\nSolution\u00a0:\n8*9=72\n3*1=3\n72/3=24\n\nNew game (y/n)\u00a0?\ny\nThe four digits are 7 7 9 4 and the score is 24.\nNo solution for this problem\u00a0!!\n\nNew game (y/n)\u00a0?\ny\nThe four digits are 3 5 8 9 and the score is 24.\nSolution\u00a0:\n3*9=27\n8-5=3\n27-3=24\n\nNew game (y/n)\u00a0?\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_100.txt",
        "content": "editvar /modify -random- = <10\n:a\neditvar /newvar /withothervar /value=-random- /title=1\neditvar /newvar /withothervar /value=-random- /title=2\neditvar /newvar /withothervar /value=-random- /title=3\neditvar /newvar /withothervar /value=-random- /title=4\nprintline These are your four digits: -1- -2- -3- -4-\nprintline Use an algorithm to make the number 24.\neditvar /newvar /value=a /userinput=1 /title=Algorithm:\ndo -a-\nif -a- /hasvalue 24 printline Your algorithm worked! & goto :b (\n) else printline Your algorithm did not work.\neditvar /newvar /value=b /userinput=1 /title=Do you want to see how you could have done it?\nif -b- /hasvalue y goto :c else goto :b\n:b \neditvar /newvar /value=c /userinput=1 /title=Do you want to play again?\nif -c- /hasvalue y goto :a else exitcurrentprogram\n:c\neditvar /newvar /value=do -1- + -2- + -3- + -4- /title=c & do -c- >d & if -d- /hasvalue 24 goto :solve\neditvar /newvar /value=do -1- - -2- + -3- + -4- /title=c & do -c- >d & if -d- /hasvalue 24 goto :solve\neditvar /newvar /value=do -1- / -2- + -3- + -4- /title=c & do -c- >d & if -d- /hasvalue 24 goto :solve\neditvar /newvar /value=do -1- * -2- + -3- + -4- /title=c & do -c- >d & if -d- /hasvalue 24 goto :solve\neditvar /newvar /value=do -1- + -2- - -3- + -4- /title=c & do -c- >d & if -d- /hasvalue 24 goto :solve\neditvar /newvar /value=do -1- + -2- / -3- + -4- /title=c & do -c- >d & if -d- /hasvalue 24 goto :solve\neditvar /newvar /value=do -1- + -2- * -3- + -4- /title=c & do -c- >d & if -d- /hasvalue 24 goto :solve\neditvar /newvar /value=do -1- + -2- + -3- - -4- /title=c & do -c- >d & if -d- /hasvalue 24 goto :solve\neditvar /newvar /value=do -1- + -2- + -3- / -4- /title=c & do -c- >d & if -d- /hasvalue 24 goto :solve\neditvar /newvar /value=do -1- + -2- + -3- * -4- /title=c & do -c- >d & if -d- /hasvalue 24 goto :solve\neditvar /newvar /value=do -1- - -2- - -3- - -4- /title=c & do -c- >d & if -d- /hasvalue 24 goto :solve\neditvar /newvar /value=do -1- / -2- / -3- / -4- /title=c & do -c- >d & if -d- /hasvalue 24 goto :solve\neditvar /newvar /value=do -1- * -2- * -3- * -4- /title=c & do -c- >d & if -d- /hasvalue 24 goto :solve\n:solve\nprintline you could have done it by doing -c-\nstoptask\ngoto :b",
        "safe": true
    },
    {
        "filename": "24 game_Solve_101.txt",
        "content": "These are your four digits: 1 4 5 2\nUse an algorithm to make the number 24.\nAlgorithm: 4 + 2 - 5 + 1\nYour algorithm did not work. \nDo you want to play again? y\n\nThese are your four digits: 1 8 9 6\nUse an algorithm to make the number 24.\nAlgorithm: 1 + 8 + 9 + 6\nYour algorithm worked!\nDo you want to play again? n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_102.txt",
        "content": "play24(Len, Range, Goal) :-\n\tgame(Len, Range, Goal, L, S),\n\tmaplist(my_write, L),\n\tformat(': ~w~n', [S]).\n\ngame(Len, Range, Value, L, S) :-\n\tlength(L, Len),\n\tmaplist(choose(Range), L),\n\tcompute(L, Value, [], S).\n\n\nchoose(Range, V) :-\n\tV is random(Range) + 1.\n\n\nwrite_tree([M], [M]).\n\nwrite_tree([+, M, N], S) :-\n\twrite_tree(M, MS),\n\twrite_tree(N, NS),\n\tappend(MS, [+ | NS], S).\n\nwrite_tree([-, M, N], S) :-\n\twrite_tree(M, MS),\n\twrite_tree(N, NS),\n\t(   is_add(N) -> append(MS, [-, '(' | NS], Temp), append(Temp, ')', S)\n\t;   append(MS, [- | NS], S)).\n\n\nwrite_tree([Op, M, N], S) :-\n\tmember(Op, [*, /]),\n\twrite_tree(M, MS),\n\twrite_tree(N, NS),\n\t(   is_add(M) -> append(['(' | MS], [')'], TempM)\n\t;  TempM = MS),\n\t(   is_add(N) -> append(['(' | NS], [')'], TempN)\n\t;   TempN = NS),\n\tappend(TempM, [Op | TempN], S).\n\nis_add([Op, _, _]) :-\n\tmember(Op, [+, -]).\n\ncompute([Value], Value, [[_R-S1]], S) :-\n\twrite_tree(S1, S2),\n\twith_output_to(atom(S), maplist(write, S2)).\n\ncompute(L, Value, CS, S) :-\n\tselect(M, L, L1),\n\tselect(N, L1, L2),\n\tnext_value(M, N, R, CS, Expr),\n\tcompute([R|L2], Value, Expr, S).\n\nnext_value(M, N, R, CS,[[R - [+, M1, N1]] | CS2]) :-\n\tR is M+N,\n\t(   member([M-ExprM], CS) -> select([M-ExprM], CS, CS1), M1 = ExprM\n\t;   M1 = [M], CS1 = CS\n\t),\n\t(   member([N-ExprN], CS1) -> select([N-ExprN], CS1, CS2), N1 = ExprN\n\t;   N1 = [N], CS2 = CS1\n\t).\n\nnext_value(M, N, R, CS,[[R - [-, M1, N1]] | CS2]) :-\n\tR is M-N,\n\t(   member([M-ExprM], CS) -> select([M-ExprM], CS, CS1), M1 = ExprM\n\t;   M1 = [M], CS1 = CS\n\t),\n\t(   member([N-ExprN], CS1) -> select([N-ExprN], CS1, CS2), N1 = ExprN\n\t;   N1 = [N], CS2 = CS1\n\t).\n\nnext_value(M, N, R, CS,[[R - [*, M1, N1]] | CS2]) :-\n\tR is M*N,\n\t(   member([M-ExprM], CS) -> select([M-ExprM], CS, CS1), M1 = ExprM\n\t;   M1 = [M], CS1 = CS\n\t),\n\t(   member([N-ExprN], CS1) -> select([N-ExprN], CS1, CS2), N1 = ExprN\n\t;   N1 = [N], CS2 = CS1\n\t).\n\nnext_value(M, N, R, CS,[[R - [/, M1, N1]] | CS2]) :-\n\tN \\= 0,\n\tR is rdiv(M,N),\n\t(   member([M-ExprM], CS) -> select([M-ExprM], CS, CS1), M1 = ExprM\n\t;   M1 = [M], CS1 = CS\n\t),\n\t(   member([N-ExprN], CS1) -> select([N-ExprN], CS1, CS2), N1 = ExprN\n\t;   N1 = [N], CS2 = CS1\n\t).\n\nmy_write(V) :-\n\tformat('~w ', [V]).\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_103.txt",
        "content": "?- play24(4,9, 24).\n6 2 3 4\u00a0: (6-2+4)*3\ntrue\u00a0;\n6 2 3 4\u00a0: 3*(6-2+4)\ntrue\u00a0;\n6 2 3 4\u00a0: (6-2+4)*3\ntrue\u00a0;\n6 2 3 4\u00a0: 3*(6-2+4)\ntrue\u00a0;\n6 2 3 4\u00a0: (6*2-4)*3\ntrue\u00a0;\n6 2 3 4\u00a0: 3*(6*2-4)\ntrue\u00a0;\n6 2 3 4\u00a0: 3*4+6*2\ntrue\u00a0;\n6 2 3 4\u00a0: 3*4+6*2\ntrue\u00a0;\n6 2 3 4\u00a0: 4*3+6*2\ntrue\u00a0;\n6 2 3 4\u00a0: 4*3+6*2\ntrue\u00a0;\n6 2 3 4\u00a0: (6/2+3)*4\ntrue\u00a0;\n6 2 3 4\u00a0: 4*(6/2+3)\ntrue\u00a0;\n6 2 3 4\u00a0: (6/2+3)*4\ntrue\u00a0;\n6 2 3 4\u00a0: 4*(6/2+3)\ntrue\u00a0;\n6 2 3 4\u00a0: (6-3)*2*4\ntrue\u00a0;\n6 2 3 4\u00a0: 4*(6-3)*2\ntrue\u00a0;\n6 2 3 4\u00a0: (6-3)*4*2\n...\n\n?- play24(7,99, 1).\n66 40 2 76 95 59 12\u00a0: (66+40)/2-76+95-59-12\ntrue\u00a0;\n66 40 2 76 95 59 12\u00a0: (66+40)/2-76+95-12-59\ntrue\u00a0;\n66 40 2 76 95 59 12\u00a0: (66+40)/2-76-59+95-12\ntrue\u00a0;\n66 40 2 76 95 59 12\u00a0: (66+40)/2-76-59-12+95\ntrue\u00a0;\n66 40 2 76 95 59 12\u00a0: 95+(66+40)/2-76-59-12\ntrue\u00a0;\n66 40 2 76 95 59 12\u00a0: 95+(66+40)/2-76-59-12\ntrue\u00a0;\n66 40 2 76 95 59 12\u00a0: 95-12+(66+40)/2-76-59\ntrue\u00a0;\n66 40 2 76 95 59 12\u00a0: (66+40)/2-76-59+95-12\n....\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_104.txt",
        "content": ":- initialization(main).\n\nsolve(N,Xs,Ast) :-\n    Err = evaluation_error(zero_divisor)\n  , gen_ast(Xs,Ast), catch(Ast =:= N, error(Err,_), fail)\n  .\n\ngen_ast([N],N) :- between(1,9,N).\ngen_ast(Xs,Ast) :-\n    Ys = [_|_], Zs = [_|_], split(Xs,Ys,Zs)\n  , ( member(Op, [(+),(*)]), Ys @=< Zs ; member(Op, [(-),(//)]) )\n  , gen_ast(Ys,A), gen_ast(Zs,B), Ast =.. [Op,A,B]\n  .\n\nsplit(Xs,Ys,Zs) :- sublist(Ys,Xs), select_all(Ys,Xs,Zs).\n    % where\n    select_all([],Xs,Xs).\n    select_all([Y|Ys],Xs,Zs) :- select(Y,Xs,X1), !, select_all(Ys,X1,Zs).\n\n\ntest(T) :- solve(24, [2,3,8,9], T).\nmain :- forall(test(T), (write(T), nl)), halt.\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_105.txt",
        "content": "(9-3)*8//2\n3*8-2//9\n(8+9)//2*3\n(8-2//9)*3\n(2//9+8)*3\n(2+8*9)//3\n2//9+3*8\n8//2*(9-3)\n(9-3)//2*8\n(9-2*3)*8\n(3-2//9)*8\n(2//9+3)*8\n(2+9)//3*8",
        "safe": true
    },
    {
        "filename": "24 game_Solve_106.txt",
        "content": "'''\n The 24 Game Player\n \n Given any four digits in the range 1 to 9, which may have repetitions,\n Using just the +, -, *, and / operators; and the possible use of\n brackets, (), show how to make an answer of 24.\n \n An answer of \"q\"  will quit the game.\n An answer of \"!\"  will generate a new set of four digits.\n An answer of \"!!\" will ask you for a new set of four digits.\n An answer of \"?\"  will compute an expression for the current digits.\n \n Otherwise you are repeatedly asked for an expression until it evaluates to 24\n \n Note: you cannot form multiple digit numbers from the supplied digits,\n so an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\n \n'''\n \nfrom   __future__ import division, print_function\nfrom   itertools  import permutations, combinations, product, \\\n                         chain\nfrom   pprint     import pprint as pp\nfrom   fractions  import Fraction as F\nimport random, ast, re\nimport sys\n \nif sys.version_info[0] < 3:\n    input = raw_input\n    from itertools import izip_longest as zip_longest\nelse:\n    from itertools import zip_longest\n \n \ndef choose4():\n    'four random digits >0 as characters'\n    return [str(random.randint(1,9)) for i in range(4)]\n \ndef ask4():\n    'get four random digits >0 from the player'\n    digits = ''\n    while len(digits) != 4 or not all(d in '123456789' for d in digits):\n        digits = input('Enter the digits to solve for: ')\n        digits = ''.join(digits.strip().split())\n    return list(digits)\n \ndef welcome(digits):\n    print (__doc__)\n    print (\"Your four digits: \" + ' '.join(digits))\n \ndef check(answer, digits):\n    allowed = set('() +-*/\\t'+''.join(digits))\n    ok = all(ch in allowed for ch in answer) and \\\n         all(digits.count(dig) == answer.count(dig) for dig in set(digits)) \\\n         and not re.search('\\d\\d', answer)\n    if ok:\n        try:\n            ast.parse(answer)\n        except:\n            ok = False\n    return ok\n \ndef solve(digits):\n    \"\"\"\\\n    >>> for digits in '3246 4788 1111 123456 1127 3838'.split():\n            solve(list(digits))\n \n \n    Solution found: 2 + 3 * 6 + 4\n    '2 + 3 * 6 + 4'\n    Solution found: ( 4 + 7 - 8 ) * 8\n    '( 4 + 7 - 8 ) * 8'\n    No solution found for: 1 1 1 1\n    '!'\n    Solution found: 1 + 2 + 3 * ( 4 + 5 ) - 6\n    '1 + 2 + 3 * ( 4 + 5 ) - 6'\n    Solution found: ( 1 + 2 ) * ( 1 + 7 )\n    '( 1 + 2 ) * ( 1 + 7 )'\n    Solution found: 8 / ( 3 - 8 / 3 )\n    '8 / ( 3 - 8 / 3 )'\n    >>> \"\"\"\n    digilen = len(digits)\n    # length of an exp without brackets \n    exprlen = 2 * digilen - 1\n    # permute all the digits\n    digiperm = sorted(set(permutations(digits)))\n    # All the possible operator combinations\n    opcomb   = list(product('+-*/', repeat=digilen-1))\n    # All the bracket insertion points:\n    brackets = ( [()] + [(x,y)\n                         for x in range(0, exprlen, 2)\n                         for y in range(x+4, exprlen+2, 2)\n                         if (x,y) != (0,exprlen+1)]\n                 + [(0, 3+1, 4+2, 7+3)] ) # double brackets case\n    for d in digiperm:\n        for ops in opcomb:\n            if '/' in ops:\n                d2 = [('F(%s)' % i) for i in d] # Use Fractions for accuracy\n            else:\n                d2 = d\n            ex = list(chain.from_iterable(zip_longest(d2, ops, fillvalue='')))\n            for b in brackets:\n                exp = ex[::]\n                for insertpoint, bracket in zip(b, '()'*(len(b)//2)):\n                    exp.insert(insertpoint, bracket)\n                txt = ''.join(exp)\n                try:\n                    num = eval(txt)\n                except ZeroDivisionError:\n                    continue\n                if num == 24:\n                    if '/' in ops:\n                        exp = [ (term if not term.startswith('F(') else term[2])\n                               for term in exp ]\n                    ans = ' '.join(exp).rstrip()\n                    print (\"Solution found:\",ans)\n                    return ans\n    print (\"No solution found for:\", ' '.join(digits))            \n    return '!'\n \ndef main():    \n    digits = choose4()\n    welcome(digits)\n    trial = 0\n    answer = ''\n    chk = ans = False\n    while not (chk and ans == 24):\n        trial +=1\n        answer = input(\"Expression %i: \" % trial)\n        chk = check(answer, digits)\n        if answer == '?':\n            solve(digits)\n            answer = '!'\n        if answer.lower() == 'q':\n            break\n        if answer == '!':\n            digits = choose4()\n            trial = 0\n            print (\"\\nNew digits:\", ' '.join(digits))\n            continue\n        if answer == '!!':\n            digits = ask4()\n            trial = 0\n            print (\"\\nNew digits:\", ' '.join(digits))\n            continue\n        if not chk:\n            print (\"The input '%s' was wonky!\" % answer)\n        else:\n            if '/' in answer:\n                # Use Fractions for accuracy in divisions\n                answer = ''.join( (('F(%s)' % char) if char in '123456789' else char)\n                                  for char in answer )\n            ans = eval(answer)\n            print (\" = \", ans)\n            if ans == 24:\n                print (\"Thats right!\")\n    print (\"Thank you and goodbye\")   \n \nmain()\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_107.txt",
        "content": " The 24 Game Player\n\n Given any four digits in the range 1 to 9, which may have repetitions,\n Using just the +, -, *, and / operators; and the possible use of\n brackets, (), show how to make an answer of 24.\n\n An answer of \"q\" will quit the game.\n An answer of \"!\" will generate a new set of four digits.\n An answer of \"?\" will compute an expression for the current digits.\n \n Otherwise you are repeatedly asked for an expression until it evaluates to 24\n\n Note: you cannot form multiple digit numbers from the supplied digits,\n so an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\n\n\nYour four digits: 6 7 9 5\nExpression 1:\u00a0?\nSolution found: 6 - ( 5 - 7 ) * 9\nThank you and goodbye",
        "safe": true
    },
    {
        "filename": "24 game_Solve_108.txt",
        "content": "...\nExpression 1:\u00a0!!\nEnter the digits to solve for: 3388\n\nNew digits: 3 3 8 8\nExpression 1: 8/(3-(8/3))\n =  24\nThats right!\nThank you and goodbye",
        "safe": true
    },
    {
        "filename": "24 game_Solve_109.txt",
        "content": "...\nExpression 1:\u00a0!!\nEnter the digits to solve for: 3388\n\nNew digits: 3 3 8 8\nExpression 1:\u00a0?\nSolution found: 8 / ( 3 - 8 / 3 )",
        "safe": true
    },
    {
        "filename": "24 game_Solve_11.txt",
        "content": "#NoEnv\nInputBox, NNNN      \u00a0; user input 4 digits\nNNNN := RegExReplace(NNNN, \"(\\d)(?=\\d)\", \"$1,\")\u00a0; separate with commas for the sort command\nsort NNNN, d`,\u00a0; sort in ascending order for the permutations to work\nStringReplace NNNN, NNNN, `,, , All\u00a0; remove comma separators after sorting\n\nops := \"+-*/\"\npatterns := [\t \"x x.x.x.\"\n\t\t,\"x x.x x..\"\n\t\t,\"x x x..x.\"\n\t\t,\"x x x.x..\"\n\t\t,\"x x x x...\"\t]\n\n; build bruteforce operator list (\"+++, ++-, ++* ... ///\")\na := b := c := 0\nWhile (++a<5){\n While (++b<5){\n  While (++c<5){\n   l := SubStr(ops, a, 1) . SubStr(ops, b, 1) . SubStr(ops, c, 1)\n\n  \u00a0; build bruteforce template (\"x x+x+x+, x x+x x++ ... x x x x///\")\n   For each, pattern in patterns\n   {\n      Loop 3\n         StringReplace, pattern, pattern, ., % SubStr(l, A_Index, 1)\n      pat .= pattern \"`n\"\n   }\n  }c := 0\n }b := 0\n}\nStringTrimRight, pat, pat, 1\u00a0; remove trailing newline\n\n\n; permutate input. As the lexicographic algorithm is used, each permutation generated is unique\nWhile NNNN\n{\n\tStringSplit, N, NNNN\n\t; substitute numbers in for x's and evaluate\n\tLoop Parse, pat, `n\n\t{\n\t\teval := A_LoopField\u00a0; current line\n\t\tLoop 4\n\t\t\tStringReplace, eval, eval, x, % N%A_Index%\u00a0; substitute number for \"x\"\n\t\tIf Round(evalRPN(eval), 4) = 24\n\t\t\tfinal .= eval \"`n\"\n\t}\n\tNNNN := perm_next(NNNN)\u00a0; next lexicographic permutation of user's digits\n}\nMsgBox % final ? clipboard := final : \"No solution\"\n\n; simple stack-based evaluation. Integers only. Whitespace is used to push a value.\nevalRPN(s){\n\tstack := []\n\tLoop Parse, s\n\t\tIf A_LoopField is number\n\t\t\tt .= A_LoopField\n\t\telse\n\t\t{\n\t\t\tIf t\n\t\t\t\tstack.Insert(t), t := \"\"\n\t\t\tIf InStr(\"+-/*\", l := A_LoopField)\n\t\t\t{\n\t\t\t\ta := stack.Remove(), b := stack.Remove()\n\t\t\t\tstack.Insert(\t l = \"+\" ? b + a\n\t\t\t\t\t\t:l = \"-\" ? b - a\n\t\t\t\t\t\t:l = \"*\" ? b * a\n\t\t\t\t\t\t:l = \"/\" ? b / a\n\t\t\t\t\t\t:0\t)\n\t\t\t}\n\t\t}\n\treturn stack.Remove()\n}\n\n\n\nperm_Next(str){\n\tp := 0, sLen := StrLen(str)\n\tLoop % sLen\n\t{\n\t\tIf A_Index=1\n\t\t\tcontinue\n\t\tt := SubStr(str, sLen+1-A_Index, 1)\n\t\tn := SubStr(str, sLen+2-A_Index, 1)\n\t\tIf ( t < n )\n\t\t{\n\t\t\tp := sLen+1-A_Index, pC := SubStr(str, p, 1)\n\t\t\tbreak\n\t\t}\n\t}\n\tIf !p\n\t\treturn false\n\tLoop\n\t{\n\t\tt := SubStr(str, sLen+1-A_Index, 1)\n\t\tIf ( t > pC )\n\t\t{\n\t\t\tn := sLen+1-A_Index, nC := SubStr(str, n, 1)\n\t\t\tbreak\n\t\t}\n\t}\n\treturn SubStr(str, 1, p-1) . nC . Reverse(SubStr(str, p+1, n-p-1) . pC .  SubStr(str, n+1))\n}\n\nReverse(s){\n\tLoop Parse, s\n\t\to := A_LoopField o\n\treturn o\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_110.txt",
        "content": "# -*- coding: utf-8 -*-\nimport operator\nfrom itertools import product, permutations\n\ndef mydiv(n, d):\n    return n / d if d != 0 else 9999999\n\nsyms = [operator.add, operator.sub, operator.mul, mydiv]\nop = {sym: ch for sym, ch in zip(syms, '+-*/')}\n\ndef solve24(nums):\n    for x, y, z in product(syms, repeat=3):\n        for a, b, c, d in permutations(nums):\n            if round(x(y(a,b),z(c,d)),5) == 24:\n                return f\"({a} {op[y]} {b}) {op[x]} ({c} {op[z]} {d})\"\n            elif round(x(a,y(b,z(c,d))),5) == 24:\n                return f\"{a} {op[x]} ({b} {op[y]} ({c} {op[z]} {d}))\"\n            elif round(x(y(z(c,d),b),a),5) == 24:\n                return f\"(({c} {op[z]} {d}) {op[y]} {b}) {op[x]} {a}\"\n            elif round(x(y(b,z(c,d)),a),5) == 24:\n                return f\"({b} {op[y]} ({c} {op[z]} {d})) {op[x]} {a}\"\n    return '--Not Found--'\n\nif __name__ == '__main__':\n    #nums = eval(input('Four integers in the range 1:9 inclusive, separated by commas: '))\n    for nums in [\n        [9,4,4,5],\n        [1,7,2,7],\n        [5,7,5,4],\n        [1,4,6,6],\n        [2,3,7,3],\n        [8,7,9,7],\n        [1,6,2,6],\n        [7,9,4,1],\n        [6,4,2,2],\n        [5,7,9,7],\n        [3,3,8,8],  # Difficult case requiring precise division\n            ]:\n        print(f\"solve24({nums}) -> {solve24(nums)}\")\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_111.txt",
        "content": "solve24([9, 4, 4, 5]) -> --Not Found--\nsolve24([1, 7, 2, 7]) -> ((7 * 7) - 1) / 2\nsolve24([5, 7, 5, 4]) -> 4 * (7 - (5 / 5))\nsolve24([1, 4, 6, 6]) -> 6 + (6 * (4 - 1))\nsolve24([2, 3, 7, 3]) -> ((2 + 7) * 3) - 3\nsolve24([8, 7, 9, 7]) -> --Not Found--\nsolve24([1, 6, 2, 6]) -> 6 + (6 * (1 + 2))\nsolve24([7, 9, 4, 1]) -> (7 - 4) * (9 - 1)\nsolve24([6, 4, 2, 2]) -> (2 - 2) + (6 * 4)\nsolve24([5, 7, 9, 7]) -> (5 + 7) * (9 - 7)\nsolve24([3, 3, 8, 8]) -> 8 / (3 - (8 / 3))",
        "safe": true
    },
    {
        "filename": "24 game_Solve_112.txt",
        "content": "# -*- coding: utf-8 -*-\n# Python 3\nfrom operator import mul, sub, add\n\n\ndef div(a, b):\n    if b == 0:\n        return 999999.0\n    return a / b\n\nops = {mul: '*', div: '/', sub: '-', add: '+'}\n\ndef solve24(num, how, target):\n    if len(num) == 1:\n        if round(num[0], 5) == round(target, 5):\n            yield str(how[0]).replace(',', '').replace(\"'\", '')\n    else:\n        for i, n1 in enumerate(num):\n            for j, n2 in enumerate(num):\n                if i != j:\n                    for op in ops:\n                        new_num = [n for k, n in enumerate(num) if k != i and k != j] + [op(n1, n2)]\n                        new_how = [h for k, h in enumerate(how) if k != i and k != j] + [(how[i], ops[op], how[j])]\n                        yield from solve24(new_num, new_how, target)\n\ntests = [\n         [1, 7, 2, 7],\n         [5, 7, 5, 4],\n         [1, 4, 6, 6],\n         [2, 3, 7, 3],\n         [1, 6, 2, 6],\n         [7, 9, 4, 1],\n         [6, 4, 2, 2],\n         [5, 7, 9, 7],\n         [3, 3, 8, 8],  # Difficult case requiring precise division\n         [8, 7, 9, 7],  # No solution\n         [9, 4, 4, 5],  # No solution\n            ]\nfor nums in tests:\n    print(nums, end='\u00a0: ')\n    try:\n        print(next(solve24(nums, nums, 24)))\n    except StopIteration:\n        print(\"No solution found\")\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_113.txt",
        "content": "[1, 7, 2, 7]\u00a0: (((7 * 7) - 1) / 2)\n[5, 7, 5, 4]\u00a0: (4 * (7 - (5 / 5)))\n[1, 4, 6, 6]\u00a0: (6 - (6 * (1 - 4)))\n[2, 3, 7, 3]\u00a0: ((2 * 3) * (7 - 3))\n[1, 6, 2, 6]\u00a0: ((1 * 6) * (6 - 2))\n[7, 9, 4, 1]\u00a0: ((7 - 4) * (9 - 1))\n[6, 4, 2, 2]\u00a0: ((6 * 4) * (2 / 2))\n[5, 7, 9, 7]\u00a0: ((5 + 7) * (9 - 7))\n[3, 3, 8, 8]\u00a0: (8 / (3 - (8 / 3)))\n[8, 7, 9, 7]\u00a0: No solution found\n[9, 4, 4, 5]\u00a0: No solution found",
        "safe": true
    },
    {
        "filename": "24 game_Solve_114.txt",
        "content": "''' Python 3.6.5 code using Tkinter graphical user interface.\n    Combination of '24 game' and '24 game/Solve'\n    allowing user or random selection of 4-digit number\n    and user or computer solution.\n    Note that all computer solutions are displayed'''\n\nfrom tkinter import *\nfrom tkinter import messagebox\nfrom tkinter.scrolledtext import ScrolledText\n# 'from tkinter import scrolledtext' in later versions? \nimport random\nimport itertools\n\n# ************************************************\n\nclass Game:\n    def __init__(self, gw):\n        self.window = gw\n        self.digits = '0000'\n\n        a1 = \"(Enter '4 Digits' & click 'My Digits'\"\n        a2 = \"or click 'Random Digits')\"\n        self.msga = a1 + '\\n' + a2\n\n        b1 = \"(Enter 'Solution' & click 'Check Solution'\"\n        b2 = \"or click 'Show Solutions')\"\n        self.msgb = b1 + '\\n' + b2\n\n        # top frame:\n        self.top_fr = Frame(gw,\n                            width=600,\n                            height=100,\n                            bg='dodger blue')\n        self.top_fr.pack(fill=X)\n\n        self.hdg = Label(self.top_fr,\n                         text='  24 Game  ',\n                         font='arial 22 bold',\n                         fg='navy',\n                         bg='lemon chiffon')\n        self.hdg.place(relx=0.5, rely=0.5,\n                       anchor=CENTER)\n\n        self.close_btn = Button(self.top_fr,\n                                text='Quit',\n                                bd=5,\n                                bg='navy',\n                                fg='lemon chiffon',\n                                font='arial 12 bold',\n                                command=self.close_window)\n        self.close_btn.place(relx=0.07, rely=0.5,\n                             anchor=W)\n\n        self.clear_btn = Button(self.top_fr,\n                                text='Clear',\n                                bd=5,\n                                bg='navy',\n                                fg='lemon chiffon',\n                                font='arial 12 bold',\n                                command=self.clear_screen)\n        self.clear_btn.place(relx=0.92, rely=0.5,\n                             anchor=E)\n\n        # bottom frame:\n        self.btm_fr = Frame(gw,\n                            width=600,\n                            height=500,\n                            bg='lemon chiffon')\n        self.btm_fr.pack(fill=X)\n   \n        self.msg = Label(self.btm_fr,\n                         text=self.msga,\n                         font='arial 16 bold',\n                         fg='navy',\n                         bg='lemon chiffon')\n        self.msg.place(relx=0.5, rely=0.1,\n                       anchor=CENTER)\n\n        self.user_dgt_btn = Button(self.btm_fr,\n                                   text='My Digits',\n                                   width=12,                 \n                                   bd=5,\n                                   bg='navy',\n                                   fg='lemon chiffon',\n                                   font='arial 12 bold',\n                                   command=self.get_digits)\n        self.user_dgt_btn.place(relx=0.07, rely=0.2,\n                                anchor=W)\n\n        self.rdm_dgt_btn = Button(self.btm_fr,\n                                  text='Random Digits',\n                                  width=12,\n                                  bd=5,\n                                  bg='navy',\n                                  fg='lemon chiffon',\n                                  font='arial 12 bold',\n                                  command=self.gen_digits)\n        self.rdm_dgt_btn.place(relx=0.92, rely=0.2,\n                               anchor=E)\n\n        self.dgt_fr = LabelFrame(self.btm_fr,\n                                 text='   4 Digits  ',\n                                 bg='dodger blue',\n                                 fg='navy',\n                                 bd=4,\n                                 relief=RIDGE,\n                                 font='arial 12 bold')\n        self.dgt_fr.place(relx=0.5, rely=0.27,\n                          anchor=CENTER)\n\n        self.digit_ent = Entry(self.dgt_fr,\n                               justify='center',\n                               font='arial 16 bold',\n                               fg='navy',\n                               disabledforeground='navy',\n                               bg='lemon chiffon',\n                               disabledbackground='lemon chiffon',\n                               bd=4,\n                               width=6)\n        self.digit_ent.grid(row=0, column=0,\n                            padx=(8,8),\n                            pady=(8,8))\n        \n        self.chk_soln_btn = Button(self.btm_fr,\n                                   text='Check Solution',\n                                   state='disabled',\n                                   width=14,                 \n                                   bd=5,\n                                   bg='navy',\n                                   fg='lemon chiffon',\n                                   font='arial 12 bold',\n                                   command=self.check_soln)\n        self.chk_soln_btn.place(relx=0.07, rely=.42,\n                                anchor=W)\n\n        self.show_soln_btn = Button(self.btm_fr,\n                                    text='Show Solutions',\n                                    state='disabled',\n                                    width=14,\n                                    bd=5,\n                                    bg='navy',\n                                    fg='lemon chiffon',\n                                    font='arial 12 bold',\n                                    command=self.show_soln)\n        self.show_soln_btn.place(relx=0.92, rely=.42,\n                                 anchor=E)\n\n        self.soln_fr = LabelFrame(self.btm_fr,\n                                  text='  Solution  ',\n                                  bg='dodger blue',\n                                  fg='navy',\n                                  bd=4,\n                                  relief=RIDGE,\n                                  font='arial 12 bold')\n        self.soln_fr.place(relx=0.07, rely=0.58,\n                           anchor=W)\n\n        self.soln_ent = Entry(self.soln_fr,\n                              justify='center',\n                              font='arial 16 bold',\n                              fg='navy',\n                              disabledforeground='navy',\n                              bg='lemon chiffon',\n                              disabledbackground='lemon chiffon',\n                              state='disabled',\n                              bd=4,\n                              width=15)\n        self.soln_ent.grid(row=0, column=0,\n                           padx=(8,8), pady=(8,8))\n\n        self.solns_fr = LabelFrame(self.btm_fr,\n                                   text='  Solutions  ',\n                                   bg='dodger blue',\n                                   fg='navy',\n                                   bd=4,\n                                   relief=RIDGE,\n                                   font='arial 12 bold')\n        self.solns_fr.place(relx=0.92, rely=0.5,\n                            anchor='ne')\n\n        self.solns_all = ScrolledText(self.solns_fr,\n                                      font='courier 14 bold',\n                                      state='disabled',\n                                      fg='navy',\n                                      bg='lemon chiffon',\n                                      height=8,\n                                      width=14)\n        self.solns_all.grid(row=0, column=0,\n                            padx=(8,8), pady=(8,8))\n\n    # validate '4 Digits' entry.\n    # save if valid and switch screen to solution mode.\n    def get_digits(self):\n        txt = self.digit_ent.get()\n        if not(len(txt) == 4 and txt.isdigit()):\n            self.err_msg('Please enter 4 digits (eg 1357)')\n            return\n        self.digits = txt       # save\n        self.reset_one()        # to solution mode\n        return\n\n    # generate 4 random digits, display them,\n    # save them, and switch screen to solution mode.\n    def gen_digits(self):\n        self.digit_ent.delete(0, 'end')\n        self.digits = ''.join([random.choice('123456789')\n                       for i in range(4)])\n        self.digit_ent.insert(0, self.digits)   # display\n        self.reset_one()        # to solution mode\n        return\n\n    # switch screen from get digits to solution mode:\n    def reset_one(self):\n        self.digit_ent.config(state='disabled')\n        self.user_dgt_btn.config(state='disabled')\n        self.rdm_dgt_btn.config(state='disabled')\n        self.msg.config(text=self.msgb)\n        self.chk_soln_btn.config(state='normal')\n        self.show_soln_btn.config(state='normal')\n        self.soln_ent.config(state='normal')\n        return\n\n    # edit user's solution:\n    def check_soln(self):\n        txt = self.soln_ent.get()   # user's expression\n        d = ''                      # save digits in expression\n        dgt_op = 'd'                # expecting d:digit or o:operation\n        for t in txt:\n            if t not in '123456789+-*/() ':\n                self.err_msg('Invalid character found: ' + t)\n                return\n            if t.isdigit():\n                if dgt_op == 'd':\n                    d += t\n                    dgt_op = 'o'\n                else:\n                    self.err_msg('Need operator between digits')\n                    return\n            if t in '+-*/':\n                if dgt_op == 'o':\n                    dgt_op = 'd'\n                else:\n                    self.err_msg('Need digit befor operator')\n                    return\n        if sorted(d) != sorted(self.digits):\n            self.err_msg(\"Use each digit in '4 Digits' once\")\n            return\n        try:\n            # round covers up Python's\n            # representation of floats\n            if round(eval(txt),5) == 24:\n                messagebox.showinfo(\n                    'Success',\n                    'YOUR SOLUTION IS VADLID!')\n                self.show_soln()        # show all solutions\n                return                     \n        except:\n            self.err_msg('Invalid arithmetic expression')\n            return\n        messagebox.showinfo(\n            'Failure',\n            'Your expression does not yield 24')\n        return              \n\n    # show all solutions:\n    def show_soln(self):\n        # get all sets of 3 operands: ('+', '+', '*'), ...)\n        ops = ['+-*/', '+-*/', '+-*/']\n        combs = [p for p in itertools.product(*ops)]\n        \n        # get unique permutations for requested 4 digits:\n        d = self.digits\n        perms = set([''.join(p) for p in itertools.permutations(d)])\n\n        # list of all (hopefully) expressions for\n        # 4 operands and 3 operations:\n        formats = ['Aop1Bop2Cop3D',\n                   '(Aop1Bop2C)op3D',\n                   '((Aop1B)op2C)op3D',\n                   '(Aop1(Bop2C))op3D',\n                   'Aop1Bop2(Cop3D)',\n                   'Aop1(Bop2C)op3D',\n                   '(Aop1B)op2Cop3D',\n                   '(Aop1B)op2(Cop3D)',\n                   'Aop1(Bop2Cop3D)',\n                   'Aop1((Bop2C)op3D)',\n                   'Aop1(Bop2(Cop3D))']\n\n        lox = []            # list of valid expressions\n        \n        for fm in formats:                      # pick a format\n            for c in combs:                     # plug in 3 ops\n                f = fm.replace('op1', c[0])\n                f = f.replace('op2', c[1])\n                f = f.replace('op3', c[2])\n                for A, B, C, D in perms:        # plug in 4 digits\n                    x = f.replace('A', A)\n                    x = x.replace('B', B)\n                    x = x.replace('C', C)\n                    x = x.replace('D', D)\n                    try:                        # evaluate expression\n                        # round covers up Python's\n                        # representation of floats\n                        if round(eval(x),5) == 24:\n                            lox.append(' ' + x)\n                    except ZeroDivisionError:   # can ignore these\n                        continue\n        if lox:\n            txt = '\\n'.join(x for x in lox)\n        else:\n            txt =' No Solution'   \n        self.solns_all.config(state='normal')\n        self.solns_all.insert('end', txt)       # show solutions\n        self.solns_all.config(state='disabled')\n\n        self.chk_soln_btn.config(state='disabled')\n        self.show_soln_btn.config(state='disabled')\n        self.soln_ent.config(state='disabled')\n        return\n\n    def err_msg(self, msg):\n        messagebox.showerror('Error Message', msg)\n        return  \n\n    # restore screen to it's 'initial' state:\n    def clear_screen(self):\n        self.digits = ''\n        self.digit_ent.config(state='normal')\n        self.user_dgt_btn.config(state='normal')\n        self.rdm_dgt_btn.config(state='normal')\n        self.digit_ent.delete(0, 'end')\n        self.chk_soln_btn.config(state='disabled')\n        self.show_soln_btn.config(state='disabled')\n        self.soln_ent.config(state='normal')\n        self.soln_ent.delete(0, 'end')\n        self.soln_ent.config(state='disabled')\n        self.msg.config(text=self.msga)\n        self.clear_solns_all()\n        return\n\n    # clear the 'Solutions' frame.\n    # note: state must be 'normal' to change data\n    def clear_solns_all(self):\n        self.solns_all.config(state='normal')\n        self.solns_all.delete(1.0, 'end')\n        self.solns_all.config(state='disabled')\n        return\n        \n    def close_window(self):\n        self.window.destroy()\n\n# ************************************************\n\nroot = Tk()\nroot.title('24 Game')\nroot.geometry('600x600+100+50')\nroot.resizable(False, False)\ng = Game(root)\nroot.mainloop()\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_115.txt",
        "content": "  [ ' [ 0 1 2 3 ]\n    permutations ] constant          is numorders (         --> [ )\n\n  [ []\n    4 3 ** times\n      [ [] i^\n        3 times\n          [ 4 /mod 4 +\n            rot join swap ]\n        drop \n        nested join ] ] constant     is oporders  (         --> [ )\n\n  [ [] numorders witheach\n      [ oporders witheach\n        [ dip dup join nested\n          rot swap join swap ]\n        drop ] ] constant            is allorders (         --> [ )\n\n  [ [] unrot witheach\n      [ dip dup peek\n        swap dip [ nested join ] ]\n    drop ]                           is reorder   (     [ [ --> [ )\n\n  [ ' [ [ 0 1 4 2 5 3 6 ]\n        [ 0 1 4 2 3 5 6 ]\n        [ 0 1 2 4 3 5 6 ] ]\n    witheach\n      [ dip dup reorder swap ]\n    4 pack ]                         is orderings (       [ --> [ )\n\n  [ witheach\n      [ dup number? iff n->v done\n        dup ' + = iff\n          [ drop v+ ] done\n        dup ' - = iff\n          [ drop v- ] done\n            ' * = iff v* done\n        v/ ]\n    24 n->v v- v0= ]                 is 24=       (       [ --> b )\n\n  [ 4 pack sort\n    [] swap\n    ' [ + - * / ] join\n    allorders witheach\n      [ dip dup reorder orderings\n        witheach \n          [ dup 24= iff\n              [ rot swap\n                nested join swap ]\n            else drop ] ]\n    drop\n    uniquewith\n      [ dip unbuild unbuild $> ]\n    dup size\n    dup 0 = iff\n       [ 2drop say \"No solutions.\" ]\n       done\n    dup 1 = iff\n      [ drop say \"1 solution.\" ]\n    else\n      [ echo say \" solutions.\" ]\n    unbuild\n    2 split nip\n    -2 split drop nest$ 90 wrap$ ]   is solve     ( n n n n -->   )",
        "safe": true
    },
    {
        "filename": "24 game_Solve_116.txt",
        "content": "/O> 8 8 3 3 solve\n... \n1 solution.\n[ 8 3 8 3 / - / ]\nStack empty.\n\n/O> 7 7 9 4 solve\n... \nNo solutions.\nStack empty.\n\n/O> 8 7 6 5 solve\n... \n22 solutions.\n[ 5 7 + 8 6 - * ] [ 5 7 + 8 - 6 * ] [ 5 8 - 7 + 6 * ] [ 6 5 7 8 - + * ] [ 6 5 7 + 8 - * ]\n[ 6 5 8 7 - - * ] [ 6 5 8 - 7 + * ] [ 6 7 5 8 - + * ] [ 6 7 5 + 8 - * ] [ 6 7 5 - 8 / / ]\n[ 6 7 8 5 - - * ] [ 6 7 8 - 5 + * ] [ 6 8 7 5 - / * ] [ 6 8 * 7 5 - / ] [ 7 5 + 8 6 - * ]\n[ 7 5 + 8 - 6 * ] [ 7 8 - 5 + 6 * ] [ 8 6 7 5 - / * ] [ 8 6 - 5 7 + * ] [ 8 6 - 7 5 + * ]\n[ 8 6 * 7 5 - / ] [ 8 7 5 - 6 / / ]\nStack empty.\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_117.txt",
        "content": "library(gtools)\n\nsolve24 <- function(vals=c(8, 4, 2, 1),\n                    goal=24,\n                    ops=c(\"+\", \"-\", \"*\", \"/\")) {\n  \n  val.perms <- as.data.frame(t(\n                  permutations(length(vals), length(vals))))\n\n  nop <- length(vals)-1\n  op.perms <- as.data.frame(t(\n                  do.call(expand.grid,\n                          replicate(nop, list(ops)))))\n  \n  ord.perms <- as.data.frame(t(\n                   do.call(expand.grid,\n                           replicate(n <- nop, 1:((n <<- n-1)+1)))))\n\n  for (val.perm in val.perms)\n    for (op.perm in op.perms)\n      for (ord.perm in ord.perms)\n        {\n          expr <- as.list(vals[val.perm])\n          for (i in 1:nop) {\n            expr[[ ord.perm[i] ]] <- call(as.character(op.perm[i]),\n                                          expr[[ ord.perm[i]   ]],\n                                          expr[[ ord.perm[i]+1 ]])\n            expr <- expr[ -(ord.perm[i]+1) ]\n          }\n          if (identical(eval(expr[[1]]), goal)) return(expr[[1]])\n        }\n\n  return(NA)\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_118.txt",
        "content": "> solve24()\n8 * (4 - 2 + 1)\n> solve24(c(6,7,9,5))\n6 + (7 - 5) * 9\n> solve24(c(8,8,8,8))\n[1] NA\n> solve24(goal=49) #different goal value\n8 * (4 + 2) + 1\n> solve24(goal=52) #no solution\n[1] NA\n> solve24(ops=c('-', '/')) #restricted set of operators\n(8 - 2)/(1/4)\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_119.txt",
        "content": "(define (in-variants n1 o1 n2 o2 n3 o3 n4)\n  (let ([o1n (object-name o1)]\n        [o2n (object-name o2)]\n        [o3n (object-name o3)])\n    (with-handlers ((exn:fail:contract:divide-by-zero? (\u03bb (_) empty-sequence))) \n      (in-parallel \n       (list  (o1 (o2 (o3 n1 n2) n3) n4)\n              (o1 (o2 n1 (o3 n2 n3)) n4)\n              (o1 (o2 n1 n2) (o3 n3 n4))\n              (o1 n1 (o2 (o3 n2 n3) n4))\n              (o1 n1 (o2 n2 (o3 n3 n4))))\n       (list `(((,n1 ,o3n ,n2) ,o2n ,n3) ,o1n ,n4)\n             `((,n1 ,o2n (,n2 ,o3n ,n3)) ,o1n ,n4)\n             `((,n1 ,o2n ,n2) ,o1n (,n3 ,o3n ,n4))\n             `(,n1 ,o1n ((,n2 ,o3n ,n3) ,o2n ,n4))\n             `(,n1 ,o1n (,n2 ,o2n (,n3 ,o3n ,n4))))))))\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_12.txt",
        "content": "1 2+1 7+*\n1 2+7 1+*\n1 7+1 2+*\n1 7+2 1+*\n2 1+1 7+*\n2 1+7 1+*\n7 1+1 2+*\n7 1+2 1+*",
        "safe": true
    },
    {
        "filename": "24 game_Solve_120.txt",
        "content": "(define (find-solutions numbers (goal 24))\n  (define in-operations (list + - * /))\n  (remove-duplicates\n   (for*/list ([n1 numbers]\n               [n2 (remove-from numbers n1)]\n               [n3 (remove-from numbers n1 n2)]\n               [n4 (remove-from numbers n1 n2 n3)]\n               [o1 in-operations]\n               [o2 in-operations]\n               [o3 in-operations]\n               [(res expr) (in-variants n1 o1 n2 o2 n3 o3 n4)]\n               #:when (= res goal))\n     expr)))\n\n(define (remove-from numbers . n) (foldr remq numbers n))\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_121.txt",
        "content": "> (find-solutions '(3 8 3 8))\n'((8 / (3 - (8 / 3))))\n> (find-solutions '(3 8 2 9))\n'(((8 / 2) * (9 - 3))\n  (8 / (2 / (9 - 3)))\n  (8 * (9 - (3 * 2)))\n  (8 * ((9 - 3) / 2))\n  ((8 * (9 - 3)) / 2)\n  (8 * (9 - (2 * 3)))\n  ((9 - 3) * (8 / 2))\n  (((9 - 3) * 8) / 2)\n  ((9 - (3 * 2)) * 8)\n  (((9 - 3) / 2) * 8)\n  ((9 - 3) / (2 / 8))\n  ((9 - (2 * 3)) * 8))\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_122.txt",
        "content": "use MONKEY-SEE-NO-EVAL;\n\nmy @digits;\nmy $amount = 4;\n\n# Get $amount digits from the user,\n# ask for more if they don't supply enough\nwhile @digits.elems < $amount {\n    @digits.append: (prompt \"Enter {$amount - @digits} digits from 1 to 9, \"\n    ~ '(repeats allowed): ').comb(/<[1..9]>/);\n}\n# Throw away any extras\n@digits = @digits[^$amount];\n\n# Generate combinations of operators\nmy @ops = [X,] <+ - * /> xx 3;\n\n# Enough sprintf formats to cover most precedence orderings\nmy @formats = (\n    '%d %s %d %s %d %s %d',\n    '(%d %s %d) %s %d %s %d',\n    '(%d %s %d %s %d) %s %d',\n    '((%d %s %d) %s %d) %s %d',\n    '(%d %s %d) %s (%d %s %d)',\n    '%d %s (%d %s %d %s %d)',\n    '%d %s (%d %s (%d %s %d))',\n);\n\n# Brute force test the different permutations\n@digits.permutations\u00bb.join.unique\u00bb.comb.race.map: -> @p {\n    for @ops -> @o {\n        for @formats -> $format {\n            my $result = .EVAL given my $string = sprintf $format, roundrobin(@p, @o,\u00a0:slip);\n            say \"$string = 24\" and last if $result and $result == 24;\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_123.txt",
        "content": "Enter 4 digits from 1 to 9, (repeats allowed): 3711\n(1 + 7) * 3 * 1 = 24\n(1 + 7) * 3 / 1 = 24\n(1 * 3) * (1 + 7) = 24\n3 * (1 + 1 * 7) = 24\n(3 * 1) * (1 + 7) = 24\n3 * (1 / 1 + 7) = 24\n(3 / 1) * (1 + 7) = 24\n3 / (1 / (1 + 7)) = 24\n(1 + 7) * 1 * 3 = 24\n(1 + 7) / 1 * 3 = 24\n(1 + 7) / (1 / 3) = 24\n(1 * 7 + 1) * 3 = 24\n(7 + 1) * 3 * 1 = 24\n(7 + 1) * 3 / 1 = 24\n(7 - 1) * (3 + 1) = 24\n(1 + 1 * 7) * 3 = 24\n(1 * 1 + 7) * 3 = 24\n(1 / 1 + 7) * 3 = 24\n(3 + 1) * (7 - 1) = 24\n3 * (1 + 7 * 1) = 24\n3 * (1 + 7 / 1) = 24\n(3 * 1) * (7 + 1) = 24\n(3 / 1) * (7 + 1) = 24\n3 / (1 / (7 + 1)) = 24\n(1 + 3) * (7 - 1) = 24\n(1 * 3) * (7 + 1) = 24\n(7 + 1) * 1 * 3 = 24\n(7 + 1) / 1 * 3 = 24\n(7 + 1) / (1 / 3) = 24\n(7 - 1) * (1 + 3) = 24\n(7 * 1 + 1) * 3 = 24\n(7 / 1 + 1) * 3 = 24\n3 * (7 + 1 * 1) = 24\n3 * (7 + 1 / 1) = 24\n3 * (7 * 1 + 1) = 24\n3 * (7 / 1 + 1) = 24\n\nEnter 4 digits from 1 to 9, (repeats allowed):  5 5 5 5\n5 * 5 - 5 / 5 = 24\n\nEnter 4 digits from 1 to 9, (repeats allowed): 8833\n8 / (3 - 8 / 3) = 24\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_124.txt",
        "content": "my %*SUB-MAIN-OPTS =\u00a0:named-anywhere;\n\nsub MAIN (*@parameters, Int\u00a0:$goal = 24) {\n    my @numbers;\n    if +@parameters == 1 {\n        @numbers = @parameters[0].comb(/\\d/);\n        USAGE() and exit unless 2 < @numbers < 5;\n    } elsif +@parameters > 4 {\n        USAGE() and exit;\n    } elsif +@parameters == 3|4 {\n        @numbers = @parameters;\n        USAGE() and exit if @numbers.any ~~ /<-[-\\d]>/;\n    } else {\n        USAGE();\n        exit if +@parameters == 2;\n        @numbers = 3,3,8,8;\n        say 'Running demonstration with: ', |@numbers, \"\\n\";\n    }\n    solve @numbers, $goal\n}\n\nsub solve (@numbers, $goal = 24) {\n    my @operators = < + - * / >;\n    my @ops   = [X] @operators xx (@numbers - 1);\n    my @perms = @numbers.permutations.unique(\u00a0:with(&[eqv]) );\n    my @order = (^(@numbers - 1)).permutations;\n    my @sol;\n    @sol[250]; # preallocate some stack space\n\n    my $batch = ceiling +@perms/4;\n\n    my atomicint $i;\n    @perms.race(:batch($batch)).map: -> @p {\n        for @ops -> @o {\n            for @order -> @r {\n                my $result = evaluate(@p, @o, @r);\n                @sol[$i\u269b++] = $result[1] if $result[0] and $result[0] == $goal;\n            }\n        }\n    }\n    @sol.=unique;\n    say @sol.join: \"\\n\";\n    my $pl = +@sol == 1\u00a0?? ''\u00a0!! 's';\n    my $sg = $pl\u00a0?? ''\u00a0!! 's';\n    say +@sol, \" equation{$pl} evaluate{$sg} to $goal using: {@numbers}\";\n}\n\nsub evaluate ( @digit, @ops, @orders ) {\n    my @result = @digit.map: { [ $_, $_ ] };\n    my @offset = 0 xx +@orders;\n\n    for ^@orders {\n        my $this  = @orders[$_];\n        my $order = $this - @offset[$this];\n        my $op    = @ops[$this];\n        my $result = op( $op, @result[$order;0], @result[$order+1;0] );\n        return [ NaN, Str ] unless defined $result;\n        my $string = \"({@result[$order;1]} $op {@result[$order+1;1]})\";\n        @result.splice: $order, 2, [ $[ $result, $string ] ];\n        @offset[$_]++ if $order < $_ for ^@offset;\n    }\n    @result[0];\n}\n\nmulti op ( '+', $m, $n ) { $m + $n }\nmulti op ( '-', $m, $n ) { $m - $n }\nmulti op ( '/', $m, $n ) { $n == 0\u00a0?? fail()\u00a0!! $m / $n }\nmulti op ( '*', $m, $n ) { $m * $n }\n\nmy $txt = \"\\e[0;96m\";\nmy $cmd = \"\\e[0;92m> {$*EXECUTABLE-NAME} {$*PROGRAM-NAME}\";\nsub USAGE {\n    say qq:to\n    '========================================================================'\n    {$txt}Supply 3 or 4 integers on the command line, and optionally a value\n    to equate to.\n\n    Integers may be all one group: {$cmd} 2233{$txt}\n          Or, separated by spaces: {$cmd} 2 4 6 7{$txt}\n\n    If you wish to supply multi-digit or negative numbers, you must\n        separate them with spaces: {$cmd} -2 6 12{$txt}\n\n    If you wish to use a different equate value,\n    supply a new --goal parameter: {$cmd} --goal=17 2 -3 1 9{$txt}\n\n    If you don't supply any parameters, will use 24 as the goal, will run a\n    demo and will show this message.\\e[0m\n    ========================================================================\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_125.txt",
        "content": "(((9 - 1) / 3) * 9)\n((9 - 1) / (3 / 9))\n((9 / 3) * (9 - 1))\n(9 / (3 / (9 - 1)))\n((9 * (9 - 1)) / 3)\n(9 * ((9 - 1) / 3))\n(((9 - 1) * 9) / 3)\n((9 - 1) * (9 / 3))\n8 equations evaluate to 24 using: 1 3 9 9",
        "safe": true
    },
    {
        "filename": "24 game_Solve_126.txt",
        "content": "/*REXX program helps the user find solutions to the game of  24.                        */\n/*                           start-of-help\n\u250c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2510\n\u2502 Argument is either of three forms:  (blank)                           \u2502~\n\u2502                                      ssss                             \u2502~\n\u2502                                      ssss,tot                         \u2502~\n\u2502                                      ssss-ffff                        \u2502~\n\u2502                                      ssss-ffff,tot                    \u2502~\n\u2502                                     -ssss                             \u2502~\n\u2502                                     +ssss                             \u2502~\n\u2502                                                                       \u2502~\n\u2502 where SSSS and/or FFFF must be exactly four numerals (digits)         \u2502~\n\u2502 comprised soley of the numerals (digits)  1 \u2500\u2500> 9   (no zeroes).      \u2502~\n\u2502                                                                       \u2502~\n\u2502                                      SSSS  is the start,              \u2502~\n\u2502                                      FFFF  is the start.              \u2502~\n\u2502                                                                       \u2502~\n\u2502                                                                       \u2502~\n\u2502 If  ssss  has a leading plus (+) sign, it is used as the number, and  \u2502~\n\u2502 the user is prompted to find a solution.                              \u2502~\n\u2502                                                                       \u2502~\n\u2502 If  ssss  has a leading minus (-) sign, a solution is looked for and  \u2502~\n\u2502 the user is told there is a solution (but no solutions are shown).    \u2502~\n\u2502                                                                       \u2502~\n\u2502 If no argument is specified, this program finds a four digits (no     \u2502~\n\u2502 zeroes)  which has at least one solution, and shows the digits to     \u2502~\n\u2502 the user, requesting that they enter a solution.                      \u2502~\n\u2502                                                                       \u2502~\n\u2502 If  tot  is entered, it is the desired answer.  The default is  24.   \u2502~\n\u2502                                                                       \u2502~\n\u2502 A solution to be entered can be in the form of:                       \u2502\n\u2502                                                                       \u2502\n\u2502    digit1   operator   digit2   operator   digit3   operator  digit4  \u2502\n\u2502                                                                       \u2502\n\u2502 where    DIGITn     is one of the digits shown (in any order),  and   \u2502\n\u2502          OPERATOR   can be any one of:     +    -    *    /           \u2502\n\u2502                                                                       \u2502\n\u2502 Parentheses  ()  may be used in the normal manner for grouping,  as   \u2502\n\u2502 well as brackets  []  or  braces  {}.   Blanks can be used anywhere.  \u2502\n\u2502                                                                       \u2502\n\u2502 I.E.:    for the digits    3448     the following could be entered.   \u2502\n\u2502                                                                       \u2502\n\u2502                            3*8 + (4-4)                                \u2502\n\u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2518\n                          end-of-help                                   */\nnumeric digits 12                                /*where rational arithmetic is needed. */\nparse arg orig                                   /*get the  guess  from the command line*/\norig= space(orig, 0)                             /*remove all blanks from  ORIG.        */\nnegatory= left(orig,1)=='-'                      /*=1, suppresses showing.              */\npository= left(orig,1)=='+'                      /*=1, force $24 to use specific number.*/\nif pository | negatory  then orig=substr(orig,2) /*now, just use the absolute vaue.     */\nparse var orig orig ',' ??                       /*get\u00a0??  (if specified, def=24).      */\nparse var orig start '-' finish                  /*get start and finish  (maybe).       */\nopers= '*' || \"/+-\"                              /*legal arith. opers;order is important*/\nops= length(opers)                               /*the number of arithmetic operators.  */\ngroupsym= '()[]{}'                               /*allowed grouping symbols.            */\nindent= left('', 30)                             /*indents display of solutions.        */\nshow= 1                                          /*=1, shows solutions (semifore).      */\ndigs= 123456789                                  /*numerals/digs that can be used.      */\nabuttals = 0                                     /*=1, allows digit abutal:  12+12      */\nif ??==''  then ??= 24                           /*the name of the game.                */\n??= ?? / 1                                       /*normalize the answer.                */\n@abc= 'abcdefghijklmnopqrstuvwxyz'               /*the Latin alphabet in order.         */\n@abcu= @abc;  upper @abcu                        /*an uppercase version of @abc.        */\nx.= 0                                            /*method used to not re-interpret.     */\n      do j=1  for ops;    o.j=substr(opers, j, 1)\n      end  /*j*/                                 /*used for fast execution.             */\ny= ??\nif \\datatype(??,'N')       then do; call ger \"isn't numeric\"; exit 13;  end\nif start\\=='' & \\pository  then do; call ranger start,finish; exit 13;  end\nshow= 0                                          /*stop SOLVE blabbing solutions.       */\n        do forever  while  \\negatory             /*keep truckin' until a solution.      */\n        x.= 0                                    /*way to hold unique expressions.      */\n        rrrr= random(1111, 9999)                 /*get a random set of digits.          */\n        if pos(0, rrrr)\\==0  then iterate        /*but don't the use of zeroes.         */\n        if solve(rrrr)\\==0  then leave           /*try to solve for these digits.       */\n        end   /*forever*/\n\nif left(orig,1)=='+'  then rrrr=start            /*use what's specified.                */\nshow= 1                                          /*enable SOLVE to show solutions.      */\nrrrr= sortc(rrrr)                                /*sort four elements.                  */\nrd.= 0\n                do j=1  for 9                    /*count for each digit in  RRRR.       */\n                _= substr(rrrr, j, 1);    rd._= countchars(rrrr, _)\n                end\n  do guesses=1;                 say\n  say 'Using the digits' rrrr\", enter an expression that equals\" ?? '  (? or QUIT):'\n  pull y;                       y= space(y, 0)\n  if countchars(y, @abcu)>2  then exit           /*the user must be desperate.          */\n  helpstart= 0\n  if y=='?'  then do j=1  for sourceline()       /*use a lazy way to show help.         */\n                  _= sourceline(j)\n                  if p(_)=='start-of-help'  then do;  helpstart=1;  iterate;  end\n                  if p(_)=='end-of-help'    then iterate guesses\n                  if \\helpstart             then iterate\n                  if right(_,1)=='~'        then iterate\n                  say '  ' _\n                  end\n\n  _v= verify(y, digs || opers || groupsym)       /*any illegal characters?              */\n  if _v\\==0  then do;   call ger 'invalid character:'  substr(y, _v, 1);   iterate;    end\n  if y=''  then do;     call validate y;   iterate;    end\n\n    do j=1  for length(y)-1  while \\abuttals     /*check for two digits adjacent.       */\n    if \\datatype(substr(y,j,1),  'W') then iterate\n    if  datatype(substr(y,j+1,1),'W') then do\n                                           call ger 'invalid use of digit abuttal' substr(y,j,2)\n                                           iterate guesses\n                                           end\n    end   /*j*/\n\n  yd= countchars(y, digs)                        /*count of legal digits  123456789     */\n  if yd<4  then do;  call ger 'not enough digits entered.'; iterate guesses; end\n  if yd>4  then do;  call ger 'too many digits entered.'  ; iterate guesses; end\n\n      do j=1  for length(groupsym)  by 2\n      if countchars(y,substr(groupsym,j  ,1))\\==,\n         countchars(y,substr(groupsym,j+1,1))  then do\n                                                    call ger 'mismatched' substr(groupsym,j,2)\n                                                    iterate guesses\n                                                    end\n      end   /*j*/\n\n        do k=1  for 2                            /*check for   **    and    //          */\n        _= copies( substr( opers, k, 1), 2)\n        if pos(_, y)\\==0  then do;  call ger 'illegal operator:' _;  iterate guesses;  end\n        end   /*k*/\n\n    do j=1  for 9;    if rd.j==0  then iterate;     _d= countchars(y, j)\n    if _d==rd.j  then iterate\n    if _d<rd.j   then call ger  'not enough'   j   \"digits, must be\"   rd.j\n                 else call ger  'too many'     j   \"digits, must be\"   rd.j\n    iterate guesses\n    end   /*j*/\n\n  y= translate(y, '()()', \"[]{}\")\n  interpret  'ans=('  y   \") / 1\"\n  if ans==??  then leave guesses\n  say right('incorrect, ' y'='ans, 50)\n  end   /*guesses*/\n\nsay;      say center('\u250c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2510', 79)\n          say center('\u2502                     \u2502', 79)\n          say center('\u2502  congratulations\u00a0!  \u2502', 79)\n          say center('\u2502                     \u2502', 79)\n          say center('\u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2518', 79)\nsay\nexit                                             /*stick a fork in it,  we're all done. */\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\ncountchars: procedure; arg x,c                   /*count of characters in  X.           */\n            return length(x) - length( space( translate(x, ,c ),  0) )\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nranger: parse arg ssss,ffff                      /*parse args passed to this sub.       */\n        ffff= p(ffff ssss)                       /*create a   FFFF   if necessary.      */\n              do g=ssss  to ffff                 /*process possible range of values.    */\n              if pos(0, g)\\==0  then iterate     /*ignore any   G   with zeroes.        */\n              sols= solve(g);  wols= sols\n              if sols==0  then wols= 'No'        /*un-geek number of solutions (if any).*/\n              if negatory & sols\\==0  then wols='A'   /*found only the first solution?  */\n              say\n              say wols   'solution's(sols)    \"found for\"    g\n              if ??\\==24  then say  'for answers that equal'    ??\n              end\n       return\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nsolve: parse arg qqqq;   finds= 0                /*parse args passed to this sub.       */\nif \\validate(qqqq)  then return -1\nparse value '( (( )) )' with L LL RR R           /*assign some static variables.        */\nnq.= 0\n           do jq=1  for 4;  _= substr(qqqq,jq,1) /*count the number of each digit.      */\n           nq._= nq._ + 1\n           end   /*jq*/\n\n  do gggg=1111  to 9999\n  if pos(0, gggg)\\==0        then iterate        /*ignore values with zeroes.           */\n  if verify(gggg, qqqq)\\==0  then iterate\n  if verify(qqqq, gggg)\\==0  then iterate\n  ng.= 0\n         do jg=1  for 4;  _= substr(gggg, jg, 1) /*count the number of each digit.      */\n         g.jg= _;         ng._= ng._ + 1\n         end   /*jg*/\n                          do kg=1  for 9         /*verify each number has same # digits.*/\n                          if nq.kg\\==ng.kg  then iterate gggg\n                          end   /*kg*/\n    do i    =1  for ops                          /*insert operator after 1st numeral.   */\n      do j  =1  for ops                          /*  \"        \"      \"   2nd    \"       */\n        do k=1  for ops                          /*  \"        \"      \"   3rd    \"       */\n          do m=0  for 10;       !.=              /*nullify all grouping symbols (parens)*/\n            select\n            when m==1  then do; !.1=L;           !.3=R;                                end\n            when m==2  then do; !.1=L;                              !.5=R;             end\n            when m==3  then do; !.1=L;           !.3=R;   !.4=L;              !.6=R;   end\n            when m==4  then do; !.1=L;   !.2=L;                               !.6=RR;  end\n            when m==5  then do; !.1=LL;                             !.5=R;    !.6=R;   end\n            when m==6  then do;          !.2=L;                     !.5=R;             end\n            when m==7  then do;          !.2=L;                               !.6=R;   end\n            when m==8  then do;          !.2=L;           !.4=L;              !.6=RR;  end\n            when m==9  then do;          !.2=LL;                    !.5=R;    !.6=R;   end\n            otherwise  nop\n            end   /*select*/\n\n          e= space(!.1 g.1 o.i      !.2 g.2 !.3 o.j      !.4 g.3 !.5 o.k       g.4 !.6, 0)\n          if x.e  then iterate                   /*was the expression already used?     */\n          x.e= 1                                 /*mark this expression as being used.  */\n                          /*(below)  change the expression:   /(yyy)  ===>  /div(yyy)   */\n          origE= e                               /*keep original version for the display*/\n          pd= pos('/(', e)                       /*find pos of     /(      in  E.       */\n          if pd\\==0  then do                     /*Found?  Might have possible \u00f7 by zero*/\n                          eo= e\n                          lr= lastpos(')', e)    /*find last right )   */\n                          lm= pos('-', e, pd+1)  /*find  -  after  (   */\n                          if lm>pd & lm<lr  then e= changestr('/(',e,\"/div(\")   /*change*/\n                          if eo\\==e then if x.e  then iterate /*expression already used?*/\n                          x.e= 1                 /*mark this expression as being used.  */\n                          end\n          interpret 'x=('   e   \") / 1\"          /*have REXX do the heavy lifting here. */\n          if x\\==??  then do                     /*Not correct?   Then try again.       */\n                          numeric digits 9;    x= x / 1              /*re-do evaluation.*/\n                          numeric digits 12                          /*re-instate digits*/\n                          if x\\==?? then iterate /*Not correct?   Then try again.       */\n                          end\n          finds= finds + 1                       /*bump number of found solutions.      */         \n          if \\show | negatory  then return finds\n          _= translate(origE, '][', \")(\")                        /*show  [],  not  ().  */\n          if show  then say indent   'a solution for'  g':'  ??\"=\"  _   /*show solution.*/\n          end     /*m*/\n        end       /*k*/\n      end         /*j*/\n    end           /*i*/\n  end             /*gggg*/\nreturn finds\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nsortc: procedure;  arg nnnn;   L= length(nnnn)    /*sorts the chars NNNN                */\n              do i=1  for L                       /*build array of digs from  NNNN,     */\n              a.i= substr(nnnn, i, 1)             /*enabling SORT to sort an array.     */\n              end   /*i*/\n\n              do j=1  for L                       /*very simple sort, it's a small array*/\n              _= a.j\n                       do k=j+1  to L\n                       if a.k<_  then  do;   a.j= a.k;     a.k= _;     _= a.k;    end\n                       end   /*k*/\n              end   /*j*/\n       v= a.1\n                       do m=2  to L;  v= v || a.m /*build a string of digs from  A.m    */\n                       end   /*m*/\n       return v\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nvalidate: parse arg y;     errCode= 0;       _v= verify(y, digs)\n                   select\n                   when y==''         then call ger 'no digits entered.'\n                   when length(y)<4   then call ger 'not enough digits entered, must be 4'\n                   when length(y)>4   then call ger 'too many digits entered, must be 4'\n                   when pos(0,y)\\==0  then call ger \"can't use the digit  0 (zero)\"\n                   when _v\\==0        then call ger 'illegal character:' substr(y,_v,1)\n                   otherwise               nop\n                   end   /*select*/\n          return \\errCode\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\ndiv:  procedure; parse arg q; if q=0  then q=1e9; return q  /*tests if dividing by zero.*/\nger:  say= '***error*** for argument:'  y;      say arg(1);      errCode= 1;      return 0\np:    return word( arg(1), 1)\ns:    if arg(1)==1  then return arg(3);           return word( arg(2) 's', 1)\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_127.txt",
        "content": "                               a solution for 1156: 24= [1*5-1]*6\n                               a solution for 1156: 24= [[1*5-1]*6]\n                               a solution for 1156: 24= 1*[5-1]*6\n                               a solution for 1156: 24= 1*[[5-1]*6]\n                               a solution for 1156: 24= [1*6]*[5-1]\n                               a solution for 1156: 24= 1*[6*[5-1]]\n                               a solution for 1156: 24= [5*1-1]*6\n                               a solution for 1156: 24= [[5*1-1]*6]\n                               a solution for 1156: 24= [5/1-1]*6\n                               a solution for 1156: 24= [[5/1-1]*6]\n                               a solution for 1156: 24= [5-1]*1*6\n                               a solution for 1156: 24= [5-1*1]*6\n                               a solution for 1156: 24= [5-1]*[1*6]\n                               a solution for 1156: 24= [[5-1*1]*6]\n                               a solution for 1156: 24= [5-1]/1*6\n                               a solution for 1156: 24= [5-1/1]*6\n                               a solution for 1156: 24= [[5-1/1]*6]\n                               a solution for 1156: 24= [5-1]/[1/6]\n                               a solution for 1156: 24= [5-1]*6*1\n                               a solution for 1156: 24= [5-1]*[6*1]\n                               a solution for 1156: 24= [5-1]*6/1\n                               a solution for 1156: 24= [5-1]*[6/1]\n                               a solution for 1156: 24= 5*[6-1]-1\n                               a solution for 1156: 24= [6*1]*[5-1]\n                               a solution for 1156: 24= [6*[1*5-1]]\n                               a solution for 1156: 24= 6*[1*5-1]\n                               a solution for 1156: 24= 6*[1*[5-1]]\n                               a solution for 1156: 24= 6*[[1*5]-1]\n                               a solution for 1156: 24= [6/1]*[5-1]\n                               a solution for 1156: 24= 6/[1/[5-1]]\n                               a solution for 1156: 24= [6-1]*5-1\n                               a solution for 1156: 24= [6*[5*1-1]]\n                               a solution for 1156: 24= 6*[5*1-1]\n                               a solution for 1156: 24= 6*[[5*1]-1]\n                               a solution for 1156: 24= [6*[5/1-1]]\n                               a solution for 1156: 24= 6*[5/1-1]\n                               a solution for 1156: 24= 6*[[5/1]-1]\n                               a solution for 1156: 24= [6*[5-1*1]]\n                               a solution for 1156: 24= 6*[5-1]*1\n                               a solution for 1156: 24= 6*[5-1*1]\n                               a solution for 1156: 24= 6*[5-[1*1]]\n                               a solution for 1156: 24= 6*[[5-1]*1]\n                               a solution for 1156: 24= [6*[5-1/1]]\n                               a solution for 1156: 24= 6*[5-1]/1\n                               a solution for 1156: 24= 6*[5-1/1]\n                               a solution for 1156: 24= 6*[5-[1/1]]\n                               a solution for 1156: 24= 6*[[5-1]/1]\n\n47 solutions found for 1156\n                               a solution for 1157: 24= [1+1]*[5+7]\n                               a solution for 1157: 24= [1+1]*[7+5]\n                               a solution for 1157: 24= [1-5]*[1-7]\n                               a solution for 1157: 24= [1-7]*[1-5]\n                               a solution for 1157: 24= [5-1]*[7-1]\n                               a solution for 1157: 24= [5+7]*[1+1]\n                               a solution for 1157: 24= [7-1]*[5-1]\n                               a solution for 1157: 24= [7+5]*[1+1]\n\n8 solutions found for 1157\n                               a solution for 1158: 24= [5-1-1]*8\n                               a solution for 1158: 24= [[5-1-1]*8]\n                               a solution for 1158: 24= 8*[5-[1+1]]\n                               a solution for 1158: 24= [8*[5-1-1]]\n                               a solution for 1158: 24= 8*[5-1-1]\n                               a solution for 1158: 24= 8*[[5-1]-1]\n\n6 solutions found for 1158\n\nNo solutions found for 1159\n\nNo solutions found for 1161\n                               a solution for 1162: 24= [1+1]*2*6\n                               a solution for 1162: 24= [1+1]*[2*6]\n                               a solution for 1162: 24= [1+1+2]*6\n                               a solution for 1162: 24= [[1+1+2]*6]\n                               a solution for 1162: 24= [1+1]*6*2\n                               a solution for 1162: 24= [1+1]*[6*2]\n                               a solution for 1162: 24= [1+2+1]*6\n                               a solution for 1162: 24= [[1+2+1]*6]\n                               a solution for 1162: 24= 2*[1+1]*6\n                               a solution for 1162: 24= 2*[[1+1]*6]\n                               a solution for 1162: 24= [2+1+1]*6\n                               a solution for 1162: 24= [[2+1+1]*6]\n                               a solution for 1162: 24= [2*6]*[1+1]\n                               a solution for 1162: 24= 2*[6*[1+1]]\n                               a solution for 1162: 24= 6*[1+1]*2\n                               a solution for 1162: 24= 6*[[1+1]*2]\n                               a solution for 1162: 24= [6*[1+1+2]]\n                               a solution for 1162: 24= 6*[1+1+2]\n                               a solution for 1162: 24= 6*[1+[1+2]]\n                               a solution for 1162: 24= 6*[[1+1]+2]\n                               a solution for 1162: 24= [6*[1+2+1]]\n                               a solution for 1162: 24= 6*[1+2+1]\n                               a solution for 1162: 24= 6*[1+[2+1]]\n                               a solution for 1162: 24= 6*[[1+2]+1]\n                               a solution for 1162: 24= [6*2]*[1+1]\n                               a solution for 1162: 24= 6*[2*[1+1]]\n                               a solution for 1162: 24= [6*[2+1+1]]\n                               a solution for 1162: 24= 6*[2+1+1]\n                               a solution for 1162: 24= 6*[2+[1+1]]\n                               a solution for 1162: 24= 6*[[2+1]+1]\n\n30 solutions found for 1162\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_128.txt",
        "content": "class TwentyFourGame\n  EXPRESSIONS = [\n    '((%dr %s %dr) %s %dr) %s %dr',\n    '(%dr %s (%dr %s %dr)) %s %dr',\n    '(%dr %s %dr) %s (%dr %s %dr)',\n    '%dr %s ((%dr %s %dr) %s %dr)',\n    '%dr %s (%dr %s (%dr %s %dr))',\n  ]\n  \n  OPERATORS = [:+, :-, :*, :/].repeated_permutation(3).to_a\n  \n  def self.solve(digits)\n    solutions = []\n    perms = digits.permutation.to_a.uniq\n    perms.product(OPERATORS, EXPRESSIONS) do |(a,b,c,d), (op1,op2,op3), expr|\n      # evaluate using rational arithmetic\n      text = expr % [a, op1, b, op2, c, op3, d]\n      value = eval(text)  rescue next                 # catch division by zero\n      solutions << text.delete(\"r\")  if value == 24\n    end\n    solutions\n  end\nend\n\n# validate user input\ndigits = ARGV.map do |arg| \n  begin\n    Integer(arg)\n  rescue ArgumentError\n    raise \"error: not an integer: '#{arg}'\"\n  end\nend\ndigits.size == 4 or raise \"error: need 4 digits, only have #{digits.size}\"\n\nsolutions = TwentyFourGame.solve(digits)\nif solutions.empty?\n  puts \"no solutions\"\nelse\n  puts \"found #{solutions.size} solutions, including #{solutions.first}\"\n  puts solutions.sort\nend\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_129.txt",
        "content": "$ ruby game24_solver.rb 1 1 1 1\nno solutions\n\n$ ruby game24_solver.rb 1 1 2 7\nfound 8 solutions, including (1 + 2) * (1 + 7)\n(1 + 2) * (1 + 7)\n(1 + 2) * (7 + 1)\n(1 + 7) * (1 + 2)\n(1 + 7) * (2 + 1)\n(2 + 1) * (1 + 7)\n(2 + 1) * (7 + 1)\n(7 + 1) * (1 + 2)\n(7 + 1) * (2 + 1)\n\n$ ruby game24_solver.rb 2 3 8 9\nfound 12 solutions, including (8 / 2) * (9 - 3)\n((9 - 3) * 8) / 2\n((9 - 3) / 2) * 8\n(8 * (9 - 3)) / 2\n(8 / 2) * (9 - 3)\n(9 - (2 * 3)) * 8\n(9 - (3 * 2)) * 8\n(9 - 3) * (8 / 2)\n(9 - 3) / (2 / 8)\n8 * ((9 - 3) / 2)\n8 * (9 - (2 * 3))\n8 * (9 - (3 * 2))\n8 / (2 / (9 - 3))",
        "safe": true
    },
    {
        "filename": "24 game_Solve_13.txt",
        "content": "8 3 8 3/-/",
        "safe": true
    },
    {
        "filename": "24 game_Solve_130.txt",
        "content": "#[derive(Clone, Copy, Debug)]\nenum Operator {\n    Sub,\n    Plus,\n    Mul,\n    Div,\n}\n\n#[derive(Clone, Debug)]\nstruct Factor {\n    content: String,\n    value: i32,\n}\n\nfn apply(op: Operator, left: &[Factor], right: &[Factor]) -> Vec<Factor> {\n    let mut ret = Vec::new();\n    for l in left.iter() {\n        for r in right.iter() {\n            use Operator::*;\n            ret.push(match op {\n                Sub if l.value > r.value => Factor {\n                    content: format!(\"({} - {})\", l.content, r.content),\n                    value: l.value - r.value,\n                },\n                Plus => Factor {\n                    content: format!(\"({} + {})\", l.content, r.content),\n                    value: l.value + r.value,\n                },\n                Mul => Factor {\n                    content: format!(\"({} x {})\", l.content, r.content),\n                    value: l.value * r.value,\n                },\n                Div if l.value >= r.value && r.value > 0 && l.value % r.value == 0 => Factor {\n                    content: format!(\"({} / {})\", l.content, r.content),\n                    value: l.value / r.value,\n                },\n                _ => continue,\n            })\n        }\n    }\n    ret\n}\n\nfn calc(op: [Operator; 3], numbers: [i32; 4]) -> Vec<Factor> {\n    fn calc(op: &[Operator], numbers: &[i32], acc: &[Factor]) -> Vec<Factor> {\n        use Operator::*;\n        if op.is_empty() {\n            return Vec::from(acc)\n        }\n        let mut ret = Vec::new();\n        let mono_factor = [Factor {\n            content: numbers[0].to_string(),\n            value: numbers[0],\n        }];\n        match op[0] {\n            Mul => ret.extend_from_slice(&apply(op[0], acc, &mono_factor)),\n            Div => {\n                ret.extend_from_slice(&apply(op[0], acc, &mono_factor));\n                ret.extend_from_slice(&apply(op[0], &mono_factor, acc));\n            },\n            Sub => {\n                ret.extend_from_slice(&apply(op[0], acc, &mono_factor));\n                ret.extend_from_slice(&apply(op[0], &mono_factor, acc));\n            },\n            Plus => ret.extend_from_slice(&apply(op[0], acc, &mono_factor)),   \n        }\n        calc(&op[1..], &numbers[1..], &ret)\n    }\n    calc(&op, &numbers[1..], &[Factor { content: numbers[0].to_string(), value: numbers[0] }])\n}\n\nfn solutions(numbers: [i32; 4]) -> Vec<Factor> {\n    use std::collections::hash_set::HashSet;\n    let mut ret = Vec::new();\n    let mut hash_set = HashSet::new();\n    \n    for ops in OpIter(0) {\n        for o in orders().iter() {\n            let numbers = apply_order(numbers, o);\n            let r = calc(ops, numbers);\n            ret.extend(r.into_iter().filter(|&Factor { value, ref content }| value == 24 && hash_set.insert(content.to_owned())))\n        }\n    }\n    ret\n}\n\nfn main() {\n    let mut numbers = Vec::new();\n    if let Some(input) = std::env::args().skip(1).next() {\n        for c in input.chars() {\n            if let Ok(n) = c.to_string().parse() {\n                numbers.push(n)\n            }\n            if numbers.len() == 4 {\n                let numbers = [numbers[0], numbers[1], numbers[2], numbers[3]];\n                let solutions = solutions(numbers);\n                let len = solutions.len();\n                if len == 0 {\n                    println!(\"no solution for {}, {}, {}, {}\", numbers[0], numbers[1], numbers[2], numbers[3]);\n                    return\n                }\n                println!(\"solutions for {}, {}, {}, {}\", numbers[0], numbers[1], numbers[2], numbers[3]);\n                for s in solutions {\n                    println!(\"{}\", s.content)\n                }\n                println!(\"{} solutions found\", len);\n                return\n            }\n        }\n    } else {\n        println!(\"empty input\")\n    }\n}\n\n\nstruct OpIter (usize);\n\nimpl Iterator for OpIter {\n    type Item = [Operator; 3];\n    fn next(&mut self) -> Option<[Operator; 3]> {\n        use Operator::*;\n        const OPTIONS: [Operator; 4] = [Mul, Sub, Plus, Div];\n        if self.0 >= 1 << 6 {\n            return None\n        }\n        let f1 = OPTIONS[(self.0 & (3 << 4)) >> 4];\n        let f2 = OPTIONS[(self.0 & (3 << 2)) >> 2];\n        let f3 = OPTIONS[(self.0 & (3 << 0)) >> 0];\n        self.0 += 1;\n        Some([f1, f2, f3])\n    }\n}\n\nfn orders() -> [[usize; 4]; 24] {\n    [\n        [0, 1, 2, 3],\n        [0, 1, 3, 2],\n        [0, 2, 1, 3],\n        [0, 2, 3, 1],\n        [0, 3, 1, 2],\n        [0, 3, 2, 1],\n        [1, 0, 2, 3],\n        [1, 0, 3, 2],\n        [1, 2, 0, 3],\n        [1, 2, 3, 0],\n        [1, 3, 0, 2],\n        [1, 3, 2, 0],\n        [2, 0, 1, 3],\n        [2, 0, 3, 1],\n        [2, 1, 0, 3],\n        [2, 1, 3, 0],\n        [2, 3, 0, 1],\n        [2, 3, 1, 0],\n        [3, 0, 1, 2],\n        [3, 0, 2, 1],\n        [3, 1, 0, 2],\n        [3, 1, 2, 0],\n        [3, 2, 0, 1],\n        [3, 2, 1, 0]\n    ]\n}\n\nfn apply_order(numbers: [i32; 4], order: &[usize; 4]) -> [i32; 4] {\n    [numbers[order[0]], numbers[order[1]], numbers[order[2]], numbers[order[3]]]\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_131.txt",
        "content": "$cargo run 5598\nsolutions for 5, 5, 9, 8\n(((5 x 5) - 9) + 8)\n(((5 x 5) + 8) - 9)\n(((8 - 5) x 5) + 9)\n3 solutions found\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_132.txt",
        "content": "def permute(l: List[Double]): List[List[Double]] = l match {\n  case Nil => List(Nil)\n  case x :: xs =>\n    for {\n      ys <- permute(xs)\n      position <- 0 to ys.length\n      (left, right) = ys splitAt position\n    } yield left ::: (x :: right)\n}\n\ndef computeAllOperations(l: List[Double]): List[(Double,String)] = l match {\n  case Nil => Nil\n  case x :: Nil => List((x, \"%1.0f\" format x))\n  case x :: xs =>\n    for {\n      (y, ops) <- computeAllOperations(xs)\n      (z, op) <- \n        if (y == 0) \n          List((x*y, \"*\"), (x+y, \"+\"), (x-y, \"-\")) \n        else \n          List((x*y, \"*\"), (x/y, \"/\"), (x+y, \"+\"), (x-y, \"-\"))\n    } yield (z, \"(%1.0f%s%s)\" format (x,op,ops))\n}\n\ndef hasSolution(l: List[Double]) = permute(l) flatMap computeAllOperations filter (_._1 == 24) map (_._2)\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_133.txt",
        "content": "val problemsIterator = (\n    Iterator\n    continually List.fill(4)(scala.util.Random.nextInt(9) + 1 toDouble)\n    filter (!hasSolution(_).isEmpty)\n)\n\nval solutionIterator = problemsIterator map hasSolution\n\nscala> solutionIterator.next\nres8: List[String] = List((3*(5-(3-6))), (3*(5-(3-6))), (3*(5+(6-3))), (3+(6+(3*5))), (3*(6-(3-5))), (3+(6+(5*3))), (3*(\n6+(5-3))), (3*(5+(6-3))), (3+(6+(5*3))), (3*(6+(5-3))), (6+(3+(5*3))), (6*(5-(3/3))), (6*(5-(3/3))), (3+(6+(3*5))), (3*(\n6-(3-5))), (6+(3+(3*5))), (6+(3+(3*5))), (6+(3+(5*3))))\n\nscala> solutionIterator.next\nres9: List[String] = List((4-(5*(5-9))), (4-(5*(5-9))), (4+(5*(9-5))), (4+(5*(9-5))), (9-(5-(4*5))), (9-(5-(5*4))), (9-(\n5-(4*5))), (9-(5-(5*4))))\n\nscala> solutionIterator.next\nres10: List[String] = List((2*(4+(3+5))), (2*(3+(4+5))), (2*(3+(5+4))), (4*(3-(2-5))), (4*(3+(5-2))), (2*(4+(5+3))), (2*\n(5+(4+3))), (2*(5+(3+4))), (4*(5-(2-3))), (4*(5+(3-2))))\n\nscala> solutionIterator.next\nres11: List[String] = List((4*(5-(2-3))), (2*(4+(5+3))), (2*(5+(4+3))), (2*(5+(3+4))), (2*(4+(3+5))), (2*(3+(4+5))), (2*\n(3+(5+4))), (4*(5+(3-2))), (4*(3+(5-2))), (4*(3-(2-5))))\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_134.txt",
        "content": "#!r6rs\n\n(import (rnrs)\n        (rnrs eval)\n        (only (srfi :1 lists) append-map delete-duplicates iota))\n\n(define (map* fn . lis)\n  (if (null? lis)\n      (list (fn))\n      (append-map (lambda (x)\n                    (apply map*\n                           (lambda xs (apply fn x xs))\n                           (cdr lis)))\n                  (car lis))))\n\n(define (insert x li n)\n  (if (= n 0)\n      (cons x li)\n      (cons (car li) (insert x (cdr li) (- n 1)))))\n\n(define (permutations li)\n  (if (null? li)\n      (list ())\n      (map* insert (list (car li)) (permutations (cdr li)) (iota (length li)))))\n\n(define (evaluates-to-24 expr)\n  (guard (e ((assertion-violation? e) #f))\n    (= 24 (eval expr (environment '(rnrs base))))))\n\n(define (tree n o0 o1 o2 xs)\n  (list-ref\n   (list\n    `(,o0 (,o1 (,o2 ,(car xs) ,(cadr xs)) ,(caddr xs)) ,(cadddr xs))\n    `(,o0 (,o1 (,o2 ,(car xs) ,(cadr xs)) ,(caddr xs)) ,(cadddr xs))\n    `(,o0 (,o1 ,(car xs) (,o2 ,(cadr xs) ,(caddr xs))) ,(cadddr xs))\n    `(,o0 (,o1 ,(car xs) ,(cadr xs)) (,o2 ,(caddr xs) ,(cadddr xs)))\n    `(,o0 ,(car xs) (,o1 (,o2 ,(cadr xs) ,(caddr xs)) ,(cadddr xs)))\n    `(,o0 ,(car xs) (,o1 ,(cadr xs) (,o2 ,(caddr xs) ,(cadddr xs)))))\n   n))\n\n(define (solve a b c d)\n  (define ops '(+ - * /))\n  (define perms (delete-duplicates (permutations (list a b c d))))\n  (delete-duplicates\n   (filter evaluates-to-24\n           (map* tree (iota 6) ops ops ops perms))))\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_135.txt",
        "content": "> (solve 1 3 5 7)\n((* (+ 1 5) (- 7 3))\n (* (+ 5 1) (- 7 3))\n (* (+ 5 7) (- 3 1))\n (* (+ 7 5) (- 3 1))\n (* (- 3 1) (+ 5 7))\n (* (- 3 1) (+ 7 5))\n (* (- 7 3) (+ 1 5))\n (* (- 7 3) (+ 5 1)))\n> (solve 3 3 8 8)\n((/ 8 (- 3 (/ 8 3))))\n> (solve 3 4 9 10)\n()\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_136.txt",
        "content": "var formats = [\n    '((%d %s %d) %s %d) %s %d',\n    '(%d %s (%d %s %d)) %s %d',\n    '(%d %s %d) %s (%d %s %d)',\n    '%d %s ((%d %s %d) %s %d)',\n    '%d %s (%d %s (%d %s %d))',\n]\n \nvar op = %w( + - * / )\nvar operators = op.map { |a| op.map {|b| op.map {|c| \"#{a} #{b} #{c}\" } } }.flat\n \nloop {\n    var input = read(\"Enter four integers or 'q' to exit: \", String)\n    input == 'q' && break\n \n    if (input !~ /^\\h*[1-9]\\h+[1-9]\\h+[1-9]\\h+[1-9]\\h*$/) {\n        say \"Invalid input!\"\n        next\n    }\n \n    var n = input.split.map{.to_n}\n    var numbers = n.permutations\n \n    formats.each { |format|\n        numbers.each { |n|\n            operators.each { |operator|\n                var o = operator.split;\n                var str = (format % (n[0],o[0],n[1],o[1],n[2],o[2],n[3]))\n                eval(str) == 24 && say str\n            }\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_137.txt",
        "content": "var formats = [\n    {|a,b,c|\n        Hash(\n            func   => {|d,e,f,g| ((d.$a(e)).$b(f)).$c(g) },\n            format => \"((%d #{a} %d) #{b} %d) #{c} %d\"\n        )\n    },\n    {|a,b,c|\n        Hash(\n            func   => {|d,e,f,g| (d.$a((e.$b(f)))).$c(g) },\n            format => \"(%d #{a} (%d #{b} %d)) #{c} %d\",\n        )\n    },\n    {|a,b,c|\n        Hash(\n            func   => {|d,e,f,g| (d.$a(e)).$b(f.$c(g)) },\n            format => \"(%d #{a} %d) #{b} (%d #{c} %d)\",\n        )\n    },\n    {|a,b,c|\n        Hash(\n            func   => {|d,e,f,g| (d.$a(e)).$b(f.$c(g)) },\n            format => \"(%d #{a} %d) #{b} (%d #{c} %d)\",\n        )\n    },\n    {|a,b,c|\n        Hash(\n            func   => {|d,e,f,g| d.$a(e.$b(f.$c(g))) },\n            format => \"%d #{a} (%d #{b} (%d #{c} %d))\",\n        )\n    },\n];\n \nvar op = %w( + - * / )\nvar blocks = op.map { |a| op.map { |b| op.map { |c| formats.map { |format|\n    format(a,b,c)\n}}}}.flat\n \nloop {\n    var input = Sys.scanln(\"Enter four integers or 'q' to exit: \");\n    input == 'q' && break;\n \n    if (input !~ /^\\h*[1-9]\\h+[1-9]\\h+[1-9]\\h+[1-9]\\h*$/) {\n        say \"Invalid input!\"\n        next\n    }\n \n    var n = input.split.map{.to_n}\n    var numbers = n.permutations\n \n    blocks.each { |block|\n        numbers.each { |n|\n            if (block{:func}.call(n...) == 24) {\n                say (block{:format} % (n...))\n            }\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_138.txt",
        "content": "Enter four integers or 'q' to exit: 8 7 9 6\n(8 / (9 - 7)) * 6\n(6 / (9 - 7)) * 8\n(8 * 6) / (9 - 7)\n(6 * 8) / (9 - 7)\n8 / ((9 - 7) / 6)\n6 / ((9 - 7) / 8)\n8 * (6 / (9 - 7))\n6 * (8 / (9 - 7))\nEnter four integers or 'q' to exit: q\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_139.txt",
        "content": "BEGIN\n\n\n\n    CLASS EXPR;\n    BEGIN\n\n\n        REAL PROCEDURE POP;\n        BEGIN\n            IF STACKPOS > 0 THEN\n            BEGIN STACKPOS\u00a0:= STACKPOS - 1; POP\u00a0:= STACK(STACKPOS); END;\n        END POP;\n\n\n        PROCEDURE PUSH(NEWTOP); REAL NEWTOP;\n        BEGIN\n            STACK(STACKPOS)\u00a0:= NEWTOP;\n            STACKPOS\u00a0:= STACKPOS + 1;\n        END PUSH;\n\n\n        REAL PROCEDURE CALC(OPERATOR, ERR); CHARACTER OPERATOR; LABEL ERR;\n        BEGIN\n            REAL X, Y; X\u00a0:= POP; Y\u00a0:= POP;\n            IF      OPERATOR = '+' THEN PUSH(Y + X)\n            ELSE IF OPERATOR = '-' THEN PUSH(Y - X)\n            ELSE IF OPERATOR = '*' THEN PUSH(Y * X)\n            ELSE IF OPERATOR = '/' THEN BEGIN\n                                            IF X = 0 THEN\n                                            BEGIN\n                                                EVALUATEDERR\u00a0:- \"DIV BY ZERO\";\n                                                GOTO ERR;\n                                            END;\n                                            PUSH(Y / X);\n                                        END\n            ELSE\n            BEGIN\n                EVALUATEDERR\u00a0:- \"UNKNOWN OPERATOR\";\n                GOTO ERR;\n            END\n        END CALC;\n\n\n        PROCEDURE READCHAR(CH); NAME CH; CHARACTER CH;\n        BEGIN\n            IF T.MORE THEN CH\u00a0:= T.GETCHAR ELSE CH\u00a0:= EOT;\n        END READCHAR;\n\n\n        PROCEDURE SKIPWHITESPACE(CH); NAME CH; CHARACTER CH;\n        BEGIN\n            WHILE (CH = SPACE) OR (CH = TAB) OR (CH = CR) OR (CH = LF) DO\n                READCHAR(CH);\n        END SKIPWHITESPACE;\n\n\n        PROCEDURE BUSYBOX(OP, ERR); INTEGER OP; LABEL ERR;\n        BEGIN\n            CHARACTER OPERATOR;\n            REAL NUMBR;\n            BOOLEAN NEGATIVE;\n\n            SKIPWHITESPACE(CH);\n\n            IF OP = EXPRESSION THEN\n            BEGIN\n\n                NEGATIVE\u00a0:= FALSE;\n                WHILE (CH = '+') OR (CH = '-') DO\n                BEGIN\n                    IF CH = '-' THEN NEGATIVE\u00a0:=  NOT NEGATIVE;\n                    READCHAR(CH);\n                END;\n\n                BUSYBOX(TERM, ERR);\n\n                IF NEGATIVE THEN\n                BEGIN\n                    NUMBR\u00a0:= POP; PUSH(0 - NUMBR);\n                END;\n\n                WHILE (CH = '+') OR (CH = '-') DO\n                BEGIN\n                    OPERATOR\u00a0:= CH; READCHAR(CH);\n                    BUSYBOX(TERM, ERR); CALC(OPERATOR, ERR);\n                END;\n\n            END\n            ELSE IF OP = TERM THEN\n            BEGIN\n\n                BUSYBOX(FACTOR, ERR);\n                WHILE (CH = '*') OR (CH = '/') DO\n                BEGIN\n                    OPERATOR\u00a0:= CH; READCHAR(CH);\n                    BUSYBOX(FACTOR, ERR); CALC(OPERATOR, ERR)\n                END\n\n            END\n            ELSE IF OP = FACTOR THEN\n            BEGIN\n\n                IF (CH = '+') OR (CH = '-') THEN\n                  BUSYBOX(EXPRESSION, ERR)\n                ELSE IF (CH >= '0') AND (CH <= '9') THEN\n                  BUSYBOX(NUMBER, ERR)\n                ELSE IF CH = '(' THEN\n                BEGIN\n                    READCHAR(CH);\n                    BUSYBOX(EXPRESSION, ERR);\n                    IF CH = ')' THEN READCHAR(CH) ELSE GOTO ERR;\n                END\n                ELSE GOTO ERR;\n\n            END\n            ELSE IF OP = NUMBER THEN\n            BEGIN\n\n                NUMBR\u00a0:= 0;\n                WHILE (CH >= '0') AND (CH <= '9') DO\n                BEGIN\n                    NUMBR\u00a0:= 10 * NUMBR + RANK(CH) - RANK('0'); READCHAR(CH);\n                END;\n                IF CH = '.' THEN\n                BEGIN\n                    REAL FAKTOR;\n                    READCHAR(CH);\n                    FAKTOR\u00a0:= 10;\n                    WHILE (CH >= '0') AND (CH <= '9') DO\n                    BEGIN\n                        NUMBR\u00a0:= NUMBR + (RANK(CH) - RANK('0')) / FAKTOR;\n                        FAKTOR\u00a0:= 10 * FAKTOR;\n                        READCHAR(CH);\n                    END;\n                END;\n                PUSH(NUMBR);\n\n            END;\n\n            SKIPWHITESPACE(CH);\n\n        END BUSYBOX;\n\n\n        BOOLEAN PROCEDURE EVAL(INP); TEXT INP;\n        BEGIN\n            EVALUATEDERR\u00a0:- NOTEXT;\n            STACKPOS\u00a0:= 0;\n            T\u00a0:- COPY(INP.STRIP);\n            READCHAR(CH);\n            BUSYBOX(EXPRESSION, ERRORLABEL);\n            IF NOT T.MORE AND STACKPOS = 1 AND CH = EOT THEN\n            BEGIN\n                EVALUATED\u00a0:= POP;\n                EVAL\u00a0:= TRUE;\n                GOTO NOERRORLABEL;\n            END;\n    ERRORLABEL:\n            EVAL\u00a0:= FALSE;\n            IF EVALUATEDERR = NOTEXT THEN\n                EVALUATEDERR\u00a0:- \"INVALID EXPRESSION: \" & INP;\n    NOERRORLABEL:\n        END EVAL;\n\n        \n        REAL PROCEDURE RESULT;\n            RESULT\u00a0:= EVALUATED;\n\n        TEXT PROCEDURE ERR;\n            ERR\u00a0:- EVALUATEDERR;\n\n        TEXT T;\n\n        INTEGER EXPRESSION;\n        INTEGER TERM;\n        INTEGER FACTOR;\n        INTEGER NUMBER;\n\n        CHARACTER TAB;\n        CHARACTER LF;\n        CHARACTER CR;\n        CHARACTER SPACE;\n        CHARACTER EOT;\n\n        CHARACTER CH;\n        REAL ARRAY STACK(0:31);\n        INTEGER STACKPOS;\n\n        REAL EVALUATED;\n        TEXT EVALUATEDERR;\n\n        EXPRESSION\u00a0:= 1;\n        TERM\u00a0:= 2;\n        FACTOR\u00a0:= 3;\n        NUMBER\u00a0:= 4;\n\n        TAB\u00a0:= CHAR(9);\n        LF\u00a0:= CHAR(10);\n        CR\u00a0:= CHAR(13);\n        SPACE\u00a0:= CHAR(32);\n        EOT\u00a0:= CHAR(0);\n\n    END EXPR;\n\n\n    INTEGER ARRAY DIGITS(1:4);\n    INTEGER SEED, I;\n    REF(EXPR) E;\n\n    INTEGER SOLUTION;\n    INTEGER D1,D2,D3,D4;\n    INTEGER O1,O2,O3;\n    TEXT OPS;\n\n    OPS\u00a0:- \"+-*/\";\n\n    E\u00a0:- NEW EXPR;\n    OUTTEXT(\"ENTER FOUR INTEGERS: \");\n    OUTIMAGE;\n    FOR I\u00a0:= 1 STEP 1 UNTIL 4 DO DIGITS(I)\u00a0:= ININT; !RANDINT(0, 9, SEED);\n\n   \u00a0! DIGITS\u00a0;\n    FOR D1\u00a0:= 1 STEP 1 UNTIL 4 DO\n    FOR D2\u00a0:= 1 STEP 1 UNTIL 4 DO IF D2 <> D1 THEN\n    FOR D3\u00a0:= 1 STEP 1 UNTIL 4 DO IF D3 <> D2 AND\n                                     D3 <> D1 THEN\n    FOR D4\u00a0:= 1 STEP 1 UNTIL 4 DO IF D4 <> D3 AND\n                                     D4 <> D2 AND\n                                     D4 <> D1 THEN\n   \u00a0! OPERATORS\u00a0;\n    FOR O1\u00a0:= 1 STEP 1 UNTIL 4 DO\n    FOR O2\u00a0:= 1 STEP 1 UNTIL 4 DO\n    FOR O3\u00a0:= 1 STEP 1 UNTIL 4 DO\n    BEGIN\n        PROCEDURE P(FMT); TEXT FMT;\n        BEGIN\n            INTEGER PLUS;\n            TRY.SETPOS(1);\n            WHILE FMT.MORE DO\n            BEGIN\n                CHARACTER C;\n                C\u00a0:= FMT.GETCHAR;\n                IF (C >= '1') AND (C <= '4') THEN\n                BEGIN\n                    INTEGER DIG; CHARACTER NCH;\n                    DIG\u00a0:= IF C = '1' THEN DIGITS(D1)\n                      ELSE IF C = '2' THEN DIGITS(D2)\n                      ELSE IF C = '3' THEN DIGITS(D3)\n                                      ELSE DIGITS(D4);\n                    NCH\u00a0:= CHAR( DIG + RANK('0') );\n                    TRY.PUTCHAR(NCH);\n                END\n                ELSE IF C = '+' THEN\n                BEGIN\n                    PLUS\u00a0:= PLUS + 1;\n                    OPS.SETPOS(IF PLUS = 1 THEN O1 ELSE\n                               IF PLUS = 2 THEN O2\n                                           ELSE O3);\n                    TRY.PUTCHAR(OPS.GETCHAR);\n                END\n                ELSE IF (C = '(') OR (C = ')') OR (C = ' ') THEN\n                    TRY.PUTCHAR(C)\n                ELSE\n                    ERROR(\"ILLEGAL EXPRESSION\");\n            END;\n            IF E.EVAL(TRY) THEN\n            BEGIN\n                IF ABS(E.RESULT - 24) < 0.001 THEN\n                BEGIN\n                    SOLUTION\u00a0:= SOLUTION + 1;\n                    OUTTEXT(TRY); OUTTEXT(\" = \");\n                    OUTFIX(E.RESULT, 4, 10);\n                    OUTIMAGE;\n                END;\n            END\n            ELSE\n            BEGIN\n                IF E.ERR <> \"DIV BY ZERO\" THEN\n                BEGIN\n                    OUTTEXT(TRY); OUTIMAGE;\n                    OUTTEXT(E.ERR); OUTIMAGE;\n                END;\n            END;\n        END P;\n        TEXT TRY;\n        TRY\u00a0:- BLANKS(17);\n        P(\"(1 + 2) + (3 + 4)\");\n        P(\"(1 + (2 + 3)) + 4\");\n        P(\"((1 + 2) + 3) + 4\");\n        P(\"1 + ((2 + 3) + 4)\");\n        P(\"1 + (2 + (3 + 4))\");\n    END;\n    OUTINT(SOLUTION, 0);\n    OUTTEXT(\" SOLUTIONS FOUND\");\n    OUTIMAGE;\nEND.",
        "safe": true
    },
    {
        "filename": "24 game_Solve_14.txt",
        "content": "      PROCsolve24(\"1234\")\n      PROCsolve24(\"6789\")\n      PROCsolve24(\"1127\")\n      PROCsolve24(\"5566\")\n      END\n      \n      DEF PROCsolve24(s$)\n      LOCAL F%, I%, J%, K%, L%, P%, T%, X$, o$(), p$(), t$()\n      DIM o$(4), p$(24,4), t$(11)\n      o$() = \"\", \"+\", \"-\", \"*\", \"/\"\n      RESTORE\n      FOR T% = 1 TO 11\n        READ t$(T%)\n      NEXT\n      DATA \"abcdefg\", \"(abc)defg\", \"ab(cde)fg\", \"abcd(efg)\", \"(abc)d(efg)\", \"(abcde)fg\"\n      DATA \"ab(cdefg)\", \"((abc)de)fg\", \"(ab(cde))fg\", \"ab((cde)fg)\", \"ab(cd(efg))\"\n      \n      FOR I% = 1 TO 4\n        FOR J% = 1 TO 4\n          FOR K% = 1 TO 4\n            FOR L% = 1 TO 4\n              IF I%<>J% IF J%<>K% IF K%<>L% IF I%<>K% IF J%<>L% IF I%<>L% THEN\n                P% += 1\n                p$(P%,1) = MID$(s$,I%,1)\n                p$(P%,2) = MID$(s$,J%,1)\n                p$(P%,3) = MID$(s$,K%,1)\n                p$(P%,4) = MID$(s$,L%,1)\n              ENDIF\n            NEXT\n          NEXT\n        NEXT\n      NEXT\n      \n      FOR I% = 1 TO 4\n        FOR J% = 1 TO 4\n          FOR K% = 1 TO 4\n            FOR T% = 1 TO 11\n              FOR P% = 1 TO 24\n                X$ = t$(T%)\n                MID$(X$, INSTR(X$,\"a\"), 1) = p$(P%,1)\n                MID$(X$, INSTR(X$,\"b\"), 1) = o$(I%)\n                MID$(X$, INSTR(X$,\"c\"), 1) = p$(P%,2)\n                MID$(X$, INSTR(X$,\"d\"), 1) = o$(J%)\n                MID$(X$, INSTR(X$,\"e\"), 1) = p$(P%,3)\n                MID$(X$, INSTR(X$,\"f\"), 1) = o$(K%)\n                MID$(X$, INSTR(X$,\"g\"), 1) = p$(P%,4)\n                F% = TRUE : ON ERROR LOCAL F% = FALSE\n                IF F% IF EVAL(X$) = 24 THEN PRINT X$ : EXIT FOR I%\n                RESTORE ERROR\n              NEXT\n            NEXT\n          NEXT\n        NEXT\n      NEXT\n      IF I% > 4 PRINT \"No solution found\"\n      ENDPROC\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_140.txt",
        "content": "ENTER FOUR INTEGERS: 8 7 9 6\n(8 / (9 - 7)) * 6 =    24.0000\n8 / ((9 - 7) / 6) =    24.0000\n(8 * 6) / (9 - 7) =    24.0000\n8 * (6 / (9 - 7)) =    24.0000\n(6 * 8) / (9 - 7) =    24.0000\n6 * (8 / (9 - 7)) =    24.0000\n(6 / (9 - 7)) * 8 =    24.0000\n6 / ((9 - 7) / 8) =    24.0000\n8 SOLUTIONS FOUND\n\n2 garbage collection(s) in 0.0 seconds.\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_141.txt",
        "content": "import Darwin\nimport Foundation\n\nvar solution = \"\"\n\nprintln(\"24 Game\")\nprintln(\"Generating 4 digits...\")\n\nfunc randomDigits() -> [Int] {\n  var result = [Int]()\n  for i in 0 ..< 4 {\n    result.append(Int(arc4random_uniform(9)+1))\n  }\n  return result\n}\n\n// Choose 4 digits\nlet digits = randomDigits()\n\nprint(\"Make 24 using these digits\u00a0: \")\n\nfor digit in digits {\n  print(\"\\(digit) \")\n}\nprintln()\n\n// get input from operator\nvar input = NSString(data:NSFileHandle.fileHandleWithStandardInput().availableData, encoding:NSUTF8StringEncoding)!\n\nvar enteredDigits = [Double]()\n\nvar enteredOperations = [Character]()\n\nlet inputString = input as String\n\n// store input in the appropriate table\nfor character in inputString {\n  switch character {\n  case \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\":\n    let digit = String(character)\n    enteredDigits.append(Double(digit.toInt()!))\n  case \"+\", \"-\", \"*\", \"/\":\n    enteredOperations.append(character)\n  case \"\\n\":\n    println()\n  default:\n    println(\"Invalid expression\")\n  }\n}\n\n// check value of expression provided by the operator\nvar value = 0.0\n\nif enteredDigits.count == 4 && enteredOperations.count == 3 {\n  value = enteredDigits[0]\n  for (i, operation) in enumerate(enteredOperations) {\n    switch operation {\n    case \"+\":\n      value = value + enteredDigits[i+1]\n    case \"-\":\n      value = value - enteredDigits[i+1]\n    case \"*\":\n      value = value * enteredDigits[i+1]\n    case \"/\":\n      value = value / enteredDigits[i+1]\n    default:\n      println(\"This message should never happen!\")\n    }\n  }\n}\n\nfunc evaluate(dPerm: [Double], oPerm: [String]) -> Bool {\n  var value = 0.0\n  \n  if dPerm.count == 4 && oPerm.count == 3 {\n    value = dPerm[0]\n    for (i, operation) in enumerate(oPerm) {\n      switch operation {\n      case \"+\":\n        value = value + dPerm[i+1]\n      case \"-\":\n        value = value - dPerm[i+1]\n      case \"*\":\n        value = value * dPerm[i+1]\n      case \"/\":\n        value = value / dPerm[i+1]\n      default:\n        println(\"This message should never happen!\")\n      }\n    }\n  }\n  return (abs(24 - value) < 0.001)\n}\n\nfunc isSolvable(inout digits: [Double]) -> Bool {\n  \n  var result = false\n  var dPerms = [[Double]]()\n  permute(&digits, &dPerms, 0)\n  \n  let total = 4 * 4 * 4\n  var oPerms = [[String]]()\n  permuteOperators(&oPerms, 4, total)\n  \n  \n  for dig in dPerms {\n    for opr in oPerms {\n      var expression = \"\"\n      \n      if evaluate(dig, opr) {\n        for digit in dig {\n          expression += \"\\(digit)\"\n        }\n        \n        for oper in opr {\n          expression += oper\n        }\n        \n        solution = beautify(expression)\n        result = true\n      }\n    }\n  }\n  return result\n}\n\nfunc permute(inout lst: [Double], inout res: [[Double]], k: Int) -> Void {\n  for i in k ..< lst.count {\n    swap(&lst[i], &lst[k])\n    permute(&lst, &res, k + 1)\n    swap(&lst[k], &lst[i])\n  }\n  if k == lst.count {\n    res.append(lst)\n  }\n}\n\n// n=4, total=64, npow=16\nfunc permuteOperators(inout res: [[String]], n: Int, total: Int) -> Void {\n  let posOperations = [\"+\", \"-\", \"*\", \"/\"]\n  let npow = n * n\n  for i in 0 ..< total {\n    res.append([posOperations[(i / npow)], posOperations[((i % npow) / n)], posOperations[(i % n)]])\n  }\n}\n\nfunc beautify(infix: String) -> String {\n  let newString = infix as NSString\n  \n  var solution = \"\"\n  \n  solution += newString.substringWithRange(NSMakeRange(0, 1))\n  solution += newString.substringWithRange(NSMakeRange(12, 1))\n  solution += newString.substringWithRange(NSMakeRange(3, 1))\n  solution += newString.substringWithRange(NSMakeRange(13, 1))\n  solution += newString.substringWithRange(NSMakeRange(6, 1))\n  solution += newString.substringWithRange(NSMakeRange(14, 1))\n  solution += newString.substringWithRange(NSMakeRange(9, 1))\n  \n  return solution\n}\n\nif value != 24 {\n  println(\"The value of the provided expression is \\(value) instead of 24!\")\n  if isSolvable(&enteredDigits) {\n    println(\"A possible solution could have been \" + solution)\n  } else {\n    println(\"Anyway, there was no known solution to this one.\")\n  }\n} else {\n  println(\"Congratulations, you found a solution!\")\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_142.txt",
        "content": "24 Game\nGenerating 4 digits...\nMake 24 using these digits\u00a0: 2 4 1 9 \n2+1*4+9\n\nThe value of the provided expression is 21.0 instead of 24!\nA possible solution could have been 9-2-1*4\n\n24 Game\nGenerating 4 digits...\nMake 24 using these digits\u00a0: 2 7 2 3 \n7-2*2*3\n\nThe value of the provided expression is 30.0 instead of 24!\nA possible solution could have been 3+7+2*2\n\n24 Game\nGenerating 4 digits...\nMake 24 using these digits\u00a0: 4 6 3 4 \n4+4+6+3\n\nThe value of the provided expression is 17.0 instead of 24!\nA possible solution could have been 3*4-6*4\n\n24 Game\nGenerating 4 digits...\nMake 24 using these digits\u00a0: 8 8 2 6 \n8+8+2+6\n\nCongratulations, you found a solution!\n\n24 Game\nGenerating 4 digits...\nMake 24 using these digits\u00a0: 6 7 8 9 \n6+7+8+9\n\nThe value of the provided expression is 30.0 instead of 24!\nAnyway, there was no known solution to this one.\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_143.txt",
        "content": "package require struct::list\n# Encoding the various expression trees that are possible\nset patterns {\n    {((A x B) y C) z D}\n     {(A x (B y C)) z D}\n     {(A x B) y (C z D)}\n      {A x ((B y C) z D)}\n      {A x (B y (C z D))}\n}\n# Encoding the various permutations of digits\nset permutations [struct::list map [struct::list permutations {a b c d}] \\\n        {apply {v {lassign $v a b c d; list A $a B $b C $c D $d}}}]\n# The permitted operations\nset operations {+ - * /}\n\n# Given a list of four integers (precondition not checked!) \n# return a list of solutions to the 24 game using those four integers.\nproc find24GameSolutions {values} {\n    global operations patterns permutations\n    set found {}\n    # For each possible structure with numbers at the leaves...\n    foreach pattern $patterns {\n\tforeach permutation $permutations {\n\t    set p [string map [subst {\n\t\ta [lindex $values 0].0\n\t\tb [lindex $values 1].0\n\t\tc [lindex $values 2].0\n\t\td [lindex $values 3].0\n\t    }] [string map $permutation $pattern]]\n\n            # For each possible structure with operators at the branches...\n\t    foreach x $operations {\n\t\tforeach y $operations {\n\t\t    foreach z $operations {\n\t\t\tset e [string map [subst {x $x y $y z $z}] $p]\n\n\t\t\t# Try to evaluate (div-zero is an issue!) and add it to\n\t\t\t# the result if it is 24\n\t\t\tcatch {\n\t\t\t    if {[expr $e] == 24.0} {\n\t\t\t\tlappend found [string map {.0 {}} $e]\n\t\t\t    }\n\t\t\t}\n\t\t    }\n\t\t}\n\t    }\n\t}\n    }\n    return $found\n}\n\n# Wrap the solution finder into a player\nproc print24GameSolutionFor {values} {\n    set found [lsort -unique [find24GameSolutions $values]]\n    if {![llength $found]} {\n\tputs \"No solution possible\"\n    } else {\n\tputs \"Total [llength $found] solutions (may include logical duplicates)\"\n        puts \"First solution: [lindex $found 0]\"\n    }\n}\nprint24GameSolutionFor $argv\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_144.txt",
        "content": "bash$ tclsh8.4 24player.tcl 3 2 8 9\nTotal 12 solutions (may include logical duplicates)\nFirst solution: ((9 - 3) * 8) / 2\nbash$ tclsh8.4 24player.tcl 1 1 2 7\nTotal 8 solutions (may include logical duplicates)\nFirst solution: (1 + 2) * (1 + 7)\nbash$ tclsh8.4 24player.tcl 1 1 1 1\nNo solution possible\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_145.txt",
        "content": "#import std\n#import nat\n#import rat\n\ntree_shapes = \"n\". (@vLPiYo //eql iota \"n\")*~ (rep\"n\" ~&iiiK0NlrNCCVSPTs) {0^:<>}\nwith_leaves = ^|DrlDrlK34SPSL/permutations ~&\nwith_roots  = ^DrlDrlK35dlPvVoPSPSL\\~&r @lrhvdNCBvLPTo2DlS @hiNCSPtCx ~&K0=>\nvalue       = *^ ~&v?\\(@d ~&\\1) ^|H\\~&hthPX '+-*/'-$<sum,difference,product,quotient>\nformat      = *^ ~&v?\\-+~&h,%zP@d+- ^H/mat@d *v ~&t?\\~&\u00a0:/`(+ --')'\n\ngame\"n\" \"d\" = format* value==(\"n\",1)*~ with_roots/'+-*/' with_leaves/\"d\"*-1 tree_shapes length \"d\"",
        "safe": true
    },
    {
        "filename": "24 game_Solve_146.txt",
        "content": "#show+\n\ntest_games = mat` * pad` *K7 pad0 game24* <<2,3,8,9>,<5,7,4,1>,<5,6,7,8>>",
        "safe": true
    },
    {
        "filename": "24 game_Solve_147.txt",
        "content": "8/(2/(9-3)) 1-(5-(7*4)) 6*(5+(7-8))\n8*(9-(2*3)) 1-(5-(4*7)) 6*(7+(5-8))\n8*(9-(3*2)) 1+((7*4)-5) 6*(7-(8-5))\n8*((9-3)/2) 1+((4*7)-5) 6*(5-(8-7))\n(8/2)*(9-3) (7*4)-(5-1) 6*(8/(7-5))\n(9-3)/(2/8) (7*4)+(1-5) 8*(6/(7-5))\n(9-3)*(8/2) (4*7)-(5-1) 6*((5+7)-8)\n(8*(9-3))/2 (4*7)+(1-5) 6*((7+5)-8)\n(9-(2*3))*8 (1-5)+(7*4) 6/((7-5)/8)\n(9-(3*2))*8 (1-5)+(4*7) 6*((7-8)+5)\n((9-3)/2)*8 (7*(5-1))-4 6*((5-8)+7)\n((9-3)*8)/2 (1+(7*4))-5 8/((7-5)/6)\n            (1+(4*7))-5 (5+7)*(8-6)\n            ((7*4)-5)+1 (7+5)*(8-6)\n            ((7*4)+1)-5 (6*8)/(7-5)\n            ((4*7)-5)+1 (8-6)*(5+7)\n            ((4*7)+1)-5 (8-6)*(7+5)\n            ((5-1)*7)-4 (8*6)/(7-5)\n                        (6/(7-5))*8\n                        (5+(7-8))*6\n                        (7+(5-8))*6\n                        (7-(8-5))*6\n                        (5-(8-7))*6\n                        (8/(7-5))*6\n                        ((5+7)-8)*6\n                        ((7+5)-8)*6\n                        ((7-8)+5)*6\n                        ((5-8)+7)*6\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_148.txt",
        "content": "import \"random\" for Random\nimport \"./dynamic\" for Tuple, Enum, Struct\n\nvar N_CARDS = 4\nvar SOLVE_GOAL = 24\nvar MAX_DIGIT = 9\n\nvar Frac = Tuple.create(\"Frac\", [\"num\", \"den\"])\n\nvar OpType = Enum.create(\"OpType\", [\"NUM\", \"ADD\", \"SUB\", \"MUL\", \"DIV\"])\n\nvar Expr = Struct.create(\"Expr\", [\"op\", \"left\", \"right\", \"value\"])\n\nvar showExpr // recursive function\nshowExpr = Fn.new { |e, prec, isRight|\n    if (!e) return\n    if (e.op == OpType.NUM) {\n        System.write(e.value)\n        return\n    }\n    var op = (e.op == OpType.ADD) ? \" + \" :\n             (e.op == OpType.SUB) ? \" - \" :\n             (e.op == OpType.MUL) ? \" x \" :\n             (e.op == OpType.DIV) ? \" / \" : e.op\n    if ((e.op == prec && isRight) || e.op < prec) System.write(\"(\")\n    showExpr.call(e.left, e.op, false)\n    System.write(op)\n    showExpr.call(e.right, e.op, true)\n    if ((e.op == prec && isRight) || e.op < prec) System.write(\")\")\n}\n\nvar evalExpr // recursive function\nevalExpr = Fn.new { |e|\n    if (!e) return Frac.new(0, 1)\n    if (e.op == OpType.NUM) return Frac.new(e.value, 1)\n    var l = evalExpr.call(e.left)\n    var r = evalExpr.call(e.right)\n    var res = (e.op == OpType.ADD) ? Frac.new(l.num * r.den + l.den * r.num, l.den * r.den) :\n              (e.op == OpType.SUB) ? Frac.new(l.num * r.den - l.den * r.num, l.den * r.den) :\n              (e.op == OpType.MUL) ? Frac.new(l.num * r.num, l.den * r.den) :\n              (e.op == OpType.DIV) ? Frac.new(l.num * r.den, l.den * r.num) :\n               Fiber.abort(\"Unknown op: %(e.op)\")\n    return res\n}\n\nvar solve // recursive function\nsolve = Fn.new { |ea, len|\n    if (len == 1) {\n        var final = evalExpr.call(ea[0])\n        if (final.num == final.den * SOLVE_GOAL && final.den != 0) {\n            showExpr.call(ea[0], OpType.NUM, false)\n            return true\n        }\n    }\n    var ex = List.filled(N_CARDS, null)\n    for (i in 0...len - 1) {\n        for (j in i + 1...len) ex[j - 1] = ea[j]\n        var node = Expr.new(OpType.NUM, null, null, 0)\n        ex[i] = node\n        for (j in i + 1...len) {\n            node.left = ea[i]\n            node.right = ea[j]\n            for (k in OpType.startsFrom+1...OpType.members.count) {\n                node.op = k\n                if (solve.call(ex, len - 1)) return true\n            }\n            node.left = ea[j]\n            node.right = ea[i]\n            node.op = OpType.SUB\n            if (solve.call(ex, len - 1)) return true\n            node.op = OpType.DIV\n            if (solve.call(ex, len - 1)) return true\n            ex[j] = ea[j]\n        }\n        ex[i] = ea[i]\n    }\n    return false\n}\n\nvar solve24 = Fn.new { |n|\n    var l = List.filled(N_CARDS, null)\n    for (i in 0...N_CARDS) l[i] = Expr.new(OpType.NUM, null, null, n[i])\n    return solve.call(l, N_CARDS)\n}\n\nvar r = Random.new()\nvar n = List.filled(N_CARDS, 0)\nfor (j in 0..9) {\n    for (i in 0...N_CARDS) {\n        n[i] = 1 + r.int(MAX_DIGIT)\n        System.write(\" %(n[i])\")\n    }\n    System.write(\":  \")\n    System.print(solve24.call(n) ? \"\" : \"No solution\")\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_149.txt",
        "content": " 5 4 2 6:  (5 + 4) x 2 + 6\n 5 3 2 9:  (5 - 2) x 9 - 3\n 4 8 4 3:  ((4 + 8) - 4) x 3\n 3 8 4 7:  8 - (3 - 7) x 4\n 7 9 9 2:  No solution\n 1 6 5 5:  (1 + 5) x 5 - 6\n 3 2 7 8:  (8 - (3 - 7)) x 2\n 2 2 8 8:  (2 + 2) x 8 - 8\n 6 4 2 5:  (6 - 2) x 5 + 4\n 9 2 1 6:  9 x 2 x 1 + 6\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_15.txt",
        "content": "(1+2+3)*4\n6*8/(9-7)\n(1+2)*(1+7)\n(5+5-6)*6\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_150.txt",
        "content": "operators$ = \"*+-/\"\nspace$ = \"                                                                                \"\n\nsub present()\n\tclear screen\n\tprint \"24 Game\"\n\tprint \"============\\n\"\n\tprint \"Computer provide 4 numbers (1 to 9). With operators +, -, * and / you try to\\nobtain 24.\"\n\tprint \"Use Reverse Polish Notation (first operand and then the operators)\"\n\tprint \"For example: instead of 2 + 4, type 2 4 +\\n\\n\"\nend sub\n\nrepeat\n\tpresent()\n\tserie$ = sortString$(genSerie$())\n\tvalid$ = serie$+operators$\n\tprint \"If you give up, press ENTER and the program attempts to find a solution.\"\n\tline input \"Write your solution: \" input$\n\tif input$ = \"\" then\n\t\tprint \"Thinking ... \"\n\t\tres$ = explorer$()\n\t\tif res$ = \"\" print \"Can not get 24 with these numbers..\"\n\telse\n\t\tinput$ = delSpace$(input$)\n\t\tinputSort$ = sortString$(input$)\n\t\tif (right$(inputSort$,4) <> serie$) or (len(inputSort$)<>7) then\n\t\t\tprint \"Syntax error\"\n\t\telse\n\t\t\tresult = evalInput(input$)\n\t\t\tprint \"Your solution = \",result,\" is \";\n\t\t\tif result = 24 then\n\t\t\t\tprint \"Correct!\"\n\t\t\telse\n\t\t\t\tprint \"Wrong!\"\n\t\t\tend if\n\t\tend if\n\tend if\n\tprint \"\\nDo you want to try again? (press N for exit, other key to continue)\"\nuntil(upper$(left$(inkey$(),1)) = \"N\")\n\nexit\n\nsub genSerie$()\n\tlocal i, c$, s$\n\t\n\tprint \"The numbers you should use are: \";\n\ti = ran()\n\tfor i = 1 to 4\n\t\tc$ = str$(int(ran(9))+1)\n\t\tprint c$,\" \";\n\t\ts$ = s$ + c$\n\tnext i\n\tprint\n\treturn s$\nend sub\n\n\nsub evalInput(entr$)\n\tlocal d1, d2, c$, n(4), i\n\t\n\twhile(entr$<>\"\")\n\t\tc$ = left$(entr$,1)\n\t\tentr$ = mid$(entr$,2)\t\t\n\t\tif instr(serie$,c$) then\n\t\t\ti = i + 1\n\t\t\tn(i) = val(c$)\n\t\telseif instr(operators$,c$) then\n\t\t\td2 = n(i)\n\t\t\tn(i) = 0\n\t\t\ti = i - 1\n\t\t\tif i = 0 return\n\t\t\td1 = n(i)\n\t\t\tn(i) = evaluator(d1, d2, c$)\n\t\telse\n\t\t\tprint \"Invalid symbol\"\n\t\t\treturn\n\t\tend if\n\twend\n\t\n\treturn n(i)\n\t\t\nend sub\n\n\nsub evaluator(d1, d2, op$)\n\tlocal t\n\t\n\tswitch op$\n\t\tcase \"+\": t = d1 + d2\u00a0: break\n\t\tcase \"-\": t = d1 - d2\u00a0: break\n\t\tcase \"*\": t = d1 * d2\u00a0: break\n\t\tcase \"/\": t = d1 / d2\u00a0: break\n\tend switch\n\t\n\treturn t\nend sub\n\n\nsub delSpace$(entr$)\n\tlocal n, i, s$, t$(1)\n\t\n\tn = token(entr$,t$(),\" \")\n\t\n\tfor i=1 to n\n\t\ts$ = s$ + t$(i)\n\tnext i\n\treturn s$\nend sub\n\n\nsub sortString$(string$)\n\tlocal signal, n, fin, c$\n\t\n\tfin = len(string$)-1\n\trepeat\n\t\tsignal = false\n\t\tfor n = 1 to fin\n\t\t\tif mid$(string$,n,1) > mid$(string$,n+1,1) then\n\t\t\t\tsignal = true\n\t\t\t\tc$ = mid$(string$,n,1)\n\t\t\t\tmid$(string$,n,1) = mid$(string$,n+1,1)\n\t\t\t\tmid$(string$,n+1,1) = c$\n\t\t\tend if\n\t\tnext n\n\tuntil(signal = false)\n\treturn string$\nend sub\n\n\nsub explorer$()\n\tlocal d1,d2,o3,x4,x5,x6,o7,p$,result,solution,solutions$,n\n\t\n\tfor d1 = 1 to 4\n\t\tfor d2 = 1 to 4\n\t\t\tfor o3 = 1 to 4\n\t\t\t\tfor x4 = 1 to 8\n\t\t\t\t\tfor x5 = 1 to 8\n\t\t\t\t\t\tfor x6 = 1 to 8\n\t\t\t\t\t\t\tfor o7 = 1 to 4\n\t\t\t\t\t\t\t\tp$ = mid$(serie$,d1,1)+mid$(serie$,d2,1)+mid$(operators$,o3,1)\n\t\t\t\t\t\t\t\tp$ = p$+mid$(valid$,x4,1)+mid$(valid$,x5,1)+mid$(valid$,x6,1)\n\t\t\t\t\t\t\t\tp$ = p$+mid$(operators$,o7,1)\n\t\t\t\t\t\t\t\tif not instr(solutions$,p$) then\n\t\t\t\t\t\t\t\t\tif validateInput(p$) then\n\t\t\t\t\t\t\t\t\t\tresult = evalInput(p$)\n\t\t\t\t\t\t\t\t\t\tif result = 24 then\n\t\t\t\t\t\t\t\t\t\t\tsolution = solution + 1\n\t\t\t\t\t\t\t\t\t\t\tprint \"Solution: \",solution,\" = \";\n\t\t\t\t\t\t\t\t\t\t\tsolutions$ = solutions$ + p$\n\t\t\t\t\t\t\t\t\t\t\tfor n = 1 to 7\n\t\t\t\t\t\t\t\t\t\t\t\tprint mid$(p$,n,1),\" \";\n\t\t\t\t\t\t\t\t\t\t\tnext n\n\t\t\t\t\t\t\t\t\t\t\tprint\n\t\t\t\t\t\t\t\t\t\tend if\n\t\t\t\t\t\t\t\t\tend if\n\t\t\t\t\t\t\t\tend if\n\t\t\t\t\t\t\tnext o7\n\t\t\t\t\t\tnext x6\n\t\t\t\t\tnext x5\n\t\t\t\tnext x4\n\t\t\tnext o3\n\t\tnext d2\n\tnext d1\n\treturn p$\t\nend sub\n\n\nsub validateInput(e$)\n\tlocal n, inputSort$\n\t\n\tinputSort$ = sortString$(e$)\n\tif serie$ <> right$(inputSort$,4) return false\n\tfor n=1 to 3\n\t\tif not instr(operators$,mid$(inputSort$,n,1)) then\n\t\t\treturn false\n\t\tend if\n\tnext n\n\treturn true\nend sub",
        "safe": true
    },
    {
        "filename": "24 game_Solve_151.txt",
        "content": "var [const] H=Utils.Helpers;\nfcn u(xs){ xs.reduce(fcn(us,s){us.holds(s) and us or us.append(s) },L()) }\nvar ops=u(H.combosK(3,\"+-*/\".split(\"\")).apply(H.permute).flatten());\nvar fs=T(\n   fcn f0(a,b,c,d,x,y,z){ Op(z)(Op(y)(Op(x)(a,b),c),d) }, // ((AxB)yC)zD\n   fcn f1(a,b,c,d,x,y,z){ Op(y)(Op(x)(a,b),Op(z)(c,d)) }, // (AxB)y(CzD)\n   fcn f2(a,b,c,d,x,y,z){ Op(z)(Op(x)(a,Op(y)(b,c)),d) }, // (Ax(ByC))zD\n   fcn f3(a,b,c,d,x,y,z){ Op(x)(a,Op(z)(Op(y)(b,c),d)) }, // Ax((ByC)zD)\n   fcn f4(a,b,c,d,x,y,z){ Op(x)(a,Op(y)(b,Op(z)(c,d))) }, // Ax(By(CzD))\n);\n\nvar fts= // format strings for human readable formulas\n  T(\"((d.d).d).d\", \"(d.d).(d.d)\", \"(d.(d.d)).d\", \"d.((d.d).d)\", \"d.(d.(d.d))\")\n  .pump(List,T(\"replace\",\"d\",\"%d\"),T(\"replace\",\".\",\"%s\"));\n\nfcn f2s(digits,ops,f){\n   fts[f.name[1].toInt()].fmt(digits.zip(ops).flatten().xplode(),digits[3]);\n}\n\nfcn game24Solver(digitsString){\n   digits:=digitsString.split(\"\").apply(\"toFloat\");\n   [[(digits4,ops3,f); H.permute(digits); ops;    // list comprehension\n     fs,{ try{f(digits4.xplode(),ops3.xplode()).closeTo(24,0.001) }\n          catch(MathError){ False } };\n     { f2s(digits4,ops3,f) }]];\n}",
        "safe": true
    },
    {
        "filename": "24 game_Solve_152.txt",
        "content": "solutions:=u(game24Solver(ask(0,\"digits: \")));\nprintln(solutions.len(),\" solutions:\");\nsolutions.apply2(Console.println);",
        "safe": true
    },
    {
        "filename": "24 game_Solve_153.txt",
        "content": "zkl solve24.zkl 6795\n6 solutions:\n6+((7-5)*9)\n6-((5-7)*9)\n6-(9*(5-7))\n6+(9*(7-5))\n(9*(7-5))+6\n((7-5)*9)+6\n\nzkl solve24.zkl 1111\n0 solutions:\n\nzkl solve24.zkl 3388\n1 solutions:\n8/(3-(8/3))\n\nzkl solve24.zkl 1234\n242 solutions:\n((1+2)+3)*4\n...\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_16.txt",
        "content": "#include <stdio.h>\n\ntypedef struct {int val, op, left, right;} Node;\n\nNode nodes[10000];\nint iNodes;\n\nint b;\nfloat eval(Node x){\n    if (x.op != -1){\n        float l = eval(nodes[x.left]), r = eval(nodes[x.right]);\n        switch(x.op){\n            case 0: return l+r;\n            case 1: return l-r;\n            case 2: return r-l;\n            case 3: return l*r;\n            case 4: return r?l/r:(b=1,0);\n            case 5: return l?r/l:(b=1,0);\n        }\n    }\n    else return x.val*1.;\n}\n\nvoid show(Node x){\n    if (x.op != -1){\n        printf(\"(\");\n        switch(x.op){\n            case 0: show(nodes[x.left]); printf(\" + \"); show(nodes[x.right]); break;\n            case 1: show(nodes[x.left]); printf(\" - \"); show(nodes[x.right]); break;\n            case 2: show(nodes[x.right]); printf(\" - \"); show(nodes[x.left]); break;\n            case 3: show(nodes[x.left]); printf(\" * \"); show(nodes[x.right]); break;\n            case 4: show(nodes[x.left]); printf(\" / \"); show(nodes[x.right]); break;\n            case 5: show(nodes[x.right]); printf(\" / \"); show(nodes[x.left]); break;\n        }\n        printf(\")\");\n    }\n    else printf(\"%d\", x.val);\n}\n\nint float_fix(float x){ return x < 0.00001 && x > -0.00001; }\n\nvoid solutions(int a[], int n, float t, int s){\n    if (s == n){\n        b = 0;\n        float e = eval(nodes[0]);        \n        \n        if (!b && float_fix(e-t)){\n            show(nodes[0]);\n            printf(\"\\n\");\n        }\n    }\n    else{\n        nodes[iNodes++] = (typeof(Node)){a[s],-1,-1,-1};\n        \n        for (int op = 0; op < 6; op++){    \n            int k = iNodes-1;\n            for (int i = 0; i < k; i++){\n                nodes[iNodes++] = nodes[i];\n                nodes[i] = (typeof(Node)){-1,op,iNodes-1,iNodes-2};\n                solutions(a, n, t, s+1);\n                nodes[i] = nodes[--iNodes];\n            }\n        }\n        \n        iNodes--;\n    }\n};\n\nint main(){\n    // define problem\n\n    int a[4] = {8, 3, 8, 3};\n    float t = 24;\n\n    // print all solutions\n\n    nodes[0] = (typeof(Node)){a[0],-1,-1,-1};\n    iNodes = 1;\n\n    solutions(a, sizeof(a)/sizeof(int), t, 1);\n\n    return 0;\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_17.txt",
        "content": "#include <iostream>\n#include <ratio>\n#include <array>\n#include <algorithm>\n#include <random>\n\ntypedef short int Digit;  // Typedef for the digits data type.\n\nconstexpr Digit nDigits{4};      // Amount of digits that are taken into the game.\nconstexpr Digit maximumDigit{9}; // Maximum digit that may be taken into the game.\nconstexpr short int gameGoal{24};    // Desired result.\n\ntypedef std::array<Digit, nDigits> digitSet; // Typedef for the set of digits in the game.\ndigitSet d;\n\nvoid printTrivialOperation(std::string operation) { // Prints a commutative operation taking all the digits.\n\tbool printOperation(false);\n\tfor(const Digit& number : d) {\n\t\tif(printOperation)\n\t\t\tstd::cout << operation;\n\t\telse\n\t\t\tprintOperation = true;\n\t\tstd::cout << number;\n\t}\n\tstd::cout << std::endl;\n}\n\nvoid printOperation(std::string prefix, std::string operation1, std::string operation2, std::string operation3, std::string suffix = \"\") {\n\tstd::cout << prefix << d[0] << operation1 << d[1] << operation2 << d[2] << operation3 << d[3] << suffix << std::endl;\n}\n\nint main() {\n\tstd::mt19937_64 randomGenerator;\n\tstd::uniform_int_distribution<Digit> digitDistro{1, maximumDigit};\n\t// Let us set up a number of trials:\n\tfor(int trial{10}; trial; --trial) {\n\t\tfor(Digit& digit : d) {\n\t\t\tdigit = digitDistro(randomGenerator);\n\t\t\tstd::cout << digit << \" \";\n\t\t}\n\t\tstd::cout << std::endl;\n\t\tstd::sort(d.begin(), d.end());\n\t\t// We start with the most trivial, commutative operations:\n\t\tif(std::accumulate(d.cbegin(), d.cend(), 0) == gameGoal)\n\t\t\tprintTrivialOperation(\" + \");\n\t\tif(std::accumulate(d.cbegin(), d.cend(), 1, std::multiplies<Digit>{}) == gameGoal)\n\t\t\tprintTrivialOperation(\" * \");\n\t\t// Now let's start working on every permutation of the digits.\n\t\tdo {\n\t\t\t// Operations with 2 symbols + and one symbol -:\n\t\t\tif(d[0] + d[1] + d[2] - d[3] == gameGoal) printOperation(\"\", \" + \", \" + \", \" - \"); // If gameGoal is ever changed to a smaller value, consider adding more operations in this category.\n\t\t\t// Operations with 2 symbols + and one symbol *:\n\t\t\tif(d[0] * d[1] + d[2] + d[3] == gameGoal) printOperation(\"\", \" * \", \" + \", \" + \");\n\t\t\tif(d[0] * (d[1] + d[2]) + d[3] == gameGoal) printOperation(\"\", \" * ( \", \" + \", \" ) + \");\n\t\t\tif(d[0] * (d[1] + d[2] + d[3]) == gameGoal) printOperation(\"\", \" * ( \", \" + \", \" + \", \" )\");\n\t\t\t// Operations with one symbol + and 2 symbols *:\n\t\t\tif((d[0] * d[1] * d[2]) + d[3] == gameGoal) printOperation(\"( \", \" * \", \" * \", \" ) + \");\n\t\t\tif(d[0] * d[1] * (d[2] + d[3]) == gameGoal) printOperation(\"( \", \" * \", \" * ( \", \" + \", \" )\");\n\t\t\tif((d[0] * d[1]) + (d[2] * d[3]) == gameGoal) printOperation(\"( \", \" * \", \" ) + ( \", \" * \", \" )\");\n\t\t\t// Operations with one symbol - and 2 symbols *:\n\t\t\tif((d[0] * d[1] * d[2]) - d[3] == gameGoal) printOperation(\"( \", \" * \", \" * \", \" ) - \");\n\t\t\tif(d[0] * d[1] * (d[2] - d[3]) == gameGoal) printOperation(\"( \", \" * \", \" * ( \", \" - \", \" )\");\n\t\t\tif((d[0] * d[1]) - (d[2] * d[3]) == gameGoal) printOperation(\"( \", \" * \", \" ) - ( \", \" * \", \" )\");\n\t\t\t// Operations with one symbol +, one symbol *, and one symbol -:\n\t\t\tif(d[0] * d[1] + d[2] - d[3] == gameGoal) printOperation(\"\", \" * \", \" + \", \" - \");\n\t\t\tif(d[0] * (d[1] + d[2]) - d[3] == gameGoal) printOperation(\"\", \" * ( \", \" + \", \" ) - \");\n\t\t\tif(d[0] * (d[1] - d[2]) + d[3] == gameGoal) printOperation(\"\", \" * ( \", \" - \", \" ) + \");\n\t\t\tif(d[0] * (d[1] + d[2] - d[3]) == gameGoal) printOperation(\"\", \" * ( \", \" + \", \" - \", \" )\");\n\t\t\tif(d[0] * d[1] - (d[2] + d[3]) == gameGoal) printOperation(\"\", \" * \", \" - ( \", \" + \", \" )\");\n\t\t\t// Operations with one symbol *, one symbol /, one symbol +:\n\t\t\tif(d[0] * d[1] == (gameGoal - d[3]) * d[2]) printOperation(\"( \", \" * \", \" / \", \" ) + \");\n\t\t\tif(((d[0] * d[1]) + d[2]) == gameGoal * d[3]) printOperation(\"(( \", \" * \", \" ) + \", \" ) / \");\n\t\t\tif((d[0] + d[1]) * d[2] == gameGoal * d[3]) printOperation(\"(( \", \" + \", \" ) * \", \" ) / \");\n\t\t\tif(d[0] * d[1] == gameGoal * (d[2] + d[3])) printOperation(\"( \", \" * \", \" ) / ( \", \" + \", \" )\");\n\t\t\t// Operations with one symbol *, one symbol /, one symbol -:\n\t\t\tif(d[0] * d[1] == (gameGoal + d[3]) * d[2]) printOperation(\"( \", \" * \", \" / \", \" ) - \");\n\t\t\tif(((d[0] * d[1]) - d[2]) == gameGoal * d[3]) printOperation(\"(( \", \" * \", \" ) - \", \" ) / \");\n\t\t\tif((d[0] - d[1]) * d[2] == gameGoal * d[3]) printOperation(\"(( \", \" - \", \" ) * \", \" ) / \");\n\t\t\tif(d[0] * d[1] == gameGoal * (d[2] - d[3])) printOperation(\"( \", \" * \", \" ) / ( \", \" - \", \" )\");\n\t\t\t// Operations with 2 symbols *, one symbol /:\n\t\t\tif(d[0] * d[1] * d[2] == gameGoal * d[3]) printOperation(\"\", \" * \", \" * \", \" / \");\n\t\t\tif(d[0] * d[1] == gameGoal * d[2] * d[3]) printOperation(\"\", \" * \", \" / ( \", \" * \", \" )\");\n\t\t\t// Operations with 2 symbols /, one symbol -:\n\t\t\tif(d[0] * d[3] == gameGoal * (d[1] * d[3] - d[2])) printOperation(\"\", \" / ( \", \" - \", \" / \", \" )\");\n\t\t\t// Operations with 2 symbols /, one symbol *:\n\t\t\tif(d[0] * d[1] == gameGoal * d[2] * d[3]) printOperation(\"( \", \" * \", \" / \", \" ) / \", \"\");\n\t\t} while(std::next_permutation(d.begin(), d.end())); // All operations are repeated for all possible permutations of the numbers.\n\t}\n\treturn 0;\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_18.txt",
        "content": "8 3 7 9 \n3 * ( 7 + 9 - 8 )\n3 * ( 9 + 7 - 8 )\n1 4 3 1 \n( 3 * 4 * ( 1 + 1 )\n( 4 * 3 * ( 1 + 1 )\n5 4 3 6 \n6 * ( 3 + 5 - 4 )\n6 * ( 5 + 3 - 4 )\n2 5 5 8 \n5 4 7 3 \n3 * 4 + 5 + 7\n3 * 4 + 7 + 5\n( 3 * 4 * ( 7 - 5 )\n3 * ( 5 + 7 - 4 )\n3 * ( 7 + 5 - 4 )\n4 * 3 + 5 + 7\n4 * 3 + 7 + 5\n( 4 * 3 * ( 7 - 5 )\n4 * 5 + 7 - 3\n5 * 4 + 7 - 3\n5 * ( 7 - 3 ) + 4\n3 3 9 2 \n2 * 9 + 3 + 3\n3 * ( 2 + 3 ) + 9\n3 * ( 2 + 9 - 3 )\n3 * ( 3 + 2 ) + 9\n3 * ( 9 - 2 ) + 3\n3 * ( 9 + 2 - 3 )\n9 * 2 + 3 + 3\n3 2 7 9 \n3 * ( 7 - 2 ) + 9\n(( 7 + 9 ) * 3 ) / 2\n(( 9 + 7 ) * 3 ) / 2\n7 1 5 3 \n7 6 9 4 \n(( 7 + 9 ) * 6 ) / 4\n(( 9 + 7 ) * 6 ) / 4\n3 5 3 1 \n( 1 * 3 * ( 3 + 5 )\n( 1 * 3 * ( 5 + 3 )\n( 3 * 1 * ( 3 + 5 )\n( 3 * 1 * ( 5 + 3 )\n(( 3 + 5 ) * 3 ) / 1\n(( 5 + 3 ) * 3 ) / 1\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_19.txt",
        "content": "using System;\nusing System.Collections.Generic;\nusing static System.Linq.Enumerable;\n\npublic static class Solve24Game\n{\n    public static void Main2() {\n        var testCases = new [] {\n            new [] { 1,1,2,7 },\n            new [] { 1,2,3,4 },\n            new [] { 1,2,4,5 },\n            new [] { 1,2,7,7 },\n            new [] { 1,4,5,6 },\n            new [] { 3,3,8,8 },\n            new [] { 4,4,5,9 },\n            new [] { 5,5,5,5 },\n            new [] { 5,6,7,8 },\n            new [] { 6,6,6,6 },\n            new [] { 6,7,8,9 },\n        };\n        foreach (var t in testCases) Test(24, t);\n        Test(100, 9,9,9,9,9,9);\n\n        static void Test(int target, params int[] numbers) {\n            foreach (var eq in GenerateEquations(target, numbers)) Console.WriteLine(eq);\n            Console.WriteLine();\n        }\n    }\n\n    static readonly char[] ops = { '*', '/', '+', '-' };\n    public static IEnumerable<string> GenerateEquations(int target, params int[] numbers) {\n        var operators = Repeat(ops, numbers.Length - 1).CartesianProduct().Select(e => e.ToArray()).ToList();\n        return (\n            from pattern in Patterns(numbers.Length)\n            let expression = CreateExpression(pattern)\n            from ops in operators\n            where expression.WithOperators(ops).HasPreferredTree()\n            from permutation in Permutations(numbers)\n            let expr = expression.WithValues(permutation)\n            where expr.Value == target && expr.HasPreferredValues()\n            select $\"{expr.ToString()} = {target}\")\n            .Distinct()\n            .DefaultIfEmpty($\"Cannot make {target} with {string.Join(\", \", numbers)}\");\n    }\n\n    ///<summary>Generates postfix expression trees where 1's represent operators and 0's represent numbers.</summary>\n    static IEnumerable<int> Patterns(int length) {\n        if (length == 1) yield return 0; //0\n        if (length == 2) yield return 1; //001\n        if (length < 3) yield break;\n        //Of each tree, the first 2 bits must always be 0 and the last bit must be 1. Generate the bits in between.\n        length -= 2;\n        int len = length * 2 + 3;\n        foreach (int permutation in BinaryPatterns(length, length * 2)) {\n            (int p, int l) = ((permutation << 1) + 1, len);\n            if (IsValidPattern(ref p, ref l)) yield return (permutation << 1) + 1;\n        }\n    }\n\n    ///<summary>Generates all numbers with the given number of 1's and total length.</summary>\n    static IEnumerable<int> BinaryPatterns(int ones, int length) {\n        int initial = (1 << ones) - 1;\n        int blockMask = (1 << length) - 1;\n        for (int v = initial; v >= initial; ) {\n            yield return v;\n            int w = (v | (v - 1)) + 1;\n            w |= (((w & -w) / (v & -v)) >> 1) - 1;\n            v = w & blockMask;\n        }\n    }\n\n    static bool IsValidPattern(ref int pattern, ref int len) {\n        bool isNumber = (pattern & 1) == 0;\n        pattern >>= 1;\n        len--;\n        if (isNumber) return true;\n        IsValidPattern(ref pattern, ref len);\n        IsValidPattern(ref pattern, ref len);\n        return len == 0;\n    }\n\n    static Expr CreateExpression(int pattern) {\n        return Create();\n\n        Expr Create() {\n            bool isNumber = (pattern & 1) == 0;\n            pattern >>= 1;\n            if (isNumber) return new Const(0);\n            Expr right = Create();\n            Expr left = Create();\n            return new Binary('*', left, right);\n        }\n    }\n\n    static IEnumerable<IEnumerable<T>> CartesianProduct<T>(this IEnumerable<IEnumerable<T>> sequences) {\n        IEnumerable<IEnumerable<T>> emptyProduct = new[] { Empty<T>() };\n        return sequences.Aggregate(\n            emptyProduct,\n            (accumulator, sequence) =>\n                from acc in accumulator\n                from item in sequence\n                select acc.Concat(new [] { item }));\n    }\n\n    private static List<int> helper = new List<int>();\n    public static IEnumerable<T[]> Permutations<T>(params T[] input) {\n        if (input == null || input.Length == 0) yield break;\n        helper.Clear();\n        for (int i = 0; i < input.Length; i++) helper.Add(i);\n        while (true) {\n            yield return input;\n            int cursor = helper.Count - 2;\n            while (cursor >= 0 && helper[cursor] > helper[cursor + 1]) cursor--;\n            if (cursor < 0) break;\n            int i = helper.Count - 1;\n            while (i > cursor && helper[i] < helper[cursor]) i--;\n            (helper[cursor], helper[i]) = (helper[i], helper[cursor]);\n            (input[cursor], input[i]) = (input[i], input[cursor]);\n            int firstIndex = cursor + 1;\n            for (int lastIndex = helper.Count - 1; lastIndex > firstIndex; ++firstIndex, --lastIndex) {\n                (helper[firstIndex], helper[lastIndex]) = (helper[lastIndex], helper[firstIndex]);\n                (input[firstIndex], input[lastIndex]) = (input[lastIndex], input[firstIndex]);\n            }\n        }\n    }\n\n    static Expr WithOperators(this Expr expr, char[] operators) {\n        int i = 0;\n        SetOperators(expr, operators, ref i);\n        return expr;\n\n        static void SetOperators(Expr expr, char[] operators, ref int i) {\n            if (expr is Binary b) {\n                b.Symbol = operators[i++];\n                SetOperators(b.Right, operators, ref i);\n                SetOperators(b.Left, operators, ref i);\n            }\n        }\n    }\n\n    static Expr WithValues(this Expr expr, int[] values) {\n        int i = 0;\n        SetValues(expr, values, ref i);\n        return expr;\n\n        static void SetValues(Expr expr, int[] values, ref int i) {\n            if (expr is Binary b) {\n                SetValues(b.Left, values, ref i);\n                SetValues(b.Right, values, ref i);\n            } else {\n                expr.Value = values[i++];\n            }\n        }\n    }\n\n    static bool HasPreferredTree(this Expr expr) => expr switch {\n        Const _ => true,\n    \n        // a / b * c => a * c / b\n        ((_, '/' ,_), '*', _) => false,\n        // c + a * b => a * b + c\n        (var l, '+', (_, '*' ,_) r) when l.Depth < r.Depth => false,\n        // c + a / b => a / b + c\n        (var l, '+', (_, '/' ,_) r) when l.Depth < r.Depth => false,\n        // a * (b + c) => (b + c) * a\n        (var l, '*', (_, '+' ,_) r) when l.Depth < r.Depth => false,\n        // a * (b - c) => (b - c) * a\n        (var l, '*', (_, '-' ,_) r) when l.Depth < r.Depth => false,\n        // (a +- b) + (c */ d) => ((c */ d) + a) +- b\n        ((_, var p, _), '+', (_, var q, _)) when \"+-\".Contains(p) && \"*/\".Contains(q) => false,\n        // a + (b + c) => (a + b) + c\n        (var l, '+', (_, '+' ,_) r) => false,\n        // a + (b - c) => (a + b) - c\n        (var l, '+', (_, '-' ,_) r) => false,\n        // a - (b + c) => (a - b) + c\n        (_, '-', (_, '+', _)) => false,\n        // a * (b * c) => (a * b) * c\n        (var l, '*', (_, '*' ,_) r) => false,\n        // a * (b / c) => (a * b) / c\n        (var l, '*', (_, '/' ,_) r) => false,\n        // a / (b / c) => (a * c) / b\n        (var l, '/', (_, '/' ,_) r) => false,\n        // a - (b - c) * d => (c - b) * d + a\n        (_, '-', ((_, '-' ,_), '*', _)) => false,\n        // a - (b - c) / d => (c - b) / d + a\n        (_, '-', ((_, '-' ,_), '/', _)) => false,\n        // a - (b - c) => a + c - b\n        (_, '-', (_, '-', _)) => false,\n        // (a - b) + c => (a + c) - b\n        ((_, '-', var b), '+', var c) => false,\n\n        (var l, _, var r) => l.HasPreferredTree() && r.HasPreferredTree()\n    };\n\n    static bool HasPreferredValues(this Expr expr) => expr switch {\n        Const _ => true,\n\n        // -a + b => b - a\n        (var l, '+', var r) when l.Value < 0 && r.Value >= 0 => false,\n        // b * a => a * b\n        (var l, '*', var r) when l.Depth == r.Depth && l.Value > r.Value => false,\n        // b + a => a + b\n        (var l, '+', var r) when l.Depth == r.Depth && l.Value > r.Value => false,\n        // (b o c) * (a o d) => (a o d) * (b o c)\n        ((var a, _, _) l, '*', (var c, _, _) r) when l.Value == r.Value && l.Depth == r.Depth && a.Value < c.Value => false,\n        // (b o c) + (a o d) => (a o d) + (b o c)\n        ((var a, var p, _) l, '+', (var c, var q, _) r) when l.Value == r.Value && l.Depth == r.Depth && a.Value < c.Value => false,\n        // (a * c) * b => (a * b) * c\n        ((_, '*', var c), '*', var b) when b.Value < c.Value => false,\n        // (a + c) + b => (a + b) + c\n        ((_, '+', var c), '+', var b) when b.Value < c.Value => false,\n        // (a - b) - c => (a - c) - b\n        ((_, '-', var b), '-', var c) when b.Value < c.Value => false,\n        // a / 1 => a * 1\n        (_, '/', var b) when b.Value == 1 => false,\n        // a * b / b => a + b - b\n        ((_, '*', var b), '/', var c) when b.Value == c.Value => false,\n        // a * 1 * 1 => a + 1 - 1\n        ((_, '*', var b), '*', var c) when b.Value == 1 && c.Value == 1 => false,\n\n        (var l, _, var r) => l.HasPreferredValues() && r.HasPreferredValues()\n    };\n\n    private struct Fraction : IEquatable<Fraction>, IComparable<Fraction>\n    {\n        public readonly int Numerator, Denominator;\n\n        public Fraction(int numerator, int denominator)\n            => (Numerator, Denominator) = (numerator, denominator) switch\n        {\n            (_, 0) => (Math.Sign(numerator), 0),\n            (0, _) => (0, 1),\n            (_, var d) when d < 0 => (-numerator, -denominator),\n            _ => (numerator, denominator)\n        };\n\n        public static implicit operator Fraction(int i) => new Fraction(i, 1);\n        public static Fraction operator +(Fraction a, Fraction b) =>\n            new Fraction(a.Numerator * b.Denominator + a.Denominator * b.Numerator, a.Denominator * b.Denominator);\n        public static Fraction operator -(Fraction a, Fraction b) =>\n            new Fraction(a.Numerator * b.Denominator + a.Denominator * -b.Numerator, a.Denominator * b.Denominator);\n        public static Fraction operator *(Fraction a, Fraction b) =>\n            new Fraction(a.Numerator * b.Numerator, a.Denominator * b.Denominator);\n        public static Fraction operator /(Fraction a, Fraction b) =>\n            new Fraction(a.Numerator * b.Denominator, a.Denominator * b.Numerator);\n\n        public static bool operator ==(Fraction a, Fraction b) => a.CompareTo(b) == 0;\n        public static bool operator !=(Fraction a, Fraction b) => a.CompareTo(b) != 0;\n        public static bool operator  <(Fraction a, Fraction b) => a.CompareTo(b)  < 0;\n        public static bool operator  >(Fraction a, Fraction b) => a.CompareTo(b)  > 0;\n        public static bool operator <=(Fraction a, Fraction b) => a.CompareTo(b) <= 0;\n        public static bool operator >=(Fraction a, Fraction b) => a.CompareTo(b) >= 0;\n\n        public bool Equals(Fraction other) => Numerator == other.Numerator && Denominator == other.Denominator;\n        public override string ToString() => Denominator == 1 ? Numerator.ToString() : $\"[{Numerator}/{Denominator}]\";\n\n        public int CompareTo(Fraction other) => (Numerator, Denominator, other.Numerator, other.Denominator) switch {\n            var (    n1, d1,     n2, d2) when n1 == n2 && d1 == d2 => 0,\n                (     0,  0,      _,  _) => (-1),\n                (     _,  _,      0,  0) => 1,\n            var (    n1, d1,     n2, d2) when d1 == d2 => n1.CompareTo(n2),\n                (var n1,  0,      _,  _) => Math.Sign(n1),\n                (     _,  _, var n2,  0) => Math.Sign(n2),\n            var (    n1, d1,     n2, d2) => (n1 * d2).CompareTo(n2 * d1)\n        };\n    }\n\n    private abstract class Expr\n    {\n        protected Expr(char symbol) => Symbol = symbol;\n        public char Symbol { get; set; }\n        public abstract Fraction Value { get; set; }\n        public abstract int Depth { get; }\n        public abstract void Deconstruct(out Expr left, out char symbol, out Expr right);\n    }\n\n    private sealed class Const : Expr\n    {\n        public Const(Fraction value) : base('c') => Value = value;\n        public override Fraction Value { get; set; }\n        public override int Depth => 0;\n        public override void Deconstruct(out Expr left, out char symbol, out Expr right) => (left, symbol, right) = (this, Symbol, this);\n        public override string ToString() => Value.ToString();\n    }\n\n    private sealed class Binary : Expr\n    {\n        public Binary(char symbol, Expr left, Expr right) : base(symbol) => (Left, Right) = (left, right);\n        public Expr Left { get; }\n        public Expr Right { get; }\n        public override int Depth => Math.Max(Left.Depth, Right.Depth) + 1;\n        public override void Deconstruct(out Expr left, out char symbol, out Expr right) => (left, symbol, right) = (Left, Symbol, Right);\n\n        public override Fraction Value {\n            get => Symbol switch {\n                '*' => Left.Value * Right.Value,\n                '/' => Left.Value / Right.Value,\n                '+' => Left.Value + Right.Value,\n                '-' => Left.Value - Right.Value,\n                _ => throw new InvalidOperationException() };\n            set {}\n        }\n\n        public override string ToString() => Symbol switch {\n            '*' => ToString(\"+-\".Contains(Left.Symbol), \"+-\".Contains(Right.Symbol)),\n            '/' => ToString(\"+-\".Contains(Left.Symbol), \"*/+-\".Contains(Right.Symbol)),\n            '+' => ToString(false, false),\n            '-' => ToString(false, \"+-\".Contains(Right.Symbol)),\n            _ => $\"[{Value}]\"\n        };\n\n        private string ToString(bool wrapLeft, bool wrapRight) =>\n            $\"{(wrapLeft\u00a0? $\"({Left})\"\u00a0: $\"{Left}\")} {Symbol} {(wrapRight\u00a0? $\"({Right})\"\u00a0: $\"{Right}\")}\";\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_2.txt",
        "content": "solve([9, 4, 4, 5]) -> not found\nsolve([1, 7, 2, 7]) -> ((7 * 7) - 1) / 2\nsolve([5, 7, 5, 4]) -> 4 * (7 - (5 / 5))\nsolve([1, 4, 6, 6]) -> 6 + (6 * (4 - 1))\nsolve([2, 3, 7, 3]) -> ((2 + 7) * 3) - 3\nsolve([8, 7, 9, 7]) -> not found\nsolve([1, 6, 2, 6]) -> 6 + (6 * (1 + 2))\nsolve([7, 9, 4, 1]) -> (1 - 9) * (4 - 7)\nsolve([6, 4, 2, 2]) -> (2 - 2) + (4 * 6)\nsolve([5, 7, 9, 7]) -> (5 + 7) * (9 - 7)\nsolve([3, 3, 8, 8]) -> 8 / (3 - (8 / 3))\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_20.txt",
        "content": "(1 + 2) * (1 + 7) = 24\n\n(1 + 3) * (2 + 4) = 24\n1 * 2 * 3 * 4 = 24\n(1 + 2 + 3) * 4 = 24\n\n(5 - 1) * (2 + 4) = 24\n(2 + 5 - 1) * 4 = 24\n\n(7 * 7 - 1) / 2 = 24\n\n4 / (1 - 5 / 6) = 24\n6 / (5 / 4 - 1) = 24\n\n8 / (3 - 8 / 3) = 24\n\nCannot make 24 with 4, 4, 5, 9\n\n5 * 5 - 5 / 5 = 24\n\n(8 - 6) * (5 + 7) = 24\n6 * 8 / (7 - 5) = 24\n(5 + 7 - 8) * 6 = 24\n\n6 + 6 + 6 + 6 = 24\n6 * 6 - 6 - 6 = 24\n\n6 * 8 / (9 - 7) = 24\n\n(9 / 9 + 9) * (9 / 9 + 9) = 100",
        "safe": true
    },
    {
        "filename": "24 game_Solve_21.txt",
        "content": "import ceylon.random {\n\tDefaultRandom\n}\n\nshared sealed class Rational(numerator, denominator = 1) satisfies Numeric<Rational> {\n\t\n\tshared Integer numerator;\n\tshared Integer denominator;\n\t\n\tInteger gcd(Integer a, Integer b) => if (b == 0) then a else gcd(b, a % b);\n\t\n\tshared Rational inverted => Rational(denominator, numerator);\n\t\n\tshared Rational simplified =>\n\t\tlet (largestFactor = gcd(numerator, denominator))\n\t\t\tRational(numerator / largestFactor, denominator / largestFactor);\n\t\n\tdivided(Rational other) => (this * other.inverted).simplified;\n\t\n\tnegated => Rational(-numerator, denominator).simplified;\n\t\n\tplus(Rational other) =>\n\t\tlet (top = numerator*other.denominator + other.numerator*denominator,\n\t\t\tbottom = denominator * other.denominator)\n\t\t\tRational(top, bottom).simplified;\n\t\n\ttimes(Rational other) =>\n\t\tRational(numerator * other.numerator, denominator * other.denominator).simplified;\n\t\n\tshared Integer integer => numerator / denominator;\n\tshared Float float => numerator.float / denominator.float;\n\t\n\tstring => denominator == 1 then numerator.string else \"``numerator``/``denominator``\";\n\t\n\tshared actual Boolean equals(Object that) {\n\t\tif (is Rational that) {\n\t\t\tvalue simplifiedThis = this.simplified;\n\t\t\tvalue simplifiedThat = that.simplified;\n\t\t\treturn simplifiedThis.numerator==simplifiedThat.numerator &&\n\t\t\t\t\tsimplifiedThis.denominator==simplifiedThat.denominator;\n\t\t} else {\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\nshared Rational? rational(Integer numerator, Integer denominator = 1) =>\n\tif (denominator == 0)\n\tthen null\n\telse Rational(numerator, denominator).simplified;\n\nshared Rational numeratorOverOne(Integer numerator) => Rational(numerator);\n\nshared abstract class Operation(String lexeme) of addition | subtraction | multiplication | division {\n\tshared formal Rational perform(Rational left, Rational right);\n\tstring => lexeme;\n}\n\nshared object addition extends Operation(\"+\") {\n\tperform(Rational left, Rational right) => left + right;\n}\nshared object subtraction extends Operation(\"-\") {\n\tperform(Rational left, Rational right) => left - right;\n}\nshared object multiplication extends Operation(\"*\") {\n\tperform(Rational left, Rational right) => left * right;\n}\nshared object division extends Operation(\"/\") {\n\tperform(Rational left, Rational right) => left / right;\n}\n\nshared Operation[] operations = `Operation`.caseValues;\n\nshared interface Expression of NumberExpression | OperationExpression {\n\tshared formal Rational evaluate();\n}\n\nshared class NumberExpression(Rational number) satisfies Expression {\n\tevaluate() => number;\n\tstring => number.string;\n}\nshared class OperationExpression(Expression left, Operation op, Expression right) satisfies Expression {\n\tevaluate() => op.perform(left.evaluate(), right.evaluate());\n\tstring => \"(``left`` ``op`` ``right``)\";\n}\n\nshared void run() {\n\t\n\tvalue twentyfour = numeratorOverOne(24);\n\t\n\tvalue random = DefaultRandom();\n\t\n\tfunction buildExpressions({Rational*} numbers, Operation* ops) {\n\t\tassert (is NumberExpression[4] numTuple = numbers.collect(NumberExpression).tuple());\n\t\tassert (is Operation[3] opTuple = ops.sequence().tuple());\n\t\tvalue [a, b, c, d] = numTuple;\n\t\tvalue [op1, op2, op3] = opTuple;\n\t\tvalue opExp = OperationExpression; // this is just to give it a shorter name\n\t\treturn [\n\t\t\topExp(opExp(opExp(a, op1, b), op2, c), op3, d),\n\t\t\topExp(opExp(a, op1, opExp(b, op2, c)), op3, d),\n\t\t\topExp(a, op1, opExp(opExp(b, op2, c), op3, d)),\n\t\t\topExp(a, op1, opExp(b, op2, opExp(c, op3, d)))\n\t\t];\n\t}\n\t\n\tprint(\"Please enter your 4 numbers to see how they form 24 or enter the letter r for random numbers.\");\n\t\n\tif (exists line = process.readLine()) {\n\t\t\n\t\tRational[] chosenNumbers;\n\t\t\n\t\tif (line.trimmed.uppercased == \"R\") {\n\t\t\tchosenNumbers = random.elements(1..9).take(4).collect((Integer element) => numeratorOverOne(element));\n\t\t\tprint(\"The random numbers are ``chosenNumbers``\");\n\t\t} else {\n\t\t\tchosenNumbers = line.split().map(Integer.parse).narrow<Integer>().collect(numeratorOverOne);\n\t\t}\n\t\t\n\t\tvalue expressions = {\n\t\t\tfor (numbers in chosenNumbers.permutations)\n\t\t\tfor (op1 in operations)\n\t\t\tfor (op2 in operations)\n\t\t\tfor (op3 in operations)\n\t\t\tfor (exp in buildExpressions(numbers, op1, op2, op3))\n\t\t\tif (exp.evaluate() == twentyfour)\n\t\t\texp\n\t\t};\n\t\t\n\t\tprint(\"The solutions are:\");\n\t\texpressions.each(print);\n\t}\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_22.txt",
        "content": "(ns rosettacode.24game.solve\n  (:require [clojure.math.combinatorics :as c]\n            [clojure.walk :as w]))\n\n(def ^:private op-maps\n  (map #(zipmap [:o1 :o2 :o3] %) (c/selections '(* + - /) 3)))\n\n(def ^:private patterns '(\n  (:o1 (:o2 :n1 :n2) (:o3 :n3 :n4))\n  (:o1 :n1 (:o2 :n2 (:o3 :n3 :n4)))\n  (:o1 (:o2 (:o3 :n1 :n2) :n3) :n4)))\n\n(defn play24 [& digits]\n  {:pre (and (every? #(not= 0 %) digits)\n             (= (count digits) 4))}\n  (->> (for [:let [digit-maps\n                     (->> digits sort c/permutations\n                          (map #(zipmap [:n1 :n2 :n3 :n4] %)))]\n             om op-maps, dm digit-maps]\n         (w/prewalk-replace dm \n           (w/prewalk-replace om patterns)))\n       (filter #(= (eval %) 24))\n       (map println)\n       doall\n       count))\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_23.txt",
        "content": "        >>SOURCE FORMAT FREE\n*> This code is dedicated to the public domain\n*> This is GNUCobol 2.0\nidentification division.\nprogram-id. twentyfoursolve.\nenvironment division.\nconfiguration section.\nrepository. function all intrinsic.\ninput-output section.\nfile-control.\n    select count-file\n        assign to count-file-name\n        file status count-file-status\n        organization line sequential.\ndata division.\nfile section.\nfd  count-file.\n01  count-record pic x(7).\n\nworking-storage section.\n01  count-file-name pic x(64) value 'solutioncounts'.\n01  count-file-status pic xx.\n\n01  command-area.\n    03  nd pic 9.\n    03  number-definition.\n        05  n occurs 4 pic 9.\n    03  number-definition-9 redefines number-definition\n        pic 9(4).\n    03  command-input pic x(16).\n    03  command pic x(5).\n    03  number-count pic 9999.\n    03  l1 pic 99.\n    03  l2 pic 99.\n    03  expressions pic zzz,zzz,zz9.\n\n01  number-validation.\n    03  px pic 99.\n    03  permutations value\n          '1234'\n        & '1243'\n        & '1324'\n        & '1342'\n        & '1423'\n        & '1432'\n\n        & '2134'\n        & '2143'\n        & '2314'\n        & '2341'\n        & '2413'\n        & '2431'\n\n        & '3124'\n        & '3142'\n        & '3214'\n        & '3241'\n        & '3423'\n        & '3432'\n\n        & '4123'\n        & '4132'\n        & '4213'\n        & '4231'\n        & '4312'\n        & '4321'.\n        05  permutation occurs 24 pic x(4).\n    03  cpx pic 9.\n    03  current-permutation pic x(4).\n    03  od1 pic 9.\n    03  od2 pic 9.\n    03  od3 pic 9.\n    03  operator-definitions pic x(4) value '+-*/'.\n    03  cox pic 9.\n    03  current-operators pic x(3).\n    03  rpn-forms value\n          'nnonono'\n        & 'nnonnoo'\n        & 'nnnonoo'\n        & 'nnnoono'\n        & 'nnnnooo'.\n        05  rpn-form occurs 5 pic x(7).\n    03  rpx pic 9.\n    03  current-rpn-form pic x(7).\n\n01  calculation-area.\n    03  oqx pic 99.\n    03  output-queue pic x(7).\n    03  work-number pic s9999.\n    03  top-numerator pic s9999 sign leading separate.\n    03  top-denominator pic s9999 sign leading separate.\n    03  rsx pic 9.\n    03  result-stack occurs 8.\n        05  numerator pic s9999.\n        05  denominator pic s9999.\n    03  divide-by-zero-error pic x.\n\n01  totals.\n    03  s pic 999.\n    03  s-lim pic 999 value 600.\n    03  s-max pic 999 value 0.\n    03  solution occurs 600 pic x(7).\n    03  sc pic 999.\n    03  sc1 pic 999.\n    03  sc2 pic 9.\n    03  sc-max pic 999 value 0.\n    03  sc-lim pic 999 value 600.\n    03  solution-counts value zeros.\n        05  solution-count occurs 600 pic 999.\n    03  ns pic 9999.\n    03  ns-max pic 9999 value 0.\n    03  ns-lim pic 9999 value 6561.\n    03  number-solutions occurs 6561.\n        05 ns-number pic x(4).\n        05 ns-count pic 999.\n    03  record-counts pic 9999.\n    03  total-solutions pic 9999.\n\n01  infix-area.\n    03  i pic 9.\n    03  i-s pic 9.\n    03  i-s1 pic 9.\n    03  i-work pic x(16).\n    03  i-stack occurs 7 pic x(13).\n\nprocedure division.\nstart-twentyfoursolve.\n    display 'start twentyfoursolve'\n    perform display-instructions\n    perform get-command\n    perform until command-input = spaces\n        display space\n        initialize command number-count\n        unstring command-input delimited by all space\n            into command number-count\n        move command-input to number-definition\n        move spaces to command-input\n        evaluate command\n        when 'h'\n        when 'help'\n            perform display-instructions\n        when 'list'\n            if ns-max = 0\n                perform load-solution-counts\n            end-if\n            perform list-counts\n        when 'show'\n            if ns-max = 0\n                perform load-solution-counts\n            end-if\n            perform show-numbers\n        when other\n            if number-definition-9 not numeric\n                display 'invalid number'\n            else\n                perform get-solutions\n                perform display-solutions\n            end-if\n        end-evaluate\n        if command-input = spaces\n            perform get-command\n        end-if\n    end-perform\n    display 'exit twentyfoursolve'\n    stop run\n    .\ndisplay-instructions.\n    display space\n    display 'enter a number <n> as four integers from 1-9 to see its solutions'\n    display 'enter list to see counts of solutions for all numbers'\n    display 'enter show <n> to see numbers having <n> solutions'\n    display '<enter> ends the program'\n    .\nget-command.\n    display space\n    move spaces to command-input\n    display '(h for help)?' with no advancing\n    accept command-input\n    .\nask-for-more.\n    display space\n    move 0 to l1\n    add 1 to l2\n    if l2 = 10\n        display 'more (<enter>)?' with no advancing\n        accept command-input\n        move 0 to l2\n    end-if\n    .\nlist-counts. \n    add 1 to sc-max giving sc\n    display 'there are ' sc ' solution counts'\n    display space\n    display 'solutions/numbers'\n    move 0 to l1\n    move 0 to l2\n    perform varying sc from 1 by 1 until sc > sc-max\n    or command-input <> spaces\n        if solution-count(sc) > 0\n            subtract 1 from sc giving sc1 *> offset to capture zero counts\n            display sc1 '/' solution-count(sc) space with no advancing\n            add 1 to l1\n            if l1 = 8\n                perform ask-for-more\n            end-if\n        end-if\n    end-perform\n    if l1 > 0\n        display space\n    end-if\n    .\nshow-numbers. *> with number-count solutions\n    add 1 to number-count giving sc1 *> offset for zero count\n    evaluate true\n    when number-count >= sc-max\n        display 'no number has ' number-count ' solutions'\n        exit paragraph\n    when solution-count(sc1) = 1 and number-count = 1\n        display '1 number has 1 solution'\n    when solution-count(sc1) = 1\n        display '1 number has ' number-count ' solutions'\n    when number-count = 1\n        display solution-count(sc1) ' numbers have 1 solution'\n    when other\n        display solution-count(sc1) ' numbers have ' number-count ' solutions'\n    end-evaluate\n    display space\n    move 0 to l1\n    move 0 to l2\n    perform varying ns from 1 by 1 until ns > ns-max\n    or command-input <> spaces\n        if ns-count(ns) = number-count\n            display ns-number(ns) space with no advancing\n            add 1 to l1\n            if l1 = 14\n                perform ask-for-more\n            end-if\n        end-if\n    end-perform\n    if l1 > 0\n        display space\n    end-if\n    .\ndisplay-solutions.\n    evaluate s-max\n    when 0 display number-definition ' has no solutions'\n    when 1 display number-definition ' has 1 solution'\n    when other display number-definition ' has ' s-max ' solutions'\n    end-evaluate\n    display space\n    move 0 to l1\n    move 0 to l2\n    perform varying s from 1 by 1 until s > s-max\n    or command-input <> spaces\n        *> convert rpn solution(s) to infix\n        move 0 to i-s\n        perform varying i from 1 by 1 until i > 7\n            if solution(s)(i:1) >= '1' and <= '9'\n                add 1 to i-s\n                move solution(s)(i:1) to i-stack(i-s)\n            else\n                subtract 1 from i-s giving i-s1\n                move spaces to i-work\n                string '(' i-stack(i-s1) solution(s)(i:1) i-stack(i-s) ')'\n                    delimited by space into i-work\n                move i-work to i-stack(i-s1)\n                subtract 1 from i-s\n            end-if\n        end-perform\n        display solution(s) space i-stack(1) space space with no advancing\n        add 1 to l1\n        if l1 = 3\n            perform ask-for-more\n        end-if\n    end-perform\n    if l1 > 0\n        display space\n    end-if\n    .\nload-solution-counts.\n    move 0 to ns-max *> numbers and their solution count\n    move 0 to sc-max *> solution counts\n    move spaces to count-file-status\n    open input count-file\n    if count-file-status <> '00'\n        perform create-count-file\n        move 0 to ns-max *> numbers and their solution count\n        move 0 to sc-max *> solution counts\n        open input count-file\n    end-if\n    read count-file\n    move 0 to record-counts\n    move zeros to solution-counts\n    perform until count-file-status <> '00'\n        add 1 to record-counts\n        perform increment-ns-max\n        move count-record to number-solutions(ns-max)\n        add 1 to ns-count(ns-max) giving sc *> offset 1 for zero counts\n        if sc > sc-lim\n            display 'sc ' sc ' exceeds sc-lim ' sc-lim\n            stop run\n        end-if\n        if sc > sc-max\n            move sc to sc-max\n        end-if\n        add 1 to solution-count(sc)\n        read count-file\n    end-perform\n    close count-file\n    .\ncreate-count-file.\n    open output count-file\n    display 'Counting solutions for all numbers'\n    display 'We will examine 9*9*9*9 numbers'\n    display 'For each number we will examine 4! permutations of the digits'\n    display 'For each permutation we will examine 4*4*4 combinations of operators'\n    display 'For each permutation and combination we will examine 5 rpn forms'\n    display 'We will count the number of unique solutions for the given number'\n    display 'Each number and its counts will be written to file ' trim(count-file-name)\n    compute expressions = 9*9*9*9*factorial(4)*4*4*4*5\n    display 'So we will evaluate ' trim(expressions) ' statements'\n    display 'This will take a few minutes'\n    display 'In the future if ' trim(count-file-name) ' exists, this step will be bypassed'\n    move 0 to record-counts\n    move 0 to total-solutions\n    perform varying n(1) from 1 by 1 until n(1) = 0\n        perform varying n(2) from 1 by 1 until n(2) = 0\n            display n(1) n(2) '..' *> show progress\n            perform varying n(3) from 1 by 1 until n(3) = 0\n                perform varying n(4) from 1 by 1 until n(4) = 0\n                    perform get-solutions\n                    perform increment-ns-max\n                    move number-definition to ns-number(ns-max)\n                    move s-max to ns-count(ns-max)\n                    move number-solutions(ns-max) to count-record\n                    write count-record\n                    add s-max to total-solutions\n                    add 1 to record-counts\n                    add 1 to ns-count(ns-max) giving sc *> offset by 1 for zero counts\n                    if sc > sc-lim\n                        display 'error: ' sc ' solution count exceeds ' sc-lim\n                        stop run\n                    end-if\n                    add 1 to solution-count(sc)\n                end-perform\n            end-perform\n        end-perform\n    end-perform\n    close count-file\n    display record-counts ' numbers and counts written to ' trim(count-file-name)\n    display total-solutions ' total solutions'\n    display space\n    .\nincrement-ns-max.\n    if ns-max >= ns-lim\n        display 'error: numbers exceeds ' ns-lim\n        stop run\n    end-if\n    add 1 to ns-max\n    .\nget-solutions.\n    move 0 to s-max\n    perform varying px from 1 by 1 until px > 24\n        move permutation(px) to current-permutation\n        perform varying od1 from 1 by 1 until od1 > 4\n            move operator-definitions(od1:1) to current-operators(1:1)\n            perform varying od2 from 1 by 1 until od2 > 4\n                move operator-definitions(od2:1) to current-operators(2:1)\n                perform varying od3 from 1 by 1 until od3 > 4\n                    move operator-definitions(od3:1) to current-operators(3:1)\n                    perform varying rpx from 1 by 1 until rpx > 5\n                        move rpn-form(rpx) to current-rpn-form\n                        move 0 to cpx cox\n                        move spaces to output-queue\n                        perform varying oqx from 1 by 1 until oqx > 7\n                            if current-rpn-form(oqx:1) = 'n'\n                                add 1 to cpx\n                                move current-permutation(cpx:1) to nd\n                                move n(nd) to output-queue(oqx:1)\n                            else\n                                add 1 to cox\n                                move current-operators(cox:1) to output-queue(oqx:1)\n                            end-if\n                        end-perform\n                        perform evaluate-rpn\n                        if divide-by-zero-error = space\n                        and 24 * top-denominator = top-numerator\n                            perform varying s from 1 by 1 until s > s-max\n                            or solution(s) = output-queue\n                                continue\n                            end-perform\n                            if s > s-max\n                                if s >= s-lim\n                                    display 'error: solutions ' s ' for ' number-definition ' exceeds ' s-lim\n                                    stop run\n                                end-if\n                                move s to s-max\n                                move output-queue to solution(s-max)\n                            end-if\n                        end-if\n                    end-perform\n                end-perform\n            end-perform\n        end-perform\n    end-perform\n    .\nevaluate-rpn.\n    move space to divide-by-zero-error\n    move 0 to rsx *> stack depth\n    perform varying oqx from 1 by 1 until oqx > 7\n        if output-queue(oqx:1) >= '1' and <= '9'\n            *> push the digit onto the stack\n            add 1 to rsx\n            move top-numerator to numerator(rsx)\n            move top-denominator to denominator(rsx)\n            move output-queue(oqx:1) to top-numerator\n            move 1 to top-denominator\n        else\n            *> apply the operation\n            evaluate output-queue(oqx:1)\n            when '+'\n                compute top-numerator = top-numerator * denominator(rsx)\n                    + top-denominator * numerator(rsx)\n                compute top-denominator = top-denominator * denominator(rsx)\n            when '-'\n                compute top-numerator = top-denominator * numerator(rsx)\n                    - top-numerator * denominator(rsx)\n                compute top-denominator = top-denominator * denominator(rsx)\n            when '*'\n                compute top-numerator = top-numerator * numerator(rsx)\n                compute top-denominator = top-denominator * denominator(rsx)\n            when '/'\n                compute work-number = numerator(rsx) * top-denominator\n                compute top-denominator = denominator(rsx) * top-numerator\n                if top-denominator = 0\n                    move 'y' to divide-by-zero-error\n                    exit paragraph\n                end-if\n                move work-number to top-numerator\n            end-evaluate\n            *> pop the stack\n            subtract 1 from rsx\n        end-if\n    end-perform\n    .\nend program twentyfoursolve.\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_24.txt",
        "content": "prompt$ cobc -xj twentyfoursolve.cob\nstart twentyfoursolve\n\nenter a number <n> as four integers from 1-9 to see its solutions\nenter list to see counts of solutions for all numbers\nenter show <n> to see numbers having <n> solutions\n<enter> ends the program\n\n(h for help)?5678\n\n5678 has 026 solutions\n\n57+8-6* (((5+7)-8)*6)  57+86-* ((5+7)*(8-6))  578-+6* ((5+(7-8))*6)\n58-7+6* (((5-8)+7)*6)  587--6* ((5-(8-7))*6)  657+8-* (6*((5+7)-8))\n6578-+* (6*(5+(7-8)))  658-7+* (6*((5-8)+7))  6587--* (6*(5-(8-7)))\n675+8-* (6*((7+5)-8))  6758-+* (6*(7+(5-8)))  675-/8* ((6/(7-5))*8)\n675-8// (6/((7-5)/8))  678-5+* (6*((7-8)+5))  6785--* (6*(7-(8-5)))\n6875-/* (6*(8/(7-5)))  68*75-/ ((6*8)/(7-5))  75+8-6* (((7+5)-8)*6)\n75+86-* ((7+5)*(8-6))  758-+6* ((7+(5-8))*6)  86-57+* ((8-6)*(5+7))\n86-75+* ((8-6)*(7+5))  8675-/* (8*(6/(7-5)))  86*75-/ ((8*6)/(7-5))\n875-/6* ((8/(7-5))*6)  875-6// (8/((7-5)/6))\n\n(h for help)?\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_25.txt",
        "content": "# This program tries to find some way to turn four digits into an arithmetic\n# expression that adds up to 24.  \n#\n# Example solution for 5, 7, 8, 8: \n#    (((8 + 7) * 8) / 5)\n\n\nsolve_24_game = (digits...) ->\n  # Create an array of objects for our helper functions\n  arr = for digit in digits\n    {\n      val: digit\n      expr: digit\n    }\n  combo4 arr...\n\ncombo4 = (a, b, c, d) ->\n  arr = [a, b, c, d]\n  # Reduce this to a three-node problem by combining two\n  # nodes from the array.\n  permutations = [\n    [0, 1, 2, 3]\n    [0, 2, 1, 3]\n    [0, 3, 1, 2]\n    [1, 2, 0, 3]\n    [1, 3, 0, 2]\n    [2, 3, 0, 1]\n  ]\n  for permutation in permutations\n    [i, j, k, m] = permutation\n    for combo in combos arr[i], arr[j]\n      answer = combo3 combo, arr[k], arr[m]  \n      return answer if answer\n  null\n\ncombo3 = (a, b, c) ->\n  arr = [a, b, c]\n  permutations = [\n    [0, 1, 2]\n    [0, 2, 1]\n    [1, 2, 0]\n  ]\n  for permutation in permutations\n    [i, j, k] = permutation\n    for combo in combos arr[i], arr[j]\n      answer = combo2 combo, arr[k]\n      return answer if answer\n  null\n  \ncombo2 = (a, b) ->\n  for combo in combos a, b\n    return combo.expr if combo.val == 24\n  null\n  \ncombos = (a, b) ->\n  [\n    val: a.val + b.val\n    expr: \"(#{a.expr} + #{b.expr})\"\n  ,\n    val: a.val * b.val\n    expr: \"(#{a.expr} * #{b.expr})\"\n  ,\n    val: a.val - b.val\n    expr: \"(#{a.expr} - #{b.expr})\"\n  ,\n    val: b.val - a.val\n    expr: \"(#{b.expr} - #{a.expr})\"\n  ,\n    val: a.val / b.val\n    expr: \"(#{a.expr} / #{b.expr})\"\n  ,\n    val: b.val / a.val\n    expr: \"(#{b.expr} / #{a.expr})\"\n  ,\n  ]\n  \n# test\ndo ->\n  rand_digit = -> 1 + Math.floor (9 * Math.random())\n\n  for i in [1..15]\n    a = rand_digit()\n    b = rand_digit()\n    c = rand_digit()\n    d = rand_digit()\n    solution = solve_24_game a, b, c, d\n    console.log \"Solution for #{[a,b,c,d]}: #{solution ? 'no solution'}\"\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_26.txt",
        "content": "> coffee 24_game.coffee \nSolution for 8,3,1,8: ((1 + 8) * (8 / 3))\nSolution for 6,9,5,7: (6 - ((5 - 7) * 9))\nSolution for 4,2,1,1: no solution\nSolution for 3,5,1,3: (((3 + 5) * 1) * 3)\nSolution for 6,4,1,7: ((7 - (4 - 1)) * 6)\nSolution for 8,1,3,1: (((8 + 1) - 1) * 3)\nSolution for 6,1,3,3: (((6 + 1) * 3) + 3)\nSolution for 7,1,5,6: (((7 - 1) * 5) - 6)\nSolution for 4,2,3,1: ((3 + 1) * (4 + 2))\nSolution for 8,8,5,8: ((5 * 8) - (8 + 8))\nSolution for 3,8,4,1: ((1 - (3 - 8)) * 4)\nSolution for 6,4,3,8: ((8 - (6 / 3)) * 4)\nSolution for 2,1,8,7: (((2 * 8) + 1) + 7)\nSolution for 5,2,7,5: ((2 * 7) + (5 + 5))\nSolution for 2,4,8,9: ((9 - (2 + 4)) * 8)\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_27.txt",
        "content": "(defconstant +ops+ '(* / + -))\n\n(defun digits ()\n  (sort (loop repeat 4 collect (1+ (random 9))) #'<))\n\n(defun expr-value (expr)\n  (eval expr))\n\n(defun divides-by-zero-p (expr)\n  (when (consp expr)\n    (destructuring-bind (op &rest args) expr\n      (or (divides-by-zero-p (car args))\n          (and (eq op '/)\n               (or (and (= 1 (length args))\n                        (zerop (expr-value (car args))))\n                   (some (lambda (arg)\n                           (or (divides-by-zero-p arg)\n                               (zerop (expr-value arg))))\n                         (cdr args))))))))\n\n(defun solvable-p (digits &optional expr)\n  (unless (divides-by-zero-p expr)\n    (if digits\n        (destructuring-bind (next &rest rest) digits\n          (if expr\n              (some (lambda (op)\n                      (solvable-p rest (cons op (list next expr))))\n                    +ops+)\n            (solvable-p rest (list (car +ops+) next))))\n      (when (and expr\n                 (eql 24 (expr-value expr)))\n        (merge-exprs expr)))))\n\n(defun merge-exprs (expr)\n  (if (atom expr)\n      expr\n    (destructuring-bind (op &rest args) expr\n      (if (and (member op '(* +))\n               (= 1 (length args)))\n          (car args)\n        (cons op\n              (case op\n                ((* +)\n                 (loop for arg in args\n                       for merged = (merge-exprs arg)\n                       when (and (consp merged)\n                                 (eq op (car merged)))\n                       append (cdr merged)\n                       else collect merged))\n                (t (mapcar #'merge-exprs args))))))))\n\n(defun solve-24-game (digits)\n  \"Generate a lisp form using the operators in +ops+ and the given\ndigits which evaluates to 24.  The first form found is returned, or\nNIL if there is no solution.\"\n  (solvable-p digits))\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_28.txt",
        "content": "CL-USER 138 > (loop repeat 24 for soln = (solve-24-game (digits)) when soln do (pprint soln))\n\n(+ 7 5 (* 4 3))\n(* 6 4 (- 3 2))\n(+ 9 8 4 3)\n(* 8 (- 6 (* 3 1)))\n(* 6 4 (/ 2 2))\n(* 9 (/ 8 (- 8 5)))\nNIL\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_29.txt",
        "content": "import std.stdio, std.algorithm, std.range, std.conv, std.string,\n       std.concurrency, permutations2, arithmetic_rational;\n\nstring solve(in int target, in int[] problem) {\n    static struct T { Rational r; string e; }\n\n    Generator!T computeAllOperations(in Rational[] L) {\n        return new typeof(return)({\n            if (!L.empty) {\n                immutable x = L[0];\n                if (L.length == 1) {\n                    yield(T(x, x.text));\n                } else {\n                    foreach (const o; computeAllOperations(L.dropOne)) {\n                        immutable y = o.r;\n                        auto sub = [T(x * y, \"*\"), T(x + y, \"+\"), T(x - y, \"-\")];\n                        if (y) sub ~= [T(x / y, \"/\")];\n                        foreach (const e; sub)\n                            yield(T(e.r, format(\"(%s%s%s)\", x, e.e, o.e)));\n                    }\n                }\n            }\n        });\n    }\n\n    foreach (const p; problem.map!Rational.array.permutations!false)\n        foreach (const sol; computeAllOperations(p))\n            if (sol.r == target)\n                return sol.e;\n    return \"No solution\";\n}\n\nvoid main() {\n    foreach (const prob; [[6, 7, 9, 5], [3, 3, 8, 8], [1, 1, 1, 1]])\n        writeln(prob, \": \", solve(24, prob));\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_3.txt",
        "content": "/* ARM assembly AARCH64 Raspberry PI 3B */\n/*  program game24Solvex64.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 NBDIGITS,   4       // digits number\n.equ TOTAL,      24\n.equ BUFFERSIZE, 80\n\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nszMessRules:        .ascii \"24 Game\\n\"\n                    .ascii \"The program will display four randomly-generated \\n\"\n                    .asciz \"single-digit numbers and search a solution for a total to 24\\n\\n\"\n\nszMessDigits:       .asciz \"The four digits are @ @ @ @ and the score is 24. \\n\"\nszMessOK:           .asciz \"Solution\u00a0: \\n\"\nszMessNotOK:        .asciz \"No solution for this problem\u00a0!! \\n\"\nszMessNewGame:      .asciz \"New game (y/n)\u00a0? \\n\"\nszMessErrOper:      .asciz \"Error op\u00e9rator in display result\u00a0!!!\"\nszCarriageReturn:   .asciz \"\\n\"\n.align 4\nqGraine:            .quad 123456\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\n.align 4\nsZoneConv:        .skip 24\nsBuffer:          .skip BUFFERSIZE\nqTabDigit:        .skip 8 * NBDIGITS // digits table\nqTabOperand1:     .skip 8 * NBDIGITS // operand 1 table \nqTabOperand2:     .skip 8 * NBDIGITS // operand 2 table\nqTabOperation:    .skip 8 * NBDIGITS // operator table\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                 // entry of program \n    \n    ldr x0,qAdrszMessRules            // display rules\n    bl affichageMess\n1:\n    mov x3,#0\n    ldr x12,qAdrqTabDigit\n    ldr x5,qAdrszMessDigits\n2:                                    // loop generate random digits \n    mov x0,#8\n    bl genereraleas \n    add x0,x0,#1\n    str x0,[x12,x3,lsl 3]             // store in table\n    ldr x1,qAdrsZoneConv\n    bl conversion10                   // call decimal conversion\n    mov x0,x5\n    ldr x1,qAdrsZoneConv              // insert conversion in message\n    bl strInsertAtCharInc\n    mov x5,x0\n    add x3,x3,#1\n    cmp x3,#NBDIGITS                  // end\u00a0?\n    blt 2b                            // no -> loop\n    mov x0,x5\n    bl affichageMess\n    \n    mov x0,#0                         // start leval\n    mov x1,x12                        // address digits table\n    bl searchSoluce\n    cmp x0,#-1                        // solution\u00a0?\n    bne 3f                            // no \n    ldr x0,qAdrszMessOK\n    bl affichageMess\n    bl writeSoluce                    // yes -> write solution in buffer \n    ldr x0,qAdrsBuffer                // and display buffer\n    bl affichageMess\n    b 10f\n3:                                    // display message no solution\n    ldr x0,qAdrszMessNotOK\n    bl affichageMess\n\n\n10:                                   // display new game\u00a0?\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess\n    ldr x0,qAdrszMessNewGame\n    bl affichageMess\n    bl saisie\n    cmp x0,#'y'\n    beq 1b\n    cmp x0,#'Y'\n    beq 1b\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 \nqAdrszCarriageReturn:     .quad szCarriageReturn\nqAdrszMessRules:          .quad szMessRules\nqAdrszMessDigits:         .quad szMessDigits\nqAdrszMessNotOK:          .quad szMessNotOK\nqAdrszMessOK:             .quad szMessOK\nqAdrszMessNewGame:        .quad szMessNewGame\nqAdrsZoneConv:            .quad sZoneConv\nqAdrqTabDigit:            .quad qTabDigit\n/******************************************************************/\n/*            recherche solution                                       */ \n/******************************************************************/\n/* x0 level   */\n/* x1 table value address */\n/* x0 return -1 if ok     */\nsearchSoluce:\n    stp x1,lr,[sp,-16]!             // save  registres\n    stp x2,x3,[sp,-16]!             // save  registres\n    stp x4,x5,[sp,-16]!             // save  registres\n    stp x6,x7,[sp,-16]!             // save  registres\n    stp x8,x9,[sp,-16]!             // save  registres\n    stp x10,x11,[sp,-16]!           // save  registres\n    stp x12,fp,[sp,-16]!            // save  registres\n    sub sp,sp,#8* NBDIGITS          // reserve size new digits table\n    mov fp,sp                       // frame pointer = address stack\n    mov x10,x1                      // save table\n    add x9,x0,#1                    // new  level\n    mov x13,#NBDIGITS\n    sub x3,x13,x9                   // last element digits table\n    ldr x4,[x1,x3,lsl 3]            // load last element\n    cmp x4,#TOTAL                   // equal to total to search\u00a0?\n    bne 0f                          // no\n    cmp x9,#NBDIGITS                // all digits are used\u00a0?\n    bne 0f                          // no\n    mov x0,#-1                      // yes -> it is ok -> end\n    b 100f\n0:\n    mov x5,#0                       // indice loop 1\n1:                                  // begin loop 1\n    cmp x5,x3\n    bge 9f\n    ldr x4,[x10,x5,lsl 3]           // load first operand\n    ldr x8,qAdrqTabOperand1\n    str x4,[x8,x9,lsl 3]            // and store in operand1 table\n    add x6,x5,#1                    // indice loop 2\n2:                                  // begin loop 2\n    cmp x6,x3\n    bgt 8f\n    ldr x12,[x10,x6,lsl 3]          // load second operand\n    ldr x8,qAdrqTabOperand2\n    str x12,[x8,x9,lsl 3]           // and store in operand2 table\n    mov x7,#0   // k\n    mov x8,#0   // n\n3:  \n    cmp x7,x5\n    beq 4f\n    cmp x7,x6\n    beq 4f\n    ldr x0,[x10,x7,lsl 3]           // copy other digits in new table on stack\n    str x0,[fp,x8,lsl 3]\n    add x8,x8,#1\n4:\n    add x7,x7,#1\n    cmp x7,x3\n    ble 3b\n\n    add x7,x4,x12                   // addition test\n    str x7,[fp,x8,lsl 3]            // store result of addition\n    mov x7,#'+'\n    ldr x0,qAdrqTabOperation\n    str x7,[x0,x9,lsl 3]            // store operator\n    mov x0,x9                       // pass new level\n    mov x1,fp                       // pass new table address on stack\n    bl searchSoluce\n    cmp x0,#0\n    blt 100f\n                                    // soustraction test\n    sub x13,x4,x12\n    sub x14,x12,x4\n    cmp x4,x12\n    csel x7,x13,x14,gt\n    str x7,[fp,x8,lsl 3]\n    mov x7,#'-'\n    ldr x0,qAdrqTabOperation\n    str x7,[x0,x9,lsl 3]\n    mov x0,x9\n    mov x1,fp\n    bl searchSoluce\n    cmp x0,#0\n    blt 100f\n    \n    mul x7,x4,x12                    // multiplication test\n    str x7,[fp,x8,lsl 3]\n    mov x7,#'*'\n    ldr x0,qAdrqTabOperation\n    str x7,[x0,x9,lsl 3]\n    mov x0,x9\n    mov x1,fp\n    bl searchSoluce\n    cmp x0,#0\n    blt 100f\n5:                                    // division test\n    udiv x13,x4,x12\n    msub x14,x13,x12,x4\n    cmp x14,#0\n    bne 6f\n    str x13,[fp,x8,lsl 3]\n    mov x7,#'/'\n    ldr x0,qAdrqTabOperation\n    str x7,[x0,x9,lsl 3]\n    mov x0,x9\n    mov x1,fp\n    bl searchSoluce\n    b 7f\n6:\n    udiv x13,x12,x4\n    msub x14,x13,x4,x12\n    cmp x14,#0\n    bne 7f\n    str x13,[fp,x8,lsl 3]\n    mov x7,#'/'\n    ldr x0,qAdrqTabOperation\n    str x7,[x0,x9,lsl 3]\n    mov x0,x9\n    mov x1,fp\n    bl searchSoluce\n7:\n    cmp x0,#0\n    blt 100f\n    \n    add x6,x6,#1                // increment indice loop 2\n    b 2b\n\n8:\n    add x5,x5,#1                // increment indice loop 1\n    b 1b\n9:\n    \n100:\n    add sp,sp,8* NBDIGITS       // stack alignement\n    ldp x12,fp,[sp],16          // restaur des  2 registres\n    ldp x10,x11,[sp],16         // restaur des  2 registres\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\nqAdrqTabOperand1:         .quad qTabOperand1\nqAdrqTabOperand2:         .quad qTabOperand2\nqAdrqTabOperation:        .quad qTabOperation\n/******************************************************************/\n/*            write solution                                      */ \n/******************************************************************/\nwriteSoluce:\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    stp x10,x11,[sp,-16]!        // save  registres\n    stp x12,fp,[sp,-16]!         // save  registres\n    ldr x6,qAdrqTabOperand1\n    ldr x7,qAdrqTabOperand2\n    ldr x8,qAdrqTabOperation\n    ldr x10,qAdrsBuffer\n    mov x4,#0                    // buffer indice\n    mov x9,#1\n1:\n    ldr x13,[x6,x9,lsl 3]        // operand 1\n    ldr x11,[x7,x9,lsl 3]        // operand  2\n    ldr x12,[x8,x9,lsl 3]        // operator\n    cmp x12,#'-'\n    beq 2f\n    cmp x12,#'/'\n    beq 2f\n    b 3f\n2:                               // if division or soustraction\n    cmp x13,x11                  // reverse operand if operand 1 is < operand 2\n    bge 3f\n    mov x2,x13\n    mov x13,x11\n    mov x11,x2\n3:                               // conversion operand 1 = x13\n    mov x1,#10\n    udiv x2,x13,x1\n    msub x3,x1,x2,x13\n    cmp x2,#0\n    beq 31f\n    add x2,x2,#0x30\n    strb w2,[x10,x4]\n    add x4,x4,#1\n31:\n    add x3,x3,#0x30\n    strb w3,[x10,x4]\n    add x4,x4,#1\n    ldr x2,[x7,x9,lsl 3]\n\n    strb w12,[x10,x4]           // operator\n    add x4,x4,#1\n    \n    mov x1,#10                  // conversion operand  2 = x11\n    udiv x2,x11,x1\n    msub x3,x2,x1,x11\n    cmp x2,#0\n    beq 32f\n    add x2,x2,#0x30\n    strb w2,[x10,x4]\n    add x4,x4,#1\n32:\n    add x3,x3,#0x30\n    strb w3,[x10,x4]\n    add x4,x4,#1\n    \n    mov x0,#'='\n    strb w0,[x10,x4]             // compute sous total\n    add x4,x4,#1\n    cmp x12,'+'                  // addition\n    bne 33f\n    add x0,x13,x11\n    b 37f\n33:\n    cmp x12,'-'                  // soustraction\n    bne 34f\n    sub x0,x13,x11\n    b 37f\n34:\n    cmp x12,'*'                 // multiplication\n    bne 35f\n    mul x0,x13,x11\n    b 37f\n35:\n    cmp x12,'/'                 // division\n    bne 36f\n    udiv x0,x13,x11\n    b 37f\n36:                             // error\n    ldr x0,qAdrszMessErrOper\n    bl affichageMess\n    b 100f\n37:                             // and conversion ascii\n    mov x1,#10\n    udiv x2,x0,x1\n    msub x3,x2,x1,x0\n    cmp x2,#0\n    beq 36f\n    add x2,x2,#0x30\n    strb w2,[x10,x4]\n    add x4,x4,#1\n36:\n    add x3,x3,#0x30\n    strb w3,[x10,x4]\n    add x4,x4,#1\n    mov x0,#'\\n'\n    strb w0,[x10,x4]\n    add x4,x4,#1\n    \n    add x9,x9,1\n    cmp x9,#NBDIGITS\n    blt 1b\n    mov x1,#0\n    strb w1,[x10,x4]            // store 0 final\n    \n100:\n    ldp x12,fp,[sp],16          // restaur des  2 registres\n    ldp x10,x11,[sp],16         // restaur des  2 registres\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\nqAdrsBuffer:         .quad sBuffer\nqAdrszMessErrOper:   .quad szMessErrOper\n/******************************************************************/\n/*            string entry                                       */ \n/******************************************************************/\n/* x0 return the first character of human entry */\nsaisie:\n    stp x1,lr,[sp,-16]!    // save  registres\n    stp x2,x8,[sp,-16]!    // save  registres\n    mov x0,#STDIN          // Linux input console\n    ldr x1,qAdrsBuffer     // buffer address \n    mov x2,#BUFFERSIZE     // buffer size \n    mov x8,#READ           // request to read datas\n    svc 0                  // call system\n    ldr x1,qAdrsBuffer     // buffer address \n    ldrb w0,[x1]           // load first character\n100:\n    ldp x2,x8,[sp],16      // restaur des  2 registres\n    ldp x1,lr,[sp],16      // restaur des  2 registres\n    ret\n/***************************************************/\n/*   Generation random number                  */\n/***************************************************/\n/* x0 contains limit  */\ngenereraleas:\n    stp x1,lr,[sp,-16]!     // save  registres\n    stp x2,x3,[sp,-16]!     // save  registres\n    stp x4,x5,[sp,-16]!     // save  registres\n    ldr x4,qAdrqGraine\n    ldr x2,[x4]\n    ldr x3,qNbDep1\n    mul x2,x3,x2\n    ldr x3,qNbDep2\n    add x2,x2,x3\n    str x2,[x4]             // maj de la graine pour l appel suivant \n    cmp x0,#0\n    beq 100f\n    add x1,x0,#1            // divisor\n    mov x0,x2               // dividende\n    udiv x3,x2,x1\n    msub x0,x3,x1,x0        // r\u00e9sult = remainder\n  \n100:                        // end function\n\n    ldp x4,x5,[sp],16       // restaur des  2 registres\n    ldp x2,x3,[sp],16       // restaur des  2 registres\n    ldp x1,lr,[sp],16       // restaur des  2 registres\n    ret\n/*****************************************************/\nqAdrqGraine: .quad qGraine\nqNbDep1:     .quad 0x0019660d\nqNbDep2:     .quad 0x3c6ef35f\n/********************************************************/\n/*        File Include fonctions                        */\n/********************************************************/\n/* for this file see task include a file in language AArch64 assembly */\n.include \"../includeARM64.inc\"",
        "safe": true
    },
    {
        "filename": "24 game_Solve_30.txt",
        "content": "[6, 7, 9, 5]: (6+(9*(7-5)))\n[3, 3, 8, 8]: (8/(3-(8/3)))\n[1, 1, 1, 1]: No solution",
        "safe": true
    },
    {
        "filename": "24 game_Solve_31.txt",
        "content": ";; use task [[RPN_to_infix_conversion#EchoLisp]] to print results\n(define (rpn->string rpn) \n    (if (vector? rpn)\n        (infix->string (rpn->infix rpn)) \n        \"\ud83d\ude25 Not found\"))\n\n\n(string-delimiter \"\")\n(define OPS #(*  + - // )) ;; use float division\n(define-syntax-rule (commutative? op) (or (= op *) (= op +)))\n\n;; ---------------------------------\n;; calc rpn -> num value or #f if bad rpn\n;; rpn is a vector of ops or numbers\n;; ----------------------------------\n(define (calc rpn)\n(define S (stack 'S))\n    (for ((token rpn))\n        (if (procedure? token)\n            (let [(op2 (pop S)) (op1 (pop S))]\n                (if (and op1 op2)\n                (push S (apply token (list op1 op2))) \n                (push S #f))) ;; not-well formed\n        (push S token ))\n        #:break (not (stack-top S)))\n    (if (= 1 (stack-length S)) (pop S) #f))\n \n;; check for legal rpn -> #f if not legal\n(define (rpn? rpn)\n(define S (stack 'S))\n    (for ((token rpn))\n        (if (procedure? token)\n            (push S (and (pop S) (pop S)))\n            (push S token ))\n        #:break (not (stack-top S)))\n    (stack-top S))\n \n;; --------------------------------------\n;; build-rpn\u00a0: push next rpn op or number\n;; dleft is number of not used digits\n;; ---------------------------------------\n(define count 0)\n\n(define (build-rpn into: rpn  depth  maxdepth  digits  ops dleft target &hit )\n(define cmpop #f)\n    (cond \n;; tooo long\n    [(> (++ count) 200_000) (set-box! &hit 'not-found)]\n;; stop on first hit\n    [(unbox &hit) &hit]\n;; partial rpn must be legal\n    [(not (rpn? rpn)) #f]\n;; eval rpn if complete\n    [(> depth maxdepth) \n        (when (= target (calc rpn))  (set-box! &hit rpn))]\n;;  else, add a digit to rpn\n    [else\n    [when (< depth maxdepth)  ;; digits anywhere except last\n        (for [(d digits) (i 10)] \n                #:continue (zero? d)\n                (vector-set! digits i 0) ;; mark used\n                (vector-set! rpn depth d)\n                (build-rpn rpn (1+ depth) maxdepth  digits  ops (1- dleft)  target &hit)\n                (vector-set! digits i d)) ;; mark unused        \n                ] ;; add digit\n;; or,  add an op\n;; ops anywhere except  positions 0,1\n    [when  (and (> depth 1) (<= (+ depth dleft) maxdepth));; cutter\u00a0: must use all digits\n    (set! cmpop\n        (and (number? [rpn (1- depth)])\n             (number? [rpn (- depth 2)]) \n              (> [rpn (1- depth)]  [rpn (- depth 2)])))\n    \n        (for [(op ops)]\n            #:continue (and cmpop (commutative? op)) ;; cutter\u00a0: 3 4 + ===  4 3 +\n            (vector-set! rpn depth op)\n            (build-rpn rpn (1+ depth) maxdepth  digits  ops dleft target &hit)\n            (vector-set! rpn depth 0))] ;; add op\n        ] ; add something to rpn vector\n        )) ; build-rpn\n\n;;------------------------  \n;;gen24\u00a0: num random numbers\n;;------------------------\n(define (gen24 num maxrange)\n     (->> (append (range 1 maxrange)(range 1 maxrange)) shuffle (take num)))\n\n;;-------------------------------------------\n;; try-rpn\u00a0: sets starter values for build-rpn\n;;-------------------------------------------\n(define (try-rpn digits target)\n    (set! digits (list-sort > digits)) ;; seems to accelerate things\n    (define rpn (make-vector (1- (* 2 (length digits)))))\n    (define &hit (box #f))\n    (set! count 0)\n    \n    (build-rpn rpn starter-depth: 0  \n        max-depth: (1- (vector-length rpn))\n         (list->vector digits)\n         OPS\n        remaining-digits: (length digits)\n        target &hit )\n    (writeln  target '=   (rpn->string (unbox &hit)) 'tries= count))\n\n;; -------------------------------\n;; (task numdigits target maxrange)\n;; --------------------------------\n(define (task (numdigits 4) (target 24) (maxrange 10))\n        (define digits (gen24 numdigits maxrange))       \n        (writeln digits '\u2192 target)\n        (try-rpn digits target))\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_32.txt",
        "content": "(task 4)\u00a0;; standard 24-game\n(7 9 2 4)     \u2192     24    \n24     =     9 + 7 + 4 * 2     tries=     35    \n\n(task 4)\n(1 9 3 4)     \u2192     24    \n24     =     9 + (4 + 1) * 3     tries=     468   \n \n(task 5 )\u00a0;; 5 digits\n(4 8 6 9 8)     \u2192     24    \n24     =     9 * 8 * (8 / (6 * 4))     tries=     104    \n\n(task 5 100)\u00a0;; target = 100\n(5 6 5 1 3)     \u2192     100    \n100     =     (6 + (5 * 3 - 1)) * 5     tries=     10688    \n\n(task 5 (random 100))\n(1 1 8 6 8)     \u2192     31    \n31     =     8 * (6 - 1) - (8 + 1)     tries=     45673    \n\n(task 6 (random 100))\u00a0;; 6 digits\n(7 2 7 8 3 1)     \u2192     40    \n40     =     8 / (7 / (7 * (3 + 2 * 1)))     tries=     154    \n\n(task 6 (random 1000) 100)\u00a0;; 6 numbers < 100 , target < 1000\n(19 15 83 74 61 48)     \u2192     739    \n739     =     (83 + (74 - (61 + 48))) * 15 + 19     tries=     29336    \n\n(task 6 (random 1000) 100)\u00a0;; 6 numbers < 100\n(73 29 65 78 22 43)     \u2192     1    \n1     =     \ud83d\ude25 Not found     tries=     200033  \n\n(task 7 (random 1000) 100)\u00a0;; 7 numbers < 100\n(7 55 94 4 71 58 93)     \u2192     705    \n705     =     94 + 93 + 71 + 58 + 55 * 7 + 4     tries=     5982 \n\n(task 6 (random -100) 10)\u00a0;; negative target\n(5 9 7 3 6 3)     \u2192     -54    \n-54     =     9 * (7 + (6 - 5 * 3)) * 3     tries=     2576         \n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_33.txt",
        "content": "defmodule Game24 do\n  @expressions [ [\"((\", \"\", \")\", \"\", \")\", \"\"],\n                 [\"(\", \"(\", \"\", \"\", \"))\", \"\"],\n                 [\"(\", \"\", \")\", \"(\", \"\", \")\"],\n                 [\"\", \"((\", \"\", \"\", \")\", \")\"],\n                 [\"\", \"(\", \"\", \"(\", \"\", \"))\"] ]\n  \n  def solve(digits) do\n    dig_perm = permute(digits) |> Enum.uniq\n    operators = perm_rep(~w[+ - * /], 3)\n    for dig <- dig_perm, ope <- operators, expr <- @expressions,\n        check?(str = make_expr(dig, ope, expr)),\n        do: str\n  end\n  \n  defp check?(str) do\n    try do\n      {val, _} = Code.eval_string(str)\n      val == 24\n    rescue\n      ArithmeticError -> false      # division by zero \n    end\n  end\n  \n  defp permute([]), do: [[]]\n  defp permute(list) do\n    for x <- list, y <- permute(list -- [x]), do: [x|y]\n  end\n  \n  defp perm_rep([], _), do: [[]]\n  defp perm_rep(_,  0), do: [[]]\n  defp perm_rep(list, i) do\n    for x <- list, y <- perm_rep(list, i-1), do: [x|y]\n  end\n  \n  defp make_expr([a,b,c,d], [x,y,z], [e0,e1,e2,e3,e4,e5]) do\n    e0 <> a <> x <> e1 <> b <> e2 <> y <> e3 <> c <> e4 <> z <> d <> e5\n  end\nend\n\ncase Game24.solve(System.argv) do\n  [] -> IO.puts \"no solutions\"\n  solutions ->\n    IO.puts \"found #{length(solutions)} solutions, including #{hd(solutions)}\"\n    IO.inspect Enum.sort(solutions)\nend\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_34.txt",
        "content": "C:\\Elixir>elixir game24.exs 1 1 3 4\nfound 12 solutions, including ((1+1)*3)*4\n[\"((1+1)*3)*4\", \"((1+1)*4)*3\", \"(1+1)*(3*4)\", \"(1+1)*(4*3)\", \"(3*(1+1))*4\",\n \"(3*4)*(1+1)\", \"(4*(1+1))*3\", \"(4*3)*(1+1)\", \"3*((1+1)*4)\", \"3*(4*(1+1))\",\n \"4*((1+1)*3)\", \"4*(3*(1+1))\"]\n\nC:\\Elixir>elixir game24.exs 6 7 8 9\nfound 8 solutions, including (6*8)/(9-7)\n[\"(6*8)/(9-7)\", \"(6/(9-7))*8\", \"(8*6)/(9-7)\", \"(8/(9-7))*6\", \"6*(8/(9-7))\",\n \"6/((9-7)/8)\", \"8*(6/(9-7))\", \"8/((9-7)/6)\"]\n\nC:\\Elixir>elixir game24.exs 1 2 2 3\nno solutions\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_35.txt",
        "content": "PROGRAM 24SOLVE\n\nLABEL 98,99,2540,2550,2560\n\n! possible brackets\nCONST NBRACKETS=11,ST_CONST$=\"+-*/^(\"\n\nDIM D[4],PERM[24,4]\nDIM BRAKETS$[NBRACKETS]\nDIM OP$[3]\nDIM STACK$[50]\n\nPROCEDURE COMPATTA_STACK\n   IF NS>1 THEN\n      R=1\n      WHILE R<NS DO\n         IF INSTR(ST_CONST$,STACK$[R])=0 AND INSTR(ST_CONST$,STACK$[R+1])=0 THEN\n            FOR R1=R TO NS-1 DO\n              STACK$[R1]=STACK$[R1+1]\n            END FOR\n            NS=NS-1\n         END IF\n         R=R+1\n      END WHILE\n   END IF\nEND PROCEDURE\n\nPROCEDURE CALC_ARITM\n     L=NS1\n     WHILE L<=NS2 DO\n        IF STACK$[L]=\"^\" THEN\n            IF L>=NS2 THEN GOTO 99 END IF\n            N1#=VAL(STACK$[L-1]) N2#=VAL(STACK$[L+1]) NOP=NOP-1\n            IF STACK$[L]=\"^\" THEN\n                RI#=N1#^N2#\n            END IF\n            STACK$[L-1]=STR$(RI#)\n            N=L\n            WHILE N<=NS2-2 DO\n               STACK$[N]=STACK$[N+2]\n               N=N+1\n            END WHILE\n            NS2=NS2-2\n            L=NS1-1\n        END IF\n        L=L+1\n     END WHILE\n\n     L=NS1\n     WHILE L<=NS2 DO\n        IF STACK$[L]=\"*\" OR STACK$[L]=\"/\" THEN\n            IF L>=NS2 THEN GOTO 99 END IF\n            N1#=VAL(STACK$[L-1]) N2#=VAL(STACK$[L+1]) NOP=NOP-1\n            IF STACK$[L]=\"*\" THEN\n                 RI#=N1#*N2#\n              ELSE\n                 IF N2#<>0 THEN RI#=N1#/N2# ELSE NERR=6 RI#=0 END IF\n            END IF\n            STACK$[L-1]=STR$(RI#)\n            N=L\n            WHILE N<=NS2-2 DO\n               STACK$[N]=STACK$[N+2]\n               N=N+1\n            END WHILE\n            NS2=NS2-2\n            L=NS1-1\n        END IF\n        L=L+1\n     END WHILE\n\n     L=NS1\n     WHILE L<=NS2 DO\n        IF STACK$[L]=\"+\" OR STACK$[L]=\"-\" THEN\n            EXIT IF L>=NS2\n            N1#=VAL(STACK$[L-1]) N2#=VAL(STACK$[L+1])  NOP=NOP-1\n            IF STACK$[L]=\"+\" THEN RI#=N1#+N2# ELSE RI#=N1#-N2# END IF\n            STACK$[L-1]=STR$(RI#)\n            N=L\n            WHILE N<=NS2-2 DO\n               STACK$[N]=STACK$[N+2]\n               N=N+1\n            END WHILE\n            NS2=NS2-2\n            L=NS1-1\n        END IF\n        L=L+1\n     END WHILE\n99:\n     IF NOP<2 THEN  \u00a0! precedenza tra gli operatori\n          DB#=VAL(STACK$[NS1])\n       ELSE\n          IF NOP<3 THEN\n               DB#=VAL(STACK$[NS1+2])\n             ELSE\n               DB#=VAL(STACK$[NS1+4])\n          END IF\n     END IF\nEND PROCEDURE\n\nPROCEDURE SVOLGI_PAR\n   NPA=NPA-1\n   FOR J=NS TO 1 STEP -1 DO\n      EXIT IF STACK$[J]=\"(\"\n   END FOR\n   IF J=0 THEN\n       NS1=1  NS2=NS  CALC_ARITM NERR=7\n     ELSE\n       FOR R=J TO NS-1 DO\n         STACK$[R]=STACK$[R+1]\n       END FOR\n       NS1=J  NS2=NS-1  CALC_ARITM\n       IF NS1=2 THEN\n           NS1=1 STACK$[1]=STACK$[2]\n       END IF\n       NS=NS1\n       COMPATTA_STACK\n   END IF\nEND PROCEDURE\n\nPROCEDURE MYEVAL(EXPRESSION$,DB#,NERR->DB#,NERR)\n\n     NOP=0 NPA=0 NS=1 K$=\"\" NERR=0\n     STACK$[1]=\"@\"         \u00a0! init stack\n\n     FOR W=1 TO LEN(EXPRESSION$) DO\n        LOOP\n           CODE=ASC(MID$(EXPRESSION$,W,1))\n           IF (CODE>=48 AND CODE<=57) OR CODE=46 THEN\n                K$=K$+CHR$(CODE)\n                W=W+1 IF W>LEN(EXPRESSION$) THEN GOTO 98 END IF\n              ELSE\n                EXIT IF K$=\"\"\n                IF NS>1 OR (NS=1 AND STACK$[1]<>\"@\") THEN NS=NS+1 END IF\n                IF FLAG=0 THEN\n                      STACK$[NS]=K$\n                   ELSE\n                      STACK$[NS]=STR$(VAL(K$)*FLAG)\n                END IF\n                K$=\"\"  FLAG=0\n                EXIT\n           END IF\n        END LOOP\n        IF CODE=43 THEN K$=\"+\" END IF\n        IF CODE=45 THEN K$=\"-\" END IF\n        IF CODE=42 THEN K$=\"*\" END IF\n        IF CODE=47 THEN K$=\"/\" END IF\n        IF CODE=94 THEN K$=\"^\" END IF\n\n        CASE CODE OF\n          43,45,42,47,94-> \u00a0! +-*/^\n             IF MID$(EXPRESSION$,W+1,1)=\"-\" THEN FLAG=-1  W=W+1 END IF\n             IF INSTR(ST_CONST$,STACK$[NS])<>0 THEN\n                 NERR=5\n               ELSE\n                 NS=NS+1 STACK$[NS]=K$ NOP=NOP+1\n                 IF NOP>=2 THEN\n                    FOR J=NS TO 1 STEP -1 DO\n                       IF STACK$[J]<>\"(\" THEN GOTO 2540 END IF\n                       IF J<NS-2 THEN GOTO 2550 ELSE GOTO 2560 END IF\n2540:               END FOR\n2550:               NS1=J+1 NS2=NS CALC_ARITM\n                    NS=NS2  STACK$[NS]=K$\n                    REGISTRO_X#=VAL(STACK$[NS-1])\n                 END IF\n             END IF\n2560:     END ->\n\n          40-> \u00a0! (\n             IF NS>1 OR (NS=1 AND STACK$[1]<>\"@\") THEN NS=NS+1 END IF\n             STACK$[NS]=\"(\" NPA=NPA+1\n             IF MID$(EXPRESSION$,W+1,1)=\"-\" THEN FLAG=-1 W=W+1 END IF\n          END ->\n\n          41->\u00a0! )\n             SVOLGI_PAR\n             IF NERR=7 THEN\n                  NERR=0 NOP=0 NPA=0 NS=1\n               ELSE\n                  IF NERR=0 OR NERR=1 THEN\n                      DB#=VAL(STACK$[NS])\n                      REGISTRO_X#=DB#\n                    ELSE\n                      NOP=0 NPA=0 NS=1\n                  END IF\n             END IF\n          END ->\n\n          OTHERWISE\n             NERR=8\n        END CASE\n        K$=\"\"\n   END FOR\n98:\n   IF K$<>\"\" THEN\n        IF NS>1 OR (NS=1 AND STACK$[1]<>\"@\") THEN NS=NS+1 END IF\n        IF FLAG=0 THEN STACK$[NS]=K$ ELSE STACK$[NS]=STR$(VAL(K$)*FLAG) END IF\n   END IF\n\n   IF INSTR(ST_CONST$,STACK$[NS])<>0 THEN\n         NERR=6\n       ELSE\n         WHILE NPA<>0 DO\n             SVOLGI_PAR\n         END WHILE\n         IF NERR<>7 THEN NS1=1  NS2=NS CALCARITM END IF\n    END IF\n\n    NS=1  NOP=0  NPA=0\n\nEND PROCEDURE\n\nBEGIN\n   PRINT(CHR$(12);)\u00a0! CLS\n\n  \u00a0! possible brackets\n   DATA(\"4#4#4#4\")\n   DATA(\"(4#4)#4#4\")\n   DATA(\"4#(4#4)#4\")\n   DATA(\"4#4#(4#4)\")\n   DATA(\"(4#4)#(4#4)\")\n   DATA(\"(4#4#4)#4\")\n   DATA(\"4#(4#4#4)\")\n   DATA(\"((4#4)#4)#4\")\n   DATA(\"(4#(4#4))#4\")\n   DATA(\"4#((4#4)#4)\")\n   DATA(\"4#(4#(4#4))\")\n   FOR I=1 TO NBRACKETS DO\n     READ(BRAKETS$[I])\n   END FOR\n\n   INPUT(\"ENTER 4 DIGITS: \",A$)\n   ND=0\n   FOR I=1 TO LEN(A$) DO\n      C$=MID$(A$,I,1)\n      IF INSTR(\"123456789\",C$)>0 THEN\n        ND=ND+1\n        D[ND]=VAL(C$)\n      END IF\n   END FOR\n  \u00a0! precompute permutations. dumb way.\n   NPERM=1*2*3*4\n   N=0\n   FOR I=1 TO 4 DO\n      FOR J=1 TO 4 DO\n        FOR K=1 TO 4 DO\n            FOR L=1 TO 4 DO\n           \u00a0! valid permutation (no dupes)\n                IF I<>J AND I<>K AND I<>L  AND J<>K AND J<>L AND K<>L THEN\n                    N=N+1\n! actually,we can as well permute given digits\n                    PERM[N,1]=D[I]\n                    PERM[N,2]=D[J]\n                    PERM[N,3]=D[K]\n                    PERM[N,4]=D[L]\n                END IF\n            END FOR\n        END FOR\n      END FOR\n   END FOR\n\n  \u00a0! operations: full search\n   COUNT=0\n   OPS$=\"+-*/\"\n   FOR OP1=1 TO 4 DO\n      OP$[1]=MID$(OPS$,OP1,1)\n      FOR OP2=1 TO 4 DO\n        OP$[2]=MID$(OPS$,OP2,1)\n        FOR OP3=1 TO 4 DO\n            OP$[3]=MID$(OPS$,OP3,1)\n           \u00a0! substitute all brackets\n            FOR T=1 TO NBRACKETS DO\n                TMPL$=BRAKETS$[T]\n               \u00a0! now,substitute all digits: permutations.\n                FOR P=1 TO NPERM DO\n                    RES$=\"\"\n                    NOP=0\n                    ND=0\n                    FOR I=1 TO LEN(TMPL$) DO\n                        C$=MID$(TMPL$,I,1)\n                        CASE C$ OF\n                        \"#\"->               \u00a0! operations\n                            NOP=NOP+1\n                            RES$=RES$+OP$[NOP]\n                        END ->\n                        \"4\"->               \u00a0! digits\n                            ND=NOP+1\n                            RES$=RES$+MID$(STR$(PERM[P,ND]),2)\n                        END ->\n                        OTHERWISE           \u00a0! brackets goes here\n                            RES$=RES$+C$\n                        END CASE\n                    END FOR\n                   \u00a0! eval here\n                    MY_EVAL(RES$,DB#,NERR->DB#,NERR)\n                    IF DB#=24 AND NERR=0 THEN\n                        PRINT(\"24=\";RES$)\n                        COUNT=COUNT+1\n                    END IF\n                END FOR\n            END FOR\n        END FOR\n      END FOR\n    END FOR\n\n    IF COUNT=0 THEN\n       PRINT(\"If you see this, probably task cannot be solved with these digits\")\n     ELSE\n       PRINT(\"Total=\";COUNT)\n    END IF\n\nEND PROGRAM",
        "safe": true
    },
    {
        "filename": "24 game_Solve_36.txt",
        "content": "ENTER 4 DIGITS:\u00a0? 6759\n24=6+(7-5)*9\n24=6+((7-5)*9)\n24=6+9*(7-5)\n24=6+(9*(7-5))\n24=6-(5-7)*9\n24=6-((5-7)*9)\n24=(7-5)*9+6\n24=((7-5)*9)+6\n24=6-9*(5-7)\n24=6-(9*(5-7))\n24=9*(7-5)+6\n24=(9*(7-5))+6\nTotal= 12\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_37.txt",
        "content": ">function try24 (v) ...\n$n=cols(v);\n$if n==1 and v[1]~=24 then\n$  \"Solved the problem\",\n$  return 1;\n$endif\n$loop 1 to n\n$  w=tail(v,2);\n$  loop 1 to n-1\n$    h=w; a=v[1]; b=w[1];\n$    w[1]=a+b; if try24(w); \"\"+a+\"+\"+b+\"=\"+(a+b), return 1; endif;\n$    w[1]=a-b; if try24(w); \"\"+a+\"-\"+b+\"=\"+(a-b), return 1; endif;\n$    w[1]=a*b; if try24(w); \"\"+a+\"*\"+b+\"=\"+(a*b), return 1; endif;\n$    if not b~=0 then \n$       w[1]=a/b; if try24(w); \"\"+a+\"/\"+b+\"=\"+(a/b), return 1; endif;\n$    endif;\n$    w=rotright(w);\n$  end;\n$  v=rotright(v);\n$end;\n$return 0;\n$endfunction",
        "safe": true
    },
    {
        "filename": "24 game_Solve_38.txt",
        "content": ">try24([1,2,3,4]);\n Solved the problem\n 6*4=24\n 3+3=6\n 1+2=3\n>try24([8,7,7,1]);\n Solved the problem\n 22+2=24\n 14+8=22\n 7+7=14\n>try24([8,4,7,1]);\n Solved the problem\n 6*4=24\n 7-1=6\n 8-4=4\n>try24([3,4,5,6]);\n Solved the problem\n 4*6=24\n -1+5=4\n 3-4=-1",
        "safe": true
    },
    {
        "filename": "24 game_Solve_39.txt",
        "content": "open System\n\nlet rec gcd x y = if x = y || x = 0 then y else if x < y then gcd y x else gcd y (x-y)\nlet abs (x : int) = Math.Abs x\nlet sign (x: int) = Math.Sign x\nlet cint s = Int32.Parse(s)\n\ntype Rat(x : int, y : int) =\n    let g = if y = 0 then 0 else gcd (abs x) (abs y)\n    member this.n = if g = 0 then sign y * sign x else sign y * x / g   // store a minus sign in the numerator\n    member this.d =\n        if y = 0 then 0 else sign y * y / g\n    static member (~-) (x : Rat) = Rat(-x.n, x.d)\n    static member (+) (x : Rat, y : Rat) = Rat(x.n * y.d + y.n * x.d, x.d * y.d)\n    static member (-) (x : Rat, y : Rat) = x + Rat(-y.n, y.d)\n    static member (*) (x : Rat, y : Rat) = Rat(x.n * y.n, x.d * y.d)\n    static member (/) (x : Rat, y : Rat) = x * Rat(y.d, y.n)\n    interface System.IComparable with\n      member this.CompareTo o = \n        match o with\n        | :? Rat as that -> compare (this.n * that.d) (that.n * this.d)\n        | _ -> invalidArg \"o\" \"cannot compare values of differnet types.\"\n    override this.Equals(o) =\n        match o with\n        | :? Rat as that -> this.n = that.n && this.d = that.d\n        | _ -> false\n    override this.ToString() =\n        if this.d = 1 then this.n.ToString()\n        else sprintf @\"<%d,%d>\" this.n this.d\n    new(x : string, y : string) = if y = \"\" then Rat(cint x, 1) else Rat(cint x, cint y)\n\ntype expression =\n    | Const of Rat\n    | Sum  of expression * expression\n    | Diff of expression * expression\n    | Prod of expression * expression\n    | Quot of expression * expression\n \nlet rec eval = function\n    | Const c -> c\n    | Sum (f, g) -> eval f + eval g\n    | Diff(f, g) -> eval f - eval g\n    | Prod(f, g) -> eval f * eval g\n    | Quot(f, g) -> eval f / eval g\n\nlet print_expr expr =\n    let concat (s : seq<string>) = System.String.Concat s\n    let paren p prec op_prec = if prec > op_prec then p else \"\"\n    let rec print prec = function\n    | Const c -> c.ToString()\n    | Sum(f, g) ->\n        concat [ (paren \"(\" prec 0); (print 0 f); \" + \"; (print 0 g); (paren \")\" prec 0) ]\n    | Diff(f, g) ->\n        concat [ (paren \"(\" prec 0); (print 0 f); \" - \"; (print 1 g); (paren \")\" prec 0) ]\n    | Prod(f, g) ->\n        concat [ (paren \"(\" prec 2); (print 2 f); \" * \"; (print 2 g); (paren \")\" prec 2) ]\n    | Quot(f, g) ->\n        concat [ (paren \"(\" prec 2); (print 2 f); \" / \"; (print 3 g); (paren \")\" prec 2) ]\n    print 0 expr\n    \nlet rec normal expr =\n    let norm epxr =\n        match expr with\n        | Sum(x, y) -> if eval x <= eval y then expr else Sum(normal y, normal x)\n        | Prod(x, y) -> if eval x <= eval y then expr else Prod(normal y, normal x)\n        | _ -> expr\n    match expr with\n    | Const c -> expr\n    | Sum(x, y) -> norm (Sum(normal x, normal y))\n    | Prod(x, y) -> norm (Prod(normal x, normal y))\n    | Diff(x, y) -> Diff(normal x, normal y)\n    | Quot(x, y) -> Quot(normal x, normal y)\n \nlet rec insert v = function\n    | [] -> [[v]]\n    | x::xs as li -> (v::li) :: (List.map (fun y -> x::y) (insert v xs))\n \nlet permutations li = \n    List.foldBack (fun x z -> List.concat (List.map (insert x) z)) li [[]]\n\nlet rec comp expr rest = seq {\n    match rest with\n    | x::xs ->\n        yield! comp (Sum (expr, x)) xs;\n        yield! comp (Diff(x, expr)) xs;\n        yield! comp (Diff(expr, x)) xs;\n        yield! comp (Prod(expr, x)) xs;\n        yield! comp (Quot(x, expr)) xs;\n        yield! comp (Quot(expr, x)) xs;\n    | [] -> if eval expr = Rat(24,1) then yield print_expr (normal expr)\n}\n\n[<EntryPoint>]\nlet main argv =\n    let digits = List.init 4 (fun i -> Const (Rat(argv.[i],\"\")))\n    let solutions =\n        permutations digits\n        |> Seq.groupBy (sprintf \"%A\")\n        |> Seq.map snd |> Seq.map Seq.head\n        |> Seq.map (fun x -> comp (List.head x) (List.tail x))\n        |> Seq.choose (fun x -> if Seq.isEmpty x then None else Some x)\n        |> Seq.concat\n    if Seq.isEmpty solutions then\n        printfn \"No solutions.\"\n    else\n        solutions\n        |> Seq.groupBy id\n        |> Seq.iter (fun x -> printfn \"%s\" (fst x))\n    0\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_4.txt",
        "content": "The four digits are 6 8 3 1 and the score is 24.\nSolution\u00a0:\n6*8=48\n3-1=2\n48/2=24\n\nNew game (y/n)\u00a0?\ny\nThe four digits are 8 6 6 5 and the score is 24.\nSolution\u00a0:\n8-5=3\n6*3=18\n6+18=24\n\nNew game (y/n)\u00a0?\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_40.txt",
        "content": ">solve24 3 3 3 4\n4 * (3 * 3 - 3)\n3 + 3 * (3 + 4)\n\n>solve24 3 3 3 5\nNo solutions.\n\nsolve24 3 3 3 6\n6 + 3 * (3 + 3)\n(3 / 3 + 3) * 6\n3 * (3 + 6) - 3\n3 + 3 + 3 * 6\n\n>solve24 3 3 8 8\n8 / (3 - 8 / 3)\n\n>solve24 3 8 8 9\n3 * (9 - 8 / 8)\n(9 - 8) * 3 * 8\n3 / (9 - 8) * 8\n8 / ((9 - 8) / 3)\n3 * (9 - 8) * 8\n3 * 8 / (9 - 8)\n3 / ((9 - 8) / 8)",
        "safe": true
    },
    {
        "filename": "24 game_Solve_41.txt",
        "content": "USING: continuations grouping io kernel math math.combinatorics\nprettyprint quotations random sequences sequences.deep ;\nIN: rosetta-code.24-game\n\n: 4digits ( -- seq ) 4 9 random-integers [ 1 + ] map ;\n\n: expressions ( digits -- exprs )\n    all-permutations [ [ + - * / ] 3 selections\n    [ append ] with map ] map flatten 7 group ;\n\n: 24= ( exprs -- )\n    >quotation dup call( -- x ) 24 = [ . ] [ drop ] if ;\n\n: 24-game ( -- )\n    4digits dup \"The numbers: \" write . \"The solutions: \"\n    print expressions [ [ 24= ] [ 2drop ] recover ] each ;\n    \n24-game\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_42.txt",
        "content": "The numbers: { 4 9 3 1 }\nThe solutions:\n[ 4 9 3 1 * - * ]\n[ 4 9 3 1 / - * ]\n[ 4 9 1 3 * - * ]\n[ 4 1 9 3 - * * ]\n[ 4 1 9 3 - / / ]\n[ 9 3 4 1 + * + ]\n[ 9 3 1 4 + * + ]\n[ 1 4 9 3 - * * ]\n[ 1 4 9 3 * - - ]\n[ 1 4 3 9 * - - ]\n\nThe numbers: { 1 7 4 9 }\nThe solutions:\n\nThe numbers: { 1 5 6 8 }\nThe solutions:\n[ 6 1 5 8 - - * ]\n[ 6 1 8 5 - + * ]\n[ 6 8 1 5 - + * ]\n[ 6 8 5 1 - - * ]\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_43.txt",
        "content": "program solve_24\n  use helpers\n  implicit none\n  real                 :: vector(4), reals(4), p, q, r, s\n  integer              :: numbers(4), n, i, j, k, a, b, c, d\n  character, parameter :: ops(4) = (/ '+', '-', '*', '/' /)\n  logical              :: last\n  real,parameter       :: eps = epsilon(1.0)\n\n  do n=1,12\n    call random_number(vector)\n    reals   = 9 * vector + 1\n    numbers = int(reals)\n    call Insertion_Sort(numbers)\n    \n    permutations: do\n      a = numbers(1); b = numbers(2); c = numbers(3); d = numbers(4)\n      reals = real(numbers)\n      p = reals(1);   q = reals(2);   r = reals(3);   s = reals(4)\n      ! combinations of operators:\n      do i=1,4\n        do j=1,4\n          do k=1,4\n            if      ( abs(op(op(op(p,i,q),j,r),k,s)-24.0) < eps ) then\n              write (*,*) numbers, '\u00a0: ', '((',a,ops(i),b,')',ops(j),c,')',ops(k),d\n              exit permutations\n            else if ( abs(op(op(p,i,op(q,j,r)),k,s)-24.0) < eps ) then\n              write (*,*) numbers, '\u00a0: ', '(',a,ops(i),'(',b,ops(j),c,'))',ops(k),d\n              exit permutations\n            else if ( abs(op(p,i,op(op(q,j,r),k,s))-24.0) < eps ) then\n              write (*,*) numbers, '\u00a0: ', a,ops(i),'((',b,ops(j),c,')',ops(k),d,')'\n              exit permutations\n            else if ( abs(op(p,i,op(q,j,op(r,k,s)))-24.0) < eps ) then\n              write (*,*) numbers, '\u00a0: ', a,ops(i),'(',b,ops(j),'(',c,ops(k),d,'))'\n              exit permutations\n            else if ( abs(op(op(p,i,q),j,op(r,k,s))-24.0) < eps ) then\n              write (*,*) numbers, '\u00a0: ', '(',a,ops(i),b,')',ops(j),'(',c,ops(k),d,')'\n              exit permutations\n            end if\n          end do\n        end do\n      end do\n      call nextpermutation(numbers,last)  \n      if ( last ) then\n        write (*,*) numbers, '\u00a0: no solution.'\n        exit permutations\n      end if\n    end do permutations\n\n  end do\n\ncontains\n\n  pure real function op(x,c,y)\n    integer, intent(in) :: c\n    real, intent(in)    :: x,y\n    select case ( ops(c) )\n      case ('+')\n        op = x+y\n      case ('-')\n        op = x-y\n      case ('*')\n        op = x*y\n      case ('/')\n        op = x/y\n    end select\n  end function op\n\nend program solve_24\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_44.txt",
        "content": "module helpers\n\ncontains\n  \n  pure subroutine Insertion_Sort(a)\n    integer, intent(inout) :: a(:)\n    integer                :: temp, i, j\n    do i=2,size(a)\n      j = i-1\n      temp = a(i)\n      do while ( j>=1 .and. a(j)>temp )\n        a(j+1) = a(j)\n        j = j - 1\n      end do\n      a(j+1) = temp\n    end do\n  end subroutine Insertion_Sort\n\n  subroutine nextpermutation(perm,last)\n    integer, intent(inout) :: perm(:)\n    logical, intent(out)   :: last\n    integer :: k,l\n    k = largest1()\n    last = k == 0\n    if ( .not. last ) then    \n      l = largest2(k)\n      call swap(l,k)\n      call reverse(k)\n    end if\n  contains\n    pure integer function largest1()\n      integer :: k, max\n      max = 0\n      do k=1,size(perm)-1\n        if ( perm(k) < perm(k+1) ) then\n          max = k\n        end if\n      end do\n      largest1 = max\n    end function largest1\n\n    pure integer function largest2(k)\n      integer, intent(in) :: k\n      integer             :: l, max\n      max = k+1\n      do l=k+2,size(perm)\n        if ( perm(k) < perm(l) ) then\n          max = l\n        end if\n      end do\n      largest2 = max\n    end function largest2\n\n    subroutine swap(l,k)\n      integer, intent(in) :: k,l\n      integer             :: temp\n      temp    = perm(k)\n      perm(k) = perm(l)\n      perm(l) = temp\n    end subroutine swap\n    \n    subroutine reverse(k)\n      integer, intent(in) :: k\n      integer             :: i\n      do i=1,(size(perm)-k)/2\n        call swap(k+i,size(perm)+1-i)\n      end do\n    end subroutine reverse\n    \n  end subroutine nextpermutation\n\nend module helpers\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_45.txt",
        "content": " 3 6 7 9 \u00a0:  3 *(( 6 - 7 )+ 9 )\n 3 9 5 8 \u00a0: (( 3 * 9 )+ 5 )- 8\n 4 5 6 9 \u00a0: (( 4 + 5 )+ 6 )+ 9\n 2 9 9 8 \u00a0: ( 2 +( 9 / 9 ))* 8\n 1 4 7 5 \u00a0: ( 1 +( 4 * 7 ))- 5\n 8 7 7 6 \u00a0: no solution.\n 3 3 8 9 \u00a0: ( 3 *( 3 + 8 ))- 9\n 1 5 6 7 \u00a0: ( 1 +( 5 * 6 ))- 7\n 2 3 5 3 \u00a0:  2 *(( 3 * 5 )- 3 )\n 4 5 6 9 \u00a0: (( 4 + 5 )+ 6 )+ 9\n 1 1 3 6 \u00a0: ( 1 +( 1 * 3 ))* 6\n 2 4 6 8 \u00a0: (( 2 / 4 )* 6 )* 8\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_46.txt",
        "content": "module game24_module\n    use omp_lib\n    use iso_fortran_env, only: int64\n    implicit none\n    ! Define constants\n    integer, parameter :: max_limit = 8     ! Maximum allowed value for the number of inputs\n    integer, parameter :: expr_len = 200   ! Maximum length for expressions\n\n    ! Precomputed total calls for n=6,7,8\n    integer(int64), parameter :: total_calls_n6 = 20000000_int64\n    integer(int64), parameter :: total_calls_n7 = 2648275200_int64\n    integer(int64), parameter :: total_calls_n8 = 444557593600_int64\n\n    !----------------------- Progress Indicator Variables ---------------------\n    integer(int64) :: total_calls = 0           ! Total number of recursive calls\n    integer(int64) :: completed_calls = 0       ! Number of completed recursive calls\n    integer :: last_percentage = -1              ! Last percentage reported\n    integer, parameter :: progress_bar_width = 50  ! Width of the progress bar\n    character(len=1) :: carriage_return = char(13) ! Carriage return character\n    logical :: show_progress = .false.           ! Flag to show progress bar\n    !--------------------------------------------------------------------------\ncontains\n\n    !-----------------------------------------------------------------------\n    !\u00a0! Aborted function: calculate_total_calls\n    !\u00a0! Description:\n    !\u00a0!   Estimates the total number of recursive calls for a given n,\n    !\u00a0!   considering commutativity (addition and multiplication).\n    !\u00a0! Arguments:\n    !\u00a0!   n: The number of input numbers.\n    !\u00a0! Returns:\n    !\u00a0!   The estimated total number of recursive calls as an integer.\n    !\u00a0!-----------------------------------------------------------------------\n    ! integer function calculate_total_calls(n)\n    !     implicit none\n    !     integer, intent(in)\u00a0:: n\n    !     integer\u00a0:: k\n    !     calculate_total_calls = 1\n    !     do k = 2, n\n    !        \u00a0! For each pair, there are 6 possible operations:\n    !        \u00a0! 1 addition, 1 multiplication (commutative)\n    !        \u00a0! 2 subtraction, 2 division (non-commutative)\n    !         calculate_total_calls = calculate_total_calls * ((k * (k - 1)) / 2) * 6\n    !     end do\n    ! end function calculate_total_calls\n\n    !-----------------------------------------------------------------------\n    ! Subroutine: convert_to_number\n    ! Description:\n    !   Converts user input (numbers or card values) into numeric values.\n    !   Handles card values such as 'A', 'J', 'Q', 'K' and converts them into\n    !   corresponding numbers (A=1, J=11, Q=12, K=13).\n    ! Arguments:\n    !   input_str: Input string representing the number or card.\n    !   number:    Output real number after conversion.\n    !   ios:       I/O status indicator (0 for success, non-zero for error).\n    !-----------------------------------------------------------------------\n    subroutine convert_to_number(input_str, number, ios)\n        implicit none\n        character(len=*), intent(in) :: input_str\n        real, intent(out)            :: number\n        integer, intent(out)         :: ios\n        character(len=1)             :: first_char\n        real                         :: temp_number\n\n        ios = 0  ! Reset the I/O status to 0 (valid input by default)\n        first_char = input_str(1:1)\n\n        select case (first_char)\n        case ('A', 'a')\n            number = 1.0\n        case ('J', 'j')\n            number = 11.0\n        case ('Q', 'q')\n            number = 12.0\n        case ('K', 'k')\n            number = 13.0\n        case default\n            read (input_str, *, iostat=ios) temp_number  ! Attempt to read a real number\n\n            ! If input is not a valid real number or is not an integer, set ios to 1\n            if (ios /= 0 .or. mod(temp_number, 1.0) /= 0.0) then\n                ios = 1  ! Invalid input\n            else\n                number = temp_number  ! Valid integer input\n            end if\n        end select\n    end subroutine convert_to_number\n\n    !-----------------------------------------------------------------------\n    ! Subroutine: remove_decimal_zeros\n    ! Description:\n    !   Removes trailing zeros after the decimal point from a string.\n    ! Arguments:\n    !   str:    Input string that may contain trailing zeros.\n    !   result: Output string with trailing zeros removed.\n    !-----------------------------------------------------------------------\n    subroutine remove_decimal_zeros(str, result)\n        implicit none\n        character(len=*), intent(in)  :: str       ! Input: String to remove zeros from\n        character(len=*), intent(out) :: result    ! Output: String without trailing zeros\n        integer                        :: i, len_str  ! Loop counter and string length\n\n        len_str = len_trim(str)\n        result = adjustl(str(1:len_str))\n\n        ! Find the position of the decimal point\n        i = index(result, '.')\n\n        ! If there's a decimal point, remove trailing zeros\n        if (i > 0) then\n            do while (len_str > i .and. result(len_str:len_str) == '0')\n                len_str = len_str - 1\n            end do\n            if (result(len_str:len_str) == '.') len_str = len_str - 1\n            result = result(1:len_str)\n        end if\n    end subroutine remove_decimal_zeros\n\n    !-----------------------------------------------------------------------\n    ! Subroutine: create_new_arrays\n    ! Description:\n    !   Creates new arrays after performing an operation.\n    ! Arguments:\n    !   nums:      Input array of numbers.\n    !   exprs:     Input array of expressions.\n    !   idx1:      Index of the first element to remove.\n    !   idx2:      Index of the second element to remove.\n    !   result:    Result of the operation.\n    !   new_expr:  New expression string.\n    !   new_nums:  Output array of numbers with elements removed and result added.\n    !   new_exprs: Output array of expressions with elements removed and new_expr added.\n    !-----------------------------------------------------------------------\n    subroutine create_new_arrays(nums, exprs, idx1, idx2, result, new_expr, new_nums, new_exprs)\n        implicit none\n        real, intent(in)                        :: nums(:)       ! Input: Array of numbers\n        character(len=expr_len), intent(in)     :: exprs(:)      ! Input: Array of expressions\n        integer, intent(in)                     :: idx1, idx2    ! Input: Indices of elements to remove\n        real, intent(in)                        :: result        ! Input: Result of the operation\n        character(len=expr_len), intent(in)     :: new_expr      ! Input: New expression\n        real, allocatable, intent(out)          :: new_nums(:)   ! Output: New array of numbers\n        character(len=expr_len), allocatable, intent(out) :: new_exprs(:) ! Output: New array of expressions\n        integer                                 :: i, j, n       ! Loop counters and size of input arrays\n\n        n = size(nums)\n        allocate (new_nums(n - 1))\n        allocate (new_exprs(n - 1))\n\n        j = 0\n        do i = 1, n\n            if (i /= idx1 .and. i /= idx2) then\n                j = j + 1\n                new_nums(j) = nums(i)\n                new_exprs(j) = exprs(i)\n            end if\n        end do\n\n        ! Add the result of the operation to the new arrays\n        new_nums(n - 1) = result\n        new_exprs(n - 1) = new_expr\n    end subroutine create_new_arrays\n\n    !-----------------------------------------------------------------------\n    ! Subroutine: update_progress_bar\n    ! Description:\n    !   Updates and displays the horizontal percentage-based progress bar.\n    ! Arguments:\n    !   None\n    !-----------------------------------------------------------------------\n    subroutine update_progress_bar()\n        implicit none\n        real :: percentage\n        integer :: filled_length\n        character(len=progress_bar_width) :: bar\n        integer :: int_percentage\n\n        if (total_calls == 0 .or. .not. show_progress) return  ! Avoid division by zero and check the flag\n\n        percentage = real(completed_calls) / real(total_calls) * 100.0\n\n        ! Ensure percentage does not exceed 100%\n        if (percentage > 100.0) percentage = 100.0\n\n        ! Calculate integer percentage\n        int_percentage = int(percentage)\n\n        ! Update progress bar only when percentage increases by at least 1%\n        if (int_percentage > last_percentage) then\n            last_percentage = int_percentage\n\n            ! Calculate the filled length of the progress bar\n            filled_length = min(int(percentage / 100.0 * progress_bar_width), progress_bar_width)\n\n            ! Construct the progress bar string\n            bar = repeat('=', filled_length)\n            if (filled_length < progress_bar_width) then\n                bar = bar//'>'//repeat(' ', progress_bar_width - filled_length - 1)\n            end if\n\n            ! Print the progress bar and integer percentage\n            write (*, '(A, F4.1, A)', advance='no') carriage_return//'['//bar//'] ', percentage, '%'\n            call flush (0)  ! Ensure output is displayed immediately\n        end if\n    end subroutine update_progress_bar\n\n    !-----------------------------------------------------------------------\n    ! Recursive Subroutine: solve_24\n    ! Description:\n    !   Recursively solves the 24 game by trying all possible operations.\n    !   Utilizes OpenMP tasks for parallelization.\n    ! Arguments:\n    !   nums:   Array of numbers to use in the game.\n    !   exprs:  Array of string expressions representing the numbers.\n    !   found:  Logical flag indicating if a solution has been found.\n    !-----------------------------------------------------------------------\n    recursive subroutine solve_24(nums, exprs, found)\n        use omp_lib\n        implicit none\n        real, intent(in)                         :: nums(:)       ! Input: Array of numbers\n        character(len=expr_len), intent(in)      :: exprs(:)      ! Input: Array of expressions\n        logical, intent(inout)                   :: found         ! Input/Output: Flag indicating if a solution is found\n        integer                                  :: n             ! Size of the input arrays\n        integer                                  :: i, j, op      ! Loop counters\n        real                                     :: a, b, result  ! Temporary variables for calculations\n        real, allocatable                        :: new_nums(:)   ! Temp array to store numbers after an operation\n        character(len=expr_len), allocatable     :: new_exprs(:)  ! Temp array to store expressions after an operation\n        character(len=expr_len)                  :: expr_a, expr_b, new_expr ! Temp variables for expressions\n\n        n = size(nums)\n\n        ! Increment the completed_calls counter and update progress bar\n        if (show_progress) then\n            !$omp atomic\n            completed_calls = completed_calls + 1\n            call update_progress_bar()\n        end if\n\n        ! If a solution is found, return\n        if (found) return\n\n        ! Base case: If only one number is left, check if it is 24\n        if (n == 1) then\n            if (abs(nums(1) - 24.0) < 1e-4) then\n                if (show_progress) then\n                    write (*, '(A, F5.1, A)', advance='no') carriage_return//'['//repeat('=', progress_bar_width)//'] ', 100.0, '%'\n                    write (*, '(A)') ''  ! Insert a blank line\n                end if\n                !$omp critical\n                write (*, '(A, A, A, F10.7, A)') 'Solution found:', trim(exprs(1)), '= 24 (', nums(1), ')'\n                found = .true.\n                !$omp end critical\n            end if\n            return\n        end if\n\n        ! Iterate over all pairs of numbers\n        do i = 1, n - 1\n            do j = i + 1, n\n                a = nums(i)\n                b = nums(j)\n                expr_a = exprs(i)\n                expr_b = exprs(j)\n\n                ! Iterate over all operators\n                do op = 1, 4\n                    ! Avoid division by zero\n                    if ((op == 4 .and. abs(b) < 1e-6)) cycle\n\n                    ! Perform the operation and create the new expression\n                    select case (op)\n                    case (1)\n                        result = a + b\n                        new_expr = '('//trim(expr_a)//'+'//trim(expr_b)//')'\n                    case (2)\n                        result = a - b\n                        new_expr = '('//trim(expr_a)//'-'//trim(expr_b)//')'\n                    case (3)\n                        result = a * b\n                        new_expr = '('//trim(expr_a)//'*'//trim(expr_b)//')'\n                    case (4)\n                        result = a / b\n                        new_expr = '('//trim(expr_a)//'/'//trim(expr_b)//')'\n                    end select\n\n                    ! Create new arrays with the selected numbers removed\n                    call create_new_arrays(nums, exprs, i, j, result, new_expr, new_nums, new_exprs)\n\n                    ! For the first few recursion levels, create parallel tasks\n                    if (n >= 6 .and. omp_get_level() < 2) then\n                        !$omp task shared(found) firstprivate(new_nums, new_exprs)\n                        call solve_24(new_nums, new_exprs, found)\n                        !$omp end task\n                    else\n                        call solve_24(new_nums, new_exprs, found)\n                    end if\n\n                    ! If a solution is found, deallocate memory and return\n                    if (found) then\n                        deallocate (new_nums)\n                        deallocate (new_exprs)\n                        return\n                    end if\n\n                    ! Handle commutative operations only once\n                    if (op == 1 .or. op == 3) cycle\n\n                    ! Swap operands for subtraction and division\n                    if (op == 2 .or. op == 4) then\n                        if (op == 4 .and. abs(a) < 1e-6) cycle  ! Avoid division by zero\n\n                        select case (op)\n                        case (2)\n                            result = b - a\n                            new_expr = '('//trim(expr_b)//'-'//trim(expr_a)//')'\n                        case (4)\n                            result = b / a\n                            new_expr = '('//trim(expr_b)//'/'//trim(expr_a)//')'\n                        end select\n\n                        ! Create new arrays with the selected numbers removed\n                        call create_new_arrays(nums, exprs, i, j, result, new_expr, new_nums, new_exprs)\n\n                        ! For the first few recursion levels, create parallel tasks\n                        if (n >= 6 .and. omp_get_level() < 2) then\n                            !$omp task shared(found) firstprivate(new_nums, new_exprs)\n                            call solve_24(new_nums, new_exprs, found)\n                            !$omp end task\n                        else\n                            ! Recursively call the solve_24 function with the new arrays\n                            call solve_24(new_nums, new_exprs, found)\n                        end if\n\n                        ! If a solution is found, deallocate memory and return\n                        if (found) then\n                            deallocate (new_nums)\n                            deallocate (new_exprs)\n                            return\n                        end if\n                    end if\n\n                end do  ! End of operator loop\n            end do  ! End of j loop\n        end do  ! End of i loop\n    end subroutine solve_24\n\nend module game24_module\n\nprogram game24\n    use game24_module\n    implicit none\n\n    ! Declare variables\n    integer                        :: maxn            ! Number of numbers to be entered by the user\n    real, allocatable              :: numbers(:)      ! Array to store the numbers entered by the user\n    character(len=expr_len), allocatable :: expressions(:)  ! Array to store the expressions\n    integer                        :: i, ios          ! Loop counter and I/O status\n    logical                        :: found_solution  ! Flag to indicate if a solution was found\n    character(len=10)              :: user_input      ! Variable to store user input\n    character(len=1)               :: play_again      ! Variable to store the user's decision\n\n    do  ! Game loop to allow restarting the game\n\n        ! Prompt the user for the number of numbers to use in the game\n        do\n            write (*, '(A,I0,A)', advance='no') 'Enter the number of numbers (1 to ', max_limit, '): '\n            read (*, *, iostat=ios) maxn\n\n            ! Check if the input is valid\n            if (ios /= 0) then\n                write (*, '(A,I0,A)') 'Invalid input. Please enter an integer between 1 and ', max_limit, '.'\n                cycle\n            end if\n\n            ! Validate the input: Ensure the number of numbers is within the valid range\n            if (maxn < 1 .or. maxn > max_limit) then\n                write (*, '(A,I0,A)') 'Error: Number of numbers must be between 1 and ', max_limit, '. Try again.'\n                cycle\n            end if\n\n            exit  ! Exit loop if the input is valid\n        end do\n\n        ! Allocate memory for the arrays based on the number of numbers\n        allocate (numbers(maxn))\n        allocate (expressions(maxn))\n\n        ! Prompt the user to enter the numbers or card values\n        write (*, '(A,I0,A)') 'Enter ', maxn, ' numbers or card values (A=1, J=11, Q=12, K=13).'\n        do i = 1, maxn\n            do\n                ! Prompt the user to enter a number or card value\n                write (*, '(A,I0,A)', advance='no') 'Enter value for card ', i, ': '\n                read (*, '(A)', iostat=ios) user_input\n\n                ! Check if input is an integer or valid card symbol (A, J, Q, K)\n                call convert_to_number(user_input, numbers(i), ios)\n\n                ! If the input is valid, exit loop\n                if (ios == 0) exit\n\n                ! Invalid input: prompt the user to try again\n                write (*, '(A)') 'Invalid input. Please enter an integer or valid card symbol (A, J, Q, K).'\n            end do\n\n            ! Convert the number to a string expression and remove trailing zeros\n            write (expressions(i), '(F0.2)') numbers(i)\n            call remove_decimal_zeros(expressions(i), expressions(i))\n        end do\n\n        ! Initialize the solution flag to false\n        found_solution = .false.\n\n        ! Assign precomputed total_calls based on n\n        select case (maxn)\n        case (6)\n            total_calls = total_calls_n6\n        case (7)\n            total_calls = total_calls_n7\n        case (8)\n            total_calls = total_calls_n8\n        case default\n            total_calls = 0\n        end select\n\n        ! Decide whether to show progress bar based on n\n        if (maxn >= 6) then\n            show_progress = .true.\n            completed_calls = 0\n            last_percentage = -1\n\n            ! Initialize progress bar display\n            write (*, '(A)', advance='no') '['//repeat(' ', progress_bar_width)//'] 0%'\n            call flush (0)  ! Ensure the output is displayed immediately\n        else\n            show_progress = .false.\n        end if\n\n        ! Start parallel region\n        !$omp parallel\n        !$omp single nowait\n        call solve_24(numbers, expressions, found_solution)\n        !$omp end single\n        !$omp end parallel\n\n        ! After search completes, ensure the progress bar reaches 100% if shown\n        if (show_progress .and. .not. found_solution) then\n            write (*, '(A, A)', advance='no') carriage_return//'['//repeat('=', progress_bar_width)//'] 100%  '\n            call flush (0)\n            write (*, '(A)') ''  ! Insert a blank line\n        end if\n\n        ! If a solution was found and progress bar is shown, ensure a blank line\n        if (show_progress .and. found_solution) then\n            ! Progress bar already refreshed to 100% and blank line inserted in solve_24\n        end if\n\n        ! If no solution was found, print a message\n        if (.not. found_solution) then\n            write (*, '(A)') 'No valid solution found.'\n        end if\n\n        ! Deallocate the memory used by the arrays\n        deallocate (numbers)\n        deallocate (expressions)\n\n        ! Ask the user if they want to play again\n        if (show_progress) then\n            write (*, '(A)', advance='no') carriage_return//'Play again? (Enter y/n to continue or any other key to exit): '\n        else\n            write (*, '(A)', advance='no') 'Play again? (Enter y/n to continue or any other key to exit): '\n        end if\n        read (*, '(A)') play_again  ! Read user input\n\n        ! Check if the user wants to exit\n        if (play_again /= 'y' .and. play_again /= 'Y') exit\n\n    end do  ! End of game loop\n\n    write (*, '(A)') 'Exiting the game...'\n\nend program game24\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_47.txt",
        "content": "begin globals\nShort k\nend globals\n\nvoid local fn eval( t as CFStringRef )\n  CFMutableStringRef s = fn MutableStringNew\n  ExpressionRef x = fn ExpressionWithFormat( t )\n  CFRange r = fn CFRangeMake(0, fn StringLength( t ) )\n  CFNumberRef n = fn ExpressionValueWithObject( x, Null, Null )\n  Float f = dblval( n )\n  if f = 24 // found, so clean up\n    MutableStringSetString( s, t ) // duplicate string and pretend it was integers all along\n    MutableStringReplaceOccurrencesOfString( s, @\".000000\", @\"\", Null, r )\n    print s; @\" = 24\"\u00a0: k ++\n  end if\nend fn\n\nclear local fn work( t as CFStringRef )\n  Short a, b, c, d, e, f, g\n  CGFloat n(3)\n  CFStringRef s, os = @\"*/+-\", o(3)\n  print t,\u00a0: k = 0\n  // Put digits (as floats) and operators (as strings) in arrays\n  for a = 0 to 3\u00a0: s = mid( t, a, 1 )\u00a0: n(a) = fn StringFloatValue( s )\u00a0: o(a) = mid( os, a, 1 )\u00a0: next\n  // Permutions for the digits ...\n  for d = 0 to 3\u00a0: for e = 0 to 3\u00a0: for f = 0 to 3\u00a0: for g = 0 to 3\n    if d\u00a0!= e and d\u00a0!= f and d\u00a0!= g and e\u00a0!= f and e\u00a0!= g and f\u00a0!= g // ... without duplications\n      // Combinations for the operators (3 from 4, with replacement)\n      for a = 0 to 3\u00a0: for b = 0 to 3\u00a0: for c = 0 to 3\n        fn eval( fn StringWithFormat( @\"%f\u00a0%@ %f\u00a0%@ %f\u00a0%@ %f\", n(d), o(a), n(e), o(b), n(f), o(c), n(g) ) )\u00a0: if k > 0 then exit fn\n        fn eval( fn StringWithFormat( @\"%f\u00a0%@ ( %f\u00a0%@ %f )\u00a0%@ %f\", n(d), o(a), n(e), o(b), n(f), o(c), n(g) ) )\u00a0: if k > 0 then exit fn\n        fn eval( fn StringWithFormat( @\"%f\u00a0%@ %f\u00a0%@ ( %f\u00a0%@ %f )\", n(d), o(a), n(e), o(b), n(f), o(c), n(g) ) )\u00a0: if k > 0 then exit fn\n        fn eval( fn StringWithFormat( @\"%f\u00a0%@ ( %f\u00a0%@ %f\u00a0%@ %f )\", n(d), o(a), n(e), o(b), n(f), o(c), n(g) ) )\u00a0: if k > 0 then exit fn\n        fn eval( fn StringWithFormat( @\"( %f\u00a0%@ %f )\u00a0%@ %f\u00a0%@ %f\", n(d), o(a), n(e), o(b), n(f), o(c), n(g) ) )\u00a0: if k > 0 then exit fn\n        fn eval( fn StringWithFormat( @\"( %f\u00a0%@ %f\u00a0%@ %f )\u00a0%@ %f\", n(d), o(a), n(e), o(b), n(f), o(c), n(g) ) )\u00a0: if k > 0 then exit fn\n        fn eval( fn StringWithFormat( @\"%f\u00a0%@ ( %f\u00a0%@ ( %f\u00a0%@ %f ) )\", n(d), o(a), n(e), o(b), n(f), o(c), n(g) ) )\u00a0: if k > 0 then exit fn\n        fn eval( fn StringWithFormat( @\"( %f\u00a0%@ %f )\u00a0%@ ( %f\u00a0%@ %f )\", n(d), o(a), n(e), o(b), n(f), o(c), n(g) ) )\u00a0: if k > 0 then exit fn\n        fn eval( fn StringWithFormat( @\"( %f\u00a0%@ ( %f\u00a0%@ %f ))\u00a0%@ %f\", n(d), o(a), n(e), o(b), n(f), o(c), n(g) ) )\u00a0: if k > 0 then exit fn\n        fn eval( fn StringWithFormat( @\"( ( %f\u00a0%@ %f )\u00a0%@ %f )\u00a0%@ %f\", n(d), o(a), n(e), o(b), n(f), o(c), n(g) ) )\u00a0: if k > 0 then exit fn\n        fn eval( fn StringWithFormat( @\"%f\u00a0%@ ( ( %f\u00a0%@ %f )\u00a0%@ %f )\", n(d), o(a), n(e), o(b), n(f), o(c), n(g) ) )\u00a0: if k > 0 then exit fn\n      next\u00a0: next\u00a0: next\n    end if\n  next\u00a0: next\u00a0: next\u00a0: next\nend fn\n\nwindow 1, @\"24 Game\", ( 0, 0,  250, 250 )\nfn work(@\"3388\")\nfn work(@\"1346\")\nfn work(@\"8752\")\n\nhandleevents",
        "safe": true
    },
    {
        "filename": "24 game_Solve_48.txt",
        "content": "3388\t8 / ( 3 - 8 / 3 ) = 24\n1346\t6 / ( 1 - 3 / 4 ) = 24\n8752\t8 * ( 5 * 2 - 7 ) = 24\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_49.txt",
        "content": "# Solution in '''RPN'''\ncheck := function(x, y, z)\n\tlocal r, c, s, i, j, k, a, b, p;\n\ti := 0;\n\tj := 0;\n\tk := 0;\n\ts := [ ];\n\tr := \"\";\n\tfor c in z do\n\t\tif c = 'x' then\n\t\t\ti := i + 1;\n\t\t\tk := k + 1;\n\t\t\ts[k] := x[i];\n\t\t\tAppend(r, String(x[i]));\n\t\telse\n\t\t\tj := j + 1;\n\t\t\tb := s[k];\n\t\t\tk := k - 1;\n\t\t\ta := s[k];\n\t\t\tp := y[j];\n\t\t\tr[Size(r) + 1] := p;\n\t\t\tif p = '+' then\n\t\t\t\ta := a + b;\n\t\t\telif p = '-' then\n\t\t\t\ta := a - b;\n\t\t\telif p = '*' then\n\t\t\t\ta := a * b;\n\t\t\telif p = '/' then\n\t\t\t\tif b = 0 then\n\t\t\t\t\tcontinue;\n\t\t\t\telse\n\t\t\t\t\ta := a / b;\n\t\t\t\tfi;\n\t\t\telse\n\t\t\t\treturn fail;\n\t\t\tfi;\n\t\t\ts[k] := a;\n\t\tfi;\n\tod;\n\tif s[1] = 24 then\n\t\treturn r;\n\telse\n\t\treturn fail;\n\tfi;\nend;\n\t\nPlayer24 := function(digits)\n\tlocal u, v, w, x, y, z, r;\n\tu := PermutationsList(digits);\n\tv := Tuples(\"+-*/\", 3);\n\tw := [\"xx*x*x*\", \"xx*xx**\", \"xxx**x*\", \"xxx*x**\", \"xxxx***\"];\n\tfor x in u do\n\t\tfor y in v do\n\t\t\tfor z in w do\n\t\t\t\tr := check(x, y, z);\n\t\t\t\tif r <> fail then\n\t\t\t\t\treturn r;\n\t\t\t\tfi;\n\t\t\tod;\n\t\tod;\n\tod;\n\treturn fail;\nend;\n\nPlayer24([1,2,7,7]);\n# \"77*1-2/\"\nPlayer24([9,8,7,6]);\n# \"68*97-/\"\nPlayer24([1,1,7,7]);\n# fail\n\n# Solutions with only one distinct digit are found only for 3, 4, 5, 6:\nPlayer24([3,3,3,3]);\n# \"33*3*3-\"\nPlayer24([4,4,4,4]);\n# \"44*4+4+\"\nPlayer24([5,5,5,5]);\n# \"55*55/-\"\nPlayer24([6,6,6,6]);\n# \"66*66+-\"\n\n# A tricky one:\nPlayer24([3,3,8,8]);\n\"8383/-/\"\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_5.txt",
        "content": "data: lv_flag type c,\n      lv_number type i,\n      lt_numbers type table of i.\n\nconstants: c_no_val type i value 9999.\n\nappend 1 to lt_numbers.\nappend 1 to lt_numbers.\nappend 2 to lt_numbers.\nappend 7 to lt_numbers.\n\nwrite 'Evaluating 24 with the following input: '.\nloop at lt_numbers into lv_number.\n  write lv_number.\nendloop.  \nperform solve_24 using lt_numbers.\n\nform eval_formula using iv_eval type string changing ev_out type i.\n  call function 'EVAL_FORMULA' \"analysis of a syntactically correct formula\n    exporting\n      formula = iv_eval\n    importing\n      value   = ev_out\n    exceptions\n   others     = 1.\n\n  if sy-subrc <> 0.\n    ev_out = -1.\n  endif.\nendform.\n\n\" Solve a 24 puzzle.\nform solve_24 using it_numbers like lt_numbers.\n  data: lv_flag   type c,\n        lv_op1    type c,\n        lv_op2    type c,\n        lv_op3    type c,\n        lv_var1   type c,\n        lv_var2   type c,\n        lv_var3   type c,\n        lv_var4   type c,\n        lv_eval   type string,\n        lv_result type i,\n        lv_var     type i.\n\n  define retrieve_var.\n    read table it_numbers index &1 into lv_var.\n    &2 = lv_var.\n  end-of-definition.\n\n  define retrieve_val.\n    perform eval_formula using lv_eval changing lv_result.\n    if lv_result = 24.\n        write / lv_eval.\n    endif.\n  end-of-definition.\n  \" Loop through all the possible number permutations.\n  do.\n    \" Init. the operations table.\n\n    retrieve_var: 1 lv_var1, 2 lv_var2, 3 lv_var3, 4 lv_var4.\n    do 4 times.\n      case sy-index.\n        when 1.\n          lv_op1 = '+'.\n        when 2.\n          lv_op1 = '*'.\n        when 3.\n          lv_op1 = '-'.\n        when 4.\n          lv_op1 = '/'.\n      endcase.\n      do 4 times.\n        case sy-index.\n        when 1.\n          lv_op2 = '+'.\n        when 2.\n          lv_op2 = '*'.\n        when 3.\n          lv_op2 = '-'.\n        when 4.\n          lv_op2 = '/'.\n        endcase.\n        do 4 times.\n          case sy-index.\n          when 1.\n            lv_op3 = '+'.\n          when 2.\n            lv_op3 = '*'.\n          when 3.\n            lv_op3 = '-'.\n          when 4.\n            lv_op3 = '/'.\n          endcase.\n          concatenate '(' '(' lv_var1 lv_op1 lv_var2 ')' lv_op2 lv_var3 ')' lv_op3 lv_var4  into lv_eval separated by space.\n          retrieve_val.\n          concatenate '(' lv_var1 lv_op1 lv_var2 ')' lv_op2 '(' lv_var3 lv_op3 lv_var4 ')'  into lv_eval separated by space.\n          retrieve_val.\n          concatenate '(' lv_var1 lv_op1 '(' lv_var2 lv_op2 lv_var3 ')' ')' lv_op3 lv_var4  into lv_eval separated by space.\n          retrieve_val.\n          concatenate lv_var1 lv_op1 '(' '(' lv_var2 lv_op2 lv_var3 ')' lv_op3 lv_var4 ')'  into lv_eval separated by space.\n          retrieve_val.\n          concatenate lv_var1 lv_op1 '(' lv_var2 lv_op2 '(' lv_var3 lv_op3 lv_var4 ')' ')'  into lv_eval separated by space.\n          retrieve_val.\n        enddo.\n      enddo.\n    enddo.\n\n    \" Once we've reached the last permutation -> Exit.\n    perform permute using it_numbers changing lv_flag.\n    if lv_flag = 'X'.\n      exit.\n    endif.\n  enddo.\nendform.\n\n\n\" Permutation function - this is used to permute:\n\" A = {A1...AN} -> Set of supplied variables.\n\" B = {B1...BN - 1} -> Set of operators.\n\" Can be used for an unbounded size set. Relies\n\" on lexicographic ordering of the set.\nform permute using iv_set like lt_numbers\n             changing ev_last type c.\n  data: lv_len     type i,\n        lv_first   type i,\n        lv_third   type i,\n        lv_count   type i,\n        lv_temp    type i,\n        lv_temp_2  type i,\n        lv_second  type i,\n        lv_changed type c,\n        lv_perm    type i.\n  describe table iv_set lines lv_len.\n\n  lv_perm = lv_len - 1.\n  lv_changed = ' '.\n  \" Loop backwards through the table, attempting to find elements which\n  \" can be permuted. If we find one, break out of the table and set the\n  \" flag indicating a switch.\n  do.\n    if lv_perm <= 0.\n      exit.\n    endif.\n    \" Read the elements.\n    read table iv_set index lv_perm into lv_first.\n    add 1 to lv_perm.\n    read table iv_set index lv_perm into lv_second.\n    subtract 1 from lv_perm.\n    if lv_first < lv_second.\n      lv_changed = 'X'.\n      exit.\n    endif.\n    subtract 1 from lv_perm.\n  enddo.\n\n  \" Last permutation.\n  if lv_changed <> 'X'.\n    ev_last = 'X'.\n    exit.\n  endif.\n\n  \" Swap tail decresing to get a tail increasing.\n  lv_count = lv_perm + 1.\n  do.\n    lv_first = lv_len + lv_perm - lv_count + 1.\n    if lv_count >= lv_first.\n      exit.\n    endif.\n\n    read table iv_set index lv_count into lv_temp.\n    read table iv_set index lv_first into lv_temp_2.\n    modify iv_set index lv_count from lv_temp_2.\n    modify iv_set index lv_first from lv_temp.\n    add 1 to lv_count.\n  enddo.\n\n  lv_count = lv_len - 1.\n  do.\n    if lv_count <= lv_perm.\n      exit.\n    endif.\n\n    read table iv_set index lv_count into lv_first.\n    read table iv_set index lv_perm into lv_second.\n    read table iv_set index lv_len into lv_third.\n    if ( lv_first < lv_third ) and ( lv_first > lv_second ).\n      lv_len = lv_count.\n    endif.\n\n    subtract 1 from lv_count.\n  enddo.\n\n  read table iv_set index lv_perm into lv_temp.\n  read table iv_set index lv_len into lv_temp_2.\n  modify iv_set index lv_perm from lv_temp_2.\n  modify iv_set index lv_len from lv_temp.\nendform.\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_50.txt",
        "content": "package main\n\nimport (\n\t\"fmt\"\n\t\"math/rand\"\n\t\"time\"\n)\n\nconst (\n\top_num = iota\n\top_add\n\top_sub\n\top_mul\n\top_div\n)\n\ntype frac struct {\n\tnum, denom int\n}\n\n// Expression: can either be a single number, or a result of binary\n// operation from left and right node\ntype Expr struct {\n\top          int\n\tleft, right *Expr\n\tvalue       frac\n}\n\nvar n_cards = 4\nvar goal = 24\nvar digit_range = 9\n\nfunc (x *Expr) String() string {\n\tif x.op == op_num {\n\t\treturn fmt.Sprintf(\"%d\", x.value.num)\n\t}\n\n\tvar bl1, br1, bl2, br2, opstr string\n\tswitch {\n\tcase x.left.op == op_num:\n\tcase x.left.op >= x.op:\n\tcase x.left.op == op_add && x.op == op_sub:\n\t\tbl1, br1 = \"\", \"\"\n\tdefault:\n\t\tbl1, br1 = \"(\", \")\"\n\t}\n\n\tif x.right.op == op_num || x.op < x.right.op {\n\t\tbl2, br2 = \"\", \"\"\n\t} else {\n\t\tbl2, br2 = \"(\", \")\"\n\t}\n\n\tswitch {\n\tcase x.op == op_add:\n\t\topstr = \" + \"\n\tcase x.op == op_sub:\n\t\topstr = \" - \"\n\tcase x.op == op_mul:\n\t\topstr = \" * \"\n\tcase x.op == op_div:\n\t\topstr = \" / \"\n\t}\n\n\treturn bl1 + x.left.String() + br1 + opstr +\n\t\tbl2 + x.right.String() + br2\n}\n\nfunc expr_eval(x *Expr) (f frac) {\n\tif x.op == op_num {\n\t\treturn x.value\n\t}\n\n\tl, r := expr_eval(x.left), expr_eval(x.right)\n\n\tswitch x.op {\n\tcase op_add:\n\t\tf.num = l.num*r.denom + l.denom*r.num\n\t\tf.denom = l.denom * r.denom\n\t\treturn\n\n\tcase op_sub:\n\t\tf.num = l.num*r.denom - l.denom*r.num\n\t\tf.denom = l.denom * r.denom\n\t\treturn\n\n\tcase op_mul:\n\t\tf.num = l.num * r.num\n\t\tf.denom = l.denom * r.denom\n\t\treturn\n\n\tcase op_div:\n\t\tf.num = l.num * r.denom\n\t\tf.denom = l.denom * r.num\n\t\treturn\n\t}\n\treturn\n}\n\nfunc solve(ex_in []*Expr) bool {\n\t// only one expression left, meaning all numbers are arranged into\n\t// a binary tree, so evaluate and see if we get 24\n\tif len(ex_in) == 1 {\n\t\tf := expr_eval(ex_in[0])\n\t\tif f.denom != 0 && f.num == f.denom*goal {\n\t\t\tfmt.Println(ex_in[0].String())\n\t\t\treturn true\n\t\t}\n\t\treturn false\n\t}\n\n\tvar node Expr\n\tex := make([]*Expr, len(ex_in)-1)\n\n\t// try to combine a pair of expressions into one, thus reduce\n\t// the list length by 1, and recurse down\n\tfor i := range ex {\n\t\tcopy(ex[i:len(ex)], ex_in[i+1:len(ex_in)])\n\n\t\tex[i] = &node\n\t\tfor j := i + 1; j < len(ex_in); j++ {\n\t\t\tnode.left = ex_in[i]\n\t\t\tnode.right = ex_in[j]\n\n\t\t\t// try all 4 operators\n\t\t\tfor o := op_add; o <= op_div; o++ {\n\t\t\t\tnode.op = o\n\t\t\t\tif solve(ex) {\n\t\t\t\t\treturn true\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// also - and / are not commutative, so swap arguments\n\t\t\tnode.left = ex_in[j]\n\t\t\tnode.right = ex_in[i]\n\n\t\t\tnode.op = op_sub\n\t\t\tif solve(ex) {\n\t\t\t\treturn true\n\t\t\t}\n\n\t\t\tnode.op = op_div\n\t\t\tif solve(ex) {\n\t\t\t\treturn true\n\t\t\t}\n\n\t\t\tif j < len(ex) {\n\t\t\t\tex[j] = ex_in[j]\n\t\t\t}\n\t\t}\n\t\tex[i] = ex_in[i]\n\t}\n\treturn false\n}\n\nfunc main() {\n\tcards := make([]*Expr, n_cards)\n\trand.Seed(time.Now().Unix())\n\n\tfor k := 0; k < 10; k++ {\n\t\tfor i := 0; i < n_cards; i++ {\n\t\t\tcards[i] = &Expr{op_num, nil, nil,\n\t\t\t\tfrac{rand.Intn(digit_range-1) + 1, 1}}\n\t\t\tfmt.Printf(\" %d\", cards[i].value.num)\n\t\t}\n\t\tfmt.Print(\":  \")\n\t\tif !solve(cards) {\n\t\t\tfmt.Println(\"No solution\")\n\t\t}\n\t}\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_51.txt",
        "content": " 8 6 7 6:  No solution\n 7 2 6 6:  (7 - 2) * 6 - 6\n 4 8 7 3:  4 * (7 - 3) + 8\n 3 8 8 7:  3 * 8 * (8 - 7)\n 5 7 3 7:  No solution\n 5 7 8 3:  5 * 7 - 8 - 3\n 3 6 5 2:  ((3 + 5) * 6) / 2\n 8 4 5 4:  (8 - 4) * 5 + 4\n 2 2 8 8:  (2 + 2) * 8 - 8\n 6 8 8 2:  6 + 8 + 8 + 2\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_52.txt",
        "content": "uses java.lang.Integer\nuses java.lang.Double\nuses java.lang.System\nuses java.util.ArrayList\nuses java.util.LinkedList\nuses java.util.List\nuses java.util.Scanner\nuses java.util.Stack\n\nfunction permutations<T>( lst : List<T> ) : List<List<T>> {\n    if( lst.size() == 0 ) return {}\n    if( lst.size() == 1 ) return { lst }\n\n    var pivot = lst.get(lst.size()-1)\n\n    var sublist = new ArrayList<T>( lst )\n    sublist.remove( sublist.size() - 1 )\n\n    var subPerms = permutations( sublist )\n\n    var ret = new ArrayList<List<T>>()\n    for( x in subPerms ) {\n        for( e in x index i ) {\n            var next = new LinkedList<T>( x )\n            next.add( i, pivot )\n            ret.add( next )\n        }\n        x.add( pivot )\n        ret.add( x )\n    }\n    return ret\n}\n\nfunction readVals() : List<Integer> {\n    var line = new java.io.BufferedReader( new java.io.InputStreamReader( System.in ) ).readLine()\n    var scan = new Scanner( line )\n\n    var ret = new ArrayList<Integer>()\n    for( i in 0..3 ) {\n        var next = scan.nextInt() \n        if( 0 >= next || next >= 10 ) {\n            print( \"Invalid entry: ${next}\" )\n            return null\n        }\n        ret.add( next )\n    }\n    return ret\n}\n\nfunction getOp( i : int ) : char[] {\n    var ret = new char[3]\n    var ops = { '+', '-', '*', '/' }\n    ret[0] = ops[i / 16]\n    ret[1] = ops[(i / 4) % 4 ]\n    ret[2] = ops[i % 4 ]\n    return ret\n}\n\nfunction isSoln( nums : List<Integer>, ops : char[] ) : boolean {\n    var stk = new Stack<Double>()\n    for( n in nums ) {\n        stk.push( n )\n    }\n\n    for( c in ops ) {\n        var r = stk.pop().doubleValue()\n        var l = stk.pop().doubleValue()\n        if( c == '+' ) {\n            stk.push( l + r )\n        } else if( c == '-' ) {\n            stk.push( l - r )\n        } else if( c == '*' ) {\n            stk.push( l * r )\n        } else if( c == '/' ) {\n            // Avoid division by 0\n            if( r == 0.0 ) {\n                return false\n            }\n            stk.push( l / r )\n        }\n    }\n\n    return java.lang.Math.abs( stk.pop().doubleValue() - 24.0 ) < 0.001\n}\n\nfunction printSoln( nums : List<Integer>, ops : char[] ) {\n    // RPN: a b c d + - *\n    // Infix (a * (b - (c + d)))\n    print( \"Found soln: (${nums.get(0)} ${ops[0]} (${nums.get(1)} ${ops[1]} (${nums.get(2)} ${ops[2]} ${nums.get(3)})))\" )\n}\n\nSystem.out.print( \"#> \" )\nvar vals = readVals()\n\nvar opPerms = 0..63\nvar solnFound = false\n\nfor( i in permutations( vals ) ) {\n    for( j in opPerms ) {\n        var opList = getOp( j )\n        if( isSoln( i, opList ) ) {\n            printSoln( i, opList )\n            solnFound = true\n        }\n    }\n}\n\nif( ! solnFound ) {\n    print( \"No solution!\" )\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_53.txt",
        "content": "import Data.List\nimport Data.Ratio\nimport Control.Monad\nimport System.Environment (getArgs)\n\ndata Expr = Constant Rational |\n    Expr :+ Expr | Expr :- Expr |\n    Expr :* Expr | Expr :/ Expr\n    deriving (Eq)\n\nops = [(:+), (:-), (:*), (:/)]\n\ninstance Show Expr where\n    show (Constant x) = show $ numerator x\n      -- In this program, we need only print integers.\n    show (a :+ b)     = strexp \"+\" a b\n    show (a :- b)     = strexp \"-\" a b\n    show (a :* b)     = strexp \"*\" a b\n    show (a :/ b)     = strexp \"/\" a b\n\nstrexp :: String -> Expr -> Expr -> String\nstrexp op a b = \"(\" ++ show a ++ \" \" ++ op ++ \" \" ++ show b ++ \")\"\n\ntemplates :: [[Expr] -> Expr]\ntemplates = do\n    op1 <- ops\n    op2 <- ops\n    op3 <- ops\n    [\\[a, b, c, d] -> op1 a $ op2 b $ op3 c d,\n     \\[a, b, c, d] -> op1 (op2 a b) $ op3 c d,\n     \\[a, b, c, d] -> op1 a $ op2 (op3 b c) d,\n     \\[a, b, c, d] -> op1 (op2 a $ op3 b c) d,\n     \\[a, b, c, d] -> op1 (op2 (op3 a b) c) d]\n\neval :: Expr -> Maybe Rational\neval (Constant c) = Just c\neval (a :+ b)     = liftM2 (+) (eval a) (eval b)\neval (a :- b)     = liftM2 (-) (eval a) (eval b)\neval (a :* b)     = liftM2 (*) (eval a) (eval b)\neval (a :/ b)     = do\n    denom <- eval b\n    guard $ denom /= 0\n    liftM (/ denom) $ eval a\n\nsolve :: Rational -> [Rational] -> [Expr]\nsolve target r4 = filter (maybe False (== target) . eval) $\n    liftM2 ($) templates $\n    nub $ permutations $ map Constant r4 \n\nmain = getArgs >>= mapM_ print . solve 24 . map (toEnum . read)\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_54.txt",
        "content": "$ runghc 24Player.hs 2 3 8 9\n(8 * (9 - (3 * 2)))\n(8 * (9 - (2 * 3)))\n((9 - (2 * 3)) * 8)\n((9 - (3 * 2)) * 8)\n((9 - 3) * (8 / 2))\n((8 / 2) * (9 - 3))\n(8 * ((9 - 3) / 2))\n(((9 - 3) / 2) * 8)\n((9 - 3) / (2 / 8))\n((8 * (9 - 3)) / 2)\n(((9 - 3) * 8) / 2)\n(8 / (2 / (9 - 3)))",
        "safe": true
    },
    {
        "filename": "24 game_Solve_55.txt",
        "content": "import Control.Applicative\nimport Data.List\nimport Text.PrettyPrint\n\n\ndata Expr = C Int | Op String Expr Expr\n\ntoDoc (C     x  ) = int x\ntoDoc (Op op x y) = parens $ toDoc x <+> text op <+> toDoc y\n\nops :: [(String, Int -> Int -> Int)]\nops = [(\"+\",(+)), (\"-\",(-)), (\"*\",(*)), (\"/\",div)]\n\n\nsolve :: Int -> [Int] -> [Expr]\nsolve res = filter ((Just res ==) . eval) . genAst\n  where\n    genAst [x] = [C x]\n    genAst xs  = do\n      (ys,zs) <- split xs\n      let f (Op op _ _) = op `notElem` [\"+\",\"*\"] || ys <= zs\n      filter f $ Op <$> map fst ops <*> genAst ys <*> genAst zs\n\n    eval (C      x  ) = Just x\n    eval (Op \"/\" _ y) | Just 0 <- eval y = Nothing\n    eval (Op op  x y) = lookup op ops <*> eval x <*> eval y\n\n\nselect :: Int -> [Int] -> [[Int]]\nselect 0 _  = [[]]\nselect n xs = [x:zs | k <- [0..length xs - n]\n                    , let (x:ys) = drop k xs\n                    , zs <- select (n - 1) ys\n                    ]\n\nsplit :: [Int] -> [([Int],[Int])]\nsplit xs = [(ys, xs \\\\ ys) | n <- [1..length xs - 1]\n                           , ys <- nub . sort $ select n xs\n                           ]\n\n                           \nmain = mapM_ (putStrLn . render . toDoc) $ solve 24 [2,3,8,9]\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_56.txt",
        "content": "((8 / 2) * (9 - 3))\n((2 / 9) + (3 * 8))\n((3 * 8) - (2 / 9))\n((8 - (2 / 9)) * 3)\n(((2 / 9) + 8) * 3)\n(((8 + 9) / 2) * 3)\n((2 + (8 * 9)) / 3)\n((3 - (2 / 9)) * 8)\n((9 - (2 * 3)) * 8)\n(((2 / 9) + 3) * 8)\n(((2 + 9) / 3) * 8)\n(((9 - 3) / 2) * 8)\n(((9 - 3) * 8) / 2)",
        "safe": true
    },
    {
        "filename": "24 game_Solve_57.txt",
        "content": "invocable all \nlink strings   # for csort, deletec, permutes\n\nprocedure main()\nstatic eL\ninitial {\n   eoP := []  # set-up expression and operator permutation patterns\n   every ( e := ![\"a@b#c$d\", \"a@(b#c)$d\", \"a@b#(c$d)\", \"a@(b#c$d)\", \"a@(b#(c$d))\"] ) & \n         ( o := !(opers := \"+-*/\") || !opers || !opers ) do\n      put( eoP, map(e,\"@#$\",o) )    # expr+oper perms\n   \n   eL := []   # all cases\n   every ( e := !eoP ) & ( p := permutes(\"wxyz\") ) do\n      put(eL, map(e,\"abcd\",p))\n\n   }\n\nwrite(\"This will attempt to find solutions to 24 for sets of numbers by\\n\",\n      \"combining 4 single digits between 1 and 9 to make 24 using only + - * / and ( ).\\n\",\n      \"All operations have equal precedence and are evaluated left to right.\\n\",\n      \"Enter 'use n1 n2 n3 n4' or just hit enter (to use a random set),\",\n      \"'first'/'all' shows the first or all solutions, 'quit' to end.\\n\\n\")\n \nrepeat {\n   e := trim(read()) | fail\n   e ?  case tab(find(\" \")|0) of {\n      \"q\"|\"quit\" : break\n      \"u\"|\"use\"  : e := tab(0)\n      \"f\"|\"first\": first := 1 & next\n      \"a\"|\"all\"  : first := &null & next\n      \"\"         : e := \" \" ||(1+?8) || \" \" || (1+?8) ||\" \" || (1+?8) || \" \" || (1+?8)\n      }\n      \n   writes(\"Attempting to solve 24 for\",e)\n   \n   e := deletec(e,' \\t') # no whitespace   \n   if e ? ( tab(many('123456789')), pos(5), pos(0) ) then \n      write(\":\")\n   else write(\" - invalid, only the digits '1..9' are allowed.\") & next  \n   \n   eS := set()\n   every ex := map(!eL,\"wxyz\",e) do {\n      if member(eS,ex) then next # skip duplicates of final expression\n      insert(eS,ex)\n      if ex ? (ans := eval(E()), pos(0)) then # parse and evaluate\n         if ans = 24 then {\n            write(\"Success \",image(ex),\" evaluates to 24.\")\n            if \\first then break\n            }\n      }\n   }\nwrite(\"Quiting.\")\nend\n\nprocedure eval(X)    #: return the evaluated AST\n   if type(X) == \"list\" then {\n      x := eval(get(X)) \n      while o := get(X) do \n         if y := get(X) then\n            x := o( real(x), (o ~== \"/\" | fail, eval(y) ))\n         else write(\"Malformed expression.\") & fail\n   }\n   return \\x | X\nend\n\nprocedure E()    #: expression\n   put(lex := [],T())\n   while put(lex,tab(any('+-*/'))) do\n      put(lex,T())  \n   suspend if *lex = 1 then lex[1] else lex     # strip useless []  \nend   \n \nprocedure T()                   #: Term\n   suspend 2(=\"(\", E(), =\")\") | # parenthesized subexpression, or ...\n       tab(any(&digits))        # just a value\nend\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_58.txt",
        "content": "perm=: (A.&i.~ !) 4\nops=: ' ',.'+-*%' {~ >,{i.each 4 4 4\ncmask=: 1 + 0j1 * i.@{:@$@[ e. ]\nleft=:  [ #!.'('~\"1 cmask\nright=: [ #!.')'~\"1 cmask\nparen=: 2 :'[: left&m right&n'\nparens=: ], 0 paren 3, 0 paren 5, 2 paren 5, [: 0 paren 7 (0 paren 3)\nall=: [: parens [:,/ ops ,@,.\"1/ perm { [:;\":each\nanswer=: ({.@#~ 24 = \".)@all\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_59.txt",
        "content": "   answer 2 3 5 7\n 2+7+3*5  \n   answer 8 4 7 1\n 8*7-4*1 \n  answer 1 1 2 7\n(1+2)*1+7  \n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_6.txt",
        "content": "Evaluating 24 with the following input:  1 1 2 7\n( 1 + 2 ) * ( 1 + 7 )\n( 1 + 2 ) * ( 7 + 1 )\n( 1 + 7 ) * ( 1 + 2 )\n( 1 + 7 ) * ( 2 + 1 )\n( 2 + 1 ) * ( 1 + 7 )\n( 2 + 1 ) * ( 7 + 1 )\n( 7 + 1 ) * ( 1 + 2 )\n( 7 + 1 ) * ( 2 + 1 )\n\nEvaluating 24 with the following input:  1\n( ( 1 + 2 ) + 3 ) * 4\n( 1 + ( 2 + 3 ) ) * 4\n( ( 1 * 2 ) * 3 ) * 4\n( 1 * 2 ) * ( 3 * 4 )\n( 1 * ( 2 * 3 ) ) * 4\n1 * ( ( 2 * 3 ) * 4 )\n1 * ( 2 * ( 3 * 4 ) )\n( ( 1 * 2 ) * 4 ) * 3\n( 1 * 2 ) * ( 4 * 3 )\n( 1 * ( 2 * 4 ) ) * 3\n1 * ( ( 2 * 4 ) * 3 )\n1 * ( 2 * ( 4 * 3 ) )\n( ( 1 + 3 ) + 2 ) * 4\n( 1 + ( 3 + 2 ) ) * 4\n( 1 + 3 ) * ( 2 + 4 )\n( ( 1 * 3 ) * 2 ) * 4\n( 1 * 3 ) * ( 2 * 4 )\n( 1 * ( 3 * 2 ) ) * 4\n1 * ( ( 3 * 2 ) * 4 )\n1 * ( 3 * ( 2 * 4 ) )\n( 1 + 3 ) * ( 4 + 2 )\n( ( 1 * 3 ) * 4 ) * 2\n( 1 * 3 ) * ( 4 * 2 )\n( 1 * ( 3 * 4 ) ) * 2\n1 * ( ( 3 * 4 ) * 2 )\n1 * ( 3 * ( 4 * 2 ) )\n( ( 1 * 4 ) * 2 ) * 3\n( 1 * 4 ) * ( 2 * 3 )\n( 1 * ( 4 * 2 ) ) * 3\n1 * ( ( 4 * 2 ) * 3 )\n1 * ( 4 * ( 2 * 3 ) )\n( ( 1 * 4 ) * 3 ) * 2\n( 1 * 4 ) * ( 3 * 2 )\n( 1 * ( 4 * 3 ) ) * 2\n1 * ( ( 4 * 3 ) * 2 )\n1 * ( 4 * ( 3 * 2 ) )\n( ( 2 + 1 ) + 3 ) * 4\n( 2 + ( 1 + 3 ) ) * 4\n( ( 2 * 1 ) * 3 ) * 4\n( 2 * 1 ) * ( 3 * 4 )\n( 2 * ( 1 * 3 ) ) * 4\n2 * ( ( 1 * 3 ) * 4 )\n2 * ( 1 * ( 3 * 4 ) )\n( ( 2 / 1 ) * 3 ) * 4\n( 2 / 1 ) * ( 3 * 4 )\n( 2 / ( 1 / 3 ) ) * 4\n2 / ( 1 / ( 3 * 4 ) )\n2 / ( ( 1 / 3 ) / 4 )\n( ( 2 * 1 ) * 4 ) * 3\n( 2 * 1 ) * ( 4 * 3 )\n( 2 * ( 1 * 4 ) ) * 3\n2 * ( ( 1 * 4 ) * 3 )\n2 * ( 1 * ( 4 * 3 ) )\n( ( 2 / 1 ) * 4 ) * 3\n( 2 / 1 ) * ( 4 * 3 )\n( 2 / ( 1 / 4 ) ) * 3\n2 / ( 1 / ( 4 * 3 ) )\n2 / ( ( 1 / 4 ) / 3 )\n( ( 2 + 3 ) + 1 ) * 4\n( 2 + ( 3 + 1 ) ) * 4\n( ( 2 * 3 ) * 1 ) * 4\n( 2 * 3 ) * ( 1 * 4 )\n( 2 * ( 3 * 1 ) ) * 4\n2 * ( ( 3 * 1 ) * 4 )\n2 * ( 3 * ( 1 * 4 ) )\n( ( 2 * 3 ) / 1 ) * 4\n( 2 * ( 3 / 1 ) ) * 4\n2 * ( ( 3 / 1 ) * 4 )\n( 2 * 3 ) / ( 1 / 4 )\n2 * ( 3 / ( 1 / 4 ) )\n( ( 2 * 3 ) * 4 ) * 1\n( 2 * 3 ) * ( 4 * 1 )\n( 2 * ( 3 * 4 ) ) * 1\n2 * ( ( 3 * 4 ) * 1 )\n2 * ( 3 * ( 4 * 1 ) )\n( ( 2 * 3 ) * 4 ) / 1\n( 2 * 3 ) * ( 4 / 1 )\n( 2 * ( 3 * 4 ) ) / 1\n2 * ( ( 3 * 4 ) / 1 )\n2 * ( 3 * ( 4 / 1 ) )\n( 2 + 4 ) * ( 1 + 3 )\n( ( 2 * 4 ) * 1 ) * 3\n( 2 * 4 ) * ( 1 * 3 )\n( 2 * ( 4 * 1 ) ) * 3\n2 * ( ( 4 * 1 ) * 3 )\n2 * ( 4 * ( 1 * 3 ) )\n( ( 2 * 4 ) / 1 ) * 3\n( 2 * ( 4 / 1 ) ) * 3\n2 * ( ( 4 / 1 ) * 3 )\n( 2 * 4 ) / ( 1 / 3 )\n2 * ( 4 / ( 1 / 3 ) )\n( 2 + 4 ) * ( 3 + 1 )\n( ( 2 * 4 ) * 3 ) * 1\n( 2 * 4 ) * ( 3 * 1 )\n( 2 * ( 4 * 3 ) ) * 1\n2 * ( ( 4 * 3 ) * 1 )\n2 * ( 4 * ( 3 * 1 ) )\n( ( 2 * 4 ) * 3 ) / 1\n( 2 * 4 ) * ( 3 / 1 )\n( 2 * ( 4 * 3 ) ) / 1\n2 * ( ( 4 * 3 ) / 1 )\n2 * ( 4 * ( 3 / 1 ) )\n( ( 3 + 1 ) + 2 ) * 4\n( 3 + ( 1 + 2 ) ) * 4\n( 3 + 1 ) * ( 2 + 4 )\n( ( 3 * 1 ) * 2 ) * 4\n( 3 * 1 ) * ( 2 * 4 )\n( 3 * ( 1 * 2 ) ) * 4\n3 * ( ( 1 * 2 ) * 4 )\n3 * ( 1 * ( 2 * 4 ) )\n( ( 3 / 1 ) * 2 ) * 4\n( 3 / 1 ) * ( 2 * 4 )\n( 3 / ( 1 / 2 ) ) * 4\n3 / ( 1 / ( 2 * 4 ) )\n3 / ( ( 1 / 2 ) / 4 )\n( 3 + 1 ) * ( 4 + 2 )\n( ( 3 * 1 ) * 4 ) * 2\n( 3 * 1 ) * ( 4 * 2 )\n( 3 * ( 1 * 4 ) ) * 2\n3 * ( ( 1 * 4 ) * 2 )\n3 * ( 1 * ( 4 * 2 ) )\n( ( 3 / 1 ) * 4 ) * 2\n( 3 / 1 ) * ( 4 * 2 )\n( 3 / ( 1 / 4 ) ) * 2\n3 / ( 1 / ( 4 * 2 ) )\n3 / ( ( 1 / 4 ) / 2 )\n( ( 3 + 2 ) + 1 ) * 4\n( 3 + ( 2 + 1 ) ) * 4\n( ( 3 * 2 ) * 1 ) * 4\n( 3 * 2 ) * ( 1 * 4 )\n( 3 * ( 2 * 1 ) ) * 4\n3 * ( ( 2 * 1 ) * 4 )\n3 * ( 2 * ( 1 * 4 ) )\n( ( 3 * 2 ) / 1 ) * 4\n( 3 * ( 2 / 1 ) ) * 4\n3 * ( ( 2 / 1 ) * 4 )\n( 3 * 2 ) / ( 1 / 4 )\n3 * ( 2 / ( 1 / 4 ) )\n( ( 3 * 2 ) * 4 ) * 1\n( 3 * 2 ) * ( 4 * 1 )\n( 3 * ( 2 * 4 ) ) * 1\n3 * ( ( 2 * 4 ) * 1 )\n3 * ( 2 * ( 4 * 1 ) )\n( ( 3 * 2 ) * 4 ) / 1\n( 3 * 2 ) * ( 4 / 1 )\n( 3 * ( 2 * 4 ) ) / 1\n3 * ( ( 2 * 4 ) / 1 )\n3 * ( 2 * ( 4 / 1 ) )\n( ( 3 * 4 ) * 1 ) * 2\n( 3 * 4 ) * ( 1 * 2 )\n( 3 * ( 4 * 1 ) ) * 2\n3 * ( ( 4 * 1 ) * 2 )\n3 * ( 4 * ( 1 * 2 ) )\n( ( 3 * 4 ) / 1 ) * 2\n( 3 * ( 4 / 1 ) ) * 2\n3 * ( ( 4 / 1 ) * 2 )\n( 3 * 4 ) / ( 1 / 2 )\n3 * ( 4 / ( 1 / 2 ) )\n( ( 3 * 4 ) * 2 ) * 1\n( 3 * 4 ) * ( 2 * 1 )\n( 3 * ( 4 * 2 ) ) * 1\n3 * ( ( 4 * 2 ) * 1 )\n3 * ( 4 * ( 2 * 1 ) )\n( ( 3 * 4 ) * 2 ) / 1\n( 3 * 4 ) * ( 2 / 1 )\n( 3 * ( 4 * 2 ) ) / 1\n3 * ( ( 4 * 2 ) / 1 )\n3 * ( 4 * ( 2 / 1 ) )\n4 * ( ( 1 + 2 ) + 3 )\n4 * ( 1 + ( 2 + 3 ) )\n( ( 4 * 1 ) * 2 ) * 3\n( 4 * 1 ) * ( 2 * 3 )\n( 4 * ( 1 * 2 ) ) * 3\n4 * ( ( 1 * 2 ) * 3 )\n4 * ( 1 * ( 2 * 3 ) )\n( ( 4 / 1 ) * 2 ) * 3\n( 4 / 1 ) * ( 2 * 3 )\n( 4 / ( 1 / 2 ) ) * 3\n4 / ( 1 / ( 2 * 3 ) )\n4 / ( ( 1 / 2 ) / 3 )\n4 * ( ( 1 + 3 ) + 2 )\n4 * ( 1 + ( 3 + 2 ) )\n( ( 4 * 1 ) * 3 ) * 2\n( 4 * 1 ) * ( 3 * 2 )\n( 4 * ( 1 * 3 ) ) * 2\n4 * ( ( 1 * 3 ) * 2 )\n4 * ( 1 * ( 3 * 2 ) )\n( ( 4 / 1 ) * 3 ) * 2\n( 4 / 1 ) * ( 3 * 2 )\n( 4 / ( 1 / 3 ) ) * 2\n4 / ( 1 / ( 3 * 2 ) )\n4 / ( ( 1 / 3 ) / 2 )\n( 4 + 2 ) * ( 1 + 3 )\n4 * ( ( 2 + 1 ) + 3 )\n4 * ( 2 + ( 1 + 3 ) )\n( ( 4 * 2 ) * 1 ) * 3\n( 4 * 2 ) * ( 1 * 3 )\n( 4 * ( 2 * 1 ) ) * 3\n4 * ( ( 2 * 1 ) * 3 )\n4 * ( 2 * ( 1 * 3 ) )\n( ( 4 * 2 ) / 1 ) * 3\n( 4 * ( 2 / 1 ) ) * 3\n4 * ( ( 2 / 1 ) * 3 )\n( 4 * 2 ) / ( 1 / 3 )\n4 * ( 2 / ( 1 / 3 ) )\n( 4 + 2 ) * ( 3 + 1 )\n4 * ( ( 2 + 3 ) + 1 )\n4 * ( 2 + ( 3 + 1 ) )\n( ( 4 * 2 ) * 3 ) * 1\n( 4 * 2 ) * ( 3 * 1 )\n( 4 * ( 2 * 3 ) ) * 1\n4 * ( ( 2 * 3 ) * 1 )\n4 * ( 2 * ( 3 * 1 ) )\n( ( 4 * 2 ) * 3 ) / 1\n( 4 * 2 ) * ( 3 / 1 )\n( 4 * ( 2 * 3 ) ) / 1\n4 * ( ( 2 * 3 ) / 1 )\n4 * ( 2 * ( 3 / 1 ) )\n4 * ( ( 3 + 1 ) + 2 )\n4 * ( 3 + ( 1 + 2 ) )\n( ( 4 * 3 ) * 1 ) * 2\n( 4 * 3 ) * ( 1 * 2 )\n( 4 * ( 3 * 1 ) ) * 2\n4 * ( ( 3 * 1 ) * 2 )\n4 * ( 3 * ( 1 * 2 ) )\n( ( 4 * 3 ) / 1 ) * 2\n( 4 * ( 3 / 1 ) ) * 2\n4 * ( ( 3 / 1 ) * 2 )\n( 4 * 3 ) / ( 1 / 2 )\n4 * ( 3 / ( 1 / 2 ) )\n4 * ( ( 3 + 2 ) + 1 )\n4 * ( 3 + ( 2 + 1 ) )\n( ( 4 * 3 ) * 2 ) * 1\n( 4 * 3 ) * ( 2 * 1 )\n( 4 * ( 3 * 2 ) ) * 1\n4 * ( ( 3 * 2 ) * 1 )\n4 * ( 3 * ( 2 * 1 ) )\n( ( 4 * 3 ) * 2 ) / 1\n( 4 * 3 ) * ( 2 / 1 )\n( 4 * ( 3 * 2 ) ) / 1\n4 * ( ( 3 * 2 ) / 1 )\n4 * ( 3 * ( 2 / 1 ) )\n\nEvaluating 24 with the following input:  5 6 7 8\n5 * ( 6 - ( 8 / 7 ) )\n( 5 + 7 ) * ( 8 - 6 )\n( ( 5 + 7 ) - 8 ) * 6\n( 5 + ( 7 - 8 ) ) * 6\n( ( 5 - 8 ) + 7 ) * 6\n( 5 - ( 8 - 7 ) ) * 6\n6 * ( ( 5 + 7 ) - 8 )\n6 * ( 5 + ( 7 - 8 ) )\n6 * ( ( 5 - 8 ) + 7 )\n6 * ( 5 - ( 8 - 7 ) )\n6 * ( ( 7 + 5 ) - 8 )\n6 * ( 7 + ( 5 - 8 ) )\n( 6 / ( 7 - 5 ) ) * 8\n6 / ( ( 7 - 5 ) / 8 )\n6 * ( ( 7 - 8 ) + 5 )\n6 * ( 7 - ( 8 - 5 ) )\n( 6 * 8 ) / ( 7 - 5 )\n6 * ( 8 / ( 7 - 5 ) )\n( 6 - ( 8 / 7 ) ) * 5\n( 7 + 5 ) * ( 8 - 6 )\n( ( 7 + 5 ) - 8 ) * 6\n( 7 + ( 5 - 8 ) ) * 6\n( ( 7 - 8 ) + 5 ) * 6\n( 7 - ( 8 - 5 ) ) * 6\n( 8 - 6 ) * ( 5 + 7 )\n( 8 * 6 ) / ( 7 - 5 )\n8 * ( 6 / ( 7 - 5 ) )\n( 8 - 6 ) * ( 7 + 5 )\n( 8 / ( 7 - 5 ) ) * 6\n8 / ( ( 7 - 5 ) / 6 )\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_60.txt",
        "content": "ops=: > , { 3#<'+-*%'\nperms=: [: \":\"0 [: ~. i.@!@# A. ]\nbuild=: 1 : '(#~ 24 = \".) @: u'\n\ncombp=: dyad define\n'a b c d'=. y['f g h'=. x\n('(',a,f,b,g,c,')',h,d),('(',a,f,b,')',g,c,h,d),(a,f,'(',b,g,c,')',h,d),:('((',a,f,b,')',g,c,')',h,d)\n)\n\nmath24=: monad define\nassert. 4 = # y NB. prefer expressions without parens & fallback if needed\nes=. ([: ,/ ops ([: , (' ',[) ,. ])\"1 2/ perms) build y\nif. 0 = #es do. es =. ([: ,/ [: ,/ ops combp\"1 2/ perms) build y end.\nes -.\"1 ' '\n)\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_61.txt",
        "content": "   math24 2 3 5 12\n12%3-5%2\n   math24 2 3 8 9\n8*9-2*3\n8*9-3*2\n8%2%9-3\n   math24 3 6 6 11\n(6+6*11)%3  \n(6+11*6)%3  \n((6*11)+6)%3\n((11*6)+6)%3\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_62.txt",
        "content": "import java.util.*;\n\npublic class Game24Player {\n    final String[] patterns = {\"nnonnoo\", \"nnonono\", \"nnnoono\", \"nnnonoo\",\n        \"nnnnooo\"};\n    final String ops = \"+-*/^\";\n\n    String solution;\n    List<Integer> digits;\n\n    public static void main(String[] args) {\n        new Game24Player().play();\n    }\n\n    void play() {\n        digits = getSolvableDigits();\n\n        Scanner in = new Scanner(System.in);\n        while (true) {\n            System.out.print(\"Make 24 using these digits: \");\n            System.out.println(digits);\n            System.out.println(\"(Enter 'q' to quit, 's' for a solution)\");\n            System.out.print(\"> \");\n\n            String line = in.nextLine();\n            if (line.equalsIgnoreCase(\"q\")) {\n                System.out.println(\"\\nThanks for playing\");\n                return;\n            }\n\n            if (line.equalsIgnoreCase(\"s\")) {\n                System.out.println(solution);\n                digits = getSolvableDigits();\n                continue;\n            }\n\n            char[] entry = line.replaceAll(\"[^*+-/)(\\\\d]\", \"\").toCharArray();\n\n            try {\n                validate(entry);\n\n                if (evaluate(infixToPostfix(entry))) {\n                    System.out.println(\"\\nCorrect! Want to try another? \");\n                    digits = getSolvableDigits();\n                } else {\n                    System.out.println(\"\\nNot correct.\");\n                }\n\n            } catch (Exception e) {\n                System.out.printf(\"%n%s Try again.%n\", e.getMessage());\n            }\n        }\n    }\n\n    void validate(char[] input) throws Exception {\n        int total1 = 0, parens = 0, opsCount = 0;\n\n        for (char c : input) {\n            if (Character.isDigit(c))\n                total1 += 1 << (c - '0') * 4;\n            else if (c == '(')\n                parens++;\n            else if (c == ')')\n                parens--;\n            else if (ops.indexOf(c) != -1)\n                opsCount++;\n            if (parens < 0)\n                throw new Exception(\"Parentheses mismatch.\");\n        }\n\n        if (parens != 0)\n            throw new Exception(\"Parentheses mismatch.\");\n\n        if (opsCount != 3)\n            throw new Exception(\"Wrong number of operators.\");\n\n        int total2 = 0;\n        for (int d : digits)\n            total2 += 1 << d * 4;\n\n        if (total1 != total2)\n            throw new Exception(\"Not the same digits.\");\n    }\n\n    boolean evaluate(char[] line) throws Exception {\n        Stack<Float> s = new Stack<>();\n        try {\n            for (char c : line) {\n                if ('0' <= c && c <= '9')\n                    s.push((float) c - '0');\n                else\n                    s.push(applyOperator(s.pop(), s.pop(), c));\n            }\n        } catch (EmptyStackException e) {\n            throw new Exception(\"Invalid entry.\");\n        }\n        return (Math.abs(24 - s.peek()) < 0.001F);\n    }\n\n    float applyOperator(float a, float b, char c) {\n        switch (c) {\n            case '+':\n                return a + b;\n            case '-':\n                return b - a;\n            case '*':\n                return a * b;\n            case '/':\n                return b / a;\n            default:\n                return Float.NaN;\n        }\n    }\n\n    List<Integer> randomDigits() {\n        Random r = new Random();\n        List<Integer> result = new ArrayList<>(4);\n        for (int i = 0; i < 4; i++)\n            result.add(r.nextInt(9) + 1);\n        return result;\n    }\n\n    List<Integer> getSolvableDigits() {\n        List<Integer> result;\n        do {\n            result = randomDigits();\n        } while (!isSolvable(result));\n        return result;\n    }\n\n    boolean isSolvable(List<Integer> digits) {\n        Set<List<Integer>> dPerms = new HashSet<>(4 * 3 * 2);\n        permute(digits, dPerms, 0);\n\n        int total = 4 * 4 * 4;\n        List<List<Integer>> oPerms = new ArrayList<>(total);\n        permuteOperators(oPerms, 4, total);\n\n        StringBuilder sb = new StringBuilder(4 + 3);\n\n        for (String pattern : patterns) {\n            char[] patternChars = pattern.toCharArray();\n\n            for (List<Integer> dig : dPerms) {\n                for (List<Integer> opr : oPerms) {\n\n                    int i = 0, j = 0;\n                    for (char c : patternChars) {\n                        if (c == 'n')\n                            sb.append(dig.get(i++));\n                        else\n                            sb.append(ops.charAt(opr.get(j++)));\n                    }\n\n                    String candidate = sb.toString();\n                    try {\n                        if (evaluate(candidate.toCharArray())) {\n                            solution = postfixToInfix(candidate);\n                            return true;\n                        }\n                    } catch (Exception ignored) {\n                    }\n                    sb.setLength(0);\n                }\n            }\n        }\n        return false;\n    }\n\n    String postfixToInfix(String postfix) {\n        class Expression {\n            String op, ex;\n            int prec = 3;\n\n            Expression(String e) {\n                ex = e;\n            }\n\n            Expression(String e1, String e2, String o) {\n                ex = String.format(\"%s %s %s\", e1, o, e2);\n                op = o;\n                prec = ops.indexOf(o) / 2;\n            }\n        }\n\n        Stack<Expression> expr = new Stack<>();\n\n        for (char c : postfix.toCharArray()) {\n            int idx = ops.indexOf(c);\n            if (idx != -1) {\n\n                Expression r = expr.pop();\n                Expression l = expr.pop();\n\n                int opPrec = idx / 2;\n\n                if (l.prec < opPrec)\n                    l.ex = '(' + l.ex + ')';\n\n                if (r.prec <= opPrec)\n                    r.ex = '(' + r.ex + ')';\n\n                expr.push(new Expression(l.ex, r.ex, \"\" + c));\n            } else {\n                expr.push(new Expression(\"\" + c));\n            }\n        }\n        return expr.peek().ex;\n    }\n\n    char[] infixToPostfix(char[] infix) throws Exception {\n        StringBuilder sb = new StringBuilder();\n        Stack<Integer> s = new Stack<>();\n        try {\n            for (char c : infix) {\n                int idx = ops.indexOf(c);\n                if (idx != -1) {\n                    if (s.isEmpty())\n                        s.push(idx);\n                    else {\n                        while (!s.isEmpty()) {\n                            int prec2 = s.peek() / 2;\n                            int prec1 = idx / 2;\n                            if (prec2 >= prec1)\n                                sb.append(ops.charAt(s.pop()));\n                            else\n                                break;\n                        }\n                        s.push(idx);\n                    }\n                } else if (c == '(') {\n                    s.push(-2);\n                } else if (c == ')') {\n                    while (s.peek() != -2)\n                        sb.append(ops.charAt(s.pop()));\n                    s.pop();\n                } else {\n                    sb.append(c);\n                }\n            }\n            while (!s.isEmpty())\n                sb.append(ops.charAt(s.pop()));\n\n        } catch (EmptyStackException e) {\n            throw new Exception(\"Invalid entry.\");\n        }\n        return sb.toString().toCharArray();\n    }\n\n    void permute(List<Integer> lst, Set<List<Integer>> res, int k) {\n        for (int i = k; i < lst.size(); i++) {\n            Collections.swap(lst, i, k);\n            permute(lst, res, k + 1);\n            Collections.swap(lst, k, i);\n        }\n        if (k == lst.size())\n            res.add(new ArrayList<>(lst));\n    }\n\n    void permuteOperators(List<List<Integer>> res, int n, int total) {\n        for (int i = 0, npow = n * n; i < total; i++)\n            res.add(Arrays.asList((i / npow), (i % npow) / n, i % n));\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_63.txt",
        "content": "Make 24 using these digits: [5, 7, 1, 8]\n(Enter 'q' to quit, 's' for a solution)\n> (8-5) * (7+1)\n\nCorrect! Want to try another?\nMake 24 using these digits: [3, 9, 2, 9]\n(Enter 'q' to quit, 's' for a solution)\n> (3*2) + 9 + 9\n\nCorrect! Want to try another?\nMake 24 using these digits: [4, 4, 8, 5]\n(Enter 'q' to quit, 's' for a solution)\n> s\n4 * 5 - (4 - 8)\nMake 24 using these digits: [2, 5, 9, 1]\n(Enter 'q' to quit, 's' for a solution)\n> 2+5+9+1\n\nNot correct.\nMake 24 using these digits: [2, 5, 9, 1]\n(Enter 'q' to quit, 's' for a solution)\n> 2 * 9 + 5 + 1\n\nCorrect! Want to try another?\nMake 24 using these digits: [8, 4, 3, 1]\n(Enter 'q' to quit, 's' for a solution)\n> s\n(8 + 4) * (3 - 1)\nMake 24 using these digits: [9, 4, 5, 6]\n(Enter 'q' to quit, 's' for a solution)\n> (9 +4) * 2 - 2\n\nNot the same digits. Try again.\nMake 24 using these digits: [9, 4, 5, 6]\n(Enter 'q' to quit, 's' for a solution)\n> q\n\nThanks for playing",
        "safe": true
    },
    {
        "filename": "24 game_Solve_64.txt",
        "content": "var ar=[],order=[0,1,2],op=[],val=[];\nvar NOVAL=9999,oper=\"+-*/\",out;\n\nfunction rnd(n){return Math.floor(Math.random()*n)}\n\nfunction say(s){\n try{document.write(s+\"<br>\")}\n catch(e){WScript.Echo(s)}\n}\n\nfunction getvalue(x,dir){\n var r=NOVAL;\n if(dir>0)++x;\n while(1){\n  if(val[x]!=NOVAL){\n   r=val[x];\n   val[x]=NOVAL;\n   break;\n  }\n  x+=dir;\n }\n return r*1;\n}\n\nfunction calc(){\n var c=0,l,r,x;\n val=ar.join('/').split('/');\n while(c<3){\n  x=order[c];\n  l=getvalue(x,-1);\n  r=getvalue(x,1);\n  switch(op[x]){\n   case 0:val[x]=l+r;break;\n   case 1:val[x]=l-r;break;\n   case 2:val[x]=l*r;break;\n   case 3:\n   if(!r||l%r)return 0;\n   val[x]=l/r;\n  }\n  ++c;\n }\n return getvalue(-1,1);\n}\n\nfunction shuffle(s,n){\n var x=n,p=eval(s),r,t;\n while(x--){\n  r=rnd(n);\n  t=p[x];\n  p[x]=p[r];\n  p[r]=t;\n }\n}\n\nfunction parenth(n){\n while(n>0)--n,out+='(';\n while(n<0)++n,out+=')';\n}\n\nfunction getpriority(x){\n for(var z=3;z--;)if(order[z]==x)return 3-z;\n return 0;\n}\n\nfunction showsolution(){\n var x=0,p=0,lp=0,v=0;\n while(x<4){\n  if(x<3){\n   lp=p;\n   p=getpriority(x);\n   v=p-lp;\n   if(v>0)parenth(v);\n  }\n  out+=ar[x];\n  if(x<3){\n   if(v<0)parenth(v);\n   out+=oper.charAt(op[x]);\n  }\n  ++x;\n }\n parenth(-p);\n say(out);\n}\n\nfunction solve24(s){\n var z=4,r;\n while(z--)ar[z]=s.charCodeAt(z)-48;\n out=\"\";\n for(z=100000;z--;){\n  r=rnd(256);\n  op[0]=r&3;\n  op[1]=(r>>2)&3;\n  op[2]=(r>>4)&3;\n  shuffle(\"ar\",4);\n  shuffle(\"order\",3);\n  if(calc()!=24)continue;\n  showsolution();\n  break;\n }\n}\n\nsolve24(\"1234\");\nsolve24(\"6789\");\nsolve24(\"1127\");\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_65.txt",
        "content": "(((3*1)*4)*2)\n((6*8)/((9-7)))\n(((1+7))*(2+1))",
        "safe": true
    },
    {
        "filename": "24 game_Solve_66.txt",
        "content": "# Generate a stream of the permutations of the input array.\ndef permutations:\n  if length == 0 then []\n  else range(0;length) as $i\n  | [.[$i]] + (del(.[$i])|permutations)\n  end\u00a0;\n\n# Generate a stream of arrays of length n, \n# with members drawn from the input array.\ndef take(n):\n  length as $l | \n  if n == 1 then range(0;$l) as $i | [ .[$i] ]\n  else take(n-1) + take(1)\n  end;\n\n# Emit an array with elements that alternate between those in the input array and those in short,\n# starting with the former, and using nothing if \"short\" is too too short.\ndef intersperse(short):\n . as $in\n | reduce range(0;length) as $i\n     ([]; . + [ $in[$i], (short[$i] // empty) ]);\n\n# Emit a stream of all the nested triplet groupings of the input array elements,\n# e.g. [1,2,3,4,5] =>\n# [1,2,[3,4,5]]\n# [[1,2,3],4,5]\n#\ndef triples:\n  . as $in\n  | if   length == 3 then .\n    elif length == 1 then $in[0]\n    elif length < 3 then empty\n    else\n      (range(0; (length-1) / 2) * 2 + 1)  as $i\n      | ($in[0:$i] | triples)  as $head\n      | ($in[$i+1:] | triples) as $tail\n      | [$head, $in[$i], $tail]\n    end;",
        "safe": true
    },
    {
        "filename": "24 game_Solve_67.txt",
        "content": "# Evaluate the input, which must be a number or a triple: [x, op, y]\ndef eval:\n  if type == \"array\" then \n    .[1] as $op\n    | if .[0] == null or .[2] == null then null\n      else\n       (.[0] | eval) as $left | (.[2] | eval) as $right\n       | if $left == null or $right == null then null\n        elif  $op == \"+\" then $left + $right\n        elif  $op == \"-\" then $left - $right\n        elif  $op == \"*\" then $left * $right\n        elif  $op == \"/\" then\n          if $right == 0 then null\n  \t  else $left / $right\n\t  end\n        else \"invalid arithmetic operator: \\($op)\" | error\n\tend\n      end\n  else .\n  end;\n\ndef pp:\n  \"\\(.)\" | explode | map([.] | implode | if . == \",\" then \" \" elif . == \"\\\"\" then \"\" else . end) | join(\"\");",
        "safe": true
    },
    {
        "filename": "24 game_Solve_68.txt",
        "content": "def OPERATORS: [\"+\", \"-\", \"*\", \"/\"];\n\n# Input: an array of 4 digits\n# o: an array of 3 operators\n# Output: a stream\ndef EXPRESSIONS(o):\n   intersperse( o ) | triples;\n\ndef solve(objective):\n  length as $length\n  | [ (OPERATORS | take($length-1)) as $poperators\n    | permutations | EXPRESSIONS($poperators)\n    | select( eval == objective)\n  ] as $answers\n  | if $answers|length > 3 then \"That was too easy. I found \\($answers|length) answers, e.g. \\($answers[0] | pp)\"\n    elif $answers|length > 1 then $answers[] | pp\n    else \"You lose! There are no solutions.\"\n    end\n;\n\nsolve(24), \"Please try again.\"",
        "safe": true
    },
    {
        "filename": "24 game_Solve_69.txt",
        "content": "$ jq -r -f Solve.jq\n[1,2,3,4]\nThat was too easy. I found 242 answers, e.g. [4 * [1 + [2 + 3]]]\nPlease try again.\n[1,2,3,40,1]\nThat was too easy. I found 636 answers, e.g. [[[1 / 2] * 40] + [3 + 1]]\nPlease try again.\n[3,8,9]\nThat was too easy. I found 8 answers, e.g. [[8 / 3] * 9]\nPlease try again.\n[4,5,6]\nYou lose! There are no solutions.\nPlease try again.\n[1,2,3,4,5,6]\nThat was too easy. I found 197926 answers, e.g. [[2 * [1 + 4]] + [3 + [5 + 6]]]\nPlease try again.\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_7.txt",
        "content": "die \"Please give 4 digits as argument 1\\n\" if argc < 2\n\nprint a function that given four digits argv[1] subject to the rules of\t\\\nthe _24_ game, computes an expression to solve the game if possible.\n\nuse std, array\n\nlet digits    be an array of 4 byte\nlet operators be an array of 4 byte\n(: reordered arrays\u00a0:)\nlet (type of digits)    rdigits\nlet (type of operators) roperators\n\n.: a function that given four digits <text digits> subject to\n   the rules of the _24_ game, computes an expression to solve\n   the game if possible.                                      \u00a0:. -> text\n  if #digits\u00a0!= 4 {return \"[error: need exactly 4 digits]\"}\n  operators[0] = '+'\u00a0; operators[1] = '-'\n  operators[2] = '*'\u00a0; operators[3] = '/'\n  for each (val int d) from 0 to 3\n    if (digits[d] < '1') || (digits[d] > '9')\n      return \"[error: non-digit character given]\"\n    (super digits)[d] = digits[d]\n  let expr = for each operand order stuff\n  return \"\" if expr is nil\n  expr\n\n.:for each operand order stuff:. -> text\n  for each (val int a) from 0 to 3\n    for each (val int b) from 0 to 3\n      next if (b == a)\n      for each (val int c) from 0 to 3\n        next if (c == b) or (c == a)\n\tfor each (val int d) from 0 to 3\n\t  next if (d == c) or (d == b) or (d == a)\n\t  rdigits[0] = digits[a]\u00a0; rdigits[1] = digits[b]\n\t  rdigits[2] = digits[c]\u00a0; rdigits[3] = digits[d]\n\t  let found = for each operator order stuff\n\t  return found unless found is nil\n  nil\n\n.:for each operator order stuff:. -> text\n  for each (val int i) from 0 to 3\n    for each (val int j) from 0 to 3\n      for each (val int k) from 0 to 3\n        roperators[0] = operators[i]\n\troperators[1] = operators[j]\n\troperators[2] = operators[k]\n\tlet found = for each RPN pattern stuff\n\treturn found if found isn't nil\n  nil\n\nour (raw array of text) RPN_patterns = Cdata\n  \"xx.x.x.\"\n  \"xx.xx..\"\n  \"xxx..x.\"\n  \"xxx.x..\"\n  \"xxxx...\"\nour (raw array of text) formats = Cdata\n  \"((%c%c%c)%c%c)%c%c\"\n  \"(%c%c%c)%c(%c%c%c)\"\n  \"(%c%c(%c%c%c))%c%c\"\n  \"%c%c((%c%c%c)%c%c)\"\n  \"%c%c(%c%c(%c%c%c))\"\nour (raw array of array of 3 int) rrop = Cdata\n  {0;1;2}; {0;2;1}; {1;0;2}; {2;0;1}; {2;1;0}\n\n.:for each RPN pattern stuff:. -> text\n  let RPN_stack be an array of 4 real\n  for each (val int rpn) from 0 to 4\n    let (nat) sp=0, op=0, dg=0.\n    let text p\n    for (p = RPN_patterns[rpn]) (*p\u00a0!= 0) (p++)\n      if *p == 'x'\n        if sp >= 4 {die \"RPN stack overflow\\n\"}\n\tif dg >  3 {die \"RPN digits overflow\\n\"}\n\tRPN_stack[sp++] = (rdigits[dg++] - '0') as real\n      if *p == '.'\n        if sp < 2 {die \"RPN stack underflow\\n\"}\n\tif op > 2 {die \"RPN operators overflow\\n\"}\n\tsp -= 2\n\tlet x = RPN_stack[sp]\n\tlet y = RPN_stack[sp + 1]\n\tswitch roperators[op++]\n\t  case '+' {x += y}\n\t  case '-' {x -= y}\n\t  case '*' {x *= y}\n\t  case '/' {x /= y}\n\t  default  {die \"RPN operator unknown\\n\"}\n\tRPN_stack[sp++] = x\n    if RPN_stack[0] == 24.0\n      our array of 12 byte buffer (: 4 paren + 3 ops + 4 digits + null\u00a0:)\n      snprintf (buffer as text) (size of buffer) (formats[rpn])\t\t\\\n         (rdigits[0]) (roperators[(rrop[rpn][0])]) (rdigits[1])\t\t\\\n                      (roperators[(rrop[rpn][1])]) (rdigits[2])\t\t\\\n                      (roperators[(rrop[rpn][2])]) (rdigits[3]);\n      return buffer as text\n  nil",
        "safe": true
    },
    {
        "filename": "24 game_Solve_70.txt",
        "content": "function solve24(nums)\n    length(nums) != 4 && error(\"Input must be a 4-element Array\")\n    syms = [+,-,*,/]\n    for x in syms, y in syms, z in syms\n        for i = 1:24\n            a,b,c,d = nthperm(nums,i)\n            if round(x(y(a,b),z(c,d)),5) == 24\n                return \"($a$y$b)$x($c$z$d)\"\n            elseif round(x(a,y(b,z(c,d))),5) == 24 \n                return \"$a$x($b$y($c$z$d))\"\n            elseif round(x(y(z(c,d),b),a),5) == 24 \n                return \"(($c$z$d)$y$b)$x$a\"\n            elseif round(x(y(b,z(c,d)),a),5) == 24 \n                return \"($b$y($c$z$d))$x$a\"\n            end\n        end\n    end\n    return \"0\"\nend\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_71.txt",
        "content": "julia> for i in 1:10\n            nums = rand(1:9, 4)\n            println(\"solve24($nums) -> $(solve24(nums))\")\n       end\nsolve24([9,4,4,5]) -> 0\nsolve24([1,7,2,7]) -> ((7*7)-1)/2\nsolve24([5,7,5,4]) -> 4*(7-(5/5))\nsolve24([1,4,6,6]) -> 6+(6*(4-1))\nsolve24([2,3,7,3]) -> ((2+7)*3)-3\nsolve24([8,7,9,7]) -> 0\nsolve24([1,6,2,6]) -> 6+(6*(1+2))\nsolve24([7,9,4,1]) -> (7-4)*(9-1)\nsolve24([6,4,2,2]) -> (2-2)+(6*4)\nsolve24([5,7,9,7]) -> (5+7)*(9-7)",
        "safe": true
    },
    {
        "filename": "24 game_Solve_72.txt",
        "content": "// version 1.1.3\n\nimport java.util.Random\n\nconst val N_CARDS = 4\nconst val SOLVE_GOAL = 24\nconst val MAX_DIGIT = 9\n\nclass Frac(val num: Int, val den: Int)\n\nenum class OpType { NUM, ADD, SUB, MUL, DIV }\n\nclass Expr(\n    var op:    OpType = OpType.NUM,\n    var left:  Expr?  = null,\n    var right: Expr?  = null,\n    var value: Int    = 0\n)\n\nfun showExpr(e: Expr?, prec: OpType, isRight: Boolean) {\n    if (e == null) return\n    val op = when (e.op) {\n        OpType.NUM -> { print(e.value); return }\n        OpType.ADD -> \" + \"\n        OpType.SUB -> \" - \"\n        OpType.MUL -> \" x \"\n        OpType.DIV -> \" / \"\n    }\n\n    if ((e.op == prec && isRight) || e.op < prec) print(\"(\")\n    showExpr(e.left, e.op, false)\n    print(op)\n    showExpr(e.right, e.op, true)\n    if ((e.op == prec && isRight) || e.op < prec) print(\")\")\n}\n\nfun evalExpr(e: Expr?): Frac {\n    if (e == null) return Frac(0, 1)\n    if (e.op == OpType.NUM) return Frac(e.value, 1)\n    val l = evalExpr(e.left)\n    val r = evalExpr(e.right)\n    return when (e.op) {\n        OpType.ADD -> Frac(l.num * r.den + l.den * r.num, l.den * r.den)\n        OpType.SUB -> Frac(l.num * r.den - l.den * r.num, l.den * r.den)\n        OpType.MUL -> Frac(l.num * r.num, l.den * r.den)\n        OpType.DIV -> Frac(l.num * r.den, l.den * r.num)\n        else       -> throw IllegalArgumentException(\"Unknown op: ${e.op}\")\n    }\n}\n\nfun solve(ea: Array<Expr?>, len: Int): Boolean {\n    if (len == 1) {\n        val final = evalExpr(ea[0])\n        if (final.num == final.den * SOLVE_GOAL && final.den != 0) {\n            showExpr(ea[0], OpType.NUM, false)\n            return true\n        }\n    }\n\n    val ex = arrayOfNulls<Expr>(N_CARDS)\n    for (i in 0 until len - 1) {\n        for (j in i + 1 until len) ex[j - 1] = ea[j]\n        val node = Expr()\n        ex[i] = node\n        for (j in i + 1 until len) {\n            node.left = ea[i]\n            node.right = ea[j]\n            for (k in OpType.values().drop(1)) {\n                node.op = k\n                if (solve(ex, len - 1)) return true\n            }\n            node.left = ea[j]\n            node.right = ea[i]\n            node.op = OpType.SUB\n            if (solve(ex, len - 1)) return true\n            node.op = OpType.DIV\n            if (solve(ex, len - 1)) return true\n            ex[j] = ea[j]\n        }\n        ex[i] = ea[i]\n    }\n    return false\n}\n\nfun solve24(n: IntArray) =\n    solve (Array(N_CARDS) { Expr(value = n[it]) }, N_CARDS)\n\nfun main(args: Array<String>) {\n    val r = Random()\n    val n = IntArray(N_CARDS)\n    for (j in 0..9) {\n        for (i in 0 until N_CARDS) {\n            n[i] = 1 + r.nextInt(MAX_DIGIT)\n            print(\" ${n[i]}\")\n        }\n        print(\":  \")\n        println(if (solve24(n)) \"\" else \"No solution\")\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_73.txt",
        "content": " 8 4 1 7:  (8 - 4) x (7 - 1)\n 6 1 4 1:  ((6 + 1) - 1) x 4\n 8 8 5 4:  (8 / 8 + 5) x 4\n 9 6 9 8:  8 / ((9 - 6) / 9)\n 6 6 9 6:  (6 x 6) / 9 x 6\n 9 9 7 7:  No solution\n 1 1 2 5:  No solution\n 6 9 4 1:  6 x (9 - 4 - 1)\n 7 7 6 4:  7 + 7 + 6 + 4\n 4 8 8 4:  4 + 8 + 8 + 4\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_74.txt",
        "content": "dim d(4)\ninput \"Enter 4 digits: \"; a$\nnD=0\nfor i =1 to len(a$)\n    c$=mid$(a$,i,1)\n    if instr(\"123456789\",c$) then\n        nD=nD+1\n        d(nD)=val(c$)\n    end if\nnext\n'for i = 1 to 4\n'    print d(i);\n'next\n\n'precompute permutations. Dumb way.\nnPerm = 1*2*3*4\ndim perm(nPerm, 4)\nn = 0\nfor i = 1 to 4\n    for j = 1 to 4\n        for k = 1 to 4\n            for l = 1 to 4\n            'valid permutation (no dupes?)\n                if i<>j and i<>k and i<>l _\n                    and j<>k and j<>l _\n                        and k<>l then\n                    n=n+1\n                    '\n'                    perm(n,1)=i\n'                    perm(n,2)=j\n'                    perm(n,3)=k\n'                    perm(n,4)=l\n                    'actually, we can as well permute given digits\n                    perm(n,1)=d(i)\n                    perm(n,2)=d(j)\n                    perm(n,3)=d(k)\n                    perm(n,4)=d(l)\n                end if\n            next\n        next\n    next\nnext\n'check if permutations look OK. They are\n'for i =1 to n\n'    print i,\n'    for j =1 to 4: print perm(i,j);:next\n'    print\n'next\n\n'possible brackets\nNBrackets = 11\ndim Brakets$(NBrackets)\nDATA \"4#4#4#4\"\nDATA \"(4#4)#4#4\"\nDATA \"4#(4#4)#4\"\nDATA \"4#4#(4#4)\"\nDATA \"(4#4)#(4#4)\"\nDATA \"(4#4#4)#4\"\nDATA \"4#(4#4#4)\"\nDATA \"((4#4)#4)#4\"\nDATA \"(4#(4#4))#4\"\nDATA \"4#((4#4)#4)\"\nDATA \"4#(4#(4#4))\"\nfor i = 1 to NBrackets\n    read Tmpl$: Brakets$(i) = Tmpl$\nnext\n\n'operations: full search\ncount = 0\nOps$=\"+ - * /\"\ndim Op$(3)\nFor op1=1 to 4\n    Op$(1)=word$(Ops$,op1)\n    For op2=1 to 4\n        Op$(2)=word$(Ops$,op2)\n        For op3=1 to 4\n            Op$(3)=word$(Ops$,op3)\n            'print \"*\"\n            'substitute all brackets\n            for t = 1 to NBrackets\n                Tmpl$=Brakets$(t)\n                'print , Tmpl$\n                'now, substitute all digits: permutations.\n                for p = 1 to nPerm\n                    res$= \"\"\n                    nOp=0\n                    nD=0\n                    for i = 1 to len(Tmpl$)\n                        c$ = mid$(Tmpl$, i, 1)\n                        select case c$\n                        case \"#\"                'operations\n                            nOp = nOp+1\n                            res$ = res$+Op$(nOp)\n                        case \"4\"                'digits\n                            nD = nOp+1\n                            res$ = res$; perm(p,nD)\n                        case else               'brackets goes here\n                            res$ = res$+ c$ \n                        end select\n                    next\n                    'print,, res$\n                    'eval here\n                    if evalWithErrCheck(res$) = 24 then\n                        print \"24 = \";res$\n                        end 'comment it out if you want to see all versions\n                    end if\n                    count = count + 1\n                next\n            next\n        Next\n    Next\nnext\n\nprint \"If you see this, probably task cannot be solved with these digits\"\n'print count\nend\n\nfunction evalWithErrCheck(expr$)\n    on error goto [handler]\n    evalWithErrCheck=eval(expr$)\n    exit function\n[handler]\nend function",
        "safe": true
    },
    {
        "filename": "24 game_Solve_75.txt",
        "content": "local SIZE = #arg[1]\nlocal GOAL = tonumber(arg[2]) or 24\n\nlocal input = {}\nfor v in arg[1]:gmatch(\"%d\") do\n\ttable.insert(input, v)\nend\nassert(#input == SIZE, 'Invalid input')\n\nlocal operations = {'+', '-', '*', '/'}\n\nlocal function BinaryTrees(vert)\n\tif vert == 0 then\n\t\treturn {false}\n\telse\n\t\tlocal buf = {}\n\t\tfor leften = 0, vert - 1 do\n\t\t\tlocal righten = vert - leften - 1\n\t\t\tfor _, left in pairs(BinaryTrees(leften)) do\n\t\t\t\tfor _, right in pairs(BinaryTrees(righten)) do\n\t\t\t\t\ttable.insert(buf, {left, right})\n\t\t\t\tend\n\t\t\tend\n\t\tend\n\t\treturn buf\n\tend\nend\nlocal trees = BinaryTrees(SIZE-1)\nlocal c, opc, oper, str\nlocal max = math.pow(#operations, SIZE-1)\nlocal function op(a,b)\n\topc = opc + 1\n\tlocal i = math.floor(oper/math.pow(#operations, opc-1))%#operations+1\n\treturn '('.. a .. operations[i] .. b ..')'\nend\n\nlocal function EvalTree(tree)\n\tif tree == false then\n\t\tc = c + 1\n\t\treturn input[c-1]\n\telse\n\t\treturn op(EvalTree(tree[1]), EvalTree(tree[2]))\n\tend\nend\n\nlocal function printResult()\n\tfor _, v in ipairs(trees) do\n\t\tfor i = 0, max do\n\t\t\tc, opc, oper = 1, 0, i\n\t\t\tstr = EvalTree(v)\n\t\t\tloadstring('res='..str)()\n\t\t\tif(res == GOAL) then print(str, '=', res) end\n\t\tend\n\tend\nend\n\nlocal uniq = {}\nlocal function permgen (a, n)\n\tif n == 0 then\n\t\tlocal str = table.concat(a)\n\t\tif not uniq[str] then \n\t\t\tprintResult()\n\t\t\tuniq[str] = true\n\t\tend\n\telse\n\t\tfor i = 1, n do\n\t\t\ta[n], a[i] = a[i], a[n]\n\t\t\tpermgen(a, n - 1)\n\t\t\ta[n], a[i] = a[i], a[n]\n\t\tend\n\tend\nend\n\npermgen(input, SIZE)\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_76.txt",
        "content": "$ lua 24game.solve.lua 2389\n(8*(9-(3*2)))\t=\t24\n(8*((9-3)/2))\t=\t24\n((8*(9-3))/2)\t=\t24\n((9-3)*(8/2))\t=\t24\n(((9-3)*8)/2)\t=\t24\n(8*(9-(2*3)))\t=\t24\n(8/(2/(9-3)))\t=\t24\n((8/2)*(9-3))\t=\t24\n((9-3)/(2/8))\t=\t24\n((9-(3*2))*8)\t=\t24\n(((9-3)/2)*8)\t=\t24\n((9-(2*3))*8)\t=\t24\n$ lua 24game.solve.lua 1172\n((1+7)*(2+1))\t=\t24\n((7+1)*(2+1))\t=\t24\n((1+2)*(7+1))\t=\t24\n((2+1)*(7+1))\t=\t24\n((1+2)*(1+7))\t=\t24\n((2+1)*(1+7))\t=\t24\n((1+7)*(1+2))\t=\t24\n((7+1)*(1+2))\t=\t24\n$ lua 24game.solve.lua 123456789 1000\n(2*(3+(4-(5+(6-(7*(8*(9*1))))))))\t=\t1000\n(2*(3+(4-(5+(6-(7*(8*(9/1))))))))\t=\t1000\n(2*(3*(4*(5+(6*(7-(8/(9*1))))))))\t=\t1000\n(2*(3*(4*(5+(6*(7-(8/(9/1))))))))\t=\t1000\n(2*(3+(4-(5+(6-(7*((8*9)*1)))))))\t=\t1000\n(2*(3+(4-(5+(6-(7*((8*9)/1)))))))\t=\t1000\n(2*(3*(4*(5+(6*(7-((8/9)*1)))))))\t=\t1000\n(2*(3*(4*(5+(6*(7-((8/9)/1)))))))\t=\t1000\n.....\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_77.txt",
        "content": "treeR[n_] := Table[o[trees[a], trees[n - a]], {a, 1, n - 1}]\ntreeR[1] := n\ntree[n_] := \n Flatten[treeR[n] //. {o[a_List, b_] :> (o[#, b] & /@ a), \n    o[a_, b_List] :> (o[a, #] & /@ b)}]\ngame24play[val_List] := \n Union[StringReplace[StringTake[ToString[#, InputForm], {10, -2}], \n     \"-1*\" ~~ n_ :> \"-\" <> n] & /@ (HoldForm /@ \n      Select[Union@\n        Flatten[Outer[# /. {o[q_Integer] :> #2[[q]], \n             n[q_] :> #3[[q]]} &, \n          Block[{O = 1, N = 1}, # /. {o :> o[O++], n :> n[N++]}] & /@ \n           tree[4], Tuples[{Plus, Subtract, Times, Divide}, 3], \n          Permutations[Array[v, 4]], 1]], \n       Quiet[(# /. v[q_] :> val[[q]]) == 24] &] /. \n     Table[v[q] -> val[[q]], {q, 4}])]\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_78.txt",
        "content": "{o[n, o[n, o[n, n]]],\n o[n, o[o[n, n], n]],\n o[o[n, n], o[n, n]], \n o[o[n, o[n, n]], n],\n o[o[o[n, n], n], n]}",
        "safe": true
    },
    {
        "filename": "24 game_Solve_79.txt",
        "content": "game24play[RandomInteger[{1, 9}, 4]]\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_8.txt",
        "content": "$ arc 24_game_solve.arg -o 24_game_solve.c\n$ gcc -Wall 24_game_solve.c -o 24_game_solve\n$ ./24_game_solve 1234\n((1+2)+3)*4\n$ ./24_game_solve 9999\n\n$ ./24_game_solve 5678\n((5+7)-8)*6\n$ ./24_game_solve 1127\n(1+2)*(1+7)",
        "safe": true
    },
    {
        "filename": "24 game_Solve_80.txt",
        "content": "{7, 2, 9, 5}\n{-2 - 9 + 7*5}",
        "safe": true
    },
    {
        "filename": "24 game_Solve_81.txt",
        "content": "{7, 5, 6, 2}\n{6*(7 - 5 + 2), (7 - 5)*6*2, 7 + 5 + 6*2}",
        "safe": true
    },
    {
        "filename": "24 game_Solve_82.txt",
        "content": "{7, 6, 7, 7}\n{}",
        "safe": true
    },
    {
        "filename": "24 game_Solve_83.txt",
        "content": "{3, 7, 6, 1}\n{(-3 + 6)*(7 + 1), ((-3 + 7)*6)/1, (-3 + 7)*6*1,\n 6 - 3*(-7 + 1), 6*(-3 + 7*1), 6*(-3 + 7/1),\n 6 + 3*(7 - 1), 6*(7 - 3*1), 6*(7 - 3/1), 7 + 3*6 - 1}",
        "safe": true
    },
    {
        "filename": "24 game_Solve_84.txt",
        "content": "evaluate[HoldForm[op_[l_, r_]]] := op[evaluate[l], evaluate[r]];\nevaluate[x_] := x;\ncombine[l_, r_ /; evaluate[r] != 0] := {HoldForm[Plus[l, r]], \n   HoldForm[Subtract[l, r]], HoldForm[Times[l, r]], \n   HoldForm[Divide[l, r]] };\ncombine[l_, r_] := {HoldForm[Plus[l, r]], HoldForm[Subtract[l, r]], \n   HoldForm[Times[l, r]]};\nsplit[items_] := \n  Table[{items[[1 ;; i]], items[[i + 1 ;; Length[items]]]}, {i, 1, \n    Length[items] - 1}];\nexpressions[{x_}] := {x};\nexpressions[items_] := \n  Flatten[Table[\n    Flatten[Table[\n      combine[l, r], {l, expressions[sp[[1]]]}, {r, \n       expressions[sp[[2]]]}], 2], {sp, split[items]}]];\n\n(* Must use all atoms in given order. *) \nsolveMaintainOrder[goal_, items_] := \n  Select[expressions[items], (evaluate[#] == goal) &];\n(* Must use all atoms, but can permute them. *)\nsolveCanPermute[goal_, items_] := \n  Flatten[Table[\n    solveMaintainOrder[goal, pitems], {pitems, \n     Permutations[items]}]];\n(* Can use any subset of atoms. *)\nsolveSubsets[goal_, items_] := \n  Flatten[Table[\n    solveCanPermute[goal, is], {is, \n     Subsets[items, {1, Length[items]}]}], 2];\n\n(* Demonstration to find all the ways to create 1/5 from {2, 3, 4, 5}. *) \nsolveMaintainOrder[1/5, Range[2, 5]]\nsolveCanPermute[1/5, Range[2, 5]]\nsolveSubsets[1/5, Range[2, 5]]\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_85.txt",
        "content": "import algorithm, sequtils, strformat\n\ntype\n  Operation = enum\n    opAdd = \"+\"\n    opSub = \"-\"\n    opMul = \"*\"\n    opDiv = \"/\"\n\nconst Ops = @[opAdd, opSub, opMul, opDiv]\n\nfunc opr(o: Operation, a, b: float): float =\n  case o\n  of opAdd: a + b\n  of opSub: a - b\n  of opMul: a * b\n  of opDiv: a / b\n\nfunc solve(nums: array[4, int]): string =\n  func `~=`(a, b: float): bool =\n    abs(a - b) <= 1e-5\n\n  result = \"not found\"\n  let sortedNums = nums.sorted.mapIt float it\n  for i in product Ops.repeat 3:\n    let (x, y, z) = (i[0], i[1], i[2])\n    var nums = sortedNums\n    while true:\n      let (a, b, c, d) = (nums[0], nums[1], nums[2], nums[3])\n      if x.opr(y.opr(a, b), z.opr(c, d)) ~= 24.0:\n        return fmt\"({a:0} {y} {b:0}) {x} ({c:0} {z} {d:0})\"\n      if x.opr(a, y.opr(b, z.opr(c, d))) ~= 24.0:\n        return fmt\"{a:0} {x} ({b:0} {y} ({c:0} {z} {d:0}))\"\n      if x.opr(y.opr(z.opr(c, d), b), a) ~= 24.0:\n        return fmt\"(({c:0} {z} {d:0}) {y} {b:0}) {x} {a:0}\"\n      if x.opr(y.opr(b, z.opr(c, d)), a) ~= 24.0:\n        return fmt\"({b:0} {y} ({c:0} {z} {d:0})) {x} {a:0}\"\n      if not nextPermutation(nums): break\n\nproc main() =\n  for nums in [\n               [9, 4, 4, 5],\n               [1, 7, 2, 7],\n               [5, 7, 5, 4],\n               [1, 4, 6, 6],\n               [2, 3, 7, 3],\n               [8, 7, 9, 7],\n               [1, 6, 2, 6],\n               [7, 9, 4, 1],\n               [6, 4, 2, 2],\n               [5, 7, 9, 7],\n               [3, 3, 8, 8], # Difficult case requiring precise division\n              ]:\n    echo fmt\"solve({nums}) -> {solve(nums)}\"\n\nwhen isMainModule: main()\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_86.txt",
        "content": "solve([9, 4, 4, 5]) -> not found\nsolve([1, 7, 2, 7]) -> ((7 * 7) - 1) / 2\nsolve([5, 7, 5, 4]) -> 4 * (7 - (5 / 5))\nsolve([1, 4, 6, 6]) -> 6 - (6 * (1 - 4))\nsolve([2, 3, 7, 3]) -> (7 - 3) * (2 * 3)\nsolve([8, 7, 9, 7]) -> not found\nsolve([1, 6, 2, 6]) -> (6 - 2) / (1 / 6)\nsolve([7, 9, 4, 1]) -> (1 - 9) * (4 - 7)\nsolve([6, 4, 2, 2]) -> 2 * (4 / (2 / 6))\nsolve([5, 7, 9, 7]) -> (5 + 7) * (9 - 7)\nsolve([3, 3, 8, 8]) -> 8 / (3 - (8 / 3))\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_87.txt",
        "content": "type expression =\n  | Const of float\n  | Sum  of expression * expression   (* e1 + e2 *)\n  | Diff of expression * expression   (* e1 - e2 *)\n  | Prod of expression * expression   (* e1 * e2 *)\n  | Quot of expression * expression   (* e1 / e2 *)\n \nlet rec eval = function\n  | Const c -> c\n  | Sum (f, g) -> eval f +. eval g\n  | Diff(f, g) -> eval f -. eval g\n  | Prod(f, g) -> eval f *. eval g\n  | Quot(f, g) -> eval f /. eval g\n\nlet print_expr expr =\n  let open_paren prec op_prec =\n    if prec > op_prec then print_string \"(\" in\n  let close_paren prec op_prec =\n    if prec > op_prec then print_string \")\" in\n  let rec print prec = function   (* prec is the current precedence *)\n    | Const c -> Printf.printf \"%g\" c\n    | Sum(f, g) ->\n        open_paren prec 0;\n        print 0 f; print_string \" + \"; print 0 g;\n        close_paren prec 0\n    | Diff(f, g) ->\n        open_paren prec 0;\n        print 0 f; print_string \" - \"; print 1 g;\n        close_paren prec 0\n    | Prod(f, g) ->\n        open_paren prec 2;\n        print 2 f; print_string \" * \"; print 2 g;\n        close_paren prec 2\n    | Quot(f, g) ->\n        open_paren prec 2;\n        print 2 f; print_string \" / \"; print 3 g;\n        close_paren prec 2\n  in\n  print 0 expr\n\nlet rec insert v = function\n  | [] -> [[v]]\n  | x::xs as li -> (v::li) :: (List.map (fun y -> x::y) (insert v xs))\n \nlet permutations li = \n  List.fold_right (fun x z -> List.concat (List.map (insert x) z)) li [[]]\n\nlet rec comp expr = function\n  | x::xs ->\n      comp (Sum (expr, x)) xs;\n      comp (Diff(expr, x)) xs;\n      comp (Prod(expr, x)) xs;\n      comp (Quot(expr, x)) xs;\n  | [] ->\n      if (eval expr) = 24.0\n      then (print_expr expr; print_newline())\n;;\n\nlet () =\n  Random.self_init();\n  let digits = Array.init 4 (fun _ -> 1 + Random.int 9) in\n  print_string \"Input digits: \";\n  Array.iter (Printf.printf \" %d\") digits; print_newline();\n  let digits = Array.to_list(Array.map float_of_int digits) in\n  let digits = List.map (fun v -> Const v) digits in\n  let all = permutations digits in\n  List.iter (function\n    | x::xs -> comp x xs\n    | [] -> assert false\n  ) all\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_88.txt",
        "content": "Input digits: 5 7 4 1\n7 * 4 - 5 + 1\n7 * 4 + 1 - 5\n4 * 7 - 5 + 1\n4 * 7 + 1 - 5\n(5 - 1) * 7 - 4\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_89.txt",
        "content": "# Fischer-Krause ordered permutation generator\n# http://faq.perl.org/perlfaq4.html#How_do_I_permute_N_e\nsub permute :prototype(&@) {\n\t\tmy $code = shift;\n\t\tmy @idx = 0..$#_;\n\t\twhile ( $code->(@_[@idx]) ) {\n\t\t\tmy $p = $#idx;\n\t\t\t--$p while $idx[$p-1] > $idx[$p];\n\t\t\tmy $q = $p or return;\n\t\t\tpush @idx, reverse splice @idx, $p;\n\t\t\t++$q while $idx[$p-1] > $idx[$q];\n\t\t\t@idx[$p-1,$q]=@idx[$q,$p-1];\n\t\t}\n\t}\n\n@formats = (\n\t'((%d %s %d) %s %d) %s %d',\n\t'(%d %s (%d %s %d)) %s %d',\n\t'(%d %s %d) %s (%d %s %d)',\n\t'%d %s ((%d %s %d) %s %d)',\n\t'%d %s (%d %s (%d %s %d))',\n\t);\n\n# generate all possible combinations of operators\n@op = qw( + - * / );\n@operators = map{ $a=$_; map{ $b=$_; map{ \"$a $b $_\" }@op }@op }@op;\n\nwhile(1)\n{\n\tprint \"Enter four integers or 'q' to exit: \";\n\tchomp($ent = <>);\n\tlast if $ent eq 'q';\n\n\t\n\tif($ent !~ /^[1-9] [1-9] [1-9] [1-9]$/){ print \"invalid input\\n\"; next }\n\n\t@n = split / /,$ent;\n\tpermute { push @numbers,join ' ',@_ }@n;\n\n\tfor $format (@formats)\n\t{\n\t\tfor(@numbers)\n\t\t{\n\t\t\t@n = split;\n\t\t\tfor(@operators)\n\t\t\t{\n\t\t\t\t@o = split;\n\t\t\t\t$str = sprintf $format,$n[0],$o[0],$n[1],$o[1],$n[2],$o[2],$n[3];\n\t\t\t\t$r = eval($str);\n\t\t\t\tprint \"$str\\n\" if $r == 24;\n\t\t\t}\n\t\t}\n\t}\n}\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_9.txt",
        "content": "/* ARM assembly Raspberry PI  */\n/*  program game24Solver.s   */ \n\n/* REMARK 1\u00a0: this program use routines in a include file \n   see task Include a file language arm assembly \n   for the routine affichageMess conversion10 \n   see at end of this program the instruction include */\n/* for constantes see task include a file in arm assembly */\n/************************************/\n/* Constantes                       */\n/************************************/\n.include \"../constantes.inc\"\n.equ STDIN,      0       @ Linux input console\n.equ READ,       3       @ Linux syscall\n.equ NBDIGITS,   4       @ digits number\n.equ TOTAL,      24\n.equ BUFFERSIZE, 80\n\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nszMessRules:        .ascii \"24 Game\\n\"\n                    .ascii \"The program will display four randomly-generated \\n\"\n                    .asciz \"single-digit numbers and search a solution for a total to 24\\n\\n\"\n\nszMessDigits:       .asciz \"The four digits are @ @ @ @ and the score is 24. \\n\"\nszMessOK:           .asciz \"Solution\u00a0: \\n\"\nszMessNotOK:        .asciz \"No solution for this problem\u00a0!! \\n\"\nszMessNewGame:      .asciz \"New game (y/n)\u00a0? \\n\"\nszCarriageReturn:   .asciz \"\\n\"\n.align 4\niGraine:            .int 123456\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\n.align 4\nsZoneConv:        .skip 24\nsBuffer:          .skip BUFFERSIZE\niTabDigit:        .skip 4 * NBDIGITS @ digits table\niTabOperand1:     .skip 4 * NBDIGITS @ operand 1 table \niTabOperand2:     .skip 4 * NBDIGITS @ operand 2 table\niTabOperation:    .skip 4 * NBDIGITS @ operator table\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                 @ entry of program \n    \n    ldr r0,iAdrszMessRules            @ display rules\n    bl affichageMess\n1:\n    mov r3,#0\n    ldr r12,iAdriTabDigit\n    ldr r5,iAdrszMessDigits\n2:                                    @ loop generate random digits \n    mov r0,#8\n    bl genereraleas \n    add r0,r0,#1\n    str r0,[r12,r3,lsl #2]            @ store in table\n    ldr r1,iAdrsZoneConv\n    bl conversion10                   @ call decimal conversion\n    mov r2,#0\n    strb r2,[r1,r0]                   @ reduce size display area with z\u00e9ro final\n    mov r0,r5\n    ldr r1,iAdrsZoneConv              @ insert conversion in message\n    bl strInsertAtCharInc\n    mov r5,r0\n    add r3,r3,#1\n    cmp r3,#NBDIGITS                  @ end\u00a0?\n    blt 2b                            @ no -> loop\n    mov r0,r5\n    bl affichageMess\n    \n    mov r0,#0                         @ start leval\n    mov r1,r12                        @ address digits table\n    bl searchSoluce\n    cmp r0,#-1                        @ solution\u00a0?\n    bne 3f                            @ no \n    ldr r0,iAdrszMessOK\n    bl affichageMess\n    bl writeSoluce                    @ yes -> write solution in buffer \n    ldr r0,iAdrsBuffer                @ and display buffer\n    bl affichageMess\n    b 10f\n3:                                    @ display message no solution\n    ldr r0,iAdrszMessNotOK\n    bl affichageMess\n\n\n10:                                   @ display new game\u00a0?\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess\n    ldr r0,iAdrszMessNewGame\n    bl affichageMess\n    bl saisie\n    cmp r0,#'y'\n    beq 1b\n    cmp r0,#'Y'\n    beq 1b\n    \n100:                                  @ standard end of the program \n    mov r0, #0                        @ return code\n    mov r7, #EXIT                     @ request to exit program\n    svc #0                            @ perform the system call\n \niAdrszCarriageReturn:     .int szCarriageReturn\niAdrszMessRules:          .int szMessRules\niAdrszMessDigits:         .int szMessDigits\niAdrszMessNotOK:          .int szMessNotOK\niAdrszMessOK:             .int szMessOK\niAdrszMessNewGame:        .int szMessNewGame\niAdrsZoneConv:            .int sZoneConv\niAdriTabDigit:            .int iTabDigit\n/******************************************************************/\n/*            recherche solution                                       */ \n/******************************************************************/\n/* r0 level   */\n/* r1 table value address */\n/* r0 return -1 if ok     */\nsearchSoluce:\n    push {r1-r12,lr}                @ save registers\n    sub sp,#4* NBDIGITS             @ reserve size new digits table\n    mov fp,sp                       @ frame pointer = address stack\n    mov r10,r1                      @ save table\n    add r9,r0,#1                    @ new  level\n    rsb r3,r9,#NBDIGITS             @ last element digits table\n    ldr r4,[r1,r3,lsl #2]           @ load last element\n    cmp r4,#TOTAL                   @ equal to total to search\u00a0?\n    bne 0f                          @ no\n    cmp r9,#NBDIGITS                @ all digits are used\u00a0?\n    bne 0f                          @ no\n    mov r0,#-1                      @ yes -> it is ok -> end\n    b 100f\n0:\n    mov r5,#0                       @ indice loop 1\n1:                                  @ begin loop 1\n    cmp r5,r3\n    bge 9f\n    ldr r4,[r10,r5,lsl #2]          @ load first operand\n    ldr r8,iAdriTabOperand1\n    str r4,[r8,r9,lsl #2]           @ and store in operand1 table\n    add r6,r5,#1                    @ indice loop 2\n2:                                  @ begin loop 2\n    cmp r6,r3\n    bgt 8f\n    ldr r12,[r10,r6,lsl #2]         @ load second operand\n    ldr r8,iAdriTabOperand2\n    str r12,[r8,r9,lsl #2]          @ and store in operand2 table\n    mov r7,#0   @ k\n    mov r8,#0   @ n\n3:  \n    cmp r7,r5\n    beq 4f\n    cmp r7,r6\n    beq 4f\n    ldr r0,[r10,r7,lsl #2]          @ copy other digits in new table on stack\n    str r0,[fp,r8,lsl #2]\n    add r8,r8,#1\n4:\n    add r7,r7,#1\n    cmp r7,r3\n    ble 3b\n\n    add r7,r4,r12                   @ addition test\n    str r7,[fp,r8,lsl #2]           @ store result of addition\n    mov r7,#'+'\n    ldr r0,iAdriTabOperation\n    str r7,[r0,r9,lsl #2]           @ store operator\n    mov r0,r9                       @ pass new level\n    mov r1,fp                       @ pass new table address on stack\n    bl searchSoluce\n    cmp r0,#0\n    blt 100f\n                                    @ soustraction test\n    cmp r4,r12\n    subgt r7,r4,r12\n    suble r7,r12,r4\n    str r7,[fp,r8,lsl #2]\n    mov r7,#'-'\n    ldr r0,iAdriTabOperation\n    str r7,[r0,r9,lsl #2]\n    mov r0,r9\n    mov r1,fp\n    bl searchSoluce\n    cmp r0,#0\n    blt 100f\n    \n    mul r7,r4,r12                    @ multiplication test\n    str r7,[fp,r8,lsl #2]\n    mov r7,#'*'\n    //vidregtit mult\n    ldr r0,iAdriTabOperation\n    str r7,[r0,r9,lsl #2]\n    mov r0,r9\n    mov r1,fp\n    bl searchSoluce\n    cmp r0,#0\n    blt 100f\n5:                                    @ division test\n    push {r1-r3}\n    mov r0,r4\n    mov r1,r12\n    bl division\n   // mov r7,r9\n    cmp r3,#0\n    bne 6f\n    str r2,[fp,r8,lsl #2]\n    mov r7,#'/'\n    ldr r0,iAdriTabOperation\n    str r7,[r0,r9,lsl #2]\n    mov r0,r9\n    mov r1,fp\n    bl searchSoluce\n    b 7f\n6:\n    mov r0,r12\n    mov r1,r4\n    bl division\n    cmp r3,#0\n    bne 7f\n    str r2,[fp,r8,lsl #2]\n    mov r7,#'/'\n    ldr r0,iAdriTabOperation\n    str r7,[r0,r9,lsl #2]\n    mov r0,r9\n    mov r1,fp\n    bl searchSoluce\n7:\n    pop {r1-r3}\n    cmp r0,#0\n    blt 100f\n    \n    add r6,r6,#1                      @ increment indice loop 2\n    b 2b\n\n8:\n    add r5,r5,#1                      @ increment indice loop 1\n    b 1b\n9:\n    \n100:\n    add sp,#4* NBDIGITS               @ stack alignement\n    pop {r1-r12,lr}\n    bx lr                             @ return \niAdriTabOperand1:         .int iTabOperand1\niAdriTabOperand2:         .int iTabOperand2\niAdriTabOperation:        .int iTabOperation\n/******************************************************************/\n/*            write solution                                      */ \n/******************************************************************/\nwriteSoluce:\n    push {r1-r12,lr}            @ save registers\n    ldr r6,iAdriTabOperand1\n    ldr r7,iAdriTabOperand2\n    ldr r8,iAdriTabOperation\n    ldr r10,iAdrsBuffer\n    mov r4,#0                    @ buffer indice\n    mov r9,#1\n1:\n    ldr r5,[r6,r9,lsl #2]       @ operand 1\n    ldr r11,[r7,r9,lsl #2]       @ operand  2\n    ldr r12,[r8,r9,lsl #2]       @ operator\n    cmp r12,#'-'\n    beq 2f\n    cmp r12,#'/'\n    beq 2f\n    b 3f\n2:                               @ if division or soustraction\n    cmp r5,r11                   @ reverse operand if operand 1 is < operand 2\n    movlt r2,r5\n    movlt r5,r11\n    movlt r11,r2\n3:                               @ conversion operand 1 = r0\n    mov r0,r5\n    mov r1,#10\n    bl division\n    cmp r2,#0\n    addne r2,r2,#0x30\n    strneb r2,[r10,r4]\n    addne r4,r4,#1\n    add r3,r3,#0x30\n    strb r3,[r10,r4]\n    add r4,r4,#1\n    ldr r2,[r7,r9,lsl #2]\n\n    strb r12,[r10,r4]           @ operator\n    add r4,r4,#1\n    \n    mov r0,r11                  @ conversion operand  2\n    mov r1,#10\n    bl division\n    cmp r2,#0\n    addne r2,r2,#0x30\n    strneb r2,[r10,r4]\n    addne r4,r4,#1\n    add r3,r3,#0x30\n    strb r3,[r10,r4]\n    add r4,r4,#1\n    \n    mov r0,#'='\n    str r0,[r10,r4]             @ conversion sous total\n    add r4,r4,#1\n    cmp r12,#'+'\n    addeq r0,r5,r11\n    cmp r12,#'-'\n    subeq r0,r5,r11\n    cmp r12,#'*'\n    muleq r0,r5,r11\n    cmp r12,#'/'\n    udiveq r0,r5,r11\n\n    mov r1,#10\n    bl division\n    cmp r2,#0\n    addne r2,r2,#0x30\n    strneb r2,[r10,r4]\n    addne r4,r4,#1\n    add r3,r3,#0x30\n    strb r3,[r10,r4]\n    add r4,r4,#1\n    mov r0,#'\\n'\n    str r0,[r10,r4]\n    add r4,r4,#1\n    \n    add r9,#1\n    cmp r9,#NBDIGITS\n    blt 1b\n    mov r1,#0\n    strb r1,[r10,r4]            @ store 0 final\n    \n100:\n    pop {r1-r12,lr}\n    bx lr                       @ return \niAdrsBuffer:         .int sBuffer\n\n/******************************************************************/\n/*            string entry                                       */ \n/******************************************************************/\n/* r0 return the first character of human entry */\nsaisie:\n    push {r1-r7,lr}        @ save registers\n    mov r0,#STDIN          @ Linux input console\n    ldr r1,iAdrsBuffer     @ buffer address \n    mov r2,#BUFFERSIZE     @ buffer size \n    mov r7,#READ           @ request to read datas\n    svc 0                  @ call system\n    ldr r1,iAdrsBuffer     @ buffer address \n    ldrb r0,[r1]           @ load first character\n100:\n    pop {r1-r7,lr}\n    bx lr                   @ return \n/***************************************************/\n/*   Generation random number                  */\n/***************************************************/\n/* r0 contains limit  */\ngenereraleas:\n    push {r1-r4,lr}         @ save registers \n    ldr r4,iAdriGraine\n    ldr r2,[r4]\n    ldr r3,iNbDep1\n    mul r2,r3,r2\n    ldr r3,iNbDep2\n    add r2,r2,r3\n    str r2,[r4]             @ maj de la graine pour l appel suivant \n    cmp r0,#0\n    beq 100f\n    add r1,r0,#1            @ divisor\n    mov r0,r2               @ dividende\n    bl division\n    mov r0,r3               @ r\u00e9sult = remainder\n  \n100:                        @ end function\n    pop {r1-r4,lr}          @ restaur registers\n    bx lr                   @ return\n/*****************************************************/\niAdriGraine: .int iGraine\niNbDep1:     .int 0x343FD\niNbDep2:     .int 0x269EC3 \n/***************************************************/\n/*      ROUTINES INCLUDE                           */\n/***************************************************/\n.include \"../affichage.inc\"",
        "safe": true
    },
    {
        "filename": "24 game_Solve_90.txt",
        "content": "E:\\Temp>24solve.pl\nEnter four integers or 'q' to exit: 1 3 3 8\n((1 + 8) * 3) - 3\n((1 + 8) * 3) - 3\n((8 + 1) * 3) - 3\n((8 - 1) * 3) + 3\n((8 + 1) * 3) - 3\n((8 - 1) * 3) + 3\n(3 * (1 + 8)) - 3\n(3 * (8 + 1)) - 3\n(3 * (8 - 1)) + 3\n(3 * (1 + 8)) - 3\n(3 * (8 + 1)) - 3\n(3 * (8 - 1)) + 3\n3 - ((1 - 8) * 3)\n3 + ((8 - 1) * 3)\n3 - ((1 - 8) * 3)\n3 + ((8 - 1) * 3)\n3 - (3 * (1 - 8))\n3 + (3 * (8 - 1))\n3 - (3 * (1 - 8))\n3 + (3 * (8 - 1))\nEnter four integers or 'q' to exit: q\n\nE:\\Temp>",
        "safe": true
    },
    {
        "filename": "24 game_Solve_91.txt",
        "content": "-- demo\\rosetta\\24_game_solve.exw\nwith javascript_semantics\n-- The following 5 parse expressions are possible.\n-- Obviously numbers 1234 represent 24 permutations from \n--  {1,2,3,4} to {4,3,2,1} of indexes to the real numbers.\n-- Likewise \"+-*\" is like \"123\" representing 64 combinations\n--  from {1,1,1} to {4,4,4} of indexes to \"+-*/\".\n-- Both will be replaced if/when the strings get printed.\n-- Last hint is because of no precedence, just parenthesis.\n--\nconstant OPS = \"+-*/\"\nconstant expressions = {\"1+(2-(3*4))\",\n                        \"1+((2-3)*4)\",\n                        \"(1+2)-(3*4)\",\n                        \"(1+(2-3))*4\",\n                        \"((1+2)-3)*4\"}  -- (equivalent to \"1+2-3*4\")\n\n-- The above represented as three sequential operations (the result gets \n--  left in <(map)1>, ie vars[perms[operations[i][3][1]]] aka vars[lhs]):\nconstant operations = {{{3,'*',4},{2,'-',3},{1,'+',2}}, --3*=4; 2-=3; 1+=2\n                       {{2,'-',3},{2,'*',4},{1,'+',2}}, --2-=3; 2*=4; 1+=2\n                       {{1,'+',2},{3,'*',4},{1,'-',3}}, --1+=2; 3*=4; 1-=3\n                       {{2,'-',3},{1,'+',2},{1,'*',4}}, --2-=3; 1+=2; 1*=4\n                       {{1,'+',2},{1,'-',3},{1,'*',4}}} --1+=2; 1-=3; 1*=4\n\nfunction evalopset(sequence opset, perms, ops, vars)\n-- invoked 5*24*64 = 7680 times, to try all possible expressions/vars/operators\n-- (btw, vars is copy-on-write, like all parameters not explicitly returned, so\n--       we can safely re-use it without clobbering the callee version.)\n-- (update: with js made that illegal and reported it correctly and forced the\n--          addition of the deep_copy(), all exactly the way it should.)\n    integer lhs,op,rhs\n    vars = deep_copy(vars)\n    for i=1 to length(opset) do\n        {lhs,op,rhs} = opset[i]\n        lhs = perms[lhs]\n        op = ops[find(op,OPS)]\n        rhs = perms[rhs]\n        if op='+' then\n            vars[lhs] += vars[rhs]\n        elsif op='-' then\n            vars[lhs] -= vars[rhs]\n        elsif op='*' then\n            vars[lhs] *= vars[rhs]\n        elsif op='/' then\n            if vars[rhs]=0 then return 1e300*1e300 end if\n            vars[lhs] /= vars[rhs]\n        end if\n    end for\n    return vars[lhs]\nend function\n\ninteger nSolutions\nsequence xSolutions\n\nprocedure success(string expr, sequence perms, ops, vars, atom r)\n    for i=1 to length(expr) do\n        integer ch = expr[i]\n        if ch>='1' and ch<='9' then\n            expr[i] = vars[perms[ch-'0']]+'0'\n        else\n            ch = find(ch,OPS)\n            if ch then\n                expr[i] = ops[ch]\n            end if\n        end if\n    end for\n    if not find(expr,xSolutions) then\n        -- avoid duplicates for eg {1,1,2,7} because this has found\n        -- the \"same\" solution but with the 1st and 2nd 1s swapped,\n        -- and likewise whenever an operator is used more than once.\n        printf(1,\"success: %s = %s\\n\",{expr,sprint(r)})\n        nSolutions += 1\n        xSolutions = append(xSolutions,expr)\n    end if\nend procedure\n\nprocedure tryperms(sequence perms, ops, vars)\n    for i=1 to length(operations) do\n        -- 5 parse expressions\n        atom r = evalopset(operations[i], perms, ops, vars)\n        r = round(r,1e9) -- fudge tricky 8/(3-(8/3)) case\n        if r=24 then\n            success(expressions[i], perms, ops, vars, r)\n        end if\n    end for\nend procedure\n\nprocedure tryops(sequence ops, vars)\n    for p=1 to factorial(4) do\n        -- 24 var permutations\n        tryperms(permute(p,{1,2,3,4}),ops, vars)\n    end for\nend procedure\n\nglobal procedure solve24(sequence vars)\n    nSolutions = 0\n    xSolutions = {}\n    for op1=1 to 4 do\n        for op2=1 to 4 do\n            for op3=1 to 4 do\n                -- 64 operator combinations\n                tryops({OPS[op1],OPS[op2],OPS[op3]},vars)\n            end for\n        end for\n    end for\n\n    printf(1,\"\\n%d solutions\\n\",{nSolutions})\nend procedure\n\nsolve24({1,1,2,7})\n--solve24({6,4,6,1})\n--solve24({3,3,8,8})\n--solve24({6,9,7,4})\n{} = wait_key()\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_92.txt",
        "content": "success: (1+2)*(7+1) = 24\nsuccess: (1+7)*(1+2) = 24\nsuccess: (1+2)*(1+7) = 24\nsuccess: (2+1)*(7+1) = 24\nsuccess: (7+1)*(1+2) = 24\nsuccess: (2+1)*(1+7) = 24\nsuccess: (1+7)*(2+1) = 24\nsuccess: (7+1)*(2+1) = 24\n\n8 solutions\n",
        "safe": true
    },
    {
        "filename": "24 game_Solve_93.txt",
        "content": "main =>\n    foreach (_ in 1..10)\n        Nums = [D\u00a0: _ in 1..4, D = random() mod 9 + 1],\n        NumExps = [(D,D)\u00a0: D in Nums],\n        println(Nums),\n        (solve(NumExps) -> true; println(\"No solution\")),\n        nl\n    end.\n\nsolve([(Num,Exp)]), Num =:= 24 =>\n    println(Exp).\nsolve(NumExps) =>\n    select((Num1,Exp1),NumExps,NumExps1),\n    select((Num2,Exp2),NumExps1,NumExps2),\n    member(Op, ['+','-','*','/']),\n    (Op == '/' -> Num2 =\\= 0; true),\n    Num3 = apply(Op,Num1,Num2),\n    Exp3 =.. [Op,Exp1,Exp2],\n    solve([(Num3,Exp3)|NumExps2]).",
        "safe": true
    },
    {
        "filename": "24 game_Solve_94.txt",
        "content": "import util.\n\nmain =>\n  Target=24,\n  Nums = [5,6,7,8],\n  \n  All=findall(Expr, solve_num(Nums,Target,Expr)),  \n  foreach(Expr in All) println(Expr.flatten()) end,\n  println(len=All.length),\n  nl.\n\n% A string based approach, inspired by - among others - the Raku solution.\nsolve_num(Nums, Target,Expr) => \n   Patterns = [\n               \"A X B Y C Z D\",\n               \"(A X B) Y C Z D\",\n               \"(A X B Y C) Z D\",\n               \"((A X B) Y C) Z D\",\n               \"(A X B) Y (C Z D)\",\n               \"A X (B Y C Z D)\",\n               \"A X (B Y (C Z D))\"\n               ],\n   permutation(Nums,[A,B,C,D]),\n   Syms = [+,-,*,/],\n   member(X ,Syms),\n   member(Y ,Syms),\n   member(Z ,Syms),\n   member(Pattern,Patterns),\n   Expr = replace_all(Pattern, \n                     \"ABCDXYZ\",\n                     [A,B,C,D,X,Y,Z]),\n   catch(Target =:= Expr.eval(), E, ignore(E)).\n\neval(Expr) = parse_term(Expr.flatten()).apply().\n\nignore(_E) => fail.\u00a0% ignore zero_divisor errors\n\n% Replace all occurrences in S with From -> To.\nreplace_all(S,From,To) = Res =>\n   R = S,\n   foreach({F,T} in zip(From,To))\n     R\u00a0:= replace(R, F,T.to_string())\n   end,\n   Res = R.",
        "safe": true
    },
    {
        "filename": "24 game_Solve_95.txt",
        "content": "Picat> main\n\n(5 + 7 - 8) * 6\n((5 + 7) - 8) * 6\n(5 + 7) * (8 - 6)\n(5 - 8 + 7) * 6\n((5 - 8) + 7) * 6\n6 * (5 + 7 - 8)\n6 * (5 + (7 - 8))\n6 * (5 - 8 + 7)\n6 * (5 - (8 - 7))\n6 * (7 + 5 - 8)\n6 * (7 + (5 - 8))\n6 * (7 - 8 + 5)\n6 * (7 - (8 - 5))\n(6 * 8) / (7 - 5)\n6 * (8 / (7 - 5))\n(7 + 5 - 8) * 6\n((7 + 5) - 8) * 6\n(7 + 5) * (8 - 6)\n(7 - 8 + 5) * 6\n((7 - 8) + 5) * 6\n(8 - 6) * (5 + 7)\n(8 - 6) * (7 + 5)\n(8 * 6) / (7 - 5)\n8 * (6 / (7 - 5))\nlen = 24",
        "safe": true
    },
    {
        "filename": "24 game_Solve_96.txt",
        "content": "import util.\n\nmain =>\n  Target=24,\n  Nums = [5,6,7,8],\n  _ = findall(Expr, solve_num2(Nums,Target)),\n  nl.\n\nsolve_num2(Nums, Target) =>\n    Syms = [+,-,*,/],\n    Perms = permutations([I.to_string()\u00a0: I in Nums]),\n    Seen = new_map(),\u00a0% weed out duplicates\n    foreach(X in Syms,Y in Syms, Z in Syms)\n       foreach(P in Perms) \n         [A,B,C,D] = P,\n         if catch(check(A,X,B,Y,C,Z,D,Target,Expr),E,ignore(E)), \n            not Seen.has_key(Expr) then\n              println(Expr.flatten()=Expr.eval().round()),\n              Seen.put(Expr,1)\n         end\n      end\n   end.\n\nto_string2(Expr) = [E.to_string()\u00a0: E in Expr].flatten().\n\nignore(_E) => fail.\u00a0% ignore zero_divisor errors\n\ncheck(A,X,B,Y,C,Z,D,Target,Expr)\u00a0?=> \n   Expr = [\"(\",A,Y,B,\")\",X,\"(\",C,Z,D,\")\"].to_string2(),\n   Target =:= Expr.eval().\n\ncheck(A,X,B,Y,C,Z,D,Target,Expr)\u00a0?=> \n   Expr = [A,X,\"(\",B,Y,\"(\",C,Z,D,\")\",\")\"].to_string2(),\n   Target =:= Expr.eval().\n\ncheck(A,X,B,Y,C,Z,D,Target,Expr)\u00a0?=> \n   Expr = [\"(\",\"(\",C,Z,D,\")\",Y,B,\")\",X,A].to_string2(),\n   Target =:= Expr.eval().\n\ncheck(A,X,B,Y,C,Z,D,Target,Expr)\u00a0?=> \n   Expr = [\"(\",B,Y,\"(\",C,Z,D,\")\",\")\",X,A].to_string2(),\n   Target =:= Expr.eval().\n\ncheck(A,X,B,Y,C,Z,D,Target,Expr) => \n   Expr = [A,X,\"(\",\"(\",B,Y,C,\")\", Z,D,\")\"].to_string2(),\n   Target =:= Expr.eval().",
        "safe": true
    },
    {
        "filename": "24 game_Solve_97.txt",
        "content": "> main \n6*(5+(7-8)) = 24\n6*(7+(5-8)) = 24\n(5+7)*(8-6) = 24\n(7+5)*(8-6) = 24\n6*((7-8)+5) = 24\n6*((5-8)+7) = 24\n((5+7)-8)*6 = 24\n((7+5)-8)*6 = 24\n(8-6)*(5+7) = 24\n(8-6)*(7+5) = 24\n6*(7-(8-5)) = 24\n6*(5-(8-7)) = 24\n6*(8/(7-5)) = 24\n8*(6/(7-5)) = 24\n6/((7-5)/8) = 24\n8/((7-5)/6) = 24\n(6*8)/(7-5) = 24\n(8*6)/(7-5) = 24",
        "safe": true
    },
    {
        "filename": "24 game_Solve_98.txt",
        "content": "(be play24 (@Lst @Expr)                # Define Pilog rule\n   (permute @Lst (@A @B @C @D))\n   (member @Op1 (+ - * /))\n   (member @Op2 (+ - * /))\n   (member @Op3 (+ - * /))\n   (or\n      ((equal @Expr (@Op1 (@Op2 @A @B) (@Op3 @C @D))))\n      ((equal @Expr (@Op1 @A (@Op2 @B (@Op3 @C @D))))) )\n   (^ @ (= 24 (catch '(\"Div/0\") (eval (-> @Expr))))) )\n\n(de play24 (A B C D)                   # Define PicoLisp function\n   (pilog\n      (quote\n         @L (list A B C D)\n         (play24 @L @X) )\n      (println @X) ) )\n\n(play24 5 6 7 8)                       # Call 'play24' function",
        "safe": true
    },
    {
        "filename": "24 game_Solve_99.txt",
        "content": "(* (+ 5 7) (- 8 6))\n(* 6 (+ 5 (- 7 8)))\n(* 6 (- 5 (- 8 7)))\n(* 6 (- 5 (/ 8 7)))\n(* 6 (+ 7 (- 5 8)))\n(* 6 (- 7 (- 8 5)))\n(* 6 (/ 8 (- 7 5)))\n(/ (* 6 8) (- 7 5))\n(* (+ 7 5) (- 8 6))\n(* (- 8 6) (+ 5 7))\n(* (- 8 6) (+ 7 5))\n(* 8 (/ 6 (- 7 5)))\n(/ (* 8 6) (- 7 5))",
        "safe": true
    },
    {
        "filename": "24_game_1.txt",
        "content": "T Error\n   String message\n   F (message)\n      .message = message\n\nT RPNParse\n   [Float] stk\n   [Int] digits\n\n   F op(f)\n      I .stk.len < 2\n         X.throw Error(\u2018Improperly written expression\u2019)\n      V b = .stk.pop()\n      V a = .stk.pop()\n      .stk.append(f(a, b))\n\n   F parse(s)\n      L(c) s\n         I c C \u20180\u2019..\u20189\u2019\n            .stk.append(Float(c))\n            .digits.append(Int(c))\n         E I c == \u2018+\u2019 {.op((a, b) -> a + b)}\n         E I c == \u2018-\u2019 {.op((a, b) -> a - b)}\n         E I c == \u2018*\u2019 {.op((a, b) -> a * b)}\n         E I c == \u2018/\u2019 {.op((a, b) -> a / b)}\n         E I c\u00a0!= \u2018 \u2019\n            X.throw Error(\u2018Wrong char: \u2019c)\n\n   F get_result()\n      I .stk.len\u00a0!= 1\n         X.throw Error(\u2018Improperly written expression\u2019)\n      R .stk.last\n\n[Int] digits\nprint(\u2018Make 24 with the digits:\u2019, end' \u2018\u2019)\nL 4\n   V n = random:(1..9)\n   print(\u2018 \u2019n, end' \u2018\u2019)\n   digits.append(n)\nprint()\n\nV parser = RPNParse()\n\nX.try\n   parser.parse(input())\n   V r = parser.get_result()\n\n   I sorted(digits)\u00a0!= sorted(parser.digits)\n      print(\u2018Error: Not using the given digits\u2019)\n   E\n      print(\u2018Result: \u2019r)\n\n      I r C 23.999<.<24.001\n         print(\u2018Good job!\u2019)\n      E\n         print(\u2018Try again.\u2019)\n\nX.catch Error error\n   print(\u2018Error: \u2019error.message)",
        "safe": true
    },
    {
        "filename": "24_game_10.txt",
        "content": " 0 BH =  PEEK (104):BL =  PEEK (103)\n 1  GOSUB 1200: CALL  - 868\n 10  LET N$ = \"\"\n 20 R =  RND ( - ( PEEK (78) +  PEEK (79) * 256)): REM RANDOMIZE \n 30  FOR I = 1 TO 4\n 40      LET N$ = N$ +  STR$ ( INT ( RND (1) * 9) + 1)\n 50  NEXT I\n 60  PRINT \" PRESS A KEY TO CONTINUE. \";: GET A$\n 65  LET I$ = \"\": LET F$ = \"\": LET P$ = \"\"\n 70  HOME \n 80  PRINT M$M$ SPC( 16)\"24 GAME\"\n 90  PRINT M$\"ALLOWED CHARACTERS:\"M$\n 100  LET I$ = N$ + \"+-*/()\"\n 110  HTAB 20\n 120  FOR I = 1 TO 10\n 130      PRINT  MID$ (I$,I,1)\" \";\n 140  NEXT I\n 150  PRINT M$ TAB( 7)\"0 TO END\"M$\n 160  INPUT \"ENTER THE FORMULA: \";F$\n 170  IF F$ = \"0\" THEN  END\u00a0: GOTO 65\n 180  PRINT M$ TAB( 7)F$\" = \";\n 190  FOR I = 1 TO  LEN (F$)\n 200      LET C$ =  MID$ (F$,I,1)\n 210      IF C$ = \" \" THEN  LET F$ =  MID$ (F$,1,I - 1) +  MID$ (F$,I + 1): GOTO 250\n 220      IF C$ = \"+\" OR C$ = \"-\" OR C$ = \"*\" OR C$ = \"/\" THEN  LET P$ = P$ + \"O\": GOTO 250\n 230      IF C$ = \"(\" OR C$ = \")\" THEN  LET P$ = P$ + C$: GOTO 250\n 240      LET P$ = P$ + \"N\"\n 250  NEXT I\n 260  RESTORE \n 270  FOR I = 1 TO 11\n 280      READ T$\n 290      IF T$ = P$ THEN  LET I = 11\n 300  NEXT I\n 310  IF T$ <  > P$ THEN  INVERSE\u00a0: PRINT \"BAD CONSTRUCTION!\"G$M$: NORMAL\u00a0: GOTO 60\n 320  FOR I = 1 TO  LEN (F$)\n 330      FOR J = 1 TO 10\n 340      IF ( MID$ (F$,I,1) =  MID$ (I$,J,1)) AND  MID$ (F$,I,1) > \"0\" AND  MID$ (F$,I,1) <  = \"9\" THEN  LET I$ =  MID$ (I$,1,J - 1) + \" \" +  MID$ (I$,J + 1, LEN (I$))\n 350  NEXT J,I\n 370  IF  MID$ (I$,1,4) <  > \"    \" THEN  INVERSE\u00a0: PRINT \"INVALID ARGUMENTS!\"G$M$: NORMAL\u00a0: GOTO 60\n 380  GOSUB 600: REM LET R = VAL(F$)\n 390  PRINT R\" \";\n 400  IF R <  > 24 THEN  INVERSE\u00a0: PRINT \"WRONG!\"G$M$: NORMAL\u00a0: GOTO 60\n 410  INVERSE\u00a0: PRINT \"CORRECT!\"M$: NORMAL\u00a0: GOTO 10\n 420  DATA\"NONONON\"\n 430  DATA\"(NON)ONON\"\n 440  DATA\"NONO(NON)\"\n 450  DATA\"NO(NO(NON))\"\n 460  DATA\"((NON)ON)ON\"\n 470  DATA\"NO(NON)ON\"\n 480  DATA\"(NON)O(NON)\"\n 485  DATA\"NO((NON)ON)\"\n 490  DATA\"(NONON)ON\"\n 495  DATA\"(NO(NON))ON\"\n 500  DATA\"NO(NONON)\"\n 600  REMGET BASIC TO EVALUATE OUR EXPRESSION\n 605 A$ = \"R=\" + F$: GOSUB 1440\n 610  FOR I = 1 TO  LEN (A$)\n 615      REMSIMPLE TOKEN TRANSLATION\n 620     B =  ASC ( MID$ (A$,I,1))\n 625      IF (B > 41 AND B < 48) OR B = 61 OR B = 94 THEN B = T(B)\n 630      POKE (AD + I - 1),B\n 635  NEXT \n 640  GOSUB 2000\n 645  REM  GOSUB 1440:REM UNCOMMENT TO CLEAR EVALUATION LINE AFTER USE\n 650  RETURN \n 1200 M$ =  CHR$ (13)\n 1210 G$ =  CHR$ (7)\n 1220  HOME \n 1230  PRINT  SPC( 16)\"24 GAME\"\n 1240  PRINT M$\" THE GOAL OF THIS GAME IS TO FORMULATE\"\n 1250  PRINT M$\" AN ARITHMETIC EXPRESSION THAT\"\n 1260  PRINT M$\" EVALUATES TO A VALUE OF 24, HOWEVER\"\n 1270  PRINT M$\" YOU MAY USE ONLY THE FOUR NUMBERS\"\n 1280  PRINT M$\" GIVEN AT RANDOM BY THE COMPUTER AND\"\n 1290  PRINT M$\" THE STANDARD ARITHMETIC OPERATIONS OF\"\n 1300  PRINT M$\" ADD, SUBTRACT, MULTIPLY, AND DIVIDE.\"\n 1310  PRINT M$\" EACH DIGIT MUST BE USED BY ITSELF. \"\n 1320  PRINT M$\" (E.G. IF GIVEN 1, 2, 3, 4, YOU CANNOT\"\n 1330  PRINT M$\" COMBINE 1 AND 2 TO MAKE 12.)\"\n 1340  PRINT M$\n 1350  PRINT \"INITIALIZING...\";\n 1360  HTAB 1\n 1400  DIM T(94)\n 1401 T( ASC (\"+\")) = 200: REM $C8\n 1402 T( ASC (\"-\")) = 201: REM $C9\n 1403 T( ASC (\"*\")) = 202: REM $CA\n 1404 T( ASC (\"/\")) = 203: REM $CB\n 1405 T( ASC (\"=\")) = 208: REM $D0\n 1406 T( ASC (\"^\")) = 204: REM $CC\n 1409  REMLOCATE LINE 2005 IN RAM\n 1410 LH = BH:LL = BL:NH = 0:NL = 0\n 1415 AD = LH * 256 + LL\n 1420 LH =  PEEK (AD + 1):LL =  PEEK (AD)\n 1425 NL =  PEEK (AD + 2):NH =  PEEK (AD + 3):N = NH * 256 + NL\n 1430  IF N <  > 2005 THEN  GOTO 1415\n 1435 AD = AD + 4: RETURN \n 1440  FOR J = AD TO AD + 12: POKE J, ASC (\":\"): NEXT \n 1445  RETURN \n 2000  REMPUT 13 COLONS ON THE NEXT LINE\n 2005\u00a0:::::::::::::\n 2010  RETURN",
        "safe": true
    },
    {
        "filename": "24_game_100.txt",
        "content": "  function twentyfour()\n  N = 4;\n  n = ceil(rand(1,N)*9);\n  printf('Generate a equation with the numbers %i, %i, %i, %i and +, -, *, /, () operators\u00a0! \\n',n);\n  s = input(': ','s');\n  t = s;\n  for k = 1:N,\n    [x,t] = strtok(t,'+-*/() \\t');\n     if length(x)~=1,\n       error('invalid sign %s\\n',x);\n     end; \n     y = x-'0';\n     if ~(0 < y & y < 10) \n       error('invalid sign %s\\n',x);\n     end;\n     z(1,k) = y;  \t\n  end; \n  if any(sort(z)-sort(n)) \n    error('numbers do not match.\\n');\t\n  end; \n\n  val =  eval(s);\n  if val==24,\n    fprintf('expression \"%s\" results in %i.\\n',s,val);\t\n  else\n    fprintf('expression \"%s\" does not result in 24 but %i.\\n',s,val);\n  end;\n",
        "safe": true
    },
    {
        "filename": "24_game_101.txt",
        "content": "evalAddSub = function()\n    result = evalMultDiv\n    while true\n        if not tokens then return result\n        op = tokens[0]\n        if op != \"+\" and op != \"-\" then return result\n        tokens.pull  // (discard operator)\n        rhs = evalMultDiv\n        if result == null or rhs == null then return null\n        if op == \"+\" then result = result + rhs\n        if op == \"-\" then result = result - rhs\n    end while\nend function\n\nevalMultDiv = function()\n    result = evalAtom\n    while true\n        if not tokens then return result\n        op = tokens[0]\n        if op != \"*\" and op != \"/\" then return result\n        tokens.pull  // (discard operator)\n        rhs = evalAtom\n        if result == null or rhs == null then return null\n        if op == \"*\" then result = result * rhs\n        if op == \"/\" then result = result / rhs\n    end while\nend function\n    \nevalAtom = function()\n    if tokens[0] == \"(\" then\n        tokens.pull\n        result = evalAddSub\n        if not tokens or tokens.pull != \")\" then\n            print \"Unbalanced parantheses\"\n            return null\n        end if\n        return result\n    end if\n    num = val(tokens.pull)\n    idx = availableDigits.indexOf(num)\n    if idx == null then\n        print str(num) + \" is not available\"\n        return null\n    else\n        availableDigits.remove idx\n    end if\n    return num\nend function\n\nchoices = []\nfor i in range(1, 4)\n    choices.push ceil(rnd*9)\nend for\nresult = null\nwhile result != 24\n    availableDigits = choices[:]  // (clones the list)\n    print \"Using only the digits \" + availableDigits + \",\"\n    tokens = input(\"enter an expression that comes to 24: \").replace(\" \",\"\").values\n    result = evalAddSub\n    if availableDigits then\n        print \"You forgot to use: \" + availableDigits\n        result = null\n    end if\n    if result != null then print \"That equals \" + result + \".\"\nend while\nprint \"Great job!\"\n",
        "safe": true
    },
    {
        "filename": "24_game_102.txt",
        "content": "Using only the digits [5, 5, 2, 7],\nenter an expression that comes to 24:\n(7+5)*2\nYou forgot to use: [5]\nUsing only the digits [5, 5, 2, 7],\nenter an expression that comes to 24:\n5*7-5*2\nThat equals 25.\nUsing only the digits [5, 5, 2, 7],\nenter an expression that comes to 24:\n5+5+7*2\nThat equals 24.\nGreat job!",
        "safe": true
    },
    {
        "filename": "24_game_103.txt",
        "content": "alias 24 {\n  dialog -m 24-Game 24-Game\n}\n\ndialog 24-Game {\n  title \"24-Game\"\n  size -1 -1 100 70\n  option dbu\n  text \"\", 1, 29 7 42 8\n  text \"Equation\", 2, 20 21 21 8\n  edit \"\", 3, 45 20 40 10\n  text \"Status\", 4, 10 34 80 8, center\n  button \"Calculate\", 5, 5 45 40 20\n  button \"New\", 6, 57 47 35 15\n}\n\non *:DIALOG:24-Game:init:*: {\n  did -o 24-Game 1 1 Numbers: $rand(1,9) $rand(1,9) $rand(1,9) $rand(1,9)\n}\n\non *:DIALOG:24-Game:sclick:*: {\n  if ($did == 5) {\n    if ($regex($did(3),/^[ (]*\\d *[-+*/][ (]*\\d[ ()]*[-+*/][ ()]*\\d[ )]*[-+*/] *\\d[ )]*$/)) && ($sorttok($regsubex($did(3),/[^\\d]+/g,$chr(32)),32) == $sorttok($remove($did(1),Numbers:),32)) {\n      did -o 24-Game 4 1 $iif($calc($did(3)) == 24,Correct,Wrong)\n    }\n    else {\n      did -o 24-Game 4 1 Wrong Numbers or Syntax\n    }\n  }\n  elseif ($did == 6) {\n    did -o 24-Game 1 1 Numbers: $rand(1,9) $rand(1,9) $rand(1,9) $rand(1,9)\n  }\n}",
        "safe": true
    },
    {
        "filename": "24_game_104.txt",
        "content": "MODULE TwentyFour;\n\nFROM\tInOut\t\t\tIMPORT WriteString, WriteLn, Write, ReadString, WriteInt;\nFROM\tRandomGenerator IMPORT Random;\n\nTYPE\toperator_t \t\t= (add, sub, mul, div);\n\t\texpr_t\t\t\t= RECORD\n\t\t\t\t\t\t\toperand\t\t: ARRAY[0..3] OF CARDINAL;\n\t\t\t\t\t  \t\toperator \t: ARRAY[1..3] OF operator_t;\n\t\t\t\t\t\t  END;(*of RECORD*)\n\t\tnumbers_t\t\t= SET OF CHAR;\n\nVAR\t\texpr \t: expr_t;\n\t\tnumbers\t: numbers_t;\n(*******************************************************************createExpr*)\n(*analyse the input string                                                    *)\nPROCEDURE createExpr(s: ARRAY OF CHAR);\n\nVAR index, counter\t: INTEGER;\n\ttoken \t\t\t: CHAR;\n\ttemp_expr \t\t: expr_t;\n\toperand   \t\t: CARDINAL;\n\toperator\t\t: operator_t;\n\t\n\t(************************************nextToken*)\n\t(* returns the next CHAR that isn`t a space    *)\n\tPROCEDURE nextToken(): CHAR;\n\tBEGIN\n\t\tINC(index);\n\t\tWHILE (s[index] = ' ') DO\n\t\t\tINC(index);\n\t\tEND;(*of WHILE*)\n\t\tRETURN(s[index]);\n\tEND nextToken;\n\t(***********************************set_operand*)\n\t(* checks if the CHAR o inerhits a valid number*)\n\t(* and sets 'operand' to its value             *)\t\n\tPROCEDURE set_operand(o: CHAR);\n\tBEGIN\n\t\tCASE o OF\n\t\t\t'0'..'9':\tIF o IN numbers THEN\n\t\t\t\t\t\t\toperand := ORD(o)-48;\n\t\t\t\t\t\t\tnumbers := numbers - numbers_t{o};\n\t\t\t\t\t\tELSE\n\t\t\t\t\t\t\tWriteString(\"ERROR: '\");\n\t\t\t\t\t\t\tWrite(\t\t\t\t\to);\n\t\t\t\t\t\t\tWriteString(\t\t\t\t\"' isn`t a available number \");\n\t\t\t\t\t\t\tWriteLn;\n\t\t\t\t\t\t\tHALT;\n\t\t\t\t\t\tEND;(*of IF*)|\n\t\t\t0  : WriteString(\"ERROR: error in input \");\n\t\t\t\t\tWriteLn;\n\t\t\t\t\tHALT;\n\t\t\tELSE\n\t\t\t\tWriteString(\"ERROR: '\");\n\t\t\t\tWrite(\t\t\t\t\to);\n\t\t\t\tWriteString(\t\t\t\t\"' isn`t a number \");\n\t\t\t\tWriteLn;\n\t\t\t\tHALT;\n\t\tEND;(*of CASE*)\n\tEND set_operand;\n\t(**********************************set_operator*)\n\t(* checks if the CHAR o inerhits a valid       *)\n\t(* operator and sets 'operator' to its value   *)\n\tPROCEDURE set_operator(o: CHAR);\n\tBEGIN\n\t\tCASE o OF\n\t\t\t'+' : operator := add;|\n\t\t\t'-' : operator := sub;|\n\t\t\t'*' : operator := mul;|\n\t\t\t'/' : operator := div;|\n\t\t\t0  : WriteString(\"ERROR: error in input \");\n\t\t\t\t\tWriteLn;\n\t\t\t\t\tHALT;\n\t\tELSE\n\t\t\tWriteString(\"ERROR: '\");\n\t\t\t\tWrite(\t\t\t\t\to);\n\t\t\t\tWriteString(\t\t\t\t\"' isn`t a operator \");\n\t\t\t\tWriteLn;\n\t\t\t\tHALT;\n\t\tEND;(*of CASE*)\n\tEND set_operator;\n\t(************************************************)\nBEGIN\n\tindex := -1;\n\t\n\ttoken := nextToken();\n\tset_operand(token);\n\texpr.operand[0] := operand;\n\t\n\ttoken := nextToken();\n\tset_operator(token);\n\texpr.operator[1] := operator;\n\t\n\t\n\ttoken := nextToken();\n\tset_operand(token);\n\texpr.operand[1] := operand;\n\t\n\ttoken := nextToken();\n\tset_operator(token);\n\texpr.operator[2] := operator;\n\t\n\ttoken := nextToken();\n\tset_operand(token);\n\texpr.operand[2] := operand;\n\t\n\ttoken := nextToken();\n\tset_operator(token);\n\texpr.operator[3] := operator;\n\t\n\ttoken := nextToken();\n\tset_operand(token);\n\texpr.operand[3] := operand;\nEND createExpr;\n\n(*****************************************************************evaluateExpr*)\n(* evaluate the expresion that was createt by 'createExpr'                    *)\n\nPROCEDURE evaluateExpr(VAR num: REAL);\n\nVAR\tindex\t: INTEGER;\nBEGIN\n\tWITH expr DO\n\t\tnum := VAL(REAL,operand[0]);\n\t\tFOR index := 1 TO 3 DO\n\t\t\tCASE operator[index] OF\n\t\t\t\tadd : num := num + VAL(REAL,operand[index]);|\n\t\t\t\tsub : num := num - VAL(REAL,operand[index]);|\n\t\t\t\tmul : num := num * VAL(REAL,operand[index]);|\n\t\t\t\tdiv : num := num / VAL(REAL,operand[index]);\n\t\t\tEND;(*of CASE*)\n\t\tEND;(*of FOR*)\n\tEND;(*of WITH*)\nEND evaluateExpr;\n\n(**************************************************************generateNumbers*)\n(* generates the 4 random numbers ond write them                              *)\nPROCEDURE generateNumbers;\nVAR\tindex,ran : INTEGER;\nBEGIN\n\tnumbers := numbers_t{};\n\tran := Random(0,9);\n\tFOR index := 1 TO 4 DO\n\t\tWHILE (CHR(ran+48) IN numbers )DO\n\t\t\tran := Random(0,9);\n\t\tEND;(*of While*)\n\t\tWrite(CHR(ran+48));\n\t\tWriteLn;\n\t\tnumbers := numbers + numbers_t{CHR(ran+48)}\n\tEND;(*of FOR*)\nEND generateNumbers;\n(****************************************************************Main Programm*)\nVAR\tstr : ARRAY[0..255] OF CHAR;\n\tsum : REAL;\nBEGIN\n\tWriteString(\"Welcome to the 24 game in MODULA-2\");\n\tWriteLn;\n\tWriteString(\"Here are your numbers:\");\n\tWriteLn;\n\tgenerateNumbers;\n\tWriteString(\"Enter your equation(This implementation dosn`t support brackets yet): \");\n\tWriteLn;\n\tReadString(str);\n\tcreateExpr(str);\n\tevaluateExpr(sum);\n\tWriteLn;\n\tWriteString(\"Result:\");\n\tWriteLn;\n\tWriteInt(TRUNC(sum),0);\n\tWriteLn;\n\tCASE (TRUNC(sum) - 24) OF\n\t\t0 : WriteString(\"Perfect!\");|\n\t\t1 : WriteString(\"Almost perfect.\");\n\t\tELSE \n\t\t\tWriteString(\"You loose!\");\n\tEND;(*of CASE*)\n\tWriteLn;\nEND TwentyFour.\n",
        "safe": true
    },
    {
        "filename": "24_game_105.txt",
        "content": "24Game\n\tk number, operator, bracket\n\t; generate 4 random numbers each between 1 & 9\n\t; duplicates allowed!\n\ts n1=$r(9)+1, n2=$r(9)+1, n3=$r(9)+1, n4=$r(9)+1\n\t; save a copy of them so that we can keep restarting\n\t; if the user gets it wrong\n\ts s1=n1,s2=n2,s3=n3,s4=n4\nQuestion\n\ts (numcount,opcount,lbrackcount,rbrackcount)=0\n\t; restart with the random numbers already found\n\ts n1=s1,n2=s2,n3=s3,n4=s4\n\tw\u00a0!,\"Enter an arithmetic expression that evaluates to 24 using (\",\n\tn1,\" \",n2,\" \",n3,\" \",n4,\"): \"\n\tr\u00a0!,expr\n\tq:expr=\"\"\n\t; validate numbers and operators\n\ts error=\"\"\n\tf n=1:1:$l(expr) {\n\t\ts char=$e(expr,n)\n\t\tif char?1n {\n\t\t\ts number($i(numcount))=char\n\t\t\tw\u00a0!\n\t\t\tzw char\n\t\t}\n\t\telseif char?1(1\"*\",1\"/\",1\"+\",1\"-\") {\n\t\t\ts operator($i(opcount))=char\n\t\t}\n\t\telseif char?1\"(\" {\n\t\t\ts bracket($i(lbrackcount))=char\n\t\t}\n\t\telseif char?1\")\" {\n\t\t\ts bracket($i(rbrackcount))=char\n\t\t}\n\t\telse {\n\t\t\ts error=\"That ain't no character I wanted to see\"\n\t\t\tq\n\t\t}\n\t}\n\tif error'=\"\" w error g Question\n\tif numcount'=4 {\n\t\tw \"Does not have 4 numbers, do it again.\"\n\t\tg Question\n\t}\n\ts error=\"\"\n\tf n=1:1:4 {\n\t\tif number(n)=n1 {\n\t\t\ts n1=\"dont use again\" continue\n\t\t}\n\t\tif number(n)=n2 {\n\t\t\ts n2=\"dont use again\" continue\n\t\t}\n\t\tif number(n)=n3 {\n\t\t\ts n3=\"dont use again\" continue\n\t\t}\n\t\tif number(n)=n4 {\n\t\t\ts n4=\"dont use again\" continue\n\t\t}\n\t\ts error=\"Numbers entered do not match all of the randomly generated numbers.\"\n\t\tq\n\t}\n\tif error'=\"\" {\n\t\tw error\n\t\tg Question\n\t}\n\tif opcount'=3 {\n\t\tw \"Does not have 3 operators.\"\n\t\tg Question\n\t}\n\tif lbrackcount'=rbrackcount {\n\t\tw \"brackets must be in pairs.\"\n\t\tg Question\n\t}\n\tx \"s x=\"_expr\n\tif x'=24 {\n\t\tw\u00a0!,\"Answer does not = 24\"\n\t\tg Question\n\t}\n\tw x\n\tq",
        "safe": true
    },
    {
        "filename": "24_game_106.txt",
        "content": "import Nanoquery.Lang\nimport Nanoquery.Util\n\n// a function to get the digits from an arithmetic expression\ndef extract_digits(input)\n\tinput = str(input)\n\tdigits = {}\n\n\tloc = 0\n\tdigit = \"\"\n\twhile (loc < len(input))\n\t\tif input[loc] in \"0123456789\"\n\t\t\tdigit += input[loc]\n\t\telse\n\t\t\tif len(digit) > 0\n\t\t\t\tdigits.append(int(digit))\n\t\t\t\tdigit = \"\"\n\t\t\tend\n\t\tend\n\t\tloc += 1\n\tend\n\t// check if there's a final digit\n\tif len(digit) > 0\n\t\tdigits.append(int(digit))\n\tend\n\n\treturn digits\nend\n\n// a function to duplicate a digit list\ndef dup(list)\n\tnlist = {}\n\t\n\tfor n in list\n\t\tnlist.append(new(Integer, n))\n\tend\n\t\n\treturn nlist\nend\n\n// generate four random digits and output them\nrandom = new(Random)\nrandDigits = {}\nfor i in range(1, 4)\n\trandDigits.append(random.getInt(8) + 1)\nend\nprintln \"Your digits are: \" + randDigits + \"\\n\"\n\n// get expressions from the user until a valid one is found\nwon = false\nwhile !won\n\tprint \"> \"\n\texpr = input()\n\ttempDigits = dup(randDigits)\n\n\t// check for invalid digits in the expression\n\tinvalid = false\n\tdigits = extract_digits(expr)\n\tfor (i = 0) (!invalid and (i < len(digits))) (i += 1)\n\t\tif not digits[i] in tempDigits\n\t\t\tinvalid = true\n\t\t\tprintln \"Invalid digit \" + digits[i]\n\t\telse\n\t\t\ttempDigits.remove(tempDigits)\n\t\tend\n\tend\n\n\t// if there were no invalid digits, check if the expression\n\t// evaluates to 24\n\tif !invalid\n\t\ta = null\n\t\ttry\n\t\t\texec(\"a = \" + expr)\n\t\tcatch\n\t\t\tprintln \"Invalid expression \" + expr\n\t\tend\n\t\tprintln a\n\n\t\tif a = 24\n\t\t\tprintln \"Success!\"\n\t\t\twon = true\n\t\tend\n\tend\nend",
        "safe": true
    },
    {
        "filename": "24_game_107.txt",
        "content": "Your digits are: [2, 5, 4, 6]\n\n> 2*5+(4*6)\n34\n> 2*4+5*6\n38\n> 5*6-(2*4)\n22\n> 5*6-(2+4)\n24\nSuccess!",
        "safe": true
    },
    {
        "filename": "24_game_108.txt",
        "content": "from random import randomize, rand\nfrom strutils import Whitespace\nfrom algorithm import sort\nfrom sequtils import newSeqWith\n\nrandomize()\n \nvar\n  problem = newSeqWith(4, rand(1..9))\n  stack: seq[float]\n  digits: seq[int]\n \necho \"Make 24 with the digits: \", problem\n \ntemplate op(c: untyped) =\n  let a = stack.pop\n  stack.add c(stack.pop, a)\n \nfor c in stdin.readLine:\n  case c\n  of '1'..'9':\n    digits.add c.ord - '0'.ord\n    stack.add float(c.ord - '0'.ord)\n  of '+': op `+`\n  of '*': op `*`\n  of '-': op `-`\n  of '/': op `/`\n  of Whitespace: discard\n  else: raise newException(ValueError, \"Wrong char: \" & c)\n \nsort digits\nsort problem\nif digits != problem:\n  raise newException(ValueError, \"Not using the given digits.\")\nif stack.len != 1:\n  raise newException(ValueError, \"Wrong expression.\")\necho \"Result: \", stack[0]\necho if abs(stack[0] - 24) < 0.001: \"Good job!\" else: \"Try again.\"\n",
        "safe": true
    },
    {
        "filename": "24_game_109.txt",
        "content": "Make 24 with the digits: @[8, 1, 3, 1]\n8 3 * 1 + 1 -\nResult: 24.0\nGood job!",
        "safe": true
    },
    {
        "filename": "24_game_11.txt",
        "content": "use std, array, list\n\ndo\n  generate random digits\n  show random digits\n  let result = parse expression (get input line)\n  if result\u00a0!= ERROR\n    if some digits are unused\n      print \"Wrong\u00a0! (you didn't use all digits)\"\u00a0; failure++\n    else if result == 24.0\n      print \"Correct\u00a0!\"\u00a0; success++\n    else\n      print \"Wrong\u00a0! (you got \"result\")\"\u00a0; failure++\n while play again\u00a0?\nprint \"success:\"success\" failure:\"failure\" total:\"(success+failure) as int\n\nlet success = 0, failure = 0.\n\n.: generate random digits\u00a0:.\n   our nat seed = 0xc6f31 (: default seed when /dev/urandom doesn't exist\u00a0:)\n   let urandom = fopen \"/dev/urandom\" \"r\"\n   if  urandom isn't nil\n     fread &seed size of seed 1 urandom\n     fclose urandom\n   Cfunc srandom seed\n   seed = (Cfunc random) as nat\n   for each (val int d) from 0 to 3\n     digits[d] = '1' + (seed\u00a0% 9)\n     seed /= 9\n\nlet digits be an array of 4 byte\n\n.: show random digits\u00a0:.\n   print \"Enter an expression that equates to 24 using only all these digits:\"\n   printf \"%c , %c , %c , %c\\n\"(digits[0])(digits[1])(digits[2])(digits[3])\n   printf \"24 = \"\n\n.: some digits are unused\u00a0:. -> bool\n   for each (val int d) from 0 to 3\n     return true if digits[d]\u00a0!= '\\0'\n   false\n\n.: get input line\u00a0:. -> text\n   our array of 64 byte line\n   Cfunc fgets (line) (size of line) (stdin)\n   let int i\n   for (i = 0) (line[i]\u00a0!= 0) (i++)\n     line[i] = '\\0' if (line[i] == '\\n')\n   line as text\n\n.: play again\u00a0?\u00a0:. -> bool\n   while true\n     printf \"Play again\u00a0? (y/n) \"\u00a0; Cfunc fflush stdout\n     let answer = get input line\n     switch answer[0]\n       case 'n' {return false}\n       case 'y' {return true }\n       default  {continue    }\n   false\n\n=: ERROR\u00a0:= -> real {-32202.0}\n\n.: parse expression <text expr>\u00a0:. -> real\n   let x = 0.0, x_is_set = false, op = ' '.\n   let stack be a list of State\u00a0; class State {byte op; real x}\n   for (stack = nil) (*expr\u00a0!= 0) (expr++)\n     switch *expr\n       case '+'\u00a0; case '-'\u00a0; case '*'\u00a0; case '/'\n         error \"bad syntax\" if not x_is_set\n\t op = *expr\n       case '1'\u00a0; case '2'\u00a0; case '3'\u00a0; case '4'\u00a0; case '5'\n       case '6'\u00a0; case '7'\u00a0; case '8'\u00a0; case '9'\n\t error \"missing operator\" if (x_is_set and op == ' ')\n\t error \"unavailable digit\" unless consume digit expr[0]\n\t do operation with (expr[0] - '0') as real\n       case (Cgen \"'('\")\n\t error \"missing operator\" if (op == ' ' but x_is_set)\n\t (new list (new State) (code of del State())) << stack\n\t op = ' '\u00a0; x_is_set = false (: start fresh state\u00a0:)\n       case (Cgen \"')'\")\n         error \"mismatched parenthesis\" if stack is nil\n\t error \"wrong syntax\" if not x_is_set\n\t let y = x\n\t x = stack.data.x\u00a0; op = stack.data.op\n\t delete pop stack\n\t do operation with y\n       default {error \"disallowed character\"}\n\n       .:new State         \u00a0:. -> State {let s=new(State); s.x=x; s.op=op; s}\n       .:del State <State s>:.          {               free s              }\n       .:do operation with <real y>:.\n  \t switch op\n\t   case '+' {x += y}\n\t   case '-' {x -= y}\n\t   case '*' {x *= y}\n\t   case '/' {x /= y}\n\t   default  {x  = y; x_is_set = true}\n         op = ' '\n   =:error<text msg>:= ->real {eprint \"Error: \"msg\" at [\"expr\"]\";return ERROR}\n   .:consume digit <byte b>:. -> bool\n     for each (val int d) from 0 to 3\n       if digits[d] == b\n         digits[d] = '\\0'\n       \t return true\n     false\n\n   if stack isn't nil\n     delete all stack\n     error \"unclosed parenthesis\"\n   return x",
        "safe": true
    },
    {
        "filename": "24_game_110.txt",
        "content": "redef class Char\n\tfun is_op: Bool do return \"-+/*\".has(self)\nend\n\n# Get `numbers` and `operands` from string `operation` collect with `gets` in `main` function\n# Fill `numbers` and `operands` array with previous extraction\nfun exportation(operation: String, numbers: Array[Int], operands: Array[Char]) do\n\tvar previous_char: nullable Char = null\n\tvar number: nullable Int = null\n\tvar negative = false\n\n\tfor i in operation.length.times do\n\t\tvar current_char = operation[i]\n\t\tvar current_int = current_char.to_i\n\n\t\tif (previous_char == null or previous_char.is_op) and current_char == '-' then\n\t\t\tnegative = true\n\t\t\tcontinue\n\t\tend\n\n\t\tif current_char.is_digit then\n\t\t\tif number == null then\n\t\t\t\tnumber = current_int\n\t\t\telse\n\t\t\t\tnumber = number * 10 + current_int\n\t\t\tend\n\t\tend\n\n\t\tif negative and (current_char.is_op or i == operation.length - 1) then\n\t\t\tnumber = number - number * 2\n\t\t\tnegative = false\n\t\tend\n\n\t\tif (current_char.is_op or i == operation.length - 1) and number != null then\n\t\t\tnumbers.add(number)\n\t\t\tnumber = null\n\t\tend\n\n\t\tif not negative and current_char.is_op then\n\t\t\toperands.add(current_char)\n\t\tend\n\t\tprevious_char = current_char\n\tend\n\t# Update `numbers` and `operands` array in main function with pointer\nend\n\n# Create random numbers between 1 to 9\nfun random: Array[Int] do\n\treturn [for i in 4.times do 1 + 9.rand]\nend\n\n# Make mathematical operation with `numbers` and `operands` and add the operation result into `random_numbers`\nfun calculation(random_numbers, numbers: Array[Int], operands: Array[Char]) do\n\tvar number = 0\n\tvar temp_numbers = numbers.clone\n\n\twhile temp_numbers.length > 1 do\n\t\tvar operand = operands.shift\n\t\tvar a = temp_numbers.shift\n\t\tvar b = temp_numbers.shift\n\n\t\tif operand == '+' then number = a + b\n\t\tif operand == '-' then number = a - b\n\t\tif operand == '*' then number = a * b\n\t\tif operand == '/' then number = a / b\n\n\t\ttemp_numbers.unshift(number)\n\tend\n\tif number != 0 then random_numbers.add(number)\nend\n\n# Check if used `numbers` exist in the `random_numbers` created\nfun numbers_exists(random_numbers, numbers: Array[Int]): Bool do\n\tfor number in numbers do\n\t\tif not random_numbers.count(number) >= numbers.count(number) then return false\n\tend\n\treturn true\nend\n\n# Remove `numbers` when they are used\nfun remove_numbers(random_numbers, numbers: Array[Int]) do\n\tfor number in numbers do random_numbers.remove(number)\nend\n\n# Check if the mathematical `operation` is valid\nfun check(operation: String): Bool do\n\tvar previous_char: nullable Char = null\n\tvar next_char: nullable Char = null\n\tvar next_1_char: nullable Char = null\n\n\tfor i in operation.length.times do\n\t\tvar current_char = operation[i]\n\n\t\tif i + 1 < operation.length then\n\t\t\tnext_char = operation[i + 1]\n\t\t\tif i + 2 < operation.length then\n\t\t\t\tnext_1_char = operation[i + 2]\n\t\t\telse\n\t\t\t\tnext_1_char = null\n\t\t\tend\n\t\telse\n\t\t\tnext_char = null\n\t\tend\n\n\t\tif not current_char.is_op and not current_char.is_digit then return false\n\t\tif next_char == null and current_char.is_op then return false\n\n\t\tif previous_char == null  then\n\t\t\tif next_char == null or next_1_char == null then return false\n\t\t\tif current_char == '-' and not next_char.is_digit then return false\n\t\t\tif current_char != '-' and not current_char.is_digit then return false\n\t\telse\n\t\t\tif next_char != null then\n\t\t\t\tif previous_char.is_digit and current_char.is_op and\n\t\t\t\tnot (next_char == '-' and next_1_char != null and\n\t\t\t\tnext_1_char.is_digit or next_char.is_digit) then\n\t\t\t\t\treturn false\n\t\t\t\tend\n\t\t\tend\n\t\tend\n\t\tprevious_char = current_char\n\tend\n\treturn true\nend\n\nvar random_numbers = new Array[Int]\nvar operation = \"\"\n\nrandom_numbers = random\nwhile not random_numbers.has(24) and random_numbers.length > 1 do\n\tvar numbers = new Array[Int]\n\tvar operands = new Array[Char]\n\n\tprint \"numbers: \" + random_numbers.join(\", \")\n\toperation = gets\n\tif check(operation) then\n\t\texportation(operation, numbers, operands)\n\t\tif numbers_exists(random_numbers, numbers) then\n\t\t\tcalculation(random_numbers, numbers, operands)\n\t\t\tremove_numbers(random_numbers, numbers)\n\t\telse\n\t\t\tprint \"NUMBERS ERROR!\"\n\t\tend\n\telse\n\t\tprint \"STRING ERROR!\"\n\tend\nend\n\nif random_numbers.has(24) then print \"CONGRATULATIONS\" else print \"YOU LOSE\"\n",
        "safe": true
    },
    {
        "filename": "24_game_111.txt",
        "content": "use Collection.Generic;\nuse System.Matrix;\n\nclass RPNParser {\n  @stk\u00a0: Stack<IntHolder>;\n  @digits\u00a0: List<IntHolder>;\n\n  function\u00a0: Main(args\u00a0: String[]) ~ Nil {\n    digits\u00a0:= List->New()<IntHolder>;\n    \"Make 24 with the digits: \"->Print();\n    for(i\u00a0:= 0; i < 4; i += 1;) {\n      n\u00a0: Int\u00a0:= Int->Random(1, 9);\n        \" {$n}\"->Print();\n        digits->AddBack(n);\n    };\n    '\\n'->Print();\n\n    parser\u00a0:= RPNParser->New();\n    if(parser->Parse(System.IO.Console->ReadString(), digits)) {\n      result\u00a0:= parser->GetResult();\n      if(result = 24) {\n        \"Good job!\"->PrintLine();\n      }\n      else {\n        \"{$result}, Try again.\"->PrintLine();\n      };\n    }\n    else {\n      \"Invalid sequence\"->PrintLine();\n    };\n  }\n\n  New() {\n    @stk\u00a0:= Stack->New()<IntHolder>;\n    @digits\u00a0:= List->New()<IntHolder>;\n  }\n\n  method\u00a0: Op(f\u00a0: \\Func->Calc) ~ Nil {\n    if(@stk->Size() < 2) { \"Improperly written expression\"->ErrorLine(); Runtime->Exit(1); };\n    b\u00a0:= @stk->Pop();\n    a\u00a0:= @stk->Pop();\n    @stk->Push(f(a, b));\n  }\n\n  method\u00a0: Parse(c\u00a0: Char) ~ Nil {\n    if(c >= '0' & c <= '9') {\n      value\u00a0: Int\u00a0:= c - '0';\n      @stk->Push(value);\n      @digits->AddBack(value);\n    }\n    else if(c = '+') {\n      Op(\\Func->Calc\u00a0: (a, b) => a + b);\n    }\n    else if(c = '-') {\n      Op(\\Func->Calc\u00a0: (a, b) => a - b);\n    }\n    else if(c = '*') {\n      Op(\\Func->Calc\u00a0: (a, b) => a * b);\n    }\n    else if(c = '/') {\n      Op(\\Func->Calc\u00a0: (a, b) => { if(b <> 0) { return a / b;  } else { return 0; }; });\n    };\n  }\n\n  method\u00a0: GetResult() ~ Int {\n    if(@stk->Size() = 1) {\n      return @stk->Top();\n    };\n\n    return 0;\n  }\n\n  method\u00a0: Parse(s\u00a0: String, digits\u00a0: List<IntHolder>) ~ Bool {\n    each(i\u00a0: s) {\n      Parse(s->Get(i));\n    };\n\n    @digits->Rewind();    \n    while(@digits->More()) {      \n      left\u00a0:= @digits->Get()->Get();\n      digits->Rewind();\n      found\u00a0:= false;\n      while(digits->More() & found = false) {\n        right\u00a0:= digits->Get()->Get();\n        if(left = right) { \n          digits->Remove(); found\u00a0:= true;  \n        }\n        else { \n          digits->Next(); \n        };\n      };\n      @digits->Next();\n    };\n\n    return digits->IsEmpty();\n  }\n}\n\nalias Func {\n  Calc\u00a0: (IntHolder, IntHolder) ~ IntHolder\n}",
        "safe": true
    },
    {
        "filename": "24_game_112.txt",
        "content": "ocamlopt -pp camlp4o g24.ml -o g24.opt\n",
        "safe": true
    },
    {
        "filename": "24_game_113.txt",
        "content": "type expression =\n  | Const of float\n  | Sum  of expression * expression   (* e1 + e2 *)\n  | Diff of expression * expression   (* e1 - e2 *)\n  | Prod of expression * expression   (* e1 * e2 *)\n  | Quot of expression * expression   (* e1 / e2 *)\n\nlet rec eval = function\n  | Const c -> c\n  | Sum (f, g) -> eval f +. eval g\n  | Diff(f, g) -> eval f -. eval g\n  | Prod(f, g) -> eval f *. eval g\n  | Quot(f, g) -> eval f /. eval g\n\nlet rec extract acc = function\n  | Const c -> (c::acc)\n  | Sum (f, g) -> (extract acc f) @ (extract [] g)\n  | Diff(f, g) -> (extract acc f) @ (extract [] g)\n  | Prod(f, g) -> (extract acc f) @ (extract [] g)\n  | Quot(f, g) -> (extract acc f) @ (extract [] g)\n\nopen Genlex\n\nlet lexer = make_lexer [\"(\"; \")\"; \"+\"; \"-\"; \"*\"; \"/\"]\n\nlet rec parse_expr = parser\n     [< e1 = parse_mult; e = parse_more_adds e1 >] -> e\n and parse_more_adds e1 = parser\n     [< 'Kwd \"+\"; e2 = parse_mult; e = parse_more_adds (Sum(e1, e2)) >] -> e\n   | [< 'Kwd \"-\"; e2 = parse_mult; e = parse_more_adds (Diff(e1, e2)) >] -> e\n   | [< >] -> e1\n and parse_mult = parser\n     [< e1 = parse_simple; e = parse_more_mults e1 >] -> e\n and parse_more_mults e1 = parser\n     [< 'Kwd \"*\"; e2 = parse_simple; e = parse_more_mults (Prod(e1, e2)) >] -> e\n   | [< 'Kwd \"/\"; e2 = parse_simple; e = parse_more_mults (Quot(e1, e2)) >] -> e\n   | [< >] -> e1\n and parse_simple = parser\n   | [< 'Int i >] -> Const(float i)\n   | [< 'Float f >] -> Const f\n   | [< 'Kwd \"(\"; e = parse_expr; 'Kwd \")\" >] -> e\n\n\nlet parse_expression = parser [< e = parse_expr; _ = Stream.empty >] -> e\n\nlet read_expression s = parse_expression(lexer(Stream.of_string s))\n\n\nlet () =\n  Random.self_init();\n  print_endline \"\n  The 24 Game\n\n  Given any four digits in the range 1 to 9, which may have repetitions,\n  Using just the +, -, *, and / operators; and the possible use of\n  brackets, (), show how to make an answer of 24.\n\n  An answer of 'q' will quit the game.\n  An answer of '!' will generate a new set of four digits.\n  Otherwise you are repeatedly asked for an expression until it evaluates to 24\n\n  Note: you cannot form multiple digit numbers from the supplied digits,\n  so an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\\n\";\n\n  let sort = List.sort compare in\n  let digits = ref [] in\n  let digit_set () =\n    let ar = Array.init 4 (fun _ -> 1 + Random.int 9) in\n    digits := Array.to_list(Array.map float_of_int ar);\n    print_string \"The four digits: \";\n    List.iter (Printf.printf \" %g\") !digits;\n    print_newline();\n  in\n\n  digit_set();\n  while true do\n    print_string \"Expression: \";\n    let str = read_line() in\n    if str = \"q\" then exit 0;\n    if str = \"!\" then digit_set()\n    else begin\n      let expr = read_expression str in\n      let res = eval expr in\n      Printf.printf \" = %g\\n%!\" res;\n      if res = 24.\n      && (sort !digits) = (sort (extract [] expr))\n      then (print_endline \"Congratulations!\"; digit_set())\n      else print_endline \"Try again\"\n    end\n  done\n",
        "safe": true
    },
    {
        "filename": "24_game_114.txt",
        "content": "import: mapping\n\n: game\n| l expr w n i |\n   4 #[ 9 rand ] Array init ->l\n \n   System.Out \"Digits\u00a0: \" << l << \" --> RPN Expression for 24\u00a0: \" << drop \n   System.Console accept ->expr\n \n   expr words forEach: w [\n      w \"+\" == ifTrue: [ + continue ]\n      w \"-\" == ifTrue: [ - continue ]\n      w \"*\" == ifTrue: [ * continue ]\n      w \"/\" == ifTrue: [ >float / continue ]\n \n      w >integer dup ->n  ifNull: [ System.Out \"Word \" << w << \" not allowed \" << cr break ]\n      n l indexOf dup ->i ifNull: [ System.Out \"Integer \" << n << \" is wrong \" << cr break ]\n      n l put(i, null)\n      ]\n   #null? l conform? ifFalse: [ \"Sorry, all numbers must be used...\" . return ]\n   24 if=: [ \"You won\u00a0!\" ] else: [ \"You loose...\" ] .\n;",
        "safe": true
    },
    {
        "filename": "24_game_115.txt",
        "content": "DEFINE TEMP-TABLE tt NO-UNDO FIELD ii AS INTEGER.\n\nDEFINE VARIABLE p_deanswer    AS DECIMAL     NO-UNDO.\nDEFINE VARIABLE idigits       AS INTEGER     NO-UNDO EXTENT 4.\nDEFINE VARIABLE ii            AS INTEGER     NO-UNDO.\nDEFINE VARIABLE Digits        AS CHARACTER   NO-UNDO FORMAT \"x(7)\".\nDEFINE VARIABLE Answer        AS CHARACTER   NO-UNDO FORMAT \"x(7)\".\nDEFINE VARIABLE cexpression   AS CHARACTER   NO-UNDO.\nDEFINE VARIABLE cmessage      AS CHARACTER   NO-UNDO.\nDEFINE VARIABLE cchar         AS CHARACTER   NO-UNDO.\n\nFUNCTION calculate RETURNS LOGICAL (\n   i_de AS DECIMAL\n):\n   p_deanswer = i_de.\nEND FUNCTION.\n\n/* generate problem */\nDO ii = 1 TO 4:\n   ASSIGN\n      idigits [ii]   =  RANDOM( 1, 9 ).\n      Digits         =  Digits + STRING( idigits [ii] ) + \" \"\n      .\nEND.\n\n/* ui */\nDISPLAY Digits.\nUPDATE Answer.\n\n/* check valid input */\nDO ii = 1 TO 7:\n   cchar = SUBSTRING( Answer, ii, 1 ).\n   IF cchar > \"\" THEN DO:\n      IF ii MODULO 2 = 1 THEN DO:\n         IF LOOKUP( cchar, Digits, \" \" ) = 0 THEN\n            cmessage = cmessage + SUBSTITUTE( \"Invalid digit: &1.~r\", cchar ).\n         ELSE \n            ENTRY( LOOKUP( cchar, Digits, \" \" ), Digits, \" \" ) = \"\".\n      END.\n      ELSE DO:\n         IF LOOKUP( cchar, \"+,-,/,*\" ) = 0 THEN\n            cmessage = cmessage + SUBSTITUTE( \"&1 is not a valid operator.~r\", cchar ).\n      END.\n   END.\nEND.\nIF TRIM( Digits ) > \"\" THEN\n   cmessage = cmessage + SUBSTITUTE( \"You did not use digits: &1\":U, TRIM( Digits ) ).\n\nIF cmessage = \"\" THEN DO:\n   /* expressions need spacing */\n   DO ii = 1 TO 7:\n      cexpression = cexpression + SUBSTRING( Answer, ii, 1 ) + \" \".\n   END.\n   /* use dynamic query to parse expression */\n   TEMP-TABLE tt:DEFAULT-BUFFER-HANDLE:FIND-FIRST( \n      SUBSTITUTE(\n         \"WHERE NOT DYNAMIC-FUNCTION( 'calculate', DECIMAL( &1 ) )\",\n         cexpression\n      )\n   ) NO-ERROR.\n   IF p_deanswer <> 24 THEN\n      cmessage = cmessage + SUBSTITUTE( \"The expression evaluates to &1.\", p_deanswer ).\n   ELSE \n      cmessage = \"Solved!\".\nEND.\n\nMESSAGE cmessage VIEW-AS ALERT-BOX.\n",
        "safe": true
    },
    {
        "filename": "24_game_116.txt",
        "content": "game()={\n  my(v=vecsort(vector(4,i,random(8)+1)));\n  print(\"Form 24 using */+-() and: \"v);\n  while(1,\n    my(ans=input);\n    if (!valid(s,v), next);\n    trap(,\n      print(\"Arithmetic error\");\n      next\n    ,\n      if(eval(s)==24, break, print(\"Bad sum\"))\n    )\n  );\n  print(\"You win!\")\n};\nvalid(s,v)={\n  my(op=vecsort(Vec(\"+-*/()\")),u=[]);\n  s=Vec(s);\n  for(i=1,#s,\n    if(setsearch(op,s[i]),next);\n    trap(,\n      print(\"Invalid character \"s[i]);\n      return(0)\n    ,\n      if(setsearch(v,eval(s[i])),\n        u=concat(u,eval(s[i]))\n      ,\n        print(s[i]\" not allowed\");\n        return(0)\n      )\n    )\n  );\n  for(i=2,#s,\n    if(!setsearch(op,s[i])&!setsearch(op,s[i-1]),\n      print(\"Concatenating digits is not allowed!\");\n      return(0)\n    )\n  );\n  if(vecsort(u)!=v,\n    print(\"Invalid digits\");\n    0\n  ,\n    1\n  )\n};",
        "safe": true
    },
    {
        "filename": "24_game_117.txt",
        "content": "#!/usr/bin/env perl\nuse warnings;\nuse strict;\nuse feature 'say';\n\nprint <<'EOF';\nThe 24 Game\n\nGiven any four digits in the range 1 to 9, which may have repetitions,\nUsing just the +, -, *, and / operators; and the possible use of\nparentheses, (), show how to make an answer of 24.\n\nAn answer of \"q\" or EOF will quit the game.\nA blank answer will generate a new set of four digits.\nOtherwise you are repeatedly asked for an expression until it evaluates to 24.\n\nNote: you cannot form multiple digit numbers from the supplied digits,\nso an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\nEOF\n\nmy $try = 1;\nwhile (1) {\n  my @digits = map { 1+int(rand(9)) } 1..4;\n  say \"\\nYour four digits: \", join(\" \", @digits);\n  print \"Expression (try \", $try++, \"): \";\n\n  my $entry = <>;\n  if (!defined $entry || $entry eq 'q') \n    { say \"Goodbye.  Sorry you couldn't win.\"; last; }\n  $entry =~ s/\\s+//g;  # remove all white space\n  next if $entry eq '';\n\n  my $given_digits = join \"\", sort @digits;\n  my $entry_digits = join \"\", sort grep { /\\d/ } split(//, $entry);\n  if ($given_digits ne $entry_digits ||  # not correct digits\n      $entry =~ /\\d\\d/ ||                # combined digits\n      $entry =~ m|[-+*/]{2}| ||          # combined operators\n      $entry =~ tr|-0-9()+*/||c)         # Invalid characters\n    { say \"That's not valid\";  next; }\n\n  my $n = eval $entry;\n\n  if    (!defined $n) { say \"Invalid expression\"; }\n  elsif ($n == 24)    { say \"You win!\"; last; }\n  else                { say \"Sorry, your expression is $n, not 24\"; }\n}\n",
        "safe": true
    },
    {
        "filename": "24_game_118.txt",
        "content": "-- Note this uses simple/strict left association, so for example:\n--  1+2*1*8 is ((1+2)*1)*8 not 1+((2*1)*8) [or 1+(2*(1*8))], and\n--  7-(2*2)*8 is (7-(2*2))*8 not 7-((2*2)*8)\n--  Does not allow unary minus on the first digit.\n-- Uses solve24() from the next task, when it can.\n--  (you may want to comment out the last 2 lines/uncomment the if 0, in that file)\n--\n--include 24_game_solve.exw\n \n--with trace\nforward function eval(string equation, sequence unused, integer idx=1)\n-- (the above definition is entirely optional, but good coding style)\n \nconstant errorcodes = {\"digit expected\",                    -- 1\n                       \"')' expected\",                      -- 2\n                       \"digit already used\",                -- 3\n                       \"digit not offered\",                 -- 4\n                       \"operand expected\"}                  -- 5\n \nfunction card(integer idx)  -- (for error handling)\n    if idx=1 then return \"1st\" end if\n    if idx=2 then return \"2nd\" end if\n    -- (assumes expression is less than 21 characters)\n    return sprintf(\"%dth\",idx)\nend function\n \nfunction errorchar(sequence equation, integer idx)\n    if idx>length(equation) then return \"\" end if\n    return sprintf(\"(%s)\",equation[idx])\nend function\n \nsequence rset = repeat(0,4)\n \nprocedure new_rset()\n    for i=1 to length(rset) do\n        rset[i] = rand(9)\n    end for\nend procedure\n \nfunction get_operand(string equation, integer idx, sequence unused)\n    integer error = 1 -- \"digit expected\"\n    atom res\n \n    if idx<=length(equation) then\n        integer ch = equation[idx]\n        if ch='(' then\n            {error,res,unused,idx} = eval(equation,unused,idx+1)\n            if error=0\n            and idx<=length(equation) then\n                ch = equation[idx]\n                if ch=')' then\n                    return {0,res,unused,idx+1}\n                end if\n            end if\n            if error=0 then\n                error = 2   -- \"')' expected\"\n            end if\n        elsif ch>='0' and ch<='9' then\n            res = ch-'0'\n            integer k = find(res,unused)\n            if k!=0 then\n                unused[k..k] = {}\n                return {0,res,unused,idx+1}\n            end if\n            if find(res,rset) then\n                error = 3  -- \"digit already used\"\n            else\n                error = 4  -- \"digit not offered\"\n            end if\n        end if\n    end if\n    return {error,0,unused,idx}\nend function\n \nfunction get_operator(string equation, integer idx)\n    integer error = 5 -- \"operand expected\"\n    if idx<=length(equation) then\n        integer ch = equation[idx]\n        if find(ch,\"+-/*\") then\n            return {0,ch,idx+1}\n        end if\n    end if\n    return {error,0,idx}\nend function\n \nfunction eval(string equation, sequence unused, integer idx=1)\n    atom lhs, rhs\n    integer ch, error\n    {error,lhs,unused,idx} = get_operand(equation,idx,unused)\n    if error=0 then\n        while 1 do\n            {error,ch,idx} = get_operator(equation,idx)\n            if error!=0 then exit end if\n            {error,rhs,unused,idx} = get_operand(equation,idx,unused)\n            if error!=0 then exit end if\n            if    ch='+' then       lhs += rhs\n            elsif ch='-' then       lhs -= rhs\n            elsif ch='/' then       lhs /= rhs\n            elsif ch='*' then       lhs *= rhs\n            else ?9/0 -- (should not happen)\n            end if\n            if idx>length(equation) then\n                return {0,lhs,unused,idx}\n            end if\n            ch = equation[idx]\n            if ch=')' then\n                return {0,lhs,unused,idx}\n            end if\n        end while\n    end if\n    return {error,0,unused,idx}\nend function\n \nfunction strip(string equation)\n    for i=length(equation) to 1 by -1 do\n        if find(equation[i],\" \\t\\r\\n\") then\n            equation[i..i] = \"\"\n        end if\n    end for\n    return equation\nend function\n \nfunction strip0(atom a) -- (for error handling)\n    string res = sprintf(\"%f\",a)\n    for i=length(res) to 2 by -1 do\n        integer ch = res[i]\n        if ch='.' then return res[1..i-1] end if\n        if ch!='0' then return res[1..i] end if\n    end for\n    return res\nend function\n \nprocedure play()\n    sequence unused\n    string equation\n    integer error,idx\n    atom res\n \n    new_rset()\n    printf(1,\"Enter an expression which evaluates to exactly 24\\n\"&\n             \"Use all of, and only, the digits %d, %d, %d, and %d\\n\"&\n             \"You may only use the operators + - * /\\n\"&\n             \"Parentheses and spaces are allowed\\n\",rset)\n    while 1 do\n        equation = strip(gets(0))\n        if upper(equation)=\"Q\" then exit end if\n        if equation=\"?\" then\n            puts(1,\"\\n\")\n            integer r_solve24 = routine_id(\"solve24\") -- see below\n            if r_solve24=-1 then -- (someone copied just this code out?)\n                puts(1,\"no solve24 routine\\n\")\n            else\n                call_proc(r_solve24,{rset})\n            end if\n        else\n            {error,res,unused,idx} = eval(equation, rset)\n            if error!=0 then\n                printf(1,\"  %s on the %s character%s\\n\",{errorcodes[error],card(idx),errorchar(equation,idx)})\n            elsif idx<=length(equation) then\n                printf(1,\"\\neval() returned only having processed %d of %d characters\\n\",{idx,length(equation)})\n            elsif length(unused) then\n                printf(1,\" not all the digits were used\\n\",error)\n            elsif res!=24 then\n                printf(1,\"\\nresult is %s, not 24\\n\",{strip0(res)})\n            else\n                puts(1,\" correct!  Press any key to quit\\n\")\n                {} = wait_key()\n                exit\n            end if\n        end if\n        puts(1,\"enter Q to give up and quit\\n\")\n    end while\nend procedure\n \nplay()\n",
        "safe": true
    },
    {
        "filename": "24_game_119.txt",
        "content": "#!/usr/bin/env php\nThe 24 Game\n \nGiven any four digits in the range 1 to 9, which may have repetitions,\nUsing just the +, -, *, and / operators; and the possible use of\nbrackets, (), show how to make an answer of 24.\n \nAn answer of \"q\" will quit the game.\nAn answer of \"!\" will generate a new set of four digits.\nOtherwise you are repeatedly asked for an expression until it evaluates to 24\n \nNote: you cannot form multiple digit numbers from the supplied digits,\nso an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\n\n<?php\n\nwhile (true) {\n    $numbers = make_numbers();\n\n    for ($iteration_num = 1; ; $iteration_num++) {\n        echo \"Expresion $iteration_num: \";\n\n        $entry = rtrim(fgets(STDIN));\n\n        if ($entry === '!') break;\n        if ($entry === 'q') exit;\n\n        $result = play($numbers, $entry);\n\n        if ($result === null) {\n            echo \"That's not valid\\n\";\n            continue;\n        }\n        elseif ($result != 24) {\n            echo \"Sorry, that's $result\\n\";\n            continue;\n        }\n        else {\n            echo \"That's right! 24!!\\n\";\n            exit;\n        }\n    }\n}\n\nfunction make_numbers() {\n    $numbers = array();\n\n    echo \"Your four digits: \";\n\n    for ($i = 0; $i < 4; $i++) {\n        $number = rand(1, 9);\n        // The check is needed to avoid E_NOTICE from PHP\n        if (!isset($numbers[$number])) {\n            $numbers[$number] = 0;\n        }\n        $numbers[$number]++;\n        print \"$number \";\n    }\n\n    print \"\\n\";\n\n    return $numbers;\n}\n\nfunction play($numbers, $expression) {\n    $operator = true;\n    for ($i = 0, $length = strlen($expression); $i < $length; $i++) {\n        $character = $expression[$i];\n\n        if (in_array($character, array('(', ')', ' ', \"\\t\"))) continue;\n\n        $operator = !$operator;\n\n        if (!$operator) {\n            if (!empty($numbers[$character])) {\n                $numbers[$character]--;\n                continue;\n            }\n            return;\n        }\n        elseif (!in_array($character, array('+', '-', '*', '/'))) {\n            return;\n        }\n    }\n\n    foreach ($numbers as $remaining) {\n        if ($remaining > 0) {\n            return;\n        }\n    }\n    \n    return eval(\"return $expression;\");\n}\n?>\n",
        "safe": true
    },
    {
        "filename": "24_game_12.txt",
        "content": "/* ARM assembly Raspberry PI  */\n/*  program game24.s   */ \n\n/* REMARK 1\u00a0: this program use routines in a include file \n   see task Include a file language arm assembly \n   for the routine affichageMess conversion10 \n   see at end of this program the instruction include */\n/* for constantes see task include a file in arm assembly */\n/************************************/\n/* Constantes                       */\n/************************************/\n.include \"../constantes.inc\"\n.equ STDIN,      0       @ Linux input console\n.equ READ,       3       @ Linux syscall\n.equ NBDIGITS,   4       @ digits number\n.equ TOTAL,      24\n.equ BUFFERSIZE, 100\n.equ STACKSIZE,  10      @ operator and digits number items in stacks\n\n\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nszMessRules:         .ascii \"24 Game\\n\"\n                    .ascii \"The program will display four randomly-generated \\n\"\n                    .ascii \"single-digit numbers and will then prompt you to enter\\n\"\n                    .ascii \"an arithmetic expression followed by <enter> to sum \\n\"\n                    .ascii \"the given numbers to 24.\\n\"\n                    .asciz \"Exemple\u00a0: 9+8+3+4   or (7+5)+(3*4) \\n\\n\"\n\nszMessExpr:         .asciz \"Enter your expression (or type (q)uit to exit or (n) for other digits): \\n\"\n//szMessErrChoise:    .asciz \"invalid choice.\\n \"\nszMessDigits:       .asciz \"The four digits are @ @ @ @ and the score is 24. \\n\"\nszMessNoDigit:      .asciz \"Error\u00a0: One digit is not in digits list\u00a0!! \\n\"\nszMessSameDigit:    .asciz \"Error\u00a0: Two digits are same\u00a0!! \\n\"\nszMessOK:           .asciz \"It is OK. \\n\"\nszMessNotOK:        .asciz \"Error, it is not ok  total = @ \\n\"\nszMessErrOper:      .asciz \"Unknow Operator (+,-,$,/,(,)) \\n\"\nszMessNoparen:      .asciz \"no opening parenthesis\u00a0!! \\n\"\nszMessErrParen:     .asciz \"Error parenthesis number\u00a0!! \\n\"\nszMessNoalldigits:  .asciz \"One or more digits not used\u00a0!!\\n\"\nszMessNewGame:      .asciz \"New game (y/n)\u00a0? \\n\"\nszCarriageReturn:   .asciz \"\\n\"\n.align 4\niGraine:  .int 123456\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\nsZoneConv:        .skip 24\nsBuffer:          .skip BUFFERSIZE\niTabDigit:        .skip 4 * NBDIGITS\niTabTopDigit:     .skip 4 * NBDIGITS\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                 @ entry of program \n    \n    ldr r0,iAdrszMessRules            @ display rules\n    bl affichageMess\n1:\n    mov r3,#0\n    ldr r12,iAdriTabDigit\n    ldr r11,iAdriTabTopDigit\n    ldr r5,iAdrszMessDigits\n2:                                    @ loop generate random digits \n    mov r0,#8\n    bl genereraleas \n    add r0,r0,#1\n    str r0,[r12,r3,lsl #2]            @ store in table\n    mov r1,#0\n    str r1,[r11,r3,lsl #2]            @ raz top table\n    ldr r1,iAdrsZoneConv\n    bl conversion10                   @ call decimal conversion\n    mov r2,#0\n    strb r2,[r1,r0]                   @ reduce size display area with z\u00e9ro final\n    mov r0,r5\n    ldr r1,iAdrsZoneConv              @ insert conversion in message\n    bl strInsertAtCharInc\n    mov r5,r0\n    add r3,r3,#1\n    cmp r3,#NBDIGITS                  @ end\u00a0?\n    blt 2b                            @ no -> loop\n    mov r0,r5\n    bl affichageMess\n3:                                    @ loop human entry\n    ldr r0,iAdrszMessExpr\n    bl affichageMess\n    bl saisie                         @ entry\n    cmp r0,#'q'\n    beq 100f\n    cmp r0,#'Q'\n    beq 100f\n    cmp r0,#'n'\n    beq 1b\n    cmp r0,#'N'\n    beq 1b\n \n    bl evalExpr                      @ expression evaluation\n    cmp r0,#0                        @ ok ?\n    bne 3b                           @ no - > loop\n\n10:                                  @ display new game ?\n    ldr r0,iAdrszCarriageReturn\n    bl affichageMess\n    ldr r0,iAdrszMessNewGame\n    bl affichageMess\n    bl saisie\n    cmp r0,#'y'\n    beq 1b\n    cmp r0,#'Y'\n    beq 1b\n    \n100:                                  @ standard end of the program \n    mov r0, #0                        @ return code\n    mov r7, #EXIT                     @ request to exit program\n    svc #0                            @ perform the system call\n \niAdrszCarriageReturn:     .int szCarriageReturn\niAdrszMessRules:          .int szMessRules\niAdrszMessDigits:         .int szMessDigits\niAdrszMessExpr:           .int szMessExpr\niAdrszMessNewGame:        .int szMessNewGame\niAdrsZoneConv:            .int sZoneConv\niAdriTabDigit:            .int iTabDigit\niAdriTabTopDigit:         .int iTabTopDigit\n/******************************************************************/\n/*            evaluation expression                                       */ \n/******************************************************************/\n/* r0 return 0 if ok -1 else */\nevalExpr:\n    push {r1-r11,lr}           @ save registers\n    \n    mov r0,#0\n    ldr r1,iAdriTabTopDigit\n    mov r2,#0\n1:                             @ loop init table top digits\n    str r0,[r1,r2,lsl #2]\n    add r2,r2,#1\n    cmp r2,#NBDIGITS\n    blt 1b\n    \n    sub sp,sp,#STACKSIZE * 4   @ stack operator\n    mov fp,sp\n    sub sp,sp,#STACKSIZE * 4   @ stack digit\n    mov r1,sp\n    ldr r10,iAdrsBuffer\n    mov r8,#0                  @ indice character in buffer\n    mov r7,#0                  @ indice digits stack\n    mov r2,#0                  @ indice operator stack\n1:                             @ begin loop\n    ldrb r9,[r10,r8]\n    cmp r9,#0xA               @ end expression ?\n    beq 90f\n    cmp r9,#' '               @ space \u00a0?\n    addeq r8,r8,#1             @ loop\n    beq 1b\n    cmp r9,#'('               @ left parenthesis -> store in operator stack\n    streq r9,[fp,r2,lsl #2]\n    addeq r2,r2,#1\n    addeq r8,r8,#1             @ and loop\n    beq 1b\n    cmp r9,#')'               @ right parenthesis\u00a0?\n    bne 3f\n    mov r0,fp                  @ compute operator stack until left parenthesis\n    sub r2,r2,#1\n2:\n    ldr r6,[fp,r2,lsl #2]\n    cmp r6,#'('                @ left parenthesis\n    addeq r8,r8,#1             @ end ?\n    beq 1b                     @ and loop\n    sub r7,r7,#1               @ last digit\n    mov r3,r7\n    bl compute\n    sub r2,r2,#1\n    cmp r2,#0\n    bge 2b\n    ldr r0,iAdrszMessNoparen   @ no left parenthesis in stack\n    bl affichageMess\n    mov r0,#-1\n    b 100f\n3:\n    cmp r9,#'+'               @ addition\n    beq 4f\n    cmp r9,#'-'               @ soustraction\n    beq 4f\n    cmp r9,#'*'               @ multiplication\n    beq 4f\n    cmp r9,#'/'               @ division\n    beq 4f\n\n    b 5f                       @ not operator\n\n4:                             @ control priority and depile stacks\n    mov r0,fp\n    mov r3,r7\n    mov r4,r9\n    bl depileOper\n    mov r7,r3\n    add r8,r8,#1\n    b 1b                       @ and loop \n \n5:                             @  digit\n    sub r9,r9,#0x30\n    mov r0,r9\n    bl digitControl\n    cmp r0,#0                  @ error ?\n    bne 100f\n    str r9,[r1,r7,lsl #2]     @ store digit in digits stack\n    add r7,r7,#1\n\n    add r8,r8,#1\n    beq 1b    \n\n    b 100f\n90:                            @ compute all stack operators\n    mov r0,fp\n    sub r7,r7,#1\n91:\n    subs r2,r2,#1\n    blt 92f\n    mov r3,r7\n    bl compute\n    sub r7,r7,#1\n    b 91b\n92: \n    ldr r0,[r1]                 @ total = first value on digits stack\n    cmp r0,#TOTAL               @ control total \n    beq 93f                     @ ok \n    ldr r1,iAdrsZoneConv\n    bl conversion10             @ call decimal conversion\n    mov r2,#0\n    strb r2,[r1,r0]\n    ldr r0,iAdrszMessNotOK\n    ldr r1,iAdrsZoneConv        @ insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n    mov r0,#-1\n    b 100f\n93:                             @ control use all digits\n    ldr r1,iAdriTabTopDigit\n    mov r2,#0\n94:                             @ begin loop\n    ldr r0,[r1,r2,lsl #2]       @ load top\n    cmp r0,#0            \n    bne 95f\n    ldr r0,iAdrszMessNoalldigits\n    bl affichageMess\n    mov r0,#-1\n    b 100f\n95:\n    add r2,r2,#1\n    cmp r2,#NBDIGITS\n    blt 94b\n96:                             @ display message OK\n    ldr r0,iAdrszMessOK\n    bl affichageMess\n    mov r0,#0\n    b 100f\n    \n100:\n    add sp,sp,#80               @ stack algnement\n    pop {r1-r11,lr}\n    bx lr                       @ return \niAdrszMessNoparen:        .int szMessNoparen\niAdrszMessNotOK:          .int szMessNotOK\niAdrszMessOK:             .int szMessOK\niAdrszMessNoalldigits:    .int szMessNoalldigits\n/******************************************************************/\n/*            depile operator                                     */ \n/******************************************************************/\n/* r0 operator stack address  */\n/* r1 digits stack address */\n/* r2 operator indice */\n/* r3 digits indice */\n/* r4 operator */\n/* r2 return a new operator indice */\n/* r3 return a new digits indice */\ndepileOper:\n    push {r4-r8,lr}        @ save registers\n    cmp r2,#0              @ first operator ?\n    beq 60f\n    sub r5,r2,#1\n1:\n    ldr r6,[r0,r5,lsl #2]  @ load stack operator\n    cmp r6,r4              @ same operators\n    beq 50f\n    cmp r6,#'*'            @ multiplication\n    beq 50f\n    cmp r6,#'/'            @ division\n    beq 50f\n    cmp r6,#'-'            @ soustraction\n    beq 50f\n    \n    b 60f\n50:                        @ depile operators stack and compute\n    sub r2,r2,#1\n    sub r3,r3,#1\n    bl compute\n    sub r5,r5,#1\n    cmp r5,#0\n    bge 1b\n60:\n    str r4,[r0,r2,lsl #2]  @ add operator in stack\n    add r2,r2,#1\n    \n100:\n    pop {r4-r8,lr}\n    bx lr                  @ return \n/******************************************************************/\n/*            compute                                             */ \n/******************************************************************/\n/* r0 operator stack address  */\n/* r1 digits stack address */\n/* r2 operator indice */\n/* r3 digits indice */\ncompute:\n    push {r1-r8,lr}        @ save registers\n    ldr r6,[r1,r3,lsl #2]  @ load second digit\n    sub r5,r3,#1\n    ldr r7,[r1,r5,lsl #2]  @ load first digit\n    \n    ldr r8,[r0,r2,lsl #2]  @ load operator\n    cmp r8,#'+'\n    bne 1f\n    add r7,r7,r6           @ addition\n    str r7,[r1,r5,lsl #2] \n    b 100f\n1:     \n    cmp r8,#'-'\n    bne 2f\n    sub r7,r7,r6           @ soustaction\n    str r7,[r1,r5,lsl #2] \n    b 100f\n2:\n    cmp r8,#'*'\n    bne 3f                 @ multiplication\n    mul r7,r6,r7\n    str r7,[r1,r5,lsl #2] \n    b 100f\n3:\n    cmp r8,#'/'\n    bne 4f\n    udiv r7,r7,r6          @ division\n    str r7,[r1,r5,lsl #2]\n    b 100f\n4:\n    cmp r8,#'('            @ left parenthesis\u00a0?\n    bne 5f\n    ldr r0,iAdrszMessErrParen @  error \n    bl affichageMess\n    mov r0,#-1\n    b 100f\n5:\n    ldr r0,iAdrszMessErrOper\n    bl affichageMess\n    mov r0,#-1\n100:\n    pop {r1-r8,lr}\n    bx lr                   @ return \niAdrszMessErrOper:   .int szMessErrOper\niAdrszMessErrParen:  .int szMessErrParen\n/******************************************************************/\n/*            control digits                                       */ \n/******************************************************************/\n/* r0 return 0 if OK 1 if  not digit   */\ndigitControl:\n    push {r1-r4,lr}        @ save registers\n    ldr r1,iAdriTabTopDigit\n    ldr r2,iAdriTabDigit\n    mov r3,#0\n1:\n    ldr r4,[r2,r3,lsl #2]  @ load digit\n    cmp r0,r4              @ equal ?\n    beq 2f                 @ yes\n    add r3,r3,#1           @ no -> loop\n    cmp r3,#NBDIGITS       @ end\u00a0?\n    blt 1b\n    ldr r0,iAdrszMessNoDigit @ error\n    bl affichageMess\n    mov r0,#1\n    b 100f\n2:                         @ control prev use \n    ldr r4,[r1,r3,lsl #2]\n    cmp r4,#0\n    beq 3f\n    add r3,r3,#1\n    cmp r3,#NBDIGITS\n    blt 1b\n    ldr r0,iAdrszMessSameDigit\n    bl affichageMess\n    mov r0,#1\n    b 100f\n3:\n    mov r4,#1\n    str r4,[r1,r3,lsl #2]\n    mov r0,#0\n100:\n    pop {r1-r4,lr}\n    bx lr                   @ return \niAdrszMessNoDigit:     .int szMessNoDigit\niAdrszMessSameDigit:   .int szMessSameDigit\n/******************************************************************/\n/*            string entry                                       */ \n/******************************************************************/\n/* r0 return the first character of human entry */\nsaisie:\n    push {r1-r7,lr}        @ save registers\n    mov r0,#STDIN          @ Linux input console\n    ldr r1,iAdrsBuffer     @ buffer address \n    mov r2,#BUFFERSIZE     @ buffer size \n    mov r7,#READ           @ request to read datas\n    svc 0                  @ call system\n    ldr r1,iAdrsBuffer     @ buffer address \n    ldrb r0,[r1]           @ load first character\n100:\n    pop {r1-r7,lr}\n    bx lr                   @ return \niAdrsBuffer:         .int sBuffer\n/***************************************************/\n/*   Generation random number                  */\n/***************************************************/\n/* r0 contains limit  */\ngenereraleas:\n    push {r1-r4,lr}         @ save registers \n    ldr r4,iAdriGraine\n    ldr r2,[r4]\n    ldr r3,iNbDep1\n    mul r2,r3,r2\n    ldr r3,iNbDep2\n    add r2,r2,r3\n    str r2,[r4]             @ maj de la graine pour l appel suivant \n    cmp r0,#0\n    beq 100f\n    add r1,r0,#1            @ divisor\n    mov r0,r2               @ dividende\n    bl division\n    mov r0,r3               @ r\u00e9sult = remainder\n  \n100:                        @ end function\n    pop {r1-r4,lr}          @ restaur registers\n    bx lr                   @ return\n/*****************************************************/\niAdriGraine: .int iGraine\niNbDep1:     .int 0x343FD\niNbDep2:     .int 0x269EC3 \n/***************************************************/\n/*      ROUTINES INCLUDE                           */\n/***************************************************/\n.include \"../affichage.inc\"\n",
        "safe": true
    },
    {
        "filename": "24_game_120.txt",
        "content": "import util.\n\nmain =>\n    play.\n\nplay =>\n    nl,\n    Digits = [random() mod 9 + 1\u00a0: _ in 1..4].sort(),\n    println(\"Enter \\\"q\\\" to quit\"),\n    println(\"Enter \\\"!\\\" to request a new set of four digits.\"),\n    printf(\"Or enter expression using %w => \", Digits),\n    Exp = read_line().strip(),\n    evaluate(Digits,Exp).\n\nevaluate(_Digits,\"q\") => halt.\nevaluate(_Digits,\"!\") => play.\nevaluate(Digits,Exp) => \n    Operands = [to_int(D)\u00a0: D in Exp, digit(D)].sort(),\n    (Digits\u00a0!== Operands ->\n        println(\"You must use the given digits:\" ++ to_string(Digits))\n   \u00a0;\n        catch(Term = parse_term(Exp), Exception, println(Exception)),\n        Res is Term,\n        (Res =:= 24 ->\n            println(\"Good work!\")\n       \u00a0;\n            println(\"Wong expression\")\n        )\n    ),\n    play.",
        "safe": true
    },
    {
        "filename": "24_game_121.txt",
        "content": "(load \"@lib/frac.l\")\n\n(de random4digits ()\n   (setq Numbers (make (do 4 (link (rand 1 9)))))\n   Numbers )\n\n(de prompt ()\n   (prinl\n      \"^JPlease enter a 'Lisp' expression (integer or fractional math) that equals 24,^J\"\n      \"using (, ), frac, + or f+, - or f-, * or f*, / or f/, and \" Numbers \"^J\"\n      \"(use each number only once). Enter . to quit.\" ) )\n\n(de getinput ()\n   (setq Expression (catch \u2019NIL (in NIL (read))))\n   Expression )\n\n(de checkexpression (Numbers Expression)\n   (make\n      (when (diff Numbers (fish num? Expression))\n         (link \"Not all numbers used.\") )\n      (when (diff (fish num? Expression) Numbers)\n         (link \"Using wrong number(s).\"))\n      (if (sub? \"f\" (pack Expression))\n         (when (diff (fish sym? Expression) '(frac f+ f- f* f/))\n            (link \"Illegal operator(s). If fractional expression, must use frac, f+, f-, f*, f/ only.\") )\n         (when (diff (fish sym? Expression) '(+ - * /))\n            (link \"Using illegal operator(s).\") ) ) ) )\n\n(de instructions ()\n   (prinl \"Example 'Lisp' expression: (- (* 3 9) (+ 1 2))\")\n   (prinl\n      \"Example 'Lisp' fractional expression:^J\"\n      \"(f- (f* (frac 3 1)(frac 9 1)) (f+ (frac 1 1)(frac 2 1)))\" )\n   (prinl\n      \"Use a fractional expression 'just for fun (as above)' OR if your solution^J\"\n      \"would lose remainder value(s) otherwise (through integer division).\" ) )\n\n(de loopuntilquit ()\n   (instructions)\n   (loop\n      (set 'Numbers (random4digits))\n      (prompt)\n      (set 'Expression (getinput))\n      (if (= Expression \".\") (prog (prinl \"bye!\") (bye)))\n      (set 'Check (checkexpression Numbers Expression))\n      (if (car Check)\n         (mapcar prinl Check)\n         (prog\n            (set 'Evaluated (eval Expression))\n            (if (or (= Evaluated 24) (= Evaluated (24 . 1)))\n               (prinl \"Congratulations!\")\n               (prinl \"That evaluated to \" Evaluated \" Try again!\") ) ) ) ) )\n\n(loopuntilquit)",
        "safe": true
    },
    {
        "filename": "24_game_122.txt",
        "content": "pil 24game.l +\nExample 'Lisp' expression: (+ (* 4 5) (- 1 2))\nExample 'Lisp' fractional expression: (f+ (f* (frac 4 1)(frac 5 1)) (f- (frac 1 1)(frac 2 1)))\nUse a fractional expression if your solution would lose remainder value(s) otherwise.\n\nPlease enter a 'Lisp' expression (regular or fractional math style) that equals 24,\nusing (, ), frac, + or f+, - or f-, * or f*, / or f/, and 1329.\nEnter . to quit.\n(f- (f* (frac 3 1)(frac 9 1)) (f+ (frac 1 1)(frac 2 1)))\nCongratulations!\n\nPlease enter a 'Lisp' expression (regular or fractional math style) that equals 24,\nusing (, ), frac, + or f+, - or f-, * or f*, / or f/, and 3758.\nEnter . to quit.\n(+ (* (- 8 5) 7) 3)\nCongratulations!\n\nPlease enter a 'Lisp' expression (regular or fractional math style) that equals 24,\nusing (, ), frac, + or f+, - or f-, * or f*, / or f/, and 3758.\nEnter . to quit.\n(f- (f* (frac 3 1)(frac 7 1)) (+ (frac 5 1)(frac 8 1))) \nUsing wrong number(s).\nIllegal operator(s). If fractional expression, must use frac, f+, f-, f*, f/ only.\n\nPlease enter a 'Lisp' expression (regular or fractional math style) that equals 24,\nusing (, ), frac, + or f+, - or f-, * or f*, / or f/, and 2713.\nEnter . to quit.\n(^ 2 7 1 3)\nUsing illegal operator(s).\n\nPlease enter a 'Lisp' expression (regular or fractional math style) that equals 24,\nusing (, ), frac, + or f+, - or f-, * or f*, / or f/, and 8367.\nEnter . to quit.\n(+ 8 3 6)\nNot all numbers used.\n\nPlease enter a 'Lisp' expression (regular or fractional math style) that equals 24,\nusing (, ), frac, + or f+, - or f-, * or f*, / or f/, and 1635.\nEnter . to quit.\n.\nbye!\n\n",
        "safe": true
    },
    {
        "filename": "24_game_123.txt",
        "content": "/* Plays the game of 24. */\n\nTWENTYFOUR: procedure options (main);            /* 14 August 2010 */\n\nCTP: procedure (E) returns (character(50) varying);\n   declare E character (*) varying;\n   declare OUT character (length(E)) varying;\n   declare S character (length(E)) varying controlled;\n   declare c character (1);\n   declare i fixed binary;\n\n/* This procedure converts an arithmetic expression to Reverse Polish Form. */\n/* A push-down pop-up stack is used for operators. */\npriority: procedure (a) returns (fixed decimal (1));\n   declare a character (1);\n   declare ops character (10) initial ('#+-*/') varying static;\n   declare pri(6) fixed decimal (1) initial (1,2,2,3,3,4) static;\n   declare i fixed binary;\n\n   i = index(ops,a);\n   return (pri(i));\nend priority;\n\n   allocate S; S = '#'; out = '';\n   do i = 1 to length(E);\n      c = substr(E, i, 1);\n      if index('+-*/', c) > 0 then\n         do;\n            /* Copy any higher priority operators on the stack to the output. */\n            do while ( priority(c) <= priority((S)) );\n               out = out || S;\n               free S;\n            end;\n            /* Copy the input character to the stack. */\n            allocate S; S = c;\n         end;\n\n      if index('123456789', c) > 0 then\n         out = out || c;\n   end;\n   do while (allocation(S) > 1);\n      out = out || s;\n      free S;\n   end;\n   return (out);\nend CTP;\n\n/* Given a push-down pop-up stack, and an expresion in  */\n/* Reverse Polish notation, evaluate the expression.    */\nEVAL: procedure (E) returns (fixed decimal(15));\n   declare E character (*) varying;\n   declare S fixed decimal (15) controlled;\n   declare (a, b) fixed decimal (15);\n   declare c character (1);\n   declare p fixed binary;\n   declare (empty_stack, invalid_expression) condition;\n\n   on condition (empty_stack) begin;\n      put skip list ('Your expression is not valid.');\n      stop;\n   end;\n   on condition (invalid_expression) begin;\n      put skip list ('Your expression is not valid.');\n      stop;\n   end;\n\n   do p = 1 to length(E);\n      c = substr(E, p, 1);\n      if index('123456789', c) > 0 then\n         do; allocate S; S = c; end;\n      else\n         do;\n            if allocation(S) = 0 then signal condition (empty_stack);\n            b = S; free S;\n            if allocation(S) = 0 then signal condition (empty_stack);\n            a = S;\n            select (c);\n               when ('+') S = a + b; \n               when ('-') S = a - b;\n               when ('*') S = a * b;\n               when ('/') S = a / b;\n               when ('^') S = a ** b;\n               otherwise signal condition (invalid_expression);\n            end;\n         end;\n   end;\n   if allocation(S) ^= 1 then signal condition (invalid_expression);\n   return (S);\nEND eval;\n\n/* Check that the player has used every digit and no others. */\nVALIDATE: procedure (E);\n   declare E character (*) varying;\n   declare E2 character (length(E)), (i, j) fixed binary;\n   declare digits(9) character (1) static initial\n      ('1', '2', '3', '4', '5', '6', '7', '8', '9');\n\n   E2 = translate(E, '    ', '+-*/' );\n   do i = 1 to 4;\n      j = index(E2, digits(k(i)));\n      if j > 0 then\n         substr(E2, j, 1) = ' ';\n      else\n         do; put skip list ('You must use the digits supplied.'); stop; end;\n   end;\n   if E2 ^= '' then\n      do; put skip list ('You must use every digit supplied, and no others.'); stop; end;\nend VALIDATE;\n\n   declare E character (40) varying;\n   declare k(4) fixed decimal;\n   declare (time, random) builtin;\n   declare V fixed decimal (15);\n\n   k = random(TIME);\n   k = 9*random() + 1;\n   put skip edit ('Here are four integers:', k) (a);\n   put skip list ('With these integers, make up an arithmetic expression' ||\n      ' that evaluates to 24.');\n   put skip list ('You can use any of the operators +, -, *, and /');\n   put skip list ('E.g., Given the integers 1, 3, 7, and 6,' ||\n      ' the expression 6*3+7-1 evaluates to 24.');\n\n   put skip list ('Please type an arithmetic expression\u00a0:');\n   get edit (E) (L) COPY;\n\n   CALL VALIDATE (E); /* Check that the player has used every digit and no others. */\n\n   E = CTP(E);\n   V = EVAL (E);\n   if V = 24 then\n      put skip list ('Congratulations: the expression evaluates to 24.');\n   else\n      put skip edit ('The result is ', trim(V), ' which is not correct') (a);\n\nend TWENTYFOUR;",
        "safe": true
    },
    {
        "filename": "24_game_124.txt",
        "content": "is_num = (s):\n  x = s ord(0)\n  if (x >= \"0\"ord && x <= \"9\"ord): true.\n  else: false.\n  .\n\nnums = (s):\n  res = ()\n  0 to (s length, (b):\n    c = s(b)\n    if (is_num(c)):\n      res push(c).\n  .)\n  res.\n\ntry = 1\nwhile (true):\n  r = rand string\n  digits = (r(0),r(1),r(2),r(3))\n  \"\\nMy next four digits: \" print\n  digits join(\" \") say\n  digit_s = digits ins_sort string\n\n  (\"Your expression to create 24 (try \", try, \"): \") print\n  entry = read slice(0,-1)\n  expr = entry eval\n  parse = nums(entry)\n  parse_s = parse clone ins_sort string\n  try++\n  if (parse length\u00a0!= 4):\n    (\"Wrong number of digits:\", parse) say.\n  elsif (parse_s\u00a0!= digit_s):\n    (\"Wrong digits:\", parse) say.\n  elsif (expr == 24):\n    \"You won!\" say\n    entry print, \" => 24\" say\n    return().\n  else:\n    (entry, \" => \", expr string, \"\u00a0!= 24\") join(\"\") say.\n.",
        "safe": true
    },
    {
        "filename": "24_game_125.txt",
        "content": "CLS\n\nFunction isNumeric ($x)\n{\n    $x2 = 0    \n    $isNum = [System.Int32]::TryParse($x,[ref]$x2)\nReturn $isNum\n}\n\n$NumberArray = @()\nWhile( $NumberArray.Count -lt 4 ){\n    $NumberArray += Random -Minimum 1 -Maximum 10\n}\n\nWrite-Host @\"\nWelcome to the 24 game!\n\nHere are your numbers: $($NumberArray -join \",\").\nUse division, multiplication, subtraction and addition to get 24 as a result with these 4 numbers.\n\"@\n\nDo\n{\n$Wrong = 0\n$EndResult = $null\n$TempChar = $null\n$TempChar2 = $null\n$Count = $null\n\n$AllowableCharacters = $NumberArray + \"+-*/()\".ToCharArray()\n    $Result = Read-Host\n        Foreach($Char in $Result.ToCharArray())\n        {\n            If( $AllowableCharacters -notcontains $Char ){ $Wrong = 1 }\n        }\n\n        If($Wrong -eq 1)\n        {\n            Write-Warning \"Wrong input! Please use only the given numbers.\"\n        }\n        Foreach($Char in $Result.ToCharArray())\n        {\n            If((IsNumeric $TempChar) -AND (IsNumeric $Char))\n            {\n                Write-Warning \"Wrong input! Combining two or more numbers together is not allowed!\"\n            }\n            $TempChar = $Char\n        }\n        Foreach($Char in $Result.ToCharArray())\n        {\n            If(IsNumeric $Char)\n            {\n                $Count++\n            }\n        }\n        If($Count -eq 4)\n        {\n            $EndResult = Invoke-Expression $Result\n                If($EndResult -eq 24)\n                {\n                    Write-Host \"`nYou've won the game!\"\n                }\n                Else\n                {\n                    Write-Host \"`n$EndResult is not 24! Too bad.\"\n                }\n        }\n        Else\n        {\n            Write-Warning \"Wrong input! You did not supply four numbers.\"\n        }\n}\nWhile($EndResult -ne 24)\n",
        "safe": true
    },
    {
        "filename": "24_game_126.txt",
        "content": ":a\neditvar /modify -random- = <10\nprintline These are your four digits: -random- -random- -random- -random-\nprintline Use an algorithm to make the number 24.\neditvar /newvar /value=a /userinput=1 /title=Algorithm:\ndo -a-\nif -a- /hasvalue 24 printline Your algorithm worked! & goto :b (\n) else printline Your algorithm did not work.\n:b \neditvar /newvar /value=b /userinput=1 /title=Do you want to play again?\nif -b- /hasvalue y goto :a else exitcurrentprogram",
        "safe": true
    },
    {
        "filename": "24_game_127.txt",
        "content": ":- initialization(main).\n\n\nanswer(24).\nplay :- round, play ; true.\n\nround :-\n    prompt(Ns), get_line(Input), Input \\= \"stop\"\n  , ( phrase(parse(Ns,[]), Input) -> Result = 'correct'\n                                   ; Result = 'wrong'\n    ), write(Result), nl, nl\n  . % where\n    prompt(Ns)  :- length(Ns,4), maplist(random(1,10), Ns)\n                 , write('Digits: '), write(Ns), nl\n                 .\n\nparse([],[X])     --> { answer(X) }.\nparse(Ns,[Y,X|S]) --> \"+\", { Z is X  +  Y }, parse(Ns,[Z|S]).\nparse(Ns,[Y,X|S]) --> \"-\", { Z is X  -  Y }, parse(Ns,[Z|S]).\nparse(Ns,[Y,X|S]) --> \"*\", { Z is X  *  Y }, parse(Ns,[Z|S]).\nparse(Ns,[Y,X|S]) --> \"/\", { Z is X div Y }, parse(Ns,[Z|S]).\nparse(Ns,Stack)   --> \" \", parse(Ns,Stack).\nparse(Ns,Stack)   --> { select(N,Ns,Ns1), number_codes(N,[Code]) }\n                    , [Code], parse(Ns1,[N|Stack])\n                    .\n\nget_line(Xs) :- get_code(X)\n              , ( X == 10 -> Xs = [] ; Xs = [X|Ys], get_line(Ys) )\n              .\nmain :- randomize, play, halt.\n",
        "safe": true
    },
    {
        "filename": "24_game_128.txt",
        "content": "Digits: [9,4,6,9]\n46*9-9+\ncorrect\n\nDigits: [7,4,7,8]\n8 4 7 7 / - *\ncorrect\n\nDigits: [7,2,8,2]\n7282---\nwrong\n\nDigits: [2,6,7,1]\n4611***\nwrong\n\nDigits: [3,6,5,8]\n+\nwrong\n\nDigits: [2,1,7,7]\nstop",
        "safe": true
    },
    {
        "filename": "24_game_129.txt",
        "content": "#digitCount = 4\nGlobal Dim digits(#digitCount - 1) ;holds random digits\n\nProcedure showDigits()\n  Print(#CRLF$ + \"These are your four digits: \")\n  Protected i\n  For i = 0 To #digitCount - 1\n    Print(Str(digits(i)))\n    If i < (#digitCount - 1)\n      Print(\", \")\n    Else\n      PrintN(\"\")\n    EndIf\n  Next\n  Print(\"24 = \")\nEndProcedure\n\nProcedure playAgain()\n  Protected answer.s\n  Repeat \n    Print(\"Play again (y/n)? \")\n    answer = LCase(Left(Trim(Input()), 1))\n    Select answer\n      Case \"n\"\n        ProcedureReturn #False\n      Case \"y\"\n        ProcedureReturn #True\n      Default\n        PrintN(\"\")\n        Continue\n    EndSelect\n  ForEver\nEndProcedure\n\nProcedure allDigitsUsed()\n  Protected i\n  For i = 0 To #digitCount - 1\n    If digits(i) <> 0\n      ProcedureReturn #False\n    EndIf\n  Next \n  ProcedureReturn #True \nEndProcedure\n\nProcedure isValidDigit(d)\n  For i = 0 To #digitCount - 1\n    If digits(i) = d\n      digits(i) = 0\n      ProcedureReturn #True\n    EndIf \n  Next \n  ProcedureReturn #False\nEndProcedure\n\nProcedure doOperation(List op.c(), List operand.f())\n  Protected x.f, y.f, op.c\n  op = op(): DeleteElement(op())\n  If op = '('\n    ProcedureReturn #False ;end of sub-expression\n  EndIf \n  \n  y = operand(): DeleteElement(operand())\n  x = operand()\n  Select op\n    Case '+'\n      x + y\n    Case '-'\n      x - y\n    Case '*' \n      x * y\n    Case '/' \n      x / y\n  EndSelect\n  operand() = x\n  ProcedureReturn #True ;operation completed\nEndProcedure \n\n;returns error if present and the expression results in *result\\f\nProcedure.s parseExpression(expr.s, *result.Float)\n  NewList op.c()\n  NewList operand.f()\n  expr = ReplaceString(expr, \" \", \"\") ;remove spaces\n  \n  If Len(expr) = 0: *result\\f = 0: ProcedureReturn \"\": EndIf ;no expression, return zero\n  \n  Protected *ech.Character = @expr, lastWasDigit, lastWasOper, parenCheck, c.c\n  While *ech\\c\n    c = *ech\\c\n    Select c\n      Case '*', '/', '-', '+'\n        If Not lastWasDigit: ProcedureReturn \"Improper syntax, need a digit between operators.\": EndIf\n        If ListSize(op()) And (FindString(\"*/\", Chr(op()), 1) Or (FindString(\"+-\", Chr(op()), 1) And FindString(\"+-\", Chr(c), 1)))\n          doOperation(op(), operand())\n        EndIf \n        AddElement(op()): op() = c\n        lastWasOper = #True: lastWasDigit = #False\n      Case '('\n        If lastWasDigit: ProcedureReturn \"Improper syntax, need an operator before left paren.\": EndIf\n        AddElement(op()): op() = c\n        parenCheck + 1: lastWasOper = #False\n      Case ')'\n        parenCheck - 1: If parenCheck < 0: ProcedureReturn \"Improper syntax, missing a left paren.\": EndIf\n        If Not lastWasDigit: ProcedureReturn \"Improper syntax, missing a digit before right paren.\": EndIf\n        Repeat: Until Not doOperation(op(),operand())\n        lastWasDigit = #True\n      Case '1' To '9'\n        If lastWasDigit: ProcedureReturn \"Improper syntax, need an operator between digits.\": EndIf\n        AddElement(operand()): operand() = c - '0'\n        If Not isValidDigit(operand()): ProcedureReturn \"'\" + Chr(c) + \"' is not a valid digit.\": EndIf\n        lastWasDigit = #True: lastWasOper = #False\n      Default\n        ProcedureReturn \"'\" + Chr(c) + \"' is not allowed in the expression.\"\n    EndSelect\n    *ech + SizeOf(Character)\n  Wend \n  \n  If parenCheck <> 0 Or lastWasOper: ProcedureReturn \"Improper syntax, missing a right paren or digit.\": EndIf\n  Repeat\n    If Not ListSize(op()): Break: EndIf\n  Until Not doOperation(op(),operand())\n  *result\\f = operand()\n  ProcedureReturn \"\" ;no error\nEndProcedure\n\nDefine success, failure, result.f, error.s, i\nIf OpenConsole()\n  PrintN(\"The 24 Game\" + #CRLF$)\n  PrintN(\"Given four digits and using just the +, -, *, and / operators; and the\")\n  PrintN(\"possible use of brackets, (), enter an expression that equates to 24.\")\n  Repeat\n    For i = 0 To #digitCount - 1\n      digits(i) = 1 + Random(8)\n    Next\n    \n    showDigits()\n    error = parseExpression(Input(), @result)\n    If error = \"\"\n      If Not allDigitsUsed()\n        PrintN( \"Wrong! (you didn't use all digits)\"): failure + 1\n      ElseIf result = 24.0\n        PrintN(\"Correct!\"): success + 1\n      Else\n        Print(\"Wrong! (you got \")\n        If result <> Int(result)\n          PrintN(StrF(result, 2) + \")\")\n        Else\n          PrintN(Str(result) + \")\")\n        EndIf \n        failure + 1\n      EndIf \n    Else\n      PrintN(error): failure + 1\n    EndIf \n  Until Not playAgain()\n  \n  PrintN(\"success:\" + Str(success) + \" failure:\" + Str(failure) + \" total:\" + Str(success + failure))\n  \n  Print(#CRLF$ + \"Press ENTER to exit\"): Input()\n  CloseConsole()\nEndIf\n",
        "safe": true
    },
    {
        "filename": "24_game_13.txt",
        "content": "24 Game\nThe program will display four randomly-generated\nsingle-digit numbers and will then prompt you to enter\nan arithmetic expression followed by <enter> to sum\nthe given numbers to 24.\nExemple\u00a0: 9+8+3+4   or (7+5)+(3*4)\n\nThe four digits are 5 1 1 5 and the score is 24.\nEnter your expression (or type (q)uit to exit or (n) for other digits):\nn\nThe four digits are 8 2 5 3 and the score is 24.\nEnter your expression (or type (q)uit to exit or (n) for other digits):\n(8*2)+5+3\nIt is OK.\n\nNew game (y/n)\u00a0?\n\n",
        "safe": true
    },
    {
        "filename": "24_game_130.txt",
        "content": "The 24 Game\n\nGiven four digits and using just the +, -, *, and / operators; and the\npossible use of brackets, (), enter an expression that equates to 24.\n\nThese are your four digits: 9, 2, 8, 7\n24 = 9*8/2-7\nWrong! (you got 29)\nPlay again (y/n)? y\n\nThese are your four digits: 5, 5, 5, 6\n24 = 5*5+5-6\nCorrect!\nPlay again (y/n)? n\nsuccess:1 failure:1 total:2",
        "safe": true
    },
    {
        "filename": "24_game_131.txt",
        "content": "'''\n The 24 Game\n\n Given any four digits in the range 1 to 9, which may have repetitions,\n Using just the +, -, *, and / operators; and the possible use of\n brackets, (), show how to make an answer of 24.\n\n An answer of \"q\" will quit the game.\n An answer of \"!\" will generate a new set of four digits.\n Otherwise you are repeatedly asked for an expression until it evaluates to 24\n\n Note: you cannot form multiple digit numbers from the supplied digits,\n so an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\n\n'''\n\nfrom __future__ import division, print_function\nimport random, ast, re\nimport sys\n\nif sys.version_info[0] < 3: input = raw_input\n\ndef choose4():\n    'four random digits >0 as characters'\n    return [str(random.randint(1,9)) for i in range(4)]\n\ndef welcome(digits):\n    print (__doc__)\n    print (\"Your four digits: \" + ' '.join(digits))\n\ndef check(answer, digits):\n    allowed = set('() +-*/\\t'+''.join(digits))\n    ok = all(ch in allowed for ch in answer) and \\\n         all(digits.count(dig) == answer.count(dig) for dig in set(digits)) \\\n         and not re.search('\\d\\d', answer)\n    if ok:\n        try:\n            ast.parse(answer)\n        except:\n            ok = False\n    return ok\n\ndef main():    \n    digits = choose4()\n    welcome(digits)\n    trial = 0\n    answer = ''\n    chk = ans = False\n    while not (chk and ans == 24):\n        trial +=1\n        answer = input(\"Expression %i: \" % trial)\n        chk = check(answer, digits)\n        if answer.lower() == 'q':\n            break\n        if answer == '!':\n            digits = choose4()\n            print (\"New digits:\", ' '.join(digits))\n            continue\n        if not chk:\n            print (\"The input '%s' was wonky!\" % answer)\n        else:\n            ans = eval(answer)\n            print (\" = \", ans)\n            if ans == 24:\n                print (\"Thats right!\")\n    print (\"Thank you and goodbye\")   \n\nif __name__ == '__main__': main()\n",
        "safe": true
    },
    {
        "filename": "24_game_132.txt",
        "content": " The 24 Game\n\n Given any four digits in the range 1 to 9, which may have repetitions,\n Using just the +, -, *, and / operators; and the possible use of\n brackets, (), show how to make an answer of 24.\n\n An answer of \"q\" will quit the game.\n An answer of \"!\" will generate a new set of four digits.\n\n Note: you cannot form multiple digit numbers from the supplied digits,\n so an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\n\n\nYour four digits: 3 2 4 6\nExpression 1: (3 - 1)*(6*4)\nThe input '(3 - 1)*(6*4)' was wonky!\nExpression 2: (3 - 2) * 6 * 4\n =  24\nThat's right!\nThank you and goodbye.",
        "safe": true
    },
    {
        "filename": "24_game_133.txt",
        "content": "import random, re\nchars = [\"(\",\")\",\"/\",\"+\",\"-\",\"*\"]  \nwhile True:\n    charsandints, ints = [], []\n    for x in range(4):\n        ints.append(str(random.randrange(1,10)))\n    charsandints = chars + ints\n    print \"Numbers are:\", ints\n    guess = raw_input(\"Enter your guess:\")\n    if guess.lower() == \"q\":\n        break\n    elif guess.lower() == \"|\":\n        pass\n    else:\n        flag = True\n        for a in guess:\n            if a not in charsandints or guess.count(a) > charsandints.count(a):\n                flag = False\n        if re.search(\"\\d\\d\", guess):\n            print \"You cannot combine digits.\"\n            break\n        if flag:\n            print \"Your result is: \", eval(guess)\n            if eval(guess) == 24:\n                print \"You won\"\n                break\n            else:\n                print \"You lost\"\n                break\n        else:\n            print \"You cannot use anthing other than\", charsandints\n            break\nprint \"Thanks for playing\"\n",
        "safe": true
    },
    {
        "filename": "24_game_134.txt",
        "content": "  [ stack ]                                       is operators       (   --> s )\n\n  0 $ \"*/+-\" witheach [ bit | ]\n  operators put\n\n  [ stack ]                                       is numbers         (   --> s )\n\n  [ 0 swap\n    witheach [ bit | ]\n    numbers put ]                                 is putnumbers      ( $ -->   )\n\n  [ $ \"123456789\" shuffle 4 split drop sort ]     is choosenumbers   (   --> $ )\n\n  [ say \"Using any of the operators * / + -\" cr\n    say \"and each of the numbers \"\n    witheach [ emit sp ] say \"once,\" cr\n    say \"enter an RPN expression equal to 24.\" cr\n    $ \"Spaces between characters are optional: \"\n    input ]                                       is getexpression   ( $ --> $ )\n\n  [ $ \"\" swap witheach\n      [ dup space = iff drop else join ] ]        is stripspaces     ( $ --> $ )\n\n  [ stack ]                                       is opcount         (   --> s )\n  [ stack ]                                       is numcount        (   --> s )\n  [ stack ]                                       is numsused        (   --> s )\n\n  [ true swap\n    0 opcount put\n    0 numcount put\n    0 numsused put\n    witheach\n      [ bit dup numbers share & iff\n          [ 1 numcount tally\n            numsused take | numsused put ]\n        else\n          [ operators share & if\n              [ 1 opcount tally ] ]\n        opcount share numcount share < not if\n          [ drop false conclude ] ]\n    numsused take\n    numbers share\u00a0!= if [ drop false ]\n    numcount take 4\u00a0!= if [ drop false ] \n    opcount take 3\u00a0!= if [ drop false ] ]         is checkexpression ( $ --> b )\n\n  [ $ \"\" swap\n    witheach\n      [ dup char 0 char 9 1+ within iff\n          [ join $ \" n->v \" join ] done\n        [ switch\n          char * case [ $ \"v* \" join ]\n          char / case [ $ \"v/ \" join ]\n          char + case [ $ \"v+ \" join ]\n          char - case [ $ \"v- \" join ]\n          otherwise [ $ \"Error!\" fail ] ] ] ]     is quackerise      ( $ --> [ )\n\n    [ choosenumbers\n      dup putnumbers\n      [ dup getexpression\n        stripspaces\n        dup checkexpression not while\n        cr\n        say \"Badly formed expression. Try again.\"\n        cr cr\n        drop again ]\n      nip\n      quackerise\n      quackery\n      cr\n      say \"Your expression is equal to \"\n      2dup 10 point$ echo$\n      24 n->v v- v0= iff\n      [ say \".\u00a0:-)\" ] else [ say \".\u00a0:-(\" ] \n      numbers release ]                           is game            (   -->   )",
        "safe": true
    },
    {
        "filename": "24_game_135.txt",
        "content": "O> game\n... \nUsing any of the operators * / + -\nand each of the numbers 2 3 8 9 once,\nenter an RPN expression equal to 24.\nSpaces between characters are optional: 5 7 6 2 * + +\n\nYour expression is equal to 24.\u00a0:-)\nStack empty.\n\n/O> game\n... \nUsing any of the operators * / + -\nand each of the numbers 2 3 8 9 once,\nenter an RPN expression equal to 24.\nSpaces between characters are optional: 2 + 5 + 8 + 9\n\nBadly formed expression. Try again.\n\nUsing any of the operators * / + -\nand each of the numbers 2 5 8 9 once,\nenter an RPN expression equal to 24.\nSpaces between characters are optional: 25+8+9+\n\nYour expression is equal to 24.\u00a0:-)\nStack empty.\n\n/O> game\n... \nUsing any of the operators * / + -\nand each of the numbers 1 3 4 7 once,\nenter an RPN expression equal to 24.\nSpaces between characters are optional: 1 3 * 4 / 7 +\n\nYour expression is equal to 7.75.\u00a0:-(\nStack empty.\n",
        "safe": true
    },
    {
        "filename": "24_game_136.txt",
        "content": "twenty.four <- function(operators=c(\"+\", \"-\", \"*\", \"/\", \"(\"),\n                        selector=function() sample(1:9, 4, replace=TRUE),\n                        arguments=selector(),\n                        goal=24) {\n  newdigits <- function() {\n    arguments <<- selector()\n    cat(\"New digits:\", paste(arguments, collapse=\", \"), \"\\n\")\n  } \n  help <- function() cat(\"Make\", goal,\n      \"out of the numbers\",paste(arguments, collapse=\", \"),\n      \"and the operators\",paste(operators, collapse=\", \"), \".\",\n      \"\\nEnter 'q' to quit, '!' to select new digits,\",\n      \"or '?' to repeat this message.\\n\")\n  help()\n  repeat {\n    switch(input <- readline(prompt=\"> \"),\n           q={ cat(\"Goodbye!\\n\"); break },\n           `?`=help(),\n           `!`=newdigits(),\n           tryCatch({\n             expr <- parse(text=input, n=1)[[1]]\n             check.call(expr, operators, arguments)\n             result <- eval(expr)\n             if (isTRUE(all.equal(result, goal))) {\n               cat(\"Correct!\\n\")\n               newdigits()\n             } else {\n               cat(\"Evaluated to\", result, \"( goal\", goal, \")\\n\")\n             }\n           },error=function(e) cat(e$message, \"\\n\")))\n  }\n}\n\ncheck.call <- function(expr, operators, arguments) {\n  unexpr <- function(x) {\n    if (is.call(x))\n      unexpr(as.list(x))\n    else if (is.list(x))\n      lapply(x,unexpr)\n    else x\n  }\n  leaves <- unlist(unexpr(expr))\n  if (any(disallowed <-\n          !leaves %in% c(lapply(operators, as.name),\n                         as.list(arguments)))) {\n    stop(\"'\", paste(sapply(leaves[disallowed], as.character),\n                    collapse=\", \"),\n         \"' not allowed. \")\n  }\n  numbers.used <- unlist(leaves[sapply(leaves, mode) == 'numeric'])\n  \n  if (! isTRUE(all.equal(sort(numbers.used), sort(arguments))))\n   stop(\"Must use each number once.\")\n}\n",
        "safe": true
    },
    {
        "filename": "24_game_137.txt",
        "content": "> twenty.four()\n\nMake 24 out of the numbers 1, 6, 7, 5 and the operators +, -, *, /, ( . \nEnter 'q' to quit, '!' to select new digits, or '?' to repeat this message.\n> 6*(5-1)\nMust use each number once. \n> 1 + 6*5 - 7\nCorrect!\nNew digits: 7, 2, 9, 3 \n> (7+9)/2*3\nCorrect!\nNew digits: 1, 4, 1, 7 \n> 4*(7-1)\nMust use each number once. \n> (7-1)*4*1\nCorrect!\nNew digits: 1, 5, 2, 8 \n> (5-1)^2+8\n'^' not allowed.\n> !\nNew digits: 2, 8, 5, 2 \n> 52-28\n'52, 28' not allowed.\n> (8-2)*(5-2/2)\nMust use each number once. \n> (8+2)*2+5\nEvaluated to 25 ( goal 24 )\n> q\nGoodbye!\n",
        "safe": true
    },
    {
        "filename": "24_game_138.txt",
        "content": "#lang racket\n\n(define (interprete expr numbers)\n  ;; the cashe for used numbers\n  (define cashe numbers)\n\n  ;; updating the cashe and handling invalid cases\n  (define (update-cashe! x)\n    (unless (member x numbers) (error \"Number is not in the given set:\" x))\n    (unless (member x cashe)   (error \"Number is used more times then it was given:\" x))\n    (set! cashe (remq x cashe)))\n\n  ;; the parser\n  (define parse\n    (match-lambda\n      ;; parsing arythmetics\n      [`(,x ... + ,y ...) (+ (parse x) (parse y))]\n      [`(,x ... - ,y ...) (- (parse x) (parse y))]\n      [`(,x ... * ,y ...) (* (parse x) (parse y))]\n      [`(,x ... / ,y ...) (/ (parse x) (parse y))]\n      [`(,x ,op ,y ...)   (error \"Unknown operator: \" op)]\n      ;; opening redundant brackets\n      [`(,expr)           (parse expr)]\n      ;; parsing numbers\n      [(? number? x)      (update-cashe! x) x]\n      ;; unknown token\n      [x                  (error \"Not a number: \" x)]))\n\n  ;; parse the expresion\n  (define result (parse expr))\n\n  ;; return the result if cashe is empty\n  (if (empty? cashe)\n      result\n      (error \"You didn`t use all numbers!\")))\n",
        "safe": true
    },
    {
        "filename": "24_game_139.txt",
        "content": "> (interprete '(1 - 2 * 3 + 8) '(1 2 3 8))\n3\n> (interprete '(1 - 2 * (3 + 8)) '(1 2 3 8))\n-21\n> (interprete '((1 - 2) * (3 + 8)) '(1 2 3 8))\n-11\n> (interprete '((1 - 2) * 3 + 8) '(1 2 3 8))\n5\n> (interprete '((1 - 2) * 3 + 8) '(1 2 3 4))\n Number is not in the given set: 8\n> (interprete '((1 - 2) * 3 + 2) '(1 2 3 3))\n Number is used more times then it was given: 2\n> (interprete '((1 - 2) ^ 3 + 2) '(1 2 3 2))\n Unknown operator:  ^\n> (interprete '((1 - 2) * 3) '(1 2 3 2))\n You didn`t use all numbers!\n",
        "safe": true
    },
    {
        "filename": "24_game_14.txt",
        "content": "print \"-----------------------------\"\nprint \" Welcome to 24 Game\"\nprint \"-----------------------------\"\n\ndigs: map 1..4 'x -> random 1 9\n\nprint [\"The numbers you can use are:\" join.with:\" \" digs]\n\nprint \"\"\n\nvalidExpression?: function [expr][\n    loop expr 'item [\n        if or? inline? item block? item [\n            if not? validExpression? item -> return false\n        ]\n        if symbol? item [\n            if not? contains? [+ / - *] item -> return false\n        ]\n        if integer? item [\n            if not? contains? digs item -> return false\n        ]\n    ]\n    return true\n]\n\nresult: 0\n\nwhile [result<>24][\n    got: input \"Enter an expression to form 24: \"\n    blo: to :block got\n    if? validExpression? blo [\n        result: do blo\n        print [\"The result is:\" result]\n    ]\n    else [\n        print \"Invalid expression. Please try again!\"\n    ]\n    print \"\"\n]\n\nprint \"Well done!\"\n",
        "safe": true
    },
    {
        "filename": "24_game_140.txt",
        "content": ";; starting the program\n(define (start)\n  (displayln \"Combine given four numbers using operations + - * / to get 24.\")\n  (displayln \"Input 'q' to quit or your answer like '1 - 3 * (2 + 3)'\")\n  (new-game))\n\n;; starting a new game\n(define (new-game)\n  ;; create a new number set\n  (define numbers (build-list 4 (\u03bb (_) (+ 1 (random 9)))))\n  (apply printf \"Your numbers: ~a  ~a  ~a  ~a\\n\" numbers)\n  (new-input numbers))\n\n;; processing a new user input\n(define (new-input numbers)\n  ;; if an exception is raized while processing, show the exeption message\n  ;; and prompt for another input, but do not stop the program.\n  (with-handlers ([exn? (\u03bb (exn)\n                          (displayln (exn-message exn))\n                          (new-input numbers))])\n    ;; get the answer\n    (define user-expr (read-the-answer))\n    ;; interprete it\n    (case user-expr\n      [(q) (display \"Good buy!\")]\n      [(n) (new-game)]\n      [else (define ans (interprete user-expr numbers))\n            (case ans\n              [(24) (printf \"Indeed! ~a = 24\\n\" user-expr)\n                    (new-game)]\n              [else (error \"Wrong!\" user-expr '= ans)])])))\n\n;; reading and preparing the user's answer\n;; \"1 + 2 * (3 + 4)\" --> '(1 + 2 * (3 + 4))\n(define (read-the-answer)\n  (read (open-input-string (format \"(~a)\" (read-line)))))\n",
        "safe": true
    },
    {
        "filename": "24_game_141.txt",
        "content": "use MONKEY-SEE-NO-EVAL;\n\nsay \"Here are your digits: \", \nconstant @digits = (1..9).roll(4)\u00bb.Str;\n \ngrammar Exp24 {\n    token TOP { ^ <exp> $ { fail unless EVAL($/) == 24 } }\n    rule exp { <term>+\u00a0% <op> }\n    rule term { '(' <exp> ')' | <@digits> }\n    token op { < + - * / > }\n}\n \nwhile my $exp = prompt \"\\n24? \" {\n    if try Exp24.parse: $exp {\n        say \"You win\u00a0:)\";\n        last;\n    } else {\n        say (\n            'Sorry.  Try again.' xx 20,\n            'Try harder.' xx 5,\n            'Nope.  Not even close.' xx 2,\n            'Are you five or something?',\n            'Come on, you can do better than that.'\n        ).flat.pick\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "24_game_142.txt",
        "content": "Red []\nprint \"Evaluation from left to right with no precedence, unless you use parenthesis.\" print \"\"\na: \"123456789\"\nguess: \"\"\nvalid: \"\"\nsucess: false\nrandom/seed now/time\nloop 4 [append valid last random a]\nprint [\"The numbers are: \" valid/1 \", \" valid/2 \", \" valid/3 \" and \" valid/4]\nsort valid\ninsert valid \" \"\n\nexpr:    [term [\"+\" | \"-\"] expr | term]\nterm:    [primary [\"*\" | \"/\"] term | primary]\nprimary: [some digit | \"(\" expr \")\"]\ndigit:   charset valid\n\nwhile [not sucess] [\n\tguess: ask \"Enter your expression: \"\n\tif guess = \"q\" [halt]\n\tnumbers: copy guess\n\tsort numbers\n\tnumbers: take/last/part numbers 4\n\tinsert numbers \" \"\n\teither (parse guess expr) and (valid = numbers) [\n\t\trepeat i length? guess [insert at guess (i * 2) \" \"]\n\t\tresult: do guess\n\t\tprint [\"The result of your expression is: \" result]\n\t\tif (result = 24) [sucess: true]\n\t][\n\tprint \"Something is wrong with the expression, try again.\"\n\t]\n]\nprint \"You got it right!\"\n",
        "safe": true
    },
    {
        "filename": "24_game_143.txt",
        "content": "Evaluation from left to right with no precedence, unless you use parenthesis.\n\nThe numbers are:  7 ,  1 ,  9  and  3\nEnter your expression: 7+1+9\nSomething is wrong with the expression, try again.\nEnter your expression: 7+1+8+3\nSomething is wrong with the expression, try again.\nEnter your expression: 1+7*(9/3)\nThe result of your expression is:  24\nYou got it right!\n>> \n",
        "safe": true
    },
    {
        "filename": "24_game_144.txt",
        "content": "Red [\n    Title: \"24 Game\"\n    Author: \"gltewalt\"\n]\n    \nop: charset \"*/+-\"\nterm: [opt \"(\" num opt \")\"]\nvalid-expression: [term op term op term op term]\n\nexplode: func [val][\n    extract/into val 1 c: copy []\n]\n\ncheck-expression: does [\n    if \"q\" = e: ask \"Enter expression: \" [halt]\n    either parse trim/all e valid-expression [\n        either 24 = m: math to-block form explode e [\n            print [\"You got it!\" m]\n        ][\n            print [\"Not quite correct. That's\" m]]\n    ][\n        print \"Invalid expression.\"\n    ]\n]\n\nmain: does [\n    numbers: collect [loop 4 [keep random 9]]\n    num: charset form numbers\n    print [newline \"Using the following numbers, enter an expression that equals 24: (pmdas)\" numbers]\n    if none? attempt [check-expression][print \"Invalid expression.\"]\n]\n\nforever [main]\n",
        "safe": true
    },
    {
        "filename": "24_game_145.txt",
        "content": "/*REXX program helps the user find solutions to the game of  24.\n\n\u2554\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2557\n\u2551 Argument is either of these forms:     (blank)                              \u2551\u2302\n\u2551                                         ssss                                \u2551\u2302\n\u2551                                         ssss,total,limit                    \u2551\u2302\n\u2551                                         ssss-ffff                           \u2551\u2302\n\u2551                                         ssss-ffff,total,limit               \u2551\u2302\n\u2551                                        -ssss                                \u2551\u2302\n\u2551                                        +ssss                                \u2551\u2302\n\u2551                                                                             \u2551\u2302\n\u2551 where   SSSS   and/or  FFFF  must be exactly four numerals (decimal digits) \u2551\u2302\n\u2551 comprised soley of the numerals (digits)   1 \u2500\u2500\u25ba 9     (no zeroes).         \u2551\u2302\n\u2551                                                                             \u2551\u2302\n\u2551         SSSS   is the start,   and     FFFF    is the  end   (inclusive).   \u2551\u2302\n\u2551                                                                             \u2551\u2302\n\u2551 If  ssss  has a leading plus (+) sign,  it's used as the digits,  and       \u2551\u2302\n\u2551 the user is prompted to enter a solution  (using those decimal digits).     \u2551\u2302\n\u2551                                                                             \u2551\u2302\n\u2551 If  ssss  has a leading minus (-) sign,  a solution is searched for and     \u2551\u2302\n\u2551 the user is told there is a solution (or not),  but no solutions are shown).\u2551\u2302\n\u2551                                                                             \u2551\u2302\n\u2551 If no argument is specified,  this program generates four digits (no zeros) \u2551\u2302\n\u2551 which has at least one solution,  and shows the sorted digits to the user,  \u2551\u2302\n\u2551 requesting that they enter a solution (the digits used may be in any order).\u2551\u2302\n\u2551                                                                             \u2551\u2302\n\u2551 If   TOTAL   is entered,  it's the desired answer.     The default is  24.  \u2551\u2302\n\u2551 If   LIMIT   is entered,  it limits the number of solutions shown.          \u2551\u2302\n\u2551                                                                             \u2551\u2302\n\u2551 A solution to be entered can be in the form of:                             \u2551\n\u2551                                                                             \u2551\n\u2551    digit1   operator   digit2   operator   digit3   operator  digit4        \u2551\n\u2551                                                                             \u2551\n\u2551 where    DIGITn     is one of the digits shown  (in any order),   and       \u2551\n\u2551          OPERATOR   can be any one of:     +   -   *   /                    \u2551\n\u2551                                                                             \u2551\n\u2551 Parentheses  ()  may be used in the normal manner for grouping,  as well as \u2551\n\u2551 brackets  []  or  braces  {}.       Blanks can be used anywhere.            \u2551\n\u2551                                                                             \u2551\n\u2551 I.E.:  for the digits   3448   the following could be entered:  3*8 + (4-4) \u2551\n\u255a\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u255d         */\n\nnumeric digits 30                                /*where rational arithmetic is needed. */\nparse arg orig;              uargs= orig         /*get the  guess  from the command line*/\norig= space(orig, 0)                             /*remove all the blanks from  ORIG.    */\nnegatory=  left(orig, 1)=='-'                    /*=1, suppresses showing.              */\npository=  left(orig, 1)=='+'                    /*=1, force pgm to use specific number.*/\nif pository | negatory  then orig=substr(orig,2) /*now, just use the absolute vaue.     */\nparse var orig orig  ','   $  \",\"  limit         /*get optional total ($)  and/or  limit*/\nparse var orig start '-' finish                  /*get start and finish  (maybe).       */\nopers= '*'  ||  \"/+-\"                            /*arithmetic opers; order is important.*/\nops= length(opers)                               /*the number of arithmetic operators.  */\ngroupsym= space('  ( )   [ ]   { }   \u00ab\u00a0\u00bb  ',  0) /*the allowable grouping symbols.      */\nindent= left('', 30)                             /*indents the display of solutions.    */\nshow= 1                                          /*=1,  shows solutions  (a semifore).  */\ndigs= 123456789                                  /*numerals  (digits)  that can be used.*/\nif $==''      then $= 24                         /*the name (goal) of the game:  (24)   */\nif limit==''  then limit= 1                      /*=1,  shows only  one  solution.      */\n__= copies('\u2500', 8)                               /*used for output messages to the user.*/\nabuttals = 0                                     /*=1,  allows digit abuttal:   12+12   */\n      do j=1  for ops;  o.j= substr(opers, j, 1) /*these are used for fast execution.   */\n      end  /*j*/\nif \\datatype(limit, 'N')   then do;  call ger  limit  \"isn't numeric\";   exit 13;    end\nlimit= limit / 1                                 /*normalize the number for limit.      */\nif \\datatype($, 'N')       then do;  call ger    $    \"isn't numeric\";   exit 13;    end\n$= $ / 1                                         /*normalize the number for total.      */\nif start\\=='' & \\pository  then do;  call ranger start,finish;           exit 1;     end\nshow= 0                                          /*stop blabbing solutions in SOLVE.    */\n              do forever  while  \\negatory       /*keep truckin' until a solution.      */\n              x.= 0                              /*way to hold unique expressions.      */\n              rrrr= random(1111, 9999)           /*get a random set of digits.          */\n              if pos(0, rrrr)\\==0  then iterate  /*but don't the use of zeroes.         */\n              if solve(rrrr)\\==0   then leave    /*try to solve for these digits.       */\n              end   /*forever*/\nshow= 1                                          /*enable SOLVE to show solutions.      */\nif pository  then rrrr= start                    /*use what's specified.                */\nrrrr= sortc(rrrr)                                /*sort four elements.                  */\nrd.= x.\n                  do j=1  for 9;    _= substr(rrrr, j, 1);         rd._= #chrs(rrrr, _)\n                  end   /*j*/                    /* [\u2191]  count for each digit in  RRRR. */\n  do guesses=1;                 say\n  say __   \"Using the numerals (digits) \"   rrrr\", enter an expression that equals \"   $\n  say right('(or \u00a0?  or  Quit):', 79)\n  pull y;        uargs= y;      y= space(y, 0)   /*obtain user's response (expression). */\n  if abbrev('QUIT', y, 1)  then exit 0           /*does the user want to quit this game?*/\n  if y=='?'  then do j=2  for sourceline()-1;  _= sourceline(j)   /*get  a line of pgm. */\n                  if right(_, 1)=='\u2302'  then iterate               /*ignore this doc part*/\n                  say '  '  strip( left(_, 79), 'T')              /*show \"   \"   \" doc. */\n                  if left(_, 1)=='\u255a'  then iterate guesses\n                  end   /*j*/                    /* [\u2191]  use an in\u2500line way to show help*/\n  _v= verify(y, digs || opers || groupsym)       /*any illegal characters?              */\n  if _v\\==0  then do;   call ger 'invalid character:'  substr(y, _v, 1);   iterate;    end\n  if   y=''  then do;   call validate y;   iterate;    end\n\n    do j=1  for length(y)-1  while \\abuttals     /*check for two adjacent decimal digits*/\n    if datatype( substr(y, j, 1), 'W')   &   datatype( substr(y, j+1, 1), 'W')  then ,\n                           do;  call ger 'invalid use of digit abuttal:'   substr(y, j, 2)\n                                iterate guesses\n                           end\n    end   /*j*/\n\n  yy= translate(y, ')))', \"]}\u00bb\")                 /*use a simlier form for the expression*/\n\n    do j=1  for 9  while \\abuttals               /*check for a dig following a group sym*/\n    _= pos(')'j, yy)                             /*is there a string with:   )DIGIT  \u00a0? */\n    if _>0  then do;  call ger 'invalid use of digit abuttal' substr(y, _, 2)\n                      iterate guesses\n                 end\n    end   /*j*/\n\n  yd= #chrs(y, digs)                             /*count of legal digits  123456789     */\n  if yd<4  then do;  call ger 'not enough numerals were entered.';  iterate guesses;   end\n  if yd>4  then do;  call ger 'too many numerals were entered.'  ;  iterate guesses;   end\n\n      do j=1  for length(groupsym)  by 2\n      if #chrs(y, substr(groupsym, j  , 1))\\==,\n         #chrs(y, substr(groupsym, j+1, 1))  then do;   call ger 'mismatched' ,\n                                                                  substr(groupsym, j, 2)\n                                                        iterate guesses\n                                                  end\n      end   /*j*/\n\n        do k=1  for 2                            /*check for     **     and     //      */\n        _= copies( substr( opers, k, 1), 2)      /*only examine the first two operators.*/\n        if pos(_, y)\\==0  then do;  call ger 'illegal operator:' _;  iterate guesses;  end\n        end   /*k*/\n\n    do j=1  for 9;    if rd.j==0  then iterate;       _d= #chrs(y, j)\n    if _d==rd.j  then iterate\n    if _d<rd.j   then call ger  'not enough'   j   \"numerals were entered, must be\"   rd.j\n                 else call ger  'too many'     j   \"numerals were entered, must be\"   rd.j\n    iterate guesses\n    end   /*j*/\n\n  y= translate(y, '()()', \"[]{}\")                /*change extended grouping symbols\u2500\u2500\u25ba()*/\n  interpret  'ans=('  y   \") / 1\"                /*evalualte a normalized expression.   */\n  oldDigs= digits()                              /*save current decimal digit setting.  */\n  numeric digits digits()%2                      /*normalize expresssion to less digits.*/\n  if ans/1=$  then leave guesses                 /*the expression calculates to  24.    */\n  say __   \"incorrect, \"   y\"=\"ans               /*issue an error message  (incorrect). */\n  numeric digits oldDigs                         /*re\u2500instate the decimal digs precision*/\n  end   /*guesses*/\n\nsay;             say center('\u250c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2510', 79)\n                 say center('\u2502                     \u2502', 79)\n                 say center('\u2502  congratulations\u00a0!  \u2502', 79)\n                 say center('\u2502                     \u2502', 79)\n                 say center('\u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2518', 79);     say\nexit                                             /*stick a fork in it,  we're all done. */\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\n#chrs:procedure; parse arg x,c;  return length(x) - length( space( translate(x, , c), 0) )\ndiv:  procedure; parse arg q; if q=0  then q=1e9; return q  /*tests if dividing by zero.*/\nger:  say __ '***error*** for argument: '  uargs;   say __  arg(1);  errCode= 1;  return 0\ns:    if arg(1)==1  then return arg(3);           return word( arg(2) 's', 1)\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nranger: parse arg ssss,ffff                      /*parse args passed to this sub.       */\n        ffff= word(ffff ssss, 1)                 /*create a   FFFF   if necessary.      */\n               do g=ssss  to ffff                /*process possible range of values.    */\n               if pos(0, g)\\==0  then iterate    /*ignore any   G   number with zeroes. */\n               sols= solve(g);  wols= sols\n               if sols==0  then wols= 'No'       /*un\u2500geek number of solutions (if any).*/\n               if negatory & sols\\==0  then wols= 'A'  /*found only the first solution? */\n               if sols==1  & limit==1  then wols= 'A'\n               say;            say wols   'solution's(sols)    \"found for\"    g\n               if $\\==24  then say  'for answers that equal'    $\n               end   /*g*/\n       return\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nsolve: parse arg qqqq; finds= 0;  x.=0;  nq.= x. /*parse args passed to this function.  */\n       if \\validate(qqqq)  then return -1\n       parse value '( (( )) )'   with  L LL RR R /*assign some static variables (fastly)*/\n\n           do jq=1  for 4;  _= substr(qqqq,jq,1) /*count the   number   of each digit.  */\n           nq._= nq._ + 1\n           end   /*jq*/\n\n                    gLO= 1111;  gHI= 9999\nif $==24  then do;  gLO= 1118;  gHI= 9993;  end  /*24:  lowest poss.# that has solutions*/\n\n  do gggg=gLO  to gHI;  if pos(0, gggg)\\==0  then iterate   /*ignore values with zeroes.*/\n  if verify(gggg, qqqq)\\==0  then iterate\n  if verify(qqqq, gggg)\\==0  then iterate\n  ng.= 0\n         do jg=1  for 4;  _= substr(gggg, jg, 1);       g.jg= _;            ng._= ng._ + 1\n         end   /*jg*/                            /* [\u2191]  count the number of each digit.*/\n                          do kg=1  for 9;   if nq.kg\\==ng.kg  then iterate gggg\n                          end   /*kg*/           /* [\u2191]  verify number has same # digits*/\n    do       i=1  for ops                        /*insert operator after 1st numeral.   */\n      do     j=1  for ops                        /*  \"        \"      \"   2nd    \"       */\n        do   k=1  for ops                        /*  \"        \"      \"   3rd    \"       */\n          do m=0  for 10;       !.=              /*nullify all grouping symbols (parens)*/\n            select                               /*used to generate grouped expressions.*/\n            when m==1  then do; !.1=L;           !.3=R;                                end\n            when m==2  then do; !.1=L;                              !.5=R;             end\n            when m==3  then do; !.1=L;           !.3=R;   !.4=L;              !.6=R;   end\n            when m==4  then do;          !.2=L;                     !.5=R;             end\n            when m==5  then do;          !.2=L;                               !.6=R;   end\n            when m==6  then do; !.1=LL;                             !.5=R;    !.6=R;   end\n            when m==7  then do;          !.2=LL;                    !.5=R;    !.6=R;   end\n            when m==8  then do; !.1=L;   !.2=L;                               !.6=RR;  end\n            when m==9  then do;          !.2=L;           !.4=L;              !.6=RR;  end\n            otherwise  nop\n            end   /*select*/\n\n          e= space(!.1 g.1 o.i     !.2 g.2 !.3 o.j      !.4 g.3 !.5 o.k      g.4  !.6,  0)\n          if x.e  then iterate                   /*was the expression already used?     */\n          x.e= 1                                 /*mark this expression as being used.  */\n          origE= e                               /*keep original version for the display*/\n          pd= pos('/(', e)                       /*find pos of     /(      in  E.       */\n          if pd\\==0  then do                     /*Found?  Might have possible \u00f7 by zero*/\n                          eo= e\n                          lr= lastpos(')', e)    /*find the last right parenthesis.     */\n                          lm= pos('-', e, pd+1)  /*find a minus sign (-)    after  (    */\n                          if lm>pd & lm<lr  then e= changestr('/(',e,\"/div(\")   /*change*/\n                          if eo\\==e then if x.e  then iterate /*expression already used?*/\n                          x.e= 1                 /*mark this expression as being used.  */\n                          end\n          interpret 'x=('   e   \") / 1\"          /*have REXX do the heavy lifting here. */\n          if x\\==$  then do                      /*Not correct?   Then try again.       */\n                         numeric digits 9;    x= x / 1               /*re\u2500do evaluation.*/\n                         numeric digits 12                           /*re\u2500instate digits*/\n                         if x\\==$  then iterate  /*Not correct?   Then try again.       */\n                         end\n          finds= finds + 1                       /*bump number of found solutions.      */\n          if \\show | negatory  then return finds\n          _= translate(origE, '][', \")(\")                      /*display  [],  not  (). */\n          if show  then say indent   'a solution for'  gggg':'  $\"=\"  _ /*show solution.*/\n          if limit==1 & finds==limit  then leave gggg                   /*leave big loop*/\n          end     /*m*/\n        end       /*k*/\n      end         /*j*/\n    end           /*i*/\n  end             /*gggg*/\nreturn finds\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nsortc: procedure;  arg nnnn;           @.=        /*sorts the digits of   NNNN          */\n              do i=1  for length(nnnn); _= substr(nnnn, i, 1);   @._= @._||_;   end  /*i*/\n       return @.0 || @.1 || @.2 || @.3 || @.4 || @.5 || @.6 || @.7 || @.8 || @.9\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nvalidate: parse arg y;               errCode= 0;                       _v= verify(y, digs)\n                  select\n                  when y==''         then call ger 'no digits were entered.'\n                  when length(y)<4   then call ger 'not enough digits entered, must be 4'\n                  when length(y)>4   then call ger 'too many digits entered, must be 4'\n                  when pos(0,y)\\==0  then call ger \"can't use the digit  0 (zero)\"\n                  when _v\\==0        then call ger 'illegal character:'  substr(y, _v, 1)\n                  otherwise          nop\n                  end   /*select*/\n",
        "safe": true
    },
    {
        "filename": "24_game_146.txt",
        "content": "\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500 Using the numerals (digits)  1689, enter an expression that equals  24\n                                                             (or \u00a0?  or  Quit):\n8 * {9-6} / 1               \u25c4\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0\u25a0 this is the user input.\n\n                            \u250c\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2510\n                            \u2502                     \u2502\n                            \u2502  congratulations\u00a0!  \u2502\n                            \u2502                     \u2502\n                            \u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2518\n",
        "safe": true
    },
    {
        "filename": "24_game_147.txt",
        "content": "# Project\u00a0: 24 game\n\nload \"stdlib.ring\"\ndigits = list(4)\ncheck = list(4)\nfor choice = 1 to 4\n     digits[choice] = random(9)\nnext \n \nsee \"enter an equation (using all of, and only, the single digits \" + nl\nfor index = 1 to 4\n     see digits[index] \n     if index\u00a0!= 4 \n        see \" \"\n    ok\nnext\nsee \")\"\nsee \" which evaluates to exactly 24. only multiplication (*), division (/),\" + nl\nsee \"addition (+) & subtraction (-) operations and parentheses are allowed:\" + nl\nsee \"24 = \"\ngive equation\nsee \"equation = \" + equation + nl\n \nwhile true\n        for char = 1 to len(equation)\n             digit = substr(\"0123456789\", equation[char]) - 1\n             if digit >= 0\n                for index = 1 to 4\n                     if digit = digits[index] \n                        if not check[index]\n                           check[index] = 1\n                           exit\n                        ok\n                     ok\n                next \n                if index > 4 \n                   see \"sorry, you used the illegal digit \" + digit + nl\n                   exit 2 \n                ok\n            ok\n        next \n        for index = 1 to 4\n             if check[index] = 0\n                see \"sorry, you failed to use the digit \" + digits[index] + nl\n                exit 2\n             ok\n        next \n        for pair = 11 to 99\n             if substr(equation, string(pair))\n                see \"sorry, you may not use a pair of digits \" + pair + nl\n             ok \n        next \n        eval(\"result = \" + equation)\n        if result = 24\n           see \"congratulations, you succeeded in the task!\" + nl\n           exit\n        else\n           see \"sorry, your equation evaluated to \" + result + \" rather than 24!\" + nl\n        ok\nend",
        "safe": true
    },
    {
        "filename": "24_game_148.txt",
        "content": "enter an equation (using all of, and only, the single digits \n3 1 4 5) which evaluates to exactly 24. only multiplication (*), division (/),\naddition (+) & subtraction (-) operations and parentheses are allowed:\n24 = 4*5+3+1\nequation = 4*5+3+1\ncongratulations, you succeeded in the task!\n\nenter an equation (using all of, and only, the single digits \n5 7 2 5) which evaluates to exactly 24. only multiplication (*), division (/),\naddition (+) & subtraction (-) operations and parentheses are allowed:\n24 = 98+72\nequation = 98+72\nsorry, you used the illegal digit 9\n",
        "safe": true
    },
    {
        "filename": "24_game_149.txt",
        "content": "\u00ab\u00a0IF DUP TYPE 9. \u2260 THEN { } +                        @ stack contains a number\n  ELSE \n     CASE OBJ\u2192 SWAP 2. \u2260           THEN DROP 0 END   @ stack contains a monadic operator\n          \"+-*/\" SWAP \u2192STR POS NOT THEN DROP 0 END   @ stack contains a forbidden dyadic operator\n     END\n     GET4 SWAP GET4 +\n  END\n\u00bb 'GET4' STO                                         @ ( 'expression' \u2192 { numbers } )\n\n\u00ab\u00a01 CF\n  \u00ab\u00a0RAND 9 * CEIL R\u2192I\u00a0\u00bb 'x' 1 4 1 SEQ SORT           @ generate 4 numbers  \n  WHILE 1 FC? REPEAT \n    \"Make 24 with\" OVER \u2192STR 2 OVER SIZE 2 - SUB + \n    { \"'\" ALG V } INPUT                              @ asks for an evaluable string\n    CLLCD DUP TAIL 1 DISP \n    STR\u2192 DUP GET4\n    CASE DUP 0 POS                  THEN DROP2 \"Forbidden operator\" END \n         SORT 3 PICK \u2260              THEN DROP \"Bad number\" END \n         EVAL DUP \u2192NUM 3 DISP 24 == THEN 1 SF \"You won!\" END \n         \"Failed to get 24\"\n    END \n    2 DISP 2 WAIT\n  END DROP\n\u00bb 'GAM24' STO\n",
        "safe": true
    },
    {
        "filename": "24_game_15.txt",
        "content": "-----------------------------\n Welcome to 24 Game\n-----------------------------\nThe numbers you can use are: 3 2 2 1 \n\nEnter an expression to form 24: 3+2+2+1\\\nInvalid expression. Please try again!\n\nEnter an expression to form 24: 3+2+2+1\nThe result is: 8 \n\nEnter an expression to form 24: (3+3+3+3+3)+2+2+1+1\nThe result is: 21 \n\nEnter an expression to form 24: (3+3+3+3+3)+2+2+1+1+1          \nThe result is: 22 \n\nEnter an expression to form 24: 3+3+3+3+3+2+2+2+2+1+1\nThe result is: 25 \n\nEnter an expression to form 24: 3+3+3+3+3+2+2+2+2+1\nThe result is: 24 \n\nWell done!",
        "safe": true
    },
    {
        "filename": "24_game_150.txt",
        "content": "class Guess < String\n  def self.play\n    nums = Array.new(4){rand(1..9)}\n    loop do\n      result = get(nums).evaluate!\n      break if result == 24.0\n      puts \"Try again! That gives #{result}!\"\n    end\n    puts \"You win!\"\n  end\n  \n  def self.get(nums)\n    loop do\n      print \"\\nEnter a guess using #{nums}: \"\n      input = gets.chomp\n      return new(input) if validate(input, nums)\n    end\n  end\n  \n  def self.validate(guess, nums)\n    name, error =\n      {\n        invalid_character:  ->(str){ !str.scan(%r{[^\\d\\s()+*/-]}).empty? },\n        wrong_number:       ->(str){ str.scan(/\\d/).map(&:to_i).sort != nums.sort },\n        multi_digit_number: ->(str){ str.match(/\\d\\d/) }\n      }\n        .find {|name, validator| validator[guess] }\n    \n    error ? puts(\"Invalid input of a(n) #{name.to_s.tr('_',' ')}!\") : true\n  end\n  \n  def evaluate!\n    as_rat = gsub(/(\\d)/, '\\1r')        # r\u00a0: Rational suffix\n    eval \"(#{as_rat}).to_f\"\n  rescue SyntaxError\n    \"[syntax error]\"\n  end\nend\n\nGuess.play\n",
        "safe": true
    },
    {
        "filename": "24_game_151.txt",
        "content": "use std::io::{self,BufRead};\nextern crate rand;\nuse rand::Rng;\n\nfn op_type(x: char) -> i32{\n    match x {\n        '-' | '+' => return 1,\n        '/' | '*' => return 2,\n        '(' | ')' => return -1,\n        _   => return 0,\n    }\n}\n\nfn to_rpn(input: &mut String){\n\n    let mut rpn_string : String = String::new();\n    let mut rpn_stack : String = String::new();\n    let mut last_token = '#';\n    for token in input.chars(){\n        if token.is_digit(10) {\n            rpn_string.push(token);\n        }\n        else if op_type(token) == 0 {\n            continue;\n        }\n        else if op_type(token) > op_type(last_token) || token == '(' {\n                rpn_stack.push(token);\n                last_token=token;\n        }\n        else {\n            while let Some(top) = rpn_stack.pop() {\n                if top=='(' {\n                    break;\n                }\n                rpn_string.push(top);\n            }\n            if token != ')'{\n                rpn_stack.push(token);\n            }\n        }\n    }\n    while let Some(top) = rpn_stack.pop() {\n        rpn_string.push(top);\n    }\n\n    println!(\"you formula results in {}\", rpn_string);\n\n    *input=rpn_string;\n}\n\nfn calculate(input: &String, list : &mut [u32;4]) -> f32{\n    let mut stack : Vec<f32> = Vec::new();\n    let mut accumulator : f32 = 0.0;\n\n    for token in input.chars(){\n        if token.is_digit(10) {\n            let test = token.to_digit(10).unwrap() as u32;\n            match list.iter().position(|&x| x == test){\n                Some(idx) => list[idx]=10 ,\n                _         => println!(\" invalid digit: {} \",test),\n            }\n            stack.push(accumulator);\n            accumulator = test as f32;\n        }else{\n            let a = stack.pop().unwrap();\n            accumulator = match token {\n                '-' => a-accumulator,\n                '+' => a+accumulator,\n                '/' => a/accumulator,\n                '*' => a*accumulator,\n                _ => {accumulator},//NOP\n            };\n        }\n    }\n    println!(\"you formula results in {}\",accumulator);\n    accumulator\n}\n\nfn main() {\n\n    let mut rng = rand::thread_rng();\n    let mut list :[u32;4]=[rng.gen::<u32>()%10,rng.gen::<u32>()%10,rng.gen::<u32>()%10,rng.gen::<u32>()%10];\n\n    println!(\"form 24 with using + - / * {:?}\",list);\n    //get user input\n    let mut input = String::new();\n    io::stdin().read_line(&mut input).unwrap();\n    //convert to rpn\n    to_rpn(&mut input);\n    let result = calculate(&input, &mut list);\n\n    if list.iter().any(|&list| list !=10){\n        println!(\"and you used all numbers\");\n        match result {\n            24.0 => println!(\"you won\"),\n            _ => println!(\"but your formulla doesn't result in 24\"),\n        }\n    }else{\n        println!(\"you didn't use all the numbers\");\n    }\n\n}\n",
        "safe": true
    },
    {
        "filename": "24_game_152.txt",
        "content": "object TwentyFourGame {\n  def main(args: Array[String]) {\n    import Parser.TwentyFourParser\n    \n    println(welcome)\n    \n    var parser = new TwentyFourParser(problemsIterator.next)\n    println(\"Your four digits: \"+parser+\".\")\n    \n    var finished = false\n    var expressionCount = 1\n    do {\n      val line = Console.readLine(\"Expression \"+expressionCount+\": \")\n      line match {\n        case \"!\" =>\n          parser = new TwentyFourParser(problemsIterator.next)\n          println(\"New digits: \"+parser+\".\")\n          \n        case \"q\" =>\n          finished = true\n        \n        case _ =>\n          parser readExpression line match {\n            case Some(24) => println(\"That's right!\"); finished = true\n            case Some(n) => println(\"Sorry, that's \"+n+\".\")\n            case None =>\n          }\n      }\n      expressionCount += 1\n    } while (!finished)\n    \n    println(\"Thank you and goodbye!\")\n  }\n  \n  val welcome = \"\"\"|The 24 Game\n                   |\n                   |Given any four digits in the range 1 to 9, which may have repetitions,\n                   |Using just the +, -, *, and / operators; and the possible use of\n                   |brackets, (), show how to make an answer of 24.\n                   |\n                   |An answer of \"q\" will quit the game.\n                   |An answer of \"!\" will generate a new set of four digits.\n                   |Otherwise you are repeatedly asked for an expression until it evaluates to 24\n                   |\n                   |Note: you cannot form multiple digit numbers from the supplied digits,\n                   |so an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\n                   |\"\"\".stripMargin\n  \n  val problemsIterator = (\n    Iterator \n    continually List.fill(4)(scala.util.Random.nextInt(9) + 1 toDouble) \n    filter hasSolution\n  )\n  \n  def hasSolution(l: List[Double]) = permute(l) flatMap computeAllOperations exists (_ == 24)\n  \n  def computeAllOperations(l: List[Double]): List[Double] = l match {\n    case Nil => Nil\n    case x :: Nil => l\n    case x :: xs =>\n      for {\n        y <- computeAllOperations(xs)\n        z <- if (y == 0) List(x*y, x+y, x-y) else List(x*y, x/y, x+y, x-y)\n      } yield z\n  }\n  \n  def permute(l: List[Double]): List[List[Double]] = l match {\n    case Nil => List(Nil)\n    case x :: xs =>\n      for {\n        ys <- permute(xs)\n        position <- 0 to ys.length\n        (left, right) = ys splitAt position\n      } yield left ::: (x :: right)\n  }\n  \n  object Parser {\n    /*  Arithmetic expression grammar production rules in EBNF form:\n     *\n     * <expr> --> <term> ( '+' <term> | '-' <term> )*\n     * <term> --> <factor> ( '*'  <factor> | '/'  <factor> )*\n     * <factor> --> '(' <expr> ')' | <digit>\n     * <digit> --> 0 | 1  | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9\n     * \n     * Semantically, <digit> can only be a digit from the list of remaining digits.\n     */\n    \n    class TwentyFourParser(digits: List[Double]) extends scala.util.parsing.combinator.RegexParsers {\n      require(digits.length == 4 && digits.forall(d => 0 <= d && d <= 9))\n      override val toString = digits.map(_.toInt).mkString(\", \")\n      \n      // Grammar\n      def exprConsumingAllDigits = expr ^? (remainingDigits.allDigitsConsumed, digitsRemainingError) // Guarantees all digits consumed\n      def expr : Parser[Double] = term ~ rep( \"+\" ~ term | \"-\" ~ term) ^^ solveOperationChain\n      def term = factor ~ rep( \"*\" ~ factor | \"/\" ~ factor) ^^ solveOperationChain\n      def factor = \"(\" ~> expr <~ \")\" | digit\n      def digit = digitRegex ^? (remainingDigits.consumeDigit, digitNotAllowedError) \n      def digitRegex = \"\\\\d\".r | digitExpected\n      def digitExpected: Parser[String] = \".\".r <~ failure(expectedDigitError) // Produces clear error messages\n    \n      // Evaluate expressions\n      def readExpression(input: String): Option[Double] = {\n        remainingDigits = new DigitList(digits) // Initialize list of digits to be consumed\n        parseAll(exprConsumingAllDigits, input) match {\n          case Success(result, _) => Some(result)\n          case NoSuccess(msg, next) =>\n            println(ParsingErrorFormatter(msg, next))\n            None\n        }\n      }\n      \n      // List of digits to be consumed\n      private var remainingDigits: DigitList = _\n      \n      // Solve partial results from parsing\n      private def solveOperationChain(partialResult: ~[Double,List[~[String,Double]]]): Double = partialResult match {\n        case first ~ chain => chain.foldLeft(first)(doOperation)\n      }\n      private def doOperation(acc: Double, op: ~[String, Double]): Double = op match {\n        case \"+\" ~ operand => acc + operand\n        case \"-\" ~ operand => acc - operand\n        case \"*\" ~ operand => acc * operand\n        case \"/\" ~ operand => acc / operand\n        case x => error(\"Unknown operation \"+x+\".\") \n      }\n      \n      // Error messages\n      private def digitNotAllowedError(d: String) = \"Digit \"+d+\" is not allowed here. Available digits: \"+remainingDigits+\".\"\n      private def digitsRemainingError(x: Any) = \"Not all digits were consumed. Digits remaining: \"+remainingDigits+\".\"\n      private def expectedDigitError = \"Unexpected input. Expected a digit from the list: \"+remainingDigits+\".\"\n    }\n    \n    private object ParsingErrorFormatter {\n      def apply[T](msg: String, next: scala.util.parsing.input.Reader[T]) =\n        \"%s\\n%s\\n%s\\n\" format (msg, next.source.toString.trim, \" \"*(next.offset - 1)+\"^\")\n    }\n    \n    private class DigitList(digits: List[Double]) {\n      private var remainingDigits = digits\n      override def toString = remainingDigits.map(_.toInt).mkString(\", \")\n      \n      def consumeDigit: PartialFunction[String, Double] = {\n        case d if remainingDigits contains d.toDouble =>\n          val n = d.toDouble\n          remainingDigits = remainingDigits diff List(n)\n          n\n      }\n      \n      def allDigitsConsumed: PartialFunction[Double, Double] = {\n        case n if remainingDigits.isEmpty => n\n      }\n    }\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "24_game_153.txt",
        "content": "C:\\Workset>scala TwentyFourGame\nThe 24 Game\n\nGiven any four digits in the range 1 to 9, which may have repetitions,\nUsing just the +, -, *, and / operators; and the possible use of\nbrackets, (), show how to make an answer of 24.\n\nAn answer of \"q\" will quit the game.\nAn answer of \"!\" will generate a new set of four digits.\nOtherwise you are repeatedly asked for an expression until it evaluates to 24\n\nNote: you cannot form multiple digit numbers from the supplied digits,\nso an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\n\nYour four digits: 2, 7, 7, 2.\nExpression 1: 2*7+2+7\nSorry, that's 23.0.\nExpression 2: 7*7/2-2\nSorry, that's 22.5.\nExpression 3: 2*7+(7-2)\nSorry, that's 19.0.\nExpression 4: 2*(7+7-2)\nThat's right!\nThank you and goodbye!\n",
        "safe": true
    },
    {
        "filename": "24_game_154.txt",
        "content": "#lang scheme\n(require srfi/27 srfi/1) ;; random-integer, every\n\n(define (play)\n  (let* ([numbers (build-list 4 (lambda (n)\n                                  (add1 (random-integer 9))))]\n         [valid?  (curryr valid? numbers)])\n    (printf startup-message numbers)\n    (let loop ([exp (read)])\n      (with-handlers ([exn:fail? (lambda (err)\n                                   (printf error-message exp (exn-message err))\n                                   (loop (read)))])\n       (cond [(eq? exp '!) (play)]\n             \n             [(or (eq? exp 'q)\n                  (eof-object? exp)) (printf quit-message)]\n             \n             [(not (valid? exp))\n              (printf bad-exp-message exp)\n              (loop (read))]\n            \n             [(not (= (eval exp) 24))\n              (printf bad-result-message exp (eval exp))\n              (loop (read))]\n            \n             [else (printf winning-message)])))))\n\n(define (valid? exp numbers)\n  ;; must contain each number exactly once and only valid symbols\n  (define (valid-symbol? sym)\n    ;; only +, -, *, and / are valid\n    (case sym\n      [(+ - * /) #t]\n      [else #f]))\n  \n  (let* ([ls (flatten exp)]\n         [numbers* (filter number? ls)]\n         [symbols  (remove number? ls)])\n    (and (equal? (sort numbers <)\n                 (sort numbers* <))\n         (every valid-symbol? symbols))))\n\n(define startup-message \"\nWrite a lisp expression that evaluates to 24\nusing only (, ), +, -, *, /\nand these four numbers: ~a\n\nor '!' to get a new set of numbers\nor 'q' to quit\")\n\n(define error-message \"\nYour expression ~a raised an exception:\n\n  \\\"~a\\\"\n\nPlease try again\")\n\n(define bad-exp-message \"Sorry, ~a is a bad expression.\")\n(define bad-result-message \"Sorry, ~a evaluates to ~a, not 24.\")\n(define quit-message \"Thanks for playing...\")\n(define winning-message \"You win!\")\n\n(provide play)\n",
        "safe": true
    },
    {
        "filename": "24_game_155.txt",
        "content": "> (require \"24game.ss\")\n> (play)\n\nWrite a lisp expression that evaluates to 24\nusing only (, ), +, -, *, /\nand these four numbers: (2 7 2 5)\n\nor '!' to get a new set of numbers\nor 'q' to quit\n!\n\nWrite a lisp expression that evaluates to 24\nusing only (, ), +, -, *, /\nand these four numbers: (9 2 7 6)\n\nor '!' to get a new set of numbers\nor 'q' to quit\n(9 7 6 2)\n\nYour expression (9 7 6 2) raised an exception:\n\n  \"procedure application: expected procedure, given: 9; arguments were: 7 6 2\"\n\nPlease try again\n(+ 9 7 6 2)\nYou win!\n",
        "safe": true
    },
    {
        "filename": "24_game_156.txt",
        "content": "const digits  = (1..9 -> pick(4))\nconst grammar = Regex(\n    '^ (?&exp) \\z\n      (?(DEFINE)\n          (?<exp> ( (?&term) (?&op) (?&term) )+ )\n          (?<term> \\( (?&exp) \\) | [' + digits.join + '])\n          (?<op> [\\-+*/] )\n      )', 'x'\n)\n\nsay \"Here are your digits: #{digits.join(' ')}\"\n\nloop {\n    var input = read(\"Expression: \", String)\n\n    var expr = input\n    expr -= /\\s+/g     # remove all whitespace\n\n    if (input == 'q') {\n        say \"Goodbye.  Sorry you couldn't win.\"\n        break\n    }\n\n    var given_digits = digits.map{.to_s}.sort.join\n    var entry_digits = input.scan(/\\d/).sort.join\n\n    if ((given_digits != entry_digits) || (expr !~ grammar)) {\n        say \"That's not valid\"\n        next\n    }\n\n    given(var n = eval(input)) {\n        when (24) { say \"You win!\"; break }\n        default   { say \"Sorry, your expression is #{n}, not 24\" }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "24_game_157.txt",
        "content": "Here are your digits: 8 2 3 4\nExpression: 8 * (2 - (3 + 4))    \nSorry, your expression is -40, not 24\nExpression: 8 * (2 - (3 -            \nThat's not valid\nExpression: 8 * (2 - (3 - 4))\nYou win!\n",
        "safe": true
    },
    {
        "filename": "24_game_158.txt",
        "content": "BEGIN\n\n    CLASS EXPR;\n    BEGIN\n\n\n        REAL PROCEDURE POP;\n        BEGIN\n            IF STACKPOS > 0 THEN\n            BEGIN STACKPOS\u00a0:= STACKPOS - 1; POP\u00a0:= STACK(STACKPOS); END;\n        END POP;\n\n\n        PROCEDURE PUSH(NEWTOP); REAL NEWTOP;\n        BEGIN\n            STACK(STACKPOS)\u00a0:= NEWTOP;\n            STACKPOS\u00a0:= STACKPOS + 1;\n        END PUSH;\n\n\n        REAL PROCEDURE CALC(OPERATOR, ERR); CHARACTER OPERATOR; LABEL ERR;\n        BEGIN\n            REAL X, Y; X\u00a0:= POP; Y\u00a0:= POP;\n            IF      OPERATOR = '+' THEN PUSH(Y + X)\n            ELSE IF OPERATOR = '-' THEN PUSH(Y - X)\n            ELSE IF OPERATOR = '*' THEN PUSH(Y * X)\n            ELSE IF OPERATOR = '/' THEN BEGIN\n                                            IF X = 0 THEN\n                                            BEGIN\n                                                EVALUATEDERR\u00a0:- \"DIV BY ZERO\";\n                                                GOTO ERR;\n                                            END;\n                                            PUSH(Y / X);\n                                        END\n            ELSE\n            BEGIN\n                EVALUATEDERR\u00a0:- \"UNKNOWN OPERATOR\";\n                GOTO ERR;\n            END\n        END CALC;\n\n\n        PROCEDURE READCHAR(CH); NAME CH; CHARACTER CH;\n        BEGIN\n            IF T.MORE THEN CH\u00a0:= T.GETCHAR ELSE CH\u00a0:= EOT;\n        END READCHAR;\n\n\n        PROCEDURE SKIPWHITESPACE(CH); NAME CH; CHARACTER CH;\n        BEGIN\n            WHILE (CH = SPACE) OR (CH = TAB) OR (CH = CR) OR (CH = LF) DO\n                READCHAR(CH);\n        END SKIPWHITESPACE;\n\n\n        PROCEDURE BUSYBOX(OP, ERR); INTEGER OP; LABEL ERR;\n        BEGIN\n            CHARACTER OPERATOR;\n            REAL NUMBR;\n            BOOLEAN NEGATIVE;\n\n            SKIPWHITESPACE(CH);\n\n            IF OP = EXPRESSION THEN\n            BEGIN\n\n                NEGATIVE\u00a0:= FALSE;\n                WHILE (CH = '+') OR (CH = '-') DO\n                BEGIN\n                    IF CH = '-' THEN NEGATIVE\u00a0:=  NOT NEGATIVE;\n                    READCHAR(CH);\n                END;\n\n                BUSYBOX(TERM, ERR);\n\n                IF NEGATIVE THEN\n                BEGIN\n                    NUMBR\u00a0:= POP; PUSH(0 - NUMBR);\n                END;\n\n                WHILE (CH = '+') OR (CH = '-') DO\n                BEGIN\n                    OPERATOR\u00a0:= CH; READCHAR(CH);\n                    BUSYBOX(TERM, ERR); CALC(OPERATOR, ERR);\n                END;\n\n            END\n            ELSE IF OP = TERM THEN\n            BEGIN\n\n                BUSYBOX(FACTOR, ERR);\n                WHILE (CH = '*') OR (CH = '/') DO\n                BEGIN\n                    OPERATOR\u00a0:= CH; READCHAR(CH);\n                    BUSYBOX(FACTOR, ERR); CALC(OPERATOR, ERR)\n                END\n\n            END\n            ELSE IF OP = FACTOR THEN\n            BEGIN\n\n                IF (CH = '+') OR (CH = '-') THEN\n                  BUSYBOX(EXPRESSION, ERR)\n                ELSE IF (CH >= '0') AND (CH <= '9') THEN\n                  BUSYBOX(NUMBER, ERR)\n                ELSE IF CH = '(' THEN\n                BEGIN\n                    READCHAR(CH);\n                    BUSYBOX(EXPRESSION, ERR);\n                    IF CH = ')' THEN READCHAR(CH) ELSE GOTO ERR;\n                END\n                ELSE GOTO ERR;\n\n            END\n            ELSE IF OP = NUMBER THEN\n            BEGIN\n\n                NUMBR\u00a0:= 0;\n                WHILE (CH >= '0') AND (CH <= '9') DO\n                BEGIN\n                    NUMBR\u00a0:= 10 * NUMBR + RANK(CH) - RANK('0'); READCHAR(CH);\n                END;\n                IF CH = '.' THEN\n                BEGIN\n                    REAL FAKTOR;\n                    READCHAR(CH);\n                    FAKTOR\u00a0:= 10;\n                    WHILE (CH >= '0') AND (CH <= '9') DO\n                    BEGIN\n                        NUMBR\u00a0:= NUMBR + (RANK(CH) - RANK('0')) / FAKTOR;\n                        FAKTOR\u00a0:= 10 * FAKTOR;\n                        READCHAR(CH);\n                    END;\n                END;\n                PUSH(NUMBR);\n\n            END;\n\n            SKIPWHITESPACE(CH);\n\n        END BUSYBOX;\n\n\n        BOOLEAN PROCEDURE EVAL(INP); TEXT INP;\n        BEGIN\n            EVALUATEDERR\u00a0:- NOTEXT;\n            STACKPOS\u00a0:= 0;\n            T\u00a0:- COPY(INP.STRIP);\n            READCHAR(CH);\n            BUSYBOX(EXPRESSION, ERRORLABEL);\n         \u00a0! OUTTEXT(\"T = '\");\n         \u00a0! OUTTEXT(T);\n         \u00a0! OUTTEXT(\"'\");\n         \u00a0! OUTTEXT(\", T.POS = \");\n         \u00a0! OUTINT(T.POS, 0);\n         \u00a0! OUTTEXT(\", STACKPOS = \");\n         \u00a0! OUTINT(STACKPOS, 0);\n         \u00a0! OUTTEXT(\", T.MORE = \");\n         \u00a0! OUTCHAR(IF T.MORE THEN 'T' ELSE 'F');\n         \u00a0! OUTTEXT(\", CH = \");\n         \u00a0! OUTCHAR(CH);\n         \u00a0! OUTIMAGE;\n            IF NOT T.MORE AND STACKPOS = 1 AND CH = EOT THEN\n            BEGIN\n                EVALUATED\u00a0:= POP;\n                EVAL\u00a0:= TRUE;\n                GOTO NOERRORLABEL;\n            END;\n    ERRORLABEL:\n            EVAL\u00a0:= FALSE;\n            IF EVALUATEDERR = NOTEXT THEN\n                EVALUATEDERR\u00a0:- \"INVALID EXPRESSION: \" & INP;\n    NOERRORLABEL:\n        END EVAL;\n\n        \n        REAL PROCEDURE RESULT;\n            RESULT\u00a0:= EVALUATED;\n\n        TEXT PROCEDURE ERR;\n            ERR\u00a0:- EVALUATEDERR;\n\n        TEXT T;\n\n        INTEGER EXPRESSION;\n        INTEGER TERM;\n        INTEGER FACTOR;\n        INTEGER NUMBER;\n\n        CHARACTER TAB;\n        CHARACTER LF;\n        CHARACTER CR;\n        CHARACTER SPACE;\n        CHARACTER EOT;\n\n        CHARACTER CH;\n        REAL ARRAY STACK(0:31);\n        INTEGER STACKPOS;\n\n        REAL EVALUATED;\n        TEXT EVALUATEDERR;\n\n        EXPRESSION\u00a0:= 1;\n        TERM\u00a0:= 2;\n        FACTOR\u00a0:= 3;\n        NUMBER\u00a0:= 4;\n\n        TAB\u00a0:= CHAR(9);\n        LF\u00a0:= CHAR(10);\n        CR\u00a0:= CHAR(13);\n        SPACE\u00a0:= CHAR(32);\n        EOT\u00a0:= CHAR(0);\n\n    END EXPR;\n\n    INTEGER ARRAY DIGITS(1:4);\n    INTEGER SEED, I;\n    REF(EXPR) E;\n\n    E\u00a0:- NEW EXPR;\n    OUTTEXT(\"ENTER RANDOM SEED: \");\n    OUTIMAGE;\n    SEED\u00a0:= ININT;\n    FOR I\u00a0:= 1 STEP 1 UNTIL 4 DO DIGITS(I)\u00a0:= RANDINT(0, 9, SEED);\n\nL:  BEGIN\n        INTEGER ARRAY DIGITSUSED(0:9);\n        INTEGER ARRAY DIGITSTAKEN(0:9);\n        CHARACTER C, LASTC;\n        TEXT INP;\n\n        LASTC\u00a0:= CHAR(0);\n        OUTTEXT(\"MAKE 24 USING THESE DIGITS: \");\n        FOR I\u00a0:= 1 STEP 1 UNTIL 4 DO\n        BEGIN\n            OUTINT(DIGITS(I), 2);\n            DIGITSUSED( DIGITS(I) )\u00a0:= DIGITSUSED( DIGITS(I) ) + 1;\n        END;\n        OUTIMAGE;\n        INIMAGE;\n        INP\u00a0:- COPY(SYSIN.IMAGE.STRIP);\n        OUTIMAGE;\n        WHILE INP.MORE DO\n        BEGIN\n            C\u00a0:= INP.GETCHAR;\n            IF (C >= '0') AND (C <= '9') THEN\n            BEGIN\n                INTEGER D;\n                IF (LASTC >= '0') AND (LASTC <= '9') THEN\n                BEGIN\n                    OUTTEXT(\"NUMBER HAS TOO MANY DIGITS: \");\n                    OUTCHAR(LASTC);\n                    OUTCHAR(C);\n                    OUTIMAGE;\n                    GOTO L;\n                END;\n                D\u00a0:= RANK(C) - RANK('0');\n                DIGITSTAKEN(D)\u00a0:= DIGITSTAKEN(D) + 1;\n            END\n            ELSE IF NOT ((C = '+') OR (C = '-') OR (C = '/') OR (C = '*') OR\n                         (C = ' ') OR (C = '(') OR (C = ')')) THEN\n            BEGIN\n                OUTTEXT(\"ILLEGAL INPUT CHARACTER: \");\n                OUTCHAR(C);\n                OUTIMAGE;\n                GOTO L;\n            END;\n            LASTC\u00a0:= C;\n        END;\n        FOR I\u00a0:= 0 STEP 1 UNTIL 9 DO\n        BEGIN\n            IF DIGITSUSED(I) <> DIGITSTAKEN(I) THEN\n            BEGIN\n                OUTTEXT(\"NOT THE SAME DIGITS.\");\n                OUTIMAGE;\n                GOTO L;\n            END;\n        END;\n        IF E.EVAL(INP) THEN\n        BEGIN\n            OUTTEXT(\"RESULT IS \");\n            OUTFIX(E.RESULT, 4, 10);\n            OUTIMAGE;\n            OUTTEXT(IF ABS(E.RESULT - 24) < 0.001\n                    THEN \"YOU WIN\"\n                    ELSE \"YOU LOOSE\");\n            OUTIMAGE;\n        END\n        ELSE\n        BEGIN\n            OUTTEXT(E.ERR);\n            OUTIMAGE;\n        END;\n    END;\n\nEND.",
        "safe": true
    },
    {
        "filename": "24_game_159.txt",
        "content": "ENTER RANDOM SEED:\n",
        "safe": true
    },
    {
        "filename": "24_game_16.txt",
        "content": "AutoExecute: \n    Title := \"24 Game\" \n    Gui, -MinimizeBox \n    Gui, Add, Text, w230 vPuzzle \n    Gui, Add, Edit, wp vAnswer \n    Gui, Add, Button, w70, &Generate \n    Gui, Add, Button, x+10 wp Default, &Submit \n    Gui, Add, Button, x+10 wp, E&xit \n\n\nButtonGenerate:\u00a0; new set of numbers \n    Loop, 4 \n        Random, r%A_Index%, 1, 9 \n    Puzzle = %r1%, %r2%, %r3%, and %r4% \n    GuiControl,, Puzzle, The numbers are:  %Puzzle%  - Good luck! \n    GuiControl,, Answer\u00a0; empty the edit box \n    ControlFocus, Edit1 \n    Gui, -Disabled \n    Gui, Show,, %Title% \nReturn\u00a0; end of auto execute section \n\n\nButtonSubmit:\u00a0; check solution \n    Gui, Submit, NoHide \n    Gui, +Disabled \n\n   \u00a0; check numbers used \n    RegExMatch(Answer, \"(\\d)\\D+(\\d)\\D+(\\d)\\D+(\\d)\", $) \n    ListPuzzle := r1 \",\" r2 \",\" r3 \",\" r4 \n    ListAnswer := $1 \",\" $2 \",\" $3 \",\" $4 \n    Sort, ListPuzzle, D, \n    Sort, ListAnswer, D, \n    If Not ListPuzzle = ListAnswer { \n        MsgBox, 48, Error - %Title%, Numbers used!`n%Answer% \n        Goto, TryAgain \n    } \n\n   \u00a0; check operators used \n    StringReplace, $, $, +,, All \n    StringReplace, $, $, -,, All \n    StringReplace, $, $, *,, All \n    StringReplace, $, $, /,, All \n    StringReplace, $, $, (,, All \n    StringReplace, $, $, ),, All \n    Loop, 9 \n        StringReplace, $, $, %A_Index%,, All \n    If StrLen($) > 0 \n    Or InStr(Answer, \"**\") \n    Or InStr(Answer, \"//\") \n    Or InStr(Answer, \"++\") \n    Or InStr(Answer, \"--\") { \n        MsgBox, 48, Error - %Title%, Operators used!`n%Answer% \n        Goto, TryAgain \n    } \n\n   \u00a0; check result \n    Result := Eval(Answer) \n    If Not Result = 24 { \n        MsgBox, 48, Error - %Title%, Result incorrect!`n%Result% \n        Goto, TryAgain \n    } \n\n   \u00a0; if we are sill here \n    MsgBox, 4, %Title%, Correct solution! Play again? \n    IfMsgBox, Yes \n        Gosub, ButtonGenerate \n    Else \n        ExitApp \nReturn \n\n\nTryAgain:\u00a0; alternative ending of routine ButtonSubmit \n    ControlFocus, Edit1 \n    Gui, -Disabled \n    Gui, Show \nReturn \n\n\nGuiClose: \nGuiEscape: \nButtonExit: \n    ExitApp \nReturn \n\n\n;--------------------------------------------------------------------------- \nEval(Expr) {\u00a0; evaluate expression using separate AHK process \n;--------------------------------------------------------------------------- \n   \u00a0; credit for this function goes to AutoHotkey forum member Laszlo \n   \u00a0; http://www.autohotkey.com/forum/topic9578.html \n   \u00a0;----------------------------------------------------------------------- \n    static File := \"24$Temp.ahk\" \n\n   \u00a0; delete old temporary file, and write new \n    FileDelete, %File% \n    FileContent := \"#NoTrayIcon`r`n\" \n                .  \"FileDelete, \" File \"`r`n\" \n                .  \"FileAppend, `% \" Expr \", \" File \"`r`n\" \n    FileAppend, %FileContent%, %File% \n\n   \u00a0; run AHK to execute temp script, evaluate expression \n    RunWait, %A_AhkPath% %File% \n\n   \u00a0; get result \n    FileRead, Result, %File% \n    FileDelete, %File% \n    Return, Result \n}\n",
        "safe": true
    },
    {
        "filename": "24_game_160.txt",
        "content": "787\n",
        "safe": true
    },
    {
        "filename": "24_game_161.txt",
        "content": "MAKE 24 USING THESE DIGITS:  6 7 3 9\n",
        "safe": true
    },
    {
        "filename": "24_game_162.txt",
        "content": "(9 - 7 + 6) * 3\n",
        "safe": true
    },
    {
        "filename": "24_game_163.txt",
        "content": "RESULT IS    24.0000\nYOU WIN\n",
        "safe": true
    },
    {
        "filename": "24_game_164.txt",
        "content": "import Darwin\nimport Foundation\n\nprintln(\"24 Game\")\nprintln(\"Generating 4 digits...\")\n\nfunc randomDigits() -> Int[] {\n    var result = Int[]();\n    for var i = 0; i < 4; i++ {\n        result.append(Int(arc4random_uniform(9)+1))\n    }\n    return result;\n}\n\n// Choose 4 digits\nlet digits = randomDigits()\n\nprint(\"Make 24 using these digits\u00a0: \")\n\nfor digit in digits {\n    print(\"\\(digit) \")\n}\nprintln()\n\n// get input from operator\nvar input = NSString(data:NSFileHandle.fileHandleWithStandardInput().availableData, encoding:NSUTF8StringEncoding)\n\nvar enteredDigits = Int[]()\n\nvar enteredOperations = Character[]()\n\nlet inputString = input as String\n\n// store input in the appropriate table\nfor character in inputString {\n    switch character {\n        case \"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\":\n            let digit = String(character)\n            enteredDigits.append(digit.toInt()!)\n        case \"+\", \"-\", \"*\", \"/\":\n            enteredOperations.append(character)\n        case \"\\n\":\n            println()\n        default:\n            println(\"Invalid expression\")\n    }\n}\n\n// check value of expression provided by the operator\nvar value = Int()\n\nif enteredDigits.count == 4 && enteredOperations.count == 3 {\n    value = enteredDigits[0]\n    for (i, operation) in enumerate(enteredOperations) {\n        switch operation {\n            case \"+\":\n                value = value + enteredDigits[i+1]\n            case \"-\":\n                value = value - enteredDigits[i+1]\n            case \"*\":\n                value = value * enteredDigits[i+1]\n            case \"/\":\n                value = value / enteredDigits[i+1]\n            default:\n                println(\"This message should never happen!\")\n        }\n    }\n}\n\nif value != 24 {\n    println(\"The value of the provided expression is \\(value) instead of 24!\")\n} else {\n    println(\"Congratulations, you found a solution!\")\n}\n",
        "safe": true
    },
    {
        "filename": "24_game_165.txt",
        "content": "# Four random non-zero digits\nproc choose4 {} {\n    set digits {}\n    foreach x {1 2 3 4} {lappend digits [expr {int(1+rand()*9)}]}\n    return [lsort $digits]\n}\n\n# Print out a welcome message\nproc welcome digits {\n    puts [string trim \"\nThe 24 Game\n\nGiven any four digits in the range 1 to 9, which may have repetitions,\nUsing just the +, -, *, and / operators; and the possible use of\nbrackets, (), show how to make an answer of 24.\n\nAn answer of \\\"q\\\" will quit the game.\nAn answer of \\\"!\\\" will generate a new set of four digits.\nOtherwise you are repeatedly asked for an expression until it evaluates to 24\n\nNote: you cannot form multiple digit numbers from the supplied digits,\nso an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\n    \"]\n    puts \"\\nYour four digits: $digits\"\n}\n\n# Check whether we've got a legal answer\nproc check {answer digits} {\n    if {\n\t[regexp \"\\[^-+*/() \\t[join $digits {}]\\]\" $answer]\n\t|| [regexp {\\d\\d} $answer]\n    } then {\n\treturn false\n    }\n    set digs [lsort [regexp -inline -all {\\d} $answer]]\n    if {$digs ne $digits} {\n\treturn false\n    }\n    expr {![catch {expr $answer}]}\n}\n\n# The main game loop\nproc main {} {\n    fconfigure stdout -buffering none\n\n    set digits [choose4]\n    welcome $digits\n    set trial 0\n    while true {\n\tputs -nonewline \"Expression [incr trial]: \"\n\tgets stdin answer\n\n        # Check for various types of non-answer\n\tif {[eof stdin] || $answer eq \"q\" || $answer eq \"Q\"} {\n\t    break\n\t} elseif {$answer eq \"!\"} {\n\t    set digits [choose4]\n\t    puts \"New digits: $digits\"\n\t    continue\n\t} elseif {![check $answer $digits]} {\n\t    puts \"The input '$answer' was wonky!\"\n            continue\n\t}\n\n        # Check to see if it is the right answer\n\tset ans [expr [regsub {\\d} $answer {&.0}]]\n\tputs \" = [string trimright $ans .0]\"\n\tif {$ans == 24.0} {\n\t    puts \"That's right!\"\n            break\n\t}\n    }\n    puts \"Thank you and goodbye\"\n}\nmain\n",
        "safe": true
    },
    {
        "filename": "24_game_166.txt",
        "content": "function startTwentyFourGame()\n{\n\tif($numbers\u00a0!$= \"\")\n\t{\n\t\techo(\"Ending current 24 game...\");\n\t\tendTwentyFourGame();\n\t}\n\t\n\techo(\"Welcome to the 24 game!\");\n\techo(\"Generating 4 numbers...\");\n\tfor(%a = 0; %a < 4; %a++)\n\t\t$numbers = setWord($numbers, %a, getRandom(0, 9));\n\t\n\techo(\"Numbers generated! Here are your numbers:\");\n\techo($numbers);\n\techo(\"Use try24Equation( equation ); to try and guess the equation.\");\n\t\n\t$TwentyFourGame = 1;\n}\n\nfunction endTwentyFourGame()\n{\n\tif(!$TwentyFourGame)\n\t{\n\t\techo(\"No 24 game is active!\");\n\t\treturn false;\n\t}\n\t\n\techo(\"Ending the 24 game.\");\n\t$numbers = \"\";\n\t$TwentyFourGame = 0;\n}\n\nfunction try24Equation(%equ)\n{\n\tif(!$TwentyFourGame)\n\t{\n\t\techo(\"No 24 game is active!\");\n\t\treturn false;\n\t}\n\t%numbers = \"0123456789\";\n\t%operators = \"+-*x/()\";\n\t%tempchars = $numbers;\n\t%other = strReplace(%tempchars, \" \", \"\");\n\t\n\t//Check it and make sure it has all the stuff\n\t%equ = strReplace(%equ, \" \", \"\");\n\t%length = strLen(%equ);\n\t\n\tfor(%a = 0; %a < %Length; %a++)\n\t{\n\t\t%Char = getSubStr(%equ, %a, 1);\n\t\tif(%a+1\u00a0!= %Length)\n\t\t\t%Next = getSubStr(%equ, %a+1, 1);\n\t\telse\n\t\t\t%Next = \" \";\n\t\t\n\t\tif(strPos(%numbers @ %operators, %char) < 0)\n\t\t{\n\t\t\techo(\"The equation you entered is invalid! Try again.\");\n\t\t\treturn false;\n\t\t}\n\t\tif(strPos(%tempchars, %char) < 0 && strPos(%operators, %char) < 0)\n\t\t{\n\t\t\techo(\"The equation you entered uses a number you were not given! Try again.\");\n\t\t\treturn false;\n\t\t}\n\t\telse if(strPos(%numbers, %next) >= 0 && strPos(%numbers, %char) >= 0)\n\t\t{\n\t\t\techo(\"No numbers above 9 please! Try again.\");\n\t\t\techo(%next SPC %char SPC %a);\n\t\t\treturn false;\n\t\t}\n\t\telse if(strPos(%operators, %char) > 0)\n\t\t\tcontinue;\n\t\t\n\t\t%pos = 2*strPos(%other, %char);\n\t\tif(%pos < 0)\n\t\t\treturn \"ERROROMG\";\n\t\t\n\t\t//Remove it from the allowed numbers\n\t\t%tempchars = removeWord(%tempchars, %pos/2);\n\t\t%other = getSubStr(%other, 0, %pos) @ getSubStr(%other, %pos+1, strLen(%other));\n    }\n    \n    %result = doEquation(%equ);\n    \n    if(%result\u00a0!= 24)\n    {\n        echo(\"Your equation resulted to\" SPC %result @ \", not 24! Try again.\");\n        return false;\n    }\n    \n    for(%a = 0; %a < 4; %a++)\n        $numbers = setWord($numbers, %a, getRandom(0, 9));\n    \n    echo(\"Great job!\" SPC %equ SPC \"Does result to 24! Here's another set for you:\");\n    echo($numbers);\n}\n\n//Evaluates an equation without using eval.\nfunction doEquation(%equ)\n{   //Validate the input\n    %equ = strReplace(%equ, \" \", \"\");%equ = strReplace(%equ, \"*\", \"x\");\n    %equ = strReplace(%equ, \"+\", \" + \");%equ = strReplace(%equ, \"x\", \" x \");\n    %equ = strReplace(%equ, \"/\", \" / \");%equ = strReplace(%equ, \"-\", \" - \");\n    \n    //Parenthesis'\n    while(strPos(%equ, \"(\") > -1 && strPos(%equ, \")\") > 0)\n    {\n        %start = strPos(%equ, \"(\");\n        %end = %start;\n        %level = 1;\n        while(%level\u00a0!= 0 && %end\u00a0!= strLen(%equ))\n        {\n            %end++;\n            if(getsubStr(%equ, %end, 1) $= \"(\") %level++;\n            if(getsubStr(%equ, %end, 1) $= \")\") %level--;\n        }\n        if(%level\u00a0!= 0)\n            return \"ERROR\";\n        %inbrackets = getsubStr(%equ, %start+1, %end - strLen(getsubStr(%equ, 0, %start + 1)));\n        %leftofbrackets = getsubStr(%equ, 0, %start);\n        %rightofbrackets = getsubStr(%equ, %end + 1, strLen(%equ) - %end);\n        %equ = %leftofbrackets @ doEquation(%inbrackets) @ %rightofbrackets;\n    }\n    \n    if(strPos(%equ, \"ERROR\") >= 0)\n        return \"ERROR\";\n    \n    //Multiplication/Division loop\n    for(%a = 0; %a < getWordCount(%equ); %a++)\n    {\n        if(getWord(%equ, %a) $= \"x\" || getWord(%equ, %a) $= \"/\" && %a\u00a0!= 0)\n        {\n            %f = getWord(%equ, %a - 1);\n            %l = getWord(%equ, %a + 1);\n            %o = getWord(%equ, %a);\n            switch$(%o)\n            {\n                case \"x\": %a--;\n                    %equ = removeWord(removeWord(setWord(%equ, %a+1, %f * %l), %a+2), %a);\n                case \"/\": %a--;\n                    %equ = removeWord(removeWord(setWord(%equ, %a+1, %f / %l), %a+2), %a);\n            }\n        }\n    }\n    \n    //Addition/Subraction loop\n    for(%a = 0; %a < getWordCount(%equ); %a++)\n    {\n        if(getWord(%equ, %a) $= \"+\" || getWord(%equ, %a) $= \"-\" && %a\u00a0!= 0)\n        {\n            %f = getWord(%equ, %a - 1);\n            %l = getWord(%equ, %a + 1);\n            %o = getWord(%equ, %a);\n            switch$(%o)\n            {\n                case \"+\": %a--;\n                    %equ = removeWord(removeWord(setWord(%equ, %a+1, %f + %l), %a+2), %a);\n                case \"-\": %a--;\n                    %equ = removeWord(removeWord(setWord(%equ, %a+1, %f - %l), %a+2), %a);\n            }\n        }\n    }\n    return %equ;\n}",
        "safe": true
    },
    {
        "filename": "24_game_167.txt",
        "content": "$$ MODE TUSCRIPT\nBUILD X_TABLE blanks = \":':\u00a0:\"\n\nSECTION game\noperators=\"*'/'+'-'(')\",numbers=\"\"\n\nLOOP n=1,4\nnumber=RANDOM_NUMBERS (1,9,1)\nnumbers=APPEND(numbers,number)\nENDLOOP\n\nSET allowed=APPEND (numbers,operators)\nSET allowed=MIXED_SORT (allowed)\nSET allowed=REDUCE (allowed)\nBUILD S_TABLE ALLOWED =*\nDATA '{allowed}'\n\nSET checksum=DIGIT_SORT (numbers)\n\nprintnumbers=EXCHANGE (numbers,blanks)\nprintoperat=EXCHANGE (operators,blanks)\n\nPRINT \"Your numbers \", printnumbers\nPRINT \"Use only these operators \", printoperat\nPRINT \"Enter an expression that equates to 24\"\nPRINT \"Enter 'l' for new numbers\"\nPRINT \"Your 4 digits: \",printnumbers\n\nDO play\nENDSECTION\n\nSECTION check_expr\n SET pos = VERIFY (expr,allowed)\n IF (pos!=0) THEN\n  PRINT \"wrong entry on position \",pos\n  DO play\n  STOP\n ELSE\n  SET yourdigits   = STRINGS (expr,\":>/:\")\n  SET yourchecksum = DIGIT_SORT (yourdigits)\n   IF (checksum!=yourchecksum) THEN\n    PRINT/ERROR \"wrong digits\"\n    DO play\n    STOP\n   ELSE\n    CONTINUE\n   ENDIF\n ENDIF\nENDSECTION\n\nSECTION play\nLOOP n=1,3\nASK   \"Expression {n}\": expr=\"\"\nIF (expr==\"l\") THEN\nRELEASE S_TABLE allowed\nPRINT \"Your new numbers\"\nDO game\nELSEIF (expr!=\"\") THEN\nDO check_expr\nsum={expr}\n IF (sum!=24) THEN\n  PRINT/ERROR expr,\" not equates 24 but \",sum\n  CYCLE\n ELSE\n  PRINT \"BINGO \", expr,\" equates \", sum\n  STOP\n ENDIF\nELSE\n CYCLE\nENDIF\nENDLOOP\nENDSECTION\nDO game",
        "safe": true
    },
    {
        "filename": "24_game_168.txt",
        "content": "Your numbers 2 8 9 9\nUse only these operators * / + - ( )\nEnter an expression that equates to 24\nEnter 'l' for new numbers\nYour 4 digits: 2 8 9 9\nExpression 1 >l\nYour new numbers\nYour numbers 2 4 2 3\nUse only these operators * / + - ( )\nEnter an expression that equates to 24\nEnter 'l' for new numbers\nYour 4 digits: 2 4 2 3\nExpression 1 >2+4+2+3\n@@@@@@@@  2+4+2+3 not equates 24 but 11                                @@@@@@@@\nExpression 2 >2+2+2+3\n@@@@@@@@  wrong digits                                                 @@@@@@@@\nExpression 1 >2+2+a+3\nwrong entry on position 5\nExpression 1 >(2+4+2)*3\nBINGO (2+4+2)*3 equates 24\n",
        "safe": true
    },
    {
        "filename": "24_game_169.txt",
        "content": "gen_digits() {\n    awk 'BEGIN { srand()\n                 for(i = 1; i <= 4; i++) print 1 + int(9 * rand())\n         }' | sort\n}\n\nsame_digits() {\n    [ \"$(tr -dc 0-9 | sed 's/./&\\n/g' | grep . | sort)\" = \"$*\" ]\n}\n\nguessed() {\n    [ \"$(echo \"$1\" | tr -dc '\\n0-9()*/+-' | bc 2>/dev/null)\" = 24 ]\n}\n    \n\nwhile :\ndo\n    digits=$(gen_digits)\n    echo\n    echo Digits: $digits\n    read -r expr\n\n    echo \" $expr\" | same_digits \"$digits\" || \\\n        { echo digits should be: $digits; continue; }\n\n    guessed \"$expr\" && message=correct \\\n                    || message=wrong\n\n    echo $message\ndone\n",
        "safe": true
    },
    {
        "filename": "24_game_17.txt",
        "content": ";AutoIt Script Example\n;by Daniel Barnes\n;spam me at djbarnes at orcon dot net dot en zed\n;13/08/2012\n\n;Choose four random digits (1-9) with repetitions allowed:\nglobal $digits\nFOR $i = 1 TO 4\n\t$digits &= Random(1,9,1)\nNEXT\n\nWhile 1\n\tmain()\nWEnd\n\nFunc main()\n\t$text  = \"Enter an equation (using all of, and only, the single digits \"&$digits &\")\"&@CRLF\n\t$text &= \"which evaluates to exactly 24. Only multiplication (*) division (/)\"&@CRLF\n\t$text &= \"addition (+) and subtraction (-) operations and parentheses are allowed:\"\n\t$input = InputBox (\"24 Game\",$text,\"\",\"\",400,150)\n\tIf @error Then exit\n\n\t;remove any spaces in input\n\t$input = StringReplace($input,\" \",\"\")\n\n\t;check correct characters were used\n\tFor $i = 1 To StringLen($input)\n\t\t$chr = StringMid($input,$i,1)\n\t\tIf Not StringInStr(\"123456789*/+-()\",$chr) Then\n\t\t\tMsgBox (0, \"ERROR\",\"Invalid character used: '\"&$chr&\"'\")\n\t\t\treturn\n\t\tendif\n\tNext\n\n\t;validate the equation uses all of the 4 characters, and nothing else\n\t$test = $input\n\t$test = StringReplace($test,\"(\",\"\")\n\t$test = StringReplace($test,\")\",\"\")\n\n\t;validate the length of the input - if its not 7 characters long then the user has done something wrong\n\tIf StringLen ($test) <> 7 Then\n\t\tMsgBox (0,\"ERROR\",\"The equation \"&$test&\" is invalid\")\n\t\treturn\n\tendif\n\n\t$test = StringReplace($test,\"/\",\"\")\n\t$test = StringReplace($test,\"*\",\"\")\n\t$test = StringReplace($test,\"-\",\"\")\n\t$test = StringReplace($test,\"+\",\"\")\n\n\tFor $i = 1 To StringLen($digits)\n\t\t$digit = StringMid($digits,$i,1)\n\t\tFor $ii = 1 To StringLen($test)\n\t\t\tIf  StringMid($test,$ii,1) = $digit Then\n\t\t\t\t$test = StringLeft($test,$ii-1) & StringRight($test,StringLen($test)-$ii)\n\t\t\t\tExitLoop\n\t\t\tendif\n\t\tNext\n\tNext\n\tIf $test <> \"\" Then\n\t\tMsgBox (0, \"ERROR\", \"The equation didn't use all 4 characters, and nothing else!\")\n\t\treturn\n\tendif\n\n\t$try = Execute($input)\n\n\tIf $try = 24 Then\n\t\tMsgBox (0, \"24 Game\",\"Well done. Your equation (\"&$input&\") = 24!\")\n\t\tExit\n\tElse\n\t\tMsgBox (0, \"24 Game\",\"Fail. Your equation (\"&$input&\") = \"&$try&\"!\")\n\t\treturn\n\tendif\nEndFunc\n",
        "safe": true
    },
    {
        "filename": "24_game_170.txt",
        "content": "Sub Rosetta_24game()\n\nDim Digit(4) As Integer, i As Integer, iDigitCount As Integer\nDim stUserExpression As String\nDim stFailMessage As String, stFailDigits As String\nDim bValidExpression As Boolean, bValidDigits As Boolean, bValidChars As Boolean\nDim vResult As Variant, vTryAgain As Variant, vSameDigits As Variant\n\n' Generate 4 random digits\nGenerateNewDigits:\n    For i = 1 To 4\n        Digit(i) = [randbetween(1,9)]\n    Next i\n\n' Get user expression\nGetUserExpression:\n    bValidExpression = True\n    stFailMessage = \"\"\n    stFailDigits = \"\"\n    stUserExpression = InputBox(\"Enter a mathematical expression which results in 24, using the following digits: \" & _\n        Digit(1) & \", \" & Digit(2) & \", \" & Digit(3) & \" and \" & Digit(4), \"Rosetta Code | 24 Game\")\n\n' Check each digit is included in user expression\n    bValidDigits = True\n    stFailDigits = \"\"\n    For i = 1 To 4\n        If InStr(stUserExpression, Digit(i)) = 0 Then\n            bValidDigits = False\n            stFailDigits = stFailDigits & \" \" & Digit(i)\n        End If\n    Next i\n    If bValidDigits = False Then\n        bValidExpression = False\n        stFailMessage = \"Your expression excluded the following required digits: \" & stFailDigits & vbCr & vbCr\n    End If\n\n' Check each character of user expression is a valid character type\n    bValidDigits = True\n    stFailDigits = \"\"\n    For i = 1 To Len(stUserExpression)\n        If InStr(\"0123456789+-*/()\", Mid(stUserExpression, i, 1)) = 0 Then\n            bValidDigits = False\n            stFailDigits = stFailDigits & \" \" & Mid(stUserExpression, i, 1)\n        End If\n    Next i\n    If bValidDigits = False Then\n        bValidExpression = False\n        stFailMessage = stFailMessage & \"Your expression contained invalid characters:\" & stFailDigits & vbCr & vbCr\n    End If\n\n' Check no disallowed integers entered\n    bValidDigits = True\n    stFailDigits = \"\"\n    iDigitCount = 0\n    For i = 1 To Len(stUserExpression)\n        If Not InStr(\"0123456789\", Mid(stUserExpression, i, 1)) = 0 Then\n            iDigitCount = iDigitCount + 1\n            If IsError(Application.Match(--(Mid(stUserExpression, i, 1)), Digit, False)) Then\n                bValidDigits = False\n                stFailDigits = stFailDigits & \" \" & Mid(stUserExpression, i, 1)\n            End If\n        End If\n    Next i\n    If iDigitCount > 4 Then\n        bValidExpression = False\n        stFailMessage = stFailMessage & \"Your expression contained more than 4 digits\" & vbCr & vbCr\n    End If\n        If iDigitCount < 4 Then\n        bValidExpression = False\n        stFailMessage = stFailMessage & \"Your expression contained less than 4 digits\" & vbCr & vbCr\n    End If\n    If bValidDigits = False Then\n        bValidExpression = False\n        stFailMessage = stFailMessage & \"Your expression contained invalid digits:\" & stFailDigits & vbCr & vbCr\n    End If\n\n' Check no double digit numbers entered\n    bValidDigits = True\n    stFailDigits = \"\"\n    For i = 11 To 99\n        If Not InStr(stUserExpression, i) = 0 Then\n            bValidDigits = False\n            stFailDigits = stFailDigits & \" \" & i\n        End If\n    Next i\n    If bValidDigits = False Then\n        bValidExpression = False\n        stFailMessage = stFailMessage & \"Your expression contained invalid numbers:\" & stFailDigits & vbCr & vbCr\n    End If\n\n' Check result of user expression\n    On Error GoTo EvalFail\n    vResult = Evaluate(stUserExpression)\n    If Not vResult = 24 Then\n        bValidExpression = False\n        stFailMessage = stFailMessage & \"Your expression did not result in 24. It returned: \" & vResult\n    End If\n\n' Return results\n    If bValidExpression = False Then\n        vTryAgain = MsgBox(stFailMessage & vbCr & vbCr & \"Would you like to try again?\", vbCritical + vbRetryCancel, \"Rosetta Code | 24 Game | FAILED\")\n            If vTryAgain = vbRetry Then\n                vSameDigits = MsgBox(\"Do you want to use the same numbers?\", vbQuestion + vbYesNo, \"Rosetta Code | 24 Game | RETRY\")\n                If vSameDigits = vbYes Then\n                    GoTo GetUserExpression\n                Else\n                    GoTo GenerateNewDigits\n                End If\n            End If\n    Else\n        vTryAgain = MsgBox(\"You entered: \" & stUserExpression & vbCr & vbCr & \"which resulted in: \" & vResult, _\n            vbInformation + vbRetryCancel, \"Rosetta Code | 24 Game | SUCCESS\")\n        If vTryAgain = vbRetry Then\n            GoTo GenerateNewDigits\n        End If\n    End If\n    Exit Sub\nEvalFail:\n    bValidExpression = False\n    vResult = Err.Description\n    Resume\nEnd Sub\n",
        "safe": true
    },
    {
        "filename": "24_game_171.txt",
        "content": "import os\nimport rand\nimport rand.seed\nimport math\n\nfn main() {\n    rand.seed(seed.time_seed_array(2))\n    mut n := []int{len: 4}\n    for i in 0.. n.len {\n        n[i] = rand.intn(9) or {0}\n    }\n    println(\"Your numbers: $n\")\n    expr := os.input(\"Enter RPN: \")\n    if expr.len != 7 {\n        println(\"invalid. expression length must be 7.\" +\n            \" (4 numbers, 3 operators, no spaces)\")\n        return\n    }\n    mut stack := []f64{len: 0, cap:4}\n    for r in expr.split('') {\n        if r >= '0' && r <= '9' {\n            if n.len == 0 {\n                println(\"too many numbers.\")\n                return\n            }\n            mut i := 0\n            for n[i] != r.int() {\n                i++\n                if i == n.len {\n                    println(\"wrong numbers.\")\n                    return\n                }\n            }\n            n.delete(n.index(r.int()))\n            stack << f64(r[0]-'0'[0])\n            continue\n        }\n        if stack.len < 2 {\n            println(\"invalid expression syntax.\")\n            return\n        }\n        match r {\n            '+' {\n                stack[stack.len-2] += stack[stack.len-1]\n            }\n            '-' {\n                stack[stack.len-2] -= stack[stack.len-1]\n            }\n            '*' {\n                stack[stack.len-2] *= stack[stack.len-1]\n            }\n            '/' {\n                stack[stack.len-2] /= stack[stack.len-1]\n            }\n            else {\n                println(\"$r invalid.\")\n                return\n            }\n        }\n        stack = stack[..stack.len-1]\n    }\n    if math.abs(stack[0]-24) > 1e-6 {\n        println(\"incorrect. ${stack[0]}\u00a0!= 24\")\n    } else {\n        println(\"correct.\")\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "24_game_172.txt",
        "content": "Make 24 using these digits: [2, 3, 5, 1]\n> 23*51-*\nCorrect!\n",
        "safe": true
    },
    {
        "filename": "24_game_173.txt",
        "content": "import \"random\" for Random\nimport \"./ioutil\" for Input\nimport \"./seq\" for Stack\n\nvar R = Random.new()\n\nclass Game24 {\n    static run() {\n        var digits = List.filled(4, 0)\n        for (i in 0..3) digits[i] = R.int(1, 10)\n        System.print(\"Make 24 using these digits: %(digits)\")\n        var cin = Input.text(\"> \")\n        var s = Stack.new()\n        var total = 0\n        for (c in cin) {\n            var d = c.bytes[0]\n            if (d >= 48 && d <= 57) {\n                d = d - 48\n                total = total + (1 << (d*5))\n                s.push(d)\n            } else if (\"+-*/\".indexOf(c) != -1) s.push(applyOperator_(s.pop(), s.pop(), c))\n        }\n        if (tallyDigits_(digits) != total) {\n            System.write(\"Not the same digits.\")\n        } else if ((24 - s.peek()).abs < 0.001) {\n            System.print(\"Correct!\")\n        } else {\n            System.write(\"Not correct.\")\n        }\n    }\n\n    static applyOperator_(a, b, c) {\n        if (c == \"+\") return a + b\n        if (c == \"-\") return b - a\n        if (c == \"*\") return a * b\n        if (c == \"/\") return b / a\n        return 0/0\n    }\n\n    static tallyDigits_(a) {\n        var total = 0\n        for (i in 0...a.count) total = total + (1 << (a[i]*5))\n        return total\n    }\n}\n\nGame24.run()\n",
        "safe": true
    },
    {
        "filename": "24_game_174.txt",
        "content": "Make 24 using these digits: [2, 3, 5, 1]\n> 23*51-*\nCorrect!\n",
        "safe": true
    },
    {
        "filename": "24_game_175.txt",
        "content": "real Stack(10), A, B;\nint  SP, I, Char, Digit, Digits(10);\n\nproc Push(X);\nreal X;\n[Stack(SP):= X;  SP:= SP+1];\n\nfunc real Pop;\n[SP:= SP-1;  return Stack(SP)];\n\n[SP:= 0;\nfor I:= 0 to 9 do Digits(I):= 0;\nText(0, \"Enter an RPN expression that equals 24 using all these digits:\");\nfor I:= 0 to 3 do\n        [Digit:= Ran(9)+1;\n        ChOut(0, ^ );  ChOut(0, Digit+^0);\n        Digits(Digit):= Digits(Digit)+1;\n        ];\nText(0, \"^m^j> \");\nloop    [Char:= ChIn(1);\n        ChOut(0, Char);\n        if Char >= ^1 and Char <=^9 then\n                [Digit:= Char - ^0;\n                Push(float(Digit));\n                Digits(Digit):= Digits(Digit) - 1;\n                ]\n        else    [if SP >= 2 then [A:= Pop;  B:= Pop] else quit;\n                case Char of\n                  ^+:   Push(B+A);\n                  ^-:   Push(B-A);\n                  ^*:   Push(B*A);\n                  ^/:   Push(B/A)\n                other   quit;\n                ];\n        ];\nCrLf(0);\nfor I:= 0 to 9 do\n    if Digits(I) # 0 then\n        [Text(0, \"Must use each of the given digits.^m^j\");  exit];\nText(0, if abs(Pop-24.0) < 0.001 then \"Correct!\" else \"Wrong.\");\nCrLf(0);\n]",
        "safe": true
    },
    {
        "filename": "24_game_176.txt",
        "content": "Enter an RPN expression that equals 24 using all these digits: 1 4 4 9\n> 44*9+1-\nCorrect!\n",
        "safe": true
    },
    {
        "filename": "24_game_177.txt",
        "content": "operadores$ = \"*/+-\"\nespacios$ = \"                                                                                \"\n\nclear screen\nprint \"24 Game\"\nprint \"============\\n\"\nprint \"The player is provided with 4 numbers with which to perform operations\"\nprint \"of addition (+), subtraction (-), multiplication (*) or division (/) to attempt\"\nprint \"to get 24 as result.\"\nprint \"Use reverse Polish notation (first the operands and then the operators).\"\nprint \"For example: instead of 2 + 4, type 2 4 +\\n\\n\"\n\nrepeat\n\tprint at(0,9) espacios$, espacios$, espacios$, espacios$, espacios$, espacios$\n\tprint at(0,9);\n\tserie$ = ordenaCadena$(genSerie$())\n\tvalidos$ = serie$+operadores$\n\tline input \"Enter your formula in reverse Polish notation: \" entrada$\n\tentrada$ = quitaEspacios$(entrada$)\n\tentradaOrd$ = ordenaCadena$(entrada$)\n\tif (right$(entradaOrd$,4) <> serie$) or (len(entradaOrd$)<>7) then\n\t\tprint \"Error in the entered series\"\n\telse\n\t\tresultado = evaluaEntrada(entrada$)\n\t\tprint \"The result is = \",resultado,\" \"\n\t\tif resultado = 24 then\n\t\t\tprint \"Correct!\"\n\t\telse\n\t\t\tprint \"Error!\"\n\t\tend if\n\tend if\n\tprint \"Want to try again? (press N to exit, or another key to continue)\"\nuntil(upper$(left$(inkey$(),1)) = \"N\")\n\nsub genSerie$()\n\tlocal i, c$, s$\n\t\n\tprint \"The numbers to be used are: \";\n\ti = ran()\n\tfor i = 1 to 4\n\t\tc$ = str$(int(ran(9))+1)\n\t\tprint c$,\" \";\n\t\ts$ = s$ + c$\n\tnext i\n\tprint\n\treturn s$\nend sub\n\n\nsub evaluaEntrada(entr$)\n\tlocal d1, d2, c$, n(4), i\n\t\n\twhile(entr$<>\"\")\n\t\tc$ = left$(entr$,1)\n\t\tentr$ = mid$(entr$,2)\t\t\n\t\tif instr(serie$,c$) then\n\t\t\ti = i + 1\n\t\t\tn(i) = val(c$)\n\t\telseif instr(operadores$,c$) then\n\t\t\td2 = n(i)\n\t\t\tn(i) = 0\n\t\t\ti = i - 1\n\t\t\td1 = n(i)\n\t\t\tn(i) = evaluador(d1, d2, c$)\n\t\telse\n\t\t\tprint \"Invalid sign\"\n\t\t\treturn\n\t\tend if\n\twend\n\t\n\treturn n(i)\n\t\t\nend sub\n\n\nsub evaluador(d1, d2, op$)\n\tlocal t\n\t\n\tswitch op$\n\t\tcase \"+\": t = d1 + d2\u00a0: break\n\t\tcase \"-\": t = d1 - d2\u00a0: break\n\t\tcase \"*\": t = d1 * d2\u00a0: break\n\t\tcase \"/\": t = d1 / d2\u00a0: break\n\tend switch\n\t\n\treturn t\nend sub\n\n\nsub quitaEspacios$(entr$)\n\tlocal n, i, s$, t$(1)\n\t\n\tn = token(entr$,t$(),\" \")\n\t\n\tfor i=1 to n\n\t\ts$ = s$ + t$(i)\n\tnext i\n\treturn s$\nend sub\n\n\nsub ordenaCadena$(cadena$)\n\tlocal testigo, n, fin, c$\n\t\n\tfin = len(cadena$)-1\n\trepeat\n\t\ttestigo = false\n\t\tfor n = 1 to fin\n\t\t\tif mid$(cadena$,n,1) > mid$(cadena$,n+1,1) then\n\t\t\t\ttestigo = true\n\t\t\t\tc$ = mid$(cadena$,n,1)\n\t\t\t\tmid$(cadena$,n,1) = mid$(cadena$,n+1,1)\n\t\t\t\tmid$(cadena$,n+1,1) = c$\n\t\t\tend if\n\t\tnext n\n\tuntil(testigo = false)\n\treturn cadena$\nend sub",
        "safe": true
    },
    {
        "filename": "24_game_178.txt",
        "content": "do\n\tclear screen\n\tn$=\"\"\n\tfor i=1 to 4\n\t\tn$=n$+str$(int(ran(9)+1))\n\tnext i\n\tprint at(35,0) \"24 GAME\\n\"\n\tprint \"Combine numbers and operators for obtain 24.\"\n\tprint \"Allowed characters: \";\n\ti$=n$+\"+-*/()\"\n\tfor i=1 to 10\n\t\tprint mid$(i$,i,1),\" \";\n\tnext i\n\tprint \"[nothing to end program]\\n\"\nlabel accept\n\tp$=\"\"\n\ti$=n$+\"+-*/()\"\n\tprint at(0,4);:input \"Enter the formula: \" f$\n\tif f$=\"\" end\n\tfor i=1 to len(f$)\n\t\tc$=mid$(f$,i,1)\n\t\tswitch c$\n\t\t\tcase \" \": f$=left$(f$,i-1)+right$(f$,len(f$)-i): break\n\t\t\tcase \"+\":case \"-\":case \"*\":case \"/\": p$=p$+\"o\": break\n\t\t\tcase \"(\":case \")\": p$=p$+c$: break\n\t\t\tcase mid$(i$,1,1): p$=p$+\"n\": mid$(i$,1,1)=\" \": break\n\t\t\tcase mid$(i$,2,1): p$=p$+\"n\": mid$(i$,2,1)=\" \": break\n\t\t\tcase mid$(i$,3,1): p$=p$+\"n\": mid$(i$,3,1)=\" \": break\n\t\t\tcase mid$(i$,4,1): p$=p$+\"n\": mid$(i$,4,1)=\" \": break\n\t\t\tdefault: message(\" = Invalid argument!  \"): break\n\t\tend switch\n\t\tif f$=\"\" goto accept\n\tnext i\n\trestore\n\tfor i=1 to 11\n\t\tread t$\n\t\tif t$=p$ break\n\tnext i\n\tif t$<>p$ then\n\t\tmessage(\" = Bad construction!  \")\n\t\tgoto accept\n\tend if\n\tlet r=eval(f$)\n\tprint \"\\n\",f$,\" = \",r,\" \";\n\tif r<>24 then\n\t\tmessage(\" = Wrong!             \")\n\t\tgoto accept\n\telse\n\t\tmessage(\" = Correct!           \")\n\t\tpause 5\n\tend if\nloop\n\nDATA \"nononon\"\nDATA \"(non)onon\"\nDATA \"nono(non)\"\nDATA \"no(no(non))\"\nDATA \"((non)on)on\"\nDATA \"no(non)on\"\nDATA \"(non)o(non)\"\nDATA \"no((non)on)\"\nDATA \"(nonon)on\"\nDATA \"(no(non))on\"\nDATA \"no(nonon)\"\n\nsub message(m$)\n\tprint at(0,7) f$,m$\n\tbeep: beep: beep\n\tpause 1\n\tprint at(19,4) \"                     \"\n\tf$=\"\"\nend sub\n\nsub eval(c$)\n\tstatic linea\n\t\n\tlinea=linea+1\n\tc$=\"sub s\"+str$(linea+1000000,\"#######\")+\"():return \"+c$+\":end sub\"\n\tcompile c$\n\treturn execute(mid$(c$,5,8))\nend sub",
        "safe": true
    },
    {
        "filename": "24_game_179.txt",
        "content": "while(1){\n   digits\u00a0:= [1..4].pump(String,(0).random.fpM(\"11-\",1,9));\n   exp\u00a0:= ask(\"Enter an expression using the digits \",digits,\n\t      \" that evals to 24: \") - \" \\n\";\n   expf:=exp.apply(fcn(c){if (\"1\"<=c<=\"9\") \"(%s).toFloat()\".fmt(c) else c});\n   reg r;\n   try { Compiler.Compiler.compileText(expf).__constructor(); r=vm.regX }\n   catch { println(\"bad expression\"); continue; }\n   else{ \n      extra\u00a0:= (exp - \"+-/*()\" - digits);\n      if (extra) { println(\"Extra goodies in expression: \",extra); continue; }\n      (digits.split(\"\").sort()\u00a0!= (exp - \"+-/*()\").split(\"\").sort())\u00a0:\n         if(_) { println(\"You can only use the digits \",digits,\" once each\"); continue; };\n      if (exp.matches(\"*[1-9][1-9]*\"))\n\t { println(\"no repeated digits\"); continue; }\n      if (r.closeTo(24,0.001)) \"nice!\".println();\n      else println(\"That evaled to \",r,\", not 24\");\n   }\n}",
        "safe": true
    },
    {
        "filename": "24_game_18.txt",
        "content": "      REM Choose four random digits (1-9) with repetitions allowed:\n      DIM digits%(4), check%(4)\n      FOR choice% = 1 TO 4\n        digits%(choice%) = RND(9)\n      NEXT choice%\n      \n      REM Prompt the player:\n      PRINT \"Enter an equation (using all of, and only, the single digits \";\n      FOR index% = 1 TO 4\n        PRINT ; digits%(index%) ;\n        IF index%<>4 PRINT \" \" ;\n      NEXT\n      PRINT \")\"\n      PRINT \"which evaluates to exactly 24.  Only multiplication (*), division (/),\"\n      PRINT \"addition (+) & subtraction (-) operations and parentheses are allowed:\"\n      INPUT \"24 = \" equation$\n      \n      REPEAT\n        \n        REM Check that the correct digits are used:\n        check%() = 0\n        FOR char% = 1 TO LEN(equation$)\n          digit% = INSTR(\"0123456789\", MID$(equation$, char%, 1)) - 1\n          IF digit% >= 0 THEN\n            FOR index% = 1 TO 4\n              IF digit% = digits%(index%) THEN\n                IF NOT check%(index%) check%(index%) = TRUE : EXIT FOR\n              ENDIF\n            NEXT index%\n            IF index% > 4 THEN\n              PRINT \"Sorry, you used the illegal digit \"; digit%\n              EXIT REPEAT\n            ENDIF\n          ENDIF\n        NEXT char%\n        \n        FOR index% = 1 TO 4\n          IF NOT check%(index%) THEN\n            PRINT \"Sorry, you failed to use the digit \" ; digits%(index%)\n            EXIT REPEAT\n          ENDIF\n        NEXT index%\n        \n        REM Check that no pairs of digits are used:\n        FOR pair% = 11 TO 99\n          IF INSTR(equation$, STR$(pair%)) THEN\n            PRINT \"Sorry, you may not use a pair of digits \"; pair%\n            EXIT REPEAT\n          ENDIF\n        NEXT pair%\n        \n        REM Check whether the equation evaluates to 24:\n        ON ERROR LOCAL PRINT \"Sorry, there was an error in the equation\" : EXIT REPEAT\n        result = EVAL(equation$)\n        RESTORE ERROR\n        IF result = 24 THEN\n          PRINT \"Congratulations, you succeeded in the task!\"\n        ELSE\n          PRINT \"Sorry, your equation evaluated to \" ; result \" rather than 24!\"\n        ENDIF\n        \n      UNTIL TRUE\n      \n      INPUT '\"Play again\", answer$\n      IF LEFT$(answer$,1) = \"y\" OR LEFT$(answer$,1) = \"Y\" THEN CLS : RUN\n      QUIT\n",
        "safe": true
    },
    {
        "filename": "24_game_180.txt",
        "content": "Enter an expression using the digits 8833 that evals to 24: (8/(3-(8/3)))\nnice!\nEnter an expression using the digits 8833 that evals to 24: (8/(3-(8/9)))\nExtra goodies in expression: 9\nEnter an expression using the digits 8833 that evals to 24: (8/(3-(8/8)))\nYou can only use the digits 8833 once each\nEnter an expression using the digits 7155 that evals to 24: 7+1+5+5\nThat evaled to 18, not 24\nEnter an expression using the digits 8332 that evals to 24: 8*3*(3-2)\nnice!\n",
        "safe": true
    },
    {
        "filename": "24_game_181.txt",
        "content": "10 LET n$=\"\"\n20 RANDOMIZE \n30 FOR i=1 TO 4\n40 LET n$=n$+STR$ (INT (RND*9)+1)\n50 NEXT i\n60 LET i$=\"\": LET f$=\"\": LET p$=\"\"\n70 CLS \n80 PRINT \"24 game\"\n90 PRINT \"Allowed characters:\"\n100 LET i$=n$+\"+-*/()\"\n110 PRINT AT 4,0;\n120 FOR i=1 TO 10\n130 PRINT i$(i);\" \";\n140 NEXT i\n150 PRINT \"(0 to end)\"\n160 INPUT \"Enter the formula\";f$\n170 IF f$=\"0\" THEN STOP \n180 PRINT AT 6,0;f$;\" = \";\n190 FOR i=1 TO LEN f$\n200 LET c$=f$(i)\n210 IF c$=\" \" THEN LET f$(i)=\"\": GO TO 250\n220 IF c$=\"+\" OR c$=\"-\" OR c$=\"*\" OR c$=\"/\" THEN LET p$=p$+\"o\": GO TO 250\n230 IF c$=\"(\" OR c$=\")\" THEN LET p$=p$+c$: GO TO 250\n240 LET p$=p$+\"n\"\n250 NEXT i\n260 RESTORE \n270 FOR i=1 TO 11\n280 READ t$\n290 IF t$=p$ THEN LET i=11\n300 NEXT i\n310 IF t$<>p$ THEN PRINT INVERSE 1;\"Bad construction!\": BEEP 1,.1: PAUSE 0: GO TO 60\n320 FOR i=1 TO LEN f$\n330 FOR j=1 TO 10\n340 IF (f$(i)=i$(j)) AND f$(i)>\"0\" AND f$(i)<=\"9\" THEN LET i$(j)=\" \"\n350 NEXT j\n360 NEXT i\n370 IF i$( TO 4)<>\"    \" THEN PRINT FLASH 1;\"Invalid arguments!\": BEEP 1,.01: PAUSE 0: GO TO 60\n380 LET r=VAL f$\n390 PRINT r;\" \";\n400 IF r<>24 THEN PRINT FLASH 1;\"Wrong!\": BEEP 1,1: PAUSE 0: GO TO 60\n410 PRINT FLASH 1;\"Correct!\": PAUSE 0: GO TO 10\n420 DATA \"nononon\"\n430 DATA \"(non)onon\"\n440 DATA \"nono(non)\"\n450 DATA \"no(no(non))\"\n460 DATA \"((non)on)on\"\n470 DATA \"no(non)on\"\n480 DATA \"(non)o(non)\"\n485 DATA \"no((non)on)\"\n490 DATA \"(nonon)on\"\n495 DATA \"(no(non))on\"\n500 DATA \"no(nonon)\"\n",
        "safe": true
    },
    {
        "filename": "24_game_19.txt",
        "content": "v         > > >> v\n2           2                   1234\n4         ^1?3^4\n>8*00p10p> >?  ?5> 68*+00g10gpv\n          v9?7v6              0\n            8                 0\n          > > >> ^            g\n         ^p00  _v#   `\\*49:+1 <\n_>\"rorrE\",,,,,$ >~:67*-!#v_:167*+-!#v_:95*-!#v_:295*+-!#v_:586*+\\`#v_:97*2--!#v\n                         $          $        $          $          :          $\n                         *          +        -          /          1          :\n\t\t^        <          <        <          <          8          .\n                                                                   6          6\n                                                                   *          4\n                                                                   +          *\n                                                                   \\          -\n                                                                   `    >    v_v\n                                                                             \"\n ^                                       <                         _v        e\n\t\t^                       _^#+*28:p2\\*84\\-*86g2:-+*441<        s\n                                                                             o\n                                                                             L\n                                                  >    1                |-*49\"#<\n                                                  |   -*84gg01g00<p00*84<v   <\n                                                  >00g:1+00p66*`#^_ \"niW\">:#,_@\n",
        "safe": true
    },
    {
        "filename": "24_game_2.txt",
        "content": "\\ Generate four random digits and display to the user\n\\ then get an expression from the user using +, -, / and * and the digits\n\\ the result must equal 24\n\\ http://8th-dev.com/24game.html\n \n\\ Only the words in namespace 'game' are available to the player:\nns: game\n \n: + n:+ ;\n: - n:- ;\n: * n:* ;\n: / n:/ ;\n \nns: G\n \nvar random-digits\nvar user-input\n \n: one-digit \\ a -- a\n\trand n:abs 9 n:mod n:1+ a:push ;\n \n: gen-digits \\ - a\n\t[] clone nip \\ the clone nip is not needed in versions past 1.0.2...\n\t' one-digit 4 times\n\t' n:cmp a:sort\n\trandom-digits !  ;\n \n: prompt-user \n\tcr \"The digits are: \" .  random-digits @ . cr ;\n \n: goodbye\n\tcr \"Thanks for playing!\\n\" . cr 0 die ;\n \n: get-input\n\t70 null con:accept dup user-input !\n\tnull? if drop goodbye then ;\n \n: compare-digits\n\ttrue swap\n\t(\n\t\t\\ inputed-array index\n\t\tdup >r\n\t\ta:@ \n\t\trandom-digits @ r> a:@ nip\n\t\tn:= not if\n\t\t\tbreak\n\t\t\tswap drop false swap\n\t\tthen\n\t) 0 3 loop drop ;\n \n/^\\D*(\\d)\\D+(\\d)\\D+(\\d)\\D+(\\d)\\D*$/  var, digits-regex\n \n: all-digits? \n\tuser-input @ digits-regex @ r:match \n\tnull? if drop false else\n\t\t5 = not if\n\t\t\tfalse\n\t\telse\n\t\t\t\\ convert the captured digits in the regex into a sorted array:\n\t\t\tdigits-regex @ \n\t\t\t( r:@ >n swap ) 1 4 loop drop\n\t\t\t4 a:close ' n:cmp a:sort\n\t\t\tcompare-digits\n\t\tthen\n\tthen ;\n \n: does-eval?\n\t0 user-input @ eval 24 n:= \n\tdup not if\n\t\tcr \"Sorry, that expression is wrong\" . cr\n\tthen ;\n \n: check-input\n\treset\n\tall-digits?  if \n\t\tdoes-eval? if\n\t\t\tcr \"Excellent!  Your expression: \\\"\" .\n\t\t\tuser-input @ .\n\t\t\t\"\\\" worked!\" . cr\n\t\tthen\n\telse\n\t\tcr \"You did not use the digits properly, try again.\" . cr\n\tthen ;\n \n: intro quote |\n \nWelcome to the '24 game'!\n \nYou will be shown four digits each time.  Using only the + - * and / operators\nand all the digits (and only the digits), produce the number '24'\n \nEnter your result in 8th syntax, e.g.:  4 4 + 2 1 + *\n \nTo quit the game, just hit enter by itself. Enjoy!\n \n\t| . ;\n \n: start\n\t\\ don't allow anything but the desired words\n\tns:game only\n\tintro\n\trepeat\n\t\tgen-digits\n\t\tprompt-user\n\t\tget-input\n\t\tcheck-input\n\tagain ;\n \nstart\n",
        "safe": true
    },
    {
        "filename": "24_game_20.txt",
        "content": "213/-4*=\n",
        "safe": true
    },
    {
        "filename": "24_game_21.txt",
        "content": "24 Win\n",
        "safe": true
    },
    {
        "filename": "24_game_22.txt",
        "content": "  ( 24-game\n  =     m-w m-z 4numbers answer expr numbers\n      , seed get-random convertBinaryMinusToUnary\n      , convertDivisionToMultiplication isExpresssion reciprocal\n    .   (seed=.!arg:(~0:~/#?m-w.~0:~/#?m-z))\n      & seed$!arg\n      & ( get-random\n        =   \n          .   36969*mod$(!m-z.65536)+div$(!m-z.65536):?m-z\n            & 18000*mod$(!m-w.65536)+div$(!m-w.65536):?m-w\n            & mod$(!m-z*65536+!m-w.9)+1\n        )\n      & ( convertBinaryMinusToUnary\n        =   a z\n          .     @(!arg:%?a \"-\" ?z)\n              & str$(!a \"+-1*\" convertBinaryMinusToUnary$!z)\n            | !arg\n        )\n      & (reciprocal=.!arg^-1)\n      & ( convertDivisionToMultiplication\n        =   a z\n          .     @(!arg:?a \"/\" ?z)\n              & str$(!a \"*reciprocal$\" convertDivisionToMultiplication$!z)\n            | !arg\n        )\n      & ( isExpresssion\n        =   A Z expr\n          .   @( !arg\n              \u00a0:   ?A\n                   (\"+\"|\"-\"|\"*\"|\"/\")\n                   ( ?Z\n                   & isExpresssion$!A\n                   & isExpresssion$!Z\n                   )\n               )\n            |   !numbers:?A !arg ?Z\n              & !A !Z:?numbers\n            |   ( @(!arg:\"(\" ?expr \")\")\n                | @(!arg:(\" \"|\\t) ?expr)\n                | @(!arg:?expr (\" \"|\\t))\n                )\n              & isExpresssion$!expr\n        )\n      &   out\n        $ \"Enter an expression that evaluates to 24 by combining the following numbers.\"\n      & out$\"You may only use the operators + - * /\"\n      & out$\"Parentheses and spaces are allowed.\"\n      &   whl\n        ' (   get-random$() get-random$() get-random$() get-random$\n           \u00a0: ?4numbers\n          & out$!4numbers\n          &   whl\n            ' ( get'(,STR):?expr:~\n              & !4numbers:?numbers\n              & ~(isExpresssion$!expr&!numbers:)\n              &   out\n                $ ( str\n                  $ ( \"[\"\n                      !expr\n                      \"] is not a valid expression. Try another expression.\"\n                    )\n                  )\n              )\n          & !expr:~\n          & convertBinaryMinusToUnary$!expr:?expr\n          & convertDivisionToMultiplication$!expr:?expr\n          & get$(!expr,MEM):?answer\n          & out$(str$(!expr \" = \" !answer))\n          &   !answer\n           \u00a0: ( 24&out$Right!\n              | #&out$Wrong!\n              )\n          & out$\"Try another one:\"\n          )\n      & out$bye\n  )\n& 24-game$(13.14)\n&\u00a0;",
        "safe": true
    },
    {
        "filename": "24_game_23.txt",
        "content": "Enter an expression that evaluates to 24 by combining the following numbers.\nYou may only use the operators + - * /\nParentheses and spaces are allowed.\n4 2 2 7\n4*7 - 2-2\n4*7 +-1* 2+-1*2 = 24\nRight!\nTry another one:\n4 7 9 8\n((4) *(8 - (9- 7))\n[((4) *(8 - (9- 7))] is not a valid expression. Try another expression.\n((4) *(8 - (9- 7)))\n((4) *(8 +-1* (9+-1* 7))) = 24\nRight!\nTry another one:\n9 5 8 5\n5 * 5 - (9 - 8)\n5 * 5 +-1* (9 +-1* 8) = 24\nRight!\nTry another one:\n5 9 7 8\n5*8 - 9 - 7\n5*8 +-1* 9 +-1* 7 = 24\nRight!\nTry another one:\n7 8 6 2\n8 * ((7 - 6) + 2)\n8 * ((7 +-1* 6) + 2) = 24\nRight!\nTry another one:\n8 6 8 1\n8 * (1 + 8 - 6)\n8 * (1 + 8 +-1* 6) = 24\nRight!\nTry another one:\n8 2 2 4\n8 * (2 + 4)/2\n8 * (2 + 4)*reciprocal$2 = 24\nRight!\nTry another one:\n8 4 6 7\n\nbye",
        "safe": true
    },
    {
        "filename": "24_game_24.txt",
        "content": "#include <stdio.h>\n#include <ctype.h>\n#include <stdlib.h>\n#include <setjmp.h>\n#include <time.h>\n \njmp_buf ctx;\nconst char *msg;\n \nenum { OP_NONE = 0, OP_NUM, OP_ADD, OP_SUB, OP_MUL, OP_DIV };\n \ntypedef struct expr_t *expr, expr_t;\nstruct expr_t {\n\tint op, val, used;\n\texpr left, right;\n};\n \n#define N_DIGITS 4\nexpr_t digits[N_DIGITS];\n \nvoid gen_digits()\n{\n\tint i;\n\tfor (i = 0; i < N_DIGITS; i++)\n\t\tdigits[i].val = 1 + rand() % 9;\n}\n \n#define MAX_INPUT 64\nchar str[MAX_INPUT];\nint pos;\n \n#define POOL_SIZE 8\nexpr_t pool[POOL_SIZE];\nint pool_ptr;\n \nvoid reset()\n{\n\tint i;\n\tmsg = 0;\n\tpool_ptr = pos = 0;\n\tfor (i = 0; i < POOL_SIZE; i++) {\n\t\tpool[i].op = OP_NONE;\n\t\tpool[i].left = pool[i].right = 0;\n\t}\n\tfor (i = 0; i < N_DIGITS; i++)\n\t\tdigits[i].used = 0;\n}\n \n/* longish jumpish back to input cycle */\nvoid bail(const char *s)\n{\n\tmsg = s;\n\tlongjmp(ctx, 1);\n}\n \nexpr new_expr()\n{\n\tif (pool_ptr < POOL_SIZE)\n\t\treturn pool + pool_ptr++;\n\treturn 0;\n}\n \n/* check next input char */\nint next_tok()\n{\n\twhile (isspace(str[pos])) pos++;\n\treturn str[pos];\n}\n \n/* move input pointer forward */\nint take()\n{\n\tif (str[pos] != '\\0') return ++pos;\n\treturn 0;\n}\n \n/* BNF(ish)\nexpr = term { (\"+\")|(\"-\") term }\nterm = fact { (\"*\")|(\"/\") expr }\nfact =\tnumber\n\t| '(' expr ')'\n*/\n \nexpr get_fact();\nexpr get_term();\nexpr get_expr();\n \nexpr get_expr()\n{\n\tint c;\n\texpr l, r, ret;\n\tif (!(ret = get_term())) bail(\"Expected term\");\n\twhile ((c = next_tok()) == '+' || c == '-') {\n\t\tif (!take()) bail(\"Unexpected end of input\");\n\t\tif (!(r = get_term())) bail(\"Expected term\");\n \n\t\tl = ret;\n\t\tret = new_expr();\n\t\tret->op = (c == '+') ? OP_ADD : OP_SUB;\n\t\tret->left = l;\n\t\tret->right = r;\n\t}\n\treturn ret;\n}\n \nexpr get_term()\n{\n\tint c;\n\texpr l, r, ret;\n\tret = get_fact();\n\twhile((c = next_tok()) == '*' || c == '/') {\n\t\tif (!take()) bail(\"Unexpected end of input\");\n \n\t\tr = get_fact();\n\t\tl = ret;\n\t\tret = new_expr();\n\t\tret->op = (c == '*') ? OP_MUL : OP_DIV;\n\t\tret->left = l;\n\t\tret->right = r;\n\t}\n\treturn ret;\n}\n \nexpr get_digit()\n{\n\tint i, c = next_tok();\n\texpr ret;\n\tif (c >= '0' && c <= '9') {\n\t\ttake();\n\t\tret = new_expr();\n\t\tret->op = OP_NUM;\n\t\tret->val = c - '0';\n\t\tfor (i = 0; i < N_DIGITS; i++)\n\t\t\tif (digits[i].val == ret->val && !digits[i].used) {\n\t\t\t\tdigits[i].used = 1;\n\t\t\t\treturn ret;\n\t\t\t}\n\t\tbail(\"Invalid digit\");\n\t}\n\treturn 0;\n}\n \nexpr get_fact()\n{\n\tint c;\n\texpr l = get_digit();\n\tif (l) return l;\n\tif ((c = next_tok()) == '(') {\n\t\ttake();\n\t\tl = get_expr();\n\t\tif (next_tok() != ')') bail(\"Unbalanced parens\");\n\t\ttake();\n\t\treturn l;\n\t}\n\treturn 0;\n}\n \nexpr parse()\n{\n\tint i;\n\texpr ret = get_expr();\n\tif (next_tok() != '\\0')\n\t\tbail(\"Trailing garbage\");\n\tfor (i = 0; i < N_DIGITS; i++)\n\t\tif (!digits[i].used)\n\t\t\tbail(\"Not all digits are used\");\n\treturn ret;\n}\n \ntypedef struct frac_t frac_t, *frac;\nstruct frac_t { int denom, num; };\n \nint gcd(int m, int n)\n{\n\tint t;\n\twhile (m) {\n\t\tt = m; m = n % m; n = t;\n\t}\n\treturn n;\n}\n \n/* evaluate expression tree.  result in fraction form */\nvoid eval_tree(expr e, frac res)\n{\n\tfrac_t l, r;\n\tint t;\n\tif (e->op == OP_NUM) {\n\t\tres->num = e->val;\n\t\tres->denom = 1;\n\t\treturn;\n\t}\n \n\teval_tree(e->left, &l);\n\teval_tree(e->right, &r);\n \n\tswitch(e->op) {\n\tcase OP_ADD:\n\t\tres->num = l.num * r.denom + l.denom * r.num;\n\t\tres->denom = l.denom * r.denom;\n\t\tbreak;\n\tcase OP_SUB:\n\t\tres->num = l.num * r.denom - l.denom * r.num;\n\t\tres->denom = l.denom * r.denom;\n\t\tbreak;\n\tcase OP_MUL:\n\t\tres->num = l.num * r.num;\n\t\tres->denom = l.denom * r.denom;\n\t\tbreak;\n\tcase OP_DIV:\n\t\tres->num = l.num * r.denom;\n\t\tres->denom = l.denom * r.num;\n\t\tbreak;\n\t}\n\tif ((t = gcd(res->denom, res->num))) {\n\t\tres->denom /= t;\n\t\tres->num /= t;\n\t}\n}\n \nvoid get_input()\n{\n\tint i;\nreinput:\n\treset();\n\tprintf(\"\\nAvailable digits are:\");\n\tfor (i = 0; i < N_DIGITS; i++) \n\t\tprintf(\" %d\", digits[i].val);\n\tprintf(\". Type an expression and I'll check it for you, or make new numbers.\\n\"\n\t\t\"Your choice? [Expr/n/q] \");\n \n\twhile (1) {\n\t\tfor (i = 0; i < MAX_INPUT; i++) str[i] = '\\n';\n\t\tfgets(str, MAX_INPUT, stdin);\n\t\tif (*str == '\\0') goto reinput;\n\t\tif (str[MAX_INPUT - 1] != '\\n')\n\t\t\tbail(\"string too long\");\n \n\t\tfor (i = 0; i < MAX_INPUT; i++)\n\t\t\tif (str[i] == '\\n') str[i] = '\\0';\n\t\tif (str[0] == 'q') {\n\t\t\tprintf(\"Bye\\n\");\n\t\t\texit(0);\n\t\t}\n\t\tif (str[0] == 'n') {\n\t\t\tgen_digits();\n\t\t\tgoto reinput;\n\t\t}\n\t\treturn;\n\t}\n}\n \nint main()\n{\n\tfrac_t f;\n\tsrand(time(0));\n \n\tgen_digits();\n\twhile(1) {\n\t\tget_input();\n\t\tsetjmp(ctx); /* if parse error, jump back here with err msg set */\n\t\tif (msg) {\n\t\t\t/* after error jump; announce, reset, redo */\n\t\t\tprintf(\"%s at '%.*s'\\n\", msg, pos, str);\n\t\t\tcontinue;\n\t\t}\n \n\t\teval_tree(parse(), &f);\n \n\t\tif (f.denom == 0) bail(\"Divide by zero\");\n\t\tif (f.denom == 1 && f.num == 24)\n\t\t\tprintf(\"You got 24.  Very good.\\n\");\n\t\telse {\n\t\t\tif (f.denom == 1)\n\t\t\t\tprintf(\"Eval to: %d, \", f.num);\n\t\t\telse\n\t\t\t\tprintf(\"Eval to: %d/%d, \", f.num, f.denom);\n\t\t\tprintf(\"no good.  Try again.\\n\");\n\t\t}\n\t}\n\treturn 0;\n}\n",
        "safe": true
    },
    {
        "filename": "24_game_25.txt",
        "content": "Available digits are: 5 2 3 9. Type an expression and I'll check it for you, or make new numbers.\nYour choice? [Expr/n/q] 5*2*3/9\nEval to: 10/3, no good.  Try again.\n\nAvailable digits are: 5 2 3 9. Type an expression and I'll check it for you, or make new numbers.\nYour choice? [Expr/n/q] (5*(2+3)-9\nUnbalanced parens at '(5*(2+3)-9'\n\nAvailable digits are: 5 2 3 9. Type an expression and I'll check it for you, or make new numbers.\nYour choice? [Expr/n/q] 3*9-(5-2)\nYou got 24.  Very good.\n\nAvailable digits are: 5 2 3 9. Type an expression and I'll check it for you, or make new numbers.\nYour choice? [Expr/n/q] n\n\nAvailable digits are: 4 4 4 7. Type an expression and I'll check it for you, or make new numbers.\nYour choice? [Expr/n/q] q\nBye",
        "safe": true
    },
    {
        "filename": "24_game_26.txt",
        "content": "#include <random>\n#include <iostream>\n#include <stack>\n#include <set>\n#include <string>\n#include <functional>\nusing namespace std;\n\nclass RPNParse\n{\npublic:\n  stack<double> stk;\n  multiset<int> digits;\n\n  void op(function<double(double,double)> f)\n  {\n    if(stk.size() < 2)\n      throw \"Improperly written expression\";\n    int b = stk.top(); stk.pop();\n    int a = stk.top(); stk.pop();\n    stk.push(f(a, b));\n  }\n\n  void parse(char c)\n  {\n    if(c >= '0' && c <= '9')\n    {\n      stk.push(c - '0');\n      digits.insert(c - '0');\n    }\n    else if(c == '+')\n      op([](double a, double b) {return a+b;});\n    else if(c == '-')\n      op([](double a, double b) {return a-b;});\n    else if(c == '*')\n      op([](double a, double b) {return a*b;});\n    else if(c == '/')\n      op([](double a, double b) {return a/b;});\n  }\n\n  void parse(string s)\n  {\n    for(int i = 0; i < s.size(); ++i)\n      parse(s[i]);\n  }\n\n  double getResult()\n  {\n    if(stk.size() != 1)\n      throw \"Improperly written expression\";\n    return stk.top();\n  }\n};\n\nint main()\n{\n  random_device seed;\n  mt19937 engine(seed());\n  uniform_int_distribution<> distribution(1, 9);\n  auto rnd = bind(distribution, engine);\n\n  multiset<int> digits;\n  cout << \"Make 24 with the digits: \";\n  for(int i = 0; i < 4; ++i)\n  {\n    int n = rnd();\n    cout << \" \" << n;\n    digits.insert(n);\n  }\n  cout << endl;\n\n  RPNParse parser;\n\n  try\n  {\n    string input;\n    getline(cin, input);\n    parser.parse(input);\n\n    if(digits != parser.digits)\n      cout << \"Error: Not using the given digits\" << endl;\n    else\n    {\n      double r = parser.getResult();\n      cout << \"Result: \" << r << endl;\n\n      if(r > 23.999 && r < 24.001)\n        cout << \"Good job!\" << endl;\n      else\n        cout << \"Try again.\" << endl;\n    }\n  }\n  catch(char* e)\n  {\n    cout << \"Error: \" << e << endl;\n  }\n  return 0;\n}\n",
        "safe": true
    },
    {
        "filename": "24_game_27.txt",
        "content": "Make 24 with the digits:  1 4 9 9\n9 9 + 4 * 1 +\nResult: 73\nTry again.\n\nMake 24 with the digits:  3 9 9 2\n9 9 + 3 2 * +\nResult: 24\nGood job!\n",
        "safe": true
    },
    {
        "filename": "24_game_28.txt",
        "content": "import ceylon.random {\n\tDefaultRandom\n}\n\nclass Rational(shared Integer numerator, shared Integer denominator = 1) satisfies Numeric<Rational> {\n\t\n\tassert (denominator != 0);\n\t\n\tInteger gcd(Integer a, Integer b) => if (b == 0) then a else gcd(b, a % b);\n\t\n\tshared Rational inverted => Rational(denominator, numerator);\n\t\n\tshared Rational simplified =>\n\t\tlet (largestFactor = gcd(numerator, denominator))\n\t\t\tRational(numerator / largestFactor, denominator / largestFactor);\n\t\n\tdivided(Rational other) => (this * other.inverted).simplified;\n\t\n\tnegated => Rational(-numerator, denominator).simplified;\n\t\n\tplus(Rational other) =>\n\t\t\tlet (top = numerator*other.denominator + other.numerator*denominator,\n\t\t\t\tbottom = denominator * other.denominator)\n\t\t\tRational(top, bottom).simplified;\n\t\n\ttimes(Rational other) =>\n\t\tRational(numerator * other.numerator, denominator * other.denominator).simplified;\n\t\n\tshared Integer integer => numerator / denominator;\n\tshared Float float => numerator.float / denominator.float;\n\t\n\tstring => denominator == 1 then numerator.string else \"``numerator``/``denominator``\";\n\t\n\tshared actual Boolean equals(Object that) {\n\t\tif (is Rational that) {\n\t\t\tvalue simplifiedThis = this.simplified;\n\t\t\tvalue simplifiedThat = that.simplified;\n\t\t\treturn simplifiedThis.numerator==simplifiedThat.numerator && \n\t\t\t\t\tsimplifiedThis.denominator==simplifiedThat.denominator;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n}\n\ninterface Expression {\n\tshared formal Rational evaluate();\n}\n\nclass NumberExpression(Rational number) satisfies Expression {\n\tevaluate() => number;\n\tstring => number.string;\n}\n\nclass OperatorExpression(Expression left, Character operator, Expression right) satisfies Expression {\n\tshared actual Rational evaluate() {\n\t\tswitch (operator)\n\t\tcase ('*') {\n\t\t\treturn left.evaluate() * right.evaluate();\n\t\t}\n\t\tcase ('/') {\n\t\t\treturn left.evaluate() / right.evaluate();\n\t\t}\n\t\tcase ('-') {\n\t\t\treturn left.evaluate() - right.evaluate();\n\t\t}\n\t\tcase ('+') {\n\t\t\treturn left.evaluate() + right.evaluate();\n\t\t}\n\t\telse {\n\t\t\tthrow Exception(\"unknown operator ``operator``\");\n\t\t}\n\t}\n\t\n\tstring => \"(``left.string`` ``operator.string`` ``right.string``)\";\n}\n\n\"A simplified top down operator precedence parser. There aren't any right\n binding operators so we don't have to worry about that.\"\nclass PrattParser(String input) {\n\t\n\tvalue tokens = input.replace(\" \", \"\");\n\tvariable value index = -1;\n\t\n\tshared Expression expression(Integer precedence = 0) {\n\t\tvalue token = advance();\n\t\tvariable value left = parseUnary(token);\n\t\twhile (precedence < getPrecedence(peek())) {\n\t\t\tvalue nextToken = advance();\n\t\t\tleft = parseBinary(left, nextToken);\n\t\t}\n\t\treturn left;\n\t}\n\t\n\tInteger getPrecedence(Character op) =>\n\t\tswitch (op)\n\t\t\tcase ('*' | '/') 2\n\t\t\tcase ('+' | '-') 1\n\t\t\telse 0;\n\t\n\tCharacter advance(Character? expected = null) {\n\t\tindex++;\n\t\tvalue token = tokens[index] else ' ';\n\t\tif (exists expected, token != expected) {\n\t\t\tthrow Exception(\"unknown character ``token``\");\n\t\t}\n\t\treturn token;\n\t}\n\t\n\tCharacter peek() => tokens[index + 1] else ' ';\n\t\n\tExpression parseBinary(Expression left, Character operator) =>\n\t\tlet (right = expression(getPrecedence(operator)))\n\t\t\tOperatorExpression(left, operator, right);\n\t\n\tExpression parseUnary(Character token) {\n\t\tif (token.digit) {\n\t\t\tassert (is Integer int = Integer.parse(token.string));\n\t\t\treturn NumberExpression(Rational(int));\n\t\t} \n\t\telse if (token == '(') {\n\t\t\tvalue exp = expression();\n\t\t\tadvance(')');\n\t\t\treturn exp;\n\t\t} \n\t\telse {\n\t\t\tthrow Exception(\"unknown character ``token``\");\n\t\t}\n\t}\n}\n\nshared void run() {\n\t\n\tvalue random = DefaultRandom();\n\t\n\tfunction random4Numbers() =>\n\t\trandom.elements(1..9).take(4).sequence();\n\t\n\tfunction isValidGuess(String input, {Integer*} allowedNumbers) {\n\t\tvalue allowedOperators = set { *\"()+-/*\" };\n\t\tvalue extractedNumbers = input\n\t\t\t.split((Character ch) => ch in allowedOperators || ch.whitespace)\n\t\t\t.map((String element) => Integer.parse(element))\n\t\t\t.narrow<Integer>();\n\t\tif (extractedNumbers.any((Integer element) => element > 9)) {\n\t\t\tprint(\"number too big!\");\n\t\t\treturn false;\n\t\t}\n\t\tif (extractedNumbers.any((Integer element) => element < 1)) {\n\t\t\tprint(\"number too small!\");\n\t\t\treturn false;\n\t\t}\n\t\tif (extractedNumbers.sort(increasing) != allowedNumbers.sort(increasing)) {\n\t\t\tprint(\"use all the numbers, please!\");\n\t\t\treturn false;\n\t\t}\n\t\tif (!input.every((Character element) => element in allowedOperators || element.digit || element.whitespace)) {\n\t\t\tprint(\"only digits and mathematical operators, please\");\n\t\t\treturn false;\n\t\t}\n\t\tvariable value leftParens = 0;\n\t\tfor (c in input) {\n\t\t\tif (c == '(') {\n\t\t\t\tleftParens++;\n\t\t\t} else if (c == ')') {\n\t\t\t\tleftParens--;\n\t\t\t\tif (leftParens < 0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (leftParens != 0) {\n\t\t\tprint(\"unbalanced brackets!\");\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\t\n\tfunction evaluate(String input) =>\n\t\tlet (parser = PrattParser(input),\n\t\t\texp = parser.expression())\n\t\t\texp.evaluate();\n\t\n\tprint(\"Welcome to The 24 Game.\n\t          Create a mathematical equation with four random\n\t          numbers that evaluates to 24.\n\t          You must use all the numbers once and only once,\n\t          but in any order.\n\t          Also, only + - / * and parentheses are allowed.\n\t          For example: (1 + 2 + 3) * 4\n\t          Also: enter n for new numbers and q to quit.\n\t          -----------------------------------------------\");\n\t\n\tvalue twentyfour = Rational(24);\n\t\n\twhile (true) {\n\t\t\n\t\tvalue chosenNumbers = random4Numbers();\n\t\tvoid pleaseTryAgain() => print(\"Sorry, please try again. (Your numbers are ``chosenNumbers``)\");\n\t\t\n\t\tprint(\"Your numbers are ``chosenNumbers``. Please turn them into 24.\");\n\t\t\n\t\twhile (true) {\n\t\t\tvalue line = process.readLine()?.trimmed;\n\t\t\tif (exists line) {\n\t\t\t\tif (line.uppercased == \"Q\") { // quit\n\t\t\t\t\tprint(\"bye!\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (line.uppercased == \"N\") { // new game\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (isValidGuess(line, chosenNumbers)) {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tvalue result = evaluate(line);\n\t\t\t\t\t\tprint(\"= ``result``\");\n\t\t\t\t\t\tif (result == twentyfour) {\n\t\t\t\t\t\t\tprint(\"You did it!\");\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t} \n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tpleaseTryAgain();\n\t\t\t\t\t\t}\n\t\t\t\t\t} \n\t\t\t\t\tcatch (Exception e) {\n\t\t\t\t\t\tprint(e.message);\n\t\t\t\t\t\tpleaseTryAgain();\n\t\t\t\t\t}\n\t\t\t\t} \n\t\t\t\telse {\n\t\t\t\t\tpleaseTryAgain();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n",
        "safe": true
    },
    {
        "filename": "24_game_29.txt",
        "content": "(ns rosettacode.24game)\n\n(def ^:dynamic *luser*\n\"You guessed wrong, or your input was not in prefix notation.\")\n\n(def ^:private start #(println \n\"Your numbers are: \" %1 \". Your goal is \" %2 \".\\n\"\n\"Use the ops [+ - * /] in prefix notation to reach\" %2 \".\\n\"\n\"q[enter] to quit.\"))\n\n(defn play\n  ([] (play 24))\n  ([goal] (play goal (repeatedly 4 #(inc (rand-int 9)))))\n  ([goal gns]\n     (start gns goal)\n     (let [input (read-string (read-line))\n           flat  (flatten input)]\n      (println\n        (if (and (re-find #\"^\\([\\d\\s+*/-]+\\d?\\)$\" (pr-str flat))\n                 (= (set gns) (set (filter integer? flat)))\n                 (= goal (eval input)))\n         \"You won the game!\"\n         *luser*))\n      (when (not= input 'q) (recur goal gns)))))\n\n; * checks prefix form, then checks to see that the numbers used\n; and the numbers generated by the game are the same.\n",
        "safe": true
    },
    {
        "filename": "24_game_3.txt",
        "content": "/* ARM assembly AARCH64 Raspberry PI 3B */\n/*  program game24_64.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 NBDIGITS,   4       // digits number\n.equ TOTAL,      24\n.equ BUFFERSIZE, 100\n.equ STACKSIZE,  10      // operator and digits number items in stacks\n\n\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nszMessRules:         .ascii \"24 Game  64 bits.\\n\"\n                    .ascii \"The program will display four randomly-generated \\n\"\n                    .ascii \"single-digit numbers and will then prompt you to enter\\n\"\n                    .ascii \"an arithmetic expression followed by <enter> to sum \\n\"\n                    .ascii \"the given numbers to 24.\\n\"\n                    .asciz \"Exemple\u00a0: 9+8+3+4   or (7+5)+(3*4) \\n\\n\"\n\nszMessExpr:         .asciz \"Enter your expression (or type (q)uit to exit or (n) for other digits): \\n\"\nszMessDigits:       .asciz \"The four digits are @ @ @ @ and the score is 24. \\n\"\nszMessNoDigit:      .asciz \"Error\u00a0: One digit is not in digits list\u00a0!! \\n\"\nszMessSameDigit:    .asciz \"Error\u00a0: Two digits are same\u00a0!! \\n\"\nszMessOK:           .asciz \"It is OK. \\n\"\nszMessNotOK:        .asciz \"Error, it is not ok  total = @ \\n\"\nszMessErrOper:      .asciz \"Unknow Operator (+,-,$,/,(,)) \\n\"\nszMessNoparen:      .asciz \"no opening parenthesis\u00a0!! \\n\"\nszMessErrParen:     .asciz \"Error parenthesis number\u00a0!! \\n\"\nszMessNoalldigits:  .asciz \"One or more digits not used\u00a0!!\\n\"\nszMessNewGame:      .asciz \"New game (y/n)\u00a0? \\n\"\nszCarriageReturn:   .asciz \"\\n\"\n.align 4\nqGraine:  .quad 123456\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\nsZoneConv:        .skip 24\nsBuffer:          .skip BUFFERSIZE\niTabDigit:        .skip 8 * NBDIGITS\niTabTopDigit:     .skip 8 * NBDIGITS\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                 // entry of program \n    \n    ldr x0,qAdrszMessRules            // display rules\n    bl affichageMess\n1:\n    mov x3,#0\n    ldr x12,qAdriTabDigit\n    ldr x11,qAdriTabTopDigit\n    ldr x5,qAdrszMessDigits\n2:                                    // loop generate random digits \n    mov x0,#8\n    bl genereraleas \n    add x0,x0,#1\n    str x0,[x12,x3,lsl #3]            // store in table\n    mov x1,#0\n    str x1,[x11,x3,lsl #3]            // raz top table\n    ldr x1,qAdrsZoneConv\n    bl conversion10                   // call decimal conversion\n    //mov x2,#0\n    //strb w2,[x1,x0]                   // reduce size display area with z\u00e9ro final\n    mov x0,x5\n    ldr x1,qAdrsZoneConv              // insert conversion in message\n    bl strInsertAtCharInc\n    mov x5,x0\n    add x3,x3,#1\n    cmp x3,#NBDIGITS                  // end\u00a0?\n    blt 2b                            // no -> loop\n    mov x0,x5\n    bl affichageMess\n3:                                    // loop human entry\n    ldr x0,qAdrszMessExpr\n    bl affichageMess\n    bl saisie                         // entry\n    cmp x0,#'q'\n    beq 100f\n    cmp x0,#'Q'\n    beq 100f\n    cmp x0,#'n'\n    beq 1b\n    cmp x0,#'N'\n    beq 1b\n \n    bl evalExpr                      // expression evaluation\n    cmp x0,#0                        // ok\u00a0?\n    bne 3b                           // no - > loop\n\n10:                                  // display new game\u00a0?\n    ldr x0,qAdrszCarriageReturn\n    bl affichageMess\n    ldr x0,qAdrszMessNewGame\n    bl affichageMess\n    bl saisie\n    cmp x0,#'y'\n    beq 1b\n    cmp x0,#'Y'\n    beq 1b\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 \nqAdrszCarriageReturn:     .quad szCarriageReturn\nqAdrszMessRules:          .quad szMessRules\nqAdrszMessDigits:         .quad szMessDigits\nqAdrszMessExpr:           .quad szMessExpr\nqAdrszMessNewGame:        .quad szMessNewGame\nqAdrsZoneConv:            .quad sZoneConv\nqAdriTabDigit:            .quad iTabDigit\nqAdriTabTopDigit:         .quad iTabTopDigit\n/******************************************************************/\n/*            evaluation expression                                       */ \n/******************************************************************/\n/* x0 return 0 if ok -1 else */\nevalExpr:\n    stp x1,lr,[sp,-16]!        // save  registres\n    stp x2,x3,[sp,-16]!        // save  registres\n    stp x4,x5,[sp,-16]!        // save  registres\n    stp x6,x7,[sp,-16]!        // save  registres\n    stp x8,x9,[sp,-16]!        // save  registres\n    stp x10,fp,[sp,-16]!       // save  registres\n    mov x0,#0\n    ldr x1,qAdriTabTopDigit\n    mov x2,#0\n1:                             // loop init table top digits\n    str x0,[x1,x2,lsl #3]\n    add x2,x2,#1\n    cmp x2,#NBDIGITS\n    blt 1b\n    \n    sub sp,sp,#STACKSIZE * 8   // stack operator\n    mov fp,sp\n    sub sp,sp,#STACKSIZE * 8   // stack digit\n    mov x1,sp\n    ldr x10,qAdrsBuffer\n    mov x8,#0                  // indice character in buffer\n    mov x7,#0                  // indice digits stack\n    mov x2,#0                  // indice operator stack\n    mov x9,0\n1:                             // begin loop\n    ldrb w9,[x10,x8]\n    cmp x9,#0xA               // end expression\u00a0?\n    beq 90f\n    cmp x9,#' '               // space \u00a0?\n    cinc x8,x8,eq             // loop\n    beq 1b\n    cmp x9,#'('               // left parenthesis -> store in operator stack\n    bne 11f\n    str x9,[fp,x2,lsl 3]\n    add x2,x2,#1\n    add x8,x8,#1             // and loop\n    b 1b\n11:\n    cmp x9,#')'               // right parenthesis\u00a0?\n    bne 3f\n    mov x0,fp                  // compute operator stack until left parenthesis\n    sub x2,x2,#1\n2:\n    ldr x6,[fp,x2,lsl 3]\n    cmp x6,#'('                // left parenthesis\n    cinc x8,x8,eq              //  end\u00a0?\n    beq 1b                     // and loop\n    sub x7,x7,#1               // last digit\n    mov x3,x7\n    bl compute\n    sub x2,x2,#1\n    cmp x2,#0\n    bge 2b\n    ldr x0,qAdrszMessNoparen   // no left parenthesis in stack\n    bl affichageMess\n    mov x0,#-1\n    b 100f\n3:\n    cmp x9,#'+'               // addition\n    beq 4f\n    cmp x9,#'-'               // soustraction\n    beq 4f\n    cmp x9,#'*'               // multiplication\n    beq 4f\n    cmp x9,#'/'               // division\n    beq 4f\n\n    b 5f                       // not operator\n\n4:                             // control priority and depile stacks\n    mov x0,fp\n    mov x3,x7\n    mov x4,x9\n    bl depileOper\n    mov x7,x3\n    add x8,x8,#1\n    b 1b                       // and loop \n \n5:                             //  digit\n    sub x9,x9,#0x30\n    mov x0,x9\n    bl digitControl\n    cmp x0,#0                  // error\u00a0?\n    bne 100f\n    str x9,[x1,x7,lsl #3]     // store digit in digits stack\n    add x7,x7,#1\n\n    add x8,x8,#1\n    beq 1b    \n\n    b 100f\n90:                            // compute all stack operators\n    mov x0,fp\n    sub x7,x7,#1\n91:\n    subs x2,x2,#1\n    blt 92f\n    mov x3,x7\n    bl compute\n    sub x7,x7,#1\n    b 91b\n92: \n    ldr x0,[x1]                 // total = first value on digits stack\n    cmp x0,#TOTAL               // control total \n    beq 93f                     // ok \n    ldr x1,qAdrsZoneConv\n    bl conversion10             // call decimal conversion\n    mov x2,#0\n    strb w2,[x1,x0]\n    ldr x0,qAdrszMessNotOK\n    ldr x1,qAdrsZoneConv        // insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n    mov x0,#-1\n    b 100f\n93:                             // control use all digits\n    ldr x1,qAdriTabTopDigit\n    mov x2,#0\n94:                             // begin loop\n    ldr x0,[x1,x2,lsl #3]       // load top\n    cmp x0,#0            \n    bne 95f\n    ldr x0,qAdrszMessNoalldigits\n    bl affichageMess\n    mov x0,#-1\n    b 100f\n95:\n    add x2,x2,#1\n    cmp x2,#NBDIGITS\n    blt 94b\n96:                             // display message OK\n    ldr x0,qAdrszMessOK\n    bl affichageMess\n    mov x0,#0\n    b 100f\n    \n100:\n    add sp,sp,8 * (STACKSIZE *2)    // stack algnement\n    ldp x10,fp,[sp],16          // restaur des  2 registres\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\nqAdrszMessNoparen:        .quad szMessNoparen\nqAdrszMessNotOK:          .quad szMessNotOK\nqAdrszMessOK:             .quad szMessOK\nqAdrszMessNoalldigits:    .quad szMessNoalldigits\n/******************************************************************/\n/*            depile operator                                     */ \n/******************************************************************/\n/* x0 operator stack address  */\n/* x1 digits stack address */\n/* x2 operator indice */\n/* x3 digits indice */\n/* x4 operator */\n/* x2 return a new operator indice */\n/* x3 return a new digits indice */\ndepileOper:\n    stp x4,lr,[sp,-16]!    // save  registres\n    stp x5,x6,[sp,-16]!    // save  registres\n    stp x7,x8,[sp,-16]!    // save  registres\n    cmp x2,#0              // first operator\u00a0?\n    beq 60f\n    sub x5,x2,#1\n1:\n    ldr x6,[x0,x5,lsl #3]  // load stack operator\n    cmp x6,x4              // same operators\n    beq 50f\n    cmp x6,#'*'            // multiplication\n    beq 50f\n    cmp x6,#'/'            // division\n    beq 50f\n    cmp x6,#'-'            // soustraction\n    beq 50f\n    \n    b 60f\n50:                        // depile operators stack and compute\n    sub x2,x2,#1\n    sub x3,x3,#1\n    bl compute\n    sub x5,x5,#1\n    cmp x5,#0\n    bge 1b\n60:\n    str x4,[x0,x2,lsl #3]  // add operator in stack\n    add x2,x2,#1\n    \n100:\n    ldp x7,x8,[sp],16           // restaur des  2 registres\n    ldp x5,x6,[sp],16           // restaur des  2 registres\n    ldp x4,lr,[sp],16           // restaur des  2 registres\n    ret\n/******************************************************************/\n/*            compute                                             */ \n/******************************************************************/\n/* x0 operator stack address  */\n/* x1 digits stack address */\n/* x2 operator indice */\n/* x3 digits indice */\ncompute:\n    stp x1,lr,[sp,-16]!   // save  registres\n    stp x2,x3,[sp,-16]!   // save  registres\n    stp x4,x5,[sp,-16]!   // save  registres\n    stp x6,x7,[sp,-16]!   // save  registres\n    stp x8,x9,[sp,-16]!   // save  registres\n    ldr x6,[x1,x3,lsl 3]  // load second digit\n    sub x5,x3,#1\n    ldr x7,[x1,x5,lsl 3]  // load first digit\n    \n    ldr x8,[x0,x2,lsl 3]  // load operator\n    cmp x8,#'+'\n    bne 1f\n    add x7,x7,x6           // addition\n    str x7,[x1,x5,lsl 3] \n    b 100f\n1:     \n    cmp x8,#'-'\n    bne 2f\n    sub x7,x7,x6           // soustaction\n    str x7,[x1,x5,lsl 3] \n    b 100f\n2:\n    cmp x8,#'*'\n    bne 3f                 // multiplication\n    mul x7,x6,x7\n    str x7,[x1,x5,lsl 3] \n    b 100f\n3:\n    cmp x8,#'/'\n    bne 4f\n    udiv x7,x7,x6          // division\n    str x7,[x1,x5,lsl 3]\n    b 100f\n4:\n    cmp x8,#'('            // left parenthesis\u00a0?\n    bne 5f\n    ldr x0,qAdrszMessErrParen //  error \n    bl affichageMess\n    mov x0,#-1\n    b 100f\n5:\n    ldr x0,qAdrszMessErrOper\n    bl affichageMess\n    mov x0,#-1\n100:\n    ldp x8,x9,[sp],16     // restaur des  2 registres\n    ldp x6,x7,[sp],16     // restaur des  2 registres\n    ldp x4,x5,[sp],16     // restaur des  2 registres\n    ldp x2,x3,[sp],16     // restaur des  2 registres\n    ldp x1,lr,[sp],16     // restaur des  2 registres\n    ret\nqAdrszMessErrOper:   .quad szMessErrOper\nqAdrszMessErrParen:  .quad szMessErrParen\n/******************************************************************/\n/*            control digits                                       */ \n/******************************************************************/\n/* x0 return 0 if OK 1 if  not digit   */\ndigitControl:\n    stp x1,lr,[sp,-16]!   // save  registres\n    stp x2,x3,[sp,-16]!   // save  registres\n    stp x4,x5,[sp,-16]!   // save  registres\n    ldr x1,qAdriTabTopDigit\n    ldr x2,qAdriTabDigit\n    mov x3,#0\n1:\n    ldr x4,[x2,x3,lsl #3]  // load digit\n    cmp x0,x4              // equal\u00a0?\n    beq 2f                 // yes\n    add x3,x3,#1           // no -> loop\n    cmp x3,#NBDIGITS       // end\u00a0?\n    blt 1b\n    ldr x0,qAdrszMessNoDigit // error\n    bl affichageMess\n    mov x0,#1\n    b 100f\n2:                         // control prev use \n    ldr x4,[x1,x3,lsl #3]\n    cmp x4,#0\n    beq 3f\n    add x3,x3,#1\n    cmp x3,#NBDIGITS\n    blt 1b\n    ldr x0,qAdrszMessSameDigit\n    bl affichageMess\n    mov x0,#1\n    b 100f\n3:\n    mov x4,#1\n    str x4,[x1,x3,lsl #3]\n    mov x0,#0\n100:\n    ldp x4,x5,[sp],16     // restaur des  2 registres\n    ldp x2,x3,[sp],16     // restaur des  2 registres\n    ldp x1,lr,[sp],16     // restaur des  2 registres\n    ret\nqAdrszMessNoDigit:     .quad szMessNoDigit\nqAdrszMessSameDigit:   .quad szMessSameDigit\n/******************************************************************/\n/*            string entry                                       */ \n/******************************************************************/\n/* x0 return the first character of human entry */\nsaisie:\n    stp x1,lr,[sp,-16]!   // save  registres\n    stp x2,x3,[sp,-16]!   // save  registres\n    stp x4,x5,[sp,-16]!   // save  registres\n    stp x6,x7,[sp,-16]!   // save  registres\n    mov x0,STDIN          // Linux input console\n    ldr x1,qAdrsBuffer    // buffer address \n    mov x2,BUFFERSIZE     // buffer size \n    mov x8,READ           // request to read datas\n    svc 0                 // call system\n    ldr x1,qAdrsBuffer    // buffer address \n    ldrb w0,[x1]          // load first character\n100:\n    ldp x6,x7,[sp],16     // restaur des  2 registres\n    ldp x4,x5,[sp],16     // restaur des  2 registres\n    ldp x2,x3,[sp],16     // restaur des  2 registres\n    ldp x1,lr,[sp],16     // restaur des  2 registres\n    ret\nqAdrsBuffer:         .quad sBuffer\n/***************************************************/\n/*   Generation random number                  */\n/***************************************************/\n/* x0 contains limit  */\ngenereraleas:\n    stp x1,lr,[sp,-16]!   // save  registres\n    stp x2,x3,[sp,-16]!   // save  registres\n    stp x4,x5,[sp,-16]!   // save  registres\n    ldr x4,qAdrqGraine\n    ldr x2,[x4]\n    ldr x3,qNbDep1\n    mul x2,x3,x2\n    ldr x3,qNbDep2\n    add x2,x2,x3\n    str x2,[x4]           // maj de la graine pour l appel suivant \n    cmp x0,#0\n    beq 100f\n    add x0,x0,#1\n    udiv x3,x2,x0\n    msub x0,x3,x0,x2      // r\u00e9sult = remainder\n    \n    ldp x4,x5,[sp],16     // restaur des  2 registres\n    ldp x2,x3,[sp],16     // restaur des  2 registres\n    ldp x1,lr,[sp],16     // restaur des  2 registres\n    ret\n\n/*****************************************************/\nqAdrqGraine: .quad qGraine\nqNbDep1:     .quad 0x0019660d\nqNbDep2:     .quad 0x3c6ef35f\n/********************************************************/\n/*        File Include fonctions                        */\n/********************************************************/\n/* for this file see task include a file in language AArch64 assembly */\n.include \"../includeARM64.inc\"",
        "safe": true
    },
    {
        "filename": "24_game_30.txt",
        "content": "        >>SOURCE FORMAT FREE\n*> This code is dedicated to the public domain\n*> This is GNUCobol 2.0\nidentification division.\nprogram-id. twentyfour.\nenvironment division.\nconfiguration section.\nrepository. function all intrinsic.\ndata division.\nworking-storage section.\n01  p pic 999.\n01  p1 pic 999.\n01  p-max pic 999 value 38.\n01  program-syntax pic x(494) value\n*>statement = expression;\n        '001 001 000 n'\n    &   '002 000 004 ='\n    &   '003 005 000 n'\n    &   '004 000 002\u00a0;'\n*>expression = term, {('+'|'-') term,};\n    &   '005 005 000 n'\n    &   '006 000 016 ='\n    &   '007 017 000 n'\n    &   '008 000 015 {'\n    &   '009 011 013 ('\n    &   '010 001 000 t'\n    &   '011 013 000 |'\n    &   '012 002 000 t'\n    &   '013 000 009 )'\n    &   '014 017 000 n'\n    &   '015 000 008 }'\n    &   '016 000 006\u00a0;'\n*>term = factor, {('*'|'/') factor,};\n    &   '017 017 000 n'\n    &   '018 000 028 ='\n    &   '019 029 000 n'\n    &   '020 000 027 {'\n    &   '021 023 025 ('\n    &   '022 003 000 t'\n    &   '023 025 000 |'\n    &   '024 004 000 t'\n    &   '025 000 021 )'\n    &   '026 029 000 n'\n    &   '027 000 020 }'\n    &   '028 000 018\u00a0;'\n*>factor = ('(' expression, ')' | digit,);\n    &   '029 029 000 n'\n    &   '030 000 038 ='\n    &   '031 035 037 ('\n    &   '032 005 000 t'\n    &   '033 005 000 n'\n    &   '034 006 000 t'\n    &   '035 037 000 |'\n    &   '036 000 000 n'\n    &   '037 000 031 )'\n    &   '038 000 030\u00a0;'.\n01  filler redefines program-syntax.\n    03  p-entry occurs 038.\n        05  p-address pic 999.\n        05  filler pic x.\n        05  p-definition pic 999.\n        05  p-alternate redefines p-definition pic 999.\n        05  filler pic x.\n        05  p-matching pic 999.\n        05  filler pic x.\n        05  p-symbol pic x.\n\n01  t pic 999.\n01  t-len pic 99 value 6.\n01  terminal-symbols\n    pic x(210) value\n        '01 +                               '                                                               \n    &   '01 -                               '                                                               \n    &   '01 *                               '\n    &   '01 /                               '\n    &   '01 (                               '\n    &   '01 )                               '.\n01  filler redefines terminal-symbols.\n    03  terminal-symbol-entry occurs 6.\n        05  terminal-symbol-len pic 99.\n        05  filler pic x.\n        05  terminal-symbol pic x(32).\n\n01  nt pic 999.\n01  nt-lim pic 99 value 5.\n01  nonterminal-statements pic x(294) value\n        \"000 ....,....,....,....,....,....,....,....,....,\"\n    &   \"001 statement = expression;                      \"                                                       \n    &   \"005 expression = term, {('+'|'-') term,};        \"                                                      \n    &   \"017 term = factor, {('*'|'/') factor,};          \"                                                             \n    &   \"029 factor = ('(' expression, ')' | digit,);     \"                                                           \n    &   \"036 digit;                                       \".                                                            \n01  filler redefines nonterminal-statements.\n    03  nonterminal-statement-entry occurs 5.\n        05  nonterminal-statement-number pic 999.\n        05  filler pic x.\n        05  nonterminal-statement pic x(45).\n\n01  indent pic x(64) value all '|  '. \n01  interpreter-stack.\n    03  r pic 99. *> previous top of stack\n    03  s pic 99. *> current top of stack\n    03  s-max pic 99 value 32.\n    03  s-entry occurs 32.\n        05  filler pic x(2) value 'p='.\n        05  s-p pic 999. *> callers return address\n        05  filler pic x(4) value ' sc='.\n        05  s-start-control pic 999. *> sequence start address\n        05  filler pic x(4) value ' ec='.\n        05  s-end-control pic 999. *> sequence end address\n        05  filler pic x(4) value ' al='.\n        05  s-alternate pic 999. *> the next alternate \n        05  filler pic x(3) value ' r='.\n        05  s-result pic x. *> S success, F failure, N no result\n        05  filler pic x(3) value ' c='.\n        05  s-count pic 99. *> successes in a sequence\n        05  filler pic x(3) value ' x='.\n        05  s-repeat pic 99. *> repeats in a {} sequence\n        05  filler pic x(4) value ' nt='.\n        05  s-nt pic 99. *> current nonterminal\n\n01  language-area.\n    03  l pic 99.\n    03  l-lim pic 99.\n    03  l-len pic 99 value 1.\n    03  nd pic 9.\n    03  number-definitions.\n        05  n occurs 4 pic 9.\n    03  nu pic 9.\n    03  number-use.\n        05  u occurs 4 pic x.\n    03  statement.\n        05  c occurs 32.\n            07  c9 pic 9.\n\n01  number-validation.\n    03  p4 pic 99.\n    03  p4-lim pic 99 value 24.\n    03  permutations-4 pic x(96) value\n          '1234'\n        & '1243'\n        & '1324'\n        & '1342'\n        & '1423'\n        & '1432'\n        & '2134'\n        & '2143'\n        & '2314'\n        & '2341'\n        & '2413'\n        & '2431'\n        & '3124'\n        & '3142'\n        & '3214'\n        & '3241'\n        & '3423'\n        & '3432'\n        & '4123'\n        & '4132'\n        & '4213'\n        & '4231'\n        & '4312'\n        & '4321'.\n     03  filler redefines permutations-4.\n         05  permutation-4 occurs 24 pic x(4).\n     03  current-permutation-4 pic x(4).\n     03  cpx pic 9.\n     03  od1 pic 9.\n     03  od2 pic 9.\n     03  odx pic 9.\n     03  od-lim pic 9 value 4.\n     03  operator-definitions pic x(4) value '+-*/'.\n     03  current-operators pic x(3).\n     03  co3 pic 9.\n     03  rpx pic 9.\n     03  rpx-lim pic 9 value 4.\n     03  valid-rpn-forms pic x(28) value\n          'nnonono'\n        & 'nnnonoo'\n        & 'nnnoono'\n        & 'nnnnooo'.\n    03  filler redefines valid-rpn-forms.\n        05  rpn-form occurs 4 pic x(7).\n    03  current-rpn-form pic x(7).\n\n01  calculation-area.\n    03  osx pic 99.\n    03  operator-stack pic x(32).\n    03  oqx pic 99.\n    03  oqx1 pic 99.\n    03  output-queue pic x(32).\n    03  work-number pic s9999.\n    03  top-numerator pic s9999 sign leading separate.\n    03  top-denominator pic s9999 sign leading separate.\n    03  rsx pic 9.\n    03  result-stack occurs 8.\n        05  numerator pic s9999.\n        05  denominator pic s9999.\n\n01  error-found pic x.\n01  divide-by-zero-error pic x.\n\n*>  diagnostics\n01  NL pic x value x'0A'.\n01  NL-flag pic x value space.\n01  display-level pic x value '0'.\n01  loop-lim pic 9999 value 1500.\n01  loop-count pic 9999 value 0.\n01  message-area value spaces.\n    03  message-level pic x.\n    03  message-value pic x(128).\n\n*>  input and examples\n01  instruction pic x(32) value spaces.\n01  tsx pic 99.\n01  tsx-lim pic 99 value 14.\n01  test-statements.\n    03  filler pic x(32) value '1234;1 + 2 + 3 + 4'.\n    03  filler pic x(32) value '1234;1 * 2 * 3 * 4'. \n    03  filler pic x(32) value '1234;((1)) * (((2 * 3))) * 4'. \n    03  filler pic x(32) value '1234;((1)) * ((2 * 3))) * 4'. \n    03  filler pic x(32) value '1234;(1 + 2 + 3 + 4'. \n    03  filler pic x(32) value '1234;)1 + 2 + 3 + 4'. \n    03  filler pic x(32) value '1234;1 * * 2 * 3 * 4'. \n    03  filler pic x(32) value '5679;6 - (5 - 7) * 9'. \n    03  filler pic x(32) value '1268;((1 * (8 * 6) / 2))'. \n    03  filler pic x(32) value '4583;-5-3+(8*4)'. \n    03  filler pic x(32) value '4583;8 * 4 - 5 - 3'. \n    03  filler pic x(32) value '4583;8 * 4 - (5 + 3)'. \n    03  filler pic x(32) value '1223;1 * 3 / (2 - 2)'. \n    03  filler pic x(32) value '2468;(6 * 8) / 4 / 2'. \n01  filler redefines test-statements.\n    03  filler occurs 14.\n        05  test-numbers pic x(4).\n        05  filler pic x.\n        05  test-statement pic x(27).\n\nprocedure division.\nstart-twentyfour.\n    display 'start twentyfour'\n    perform generate-numbers\n    display 'type h <enter> to see instructions'\n    accept instruction\n    perform until instruction = spaces or 'q'\n        evaluate true\n        when instruction = 'h'\n            perform display-instructions\n        when instruction = 'n'\n            perform generate-numbers\n        when instruction(1:1) = 'm'\n            move instruction(2:4) to number-definitions\n            perform validate-number\n            if divide-by-zero-error = space\n            and 24 * top-denominator = top-numerator\n                display number-definitions ' is solved by ' output-queue(1:oqx)\n            else\n                display number-definitions ' is not solvable'\n            end-if\n        when instruction = 'd0' or 'd1' or 'd2' or 'd3'\n            move instruction(2:1) to display-level\n        when instruction = 'e'\n            display 'examples:'\n            perform varying tsx from 1 by 1\n            until tsx > tsx-lim\n                move spaces to statement\n                move test-numbers(tsx) to number-definitions\n                move test-statement(tsx) to statement\n                perform evaluate-statement\n                perform show-result\n            end-perform\n        when other\n            move instruction to statement\n            perform evaluate-statement\n            perform show-result\n        end-evaluate\n        move spaces to instruction\n        display 'instruction? ' with no advancing\n        accept instruction\n    end-perform\n\n    display 'exit twentyfour'\n    stop run\n    .\ngenerate-numbers.\n    perform with test after until divide-by-zero-error = space\n    and 24 * top-denominator = top-numerator\n        compute n(1) = random(seconds-past-midnight) * 10 *> seed\n        perform varying nd from 1 by 1 until nd > 4\n            compute n(nd) = random() * 10\n            perform until n(nd) <> 0\n                compute n(nd) = random() * 10\n            end-perform\n        end-perform\n        perform validate-number\n    end-perform\n    display NL 'numbers:' with no advancing\n    perform varying nd from 1 by 1 until nd > 4\n        display space n(nd) with no advancing\n    end-perform\n    display space\n    .\nvalidate-number.\n    perform varying p4 from 1 by 1 until p4 > p4-lim\n        move permutation-4(p4) to current-permutation-4 \n        perform varying od1 from 1 by 1 until od1 > od-lim\n            move operator-definitions(od1:1) to current-operators(1:1)\n            perform varying od2 from 1 by 1 until od2 > od-lim\n                move operator-definitions(od2:1) to current-operators(2:1)\n                perform varying odx from 1 by 1 until odx > od-lim\n                    move operator-definitions(odx:1) to current-operators(3:1)\n                    perform varying rpx from 1 by 1 until rpx > rpx-lim\n                        move rpn-form(rpx) to current-rpn-form\n                        move 0 to cpx co3\n                        move spaces to output-queue\n                        move 7 to oqx\n                        perform varying oqx1 from 1 by 1 until oqx1 > oqx\n                            if current-rpn-form(oqx1:1) = 'n'\n                                add 1 to cpx\n                                move current-permutation-4(cpx:1) to nd\n                                move n(nd) to output-queue(oqx1:1)\n                            else\n                                add 1 to co3\n                                move current-operators(co3:1) to output-queue(oqx1:1)\n                            end-if\n                        end-perform\n                    end-perform\n                    perform evaluate-rpn\n                    if divide-by-zero-error = space\n                    and 24 * top-denominator = top-numerator\n                        exit paragraph\n                    end-if\n                end-perform\n            end-perform\n        end-perform\n    end-perform\n    .  \ndisplay-instructions.\n    display '1)  Type h <enter> to repeat these instructions.'\n    display '2)  The program will display four randomly-generated'\n    display '    single-digit numbers and will then prompt you to enter'\n    display '    an arithmetic expression followed by <enter> to sum'\n    display '    the given numbers to 24.'\n    display '    The four numbers may contain duplicates and the entered'\n    display '    expression must reference all the generated numbers and duplicates.'\n    display '    Warning:  the program converts the entered infix expression'\n    display '    to a reverse polish notation (rpn) expression'\n    display '    which is then interpreted from RIGHT to LEFT.'\n    display '    So, for instance, 8*4 - 5 - 3 will not sum to 24.' \n    display '3)  Type n <enter> to generate a new set of four numbers.'\n    display '    The program will ensure the generated numbers are solvable.'\n    display '4)  Type m#### <enter> (e.g. m1234) to create a fixed set of numbers'\n    display '    for testing purposes.'\n    display '    The program will test the solvability of the entered numbers.'\n    display '    For example, m1234 is solvable and m9999 is not solvable.'\n    display '5)  Type d0, d1, d2 or d3 followed by <enter> to display none or'\n    display '    increasingly detailed diagnostic information as the program evaluates' \n    display '    the entered expression.'\n    display '6)  Type e <enter> to see a list of example expressions and results'\n    display '7)  Type <enter> or q <enter> to exit the program' \n    .\nshow-result.\n    if error-found = 'y'\n    or divide-by-zero-error = 'y'\n        exit paragraph\n    end-if\n    display 'statement in RPN is' space output-queue\n    evaluate true\n    when top-numerator = 0\n    when top-denominator = 0\n    when 24 * top-denominator <> top-numerator\n        display 'result (' top-numerator '/' top-denominator ') is not 24'\n    when other\n        display 'result is 24'\n    end-evaluate\n    .\nevaluate-statement.\n    compute l-lim = length(trim(statement))\n\n    display NL 'numbers:' space n(1) space n(2) space n(3) space n(4)\n    move number-definitions to number-use\n    display 'statement is' space statement  \n\n    move 1 to l\n    move 0 to loop-count\n    move space to error-found\n\n    move 0 to osx oqx\n    move spaces to output-queue\n\n    move 1 to p\n    move 1 to nt\n    move 0 to s\n    perform increment-s\n    perform display-start-nonterminal\n    perform increment-p\n\n    *>===================================\n    *> interpret ebnf\n    *>=================================== \n    perform until s = 0 \n    or error-found = 'y'\n\n        evaluate true\n\n        when p-symbol(p) = 'n'\n        and p-definition(p) = 000 *> a variable\n           perform test-variable\n       if s-result(s) = 'S'\n               perform increment-l\n           end-if\n           perform increment-p\n\n       when p-symbol(p) = 'n'\n       and p-address(p) <> p-definition(p) *> nonterminal reference\n           move p to s-p(s)\n           move p-definition(p) to p\n\n       when p-symbol(p) = 'n'\n       and p-address(p) = p-definition(p) *> nonterminal definition\n           perform increment-s\n           perform display-start-nonterminal\n           perform increment-p\n\n        when p-symbol(p) = '=' *> nonterminal control\n            move p to s-start-control(s)\n            move p-matching(p) to s-end-control(s)\n            perform increment-p\n\n        when p-symbol(p) = ';' *> end nonterminal\n            perform display-end-control\n            perform display-end-nonterminal\n            perform decrement-s\n            if s > 0\n                evaluate true\n                when s-result(r) = 'S'\n                    perform set-success\n                when s-result(r) = 'F'\n                    perform set-failure\n                end-evaluate\n                move s-p(s) to p\n                perform increment-p\n                perform display-continue-nonterminal\n            end-if\n\n    when p-symbol(p) = '{' *> start repeat sequence\n            perform increment-s\n            perform display-start-control\n            move p to s-start-control(s)\n            move p-alternate(p) to s-alternate(s)\n            move p-matching(p) to s-end-control(s)\n            move 0 to s-count(s)\n            perform increment-p\n\n        when p-symbol(p) = '}' *> end repeat sequence\n            perform display-end-control\n            evaluate true\n            when s-result(s) = 'S' *> repeat the sequence\n                perform display-repeat-control\n                perform set-nothing\n                add 1 to s-repeat(s)\n                move s-start-control(s) to p\n                perform increment-p\n           when other\n               perform decrement-s\n               evaluate true\n               when s-result(r) = 'N'\n               and s-repeat(r) = 0 *> no result\n                   perform increment-p\n               when s-result(r) = 'N'\n               and s-repeat(r) > 0 *> no result after success\n                   perform set-success\n                   perform increment-p\n               when other *> fail the sequence\n                   perform increment-p\n               end-evaluate\n           end-evaluate\n\n        when p-symbol(p) = '(' *> start sequence\n            perform increment-s\n            perform display-start-control\n            move p to s-start-control(s)\n            move p-alternate(p) to s-alternate(s)\n            move p-matching(p) to s-end-control(s)\n            move 0 to s-count(s)\n            perform increment-p\n\n       when p-symbol(p) = ')' *> end sequence\n           perform display-end-control\n           perform decrement-s\n           evaluate true\n           when s-result(r) = 'S' *> success\n               perform set-success\n               perform increment-p\n           when s-result(r) = 'N' *> no result\n               perform set-failure\n               perform increment-p\n            when other *> fail the sequence\n               perform set-failure\n               perform increment-p\n           end-evaluate\n\n        when p-symbol(p) = '|' *> alternate\n            evaluate true\n            when s-result(s) = 'S' *> exit the sequence\n                perform display-skip-alternate\n                move s-end-control(s) to p\n            when other\n                perform display-take-alternate\n                move p-alternate(p) to s-alternate(s) *> the next alternate\n                perform increment-p\n                perform set-nothing\n            end-evaluate\n\n        when p-symbol(p) = 't' *> terminal\n            move p-definition(p) to t\n            move terminal-symbol-len(t) to t-len\n            perform display-terminal\n            evaluate true\n            when statement(l:t-len) = terminal-symbol(t)(1:t-len) *> successful match\n               perform set-success\n               perform display-recognize-terminal\n               perform process-token\n               move t-len to l-len\n               perform increment-l\n               perform increment-p\n            when s-alternate(s) <> 000 *> we are in an alternate sequence\n               move s-alternate(s) to p\n            when other *> fail the sequence\n               perform set-failure\n               move s-end-control(s) to p\n            end-evaluate\n\n        when other *> end control\n            perform display-control-failure *> shouldnt happen\n\n        end-evaluate\n\n     end-perform\n\n     evaluate true *> at end of evaluation\n     when error-found = 'y'\n         continue\n     when l <= l-lim *> not all tokens parsed\n         display 'error: invalid statement'\n         perform statement-error\n     when number-use <> spaces\n         display 'error:  not all numbers were used: ' number-use\n         move 'y' to error-found\n     end-evaluate\n    .\nincrement-l.\n    evaluate true\n    when l > l-lim *> end of statement\n        continue\n    when other\n        add l-len to l\n        perform varying l from l by 1 \n        until c(l) <> space\n        or l > l-lim\n            continue\n        end-perform\n        move 1 to l-len\n        if l > l-lim\n            perform end-tokens\n        end-if\n    end-evaluate\n    .\nincrement-p.\n    evaluate true\n    when p >= p-max\n        display 'at' space p ' parse overflow'\n            space 's=<' s space s-entry(s) '>'\n        move 'y' to error-found\n    when other\n        add 1 to p\n        perform display-statement\n    end-evaluate\n    .\nincrement-s.\n    evaluate true\n    when s >= s-max\n        display 'at' space p ' stack overflow '\n            space 's=<' s space s-entry(s) '>'\n        move 'y' to error-found\n    when other\n        move s to r\n        add 1 to s\n        initialize s-entry(s)\n        move 'N' to s-result(s)\n        move p to s-p(s)\n        move nt to s-nt(s)\n    end-evaluate\n    .\ndecrement-s.\n    if s > 0\n        move s to r\n        subtract 1 from s\n        if s > 0\n            move s-nt(s) to nt\n        end-if\n    end-if\n    .\nset-failure.\n    move 'F' to s-result(s)\n    if s-count(s) > 0\n        display 'sequential parse failure'\n        perform statement-error\n    end-if\n    .\nset-success.\n    move 'S' to s-result(s)\n    add 1 to s-count(s)\n    .\nset-nothing.\n    move 'N' to s-result(s)\n    move 0 to s-count(s)\n    .\nstatement-error.\n    display statement\n    move spaces to statement\n    move '^ syntax error' to statement(l:)\n    display statement\n    move 'y' to error-found\n    .\n*>=====================\n*> twentyfour semantics\n*>=====================\ntest-variable.\n    *> check validity\n    perform varying nd from 1 by 1 until nd > 4\n    or c(l) = n(nd)\n        continue\n    end-perform\n    *> check usage\n    perform varying nu from 1 by 1 until nu > 4\n    or c(l) = u(nu)\n        continue\n    end-perform\n    evaluate true\n    when l > l-lim\n        perform set-failure\n    when c9(l) not numeric\n        perform set-failure\n    when nd > 4\n        display 'invalid number'\n        perform statement-error\n    when nu > 4\n        display 'number already used'\n        perform statement-error\n    when other\n        move space to u(nu)\n        perform set-success\n        add 1 to oqx\n        move c(l) to output-queue(oqx:1)\n    end-evaluate\n    .\n*> ==================================\n*> Dijkstra Shunting-Yard Algorithm\n*> to convert infix to rpn\n*> ==================================\nprocess-token.\n    evaluate true\n    when c(l) = '('\n        add 1 to osx\n        move c(l) to operator-stack(osx:1)\n    when c(l) = ')'\n        perform varying osx from osx by -1 until osx < 1\n        or operator-stack(osx:1) = '('\n            add 1 to oqx\n            move operator-stack(osx:1) to output-queue(oqx:1)\n        end-perform\n        if osx < 1\n            display 'parenthesis error'\n            perform statement-error\n            exit paragraph\n        end-if\n        subtract 1 from osx\n    when (c(l) = '+' or '-') and (operator-stack(osx:1) = '*' or '/')\n        *> lesser operator precedence\n        add 1 to oqx\n        move operator-stack(osx:1) to output-queue(oqx:1) \n        move c(l) to operator-stack(osx:1)\n    when other\n        *> greater operator precedence\n        add 1 to osx\n        move c(l) to operator-stack(osx:1)\n    end-evaluate\n    . \nend-tokens.\n    *> 1) copy stacked operators to the output-queue\n    perform varying osx from osx by -1 until osx < 1\n    or operator-stack(osx:1) = '('\n        add 1 to oqx\n        move operator-stack(osx:1) to output-queue(oqx:1)\n    end-perform\n    if osx > 0\n        display 'parenthesis error'\n        perform statement-error\n        exit paragraph\n    end-if\n    *> 2) evaluate the rpn statement\n    perform evaluate-rpn\n    if divide-by-zero-error = 'y'\n        display 'divide by zero error'\n    end-if\n    .\nevaluate-rpn.\n    move space to divide-by-zero-error\n    move 0 to rsx *> stack depth\n    perform varying oqx1 from 1 by 1 until oqx1 > oqx\n        if output-queue(oqx1:1) >= '1' and <= '9'\n            *> push current data onto the stack\n            add 1 to rsx\n            move top-numerator to numerator(rsx)\n            move top-denominator to denominator(rsx)\n            move output-queue(oqx1:1) to top-numerator\n            move 1 to top-denominator\n        else\n            *> apply the operation\n            evaluate true\n            when output-queue(oqx1:1) = '+'\n                compute top-numerator = top-numerator * denominator(rsx)\n                    + top-denominator * numerator(rsx)\n                compute top-denominator = top-denominator * denominator(rsx)  \n            when output-queue(oqx1:1) = '-' \n                compute top-numerator = top-denominator * numerator(rsx)\n                    - top-numerator * denominator(rsx)\n                compute top-denominator = top-denominator * denominator(rsx)  \n            when output-queue(oqx1:1) = '*' \n                compute top-numerator = top-numerator * numerator(rsx)\n                compute top-denominator = top-denominator * denominator(rsx)  \n            when output-queue(oqx1:1) = '/'\n                compute work-number = numerator(rsx) * top-denominator\n                compute top-denominator = denominator(rsx) * top-numerator\n                if top-denominator = 0\n                    move 'y' to divide-by-zero-error\n                    exit paragraph\n                end-if\n                move work-number to top-numerator\n            end-evaluate\n            *> pop the stack\n            subtract 1 from rsx\n        end-if\n    end-perform \n    .\n*>====================\n*> diagnostic displays\n*>====================\ndisplay-start-nonterminal.\n    perform varying nt from nt-lim by -1 until nt < 1\n    or p-definition(p) = nonterminal-statement-number(nt)\n        continue\n    end-perform\n    if nt > 0\n        move '1' to NL-flag\n        string '1' indent(1:s + s) 'at ' s space p ' start ' trim(nonterminal-statement(nt))\n            into message-area perform display-message\n        move nt to s-nt(s)\n    end-if\n    .\ndisplay-continue-nonterminal.\n    move s-nt(s) to nt\n    string '1' indent(1:s + s) 'at ' s space p space p-symbol(p) ' continue ' trim(nonterminal-statement(nt)) ' with result ' s-result(s)\n            into message-area perform display-message\n    .\ndisplay-end-nonterminal.\n    move s-nt(s) to nt\n    move '2' to NL-flag\n    string '1' indent(1:s + s) 'at ' s space p ' end ' trim(nonterminal-statement(nt)) ' with result ' s-result(s)\n            into message-area perform display-message\n    .\ndisplay-start-control.\n    string '2' indent(1:s + s) 'at ' s space p ' start ' p-symbol(p) ' in ' trim(nonterminal-statement(nt))\n        into message-area perform display-message\n    .\ndisplay-repeat-control.\n    string '2' indent(1:s + s) 'at ' s space p ' repeat ' p-symbol(p) ' in ' trim(nonterminal-statement(nt))  ' with result ' s-result(s)\n        into message-area perform display-message\n    .\ndisplay-end-control.\n    string '2' indent(1:s + s) 'at ' s space p ' end ' p-symbol(p)  ' in ' trim(nonterminal-statement(nt)) ' with result ' s-result(s)\n        into message-area perform display-message\n    .\ndisplay-take-alternate.\n    string '2' indent(1:s + s) 'at ' s space p ' take alternate' ' in ' trim(nonterminal-statement(nt))\n        into message-area perform display-message\n    .\ndisplay-skip-alternate.\n    string '2' indent(1:s + s) 'at ' s space p ' skip alternate' ' in ' trim(nonterminal-statement(nt))\n        into message-area perform display-message\n    .\ndisplay-terminal.\n    string '1' indent(1:s + s) 'at ' s space p\n        ' compare ' statement(l:t-len) ' to ' terminal-symbol(t)(1:t-len)\n        ' in ' trim(nonterminal-statement(nt))\n        into message-area perform display-message\n    .\ndisplay-recognize-terminal.\n    string '1' indent(1:s + s) 'at ' s space p ' recognize terminal: ' c(l) ' in ' trim(nonterminal-statement(nt))\n        into message-area perform display-message\n    .\ndisplay-recognize-variable.\n    string '1' indent(1:s + s) 'at ' s space p ' recognize digit: ' c(l) ' in ' trim(nonterminal-statement(nt))\n        into message-area perform display-message\n    .\ndisplay-statement.\n    compute p1 = p - s-start-control(s)\n    string '3' indent(1:s + s) 'at ' s space p\n        ' statement: ' s-start-control(s) '/' p1\n        space p-symbol(p) space s-result(s)\n        ' in ' trim(nonterminal-statement(nt))\n        into message-area perform display-message\n    .\ndisplay-control-failure.\n    display loop-count space indent(1:s + s) 'at' space p ' control failure' ' in ' trim(nonterminal-statement(nt))\n    display loop-count space indent(1:s + s) '   ' 'p=<' p p-entry(p) '>'\n    display loop-count space indent(1:s + s) '   ' 's=<' s space s-entry(s) '>'\n    display loop-count space indent(1:s + s) '   ' 'l=<' l space c(l)'>'\n    perform statement-error\n    .\ndisplay-message.\n    if display-level = 1\n        move space to NL-flag\n    end-if\n    evaluate true\n    when loop-count > loop-lim *> loop control\n        display 'display count exceeds ' loop-lim\n        stop run\n    when message-level <= display-level\n        evaluate true\n        when NL-flag = '1'\n             display NL loop-count space trim(message-value)\n        when NL-flag = '2'\n             display loop-count space trim(message-value) NL\n        when other\n             display loop-count space trim(message-value)\n        end-evaluate\n    end-evaluate\n    add 1 to loop-count\n    move spaces to message-area\n    move space to NL-flag\n    .\nend program twentyfour.\n",
        "safe": true
    },
    {
        "filename": "24_game_31.txt",
        "content": "tty = require 'tty'\ntty.setRawMode true\n\nbuffer  = \"\"\nnumbers = []\n\nfor n in [0...4]\n    numbers.push Math.max 1, Math.floor(Math.random() * 9)\n    \nconsole.log \"You can use the numbers: #{numbers.join ' '}\"\n\nprocess.stdin.on 'keypress', (char, key) ->\n\n    # accept operator\n    if char and isNaN(char) and /[()*\\/+-]/.test(char) and buffer.substr(-1) isnt char\n        buffer += char\n        process.stdout.write char\n    # accept number\n    else if !isNaN(+char) and (buffer == '' or isNaN(buffer.substr -1))\n        buffer += char\n        process.stdout.write char\n    \n    # check then evaluate expression\n    if key?.name is 'enter'\n        result = calculate()\n        process.stdout.write '\\n'\n        if result and result is 24\n            console.log \" = 24! congratulations.\"\n        else\n            console.log \"#{result}. nope.\"\n        process.exit 0\n    \n    # quit\n    if key?.name is 'escape' or (key?.name == 'c' and key.ctrl)\n        process.exit 0\n\ncalculate = () ->\n\n    if /[^\\d\\s()+*\\/-]/.test buffer\n        console.log \"invalid characters\"\n        process.exit 1\n    \n    used = buffer.match(/\\d/g)\n    if used?.length != 4 or used.sort().join() != numbers.sort().join()\n        console.log \"you must use the 4 numbers provided\"\n        process.exit 1\n    \n    res = try eval buffer catch e\n    return res or 'invalid expression'\n\n    \n# begin taking input\nprocess.stdin.resume()\n",
        "safe": true
    },
    {
        "filename": "24_game_32.txt",
        "content": "1 rem 24 game\n2 rem for rosetta code\n10 rem use appropriate basic base address\n11 bh=08:bl=01: rem $0801 commodore 64\n12 rem bh=16:bl=01: rem $1001 commodore +4\n13 rem bh=18:bl=01: rem $1201 commodore vic-20 (35k ram)\n14 rem bh=04:bl=01: rem $0401 commodore pet\n15 rem bh=28:bl=01: rem $1c01 commodore 128 (bank 0)\n\n35 print chr$(147);chr$(14);\"Initializing...\":gosub 1400\n40 n$=\"\":x=rnd(-ti):rem similar to 'randomize'\n45 for i=1 to 4\n50 t$=str$(int(rnd(1)*9)+1)\n55 n$=n$+mid$(t$,2,1)\n60 next i\n\n65 print chr$(147)\n70 print spc(16);\"24 Game\"\n71 print:print \" The goal of this game is to formulate\"\n72 print:print \" an arithmetic expression that\"\n73 print:print \" evaluates to a value of 24, however\"\n74 print:print \" you may use only the four numbers\"\n75 print:print \" given at random by the computer and\"\n76 print:print \" the standard arithmetic operations of\"\n77 print:print \" add, subtract, multiply, and divide.\"\n78 print:print \" Each digit must be used by itself. \"\n79 print:print \" (e.g. if given 1, 2, 3, 4, you cannot\"\n80 print:print \" combine 1 and 2 to make 12.)\"\n89 gosub 1000\n\n90 i$=\"\":f$=\"\":p$=\"\"\n95 print chr$(147);\"Allowed characters:\"\n100 i$=n$+\"+-*/()\"\n110 print\n120 for i=1 to len(i$)\n130 print mid$(i$,i,1);\" \";\n140 next i:print\n150 print:print \"Spaces are ignored.\"\n155 print \"Enter 'end' to end.\":print\n160 input \"Enter the formula\";f$\n170 if f$=\"end\" then print \"Program terminated.\":end \n\n180 print:print \"Checking syntax... \";tab(34);\n190 for i=1 to len(f$)\n200 if mid$(f$,i,1)=\" \" then next i\n210 c$=mid$(f$,i,1)\n220 if c$=\"+\" or c$=\"-\" or c$=\"*\" or c$=\"/\" then p$=p$+\"o\":goto 250\n230 if c$=\"(\" or c$=\")\" then p$=p$+c$:goto 250\n240 p$=p$+\"n\"\n250 next i\n260 restore\n270 for i=1 to 11\n280 read t$\n290 if t$=p$ then i=11\n300 next i\n310 if t$<>p$ then gosub 1100:gosub 1000:goto 90\n\n315 print \"OK\":print \"Checking for illegal numbers... \";tab(34);\n320 for i=1 to len(f$)\n330 for j=1 to 10\n335 ft$=mid$(f$,i,1)\n336 il$=left$(i$,j-1):it$=mid$(i$,j,1):ir$=mid$(i$,j+1,len(i$))\n340 if ft$=it$ and ft$>\"0\" and ft$<=\"9\" then i$=il$+\" \"+ir$\n350 next j\n360 next i\n370 if mid$(i$,1,4)<>\"    \" then gosub 1200:gosub 1000:goto 90\n\n375 print \"OK\":print \"Evaluating expression...\":print:print tab(10);f$;\" =\";\n380 gosub 600:rem r=val(f$)\n390 print r;\" \"\n400 if r<>24 then gosub 1300:gosub 1000:goto 90\n410 print \"Correct!\"\n\n420 print:print \"Would you like to go again (y/n)? \";\n425 get k$:if k$<>\"y\" and k$<>\"n\" then 425\n430 print k$\n435 if k$=\"y\" then goto 40\n440 print:print \"Very well. Have a nice day!\"\n450 end\n\n500 rem pattern matching\n501 data \"nononon\",\"(non)onon\",\"nono(non)\"\n504 data \"no(no(non))\",\"((non)on)on\",\"no(non)on\"\n507 data \"(non)o(non)\",\"no((non)on)\",\"(nonon)on\"\n510 data \"(no(non))on\",\"no(nonon)\"\n\n600 rem get basic to evaluate our expression\n605 a$=\"r=\"+f$:gosub 1440\n610 for i=1 to len(a$)\n615 rem simple token translation\n620 b=asc(mid$(a$,i,1))\n625 if (b>41 and b<48) or b=61 or b=94 then b=t(b)\n630 poke (ad+i-1),b\n635 next\n640 gosub 2000\n645 rem gosub 1440:rem uncomment to clear evaluation line after use\n650 return\n\n1000 rem screen pause\n1005 pt$=\" Press a key to continue. \"\n1010 print:print spc(20-int(len(pt$)/2));\n1015 print chr$(18);pt$;chr$(146);\n1020 get k$:if k$=\"\"then 1020\n1030 return\n\n1100 rem syntax error\n1105 print \"ERROR\":print\n1110 print \"Maybe something is out of place...\"\n1120 return\n\n1200 rem invalid arguments\n1205 print \"ERROR\":print\n1210 print \"?Invalid Arguments - \"\n1215 print \"You used a number that is not allowed.\"\n1220 return\n\n1300 rem wrong formula\n1305 print:print \"Wrong answer. Try again.\"\n1310 return\n\n1400 dim t(94):t(43)=170:t(45)=171:t(42)=172:t(47)=173:t(61)=178:t(94)=174\n1405 rem locate line 2005 in ram\n1410 lh=bh:ll=bl:nh=0:nl=0\n1415 ad=lh*256+ll\n1420 lh=peek(ad+1):ll=peek(ad)\n1425 nl=peek(ad+2):nh=peek(ad+3):n=nh*256+nl\n1430 if n<>2005 then goto 1415\n1435 ad=ad+4:return\n\n1440 for j=ad to ad+73:poke j,asc(\":\"):next\n1445 return\n\n2000 rem put 74 colons on the next line\n2005 ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::\n2010 return\n",
        "safe": true
    },
    {
        "filename": "24_game_33.txt",
        "content": "Initializing...\n\n                24 Game\n\n The goal of this game is to formulate\n\n an arithmetic expression that\n\n evaluates to a value of 24, however\n\n you may only use four numbers provided\n\n at random by the computer and the\n\n standard arithmetic operations of add,\n\n subtract, multiply, and divide. Each\n\n digit must be used by itself. (e.g. if\n\n given 1, 2, 3, 4, you cannot combine\n\n 1 and 2 to make 12.)\n\n        Press a key to continue.\n\nAllowed characters:\n\n6 3 3 5 + - * / ( )\n\nSpaces are ignored.\nEnter 'end' to end.\n\nEnter the formula? (6-3)*(3+5)\n\nChecking syntax...               OK\nChecking for illegal numbers...  OK\nEvaluating expression...\n\n          (6-3)*(3+5) = 24\nCorrect!\n\nWould you like to go again (y/n)? n\n\nVery well. Have a nice day!\n\nready.\nlist 2005\n\n2005 r=(6-3)*(3+5)::::::::::::::::::::::\n:::::::::::::::::::::::::::::::::::::::\n\nready.\n\u2588",
        "safe": true
    },
    {
        "filename": "24_game_34.txt",
        "content": "(define-condition choose-digits () ())\n(define-condition bad-equation (error) ())\n\n(defun 24-game ()\n  (let (chosen-digits)\n    (labels ((prompt ()\n               (format t \"Chosen digits: ~{~D~^, ~}~%~\n                          Enter expression (or `bye' to quit, `!' to choose new digits): \"\n                       chosen-digits)\n               (read))\n             (lose () (error 'bad-equation))\n             (choose () (setf chosen-digits (loop repeat 4 collecting (1+ (random 9)))))\n             (check (e)\n               (typecase e\n                 ((eql bye) (return-from 24-game))\n                 ((eql !) (signal 'choose-digits))\n                 (atom (lose))\n                 (cons (check-sub (car e) (check-sub (cdr e) chosen-digits)) e)))\n             (check-sub (sub allowed-digits)\n               (typecase sub\n                 ((member nil + - * /) allowed-digits)\n                 (integer\n                  (if (member sub allowed-digits)\n                      (remove sub allowed-digits :count 1)\n                      (lose)))\n                 (cons (check-sub (car sub) (check-sub (cdr sub) allowed-digits)))\n                 (t (lose))))\n             (win ()\n               (format t \"You win.~%\")\n               (return-from 24-game)))\n      (choose)\n      (loop\n       (handler-case\n           (if (= 24 (eval (check (prompt)))) (win) (lose))\n         (error () (format t \"Bad equation, try again.~%\"))\n         (choose-digits () (choose)))))))\n",
        "safe": true
    },
    {
        "filename": "24_game_35.txt",
        "content": "(defconstant +ops+ '(* / + -))\n\n(defun expr-numbers (e &optional acc)\n  \"Return all the numbers in argument positions in the expression.\"\n  (cond\n   ((numberp e) (cons e acc))\n   ((consp e)\n    (append (apply #'append\n                   (mapcar #'expr-numbers (cdr e)))\n            acc))))\n\n(defun expr-well-formed-p (e)\n  \"Return non-nil if the given expression is well-formed.\"\n  (cond\n   ((numberp e) t)\n   ((consp e)\n    (and (member (car e) +ops+)\n         (every #'expr-well-formed-p (cdr e))))\n   (t nil)))\n\n(defun expr-valid-p (e available-digits)\n  \"Return non-nil if the expression is well-formed and uses exactly\nthe digits specified.\"\n  (and (expr-well-formed-p e)\n       (equalp (sort (copy-seq available-digits) #'<)\n               (sort (expr-numbers e) #'<))))\n\n(defun expr-get (&optional using)\n  (emit \"Enter lisp form~@[ using the digit~P ~{~D~^ ~}~]: \"\n        (when using\n          (length using)) using)\n  (let (*read-eval*)\n    (read)))\n\n(defun digits ()\n  (sort (loop repeat 4 collect (1+ (random 9))) #'<))\n\n(defun emit (fmt &rest args)\n  (format t \"~&~?\" fmt args))\n\n(defun prompt (digits)\n  (emit \"Using only these operators:~%~%~\n           ~2T~{~A~^ ~}~%~%~\n         And exactly these numbers \\(no repetition\\):~%~%~\n           ~2T~{~D~^ ~}~%~%~\n         ~A\"\n        +ops+ digits (secondary-prompt)))\n\n(defun secondary-prompt ()\n  (fill-to 50 \"Enter a lisp form which evaluates to ~\n               the integer 24, or \\\"!\\\" to get fresh ~\n               digits, or \\\"q\\\" to abort.\"))\n\n(defun fill-to (n fmt &rest args)\n  \"Poor-man's text filling mechanism.\"\n  (loop with s = (format nil \"~?\" fmt args)\n        for c across s\n        and i from 0\n        and j = 0 then (1+ j) ; since-last-newline ctr\n\n        when (char= c #\\Newline)\n        do (setq j 0)\n\n        else when (and (not (zerop j))\n                       (zerop (mod j n)))\n        do (loop for k from i below (length s)\n                 when (char= #\\Space (schar s k))\n                 do (progn\n                      (setf (schar s k) #\\Newline\n                            j 0)\n                      (loop-finish)))\n        finally (return s)))\n\n(defun 24-game ()\n  (loop with playing-p = t\n        and initial-digits = (digits)\n\n        for attempts from 0\n        and digits = initial-digits then (digits)\n\n        while playing-p\n\n        do (loop for e = (expr-get (unless (zerop attempts)\n                                     digits))\n                 do\n                 (case e\n                   (! (loop-finish))\n                   (Q (setq playing-p nil)\n                      (loop-finish))\n                   (R (emit \"Current digits: ~S\" digits))\n                   (t\n                    (if (expr-valid-p e digits)\n                        (let ((v (eval e)))\n                          (if (eql v 24)\n                              (progn\n                                (emit \"~%~%---> A winner is you! <---~%~%\")\n                                (setq playing-p nil)\n                                (loop-finish))\n                            (emit \"Sorry, the form you entered ~\n                                   computes to ~S, not 24.~%~%\"\n                                  v)))\n                      (emit \"Sorry, the form you entered did not ~\n                             compute.~%~%\")))))\n        initially (prompt initial-digits)))\n",
        "safe": true
    },
    {
        "filename": "24_game_36.txt",
        "content": "CL-USER 97 > (24-game)\nUsing only these operators:\n\n  * / + -\n\nAnd exactly these numbers (no repetition):\n\n  3 7 7 9\n\nEnter a lisp form which evaluates to the integer 24,\nor \"!\" to get fresh digits, or \"q\" to abort.\nEnter lisp form: (eval (read-from-string \"(/ 1 0)\"))\nSorry, the form you entered did not compute.\n\nEnter lisp form:\u00a0!\nEnter lisp form using the digits 4 5 7 8:\u00a0!\nEnter lisp form using the digits 1 2 4 5: (* 4 (* 5 (- 2 1)))\nSorry, the form you entered computes to 20, not 24.\n\nEnter lisp form using the digits 1 2 4 5: (* 4 (+ 5 (- 2 1)))\n\n\n---> A winner is you! <---\n\nNIL",
        "safe": true
    },
    {
        "filename": "24_game_37.txt",
        "content": "import std.stdio, std.random, std.math, std.algorithm, std.range,\n       std.typetuple;\n\nvoid main() {\n    void op(char c)() {\n        if (stack.length < 2)\n            throw new Exception(\"Wrong expression.\");\n        stack[$ - 2] = mixin(\"stack[$ - 2]\" ~ c ~ \"stack[$ - 1]\");\n        stack.popBack();\n    }\n\n    const problem = iota(4).map!(_ => uniform(1, 10))().array();\n    writeln(\"Make 24 with the digits: \", problem);\n\n    double[] stack;\n    int[] digits;\n    foreach (const char c; readln())\n        switch (c) {\n            case ' ', '\\t', '\\n': break;\n            case '1': .. case '9':\n                stack ~= c - '0';\n                digits ~= c - '0';\n                break;\n            foreach (o; TypeTuple!('+', '-', '*', '/')) {\n                case o: op!o(); break;\n            }\n            break;\n            default: throw new Exception(\"Wrong char: \" ~ c);\n        }\n\n    if (!digits.sort().equal(problem.dup.sort()))\n        throw new Exception(\"Not using the given digits.\");\n    if (stack.length != 1)\n        throw new Exception(\"Wrong expression.\");\n    writeln(\"Result: \", stack[0]);\n    writeln(abs(stack[0] - 24) < 0.001 ? \"Good job!\" : \"Try again.\");\n}\n",
        "safe": true
    },
    {
        "filename": "24_game_38.txt",
        "content": "Make 24 with the digits: [1, 8, 9, 8]\n8 1 - 9 + 8 +\nResult: 24\nGood job!",
        "safe": true
    },
    {
        "filename": "24_game_39.txt",
        "content": "var ErrorFlag: boolean;\nvar ErrorStr: string;\n\n\nfunction EvaluateExpression(Express: string): double;\n{ Recursive descent expression evaluator }\nvar Atom: char;\nvar ExpressStr: string;\nvar ExpressInx: integer;\nconst Tab_Char = #$09; SP_char = #$20;\n\n\tprocedure HandleError(S: string);\n\tbegin\n\tErrorStr:=S;\n\tErrorFlag:=True;\n\tAbort;\n\tend;\n\n\n\tprocedure GetChar;\n\tbegin\n\tif ExpressInx > Length(ExpressStr) then\n\t\tbegin\n\t\tAtom:= ')';\n\t\tend\n\t else\tbegin\n\t\tAtom:= ExpressStr[ExpressInx];\n\t\tInc(ExpressInx);\n\t\tend;\n\tend;\n\n\n\n\tprocedure SkipWhiteSpace;\n\t{ Skip Tabs And Spaces In Expression }\n\tbegin\n\twhile (Atom=TAB_Char) or (Atom=SP_char) do GetChar;\n\tend;\n\n\n\n\tprocedure SkipSpaces;\n\t{ Get Next Character, Ignoring Any Space Characters }\n\tbegin\n\trepeat GetChar until Atom <> SP_CHAR;\n\tend;\n\n\n\n\tfunction GetDecimal: integer;\n\t{ Read In A Decimal String And Return Its Value }\n\tvar S: string;\n\tbegin\n\tResult:=0;\n\tS:='';\n\twhile True do\n\t\tbegin\n\t\tif not (Atom in ['0'..'9']) then break;\n\t\tS:=S+Atom;\n\t\tGetChar;\n\t\tend;\n\tif S='' then HandleError('Number Expected')\n\telse Result:=StrToInt(S);\n\tif Result>9 then HandleError('Only Numbers 0..9 allowed')\n\tend;\n\n\n\tfunction Expression: double;\n\t{ Returns The Value Of An Expression }\n\n\n\n\t\tfunction Factor: double;\n\t\t{ Returns The Value Of A Factor }\n\t\tvar NEG: boolean;\n\t\tbegin\n\t\tResult:=0;\n\t\twhile Atom='+' do SkipSpaces;\t\t{ Ignore Unary \"+\" }\n\t\tNEG:= False;\n\t\twhile Atom ='-' do\t\t\t{ Unary \"-\" }\n\t\t\tbegin\n\t\t\tSkipSpaces;\n\t\t\tNEG:= not NEG;\n\t\t\tend;\n\n\t\tif (Atom>='0') and (Atom<='9') then Result:= GetDecimal\t{ Unsigned Integer }\n\t\telse case Atom of\n\t\t  '(':\tbegin\t\t\t\t{ Subexpression }\n\t\t\tSkipSpaces;\n\t\t\tResult:= Expression;\n\t\t\tif Atom<>')' then HandleError('Mismatched Parenthesis');\n\t\t\tSkipSpaces;\n\t\t\tend;\n\t\t  else\tHandleError('Syntax Error');\n\t\t  end;\n\t\t{ Numbers May Terminate With A Space Or Tab }\n\t\tSkipWhiteSpace;\n\t\tif NEG then Result:=-Result;\n\t\tend;\t{ Factor }\n\n\n\n\t\tfunction Term: double;\n\t\t{ Returns Factor * Factor, Etc. }\n\t\tvar R: double;\n\t\tbegin\n\t\tResult:= Factor;\n\t\twhile True do\n\t\t\tcase Atom of\n\t\t\t  '*':\tbegin\n\t\t\t  \tSkipSpaces;\n\t\t\t  \tResult:= Result * Factor;\n\t\t\t  \tend;\n\t\t\t  '/':\tbegin\n\t\t\t  \tSkipSpaces;\n\t\t\t  \tR:=Factor;\n\t\t\t  \tif R=0 then HandleError('Divide By Zero');\n\t\t\t  \tResult:= Result / R;\n\t\t\t  \tend;\n\t\t\t  else\tbreak;\n\t\t\tend;\n\t\tend;\n\t\t{ Term }\n\n\n\n\t\tfunction AlgebraicExpression: double;\n\t\t{ Returns Term + Term, Etc. }\n\t\tbegin\n\t\tResult:= Term;\n\t\twhile True do\n\t\t\tcase Atom of\n\t\t\t  '+':\tbegin SkipSpaces; Result:= Result + Term; end;\n\t\t\t  '-':\tbegin SkipSpaces; Result:= Result - Term; end\n\t\t\telse\tbreak;\n\t\t\tend;\n\t\tend; { Algexp }\n\n\n\n\tbegin\t{ Expression }\n\tSkipWhiteSpace;\n\tResult:= AlgebraicExpression;\n\tend;\t{ Expression }\n\n\n\nbegin\t{ EvaluateExpression }\nErrorFlag:=False;\nErrorStr:='';\nExpressStr:=Express;\nExpressInx:=1;\ntry\nGetChar;\nResult:= Expression;\nexcept end;\nend;\n\n\nfunction WaitForString(Memo: TMemo; Prompt: string): string;\n{Wait for key stroke on TMemo component}\nvar MW: TMemoWaiter;\nvar C: char;\nvar Y: integer;\nbegin\n{Use custom object to wait and capture key strokes}\nMW:=TMemoWaiter.Create(Memo);\ntry\nMemo.Lines.Add(Prompt);\nMemo.SelStart:=Memo.SelStart-1;\nMemo.SetFocus;\nResult:=MW.WaitForLine;\nfinally MW.Free; end;\nend;\n\n\n\n\n\nprocedure Play24Game(Memo: TMemo);\n{Play the 24 game}\nvar R: double;\nvar Nums: array [0..4-1] of char;\nvar I: integer;\nvar Express,RS: string;\nvar RB: boolean;\n\n\tprocedure GenerateNumbers;\n\t{Generate and display four random number 1..9}\n\tvar S: string;\n\tvar I: integer;\n\tbegin\n\t{Generate random numbers}\n\tfor I:=0 to High(Nums) do\n\t Nums[I]:=char(Random(9)+$31);\n\t{Display them}\n\tS:='';\n\tfor I:=0 to High(Nums) do\n\t S:=S+' '+Nums[I];\n\tMemo.Lines.Add('Your Digits: '+S);\n\tend;\n\n\tfunction TestMatchingNums: boolean;\n\t{Make sure numbers entered by user match the target numbers}\n\tvar SL1,SL2: TStringList;\n\tvar I: integer;\n\tbegin\n\tResult:=False;\n\tSL1:=TStringList.Create;\n\tSL2:=TStringList.Create;\n\ttry\n\t{Load target numbers into string list}\n\tfor I:=0 to High(Nums) do SL1.Add(Nums[I]);\n\t{Load users expression number int string list}\n\tfor I:=1 to Length(Express) do\n\t if Express[I] in ['0'..'9'] then SL2.Add(Express[I]);\n\t{There should be the same number }\n\tif SL1.Count<>SL2.Count then exit;\n\t{Sort them to facilitate testing}\n\tSL1.Sort; SL2.Sort;\n\t{Are number identical, if not exit}\n\tfor I:=0 to SL1.Count-1 do\n\t if SL1[I]<>SL2[I] then exit;\n\t{Users numbers passed all tests}\n\tResult:=True;\n\tfinally\n\t SL2.Free;\n\t SL1.Free;\n\t end;\n\tend;\n\n\tfunction TestUserExpression(var S: string): boolean;\n\t{Test expression user entered }\n\tbegin\n\tResult:=False;\n\tif not TestMatchingNums then\n\t\tbegin\n\t\tS:='Numbers Do not Match';\n\t\texit;\n\t\tend;\n\n\tR:=EvaluateExpression(Express);\n\tS:='Expression Value = '+FloatToStrF(R,ffFixed,18,0)+CRLF;\n\tif ErrorFlag then\n\t\tbegin\n\t\tS:=S+'Expression Problem: '+ErrorStr;\n\t\texit;\n\t\tend;\n\tif R<>24 then\n\t\tbegin\n\t\tS:=S+'Expression is incorrect value';\n\t\texit;\n\t\tend;\n\tS:=S+'!!!!!! Winner\u00a0!!!!!!!';\n\tResult:=True;\n\tend;\n\n\nbegin\nRandomize;\nMemo.Lines.Add('=========== 24 Game ===========');\nGenerateNumbers;\nwhile true do\n\tbegin\n\tif Application.Terminated then exit;\n\tExpress:=WaitForString(Memo,'Enter expression, Q = quit, N = New numbers: '+CRLF);\n\tif Pos('N',UpperCase(Express))>0 then\n\t\tbegin\n\t\tGenerateNumbers;\n\t\tContinue;\n\t\tend;\n\tif Pos('Q',UpperCase(Express))>0 then exit;\n\tRB:=TestUserExpression(RS);\n\tMemo.Lines.Add(RS);\n\tif not RB then continue;\n\tRS:=WaitForString(Memo,'Play again Y=Yes, N=No'+CRLF);\n\tif Pos('N',UpperCase(RS))>0 then exit;\n\tGenerateNumbers;\n\tend;\nend;\n",
        "safe": true
    },
    {
        "filename": "24_game_4.txt",
        "content": "with Ada.Float_Text_IO;\nwith Ada.Text_IO;\nwith Ada.Numerics.Discrete_Random;\nprocedure Game_24 is\n   subtype Digit is Character range '1' .. '9';\n   package Random_Digit is new Ada.Numerics.Discrete_Random (Digit);\n   Exp_Error : exception;\n   Digit_Generator : Random_Digit.Generator;\n   Given_Digits : array (1 .. 4) of Digit;\n   Float_Value : constant array (Digit) of Float :=\n      (1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0);\n   function Apply_Op (L, R : Float; Op : Character) return Float is\n   begin\n      case Op is\n         when '+' =>\n            return L + R;\n         when '-' =>\n            return L - R;\n         when '*' =>\n            return L * R;\n         when '/' =>\n            return L / R;\n         when others =>\n            Ada.Text_IO.Put_Line (\"Unexpected operator: \" & Op);\n            raise Exp_Error;\n      end case;\n   end Apply_Op;\n   function Eval_Exp (E : String) return Float is\n      Flt : Float;\n      First : Positive := E'First;\n      Last : Positive;\n      function Match_Paren (Start : Positive) return Positive is\n         Pos : Positive := Start + 1;\n         Level : Natural := 1;\n      begin\n         loop\n            if Pos > E'Last then\n               Ada.Text_IO.Put_Line (\"Unclosed parentheses.\");\n               raise Exp_Error;\n            elsif E (Pos) = '(' then\n               Level := Level + 1;\n            elsif E (Pos) = ')' then\n               Level := Level - 1;\n               exit when Level = 0;\n            end if;\n            Pos := Pos + 1;\n         end loop;\n         return Pos;\n      end Match_Paren;\n   begin\n      if E (First) = '(' then\n         Last := Match_Paren (First);\n         Flt := Eval_Exp (E (First + 1 .. Last - 1));\n      elsif E (First) in Digit then\n         Last := First;\n         Flt := Float_Value (E (First));\n      else\n         Ada.Text_IO.Put_Line (\"Unexpected character: \" & E (First));\n         raise Exp_Error;\n      end if;\n      loop\n         if Last = E'Last then\n            return Flt;\n         elsif Last = E'Last - 1 then\n            Ada.Text_IO.Put_Line (\"Unexpected end of expression.\");\n            raise Exp_Error;\n         end if;\n         First := Last + 2;\n         if E (First) = '(' then\n            Last := Match_Paren (First);\n            Flt := Apply_Op (Flt, Eval_Exp (E (First + 1 .. Last - 1)),\n                             Op => E (First - 1));\n         elsif E (First) in Digit then\n            Last := First;\n            Flt := Apply_Op (Flt, Float_Value (E (First)),\n                             Op => E (First - 1));\n         else\n            Ada.Text_IO.Put_Line (\"Unexpected character: \" & E (First));\n            raise Exp_Error;\n         end if;\n      end loop;\n   end Eval_Exp;\nbegin\n   Ada.Text_IO.Put_Line (\"24 Game\");\n   Ada.Text_IO.Put_Line (\"- Enter Q to Quit\");\n   Ada.Text_IO.Put_Line (\"- Enter N for New digits\");\n   Ada.Text_IO.Put_Line (\"Note: Operators are evaluated left-to-right\");\n   Ada.Text_IO.Put_Line (\"      (use parentheses to override)\");\n   Random_Digit.Reset (Digit_Generator);\n   <<GEN_DIGITS>>\n   Ada.Text_IO.Put_Line (\"Generating 4 digits...\");\n   for I in Given_Digits'Range loop\n      Given_Digits (I) := Random_Digit.Random (Digit_Generator);\n   end loop;\n   <<GET_EXP>>\n   Ada.Text_IO.Put (\"Your Digits:\");\n   for I in Given_Digits'Range loop\n      Ada.Text_IO.Put (\" \" & Given_Digits (I));\n   end loop;\n   Ada.Text_IO.New_Line;\n   Ada.Text_IO.Put (\"Enter your Expression: \");\n   declare\n      Value : Float;\n      Response : constant String := Ada.Text_IO.Get_Line;\n      Prev_Ch : Character := ' ';\n      Unused_Digits : array (Given_Digits'Range) of Boolean :=\n        (others => True);\n   begin\n      if Response = \"n\" or Response = \"N\" then\n         goto GEN_DIGITS;\n      end if;\n      if Response = \"q\" or Response = \"Q\" then\n         return;\n      end if;\n      -- check input\n      for I in Response'Range loop\n         declare\n            Ch : constant Character := Response (I);\n            Found : Boolean;\n         begin\n            if Ch in Digit then\n               if Prev_Ch in Digit then\n                  Ada.Text_IO.Put_Line (\"Illegal multi-digit number used.\");\n                  goto GET_EXP;\n               end if;\n               Found := False;\n               for J in Given_Digits'Range loop\n                  if Unused_Digits (J) and then\n                        Given_Digits (J) = Ch then\n                     Unused_Digits (J) := False;\n                     Found := True;\n                     exit;\n                  end if;\n               end loop;\n               if not Found then\n                  Ada.Text_IO.Put_Line (\"Illegal number used: \" & Ch);\n                  goto GET_EXP;\n               end if;\n            elsif Ch /= '(' and Ch /= ')' and Ch /= '+' and\n                  Ch /= '-' and Ch /= '*' and Ch /= '/' then\n               Ada.Text_IO.Put_Line (\"Illegal character used: \" & Ch);\n               goto GET_EXP;\n            end if;\n            Prev_Ch := Ch;\n         end;\n      end loop;\n      -- check all digits used\n      for I in Given_Digits'Range loop\n         if Unused_Digits (I) then\n            Ada.Text_IO.Put_Line (\"Digit not used: \" & Given_Digits (I));\n            goto GET_EXP;\n         end if;\n      end loop;\n      -- check value\n      begin\n         Value := Eval_Exp (Response);\n      exception\n         when Exp_Error =>\n            goto GET_EXP; -- Message displayed by Eval_Exp;\n      end;\n      if abs (Value - 24.0) > 0.001 then\n         Ada.Text_IO.Put (\"Value \");\n         Ada.Float_Text_IO.Put (Value, Fore => 0, Aft => 3, Exp => 0);\n         Ada.Text_IO.Put_Line (\" is not 24!\");\n         goto GET_EXP;\n      else\n         Ada.Text_IO.Put_Line (\"You won!\");\n         Ada.Text_IO.Put_Line (\"Enter N for a new game, or try another solution.\");\n         goto GET_EXP;\n      end if;\n   end;\nend Game_24;\n",
        "safe": true
    },
    {
        "filename": "24_game_40.txt",
        "content": "=========== 24 Game ===========\nYour Digits:  8 2 5 5\nEnter expression, Q = quit, N = New numbers: \n\nn\n\nYour Digits:  3 1 9 3\nEnter expression, Q = quit, N = New numbers: \n\n3 * 9 -3\n\nNumbers Do not Match\nEnter expression, Q = quit, N = New numbers: \n\n3 * 9 - 3 * 1\n\nExpression Value = 24\n!!!!!! Winner\u00a0!!!!!!!\nPlay again Y=Yes, N=No\n\n\n",
        "safe": true
    },
    {
        "filename": "24_game_41.txt",
        "content": "print \"Enter an equation in RPN form using all of, and only \"\nprint \"the following single digits which evaluates to 24:\"\nfunc game .\n   len cnt[] 9\n   write \">> \"\n   for i to 4\n      h = random 9\n      write h & \" \"\n      cnt[h] += 1\n   .\n   print \"\"\n   s$ = input\n   print s$\n   if s$ = \"\"\n      return 1\n   .\n   for c$ in strchars s$\n      if c$ = \"+\" or c$ = \"-\" or c$ = \"*\" or c$ = \"/\"\n         if len st[] < 2\n            print \"Stack empty\"\n            return 1\n         .\n         if c$ = \"+\"\n            st[$ - 1] = st[$ - 1] + st[$]\n         elif c$ = \"-\"\n            st[$ - 1] = st[$ - 1] - st[$]\n         elif c$ = \"*\"\n            st[$ - 1] = st[$ - 1] * st[$]\n         else\n            st[$ - 1] = st[$ - 1] / st[$]\n         .\n         len st[] -1\n      elif c$ <> \" \"\n         h = strcode c$ - 48\n         if h < 1 or h > 9\n            print \"Wrong command \" & c$\n            return 0\n         .\n         if cnt[h] = 0\n            print \"Wrong number \" & h\n            return 0\n         .\n         cnt[h] -= 1\n         st[] &= h\n      .\n   .\n   for c in cnt[]\n      s += c\n   .\n   if s > 0\n      print \"Not all numbers used\"\n      return 0\n   .\n   if len st[] > 1\n      print \"Calculation not finished\"\n      return 0\n   .\n   print st[1]\n   if abs (st[1] - 24) < 1e-10\n      print \"Well done\"\n   else\n      print \"Wrong result\"\n   .\n.\nrepeat\n   print \"\"\n   until game = 1\n.\n",
        "safe": true
    },
    {
        "filename": "24_game_42.txt",
        "content": "Enter an equation in RPN form using all of, and only \nthe following single digits which evaluates to 24:\n\n>> 5 1 8 4 \n8 4 - 5 1 + *\n24\nWell done\n",
        "safe": true
    },
    {
        "filename": "24_game_43.txt",
        "content": "(string-delimiter \"\")\n;; check that nums are in expr, and only once\n(define (is-valid? expr sorted: nums)\n    (when (equal? 'q expr) (error \"24-game\" \"Thx for playing\"))\n    (unless (and \n        (list? expr) \n        (equal? nums (list-sort < (filter number? (flatten expr)))))\n    (writeln \"\ud83c\udf83 Please use\" nums)\n    #f))\n    \n;; 4 random  digits\n(define (gen24)\n     (->> (append (range 1 10)(range 1 10)) shuffle (take 4) (list-sort < )))\n    \n(define (is-24? num)\n    (unless (= 24 num)\n    (writeln \"\ud83d\ude27 Sorry - Result = \" num)\n    #f))\n\n(define (check-24 expr)\n    (if (and \n        (is-valid? expr nums) \n        (is-24?  (js-eval (string expr)))) ;; use js evaluator\n        \"\ud83c\udf40 \ud83c\udf38 Congrats - (play24) for another one.\"\n        (input-expr check-24 (string nums))))\n        \n(define nums null)\n(define (play24)\n    (set! nums (gen24))\n    (writeln \"24-game - Can you combine\" nums \"to get 24 \u2753 (q to exit)\")\n    (input-expr check-24 (string-append  (string nums) \" -> 24 \u2753\")))\n",
        "safe": true
    },
    {
        "filename": "24_game_44.txt",
        "content": "24-game - Can you combine     (2 5 6 7)     to get 24 \u2753 (q to exit) \ndifficult game\n\ud83c\udf83 Please use     (2 5 6 7)    \n12 * 2\n\ud83c\udf83 Please use     (2 5 6 7)    \n6 * (7 - 5 + 2)\n\ud83c\udf40 \ud83c\udf38 Congrats - (play24) for another one.\n    \n(play24)\n24-game - Can you combine     (3 5 8 9)     to get 24 \u2753 (q to exit)    \n3 + 5 + 8 * 9\n\ud83d\ude27 Sorry - Result =      80    \n9 * 3 - (8 - 5)\n\ud83c\udf40 \ud83c\udf38 Congrats - (play24) for another one.\n    \n(play24)\n24-game - Can you combine     (1 8 8 9)     to get 24 \u2753 (q to exit)    \n9 + 8 + 8 - 1\n\ud83c\udf40 \ud83c\udf38 Congrats - (play24) for another one.\n",
        "safe": true
    },
    {
        "filename": "24_game_45.txt",
        "content": "import system'routines;\nimport system'collections;\nimport system'dynamic;\nimport extensions;\n\n// --- Expression ---\n\nclass ExpressionTree\n{\n    object _tree;\n    \n    constructor(s)\n    {\n        auto level\u00a0:= new Integer(0);\n        \n        s.forEach::(ch)\n        {\n            var node\u00a0:= new DynamicStruct();\n            \n            ch =>\n                $43 { node.Level\u00a0:= level + 1; node.Operation\u00a0:= mssg add }        // +\n                $45 { node.Level\u00a0:= level + 1; node.Operation\u00a0:= mssg subtract }   // -\n                $42 { node.Level\u00a0:= level + 2; node.Operation\u00a0:= mssg multiply }   // *\n                $47 { node.Level\u00a0:= level + 2; node.Operation\u00a0:= mssg divide }     // /\n                $40 { level.append(10); ^ self }                               // (\n                $41 { level.reduce(10); ^ self }                               // )\n               \u00a0! {\n                    node.Leaf\u00a0:= ch.toString().toReal();\n                    node.Level\u00a0:= level + 3\n                };\n                    \n            if (nil == _tree)\n            { \n                _tree\u00a0:= node \n            }\n            else\n            {\n                if (_tree.Level >= node.Level)\n                {\n                    node.Left\u00a0:= _tree;\n                    node.Right\u00a0:= nil;\n                    \n                    _tree\u00a0:= node\n                }\n                else\n                {\n                    var top\u00a0:= _tree;\n                    while ((nil\u00a0!= top.Right)&&(top.Right.Level < node.Level))\n                       { top\u00a0:= top.Right };\n                                 \n                    node.Left\u00a0:= top.Right;\n                    node.Right\u00a0:= nil;\n                                 \n                    top.Right\u00a0:= node\n                }\n            }\n        }\n    }\n    \n    eval(node)\n    {\n        if (node.containsProperty(mssg Leaf))\n        { \n            ^ node.Leaf \n        }\n        else\n        {\n            var left\u00a0:= self.eval(node.Left);\n            var right\u00a0:= self.eval(node.Right);\n            \n            var op\u00a0:= node.Operation;\n            \n            ^ op(left, right);\n        }\n    }\n    \n    get Value()\n        <= eval(_tree);\n        \n    readLeaves(list, node)\n    {\n        if (nil == node)\n            { InvalidArgumentException.raise() };\n        \n        if (node.containsProperty(mssg Leaf))\n        { \n            list.append(node.Leaf) \n        }\n        else\n        {\n            self.readLeaves(list, node.Left);\n            self.readLeaves(list, node.Right)\n        }\n    }        \n    \n    readLeaves(list)\n        <= readLeaves(list,_tree);\n}\n\n// --- Game ---\n\nclass TwentyFourGame\n{\n    object theNumbers;\n    \n    constructor()\n    {\n        self.newPuzzle();\n    }\n    \n    newPuzzle()\n    {\n        theNumbers\u00a0:= new object[]\n        {\n            1 + randomGenerator.nextInt(9), \n            1 + randomGenerator.nextInt(9), \n            1 + randomGenerator.nextInt(9), \n            1 + randomGenerator.nextInt(9)\n        }\n    }\n    \n    help()\n    {\n        console \n            .printLine(\"------------------------------- Instructions ------------------------------\")\n            .printLine(\"Four digits will be displayed.\")\n            .printLine(\"Enter an equation using all of those four digits that evaluates to 24\")\n            .printLine(\"Only * / + - operators and () are allowed\")\n            .printLine(\"Digits can only be used once, but in any order you need.\")\n            .printLine(\"Digits cannot be combined - i.e.: 12 + 12 when given 1,2,2,1 is not allowed\")\n            .printLine(\"Submit a blank line to skip the current puzzle.\")\n            .printLine(\"Type 'q' to quit\")\n            .writeLine()\n            .printLine(\"Example: given 2 3 8 2, answer should resemble 8*3-(2-2)\")\n            .printLine(\"------------------------------- --------------------------------------------\")\n    }\n    \n    prompt()\n    {\n        theNumbers.forEach::(n){ console.print(n,\" \") };\n        \n        console.print(\": \")\n    }\n    \n    resolve(expr)\n    {\n        var tree\u00a0:= new ExpressionTree(expr);\n        \n        var leaves\u00a0:= new ArrayList();\n        tree.readLeaves(leaves);\n        \n        ifnot (leaves.ascendant().sequenceEqual(theNumbers.ascendant()))\n            { console.printLine(\"Invalid input. Enter an equation using all of those four digits. Try again.\"); ^ self };\n            \n        var result\u00a0:= tree.Value;\n        if (result == 24)\n        {\n            console.printLine(\"Good work. \",expr,\"=\",result);\n            \n            self.newPuzzle()\n        }\n        else\n        {\n            console.printLine(\"Incorrect. \",expr,\"=\",result)\n        }\n    }    \n}\n\nextension gameOp\n{\n    playRound(expr)\n    {\n        if (expr == \"q\")\n        {\n            ^ false\n        }\n        else\n        {\n            if (expr == \"\")\n            {\n                console.printLine(\"Skipping this puzzle\"); self.newPuzzle()\n            }\n            else\n            {\n                try\n                {\n                    self.resolve(expr)\n                }\n                catch(Exception e)\n                {\n                    console.printLine(e)\n                    //console.printLine:\"An error occurred.  Check your input and try again.\"\n                }\n            };\n                \n            ^ true\n        }\n    }\n}\n\n// --- program ---\n\npublic program()\n{\n    var game\u00a0:= new TwentyFourGame().help();\n\n    while (game.prompt().playRound(console.readLine())) {}\n}",
        "safe": true
    },
    {
        "filename": "24_game_46.txt",
        "content": "------------------------------- Instructions ------------------------------\nFour digits will be displayed.\nEnter an equation using all of those four digits that evaluates to 24\nOnly * / + - operators and () are allowed\nDigits can only be used once, but in any order you need.\nDigits cannot be combined - i.e.: 12 + 12 when given 1,2,2,1 is not allowed\nSubmit a blank line to skip the current puzzle.\nType 'q' to quit\n\nExample: given 2 3 8 2, answer should resemble 8*3-(2-2)\n------------------------------- --------------------------------------------\n7 6 9 6\u00a0:\nSkipping this puzzle\n8 6 2 6\u00a0: 6*6-8-2\nIncorrect. 6*6-8-2=26.0\n8 6 2 6\u00a0:\nSkipping this puzzle\n5 2 7 7\u00a0: 7+7+(5*2)\nGood work. 7+7+(5*2)=24.0\n",
        "safe": true
    },
    {
        "filename": "24_game_47.txt",
        "content": "defmodule Game24 do\n  def main do\n    IO.puts \"24 Game\"\n    play\n  end\n  \n  defp play do\n    IO.puts \"Generating 4 digits...\"\n    digts = for _ <- 1..4, do: Enum.random(1..9)\n    IO.puts \"Your digits\\t#{inspect digts, char_lists: :as_lists}\"\n    read_eval(digts)\n    play\n  end\n  \n  defp read_eval(digits) do\n    exp = IO.gets(\"Your expression: \") |> String.strip\n    if exp in [\"\",\"q\"], do: exit(:normal)        # give up\n    case {correct_nums(exp, digits), eval(exp)} do\n      {:ok, x} when x==24 -> IO.puts \"You Win!\"\n      {:ok, x} -> IO.puts \"You Lose with #{inspect x}!\"\n      {err, _} -> IO.puts \"The following numbers are wrong: #{inspect err, char_lists: :as_lists}\"\n    end\n  end\n  \n  defp correct_nums(exp, digits) do\n    nums = String.replace(exp, ~r/\\D/, \" \") |> String.split |> Enum.map(&String.to_integer &1)\n    if length(nums)==4 and (nums--digits)==[], do: :ok, else: nums\n  end\n  \n  defp eval(exp) do\n    try do\n      Code.eval_string(exp) |> elem(0)\n    rescue\n      e -> Exception.message(e)\n    end\n  end\nend\n\nGame24.main\n",
        "safe": true
    },
    {
        "filename": "24_game_48.txt",
        "content": "24 Game\nGenerating 4 digits...\nYour digits     [9, 6, 7, 4]\nYour expression: (9+7)*6/4\nYou Win!\nGenerating 4 digits...\nYour digits     [3, 2, 2, 4]\nYour expression: 3*(2+2+4)\nYou Win!",
        "safe": true
    },
    {
        "filename": "24_game_49.txt",
        "content": "-module(g24).\n-export([main/0]).\n\nmain() ->\n    random:seed(now()),\n    io:format(\"24 Game~n\"),\n    play().\n\nplay() ->\n    io:format(\"Generating 4 digits...~n\"),\n    Digts = [random:uniform(X) || X <- [9,9,9,9]],\n    io:format(\"Your digits\\t~w~n\", [Digts]),\n    read_eval(Digts),\n    play().\n\nread_eval(Digits) ->\n    Exp = string:strip(io:get_line(standard_io, \"Your expression: \"), both, $\\n),\n    case {correct_nums(Exp, Digits), eval(Exp)} of\n        {ok, X} when X == 24 -> io:format(\"You Win!~n\");\n        {ok, X} -> io:format(\"You Lose with ~p!~n\",[X]);\n        {List, _} -> io:format(\"The following numbers are wrong: ~p~n\", [List])\n    end.\n\ncorrect_nums(Exp, Digits) ->\n    case re:run(Exp, \"([0-9]+)\", [global, {capture, all_but_first, list}]) of\n        nomatch ->\n            \"No number entered\";\n        {match, IntLs} ->\n            case [X || [X] <- IntLs, not lists:member(list_to_integer(X), Digits)] of\n                [] -> ok;\n                L -> L\n            end\n    end.\n\neval(Exp) ->\n    {X, _} = eval(re:replace(Exp, \"\\\\s\", \"\", [{return, list},global]),\n                  0),\n    X.\n\neval([], Val) ->\n    {Val,[]};\neval([$(|Rest], Val) ->\n    {NewVal, Exp} = eval(Rest, Val),\n    eval(Exp, NewVal);\neval([$)|Rest], Val) ->\n    {Val, Rest};\neval([$[|Rest], Val) ->\n    {NewVal, Exp} = eval(Rest, Val),\n    eval(Exp, NewVal);\neval([$]|Rest], Val) ->\n    {Val, Rest};\neval([$+|Rest], Val) ->\n    {NewOperand, Exp} = eval(Rest, 0),\n    eval(Exp, Val + NewOperand);\neval([$-|Rest], Val) ->\n    {NewOperand, Exp} = eval(Rest, 0),\n    eval(Exp, Val - NewOperand);\neval([$*|Rest], Val) ->\n    {NewOperand, Exp} = eval(Rest, 0),\n    eval(Exp, Val * NewOperand);\neval([$/|Rest], Val) ->\n    {NewOperand, Exp} = eval(Rest, 0),\n    eval(Exp, Val / NewOperand);\neval([X|Rest], 0) when X >= $1, X =< $9 ->\n    eval(Rest, X-$0).\n",
        "safe": true
    },
    {
        "filename": "24_game_5.txt",
        "content": "24 Game\n- Enter Q to Quit\n- Enter N for New digits\nNote: Operators are evaluated left-to-right\n      (use parentheses to override)\nGenerating 4 digits...\nYour Digits: 2 9 5 9\nEnter your Expression: 9+9+5-2\nValue 21.000 is not 24!\nYour Digits: 2 9 5 9\nEnter your Expression: N\nGenerating 4 digits...\nYour Digits: 7 7 1 3\nEnter your Expression: (7-1)*(7-3)\nYou won!\nEnter N for a new game, or try another solution.",
        "safe": true
    },
    {
        "filename": "24_game_50.txt",
        "content": "9 + 1 = 10\n10 * 2 = 20\n2 + 2 = 4\n20 + 4\n",
        "safe": true
    },
    {
        "filename": "24_game_51.txt",
        "content": "1> c(g24).    \n{ok,g24}\n2> g24:main().\n24 Game\nGenerating 4 digits...\nYour digits     [7,4,6,8]\nYour expression: 6*4\nYou Win!\nGenerating 4 digits...\nYour digits     [4,1,5,8]\nYour expression: 6*4\nThe following numbers are wrong: [\"6\"]\nGenerating 4 digits...\nYour digits     [8,5,8,2]\nYour expression: 2*([8/5]*2)\nYou Lose with 6.4!\nGenerating 4 digits...\nYour digits     [7,4,8,1]",
        "safe": true
    },
    {
        "filename": "24_game_52.txt",
        "content": "open System\nopen System.Text.RegularExpressions\n\n// Some utilities\nlet (|Parse|_|) regex str =\n   let m = Regex(regex).Match(str)\n   if m.Success then Some ([for g in m.Groups -> g.Value]) else None\nlet rec gcd x y = if x = y || x = 0 then y else if x < y then gcd y x else gcd y (x-y)\nlet abs (x : int) = Math.Abs x\nlet sign (x: int) = Math.Sign x\nlet cint s = Int32.Parse(s)\nlet replace m (s : string) t = Regex.Replace(t, m, s)\n\n// computing in Rationals\ntype Rat(x : int, y : int) =\n    let g = if y <> 0 then gcd (abs x) (abs y) else raise <| DivideByZeroException()\n    member this.n = sign y * x / g   // store a minus sign in the numerator\n    member this.d =\n        if y <> 0 then sign y * y / g else raise <| DivideByZeroException()\n    static member (~-) (x : Rat) = Rat(-x.n, x.d)\n    static member (+) (x : Rat, y : Rat) = Rat(x.n * y.d + y.n * x.d, x.d * y.d)\n    static member (-) (x : Rat, y : Rat) = x + Rat(-y.n, y.d)\n    static member (*) (x : Rat, y : Rat) = Rat(x.n * y.n, x.d * y.d)\n    static member (/) (x : Rat, y : Rat) = x * Rat(y.d, y.n)\n    override this.ToString() = sprintf @\"<%d,%d>\" this.n this.d\n    new(x : string, y : string) = if y = \"\" then Rat(cint x, 1) else Rat(cint x, cint y)\n\n// Due to the constraints imposed by the game (reduced set\n// of operators, all left associativ) we can get away with a repeated reduction\n// to evaluate the algebraic expression.\nlet rec reduce (str :string) =\n    let eval (x : Rat) (y : Rat) = function\n    | \"*\" -> x * y | \"/\" -> x / y | \"+\" -> x + y | \"-\" -> x - y | _ -> failwith \"unknown op\"\n    let subst s r = str.Replace(s, r.ToString())\n    let rstr =\n        match str with\n        | Parse @\"\\(<(-?\\d+),(\\d+)>([*/+-])<(-?\\d+),(\\d+)>\\)\" [matched; xn; xd; op; yn; yd] -> \n            subst matched <| eval (Rat(xn,xd)) (Rat(yn,yd)) op\n        | Parse @\"<(-?\\d+),(\\d+)>([*/])<(-?\\d+),(\\d+)>\" [matched; xn; xd; op; yn; yd] -> \n            subst matched <| eval (Rat(xn,xd)) (Rat(yn,yd)) op\n        | Parse @\"<(-?\\d+),(\\d+)>([+-])<(-?\\d+),(\\d+)>\" [matched; xn; xd; op; yn; yd] -> \n            subst matched <| eval (Rat(xn,xd)) (Rat(yn,yd)) op\n        | Parse @\"\\(<(-?\\d+),(\\d+)>\\)\" [matched; xn; xd] -> \n            subst matched <| Rat(xn,xd)\n        | Parse @\"(?<!>)-<(-?\\d+),(\\d+)>\" [matched; xn; xd] -> \n            subst matched <| -Rat(xn,xd)\n        | _ -> str\n    if str = rstr then str else reduce rstr\n\nlet gameLoop() =\n    let checkInput dddd input =\n        match input with\n        | \"n\" | \"q\" -> Some(input)\n        | Parse @\"[^1-9()*/+-]\" [c] ->\n            printfn \"You used an illegal character in your expression: %s\" c\n            None\n        | Parse @\"^\\D*(\\d)\\D+(\\d)\\D+(\\d)\\D+(\\d)(?:\\D*(\\d))*\\D*$\" [m; d1; d2; d3; d4; d5] ->\n            if d5 = \"\" && (String.Join(\" \", Array.sort [|d1;d2;d3;d4|])) = dddd then Some(input)\n            elif d5 = \"\" then\n                printfn \"Use this 4 digits with operators in between: %s.\" dddd\n                None\n            else \n                printfn \"Use only this 4 digits with operators in between: %s.\" dddd\n                None\n        | _ ->\n            printfn \"Use all 4 digits with operators in between: %s.\" dddd\n            None\n        \n    let rec userLoop dddd  =\n        let tryAgain msg =\n            printfn \"%s\" msg\n            userLoop dddd\n        printf \"[Expr|n|q]: \"\n        match Console.ReadLine() |> replace @\"\\s\" \"\" |> checkInput dddd with\n        | Some(input) -> \n            let data = input |> replace @\"((?<!\\d)-)?\\d+\" @\"<$&,1>\"\n            match data with\n            | \"n\" -> true | \"q\" -> false\n            | _ ->\n                try\n                    match reduce data with\n                    | Parse @\"^<(-?\\d+),(\\d+)>$\" [_; x; y] ->\n                        let n, d = (cint x), (cint y)\n                        if n = 24 then\n                            printfn \"Correct!\"\n                            true\n                        elif d=1 then tryAgain <| sprintf \"Wrong! Value = %d.\" n\n                        else tryAgain <| sprintf \"Wrong! Value = %d/%d.\" n d\n                    | _ -> tryAgain \"Wrong! not a well-formed expression!\"\n                with\n                    | :? System.DivideByZeroException ->\n                        tryAgain \"Wrong! Your expression results in a division by zero!\"\n                    | ex ->\n                        tryAgain <| sprintf \"There is an unforeseen problem with yout input: %s\" ex.Message\n        | None -> userLoop dddd\n\n    let random = new Random(DateTime.Now.Millisecond)\n    let rec loop() =\n        let dddd = String.Join(\" \", Array.init 4 (fun _ -> 1 + random.Next 9) |> Array.sort)\n        printfn \"\\nCompute 24 from the following 4 numbers: %s\" dddd\n        printfn \"Use them in any order with * / + - and parentheses; n = new numbers; q = quit\"\n        if userLoop dddd then loop()\n\n    loop()\n\ngameLoop()\n",
        "safe": true
    },
    {
        "filename": "24_game_53.txt",
        "content": "Compute 24 from the following 4 numbers: 3 3 3 5\nUse them in any order with * / + - and parentheses; n = new numbers; q = quit\n[Expr|n|q]: n\n\nCompute 24 from the following 4 numbers: 3 5 6 7\nUse them in any order with * / + - and parentheses; n = new numbers; q = quit\n[Expr|n|q]: (7 + 5) + 6/3\nWrong! Value = 14.\n[Expr|n|q]: (7 + 5) * 6/3\nCorrect!\n\nCompute 24 from the following 4 numbers: 3 3 4 5\nUse them in any order with * / + - and parentheses; n = new numbers; q = quit\n[Expr|n|q]: q\n",
        "safe": true
    },
    {
        "filename": "24_game_54.txt",
        "content": "USING:\n    combinators.short-circuit\n    continuations\n    eval\n    formatting\n    fry\n    kernel\n    io\n    math math.ranges\n    prettyprint\n    random\n    sequences\n    sets ;\nIN: 24game\n\n: choose4 ( -- seq )\n    4 [ 9 [1,b] random ] replicate ;\n\n: step ( numbers -- ? )\n    readln\n    [\n        parse-string\n        {\n            ! Is only allowed tokens used?\n            [ swap { + - / * } append subset? ]\n            ! Digit count in expression should be equal to the given numbers.\n            [ [ number? ] count swap length = ]\n            ! Of course it must evaluate to 24\n            [ nip call( -- x ) 24 = ]\n        } 2&&\n        [ f \"You got it!\" ]\n        [ t \"Expression isnt valid, or doesnt evaluate to 24.\" ]\n        if\n    ]\n    [ 3drop f \"Could not parse that.\" ]\n    recover print flush ;\n\n: main ( -- )\n    choose4\n    [ \"Your numbers are\u00a0%[%s,\u00a0%], make an expression\\n\" printf flush ]\n    [ '[ _ step ] loop ]\n    bi ;\n",
        "safe": true
    },
    {
        "filename": "24_game_55.txt",
        "content": "IN: scratchpad main\nYour numbers are { 4, 1, 8, 2 }, make an expression\n8 4 + 2 * 1 /\nYou got it!\n",
        "safe": true
    },
    {
        "filename": "24_game_56.txt",
        "content": "load compiler\n\nfunction genRandomNumbers( amount )\n  rtn = []\n  for i in [ 0\u00a0: amount ]: rtn += random( 1, 9 )\n  return( rtn )\nend\n\nfunction getAnswer( exp )\n  ic = ICompiler()\n  ic.compileAll(exp)\n\n  return( ic.result )\nend\n\nfunction validInput( str )\n  for i in [ 0\u00a0: str.len() ]\n    if str[i] notin ' ()[]0123456789-+/*'\n      > 'INVALID Character = ', str[i]\n      return( false )\n    end\n  end\n\n  return( true )\nend\n\nprintl('\nThe 24 Game\n\nGiven any four digits in the range 1 to 9, which may have repetitions,\nUsing just the +, -, *, and / operators; and the possible use of\nbrackets, (), show how to make an answer of 24.\n\nAn answer of \"q\" will quit the game.\nAn answer of \"!\" will generate a new set of four digits.\nOtherwise you are repeatedly asked for an expression until it evaluates to 24\n\nNote: you cannot form multiple digit numbers from the supplied digits,\nso an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\n')\n\nnum = genRandomNumbers( 4 )\n\nwhile( true )\n\n  >>  \"Here are the numbers to choose from: \"\n  map({ a => print(a, \" \") }, num)\n  >\n\n  exp = input()\n\n  switch exp\n    case \"q\", \"Q\"\n      exit()\n\n    case \"!\"\n      > 'Generating new numbers list'\n      num = genRandomNumbers( 4 )\n\n    default\n      if not validInput( exp ): continue\n\n      answer = getAnswer( exp )\n\n      if answer == 24\n        > \"By George you GOT IT! Your expression equals 24\"\n      else\n        > \"Ahh Sorry, So Sorry your answer of \", answer, \" does not equal 24.\"\n      end\n  end\nend",
        "safe": true
    },
    {
        "filename": "24_game_57.txt",
        "content": "program game_24\n  implicit none\n  real               :: vector(4), reals(11), result, a, b, c, d\n  integer            :: numbers(4), ascii(11), i\n  character(len=11)  :: expression\n  character          :: syntax(11)\n  ! patterns:\n  character, parameter :: one(11)   = (/ '(','(','1','x','1',')','x','1',')','x','1' /)\n  character, parameter :: two(11)   = (/ '(','1','x','(','1','x','1',')',')','x','1' /)\n  character, parameter :: three(11) = (/ '1','x','(','(','1','x','1',')','x','1',')' /)\n  character, parameter :: four(11)  = (/ '1','x','(','1','x','(','1','x','1',')',')' /)\n  character, parameter :: five(11)  = (/ '(','1','x','1',')','x','(','1','x','1',')' /)\n  \n  do\n    call random_number(vector)\n    numbers = 9 * vector + 1\n    write (*,*) 'Digits: ',numbers\n    write (*,'(a)',advance='no') 'Your expression: '\n    read (*,'(a11)') expression\n\n    forall (i=1:11) syntax(i) = expression(i:i)\n    ascii = iachar(syntax)\n    where (syntax >= '0' .and. syntax <= '9')\n      syntax = '1'  ! number\n    elsewhere (syntax == '+' .or. syntax == '-' .or. syntax == '*' .or. syntax == '/')\n      syntax = 'x'  ! op\n    elsewhere (syntax /= '(' .and. syntax /= ')')\n      syntax = '-'  ! error\n    end where\n\n    reals = real(ascii-48)\n    if ( all(syntax == one) ) then\n      a = reals(3); b = reals(5); c = reals(8); d = reals(11)\n      call check_numbers(a,b,c,d)\n      result = op(op(op(a,4,b),7,c),10,d)\n    else if ( all(syntax == two) ) then\n      a = reals(2); b = reals(5); c = reals(7); d = reals(11)\n      call check_numbers(a,b,c,d)\n      result = op(op(a,3,op(b,6,c)),10,d)\n    else if ( all(syntax == three) ) then\n      a = reals(1); b = reals(5); c = reals(7); d = reals(10)\n      call check_numbers(a,b,c,d)\n      result = op(a,2,op(op(b,6,c),9,d))\n    else if ( all(syntax == four) ) then\n      a = reals(1); b = reals(4); c = reals(7); d = reals(9)\n      call check_numbers(a,b,c,d)\n      result = op(a,2,op(b,5,op(c,8,d)))\n    else if ( all(syntax == five) ) then\n      a = reals(2); b = reals(4); c = reals(8); d = reals(10)\n      call check_numbers(a,b,c,d)\n      result = op(op(a,3,b),6,op(c,9,d))\n    else\n      stop 'Input string: incorrect syntax.'\n    end if\n\n    if ( abs(result-24.0) < epsilon(1.0) ) then\n      write (*,*) 'You won!'\n    else\n      write (*,*) 'Your result (',result,') is incorrect!'\n    end if\n  \n    write (*,'(a)',advance='no') 'Another one? [y/n] '\n    read (*,'(a1)') expression\n    if ( expression(1:1) == 'n' .or. expression(1:1) == 'N' ) then\n      stop\n    end if  \n  end do\n  \ncontains\n\n  pure real function op(x,c,y)\n    integer, intent(in) :: c\n    real, intent(in) :: x,y\n    select case ( char(ascii(c)) )\n      case ('+')\n        op = x+y\n      case ('-')\n        op = x-y\n      case ('*')\n        op = x*y\n      case ('/')\n        op = x/y\n    end select\n  end function op\n  \n  subroutine check_numbers(a,b,c,d)\n    real, intent(in) :: a,b,c,d\n    integer          :: test(4)\n    test = (/ nint(a),nint(b),nint(c),nint(d) /)\n    call Insertion_Sort(numbers)\n    call Insertion_Sort(test)\n    if ( any(test /= numbers) ) then\n      stop 'You cheat\u00a0;-) (Incorrect numbers)'\n    end if\n  end subroutine check_numbers\n  \n  pure subroutine Insertion_Sort(a)\n    integer, intent(inout) :: a(:)\n    integer                :: temp, i, j\n    do i=2,size(a)\n      j = i-1\n      temp = a(i)\n      do while ( j>=1 .and. a(j)>temp )\n        a(j+1) = a(j)\n        j = j - 1\n      end do\n      a(j+1) = temp\n    end do\n  end subroutine Insertion_Sort\n\nend program game_24\n",
        "safe": true
    },
    {
        "filename": "24_game_58.txt",
        "content": "! implement a recursive descent parser\nmodule evaluate_algebraic_expression\n\n  integer, parameter :: size = 124\n  character, parameter :: statement_end = achar(0)\n  character(len=size) :: text_to_parse\n  integer :: position\n  data position/0/,text_to_parse/' '/\n\ncontains\n\n  character function get_token()\n    ! return the current token\n    implicit none\n    if (position <= size) then\n       get_token = text_to_parse(position:position)\n       do while (get_token <= ' ')\n          call advance\n          if (size < position) exit\n          get_token = text_to_parse(position:position)\n       end do\n    end if\n    if (size < position) get_token = statement_end\n  end function get_token\n\n  subroutine advance ! consume a token.  Move to the next token.  consume_token would have been a better name.\n    position = position + 1    \n  end subroutine advance\n  \n  logical function unfinished()\n    unfinished = get_token() /= statement_end\n  end function unfinished\n\n  subroutine parse_error()\n    write(6,*)'\"'//get_token()//'\" unexpected in expression at',position\n    stop 1\n  end subroutine parse_error\n\n  function precedence3() result(a)\n    implicit none\n    real :: a\n    character :: token\n    character(len=10), parameter :: digits = '0123456789'\n    token = get_token()\n    if (verify(token,digits) /= 0) call parse_error()\n    a = index(digits, token) - 1\n    call advance()\n  end function precedence3\n\n  recursive function precedence2() result(a)\n    real :: a\n    character :: token\n    token = get_token()\n    if (token /= '(') then\n       a = precedence3()\n    else\n       call advance\n       a = precedence0()\n       token = get_token()\n       if (token /= ')') call parse_error()\n       call advance\n    end if\n  end function precedence2\n\n  recursive function precedence1() result(a)\n    implicit none\n    real :: a\n    real, dimension(2) :: argument\n    character(len=2), parameter :: tokens = '*/'\n    character :: token\n    a = 0\n    token = get_token()\n    argument(1) = precedence2()\n    token = get_token()\n    do while (verify(token,tokens) == 0)\n       call advance()\n       argument(2) = precedence2()\n       if (token == '/') argument(2) = 1 / argument(2)\n       argument(1) = product(argument)       \n       token = get_token()\n    end do\n    a = argument(1)\n  end function precedence1\n\n  recursive function precedence0() result(a)\n    implicit none\n    real :: a\n    real, dimension(2) :: argument\n    character(len=2), parameter :: tokens = '+-'\n    character :: token\n    a = 0\n    token = get_token()\n    argument(1) = precedence1()\n    token = get_token()\n    do while (verify(token,tokens) == 0)\n       call advance()\n       argument(2) = precedence1()\n       if (token == '-') argument = argument * (/1, -1/)\n       argument(1) = sum(argument)\n       token = get_token()\n    end do\n    a = argument(1)\n  end function precedence0\n\n  real function statement()\n    implicit none\n    if (unfinished()) then\n       statement = precedence0()\n    else                        !empty okay\n       statement = 0\n    end if\n    if (unfinished()) call parse_error()\n  end function statement\n\n  real function evaluate(expression)\n    implicit none\n    character(len=*), intent(in) :: expression\n    text_to_parse = expression\n    evaluate = statement()\n  end function evaluate\n  \nend module evaluate_algebraic_expression\n\n\nprogram g24\n  use evaluate_algebraic_expression\n  implicit none\n  integer, dimension(4) :: digits\n  character(len=78) :: expression\n  real :: result\n  ! integer\u00a0:: i\n  call random_seed!easily found internet examples exist to seed by /dev/urandom or time\n  call deal(digits)\n  ! do i=1, 9999\u00a0! produce the data to test digit distribution\n  !   call deal(digits)\n  !   write(6,*) digits\n  ! end do\n  write(6,'(a13,4i2,a26)')'Using digits',digits,', and the algebraic dyadic'\n  write(6,*)'operators +-*/() enter an expression computing 24.'\n  expression = ' '\n  read(5,'(a78)') expression\n  if (invalid_digits(expression, digits)) then\n     write(6,*)'invalid digits'\n  else\n     result = evaluate(expression)\n     if (nint(result) == 24) then\n        write(6,*) result, ' close enough'\n     else\n        write(6,*) result, ' no good'\n     end if\n  end if\n\ncontains\n\n  logical function invalid_digits(e,d) !verify the digits\n    implicit none\n    character(len=*), intent(in) :: e\n    integer, dimension(4), intent(inout) :: d\n    integer :: i, j, k, count\n    logical :: unfound\n    count = 0\n    invalid_digits = .false. !validity assumed\n    !write(6,*)'expression:',e(1:len_trim(e))\n    do i=1, len_trim(e)\n       if (verify(e(i:i),'0123456789') == 0) then\n          j = index('0123456789',e(i:i))-1\n          unfound = .true.\n          do k=1, 4\n             if (j == d(k)) then\n                unfound = .false.\n                exit\n             end if\n          end do\n          if (unfound) then\n             invalid_digits = .true.\n             !return or exit is okay here\n          else\n             d(k) = -99\n             count = count + 1\n          end if\n       end if\n    end do\n    invalid_digits = invalid_digits .or. (count /= 4)\n  end function invalid_digits\n\n  subroutine deal(digits)\n    implicit none\n    integer, dimension(4), intent(out) :: digits\n    integer :: i\n    real :: harvest\n    call random_number(harvest)\n    do i=1, 4\n       digits(i) = int(mod(harvest*9**i, 9.0))   + 1\n    end do\n    !    NB. computed with executable Iverson notation, www.jsoftware.oom\n    !    #B NB. B are the digits from 9999 deals\n    ! 39996\n    !    ({.,#)/.~/:~B  # show the distribution of digits\n    ! 0 4380\n    ! 1 4542\n    ! 2 4348\n    ! 3 4395\n    ! 4 4451\n    ! 5 4474\n    ! 6 4467\n    ! 7 4413\n    ! 8 4526\n    !    NB. this also shows that I forgot to add 1.  Inserting now...\n  end subroutine deal\nend program g24\n",
        "safe": true
    },
    {
        "filename": "24_game_59.txt",
        "content": "$ gfortran -g -O0 -std=f2008 -Wall f.f08 -o f.exe && echo '8*(9/9+2)' | ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n   24.000000      close enough\n$ \n$ \n$ \n$ ./f.exe \n$  Using digits 9 9 8 2, and the algebraic dyadic\n$  operators +-*/() enter an expression computing 24.\n$     8 *   ( 9 / 9  +    2   )\n$    24.000000      close enough\n$ \n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n(((2+8+9+9)))\n   28.000000      no good\n$ \n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n(((8+9-2+9)))\n   24.000000      close enough\n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n8929\n \"9\" unexpected in expression at           2\nSTOP 1\n$ \n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n12348\n invalid digits\n$ \n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n892\n invalid digits\n$ \n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n8921\n invalid digits\n$ \n$ \n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n89291\n invalid digits\n$ \n$ \n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n9+x-2+8+9\n \"x\" unexpected in expression at           3\nSTOP 1\n$ \n$ \n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n(9-2)+8+(9\n \"^@\" unexpected in expression at         125\nSTOP 1\n$ \n$ \n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n(9-2)+8+(9)\n   24.000000      close enough\n$ \n$ \n$ \n$ ./f.exe\n Using digits 9 9 8 2, and the algebraic dyadic\n operators +-*/() enter an expression computing 24.\n(9-2)+8/(9)\n   7.8888888      no good\n$ \n",
        "safe": true
    },
    {
        "filename": "24_game_6.txt",
        "content": "BEGIN # play the 24 game - present the user with 4 digits and invite them to  #\n      # enter an expression using the digits that evaluates to 24             #\n\n    [ 0\u00a0: 9 ]INT expression digits;          # the digits entered by the user #\n    [ 0\u00a0: 9 ]INT puzzle digits;                   # the digits for the puzzle #\n    PROC eval = ( STRING expr )REAL:              # parses and evaluates expr #\n         BEGIN\n            # syntax: expression = term ( ( \"+\" | \"-\" ) term )*               #\n            #         term       = factor ( ( \"*\" | \"/\" ) factor ) *          #\n            #         factor     = \"0\" | \"1\" | \"2\" | ... | \"9\"                #\n            #                    | \"(\" expression \")\"                         #\n            INT  x pos\u00a0:= LWB expr - 1;\n            INT  x end\u00a0:= UPB expr;\n            BOOL ok   \u00a0:= TRUE;\n            PROC error = ( STRING msg )VOID:\n                 IF ok THEN                        # this is the firstt error #\n                    ok\u00a0:= FALSE;\n                    print( ( msg, newline ) );\n                    x pos\u00a0:= x end + 1\n                 FI # error #\u00a0;                    \n            PROC curr ch = CHAR: IF x pos > x end THEN REPR 0 ELSE expr[ x pos ] FI;\n            PROC next ch = VOID: WHILE x pos +:= 1; curr ch = \" \" DO SKIP OD;\n            PROC factor = REAL:\n                 IF curr ch >= \"0\" AND curr ch <= \"9\" THEN\n                    INT  digit  = ABS curr ch - ABS \"0\";\n                    REAL result = digit;\n                    expression digits[ digit ] +:= 1;\n                    next ch;\n                    result\n                 ELIF curr ch = \"(\" THEN\n                    next ch;\n                    REAL result = expression;\n                    IF curr ch = \")\" THEN\n                        next ch\n                    ELSE\n                        error( \"\"\")\"\" expected after sub-expression\" )\n                    FI;\n                    result\n                 ELSE\n                    error( \"Unexpected \"\"\" + curr ch + \"\"\"\" );\n                    0\n                 FI # factor #\u00a0;\n            PROC expr term = REAL:\n                 BEGIN\n                    REAL result\u00a0:= factor;\n                    WHILE curr ch = \"*\" OR curr ch = \"/\" DO\n                        CHAR op = curr ch;\n                        next ch;\n                        IF op = \"*\" THEN result *:= factor ELSE result /:= factor FI\n                    OD;\n                    result\n                 END # expr term #\u00a0;\n            PROC expression = REAL:\n                 BEGIN\n                    REAL result\u00a0:= expr term;\n                    WHILE curr ch = \"+\" OR curr ch = \"-\" DO\n                        CHAR op = curr ch;\n                        next ch;\n                        IF op = \"+\" THEN result +:= expr term ELSE result -:= expr term FI\n                    OD;\n                    result\n                 END # expression #\u00a0;\n\n            next ch;\n            IF curr ch = REPR 0 THEN\n                error( \"Missing expression\" );\n                0\n            ELSE\n                REAL result = expression;\n                IF curr ch /= REPR 0 THEN\n                   error( \"Unexpected text: \"\"\" + expr[ x pos\u00a0: ] + \"\"\" after expression\" )\n                FI;\n                result\n            FI\n         END # eval #\u00a0;\n\n    WHILE\n        FOR i FROM 0 TO 9 DO                   # initialise the digit counts #\n            expression digits[ i ]\u00a0:= 0;\n            puzzle digits[     i ]\u00a0:= 0\n        OD;\n        print( ( \"Enter an expression using these digits:\" ) );\n        TO 4 DO                                       # pick 4 random digits #\n            INT digit\u00a0:= 1 + ENTIER ( next random * 9 );\n            IF digit > 9 THEN digit\u00a0:= 9 FI;\n            puzzle digits[ digit ] +:= 1;\n            print( ( whole( digit, - 2 ) ) )\n        OD;\n        print( ( \" that evaluates to 24: \" ) );\n        # get and check the expression                                       #\n        STRING expr;\n        read( ( expr, newline ) );\n        REAL result = eval( expr ); \n        BOOL same \u00a0:= TRUE;\n        FOR i FROM 0 TO 9 WHILE same\u00a0:= puzzle digits[ i ] = expression digits[ i ] DO SKIP OD;\n        IF NOT same THEN\n            print( ( \"That expression didn't contain the puzzle digits\", newline ) )\n        ELIF result = 24 THEN\n            print( ( \"Yes! That expression evaluates to 24\", newline ) )\n        ELSE\n            print( ( \"No - that expression evaluates to \", fixed( result, -8, 4 ), newline ) )\n        FI;\n        print( ( newline, \"Play again [y/n]? \" ) );\n        STRING play again;\n        read( ( play again, newline ) );\n        play again = \"y\" OR play again = \"Y\" OR play again = \"\"\n    DO SKIP OD\n\nEND",
        "safe": true
    },
    {
        "filename": "24_game_60.txt",
        "content": "' The 24 game en FreeBASIC\n\nConst operaciones = \"*/+-\"\n\nDeclare Sub Encabezado\nDeclare Function escoge4() As String\nDeclare Function quitaEspacios(cadena As String, subcadena1 As String, subcadena2 As String) As String   \nDeclare Function evaluaEntrada(cadena As String) As Integer\nDeclare Function evaluador(oper1 As Byte, oper2 As Byte, operacion As String) As Integer\n\nDim Shared As String serie, entrada, cadena\nDim As Integer resultado\n\nSub Encabezado\n    Cls: Color 15\n    Print \"The 24 Game\"\n    Print \"============\" + Chr(13) + Chr(10)\n    Print \"Dados cuatro d\u00edgitos en el rango de 1 a 9, que pueden repetirse, \"\n    Print \"usando solo los operadores aritm\u00e9ticos suma (+), resta (-), \"\n    Print \"multiplicaci\u00f3n (*) y divisi\u00f3n (/) intentar obtener un resultado de 24.\" + Chr(13) + Chr(10)\n    Print \"Use la notaci\u00f3n polaca inversa (primero los operandos y luego los operadores).\"\n    Print \"Por ejemplo: en lugar de 2 + 4, escriba 2 4 +\" + Chr(13) + Chr(10)\nEnd Sub \n\nFunction escoge4() As String\n    Dim As Byte i\n    Dim As String a, b\n    \n    Print \"Los d\u00edgitos a utilizar son:   \";\n    For i = 1 To 4\n\ta = Str(Int(Rnd*9)+1)\n\tPrint a;\"      \";\n\tb = b + a\n    Next i\n    escoge4 = b\nEnd Function\n\nFunction evaluaEntrada(cadena As String) As Integer\n    Dim As Byte oper1, oper2, n(4), i\n    Dim As String op\n    oper1 = 0: oper2 = 0: i = 0\n    \n    While cadena <> \"\"\n\top = Left(cadena, 1)\n\tentrada = Mid(cadena, 2)\t\n\tIf Instr(serie, op) Then\n\t\ti = i + 1\n\t\tn(i) = Val(op)\n        Elseif Instr(operaciones, op) Then\n\t\toper2 = n(i)\n\t\tn(i) = 0\n\t\ti = i - 1\n\t\toper1 = n(i)\n\t\tn(i) = evaluador(oper1, oper2, op)\n        Else\n\t\tPrint \"Signo no v\u00a0lido\"\n        End If\n    Wend   \n    evaluaEntrada = n(i)\nEnd Function\n\nFunction evaluador(oper1 As Byte, oper2 As Byte, operacion As String) As Integer\n    Dim As Integer t\n    \n    Select Case operacion\n    Case \"+\": t = oper1 + oper2\n    Case \"-\": t = oper1 - oper2\n    Case \"*\": t = oper1 * oper2\n    Case \"/\": t = oper1 / oper2\n    End Select\n    \n    evaluador = t\nEnd Function\n\nFunction quitaEspacios(cadena As String, subcadena1 As String, subcadena2 As String) As String   \n    Dim As Byte len1 = Len(subcadena1), len2 = Len(subcadena2)\n    Dim As Byte i\n    \n    i = Instr(cadena, subcadena1)\n    While i\n        cadena = Left(cadena, i - 1) & subcadena2 & Mid(cadena, i + len1)\n        i = Instr(i + len2, cadena, subcadena1)\n    Wend\n    quitaEspacios = cadena\nEnd Function\n\n'--- Programa Principal ---\nRandomize Timer\nDo\n    Encabezado\n    serie = escoge4\n    Print: Line Input \"Introduzca su f\u00f3rmula en notaci\u00f3n polaca inversa: \", entrada\n    entrada = quitaEspacios(entrada, \" \", \"\")\n    If (Len(entrada) <> 7) Then\n        Print \"Error en la serie introducida.\"\n    Else\n        resultado = evaluaEntrada(entrada)\n        Print \"El resultado es = \"; resultado\n        If resultado = 24 Then\n            Print \"\u00a1Correcto!\"\n        Else\n            Print \"\u00a1Error!\"\n        End If\n    End If\n    Print \"\u00bfOtra ronda? (Pulsa S para salir, u otra tecla para continuar)\"\nLoop Until (Ucase(Input(1)) = \"S\")\nEnd\n'--------------------------\n",
        "safe": true
    },
    {
        "filename": "24_game_61.txt",
        "content": "The 24 Game\n============\n\nDados cuatro d\u00edgitos en el rango de 1 a 9, que pueden repetirse,\nusando solo los operadores aritm\u00daticos suma (+), resta (-),\nmultiplicaci\u00f3n (*) y divisi\u00f3n (/) intentar obtener un resultado de 24.\n\nUse la notaci\u00f3n polaca inversa (primero los operandos y luego los operadores).\nPor ejemplo: en lugar de 2 + 4, escriba 2 4 +\n\nLos d\u00edgitos a utilizar son:   4      9      7      5\nIntroduzca su f\u00f3rmula en notaci\u00f3n polaca inversa: 49*57+-\nEl resultado es =  24\nCorrecto!\n\u00bfOtra ronda? (Pulsa S para salir, u otra tecla para continuar)\n\n",
        "safe": true
    },
    {
        "filename": "24_game_62.txt",
        "content": "ops = [\"+\", \"-\", \"*\", \"/\"]\n\nchosen = new array[[4], {|x| random[1,9]}]\nprintln[chosen]\n\nfor d = chosen.lexicographicPermute[]\n   multifor o = [ops, ops, ops]\n   {\n      str = \"((\" + d@0 + o@0 + d@1 + \")\" + o@1 + d@2 + \")\" + o@2 + d@3\n      if eval[str] == 24\n         println[str]\n      str = \"(\" + d@0 + o@0 + d@1 + \")\" + o@1 + \"(\" + d@2 + + o@2 + d@3 + \")\"\n      if eval[str] == 24\n         println[str]\n   }",
        "safe": true
    },
    {
        "filename": "24_game_63.txt",
        "content": "[9, 8, 7, 4]\n(4+8)*(9-7)\n((7+8)-9)*4\n((7-9)+8)*4\n(8+4)*(9-7)\n((8+7)-9)*4\n((8-9)+7)*4\n(8*9)/(7-4)\n(9-7)*(4+8)\n(9-7)*(8+4)\n(9*8)/(7-4)\n",
        "safe": true
    },
    {
        "filename": "24_game_64.txt",
        "content": "include resources \"24 Game Icon.icns\"\n\n#build CompilerOptions @\"-Wno-unused-variable\"\n\n_mEdit = 2\neditmenu _mEdit\n\nbegin globals\nlong gPosition\nend globals\n\nvoid local fn EraseErrorText\n  \n  CGRect r\n  r = fn CGRectMake(10, 200, 400, 15)\n  rect fill r,fn ColorBlack\n  \nend fn\n\nlocal fn ArcRandom( a as long, b as long ) as long\n  long i\n  cln i = (arc4random()%(b-a+1))+a;\nend fn = fn floor(i)\n\nlocal fn GetRandomNumbers as CFStringRef\n  \n  // 96 number groups\n  \n  CFArrayRef combos = @[\u00ac\n  \n  // The first 32 are easy\n  @\"1 2 3 4\", @\"2 4 6 8\", @\"1 2 4 8\", @\"1 3 4 6\", @\"1 2 6 8\",\n  @\"2 3 4 8\", @\"1 3 6 9\", @\"1 2 7 8\", @\"2 3 6 8\", @\"1 4 6 8\",\n  @\"2 2 3 9\", @\"3 4 6 6\", @\"2 3 3 8\", @\"1 5 6 6\", @\"2 4 4 6\",\n  @\"1 3 8 8\", @\"2 2 6 9\", @\"3 3 6 9\", @\"1 2 5 9\", @\"2 4 5 5\",\n  @\"1 3 5 9\", @\"2 2 4 9\", @\"1 2 3 6\", @\"1 2 2 9\", @\"1 2 3 9\",\n  @\"1 2 4 6\", @\"1 2 4 4\", @\"1 2 2 6\", @\"1 3 3 6\", @\"1 1 4 6\",\n  @\"1 1 2 8\", @\"1 1 3 8\",\n  // The middle 32 are medium\n  @\"1 5 5 9\", @\"4 4 6 9\", @\"2 3 7 9\",@\"3 5 8 8\", @\"1 6 6 8\",\n  @\"3 3 5 6\", @\"1 4 5 8\", @\"3 3 6 7\",@\"2 5 5 8\", @\"4 4 7 9\",\n  @\"1 5 6 9\", @\"3 3 8 9\", @\"2 6 6 7\",@\"4 5 7 8\", @\"2 2 5 9\",\n  @\"2 4 6 7\", @\"1 5 6 8\", @\"3 4 7 7\",@\"2 5 6 6\", @\"3 4 5 9\",\n  @\"1 6 7 9\", @\"2 3 7 8\", @\"1 4 6 9\",@\"2 3 5 9\", @\"3 4 4 8\",\n  @\"2 5 8 9\", @\"1 4 8 9\", @\"3 3 4 9\",@\"2 6 7 9\", @\"1 3 5 7\",\n  @\"1 3 6 6\", @\"2 2 5 7\",\n  // The last 32 are hard\n  @\"1 5 7 9\",@\"3 4 7 9\", @\"2 5 7 8\", @\"3 4 8 9\", @\"3 4 5 8\",\n  @\"2 6 6 9\",@\"4 4 5 7\", @\"2 4 6 9\", @\"1 4 7 7\", @\"2 3 8 9\",\n  @\"2 3 4 7\",@\"3 3 4 8\", @\"1 3 7 9\", @\"2 4 5 9\", @\"1 3 6 8\",\n  @\"2 4 4 9\",@\"1 5 8 9\", @\"3 3 5 9\", @\"2 6 8 9\", @\"1 4 4 7\",\n  @\"2 3 6 7\",@\"1 3 5 8\", @\"2 4 7 8\", @\"1 3 4 7\", @\"2 3 5 6\",\n  @\"1 4 5 6\",@\"3 3 5 7\", @\"2 2 3 6\", @\"3 3 7 7\", @\"3 3 7 9\",\n  @\"4 4 8 9\",@\"2 4 8 9\"]\n  \n  long i = fn ArcRandom( 0, len(combos) - 1 )\n  gPosition = i\n  \nend fn = combos[i]\n\n\nlocal fn EvaluateMath( equation as CFStringRef ) as CFStringRef\n  equation = fn StringByReplacingOccurrencesOfString( lcase(equation), @\"x\", @\"*\" )\n  \n  CFStringRef           result = NULL\n  RegularExpressionRef   regex = fn RegularExpressionWithPattern( @\"[0-9.]+\", NSRegularExpressionCaseInsensitive, NULL )\n  CFArrayRef           matches = fn RegularExpressionMatches( regex, equation, 0, fn CFRangeMake( 0, len(equation) ) )\n  NSInteger     intConversions = 0\n  TextCheckingResultRef  match\n  CFRange originalRange\n  CFRange adjustedRange\n  CFStringRef     value\n  \n  for match in matches\n    originalRange = fn TextCheckingResultRange( match )\n    adjustedRange = fn CFRangeMake( ( originalRange.location + ( intConversions * len( @\".0\") ) ), originalRange.length )\n    value = fn StringSubstringWithRange( equation, adjustedRange )\n    if fn StringContainsString( value, @\".\" )\n      continue\n    else\n      equation = fn StringByReplacingCharactersInRange( equation, adjustedRange, fn StringWithFormat( @\"%@.0\", value ) )\n      intConversions++\n    end if\n  next\n  ExceptionRef e\n  try\n    ExpressionRef expression = fn ExpressionWithFormat( equation )\n    CFNumberRef       number = fn ExpressionValueWithObject( expression, NULL, NULL )\n    result = fn StringWithFormat( @\"%.3f\", dblval( number ) )\n  end try\n  \n  catch (e)\n    result = fn StringWithFormat( @\"%@\", e )\u00a0: exit fn\n  end catch\n  // Test if result is an integer and, if so, return result as an integer\n  if( fn StringDoubleValue( result ) == fn floorf( fn StringDoubleValue( result ) ) )\n    result = fn ArrayFirstObject( fn StringComponentsSeparatedByString( result, @\".\" ) )\n  end if\nend fn = result\n\n\nlocal fn QuitOrPlayAlert(GameResult as CFStringRef)\n  alert -2,,GameResult,@\"You won!\",@\"Quit;Play Again\"\n  AlertButtonSetKeyEquivalent( 2, 2, @\"\\e\" )\n  short result\n  result = alert 2\n  if ( result\u00a0!= NSAlertSecondButtonReturn ) then appterminate\nend fn\n\n\nlocal fn BuildWindow\n  CGRect r = fn CGRectMake( 0, 0, 580, 250)\n  window 1, @\"24 Game\", r\n  windowcenter(1)\n  WindowSetBackgroundColor(1,fn ColorBlack)\n  \nend fn\n\n/////////  Start  //////////\n\nfn BuildWindow\n\n\nshort d(4), i\nCFStringRef CheckForDuplicates(97)\nfor i = 1 to 96\n  CheckForDuplicates(i) = @\"\"\nnext i\n\nshort DuplicatesCounter\nDuplicatesCounter = 0\n\n\n\"Main\"\n\ncls\ntext ,,fn colorWhite\n\nprint\nprint\u00a0%(10,15),\"Given four numbers and using just the +, -, *, and / operators; and the\"\nprint\u00a0%(10,30),\"possible use of parenthesis (), enter an expression that equates to 24.\"\nprint\u00a0%(10,45),\"You must use all your numbers and only those numbers.\"\nprint\u00a0%(10,60),\"Examples: 9618 Solution 9 + 6 + 1 + 8 or 3173 Solution (3 * 7) - (1 - 4)\"\nprint\nprint\u00a0%(10,85),\"Enter Q to quit or S to skip to the next number.\"\n\n\"GetFourNumbers\"\n\nCFArrayRef randomNumbers\u00a0: randomNumbers= fn StringComponentsSeparatedByString( fn GetRandomNumbers, @\" \" )\nCFStringRef  RandomNumberblock\u00a0: RandomNumberblock = @\"\"\nCFStringRef  RandomNumberblockAdd\u00a0: RandomNumberblockAdd = @\"\"\n\nfor i = 0 to 3\n  // create a string from the 4 numbers\n  RandomNumberblockAdd = randomNumbers[i]\n  RandomNumberblock = fn StringByAppendingString(RandomNumberblock,RandomNumberblockAdd)\n  RandomNumberblock = fn StringByAppendingString(RandomNumberblock,@\" \")\nnext i\n\n\nif DuplicatesCounter = > 96\n  // reset counter when last number is retrieved and start from the first number block\n  DuplicatesCounter = 0\n  for i = 1 to 96\n    CheckForDuplicates(i) = @\"\"\n  next i\nend if\n\nfor i = 1 to 96\n  // check the current numbers with the numbers already used\n  if fn StringIsEqual(RandomNumberblock,CheckForDuplicates(i))\n    RandomNumberblock = fn StringWithString(CheckForDuplicates(DuplicatesCounter))\n    goto \"GetFourNumbers\"\n  end if\nnext i\n\nDuplicatesCounter ++\nCheckForDuplicates(DuplicatesCounter)  = fn StringWithString(RandomNumberblock)\n\nd(1) = fn StringIntegerValue( randomNumbers[0] )\nd(2) = fn StringIntegerValue( randomNumbers[1] )\nd(3) = fn StringIntegerValue( randomNumbers[2] )\nd(4) = fn StringIntegerValue( randomNumbers[3] )\n\nshort dots = 0\n\n//d(1) = 9:d(2) = 6:d(3) = 1:d(4) = 8  // Uncomment to test with 9618 numbers. Solution 9 + 6 + 1 + 8\n//d(1) = 6:d(2) = 5:d(3) = 3:d(4) = 8  // Uncomment to test with 6538 numbers. Solution 6 / ( 5 - 3 ) * 8\n//d(1) = 3:d(2) = 1:d(3) = 7:d(4) = 3 // Uncomment to test with 3773 numbers. Solution ((3 * 1) * 7) + 3\n//d(1) = 4:d(2) = 2:d(3) = 7:d(4) = 1 // Uncomment to test with 4271 numbers. Solution (4 * ( 7 - 2 + 1 )\n// NOTE: When using these test numbers, also uncomment dots = 0 below here to prevent misleading dot displays\n\n\nif gPosition <= 32 then dots = 1\nif gPosition > 32 and gPosition < 65 then dots = 2\nif gPosition > 64 then dots = 3\n\n//dots = 0  uncomment when testing the numbers above to prevent misleading dot displays\n\nprint\ntext ,,fn colorGreen\nprint\u00a0%(15,110),\"These are your numbers, difficulty level \";\n//  @\"\\U000026AA\" is white unicode dot - Easy difficulty (One-Dot)\n//  @\"\\U0001F534\" is red unicode dot - Medium difficulty (Two-Dots)\n//  @\"\\U0001F7E1\" is yellow unicode dot - Hard difficulty (Three-Dots)\n\nif dots = 1 then print @\"\\U000026AA Easy\"\nif dots = 2 then print @\"\\U0001F534 \\U0001F534 Medium\"\nif dots = 3 then print @\"\\U0001F7E1 \\U0001F7E1 \\U0001F7E1 Hard\"\n\nprint\u00a0%(55,125)\ntext ,18,fn colorGreen\nfor i = 1 to 4\n  print d(i); \" \";\nnext\n\nprint\n\ntext ,12,fn colorWhite\nprintf @\"\\n\\n\\n\"\n\nCFStringRef expr\nbool        TryAgain\u00a0: TryAgain = _false\nCFStringRef MessageText\nCFStringRef UserInput = NULL\n\n\"InputExpression\"\n\nif TryAgain\n  MessageText = fn StringWithFormat( @\"Enter math expression: [ '%@' was incorrect ]\", expr )\n  UserInput = input\u00a0%(10, 190), MessageText, @\"123456789+-*/()qs\", YES,, 0\nelse\n  UserInput = input\u00a0%(10, 190), @\"Enter math expression:\", @\"123456789+-*/()qs\", YES,, 0\nend if\n\nif ( UserInput == NULL ) then \"InputExpression\"\nexpr = UserInput\nif expr = @\"\" then \"InputExpression\"\nif fn StringIsEqual(ucase(expr) , @\"Q\") then appterminate\nif fn StringIsEqual(ucase(expr) , @\"S\") then \"Main\"\n\n\n//check expr for validity\n\nshort                  j\nbool       GotAllNumbers\u00a0: GotAllNumbers = _false\nshort ThisNumberPosition\u00a0: ThisNumberPosition = 0\nshort         GotaNumber\u00a0: GotaNumber = 0\nshort       TotalNumbers\u00a0: TotalNumbers = 0\n\nshort ExtraNumbers:ExtraNumbers = 0\n\nfor i = 1 to len$(fn stringpascalstring(expr))\n  if asc(mid$(fn stringpascalstring(expr),i,1)) > 48 && asc(mid$(fn stringpascalstring(expr),i,1)) < 58\n    ExtraNumbers ++\n  end if\nnext i\n\nif ExtraNumbers > 4\n  fn EraseErrorText\n  text ,,fn colorRed\n  TryAgain = _true\n  print\u00a0%(10,200);\"Error! Extra numbers not allowed\": goto \"InputExpression\"\n  text ,,fn colorWhite\nend if\n\n\nfor i = 1 to 4\n  GotaNumber = 0\n  for j = 0 to len(expr) -1\n    ThisNumberPosition = instr( j, expr, right(str( d(i)),1 ))\n    ThisNumberPosition ++\n    if ThisNumberPosition then GotaNumber = _true\n  next j\n  if GotaNumber then TotalNumbers ++\nnext i\n\nif TotalNumbers => 4 then GotAllNumbers = _true\n\nif GotAllNumbers = _false\n  fn EraseErrorText\n  text ,,fn colorRed\n  TryAgain = _true\n  print\u00a0%(10,200);\"ERROR! Must use all your numbers and only those numbers.\"\u00a0: goto \"InputExpression\"\n  text ,,fn colorWhite\nend if\n\nfn EraseErrorText\n\n\nif fn EvaluateMath( expr ) = _false\n  text ,,fn colorRed\n  TryAgain = _true\n  Print\u00a0%(10,200);\"Error! Incorrect math sequence.\"\n  goto \"InputExpression\"\n  text ,,fn colorWhite\nend if\n\nCFStringRef GameResult\nif fn StringIntegerValue( fn EvaluateMath( expr ) ) == 24 then GameResult =  @\"Correct\" else GameResult =  @\"Incorrect\"\n\nif GameResult =  @\"Incorrect\"\n  TryAgain = _true\n  goto \"InputExpression\"\nend if\n\nfn QuitOrPlayAlert(GameResult)\ngoto \"Main\"\n\nhandleevents",
        "safe": true
    },
    {
        "filename": "24_game_65.txt",
        "content": "Play24 := function()\n\tlocal input, digits, line, c, chars, stack, stackptr, cur, p, q, ok, a, b, run;\n\tinput := InputTextUser();\n\trun := true;\n\twhile run do\n\t\tdigits := List([1 .. 4], n -> Random(1, 9));\n\t\twhile true do\n\t\t\tDisplay(digits);\n\t\t\tline := ReadLine(input);\n\t\t\tline := Chomp(line);\n\t\t\tif line = \"end\" then\n\t\t\t\trun := false;\n\t\t\t\tbreak;\n\t\t\telif line = \"next\" then\n\t\t\t\tbreak;\n\t\t\telse\n\t\t\t\tok := true;\n\t\t\t\tstack := [ ];\n\t\t\t\tstackptr := 0;\n\t\t\t\tchars := \"123456789+-*/ \";\n\t\t\t\tcur := ShallowCopy(digits);\n\t\t\t\tfor c in line do\n\t\t\t\t\tif c = ' ' then\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tfi;\n\t\t\t\t\tp := Position(chars, c);\n\t\t\t\t\tif p = fail then\n\t\t\t\t\t\tok := false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tfi;\n\t\t\t\t\tif p < 10 then\n\t\t\t\t\t\tq := Position(cur, p);\n\t\t\t\t\t\tif q = fail then\n\t\t\t\t\t\t\tok := false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tfi;\n\t\t\t\t\t\tUnbind(cur[q]);\n\t\t\t\t\t\tstackptr := stackptr + 1;\n\t\t\t\t\t\tstack[stackptr] := p;\n\t\t\t\t\telse\n\t\t\t\t\t\tif stackptr < 2 then\n\t\t\t\t\t\t\tok := false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tfi;\n\t\t\t\t\t\tb := stack[stackptr];\n\t\t\t\t\t\ta := stack[stackptr - 1];\n\t\t\t\t\t\tstackptr := stackptr - 1;\n\t\t\t\t\t\tif c = '+' then\n\t\t\t\t\t\t\ta := a + b;\n\t\t\t\t\t\telif c = '-' then\n\t\t\t\t\t\t\ta := a - b;\n\t\t\t\t\t\telif c = '*' then\n\t\t\t\t\t\t\ta := a * b;\n\t\t\t\t\t\telif c = '/' then\n\t\t\t\t\t\t\tif b = 0 then\n\t\t\t\t\t\t\t\tok := false;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tfi;\n\t\t\t\t\t\t\ta := a / b;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tok := false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tfi;\n\t\t\t\t\t\tstack[stackptr] := a;\n\t\t\t\t\tfi;\n\t\t\t\tod;\n\t\t\t\tif ok and stackptr = 1 and Size(cur) = 0 then\n\t\t\t\t\tif stack[1] = 24 then\n\t\t\t\t\t\tPrint(\"Good\u00a0!\\n\");\n\t\t\t\t\t\tbreak;\n\t\t\t\t\telse\n\t\t\t\t\t\tPrint(\"Bad value: \", stack[1], \"\\n\");\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tfi;\n\t\t\t\tfi;\n\t\t\t\tPrint(\"Invalid expression\\n\");\n\t\t\tfi;\n\t\tod;\n\tod;\n\tCloseStream(input);\nend;\n\n# example session\n# type \"end\" to quit the game, \"next\" to try another list of digits\ngap> Play24();\n[ 7, 6, 8, 5 ]\n86*75-/\nGood\u00a0!\n[ 5, 9, 2, 7 ]\nend\ngap>\n",
        "safe": true
    },
    {
        "filename": "24_game_66.txt",
        "content": "package main\n\nimport (\n    \"fmt\"\n    \"math\"\n    \"math/rand\"\n    \"time\"\n)\n\nfunc main() {\n    rand.Seed(time.Now().Unix())\n    n := make([]rune, 4)\n    for i := range n {\n        n[i] = rune(rand.Intn(9) + '1')\n    }\n    fmt.Printf(\"Your numbers: %c\\n\", n)\n    fmt.Print(\"Enter RPN: \")\n    var expr string\n    fmt.Scan(&expr)\n    if len(expr) != 7 {\n        fmt.Println(\"invalid. expression length must be 7.\" +\n            \" (4 numbers, 3 operators, no spaces)\")\n        return\n    }\n    stack := make([]float64, 0, 4)\n    for _, r := range expr {\n        if r >= '0' && r <= '9' {\n            if len(n) == 0 {\n                fmt.Println(\"too many numbers.\")\n                return\n            }\n            i := 0\n            for n[i] != r {\n                i++\n                if i == len(n) {\n                    fmt.Println(\"wrong numbers.\")\n                    return\n                }\n            }\n            n = append(n[:i], n[i+1:]...)\n            stack = append(stack, float64(r-'0'))\n            continue\n        }\n        if len(stack) < 2 {\n            fmt.Println(\"invalid expression syntax.\")\n            return\n        }\n        switch r {\n        case '+':\n            stack[len(stack)-2] += stack[len(stack)-1]\n        case '-':\n            stack[len(stack)-2] -= stack[len(stack)-1]\n        case '*':\n            stack[len(stack)-2] *= stack[len(stack)-1]\n        case '/':\n            stack[len(stack)-2] /= stack[len(stack)-1]\n        default:\n            fmt.Printf(\"%c invalid.\\n\", r)\n            return\n        }\n        stack = stack[:len(stack)-1]\n    }\n    if math.Abs(stack[0]-24) > 1e-6 {\n        fmt.Println(\"incorrect.\", stack[0], \"!= 24\")\n    } else {\n        fmt.Println(\"correct.\")\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "24_game_67.txt",
        "content": "Your numbers: [5 8 1 3]\nEnter RPN: 83-5*1-\ncorrect.\n",
        "safe": true
    },
    {
        "filename": "24_game_68.txt",
        "content": "uses java.lang.Double\nuses java.lang.Integer\nuses java.util.ArrayList\nuses java.util.List\nuses java.util.Scanner\nuses java.util.Stack\n\nfunction doEval( scanner : Scanner, allowed : List<Integer> ) : double {\n    var stk = new Stack<Double>()\n\n    while( scanner.hasNext() ) {\n        if( scanner.hasNextInt() ) {\n            var n = scanner.nextInt()\n\n            // Make sure they're allowed to use n\n            if( n <= 0 || n >= 10 ) {\n                print( n + \" isn't allowed\" )\n                return 0\n            }\n            var idx = allowed.indexOf( n )\n            if( idx == -1 ) {\n                print( \"You aren't allowed to use so many \" + n + \"s!\" )\n                return 0\n            }\n\n            // Add the input number to the stack\n            stk.push( new Double( n ) )\n\n            // Mark n as used\n            allowed.remove( idx )\n        } else {\n            // It has to be an operator...\n            if( stk.size() < 2 ) {\n                print( \"Invalid Expression: Stack underflow!\" )\n                return 0\n            }\n\n            // Gets the next operator as a single character token\n            var s = scanner.next(\"[\\\\+-/\\\\*]\")\n\n            // Get the operands\n            var r = stk.pop().doubleValue()\n            var l = stk.pop().doubleValue()\n\n            // Determine which operator and invoke it\n            if( s.equals( \"+\" ) ) {\n                stk.push( new Double( l + r ) )\n            } else if( s.equals( \"-\" ) ) {\n                stk.push( new Double( l - r ) )\n            } else if( s.equals( \"*\" ) ) {\n                stk.push( new Double( l * r ) )\n            } else if( s.equals( \"/\" ) ) {\n                if( r == 0.0 ) {\n                    print( \"Invalid Expression: Division by zero!\" )\n                    return 0\n                }\n                stk.push( new Double( l / r ) )\n            } else {\n                print( \"Internal Error: looking for operator yielded '\" + s + \"'\" )\n                return 0\n            }\n        }\n    }\n\n    // Did they skip any numbers?\n    if( allowed.size() != 0 ) {\n        print( \"You didn't use ${allowed}\" )\n        return 0\n    }\n\n    // Did they use enough operators?\n    if( stk.size() != 1 ) {\n        print( \"Invalid Expression: Not enough operators!\" )\n        return 0\n    }\n\n    return stk.pop().doubleValue()\n}\n\n// Pick 4 random numbers from [1..9]\nvar nums = new ArrayList<Integer>()\nvar gen = new java.util.Random( new java.util.Date().getTime() )\nfor( i in 0..3 ) {\n    nums.add( gen.nextInt(9) + 1 )\n}\n\n// Prompt the user\nprint( \"Using addition, subtraction, multiplication and division, write an\" )\nprint( \"expression that evaluates to 24 using\" )\nprint( \"${nums.get(0)}, ${nums.get(1)}, ${nums.get(2)} and ${nums.get(3)}\" )\nprint( \"\" )\nprint( \"Please enter your expression in RPN\" )\n\n// Build a tokenizer over a line of input\nvar sc = new Scanner( new java.io.BufferedReader( new java.io.InputStreamReader( java.lang.System.in ) ).readLine() )\n\n// eval the expression\nvar val = doEval( sc, nums )\n\n// winner?\nif( java.lang.Math.abs( val - 24.0 ) < 0.001 ) {\n    print( \"You win!\" )\n} else {\n    print( \"You lose!\" )\n}\n",
        "safe": true
    },
    {
        "filename": "24_game_69.txt",
        "content": "final random = new Random()\nfinal input = new Scanner(System.in)\n\n\ndef evaluate = { expr ->\n    if (expr == 'QUIT') {\n        return 'QUIT'\n    } else {\n        try { Eval.me(expr.replaceAll(/(\\d)/, '$1.0')) }\n        catch (e) { 'syntax error' }\n    }\n}\n\n\ndef readGuess = { digits ->\n    while (true) {\n        print \"Enter your guess using ${digits} (q to quit): \"\n        def expr = input.nextLine()\n        \n        switch (expr) {\n            case ~/^[qQ].*/:\n                return 'QUIT'\n\n            case ~/.*[^\\d\\s\\+\\*\\/\\(\\)-].*/:\n                def badChars = expr.replaceAll(~/[\\d\\s\\+\\*\\/\\(\\)-]/, '')\n                println \"invalid characters in input: ${(badChars as List) as Set}\"\n                break\n\n            case { (it.replaceAll(~/\\D/, '') as List).sort() != ([]+digits).sort() }:\n                println '''you didn't use the right digits'''\n                break\n\n            case ~/.*\\d\\d.*/:\n                println 'no multi-digit numbers allowed'\n                break\n\n            default:\n                return expr\n        }\n    }\n}\n\n\ndef digits = (1..4).collect { (random.nextInt(9) + 1) as String }\n\nwhile (true) {\n    def guess = readGuess(digits)\n    def result = evaluate(guess)\n    \n    switch (result) {\n        case 'QUIT':\n            println 'Awwww. Maybe next time?'\n            return\n            \n        case 24:\n            println 'Yes! You got it.'\n            return\n            \n        case 'syntax error':\n            println \"A ${result} was found in ${guess}\" \n            break\n            \n        default:\n            println \"Nope: ${guess} == ${result}, not 24\"\n            println 'One more try, then?'\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "24_game_7.txt",
        "content": "Enter an expression using these digits: 2 5 3 5 that evaluates to 24: (3+5)*(5-2)\nYes! That expression evaluates to 24\n\nPlay again [y/n]?\nEnter an expression using these digits: 8 8 6 6 that evaluates to 24: 8+6+8/6\nNo - that expression evaluates to  15.3333\n\nPlay again [y/n]?\nEnter an expression using these digits: 2 1 5 1 that evaluates to 24: (1+1)*(7+5)\nThat expression didn't contain the puzzle digits\n\nPlay again [y/n]? n\n",
        "safe": true
    },
    {
        "filename": "24_game_70.txt",
        "content": "$ groovy TwentyFour.gsh\nEnter your guess using [4, 8, 3, 6] (q to quit): 4836\nno multi-digit numbers allowed\nEnter your guess using [4, 8, 3, 6] (q to quit): 4  ++ ++ 8/ 3-6\nA syntax error was found in 4  ++ ++ 8/ 3-6\nEnter your guess using [4, 8, 3, 6] (q to quit): btsjsb\ninvalid characters in input: [t, s, b, j]\nEnter your guess using [4, 8, 3, 6] (q to quit): 1+3+2+2\nyou didn't use the right digits\nEnter your guess using [4, 8, 3, 6] (q to quit): q\nAwwww. Maybe next time?\n\n$ groovy TwentyFour.gsh\nEnter your guess using [6, 3, 2, 6] (q to quit): 6+6+3+2\nNope: 6+6+3+2 == 17.0, not 24\nOne more try, then?\nEnter your guess using [6, 3, 2, 6] (q to quit): (6*3 - 6) * 2\nYes! You got it.",
        "safe": true
    },
    {
        "filename": "24_game_71.txt",
        "content": "import Data.List (sort)\nimport Data.Char (isDigit)\nimport Data.Maybe (fromJust)\nimport Control.Monad (foldM)\nimport System.Random (randomRs, getStdGen)\nimport System.IO (hSetBuffering, stdout, BufferMode(NoBuffering))\n\nmain = do\n  hSetBuffering stdout NoBuffering\n  mapM_\n    putStrLn\n    [ \"THE 24 GAME\\n\"\n    , \"Given four digits in the range 1 to 9\"\n    , \"Use the +, -, *, and / operators in reverse polish notation\"\n    , \"To show how to make an answer of 24.\\n\"\n    ]\n  digits <- fmap (sort . take 4 . randomRs (1, 9)) getStdGen :: IO [Int]\n  putStrLn (\"Your digits: \" ++ unwords (fmap show digits))\n  guessLoop digits\n  where\n    guessLoop digits =\n      putStr \"Your expression: \" >> fmap (processGuess digits . words) getLine >>=\n      either (\\m -> putStrLn m >> guessLoop digits) putStrLn\n\nprocessGuess _ [] = Right \"\"\nprocessGuess digits xs\n  | not matches = Left \"Wrong digits used\"\n  where\n    matches = digits == (sort . fmap read $ filter (all isDigit) xs)\nprocessGuess digits xs = calc xs >>= check\n  where\n    check 24 = Right \"Correct\"\n    check x = Left (show (fromRational (x :: Rational)) ++ \" is wrong\")\n\n-- A Reverse Polish Notation calculator with full error handling\ncalc xs =\n  foldM simplify [] xs >>=\n  \\ns ->\n     (case ns of\n        [n] -> Right n\n        _ -> Left \"Too few operators\")\n\nsimplify (a:b:ns) s\n  | isOp s = Right ((fromJust $ lookup s ops) b a : ns)\nsimplify _ s\n  | isOp s = Left (\"Too few values before \" ++ s)\nsimplify ns s\n  | all isDigit s = Right (fromIntegral (read s) : ns)\nsimplify _ s = Left (\"Unrecognized symbol: \" ++ s)\n\nisOp v = elem v $ fmap fst ops\n\nops = [(\"+\", (+)), (\"-\", (-)), (\"*\", (*)), (\"/\", (/))]\n",
        "safe": true
    },
    {
        "filename": "24_game_72.txt",
        "content": "DIMENSION digits(4), input_digits(100), difference(4)\nCHARACTER expression*100, prompt*100, answers='Wrong,Correct,', protocol='24 game.txt'\n\n1  digits = CEILING( RAN(9) )\n2  DLG(Edit=expression, Text=digits, TItle=prompt)\n\n   READ(Text=expression, ItemS=n) input_digits\n   IF(n == 4) THEN\n     ALIAS(input_digits,1,  input,4)\n     SORT(Vector=digits, Sorted=digits)\n     SORT(Vector=input, Sorted=input)\n     difference = ABS(digits - input)\n     IF( SUM(difference) == 0 ) THEN\n       EDIT(Text=expression, ScaNnot='123456789+-*/ ()', GetPos=i, CoPyto=prompt)\n       IF( i > 0 ) THEN\n         prompt = TRIM(expression) // ': ' //TRIM(prompt) // ' is an illegal character'\n       ELSE\n         prompt = TRIM(expression) // ': Syntax error'\n         result = XEQ(expression, *2)\u00a0! on error branch to label 2\n         EDIT(Text=answers, ITeM=(result==24)+1, Parse=answer)\n         WRITE(Text=prompt, Name) TRIM(expression)//': ', answer, result\n       ENDIF\n     ELSE\n       WRITE(Text=prompt) TRIM(expression), ': You used ', input, ' instead ', digits\n     ENDIF\n   ELSE\n     prompt = TRIM(expression) // ': Instead 4 digits you used ' // n\n   ENDIF\n\n   OPEN(FIle=protocol, APPend)\n   WRITE(FIle=protocol, CLoSe=1) prompt\n\n   DLG(TItle=prompt, Button='>2:Try again', B='>1:New game', B='Quit')\n\nEND",
        "safe": true
    },
    {
        "filename": "24_game_73.txt",
        "content": "4 + 8 + 7 + 5: You used 4 5 7 8  instead 4 4 7 8\n4 + 8 + 7 + a: Instead 4 digits you used 3\n4 + 8 + 7 + a + 4: a is an illegal character\n4 + 8 + 7a + 4: a is an illegal character\n4 + 8 + 7 + 4:; answer=Wrong; result=23;\n4 * 7 - 8 + 4:; answer=Correct; result=24;",
        "safe": true
    },
    {
        "filename": "24_game_74.txt",
        "content": "#! /bin/sh\nexec huginn --no-argv -E \"${0}\"\n#! huginn\n\nimport Algorithms as algo;\nimport Mathematics as math;\nimport RegularExpressions as re;\n\nmake_game( rndGen_ ) {\n  board = \"\";\n  for ( i\u00a0: algo.range( 4 ) ) {\n    board += ( \" \" + string( character( rndGen_.next() + integer( '1' ) ) ) );\n  }\n  return ( board.strip() );\n}\n\nmain() {\n  rndGen = math.randomizer( 9 );\n  no = 0;\n  dd = re.compile( \"\\\\d\\\\d\" );\n  while ( true ) {\n    no += 1;\n    board = make_game( rndGen );\n    print( \"Your four digits: {}\\nExpression {}: \".format( board, no ) );\n    line = input();\n    if ( line == none ) {\n      print( \"\\n\" );\n      break;\n    }\n    line = line.strip();\n    try {\n      if ( line == \"q\" ) {\n        break;\n      }\n      if ( ( pos = line.find_other_than( \"{}+-*/() \".format( board ) ) ) >= 0 ) {\n        print( \"Invalid input found at: {}, `{}`\\n\".format( pos, line ) );\n        continue;\n      }\n      if ( dd.match( line ).matched() ) {\n        print( \"Digit concatenation is forbidden.\\n\" );\n        continue;\n      }\n      res = real( line );\n      if ( res == 24.0 ) {\n        print( \"Thats right!\\n\" );\n      } else {\n        print( \"Bad answer!\\n\" );\n      }\n    } catch ( Exception e ) {\n      print( \"Not an expression: {}\\n\".format( e.what() ) );\n    }\n  }\n  return ( 0 );\n}",
        "safe": true
    },
    {
        "filename": "24_game_75.txt",
        "content": "invocable all \nlink strings   # for csort, deletec\n\nprocedure main() \nhelp()  \nrepeat { \n   every (n := \"\") ||:= (1 to 4, string(1+?8))\n   writes(\"Your four digits are\u00a0: \")\n   every writes(!n,\" \") \n   write()\n   \n   e := trim(read()) | fail\n   case e of {\n      \"q\"|\"quit\": return\n      \"?\"|\"help\": help()\n      default: {\n         e := deletec(e,' \\t')         # no whitespace\n         d := deletec(e,~&digits)      # just digits\n         if csort(n) ~== csort(d) then # and only the 4 given digits\n            write(\"Invalid repsonse.\") & next \n\n         if e ? (ans := eval(E()), pos(0)) then # parse and evaluate\n            if ans = 24 then write(\"Congratulations you win!\") \n            else write(\"Your answer was \",ans,\". Try again.\")\n         else write(\"Invalid expression.\")\n         }\n      }\n   }\nend\n\nprocedure eval(X)    #: return the evaluated AST\n   if type(X) == \"list\" then {\n      x := eval(get(X))\n      while x := get(X)(real(x), real(eval(get(X) | stop(\"Malformed expression.\"))))\n   }\n   return \\x | X\nend\n\nprocedure E()    #: expression\n   put(lex := [],T())\n   while put(lex,tab(any('+-*/'))) do\n      put(lex,T())  \n   suspend if *lex = 1 then lex[1] else lex     # strip useless []  \nend   \n \nprocedure T()                   #: Term\n   suspend 2(=\"(\", E(), =\")\") | # parenthesized subexpression, or ...\n       tab(any(&digits))        # just a value\nend\n\nprocedure help()\nreturn write(\n   \"Welcome to 24\\n\\n\",\n   \"Combine the 4 given digits to make 24 using only + - * / and ( ).\\n \",\n   \"All operations have equal precedence and are evaluated left to right.\\n\",\n   \"Combining (concatenating) digits is not allowed.\\n\",\n   \"Enter 'help', 'quit', or an expression.\\n\")  \nend\n",
        "safe": true
    },
    {
        "filename": "24_game_76.txt",
        "content": "Welcome to 24\n\nThe object of the game is to combine the 4 given digits using only + - * / and ( ).\nAll operations have equal precedence and are evaluated left to right.\nCombining (concatenating) digits is not allowed.\nEnter 'help', 'quit', or an expression.\n\nYour four digits are\u00a0: 8 1 7 2\n8*2+(7+1)\nCongratulations you win!\nYour four digits are\u00a0: 4 2 7 6\n7*6+(4*2)\nYour answer was 50. Try again.\nYour four digits are\u00a0: 7 7 8 8\n77-88\nInvalid expression.\nYour four digits are\u00a0: 9 3 2 3\n9+3+2+3+\nMalformed expression.",
        "safe": true
    },
    {
        "filename": "24_game_77.txt",
        "content": "require'misc'\ndeal=: 1 + ? bind 9 9 9 9\nrules=: smoutput bind 'see http://en.wikipedia.org/wiki/24_Game'\ninput=: prompt @ ('enter 24 expression using ', \":, ': '\"_)\n\nwellformed=: (' '<;._1@, \":@[) -:&(/:~)  '(+-*%)' -.&;:~ ]\nis24=: 24 -: \". ::0:@]\n\nrespond=: (;:'no yes') {::~ wellformed * is24\n\ngame24=: (respond input)@deal@rules\n",
        "safe": true
    },
    {
        "filename": "24_game_78.txt",
        "content": "   game24 ''\nsee http://en.wikipedia.org/wiki/24_Game\nenter 24 expression using 6 5 9 4: 6+5+9+4\nyes\n   game24 ''\nsee http://en.wikipedia.org/wiki/24_Game\nenter 24 expression using 3 3 3 3: 3+3+3+3+3+3+3+3\nno\n",
        "safe": true
    },
    {
        "filename": "24_game_79.txt",
        "content": "import java.util.*;\n\npublic class Game24 {\n    static Random r = new Random();\n\n    public static void main(String[] args) {\n\n        int[] digits = randomDigits();\n        Scanner in = new Scanner(System.in);\n\n        System.out.print(\"Make 24 using these digits: \");\n        System.out.println(Arrays.toString(digits));\n        System.out.print(\"> \");\n\n        Stack<Float> s = new Stack<>();\n        long total = 0;\n        for (char c : in.nextLine().toCharArray()) {\n            if ('0' <= c && c <= '9') {\n                int d = c - '0';\n                total += (1 << (d * 5));\n                s.push((float) d);\n            } else if (\"+/-*\".indexOf(c) != -1) {\n                s.push(applyOperator(s.pop(), s.pop(), c));\n            }\n        }\n        if (tallyDigits(digits) != total)\n            System.out.print(\"Not the same digits. \");\n        else if (Math.abs(24 - s.peek()) < 0.001F)\n            System.out.println(\"Correct!\");\n        else\n            System.out.print(\"Not correct.\");\n    }\n\n    static float applyOperator(float a, float b, char c) {\n        switch (c) {\n            case '+':\n                return a + b;\n            case '-':\n                return b - a;\n            case '*':\n                return a * b;\n            case '/':\n                return b / a;\n            default:\n                return Float.NaN;\n        }\n    }\n\n    static long tallyDigits(int[] a) {\n        long total = 0;\n        for (int i = 0; i < 4; i++)\n            total += (1 << (a[i] * 5));\n        return total;\n    }\n\n    static int[] randomDigits() {        \n        int[] result = new int[4];\n        for (int i = 0; i < 4; i++)\n            result[i] = r.nextInt(9) + 1;\n        return result;\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "24_game_8.txt",
        "content": "tfgame\u2190{\u2395IO\u21901\n    \u2395\u2190d\u2190?\u2375\u23749\n    i\u2190\u235e\n    u[\u234bu\u2190{\u234e\u00a8\u2363(0\u2260\u2262\u2375)\u22a2\u2375}(i\u220a'1234567890')\u2286i]\u2262d[\u234bd]:'nope'\n    ~\u2227/((~b\u2190i\u220a'1234567890')/i)\u220a'+-\u00d7\u00f7()':'nope'\n    24\u2260\u234ei:'nope'\n    'Yeah!'\n}\n",
        "safe": true
    },
    {
        "filename": "24_game_80.txt",
        "content": "Make 24 using these digits: [1, 2, 4, 8]\n> 12*48+*\nCorrect!",
        "safe": true
    },
    {
        "filename": "24_game_81.txt",
        "content": "function twentyfour(numbers, input) {\n    var invalidChars = /[^\\d\\+\\*\\/\\s-\\(\\)]/;\n\n    var validNums = function(str) {\n        // Create a duplicate of our input numbers, so that\n        // both lists will be sorted.\n        var mnums = numbers.slice();\n        mnums.sort();\n\n        // Sort after mapping to numbers, to make comparisons valid.\n        return str.replace(/[^\\d\\s]/g, \" \")\n            .trim()\n            .split(/\\s+/)\n            .map(function(n) { return parseInt(n, 10); })\n            .sort()\n            .every(function(v, i) { return v === mnums[i]; });\n    };\n\n    var validEval = function(input) {\n        try {\n            return eval(input);\n        } catch (e) {\n            return {error: e.toString()};\n        }\n    };\n\n    if (input.trim() === \"\") return \"You must enter a value.\";\n    if (input.match(invalidChars)) return \"Invalid chars used, try again. Use only:\\n + - * / ( )\";\n    if (!validNums(input)) return \"Wrong numbers used, try again.\";\n    var calc = validEval(input);\n    if (typeof calc !== 'number') return \"That is not a valid input; please try again.\";\n    if (calc !== 24) return \"Wrong answer: \" + String(calc) + \"; please try again.\";\n    return input + \" == 24.  Congratulations!\";\n};\n\n// I/O below.\n\nwhile (true) {\n    var numbers = [1, 2, 3, 4].map(function() {\n        return Math.floor(Math.random() * 8 + 1);\n    });\n\n    var input = prompt(\n        \"Your numbers are:\\n\" + numbers.join(\" \") +\n        \"\\nEnter expression. (use only + - * / and parens).\\n\", +\"'x' to exit.\", \"\");\n\n    if (input === 'x') {\n        break;\n    }\n    alert(twentyfour(numbers, input));\n}\n",
        "safe": true
    },
    {
        "filename": "24_game_82.txt",
        "content": "### The MRG32k3a combined recursive PRNG - see above\nimport \"MRG32k3a\" as MRG {search: \".\"};\n\n### Generic utilities\ndef sum(stream): reduce stream as $x (0; .+$x);\n\n# like while/2 but emit the final term rather than the first one\ndef whilst(cond; update):\n  def _whilst:\n    if cond then update | (., _whilst) else empty end;\n  _whilst;\n\n### Reverse Polish Notation\n# An array of the allowed operators\ndef operators: \"+-*/\" | split(\"\");\n\n# If $a and $b are numbers and $c an operator, then \"$a $b $c\" is evaluated as an RPN expression.\n# Output: {emit, result} with .emit == null if there is a valid result.\ndef applyOperator($a; $b; $c):\n  if ([$a,$b] | map(type) | unique) == [\"number\"] \n  then\n    if   $c == \"+\" then   {result: ($a + $b)}\n    elif $c == \"-\" then   {result: ($a - $b)}\n    elif $c == \"*\" then   {result: ($a * $b)}\n    elif ($c == \"/\") then {result: ($b / $a)}\n    else {emit: \"unrecognized operator: \\($c)\"}\n    end\n  else {emit: \"invalid number\"}\n  end;\n\n# Input: an array representing an RPN expression.\n# Output: {emit, result} as per applyOperator/3\n# Example: [1,2,3,\"+\",\"+\"] | evaluate #=> 6\ndef evaluate:\n  if length == 1\n  then if .[0]|type == \"number\" then {result: .[0]}\n       else {emit: \"invalid RPN expression\"}\n       end\n  elif length < 3 then {emit: \"invalid RPN expression: \\(. | join(\" \"))\"}\n  else . as $in\n  | (first( range(0; length) as $i | select(any( operators[]; . == $in[$i]) ) | $i) // null) as $ix\n  | if $ix == null then {emit: \"invalid RPN expression\"}\n    else applyOperator(.[$ix-2]; .[$ix-1]; .[$ix]) as $result\n    | if $result.result then .[:$ix-2] + [$result.result] + .[$ix+1:] | evaluate\n      else $result\n      end\n    end\n  end;\n\n### The \"24 Game\"\n\n# . is the putative RPN string to be checked.\n# $four is the string of the four expected digits, in order.\n# Output: {emit, result} with .emit set to \"Correct!\" if .result == 24\ndef check($four):\n  if (gsub(\"[^1-9]\";\"\") | explode | sort | implode)\u00a0!= $four\n  then {emit: \"You must use each of the four digits \\($four | split(\"\") | join(\" \")) exactly once:\"}\n  else . as $in\n        | {s: [], emit: null}\n        | [$in | split(\"\")[] | select(.\u00a0!= \" \")\n           | . as $in | explode[0] | if . >= 48 and . <= 57 then . - 48 else $in end]\n        | evaluate\n        | if .result\n          then if .result|round == 24 then .emit = \"Correct!\"\n               else .emit = \"Value \\(.result) is not 24.\" \n               end\n          else .emit += \"\\nTry again, or enter . to start again, or q to quit.\"\n          end\n   end\u00a0;\n\ndef run:\n  # Populate .digits with four non-negative digits selected at random, with replacement:\n  {digits: (9 | MRG::prn(4) | map(. + 1))}\n  | (.digits | sort | join(\"\")) as $four\n  | \"At the prompt, enter an RPN string (e.g. 64*1+1-), or . for a new set of four digits, or q to quit.\",\n    \"Make 24 using these digits, once each, in any order: \\(.digits):\",\n    ( whilst( .stop | not;\n         .emit = null\n         | . as $state\n         | try input catch halt\n         | if IN( \"q\", \"quit\") then halt\n           elif . == \".\" then $state | .stop = true\n           else check($four)\n           | if .result then .stop = true end\n           end )\n     | select(.emit).emit ),\n       # rerun\n       run;\n\nrun",
        "safe": true
    },
    {
        "filename": "24_game_83.txt",
        "content": "$ jq -nRr -f 24-game.jq \nAt the prompt, enter an RPN string (e.g. 64*1+1-), or . for a new set of four digits, or q to quit.\nMake 24 using these digits, once each, in any order: [7,7,6,8]:\n7768+++\nValue 28 is not 24.\nAt the prompt, enter an RPN string (e.g. 64*1+1-), or . for a new set of four digits, or q to quit.\nMake 24 using these digits, once each, in any order: [7,8,6,8]:\n.\nAt the prompt, enter an RPN string (e.g. 64*1+1-), or . for a new set of four digits, or q to quit.\nMake 24 using these digits, once each, in any order: [7,2,1,8]:\n82*71++\nCorrect!\nAt the prompt, enter an RPN string (e.g. 64*1+1-), or . for a new set of four digits, or q to quit.\nMake 24 using these digits, once each, in any order: [6,4,2,6]:\nq\n$\n",
        "safe": true
    },
    {
        "filename": "24_game_84.txt",
        "content": "validexpr(ex::Expr) = ex.head == :call && ex.args[1] in [:*,:/,:+,:-] && all(validexpr, ex.args[2:end])\nvalidexpr(ex::Int) = true\nvalidexpr(ex::Any) = false\nfindnumbers(ex::Number) = Int[ex]\nfindnumbers(ex::Expr) = vcat(map(findnumbers, ex.args)...)\nfindnumbers(ex::Any) = Int[]\nfunction twentyfour()\n    digits = sort!(rand(1:9, 4))\n    while true\n        print(\"enter expression using $digits => \")\n        ex = parse(readline())\n        try\n            validexpr(ex) || error(\"only *, /, +, - of integers is allowed\")\n            nums = sort!(findnumbers(ex))\n            nums == digits || error(\"expression $ex used numbers $nums\u00a0!= $digits\")\n            val = eval(ex)\n            val == 24 || error(\"expression $ex evaluated to $val, not 24\")\n            println(\"you won!\")\n            return\n        catch e\n            if isa(e, ErrorException)\n                println(\"incorrect: \", e.msg)\n            else\n                rethrow()\n            end\n        end\n    end\nend\n",
        "safe": true
    },
    {
        "filename": "24_game_85.txt",
        "content": "julia> twentyfour()\nenter expression using [2,5,8,9] => 5 * 2 - 8 + 9\nincorrect: expression (5 * 2 - 8) + 9 evaluated to 11, not 24\nenter expression using [2,5,8,9] => 5 * 5 + 2 + 8 - 9\nincorrect: expression (5 * 5 + 2 + 8) - 9 used numbers [2,5,5,8,9]\u00a0!= [2,5,8,9]\nenter expression using [2,5,8,9] => 8*2*2\nincorrect: expression 8 * 2 * 2 used numbers [2,2,8]\u00a0!= [2,5,8,9]\nenter expression using [2,5,8,9] => (8 + 9) + (5 + 2)\nyou won!",
        "safe": true
    },
    {
        "filename": "24_game_86.txt",
        "content": "import std/num/random\nimport std/os/readline\n\ntype expr\n  Num(i: int)\n  Add(e1: expr, e2: expr)\n  Sub(e1: expr, e2: expr)\n  Mul(e1: expr, e2: expr)\n  Div(e1: expr, e2: expr)\n\nfun genNum()\n  random-int() % 9 + 1\n\nfun parseFact(s: string): <div,exn> (expr, string)\n  match s.head\n    \"(\" -> \n      val (e, rest) = s.tail.parseExpr()\n      match rest.head\n        \")\" -> (e, rest.tail)\n        _ -> throw(\"expected ')'\")\n    x | x.head-char.default('_').is-digit -> (Num(x.parse-int.unjust), s.tail)\n    _ -> throw(\"No factor\")\n\nfun parseTerm(s): <div,exn> (expr, string)\n  val (e', n) = s.parseFact()\n  match n.head\n    \"*\" -> \n      val (e'', n') = n.tail.parseTerm()\n      (Mul(e', e''), n')\n    \"/\" ->\n      val (e'', n') = n.tail.parseTerm()\n      (Div(e', e''), n')\n    _ -> (e', n)\n\nfun parseExpr(s): <div,exn> (expr, string)\n  val (e', n) = s.parseTerm()\n  match n.head\n    \"+\" -> \n      val (e'', n') = n.tail.parseExpr()\n      (Add(e', e''), n')\n    \"-\" ->\n      val (e'', n') = n.tail.parseExpr()\n      (Sub(e', e''), n')\n    _ -> (e', n)\n\nfun numbers(e: expr): div list<int>\n  match e\n    Num(i) -> [i]\n    Add(e1, e2) -> numbers(e1) ++ numbers(e2)\n    Sub(e1, e2) -> numbers(e1) ++ numbers(e2)\n    Mul(e1, e2) -> numbers(e1) ++ numbers(e2)\n    Div(e1, e2) -> numbers(e1) ++ numbers(e2)\n\nfun check(e: expr, l: list<int>): <div,exn> ()\n  val ns = numbers(e)\n  if (ns.length == 4) then\n    if l.all(fn(n) ns.any(fn(x) x == n)) then\n      ()\n    else\n      throw(\"wrong numbers\")\n  else\n    throw(\"wrong number of numbers\")\n\nfun evaluate(e: expr): float64\n  match e\n    Num(i) -> i.float64\n    Add(e1, e2) -> evaluate(e1) + evaluate(e2)\n    Sub(e1, e2) -> evaluate(e1) - evaluate(e2)\n    Mul(e1, e2) -> evaluate(e1) * evaluate(e2)\n    Div(e1, e2) -> evaluate(e1) / evaluate(e2)\n\nfun main()\n  println(\"\\nGoal: \")\n  println(\"- Create an expression that evaluates to 24\")\n  println(\"- Using the four given numbers each number once\")\n  println(\"- Using the operators (+-/*) with no spaces\")\n  println(\"Example 2 3 4 1: (2+3)*4*1\\n\")\n  println(\"Here are your numbers!\")\n  var l: list<int> := Nil\n  repeat(4) fn()\n    val n = genNum()\n    l := Cons(n, l)\n    (n.show ++ \" \").print\n  println(\"\")\n  var found := False\n  while { !found } fn()\n    val (expr, r) = readline().parseExpr()\n    if r.count > 0 then\n      println(\"Expected EOF but got: \" ++ r ++ \" please try again\")\n      return ()\n    expr.check(l)\n    val result = expr.evaluate()\n    if result == 24.0 then\n      println(\"You got it!\")\n      found := True\n    else\n      println(\"Try again, your expression evaluated to: \" ++ result.show)\n",
        "safe": true
    },
    {
        "filename": "24_game_87.txt",
        "content": "import java.util.Random\nimport java.util.Scanner\nimport java.util.Stack\n\ninternal object Game24 {\n    fun run() {\n        val r = Random()\n        val digits = IntArray(4).map { r.nextInt(9) + 1 }\n        println(\"Make 24 using these digits: $digits\")\n        print(\"> \")\n\n        val s = Stack<Float>()\n        var total = 0L\n        val cin = Scanner(System.`in`)\n        for (c in cin.nextLine()) {\n            when (c) {\n                in '0'..'9' -> {\n                    val d = c - '0'\n                    total += (1 shl (d * 5)).toLong()\n                    s += d.toFloat()\n                }\n                else ->\n                    if (\"+/-*\".indexOf(c) != -1) {\n                        s += c.applyOperator(s.pop(), s.pop())\n                    }\n            }\n        }\n\n        when {\n            tally(digits) != total ->\n                print(\"Not the same digits. \")\n            s.peek().compareTo(target) == 0 ->\n                println(\"Correct!\")\n            else ->\n                print(\"Not correct.\")\n        }\n    }\n\n    private fun Char.applyOperator(a: Float, b: Float) = when (this) {\n        '+' -> a + b\n        '-' -> b - a\n        '*' -> a * b\n        '/' -> b / a\n        else -> Float.NaN\n    }\n\n    private fun tally(a: List<Int>): Long = a.reduce({ t, i -> t + (1 shl (i * 5)) }).toLong()\n\n    private val target = 24\n}\n\nfun main(args: Array<String>) = Game24.run()\n",
        "safe": true
    },
    {
        "filename": "24_game_88.txt",
        "content": "[\nif(sys_listunboundmethods !>> 'randoms') => {\n\tdefine randoms()::array => {\n\t\tlocal(out = array)\n\t\tloop(4) => { #out->insert(math_random(9,1)) }\n\t\treturn #out\n\t}\n}\nif(sys_listunboundmethods !>> 'checkvalid') => {\n\tdefine checkvalid(str::string, nums::array)::boolean => {\n\t\tlocal(chk = array('*','/','+','-','(',')',' '), chknums = array, lastintpos = -1, poscounter = 0)\n\t\tloop(9) => { #chk->insert(loop_count) }\n\t\twith s in #str->values do => {\n\t\t\t#poscounter++\n\t\t\t#chk !>> #s && #chk !>> integer(#s) ? return false\n\t\t\tinteger(#s) > 0 && #lastintpos + 1 >= #poscounter ? return false\n\t\t\tinteger(#s) > 0 ? #chknums->insert(integer(#s))\n\t\t\tinteger(#s) > 0 ? #lastintpos = #poscounter\n\t\t}\n\t\t#chknums->size != 4 ? return false\n\t\t#nums->sort\n\t\t#chknums->sort\n\t\tloop(4) => { #nums->get(loop_count) != #chknums(loop_count) ? return false }\n\t\treturn true\n\t}\n}\nif(sys_listunboundmethods !>> 'executeexpr') => {\n\tdefine executeexpr(expr::string)::integer => {\n\t\tlocal(keep = string)\n\t\twith i in #expr->values do => {\n\t\t\tif(array('*','/','+','-','(',')') >> #i) => {\n\t\t\t\t#keep->append(#i)\n\t\t\telse\n\t\t\t\tinteger(#i) > 0 ? #keep->append(decimal(#i))\n\t\t\t}\n\t\t}\n\t\treturn integer(sourcefile('['+#keep+']','24game',true,true)->invoke)\n\t}\n}\n\nlocal(numbers = array, exprsafe = true, exprcorrect = false, exprresult = 0)\nif(web_request->param('nums')->asString->size) => {\n\twith n in web_request->param('nums')->asString->split(',') do => { #numbers->insert(integer(#n->trim&)) }\n}\n#numbers->size != 4 ? #numbers = randoms()\nif(web_request->param('nums')->asString->size) => {\n\t#exprsafe = checkvalid(web_request->param('expr')->asString,#numbers)\n\tif(#exprsafe) => {\n\t\t#exprresult = executeexpr(web_request->param('expr')->asString)\n\t\t#exprresult == 24 ? #exprcorrect = true\n\t}\n}\n\n]<h1>24 Game</h1>\n<p><b>Rules:</b><br>\nEnter an expression that evaluates to 24</p>\n<ul>\n<li>Only multiplication, division, addition, and subtraction operators/functions are allowed.</li>\n<li>Brackets are allowed.</li>\n<li>Forming multiple digit numbers from the supplied digits is disallowed. (So an answer of 12+12 when given 1, 2, 2, and 1 is wrong).</li>\n<li>The order of the digits when given does not have to be preserved.</li>\n</ul>\n\n<h2>Numbers</h2>\n<p>[#numbers->join(', ')] (<a href=\"?\">Reload</a>)</p>\n[!#exprsafe ? '<p>Please provide a valid expression</p>']\n<form><input type=\"hidden\" value=\"[#numbers->join(',')]\" name=\"nums\"><input type=\"text\" name=\"expr\" value=\"[web_request->param('expr')->asString]\"><input type=\"submit\" name=\"submit\" value=\"submit\"></form>\n[if(#exprsafe)]\n<p>Result: <b>[#exprresult]</b> [#exprcorrect ? 'is CORRECT!' | 'is incorrect']</p>\n[/if]\n",
        "safe": true
    },
    {
        "filename": "24_game_89.txt",
        "content": "dim d(4)\ndim chk(4)\nprint \"The 24 Game\"\nprint\nprint \"Given four digits and using just the +, -, *, and / operators; and the\"\nprint \"possible use of brackets, (), enter an expression that equates to 24.\"\n\ndo\n    d$=\"\"\n    for i = 1 to 4\n        d(i)=int(rnd(1)*9)+1    '1..9\n        chk(i)=d(i)\n        d$=d$;d(i)  'valid digits, to check with Instr\n    next\n\n    print\n    print \"These are your four digits: \";\n    for i = 1 to 4\n        print d(i);left$(\",\",i<>4);\n    next\n    print\n\n    Print \"Enter expression:\"\n    Input \"24 = \";expr$\n    'check expr$ for validity\n\n    'check right digits used\n    failed = 0\n    for i = 1 to len(expr$)\n        c$=mid$(expr$,i,1)\n        if instr(\"123456789\", c$)<>0 then 'digit\n            if instr(d$, c$)=0 then failed = 1: exit for\n            if i>1 and instr(\"123456789\", mid$(expr$,i-1,1))<>0 then failed = 2: exit for\n            for j =1 to 4\n                if chk(j)=val(c$) then chk(j)=0: exit for\n            next\n        end if\n    next\n    if failed=1 then\n        print \"Wrong digit (\";c$;\")\"\n        goto [fail]\n    end if\n\n    if failed=2 then\n        print \"Multiple digit numbers is disallowed.\"\n        goto [fail]\n    end if\n\n    'check all digits used\n    if chk(1)+ chk(2)+ chk(3)+ chk(4)<>0 then\n        print \"Not all digits used\"\n        goto [fail]\n    end if\n\n    'check valid operations\n    failed = 0\n    for i = 1 to len(expr$)\n        c$=mid$(expr$,i,1)\n        if instr(\"+-*/()\"+d$, c$)=0 then failed = 1: exit for\n    next\n    if failed then\n        print \"Wrong operation (\";c$;\")\"\n        goto [fail]\n    end if\n    'some errors (like brackets) trapped by error handler\n    Err$=\"\"\n    res=evalWithErrCheck(expr$)\n    if Err$<>\"\" then\n        print \"Error in expression\"\n        goto [fail]\n    end if\n    if res = 24 then\n        print \"Correct!\"\n    else\n        print \"Wrong! (you got \";res\u00a0;\")\"\n    end if\n[fail]\n    Input \"Play again (y/n)? \"; ans$\nloop while ans$=\"y\"\nend\n\nfunction evalWithErrCheck(expr$)\n    on error goto [handler]\n    evalWithErrCheck=eval(expr$)\n    exit function\n[handler]\nend function",
        "safe": true
    },
    {
        "filename": "24_game_9.txt",
        "content": "      tfgame 4\n6 9 4 5\n6+9+4+5\nYeah!\n\n      tfgame 6\n4 9 7 9 1 1\nUmmm... I'm too tired.\nnope\n",
        "safe": true
    },
    {
        "filename": "24_game_90.txt",
        "content": "on mouseUp\n    put empty into fld \"EvalField\"\n    put empty into fld \"AnswerField\"\n    put random(9) & comma & random(9) & comma & random(9) & comma & random(9) into fld \"YourNumbersField\"\nend mouseUp",
        "safe": true
    },
    {
        "filename": "24_game_91.txt",
        "content": "on keyDown k\n    local ops, nums, allowedKeys, numsCopy, expr\n    put \"+,-,/,*,(,)\" into ops\n    put the text of fld \"YourNumbersField\" into nums\n    put the text of fld \"EvalField\" into expr\n    if matchText(expr & k,\"\\d\\d\") then \n        answer \"You can't enter 2 digits together\"\n        exit keyDown\n    end if\n    repeat with n = 1 to the number of chars of expr\n        if offset(char n of expr, nums) > 0 then\n            delete char offset(char n of expr, nums) of nums\n        end if\n    end repeat\n    put ops & comma & nums into allowedKeys\n    if k is among the items of allowedKeys then\n        put k after expr\n        delete char offset(k, nums) of nums\n        replace comma with empty in nums\n        try\n            put the value of merge(\"[[expr]]\") into fld \"AnswerField\"\n            if the value of fld \"AnswerField\" is 24 and nums is empty then\n                answer \"You win!\"\n            end if\n        end try\n        pass keyDown\n    else\n        exit keyDown\n    end if\nend keyDown",
        "safe": true
    },
    {
        "filename": "24_game_92.txt",
        "content": "10 CLS:RANDOMIZE TIME\n20 PRINT \"The 24 Game\"\n30 PRINT \"===========\":PRINT\n40 PRINT \"Enter an arithmetic expression\"\n50 PRINT \"that evaluates to 24,\"\n60 PRINT \"using only the provided digits\"\n70 PRINT \"and +, -, *, /, (, ).\"\n80 PRINT \"(Just hit Return for new digits.)\"\n90 ' create new digits\n100 FOR i=1 TO 4:a(i)=INT(RND*9)+1:NEXT\n110 PRINT\n120 PRINT \"The digits are\";a(1);a(2);a(3);a(4)\n130 PRINT\n140 ' user enters solution\n150 INPUT \"Your solution\";s$\n160 IF s$=\"\" THEN PRINT \"Creating new digits...\":GOTO 100\n170 GOTO 300\n180 ' a little hack to create something like an EVAL function\n190 OPENOUT \"exp.bas\"\n200 PRINT #9,\"1000 x=\"s$\":return\"\n210 CLOSEOUT\n220 CHAIN MERGE \"exp\",240\n230 ' now evaluate the expression\n240 ON ERROR GOTO 530\n250 GOSUB 1000\n260 IF x=24 THEN PRINT \"Well done!\":END\n270 PRINT \"No, this evaluates to\"x:PRINT \"Please try again.\"\n280 GOTO 150\n290 ' check input for correctness\n300 FOR i=1 TO LEN(s$)\n310 q=ASC(MID$(s$,i,1))\n320 IF q=32 OR (q>39 AND q<44) OR q=45 OR (q>46 AND q<58) THEN NEXT\n330 IF i-1=LEN(s$) THEN 370\n340 PRINT \"Bad character in expression:\"CHR$(q)\n350 PRINT \"Try again\":GOTO 150\n360 ' new numbers in solution?\n370 FOR i=1 TO LEN(s$)-1\n380 q=ASC(MID$(s$,i,1)):p=ASC(MID$(s$,i+1,1))\n390 IF q>47 AND q<58 AND p>47 AND p<58 THEN PRINT \"No forming of new numbers, please!\":GOTO 150\n400 NEXT\n410 FOR i=1 TO 9:orig(i)=0:guess(i)=0:NEXT\n420 FOR i=1 TO 4:orig(a(i))=orig(a(i))+1:NEXT\n430 FOR i=1 TO LEN(s$)\n440 v$=MID$(s$,i,1)\n450 va=ASC(v$)-48\n460 IF va>0 AND va<10 THEN guess(va)=guess(va)+1\n470 NEXT\n480 FOR i=1 TO 9\n490 IF guess(i)<>orig(i) THEN PRINT \"Only use all the provided digits!\":GOTO 150\n500 NEXT\n510 GOTO 190\n520 ' syntax error, e.g. non-matching parentheses\n530 PRINT \"Error in expression, please try again.\"\n540 RESUME 150\n",
        "safe": true
    },
    {
        "filename": "24_game_93.txt",
        "content": "; useful constants\nmake \"false 1=0\nmake \"true  1=1\nmake \"lf char 10\nmake \"sp char 32\n\n; non-digits legal in expression\nmake \"operators (lput sp [+ - * / \\( \\)])\n\n; display help message\nto show_help :digits\n  type lf\n  print sentence quoted [Using only these digits:] :digits \n  print sentence quoted [and these operators:] [* / + -]\n  print quoted [\\(and parentheses as needed\\),]\n  print quoted [enter an arithmetic expression \n     which evaluates to exactly 24.]\n  type lf\n  print quoted [Enter \\\"!\\\" to get fresh numbers.]\n  print quoted [Enter \\\"q\\\" to quit.]\n  type lf\nend\n\nmake \"digits []\nmake \"done false\nuntil [done] [\n\n  if empty? digits [\n    make \"digits (map [(random 9) + 1] [1 2 3 4])\n  ]\n\n  (type \"Solution sp \"for sp digits \"? sp )\n  make \"expression readrawline\n\n  ifelse [expression = \"?] [\n\n    show_help digits\n\n  ] [ifelse [expression = \"q] [\n\n    print \"Bye!\n    make \"done true\n\n  ] [ifelse [expression = \"!] [\n\n    make \"digits []\n\n  ] [\n    make \"exprchars ` expression\n    make \"allowed (sentence digits operators)\n\n    ifelse (member? false (map [[c] member? c allowed] exprchars)) [\n      (print quoted [Illegal character in input.])\n    ] [\n      catch \"error [\n        make \"syntax_error true\n        make \"testval (run expression)\n        make \"syntax_error false\n      ]\n      ifelse syntax_error [\n        (print quoted [Invalid expression.])\n      ] [\n        ifelse (testval = 24) [\n          print quoted [You win!]\n          make \"done true\n        ] [\n          (print (sentence \n            quoted [Incorrect \\(got ] testval quoted [instead of 24\\).]))\n        ]\n      ]\n    ]\n  ]]]\n] \nbye",
        "safe": true
    },
    {
        "filename": "24_game_94.txt",
        "content": "Solution for 3 8 9 5?\u00a0?\n\nUsing only these digits: 3 8 9 5\nand these operators: * / + -\n(and parentheses as needed),\nenter an arithmetic expression which evaluates to exactly 24.\n\nEnter \"!\" to get fresh numbers.\nEnter \"q\" to quit.\n\nSolution for 3 8 9 5?\u00a0!\nSolution for 9 2 8 5? 9+2+8+5\nYou win!\n",
        "safe": true
    },
    {
        "filename": "24_game_95.txt",
        "content": "local function help()\n\tprint [[\n The 24 Game\n\n Given any four digits in the range 1 to 9, which may have repetitions,\n Using just the +, -, *, and / operators; and the possible use of\n brackets, (), show how to make an answer of 24.\n\n An answer of \"q\" will quit the game.\n An answer of \"!\" will generate a new set of four digits.\n\n Note: you cannot form multiple digit numbers from the supplied digits,\n so an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\n\n ]]\nend\n\nlocal function generate(n)\n\tresult = {}\n\tfor i=1,n do\n\t\tresult[i] = math.random(1,9)\n\tend\n\treturn result\nend\n\nlocal function check(answer, digits)\n\tlocal adig = {}\n\tlocal ddig = {}\n\tlocal index\n\tlocal lastWasDigit = false\n\tfor i=1,9 do adig[i] = 0 ddig[i] = 0 end\n\tallowed = {['(']=true,[')']=true,[' ']=true,['+']=true,['-']=true,['*']=true,['/']=true,['\\t']=true,['1']=true,['2']=true,['3']=true,['4']=true,['5']=true,['6']=true,['7']=true,['8']=true,['9']=true}\n\tfor i=1,string.len(answer) do\n\t\tif not allowed[string.sub(answer,i,i)] then\n\t\t\treturn false\n\t\tend\n\t\tindex = string.byte(answer,i)-48\n\t\tif index > 0 and index < 10 then\n\t\t\tif lastWasDigit then\n\t\t\t\treturn false\n\t\t\tend\n\t\t\tlastWasDigit = true\n\t\t\tadig[index] = adig[index] + 1\n\t\telse\n\t\t\tlastWasDigit = false\n\t\tend\n\tend\n\tfor i,digit in next,digits do\n\t\tddig[digit] = ddig[digit]+1\n\tend\n\tfor i=1,9 do\n\t\tif adig[i] ~= ddig[i] then\n\t\t\treturn false\n\t\tend\n\tend\n\treturn loadstring('return '..answer)()\nend\n\nlocal function game24()\n\thelp()\n\tmath.randomseed(os.time())\n\tmath.random()\n\tlocal digits = generate(4)\n\tlocal trial = 0\n\tlocal answer = 0\n\tlocal ans = false\n\tio.write 'Your four digits:'\n\tfor i,digit in next,digits do\n\t\tio.write (' ' .. digit)\n\tend\n\tprint()\n\twhile ans ~= 24 do\n\t\ttrial = trial + 1\n\t\tio.write(\"Expression \"..trial..\": \")\n\t\tanswer = io.read()\n\t\tif string.lower(answer) == 'q' then\n\t\t\tbreak\n\t\tend\n\t\tif answer == '!' then\n\t\t\tdigits = generate(4)\n\t\t\tio.write (\"New digits:\")\n\t\t\tfor i,digit in next,digits do\n\t\t\t\tio.write (' ' .. digit)\n\t\t\tend\n\t\t\tprint()\n\t\telse\n\t\t\tans = check(answer,digits)\n\t\t\tif ans == false then\n\t\t\t\tprint ('The input '.. answer ..' was wonky!')\n\t\t\telse\n\t\t\t\tprint (' = '.. ans)\n\t\t\t\tif ans == 24 then\n\t\t\t\t\tprint (\"Thats right!\")\n\t\t\t\tend\n\t\t\tend\n\t\tend\n\tend\nend\ngame24()\n",
        "safe": true
    },
    {
        "filename": "24_game_96.txt",
        "content": "function twentyfour()\n   print [[\n The 24 Game\n \n Given any four digits in the range 1 to 9, which may have repetitions,\n Using just the +, -, *, and / operators; and the possible use of\n brackets, (), show how to make an answer of 24.\n \n An answer of \"q\" will quit the game.\n An answer of \"!\" will generate a new set of four digits.\n \n Note: you cannot form multiple digit numbers from the supplied digits,\n so an answer of 12+12 when given 1, 2, 2, and 1 would not be allowed.\n \n ]]\n   expr = re.compile[[   --matches properly formatted infix expressions and returns all numerals as captures\n         expr <- (!.) / (<paren> / <number>) (<ws> <oper> <ws> <expr>)?\n         number <- {[0-9]}\n         ws <- \" \"*\n         oper <- [-+/*]\n         paren <- \"(\" <ws> <expr> <ws> \")\"   ]]\n   local val_t = {math.random(9), math.random(9), math.random(9), math.random(9)}\n   table.sort(val_t)\n   print(\"the digits are \" .. table.concat(val_t, \", \"))\n   local ex = io.read()\n   a, b, c, d, e = expr:match(ex)\n   if a and b and c and d and not e then --if there is a fifth numeral the player is cheating\n      local digs = {a + 0, b + 0, c + 0, d + 0}\n      local flag = false -- (terrorism!)\n      table.sort(digs)\n      for i = 1, 4 do\n\t   flag = digs[i] ~= val_t[i] and not print\"Wrong digits!\" or flag\n      end\n      if not flag and loadstring(\"return \" .. ex)() == 24 then\n         print\"You win!\"\n      else\n         print\"You lose.\"\n      end\n   else print\"wat\" --expression could not be interpreted as arithmetic\n   end\nend\ntwentyfour()\n",
        "safe": true
    },
    {
        "filename": "24_game_97.txt",
        "content": "play24\u00a0:= module()\n\texport ModuleApply;\n\tlocal cheating;\n\tcheating\u00a0:= proc(input, digits)\n\t\tlocal i, j, stringDigits;\n\t\tuse StringTools in\n\t\t\tstringDigits\u00a0:= Implode([seq(convert(i, string), i in digits)]);\n\t\t\tfor i in digits do\n\t\t\t\tfor j in digits do\n\t\t\t\t\tif Search(cat(convert(i, string), j), input) > 0 then\n\t\t\t\t\t\treturn true, \": Please don't combine digits to form another number.\"\n\t\t\t\t\tend if;\n\t\t\t\tend do;\n\t\t\tend do;\n\t\t\tfor i in digits do\n\t\t\t\tif CountCharacterOccurrences(input, convert(i, string)) < CountCharacterOccurrences(stringDigits, convert(i, string)) then\n\t\t\t\t\treturn true, \": Please use all digits.\";\n\t\t\t\tend if;\n\t\t\tend do;\n\t\t\tfor i in digits do\n\t\t\t\tif CountCharacterOccurrences(input, convert(i, string)) > CountCharacterOccurrences(stringDigits, convert(i, string)) then\n\t\t\t\t\treturn true, \": Please only use a digit once.\";\n\t\t\t\tend if;\n\t\t\tend do;\n\t\t\tfor i in input do\n\t\t\t\ttry\n\t\t\t\t\tif type(parse(i), numeric) and not member(parse(i), digits) then\n\t\t\t\t\t\treturn true, \": Please only use the digits you were given.\";\n\t\t\t\t\tend if;\n\t\t\t\tcatch:\n\t\t\t\tend try;\n\t\t\tend do;\n\t\t\treturn false, \"\";\n\t\tend use;\n\tend proc:\n\t\n\tModuleApply\u00a0:= proc()\n\t\tlocal replay, digits, err, message, answer;\n\t\trandomize():\n\t\treplay\u00a0:= \"\":\n\t\twhile not replay = \"END\" do\n\t\t\tif not replay = \"YES\" then\n\t\t\t\tdigits\u00a0:= [seq(rand(1..9)(), i = 1..4)]:\n\t\t\tend if;\n\t\t\terr\u00a0:= true:\n\t\t\twhile err do\n\t\t\t\tmessage\u00a0:= \"\";\n\t\t\t\tprintf(\"Please make 24 from the digits: %a. Press enter for a new set of numbers or type END to quit\\n\", digits);\n\t\t\t\tanswer\u00a0:= StringTools[UpperCase](readline());\n\t\t\t\tif not answer = \"\" and not answer = \"END\" then\n\t\t\t\t\ttry\n\t\t\t\t\t\tif not type(parse(answer), numeric) then\n\t\t\t\t\t\t\terror;\n\t\t\t\t\t\telif cheating(answer, digits)[1] then\n\t\t\t\t\t\t\tmessage\u00a0:= cheating(answer, digits)[2];\n\t\t\t\t\t\t\terror;\n\t\t\t\t\t\tend if;\n\t\t\t\t\t\terr\u00a0:= false;\n\t\t\t\t\tcatch:\n\t\t\t\t\t\tprintf(\"Invalid Input%s\\n\\n\", message);\n\t\t\t\t\tend try;\n\t\t\t\telse\n\t\t\t\t\terr\u00a0:= false;\n\t\t\t\tend if;\n\t\t\tend do:\n\t\t\tif not answer = \"\" and not answer = \"END\" then\n\t\t\t\tif parse(answer) = 24 then\n\t\t\t\t\tprintf(\"You win! Do you wish to play another game? (Press enter for a new set of numbers or END to quit.)\\n\");\n\t\t\t\t\treplay\u00a0:= StringTools[UpperCase](readline());\n\t\t\t\telse \n\t\t\t\t\tprintf(\"Your expression evaluated to %a. Try again!\\n\", parse(answer));\n\t\t\t\t\treplay\u00a0:= \"YES\";\n\t\t\t\tend if;\n\t\t\telse\n\t\t\t\treplay\u00a0:= answer;\n\t\t\tend if;\n\t\t\t\n\t\t\tprintf(\"\\n\");\n\t\tend do:\n\t\tprintf(\"GAME OVER\\n\");\n\tend proc:\nend module:\n\nplay24();",
        "safe": true
    },
    {
        "filename": "24_game_98.txt",
        "content": "Please make 24 from the digits: [4, 7, 6, 8]. Press enter for a new set of numbers or type END to quit\nYou win! Do you wish to play another game? (Press enter for a new set of numbers or END to quit.)\n\nPlease make 24 from the digits: [3, 7, 4, 7]. Press enter for a new set of numbers or type END to quit\nYour expression evaluated to 21. Try again!\n\nPlease make 24 from the digits: [3, 7, 4, 7]. Press enter for a new set of numbers or type END to quit\n\nGAME OVER\n",
        "safe": true
    },
    {
        "filename": "24_game_99.txt",
        "content": "isLegal[n_List, x_String] := \n Quiet[Check[\n   With[{h = ToExpression[x, StandardForm, HoldForm]}, \n    If[Cases[Level[h, {2, \\[Infinity]}, Hold, Heads -> True], \n        Except[_Integer | Plus | _Plus | Times | _Times | Power | \n          Power[_, -1]]] === {} && \n      Sort[Level[h /. Power[q_, -1] -> q, {-1}] /. \n         q_Integer -> Abs[q]] === Sort[n], ReleaseHold[h]]], Null]]\nGrid[{{Button[\n    \"new numbers\", {a, b, c, d} = Table[RandomInteger[{1, 9}], {4}]], \n   InputField[Dynamic[x], String]}, {Dynamic[{a, b, c, d}], \n   Dynamic[Switch[isLegal[{a, b, c, d}, x], Null, \n     \"Sorry, that is invalid.\", 24, \"Congrats! That's 24!\", _, \n     \"Sorry, that makes \" <> ToString[ToExpression@x, InputForm] <> \n      \", not 24.\"]]}}]\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_1.txt",
        "content": "            \u2554\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2557      \u2554\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2557\n            \u2551              \u2551      \u2551              \u2551\n            \u2551      a       \u2551      \u2551      e       \u2551\n            \u2551              \u2551      \u2551              \u2551\n            \u2551          \u250c\u2500\u2500\u2500\u256b\u2500\u2500\u2500\u2500\u2500\u2500\u256b\u2500\u2500\u2500\u2510      \u250c\u2500\u2500\u2500\u256b\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2510\n            \u2551          \u2502   \u2551      \u2551   \u2502      \u2502   \u2551         \u2502\n            \u2551          \u2502 b \u2551      \u2551 d \u2502      \u2502 f \u2551         \u2502\n            \u2551          \u2502   \u2551      \u2551   \u2502      \u2502   \u2551         \u2502\n            \u2551          \u2502   \u2551      \u2551   \u2502      \u2502   \u2551         \u2502\n            \u255a\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u2550\u256a\u2550\u2550\u2550\u255d      \u255a\u2550\u2550\u2550\u256a\u2550\u2550\u2550\u2550\u2550\u2550\u256a\u2550\u2550\u2550\u255d         \u2502\n                       \u2502       c      \u2502      \u2502      g      \u2502\n                       \u2502              \u2502      \u2502             \u2502\n                       \u2502              \u2502      \u2502             \u2502\n                       \u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2518      \u2514\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2518\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_10.txt",
        "content": " 3 7 2 1 5 4 6\n 4 5 3 1 6 2 7\n 4 7 1 3 2 6 5\n 5 6 2 3 1 7 4\n 6 4 1 5 2 3 7\n 6 4 5 1 2 7 3\n 7 2 6 1 3 5 4\n 7 3 2 5 1 4 6\n8 unique solutions in 1 to 7\n\n 7 8 3 4 5 6 9\n 8 7 3 5 4 6 9\n 9 6 4 5 3 7 8\n 9 6 5 4 3 8 7\n4 unique solutions in 3 to 9\n\n2860 non-unique solutions in 0 to 9\n\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_100.txt",
        "content": "[3, 7, 2, 1, 5, 4, 6]\n[4, 5, 3, 1, 6, 2, 7]\n[4, 7, 1, 3, 2, 6, 5]\n[5, 6, 2, 3, 1, 7, 4]\n[6, 4, 1, 5, 2, 3, 7]\n[6, 4, 5, 1, 2, 7, 3]\n[7, 2, 6, 1, 3, 5, 4]\n[7, 3, 2, 5, 1, 4, 6]\n8 unique solutions in 1 to 7 range\n\n[7, 8, 3, 4, 5, 6, 9]\n[8, 7, 3, 5, 4, 6, 9]\n[9, 6, 4, 5, 3, 7, 8]\n[9, 6, 5, 4, 3, 8, 7]\n4 unique solutions in 3 to 9 range\n\n2860 non-unique solutions in 0 to 9 range",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_101.txt",
        "content": "(* Task\u00a0: 4-rings_or_4-squares_puzzle *)\n\n(*  \n\tReplace a, b, c, d, e, f, and g with the decimal digits LOW \u2500\u2500\u2500\u25ba HIGH\n\tsuch that the sum of the letters inside of each of the four large squares add up to the same sum.\n\n\tSquares are: ab; bcd; def; fg\n\tSolution: brute force from generating a, b, d, g from possible range\n*)\n\n(*** Helpers ***)\n\ntype assignment = {\n\ta: int;\n\tb: int;\n\tc: int;\n\td: int;\n\te: int;\n\tf: int;\n\tg: int;\n}\n\nlet generate ((a, b), (d, g)) =\n\tlet s = a + b in\n\tlet c = s - b - d in\n\tlet f = s - g in\n\tlet e = s - f - d in\n\t{a; b; c; d; e; f; g}\n\nlet list_of_assign assign =\n\t[assign.a; assign.b; assign.c; assign.d; assign.e; assign.f; assign.g]\n\nlet test unique low high assign =\n\tlet l = list_of_assign assign in\n\tlet test_el e = \n\t\te >= low && e <= high && \n\t\t(not unique || (l |> List.filter ((=) e) |> List.length) == 1)\n\tin\n\tList.for_all test_el l\n\nlet generator low high =\n\tlet single () = Seq.ints low |> Seq.take_while (fun x -> x <= high) in\n\tlet first_two = Seq.product (single ()) (single ()) in\n\tlet second_two = Seq.product (single ()) (single ()) in\n\tlet final = Seq.product first_two second_two in\n\tSeq.map generate final\n\nlet print_assign a = \n\tPrintf.printf \"a: %d, b: %d, c: %d, d: %d, e: %d, f: %d, g: %d\\n\"\n\t\ta.a a.b a.c a.d a.e a.f a.g\n\n(*** Actual task at hand ***)\n\nlet evaluate low high unique log =\n\tlet seqs = generator low high |> Seq.filter (test unique low high) in\n\tlet unique_str = if unique then \"unique\" else \"non-unique\" in\n\tif log then Seq.iter print_assign seqs;\n\tPrintf.printf \"%d %s sequences found between %d and %d\\n\\n\" (Seq.length seqs) unique_str low high\n\n(*** Output ***)\n\nlet () =\n\tevaluate 1 7 true true;\n\tevaluate 3 9 true true;\n\tevaluate 0 9 false false\n;;\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_102.txt",
        "content": "a: 7, b: 2, c: 6, d: 1, e: 3, f: 5, g: 4\na: 6, b: 4, c: 5, d: 1, e: 2, f: 7, g: 3\na: 3, b: 7, c: 2, d: 1, e: 5, f: 4, g: 6\na: 4, b: 5, c: 3, d: 1, e: 6, f: 2, g: 7\na: 5, b: 6, c: 2, d: 3, e: 1, f: 7, g: 4\na: 4, b: 7, c: 1, d: 3, e: 2, f: 6, g: 5\na: 7, b: 3, c: 2, d: 5, e: 1, f: 4, g: 6\na: 6, b: 4, c: 1, d: 5, e: 2, f: 3, g: 7\n8 unique sequences found between 1 and 7\n\na: 9, b: 6, c: 5, d: 4, e: 3, f: 8, g: 7\na: 9, b: 6, c: 4, d: 5, e: 3, f: 7, g: 8\na: 7, b: 8, c: 3, d: 4, e: 5, f: 6, g: 9\na: 8, b: 7, c: 3, d: 5, e: 4, f: 6, g: 9\n4 unique sequences found between 3 and 9\n\n2860 non-unique sequences found between 0 and 9\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_103.txt",
        "content": "program square4;\n{$MODE DELPHI}\n{$R+,O+}\nconst\n  LoDgt = 0;\n  HiDgt = 9;\ntype\n  tchkset = set of LoDgt..HiDgt;\n  tSol = record\n           solMin : integer;\n           solDat : array[1..7] of integer;\n         end;\n\nvar\n  sum,a,b,c,d,e,f,g,cnt,uniqueCount : NativeInt;\n  sol : array of tSol;\n\nprocedure SolOut;\nvar\n  i,j,mn: NativeInt;\nBegin\n  mn := 0;\n  repeat\n    writeln(mn:3,' ...',mn+6:3);\n    For i := Low(sol) to High(sol) do\n      with sol[i] do\n        IF solMin = mn then\n        Begin\n          For j := 1 to 7 do\n            write(solDat[j]:3);\n          writeln;\n        end;\n    writeln;\n    inc(mn);\n  until mn > HiDgt-6;\nend;\n\nfunction CheckUnique:Boolean;\nvar\n  i,sum,mn: NativeInt;\n  chkset : tchkset;\n\nBegin\n  chkset:= [];\n  include(chkset,a);include(chkset,b);include(chkset,c);\n  include(chkset,d);include(chkset,e);include(chkset,f);\n  include(chkset,g);\n  sum := 0;\n  For i := LoDgt to HiDgt do\n    IF i in chkset then\n      inc(sum);\n\n  result := sum = 7;\n  IF result then\n  begin\n    inc(uniqueCount);\n    //find the lowest entry\n    mn:= LoDgt;\n    For i := LoDgt to HiDgt do\n      IF i in chkset then\n      Begin\n        mn := i;\n        BREAK;\n      end;\n    // are they consecutive\n    For i := mn+1 to mn+6  do\n      IF NOT(i in chkset) then\n        EXIT;\n\n    setlength(sol,Length(sol)+1);\n    with sol[high(sol)] do\n      Begin\n        solMin:= mn;\n        solDat[1]:= a;solDat[2]:= b;solDat[3]:= c;\n        solDat[4]:= d;solDat[5]:= e;solDat[6]:= f;\n        solDat[7]:= g;\n      end;\n  end;\nend;\n\nBegin\n  cnt := 0;\n  uniqueCount := 0;\n  For a:= LoDgt to HiDgt do\n  Begin\n    For b := LoDgt to HiDgt do\n    Begin\n      sum := a+b;\n      //a+b = b+c+d => a = c+d => d\u00a0:= a-c\n      For c := a-LoDgt downto LoDgt do\n      begin\n        d := a-c;\n        e := sum-d;\n        IF e>HiDgt then\n          e:= HiDgt;\n        For e := e downto LoDgt do\n          begin\n          f := sum-e-d;\n          IF f in [loDGt..Hidgt]then\n          Begin\n            g := sum-f;\n            IF g in [loDGt..Hidgt]then\n            Begin\n              inc(cnt);\n              CheckUnique;\n            end;\n          end;\n        end;\n      end;\n    end;\n  end;\n  SolOut;\n  writeln('       solution count for ',loDgt,' to ',HiDgt,' = ',cnt);\n  writeln('unique solution count for ',loDgt,' to ',HiDgt,' = ',uniqueCount);\nend.\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_104.txt",
        "content": "  0 ...  6\n  4  2  3  1  5  0  6\n  5  1  3  2  4  0  6\n  6  0  5  1  3  2  4\n  6  0  4  2  3  1  5\n\n  1 ...  7\n  3  7  2  1  5  4  6\n  4  5  3  1  6  2  7\n  4  7  1  3  2  6  5\n  5  6  2  3  1  7  4\n  6  4  5  1  2  7  3\n  6  4  1  5  2  3  7\n  7  2  6  1  3  5  4\n  7  3  2  5  1  4  6\n\n  2 ...  8\n  5  7  3  2  6  4  8\n  5  8  3  2  4  7  6\n  5  8  2  3  4  6  7\n  6  7  4  2  3  8  5\n  7  4  5  2  6  3  8\n  7  6  4  3  2  8  5\n  8  3  6  2  5  4  7\n  8  4  6  2  3  7  5\n\n  3 ...  9\n  7  8  3  4  5  6  9\n  8  7  3  5  4  6  9\n  9  6  5  4  3  8  7\n  9  6  4  5  3  7  8\n\n       solution count for 0 to 9 = 2860\nunique solution count for 0 to 9 = 192",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_105.txt",
        "content": "use ntheory qw/forperm/;\nuse Set::CrossProduct;\n\nsub four_sq_permute {\n    my($list) = @_;\n    my @solutions;\n    forperm {\n       @c = @$list[@_];\n       push @solutions, [@c] if check(@c);\n    } @$list;\n    print +@solutions . \" unique solutions found using: \" . join(', ', @$list) . \"\\n\";\n    return @solutions;\n}\n\nsub four_sq_cartesian {\n    my(@list) = @_;\n    my @solutions;\n    my $iterator = Set::CrossProduct->new( [(@list) x 7] );\n    while( my $c = $iterator->get ) {\n       push @solutions, [@$c] if check(@$c);\n    }\n    print +@solutions . \" non-unique solutions found using: \" . join(', ', @{@list[0]}) . \"\\n\";\n    return @solutions;\n}\n\nsub check {\n    my(@c) = @_;\n    $a = $c[0] + $c[1];\n    $b = $c[1] + $c[2] + $c[3];\n    $c = $c[3] + $c[4] + $c[5];\n    $d = $c[5] + $c[6];\n    $a == $b and $a == $c and $a == $d;\n}\n\nsub display {\n    my(@solutions) = @_;\n    my $fmt = \"%2s \" x 7 . \"\\n\";\n    printf $fmt, ('a'..'g');\n    printf $fmt, @$_ for @solutions;\n    print \"\\n\";\n}\n\ndisplay four_sq_permute( [1..7] );\ndisplay four_sq_permute( [3..9] );\ndisplay four_sq_permute( [8, 9, 11, 12, 17, 18, 20, 21] );\nfour_sq_cartesian( [0..9] );\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_106.txt",
        "content": "8 unique solutions found using: 1, 2, 3, 4, 5, 6, 7\n a  b  c  d  e  f  g\n 3  7  2  1  5  4  6\n 4  5  3  1  6  2  7\n 4  7  1  3  2  6  5\n 5  6  2  3  1  7  4\n 6  4  1  5  2  3  7\n 6  4  5  1  2  7  3\n 7  2  6  1  3  5  4\n 7  3  2  5  1  4  6\n\n4 unique solutions found using: 3, 4, 5, 6, 7, 8, 9\n a  b  c  d  e  f  g\n 7  8  3  4  5  6  9\n 8  7  3  5  4  6  9\n 9  6  4  5  3  7  8\n 9  6  5  4  3  8  7\n\n8 unique solutions found using: 8, 9, 11, 12, 17, 18, 20, 21\n a  b  c  d  e  f  g\n17 21  8  9 11 18 20\n17 21  9  8 12 18 20\n20 18  8 12  9 17 21\n20 18 11  9  8 21 17\n20 18 11  9 12 17 21\n20 18 12  8  9 21 17\n21 17  9 12  8 18 20\n21 17 12  9 11 18 20\n\n2860 non-unique solutions found using: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_107.txt",
        "content": "#!/usr/bin/perl\n\nuse strict; # https://rosettacode.org/wiki/4-rings_or_4-squares_puzzle\nuse warnings;\n\nfor ( [1 .. 7], [3 .. 9] )\n  {\n  print \"for @$_\\n\\n\";\n  findunique( $_ );\n  print \"\\n\";\n  }\nmy $count = 0;\nfindcount();\nprint \"count of non-unique 0-9: $count\\n\";\n\nsub findunique\n  {\n  my @allowed = @{ shift @_ };\n  if( @_ == 4 ) { $_[0] == $_[2] + $_[3] or return }\n  elsif( @_ == 6 ) { $_[1] + $_[2] == $_[4] + $_[5] or return }\n  elsif( @_ == 7 ) { $_[3] + $_[4] == $_[6] and print \"@_\\n\"; return }\n  for my $n ( @allowed )\n    {\n    findunique( [ grep $n != $_, @allowed ], @_, $n );\n    }\n  }\n\nsub findcount\n  {\n  if( @_ == 4 ) { $_[0] == $_[2] + $_[3] or return }\n  elsif( @_ == 6 ) { $_[1] + $_[2] == $_[4] + $_[5] or return }\n  elsif( @_ == 7 ) { $_[3] + $_[4] == $_[6] and $count++; return }\n  findcount( @_, $_ ) for 0 .. 9;\n  }\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_108.txt",
        "content": "for 1 2 3 4 5 6 7\n\n3 7 2 1 5 4 6\n4 5 3 1 6 2 7\n4 7 1 3 2 6 5\n5 6 2 3 1 7 4\n6 4 1 5 2 3 7\n6 4 5 1 2 7 3\n7 2 6 1 3 5 4\n7 3 2 5 1 4 6\n\nfor 3 4 5 6 7 8 9\n\n7 8 3 4 5 6 9\n8 7 3 5 4 6 9\n9 6 4 5 3 7 8\n9 6 5 4 3 8 7\n\ncount of non-unique 0-9: 2860\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_109.txt",
        "content": "-- demo/rosetta/4_rings_or_4_squares_puzzle.exw\nwith javascript_semantics\ninteger solutions\n \nprocedure check(sequence set, bool show)\n    integer {a,b,c,d,e,f,g} = set, ab = a+b\n    if ab=b+d+c and ab=d+e+f and ab=f+g then\n        solutions += 1\n        if show then\n            ?set\n        end if\n    end if\nend procedure\n \nprocedure foursquares(integer lo, hi, bool uniq, show)\n    sequence set = repeat(lo,7)\n    solutions = 0\n    if uniq then\n        for i=1 to 7 do\n            set[i] = lo+i-1\n        end for\n        for i=1 to factorial(7) do\n            check(permute(i,set),show)\n        end for\n    else\n        integer done = 0\n        while not done do\n            check(set,show)\n            for i=1 to 7 do\n                set[i] += 1\n                if set[i]<=hi then exit end if\n                if i=7 then\n                    done = 1\n                    exit\n                end if\n                set[i] = lo\n            end for\n        end while\n    end if\n    printf(1,\"%d solutions\\n\",solutions)\nend procedure\nfoursquares(1,7,uniq:=true,show:=true)\nfoursquares(3,9,true,true)\nfoursquares(0,9,false,false)\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_11.txt",
        "content": "with Ada.Text_IO;\n\nprocedure Puzzle_Square_4 is\n\n   procedure Four_Rings (Low, High : in Natural; Unique, Show : in Boolean) is\n      subtype Test_Range is Natural range Low .. High;\n\n      type Value_List is array (Positive range <>) of Natural;\n      function Is_Unique (Values : Value_List) return Boolean is\n         Count : array (Test_Range) of Natural := (others => 0);\n      begin\n         for Value of Values loop\n            Count (Value) := Count (Value) + 1;\n            if Count (Value) > 1 then\n               return False;\n            end if;\n         end loop;\n         return True;\n      end Is_Unique;\n\n      function Is_Valid (A,B,C,D,E,F,G : in Natural) return Boolean is\n         Ring_1 : constant Integer := A + B;\n         Ring_2 : constant Integer := B + C + D;\n         Ring_3 : constant Integer := D + E + F;\n         Ring_4 : constant Integer := F + G;\n      begin\n         return\n           Ring_1 = Ring_2 and\n           Ring_1 = Ring_3 and\n           Ring_1 = Ring_4;\n      end Is_Valid;\n\n      use Ada.Text_IO;\n      Count : Natural := 0;\n   begin\n      for A in Test_Range loop\n         for B in Test_Range loop\n            for C in Test_Range loop\n               for D in Test_Range loop\n                  for E in Test_Range loop\n                     for F in Test_Range loop\n                        for G in Test_Range loop\n                           if Is_Valid (A,B,C,D,E,F,G) then\n                              if not Unique or (Unique and Is_Unique ((A,B,C,D,E,F,G))) then\n                                 Count := Count + 1;\n                                 if Show then\n                                    Put_Line (A'Image & B'Image & C'Image & D'Image & E'Image & F'Image & G'Image);\n                                 end if;\n                              end if;\n                           end if;\n                        end loop;\n                     end loop;\n                  end loop;\n               end loop;\n            end loop;\n         end loop;\n      end loop;\n      Put_Line (\"There are \" & Count'Image &\n                  (if Unique then \" unique \" else \" non-unique \") &\n                    \"solutions in \" & Low'Image & \" ..\" & High'Image);\n      New_Line;\n   end Four_Rings;\n\nbegin\n   Four_Rings (Low => 1, High => 7, Unique => True,  Show => True);\n   Four_Rings (Low => 3, High => 9, Unique => True,  Show => True);\n   Four_Rings (Low => 0, High => 9, Unique => False, Show => False);\nend Puzzle_Square_4;\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_110.txt",
        "content": "{6,4,5,1,2,7,3}\n{3,7,2,1,5,4,6}\n{6,4,1,5,2,3,7}\n{4,7,1,3,2,6,5}\n{7,3,2,5,1,4,6}\n{5,6,2,3,1,7,4}\n{4,5,3,1,6,2,7}\n{7,2,6,1,3,5,4}\n8 solutions\n{7,8,3,4,5,6,9}\n{8,7,3,5,4,6,9}\n{9,6,4,5,3,7,8}\n{9,6,5,4,3,8,7}\n4 solutions\n2860 solutions\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_111.txt",
        "content": "import cp.\n\nmain => \n  puzzle_all(1, 7, true, Sol1),\n  foreach(Sol in Sol1) println(Sol) end,\n  nl,\n  \n  puzzle_all(3, 9, true, Sol2),\n  foreach(Sol in Sol2) println(Sol) end,\n  nl,\n  \n  puzzle_all(0, 9, false, Sol3),\n  println(len=Sol3.len),\n  nl.\n\npuzzle_all(Min, Max, Distinct, LL) => \n    L = [A,B,C,D,E,F,G],\n    L\u00a0:: Min..Max,\n    if Distinct then \n      all_different(L)\n    else\n      true\n    end,\n    T #= A+B,\n    T #= B+C+D,\n    T #= D+E+F,\n    T #= F+G,\n   \u00a0% Another approach:\n   \u00a0% Sums = $[A+B,B+C+D,D+E+F,F+G],\n   \u00a0% foreach(I in 2..Sums.len) Sums[I] #= Sums[I-1] end,\n    LL = solve_all(L).",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_112.txt",
        "content": "Picat> main\n[3,7,2,1,5,4,6]\n[4,5,3,1,6,2,7]\n[4,7,1,3,2,6,5]\n[5,6,2,3,1,7,4]\n[6,4,1,5,2,3,7]\n[6,4,5,1,2,7,3]\n[7,2,6,1,3,5,4]\n[7,3,2,5,1,4,6]\n\n[7,8,3,4,5,6,9]\n[8,7,3,5,4,6,9]\n[9,6,4,5,3,7,8]\n[9,6,5,4,3,8,7]\n\nlen = 2860",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_113.txt",
        "content": "100H: /* SOLVE THE 4 RINGS OR 4 SQUARES PUZZLE                              */\n\n   DECLARE FALSE LITERALLY '0';\n   DECLARE TRUE  LITERALLY '0FFH';\n\n   /* CP/M SYSTEM CALL AND I/O ROUTINES                                     */\n   BDOS:      PROCEDURE( FN, ARG ); DECLARE FN BYTE, ARG ADDRESS; GOTO 5; END;\n   PR$CHAR:   PROCEDURE( C ); DECLARE C BYTE;    CALL BDOS( 2, C );  END;\n   PR$STRING: PROCEDURE( S ); DECLARE S ADDRESS; CALL BDOS( 9, S );  END;\n   PR$NL:     PROCEDURE;   CALL PR$CHAR( 0DH ); CALL PR$CHAR( 0AH ); END;\n   PR$NUMBER: PROCEDURE( N ); /* PRINTS A NUMBER IN THE MINIMUN FIELD WIDTH */\n      DECLARE N ADDRESS;\n      DECLARE V ADDRESS, N$STR ( 6 )BYTE, W BYTE;\n      V = N;\n      W = LAST( N$STR );\n      N$STR( W ) = '$';\n      N$STR( W\u00a0:= W - 1 ) = '0' + ( V MOD 10 );\n      DO WHILE( ( V\u00a0:= V / 10 ) > 0 );\n         N$STR( W\u00a0:= W - 1 ) = '0' + ( V MOD 10 );\n      END;\n      CALL PR$STRING( .N$STR( W ) );\n   END PR$NUMBER;\n\n   /* FIND SOLUTIONS TO THE EQUATIONS:                                      */\n   /*       A + B = B + C + D = D + E + F = F + G                           */\n   /* WHERE A, B, C, D, E, F, G IN LO\u00a0: HI ( NOT NECESSARILY UNIQUE )       */\n   /* DEPENDING ON SHOW, THE SOLUTIONS WILL BE PRINTED OR NOT               */\n   FOUR$RINGS: PROCEDURE( LO, HI, ALLOW$DUPLICATES, SHOW );\n      DECLARE ( LO, HI ) ADDRESS;\n      DECLARE ( ALLOW$DUPLICATES, SHOW ) BYTE;\n      DECLARE ( SOLUTIONS, A, B, C, D, E, F, G, T ) ADDRESS;\n      SOLUTIONS = 0;\n      DO A = LO TO HI;\n         DO B = LO TO HI;\n            IF ALLOWDUPLICATES OR A <> B THEN DO;\n               T = A + B;\n               DO C = LO TO HI;\n                  IF ALLOWDUPLICATES OR ( A <> C AND B <> C ) THEN DO;\n                     D = T - ( B + C );\n                     IF  D >= LO AND D <= HI\n                     AND (  ALLOW$DUPLICATES\n                         OR ( A <> D AND B <> D AND C <> D )\n                         )\n                     THEN DO;\n                        DO E = LO TO HI;\n                           IF ALLOWDUPLICATES\n                           OR (   A <> E AND B <> E\n                              AND C <> E AND D <> E\n                              )\n                           THEN DO;\n                              G = D + E;\n                              F = T - G;\n                              IF  F >= LO AND F <= HI\n                              AND G >= LO AND G <= HI\n                              AND (  ALLOWDUPLICATES\n                                  OR (   A <> F AND B <> F AND C <> F\n                                     AND D <> F AND E <> F\n                                     AND A <> G AND B <> G AND C <> G\n                                     AND D <> G AND E <> G AND F <> G\n                                     )\n                                 )\n                              THEN DO;\n                                 SOLUTIONS = SOLUTIONS + 1;\n                                 IF SHOW THEN DO;\n                                    CALL PR$CHAR( ' ' ); CALL PR$NUMBER( A );\n                                    CALL PR$CHAR( ' ' ); CALL PR$NUMBER( B );\n                                    CALL PR$CHAR( ' ' ); CALL PR$NUMBER( C );\n                                    CALL PR$CHAR( ' ' ); CALL PR$NUMBER( D );\n                                    CALL PR$CHAR( ' ' ); CALL PR$NUMBER( E );\n                                    CALL PR$CHAR( ' ' ); CALL PR$NUMBER( F );\n                                    CALL PR$CHAR( ' ' ); CALL PR$NUMBER( G );\n                                    CALL PR$NL;\n                                 END;\n                              END;\n                           END;\n                        END;\n                     END;\n                  END;\n               END;\n            END;\n         END;\n      END;\n      CALL PR$NUMBER( SOLUTIONS );\n      IF ALLOW$DUPLICATES THEN CALL PR$STRING( .' NON-UNIQUE$' );\n                          ELSE CALL PR$STRING( .' UNIQUE$'     );\n      CALL PR$STRING( .' SOLUTIONS IN $' );\n      CALL PR$NUMBER( LO );\n      CALL PR$STRING( .' TO $' );\n      CALL PR$NUMBER( HI );\n      CALL PR$NL;\n      CALL PR$NL;\n    END FOUR$RINGS;\n\n    /* FIND THE SOLUTIONS AS REQUIRED FOR THE TASK */\n    CALL FOUR$RINGS( 1, 7, FALSE, TRUE  );\n    CALL FOUR$RINGS( 3, 9, FALSE, TRUE  );\n    CALL FOUR$RINGS( 0, 9, TRUE,  FALSE );\nEOF",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_114.txt",
        "content": " 3 7 2 1 5 4 6\n 4 5 3 1 6 2 7\n 4 7 1 3 2 6 5\n 5 6 2 3 1 7 4\n 6 4 1 5 2 3 7\n 6 4 5 1 2 7 3\n 7 2 6 1 3 5 4\n 7 3 2 5 1 4 6\n8 UNIQUE SOLUTIONS IN 1 TO 7\n\n 7 8 3 4 5 6 9\n 8 7 3 5 4 6 9\n 9 6 4 5 3 7 8\n 9 6 5 4 3 8 7\n4 UNIQUE SOLUTIONS IN 3 TO 9\n\n2860 NON-UNIQUE SOLUTIONS IN 0 TO 9\n\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_115.txt",
        "content": "create table allints (v number);\ncreate table results \n(\na number,\nb number,\nc number,\nd number,\ne number,\nf number,\ng number\n);\n\ncreate or replace procedure foursquares(lo number,hi number,uniq boolean,show boolean)\nas\n    a number;\n    b number;\n    c number;\n    d number;\n    e number;\n    f number;\n    g number;\n    out_line varchar2(2000);\n   \n    cursor results_cur is \n    select\n       a,\n       b,\n       c,\n       d,\n       e,\n       f,\n       g\n    from\n        results\n    order by \n        a,b,c,d,e,f,g;\n\n    results_rec results_cur%rowtype;\n    \n    solutions number;\n    uorn varchar2(2000);\nbegin\n    solutions := 0;\n    delete from allints;\n    delete from results;\n    for i in lo..hi loop\n        insert into allints values (i);\n    end loop;\n    commit;\n    \n    if uniq = TRUE then\n        insert into results\n            select\n                a.v a,\n                b.v b,\n                c.v c,\n                d.v d,\n                e.v e,\n                f.v f,\n                g.v g\n            from\n                allints a, allints b, allints c,allints d,\n                allints e, allints f, allints g\n            where\n                a.v not in (b.v,c.v,d.v,e.v,f.v,g.v) and\n                b.v not in (c.v,d.v,e.v,f.v,g.v) and\n                c.v not in (d.v,e.v,f.v,g.v) and\n                d.v not in (e.v,f.v,g.v) and\n                e.v not in (f.v,g.v) and\n                f.v not in (g.v) and\n                a.v = c.v + d.v and\n                g.v = d.v + e.v and\n                b.v = e.v + f.v - c.v\n            order by \n                a,b,c,d,e,f,g;\n        uorn := ' unique solutions in ';\n    else\n        insert into results\n            select\n                a.v a,\n                b.v b,\n                c.v c,\n                d.v d,\n                e.v e,\n                f.v f,\n                g.v g\n            from\n                allints a, allints b, allints c,allints d,\n                allints e, allints f, allints g\n            where\n                a.v = c.v + d.v and\n                g.v = d.v + e.v and\n                b.v = e.v + f.v - c.v\n            order by \n                a,b,c,d,e,f,g;   \n        uorn := ' non-unique solutions in ';\n    end if;\n    commit;\n\n    open results_cur;\n    loop\n        fetch results_cur into results_rec;\n        exit when results_cur%notfound;\n        a := results_rec.a;\n        b := results_rec.b;\n        c := results_rec.c;\n        d := results_rec.d;\n        e := results_rec.e;\n        f := results_rec.f;\n        g := results_rec.g;\n        \n        solutions := solutions + 1;\n        if show = TRUE then\n            out_line := to_char(a) || ' ';\n            out_line := out_line || ' ' || to_char(b) || ' ';\n            out_line := out_line || ' ' || to_char(c) || ' ';\n            out_line := out_line || ' ' || to_char(d) || ' ';\n            out_line := out_line || ' ' || to_char(e) || ' ';\n            out_line := out_line || ' ' || to_char(f) ||' ';\n            out_line := out_line || ' ' || to_char(g);\n        end if;\n        \n        dbms_output.put_line(out_line);\n    end loop;\n    close results_cur;\n    out_line := to_char(solutions) || uorn;\n    out_line := out_line || to_char(lo) || ' to ' || to_char(hi);\n    dbms_output.put_line(out_line);\n   \nend;\n/\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_116.txt",
        "content": "SQL> execute foursquares(1,7,TRUE,TRUE);\n3  7  2  1  5  4  6                                                             \n4  5  3  1  6  2  7                                                             \n4  7  1  3  2  6  5                                                             \n5  6  2  3  1  7  4                                                             \n6  4  1  5  2  3  7                                                             \n6  4  5  1  2  7  3                                                             \n7  2  6  1  3  5  4                                                             \n7  3  2  5  1  4  6                                                             \n8 unique solutions in 1 to 7                                                    \n\nPL/SQL procedure successfully completed.\n\nSQL> execute foursquares(3,9,TRUE,TRUE);\n7  8  3  4  5  6  9                                                             \n8  7  3  5  4  6  9                                                             \n9  6  4  5  3  7  8                                                             \n9  6  5  4  3  8  7                                                             \n4 unique solutions in 3 to 9                                                    \n\nPL/SQL procedure successfully completed.\n\nSQL> execute foursquares(0,9,FALSE,FALSE);\n2860 non-unique solutions in 0 to 9                                             \n\nPL/SQL procedure successfully completed.\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_117.txt",
        "content": ":- use_module(library(clpfd)).\n\n% main predicate\nmy_sum(Min, Max, Top, LL):-\n    L = [A,B,C,D,E,F,G],\n    L ins Min..Max,\n    (   Top == 0\n    ->  all_distinct(L)\n    ;    true),\n    R #= A+B,\n    R #= B+C+D,\n    R #= D+E+F,\n    R #= F+G,\n    setof(L, labeling([ff], L), LL).\n\n\nmy_sum_1(Min, Max) :-\n    my_sum(Min, Max, 0, LL),\n    maplist(writeln, LL).\n\nmy_sum_2(Min, Max, Len) :-\n    my_sum(Min, Max, 1, LL),\n    length(LL, Len).\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_118.txt",
        "content": "\u00a0?- my_sum_1(1,7).\n[3,7,2,1,5,4,6]\n[4,5,3,1,6,2,7]\n[4,7,1,3,2,6,5]\n[5,6,2,3,1,7,4]\n[6,4,1,5,2,3,7]\n[6,4,5,1,2,7,3]\n[7,2,6,1,3,5,4]\n[7,3,2,5,1,4,6]\ntrue.\n\n\u00a0?- my_sum_1(3,9).\n[7,8,3,4,5,6,9]\n[8,7,3,5,4,6,9]\n[9,6,4,5,3,7,8]\n[9,6,5,4,3,8,7]\ntrue.\n\n\u00a0?- my_sum_2(0,9,N).\nN = 2860.\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_119.txt",
        "content": "import itertools\n\ndef all_equal(a,b,c,d,e,f,g):\n    return a+b == b+c+d == d+e+f == f+g\n\ndef foursquares(lo,hi,unique,show):\n    solutions = 0\n    if unique:\n        uorn = \"unique\"\n        citer = itertools.combinations(range(lo,hi+1),7)\n    else:\n        uorn = \"non-unique\"\n        citer =  itertools.combinations_with_replacement(range(lo,hi+1),7)\n                    \n    for c in citer:\n            for p in set(itertools.permutations(c)):\n                if all_equal(*p):\n                    solutions += 1\n                    if show:\n                        print str(p)[1:-1]\n\n    print str(solutions)+\" \"+uorn+\" solutions in \"+str(lo)+\" to \"+str(hi)\n    print\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_12.txt",
        "content": " 3 7 2 1 5 4 6\n 4 5 3 1 6 2 7\n 4 7 1 3 2 6 5\n 5 6 2 3 1 7 4\n 6 4 1 5 2 3 7\n 6 4 5 1 2 7 3\n 7 2 6 1 3 5 4\n 7 3 2 5 1 4 6\nThere are  8 unique solutions in  1 .. 7\n\n 7 8 3 4 5 6 9\n 8 7 3 5 4 6 9\n 9 6 4 5 3 7 8\n 9 6 5 4 3 8 7\nThere are  4 unique solutions in  3 .. 9\n\nThere are  2860 non-unique solutions in  0 .. 9\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_120.txt",
        "content": "foursquares(1,7,True,True)\n4, 5, 3, 1, 6, 2, 7\n3, 7, 2, 1, 5, 4, 6\n5, 6, 2, 3, 1, 7, 4\n4, 7, 1, 3, 2, 6, 5\n6, 4, 5, 1, 2, 7, 3\n7, 3, 2, 5, 1, 4, 6\n7, 2, 6, 1, 3, 5, 4\n6, 4, 1, 5, 2, 3, 7\n8 unique solutions in 1 to 7\n\n\nfoursquares(3,9,True,True)\n7, 8, 3, 4, 5, 6, 9\n9, 6, 4, 5, 3, 7, 8\n8, 7, 3, 5, 4, 6, 9\n9, 6, 5, 4, 3, 8, 7\n4 unique solutions in 3 to 9\n\n\nfoursquares(0,9,False,False)\n2860 non-unique solutions in 0 to 9",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_121.txt",
        "content": "def foursquares(lo,hi,unique,show):\n\n    def acd_iter():\n        \"\"\"\n        Iterates through all the possible valid values of \n        a, c, and d.\n        \n        a = c + d\n        \"\"\"\n        for c in range(lo,hi+1):\n            for d in range(lo,hi+1):\n                if (not unique) or (c <> d):\n                    a = c + d\n                    if a >= lo and a <= hi:\n                        if (not unique) or (c <> 0 and d <> 0):\n                            yield (a,c,d)\n                            \n    def ge_iter():\n        \"\"\"\n        Iterates through all the possible valid values of \n        g and e.\n        \n        g = d + e\n        \"\"\"\n        for e in range(lo,hi+1):\n            if (not unique) or (e not in (a,c,d)):\n                g = d + e\n                if g >= lo and g <= hi:\n                    if (not unique) or (g not in (a,c,d,e)):\n                        yield (g,e)\n                        \n    def bf_iter():\n        \"\"\"\n        Iterates through all the possible valid values of \n        b and f.\n        \n        b = e + f - c\n        \"\"\"\n        for f in range(lo,hi+1):\n            if (not unique) or (f not in (a,c,d,g,e)):\n                b = e + f - c\n                if b >= lo and b <= hi:\n                    if (not unique) or (b not in (a,c,d,g,e,f)):\n                        yield (b,f)\n\n    solutions = 0                    \n    acd_itr = acd_iter()              \n    for acd in acd_itr:\n        a,c,d = acd\n        ge_itr = ge_iter()\n        for ge in ge_itr:\n            g,e = ge\n            bf_itr = bf_iter()\n            for bf in bf_itr:\n                b,f = bf\n                solutions += 1\n                if show:\n                    print str((a,b,c,d,e,f,g))[1:-1]\n    if unique:\n        uorn = \"unique\"\n    else:\n        uorn = \"non-unique\"\n               \n    print str(solutions)+\" \"+uorn+\" solutions in \"+str(lo)+\" to \"+str(hi)\n    print\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_122.txt",
        "content": "foursquares(1,7,True,True)\n4, 7, 1, 3, 2, 6, 5\n6, 4, 1, 5, 2, 3, 7\n3, 7, 2, 1, 5, 4, 6\n5, 6, 2, 3, 1, 7, 4\n7, 3, 2, 5, 1, 4, 6\n4, 5, 3, 1, 6, 2, 7\n6, 4, 5, 1, 2, 7, 3\n7, 2, 6, 1, 3, 5, 4\n8 unique solutions in 1 to 7\n\n\nfoursquares(3,9,True,True)\n7, 8, 3, 4, 5, 6, 9\n8, 7, 3, 5, 4, 6, 9\n9, 6, 4, 5, 3, 7, 8\n9, 6, 5, 4, 3, 8, 7\n4 unique solutions in 3 to 9\n\n\nfoursquares(0,9,False,False)\n2860 non-unique solutions in 0 to 9",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_123.txt",
        "content": "'''4-rings or 4-squares puzzle'''\n\nfrom itertools import chain\n\n\n# rings\u00a0:: noRepeatedDigits -> DigitList -> Lists of solutions\n# rings\u00a0:: Bool -> [Int] -> [[Int]]\ndef rings(uniq):\n    '''Sets of unique or non-unique integer values\n       (drawn from the `digits` argument)\n       for each of the seven names [a..g] such that:\n       (a + b) == (b + c + d) == (d + e + f) == (f + g)\n    '''\n    def go(digits):\n        ns = sorted(digits, reverse=True)\n        h = ns[0]\n\n        # CENTRAL DIGIT\u00a0:: d\n        def central(d):\n            xs = list(filter(lambda x: h >= (d + x), ns))\n\n            # LEFT NEIGHBOUR AND LEFTMOST\u00a0:: c and a\n            def left(c):\n                a = c + d\n                if a > h:\n                    return []\n                else:\n                    # RIGHT NEIGHBOUR AND RIGHTMOST\u00a0:: e and g\n                    def right(e):\n                        g = d + e\n                        if ((g > h) or (uniq and (g == c))):\n                            return []\n                        else:\n                            agDelta = a - g\n                            bfs = difference(ns)(\n                                [d, c, e, g, a]\n                            ) if uniq else ns\n\n                            # MID LEFT AND RIGHT\u00a0:: b and f\n                            def midLeftRight(b):\n                                f = b + agDelta\n                                return [[a, b, c, d, e, f, g]] if (\n                                    (f in bfs) and (\n                                        (not uniq) or (\n                                            f not in [a, b, c, d, e, g]\n                                        )\n                                    )\n                                ) else []\n\n    # CANDIDATE DIGITS BOUND TO POSITIONS [a .. g] --------\n\n                            return concatMap(midLeftRight)(bfs)\n\n                    return concatMap(right)(\n                        difference(xs)([d, c, a]) if uniq else ns\n                    )\n\n            return concatMap(left)(\n                delete(d)(xs) if uniq else ns\n            )\n\n        return concatMap(central)(ns)\n\n    return lambda digits: go(digits) if digits else []\n\n\n# TEST ----------------------------------------------------\n# main\u00a0:: IO ()\ndef main():\n    '''Testing unique digits [1..7], [3..9] and unrestricted digits'''\n\n    print(main.__doc__ + ':\\n')\n    print(unlines(map(\n        lambda tpl: '\\nrings' + repr(tpl) + ':\\n\\n' + unlines(\n            map(repr, uncurry(rings)(*tpl))\n        ), [\n            (True, enumFromTo(1)(7)),\n            (True, enumFromTo(3)(9))\n        ]\n    )))\n    tpl = (False, enumFromTo(0)(9))\n    print(\n        '\\n\\nlen(rings' + repr(tpl) + '):\\n\\n' +\n        str(len(uncurry(rings)(*tpl)))\n    )\n\n\n# GENERIC -------------------------------------------------\n\n# concatMap\u00a0:: (a -> [b]) -> [a] -> [b]\ndef concatMap(f):\n    '''A concatenated list over which a function has been mapped.\n       The list monad can be derived by using a function f which\n       wraps its output in a list,\n       (using an empty list to represent computational failure).\n    '''\n    return lambda xs: list(\n        chain.from_iterable(map(f, xs))\n    )\n\n\n# delete\u00a0:: Eq a => a -> [a] -> [a]\ndef delete(x):\n    '''xs with the first of any instances of x removed.'''\n    def go(xs):\n        xs.remove(x)\n        return xs\n    return lambda xs: go(list(xs)) if (\n        x in xs\n    ) else list(xs)\n\n\n#  difference\u00a0:: Eq a => [a] -> [a] -> [a]\ndef difference(xs):\n    '''All elements of ys except any also found in xs'''\n    def go(ys):\n        s = set(ys)\n        return [x for x in xs if x not in s]\n    return lambda ys: go(ys)\n\n\n# enumFromTo\u00a0:: (Int, Int) -> [Int]\ndef enumFromTo(m):\n    '''Integer enumeration from m to n.'''\n    return lambda n: list(range(m, 1 + n))\n\n\n# uncurry\u00a0:: (a -> b -> c) -> ((a, b) -> c)\ndef uncurry(f):\n    '''A function over a pair of arguments,\n       derived from a vanilla or curried function.\n    '''\n    return lambda x, y: f(x)(y)\n\n\n# unlines\u00a0:: [String] -> String\ndef unlines(xs):\n    '''A single string formed by the intercalation\n       of a list of strings with the newline character.\n    '''\n    return '\\n'.join(xs)\n\n\n# MAIN ---\nif __name__ == '__main__':\n    main()\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_124.txt",
        "content": "Testing unique digits [1..7], [3..9] and unrestricted digits:\n\nrings(True, [1, 2, 3, 4, 5, 6, 7]):\n\n[7, 3, 2, 5, 1, 4, 6]\n[6, 4, 1, 5, 2, 3, 7]\n[5, 6, 2, 3, 1, 7, 4]\n[4, 7, 1, 3, 2, 6, 5]\n[7, 2, 6, 1, 3, 5, 4]\n[6, 4, 5, 1, 2, 7, 3]\n[4, 5, 3, 1, 6, 2, 7]\n[3, 7, 2, 1, 5, 4, 6]\n\nrings(True, [3, 4, 5, 6, 7, 8, 9]):\n\n[9, 6, 4, 5, 3, 7, 8]\n[8, 7, 3, 5, 4, 6, 9]\n[9, 6, 5, 4, 3, 8, 7]\n[7, 8, 3, 4, 5, 6, 9]\n\n\nlen(rings(False, [0, 1, 2, 3, 4, 5, 6, 7, 8, 9])):\n\n2860",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_125.txt",
        "content": "# 4 rings or 4 squares puzzle\n\nperms <- function (n, r, v = 1:n, repeats.allowed = FALSE) {\n  if (repeats.allowed) \n    sub <- function(n, r, v) {\n      if (r == 1) \n        matrix(v, n, 1)\n      else if (n == 1) \n        matrix(v, 1, r)\n      else {\n        inner <- Recall(n, r - 1, v)\n        cbind(rep(v, rep(nrow(inner), n)), matrix(t(inner), \n                                                  ncol = ncol(inner), nrow = nrow(inner) * n, \n                                                  byrow = TRUE))\n      }\n    }\n  else sub <- function(n, r, v) {\n    if (r == 1) \n      matrix(v, n, 1)\n    else if (n == 1) \n      matrix(v, 1, r)\n    else {\n      X <- NULL\n      for (i in 1:n) X <- rbind(X, cbind(v[i], Recall(n - 1, r - 1, v[-i])))\n      X\n    }\n  }\n  X <- sub(n, r, v[1:n])\n  \n  result <- vector(mode = \"numeric\")\n\n  for(i in 1:nrow(X)){\n    y <- X[i, ]\n    x1 <- y[1] + y[2]\n    x2 <- y[2] + y[3] + y[4]\n    x3 <- y[4] + y[5] + y[6]\n    x4 <- y[6] + y[7]\n    if(x1 == x2 & x2 == x3 & x3 == x4) result <- rbind(result, y)\n  }\n  return(result)\n}\n\nprint_perms <- function(n, r, v = 1:n, repeats.allowed = FALSE, table.out = FALSE) {\n  a <- perms(n, r, v, repeats.allowed)\n  colnames(a) <- rep(\"\", ncol(a))\n  rownames(a) <- rep(\"\", nrow(a)) \n  if(!repeats.allowed){\n    print(a)\n    cat(paste('\\n', nrow(a), 'unique solutions from', min(v), 'to', max(v)))\n  } else {\n    cat(paste('\\n', nrow(a), 'non-unique solutions from', min(v), 'to', max(v)))\n  }\n}\n\nregisterS3method(\"print_perms\", \"data.frame\", print_perms)\n\nprint_perms(7, 7, repeats.allowed = FALSE, table.out = TRUE)\nprint_perms(7, 7, v = 3:9, repeats.allowed = FALSE, table.out = TRUE)\nprint_perms(10, 7, v = 0:9, repeats.allowed = TRUE, table.out = FALSE)\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_126.txt",
        "content": "              \n 3 7 2 1 5 4 6\n 4 5 3 1 6 2 7\n 4 7 1 3 2 6 5\n 5 6 2 3 1 7 4\n 6 4 1 5 2 3 7\n 6 4 5 1 2 7 3\n 7 2 6 1 3 5 4\n 7 3 2 5 1 4 6\n\n 8 unique solutions from 1 to 7\n             \n 7 8 3 4 5 6 9\n 8 7 3 5 4 6 9\n 9 6 4 5 3 7 8\n 9 6 5 4 3 8 7\n\n 4 unique solutions from 3 to 9\n\n 2860 non-unique solutions from 0 to 9\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_127.txt",
        "content": "#lang racket\n\n(define solution? (match-lambda [(list a b c d e f g) (= (+ a b) (+ b c d) (+ d e f) (+ f g))]))\n\n(define (fold-4-rings-or-4-squares-puzzle lo hi kons k0)\n  (for*/fold ((k k0))\n            ((combination (in-combinations (range lo (add1 hi)) 7))\n             (permutation (in-permutations combination))\n             #:when (solution? permutation))\n            (kons permutation k)))\n\n(fold-4-rings-or-4-squares-puzzle 1 7 cons null)\n(fold-4-rings-or-4-squares-puzzle 3 9 cons null)\n(fold-4-rings-or-4-squares-puzzle 0 9 (\u03bb (ignored-solution count) (add1 count)) 0)\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_128.txt",
        "content": "'((6 4 1 5 2 3 7) (4 5 3 1 6 2 7) (3 7 2 1 5 4 6) (7 3 2 5 1 4 6) (4 7 1 3 2 6 5) (5 6 2 3 1 7 4) (7 2 6 1 3 5 4) (6 4 5 1 2 7 3))\n'((7 8 3 4 5 6 9) (8 7 3 5 4 6 9) (9 6 4 5 3 7 8) (9 6 5 4 3 8 7))\n192",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_129.txt",
        "content": "sub four-squares ( @list,\u00a0:$unique=1,\u00a0:$show=1 ) {\n\n    my @solutions;\n\n    for $unique.&combos -> @c {\n        @solutions.push: @c if [==]\n          @c[0] + @c[1],\n          @c[1] + @c[2] + @c[3],\n          @c[3] + @c[4] + @c[5],\n          @c[5] + @c[6];\n    }\n\n    say +@solutions, ($unique\u00a0?? ' '\u00a0!! ' non-'), \"unique solutions found using {join(', ', @list)}.\\n\";\n\n    my $f = \"%{@list.max.chars}s\";\n\n    say join \"\\n\", (('a'..'g').fmt: $f), @solutions\u00bb.fmt($f), \"\\n\" if $show;\n\n    multi combos ( $ where so * ) { @list.combinations(7).map: |*.permutations }\n\n    multi combos ( $ where not * ) { [X] @list xx 7 }\n}\n\n# TASK\nfour-squares( [1..7] );\nfour-squares( [3..9] );\nfour-squares( [8, 9, 11, 12, 17, 18, 20, 21] );\nfour-squares( [0..9],\u00a0:unique(0),\u00a0:show(0) );\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_13.txt",
        "content": "BEGIN\n    # solve the 4 rings or 4 squares puzzle                                             #\n    # we need to find solutions to the equations: a + b = b + c + d = d + e + f = f + g #\n    # where a, b, c, d, e, f, g in lo\u00a0: hi ( not necessarily unique )                   #\n    # depending on show, the solutions will be printed or not                           #\n    PROC four rings = ( INT lo, hi, BOOL allow duplicates, show )VOID:\n    BEGIN\n        INT  solutions\u00a0:= 0;\n        # calculate field width for printinhg solutions #\n        INT  width\u00a0:= -1;\n        INT  max\u00a0:= ABS IF ABS lo > ABS hi THEN lo ELSE hi FI;\n        WHILE max > 0 DO\n            width -:= 1;\n            max OVERAB 10\n        OD;\n        # find solutions #\n        FOR a FROM lo TO hi DO\n            FOR b FROM lo TO hi DO\n                IF allow duplicates OR a /= b THEN\n                    INT t = a + b;\n                    FOR c FROM lo TO hi DO\n                        IF allow duplicates OR ( a /= c AND b /= c ) THEN\n                            INT d = t - ( b + c );\n                            IF  d >= lo AND d <= hi\n                            AND (  allow duplicates\n                                OR ( a /= d AND b /= d AND c /= d )\n                                )\n                            THEN\n                                FOR e FROM lo TO hi DO\n                                    IF allow duplicates\n                                    OR ( a /= e AND b /= e AND c /= e AND d /= e )\n                                    THEN\n                                        INT g = d + e;\n                                        INT f = t - g;\n                                        IF  f >= lo AND f <= hi\n                                        AND g >= lo AND g <= hi\n                                        AND (  allow duplicates\n                                            OR (   a /= f AND b /= f AND c /= f\n                                               AND d /= f AND e /= f\n                                               AND a /= g AND b /= g AND c /= g\n                                               AND d /= g AND e /= g AND f /= g\n                                               )\n                                            )\n                                        THEN\n                                            solutions +:= 1;\n                                            IF show THEN\n                                                print( ( whole( a, width ), whole( b, width )\n                                                       , whole( c, width ), whole( d, width )\n                                                       , whole( e, width ), whole( f, width )\n                                                       , whole( g, width ), newline\n                                                       )\n                                                     )\n                                            FI\n                                        FI\n                                    FI\n                                OD # e #\n                            FI\n                        FI\n                    OD # c #\n                FI\n            OD # b #\n        OD # a #\u00a0;\n        print( ( whole( solutions, 0 )\n               , IF allow duplicates THEN \" non-unique\" ELSE \" unique\" FI\n               , \" solutions in \"\n               , whole( lo, 0 )\n               , \" to \"\n               , whole( hi, 0 )\n               , newline\n               , newline\n               )\n             )\n    END # four rings #\u00a0;\n\n    # find the solutions as required for the task #\n    four rings( 1, 7, FALSE, TRUE  );\n    four rings( 3, 9, FALSE, TRUE  );\n    four rings( 0, 9, TRUE,  FALSE )\nEND",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_130.txt",
        "content": "8 unique solutions found using 1, 2, 3, 4, 5, 6, 7.\n\na b c d e f g\n3 7 2 1 5 4 6\n4 5 3 1 6 2 7\n4 7 1 3 2 6 5\n5 6 2 3 1 7 4\n6 4 1 5 2 3 7\n6 4 5 1 2 7 3\n7 2 6 1 3 5 4\n7 3 2 5 1 4 6\n\n\n4 unique solutions found using 3, 4, 5, 6, 7, 8, 9.\n\na b c d e f g\n7 8 3 4 5 6 9\n8 7 3 5 4 6 9\n9 6 4 5 3 7 8\n9 6 5 4 3 8 7\n\n\n8 unique solutions found using 8, 9, 11, 12, 17, 18, 20, 21.\n\n a  b  c  d  e  f  g\n17 21  8  9 11 18 20\n20 18 11  9  8 21 17\n17 21  9  8 12 18 20\n20 18  8 12  9 17 21\n20 18 12  8  9 21 17\n21 17  9 12  8 18 20\n20 18 11  9 12 17 21\n21 17 12  9 11 18 20\n\n\n2860 non-unique solutions found using 0, 1, 2, 3, 4, 5, 6, 7, 8, 9.\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_131.txt",
        "content": "/*REXX pgm solves the 4-rings puzzle,  where letters represent unique (or not) digits). */\narg LO HI unique show .                          /*the  ARG  statement capitalizes args.*/\nif LO=='' | LO==\",\"  then LO=1                   /*Not specified?  Then use the default.*/\nif HI=='' | HI==\",\"  then HI=7                   /* \"      \"         \"   \"   \"     \"    */\nif unique=='' | unique==',' | unique=='UNIQUE'  then unique=1  /*unique letter solutions*/\n                                                else unique=0  /*non-unique        \"    */\nif   show=='' |   show==',' |   show=='SHOW'    then show=1    /*noshow letter solutions*/\n                                                else show=0    /*  show    \"       \"    */\nw=max(3, length(LO), length(HI) )                /*maximum width of any number found.   */\nbar=copies('\u2550', w)                               /*define a horizontal bar (for title). */\ntimes=HI - LO + 1                                /*calculate number of times to loop.   */\n#=0                                              /*number of solutions found (so far).  */\n       do a=LO     for times\n          do b=LO  for times\n          if unique  then  if b==a  then  iterate\n             do c=LO  for times\n             if unique  then  do;  if c==a  then  iterate\n                                   if c==b  then  iterate\n                              end\n                do d=LO  for times\n                if unique  then  do;  if d==a  then  iterate\n                                      if d==b  then  iterate\n                                      if d==c  then  iterate\n                                 end\n                   do e=LO  for times\n                   if unique  then  do;  if e==a  then  iterate\n                                         if e==b  then  iterate\n                                         if e==c  then  iterate\n                                         if e==d  then  iterate\n                                    end\n                      do f=LO  for times\n                      if unique  then  do;  if f==a  then  iterate\n                                            if f==b  then  iterate\n                                            if f==c  then  iterate\n                                            if f==d  then  iterate\n                                            if f==e  then  iterate\n                                       end\n                         do g=LO  for times\n                         if unique  then  do;  if g==a  then  iterate\n                                               if g==b  then  iterate\n                                               if g==c  then  iterate\n                                               if g==d  then  iterate\n                                               if g==e  then  iterate\n                                               if g==f  then  iterate\n                                          end\n                         sum=a+b\n                         if   f+g\\==sum  then  iterate\n                         if b+c+d\\==sum  then  iterate\n                         if d+e+f\\==sum  then  iterate\n                         #=# + 1                          /*bump the count of solutions.*/\n                         if #==1  then call align  'a',  'b',  'c',  'd',  'e',  'f',  'g'\n                         if #==1  then call align  bar,  bar,  bar,  bar,  bar,  bar,  bar\n                                       call align   a,    b,    c,    d,    e,    f,    g\n                         end   /*g*/\n                      end      /*f*/\n                   end         /*e*/\n                end            /*d*/\n             end               /*c*/\n          end                  /*b*/\n       end                     /*a*/\nsay\n                 _= ' non-unique'\nif  unique  then _= ' unique '\nsay #  _  'solutions found.'\nexit                                             /*stick a fork in it,  we're all done. */\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nalign: parse arg a1,a2,a3,a4,a5,a6,a7\n       if show  then say left('',9)  center(a1,w) center(a2,w) center(a3,w) center(a4,w),\n                                     center(a5,w) center(a6,w) center(a7,w)\n       return\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_132.txt",
        "content": "           a   b   c   d   e   f   g\n          \u2550\u2550\u2550 \u2550\u2550\u2550 \u2550\u2550\u2550 \u2550\u2550\u2550 \u2550\u2550\u2550 \u2550\u2550\u2550 \u2550\u2550\u2550\n           3   7   2   1   5   4   6\n           4   5   3   1   6   2   7\n           4   7   1   3   2   6   5\n           5   6   2   3   1   7   4\n           6   4   1   5   2   3   7\n           6   4   5   1   2   7   3\n           7   2   6   1   3   5   4\n           7   3   2   5   1   4   6\n\n8  unique  solutions found.\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_133.txt",
        "content": "           a   b   c   d   e   f   g\n          \u2550\u2550\u2550 \u2550\u2550\u2550 \u2550\u2550\u2550 \u2550\u2550\u2550 \u2550\u2550\u2550 \u2550\u2550\u2550 \u2550\u2550\u2550\n           7   8   3   4   5   6   9\n           8   7   3   5   4   6   9\n           9   6   4   5   3   7   8\n           9   6   5   4   3   8   7\n\n4  unique  solutions found.\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_134.txt",
        "content": "2860  non-unique solutions found.\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_135.txt",
        "content": "/*REXX pgm solves the 4-rings puzzle,  where letters represent unique (or not) digits). */\narg LO HI unique show .                          /*the  ARG  statement capitalizes args.*/\nif LO=='' | LO==\",\"  then LO=1                   /*Not specified?  Then use the default.*/\nif HI=='' | HI==\",\"  then HI=7                   /* \"      \"         \"   \"   \"     \"    */\nif unique=='' | unique==',' | unique=='UNIQUE'  then u=1       /*unique letter solutions*/\n                                                else u=0       /*non-unique        \"    */\nif   show=='' |   show==',' |   show=='SHOW'    then show=1    /*noshow letter solutions*/\n                                                else show=0    /*  show    \"       \"    */\nw=max(3, length(LO), length(HI) )                /*maximum width of any number found.   */\nbar=copies('\u2550', w)                               /*define a horizontal bar (for title). */\ntimes=HI - LO + 1                                /*calculate number of times to loop.   */\n#=0                                              /*number of solutions found (so far).  */\n     do       a=LO  for times\n      do      b=LO  for times;  if u  then  if b==a                           then iterate\n       do     c=LO  for times;  if u  then  if c==a|c==b                      then iterate\n        do    d=LO  for times;  if u  then  if d==a|d==b|d==c                 then iterate\n         do   e=LO  for times;  if u  then  if e==a|e==b|e==c|e==d            then iterate\n          do  f=LO  for times;  if u  then  if f==a|f==b|f==c|f==d|f==e       then iterate\n           do g=LO  for times;  if u  then  if g==a|g==b|g==c|g==d|g==e|g==f  then iterate\n           sum=a+b\n           if f+g==sum & b+c+d==sum & d+e+f==sum  then #=#+1      /*bump # of solutions.*/\n                                                  else iterate    /*sum not equal, no\u2500go*/\n           if #==1  then call align  'a',  'b',  'c',  'd',  'e',  'f',  'g'\n           if #==1  then call align  bar,  bar,  bar,  bar,  bar,  bar,  bar\n                         call align   a,    b,    c,    d,    e,    f,    g\n           end   /*g*/                                        /*for 1st time, show title*/\n          end    /*f*/\n         end     /*e*/\n        end      /*d*/\n       end       /*c*/\n      end        /*b*/\n     end         /*a*/\nsay\n           _= ' non-unique'\nif u  then _= ' unique '\nsay #  _  'solutions found.'\nexit                                             /*stick a fork in it,  we're all done. */\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nalign: parse arg a1,a2,a3,a4,a5,a6,a7\n       if show  then say  left('',9)  center(a1,w) center(a2,w) center(a3,w) center(a4,w),\n                                      center(a5,w) center(a6,w) center(a7,w)\n       return\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_136.txt",
        "content": "def four_squares(low, high, unique=true, show=unique)\n  f = -> (a,b,c,d,e,f,g) {[a+b, b+c+d, d+e+f, f+g].uniq.size == 1}\n  if unique\n    uniq = \"unique\"\n    solutions = [*low..high].permutation(7).select{|ary| f.call(*ary)}\n  else\n    uniq = \"non-unique\"\n    solutions = [*low..high].repeated_permutation(7).select{|ary| f.call(*ary)}\n  end\n  if show\n    puts \" \" + [*\"a\"..\"g\"].join(\"  \")\n    solutions.each{|ary| p ary}\n  end\n  puts \"#{solutions.size} #{uniq} solutions in #{low} to #{high}\"\n  puts\nend\n\n[[1,7], [3,9]].each do |low, high|\n  four_squares(low, high)\nend\nfour_squares(0, 9, false)\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_137.txt",
        "content": " a  b  c  d  e  f  g\n[3, 7, 2, 1, 5, 4, 6]\n[4, 5, 3, 1, 6, 2, 7]\n[4, 7, 1, 3, 2, 6, 5]\n[5, 6, 2, 3, 1, 7, 4]\n[6, 4, 1, 5, 2, 3, 7]\n[6, 4, 5, 1, 2, 7, 3]\n[7, 2, 6, 1, 3, 5, 4]\n[7, 3, 2, 5, 1, 4, 6]\n8 unique solutions in 1 to 7\n\n a  b  c  d  e  f  g\n[7, 8, 3, 4, 5, 6, 9]\n[8, 7, 3, 5, 4, 6, 9]\n[9, 6, 4, 5, 3, 7, 8]\n[9, 6, 5, 4, 3, 8, 7]\n4 unique solutions in 3 to 9\n\n2860 non-unique solutions in 0 to 9\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_138.txt",
        "content": "#![feature(inclusive_range_syntax)]\n\nfn is_unique(a: u8, b: u8, c: u8, d: u8, e: u8, f: u8, g: u8) -> bool {\n    a != b && a != c && a != d && a != e && a != f && a != g &&\n    b != c && b != d && b != e && b != f && b != g &&\n    c != d && c != e && c != f && c != g &&\n    d != e && d != f && d != g &&\n    e != f && e != g &&\n    f != g\n}\n\nfn is_solution(a: u8, b: u8, c: u8, d: u8, e: u8, f: u8, g: u8) -> bool {\n    a + b == b + c + d &&\n        b + c + d == d + e + f &&\n        d + e + f == f + g\n}\n\nfn four_squares(low: u8, high: u8, unique: bool) -> Vec<Vec<u8>> {\n    let mut results: Vec<Vec<u8>> = Vec::new();\n\n    for a in low..=high {\n        for b in low..=high {\n            for c in low..=high {\n                for d in low..=high {\n                    for e in low..=high {\n                        for f in low..=high {\n                            for g in low..=high {\n                                if (!unique || is_unique(a, b, c, d, e, f, g)) &&\n                                    is_solution(a, b, c, d, e, f, g) {\n                                    results.push(vec![a, b, c, d, e, f, g]);\n                                }\n                            }\n                        }\n                    }\n                }\n            }\n        }\n    }\n    results\n}\n\nfn print_results(solutions: &Vec<Vec<u8>>) {\n    for solution in solutions {\n        println!(\"{:?}\", solution)\n    }\n}\n\nfn print_results_summary(solutions: usize, low: u8, high: u8, unique: bool) {\n    let uniqueness = if unique {\n        \"unique\"\n    } else {\n        \"non-unique\"\n    };\n    println!(\"{} {} solutions in {} to {} range\", solutions, uniqueness, low, high)\n}\n\nfn uniques(low: u8, high: u8) {\n    let solutions = four_squares(low, high, true);\n    print_results(&solutions);\n    print_results_summary(solutions.len(), low, high, true);\n}\n\nfn nonuniques(low: u8, high: u8) {\n    let solutions = four_squares(low, high, false);\n    print_results_summary(solutions.len(), low, high, false);\n}\n\nfn main() {\n    uniques(1, 7);\n    println!();\n    uniques(3, 9);\n    println!();\n    nonuniques(0, 9);\n}\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_139.txt",
        "content": "[3, 7, 2, 1, 5, 4, 6]\n[4, 5, 3, 1, 6, 2, 7]\n[4, 7, 1, 3, 2, 6, 5]\n[5, 6, 2, 3, 1, 7, 4]\n[6, 4, 1, 5, 2, 3, 7]\n[6, 4, 5, 1, 2, 7, 3]\n[7, 2, 6, 1, 3, 5, 4]\n[7, 3, 2, 5, 1, 4, 6]\n8 unique solutions in 1 to 7 range\n\n[7, 8, 3, 4, 5, 6, 9]\n[8, 7, 3, 5, 4, 6, 9]\n[9, 6, 4, 5, 3, 7, 8]\n[9, 6, 5, 4, 3, 8, 7]\n4 unique solutions in 3 to 9 range\n\n2860 non-unique solutions in 0 to 9 range\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_14.txt",
        "content": " 3 7 2 1 5 4 6\n 4 5 3 1 6 2 7\n 4 7 1 3 2 6 5\n 5 6 2 3 1 7 4\n 6 4 1 5 2 3 7\n 6 4 5 1 2 7 3\n 7 2 6 1 3 5 4\n 7 3 2 5 1 4 6\n8 unique solutions in 1 to 7\n\n 7 8 3 4 5 6 9\n 8 7 3 5 4 6 9\n 9 6 4 5 3 7 8\n 9 6 5 4 3 8 7\n4 unique solutions in 3 to 9\n\n2860 non-unique solutions in 0 to 9\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_140.txt",
        "content": "object FourRings {\n \n  def fourSquare(low: Int, high: Int, unique: Boolean, print: Boolean): Unit = {\n    def isValid(needle: Integer, haystack: Integer*) = !unique || !haystack.contains(needle)\n\n    if (print) println(\"a b c d e f g\")\n\n    var count = 0\n    for {\n      a <- low to high\n      b <- low to high if isValid(a, b)\n      fp = a + b\n      c <- low to high if isValid(c, a, b)\n      d <- low to high if isValid(d, a, b, c) && fp == b + c + d\n      e <- low to high if isValid(e, a, b, c, d)\n      f <- low to high if isValid(f, a, b, c, d, e) && fp == d + e + f\n      g <- low to high if isValid(g, a, b, c, d, e, f) && fp == f + g\n    } {\n      count += 1\n      if (print) println(s\"$a $b $c $d $e $f $g\")\n    }\n    \n    println(s\"There are $count ${if(unique) \"unique\" else \"non-unique\"} solutions in [$low, $high]\")\n  }\n \n  def main(args: Array[String]): Unit = {\n    fourSquare(1, 7, unique = true, print = true)\n    fourSquare(3, 9, unique = true, print = true)\n    fourSquare(0, 9, unique = false, print = false)\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_141.txt",
        "content": "a b c d e f g\n3 7 2 1 5 4 6\n4 5 3 1 6 2 7\n4 7 1 3 2 6 5\n5 6 2 3 1 7 4\n6 4 1 5 2 3 7\n6 4 5 1 2 7 3\n7 2 6 1 3 5 4\n7 3 2 5 1 4 6\nThere are 8 unique solutions in [1, 7]\na b c d e f g\n7 8 3 4 5 6 9\n8 7 3 5 4 6 9\n9 6 4 5 3 7 8\n9 6 5 4 3 8 7\nThere are 4 unique solutions in [3, 9]\nThere are 2860 non-unique solutions in [0, 9]",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_142.txt",
        "content": "(import (scheme base)\n        (scheme write)\n        (srfi 1))\n\n;; return all combinations of size elements from given set\n(define (combinations size set unique?)\n  (if (zero? size)\n    (list '())\n    (let loop ((base-combns (combinations (- size 1) set unique?))\n               (results '())\n               (items set))\n      (cond ((null? base-combns) ; end, as no base-combinations to process\n             results)\n            ((null? items)       ; check next base-combination\n             (loop (cdr base-combns)\n                   results\n                   set))\n            ((and unique?        ; ignore if wanting list unique\n                  (member (car items) (car base-combns) =))\n             (loop base-combns\n                   results\n                   (cdr items)))\n            (else                ; keep the new combination\n              (loop base-combns\n                    (cons (cons (car items) (car base-combns))\n                          results)\n                    (cdr items)))))))\n\n;; checks if all 4 sums are the same\n(define (solution? a b c d e f g)\n  (= (+ a b)\n     (+ b c d)\n     (+ d e f)\n     (+ f g)))\n\n;; Tasks\n(display \"Solutions: LOW=1 HIGH=7\\n\")\n(display (filter (lambda (combination) (apply solution? combination))\n                 (combinations 7 (iota 7 1) #t))) (newline)\n\n(display \"Solutions: LOW=3 HIGH=9\\n\")\n(display (filter (lambda (combination) (apply solution? combination))\n                 (combinations 7 (iota 7 3) #t))) (newline)\n\n(display \"Solution count: LOW=0 HIGH=9 non-unique\\n\")\n(display (count (lambda (combination) (apply solution? combination))\n                (combinations 7 (iota 10 0) #f))) (newline)\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_143.txt",
        "content": "Solutions: LOW=1 HIGH=7\n((4 5 3 1 6 2 7) (6 4 1 5 2 3 7) (3 7 2 1 5 4 6) (7 3 2 5 1 4 6) (4 7 1 3 2 6 5) (7 2 6 1 3 5 4) (5 6 2 3 1 7 4) (6 4 5 1 2 7 3))\nSolutions: LOW=3 HIGH=9\n((7 8 3 4 5 6 9) (8 7 3 5 4 6 9) (9 6 4 5 3 7 8) (9 6 5 4 3 8 7))\nSolution count: LOW=0 HIGH=9 non-unique\n2860\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_144.txt",
        "content": "func four_squares (list, unique=true, show=true) {\n\n    var solutions = []\n\n    func check(c) {\n        solutions << c if ([\n            c[0] + c[1],\n            c[1] + c[2] + c[3],\n            c[3] + c[4] + c[5],\n            c[5] + c[6],\n        ].uniq.len == 1)\n    }\n\n    if (unique) {\n        list.combinations(7, {|*a|\n            a.permutations { |*c|\n                check(c)\n            }\n        })\n    } else {\n        7.of { list }.cartesian {|*c|\n            check(c)\n        }\n    }\n\n    say (solutions.len,\n        (unique ? ' ' : ' non-'),\n        \"unique solutions found using #{list.join(', ')}.\\n\")\n\n    if (show) {\n        var f = \"%#{list.max.len+1}s\"\n        say (\"\\n\".join(\n                ('a'..'g').map{f % _}.join,\n                solutions.map{ .map{f % _}.join }...\n        ), \"\\n\")\n    }\n}\n\n# TASK\nfour_squares(@(1..7))\nfour_squares(@(3..9))\nfour_squares([8, 9, 11, 12, 17, 18, 20, 21])\nfour_squares(@(0..9), unique: false, show: false)\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_145.txt",
        "content": "8 unique solutions found using 1, 2, 3, 4, 5, 6, 7.\n\n a b c d e f g\n 3 7 2 1 5 4 6\n 4 5 3 1 6 2 7\n 4 7 1 3 2 6 5\n 5 6 2 3 1 7 4\n 6 4 1 5 2 3 7\n 6 4 5 1 2 7 3\n 7 2 6 1 3 5 4\n 7 3 2 5 1 4 6\n\n4 unique solutions found using 3, 4, 5, 6, 7, 8, 9.\n\n a b c d e f g\n 7 8 3 4 5 6 9\n 8 7 3 5 4 6 9\n 9 6 4 5 3 7 8\n 9 6 5 4 3 8 7\n\n8 unique solutions found using 8, 9, 11, 12, 17, 18, 20, 21.\n\n  a  b  c  d  e  f  g\n 17 21  8  9 11 18 20\n 20 18 11  9  8 21 17\n 17 21  9  8 12 18 20\n 20 18  8 12  9 17 21\n 20 18 12  8  9 21 17\n 21 17  9 12  8 18 20\n 20 18 11  9 12 17 21\n 21 17 12  9 11 18 20\n\n2860 non-unique solutions found using 0, 1, 2, 3, 4, 5, 6, 7, 8, 9.\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_146.txt",
        "content": "BEGIN\n\n    INTEGER PROCEDURE GETCOMBS(LOW, HIGH, UNIQUE, COMBS);\n        INTEGER LOW, HIGH;\n        INTEGER ARRAY COMBS;\n        BOOLEAN UNIQUE;\n    BEGIN\n        INTEGER A, B, C, D, E, F, G;\n        INTEGER NUM;\n\n        BOOLEAN PROCEDURE ISUNIQUE(A, B, C, D, E, F, G);\n            INTEGER A, B, C, D, E, F, G;\n        BEGIN\n            INTEGER ARRAY DATA(LOW:HIGH);\n            INTEGER I;\n\n            FOR I := LOW STEP 1 UNTIL HIGH DO\n                DATA(I) := -1;\n\n            FOR I := A, B, C, D, E, F, G DO\n              IF DATA(I) = -1\n                  THEN DATA(I) := 1\n                  ELSE GOTO L;\n\n            ISUNIQUE := TRUE;\n        L:\n        END;\n\n        PROCEDURE ADDCOMB;\n        BEGIN\n            NUM := NUM + 1;\n            COMBS(NUM, LOW + 0) := A;\n            COMBS(NUM, LOW + 1) := B;\n            COMBS(NUM, LOW + 2) := C;\n            COMBS(NUM, LOW + 3) := D;\n            COMBS(NUM, LOW + 4) := E;\n            COMBS(NUM, LOW + 5) := F;\n            COMBS(NUM, LOW + 6) := G;\n        END;\n\n        FOR A := LOW STEP 1 UNTIL HIGH DO\n        FOR B := LOW STEP 1 UNTIL HIGH DO\n        FOR C := LOW STEP 1 UNTIL HIGH DO\n        FOR D := LOW STEP 1 UNTIL HIGH DO\n        FOR E := LOW STEP 1 UNTIL HIGH DO\n        FOR F := LOW STEP 1 UNTIL HIGH DO\n        FOR G := LOW STEP 1 UNTIL HIGH DO\n        BEGIN\n            IF VALIDCOMB(A, B, C, D, E, F, G) THEN\n            BEGIN\n                IF UNIQUE THEN\n                    BEGIN IF ISUNIQUE(A, B, C, D, E, F, G) THEN ADDCOMB END\n                ELSE ADDCOMB;\n            END;\n        END;\n        GETCOMBS := NUM;\n    END;\n\n\n    BOOLEAN PROCEDURE VALIDCOMB(A, B, C, D, E, F, G);\n        INTEGER A, B, C, D, E, F, G;\n    BEGIN\n        INTEGER SQUARE1, SQUARE2, SQUARE3, SQUARE4;\n\n        SQUARE1 := A + B;\n        SQUARE2 := B + C + D;\n        SQUARE3 := D + E + F;\n        SQUARE4 := F + G;\n        VALIDCOMB := SQUARE1 = SQUARE2 AND SQUARE2 = SQUARE3 AND SQUARE3 = SQUARE4\n    END;\n\n    COMMENT ----- MAIN PROGRAM ----- ;\n\n    INTEGER ARRAY LO(1:3);\n    INTEGER ARRAY HI(1:3);\n    BOOLEAN ARRAY UQ(1:3);\n    INTEGER I;\n\n    LO(1) := 1; HI(1) := 7; UQ(1) := TRUE;\n    LO(2) := 3; HI(2) := 9; UQ(2) := TRUE;\n    LO(3) := 0; HI(3) := 9; UQ(3) := FALSE;\n\n    FOR I := 1 STEP 1 UNTIL 3 DO\n    BEGIN\n        INTEGER LOW, HIGH;\n        BOOLEAN UNIQ;\n\n        LOW := LO(I); HIGH := HI(I); UNIQ := UQ(I);\n        BEGIN\n            INTEGER ARRAY VALIDCOMBS(1:8000, LOW:HIGH);\n            INTEGER N;\n\n            N := GETCOMBS(LOW, HIGH, UNIQ, VALIDCOMBS);\n            OUTINT(N, 0);\n            IF UNIQ THEN OUTTEXT(\" UNIQUE\");\n            OUTTEXT(\" SOLUTIONS IN \");\n            OUTINT(LOW, 0); OUTTEXT(\" TO \");\n            OUTINT(HIGH, 0);\n            OUTIMAGE;\n            IF I < 3 THEN\n            BEGIN INTEGER I, J;\n                FOR I := 1 STEP 1 UNTIL N DO\n                BEGIN\n                    OUTTEXT(\"[\");\n                    FOR J := LOW STEP 1 UNTIL HIGH DO\n                        OUTINT(VALIDCOMBS(I, J), 2);\n                    OUTTEXT(\" ]\");\n                    OUTIMAGE;\n                END;\n            END;\n        END;\n    END;\n\nEND.\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_147.txt",
        "content": "8 UNIQUE SOLUTIONS IN 1 TO 7\n[ 3 7 2 1 5 4 6 ]\n[ 4 5 3 1 6 2 7 ]\n[ 4 7 1 3 2 6 5 ]\n[ 5 6 2 3 1 7 4 ]\n[ 6 4 1 5 2 3 7 ]\n[ 6 4 5 1 2 7 3 ]\n[ 7 2 6 1 3 5 4 ]\n[ 7 3 2 5 1 4 6 ]\n4 UNIQUE SOLUTIONS IN 3 TO 9\n[ 7 8 3 4 5 6 9 ]\n[ 8 7 3 5 4 6 9 ]\n[ 9 6 4 5 3 7 8 ]\n[ 9 6 5 4 3 8 7 ]\n2860 SOLUTIONS IN 0 TO 9\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_148.txt",
        "content": "--#SET TERMINATOR @\n\nSET SERVEROUTPUT ON @\n\nCREATE TABLE ALL_INTS (\n  V INTEGER\n)@\n\nCREATE TABLE RESULTS (\n  A INTEGER,\n  B INTEGER,\n  C INTEGER,\n  D INTEGER,\n  E INTEGER,\n  F INTEGER,\n  G INTEGER\n)@\n \nCREATE OR REPLACE PROCEDURE FOUR_SQUARES(\n  IN LO INTEGER,\n  IN HI INTEGER,\n  IN UNIQ SMALLINT,\n  --IN UNIQ BOOLEAN,\n  IN SHOW SMALLINT)\n  --IN SHOW BOOLEAN)\n BEGIN\n  DECLARE A INTEGER;\n  DECLARE B INTEGER;\n  DECLARE C INTEGER;\n  DECLARE D INTEGER;\n  DECLARE E INTEGER;\n  DECLARE F INTEGER;\n  DECLARE G INTEGER;\n  DECLARE OUT_LINE VARCHAR(2000);\n  DECLARE I SMALLINT;\n \n  DECLARE SOLUTIONS INTEGER;\n  DECLARE UORN VARCHAR(2000);\n\n  SET SOLUTIONS = 0;\n  DELETE FROM ALL_INTS;\n  DELETE FROM RESULTS;\n  SET I = LO;\n  WHILE (I <= HI) DO\n   INSERT INTO ALL_INTS VALUES (I);\n   SET I = I + 1;\n  END WHILE;\n  COMMIT;\n \n  -- Computes unique solutions.\n  IF (UNIQ = 0) THEN\n  --IF (UNIQ = TRUE) THEN\n   INSERT INTO RESULTS\n     SELECT\n      A.V A, B.V B, C.V C, D.V D, E.V E, F.V F, G.V G\n     FROM\n      ALL_INTS A, ALL_INTS B, ALL_INTS C, ALL_INTS D, ALL_INTS E, ALL_INTS F,\n      ALL_INTS G\n     WHERE\n          A.V NOT IN (B.V, C.V, D.V, E.V, F.V, G.V)\n      AND B.V NOT IN (C.V, D.V, E.V, F.V, G.V)\n      AND C.V NOT IN (D.V, E.V, F.V, G.V)\n      AND D.V NOT IN (E.V, F.V, G.V)\n      AND E.V NOT IN (F.V, G.V)\n      AND F.V NOT IN (G.V)\n      AND A.V = C.V + D.V\n      AND G.V = D.V + E.V\n      AND B.V = E.V + F.V - C.V\n     ORDER BY \n      A, B, C, D, E, F, G;\n   SET UORN = ' unique solutions in ';\n  ELSE\n   -- Compute non-unique solutions.\n   INSERT INTO RESULTS\n     SELECT\n      A.V A, B.V B, C.V C, D.V D, E.V E, F.V F, G.V G\n     FROM\n      ALL_INTS A, ALL_INTS B, ALL_INTS C, ALL_INTS D, ALL_INTS E, ALL_INTS F,\n      ALL_INTS G\n     WHERE\n          A.V = C.V + D.V\n      AND G.V = D.V + E.V\n      AND B.V = E.V + F.V - C.V\n     ORDER BY \n      A, B, C, D, E, F, G;\n   SET UORN = ' non-unique solutions in ';\n  END IF;\n  COMMIT;\n \n  -- Counts the possible solutions.\n  FOR v AS c CURSOR FOR\n    SELECT\n     A, B, C, D, E, F, G\n    FROM RESULTS\n    ORDER BY \n     A, B, C, D, E, F, G\n    DO\n   SET SOLUTIONS = SOLUTIONS + 1;\n   -- Shows the results.\n   IF (SHOW = 0) THEN\n   --IF (SHOW = TRUE) THEN\n    SET OUT_LINE = A || ' ' || B || ' ' || C || ' ' || D || ' ' || E || ' '\n      || F ||' ' || G;\n    CALL DBMS_OUTPUT.PUT_LINE(OUT_LINE);\n   END IF;\n  END FOR;\n\n  SET OUT_LINE = SOLUTIONS || UORN || LO || ' to ' || HI;\n  CALL DBMS_OUTPUT.PUT_LINE(OUT_LINE);\n END\n@\n\nCALL FOUR_SQUARES(1, 7, 0, 0)@\nCALL FOUR_SQUARES(3, 9, 0, 0)@\nCALL FOUR_SQUARES(0, 9, 1, 1)@",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_149.txt",
        "content": "db2 -td@\ndb2 => CREATE TABLE ALL_INTS ( V INTEGER )\nDB20000I  The SQL command completed successfully.\n\ndb2 => CREATE TABLE RESULTS ( A INTEGER, B INTEGER, C INTEGER, D INTEGER, E INTEGER, F INTEGER, G INTEGER )\nDB20000I  The SQL command completed successfully.\n\ndb2 => CREATE OR REPLACE PROCEDURE FOUR_SQUARES(\n...\ndb2 (cont.) => END @\nDB20000I  The SQL command completed successfully.\n\ndb2 => CALL FOUR_SQUARES(1, 7, 0, 0)\n\n  Return Status = 0\n\n3 7 2 1 5 4 6\n4 5 3 1 6 2 7\n4 7 1 3 2 6 5\n5 6 2 3 1 7 4\n6 4 1 5 2 3 7\n6 4 5 1 2 7 3\n7 2 6 1 3 5 4\n7 3 2 5 1 4 6\n8 unique solutions in 1 TO 7\n\ndb2 => CALL FOUR_SQUARES(3, 9, 0, 0)\n\n  Return Status = 0\n\n7 8 3 4 5 6 9\n8 7 3 5 4 6 9\n9 6 4 5 3 7 8\n9 6 5 4 3 8 7\n4 unique solutions in 3 TO 9\n\nCALL FOUR_SQUARES(0, 9, 1, 1)\n\n  Return Status = 0\n\n2860 non-unique solutions in 0 TO 9\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_15.txt",
        "content": "begin % -- solve the 4 rings or 4 squares puzzle i.e., find solutions to the \u00a0%\n      % -- equations: a + b = b + c + d = d + e + f = f + g                  \u00a0%\n      % -- where a, b, c, d, e, f, g in lo\u00a0: hi ( not necessarily unique )   \u00a0%\n      % -- depending on show, the solutions will be printed or not           \u00a0%\n    procedure fourRings ( integer value lo, hi; logical value allowDuplicates, show ) ;\n    begin\n        integer solutions, width, maxLimit;\n        solutions       := 0;\n        % -- calculate field width for printinhg solutions\u00a0%\n        width    := 1;\n        maxLimit := abs ( if abs lo > abs hi then lo else hi );\n        while maxLimit > 0 do begin\n            width    := width + 1;\n            maxLimit := maxLimit div 10\n        end while_maxLimit_gt_0 ;\n        % -- find solutions\u00a0%\n        for a := lo until hi do begin\n            for b := lo until hi do begin\n                if allowduplicates or a not = b then begin\n                    integer t;\n                    t := a + b;\n                    for c := lo until hi do begin\n                        if allowDuplicates\n                        or ( a not = c and b not = c )\n                        then begin\n                            integer d;\n                            d := t - ( b + c );\n                            if  d >= lo and d <= hi\n                            and ( allowduplicates\n                                or ( a not = d and b not = d and c not = d )\n                                )\n                            then begin\n                                for e := lo until hi do begin\n                                    if allowDuplicates\n                                    or ( a not = e and b not = e and c not = e and d not = e )\n                                    then begin\n                                        integer f, g;\n                                        g := d + e;\n                                        f := t - g;\n                                        if  f >= lo and f <= hi\n                                        and g >= lo and g <= hi\n                                        and ( allowDuplicates\n                                            or (   a not = f and b not = f and c not = f\n                                               and d not = f and e not = f\n                                               and a not = g and b not = g and c not = g\n                                               and d not = g and e not = g and f not = g\n                                               )\n                                            )\n                                        then begin\n                                            solutions := solutions + 1;\n                                            if show then write( i_w := width, s_w := 0, a, b, c, d, e, f, g )\n                                        end\n                                    end\n                                end for_e\n                            end\n                        end\n                    end for_c\n                end\n            end for_b\n        end for_a ;\n        write( i_w := 1, s_w := 0, solutions, if allowDuplicates then \" non-unique\" else \" unique\", \" solutions in \", lo, \" to \", hi );\n        write()\n    end % -- fourRings % ;\n\n    % -- find the solutions as required for the task\u00a0%\n    fourRings( 1, 7, false, true  );\n    fourRings( 3, 9, false, true  );\n    fourRings( 0, 9, true,  false )\nend.\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_150.txt",
        "content": "perm 7\nrename * (a b c d e f g)\nlist if a==c+d & b+c==e+f & d+e==g, noobs sep(50)\n\n  +---------------------------+\n  | a   b   c   d   e   f   g |\n  |---------------------------|\n  | 3   7   2   1   5   4   6 |\n  | 4   5   3   1   6   2   7 |\n  | 4   7   1   3   2   6   5 |\n  | 5   6   2   3   1   7   4 |\n  | 6   4   1   5   2   3   7 |\n  | 6   4   5   1   2   7   3 |\n  | 7   2   6   1   3   5   4 |\n  | 7   3   2   5   1   4   6 |\n  +---------------------------+\n\nforeach var of varlist _all {\n\treplace `var'=`var'+2\n}\nlist if a==c+d & b+c==e+f & d+e==g, noobs sep(50)\n\n  +---------------------------+\n  | a   b   c   d   e   f   g |\n  |---------------------------|\n  | 7   8   3   4   5   6   9 |\n  | 8   7   3   5   4   6   9 |\n  | 9   6   4   5   3   7   8 |\n  | 9   6   5   4   3   8   7 |\n  +---------------------------+\n\nclear\nset obs 10\ngen b=_n-1\ngen q=1\nsave temp, replace\nrename b c\njoinby q using temp\nrename b d\njoinby q using temp\nrename b e\ngen a=c+d\ngen g=d+e\ndrop if a>9 | g>9\njoinby q using temp\ngen f=b+c-e\ndrop if f<0 | f>9\ndrop q\norder a b c d e f g\nerase temp.dta\ncount\n  2,860\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_151.txt",
        "content": "set vars {a b c d e f g}\nset exprs {\n    {$a+$b}\n    {$b+$c+$d}\n    {$d+$e+$f}\n    {$f+$g}\n}\n\nproc permute {xs} {\n    if {[llength $xs] < 2} {\n        return $xs\n    }\n    set i -1\n    foreach x $xs {\n        incr i\n        set rest [lreplace $xs $i $i]\n        foreach rest [permute $rest] {\n            lappend res [list $x {*}$rest]\n        }\n    }\n    return $res\n}\n\nproc range {a b} {\n    set a [uplevel 1 [list expr $a]]\n    set b [uplevel 1 [list expr $b]]\n    set res {}\n    while {$a <= $b} {\n        lappend res $a\n        incr a\n    }\n    return $res\n}\n\nproc compile_4rings {vars exprs} {\n    set script \"set _ \\[[list expr [lindex $exprs 0]]\\]\\n\"\n    foreach expr [lrange $exprs 1 end] {\n        append script \"if {\\$_\u00a0!= $expr} {return false}\\n\"\n    }\n    append script \"return true\\n\"\n    list $vars $script\n}\n\nproc solve_4rings {vars exprs range} {\n    set lambda [compile_4rings $vars $exprs]\n    foreach values [permute $range] {\n        if {[apply $lambda {*}$values]} {\n            puts \" $values\"\n        }\n    }\n}\n\nproc compile_4rings_hard {vars exprs values} {\n    append script \"set _ \\[[list expr [lindex $exprs 0]]\\]\\n\"\n    foreach expr [lrange $exprs 1 end] {\n        append script \"if {\\$_\u00a0!= $expr} {continue}\\n\"\n    }\n    append script \"incr res\\n\"\n    foreach var $vars {\n        set script [list foreach $var $values $script]\n    }\n    set script \"set res 0\\n$script\\nreturn \\$res\"\n    list {} $script\n}\n\nproc solve_4rings_hard {vars exprs range} {\n    apply [compile_4rings_hard $vars $exprs $range]\n}\n\nputs \"# Combinations of 1..7:\"\nsolve_4rings $vars $exprs [range 1 7]\nputs \"# Combinations of 3..9:\"\nsolve_4rings $vars $exprs [range 3 9]\nputs \"# Number of solutions, free over 0..9:\"\nputs [solve_4rings_hard $vars $exprs [range 0 9]]\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_152.txt",
        "content": "# Combinations of 1..7:\n 3 7 2 1 5 4 6\n 4 5 3 1 6 2 7\n 4 7 1 3 2 6 5\n 5 6 2 3 1 7 4\n 6 4 1 5 2 3 7\n 6 4 5 1 2 7 3\n 7 2 6 1 3 5 4\n 7 3 2 5 1 4 6\n# Combinations of 3..9:\n 7 8 3 4 5 6 9\n 8 7 3 5 4 6 9\n 9 6 4 5 3 7 8\n 9 6 5 4 3 8 7\n# Number of solutions, free over 0..9:\n2860",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_153.txt",
        "content": "Dim a As Integer, b As Integer, c As Integer, d As Integer\nDim e As Integer, f As Integer, g As Integer\nDim lo As Integer, hi As Integer, unique As Boolean, show As Boolean\nDim solutions As Integer\nPrivate Sub bf()\n    For f = lo To hi\n        If ((Not unique) Or _\n            ((f <> a And f <> c And f <> d And f <> g And f <> e))) Then\n            b = e + f - c\n            If ((b >= lo) And (b <= hi) And _\n                ((Not unique) Or ((b <> a) And (b <> c) And _\n                (b <> d) And (b <> g) And (b <> e) And (b <> f)))) Then\n                solutions = solutions + 1\n                If show Then Debug.Print a; b; c; d; e; f; g\n            End If\n        End If\n    Next\nEnd Sub\nPrivate Sub ge()\n    For e = lo To hi\n        If ((Not unique) Or ((e <> a) And (e <> c) And (e <> d))) Then\n            g = d + e\n            If ((g >= lo) And (g <= hi) And _\n                ((Not unique) Or ((g <> a) And (g <> c) And _\n                (g <> d) And (g <> e)))) Then\n                bf\n            End If\n        End If\n    Next\nEnd Sub\nPrivate Sub acd()\n    For c = lo To hi\n        For d = lo To hi\n            If ((Not unique) Or (c <> d)) Then\n                a = c + d\n                If ((a >= lo) And (a <= hi) And _\n                    ((Not unique) Or ((c <> 0) And (d <> 0)))) Then\n                    ge\n                End If\n            End If\n        Next d\n    Next c\nEnd Sub\nPrivate Sub foursquares(plo As Integer, phi As Integer, punique As Boolean, pshow As Boolean)\n    lo = plo\n    hi = phi\n    unique = punique\n    show = pshow\n    solutions = 0\n    acd\n    Debug.Print\n    If unique Then\n        Debug.Print solutions; \" unique solutions in\"; lo; \"to\"; hi\n    Else\n        Debug.Print solutions; \" non-unique solutions in\"; lo; \"to\"; hi\n    End If\nEnd Sub\nPublic Sub program()\n    Call foursquares(1, 7, True, True)\n    Debug.Print\n    Call foursquares(3, 9, True, True)\n    Call foursquares(0, 9, False, False)\nEnd Sub\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_154.txt",
        "content": "4  7  1  3  2  6  5 \n6  4  1  5  2  3  7 \n3  7  2  1  5  4  6 \n5  6  2  3  1  7  4 \n7  3  2  5  1  4  6 \n4  5  3  1  6  2  7 \n6  4  5  1  2  7  3 \n7  2  6  1  3  5  4 \n\n8  unique solutions in 1 to 7 \n\n7  8  3  4  5  6  9 \n8  7  3  5  4  6  9 \n9  6  4  5  3  7  8 \n9  6  5  4  3  8  7 \n\n4  unique solutions in 3 to 9 \n\n2860  non-unique solutions in 0 to 9 \n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_155.txt",
        "content": "Module Module1\n\n    Dim CA As Char() = \"0123456789ABC\".ToCharArray()\n\n    Sub FourSquare(lo As Integer, hi As Integer, uni As Boolean, sy As Char())\n        If sy IsNot Nothing Then Console.WriteLine(\"a b c d e f g\" & vbLf & \"-------------\")\n        Dim r = Enumerable.Range(lo, hi - lo + 1).ToList(), u As New List(Of Integer),\n            t As Integer, cn As Integer = 0\n        For Each a In r\n            u.Add(a)\n            For Each b In r\n                If uni AndAlso u.Contains(b) Then Continue For\n                u.Add(b)\n                t = a + b\n                For Each c In r : If uni AndAlso u.Contains(c) Then Continue For\n                    u.Add(c)\n                    For d = a - c To a - c\n                        If d < lo OrElse d > hi OrElse uni AndAlso u.Contains(d) OrElse\n                            t <> b + c + d Then Continue For\n                        u.Add(d)\n                        For Each e In r\n                            If uni AndAlso u.Contains(e) Then Continue For\n                            u.Add(e)\n                            For f = b + c - e To b + c - e\n                                If f < lo OrElse f > hi OrElse uni AndAlso u.Contains(f) OrElse\n                                    t <> d + e + f Then Continue For\n                                u.Add(f)\n                                For g = t - f To t - f : If g < lo OrElse g > hi OrElse\n                                    uni AndAlso u.Contains(g) Then Continue For\n                                    cn += 1 : If sy IsNot Nothing Then _\n                                        Console.WriteLine(\"{0} {1} {2} {3} {4} {5} {6}\",\n                                            sy(a), sy(b), sy(c), sy(d), sy(e), sy(f), sy(g))\n                                Next : u.Remove(f) : Next : u.Remove(e) : Next : u.Remove(d)\n                    Next : u.Remove(c) : Next : u.Remove(b) : Next : u.Remove(a)\n        Next : Console.WriteLine(\"{0} {1}unique solutions for [{2},{3}]{4}\",\n                                 cn, If(uni, \"\", \"non-\"), lo, hi, vbLf)\n    End Sub\n\n    Sub main()\n        fourSquare(1, 7, True, CA)\n        fourSquare(3, 9, True, CA)\n        fourSquare(0, 9, False, Nothing)\n        fourSquare(5, 12, True, CA)\n    End Sub\n\nEnd Module\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_156.txt",
        "content": "a b c d e f g\n-------------\n3 7 2 1 5 4 6\n4 5 3 1 6 2 7\n4 7 1 3 2 6 5\n5 6 2 3 1 7 4\n6 4 1 5 2 3 7\n6 4 5 1 2 7 3\n7 2 6 1 3 5 4\n7 3 2 5 1 4 6\n8 unique solutions for [1,7]\n\na b c d e f g\n-------------\n7 8 3 4 5 6 9\n8 7 3 5 4 6 9\n9 6 4 5 3 7 8\n9 6 5 4 3 8 7\n4 unique solutions for [3,9]\n\n2860 non-unique solutions for [0,9]\n\na b c d e f g\n-------------\nB 9 6 5 7 8 C\nB A 6 5 7 9 C\nC 8 7 5 6 9 B\nC 9 7 5 6 A B\n4 unique solutions for [5,12]",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_157.txt",
        "content": "fn main(){\n\tmut n, mut c := get_combs(1,7,true)\n\tprintln(\"$n unique solutions in 1 to 7\")\n\tprintln(c)\n\tn, c = get_combs(3,9,true)\n\tprintln(\"$n unique solutions in 3 to 9\")\n\tprintln(c)\n\tn, _ = get_combs(0,9,false)\n\tprintln(\"$n non-unique solutions in 0 to 9\")\n}\n \nfn get_combs(low int,high int,unique bool) (int, [][]int) {\n    mut num := 0\n    mut valid_combs := [][]int{}\n\tfor a := low; a <= high; a++ {\n\t\tfor b := low; b <= high; b++ {\n\t\t\tfor c := low; c <= high; c++ {\n\t\t\t\tfor d := low; d <= high; d++ {\n\t\t\t\t\tfor e := low; e <= high; e++ {\n\t\t\t\t\t\tfor f := low; f <= high; f++ {\n\t\t\t\t\t\t\tfor g := low; g <= high; g++ {\n\t\t\t\t\t\t\t\tif valid_comb(a,b,c,d,e,f,g) {\n\t\t\t\t\t\t\t\t\tif !unique || is_unique(a,b,c,d,e,f,g) {\n\t\t\t\t\t\t\t\t\t\tnum++\n\t\t\t\t\t\t\t\t\t\tvalid_combs << [a,b,c,d,e,f,g]\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn num, valid_combs\n}\nfn is_unique(a int,b int,c int,d int,e int,f int,g int) bool {\n\tmut data := map[int]int{}\n\tdata[a]++\n\tdata[b]++\n\tdata[c]++\n\tdata[d]++\n\tdata[e]++\n\tdata[f]++\n\tdata[g]++\n\treturn data.len == 7\n}\nfn valid_comb(a int,b int,c int,d int,e int,f int,g int) bool {\n\tsquare1 := a + b\n\tsquare2 := b + c + d\n\tsquare3 := d + e + f\n\tsquare4 := f + g\n\treturn square1 == square2 && square2 == square3 && square3 == square4\n}\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_158.txt",
        "content": "8 unique solutions in 1 to 7\n[[3, 7, 2, 1, 5, 4, 6], [4, 5, 3, 1, 6, 2, 7], [4, 7, 1, 3, 2, 6, 5], [5, 6, 2, 3, 1, 7, 4], [6, 4, 1, 5, 2, 3, 7], [6, 4, 5, 1, 2, 7, 3], [7, 2, 6, 1, 3, 5, 4], [7, 3, 2, 5, 1, 4, 6]]\n4 unique solutions in 3 to 9\n[[7, 8, 3, 4, 5, 6, 9], [8, 7, 3, 5, 4, 6, 9], [9, 6, 4, 5, 3, 7, 8], [9, 6, 5, 4, 3, 8, 7]]\n2860 non-unique solutions in 0 to 9\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_159.txt",
        "content": "import math.bits\n\nfn main ( ) {\n\tmut n := 0\n\tmut t := []u8{len:7}\n\t\n\tn = solve ( 0, mut t, 1, 7, true )\n\tprintln ( \"$n unique solutions in 1 to 7\" )\n\tn = solve ( 0, mut t, 3, 9, true )\n\tprintln(\"$n unique solutions in 3 to 9\")\n\tn = solve ( 0, mut t, 0, 9, false )\n\tprintln(\"$n non-unique solutions in 0 to 9\")\n}\n\nfn solve ( lvl u8, mut t []u8, low u8, high u8,unique bool ) int {\n\tif lvl==7 { \n\t\treturn int(suma(t) && (!unique || isunique( t )))\n\t} \n\tmut cnt:=0\n\tfor v := low; v <= high; v++ {\n\t\tt[lvl] = v\n\t\tcnt += solve ( lvl + 1, mut t, low, high, unique )\n\t}\n\treturn cnt\n}\n\n@[inline]\nfn isunique ( t []u8 ) bool {\n\treturn bits.ones_count_32(u32(1)<<t[0] | 1<<t[1] | 1<<t[2] | 1<<t[3] | 1<<t[4] | 1<<t[5] | 1<<t[6]) == 7\n}\n\nfn suma ( t []u8 ) bool {\n\ts1 := t[0] + t[1]\n\ts2 := t[1] + t[2] + t[3]\n\ts3 := t[3] + t[4] + t[5]\n\ts4 := t[5] + t[6]\n\treturn s1 == s2 && s2 == s3 && s3 == s4\t\n}\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_16.txt",
        "content": " 3 7 2 1 5 4 6\n 4 5 3 1 6 2 7\n 4 7 1 3 2 6 5\n 5 6 2 3 1 7 4\n 6 4 1 5 2 3 7\n 6 4 5 1 2 7 3\n 7 2 6 1 3 5 4\n 7 3 2 5 1 4 6\n8 unique solutions in 1 to 7\n\n 7 8 3 4 5 6 9\n 8 7 3 5 4 6 9\n 9 6 4 5 3 7 8\n 9 6 5 4 3 8 7\n4 unique solutions in 3 to 9\n\n2860 non-unique solutions in 0 to 9\n\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_160.txt",
        "content": "8 unique solutions in 1 to 7\n4 unique solutions in 3 to 9\n2860 non-unique solutions in 0 to 9\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_161.txt",
        "content": "import \"./fmt\" for Fmt\n\nvar a = 0\nvar b = 0\nvar c = 0\nvar d = 0\nvar e = 0\nvar f = 0\nvar g = 0\n\nvar lo\nvar hi\nvar unique\nvar show\nvar solutions\n\nvar bf = Fn.new {\n    f = lo\n    while (f <= hi) {\n        if (!unique || (f != a && f != c && f != d && f != e && f != g)) {\n            b = e + f - c\n            if (b >= lo && b <= hi &&\n               (!unique || (b != a && b != c && b != d && b != e && b != f && b != g))) {\n                    solutions = solutions + 1\n                    if (show) Fmt.lprint(\"$d $d $d $d $d $d $d\", [a, b, c, d, e, f, g])\n            }\n        }\n        f = f + 1\n    }\n}\n\nvar ge = Fn.new {\n    e = lo\n    while (e <= hi) {\n        if (!unique || (e != a && e != c && e != d)) {\n            g = d + e\n            if (g >= lo && g <= hi &&\n                (!unique || (g != a && g != c && g != d && g != e))) bf.call()\n        }\n        e = e + 1\n    }\n}\n\nvar acd = Fn.new {\n    c = lo\n    while (c <= hi) {\n        d = lo\n        while (d <= hi) {\n            if (!unique || c != d) {\n                a = c + d\n                if (a >= lo && a <= hi && (!unique || (c != 0 && d != 0))) ge.call()\n            }\n            d = d + 1\n        }\n        c = c + 1\n    }\n}\n\nvar foursquares = Fn.new { |plo, phi, punique, pshow|\n    lo = plo\n    hi = phi\n    unique = punique\n    show = pshow\n    solutions = 0\n    if (show) {\n        System.print(\"\\na b c d e f g\")\n        System.print(\"-------------\")\n    }\n    acd.call()\n    if (unique) {\n        Fmt.print(\"\\n$d unique solutions in $d to $d\", solutions, lo, hi)\n    } else {\n        Fmt.print(\"\\n$d non-unique solutions in $d to $d\\n\", solutions, lo, hi)\n    }\n}\n\nfoursquares.call(1, 7, true, true)\nfoursquares.call(3, 9, true, true)\nfoursquares.call(0, 9, false, false)\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_162.txt",
        "content": "a b c d e f g\n-------------\n4 7 1 3 2 6 5\n6 4 1 5 2 3 7\n3 7 2 1 5 4 6\n5 6 2 3 1 7 4\n7 3 2 5 1 4 6\n4 5 3 1 6 2 7\n6 4 5 1 2 7 3\n7 2 6 1 3 5 4\n\n8 unique solutions in 1 to 7\n\na b c d e f g\n-------------\n7 8 3 4 5 6 9\n8 7 3 5 4 6 9\n9 6 4 5 3 7 8\n9 6 5 4 3 8 7\n\n4 unique solutions in 3 to 9\n\n2860 non-unique solutions in 0 to 9\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_163.txt",
        "content": "int  Show, Low, High, Digit(7\\a..g\\), Count;\nproc Rings(Level);\nint  Level; \\of recursion\nint  D, Temp, I, Set;\n[for D:= Low to High do\n    [Digit(Level):= D;\n    if Level < 7-1 then Rings(Level+1)\n    else [  Temp:= Digit(0) + Digit(1); \\solution?\n         if Temp = Digit(1) + Digit(2) + Digit(3) and\n            Temp = Digit(3) + Digit(4) + Digit(5) and\n            Temp = Digit(5) + Digit(6) then\n                [Count:= Count+1;\n                if Show then\n                    [Set:= 0;           \\digits must be unique\n                    for I:= 0 to 7-1 do\n                        Set:= Set\u00a0! 1<<Digit(I);\n                    if Set = %111_1111 << Low then\n                        [for I:= 0 to 7-1 do\n                            [IntOut(0, Digit(I));  ChOut(0, ^ )];\n                        CrLf(0);\n                        ];\n                    ];\n                ];\n         ];\n    ];\n];\n\n[Show:= true;\nLow:= 1;  High:= 7;\nRings(0);\nCrLf(0);\nLow:= 3;  High:= 9;\nRings(0);\nCrLf(0);\nShow:= false;\nLow:= 0;  High:= 9;  Count:= 0;  \nRings(0);\nIntOut(0, Count);\nCrLf(0);\n]",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_164.txt",
        "content": "3 7 2 1 5 4 6 \n4 5 3 1 6 2 7 \n4 7 1 3 2 6 5 \n5 6 2 3 1 7 4 \n6 4 1 5 2 3 7 \n6 4 5 1 2 7 3 \n7 2 6 1 3 5 4 \n7 3 2 5 1 4 6 \n\n7 8 3 4 5 6 9 \n8 7 3 5 4 6 9 \n9 6 4 5 3 7 8 \n9 6 5 4 3 8 7 \n\n2860\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_165.txt",
        "content": "fourSquare(1,7,true,true)\nfourSquare(3,9,true,true)\nfourSquare(0,9,false,false)\n\n \nsub fourSquare(low, high, unique, prin)\n    local count, a, b, c, d, e, f, g, fp\n \n    if (prin) print \"a b c d e f g\"\n\n    for a = low to high\n        for b = low to high\n            if (not valid(unique, a, b)) continue\n \n            fp = a+b\n            for c = low to high\n                if (not valid(unique, c, a, b)) continue\n                for d = low to high\n                    if (not valid(unique, d, a, b, c)) continue\n                    if (fp <> b+c+d) continue\n \n                    for e = low to high\n                        if (not valid(unique, e, a, b, c, d)) continue\n                        for f = low to high\n                            if (not valid(unique, f, a, b, c, d, e)) continue\n                            if (fp <> d+e+f) continue\n \n                            for g = low to high\n                                if (not valid(unique, g, a, b, c, d, e, f)) continue\n                                if (fp <> f+g) continue\n \n                                count = count + 1\n                                if (prin) print a,\" \",b,\" \",c,\" \",d,\" \",e,\" \",f,\" \",g\n                            next\n                        next\n                    next\n                next\n            next\n        next\n    next\n    if (unique) then\n        print \"There are \", count, \" unique solutions in [\",low,\",\",high,\"]\"\n    else\n        print \"There are \", count, \" non-unique solutions in [\",low,\",\",high,\"]\"\n    end if\nend sub\n \nsub valid(unique, needle, n1, n2, n3, n4, n5, n6)\n    local i\n    \n    if (unique) then\n        for i = 1 to numparams - 2\n            switch i\n                case 1: if needle = n1 return false\u00a0: break\n                case 2: if needle = n2 return false\u00a0: break\n                case 3: if needle = n3 return false\u00a0: break\n                case 4: if needle = n4 return false\u00a0: break\n                case 5: if needle = n5 return false\u00a0: break\n                case 6: if needle = n6 return false\u00a0: break\n            end switch\n        next\n    end if\n    return true\nend sub",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_166.txt",
        "content": "a b c d e f g\n3 7 2 1 5 4 6\n4 5 3 1 6 2 7\n4 7 1 3 2 6 5\n5 6 2 3 1 7 4\n6 4 1 5 2 3 7\n6 4 5 1 2 7 3\n7 2 6 1 3 5 4\n7 3 2 5 1 4 6\nThere are 8 unique solutions in [1,7]\na b c d e f g\n7 8 3 4 5 6 9\n8 7 3 5 4 6 9\n9 6 4 5 3 7 8\n9 6 5 4 3 8 7\nThere are 4 unique solutions in [3,9]\nThere are 2860 non-unique solutions in [0,9]",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_167.txt",
        "content": "const std = @import(\"std\");\nconst Allocator = std.mem.Allocator;\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_168.txt",
        "content": "pub fn main() !void {\n    const stdout = std.io.getStdOut().writer();\n\n    var gpa = std.heap.GeneralPurposeAllocator(.{}){};\n    defer {\n        const ok = gpa.deinit();\n        std.debug.assert(ok == .ok);\n    }\n    const allocator = gpa.allocator();\n\n    {\n        const nc = try getCombs(allocator, 1, 7, true);\n        defer allocator.free(nc.combinations);\n        try stdout.print(\"{d} unique solutions in 1 to 7\\n\", .{nc.num});\n        try stdout.print(\"{any}\\n\", .{nc.combinations});\n    }\n    {\n        const nc = try getCombs(allocator, 3, 9, true);\n        defer allocator.free(nc.combinations);\n        try stdout.print(\"{d} unique solutions in 3 to 9\\n\", .{nc.num});\n        try stdout.print(\"{any}\\n\", .{nc.combinations});\n    }\n    {\n        const nc = try getCombs(allocator, 0, 9, false);\n        defer allocator.free(nc.combinations);\n        try stdout.print(\"{d} non-unique solutions in 0 to 9\\n\", .{nc.num});\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_169.txt",
        "content": "/// Caller owns combinations slice memory.\nfn getCombs(allocator: Allocator, low: u16, high: u16, unique: bool) !struct { num: usize, combinations: [][7]usize } {\n    var num: usize = 0;\n    var valid_combinations = std.ArrayList([7]usize).init(allocator);\n    for (low..high + 1) |a|\n        for (low..high + 1) |b|\n            for (low..high + 1) |c|\n                for (low..high + 1) |d|\n                    for (low..high + 1) |e|\n                        for (low..high + 1) |f|\n                            for (low..high + 1) |g|\n                                if (validComb(a, b, c, d, e, f, g))\n                                    if (!unique or try isUnique(allocator, a, b, c, d, e, f, g)) {\n                                        num += 1;\n                                        try valid_combinations.append([7]usize{ a, b, c, d, e, f, g });\n                                    };\n    return .{ .num = num, .combinations = try valid_combinations.toOwnedSlice() };\n}\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_17.txt",
        "content": "use framework \"Foundation\" -- for basic NSArray sort\n\non run\n    unlines({\"rings(true, enumFromTo(1, 7))\\n\", \u00ac\n        map(show, (rings(true, enumFromTo(1, 7)))), \u00ac\n        \"\\nrings(true, enumFromTo(3, 9))\\n\", \u00ac\n        map(show, (rings(true, enumFromTo(3, 9)))), \u00ac\n        \"\\nlength(rings(false, enumFromTo(0, 9)))\\n\", \u00ac\n        show(|length|(rings(false, enumFromTo(0, 9))))})\nend run\n\n-- RINGS -----------------------------------------------------------------------\n\n-- rings\u00a0:: noRepeatedDigits -> DigitList -> Lists of solutions\n-- rings\u00a0:: Bool -> [Int] -> [[Int]]\non rings(u, digits)\n    set ds to reverse_(sort(digits))\n    set h to head(ds)\n    \n    -- QUEEN -------------------------------------------------------------------\n    script queen\n        on |\u03bb|(q)\n            script\n                on |\u03bb|(x)\n                    x + q \u2264 h\n                end |\u03bb|\n            end script\n            set ts to filter(result, ds)\n            if u then\n                set bs to delete_(q, ts)\n            else\n                set bs to ds\n            end if\n            \n            -- LEFT BISHOP and its ROOK-----------------------------------------\n            script leftBishop\n                on |\u03bb|(lb)\n                    set lRook to lb + q\n                    if lRook > h then\n                        {}\n                    else\n                        if u then\n                            set rbs to difference(ts, {q, lb, lRook})\n                        else\n                            set rbs to ds\n                        end if\n                        \n                        -- RIGHT BISHOP and its ROOK ---------------------------\n                        script rightBishop\n                            on |\u03bb|(rb)\n                                set rRook to rb + q\n                                if (rRook > h) or (u and (rRook = lb)) then\n                                    {}\n                                else\n                                    set rookDelta to lRook - rRook\n                                    if u then\n                                        set ks to difference(ds, \u00ac\n                                            {q, lb, rb, rRook, lRook})\n                                    else\n                                        set ks to ds\n                                    end if\n                                    \n                                    -- KNIGHTS LEFT AND RIGHT ------------------\n                                    script knights\n                                        on |\u03bb|(k)\n                                            set k2 to k + rookDelta\n                                            \n                                            if elem(k2, ks) and ((not u) or \u00ac\n                                                notElem(k2, \u00ac\n                                                    {lRook, k, lb, q, rb, rRook})) then\n                                                {{lRook, k, lb, q, rb, k2, rRook}}\n                                            else\n                                                {}\n                                            end if\n                                        end |\u03bb|\n                                    end script\n                                    \n                                    concatMap(knights, ks)\n                                end if\n                            end |\u03bb|\n                        end script\n                        \n                        concatMap(rightBishop, rbs)\n                    end if\n                end |\u03bb|\n            end script\n            \n            concatMap(leftBishop, bs)\n        end |\u03bb|\n    end script\n    \n    concatMap(queen, ds)\nend rings\n\n-- GENERIC FUNCTIONS -----------------------------------------------------------\n\n-- concatMap\u00a0:: (a -> [b]) -> [a] -> [b]\non concatMap(f, xs)\n    set lst to {}\n    set lng to length of xs\n    tell mReturn(f)\n        repeat with i from 1 to lng\n            set lst to (lst & |\u03bb|(contents of item i of xs, i, xs))\n        end repeat\n    end tell\n    return lst\nend concatMap\n\n-- delete\u00a0:: Eq a => a -> [a] -> [a]\non delete_(x, xs)\n    set mbIndex to elemIndex(x, xs)\n    set lng to length of xs\n    \n    if mbIndex is not missing value then\n        if lng > 1 then\n            if mbIndex = 1 then\n                items 2 thru -1 of xs\n            else if mbIndex = lng then\n                items 1 thru -2 of xs\n            else\n                tell xs to items 1 thru (mbIndex - 1) & \u00ac\n                    items (mbIndex + 1) thru -1\n            end if\n        else\n            {}\n        end if\n    else\n        xs\n    end if\nend delete_\n\n-- difference\u00a0:: [a] -> [a] -> [a]\non difference(xs, ys)\n    script mf\n        on except(a, y)\n            if a contains y then\n                my delete_(y, a)\n            else\n                a\n            end if\n        end except\n    end script\n    \n    foldl(except of mf, xs, ys)\nend difference\n\n-- elem\u00a0:: Eq a => a -> [a] -> Bool\non elem(x, xs)\n    xs contains x\nend elem\n\n-- elemIndex\u00a0:: a -> [a] -> Maybe Int\non elemIndex(x, xs)\n    set lng to length of xs\n    repeat with i from 1 to lng\n        if x = (item i of xs) then return i\n    end repeat\n    return missing value\nend elemIndex\n\n-- enumFromTo\u00a0:: Int -> Int -> [Int]\non enumFromTo(m, n)\n    if n < m then\n        set d to -1\n    else\n        set d to 1\n    end if\n    set lst to {}\n    repeat with i from m to n by d\n        set end of lst to i\n    end repeat\n    return lst\nend enumFromTo\n\n-- filter\u00a0:: (a -> Bool) -> [a] -> [a]\non filter(f, xs)\n    tell mReturn(f)\n        set lst to {}\n        set lng to length of xs\n        repeat with i from 1 to lng\n            set v to item i of xs\n            if |\u03bb|(v, i, xs) then set end of lst to v\n        end repeat\n        return lst\n    end tell\nend filter\n\n-- foldl\u00a0:: (a -> b -> a) -> a -> [b] -> a\non foldl(f, startValue, xs)\n    tell mReturn(f)\n        set v to startValue\n        set lng to length of xs\n        repeat with i from 1 to lng\n            set v to |\u03bb|(v, item i of xs, i, xs)\n        end repeat\n        return v\n    end tell\nend foldl\n\n-- head\u00a0:: [a] -> a\non head(xs)\n    if length of xs > 0 then\n        item 1 of xs\n    else\n        missing value\n    end if\nend head\n\n-- intercalate\u00a0:: Text -> [Text] -> Text\non intercalate(strText, lstText)\n    set {dlm, my text item delimiters} to {my text item delimiters, strText}\n    set strJoined to lstText as text\n    set my text item delimiters to dlm\n    return strJoined\nend intercalate\n\n-- length\u00a0:: [a] -> Int\non |length|(xs)\n    length of xs\nend |length|\n\n-- map\u00a0:: (a -> b) -> [a] -> [b]\non map(f, xs)\n    tell mReturn(f)\n        set lng to length of xs\n        set lst to {}\n        repeat with i from 1 to lng\n            set end of lst to |\u03bb|(item i of xs, i, xs)\n        end repeat\n        return lst\n    end tell\nend map\n\n-- Lift 2nd class handler function into 1st class script wrapper \n-- mReturn\u00a0:: Handler -> Script\non mReturn(f)\n    if class of f is script then\n        f\n    else\n        script\n            property |\u03bb| : f\n        end script\n    end if\nend mReturn\n\n-- notElem\u00a0:: Eq a => a -> [a] -> Bool\non notElem(x, xs)\n    xs does not contain x\nend notElem\n\n-- reverse_\u00a0:: [a] -> [a]\non |reverse|:xs\n    if class of xs is text then\n        (reverse of characters of xs) as text\n    else\n        reverse of xs\n    end if\nend |reverse|:\n\n-- show\u00a0:: a -> String\non show(e)\n    set c to class of e\n    if c = list then\n        script serialized\n            on |\u03bb|(v)\n                show(v)\n            end |\u03bb|\n        end script\n        \n        \"[\" & intercalate(\", \", map(serialized, e)) & \"]\"\n    else if c = record then\n        script showField\n            on |\u03bb|(kv)\n                set {k, ev} to kv\n                \"\\\"\" & k & \"\\\":\" & show(ev)\n            end |\u03bb|\n        end script\n        \n        \"{\" & intercalate(\", \", \u00ac\n            map(showField, zip(allKeys(e), allValues(e)))) & \"}\"\n    else if c = date then\n        \"\\\"\" & iso8601Z(e) & \"\\\"\"\n    else if c = text then\n        \"\\\"\" & e & \"\\\"\"\n    else if (c = integer or c = real) then\n        e as text\n    else if c = class then\n        \"null\"\n    else\n        try\n            e as text\n        on error\n            (\"\u00ab\" & c as text) & \"\u00bb\"\n        end try\n    end if\nend show\n\n-- sort\u00a0:: [a] -> [a]\non sort(xs)\n    ((current application's NSArray's arrayWithArray:xs)'s \u00ac\n        sortedArrayUsingSelector:\"compare:\") as list\nend sort\n\n-- unlines\u00a0:: [String] -> String\non unlines(xs)\n    intercalate(linefeed, xs)\nend unlines\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_170.txt",
        "content": "fn isUnique(allocator: Allocator, a: usize, b: usize, c: usize, d: usize, e: usize, f: usize, g: usize) !bool {\n    var data = std.AutoArrayHashMap(usize, void).init(allocator);\n    defer data.deinit();\n    try data.put(a, {});\n    try data.put(b, {});\n    try data.put(c, {});\n    try data.put(d, {});\n    try data.put(e, {});\n    try data.put(f, {});\n    try data.put(g, {});\n    return data.count() == 7;\n}\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_171.txt",
        "content": "fn validComb(a: usize, b: usize, c: usize, d: usize, e: usize, f: usize, g: usize) bool {\n    const square1 = a + b;\n    const square2 = b + c + d;\n    const square3 = d + e + f;\n    const square4 = f + g;\n    return square1 == square2 and square2 == square3 and square3 == square4;\n}\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_172.txt",
        "content": "8 unique solutions in 1 to 7\n{ { 3, 7, 2, 1, 5, 4, 6 }, { 4, 5, 3, 1, 6, 2, 7 }, { 4, 7, 1, 3, 2, 6, 5 }, { 5, 6, 2, 3, 1, 7, 4 }, { 6, 4, 1, 5, 2, 3, 7 }, { 6, 4, 5, 1, 2, 7, 3 }, { 7, 2, 6, 1, 3, 5, 4 }, { 7, 3, 2, 5, 1, 4, 6 } }\n4 unique solutions in 3 to 9\n{ { 7, 8, 3, 4, 5, 6, 9 }, { 8, 7, 3, 5, 4, 6, 9 }, { 9, 6, 4, 5, 3, 7, 8 }, { 9, 6, 5, 4, 3, 8, 7 } }\n2860 non-unique solutions in 0 to 9",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_173.txt",
        "content": "const print = @import(\"std\").debug.print;\n\nvar cnt: u32 = 0;\nvar t: [7]u8 = .{0} ** 7;\n\nfn sum() bool {\n    const s1 = t[0] + t[1];\n    const s2 = t[1] + t[2] + t[3];\n    const s3 = t[3] + t[4] + t[5];\n    const s4 = t[5] + t[6];\n    return s1 == s2 and s2 == s3 and s3 == s4;\n}\n\nfn valid(comptime min: u16) bool {\n    if (sum()) {\n        var s: u16 = 0;\n        inline for (t) |v| {\n            s |= @as(u16, 1) << @intCast(v - min);\n        }\n        return s == 0x7F;\n    }\n    return false;\n}\n\nfn valid_non_unique(comptime min: u16) bool {\n    _ = min;\n    return sum();\n}\n\nfn solver(lvl: u32, comptime min: u16, comptime max: u16, comptime f_valid: fn (comptime u16) bool) bool {\n    if (lvl == 7) return f_valid(min);\n    for (min..max) |i| {\n        t[lvl] = @intCast(i);\n        if (solver(lvl + 1, min, max, f_valid)) cnt += 1;\n    }\n    return false;\n}\n\nfn solve(comptime min: u8, comptime max: u8, comptime f: fn (comptime u16) bool) void {\n    cnt = 0;\n    _ = solver(0, min, max + 1, f);\n    const str = if (f == valid) \"\" else \"non-\";\n    print(\"{d} {s}unique solutions in {} to {}\\n\", .{ cnt, str, min, max });\n}\n\npub fn main() void {\n    solve(1, 7, valid);\n    solve(3, 9, valid);\n    solve(0, 9, valid_non_unique);\n}\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_174.txt",
        "content": "8 unique solutions in 1 to 7                                                                                                                                                              \n4 unique solutions in 3 to 9                                                                                                                                                              \n2860 non-unique solutions in 0 to 9                                                                                                                                                       \n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_175.txt",
        "content": "    // unique: No repeated numbers in solution\nfcn fourSquaresPuzzle(lo=1,hi=7,unique=True){  //-->list of solutions\n   _assert_(0<=lo and hi<36);\n   notUnic:=fcn(a,b,c,etc){ abc:=vm.arglist; // use base 36, any repeated character?\n      abc.apply(\"toString\",36).concat().unique().len()!=abc.len()\n   };\n   s:=List();\t\t// solutions\n   foreach a,b,c in ([lo..hi],[lo..hi],[lo..hi]){ // chunk to reduce unique\n      if(unique and notUnic(a,b,c)) continue;     // solution space. Slow VM\n      foreach d,e in ([lo..hi],[lo..hi]){\t  // -->for d { for e {} }\n         if(unique and notUnic(a,b,c,d,e)) continue;\n\t foreach f,g in ([lo..hi],[lo..hi]){\n\t    if(unique and notUnic(a,b,c,d,e,f,g)) continue;\n\t    sqr1,sqr2,sqr3,sqr4\u00a0:= a+b,b+c+d,d+e+f,f+g;\n\t    if((sqr1==sqr2==sqr3) and sqr1==sqr4) s.append(T(a,b,c,d,e,f,g));\n\t }\n      }\n   }\n   s\n}",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_176.txt",
        "content": "fcn show(solutions,msg){\n   if(not solutions){ println(\"No solutions for\",msg); return(); }\n\n   println(solutions.len(),msg,\" solutions found:\");\n   w:=(1).max(solutions.pump(List,(0).max,\"numDigits\")); // max width of any number found\n   fmt:=\" \" + \"%%%ds \".fmt(w)*7;  // eg \" %1s %1s %1s %1s %1s %1s %1s\"\n   println(fmt.fmt([\"a\"..\"g\"].walk().xplode()));\n   println(\"-\"*((w+1)*7 + 1));\t  // calculate the width of horizontal bar\n   foreach s in (solutions){ println(fmt.fmt(s.xplode())) }\n}\nfourSquaresPuzzle()\u00a0: show(_,\" unique (1-7)\");      println();\nfourSquaresPuzzle(3,9)\u00a0: show(_,\" unique (3-9)\");   println();\nfourSquaresPuzzle(5,12)\u00a0: show(_,\" unique (5-12)\"); println();\nprintln(fourSquaresPuzzle(0,9,False).len(),\t// 10^7 possibilities\n   \" non-unique (0-9) solutions found.\");",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_177.txt",
        "content": "8 unique (1-7) solutions found:\n a b c d e f g \n---------------\n 3 7 2 1 5 4 6 \n 4 5 3 1 6 2 7 \n 4 7 1 3 2 6 5 \n 5 6 2 3 1 7 4 \n 6 4 1 5 2 3 7 \n 6 4 5 1 2 7 3 \n 7 2 6 1 3 5 4 \n 7 3 2 5 1 4 6 \n\n4 unique (3-9) solutions found:\n a b c d e f g \n---------------\n 7 8 3 4 5 6 9 \n 8 7 3 5 4 6 9 \n 9 6 4 5 3 7 8 \n 9 6 5 4 3 8 7 \n\n4 unique (5-12) solutions found:\n  a  b  c  d  e  f  g \n----------------------\n 11  9  6  5  7  8 12 \n 11 10  6  5  7  9 12 \n 12  8  7  5  6  9 11 \n 12  9  7  5  6 10 11 \n\n2860 non-unique (0-9) solutions found.\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_18.txt",
        "content": "rings(true, enumFromTo(1, 7))\n\n[7, 3, 2, 5, 1, 4, 6]\n[6, 4, 1, 5, 2, 3, 7]\n[5, 6, 2, 3, 1, 7, 4]\n[4, 7, 1, 3, 2, 6, 5]\n[7, 2, 6, 1, 3, 5, 4]\n[6, 4, 5, 1, 2, 7, 3]\n[4, 5, 3, 1, 6, 2, 7]\n[3, 7, 2, 1, 5, 4, 6]\n\nrings(true, enumFromTo(3, 9))\n\n[9, 6, 4, 5, 3, 7, 8]\n[8, 7, 3, 5, 4, 6, 9]\n[9, 6, 5, 4, 3, 8, 7]\n[7, 8, 3, 4, 5, 6, 9]\n\nlength(rings(false, enumFromTo(0, 9)))\n\n2860",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_19.txt",
        "content": " 100 TRUE =  NOT FALSE\n 110 PLO = 1:PHI = 7:PUNIQUE = TRUE:PSHOW = TRUE: GOSUB 150\"FOURSQUARES\"\n 120 PLO = 3:PHI = 9:PUNIQUE = TRUE:PSHOW = TRUE: GOSUB 150\"FOURSQUARES\"\n 130 PLO = 0:PHI = 9:PUNIQUE = FALSE:PSHOW = FALSE: GOSUB 150\"FOURSQUARES\"\n 140  END \n 150 LO = PLO\n 160 HI = PHI\n 170 UNIQUE = PUNIQUE\n 180 SHOW = PSHOW\n 190 S = 0: REM SOLUTIONS\n 200  PRINT \n 210  GOSUB 270\"ACD\"\n 220  PRINT \n 230  PRINT S\" \";\n 240  IF  NOT UNIQUE THEN  PRINT \"NON-\";\n 250  PRINT \"UNIQUE SOLUTIONS IN \"LO\" TO \"HI\n 260  RETURN \n 270  FOR C = LO TO HI\n 280      FOR D = LO TO HI\n 290          IF ( NOT UNIQUE) OR (C <  > D) THEN A = C + D: IF (A >  = LO) AND (A <  = HI) AND (( NOT UNIQUE) OR ((C <  > 0) AND (D <  > 0))) THEN  GOSUB 320\"GE\"\n 300  NEXT D,C\n 310  RETURN \n 320  FOR E = LO TO HI\n 330      IF ( NOT UNIQUE) OR ((E <  > A) AND (E <  > C) AND (E <  > D)) THEN G = D + E: IF (G >  = LO) AND (G <  = HI) AND (( NOT UNIQUE) OR ((G <  > A) AND (G <  > C) AND (G <  > D) AND (G <  > E))) THEN  GOSUB 360\"BF\"\n 340  NEXT E\n 350  RETURN \n 360  FOR F = LO TO HI\n 370      IF (( NOT UNIQUE) OR ((F <  > A) AND (F <  > C) AND (F <  > D) AND (F <  > G) AND (F <  > E))) THEN  GOSUB 400\n 380  NEXT F\n 390  RETURN \n 400 B = E + F - C: IF ((B >  = LO) AND (B <  = HI) AND (( NOT UNIQUE) OR ((B <  > A) AND (B <  > C) AND (B <  > D) AND (B <  > G) AND (B <  > E) AND (B <  > F)))) THEN S = S + 1: IF (SHOW) THEN  PRINT A\" \"B\" \"C\" \"D\" \"E\" \"F\" \"G\n 410  RETURN\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_2.txt",
        "content": "        LOW=1     HIGH=7\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_20.txt",
        "content": "/* ARM assembly Raspberry PI  */\n/*  program square4.s   */\n \n/************************************/\n/* Constantes                       */\n/************************************/\n.equ STDOUT, 1     @ Linux output console\n.equ EXIT,   1     @ Linux syscall\n.equ WRITE,  4     @ Linux syscall\n\n.equ NBBOX,  7\n\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nsMessDeb:           .ascii \"a=\"\nsMessValeur_a:     .fill 11, 1, ' '            @ size => 11\n                    .ascii \"b=\"\nsMessValeur_b:     .fill 11, 1, ' '            @ size => 11\n                    .ascii \"c=\"\nsMessValeur_c:     .fill 11, 1, ' '            @ size => 11\n                    .ascii \"d=\"\nsMessValeur_d:     .fill 11, 1, ' '            @ size => 11\n                    .ascii \"\\n\"\n                    .ascii \"e=\"\nsMessValeur_e:     .fill 11, 1, ' '            @ size => 11\n                    .ascii \"f=\"\nsMessValeur_f:     .fill 11, 1, ' '            @ size => 11\n                    .ascii \"g=\"\nsMessValeur_g:     .fill 11, 1, ' '            @ size => 11\n\nszCarriageReturn:   .asciz \"\\n************************\\n\"\n\nsMessNbSolution:   .ascii \"Number of solutions\u00a0:\"\nsMessCounter:     .fill 11, 1, ' '            @ size => 11\n                   .asciz \"\\n\\n\\n\"\n\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss  \n.align 4\niValues_a:                .skip 4 * NBBOX\niValues_b:                .skip 4 * NBBOX - 1\niValues_c:                .skip 4 * NBBOX - 2\niValues_d:                .skip 4 * NBBOX - 3\niValues_e:                .skip 4 * NBBOX - 4\niValues_f:                .skip 4 * NBBOX - 5\niValues_g:                .skip 4 * NBBOX - 6\niCounterSol:              .skip 4\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                             @ entry of program \n    mov r0,#1\n    mov r1,#7\n    mov r2,#3                                     @ 0 = rien 1 = display 2 = count 3 = les deux\n    bl searchPb\n    mov r0,#3\n    mov r1,#9\n    mov r2,#3                                     @ 0 = rien 1 = display 2 = count 3 = les deux\n    bl searchPb\n    mov r0,#0\n    mov r1,#9\n    mov r2,#2                                     @ 0 = rien 1 = display 2 = count 3 = les deux\n    bl prepSearchNU\n\n100:                                              @ standard end of the program \n    mov r0, #0                                    @ return code\n    mov r7, #EXIT                                 @ request to exit program\n    svc #0                                        @ perform the system call\n \niAdrszCarriageReturn:            .int szCarriageReturn\n\n/******************************************************************/\n/*     search probl\u00e8m  value not unique                           */ \n/******************************************************************/\n/* r0 contains start digit */\n/* r1 contains end digit */\n/* r2 contains action (0 display 1 count) */\nprepSearchNU:\n    push {r3-r12,lr}                              @ save  registers\n    mov r5,#0                                     @ counter\n    mov r12,r0                                    @ a\n1:\n    mov r11,r0                                    @ b\n2:\n    mov r10,r0                                    @ c\n3:\n    mov r9,r0                                     @ d\n4:\n    add r4,r12,r11                                @ a + b reference\n    add r3,r11,r10\n    add r3,r9                                     @ b + c + d\n    cmp r4,r3\n    bne 10f\n    mov r8,r0                                     @ e\n5:\n    mov r7,r0                                     @ f\n6:\n    add r3,r9,r8\n    add r3,r7                                     @ d + e + f\n    cmp r3,r4\n    bne 9f\n    mov r6,r0                                     @ g\n7:\n    add r3,r7,r6                                  @ f + g\n    cmp r3,r4\n    bne 8f                                        @ not OK\n                                                  @ OK\n    add r5,#1                                     @ increment counter\n\n8:\n    add r6,#1                                     @ increment g\n    cmp r6,r1\n    ble 7b\n9:\n    add r7,#1                                     @ increment f\n    cmp r7,r1\n    ble 6b\n    add r8,#1                                     @ increment e\n    cmp r8,r1\n    ble 5b\n10:\n    add r9,#1                                     @ increment d\n    cmp r9,r1\n    ble 4b\n    add r10,#1                                    @ increment c\n    cmp r10,r1\n    ble 3b\n    add r11,#1                                    @ increment b\n    cmp r11,r1\n    ble 2b\n    add r12,#1                                    @ increment a\n    cmp r12,r1\n    ble 1b\n\n    @ end\n    tst r2,#0b10                                    @ print count\u00a0?\n    beq 100f\n    mov r0,r5                                       @ counter\n    ldr r1,iAdrsMessCounter\n    bl conversion10\n    ldr r0,iAdrsMessNbSolution\n    bl affichageMess\n\n100:\n    pop {r3-r12,lr}                                 @ restaur registers \n    bx lr                                           @return\niAdrsMessCounter:                .int sMessCounter\niAdrsMessNbSolution:             .int sMessNbSolution\n\n/******************************************************************/\n/*     search problem  unique solution                            */ \n/******************************************************************/\n/* r0 contains start digit */\n/* r1 contains end digit */\n/* r2 contains action (0 display 1 count) */\nsearchPb:\n    push {r0-r12,lr}                                  @ save  registers\n    @ init\n    ldr r3,iAdriValues_a                              @ area value a\n    mov r4,#0\n1:                                                    @ loop init value a\n    str r0,[r3,r4,lsl #2]\n    add r4,#1\n    add r0,#1\n    cmp r0,r1\n    ble 1b\n\n    mov r5,#0                                         @ solution counter\n    mov r12,#-1\n2:\n    add r12,#1                                        @ increment indice a\n    cmp r12,#NBBOX-1\n    bgt 90f\n    ldr r0,iAdriValues_a                              @ area value a\n    ldr r1,iAdriValues_b                              @ area value b\n    mov r2,r12                                        @ indice  a\n    mov r3,#NBBOX                                     @ number of origin values \n    bl prepValues\n    mov r11,#-1\n3:\n    add r11,#1                                        @ increment indice b\n    cmp r11,#NBBOX - 2\n    bgt 2b\n    ldr r0,iAdriValues_b                              @ area value b\n    ldr r1,iAdriValues_c                              @ area value c\n    mov r2,r11                                        @ indice b\n    mov r3,#NBBOX -1                                  @ number of origin values\n    bl prepValues\n    mov r10,#-1\n4:\n    add r10,#1\n    cmp r10,#NBBOX - 3\n    bgt 3b\n    ldr r0,iAdriValues_c\n    ldr r1,iAdriValues_d\n    mov r2,r10\n    mov r3,#NBBOX - 2\n    bl prepValues\n    mov r9,#-1\n5:\n    add r9,#1\n    cmp r9,#NBBOX - 4\n    bgt 4b\n    @ control 2 firsts squares\n    ldr r0,iAdriValues_a\n    ldr r0,[r0,r12,lsl #2]\n    ldr r1,iAdriValues_b\n    ldr r1,[r1,r11,lsl #2]\n    add r4,r0,r1                               @ a + b   value first square\n    ldr r0,iAdriValues_c\n    ldr r0,[r0,r10,lsl #2]\n    add r7,r1,r0                               @ b + c\n    ldr r1,iAdriValues_d\n    ldr r1,[r1,r9,lsl #2]\n    add r7,r1                                  @ b + c + d\n    cmp r7,r4                                  @ equal first square\u00a0?\n    bne 5b\n    ldr r0,iAdriValues_d\n    ldr r1,iAdriValues_e\n    mov r2,r9\n    mov r3,#NBBOX - 3\n    bl prepValues\n    mov r8,#-1\n6:\n    add r8,#1\n    cmp r8,#NBBOX - 5\n    bgt 5b\n    ldr r0,iAdriValues_e\n    ldr r1,iAdriValues_f\n    mov r2,r8\n    mov r3,#NBBOX - 4\n    bl prepValues\n    mov r7,#-1\n7:\n    add r7,#1\n    cmp r7,#NBBOX - 6\n    bgt 6b\n    ldr r0,iAdriValues_d\n    ldr r0,[r0,r9,lsl #2]\n    ldr r1,iAdriValues_e\n    ldr r1,[r1,r8,lsl #2]\n    add r3,r0,r1                                @ d + e\n    ldr r1,iAdriValues_f\n    ldr r1,[r1,r7,lsl #2]\n    add r3,r1                                   @ de + e + f\n    cmp r3,r4                                   @ equal first square\u00a0?\n    bne 7b\n    ldr r0,iAdriValues_f\n    ldr r1,iAdriValues_g\n    mov r2,r7\n    mov r3,#NBBOX - 5\n    bl prepValues\n    mov r6,#-1\n8:\n    add r6,#1\n    cmp r6,#NBBOX - 7\n    bgt 7b\n    ldr r0,iAdriValues_f\n    ldr r0,[r0,r7,lsl #2]\n    ldr r1,iAdriValues_g\n    ldr r1,[r1,r6,lsl #2]\n    add r3,r0,r1                               @ f +g \n    cmp r4,r3                                  @ equal first square\u00a0?\n    bne 8b\n    add r5,#1                                  @ increment counter\n    ldr r0,[sp,#8]                             @ load action for two parameter in stack\n    tst r0,#0b1\n    beq 9f                                     @ display solution\u00a0?\n    ldr r0,iAdriValues_a\n    ldr r0,[r0,r12,lsl #2]\n    ldr r1,iAdrsMessValeur_a\n    bl conversion10\n    ldr r0,iAdriValues_b\n    ldr r0,[r0,r11,lsl #2]\n    ldr r1,iAdrsMessValeur_b\n    bl conversion10\n    ldr r0,iAdriValues_c\n    ldr r0,[r0,r10,lsl #2]\n    ldr r1,iAdrsMessValeur_c\n    bl conversion10\n    ldr r0,iAdriValues_d\n    ldr r0,[r0,r9,lsl #2]\n    ldr r1,iAdrsMessValeur_d\n    bl conversion10\n    ldr r0,iAdriValues_e\n    ldr r0,[r0,r8,lsl #2]\n    ldr r1,iAdrsMessValeur_e\n    bl conversion10\n    ldr r0,iAdriValues_f\n    ldr r0,[r0,r7,lsl #2]\n    ldr r1,iAdrsMessValeur_f\n    bl conversion10\n    ldr r0,iAdriValues_g\n    ldr r0,[r0,r6,lsl #2]\n    ldr r1,iAdrsMessValeur_g\n    bl conversion10\n    ldr r0,iAdrsMessDeb\n    bl affichageMess\n9:\n    b 8b    @ suite \n\n90:\n    ldr r0,[sp,#8]                                @ load action for two parameter in stack\n    tst r0,#0b10\n    beq 100f                                      @ display counter\u00a0?\n    mov r0,r5\n    ldr r1,iAdrsMessCounter\n    bl conversion10\n    ldr r0,iAdrsMessNbSolution\n    bl affichageMess\n100:\n    pop {r0-r12,lr}                               @ restaur registers \n    bx lr                                         @return\niAdriValues_a:                   .int iValues_a\niAdriValues_b:                   .int iValues_b\niAdriValues_c:                   .int iValues_c\niAdriValues_d:                   .int iValues_d\niAdriValues_e:                   .int iValues_e\niAdriValues_f:                   .int iValues_f\niAdriValues_g:                   .int iValues_g\n\niAdrsMessValeur_a:               .int sMessValeur_a\niAdrsMessValeur_b:               .int sMessValeur_b\niAdrsMessValeur_c:               .int sMessValeur_c\niAdrsMessValeur_d:               .int sMessValeur_d\niAdrsMessValeur_e:               .int sMessValeur_e\niAdrsMessValeur_f:               .int sMessValeur_f\niAdrsMessValeur_g:               .int sMessValeur_g\niAdrsMessDeb:                    .int sMessDeb\niAdriCounterSol:                 .int iCounterSol\n/******************************************************************/\n/*     copy value area  and substract value of indice             */ \n/******************************************************************/\n/* r0 contains the address of values origin */\n/* r1 contains the address of values destination */\n/* r2 contains value indice to substract     */\n/* r3 contains origin values number          */\nprepValues:\n    push {r1-r6,lr}                                @ save  registres\n    mov r4,#0                                      @ indice origin value\n    mov r5,#0                                      @ indice destination value\n1:\n    cmp r4,r2                                      @ substract indice\u00a0?\n    beq 2f                                         @ yes -> jump\n    ldr r6,[r0,r4,lsl #2]                          @ no -> copy value\n    str r6,[r1,r5,lsl #2]\n    add r5,#1                                      @ increment destination indice\n2:\n   add r4,#1                                       @ increment origin indice\n   cmp r4,r3                                       @ end\u00a0?\n   blt 1b\n100:\n    pop {r1-r6,lr}                                 @ restaur registres \n    bx lr                                          @return\n/******************************************************************/\n/*     display text with size calculation                         */ \n/******************************************************************/\n/* r0 contains the address of the message */\naffichageMess:\n    push {r0,r1,r2,r7,lr}                          @ save  registres\n    mov r2,#0                                      @ counter length \n1:                                                 @ loop length calculation \n    ldrb r1,[r0,r2]                                @ read octet start position + index \n    cmp r1,#0                                      @ if 0 its over \n    addne r2,r2,#1                                 @ else add 1 in the length \n    bne 1b                                         @ and loop \n                                                   @ so here r2 contains the length of the message \n    mov r1,r0                                      @ address message in r1 \n    mov r0,#STDOUT                                 @ code to write to the standard output Linux \n    mov r7, #WRITE                                 @ code call system \"write\" \n    svc #0                                         @ call systeme \n    pop {r0,r1,r2,r7,lr}                           @ restaur des  2 registres */ \n    bx lr                                          @ return  \n/******************************************************************/\n/*     Converting a register to a decimal unsigned                */ \n/******************************************************************/\n/* r0 contains value and r1 address area   */\n/* r0 return size of result (no zero final in area) */\n/* area size => 11 bytes          */\n.equ LGZONECAL,   10\nconversion10:\n    push {r1-r4,lr}                                 @ save registers \n    mov r3,r1\n    mov r2,#LGZONECAL\n1:                                                  @ start loop\n    bl divisionpar10U                               @ unsigned  r0 <- dividende. quotient ->r0 reste -> r1\n    add r1,#48                                      @ digit\n    strb r1,[r3,r2]                                 @ store digit on area\n    cmp r0,#0                                       @ stop if quotient = 0 \n    subne r2,#1                                     @ else previous position\n    bne 1b                                          @ and loop\n                                                    @ and move digit from left of area\n    mov r4,#0\n2:\n    ldrb r1,[r3,r2]\n    strb r1,[r3,r4]\n    add r2,#1\n    add r4,#1\n    cmp r2,#LGZONECAL\n    ble 2b\n                                                      @ and move spaces in end on area\n    mov r0,r4                                         @ result length \n    mov r1,#' '                                       @ space\n3:\n    strb r1,[r3,r4]                                   @ store space in area\n    add r4,#1                                         @ next position\n    cmp r4,#LGZONECAL\n    ble 3b                                            @ loop if r4 <= area size\n \n100:\n    pop {r1-r4,lr}                                    @ restaur registres \n    bx lr                                             @return\n \n/***************************************************/\n/*   division par 10   unsigned                    */\n/***************************************************/\n/* r0 dividende   */\n/* r0 quotient    */\n/* r1 remainder   */\ndivisionpar10U:\n    push {r2,r3,r4, lr}\n    mov r4,r0                                          @ save value\n    ldr r3,iMagicNumber                                @ r3 <- magic_number    raspberry 1 2\n    umull r1, r2, r3, r0                               @ r1<- Lower32Bits(r1*r0) r2<- Upper32Bits(r1*r0) \n    mov r0, r2, LSR #3                                 @ r2 <- r2 >> shift 3\n    add r2,r0,r0, lsl #2                               @ r2 <- r0 * 5 \n    sub r1,r4,r2, lsl #1                               @ r1 <- r4 - (r2 * 2)  = r4 - (r0 * 10)\n    pop {r2,r3,r4,lr}\n    bx lr                                              @ leave function \niMagicNumber:  \t.int 0xCCCCCCCD",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_21.txt",
        "content": "a=3          b=7          c=2          d=1\ne=5          f=4          g=6\n************************\na=4          b=5          c=3          d=1\ne=6          f=2          g=7\n************************\na=4          b=7          c=1          d=3\ne=2          f=6          g=5\n************************\na=5          b=6          c=2          d=3\ne=1          f=7          g=4\n************************\na=6          b=4          c=1          d=5\ne=2          f=3          g=7\n************************\na=6          b=4          c=5          d=1\ne=2          f=7          g=3\n************************\na=7          b=2          c=6          d=1\ne=3          f=5          g=4\n************************\na=7          b=3          c=2          d=5\ne=1          f=4          g=6\n************************\nNumber of solutions :8\n\na=7          b=8          c=3          d=4\ne=5          f=6          g=9\n************************\na=8          b=7          c=3          d=5\ne=4          f=6          g=9\n************************\na=9          b=6          c=4          d=5\ne=3          f=7          g=8\n************************\na=9          b=6          c=5          d=4\ne=3          f=8          g=7\n************************\nNumber of solutions :4\n\nNumber of solutions :2860\n\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_22.txt",
        "content": "rotina(min,max,unique)\n{\nglobal totalcount := 0\nglobal totalunique := 0\nglobal result := \"min=\" min \" max=\" max \" unique=\" unique \"`n`n\"\nmax := max - min + 1\nloop %max%\n{\n\ta := min + A_Index - 1\n\tloop %max%\n\t{\n\t\tb := min + A_Index - 1\n\t\tloop %max%\n\t\t{\n\t\t\tc := min + A_Index - 1\n\t\t\tloop %max%\n\t\t\t{\n\t\t\t\td := min + A_Index - 1\n\t\t\t\tloop %max%\n\t\t\t\t{\n\t\t\t\t\te := min + A_Index - 1\n\t\t\t\t\tloop %max%\n\t\t\t\t\t{\n\t\t\t\t\t\tf := min + A_Index - 1\n\t\t\t\t\t\tloop %max%\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tg := min + A_Index - 1\n\t\t\t\t\t\t\tsum := a+b\n\t\t\t\t\t\t\tif (b+c+d = sum and d+e+f = sum and f+g = sum)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\ttotalcount += 1\n\t\t\t\t\t\t\t\tif (unique=0)\n\t\t\t\t\t\t\t\t\tcontinue\n\t\t\t\t\t\t\t\tif not (a=b or a=c or a=d or a=e or a=f or a=g or b=c or b=d or b=e or b=f or b=g or c=d or c=e or c=f or c=g or d=e or d=f or d=g or e=f or e=g or f=g)\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tresult .= a \" \" b \" \" c \" \" d \" \" e \" \" f \" \" g \"`n\"\n\t\t\t\t\t\t\t\t\t\ttotalunique += 1\n\t\t\t\t\t\t\t\t\t}\t\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n}\nrotina(1,7,1)\nMsgBox %result% `ntotal unique = %totalunique% `ntotalcount = %totalcount%\nrotina(3,9,1)\nMsgBox %result% `ntotal unique = %totalunique% `ntotalcount = %totalcount%\nrotina(0,9,0)\nMsgBox %result% `ntotalcount = %totalcount%\nExitApp\nreturn\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_23.txt",
        "content": "min=1 max=7 unique=1\n\n3 7 2 1 5 4 6\n4 5 3 1 6 2 7\n4 7 1 3 2 6 5\n5 6 2 3 1 7 4\n6 4 1 5 2 3 7\n6 4 5 1 2 7 3\n7 2 6 1 3 5 4\n7 3 2 5 1 4 6\n \ntotal unique = 8 \ntotalcount = 497\n---------------------------\nOK   \n---------------------------\nmin=3 max=9 unique=1\n\n7 8 3 4 5 6 9\n8 7 3 5 4 6 9\n9 6 4 5 3 7 8\n9 6 5 4 3 8 7\n \ntotal unique = 4 \ntotalcount = 180\n---------------------------\nOK   \n---------------------------\nmin=0 max=9 unique=0\n \ntotalcount = 2860\n---------------------------\nOK   \n---------------------------\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_24.txt",
        "content": "# syntax: GAWK -f 4-RINGS_OR_4-SQUARES_PUZZLE.AWK\n# converted from C\nBEGIN {\n    cmd = \"SORT /+16\"\n    four_squares(1,7,1,1)\n    four_squares(3,9,1,1)\n    four_squares(0,9,0,0)\n    four_squares(0,6,1,0)\n    four_squares(2,8,1,0)\n    exit(0)\n}\nfunction four_squares(plo,phi,punique,pshow) {\n    lo = plo\n    hi = phi\n    unique = punique\n    show = pshow\n    solutions = 0\n    print(\"\")\n    if (show) {\n      print(\"A B C D E F G  sum  A+B B+C+D D+E+F F+G\")\n      print(\"-------------  ---  -------------------\")\n    }\n    acd()\n    close(cmd)\n    tmp = (unique) ? \"unique\" : \"non-unique\"\n    printf(\"%d-%d: %d %s solutions\\n\",lo,hi,solutions,tmp)\n}\nfunction acd() {\n    for (c=lo; c<=hi; c++) {\n      for (d=lo; d<=hi; d++) {\n        if (!unique || c != d) {\n          a = c + d\n          if (a >= lo && a <= hi && (!unique || (c != 0 && d != 0))) {\n            ge()\n          }\n        }\n      }\n    }\n}\nfunction bf() {\n    for (f=lo; f<=hi; f++) {\n      if (!unique || (f != a && f != c && f != d && f != g && f != e)) {\n        b = e + f - c\n        if (b >= lo && b <= hi && (!unique || (b != a && b != c && b != d && b != g && b != e && b != f))) {\n          solutions++\n          if (show) {\n            printf(\"%d %d %d %d %d %d %d %4d  \",a,b,c,d,e,f,g,a+b) | cmd\n            printf(\"%d+%d \",a,b) | cmd\n            printf(\"%d+%d+%d \",b,c,d) | cmd\n            printf(\"%d+%d+%d \",d,e,f) | cmd\n            printf(\"%d+%d\\n\",f,g) | cmd\n          }\n        }\n      }\n    }\n}\nfunction ge() {\n    for (e=lo; e<=hi; e++) {\n      if (!unique || (e != a && e != c && e != d)) {\n        g = d + e\n        if (g >= lo && g <= hi && (!unique || (g != a && g != c && g != d && g != e))) {\n          bf()\n        }\n      }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_25.txt",
        "content": "A B C D E F G  sum  A+B B+C+D D+E+F F+G\n-------------  ---  -------------------\n4 5 3 1 6 2 7    9  4+5 5+3+1 1+6+2 2+7\n7 2 6 1 3 5 4    9  7+2 2+6+1 1+3+5 5+4\n3 7 2 1 5 4 6   10  3+7 7+2+1 1+5+4 4+6\n6 4 1 5 2 3 7   10  6+4 4+1+5 5+2+3 3+7\n6 4 5 1 2 7 3   10  6+4 4+5+1 1+2+7 7+3\n7 3 2 5 1 4 6   10  7+3 3+2+5 5+1+4 4+6\n4 7 1 3 2 6 5   11  4+7 7+1+3 3+2+6 6+5\n5 6 2 3 1 7 4   11  5+6 6+2+3 3+1+7 7+4\n1-7: 8 unique solutions\n\nA B C D E F G  sum  A+B B+C+D D+E+F F+G\n-------------  ---  -------------------\n7 8 3 4 5 6 9   15  7+8 8+3+4 4+5+6 6+9\n8 7 3 5 4 6 9   15  8+7 7+3+5 5+4+6 6+9\n9 6 4 5 3 7 8   15  9+6 6+4+5 5+3+7 7+8\n9 6 5 4 3 8 7   15  9+6 6+5+4 4+3+8 8+7\n3-9: 4 unique solutions\n\n0-9: 2860 non-unique solutions\n\n0-6: 4 unique solutions\n\n2-8: 8 unique solutions\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_26.txt",
        "content": "call four_square(1, 7,  TRUE,  TRUE)\ncall four_square(3, 9,  TRUE,  TRUE)\ncall four_square(0, 9, FALSE, FALSE)\nend\n\nsubroutine four_square(low, high, unique, show)\n\ttotal = 0\n\n\tif show then print \" a b c d e f g\" + chr(10) + \" =============\"\n\n\tfor a = low to high\n\t\tfor b = low to high\n\t\t\tif unique and b = a then continue for\n\t\t\tt = a + b\n\t\t\tfor c = low to high\n\t\t\t\tif unique then\n\t\t\t\t\tif c = a or c = b then continue for\n\t\t\t\tend if\n\t\t\t\tfor d = low to high\n\t\t\t\t\tif unique then\n\t\t\t\t\t\tif d = a or d = b or d = c then continue for\n\t\t\t\t\tend if\n\t\t\t\t\tif b + c + d = t then\n\t\t\t\t\t\tfor e = low to high\n\t\t\t\t\t\t\tif unique then\n\t\t\t\t\t\t\t\tif e = a or e = b or e = c or e = d then continue for\n\t\t\t\t\t\t\tend if\n\t\t\t\t\t\t\tfor f = low to high\n\t\t\t\t\t\t\t\tif unique then\n\t\t\t\t\t\t\t\t\tif f = a or f = b or f = c or f = d or f = e then continue for\n\t\t\t\t\t\t\t\tend if\n\t\t\t\t\t\t\t\tif d + e + f = t then\n\t\t\t\t\t\t\t\t\tfor g = low to high\n\t\t\t\t\t\t\t\t\t\tif unique then\n\t\t\t\t\t\t\t\t\t\t\tif g = a or g = b or g = c or g = d or g = e or g = f then continue for\n\t\t\t\t\t\t\t\t\t\tend if\n\t\t\t\t\t\t\t\t\t\tif f + g = t then\n\t\t\t\t\t\t\t\t\t\t\ttotal += 1\n\t\t\t\t\t\t\t\t\t\t\tif show then print \" \";a;\" \";b;\" \";c;\" \";d;\" \";e;\" \";f;\" \";g\n\t\t\t\t\t\t\t\t\t\tend if\n\t\t\t\t\t\t\t\t\tnext g\n\t\t\t\t\t\t\t\tend if\n\t\t\t\t\t\t\tnext f\n\t\t\t\t\t\tnext e\n\t\t\t\t\tend if\n\t\t\t\tnext d\n\t\t\tnext c\n\t\tnext b\n\tnext a\n\n\tprint\n\tif unique then\n\t\tprint \"There are \";total;\" unique solutions in [\";string(low);\", \";string(high);\"]\"\n\telse\n\t\tprint \"There are \";total;\" non-unique solutions in [\";string(low);\", \";string(high);\"]\"\n\tend if\n\tprint\nend subroutine\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_27.txt",
        "content": "550\" :woL\">:#,_&>00p\" :hgiH\">:#,_&>1+10p\"\u00a0:)n/y( euqinU\">:#,_>~>:4v\nv!g03!:\\*`\\g01\\!`\\g00:p05:+g03:p04:_$30g1+:10g\\`v1g<,+$p02%2_|#`*8<\n>>+\\30g-!+20g*!*00g\\#v_$40g1+:10g\\`^<<1g00p03<<<_$55+:,\\.\"snoitul\"v\nv!`\\g00::p07:+g04p06:<^<`\\g01:+1g06$<_v#!\\g00*!*g02++!-g05<  v\"so\"<\n>\\10g\\`*\\:::30g-!\\40g-!+\\50g-!+\\60g-!  +60g::30g-!\\40g-!+\\^  >:#,_@\n>0g50g.......55+,0vg02+1_80g1+:10g\\`!^>>:80p60g+30g-:90p::00g\\`!>>v\n^9g03g04g06g08g07<_>>0>>^<<*!*g02++!-g07\\+!-g06\\+!-g05\\+!-g04\\!-<<\\\n>>10g\\`*\\:::::30g-!\\40g-!+\\50g-!+\\60g-!+\\70g-!+\\80g-!+80g::::30g^^>\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_28.txt",
        "content": "Low: 1\nHigh: 7\nUnique (y/n): y\n\n4 7 1 3 2 6 5\n6 4 1 5 2 3 7\n3 7 2 1 5 4 6\n5 6 2 3 1 7 4\n7 3 2 5 1 4 6\n4 5 3 1 6 2 7\n6 4 5 1 2 7 3\n7 2 6 1 3 5 4\n\n8 solutions",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_29.txt",
        "content": "Low: 3\nHigh: 9\nUnique (y/n): y\n\n7 8 3 4 5 6 9\n8 7 3 5 4 6 9\n9 6 4 5 3 7 8\n9 6 5 4 3 8 7\n\n4 solutions",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_3.txt",
        "content": "        LOW=3     HIGH=9\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_30.txt",
        "content": "Low: 0\nHigh: 9\nUnique (y/n): n\n\n\n2860 solutions",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_31.txt",
        "content": "#include <stdio.h>\n\n#define TRUE 1\n#define FALSE 0\n\nint a,b,c,d,e,f,g;\nint lo,hi,unique,show;\nint solutions;\n\nvoid\nbf()\n{\n    for (f = lo;f <= hi; f++)\n        if ((!unique) ||\n           ((f != a) && (f != c) && (f != d) && (f != g) && (f != e)))\n            {\n            b = e + f - c;\n            if ((b >= lo) && (b <= hi) &&\n                   ((!unique) || ((b != a) && (b != c) &&\n                   (b != d) && (b != g) && (b != e) && (b != f))))\n                {\n                solutions++;\n                if (show)\n                    printf(\"%d %d %d %d %d %d %d\\n\",a,b,c,d,e,f,g);\n                }\n            }\n}\n\n\nvoid\nge()\n{\n    for (e = lo;e <= hi; e++)\n        if ((!unique) || ((e != a) && (e != c) && (e != d)))\n            {\n            g = d + e;\n            if ((g >= lo) && (g <= hi) &&\n                   ((!unique) || ((g != a) && (g != c) &&\n                   (g != d) && (g != e))))\n                bf();\n            }\n}\n\nvoid\nacd()\n{\n    for (c = lo;c <= hi; c++)\n        for (d = lo;d <= hi; d++)\n            if ((!unique) || (c != d))\n                {\n                a = c + d;\n                if ((a >= lo) && (a <= hi) &&\n                   ((!unique) || ((c != 0) && (d != 0))))\n                    ge();\n                }\n}\n\n\nvoid\nfoursquares(int plo,int phi, int punique,int pshow)\n{\n    lo = plo;\n    hi = phi;\n    unique = punique;\n    show = pshow;\n    solutions = 0;\n\n    printf(\"\\n\");\n\n    acd();\n\n    if (unique)\n        printf(\"\\n%d unique solutions in %d to %d\\n\",solutions,lo,hi);\n    else\n        printf(\"\\n%d non-unique solutions in %d to %d\\n\",solutions,lo,hi);\n}\n\nmain()\n{\n    foursquares(1,7,TRUE,TRUE);\n    foursquares(3,9,TRUE,TRUE);\n    foursquares(0,9,FALSE,FALSE);\n}\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_32.txt",
        "content": "\n\n4 7 1 3 2 6 5\n6 4 1 5 2 3 7\n3 7 2 1 5 4 6\n5 6 2 3 1 7 4\n7 3 2 5 1 4 6\n4 5 3 1 6 2 7\n6 4 5 1 2 7 3\n7 2 6 1 3 5 4\n\n8 unique solutions in 1 to 7\n\n7 8 3 4 5 6 9\n8 7 3 5 4 6 9\n9 6 4 5 3 7 8\n9 6 5 4 3 8 7\n\n4 unique solutions in 3 to 9\n\n\n2860 non-unique solutions in 0 to 9\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_33.txt",
        "content": "using System;\nusing System.Linq;\n\nnamespace Four_Squares_Puzzle {\n    class Program {\n        static void Main(string[] args) {\n            fourSquare(1, 7, true, true);\n            fourSquare(3, 9, true, true);\n            fourSquare(0, 9, false, false);\n        }\n\n        private static void fourSquare(int low, int high, bool unique, bool print) {\n            int count = 0;\n\n            if (print) {\n                Console.WriteLine(\"a b c d e f g\");\n            }\n            for (int a = low; a <= high; ++a) {\n                for (int b = low; b <= high; ++b) {\n                    if (notValid(unique, b, a)) continue;\n\n                    int fp = a + b;\n                    for (int c = low; c <= high; ++c) {\n                        if (notValid(unique, c, b, a)) continue;\n                        for (int d = low; d <= high; ++d) {\n                            if (notValid(unique, d, c, b, a)) continue;\n                            if (fp != b + c + d) continue;\n\n                            for (int e = low; e <= high; ++e) {\n                                if (notValid(unique, e, d, c, b, a)) continue;\n                                for (int f = low; f <= high; ++f) {\n                                    if (notValid(unique, f, e, d, c, b, a)) continue;\n                                    if (fp != d + e + f) continue;\n\n                                    for (int g = low; g <= high; ++g) {\n                                        if (notValid(unique, g, f, e, d, c, b, a)) continue;\n                                        if (fp != f + g) continue;\n\n                                        ++count;\n                                        if (print) {\n                                            Console.WriteLine(\"{0} {1} {2} {3} {4} {5} {6}\", a, b, c, d, e, f, g);\n                                        }\n                                    }\n                                }\n                            }\n                        }\n                    }\n                }\n            }\n            if (unique) {\n                Console.WriteLine(\"There are {0} unique solutions in [{1}, {2}]\", count, low, high);\n            }\n            else {\n                Console.WriteLine(\"There are {0} non-unique solutions in [{1}, {2}]\", count, low, high);\n            }\n        }\n\n        private static bool notValid(bool unique, int needle, params int[] haystack) {\n            return unique && haystack.Any(p => p == needle);\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_34.txt",
        "content": "a b c d e f g\n3 7 2 1 5 4 6\n4 5 3 1 6 2 7\n4 7 1 3 2 6 5\n5 6 2 3 1 7 4\n6 4 1 5 2 3 7\n6 4 5 1 2 7 3\n7 2 6 1 3 5 4\n7 3 2 5 1 4 6\nThere are 8 unique solutions in [1, 7]\na b c d e f g\n7 8 3 4 5 6 9\n8 7 3 5 4 6 9\n9 6 4 5 3 7 8\n9 6 5 4 3 8 7\nThere are 4 unique solutions in [3, 9]\nThere are 2860 non-unique solutions in [0, 9]",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_35.txt",
        "content": "//C++14/17\n#include <algorithm>//std::for_each\n#include <iostream> //std::cout\n#include <numeric>  //std::iota\n#include <vector>   //std::vector, save solutions\n#include <list>     //std::list, for fast erase\n\nusing std::begin, std::end, std::for_each;\n\n//Generates all the valid solutions for the problem in the specified range [from, to)\nstd::list<std::vector<int>> combinations(int from, int to)\n{\n    if (from > to)\n        return {};                          //Return nothing if limits are invalid\n\n    auto pool = std::vector<int>(to - from);//Here we'll save our values\n    std::iota(begin(pool), end(pool), from);//Populates pool\n\n    auto solutions = std::list<std::vector<int>>{};   //List for the solutions\n\n    //Brute-force calculation of valid values...\n    for (auto a : pool)\n        for (auto b : pool)\n            for (auto c : pool)\n                for (auto d : pool)\n                    for (auto e : pool)\n                        for (auto f : pool)\n                            for (auto g : pool)\n                                if ( a      == c + d\n                                  && b + c  == e + f\n                                  && d + e  ==     g )\n                                    solutions.push_back({a, b, c, d, e, f, g});\n    return solutions;\n}\n\n//Filter the list generated from \"combinations\" and return only lists with no repetitions\nstd::list<std::vector<int>> filter_unique(int from, int to)\n{\n    //Helper lambda to check repetitions:\n    //If the count is > 1 for an element, there must be a repetition inside the range\n    auto has_non_unique_values = [](const auto & range, auto target)\n    {\n        return std::count( begin(range), end(range), target) > 1;\n    };\n\n    //Generates all the solutions...\n    auto results = combinations(from, to);\n\n    //For each solution, find duplicates inside\n    for (auto subrange = cbegin(results); subrange != cend(results); ++subrange)\n    {\n        bool repetition = false;\n\n        //If some element is repeated, repetition becomes true \n        for (auto x : *subrange)\n            repetition |= has_non_unique_values(*subrange, x);\n\n        if (repetition)    //If repetition is true, remove the current subrange from the list\n        {\n            results.erase(subrange);        //Deletes subrange from solutions\n            --subrange;                     //Rewind to the last subrange analysed\n        }\n    }\n\n    return results; //Finally return remaining results\n}\n\ntemplate <class Container> //Template for the sake of simplicity\ninline void print_range(const Container & c)\n{\n    for (const auto & subrange : c)\n    {\n        std::cout << \"[\";\n        for (auto elem : subrange)\n            std::cout << elem << ' ';\n        std::cout << \"\\b]\\n\";\n    }\n}\n\n\nint main()\n{\n    std::cout << \"Unique-numbers combinations in range 1-7:\\n\";\n    auto solution1 = filter_unique(1, 8);\n    print_range(solution1);\n    std::cout << \"\\nUnique-numbers combinations in range 3-9:\\n\";\n    auto solution2 = filter_unique(3,10);\n    print_range(solution2);\n    std::cout << \"\\nNumber of combinations in range 0-9: \" \n              << combinations(0, 10).size() << \".\" << std::endl;\n\n    return 0;\n}\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_36.txt",
        "content": "Unique-numbers combinations in range 1-7:\n[3 7 2 1 5 4 6]\n[4 5 3 1 6 2 7]\n[4 7 1 3 2 6 5]\n[5 6 2 3 1 7 4]\n[6 4 1 5 2 3 7]\n[6 4 5 1 2 7 3]\n[7 2 6 1 3 5 4]\n[7 3 2 5 1 4 6]\n\nUnique-numbers combinations in range 3-9:\n[7 8 3 4 5 6 9]\n[8 7 3 5 4 6 9]\n[9 6 4 5 3 7 8]\n[9 6 5 4 3 8 7]\n\nNumber of combinations in range 0-9: 2860.\n\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_37.txt",
        "content": "10 plo = 1 : phi = 7 : punique = true : pshow = true : gosub 50 : rem \"FOURSQUARES\"\n20 plo = 3 : phi = 9 : punique = true : pshow = true : gosub 50 : rem \"FOURSQUARES\"\n30 plo = 0 : phi = 9 : punique = false : pshow = false : gosub 50 : rem \"FOURSQUARES\"\n40 end\n50 lo = plo\n60 hi = phi\n70 unique = punique\n80 show = pshow\n90 s = 0 : rem SOLUTIONS\n100 print\n110 gosub 170 : rem \"ACD\"\n120 print\n130 print s \" \";\n140 if not unique then print \"NON-\";\n150 print \"UNIQUE SOLUTIONS IN \" lo \" TO \" hi\n160 return\n170 for c = lo to hi\n180     for d = lo to hi\n190         if ( not unique) or (c <> d) then\n200             a = c+d\n210             if (a >= lo) and (a <= hi) and (( not unique) or ((c <> 0) and (d <> 0))) then gosub 250 : rem \"GE\"\n220         endif\n230 next d,c\n240 return\n250 for e = lo to hi\n260     if ( not unique) or ((e <> a) and (e <> c) and (e <> d)) then\n270         g = d+e\n280         if (g >= lo) and (g <= hi) and (( not unique) or ((g <> a) and (g <> c) and (g <> d) and (g <> e))) then gosub 320 : rem \"BF\"\n290     endif\n300 next e\n310 return\n320 for f = lo to hi\n330     if (( not unique) or ((f <> a) and (f <> c) and (f <> d) and (f <> g) and (f <> e))) then gosub 360\n340 next f\n350 return\n360 b = e+f-c\n370 if ((b >= lo) and (b <= hi) and (( not unique) or ((b <> a) and (b <> c) and (b <> d) and (b <> g) and (b <> e) and (b <> f)))) then\n380     s = s+1\n390     if (show) then print a \" \" b \" \" c \" \" d \" \" e \" \" f \" \" g\n400 endif\n410 return\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_38.txt",
        "content": ">run\n\n4  7  1  3  2  6  5\n6  4  1  5  2  3  7\n3  7  2  1  5  4  6\n5  6  2  3  1  7  4\n7  3  2  5  1  4  6\n4  5  3  1  6  2  7\n6  4  5  1  2  7  3\n7  2  6  1  3  5  4\n\n8  UNIQUE SOLUTIONS IN 1  TO 7\n\n7  8  3  4  5  6  9\n8  7  3  5  4  6  9\n9  6  4  5  3  7  8\n9  6  5  4  3  8  7\n\n4  UNIQUE SOLUTIONS IN 3  TO 9\n\n\n2860  NON-UNIQUE SOLUTIONS IN 0  TO 9",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_39.txt",
        "content": "(use '[clojure.math.combinatorics]\n\n(defn rings [r & {:keys [unique] :or {unique true}}]\n    (if unique\n      (apply concat (map permutations (combinations r 7)))\n      (selections r 7)))\n\n(defn four-rings [low high & {:keys [unique] :or {unique true}}]\n  (for [[a b c d e f g] (rings (range low (inc high)) :unique unique)\n    :when (= (+ a b) (+ b c d) (+ d e f) (+ f g))] [a b c d e f g]))\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_4.txt",
        "content": "        LOW=0     HIGH=9\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_40.txt",
        "content": "=> (pprint (four-rings 1 7))\n([3 7 2 1 5 4 6]\n [4 5 3 1 6 2 7]\n [4 7 1 3 2 6 5]\n [5 6 2 3 1 7 4]\n [6 4 1 5 2 3 7]\n [6 4 5 1 2 7 3]\n [7 2 6 1 3 5 4]\n [7 3 2 5 1 4 6])\nnil\n\n=> (pprint (four-rings 3 9))\n([7 8 3 4 5 6 9] [8 7 3 5 4 6 9] [9 6 4 5 3 7 8] [9 6 5 4 3 8 7])\nnil\n\n=> (count (four-rings 0 9 :unique false))\n2860\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_41.txt",
        "content": "(defpackage four-rings\n  (:use common-lisp)\n  (:export display-solutions))\n(in-package four-rings)\n\n(defun correct-answer-p (a b c d e f g)\n  (let ((v (+ a b)))\n    (and (equal v (+ b c d))\n         (equal v (+ d e f))\n         (equal v (+ f g)))))\n\n(defun combinations-if (func len unique min max)\n  (let ((results nil))\n    (labels ((inner (cur)\n               (if (eql (length cur) len)\n                 (when (apply func (reverse cur))\n                   (push cur results))\n                 (dotimes (i (- max min))\n                   (when (or (not unique) \n                             (not (member (+ i min) cur)))\n                     (inner (append (list (+ i min)) cur)))))))\n      (inner nil))\n    results))\n\n(defun four-rings-solutions (low high unique)\n  (combinations-if #'correct-answer-p 7 unique low (1+ high)))\n\n(defun display-solutions ()\n  (let ((letters '((a b c d e f g))))\n    (format t \"Low 1, High 7, unique letters: ~%~{~{~3A~}~%~}~%\" \n            (append letters (four-rings-solutions 1 7 t)))\n    (format t \"Low 3, High 9, unique letters: ~%~{~{~3A~}~%~}~%\"\n            (append letters (four-rings-solutions 3 9 t)))\n    (format t \"Number of solutions for Low 0, High 9 non-unique:~%~A~%\"\n            (length (four-rings-solutions 0 9 nil)))))\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_42.txt",
        "content": "CL-USER> (four-rings:display-solutions)\nLow 1, High 7, unique letters: \nA  B  C  D  E  F  G  \n6  4  1  5  2  3  7  \n4  5  3  1  6  2  7  \n3  7  2  1  5  4  6  \n7  3  2  5  1  4  6  \n4  7  1  3  2  6  5  \n5  6  2  3  1  7  4  \n7  2  6  1  3  5  4  \n6  4  5  1  2  7  3  \n\nLow 3, High 9, unique letters: \nA  B  C  D  E  F  G  \n7  8  3  4  5  6  9  \n8  7  3  5  4  6  9  \n9  6  4  5  3  7  8  \n9  6  5  4  3  8  7  \n\nNumber of solutions for Low 0, High 9 non-unique:\n2860\nNIL\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_43.txt",
        "content": "def check(list)\n  a, b, c, d, e, f, g = list\n  first = a + b\n  {b + c + d, d + e + f, f + g}.all? &.==(first)\nend\n\ndef four_squares(low, high, unique = true, show = unique)\n  solutions = [] of Array(Int32)\n  if unique\n    uniq = \"unique\"\n    (low..high).to_a.each_permutation(7, true) { |ary| solutions << ary.clone if check(ary) }\n  else\n    uniq = \"non-unique\"\n    (low..high).to_a.each_repeated_permutation(7, true) { |ary| solutions << ary.clone if check(ary) }\n  end\n  if show\n    puts \" \" + (\"a\"..\"g\").join(\"  \")\n    solutions.each { |ary| p ary }\n  end\n  puts \"#{solutions.size} #{uniq} solutions in #{low} to #{high}\"\n  puts\nend\n\n{ {1, 7}, {3, 9} }.each do |(low, high)|\n  four_squares(low, high)\nend\nfour_squares(0, 9, false)\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_44.txt",
        "content": "import std.stdio;\n\nvoid main() {\n    fourSquare(1,7,true,true);\n    fourSquare(3,9,true,true);\n    fourSquare(0,9,false,false);\n}\n\nvoid fourSquare(int low, int high, bool unique, bool print) {\n    int count;\n\n    if (print) {\n        writeln(\"a b c d e f g\");\n    }\n    for (int a=low; a<=high; ++a) {\n        for (int b=low; b<=high; ++b) {\n            if (!valid(unique, a, b)) continue;\n\n            int fp = a+b;\n            for (int c=low; c<=high; ++c) {\n                if (!valid(unique, c, a, b)) continue;\n                for (int d=low; d<=high; ++d) {\n                    if (!valid(unique, d, a, b, c)) continue;\n                    if (fp != b+c+d) continue;\n\n                    for (int e=low; e<=high; ++e) {\n                        if (!valid(unique, e, a, b, c, d)) continue;\n                        for (int f=low; f<=high; ++f) {\n                            if (!valid(unique, f, a, b, c, d, e)) continue;\n                            if (fp != d+e+f) continue;\n\n                            for (int g=low; g<=high; ++g) {\n                                if (!valid(unique, g, a, b, c, d, e, f)) continue;\n                                if (fp != f+g) continue;\n\n                                ++count;\n                                if (print) {\n                                    writeln(a,' ',b,' ',c,' ',d,' ',e,' ',f,' ',g);\n                                }\n                            }\n                        }\n                    }\n                }\n            }\n        }\n    }\n    if (unique) {\n        writeln(\"There are \", count, \" unique solutions in [\",low,\",\",high,\"]\");\n    } else {\n        writeln(\"There are \", count, \" non-unique solutions in [\",low,\",\",high,\"]\");\n    }\n}\n\nbool valid(bool unique, int needle, int[] haystack ...) {\n    if (unique) {\n        foreach (value; haystack) {\n            if (needle == value) {\n                return false;\n            }\n        }\n    }\n    return true;\n}\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_45.txt",
        "content": "a b c d e f g\n3 7 2 1 5 4 6\n4 5 3 1 6 2 7\n4 7 1 3 2 6 5\n5 6 2 3 1 7 4\n6 4 1 5 2 3 7\n6 4 5 1 2 7 3\n7 2 6 1 3 5 4\n7 3 2 5 1 4 6\nThere are 8 unique solutions in [1,7]\na b c d e f g\n7 8 3 4 5 6 9\n8 7 3 5 4 6 9\n9 6 4 5 3 7 8\n9 6 5 4 3 8 7\nThere are 4 unique solutions in [3,9]\nThere are 2860 non-unique solutions in [0,9]",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_46.txt",
        "content": "func ok v t[] .\n   for h in t[]\n      if v = h\n         return 0\n      .\n   .\n   return 1\n.\nproc four lo hi uni show . .\n   # \n   subr bf\n      for f = lo to hi\n         if uni = 0 or ok f [ a c d g e ] = 1\n            b = e + f - c\n            if b >= lo and b <= hi and (uni = 0 or ok b [ a c d g e f ] = 1)\n               solutions += 1\n               if show = 1\n                  for h in [ a b c d e f g ]\n                     write h & \" \"\n                  .\n                  print \"\"\n               .\n            .\n         .\n      .\n   .\n   subr ge\n      for e = lo to hi\n         if uni = 0 or ok e [ a c d ] = 1\n            g = d + e\n            if g >= lo and g <= hi and (uni = 0 or ok g [ a c d e ] = 1)\n               bf\n            .\n         .\n      .\n   .\n   subr acd\n      for c = lo to hi\n         for d = lo to hi\n            if uni = 0 or c <> d\n               a = c + d\n               if a >= lo and a <= hi and (uni = 0 or c <> 0 and d <> 0)\n                  ge\n               .\n            .\n         .\n      .\n   .\n   print \"low:\" & lo & \" hi:\" & hi & \" unique:\" & uni\n   acd\n   print solutions & \" solutions\"\n   print \"\"\n.\nfour 1 7 1 1\nfour 3 9 1 1\nfour 0 9 0 0\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_47.txt",
        "content": "(* A simple function to generate the sequence\n   Nigel Galloway: January 31st., 2017 *)\ntype G = {d:int;x:int;b:int;f:int}\nlet N n g = \n  {(max (n-g) n) .. (min (g-n) g)} |> Seq.collect(fun d->{(max (d+n+n) (n+n))..(min (g+g) (d+g+g))}           |> Seq.collect(fun x -> \n  seq{for a in n .. g do for b in n .. g do if (a+b) = x then for c in n .. g do if (b+c+d) = x then yield b} |> Seq.collect(fun b ->\n  seq{for f in n .. g do for G in n .. g do if (f+G) = x then for e in n .. g do if (f+e+d) = x then yield f} |> Seq.map(fun f -> {d=d;x=x;b=b;f=f}))))\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_48.txt",
        "content": "printfn \"%d\" (Seq.length (N 0 9))\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_49.txt",
        "content": "2860\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_5.txt",
        "content": "F foursquares(lo, hi, unique, show)\n   V solutions = 0\n   L(c) lo .. hi\n      L(d) lo .. hi\n         I !unique | (c\u00a0!= d)\n            V a = c + d\n            I a >= lo & a <= hi\n               I !unique | (c\u00a0!= 0 & d\u00a0!= 0)\n                  L(e) lo .. hi\n                     I !unique | (e !C (a, c, d))\n                        V g = d + e\n                        I g >= lo & g <= hi\n                           I !unique | (g !C (a, c, d, e))\n                              L(f) lo .. hi\n                                 I !unique | (f !C (a, c, d, g, e))\n                                    V b = e + f - c\n                                    I b >= lo & b <= hi\n                                       I !unique | (b !C (a, c, d, g, e, f))\n                                          solutions++\n                                          I show\n                                             print(String((a, b, c, d, e, f, g))[1 .< (len)-1])\n\n   V uorn = I unique {\u2018unique\u2019} E \u2018non-unique\u2019\n\n   print(solutions\u2018 \u2019uorn\u2018 solutions in \u2019lo\u2018 to \u2019hi)\n   print()\n\nfoursquares(1, 7, 1B, 1B)\nfoursquares(3, 9, 1B, 1B)\nfoursquares(0, 9, 0B, 0B)",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_50.txt",
        "content": "(* A simple function to generate the sequence with unique values\n   Nigel Galloway: January 31st., 2017 *)\ntype G = {d:int;x:int;b:int;f:int}\nlet N n g = \n  {(max (n-g) n) .. (min (g-n) g)} |> Seq.filter(fun d -> d <> 0) |> Seq.collect(fun d->{(max (d+n+n) (n+n)) .. (min (g+g) (d+g+g))} |> Seq.collect(fun x -> \n  seq{for a in n .. g do if a <> d then for b in n .. g do if (a+b) = x && b <> a && b <> d then for c in n .. g do if (b+c+d) = x && c <> d && c <> a && c <> b then yield b} |> Seq.collect(fun b ->\n  seq{for f in n .. g do if f <> d && f <> b && f <> (x-b) && f <> (x-d-b) then for G in n .. g do if (f+G) = x && G <> d && G <> b && G <> f && G <> (x-b) && G <> (x-d-b) then for e in n .. g do if (f+e+d) = x && e <> d && e <> b && e <> f && e <> G && e <> (x-b) && e <> (x-d-b) then yield f} |> Seq.map(fun f -> {d=d;x=x;b=b;f=f}))))\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_51.txt",
        "content": "for n in N 1 7 do printfn \"%d,%d,%d,%d,%d,%d,%d\" (n.x-n.b) n.b (n.x-n.d-n.b) n.d (n.x-n.d-n.f) n.f (n.x-n.f)\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_52.txt",
        "content": "4,5,3,1,6,2,7\n7,2,6,1,3,5,4\n3,7,2,1,5,4,6\n6,4,5,1,2,7,3\n4,7,1,3,2,6,5\n5,6,2,3,1,7,4\n6,4,1,5,2,3,7\n7,3,2,5,1,4,6\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_53.txt",
        "content": "for n in N 3 9 do printfn \"%d,%d,%d,%d,%d,%d,%d\" (n.x-n.b) n.b (n.x-n.d-n.b) n.d (n.x-n.d-n.f) n.f (n.x-n.f)\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_54.txt",
        "content": "7,8,3,4,5,6,9\n9,6,5,4,3,8,7\n8,7,3,5,4,6,9\n9,6,4,5,3,7,8\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_55.txt",
        "content": "USING: arrays backtrack formatting grouping kernel locals math\nmath.ranges prettyprint sequences sequences.generalizations\nsets ;\nIN: rosetta-code.4-rings\n\n:: 4-rings ( lo hi unique? -- seq ) [\n        7 [ lo hi [a,b] amb-lazy ] replicate\n        7 firstn :> ( a b c d e f g )\n        { a b c d e f g } :> p\n        a b +\n        b c d + +\n        d e f + +\n        f g +\n        4array all-equal?\n        unique? [ p all-unique? and ] when\n        must-be-true p\n    ] bag-of ;\n    \n: report ( lo hi unique? -- )\n    3dup 4-rings over [ dup . ] when length swap \"\" \"non-\" ?\n    \"In [%d, %d] there are %d %sunique solutions.\\n\" printf ;\n    \n1 7 t report\n3 9 t report\n0 9 f report\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_56.txt",
        "content": "V{\n    { 3 7 2 1 5 4 6 }\n    { 4 5 3 1 6 2 7 }\n    { 4 7 1 3 2 6 5 }\n    { 5 6 2 3 1 7 4 }\n    { 6 4 1 5 2 3 7 }\n    { 6 4 5 1 2 7 3 }\n    { 7 2 6 1 3 5 4 }\n    { 7 3 2 5 1 4 6 }\n}\nIn [1, 7] there are 8 unique solutions.\nV{\n    { 7 8 3 4 5 6 9 }\n    { 8 7 3 5 4 6 9 }\n    { 9 6 4 5 3 7 8 }\n    { 9 6 5 4 3 8 7 }\n}\nIn [3, 9] there are 4 unique solutions.\nIn [0, 9] there are 2860 non-unique solutions.\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_57.txt",
        "content": "WRITE(...) FIRST,LAST,IF (UNIQUE) THEN \"Distinct values only\" ELSE \"Repeated values allowed\" FI // \".\"\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_58.txt",
        "content": "      SUBROUTINE FOURSHOW(FIRST,LAST,UNIQUE)\t!The \"Four Rings\" or \"Four Squares\" puzzle.\nChoose values such that A+B = B+C+D = D+E+F = F+G, all being integers in FIRST:LAST...\n       INTEGER FIRST,LAST\t!The range of allowed values.\n       LOGICAL UNIQUE\t\t!Solutions need not have unique values.\n       INTEGER A,B,C,D,E,F,G\t!Ah, Diophantus of Alexandria.\n       INTEGER V(7),S,N\t\t!Assistants.\n       EQUIVALENCE (V(1),A),(V(2),B),(V(3),C),\t\t!Yes,\n     1             (V(4),D),(V(5),E),(V(6),F),(V(7),G)\t!We're all individuals.\n        WRITE (6,1) FIRST,LAST\t!Announce: first part.\n    1   FORMAT (/,\"The Four Rings puzzle, over \",I0,\" to \",I0,\".\",$)\t!$: An addendum follows.\n        IF (UNIQUE) WRITE (6,*) \"Distinct values only.\"\t!Save on the THEN ... ELSE ... END IF blather.\n        IF (.NOT.UNIQUE) WRITE (6,*) \"Repeated values allowed.\"\t!Perhaps the compiler will be smarter.\n\n        N = 0\t!No solutions have been found.\n      BB:DO B = FIRST,LAST\t!Start chugging through the possibilities.\n        CC:DO C = FIRST,LAST\t\t!Brute force and ignorance.\n             IF (UNIQUE .AND. B.EQ.C) CYCLE CC\t!The first constraint shows up.\n          DD:DO D = FIRST,LAST\t\t!Start by forming B, C, and D.\n               IF (UNIQUE .AND. ANY(V(2:3).EQ.D)) CYCLE DD\t!Ignoring A just for now.\n               S = B + C + D\t\t!This is the common sum.\n               A = S - B\t\t!The value of A is not free from BCD.\n               IF (A < FIRST .OR. A > LAST) CYCLE DD\t!And it may not be within bounds.\n               IF (UNIQUE .AND. ANY(V(2:4).EQ.A)) CYCLE DD\t!Or, if required so, unique.\n            EE:DO E = FIRST,LAST\t!Righto, A,B,C,D are valid. Try an E.\n                 IF (UNIQUE .AND. ANY(V(1:4).EQ.E)) CYCLE EE\t!Precluded already?\n                 F = S - (E + D)\t\t!No. So therefore, F is determined.\n                 IF (F < FIRST .OR. F > LAST) CYCLE EE\t!Acceptable?\n                 IF (UNIQUE .AND. ANY(V(1:5).EQ.F)) CYCLE EE\t!And, if required, unique?\n                 G = S - F\t\t\t!Yes! So finally, G is determined.\n                 IF (G < FIRST .OR. G > LAST) CYCLE EE\t!Acceptable?\n                 IF (UNIQUE .AND. ANY(V(1:6).EQ.G)) CYCLE EE\t!And, if required, unique?\n                 N = N + 1\t\t\t!Yes! Count a solution set!\n                 IF (UNIQUE) WRITE (6,\"(7I3)\") V\t!Show its values.\n               END DO EE\t\t\t!Consder another E.\n             END DO DD\t\t\t!Consider another D.\n           END DO CC\t\t!Consider another C.\n         END DO BB\t!Consider another B.\n        WRITE (6,2) N\t!Announce the count.\n    2   FORMAT (I9,\" found.\")\t!Numerous, if no need for distinct values.\n      END SUBROUTINE FOURSHOW\t!That was fun!\n\n      PROGRAM POKE\n\n      CALL FOURSHOW(1,7,.TRUE.)\n      CALL FOURSHOW(3,9,.TRUE.)\n      CALL FOURSHOW(0,9,.FALSE.)\n\n      END\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_59.txt",
        "content": "The Four Rings puzzle, over 1 to 7. Distinct values only.\n  7  2  6  1  3  5  4\n  7  3  2  5  1  4  6\n  6  4  1  5  2  3  7\n  6  4  5  1  2  7  3\n  4  5  3  1  6  2  7\n  5  6  2  3  1  7  4\n  4  7  1  3  2  6  5\n  3  7  2  1  5  4  6\n        8 found.\n\nThe Four Rings puzzle, over 3 to 9. Distinct values only.\n  9  6  4  5  3  7  8\n  9  6  5  4  3  8  7\n  8  7  3  5  4  6  9\n  7  8  3  4  5  6  9\n        4 found.\n\nThe Four Rings puzzle, over 0 to 9. Repeated values allowed.\n     2860 found.\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_6.txt",
        "content": "4, 7, 1, 3, 2, 6, 5\n6, 4, 1, 5, 2, 3, 7\n3, 7, 2, 1, 5, 4, 6\n5, 6, 2, 3, 1, 7, 4\n7, 3, 2, 5, 1, 4, 6\n4, 5, 3, 1, 6, 2, 7\n6, 4, 5, 1, 2, 7, 3\n7, 2, 6, 1, 3, 5, 4\n8 unique solutions in 1 to 7\n\n7, 8, 3, 4, 5, 6, 9\n8, 7, 3, 5, 4, 6, 9\n9, 6, 4, 5, 3, 7, 8\n9, 6, 5, 4, 3, 8, 7\n4 unique solutions in 3 to 9\n\n2860 non-unique solutions in 0 to 9\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_60.txt",
        "content": "31:                    IF (UNIQUE .AND. ANY(V(1:6).EQ.G)) CYCLE EE    !And, if required, unique?\n00401496   mov         edi,dword ptr [UNIQUE]\n00401499   mov         edi,dword ptr [edi]\n0040149B   mov         ebx,dword ptr [G (00470380)]\n004014A1   mov         eax,0\n004014A6   mov         ecx,1\n004014AB   mov         dword ptr [ebp-60h],1\n004014B2   cmp         dword ptr [ebp-60h],6\n004014B6   jg          FOURSHOW+4C4h (004014fc)\n004014B8   cmp         ecx,1\n004014BB   jl          FOURSHOW+48Ah (004014c2)\n004014BD   cmp         ecx,7\n004014C0   jle         FOURSHOW+493h (004014cb)\n004014C2   xor         esi,esi\n004014C4   mov         dword ptr [ebp-6Ch],esi\n004014C7   dec         esi\n004014C8   bound       esi,qword ptr [ebp-6Ch]\n004014CB   imul        esi,ecx,4\n004014CE   mov         esi,dword ptr S+4 (00470364)[esi]\n004014D4   xor         edx,edx\n004014D6   cmp         esi,ebx\n004014D8   sete        dl\n004014DB   mov         dword ptr [ebp-6Ch],edx\n004014DE   mov         edx,eax\n004014E0   or          edx,dword ptr [ebp-6Ch]\n004014E3   and         edx,1\n004014E6   mov         eax,edx\n004014E8   neg         eax\n004014EA   mov         esi,ecx\n004014EC   add         esi,1\n004014EF   mov         ecx,esi\n004014F1   mov         edx,dword ptr [ebp-60h]\n004014F4   add         edx,1\n004014F7   mov         dword ptr [ebp-60h],edx\n004014FA   jmp         FOURSHOW+47Ah (004014b2)\n004014FC   and         edi,eax\n004014FE   mov         edx,edi\n00401500   and         edx,1\n00401503   cmp         edx,0\n00401506   jne         FOURSHOW+531h (00401569)\n32:                    N = N + 1          !Yes! Count a solution set!\n00401508   mov         esi,dword ptr [N (0047035c)]\n0040150E   add         esi,1\n00401511   mov         dword ptr [N (0047035c)],esi\n33:                    IF (UNIQUE) WRITE (6,\"(7I3)\") V    !Show its values.\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_61.txt",
        "content": "' version 18-03-2017\n' compile with: fbc -s console\n\n' TRUE/FALSE are built-in constants since FreeBASIC 1.04\n' But we have to define them for older versions.\n#Ifndef TRUE\n  #Define FALSE 0\n  #Define TRUE Not FALSE\n#EndIf\n\nSub four_rings(low As Long, high As Long, unique As Long, show As Long)\n\n  Dim As Long a, b, c, d, e, f, g\n  Dim As ULong t, total\n  Dim As ULong l = Len(Str(high))\n  If l < Len(Str(low)) Then l = Len(Str(low))\n\n\n  If show = TRUE Then\n    For a = 97 To 103\n      Print Space(l); Chr(a);\n    Next\n    Print\n    Print String((l +1) * 7, \"=\");\n    Print\n  End If\n\n  For a = low To high\n    For b = low To high\n      If unique = TRUE Then\n        If b = a Then Continue For\n      End If\n      t = a + b\n      For c = low To high\n        If unique = TRUE Then\n          If c = a OrElse c = b Then Continue For\n        End If\n        For d = low To high\n          If unique = TRUE Then\n            If d = a OrElse d = b OrElse d = c Then Continue For\n          End If\n          If b + c + d = t Then\n            For e = low To high\n              If unique = TRUE Then\n                If e = a OrElse e = b OrElse e = c OrElse e = d Then Continue For\n              End If\n              For f = low To high\n                If unique = TRUE Then\n                  If f = a OrElse f = b OrElse f = c OrElse f = d OrElse f = e Then Continue For\n                End If\n                If d + e + f = t Then\n                  For g = low To high\n                    If unique = TRUE Then\n                      If g = a OrElse g = b OrElse g = c OrElse g = d OrElse g = e OrElse g = f Then Continue For\n                    End If\n                    If f + g = t Then\n                      total += 1\n                      If show = TRUE Then\n                        Print Using String(l +1, \"#\"); a; b; c; d; e; f; g\n                      End If\n                    End If\n                  Next\n                End If\n              Next\n            Next\n          End If\n        Next\n      Next\n    Next\n  Next\n\n  If unique = TRUE Then\n    Print\n    Print total; \" Unique solutions for \"; Str(low); \" to \"; Str(high)\n  Else\n    Print total; \" Non unique solutions for \"; Str(low); \" to \"; Str(high)\n  End If\n  Print String(40, \"-\") : Print\nEnd Sub\n\n' ------=< MAIN >=------\n\nfour_rings(1, 7,  TRUE,  TRUE)\nfour_rings(3, 9,  TRUE,  TRUE)\nfour_rings(0, 9, FALSE, FALSE)\n\n' empty keyboard buffer\nWhile InKey <> \"\" : Wend\nPrint : Print \"hit any key to end program\"\nSleep\nEnd\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_62.txt",
        "content": " a b c d e f g\n==============\n 3 7 2 1 5 4 6\n 4 5 3 1 6 2 7\n 4 7 1 3 2 6 5\n 5 6 2 3 1 7 4\n 6 4 1 5 2 3 7\n 6 4 5 1 2 7 3\n 7 2 6 1 3 5 4\n 7 3 2 5 1 4 6\n\n8 Unique solutions for 1 to 7\n----------------------------------------\n\n a b c d e f g\n==============\n 7 8 3 4 5 6 9\n 8 7 3 5 4 6 9\n 9 6 4 5 3 7 8\n 9 6 5 4 3 8 7\n\n4 Unique solutions for 3 to 9\n----------------------------------------\n\n2860 Non unique solutions for 0 to 9\n----------------------------------------",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_63.txt",
        "content": "local fn FourRings( low as long, high as long, unique as BOOL, show as BOOL )\n  long          a, b, c, d, e, f, g\n  unsigned long t, total = 0\n  unsigned long l = len$( str$(high) )\n  \n  if l < len$( str$(low) ) then l = len$( str$( low) )\n  \n  if ( show == YES )\n    for a = 97 to 103\n      print space$(l); chr$(a);\n    next\n    print\n    print \" \"; string$( ( l + 1 ) * 7, \"-\" );\n    print\n  end if\n  \n  for a = low to high\n    for b = low to high\n      if ( unique == YES )\n        if b == a then continue\n      end if\n      t = a + b\n      for c = low to high\n        if unique == YES\n          if c == a or c == b then continue\n        end if\n        for d = low to high\n          if unique == YES\n            if d == a or d == b or d == c then continue\n          end if\n          if b + c + d == t\n            for e = low to high\n              if unique == YES\n                if e == a or e == b or e == c or e == d then continue\n              end if\n              for f = low to high\n                if unique == YES\n                  if f == a or f == b or f == c or f == d or f == e then continue\n                end if\n                if ( d + e + f == t )\n                  for g = low to high\n                    if unique == YES\n                      if g == a or g == b or g == c or g == d or g == e or g == f then continue\n                    end if\n                    if ( f + g == t )\n                      total += 1\n                      if( show == YES )\n                        printf @\"%3d%3d%3d%3d%3d%3d%3d\", a, b, c, d, e, f, g\n                      end if\n                    end if\n                  next\n                end if\n              next\n            next\n          end if\n        next\n      next\n    next\n  next\n  \n  if ( unique == YES )\n    print\n    print total; \" unique solutions for\"; str$(low); \" to\"; str$(high)\n    print string$(30, \"-\")\u00a0: print\n  else\n    print total; \" non-unique solutions for\"; str$(low); \" to\"; str$(high)\n    print string$(36, \"-\")\u00a0: print\n  end if\nend fn\n\nwindow 1, @\"4 Rings\", ( 0, 0, 350, 400 )\n\nfn FourRings( 1, 7, YES, YES )\nfn FourRings( 3, 9, YES, YES )\nfn FourRings( 0, 9,  NO,  NO )\n\nHandleEvents",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_64.txt",
        "content": "local fn FourRings( low as long, high as long, unique as BOOL, show as BOOL )\n  long a, b, c, d, e, f, g\n  long t, total = 0\n  long l = len(str(high))\n  \n  if ( l < len(str(low)) ) then l = len(str(low))\n  \n  if ( show )\n    for a = 97 to 103\n      print space(l);fn StringWithCharacters( @a, 1 );\n    next\n    \n    print\n    print @\" \";fn StringByPaddingToLength( @\"\", ( l + 1 ) * 7, @\"-\", 0 )\n  end if\n  \n  for a = low to high\n    for b = low to high\n      if ( unique )\n        if ( b == a ) then continue\n      end if\n      t = a + b\n      for c = low to high\n        if ( unique )\n          if ( c == a or c == b ) then continue\n        end if\n        for d = low to high\n          if ( unique )\n            if ( d == a or d == b or d == c ) then continue\n          end if\n          if ( b + c + d == t )\n            for e = low to high\n              if ( unique )\n                if ( e == a or e == b or e == c or e == d ) then continue\n              end if\n              for f = low to high\n                if ( unique )\n                  if ( f == a or f == b or f == c or f == d or f == e ) then continue\n                end if\n                if ( d + e + f == t )\n                  for g = low to high\n                    if ( unique )\n                      if ( g == a or g == b or g == c or g == d or g == e or g == f ) then continue\n                    end if\n                    if ( f + g == t )\n                      total += 1\n                      if ( show )\n                        printf @\"%3d%3d%3d%3d%3d%3d%3d\", a, b, c, d, e, f, g\n                      end if\n                    end if\n                  next\n                end if\n              next\n            next\n          end if\n        next\n      next\n    next\n  next\n  \n  if ( unique )\n    print\n    print total;@\" unique solutions for \";low;@\" to \";high\n    print fn StringByPaddingToLength( @\"\", 30, @\"-\", 0 )\n    print\n  else\n    print total;@\" non-unique solutions for \";low;@\" to \";high\n    print fn StringByPaddingToLength( @\"\", 37, @\"-\", 0 )\n    print\n  end if\nend fn\n\nwindow 1, @\"4 Rings\", ( 0, 0, 350, 400 )\n\nfn FourRings( 1, 7, YES, YES )\nfn FourRings( 3, 9, YES, YES )\nfn FourRings( 0, 9,  NO,  NO )\n\nHandleEvents",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_65.txt",
        "content": "  a  b  c  d  e  f  g\n ---------------------\n  3  7  2  1  5  4  6\n  4  5  3  1  6  2  7\n  4  7  1  3  2  6  5\n  5  6  2  3  1  7  4\n  6  4  1  5  2  3  7\n  6  4  5  1  2  7  3\n  7  2  6  1  3  5  4\n  7  3  2  5  1  4  6\n\n8 unique solutions for 1 to 7\n------------------------------\n\n  a  b  c  d  e  f  g\n ---------------------\n  7  8  3  4  5  6  9\n  8  7  3  5  4  6  9\n  9  6  4  5  3  7  8\n  9  6  5  4  3  8  7\n\n4 unique solutions for 3 to 9\n------------------------------\n\n2860 non-unique solutions for 0 to 9\n------------------------------------\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_66.txt",
        "content": "package main\n\nimport \"fmt\"\n\nfunc main(){\n\tn, c := getCombs(1,7,true)\n\tfmt.Printf(\"%d unique solutions in 1 to 7\\n\",n)\n\tfmt.Println(c)\n\tn, c = getCombs(3,9,true)\n\tfmt.Printf(\"%d unique solutions in 3 to 9\\n\",n)\n\tfmt.Println(c)\n\tn, _ = getCombs(0,9,false)\n\tfmt.Printf(\"%d non-unique solutions in 0 to 9\\n\",n)\n}\n\nfunc getCombs(low,high int,unique bool) (num int,validCombs [][]int){\n\tfor a := low; a <= high; a++ {\n\t\tfor b := low; b <= high; b++ {\n\t\t\tfor c := low; c <= high; c++ {\n\t\t\t\tfor d := low; d <= high; d++ {\n\t\t\t\t\tfor e := low; e <= high; e++ {\n\t\t\t\t\t\tfor f := low; f <= high; f++ {\n\t\t\t\t\t\t\tfor g := low; g <= high; g++ {\n\t\t\t\t\t\t\t\tif validComb(a,b,c,d,e,f,g) {\n\t\t\t\t\t\t\t\t\tif !unique || isUnique(a,b,c,d,e,f,g) {\n\t\t\t\t\t\t\t\t\t\tnum++\n\t\t\t\t\t\t\t\t\t\tvalidCombs = append(validCombs,[]int{a,b,c,d,e,f,g})\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn\n}\nfunc isUnique(a,b,c,d,e,f,g int) (res bool) {\n\tdata := make(map[int]int)\n\tdata[a]++\n\tdata[b]++\n\tdata[c]++\n\tdata[d]++\n\tdata[e]++\n\tdata[f]++\n\tdata[g]++\n\treturn len(data) == 7\n}\nfunc validComb(a,b,c,d,e,f,g int) bool{\n\tsquare1 := a + b\n\tsquare2 := b + c + d\n\tsquare3 := d + e + f\n\tsquare4 := f + g\n\treturn square1 == square2 && square2 == square3 && square3 == square4\n}\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_67.txt",
        "content": "8 unique solutions in 1 to 7\n[[3 7 2 1 5 4 6] [4 5 3 1 6 2 7] [4 7 1 3 2 6 5] [5 6 2 3 1 7 4] [6 4 1 5 2 3 7] [6 4 5 1 2 7 3] [7 2 6 1 3 5 4] [7 3 2 5 1 4 6]]\n4 unique solutions in 3 to 9\n[[7 8 3 4 5 6 9] [8 7 3 5 4 6 9] [9 6 4 5 3 7 8] [9 6 5 4 3 8 7]]\n2860 non-unique solutions in 0 to 9\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_68.txt",
        "content": "class FourRings {\n    static void main(String[] args) {\n        fourSquare(1, 7, true, true)\n        fourSquare(3, 9, true, true)\n        fourSquare(0, 9, false, false)\n    }\n\n    private static void fourSquare(int low, int high, boolean unique, boolean print) {\n        int count = 0\n\n        if (print) {\n            println(\"a b c d e f g\")\n        }\n        for (int a = low; a <= high; ++a) {\n            for (int b = low; b <= high; ++b) {\n                if (notValid(unique, a, b)) continue\n\n                int fp = a + b\n                for (int c = low; c <= high; ++c) {\n                    if (notValid(unique, c, a, b)) continue\n                    for (int d = low; d <= high; ++d) {\n                        if (notValid(unique, d, a, b, c)) continue\n                        if (fp != b + c + d) continue\n\n                        for (int e = low; e <= high; ++e) {\n                            if (notValid(unique, e, a, b, c, d)) continue\n                            for (int f = low; f <= high; ++f) {\n                                if (notValid(unique, f, a, b, c, d, e)) continue\n                                if (fp != d + e + f) continue\n\n                                for (int g = low; g <= high; ++g) {\n                                    if (notValid(unique, g, a, b, c, d, e, f)) continue\n                                    if (fp != f + g) continue\n\n                                    ++count\n                                    if (print) {\n                                        printf(\"%d %d %d %d %d %d %d%n\", a, b, c, d, e, f, g)\n                                    }\n                                }\n                            }\n                        }\n                    }\n                }\n            }\n        }\n        if (unique) {\n            printf(\"There are %d unique solutions in [%d, %d]%n\", count, low, high)\n        } else {\n            printf(\"There are %d non-unique solutions in [%d, %d]%n\", count, low, high)\n        }\n    }\n\n    private static boolean notValid(boolean unique, int needle, int ... haystack) {\n        return unique && Arrays.stream(haystack).anyMatch({ p -> p == needle })\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_69.txt",
        "content": "a b c d e f g\n3 7 2 1 5 4 6\n4 5 3 1 6 2 7\n4 7 1 3 2 6 5\n5 6 2 3 1 7 4\n6 4 1 5 2 3 7\n6 4 5 1 2 7 3\n7 2 6 1 3 5 4\n7 3 2 5 1 4 6\nThere are 8 unique solutions in [1, 7]\na b c d e f g\n7 8 3 4 5 6 9\n8 7 3 5 4 6 9\n9 6 4 5 3 7 8\n9 6 5 4 3 8 7\nThere are 4 unique solutions in [3, 9]\nThere are 2860 non-unique solutions in [0, 9]",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_7.txt",
        "content": "/* ARM assembly AARCH64 Raspberry PI 3B */\n/*  program square4_64.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 NBBOX,  7\n\n \n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nsMessDeb:           .asciz \"a= @ b= @ c= @ d= @ e= @ f= @ g= @ \\n***********************\\n\"\n \nszCarriageReturn:   .asciz \"\\n************************\\n\"\n \nsMessNbSolution:    .asciz \"Number of solutions\u00a0: @  \\n\\n\\n\"\n \n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss  \n.align 8\nsZoneConv:                .skip 24\nqValues_a:                .skip 8 * NBBOX\nqValues_b:                .skip 8 * NBBOX - 1\nqValues_c:                .skip 8 * NBBOX - 2\nqValues_d:                .skip 8 * NBBOX - 3\nqValues_e:                .skip 8 * NBBOX - 4\nqValues_f:                .skip 8 * NBBOX - 5\nqValues_g:                .skip 8 * NBBOX - 6\nqCounterSol:              .skip 8\n\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                            // entry of program \n    mov x0,#1\n    mov x1,#7\n    mov x2,#3                    // 0 = rien 1 = display 2 = count 3 = les deux\n    bl searchPb\n    mov x0,#3\n    mov x1,#9\n    mov x2,#3                    // 0 = rien 1 = display 2 = count 3 = les deux\n    bl searchPb\n    mov x0,#0\n    mov x1,#9\n    mov x2,#2                    // 0 = rien 1 = display 2 = count 3 = les deux\n    bl prepSearchNU\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 \nqAdrszCarriageReturn:            .quad szCarriageReturn\n \n/******************************************************************/\n/*     search probl\u00e8m  value not unique                           */ \n/******************************************************************/\n/* x0 contains start digit */\n/* x1 contains end digit */\n/* x2 contains action (0 display 1 count) */\nprepSearchNU:\n    stp x12,lr,[sp,-16]!         // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    stp x10,fp,[sp,-16]!         // save  registres\n    mov x5,#0                    // counter\n    mov x12,x0                   // a\n1:\n    mov x11,x0                   // b\n2:\n    mov x10,x0                   // c\n3:\n    mov x9,x0                    // d\n4:\n    add x4,x12,x11               // a + b reference\n    add x3,x11,x10\n    add x3,x3,x9                    // b + c + d\n    cmp x4,x3\n    bne 10f\n    mov x8,x0                    // e\n5:\n    mov x7,x0                    // f\n6:\n    add x3,x9,x8\n    add x3,x3,x7                    // d + e + f\n    cmp x3,x4\n    bne 9f\n    mov x6,x0                    // g\n7:\n    add x3,x7,x6                 // f + g\n    cmp x3,x4\n    bne 8f                       // not OK\n                                 // OK\n    add x5,x5,1                  // increment counter\n \n8:\n    add x6,x6,1                    // increment g\n    cmp x6,x1\n    ble 7b\n9:\n    add x7,x7,1                   // increment f\n    cmp x7,x1\n    ble 6b\n    add x8,x8,1                   // increment e\n    cmp x8,x1\n    ble 5b\n10:\n    add x9,x9,1                   // increment d\n    cmp x9,x1\n    ble 4b\n    add x10,x10,1                  // increment c\n    cmp x10,x1\n    ble 3b\n    add x11,x11,1                  // increment b\n    cmp x11,x1\n    ble 2b\n    add x12,x12,1                  // increment a\n    cmp x12,x1\n    ble 1b\n \n    // end\n    tst x2,#0b10                // print count\u00a0?\n    beq 100f\n    mov x0,x5                   // counter\n    ldr x1,qAdrsZoneConv\n    bl conversion10\n    ldr x0,qAdrsMessNbSolution\n    ldr x1,qAdrsZoneConv        // insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n\n \n100:\n\n    ldp x10,fp,[sp],16          // restaur des  2 registres\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x12,lr,[sp],16           // restaur des  2 registres\n    ret\n//qAdrsMessCounter:                .quad sMessCounter\nqAdrsMessNbSolution:             .quad sMessNbSolution\nqAdrsZoneConv:                   .quad sZoneConv\n/******************************************************************/\n/*     search problem  unique solution                            */ \n/******************************************************************/\n/* x0 contains start digit */\n/* x1 contains end digit */\n/* x2 contains action (0 display 1 count) */\nsearchPb:\n    stp x12,lr,[sp,-16]!         // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    stp x8,x9,[sp,-16]!          // save  registres\n    stp x10,fp,[sp,-16]!         // save  registres\n    mov x14,x2                   // save action\n    // init\n    ldr x3,qAdrqValues_a         // area value a\n    mov x4,#0\n1:                               // loop init value a\n    str x0,[x3,x4,lsl #3]\n    add x4,x4,1\n    add x0,x0,1\n    cmp x0,x1\n    ble 1b\n    mov x5,#0                    // solution counter\n    mov x12,#-1\n2:\n    add x12,x12,1                   // increment indice a\n    cmp x12,#NBBOX-1\n    bgt 90f\n    ldr x0,qAdrqValues_a         // area value a\n    ldr x1,qAdrqValues_b         // area value b\n    mov x2,x12                   // indice  a\n    mov x3,#NBBOX                // number of origin values \n    bl prepValues\n    mov x11,#-1\n3:\n    add x11,x11,1                                        // increment indice b\n    cmp x11,#NBBOX - 2\n    bgt 2b\n    ldr x0,qAdrqValues_b                              // area value b\n    ldr x1,qAdrqValues_c                              // area value c\n    mov x2,x11                                        // indice b\n    mov x3,#NBBOX -1                                  // number of origin values\n    bl prepValues\n    mov x10,#-1\n4:\n    add x10,x10,1\n    cmp x10,#NBBOX - 3\n    bgt 3b\n    ldr x0,qAdrqValues_c\n    ldr x1,qAdrqValues_d\n    mov x2,x10\n    mov x3,#NBBOX - 2\n    bl prepValues\n    mov x9,#-1\n5:\n    add x9,x9,1\n    cmp x9,#NBBOX - 4\n    bgt 4b\n    // control 2 firsts squares\n    ldr x0,qAdrqValues_a\n    ldr x0,[x0,x12,lsl #3]\n    ldr x1,qAdrqValues_b\n    ldr x1,[x1,x11,lsl #3]\n    add x4,x0,x1                               // a + b   value first square\n    ldr x0,qAdrqValues_c\n    ldr x0,[x0,x10,lsl #3]\n    add x7,x1,x0                               // b + c\n    ldr x1,qAdrqValues_d\n    ldr x1,[x1,x9,lsl #3]\n    add x7,x7,x1                                  // b + c + d\n    cmp x7,x4                                  // equal first square\u00a0?\n    bne 5b\n    ldr x0,qAdrqValues_d\n    ldr x1,qAdrqValues_e\n    mov x2,x9\n    mov x3,#NBBOX - 3\n    bl prepValues\n    mov x8,#-1\n6:\n    add x8,x8,1\n    cmp x8,#NBBOX - 5\n    bgt 5b\n    ldr x0,qAdrqValues_e\n    ldr x1,qAdrqValues_f\n    mov x2,x8\n    mov x3,#NBBOX - 4\n    bl prepValues\n    mov x7,#-1\n7:\n    add x7,x7,1\n    cmp x7,#NBBOX - 6\n    bgt 6b\n    ldr x0,qAdrqValues_d\n    ldr x0,[x0,x9,lsl #3]\n    ldr x1,qAdrqValues_e\n    ldr x1,[x1,x8,lsl #3]\n    add x3,x0,x1                                // d + e\n    ldr x1,qAdrqValues_f\n    ldr x1,[x1,x7,lsl #3]\n    add x3,x3,x1                                   // d + e + f\n    cmp x3,x4                                   // equal first square\u00a0?\n    bne 7b\n    ldr x0,qAdrqValues_f\n    ldr x1,qAdrqValues_g\n    mov x2,x7\n    mov x3,#NBBOX - 5\n    bl prepValues\n    mov x6,#-1\n8:\n    add x6,x6,1\n    cmp x6,#NBBOX - 7\n    bgt 7b\n    ldr x0,qAdrqValues_f\n    ldr x0,[x0,x7,lsl #3]\n    ldr x1,qAdrqValues_g\n    ldr x1,[x1,x6,lsl #3]\n    add x3,x0,x1                               // f +g \n    cmp x4,x3                                  // equal first square\u00a0?\n    bne 8b\n    \n    add x5,x5,1                                  // increment counter\n    tst x14,#0b1\n    beq 9f                                     // display solution\u00a0?\n    ldr x0,qAdrqValues_a\n    ldr x0,[x0,x12,lsl #3]\n    ldr x1,qAdrsZoneConv\n    bl conversion10\n    ldr x0,qAdrsMessDeb\n    ldr x1,qAdrsZoneConv            // insert conversion in message\n    bl strInsertAtCharInc\n    mov x2,x0\n    ldr x0,qAdrqValues_b\n    ldr x0,[x0,x11,lsl #3]\n    ldr x1,qAdrsZoneConv\n    bl conversion10\n    mov x0,x2\n    ldr x1,qAdrsZoneConv            // insert conversion in message\n    bl strInsertAtCharInc\n    mov x2,x0\n    ldr x0,qAdrqValues_c\n    ldr x0,[x0,x10,lsl #3]\n    ldr x1,qAdrsZoneConv\n    bl conversion10\n    mov x0,x2\n    ldr x1,qAdrsZoneConv            // insert conversion in message\n    bl strInsertAtCharInc\n    mov x2,x0\n    ldr x0,qAdrqValues_d\n    ldr x0,[x0,x9,lsl #3]\n    ldr x1,qAdrsZoneConv\n    bl conversion10\n    mov x0,x2\n    ldr x1,qAdrsZoneConv            // insert conversion in message\n    bl strInsertAtCharInc\n    mov x2,x0\n    ldr x0,qAdrqValues_e\n    ldr x0,[x0,x8,lsl #3]\n    ldr x1,qAdrsZoneConv\n    bl conversion10\n    mov x0,x2\n    ldr x1,qAdrsZoneConv            // insert conversion in message\n    bl strInsertAtCharInc\n    mov x2,x0\n    ldr x0,qAdrqValues_f\n    ldr x0,[x0,x7,lsl #3]\n    ldr x1,qAdrsZoneConv\n    bl conversion10\n    mov x0,x2\n    ldr x1,qAdrsZoneConv            // insert conversion in message\n    bl strInsertAtCharInc\n    mov x2,x0\n    ldr x0,qAdrqValues_g\n    ldr x0,[x0,x6,lsl #3]\n    ldr x1,qAdrsZoneConv\n    bl conversion10\n    mov x0,x2\n    ldr x1,qAdrsZoneConv            // insert conversion in message\n    bl strInsertAtCharInc\n    \n    bl affichageMess\n9:\n    b 8b    // suite \n \n90:\n    tst x14,#0b10\n    beq 100f                    // display counter\u00a0?\n    mov x0,x5\n    ldr x1,qAdrsZoneConv\n    bl conversion10\n    ldr x0,qAdrsMessNbSolution\n    ldr x1,qAdrsZoneConv        // insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n100:\n    ldp x10,fp,[sp],16          // restaur des  2 registres\n    ldp x8,x9,[sp],16           // restaur des  2 registres\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x12,lr,[sp],16           // restaur des  2 registres\n    ret\nqAdrqValues_a:                   .quad qValues_a\nqAdrqValues_b:                   .quad qValues_b\nqAdrqValues_c:                   .quad qValues_c\nqAdrqValues_d:                   .quad qValues_d\nqAdrqValues_e:                   .quad qValues_e\nqAdrqValues_f:                   .quad qValues_f\nqAdrqValues_g:                   .quad qValues_g\n \nqAdrsMessDeb:                    .quad sMessDeb\nqAdrqCounterSol:                 .quad qCounterSol\n/******************************************************************/\n/*     copy value area  and substract value of indice             */ \n/******************************************************************/\n/* x0 contains the address of values origin */\n/* x1 contains the address of values destination */\n/* x2 contains value indice to substract     */\n/* x3 contains origin values number          */\nprepValues:\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    mov x4,#0                    // indice origin value\n    mov x5,#0                    // indice destination value\n1:\n    cmp x4,x2                    // substract indice\u00a0?\n    beq 2f                       // yes -> jump\n    ldr x6,[x0,x4,lsl #3]        // no -> copy value\n    str x6,[x1,x5,lsl #3]\n    add x5,x5,1                  // increment destination indice\n2:\n   add x4,x4,1                   // increment origin indice\n   cmp x4,x3                     // end\u00a0?\n   blt 1b\n100:\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16          // restaur des  2 registres\n    ret\n/********************************************************/\n/*        File Include fonctions                        */\n/********************************************************/\n/* for this file see task include a file in language AArch64 assembly */\n.include \"../includeARM64.inc\"",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_70.txt",
        "content": "import Data.List\nimport Control.Monad\n\nperms :: (Eq a) => [a] -> [[a]]\nperms [] = [[]]\nperms xs = [ x:xr | x <- xs, xr <- perms (xs\\\\[x]) ]\n\ncombs :: (Eq a) => Int -> [a] -> [[a]]\ncombs 0 _ = [[]]\ncombs n xs = [ x:xr | x <- xs, xr <- combs (n-1) xs ]\n\nringCheck :: [Int] -> Bool\nringCheck [x0, x1, x2, x3, x4, x5, x6] = \n          v == x1+x2+x3 \n       && v == x3+x4+x5 \n       && v == x5+x6\n    where v = x0 + x1\n\nfourRings :: Int -> Int -> Bool -> Bool -> IO ()\nfourRings low high allowRepeats verbose = do\n    let candidates = if allowRepeats\n                     then combs 7 [low..high]\n                     else perms [low..high]\n\n        solutions = filter ringCheck candidates\n\n    when verbose $ mapM_ print solutions\n\n    putStrLn $    show (length solutions)  \n               ++ (if allowRepeats then \" non\" else \"\")\n               ++ \" unique solutions for \" \n               ++ show low \n               ++ \" to \" \n               ++ show high\n\n    putStrLn \"\"\n\nmain = do\n   fourRings 1 7 False True\n   fourRings 3 9 False True\n   fourRings 0 9 True False\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_71.txt",
        "content": "[3,7,2,1,5,4,6]\n[4,5,3,1,6,2,7]\n[4,7,1,3,2,6,5]\n[5,6,2,3,1,7,4]\n[6,4,1,5,2,3,7]\n[6,4,5,1,2,7,3]\n[7,2,6,1,3,5,4]\n[7,3,2,5,1,4,6]\n8 unique solutions for 1 to 7\n\n[7,8,3,4,5,6,9]\n[8,7,3,5,4,6,9]\n[9,6,4,5,3,7,8]\n[9,6,5,4,3,8,7]\n4 unique solutions for 3 to 9\n\n2860 non unique solutions for 0 to 9",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_72.txt",
        "content": "import Data.List (delete, sortBy, (\\\\))\n\n--------------- 4 RINGS OR 4 SQUARES PUZZLE --------------\n\ntype Rings = [(Int, Int, Int, Int, Int, Int, Int)]\n\nrings :: Bool -> [Int] -> Rings\nrings u digits =\n  ((>>=) <*> (queen u =<< head))\n    (sortBy (flip compare) digits)\n\nqueen :: Bool -> Int -> [Int] -> Int -> Rings\nqueen u h ds q = xs >>= leftBishop u q h ts ds\n  where\n    ts = filter ((<= h) . (q +)) ds\n    xs\n      | u = delete q ts\n      | otherwise = ds\n\nleftBishop ::\n  Bool ->\n  Int ->\n  Int ->\n  [Int] ->\n  [Int] ->\n  Int ->\n  Rings\nleftBishop u q h ts ds lb\n  | lRook <= h = xs >>= rightBishop u q h lb ds lRook\n  | otherwise = []\n  where\n    lRook = lb + q\n    xs\n      | u = ts \\\\ [q, lb, lRook]\n      | otherwise = ds\n\nrightBishop ::\n  Bool ->\n  Int ->\n  Int ->\n  Int ->\n  [Int] ->\n  Int ->\n  Int ->\n  Rings\nrightBishop u q h lb ds lRook rb\n  | (rRook <= h) && (not u || (rRook /= lb)) =\n    let ks\n          | u = (ds \\\\ [q, lb, rb, rRook, lRook])\n          | otherwise = ds\n     in ks\n          >>= knights\n            u\n            (lRook - rRook)\n            lRook\n            lb\n            q\n            rb\n            rRook\n            ks\n  | otherwise = []\n  where\n    rRook = q + rb\n\nknights ::\n  Bool ->\n  Int ->\n  Int ->\n  Int ->\n  Int ->\n  Int ->\n  Int ->\n  [Int] ->\n  Int ->\n  Rings\nknights u rookDelta lRook lb q rb rRook ks k =\n  [ (lRook, k, lb, q, rb, k2, rRook)\n    | (k2 `elem` ks)\n        && ( not u\n               || notElem\n                 k2\n                 [lRook, k, lb, q, rb, rRook]\n           )\n  ]\n  where\n    k2 = k + rookDelta\n\n--------------------------- TEST -------------------------\nmain :: IO ()\nmain = do\n  let f (k, xs) = putStrLn k >> nl >> mapM_ print xs >> nl\n      nl = putStrLn []\n  mapM_\n    f\n    [ (\"rings True [1 .. 7]\", rings True [1 .. 7]),\n      (\"rings True [3 .. 9]\", rings True [3 .. 9])\n    ]\n  f\n    ( \"length (rings False [0 .. 9])\",\n      [length (rings False [0 .. 9])]\n    )\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_73.txt",
        "content": "rings True [1 .. 7]\n\n(7,3,2,5,1,4,6)\n(6,4,1,5,2,3,7)\n(5,6,2,3,1,7,4)\n(4,7,1,3,2,6,5)\n(7,2,6,1,3,5,4)\n(6,4,5,1,2,7,3)\n(4,5,3,1,6,2,7)\n(3,7,2,1,5,4,6)\n\nrings True [3 .. 9]\n\n(9,6,4,5,3,7,8)\n(8,7,3,5,4,6,9)\n(9,6,5,4,3,8,7)\n(7,8,3,4,5,6,9)\n\nlength (rings False [0 .. 9])\n\n2860",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_74.txt",
        "content": "fspuz=:dyad define\n  range=: x+i.1+y-x\n  lo=. 6+3*x\n  hi=. _3+2*y\n  r=.i.0 0\n  if. lo <: hi do.\n    for_T.lo ([+[:i.1+-~) hi do.\n      range2=: (#~ (T-{.range)>:]) range\n      range3=: (#~ (T-+/2{.range)>:]) range\n      ab=: (#~ ~:/\"1) (,.T-])range2\n      abc=: ;ab <@([ ,\"1 0 -.~)\"1/range3\n      abcd=: (#~ T = +/@}.\"1) ;abc <@([ ,\"1 0 -.~)\"1/range3\n      abcde=: ;abcd <@([ ,\"1 0 -.~)\"1/range3\n      abcdef=: (#~ T = +/@(3}.])\"1) ;abcde <@([ ,\"1 0 -.~)\"1/range3\n      abcdefg=: (#~ T = +/@(5}.])\"1) ;abcdef <@([ ,\"1 0 -.~)\"1/range2\n      r=.r,(#~ x<:<./\"1)(#~ y>:>./\"1)abcdefg\n    end.\n  end.\n)\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_75.txt",
        "content": "fspuz2=:dyad define\n  range=: x+i.1+y-x\n  lo=. 3*x\n  hi=. 2*y\n  r=.i.0 0\n  if. lo <: hi do.\n    for_T.lo ([+[:i.1+-~) hi do.\n      ab=: (,.T-])range\n      abc=: ,/ab,\"1 0/ range\n      abcd=: (#~ T = +/@}.\"1) ,/abc,\"1 0/ range\n      abcde=: ,/abcd,\"1 0/ range\n      abcdef=: (#~ T = +/@(3}.])\"1) ,/abcde ,\"1 0/ range\n      abcdefg=: (#~ T = +/@(5}.])\"1) ,/abcdef,\"1 0/ range\n      r=.r,(#~ x<:<./\"1)(#~ y>:>./\"1)abcdefg\n    end.\n  end.\n)\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_76.txt",
        "content": "   1 fspuz 7\n4 5 3 1 6 2 7\n7 2 6 1 3 5 4\n3 7 2 1 5 4 6\n6 4 1 5 2 3 7\n6 4 5 1 2 7 3\n7 3 2 5 1 4 6\n4 7 1 3 2 6 5\n5 6 2 3 1 7 4\n   3 fspuz 9\n7 8 3 4 5 6 9\n8 7 3 5 4 6 9\n9 6 4 5 3 7 8\n9 6 5 4 3 8 7\n   #0 fspuz2 9\n2860\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_77.txt",
        "content": "import java.util.Arrays;\n\npublic class FourSquares {\n    public static void main(String[] args) {\n        fourSquare(1, 7, true, true);\n        fourSquare(3, 9, true, true);\n        fourSquare(0, 9, false, false);\n    }\n\n    private static void fourSquare(int low, int high, boolean unique, boolean print) {\n        int count = 0;\n\n        if (print) {\n            System.out.println(\"a b c d e f g\");\n        }\n        for (int a = low; a <= high; ++a) {\n            for (int b = low; b <= high; ++b) {\n                if (notValid(unique, a, b)) continue;\n\n                int fp = a + b;\n                for (int c = low; c <= high; ++c) {\n                    if (notValid(unique, c, a, b)) continue;\n                    for (int d = low; d <= high; ++d) {\n                        if (notValid(unique, d, a, b, c)) continue;\n                        if (fp != b + c + d) continue;\n\n                        for (int e = low; e <= high; ++e) {\n                            if (notValid(unique, e, a, b, c, d)) continue;\n                            for (int f = low; f <= high; ++f) {\n                                if (notValid(unique, f, a, b, c, d, e)) continue;\n                                if (fp != d + e + f) continue;\n\n                                for (int g = low; g <= high; ++g) {\n                                    if (notValid(unique, g, a, b, c, d, e, f)) continue;\n                                    if (fp != f + g) continue;\n\n                                    ++count;\n                                    if (print) {\n                                        System.out.printf(\"%d %d %d %d %d %d %d%n\", a, b, c, d, e, f, g);\n                                    }\n                                }\n                            }\n                        }\n                    }\n                }\n            }\n        }\n        if (unique) {\n            System.out.printf(\"There are %d unique solutions in [%d, %d]%n\", count, low, high);\n        } else {\n            System.out.printf(\"There are %d non-unique solutions in [%d, %d]%n\", count, low, high);\n        }\n    }\n\n    private static boolean notValid(boolean unique, int needle, int... haystack) {\n        return unique && Arrays.stream(haystack).anyMatch(p -> p == needle);\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_78.txt",
        "content": "a b c d e f g\n3 7 2 1 5 4 6\n4 5 3 1 6 2 7\n4 7 1 3 2 6 5\n5 6 2 3 1 7 4\n6 4 1 5 2 3 7\n6 4 5 1 2 7 3\n7 2 6 1 3 5 4\n7 3 2 5 1 4 6\nThere are 8 unique solutions in [1, 7]\na b c d e f g\n7 8 3 4 5 6 9\n8 7 3 5 4 6 9\n9 6 4 5 3 7 8\n9 6 5 4 3 8 7\nThere are 4 unique solutions in [3, 9]\nThere are 2860 non-unique solutions in [0, 9]",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_79.txt",
        "content": "(() => {\n    \"use strict\";\n\n    // ----------- 4-RINGS OR 4-SQUARES PUZZLE -----------\n\n    // rings\u00a0:: noRepeatedDigits -> DigitList -> solutions\n    // rings\u00a0:: Bool -> [Int] -> [[Int]]\n    const rings = uniq =>\n        digits => Boolean(digits.length) ? (\n            () => {\n                const ns = digits.sort(flip(compare));\n\n                // CENTRAL DIGIT\u00a0:: d\n                return ns.flatMap(\n                    ringTriage(uniq)(ns)\n                );\n            })() : [];\n\n\n    const ringTriage = uniq => ns => d => {\n        const\n            h = head(ns),\n            ts = ns.filter(x => (x + d) <= h);\n\n        // LEFT OF CENTRE\u00a0:: c and a\n        return (\n            uniq ? (delete_(d)(ts)) : ns\n        )\n        .flatMap(c => {\n            const a = c + d;\n\n            // RIGHT OF CENTRE\u00a0:: e and g\n            return a > h ? (\n                []\n            ) : (\n                uniq ? (\n                    difference(ts)([d, c, a])\n                ) : ns\n            )\n            .flatMap(subTriage(uniq)([ns, h, a, c, d]));\n        });\n    };\n\n\n    const subTriage = uniq =>\n        ([ns, h, a, c, d]) => e => {\n            const g = d + e;\n\n            return ((g > h) || (\n                uniq && (g === c))\n            ) ? (\n                    []\n                ) : (() => {\n                    const\n                        agDelta = a - g,\n                        bfs = uniq ? (\n                            difference(ns)([\n                                d, c, e, g, a\n                            ])\n                        ) : ns;\n\n                    // MID LEFT, MID RIGHT\u00a0:: b and f\n                    return bfs.flatMap(b => {\n                        const f = b + agDelta;\n\n                        return (bfs).includes(f) && (\n                            !uniq || ![\n                                a, b, c, d, e, g\n                            ].includes(f)\n                        ) ? ([\n                                [a, b, c, d, e, f, g]\n                            ]) : [];\n                    });\n                })();\n        };\n\n    // ---------------------- TEST -----------------------\n    const main = () => unlines([\n        \"rings(true, enumFromTo(1,7))\\n\",\n        unlines(\n            rings(true)(\n                enumFromTo(1)(7)\n            ).map(show)\n        ),\n\n        \"\\nrings(true, enumFromTo(3, 9))\\n\",\n        unlines(\n            rings(true)(\n                enumFromTo(3)(9)\n            ).map(show)\n        ),\n\n        \"\\nlength(rings(false, enumFromTo(0, 9)))\\n\",\n        rings(false)(\n            enumFromTo(0)(9)\n        )\n        .length\n        .toString(),\n        \"\"\n    ]);\n\n\n    // ---------------- GENERIC FUNCTIONS ----------------\n\n    // compare\u00a0:: a -> a -> Ordering\n    const compare = (a, b) =>\n        a < b ? -1 : (a > b ? 1 : 0);\n\n\n    // delete\u00a0:: Eq a => a -> [a] -> [a]\n    const delete_ = x => {\n        // xs with first instance of x (if any) removed.\n        const go = xs =>\n            Boolean(xs.length) ? (\n                (x === xs[0]) ? (\n                    xs.slice(1)\n                ) : [xs[0]].concat(go(xs.slice(1)))\n            ) : [];\n\n        return go;\n    };\n\n\n    // difference\u00a0:: Eq a => [a] -> [a] -> [a]\n    const difference = xs =>\n        ys => {\n            const s = new Set(ys);\n\n            return xs.filter(x => !s.has(x));\n        };\n\n\n    // enumFromTo\u00a0:: Int -> Int -> [Int]\n    const enumFromTo = m =>\n        n => Array.from({\n            length: 1 + n - m\n        }, (_, i) => m + i);\n\n\n    // flip\u00a0:: (a -> b -> c) -> b -> a -> c\n    const flip = op =>\n        // The binary function op with\n        // its arguments reversed.\n        1 !== op.length ? (\n            (a, b) => op(b, a)\n        ) : (a => b => op(b)(a));\n\n\n    // head\u00a0:: [a] -> a\n    const head = xs =>\n        // The first item (if any) in a list.\n        Boolean(xs.length) ? (\n            xs[0]\n        ) : null;\n\n\n    // show\u00a0:: a -> String\n    const show = x =>\n        JSON.stringify(x);\n\n\n    // unlines\u00a0:: [String] -> String\n    const unlines = xs =>\n        // A single string formed by the intercalation\n        // of a list of strings with the newline character.\n        xs.join(\"\\n\");\n\n\n    // MAIN ---\n    return main();\n})();\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_8.txt",
        "content": "a= 3 b= 7 c= 2 d= 1 e= 5 f= 4 g= 6\n***********************\na= 4 b= 5 c= 3 d= 1 e= 6 f= 2 g= 7\n***********************\na= 4 b= 7 c= 1 d= 3 e= 2 f= 6 g= 5\n***********************\na= 5 b= 6 c= 2 d= 3 e= 1 f= 7 g= 4\n***********************\na= 6 b= 4 c= 1 d= 5 e= 2 f= 3 g= 7\n***********************\na= 6 b= 4 c= 5 d= 1 e= 2 f= 7 g= 3\n***********************\na= 7 b= 2 c= 6 d= 1 e= 3 f= 5 g= 4\n***********************\na= 7 b= 3 c= 2 d= 5 e= 1 f= 4 g= 6\n***********************\nNumber of solutions\u00a0: 8\n\n\na= 7 b= 8 c= 3 d= 4 e= 5 f= 6 g= 9\n***********************\na= 8 b= 7 c= 3 d= 5 e= 4 f= 6 g= 9\n***********************\na= 9 b= 6 c= 4 d= 5 e= 3 f= 7 g= 8\n***********************\na= 9 b= 6 c= 5 d= 4 e= 3 f= 8 g= 7\n***********************\nNumber of solutions\u00a0: 4\n\n\nNumber of solutions\u00a0: 2860\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_80.txt",
        "content": "rings(true, enumFromTo(1,7))\n\n[7,3,2,5,1,4,6]\n[6,4,1,5,2,3,7]\n[5,6,2,3,1,7,4]\n[4,7,1,3,2,6,5]\n[7,2,6,1,3,5,4]\n[6,4,5,1,2,7,3]\n[4,5,3,1,6,2,7]\n[3,7,2,1,5,4,6]\n\nrings(true, enumFromTo(3, 9))\n\n[9,6,4,5,3,7,8]\n[8,7,3,5,4,6,9]\n[9,6,5,4,3,8,7]\n[7,8,3,4,5,6,9]\n\nlength(rings(false, enumFromTo(0, 9)))\n\n2860",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_81.txt",
        "content": "# Generate a stream of all the permutations of the input array\ndef permutations:\n  if length == 0 then []\n  else\n    range(0;length) as $i\n    | [.[$i]] + (del(.[$i])|permutations)\n  end\u00a0;\n\n# Permutations of a ... n inclusive\ndef permutations(a;n):\n  [range(a;n+1)] | permutations;\n\n# value of a box\n# Input: the table of values\ndef valueOfBox($box):\n  [ .[ $box[] ]] | add;\n\ndef allEqual($boxes):\n  . as $values\n  | valueOfBox($boxes[0]) as $sum\n  | all($boxes[1:][]; . as $box | $values | valueOfBox($box) == $sum);\n\ndef combinations($m; $n; $size):\n  [range(0; $size) | [range($m; $n)]] | combinations;\n\ndef count(s): reduce s as $x (null; .+1);\n\n# a=0, b=1, etc\ndef boxes: [[0,1], [1,2,3], [3,4,5], [5,6]];\n\ndef tasks:\n  \"1 to 7:\",\n  (permutations(1;7) | select(allEqual(boxes))),\n  \"\\n3 to 9:\",\n  (permutations(3;9) | select(allEqual(boxes))),\n  \"\\n0 to 9:\\n\\(count(permutations(0;9) | select(allEqual(boxes))))\",\n  \"\\nThere are \\(count(combinations(0;10;7) | select(allEqual(boxes)))) solutions for 0 to 9 with replacement.\"\n;\n\ntasks",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_82.txt",
        "content": "1 to 7:\n[3,7,2,1,5,4,6]\n[4,5,3,1,6,2,7]\n[4,7,1,3,2,6,5]\n[5,6,2,3,1,7,4]\n[6,4,1,5,2,3,7]\n[6,4,5,1,2,7,3]\n[7,2,6,1,3,5,4]\n[7,3,2,5,1,4,6]\n\n3 to 9:\n[7,8,3,4,5,6,9]\n[8,7,3,5,4,6,9]\n[9,6,4,5,3,7,8]\n[9,6,5,4,3,8,7]\n\nThere are 1152 distinct solutions for 0 to 9.\n\nThere are 2860 solutions for 0 to 9 with replacement.\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_83.txt",
        "content": "# rings/3 assumes that each box (except for the last) has exactly one overlap with its successor.\n# Input: ignored.\n# Output: a stream of solutions, i.e. a stream of arrays.\n# $boxes is an array of boxes, each box being a flat array.\n# $min and $max define the range of permissible values of items in the boxes (inclusive)\ndef rings($boxes; $min; $max):\n\n  def inrange: $min <= . and . <= $max;\n \n  # The following helper function deals with the case when the global per-box sum ($sum) is known.\n  # Input: an array representing the solution so far, or null.\n  # Output: the input plus the solution corresponding to the first argument.\n  # $this is the sum of the previous items in the first box, or 0.\n  def solve($boxes; $this; $sum):\n  \n    # The following is a helper function for handling the case when:\n    # *  $sum is known\n    # *  $boxes[0] | length == 1, and\n    # *  $boxes|length>1\n    def lastInBox($boxes; $this):\n      . as $in\n      | ($boxes[1:] | (.[0] |= .[1:])) as $bx\n      # the first entry in the next box must be the same:\n      | ($sum - $this) as $next\n      | select($next | inrange)\n      | (. + [$next]) | solve( $bx; $next; $sum)\u00a0;\n\n    . as $in\n    | if $boxes|length == 0 then $in\n      else $boxes[0] as $box\n      | if $box|length == 0\n\tthen solve( $boxes[1:]; 0; $sum )\n        elif $box|length == 1\n        # is this the last box?\n        then if $boxes|length == 1\n             then ($sum - $this) as $next\n  \t     | select($next | inrange)\n  \t     | $in + [$next]\n             else lastInBox($boxes; $this)\n             end\n        else # $box|length > 1\n        range($min; $max + 1) as $first\n        | select( ($this + $first) <= $sum)\n        | ($in + [$first]) | solve( [$box[1:]] + $boxes[1:]; $this + $first; $sum)\n        end\n      end\u00a0;\n  \n  . as $in\n  | $boxes[0] as $box\n  | ($boxes[1:] | .[0] |= .[1:]) as $bx\n  | [range(0; $box|length) | [range($min; $max + 1)]]\n  | combinations\n  | solve($bx; .[-1]; add)\u00a0;\n\ndef count(s): reduce s as $x (null; .+1);",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_84.txt",
        "content": "# a=0, b=1, etc\ndef boxes: [[0,1], [1,2,3], [3,4,5], [5,6]];\n\ncount(rings(boxes; 0; 9))",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_85.txt",
        "content": "2860\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_86.txt",
        "content": "using Combinatorics\n\nfunction foursquares(low, high, onlyunique=true, showsolutions=true)\n    integers = collect(low:high)\n    count = 0\n    sumsallequal(c) = c[1] + c[2] == c[2] + c[3] + c[4] == c[4] + c[5] + c[6] == c[6] + c[7]\n    combos = onlyunique ? combinations(integers) :\n                          with_replacement_combinations(integers, 7)\n    for combo in combos, plist in unique(collect(permutations(combo, 7)))\n        if sumsallequal(plist)\n            count += 1\n            if showsolutions\n                println(\"$plist is a solution for the list $integers\")\n            end\n        end\n    end\n    println(\"\"\"Total $(onlyunique?\"unique \":\"\")solutions for HIGH $high, LOW $low: $count\"\"\")\nend\n\nfoursquares(1, 7, true, true)\nfoursquares(3, 9, true, true)\nfoursquares(0, 9, false, false)\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_87.txt",
        "content": "[3, 7, 2, 1, 5, 4, 6] is a solution for the list [1, 2, 3, 4, 5, 6, 7]\n[4, 5, 3, 1, 6, 2, 7] is a solution for the list [1, 2, 3, 4, 5, 6, 7]\n[4, 7, 1, 3, 2, 6, 5] is a solution for the list [1, 2, 3, 4, 5, 6, 7]\n[5, 6, 2, 3, 1, 7, 4] is a solution for the list [1, 2, 3, 4, 5, 6, 7]\n[6, 4, 1, 5, 2, 3, 7] is a solution for the list [1, 2, 3, 4, 5, 6, 7]\n[6, 4, 5, 1, 2, 7, 3] is a solution for the list [1, 2, 3, 4, 5, 6, 7]\n[7, 2, 6, 1, 3, 5, 4] is a solution for the list [1, 2, 3, 4, 5, 6, 7]\n[7, 3, 2, 5, 1, 4, 6] is a solution for the list [1, 2, 3, 4, 5, 6, 7]\nTotal unique solutions for HIGH 7, LOW 1: 8\n[7, 8, 3, 4, 5, 6, 9] is a solution for the list [3, 4, 5, 6, 7, 8, 9]\n[8, 7, 3, 5, 4, 6, 9] is a solution for the list [3, 4, 5, 6, 7, 8, 9]\n[9, 6, 4, 5, 3, 7, 8] is a solution for the list [3, 4, 5, 6, 7, 8, 9]\n[9, 6, 5, 4, 3, 8, 7] is a solution for the list [3, 4, 5, 6, 7, 8, 9]\nTotal unique solutions for HIGH 9, LOW 3: 4\nTotal solutions for HIGH 9, LOW 0: 2860\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_88.txt",
        "content": "fun is_unique(a: int, b: int, c: int, d: int, e: int, f: int, g: int)\n  a != b && a != c && a != d && a != e && a != f && a != g &&\n  b != c && b != d && b != e && b != f && b != g &&\n  c != d && c != e && c != f && c != g &&\n  d != e && d != f && d != g &&\n  e != f && e != g &&\n  f != g\n\nfun is_solution(a: int, b: int, c: int, d: int, e: int, f: int, g: int)\n  val bcd = b + c + d\n  val ab = a + b\n  if ab != bcd then return False\n  val def = d + e + f\n  if bcd != def then return False\n  val fg = f + g\n  return def == fg\n\nfun four_squares(low: int, high: int, unique:bool=True)\n  var count := 0\n  for(low, high) fn(a)\n    for(low, high) fn(b)\n      for(low, high) fn(c)\n        for(low, high) fn(d)\n          for(low, high) fn(e)\n            for(low, high) fn(f)\n              for(low, high) fn(g)\n                if (!unique || is_unique(a, b, c, d, e, f, g)) && is_solution(a, b, c, d, e, f, g) then\n                  count := count + 1\n                  if unique then\n                    println([a, b, c, d, e, f, g].show)\n                  else\n                    ()\n  val uniquestr = if unique then \"unique\" else \"non-unique\"\n  println(count.show ++ \" \" ++ uniquestr ++ \" solutions in \" ++ low.show ++ \" to \" ++ high.show ++ \" range\\n\")\n\nfun main()\n  four_squares(1, 7)\n  four_squares(3, 9)\n  four_squares(0, 9, False)\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_89.txt",
        "content": "[3,7,2,1,5,4,6]\n[4,5,3,1,6,2,7]\n[4,7,1,3,2,6,5]\n[5,6,2,3,1,7,4]\n[6,4,1,5,2,3,7]\n[6,4,5,1,2,7,3]\n[7,2,6,1,3,5,4]\n[7,3,2,5,1,4,6]\n8 unique solutions in 1 to 7 range\n\n[7,8,3,4,5,6,9]\n[8,7,3,5,4,6,9]\n[9,6,4,5,3,7,8]\n[9,6,5,4,3,8,7]\n4 unique solutions in 3 to 9 range\n\n2860 non-unique solutions in 0 to 9 range\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_9.txt",
        "content": ";;; solve the 4 rings or 4 squares puzzle\n\nDEFINE TRUE = \"1\", FALSE = \"0\"\n\n;;; finds solutions to the equations:\n;;;       a + b = b + c + d = d + e + f = f + g\n;;;       where a, b, c, d, e, f, g in lo\u00a0: hi ( not necessarily unique )\n;;;       depending on show, the solutions will be printed or not\nPROC fourRings( INT lo, hi BYTE allowDuplicates, show )\n  INT solutions, t, a, b, c, d, e, f, g, uniqueOrNot\n  solutions = 0\n  FOR a = lo TO hi DO\n    FOR b = lo TO hi DO\n      IF allowDuplicates OR a <> b THEN\n        t = a + b\n        FOR c = lo TO hi DO\n          IF allowDuplicates OR ( a <> c AND b <> c ) THEN\n            d = t - ( b + c )\n            IF  d >= lo AND d <= hi\n            AND ( allowDuplicates OR ( a <> d AND b <> d AND c <> d ) )\n            THEN\n              FOR e = lo TO hi DO\n                IF allowDuplicates\n                OR ( a <> e AND b <> e AND c <> e AND d <> e )\n                THEN\n                  g = d + e\n                  f = t - g\n                  IF  f >= lo AND f <= hi\n                  AND g >= lo AND g <= hi\n                  AND (  allowDuplicates\n                      OR (   a <> f AND b <> f AND c <> f\n                         AND d <> f AND e <> f\n                         AND a <> g AND b <> g AND c <> g\n                         AND d <> g AND e <> g AND f <> g\n                         )\n                      )\n                  THEN\n                    solutions ==+ 1\n                    IF show THEN\n                      PrintF( \" %U %U %U %U\", a, b, c, d )\n                      PrintF( \" %U %U %U%E\",  e, f, g )\n                    FI\n                  FI\n                FI\n              OD\n            FI\n          FI\n        OD\n      FI\n    OD\n  OD\n  IF   allowDuplicates\n  THEN uniqueOrNot = \"non-unique\"\n  ELSE uniqueOrNot = \"unique\"\n  FI\n  PrintF( \"%U %S solutions in %U to %U%E%E\", solutions, uniqueOrNot, lo, hi )\nRETURN\n\n;;; find the solutions as required for the task\nPROC Main()\n  fourRings( 1, 7, FALSE, TRUE  )\n  fourRings( 3, 9, FALSE, TRUE  )\n  fourRings( 0, 9, TRUE,  FALSE )\nRETURN",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_90.txt",
        "content": "// version 1.1.2\n\nclass FourSquares(\n    private val lo: Int,\n    private val hi: Int,\n    private val unique: Boolean,\n    private val show: Boolean\n) {\n    private var a = 0\n    private var b = 0\n    private var c = 0\n    private var d = 0\n    private var e = 0\n    private var f = 0\n    private var g = 0\n    private var s = 0\n\n    init {\n        println()\n        if (show) {\n            println(\"a b c d e f g\")\n            println(\"-------------\")\n        }\n        acd()\n        println(\"\\n$s ${if (unique) \"unique\" else \"non-unique\"} solutions in $lo to $hi\")\n    }\n\n    private fun acd() {\n        c = lo\n        while (c <= hi) {\n            d = lo\n            while (d <= hi) {\n                if (!unique || c != d) {\n                    a = c + d\n                    if ((a in lo..hi) && (!unique || (c != 0 && d!= 0))) ge()\n                }\n                d++\n            }\n            c++\n        }\n    }\n\n    private fun bf() {\n        f = lo\n        while (f <= hi) {\n            if (!unique || (f != a && f != c && f != d && f != e && f!= g)) {\n                b = e + f - c\n                if ((b in lo..hi) && (!unique || (b != a && b != c && b != d && b != e && b != f && b!= g))) {\n                    s++\n                    if (show) println(\"$a $b $c $d $e $f $g\")\n                }\n            }\n            f++\n        }\n    }\n\n    private fun ge() {\n        e = lo\n        while (e <= hi) {\n            if (!unique || (e != a && e != c && e != d)) {\n                g = d + e\n                if ((g in lo..hi) && (!unique || (g != a && g != c && g != d && g != e))) bf()\n            }\n            e++\n        }\n    }\n}\n\nfun main(args: Array<String>) {\n    FourSquares(1, 7, true, true)\n    FourSquares(3, 9, true, true)\n    FourSquares(0, 9, false, false)\n}\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_91.txt",
        "content": "a b c d e f g\n-------------\n4 7 1 3 2 6 5\n6 4 1 5 2 3 7\n3 7 2 1 5 4 6\n5 6 2 3 1 7 4\n7 3 2 5 1 4 6\n4 5 3 1 6 2 7\n6 4 5 1 2 7 3\n7 2 6 1 3 5 4\n\n8 unique solutions in 1 to 7\n\na b c d e f g\n-------------\n7 8 3 4 5 6 9\n8 7 3 5 4 6 9\n9 6 4 5 3 7 8\n9 6 5 4 3 8 7\n\n4 unique solutions in 3 to 9\n\n\n2860 non-unique solutions in 0 to 9\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_92.txt",
        "content": "function valid(unique,needle,haystack)\n    if unique then\n        for _,value in pairs(haystack) do\n            if needle == value then\n                return false\n            end\n        end\n    end\n    return true\nend\n\nfunction fourSquare(low,high,unique,prnt)\n    count = 0\n    if prnt then\n        print(\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\")\n    end\n    for a=low,high do\n        for b=low,high do\n            if valid(unique, a, {b}) then\n                fp = a + b\n                for c=low,high do\n                    if valid(unique, c, {a, b}) then\n                        for d=low,high do\n                            if valid(unique, d, {a, b, c}) and fp == b + c + d then\n                                for e=low,high do\n                                    if valid(unique, e, {a, b, c, d}) then\n                                        for f=low,high do\n                                            if valid(unique, f, {a, b, c, d, e}) and fp == d + e + f then\n                                                for g=low,high do\n                                                    if valid(unique, g, {a, b, c, d, e, f}) and fp == f + g then\n                                                        count = count + 1\n                                                        if prnt then\n                                                            print(a, b, c, d, e, f, g)\n                                                        end\n                                                    end\n                                                end\n                                            end\n                                        end\n                                    end\n                                end\n                            end\n                        end\n                    end\n                end\n            end\n        end\n    end\n    if unique then\n        print(string.format(\"There are %d unique solutions in [%d, %d]\", count, low, high))\n    else\n        print(string.format(\"There are %d non-unique solutions in [%d, %d]\", count, low, high))\n    end\nend\n\nfourSquare(1,7,true,true)\nfourSquare(3,9,true,true)\nfourSquare(0,9,false,false)\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_93.txt",
        "content": "a       b       c       d       e       f       g\n3       7       2       1       5       4       6\n4       5       3       1       6       2       7\n4       7       1       3       2       6       5\n5       6       2       3       1       7       4\n6       4       1       5       2       3       7\n6       4       5       1       2       7       3\n7       2       6       1       3       5       4\n7       3       2       5       1       4       6\nThere are 8 unique solutions in [1, 7]\na       b       c       d       e       f       g\n7       8       3       4       5       6       9\n8       7       3       5       4       6       9\n9       6       4       5       3       7       8\n9       6       5       4       3       8       7\nThere are 4 unique solutions in [3, 9]\nThere are 2860 non-unique solutions in [0, 9]",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_94.txt",
        "content": "{low, high} = {1, 7};\nSolveValues[{a + b == b + c + d == d + e + f == f + g, low <= a <= high, \n  low <= b <= high, low <= c <= high, low <= d <= high, \n  low <= e <= high, low <= f <= high, low <= g <= high, \n  a != b != c != d != e != f != g}, {a, b, c, d, e, f, g}, Integers]\n\n{low, high} = {3, 9};\nSolveValues[{a + b == b + c + d == d + e + f == f + g, low <= a <= high, \n  low <= b <= high, low <= c <= high, low <= d <= high, \n  low <= e <= high, low <= f <= high, low <= g <= high, \n  a != b != c != d != e != f != g}, {a, b, c, d, e, f, g}, Integers]\n\n{low, high} = {0, 9};\nSolveValues[{a + b == b + c + d == d + e + f == f + g, low <= a <= high, \n   low <= b <= high, low <= c <= high, low <= d <= high, \n   low <= e <= high, low <= f <= high, low <= g <= high}, {a, b, c, d,\n    e, f, g}, Integers] // Length\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_95.txt",
        "content": "{{3, 7, 2, 1, 5, 4, 6}, {4, 5, 3, 1, 6, 2, 7}, {4, 7, 1, 3, 2, 6, \n  5}, {5, 6, 2, 3, 1, 7, 4}, {6, 4, 1, 5, 2, 3, 7}, {6, 4, 5, 1, 2, 7,\n   3}, {7, 2, 6, 1, 3, 5, 4}, {7, 3, 2, 5, 1, 4, 6}}\n\n{{7, 8, 3, 4, 5, 6, 9}, {8, 7, 3, 5, 4, 6, 9}, {9, 6, 4, 5, 3, 7, \n  8}, {9, 6, 5, 4, 3, 8, 7}}\n\n2860",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_96.txt",
        "content": "combinations = function(elements, comboLength, unique=true)\n\tn = elements.len\n\tif comboLength > n then return []\n\t\n\tallCombos = []\n\t\n\tgenCombos=function(start, currCombo)\n\t\tif currCombo.len == comboLength then\n\t\t\tallCombos.push(currCombo)\n\t\t\treturn\n\t\tend if\n\t\tif start == n then return\n\t\tfor i in range(start, n - 1)\n\t\t\tnewCombo = currCombo + [elements[i]]\n\t\t\tgenCombos(i + unique, newCombo)\n\t\tend for\n\tend function\n\t\n\tgenCombos(0, [])\n\treturn allCombos\nend function\n\npermutations = function(elements, permLength=null)\n\tn = elements.len\n\telements.sort\n\tif permLength == null then permLength = n\n\t\n\tallPerms = []\n\t\n\tgenPerms = function(prefix, remainingElements)\n\t\tif prefix.len == permLength then\n\t\t\tallPerms.push(prefix)\n\t\t\treturn\n\t\tend if\n\t\t\n\t\tfor i in range(0, remainingElements.len - 1)\n\t\t\tif i > 0 and remainingElements[i] == remainingElements[i-1] then continue\n\t\t\tnewPrefix = prefix + [remainingElements[i]]\n\t\t\tnewRemains = remainingElements[:i] + remainingElements[i+1:]\n\t\t\tgenPerms(newPrefix, newRemains)\n\t\tend for\n\tend function\n\tgenPerms([],elements)\n\treturn allPerms\nend function\n\nringsEqual = function(a)\n\tif a.len != 7 then return false\n\treturn a[0]+a[1] == a[1]+a[2]+a[3] == a[3]+a[4]+a[5] == a[5] + a[6]\nend function\n\nfourRings = function(lo, hi, unique, show)\n\trng = range(lo, hi)\n\tcombos = combinations(rng, 7, unique)\n\tcnt = 0\n\tfor c in combos\n\t\tfor p in permutations(c)\n\t\t\tif ringsEqual(p) then\n\t\t\t\tcnt += 1\n\t\t\t\tif show then print p.join(\", \")\n\t\t\tend if\n\t\tend for\n\tend for\n\tuniStr = [\" nonunique\", \" unique\"]\n\tprint cnt + uniStr[unique] + \" solutions for \" + lo + \" to \" + hi\n\tprint\nend function\n\nfourRings(1, 7, true, true)\nfourRings(3, 9, true, true)\nfourRings(0, 9, false, false)\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_97.txt",
        "content": "3, 7, 2, 1, 5, 4, 6\n4, 5, 3, 1, 6, 2, 7\n4, 7, 1, 3, 2, 6, 5\n5, 6, 2, 3, 1, 7, 4\n6, 4, 1, 5, 2, 3, 7\n6, 4, 5, 1, 2, 7, 3\n7, 2, 6, 1, 3, 5, 4\n7, 3, 2, 5, 1, 4, 6\n8 unique solutions for 1 to 7\n\n7, 8, 3, 4, 5, 6, 9\n8, 7, 3, 5, 4, 6, 9\n9, 6, 4, 5, 3, 7, 8\n9, 6, 5, 4, 3, 8, 7\n4 unique solutions for 3 to 9\n\n2860 nonunique solutions for 0 to 9",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_98.txt",
        "content": "MODULE FourSquare;\nFROM Conversions IMPORT IntToStr;\nFROM Terminal IMPORT *;\n\nPROCEDURE WriteInt(num : INTEGER);\nVAR str : ARRAY[0..16] OF CHAR;\nBEGIN\n    IntToStr(num,str);\n    WriteString(str);\nEND WriteInt;\n\nPROCEDURE four_square(low, high : INTEGER; unique, print : BOOLEAN);\nVAR count : INTEGER;\nVAR a, b, c, d, e, f, g : INTEGER;\nVAR fp : INTEGER;\nBEGIN\n    count:=0;\n\n    IF print THEN\n        WriteString('a b c d e f g');\n        WriteLn;\n    END;\n    FOR a:=low TO high DO\n        FOR b:=low TO high DO\n            IF unique AND (b=a) THEN CONTINUE; END;\n\n            fp:=a+b;\n            FOR c:=low TO high DO\n                IF unique AND ((c=a) OR (c=b)) THEN CONTINUE; END;\n                FOR d:=low TO high DO\n                    IF unique AND ((d=a) OR (d=b) OR (d=c)) THEN CONTINUE; END;\n                    IF fp # b+c+d THEN CONTINUE; END;\n\n                    FOR e:=low TO high DO\n                        IF unique AND ((e=a) OR (e=b) OR (e=c) OR (e=d)) THEN CONTINUE; END;\n                        FOR f:=low TO high DO\n                            IF unique AND ((f=a) OR (f=b) OR (f=c) OR (f=d) OR (f=e)) THEN CONTINUE; END;\n                            IF fp # d+e+f THEN CONTINUE; END;\n\n                            FOR g:=low TO high DO\n                                IF unique AND ((g=a) OR (g=b) OR (g=c) OR (g=d) OR (g=e) OR (g=f)) THEN CONTINUE; END;\n                                IF fp # f+g THEN CONTINUE; END;\n\n                                INC(count);\n                                IF print THEN\n                                    WriteInt(a);\n                                    WriteString(' ');\n                                    WriteInt(b);\n                                    WriteString(' ');\n                                    WriteInt(c);\n                                    WriteString(' ');\n                                    WriteInt(d);\n                                    WriteString(' ');\n                                    WriteInt(e);\n                                    WriteString(' ');\n                                    WriteInt(f);\n                                    WriteString(' ');\n                                    WriteInt(g);\n                                    WriteLn;\n                                END;\n                            END;\n                        END;\n                    END;\n                END;\n            END;\n        END;\n    END;\n    IF unique THEN\n        WriteString('There are ');\n        WriteInt(count);\n        WriteString(' unique solutions in [');\n        WriteInt(low);\n        WriteString(', ');\n        WriteInt(high);\n        WriteString(']');\n        WriteLn;\n    ELSE\n        WriteString('There are ');\n        WriteInt(count);\n        WriteString(' non-unique solutions in [');\n        WriteInt(low);\n        WriteString(', ');\n        WriteInt(high);\n        WriteString(']');\n        WriteLn;\n    END;\nEND four_square;\n\nBEGIN\n    four_square(1,7,TRUE,TRUE);\n    four_square(3,9,TRUE,TRUE);\n    four_square(0,9,FALSE,FALSE);\n    ReadChar; (* Wait so results can be viewed. *)\nEND FourSquare.\n",
        "safe": true
    },
    {
        "filename": "4-rings or 4-squares puzzle_99.txt",
        "content": "func isUnique(a, b, c, d, e, f, g: uint8): bool =\n  a != b and a != c and a != d and a != e and a != f and a != g and\n    b != c and b != d and b != e and b != f and b != g and\n    c != d and c != e and c != f and c != g and\n    d != e and d != f and d != f and\n    e != f and e != g and\n    f != g\n\nfunc isSolution(a, b, c, d, e, f, g: uint8): bool =\n  let sum = a + b\n  sum == b + c + d and sum == d + e + f and sum == f + g\n\nfunc fourSquares(l, h: uint8, unique: bool): seq[array[7, uint8]] =\n  for a in l..h:\n    for b in l..h:\n      for c in l..h:\n        for d in l..h:\n          for e in l..h:\n            for f in l..h:\n              for g in l..h:\n                if (not unique or isUnique(a, b, c, d, e, f, g)) and\n                   isSolution(a, b, c, d, e, f, g):\n                  result &= [a, b, c, d, e, f, g]\n\nproc printFourSquares(l, h: uint8, unique = true) =\n  let solutions = fourSquares(l, h, unique)\n\n  if unique:\n    for s in solutions:\n      echo s\n\n  echo solutions.len, (if unique: \" \" else: \" non-\"), \"unique solutions in \",\n     l, \" to \", h, \" range\\n\"\n\nwhen isMainModule:\n  printFourSquares(1, 7)\n  printFourSquares(3, 9)\n  printFourSquares(0, 9, unique = false)\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_1.txt",
        "content": "                                      1\n                                    1   1\n                                  1   1   1 \n                                1   2   1   1\n                              1   2   2   1   1\n                            1   3   3   2   1   1\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_10.txt",
        "content": "/* ARM assembly Raspberry PI  */\n/*  program integerName.s   */ \n\n/* REMARK 1\u00a0: this program use routines in a include file \n   see task Include a file language arm assembly \n   for the routine affichageMess conversion10 \n   see at end of this program the instruction include */\n/* for constantes see task include a file in arm assembly */\n/************************************/\n/* Constantes                       */\n/************************************/\n.include \"../constantes.inc\"\n\n.equ MAXI,   127\n\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nsMessResult:        .asciz \"Total \u00a0: @  \\n\"\nszMessError:        .asciz \"Number too large\u00a0!!.\\n\"\nszCarriageReturn:   .asciz \"\\n\"\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\nsZoneConv:        .skip 24\ntbNames:          .skip 4 * MAXI\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                 @ entry of program \n    \n    mov r0,#5\n    bl functionG\n    \n    mov r0,#23\n    bl functionG\n\n    mov r0,#123\n    bl functionG\n    \n    mov r0,#1234\n    bl functionG\n    \n100:                                  @ standard end of the program \n    mov r0, #0                        @ return code\n    mov r7, #EXIT                     @ request to exit program\n    svc #0                            @ perform the system call\n \niAdrszCarriageReturn:     .int szCarriageReturn\niAdrsMessResult:          .int sMessResult\niAdrtbNames:               .int tbNames\niAdrsZoneConv:            .int sZoneConv\n/******************************************************************/\n/*            compute function G                                 */ \n/******************************************************************/\n/* r0 contains N */\nfunctionG:\n    push {r1-r3,lr}              @ save registers\n    cmp r0,#MAXI + 1\n    bge 2f\n    mov r3,r0\n    mov r2,#1\n1:                               @ loop compute every item\n    mov r0,r2\n    bl computeNumber\n    add r2,r2,#1\n    cmp r2,r3\n    ble 1b\n \n    ldr r1,iAdrsZoneConv         @ result display\n    bl conversion10              @ call decimal conversion\n    ldr r0,iAdrsMessResult\n    ldr r1,iAdrsZoneConv         @ insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n    mov r0,#0\n    b 100f\n2:\n    ldr r0,iAdrszMessError\n    bl affichageMess\n    mov r0,#-1\n100:\n    pop {r1-r3,lr}\n    bx lr                         @ return \niAdrszMessError:         .int szMessError\n/******************************************************************/\n/*            random door test strategy                           */ \n/******************************************************************/\n/* r0 contains N */\ncomputeNumber:\n    push {r1-r7,lr}              @ save registers\n    ldr r6,iAdrtbNames           @ table address\n    mov r1,#1\n    str r1,[r6]                  @ init item 0\n    mov r1,#0\n    str r1,[r6,r0,lsl #2]        @ init item N\n    mov r2,#1                    @ indice\n1:\n    add r3,r2,r2, lsl #1\n    sub r4,r3,#1\n    mul r4,r2,r4\n    lsr r4,r4,#1\n    subs r3,r0,r4                @ compute new indice\n    blt 90f\n    tst r2,#1                    @ indice owen\u00a0?\n    beq 2f\n    ldr r4,[r6,r3,lsl #2]\n    ldr r5,[r6,r0,lsl #2]\n    add r5,r5,r4                 @ addition\n    str r5,[r6,r0,lsl #2]\n    b 3f\n2:                               @ else substrac\n    ldr r4,[r6,r3,lsl #2]\n    ldr r5,[r6,r0,lsl #2]\n    sub r5,r5,r4\n    str r5,[r6,r0,lsl #2]\n3:\n    subs r3,r3,r2                @ compute new indice\n    blt 90f\n    \n    tst r2,#1                    @ owen\u00a0?\n    beq 4f\n    ldr r4,[r6,r3,lsl #2]\n    ldr r5,[r6,r0,lsl #2]\n    add r5,r5,r4\n    str r5,[r6,r0,lsl #2]\n    b 5f\n4:\n    ldr r4,[r6,r3,lsl #2]\n    ldr r5,[r6,r0,lsl #2]\n    sub r5,r5,r4\n    str r5,[r6,r0,lsl #2]\n5:\n    add r2,r2,#1\n    cmp r2,r0\n    ble 1b\n90:\n   ldr r0,[r6,r0,lsl #2]         @ return last item of table\n100:\n    pop {r1-r7,lr}\n    bx lr                        @ return \n\n/***************************************************/\n/*      ROUTINES INCLUDE                           */\n/***************************************************/\n.include \"../affichage.inc\"",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_100.txt",
        "content": "2: 1 \n3: 1 1 \n4: 1 1 1 \n5: 1 2 1 1 \n6: 1 2 2 1 1 \n7: 1 3 3 2 1 1 \n8: 1 3 4 3 2 1 1 \n9: 1 4 5 5 3 2 1 1 \n10: 1 4 7 6 5 3 2 1 1 \n11: 1 5 8 9 7 5 3 2 1 1 \n12: 1 5 10 11 10 7 5 3 2 1 1 \n13: 1 6 12 15 13 11 7 5 3 2 1 1 \n14: 1 6 14 18 18 14 11 7 5 3 2 1 1 \n15: 1 7 16 23 23 20 15 11 7 5 3 2 1 1 \n16: 1 7 19 27 30 26 21 15 11 7 5 3 2 1 1 \n17: 1 8 21 34 37 35 28 22 15 11 7 5 3 2 1 1 \n18: 1 8 24 39 47 44 38 29 22 15 11 7 5 3 2 1 1 \n19: 1 9 27 47 57 58 49 40 30 22 15 11 7 5 3 2 1 1 \n20: 1 9 30 54 70 71 65 52 41 30 22 15 11 7 5 3 2 1 1 \n21: 1 10 33 64 84 90 82 70 54 42 30 22 15 11 7 5 3 2 1 1 \n22: 1 10 37 72 101 110 105 89 73 55 42 30 22 15 11 7 5 3 2 1 1 \n23: 1 11 40 84 119 136 131 116 94 75 56 42 30 22 15 11 7 5 3 2 1 1 \n24: 1 11 44 94 141 163 164 146 123 97 76 56 42 30 22 15 11 7 5 3 2 1 1 \n25: 1 12 48 108 164 199 201 186 157 128 99 77 56 42 30 22 15 11 7 5 3 2 1 1 \n26: 1 12 52 120 192 235 248 230 201 164 131 100 77 56 42 30 22 15 11 7 5 3 2 1 1 \n27: 1 13 56 136 221 282 300 288 252 212 169 133 101 77 56 42 30 22 15 11 7 5 3 2 1 1 \n28: 1 13 61 150 255 331 364 352 318 267 219 172 134 101 77 56 42 30 22 15 11 7 5 3 2 1 1 \n29: 1 14 65 169 291 391 436 434 393 340 278 224 174 135 101 77 56 42 30 22 15 11 7 5 3 2 1 1 \n30: 1 14 70 185 333 454 522 525 488 423 355 285 227 175 135 101 77 56 42 30 22 15 11 7 5 3 2 1 1 \n31: 1 15 75 206 377 532 618 638 598 530 445 366 290 229 176 135 101 77 56 42 30 22 15 11 7 5 3 2 1 1 \n\n23: 1255\u00a0?= 1255\n123: 2552338241\u00a0?= 2552338241\n1234: 156978797223733228787865722354959930\u00a0?= 156978797223733228787865722354959930\n23: 1255\n123: 2552338241\n1234: 156978797223733228787865722354959930\n12345: 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\n123456: 30817659578536496678545317146533980855296613274507139217608776782063054452191537379312358383342446230621170608408020911309259407611257151683372221925128388387168451943800027128045369650890220060901494540459081545445020808726917371699102825508039173543836338081612528477859613355349851184591540231790254269948278726548570660145691076819912972162262902150886818986555127204165221706149989\n./intnames  897.04s user 2.43s system 94% cpu 15:47.77 total\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_101.txt",
        "content": "(define (nine-billion-names row column)\n   (cond\n      ((<= row 0) 0)\n      ((<= column 0) 0)\n      ((< row column) 0)\n      ((= row 1) 1)\n      (else\n         (let ((addend (nine-billion-names (- row 1) (- column 1)))\n               (augend (nine-billion-names (- row column) column)))\n\t         (+ addend augend)))))\n \n(define (print-row row)\n   (for-each (lambda (x)\n         (display (nine-billion-names row x))\n         (display \" \"))\n      (iota row 1)))\n \n(define (print-triangle rows)\n   (for-each (lambda (x)\n         (print-row x)\n         (print))\n      (iota rows 1)))\n \n(print-triangle 25)\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_102.txt",
        "content": "1 \n1 1 \n1 1 1 \n1 2 1 1 \n1 2 2 1 1 \n1 3 3 2 1 1 \n1 3 4 3 2 1 1 \n1 4 5 5 3 2 1 1 \n1 4 7 6 5 3 2 1 1 \n1 5 8 9 7 5 3 2 1 1 \n1 5 10 11 10 7 5 3 2 1 1 \n1 6 12 15 13 11 7 5 3 2 1 1 \n1 6 14 18 18 14 11 7 5 3 2 1 1 \n1 7 16 23 23 20 15 11 7 5 3 2 1 1 \n1 7 19 27 30 26 21 15 11 7 5 3 2 1 1 \n1 8 21 34 37 35 28 22 15 11 7 5 3 2 1 1 \n1 8 24 39 47 44 38 29 22 15 11 7 5 3 2 1 1 \n1 9 27 47 57 58 49 40 30 22 15 11 7 5 3 2 1 1 \n1 9 30 54 70 71 65 52 41 30 22 15 11 7 5 3 2 1 1 \n1 10 33 64 84 90 82 70 54 42 30 22 15 11 7 5 3 2 1 1 \n1 10 37 72 101 110 105 89 73 55 42 30 22 15 11 7 5 3 2 1 1 \n1 11 40 84 119 136 131 116 94 75 56 42 30 22 15 11 7 5 3 2 1 1 \n1 11 44 94 141 163 164 146 123 97 76 56 42 30 22 15 11 7 5 3 2 1 1 \n1 12 48 108 164 199 201 186 157 128 99 77 56 42 30 22 15 11 7 5 3 2 1 1 \n1 12 52 120 192 235 248 230 201 164 131 100 77 56 42 30 22 15 11 7 5 3 2 1 1\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_103.txt",
        "content": "row(n)=my(v=vector(n)); forpart(i=n,v[i[#i]]++); v;\nshow(n)=for(k=1,n,print(row(k)));\nshow(25)\napply(numbpart, [23,123,1234,12345])\nplot(x=1,999.9, numbpart(x\\1))",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_104.txt",
        "content": "[1]\n[1, 1]\n[1, 1, 1]\n[1, 2, 1, 1]\n[1, 2, 2, 1, 1]\n[1, 3, 3, 2, 1, 1]\n[1, 3, 4, 3, 2, 1, 1]\n[1, 4, 5, 5, 3, 2, 1, 1]\n[1, 4, 7, 6, 5, 3, 2, 1, 1]\n[1, 5, 8, 9, 7, 5, 3, 2, 1, 1]\n[1, 5, 10, 11, 10, 7, 5, 3, 2, 1, 1]\n[1, 6, 12, 15, 13, 11, 7, 5, 3, 2, 1, 1]\n[1, 6, 14, 18, 18, 14, 11, 7, 5, 3, 2, 1, 1]\n[1, 7, 16, 23, 23, 20, 15, 11, 7, 5, 3, 2, 1, 1]\n[1, 7, 19, 27, 30, 26, 21, 15, 11, 7, 5, 3, 2, 1, 1]\n[1, 8, 21, 34, 37, 35, 28, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n[1, 8, 24, 39, 47, 44, 38, 29, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n[1, 9, 27, 47, 57, 58, 49, 40, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n[1, 9, 30, 54, 70, 71, 65, 52, 41, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n[1, 10, 33, 64, 84, 90, 82, 70, 54, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n[1, 10, 37, 72, 101, 110, 105, 89, 73, 55, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n[1, 11, 40, 84, 119, 136, 131, 116, 94, 75, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2,1, 1]\n[1, 11, 44, 94, 141, 163, 164, 146, 123, 97, 76, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n[1, 12, 48, 108, 164, 199, 201, 186, 157, 128, 99, 77, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n[1, 12, 52, 120, 192, 235, 248, 230, 201, 164, 131, 100, 77, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n\n%1 = [1255, 2552338241, 156978797223733228787865722354959930, 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736]\n\n2.31e+031 |''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''\"\n          |                                                             \u00a0:\n          |                                                             \u00a0:\n          |                                                             \u00a0:\n          |                                                             \u00a0:\n          |                                                            \u00a0:|\n          |                                                            \u00a0:|\n          |                                                            \u00a0:|\n          |                                                            \u00a0:|\n          |                                                             _|\n          |                                                            \u00a0:|\n          |                                                            \u00a0:|\n          |                                                           \u00a0: |\n          |                                                           \u00a0: |\n          |                                                           \u00a0: |\n          |                                                            x |\n          |                                                           \u00a0: |\n          |                                                          \u00a0:  |\n          |                                                           x  |\n          |                                                              |\n          |                                                         _\"   |\n        1 ________________________________________________________xx,,,,,,\n          1                                                          999.9",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_105.txt",
        "content": "use ntheory qw/:all/;\n\nsub triangle_row {\n  my($n,@row) = (shift);\n  # Tally by first element of the unrestricted integer partitions.\n  forpart { $row[ $_[0] - 1 ]++ } $n;\n  @row;\n}\n\nprintf \"%2d: %s\\n\", $_, join(\" \",triangle_row($_)) for 1..25;\nprint \"\\n\";\nsay \"P($_) = \", partitions($_) for (23, 123, 1234, 12345);\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_106.txt",
        "content": "P(23) = 1255\nP(123) = 2552338241\nP(1234) = 156978797223733228787865722354959930\nP(12345) = 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_107.txt",
        "content": "use strict;\nuse warnings;\n\n# Where Raku uses arbitrary precision integers everywhere\n# that you don't tell it not to do so, Perl 5 will only use\n# them where you *do* tell it do so.\nuse Math::BigInt;\nuse constant zero => Math::BigInt->bzero;\nuse constant one  => Math::BigInt->bone;\n\nmy @todo = [one];\nmy @sums = (zero);\nsub nextrow {\n   my $n = shift;\n   for my $l (@todo .. $n) {\n      $sums[$l] = zero;\n      #print \"$l\\r\" if $l < $n;\n      my @r;\n      for my $x (reverse 0 .. $l-1) {\n         my $todo = $todo[$x];\n         $sums[$x] += shift @$todo if @$todo;\n         push @r, $sums[$x];\n      }\n      push @todo, \\@r;\n   }\n   @{ $todo[$n] };\n}\n\nprint \"rows:\\n\";\nfor(1..25) {\n   printf(\"%2d: \", $_);\n   print join(' ', nextrow($_)), \"\\n\";\n}\nprint \"\\nsums:\\n\";\nfor (23, 123, 1234, 12345) {\n   print $_, \".\" x (8 - length);\n   my $i = 0;\n   $i += $_ for nextrow($_);\n   print $i, \"\\n\";\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_108.txt",
        "content": "rows:\n 1: 1\n 2: 1 1\n 3: 1 1 1\n 4: 1 2 1 1\n 5: 1 2 2 1 1\n 6: 1 3 3 2 1 1\n 7: 1 3 4 3 2 1 1\n 8: 1 4 5 5 3 2 1 1\n 9: 1 4 7 6 5 3 2 1 1\n10: 1 5 8 9 7 5 3 2 1 1\n11: 1 5 10 11 10 7 5 3 2 1 1\n12: 1 6 12 15 13 11 7 5 3 2 1 1\n13: 1 6 14 18 18 14 11 7 5 3 2 1 1\n14: 1 7 16 23 23 20 15 11 7 5 3 2 1 1\n15: 1 7 19 27 30 26 21 15 11 7 5 3 2 1 1\n16: 1 8 21 34 37 35 28 22 15 11 7 5 3 2 1 1\n17: 1 8 24 39 47 44 38 29 22 15 11 7 5 3 2 1 1\n18: 1 9 27 47 57 58 49 40 30 22 15 11 7 5 3 2 1 1\n19: 1 9 30 54 70 71 65 52 41 30 22 15 11 7 5 3 2 1 1\n20: 1 10 33 64 84 90 82 70 54 42 30 22 15 11 7 5 3 2 1 1\n21: 1 10 37 72 101 110 105 89 73 55 42 30 22 15 11 7 5 3 2 1 1\n22: 1 11 40 84 119 136 131 116 94 75 56 42 30 22 15 11 7 5 3 2 1 1\n23: 1 11 44 94 141 163 164 146 123 97 76 56 42 30 22 15 11 7 5 3 2 1 1\n24: 1 12 48 108 164 199 201 186 157 128 99 77 56 42 30 22 15 11 7 5 3 2 1 1\n25: 1 12 52 120 192 235 248 230 201 164 131 100 77 56 42 30 22 15 11 7 5 3 2 1 1\n\nsums:\n23......1243\n123.....2552338241\n1234....156978797223733228787865722354959930\n^C\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_109.txt",
        "content": "-- demo\\rosetta\\9billionnames.exw\nwith javascript_semantics \nsequence cache = {{1}}\nfunction cumu(integer n)\nsequence r\n    for l=length(cache) to n do\n        r = {0}\n        for x=1 to l do\n            r = append(r,r[-1]+cache[l-x+1][min(x,l-x)+1])\n        end for\n        cache = append(cache,r)\n    end for\n    return cache[n]\nend function\n \nfunction row(integer n)\nsequence r = cumu(n+1)\nsequence res = repeat(0,n)\n    for i=1 to n do\n        res[i] = r[i+1]-r[i]\n    end for\n    return res\nend function\n \nfor i=1 to 25 do\n    puts(1,repeat(' ',50-2*i))\n    sequence r = row(i)\n    for j=1 to i do\n        printf(1,\"%4d\",r[j])\n    end for\n    puts(1,\"\\n\")\nend for\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_11.txt",
        "content": "Total \u00a0: 7\nTotal \u00a0: 1255\nTotal \u00a0: 2552338241\nNumber too large\u00a0!!.\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_110.txt",
        "content": "                                                   1\n                                                 1   1\n                                               1   1   1\n                                             1   2   1   1\n                                           1   2   2   1   1\n                                         1   3   3   2   1   1\n                                       1   3   4   3   2   1   1\n                                     1   4   5   5   3   2   1   1\n                                   1   4   7   6   5   3   2   1   1\n                                 1   5   8   9   7   5   3   2   1   1\n                               1   5  10  11  10   7   5   3   2   1   1\n                             1   6  12  15  13  11   7   5   3   2   1   1\n                           1   6  14  18  18  14  11   7   5   3   2   1   1\n                         1   7  16  23  23  20  15  11   7   5   3   2   1   1\n                       1   7  19  27  30  26  21  15  11   7   5   3   2   1   1\n                     1   8  21  34  37  35  28  22  15  11   7   5   3   2   1   1\n                   1   8  24  39  47  44  38  29  22  15  11   7   5   3   2   1   1\n                 1   9  27  47  57  58  49  40  30  22  15  11   7   5   3   2   1   1\n               1   9  30  54  70  71  65  52  41  30  22  15  11   7   5   3   2   1   1\n             1  10  33  64  84  90  82  70  54  42  30  22  15  11   7   5   3   2   1   1\n           1  10  37  72 101 110 105  89  73  55  42  30  22  15  11   7   5   3   2   1   1\n         1  11  40  84 119 136 131 116  94  75  56  42  30  22  15  11   7   5   3   2   1   1\n       1  11  44  94 141 163 164 146 123  97  76  56  42  30  22  15  11   7   5   3   2   1   1\n     1  12  48 108 164 199 201 186 157 128  99  77  56  42  30  22  15  11   7   5   3   2   1   1\n   1  12  52 120 192 235 248 230 201 164 131 100  77  56  42  30  22  15  11   7   5   3   2   1   1\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_111.txt",
        "content": "with javascript_semantics \ninclude mpfr.e\n \nsequence p\n \nprocedure calc(integer n)\n    n += 1\n    for k=1 to n-1 do\n        integer d = n - k * (3 * k - 1) / 2;\n        if d<1 then exit end if\n        if and_bits(k,1) then mpz_add(p[n],p[n],p[d])\n                         else mpz_sub(p[n],p[n],p[d]) end if\n        d -= k;\n        if d<1 then exit end if\n        if and_bits(k,1) then mpz_add(p[n],p[n],p[d])\n                         else mpz_sub(p[n],p[n],p[d]) end if\n    end for\nend procedure\n \nconstant cx = {23, 123, 1234, 12345}\nputs(1,\"sums:\\n\")\ninteger at = 1\np = mpz_inits(cx[$]+1)\nmpz_set_si(p[1],1)\nfor i=1 to cx[$] do\n    calc(i)\n    if i=cx[at] then\n        printf(1,\"%2d:%s\\n\",{i,mpz_get_str(p[i+1])})\n        at += 1\n    end if\nend for\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_112.txt",
        "content": "sums:\n23:1255\n123:2552338241\n1234:156978797223733228787865722354959930\n12345:69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_113.txt",
        "content": "include pGUI.e\nIupOpen()\nIupControlsOpen()\nIhandle plot = IupPlot(\"MENUITEMPROPERTIES=Yes, SIZE=640x320\")\nIupSetAttribute(plot, \"TITLE\", \"9 Billion Names\");\nIupSetAttribute(plot, \"TITLEFONTSIZE\", \"10\");\nIupSetAttribute(plot, \"TITLEFONTSTYLE\", \"ITALIC\");\nIupSetAttribute(plot, \"GRIDLINESTYLE\", \"DOTTED\");\nIupSetAttribute(plot, \"GRID\", \"YES\");\nIupSetAttribute(plot, \"AXS_XLABEL\", \"x\");\nIupSetAttribute(plot, \"AXS_YLABEL\", \"G(x)\");\nIupSetAttribute(plot, \"AXS_XFONTSTYLE\", \"ITALIC\");\nIupSetAttribute(plot, \"AXS_YFONTSTYLE\", \"ITALIC\");\nIupSetAttribute(plot, \"AXS_XSCALE\", \"LOG10\");\nIupSetAttribute(plot, \"AXS_YSCALE\", \"LOG10\");\nIupSetAttribute(plot, \"AXS_YTICKSIZEAUTO\", \"NO\");\nIupSetAttribute(plot, \"AXS_YTICKMAJORSIZE\", \"8\");\nIupSetAttribute(plot, \"AXS_YTICKMINORSIZE\", \"0\");\nIupPlotBegin(plot)\nfor x=1 to 999 do\n    IupPlotAdd(plot, x, sum(row(x))) -- (row() from part 1)\nend for\n{} = IupPlotEnd(plot)\nIhandle dlg = IupDialog(plot)\nIupSetAttribute(dlg, \"TITLE\", \"9 Billion Names\")\nIupMap(dlg)\nIupShowXY(dlg,IUP_CENTER,IUP_CENTER)\nif platform()!=JS then\n    IupMainLoop()\n    IupClose()\nend if\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_114.txt",
        "content": "/# Rosetta Code problem: http://rosettacode.org/wiki/9_billion_names_of_God_the_integer\nby Galileo, 05/2022 #/\n\ninclude ..\\Utilitys.pmt\n\ncls\n \ndef nine_billion_names >ps\n    0 ( tps dup ) dim\n \n    1 ( 1 1 ) sset\n    \n    ( 2 tps ) for var i\n        ( 1 i ) for var j\n            ( i 1 - j 1 - ) sget >ps ( i j - j ) sget ps> + ( i j ) sset\n        endfor\n    endfor\n \n    ( 1 tps ) for var i\n        tps 2 * i 2 * 2 - - >ps\n        ( 1 i ) for var j\n            ( i j ) sget tostr len nip 1 swap - tps j 4 * + + i locate ( i j ) sget print\n        endfor\n        nl\n        ps> drop\n    endfor\n    ps> drop drop\nenddef\n \n20 nine_billion_names",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_115.txt",
        "content": "                                           1\n                                         1   1\n                                       1   1   1\n                                     1   2   1   1\n                                   1   2   2   1   1\n                                 1   3   3   2   1   1\n                               1   3   4   3   2   1   1\n                             1   4   5   5   3   2   1   1\n                           1   4   7   6   5   3   2   1   1\n                         1   5   8   9   7   5   3   2   1   1\n                       1   5  10  11  10   7   5   3   2   1   1\n                     1   6  12  15  13  11   7   5   3   2   1   1\n                   1   6  14  18  18  14  11   7   5   3   2   1   1\n                 1   7  16  23  23  20  15  11   7   5   3   2   1   1\n               1   7  19  27  30  26  21  15  11   7   5   3   2   1   1\n             1   8  21  34  37  35  28  22  15  11   7   5   3   2   1   1\n           1   8  24  39  47  44  38  29  22  15  11   7   5   3   2   1   1\n         1   9  27  47  57  58  49  40  30  22  15  11   7   5   3   2   1   1\n       1   9  30  54  70  71  65  52  41  30  22  15  11   7   5   3   2   1   1\n     1  10  33  64  84  90  82  70  54  42  30  22  15  11   7   5   3   2   1   1\n\n=== Press any key to exit ===",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_116.txt",
        "content": "import cp.\n\nmain =>\n  foreach(N in 1..25)\n     P = integer_partition(N).reverse,\n     G = P.map(sort_down).map(first).counts.to_list.sort.map(second),\n     println(G=G.sum)\n  end,\n  println(\"Num partitions == sum of rows:\"),\n  println([partition1(N)\u00a0: N in 1..25]).\n\n% Get all partitions\ninteger_partition(N) = find_all(X,integer_partition(N,X)).\ninteger_partition(N,X) =>\n  member(Len,1..N),\n  X = new_list(Len),\n  X\u00a0:: 1..N,\n  increasing(X),\n  sum(X) #= N,\n  solve($[split],X).\n\n% Counts the occurrences of the elements in L\ncounts(L) = Map =>\n  Map = new_map(),\n  foreach(I in L)\n    Map.put(I,Map.get(I,0)+1)\n  end.",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_117.txt",
        "content": "[1] = 1\n[1,1] = 2\n[1,1,1] = 3\n[1,2,1,1] = 5\n[1,2,2,1,1] = 7\n[1,3,3,2,1,1] = 11\n[1,3,4,3,2,1,1] = 15\n[1,4,5,5,3,2,1,1] = 22\n[1,4,7,6,5,3,2,1,1] = 30\n[1,5,8,9,7,5,3,2,1,1] = 42\n[1,5,10,11,10,7,5,3,2,1,1] = 56\n[1,6,12,15,13,11,7,5,3,2,1,1] = 77\n[1,6,14,18,18,14,11,7,5,3,2,1,1] = 101\n[1,7,16,23,23,20,15,11,7,5,3,2,1,1] = 135\n[1,7,19,27,30,26,21,15,11,7,5,3,2,1,1] = 176\n[1,8,21,34,37,35,28,22,15,11,7,5,3,2,1,1] = 231\n[1,8,24,39,47,44,38,29,22,15,11,7,5,3,2,1,1] = 297\n[1,9,27,47,57,58,49,40,30,22,15,11,7,5,3,2,1,1] = 385\n[1,9,30,54,70,71,65,52,41,30,22,15,11,7,5,3,2,1,1] = 490\n[1,10,33,64,84,90,82,70,54,42,30,22,15,11,7,5,3,2,1,1] = 627\n[1,10,37,72,101,110,105,89,73,55,42,30,22,15,11,7,5,3,2,1,1] = 792\n[1,11,40,84,119,136,131,116,94,75,56,42,30,22,15,11,7,5,3,2,1,1] = 1002\n[1,11,44,94,141,163,164,146,123,97,76,56,42,30,22,15,11,7,5,3,2,1,1] = 1255\n[1,12,48,108,164,199,201,186,157,128,99,77,56,42,30,22,15,11,7,5,3,2,1,1] = 1575\n[1,12,52,120,192,235,248,230,201,164,131,100,77,56,42,30,22,15,11,7,5,3,2,1,1] = 1958\nNum partitions == sum of rows:\n[1,2,3,5,7,11,15,22,30,42,56,77,101,135,176,231,297,385,490,627,792,1002,1255,1575,1958]",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_118.txt",
        "content": "% Number of partitions\ngo2 => \n  foreach(N in [23,123,1234,12345,123456])\n    println(N=partition1(N))\n  end,  \n  nl.\n\ntable\npartition1(0) = 1.\npartition1(N) = P =>\n  S = 0,\n  K = 1,\n  M = (K*(3*K-1)) // 2,  \n  while (M <= N)\n     S\u00a0:= S - ((-1)**K)*partition1(N-M),\n     K\u00a0:= K + 1, \n     M\u00a0:= (K*(3*K-1)) // 2 \n  end,\n  K\u00a0:= 1,\n  M\u00a0:= (K*(3*K+1)) // 2,\n  while (M <= N)\n     S\u00a0:= S - ((-1)**K)*partition1(N-M),\n     K\u00a0:= K + 1,\n     M\u00a0:= (K*(3*K+1)) // 2  \n  end,\n  P = S.",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_119.txt",
        "content": "23 = 1255\n123 = 2552338241\n1234 = 156978797223733228787865722354959930\n12345 = 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\n123456 = 30817659578536496678545317146533980855296613274507139217608776782063054452191537379312358383342446230621170608408020911309259407611257151683372221925128388387168451943800027128045369650890220060901494540459081545445020808726917371699102825508039173543836338081612528477859613355349851184591540231790254269948278726548570660145691076819912972162262902150886818986555127204165221706149989",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_12.txt",
        "content": "SetBatchLines -1\n\nInputBox, Enter_value, Enter the no. of lines sought\narray := []\nLoop, % 2*Enter_value - 1\n\tLoop, % x := A_Index\n\t\ty := A_Index, Array[x, y] := 1\n\nx := 3\n\nLoop\n{\n\tbase_r := x - 1\n\t, x++\n\t, y := 2\n\t, index := x\n\t, new := 1\n\t\n\tLoop, % base_r - 1\n\t{\n\t\tarray[x, new+1] := array[x-1, new] + array[base_r, y]\n\t\t, x++\n\t\t, new ++\n\t\t, y++\n\t}\n\tx := index\n\tIf ( mod(x,2) = 0 )\n\t{\n\t\tto_run := floor(x - x/2)\n\t\t, y2 := to_run + 1\n\t}\n\tElse\n\t{\n\t\tto_run := x - floor(x/2)\n\t\t, y2 := to_run\n\t}\n\tLoop, % to_run\n\t{\n\t\tarray[x, y2] := array[x-1, y2-1]\n\t\t, y2++\n\t\tIf ( y2 = Enter_value + 1 ) && ( x = Enter_value ) \n\t\t{\n\t\t\tLoop, % Enter_value\n\t\t\t{\n\t\t\t\tLoop, % x11 := A_Index\n\t\t\t\t{\n\t\t\t\t\ty11 := A_Index\n\t\t\t\t\t, string2 .= \" \" array[x11, y11]\n\t\t\t\t}\n\t\t\t\tstring2 .= \"`n\"\n\t\t\t}\n\t\t\tMsgBox % string2\n\t\t\tExitApp\n\t\t}\n\t}\n}\n\n~Esc::ExitApp\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_120.txt",
        "content": "pc(N) = pc(1,N).\ntable\npc(_,0) = 1.\npc(1,1) = 1.\npc(K,M) = cond(M < K, 0, pc(K, M-K) + pc(K + 1,M)).",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_121.txt",
        "content": "(de row (N)\n   (let C '((1))\n      (do N\n         (push 'C (grow C)) )\n      (mapcon\n         '((L)\n            (when (cdr L)\n               (cons (- (cadr L) (car L))) ) )\n         (car C) ) ) )\n            \n(de grow (Lst)\n   (let (L (length Lst)  S 0)\n      (cons\n         0\n         (mapcar\n            '((I X)\n               (inc 'S\n                  (get I (inc (min X (- L X)))) ) )\n            Lst\n            (range 1 L) ) ) ) )\n            \n(de sumr (N)\n   (let \n      (K 1 \n         S 1\n         O (cons 1 (need N 0))\n         D\n         (make\n            (while\n               (<\n                  (* K (dec (* 3 K)))\n                  (* 2 N) )\n               (link (list (dec (* 2 K)) S))\n               (link (list K S))\n               (inc 'K)\n               (setq S (- S)) ) ) )\n      (for (Y O (cdr Y) (cdr Y))\n         (let Z Y\n            (for L D\n               (inc\n                  (setq Z (cdr (nth Z (car L))))\n                  (* (car Y) (cadr L)) ) ) ) )\n      (last O) ) )\n\n(for I 25            \n   (println (row I)) )\n   \n(bench\n   (for I '(23 123 1234 12345)\n      (println (sumr I)) ) )\n\n(bye)",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_122.txt",
        "content": "(1)\n(1 1)\n(1 1 1)\n(1 2 1 1)\n(1 2 2 1 1)\n(1 3 3 2 1 1)\n(1 3 4 3 2 1 1)\n(1 4 5 5 3 2 1 1)\n(1 4 7 6 5 3 2 1 1)\n(1 5 8 9 7 5 3 2 1 1)\n(1 5 10 11 10 7 5 3 2 1 1)\n(1 6 12 15 13 11 7 5 3 2 1 1)\n(1 6 14 18 18 14 11 7 5 3 2 1 1)\n(1 7 16 23 23 20 15 11 7 5 3 2 1 1)\n(1 7 19 27 30 26 21 15 11 7 5 3 2 1 1)\n(1 8 21 34 37 35 28 22 15 11 7 5 3 2 1 1)\n(1 8 24 39 47 44 38 29 22 15 11 7 5 3 2 1 1)\n(1 9 27 47 57 58 49 40 30 22 15 11 7 5 3 2 1 1)\n(1 9 30 54 70 71 65 52 41 30 22 15 11 7 5 3 2 1 1)\n(1 10 33 64 84 90 82 70 54 42 30 22 15 11 7 5 3 2 1 1)\n(1 10 37 72 101 110 105 89 73 55 42 30 22 15 11 7 5 3 2 1 1)\n(1 11 40 84 119 136 131 116 94 75 56 42 30 22 15 11 7 5 3 2 1 1)\n(1 11 44 94 141 163 164 146 123 97 76 56 42 30 22 15 11 7 5 3 2 1 1)\n(1 12 48 108 164 199 201 186 157 128 99 77 56 42 30 22 15 11 7 5 3 2 1 1)\n(1 12 52 120 192 235 248 230 201 164 131 100 77 56 42 30 22 15 11 7 5 3 2 1 1)\n1255\n2552338241\n156978797223733228787865722354959930\n69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\n0.626 sec",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_123.txt",
        "content": "array cumu(int n) {\n\tarray(array(int)) cache = ({({1})});\n\n\tfor(int l = sizeof(cache); l < n + 1; l++) {\n\t\tarray(int) r = ({0});\n\t\tfor(int x = 1; x < l + 1; x++) {\n\t\t\tr = Array.push(r, r[-1] + cache[l - x][min(x, l-x)]);\n\t\t}\n\t\tcache = Array.push(cache, r);\n\t}\n\treturn cache[n];\n}\n\narray row(int n) {\n\tarray r = cumu(n);\n\tarray res = ({});\n\tfor (int i = 0; i < n; i++) {\n\t\tres = Array.push(res, r[i+1] - r[i]);\n\t}\n\treturn res;\n}\n\nint main() {\n\twrite(\"rows:\\n\");\n\tfor(int x = 1; x < 11; x++) {\n\t\twrite(\"%2d: \", x);\n\t\tfor(int i = 0; i < sizeof(row(x)); i++) {\n\t\t\twrite((string)row(x)[i] + \" \");\n\t\t}\n\t\twrite(\"\\n\");\n\t}\n\n\tarray(int) sum_n = ({23, 123, 1234, 12345});\n\twrite(\"\\nsums:\\n\");\n\tfor (int x = 0; x < sizeof(sum_n); x++) {\n\t\twrite((string)sum_n[x] + \" \" + (string)cumu(sum_n[x])[-1] + \"\\n\");\n\t}\n\treturn 0;\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_124.txt",
        "content": "rows:\n 1: 1 \n 2: 1 1 \n 3: 1 1 1 \n 4: 1 2 1 1 \n 5: 1 2 2 1 1 \n 6: 1 3 3 2 1 1 \n 7: 1 3 4 3 2 1 1 \n 8: 1 4 5 5 3 2 1 1 \n 9: 1 4 7 6 5 3 2 1 1 \n10: 1 5 8 9 7 5 3 2 1 1 \n\nsums:\n23 1255\n123 2552338241\n1234 156978797223733228787865722354959930\n^C",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_125.txt",
        "content": "Define nMax.i=25, n.i, k.i\nDim pfx.s(1)\n\nProcedure.s Sigma(sx.s, sums.s)\n  Define i.i, v1.i, v2.i, r.i\n  Define s.s, sa.s\n  sums=ReverseString(sums) : s=ReverseString(sx)\n  For i=1 To Len(s)*Bool(Len(s)>Len(sums))+Len(sums)*Bool(Len(sums)>=Len(s))\n    v1=Val(Mid(s,i,1))\n    v2=Val(Mid(sums,i,1))\n    r+v1+v2    \n    sa+Str(r%10)\n    r/10\n  Next i  \n  If r : sa+Str(r%10) : EndIf\n  ProcedureReturn ReverseString(sa)\nEndProcedure\n\nProcedure.i Adr(row.i,col.i)\n  ProcedureReturn ((row-1)*row/2+col)*Bool(row>0 And col>0)\nEndProcedure\n\nProcedure Triangle(row.i,Array pfx.s(1))\n  Define n.i,k.i\n  Define zs.s\n  nMax=row\n  ReDim pfx(Adr(nMax,nMax))\n  For n=1 To nMax\n    For k=1 To n    \n      If k>n    : pfx(Adr(n,k))=\"0\"    : Continue : EndIf\n      If n=k    : pfx(Adr(n,k))=\"1\"    : Continue : EndIf    \n      If k<=n/2\n        zs=\"\"\n        zs=Sigma(pfx(Adr(n-k,k)),zs)\n        zs=Sigma(pfx(Adr(n-1,k-1)),zs)\n        pfx(Adr(n,k))=zs\n      Else\n        pfx(Adr(n,k))=pfx(Adr(n-1,k-1))\n      EndIf\n    Next k\n  Next n\nEndProcedure\n\nProcedure.s sum(row.i, Array pfx.s(1))\n  Define s.s\n  Triangle(row, pfx())\n  For n=1 To row\n    s=Sigma(pfx(Adr(row,n)),s)\n  Next n\n  ProcedureReturn RSet(Str(row),5,Chr(32))+\"\u00a0: \"+s\nEndProcedure\n\nOpenConsole()\n\nTriangle(nMax, pfx())\nFor n=1 To nMax\n  Print(Space(((nMax*4-1)-(n*4-1))/2))\n  For k=1 To n    \n    Print(RSet(pfx(Adr(n,k)),3,Chr(32))+Space(1))\n  Next k\n  PrintN(\"\")\nNext n\nPrintN(\"\")\nPrintN(sum(23,pfx()))\nPrintN(sum(123,pfx()))\nPrintN(sum(1234,pfx()))\nPrintN(sum(12345,pfx()))\nInput()\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_126.txt",
        "content": "                                                  1\n                                                1   1\n                                              1   1   1\n                                            1   2   1   1\n                                          1   2   2   1   1\n                                        1   3   3   2   1   1\n                                      1   3   4   3   2   1   1\n                                    1   4   5   5   3   2   1   1\n                                  1   4   7   6   5   3   2   1   1\n                                1   5   8   9   7   5   3   2   1   1\n                              1   5  10  11  10   7   5   3   2   1   1\n                            1   6  12  15  13  11   7   5   3   2   1   1\n                          1   6  14  18  18  14  11   7   5   3   2   1   1\n                        1   7  16  23  23  20  15  11   7   5   3   2   1   1\n                      1   7  19  27  30  26  21  15  11   7   5   3   2   1   1\n                    1   8  21  34  37  35  28  22  15  11   7   5   3   2   1   1\n                  1   8  24  39  47  44  38  29  22  15  11   7   5   3   2   1   1\n                1   9  27  47  57  58  49  40  30  22  15  11   7   5   3   2   1   1\n              1   9  30  54  70  71  65  52  41  30  22  15  11   7   5   3   2   1   1\n            1  10  33  64  84  90  82  70  54  42  30  22  15  11   7   5   3   2   1   1\n          1  10  37  72 101 110 105  89  73  55  42  30  22  15  11   7   5   3   2   1   1\n        1  11  40  84 119 136 131 116  94  75  56  42  30  22  15  11   7   5   3   2   1   1\n      1  11  44  94 141 163 164 146 123  97  76  56  42  30  22  15  11   7   5   3   2   1   1\n    1  12  48 108 164 199 201 186 157 128  99  77  56  42  30  22  15  11   7   5   3   2   1   1\n  1  12  52 120 192 235 248 230 201 164 131 100  77  56  42  30  22  15  11   7   5   3   2   1   1\n\n   23\u00a0: 1255\n  123\u00a0: 2552338241\n 1234\u00a0: 156978797223733228787865722354959930\n12345\u00a0: 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_127.txt",
        "content": "cache = [[1]]\ndef cumu(n):\n    for l in range(len(cache), n+1):\n        r = [0]\n        for x in range(1, l+1):\n            r.append(r[-1] + cache[l-x][min(x, l-x)])\n        cache.append(r)\n    return cache[n]\n\ndef row(n):\n    r = cumu(n)\n    return [r[i+1] - r[i] for i in range(n)]\n\nprint \"rows:\"\nfor x in range(1, 11): print \"%2d:\"%x, row(x)\n\n\nprint \"\\nsums:\"\nfor x in [23, 123, 1234, 12345]: print x, cumu(x)[-1]\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_128.txt",
        "content": "rows:\n 1: [1]\n 2: [1, 1]\n 3: [1, 1, 1]\n 4: [1, 2, 1, 1]\n 5: [1, 2, 2, 1, 1]\n 6: [1, 3, 3, 2, 1, 1]\n 7: [1, 3, 4, 3, 2, 1, 1]\n 8: [1, 4, 5, 5, 3, 2, 1, 1]\n 9: [1, 4, 7, 6, 5, 3, 2, 1, 1]\n10: [1, 5, 8, 9, 7, 5, 3, 2, 1, 1]\n\nsums:\n23 1255\n123 2552338241\n1234 156978797223733228787865722354959930\n^C\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_129.txt",
        "content": "def partitions(N):\n    diffs,k,s = [],1,1\n    while k * (3*k-1) < 2*N:\n        diffs.extend([(2*k - 1, s), (k, s)])\n\tk,s = k+1,-s\n\n    out = [1] + [0]*N\n    for p in range(0, N+1):\n        x = out[p]\n\tfor (o,s) in diffs:\n           p += o\n           if p > N: break\n           out[p] += x*s\n\n    return out\n\np = partitions(12345)\nfor x in [23,123,1234,12345]: print x, p[x]\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_13.txt",
        "content": "1 \n1 1 \n1 1 1 \n1 2 1 1 \n1 2 2 1 1 \n1 3 3 2 1 1 \n1 3 4 3 2 1 1 \n1 4 5 5 3 2 1 1 \n1 4 7 6 5 3 2 1 1 \n1 5 8 9 7 5 3 2 1 1 \n1 5 10 11 10 7 5 3 2 1 1 \n1 6 12 15 13 11 7 5 3 2 1 1 \n1 6 14 18 18 14 11 7 5 3 2 1 1 \n1 7 16 23 23 20 15 11 7 5 3 2 1 1 \n1 7 19 27 30 26 21 15 11 7 5 3 2 1 1 \n1 8 21 34 37 35 28 22 15 11 7 5 3 2 1 1 \n1 8 24 39 47 44 38 29 22 15 11 7 5 3 2 1 1 \n1 9 27 47 57 58 49 40 30 22 15 11 7 5 3 2 1 1 \n1 9 30 54 70 71 65 52 41 30 22 15 11 7 5 3 2 1 1 \n1 10 33 64 84 90 82 70 54 42 30 22 15 11 7 5 3 2 1 1 \n1 10 37 72 101 110 105 89 73 55 42 30 22 15 11 7 5 3 2 1 1 \n1 11 40 84 119 136 131 116 94 75 56 42 30 22 15 11 7 5 3 2 1 1 \n1 11 44 94 141 163 164 146 123 97 76 56 42 30 22 15 11 7 5 3 2 1 1 \n1 12 48 108 164 199 201 186 157 128 99 77 56 42 30 22 15 11 7 5 3 2 1 1 \n1 12 52 120 192 235 248 230 201 164 131 100 77 56 42 30 22 15 11 7 5 3 2 1 1 \n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_130.txt",
        "content": "def partitions(n):\n    partitions.p.append(0)\n\n    for k in xrange(1, n + 1):\n        d = n - k * (3 * k - 1) // 2\n        if d < 0:\n            break\n\n        if k & 1:\n            partitions.p[n] += partitions.p[d]\n        else:\n            partitions.p[n] -= partitions.p[d]\n\n        d -= k\n        if d < 0:\n            break\n\n        if k & 1:\n            partitions.p[n] += partitions.p[d]\n        else:\n            partitions.p[n] -= partitions.p[d]\n\n    return partitions.p[-1]\n\npartitions.p = [1]\n\ndef main():\n    ns = set([23, 123, 1234, 12345])\n    max_ns = max(ns)\n\n    for i in xrange(1, max_ns + 1):\n        if i > max_ns:\n            break\n        p = partitions(i)\n        if i in ns:\n            print \"%6d: %s\" % (i, p)\n\nmain()\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_131.txt",
        "content": "    23: 1255\n   123: 2552338241\n  1234: 156978797223733228787865722354959930\n 12345: 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_132.txt",
        "content": "library(partitions)\nlibrary(stringi)\n\nget_row <- function(x) unname(table(parts(x)[1,]))\n\ncenter_string <- function(s,pad_len=80) stri_pad_both(s,(pad_len - length(s)),\" \")\n  \nfor (i in 1:25) cat(center_string(stri_c(get_row(i),collapse = \" \"),80),\"\\n\")\n\ncat(\"The sum of G(25) is:\", sum(get_row(25)),\"\\n\")\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_133.txt",
        "content": "                                       1                                        \n                                      1 1                                       \n                                     1 1 1                                      \n                                    1 2 1 1                                     \n                                   1 2 2 1 1                                    \n                                  1 3 3 2 1 1                                   \n                                 1 3 4 3 2 1 1                                  \n                                1 4 5 5 3 2 1 1                                 \n                               1 4 7 6 5 3 2 1 1                                \n                              1 5 8 9 7 5 3 2 1 1                               \n                           1 5 10 11 10 7 5 3 2 1 1                             \n                          1 6 12 15 13 11 7 5 3 2 1 1                           \n                        1 6 14 18 18 14 11 7 5 3 2 1 1                          \n                       1 7 16 23 23 20 15 11 7 5 3 2 1 1                        \n                     1 7 19 27 30 26 21 15 11 7 5 3 2 1 1                       \n                    1 8 21 34 37 35 28 22 15 11 7 5 3 2 1 1                     \n                  1 8 24 39 47 44 38 29 22 15 11 7 5 3 2 1 1                    \n                 1 9 27 47 57 58 49 40 30 22 15 11 7 5 3 2 1 1                  \n               1 9 30 54 70 71 65 52 41 30 22 15 11 7 5 3 2 1 1                 \n             1 10 33 64 84 90 82 70 54 42 30 22 15 11 7 5 3 2 1 1               \n          1 10 37 72 101 110 105 89 73 55 42 30 22 15 11 7 5 3 2 1 1            \n        1 11 40 84 119 136 131 116 94 75 56 42 30 22 15 11 7 5 3 2 1 1          \n      1 11 44 94 141 163 164 146 123 97 76 56 42 30 22 15 11 7 5 3 2 1 1        \n    1 12 48 108 164 199 201 186 157 128 99 77 56 42 30 22 15 11 7 5 3 2 1 1     \n 1 12 52 120 192 235 248 230 201 164 131 100 77 56 42 30 22 15 11 7 5 3 2 1 1 \n\nThe sum of G(25) is: 1958 \n\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_134.txt",
        "content": "#lang racket\n\n(define (cdr-empty ls) (if (empty? ls) empty (cdr ls)))\n\n(define (names-of n)\n  (define (names-of-tail ans raws-rest n)\n    (if (zero? n)\n        ans\n        (names-of-tail (cons 1 (append (map + \n                                            (take ans (length raws-rest)) \n                                            (map car raws-rest))\n                                       (drop ans (length raws-rest))))\n                       (filter (compose not empty?)\n                               (map cdr-empty (cons ans raws-rest)))\n                       (sub1 n))))\n  (names-of-tail '() '() n))\n\n(define (G n) (foldl + 0 (names-of n)))\n\n(module+ main\n  (build-list 25 (compose names-of add1))\n  (newline)\n  (map G '(23 123 1234)))\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_135.txt",
        "content": "'((1)\n  (1 1)\n  (1 1 1)\n  (1 2 1 1)\n  (1 2 2 1 1)\n  (1 3 3 2 1 1)\n  (1 3 4 3 2 1 1)\n  (1 4 5 5 3 2 1 1)\n  (1 4 7 6 5 3 2 1 1)\n  (1 5 8 9 7 5 3 2 1 1)\n  (1 5 10 11 10 7 5 3 2 1 1)\n  (1 6 12 15 13 11 7 5 3 2 1 1)\n  (1 6 14 18 18 14 11 7 5 3 2 1 1)\n  (1 7 16 23 23 20 15 11 7 5 3 2 1 1)\n  (1 7 19 27 30 26 21 15 11 7 5 3 2 1 1)\n  (1 8 21 34 37 35 28 22 15 11 7 5 3 2 1 1)\n  (1 8 24 39 47 44 38 29 22 15 11 7 5 3 2 1 1)\n  (1 9 27 47 57 58 49 40 30 22 15 11 7 5 3 2 1 1)\n  (1 9 30 54 70 71 65 52 41 30 22 15 11 7 5 3 2 1 1)\n  (1 10 33 64 84 90 82 70 54 42 30 22 15 11 7 5 3 2 1 1)\n  (1 10 37 72 101 110 105 89 73 55 42 30 22 15 11 7 5 3 2 1 1)\n  (1 11 40 84 119 136 131 116 94 75 56 42 30 22 15 11 7 5 3 2 1 1)\n  (1 11 44 94 141 163 164 146 123 97 76 56 42 30 22 15 11 7 5 3 2 1 1)\n  (1 12 48 108 164 199 201 186 157 128 99 77 56 42 30 22 15 11 7 5 3 2 1 1)\n  (1 12 52 120 192 235 248 230 201 164 131 100 77 56 42 30 22 15 11 7 5 3 2 1 1))\n\n'(1255 2552338241 156978797223733228787865722354959930)\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_136.txt",
        "content": "my @todo = $[1];\nmy @sums = 0;\nsub nextrow($n) {\n    for +@todo .. $n -> $l {\n        my $r = [];\n        for reverse ^$l -> $x {\n            my @x\u00a0:= @todo[$x];\n            if @x {\n                $r.push: @sums[$x] += @x.shift;\n            }\n            else {\n                $r.push: @sums[$x];\n            }\n        }\n        @todo.push($r);\n    }\n    @todo[$n];\n}\n\nsay \"rows:\";\nsay .fmt('%2d'), \": \", nextrow($_)[] for 1..25;\n\n\nmy @names-of-God = 1, { partition-sum ++$ } \u2026 *;\nmy @names-of-God-adder = lazy [\\+] flat 1, ( (1 .. *) Z (1 .. *).map: * \u00d7 2 + 1 );\nsub partition-sum ($n) {\n    sum @names-of-God[$n X- @names-of-God-adder[^(@names-of-God-adder.first: * > $n,\u00a0:k)]]\n        Z\u00d7 (flat (1, 1, -1, -1) xx *)\n}\n\nsay \"\\nsums:\";\nfor 23, 123, 1234, 12345 {\n    put $_, \"\\t\",  @names-of-God[$_];\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_137.txt",
        "content": "rows:\n 1: [1]\n 2: [1 1]\n 3: [1 1 1]\n 4: [1 2 1 1]\n 5: [1 2 2 1 1]\n 6: [1 3 3 2 1 1]\n 7: [1 3 4 3 2 1 1]\n 8: [1 4 5 5 3 2 1 1]\n 9: [1 4 7 6 5 3 2 1 1]\n10: [1 5 8 9 7 5 3 2 1 1]\n11: [1 5 10 11 10 7 5 3 2 1 1]\n12: [1 6 12 15 13 11 7 5 3 2 1 1]\n13: [1 6 14 18 18 14 11 7 5 3 2 1 1]\n14: [1 7 16 23 23 20 15 11 7 5 3 2 1 1]\n15: [1 7 19 27 30 26 21 15 11 7 5 3 2 1 1]\n16: [1 8 21 34 37 35 28 22 15 11 7 5 3 2 1 1]\n17: [1 8 24 39 47 44 38 29 22 15 11 7 5 3 2 1 1]\n18: [1 9 27 47 57 58 49 40 30 22 15 11 7 5 3 2 1 1]\n19: [1 9 30 54 70 71 65 52 41 30 22 15 11 7 5 3 2 1 1]\n20: [1 10 33 64 84 90 82 70 54 42 30 22 15 11 7 5 3 2 1 1]\n21: [1 10 37 72 101 110 105 89 73 55 42 30 22 15 11 7 5 3 2 1 1]\n22: [1 11 40 84 119 136 131 116 94 75 56 42 30 22 15 11 7 5 3 2 1 1]\n23: [1 11 44 94 141 163 164 146 123 97 76 56 42 30 22 15 11 7 5 3 2 1 1]\n24: [1 12 48 108 164 199 201 186 157 128 99 77 56 42 30 22 15 11 7 5 3 2 1 1]\n25: [1 12 52 120 192 235 248 230 201 164 131 100 77 56 42 30 22 15 11 7 5 3 2 1 1]\n\nsums:\n23\t1255\n123\t2552338241\n1234\t156978797223733228787865722354959930\n12345\t69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_138.txt",
        "content": "Red []\n\ncontext [\n    sum-part: function [nums [block!] count [integer!]][\n        out: 0.0\n        loop count [\n            out: out + nums/1 \n            if empty? nums: next nums [break]\n        ]\n        out\n    ]\n    nums: make map! [1 [1] 2 [1 1]]\n    sums: make map! [1 1 2 2]\n    set 'names function [row /show /all][\n        if row < 1 [cause-error 'user 'message \"Argument needs to be >= 1\"]\n        if show [\n            unless nums/:row [names row]\n            repeat i row [either all [probe reduce [i nums/:i sums/:i]][print nums/:i]]\n        ]\n        either sums/:row [sums/:row][\n            out: clear []\n            half: to integer! row / 2\n            if row - 1 > last: length? nums [\n                repeat i row - last - 1 [names last + i]\n            ]\n            repeat col row - 1 [\n                either col = (half + 1) [\n                    append out at nums/(row - 1) half\n                    break\n                ][\n                    append out sum-part nums/(row - col) col\n                ]\n            ]\n            also sums/:row: sum nums/:row: copy out  clear out\n        ]\n    ]\n]\n\nprint \"rows: ^/\"\nnames/show 25\nprint \"^/sums: ^/\"\nprobe names 23\nprobe names 123 \nprobe names 1234\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_139.txt",
        "content": "rows:\n\n1\n1 1\n1.0 1 1\n1.0 2.0 1 1\n1.0 2.0 2.0 1 1\n1.0 3.0 3.0 2.0 1 1\n1.0 3.0 4.0 3.0 2.0 1 1\n1.0 4.0 5.0 5.0 3.0 2.0 1 1\n1.0 4.0 7.0 6.0 5.0 3.0 2.0 1 1\n1.0 5.0 8.0 9.0 7.0 5.0 3.0 2.0 1 1\n1.0 5.0 10.0 11.0 10.0 7.0 5.0 3.0 2.0 1 1\n1.0 6.0 12.0 15.0 13.0 11.0 7.0 5.0 3.0 2.0 1 1\n1.0 6.0 14.0 18.0 18.0 14.0 11.0 7.0 5.0 3.0 2.0 1 1\n1.0 7.0 16.0 23.0 23.0 20.0 15.0 11.0 7.0 5.0 3.0 2.0 1 1\n1.0 7.0 19.0 27.0 30.0 26.0 21.0 15.0 11.0 7.0 5.0 3.0 2.0 1 1\n1.0 8.0 21.0 34.0 37.0 35.0 28.0 22.0 15.0 11.0 7.0 5.0 3.0 2.0 1 1\n1.0 8.0 24.0 39.0 47.0 44.0 38.0 29.0 22.0 15.0 11.0 7.0 5.0 3.0 2.0 1 1\n1.0 9.0 27.0 47.0 57.0 58.0 49.0 40.0 30.0 22.0 15.0 11.0 7.0 5.0 3.0 2.0 1 1\n1.0 9.0 30.0 54.0 70.0 71.0 65.0 52.0 41.0 30.0 22.0 15.0 11.0 7.0 5.0 3.0 2.0 1 1\n1.0 10.0 33.0 64.0 84.0 90.0 82.0 70.0 54.0 42.0 30.0 22.0 15.0 11.0 7.0 5.0 3.0 2.0 1 1\n1.0 10.0 37.0 72.0 101.0 110.0 105.0 89.0 73.0 55.0 42.0 30.0 22.0 15.0 11.0 7.0 5.0 3.0 2.0 1 1\n1.0 11.0 40.0 84.0 119.0 136.0 131.0 116.0 94.0 75.0 56.0 42.0 30.0 22.0 15.0 11.0 7.0 5.0 3.0 2.0 1 1\n1.0 11.0 44.0 94.0 141.0 163.0 164.0 146.0 123.0 97.0 76.0 56.0 42.0 30.0 22.0 15.0 11.0 7.0 5.0 3.0 2.0 1 1\n1.0 12.0 48.0 108.0 164.0 199.0 201.0 186.0 157.0 128.0 99.0 77.0 56.0 42.0 30.0 22.0 15.0 11.0 7.0 5.0 3.0 2.0 1 1\n1.0 12.0 52.0 120.0 192.0 235.0 248.0 230.0 201.0 164.0 131.0 100.0 77.0 56.0 42.0 30.0 22.0 15.0 11.0 7.0 5.0 3.0 2.0 1 1\n\nsums:\n\n1255.0\n2552338241.0\n1.5697879722373306e35\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_14.txt",
        "content": "#include <stdio.h>\n#include <gmp.h>\n\n#define N 100000\nmpz_t p[N + 1];\n\nvoid calc(int n)\n{\n\tmpz_init_set_ui(p[n], 0);\n\n\tfor (int k = 1; k <= n; k++) {\n\t\tint d = n - k * (3 * k - 1) / 2;\n\t\tif (d < 0) break;\n\n\t\tif (k&1)mpz_add(p[n], p[n], p[d]);\n\t\telse\tmpz_sub(p[n], p[n], p[d]);\n\n\t\td -= k;\n\t\tif (d < 0) break;\n\n\t\tif (k&1)mpz_add(p[n], p[n], p[d]);\n\t\telse\tmpz_sub(p[n], p[n], p[d]);\n\t}\n}\n\nint main(void)\n{\n\tint idx[] = { 23, 123, 1234, 12345, 20000, 30000, 40000, 50000, N, 0 };\n\tint at = 0;\n\n\tmpz_init_set_ui(p[0], 1);\n\n\tfor (int i = 1; idx[at]; i++) {\n\t\tcalc(i);\n\t\tif (i != idx[at]) continue;\n\n\t\tgmp_printf(\"%2d:\\t%Zd\\n\", i, p[i]);\n\t\tat++;\n\t}\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_140.txt",
        "content": "/*REXX program  generates and displays a  number triangle  for partitions of a number.  */\nnumeric digits 400                               /*be able to handle larger numbers.    */\nparse arg N .                                    /*obtain optional argument from the CL.*/\nif N==''  then N= 25                             /*N  specified?  Then use the default. */\n@.= 0;          @.0= 1;       aN= abs(N)         /*initialize a partition number; AN abs*/\nif N==N+0  then say  '         G('aN\"):\"   G(N)  /*just do this for well formed numbers.*/\n                say  'partitions('aN\"):\"   partitions(aN)          /*do it the easy way.*/\nexit 0                                           /*stick a fork in it,  we're all done. */\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\nG: procedure; parse arg nn;  !.= 0;    !.4.2= 2;     mx= 1;    aN= abs(nn);    build= nn>0\n                do j=1  for aN%2;      !.j.j= 1      /*gen shortcuts for unity elements.*/\n                end   /*j*/\n\n                do     t=1  for 1+build;        #.=1 /*generate triangle once or twice. */\n                  do   r=1  for aN;   #.2= r % 2     /*#.2  is a shortcut calculation.  */\n                    do c=3  to  r-2;  #.c= gen#(r,c)\n                    end   /*c*/\n                  L= length(mx);      p= 0;     __=  /*__  will be a row of the triangle*/\n                      do cc=1  for r; p= p + #.cc    /*only sum the last row of numbers.*/\n                      if \\build  then iterate        /*should we skip building triangle?*/\n                      mx= max(mx, #.cc)              /*used to build the symmetric #s.  */\n                      __= __  right(#.cc, L)         /*construct a row of the triangle. */\n                      end   /*cc*/\n                  if t==1  then iterate              /*Is this 1st time through? No show*/\n                  say  center( strip(__),  2 + (aN-1) * (length(mx) + 1) )\n                  end       /*r*/                    /* [\u2191]  center row of the triangle.*/\n                end         /*t*/\n              return p                               /*return with the generated number.*/\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\ngen#: procedure expose !.;   parse arg x,y             /*obtain the  X and Y  arguments.*/\n      if !.x.y\\==0  then  return !.x.y                 /*was number generated before\u00a0?  */\n      if y>x%2  then do;  nx= x+1-(y-x%2)*2-(x//2==0)\n                          ny= nx % 2;  !.x.y= !.nx.ny\n                          return !.x.y                 /*return the calculated number.  */\n                     end                               /* [\u2191]  right half of triangle.  */\n      $= 1                                             /* [\u2193]   left   \"   \"     \"      */\n                          do q=2  for y-1;   xy= x-y;   if q>xy  then iterate\n                          if q==2  then $= $  +  xy % 2\n                                   else if q==xy-1  then $= $ + 1\n                                                    else $= $ + gen#(xy,q)    /*recurse.*/\n                          end   /*q*/\n      !.x.y=$; return $                                /*use memoization; return with #.*/\n/*\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500*/\npartitions: procedure expose @.; parse arg n;   if @.n\\==0  then return @.n   /* \u25c4\u2500\u2500\u2500\u2500\u2500\u2510*/\n            $= 0                                         /*Already known?  Return \u25ba\u2500\u2500\u2500\u2500\u2518*/\n                     do k=1  for n                       /*process  N  partitions.      */\n                     #= n - (k*3-1) * k % 2              /*calculate a partition number.*/\n                     if #<0  then leave                  /*Is it negative?  Then leave. */\n                     if @.#==0  then x= partitions(#)    /* [\u25c4] this is a recursive call*/\n                                else x= @.#              /*the value is already known.  */\n                     #= # - k\n                     if #<0  then  y= 0                  /*Is negative?   Then use zero.*/\n                             else  if @.#==0  then y= partitions(p)    /*recursive call.*/\n                                              else y= @.#\n                     if k//2  then $= $ + x + y          /*use this method if K is odd. */\n                              else $= $ - x - y          /* \"    \"     \"    \" \"  \" even.*/\n                     end   /*k*/                         /* [\u2191]  Euler's recursive func.*/\n            @.n= $;             return $                 /*use memoization;  return num.*/\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_141.txt",
        "content": "                                                1\n                                              1   1\n                                            1   1   1\n                                          1   2   1   1\n                                        1   2   2   1   1\n                                      1   3   3   2   1   1\n                                    1   3   4   3   2   1   1\n                                  1   4   5   5   3   2   1   1\n                                1   4   7   6   5   3   2   1   1\n                              1   5   8   9   7   5   3   2   1   1\n                            1   5  10  11  10   7   5   3   2   1   1\n                          1   6  12  15  13  11   7   5   3   2   1   1\n                        1   6  14  18  18  14  11   7   5   3   2   1   1\n                      1   7  16  23  23  20  15  11   7   5   3   2   1   1\n                    1   7  19  27  30  26  21  15  11   7   5   3   2   1   1\n                  1   8  21  34  37  35  28  22  15  11   7   5   3   2   1   1\n                1   8  24  39  47  44  38  29  22  15  11   7   5   3   2   1   1\n              1   9  27  47  57  58  49  40  30  22  15  11   7   5   3   2   1   1\n            1   9  30  54  70  71  65  52  41  30  22  15  11   7   5   3   2   1   1\n          1  10  33  64  84  90  82  70  54  42  30  22  15  11   7   5   3   2   1   1\n        1  10  37  72 101 110 105  89  73  55  42  30  22  15  11   7   5   3   2   1   1\n      1  11  40  84 119 136 131 116  94  75  56  42  30  22  15  11   7   5   3   2   1   1\n    1  11  44  94 141 163 164 146 123  97  76  56  42  30  22  15  11   7   5   3   2   1   1\n  1  12  48 108 164 199 201 186 157 128  99  77  56  42  30  22  15  11   7   5   3   2   1   1\n1  12  52 120 192 235 248 230 201 164 131 100  77  56  42  30  22  15  11   7   5   3   2   1   1\n         G(25): 1958\npartitions(25): 1958\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_142.txt",
        "content": "         G(23): 1255\npartitions(23): 1255\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_143.txt",
        "content": "         G(123): 2552338241\npartitions(123): 2552338241\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_144.txt",
        "content": "         G(1234): 156978797223733228787865722354959930\npartitions(1234): 156978797223733228787865722354959930\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_145.txt",
        "content": "         G(12345): 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\npartitions(12345): 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_146.txt",
        "content": "partitions(123456): 30817659578536496678545317146533980855296613274507139217608776782063054452191537379312358383342446230621170608408020911309259407611257151683372221925128388387168451943800027128045369650890220060901494540459081545445020808726917371699102825508039173543836338081612528477859613355349851184591540231790254269948278726548570660145691076819912972162262902150886818986555127204165221706149989\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_147.txt",
        "content": "# Generate IPF triangle\n# Nigel_Galloway: May 1st., 2013.\ndef g(n,g)\n  return 1 unless 1 < g and g < n-1\n  (2..g).inject(1){|res,q| res + (q > n-g ? 0 : g(n-g,q))}\nend\n \n(1..25).each {|n|\n  puts (1..n).map {|g| \"%4s\" % g(n,g)}.join\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_148.txt",
        "content": "   1\n   1   1\n   1   1   1\n   1   2   1   1\n   1   2   2   1   1\n   1   3   3   2   1   1\n   1   3   4   3   2   1   1\n   1   4   5   5   3   2   1   1\n   1   4   7   6   5   3   2   1   1\n   1   5   8   9   7   5   3   2   1   1\n   1   5  10  11  10   7   5   3   2   1   1\n   1   6  12  15  13  11   7   5   3   2   1   1\n   1   6  14  18  18  14  11   7   5   3   2   1   1\n   1   7  16  23  23  20  15  11   7   5   3   2   1   1\n   1   7  19  27  30  26  21  15  11   7   5   3   2   1   1\n   1   8  21  34  37  35  28  22  15  11   7   5   3   2   1   1\n   1   8  24  39  47  44  38  29  22  15  11   7   5   3   2   1   1\n   1   9  27  47  57  58  49  40  30  22  15  11   7   5   3   2   1   1\n   1   9  30  54  70  71  65  52  41  30  22  15  11   7   5   3   2   1   1\n   1  10  33  64  84  90  82  70  54  42  30  22  15  11   7   5   3   2   1   1\n   1  10  37  72 101 110 105  89  73  55  42  30  22  15  11   7   5   3   2   1   1\n   1  11  40  84 119 136 131 116  94  75  56  42  30  22  15  11   7   5   3   2   1   1\n   1  11  44  94 141 163 164 146 123  97  76  56  42  30  22  15  11   7   5   3   2   1   1\n   1  12  48 108 164 199 201 186 157 128  99  77  56  42  30  22  15  11   7   5   3   2   1   1\n   1  12  52 120 192 235 248 230 201 164 131 100  77  56  42  30  22  15  11   7   5   3   2   1   1\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_149.txt",
        "content": "# Find large values of IPF\n# Nigel_Galloway: May 1st., 2013.\nN = 12345\n@ng = []\n@ipn1 = []\n@ipn2 = []\ndef g(n,g)\n  t = n-g-2\n  return 1 if n<4 or t<0\n  return @ng[g-2][n-4] unless n/2<g\n  return @ipn1[t]\nend\n@ng[0] = []\n(4..N).each {|q| @ng[0][q-4] = 1 + g(q-2,2)}\n@ipn1[0] = @ng[0][0]\n@ipn2[0] = @ng[0][N-4]\n(1...(N/2-1)).each {|n|\n  @ng[n] = []\n  (n*2+4..N).each {|q| @ng[n][q-4] = g(q-1,n+1) + g(q-n-2,n+2)}\n  @ipn1[n] = @ng[n][n*2]\n  @ipn2[n] = @ng[n][N-4]\n  @ng[n-1] = nil\n}\n@ipn2.pop if N.even?\n \nputs \"G(23) = #{@ipn1[21]}\"\nputs \"G(123) = #{@ipn1[121]}\"\nputs \"G(1234) = #{@ipn1[1232]}\"\nn = 3 + @ipn1.inject(:+) + @ipn2.inject(:+)\nputs \"G(12345) = #{n}\"\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_15.txt",
        "content": "23:     1255\n123:    2552338241\n1234:   156978797223733228787865722354959930\n12345:  69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\n...\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_150.txt",
        "content": "G(23) = 1255\nG(123) = 2552338241\nG(1234) = 156978797223733228787865722354959930\nG(12345) = 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_151.txt",
        "content": "extern crate num;\n\nuse std::cmp;\nuse num::bigint::BigUint;\n\nfn cumu(n: usize, cache: &mut Vec<Vec<BigUint>>) {\n    for l in cache.len()..n+1 {\n        let mut r = vec![BigUint::from(0u32)];\n        for x in 1..l+1 {\n            let prev = r[r.len() - 1].clone();\n            r.push(prev + cache[l-x][cmp::min(x, l-x)].clone());\n        }\n        cache.push(r);\n    }\n}\n\nfn row(n: usize, cache: &mut Vec<Vec<BigUint>>) -> Vec<BigUint> {\n    cumu(n, cache);\n    let r = &cache[n];\n    let mut v: Vec<BigUint> = Vec::new();\n\n    for i in 0..n {\n        v.push(&r[i+1] - &r[i]);\n    }\n    v\n}\n\nfn main() {\n    let mut cache = vec![vec![BigUint::from(1u32)]];\n\n    println!(\"rows:\");\n    for x in 1..26 {\n        let v: Vec<String> = row(x, &mut cache).iter().map(|e| e.to_string()).collect();\n        let s: String = v.join(\" \");\n        println!(\"{}: {}\", x, s);\n    }\n\n    println!(\"sums:\");\n    for x in vec![23, 123, 1234, 12345] {\n        cumu(x, &mut cache);\n        let v = &cache[x];\n        let s = v[v.len() - 1].to_string();\n        println!(\"{}: {}\", x, s);\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_152.txt",
        "content": "rows:\n1: 1\n2: 1 1\n3: 1 1 1\n4: 1 2 1 1\n5: 1 2 2 1 1\n6: 1 3 3 2 1 1\n7: 1 3 4 3 2 1 1\n8: 1 4 5 5 3 2 1 1\n9: 1 4 7 6 5 3 2 1 1\n10: 1 5 8 9 7 5 3 2 1 1\n11: 1 5 10 11 10 7 5 3 2 1 1\n12: 1 6 12 15 13 11 7 5 3 2 1 1\n13: 1 6 14 18 18 14 11 7 5 3 2 1 1\n14: 1 7 16 23 23 20 15 11 7 5 3 2 1 1\n15: 1 7 19 27 30 26 21 15 11 7 5 3 2 1 1\n16: 1 8 21 34 37 35 28 22 15 11 7 5 3 2 1 1\n17: 1 8 24 39 47 44 38 29 22 15 11 7 5 3 2 1 1\n18: 1 9 27 47 57 58 49 40 30 22 15 11 7 5 3 2 1 1\n19: 1 9 30 54 70 71 65 52 41 30 22 15 11 7 5 3 2 1 1\n20: 1 10 33 64 84 90 82 70 54 42 30 22 15 11 7 5 3 2 1 1\n21: 1 10 37 72 101 110 105 89 73 55 42 30 22 15 11 7 5 3 2 1 1\n22: 1 11 40 84 119 136 131 116 94 75 56 42 30 22 15 11 7 5 3 2 1 1\n23: 1 11 44 94 141 163 164 146 123 97 76 56 42 30 22 15 11 7 5 3 2 1 1\n24: 1 12 48 108 164 199 201 186 157 128 99 77 56 42 30 22 15 11 7 5 3 2 1 1\n25: 1 12 52 120 192 235 248 230 201 164 131 100 77 56 42 30 22 15 11 7 5 3 2 1 1\nsums:\n23: 1255\n123: 2552338241\n1234: 156978797223733228787865722354959930\n12345: 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_153.txt",
        "content": "object Main {\n\n  // This is a special class for memoization\n  case class Memo[A,B](f: A => B) extends (A => B) {\n\t  private val cache = Map.empty[A, B]\n\t  def apply(x: A) = cache getOrElseUpdate (x, f(x))\n  }\n\n  // Naive, but memoized solution\n  lazy val namesStartingMemo : Memo[Tuple2[Int, Int], BigInt] = Memo {\n    case (1, 1) => 1\n    case (a, n) => \n\t    if (a > n/2) namesStartingMemo(a - 1, n - 1)\n\t    else if (n < a) 0\n\t    else if (n == a) 1\n\t    else (1 to a).map(i => namesStartingMemo(i, n - a)).sum\n    \n  }\n  \n  def partitions(n: Int) = (1 to n).map(namesStartingMemo(_, n)).sum\n  \n  // main method\n  def main(args: Array[String]): Unit = {\n    for (i <- 1 to 25) {\n    \tfor (j <- 1 to i) { \n\t      print(namesStartingMemo(j, i));\n\t      print(' ');\n\t    }\n    \tprintln()\n    }\n    println(partitions(23))\n    println(partitions(123))\n    println(partitions(1234))\n    println(partitions(12345))\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_154.txt",
        "content": "1 \n1 1 \n1 1 1 \n1 2 1 1 \n1 2 2 1 1 \n1 3 3 2 1 1 \n1 3 4 3 2 1 1 \n1 4 5 5 3 2 1 1 \n1 4 7 6 5 3 2 1 1 \n1 5 8 9 7 5 3 2 1 1 \n1 5 10 11 10 7 5 3 2 1 1 \n1 6 12 15 13 11 7 5 3 2 1 1 \n1 6 14 18 18 14 11 7 5 3 2 1 1 \n1 7 16 23 23 20 15 11 7 5 3 2 1 1 \n1 7 19 27 30 26 21 15 11 7 5 3 2 1 1 \n1 8 21 34 37 35 28 22 15 11 7 5 3 2 1 1 \n1 8 24 39 47 44 38 29 22 15 11 7 5 3 2 1 1 \n1 9 27 47 57 58 49 40 30 22 15 11 7 5 3 2 1 1 \n1 9 30 54 70 71 65 52 41 30 22 15 11 7 5 3 2 1 1 \n1 10 33 64 84 90 82 70 54 42 30 22 15 11 7 5 3 2 1 1 \n1 10 37 72 101 110 105 89 73 55 42 30 22 15 11 7 5 3 2 1 1 \n1 11 40 84 119 136 131 116 94 75 56 42 30 22 15 11 7 5 3 2 1 1 \n1 11 44 94 141 163 164 146 123 97 76 56 42 30 22 15 11 7 5 3 2 1 1 \n1 12 48 108 164 199 201 186 157 128 99 77 56 42 30 22 15 11 7 5 3 2 1 1 \n1 12 52 120 192 235 248 230 201 164 131 100 77 56 42 30 22 15 11 7 5 3 2 1 1 \n1255\n2552338241\n156978797223733228787865722354959930\nException in thread \"main\" java.lang.StackOverflowError\n\tat scala.collection.mutable.HashTable$class.findEntry(HashTable.scala:130)\n\tat scala.collection.mutable.HashMap.findEntry(HashMap.scala:39)\n\tat scala.collection.mutable.HashMap.get(HashMap.scala:69)\n\tat scala.collection.mutable.MapLike$class.getOrElseUpdate(MapLike.scala:187)\n\tat scala.collection.mutable.AbstractMap.getOrElseUpdate(Map.scala:91)\n\tat Main$Memo.apply(Main.scala:14)\n        ...\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_155.txt",
        "content": "val cache = new Array[BigInt](15000)\ncache(0) = 1\nval cacheNaive = scala.collection.mutable.Map[Tuple2[Int, Int], BigInt]()\n\ndef p(n: Int, k: Int): BigInt = cacheNaive.getOrElseUpdate((n, k), (n, k) match {\n    case (n, 1) => 1\n    case (n, k) if n < k => 0\n    case (n, k) if n == k => 1\n    case (n, k) =>\n        if (k > n/2) p(n - 1, k - 1)\n        else p(n - 1, k - 1) + p(n - k, k)\n})\n\ndef partitions(n: Int) = (1 to n).map(p(n, _)).sum\n\ndef updateCache(n: Int, d: Int, k: Int) =\n    if ((k & 1) == 1) cache(n) = cache(n) + cache(d)\n    else cache(n) = cache(n) - cache(d)\n\ndef quickPartitions(n: Int): BigInt = {\n    cache(n) = 0\n    for (k <- 1 to n) {\n        val d = n - k * (3 * k - 1) / 2\n        if (d >= 0) {\n            updateCache(n, d, k)\n\n            val e = d - k\n            if (e >= 0) {\n                updateCache(n, e, k)\n            }\n        }\n    }\n    cache(n)\n}\n\nfor (i <- 1 to 23) {\n    for (j <- 1 to i) {\n        print(f\"${p(i, j)}%4d\")\n    }\n    println\n}\nprintln(partitions(23))\n\nfor (i <- 1 until cache.length) {\n    quickPartitions(i)\n}\nprintln(quickPartitions(123))\nprintln(quickPartitions(1234))\nprintln(quickPartitions(12345))\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_156.txt",
        "content": "   1\n   1   1\n   1   1   1\n   1   2   1   1\n   1   2   2   1   1\n   1   3   3   2   1   1\n   1   3   4   3   2   1   1\n   1   4   5   5   3   2   1   1\n   1   4   7   6   5   3   2   1   1\n   1   5   8   9   7   5   3   2   1   1\n   1   5  10  11  10   7   5   3   2   1   1\n   1   6  12  15  13  11   7   5   3   2   1   1\n   1   6  14  18  18  14  11   7   5   3   2   1   1\n   1   7  16  23  23  20  15  11   7   5   3   2   1   1\n   1   7  19  27  30  26  21  15  11   7   5   3   2   1   1\n   1   8  21  34  37  35  28  22  15  11   7   5   3   2   1   1\n   1   8  24  39  47  44  38  29  22  15  11   7   5   3   2   1   1\n   1   9  27  47  57  58  49  40  30  22  15  11   7   5   3   2   1   1\n   1   9  30  54  70  71  65  52  41  30  22  15  11   7   5   3   2   1   1\n   1  10  33  64  84  90  82  70  54  42  30  22  15  11   7   5   3   2   1   1\n   1  10  37  72 101 110 105  89  73  55  42  30  22  15  11   7   5   3   2   1   1\n   1  11  40  84 119 136 131 116  94  75  56  42  30  22  15  11   7   5   3   2   1   1\n   1  11  44  94 141 163 164 146 123  97  76  56  42  30  22  15  11   7   5   3   2   1   1\n1255\n2552338241\n156978797223733228787865722354959930\n69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_157.txt",
        "content": "(define (f m n)\n  (define (sigma g x y)\n    (define (sum i)\n      (if (< i 0) 0 (+ (f x (- y i) ) (sum (- i 1)))))\n    (sum y))\n  (cond ((eq? m n) 1)\n        ((eq? n 1) 1)\n        ((eq? n 0) 0)\n        ((< m n) (f m m))\n        ((< (/ m 2) n) (sigma f (- m n) (- m n)))\n        (else (sigma f (- m n) n))))\n(define (line m)\n  (define (connect i)\n    (if (> i m) '() (cons (f m i) (connect (+ i 1)))))\n  (connect 1))\n(define (print x)\n  (define (print-loop i)\n    (cond ((< i x) (begin (display (line i)) (display \"\\n\") (print-loop (+ i 1)) ))))\n  (print-loop 1))\n(print 25)\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_158.txt",
        "content": "(1)\n(1 1)\n(1 1 1)\n(1 2 1 1)\n(1 2 2 1 1)\n(1 3 3 2 1 1)\n(1 3 4 3 2 1 1)\n(1 4 5 5 3 2 1 1)\n(1 4 7 6 5 3 2 1 1)\n(1 5 8 9 7 5 3 2 1 1)\n(1 5 10 11 10 7 5 3 2 1 1)\n(1 6 12 15 13 11 7 5 3 2 1 1)\n(1 6 14 18 18 14 11 7 5 3 2 1 1)\n(1 7 16 23 23 20 15 11 7 5 3 2 1 1)\n(1 7 19 27 30 26 21 15 11 7 5 3 2 1 1)\n(1 8 21 34 37 35 28 22 15 11 7 5 3 2 1 1)\n(1 8 24 39 47 44 38 29 22 15 11 7 5 3 2 1 1)\n(1 9 27 47 57 58 49 40 30 22 15 11 7 5 3 2 1 1)\n(1 9 30 54 70 71 65 52 41 30 22 15 11 7 5 3 2 1 1)\n(1 10 33 64 84 90 82 70 54 42 30 22 15 11 7 5 3 2 1 1)\n(1 10 37 72 101 110 105 89 73 55 42 30 22 15 11 7 5 3 2 1 1)\n(1 11 40 84 119 136 131 116 94 75 56 42 30 22 15 11 7 5 3 2 1 1)\n(1 11 44 94 141 163 164 146 123 97 76 56 42 30 22 15 11 7 5 3 2 1 1)\n(1 12 48 108 164 199 201 186 157 128 99 77 56 42 30 22 15 11 7 5 3 2 1 1)\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_159.txt",
        "content": "var cache = [[1]]\n\nfunc cumu (n) {\n    for l (cache.len .. n) {\n        var r = [0]\n        for i (1..l) {\n            r << (r[-1] + cache[l-i][min(i, l-i)])\n        }\n        cache << r\n    }\n    cache[n]\n}\n\nfunc row (n) {\n    var r = cumu(n)\n    n.of {|i| r[i+1] - r[i] }\n}\n\nsay \"rows:\"\nfor i (1..15) {\n    \"%2s: %s\\n\".printf(i, row(i))\n}\n\nsay \"\\nsums:\"\n\nfor i in [23, 123, 1234, 12345] {\n    \"%2s\u00a0: %4s\\n\".printf(i, cumu(i)[-1])\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_16.txt",
        "content": "using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Numerics;\n\nnamespace NamesOfGod\n{\n    public class RowSummer\n    {\n        const int N = 100000;\n        public BigInteger[] p;\n\n        private void calc(int n)\n            /* Translated from C */\n        {\n            p[n] = 0;\n\n            for (int k = 1; k <= n; k++)\n            {\n                int d = n - k * (3 * k - 1) / 2;\n                if (d < 0) break;\n\n                if ((k & 1) != 0) p[n] += p[d];\n                else p[n] -= p[d];\n\n                d -= k;\n                if (d < 0) break;\n\n                if ((k & 1) != 0) p[n] += p[d];\n                else p[n] -= p[d];\n            }\n\n        }\n        public void PrintSums()\n            /* translated from C */\n        {\n            p = new BigInteger[N + 1];\n            var idx = new int[] { 23, 123, 1234, 12345, 20000, 30000, 40000, 50000, N, 0 };\n            int at = 0;\n\n            p[0] = 1;\n\n            for (int i = 1; idx[at] > 0; i++)\n            {\n                calc(i);\n                if (i != idx[at]) continue;\n                Console.WriteLine(i + \":\\t\" + p[i]);\n                at++;\n            }\n        }\n    }\n\n    public class RowPrinter\n        /* translated from Python */\n    {\n        List<List<int>> cache;\n        public RowPrinter()\n        {\n            cache = new List<List<int>> { new List<int> { 1 } };\n        }\n        public List<int> cumu(int n)\n        {\n            for (int l = cache.Count; l < n + 1; l++)\n            {\n                var r = new List<int> { 0 };\n                for (int x = 1; x < l + 1; x++)\n                    r.Add(r.Last() + cache[l - x][Math.Min(x, l - x)]);\n                cache.Add(r);\n            }\n            return cache[n];\n        }\n        public List<int> row(int n)\n        {\n            var r = cumu(n);\n            return (from i in Enumerable.Range(0, n) select r[i + 1] - r[i]).ToList();\n        }\n        public void PrintRows()\n        {\n            var rows = Enumerable.Range(1, 25).Select(x => string.Join(\" \", row(x))).ToList();\n            var widest = rows.Last().Length;\n            foreach (var r in rows)\n                Console.WriteLine(new String(' ', (widest - r.Length) / 2) + r);\n        }\n    }\n\n    class Program\n    {\n        static void Main(string[] args) \n        {\n            var rpr = new RowPrinter();\n            rpr.PrintRows();\n            var ros = new RowSummer();\n            ros.PrintSums();\n            Console.ReadLine();\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_160.txt",
        "content": "rows:\n 1: [1]\n 2: [1, 1]\n 3: [1, 1, 1]\n 4: [1, 2, 1, 1]\n 5: [1, 2, 2, 1, 1]\n 6: [1, 3, 3, 2, 1, 1]\n 7: [1, 3, 4, 3, 2, 1, 1]\n 8: [1, 4, 5, 5, 3, 2, 1, 1]\n 9: [1, 4, 7, 6, 5, 3, 2, 1, 1]\n10: [1, 5, 8, 9, 7, 5, 3, 2, 1, 1]\n11: [1, 5, 10, 11, 10, 7, 5, 3, 2, 1, 1]\n12: [1, 6, 12, 15, 13, 11, 7, 5, 3, 2, 1, 1]\n13: [1, 6, 14, 18, 18, 14, 11, 7, 5, 3, 2, 1, 1]\n14: [1, 7, 16, 23, 23, 20, 15, 11, 7, 5, 3, 2, 1, 1]\n15: [1, 7, 19, 27, 30, 26, 21, 15, 11, 7, 5, 3, 2, 1, 1]\n\nsums:\n23\u00a0: 1255\n123\u00a0: 2552338241\n1234\u00a0: 156978797223733228787865722354959930\n^C\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_161.txt",
        "content": "'print triangle\n> n, 1..25\n  k = 50-n*2\n  #.output(#.str(\"\",\"<\"+k+\"<\"),#.rs)\n  > k, 1..n\n    i = p(n,k)\n    s = #.str(i,\">3<\")\n   \u00a0? k<n, s += \" \"+#.rs\n    #.output(s)\n  <\n<\np(n,k)=\n \u00a0? k=0 | k>n, <= 0\n \u00a0? k=n, <= 1\n  <= p(n-1,k-1)+p(n-k,k)\n.\n\n'calculate partition function\n#.output()\n#.output(\"G(23) =    \",g(23))\n#.output(\"G(123) =   \",g(123))\n#.output(\"G(1234) =  \",g(1234))\n#.output(\"G(12345) = \",g(12345))\ng(n)=\n  p[1] = 1\n  > i, 2..n+1\n    j = 2\n    k,p[i] = 0\n    > j>1\n      k += 1\n      j = i-#.lower((3*k*k+k)/2)\n     \u00a0? j!<1, p[i] -= (-1)^k*p[j]\n      j = i-#.lower((3*k*k-k)/2)\n     \u00a0? j!<1, p[i] -= (-1)^k*p[j]\n    <\n  <\n  <= p[n+1]\n.",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_162.txt",
        "content": "                                                 1 \n                                               1   1 \n                                             1   1   1 \n                                           1   2   1   1 \n                                         1   2   2   1   1 \n                                       1   3   3   2   1   1 \n                                     1   3   4   3   2   1   1 \n                                   1   4   5   5   3   2   1   1 \n                                 1   4   7   6   5   3   2   1   1 \n                               1   5   8   9   7   5   3   2   1   1 \n                             1   5  10  11  10   7   5   3   2   1   1 \n                           1   6  12  15  13  11   7   5   3   2   1   1 \n                         1   6  14  18  18  14  11   7   5   3   2   1   1 \n                       1   7  16  23  23  20  15  11   7   5   3   2   1   1 \n                     1   7  19  27  30  26  21  15  11   7   5   3   2   1   1 \n                   1   8  21  34  37  35  28  22  15  11   7   5   3   2   1   1 \n                 1   8  24  39  47  44  38  29  22  15  11   7   5   3   2   1   1 \n               1   9  27  47  57  58  49  40  30  22  15  11   7   5   3   2   1   1 \n             1   9  30  54  70  71  65  52  41  30  22  15  11   7   5   3   2   1   1 \n           1  10  33  64  84  90  82  70  54  42  30  22  15  11   7   5   3   2   1   1 \n         1  10  37  72  101 110 105 89  73  55  42  30  22  15  11   7   5   3   2   1   1 \n       1  11  40  84  119 136 131 116 94  75  56  42  30  22  15  11   7   5   3   2   1   1 \n     1  11  44  94  141 163 164 146 123 97  76  56  42  30  22  15  11   7   5   3   2   1   1 \n   1  12  48  108 164 199 201 186 157 128 99  77  56  42  30  22  15  11   7   5   3   2   1   1 \n 1  12  52  120 192 235 248 230 201 164 131 100 77  56  42  30  22  15  11   7   5   3   2   1   1 \n\nG(23) =    1255\nG(123) =   2552338241\nG(1234) =  156978797223733228787865722354959930\nG(12345) = 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_163.txt",
        "content": "mata\nfunction part(n) {\n\ta = J(n,n,.)\n\tfor (i=1;i<=n;i++) a[i,1] = a[i,i] = 1\n\tfor (i=3;i<=n;i++) {\n\t\tfor (j=2;j<i;j++) a[i,j] = sum(a[i-j,1..min((j,i-j))])\n\t}\n\treturn(a)\n}\nend\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_164.txt",
        "content": ": a = part(10)\n: a\n         1    2    3    4    5    6    7    8    9   10\n     +---------------------------------------------------+\n   1 |   1    .    .    .    .    .    .    .    .    .  |\n   2 |   1    1    .    .    .    .    .    .    .    .  |\n   3 |   1    1    1    .    .    .    .    .    .    .  |\n   4 |   1    2    1    1    .    .    .    .    .    .  |\n   5 |   1    2    2    1    1    .    .    .    .    .  |\n   6 |   1    3    3    2    1    1    .    .    .    .  |\n   7 |   1    3    4    3    2    1    1    .    .    .  |\n   8 |   1    4    5    5    3    2    1    1    .    .  |\n   9 |   1    4    7    6    5    3    2    1    1    .  |\n  10 |   1    5    8    9    7    5    3    2    1    1  |\n     +---------------------------------------------------+\n\n: rowsum(a)'\n        1    2    3    4    5    6    7    8    9   10\n    +---------------------------------------------------+\n  1 |   1    2    3    5    7   11   15   22   30   42  |\n    +---------------------------------------------------+",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_165.txt",
        "content": "var cache = [[1]]\nfunc namesOfGod(n:Int) -> [Int] {\n    for l in cache.count...n {\n        var r = [0]\n        for x in 1...l {\n            r.append(r[r.count - 1] + cache[l - x][min(x, l-x)])\n        }\n        cache.append(r)\n    }\n    return cache[n]\n}\n\nfunc row(n:Int) -> [Int] {\n    let r = namesOfGod(n)\n    var returnArray = [Int]()\n    for i in 0...n - 1 {\n        returnArray.append(r[i + 1] - r[i])\n    }\n    return returnArray\n}\n\nprintln(\"rows:\")\nfor x in 1...25 {\n    println(\"\\(x): \\(row(x))\")\n}\n\nprintln(\"\\nsums: \")\n\nfor x in [23, 123, 1234, 12345] {\n    cache = [[1]]\n    var array = namesOfGod(x)\n    var numInt = array[array.count - 1]\n    println(\"\\(x): \\(numInt)\")\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_166.txt",
        "content": "rows:\n1: [1]\n2: [1, 1]\n3: [1, 1, 1]\n4: [1, 2, 1, 1]\n5: [1, 2, 2, 1, 1]\n6: [1, 3, 3, 2, 1, 1]\n7: [1, 3, 4, 3, 2, 1, 1]\n8: [1, 4, 5, 5, 3, 2, 1, 1]\n9: [1, 4, 7, 6, 5, 3, 2, 1, 1]\n10: [1, 5, 8, 9, 7, 5, 3, 2, 1, 1]\n11: [1, 5, 10, 11, 10, 7, 5, 3, 2, 1, 1]\n12: [1, 6, 12, 15, 13, 11, 7, 5, 3, 2, 1, 1]\n13: [1, 6, 14, 18, 18, 14, 11, 7, 5, 3, 2, 1, 1]\n14: [1, 7, 16, 23, 23, 20, 15, 11, 7, 5, 3, 2, 1, 1]\n15: [1, 7, 19, 27, 30, 26, 21, 15, 11, 7, 5, 3, 2, 1, 1]\n16: [1, 8, 21, 34, 37, 35, 28, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n17: [1, 8, 24, 39, 47, 44, 38, 29, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n18: [1, 9, 27, 47, 57, 58, 49, 40, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n19: [1, 9, 30, 54, 70, 71, 65, 52, 41, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n20: [1, 10, 33, 64, 84, 90, 82, 70, 54, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n21: [1, 10, 37, 72, 101, 110, 105, 89, 73, 55, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n22: [1, 11, 40, 84, 119, 136, 131, 116, 94, 75, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n23: [1, 11, 44, 94, 141, 163, 164, 146, 123, 97, 76, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n24: [1, 12, 48, 108, 164, 199, 201, 186, 157, 128, 99, 77, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n25: [1, 12, 52, 120, 192, 235, 248, 230, 201, 164, 131, 100, 77, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n\nsums: \n    23: 1255\n   123: 2552338241\n  1234: 156978797223733228787865722354959930\n 12345: 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_167.txt",
        "content": "set cache 1\nproc cumu {n} {\n    global cache\n    for {set l [llength $cache]} {$l <= $n} {incr l} {\n\tset r 0\n\tfor {set x 1; set y [expr {$l-1}]} {$y >= 0} {incr x; incr y -1} {\n\t    lappend r [expr {\n\t\t[lindex $r end] + [lindex $cache $y [expr {min($x, $y)}]]\n\t    }]\n\t}\n\tlappend cache $r\n    }\n    return [lindex $cache $n]\n}\nproc row {n} {\n    set r [cumu $n]\n    for {set i 0; set j 1} {$j < [llength $r]} {incr i; incr j} {\n\tlappend result [expr {[lindex $r $j] - [lindex $r $i]}]\n    }\n    return $result\n}\n\nputs \"rows:\"\nforeach x {1 2 3 4 5 6 7 8 9 10} {\n    puts \"${x}: \\[[join [row $x] {, }]\\]\"\n}\nputs \"\\nsums:\"\nforeach x {23 123 1234 12345} {\n    puts \"${x}: [lindex [cumu $x] end]\"\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_168.txt",
        "content": "rows:\n1: [1]\n2: [1, 1]\n3: [1, 1, 1]\n4: [1, 2, 1, 1]\n5: [1, 2, 2, 1, 1]\n6: [1, 3, 3, 2, 1, 1]\n7: [1, 3, 4, 3, 2, 1, 1]\n8: [1, 4, 5, 5, 3, 2, 1, 1]\n9: [1, 4, 7, 6, 5, 3, 2, 1, 1]\n10: [1, 5, 8, 9, 7, 5, 3, 2, 1, 1]\n\nsums:\n23: 1255\n123: 2552338241\n1234: 156978797223733228787865722354959930\n^C\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_169.txt",
        "content": "Proc _NineBillionNames(15)\nEnd\n\n_NineBillionNames\n  Param (1)\n  Local (3)\n  \n  @(1*a@ + 1) = 1\n \n  For b@ = 2 To a@\n    For c@ = 1 To b@\n      @(b@*a@ + c@) = @((b@ - 1)*a@ + (c@ - 1)) + @((b@ - c@)*a@ + c@)\n    Next\n  Next\n  \n  For b@ = 1 To a@\n    d@ = a@ * 2 - 2 * b@ - 2\n    For c@ = 1 To b@\n      Print Tab(d@ + c@ * 4 + (1 - Len(Str(@(b@*a@ + c@))))); @(b@*a@ + c@);\n    Next\n  Next\n  \n  Print\nReturn\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_17.txt",
        "content": "                                     1\n                                    1 1\n                                   1 1 1\n                                  1 2 1 1\n                                 1 2 2 1 1\n                                1 3 3 2 1 1\n                               1 3 4 3 2 1 1\n                              1 4 5 5 3 2 1 1\n                             1 4 7 6 5 3 2 1 1\n                            1 5 8 9 7 5 3 2 1 1\n                          1 5 10 11 10 7 5 3 2 1 1\n                        1 6 12 15 13 11 7 5 3 2 1 1\n                       1 6 14 18 18 14 11 7 5 3 2 1 1\n                     1 7 16 23 23 20 15 11 7 5 3 2 1 1\n                    1 7 19 27 30 26 21 15 11 7 5 3 2 1 1\n                  1 8 21 34 37 35 28 22 15 11 7 5 3 2 1 1\n                 1 8 24 39 47 44 38 29 22 15 11 7 5 3 2 1 1\n               1 9 27 47 57 58 49 40 30 22 15 11 7 5 3 2 1 1\n              1 9 30 54 70 71 65 52 41 30 22 15 11 7 5 3 2 1 1\n            1 10 33 64 84 90 82 70 54 42 30 22 15 11 7 5 3 2 1 1\n         1 10 37 72 101 110 105 89 73 55 42 30 22 15 11 7 5 3 2 1 1\n       1 11 40 84 119 136 131 116 94 75 56 42 30 22 15 11 7 5 3 2 1 1\n     1 11 44 94 141 163 164 146 123 97 76 56 42 30 22 15 11 7 5 3 2 1 1\n  1 12 48 108 164 199 201 186 157 128 99 77 56 42 30 22 15 11 7 5 3 2 1 1\n1 12 52 120 192 235 248 230 201 164 131 100 77 56 42 30 22 15 11 7 5 3 2 1 1\n23:     1255\n123:    2552338241\n1234:   156978797223733228787865722354959930\n12345:  69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\n20000:  252114813812529697916619533230470452281328949601811593436850314108034284423801564956623970731689824369192324789351994903016411826230578166735959242113097\n30000:  42963584246325385174883157483005920912690248645401139066014480612764163986215458185192990173314832179564211367228855321718015074490598095469727784182254987592569621576375743614022636192786\n40000:  22807728274470728289340571240816959704646220378351611859439499408672657828590548093703330014605000554127042566412316061732771683740688051264237478893869163586426487354600342477491620506603389595232890082673857997469797\n50000:  3626186097141667844592140891595633728165383082527785049015872755414109904256712082718122747316610565824630881772910217544261659239432670671532413858378256188987333877121891586607957389750538447474712592979263719012461858719791627302489739548263\n100000: 27493510569775696512677516320986352688173429315980054758203125984302147328114964173055050741660736621590157844774296248940493063070200461792764493033510116079342457190155718943509725312466108452006369558934464248716828789832182345009262853831404597021307130674510624419227311238999702284408609370935531629697851569569892196108480158600569421098519\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_170.txt",
        "content": "                              1\n                            1   1\n                          1   1   1\n                        1   2   1   1\n                      1   2   2   1   1\n                    1   3   3   2   1   1\n                  1   3   4   3   2   1   1\n                1   4   5   5   3   2   1   1\n              1   4   7   6   5   3   2   1   1\n            1   5   8   9   7   5   3   2   1   1\n          1   5  10  11  10   7   5   3   2   1   1\n        1   6  12  15  13  11   7   5   3   2   1   1\n      1   6  14  18  18  14  11   7   5   3   2   1   1\n    1   7  16  23  23  20  15  11   7   5   3   2   1   1\n  1   7  19  27  30  26  21  15  11   7   5   3   2   1   1\n\n0 OK, 0:30 ",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_171.txt",
        "content": "Public Sub nine_billion_names()\n    Dim p(25, 25) As Long\n    p(1, 1) = 1\n    For i = 2 To 25\n        For j = 1 To i\n            p(i, j) = p(i - 1, j - 1) + p(i - j, j)\n        Next j\n    Next i\n    For i = 1 To 25\n        Debug.Print String$(50 - 2 * i, \" \");\n        For j = 1 To i\n            Debug.Print String$(4 - Len(CStr(p(i, j))), \" \") & p(i, j);\n        Next j\n        Debug.Print\n    Next i\nEnd Sub\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_172.txt",
        "content": "                                                   1\n                                                 1   1\n                                               1   1   1\n                                             1   2   1   1\n                                           1   2   2   1   1\n                                         1   3   3   2   1   1\n                                       1   3   4   3   2   1   1\n                                     1   4   5   5   3   2   1   1\n                                   1   4   7   6   5   3   2   1   1\n                                 1   5   8   9   7   5   3   2   1   1\n                               1   5  10  11  10   7   5   3   2   1   1\n                             1   6  12  15  13  11   7   5   3   2   1   1\n                           1   6  14  18  18  14  11   7   5   3   2   1   1\n                         1   7  16  23  23  20  15  11   7   5   3   2   1   1\n                       1   7  19  27  30  26  21  15  11   7   5   3   2   1   1\n                     1   8  21  34  37  35  28  22  15  11   7   5   3   2   1   1\n                   1   8  24  39  47  44  38  29  22  15  11   7   5   3   2   1   1\n                 1   9  27  47  57  58  49  40  30  22  15  11   7   5   3   2   1   1\n               1   9  30  54  70  71  65  52  41  30  22  15  11   7   5   3   2   1   1",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_173.txt",
        "content": "import math.big\n\nfn int_min(a int, b int) int {\n    if a < b {\n        return a\n    } else {\n        return b\n    }\n}\n\nfn cumu (mut cache [][]big.Integer, n int) []big.Integer {\n    for y\u00a0:= cache.len; y <= n; y++ {\n        mut row\u00a0:= [big.zero_int]\n        for x\u00a0:= 1; x <= y; x++ {\n            cache_value\u00a0:= cache[y-x][int_min(x, y-x)]\n            row << row[row.len-1] + cache_value\n        }\n        cache << row\n    }\n    return cache[n]\n}\nfn main() {\n \n\tmut cache\u00a0:= [[big.one_int]]\n \n \n\trow\u00a0:= fn[mut cache](n int) {\n\t\te\u00a0:= cumu(mut cache, n)\n\t\tfor i\u00a0:= 0; i < n; i++ {\n\t\t\tprint(\" ${e[i+1]-e[i]} \")\n\t\t}\n\t\tprintln('')\n\t}\n \n\tprintln(\"rows:\")\n\tfor x\u00a0:= 1; x < 11; x++ {\n\t\trow(x)\n\t}\n\tprintln('')\n \n\tprintln(\"sums:\")\n\tfor num in [23, 123, 1234, 12345] {\n\t\tr\u00a0:= cumu(mut cache, num)\n\t\tprintln(\"$num ${r[r.len-1]}\")\n\t}\n}",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_174.txt",
        "content": "rows:\n 1 \n 1  1 \n 1  1  1 \n 1  2  1  1 \n 1  2  2  1  1 \n 1  3  3  2  1  1 \n 1  3  4  3  2  1  1 \n 1  4  5  5  3  2  1  1 \n 1  4  7  6  5  3  2  1  1 \n 1  5  8  9  7  5  3  2  1  1 \n\nsums:\n23 1255\n123 2552338241\n1234 156978797223733228787865722354959930\n12345 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_175.txt",
        "content": "import \"./big\" for BigInt\nimport \"./fmt\" for Fmt\n\nvar cache = [[BigInt.one]]\nvar cumu = Fn.new { |n|\n    if (cache.count <= n) {\n        (cache.count..n).each { |l|\n            var r = [BigInt.zero]\n            (1..l).each { |x|\n                var min = l - x\n                if (x < min) min = x\n                r.add(r[-1] + cache[l - x][min])\n            }\n            cache.add(r)\n        }\n    }\n    return cache[n]\n}\n\nvar row = Fn.new { |n|\n    var r = cumu.call(n)\n    return (0...n).map { |i| r[i+1] - r[i] }.toList\n}\n\nSystem.print(\"Rows:\")\n(1..25).each { |i|\n    Fmt.print(\"$2d: $s\", i, row.call(i))\n}\n\nSystem.print(\"\\nSums:\")\n[23, 123, 1234, 12345].each { |i|\n    Fmt.print(\"$5s: $s\", i, cumu.call(i)[-1])\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_176.txt",
        "content": "Rows:\n 1: 1\n 2: 1 1\n 3: 1 1 1\n 4: 1 2 1 1\n 5: 1 2 2 1 1\n 6: 1 3 3 2 1 1\n 7: 1 3 4 3 2 1 1\n 8: 1 4 5 5 3 2 1 1\n 9: 1 4 7 6 5 3 2 1 1\n10: 1 5 8 9 7 5 3 2 1 1\n11: 1 5 10 11 10 7 5 3 2 1 1\n12: 1 6 12 15 13 11 7 5 3 2 1 1\n13: 1 6 14 18 18 14 11 7 5 3 2 1 1\n14: 1 7 16 23 23 20 15 11 7 5 3 2 1 1\n15: 1 7 19 27 30 26 21 15 11 7 5 3 2 1 1\n16: 1 8 21 34 37 35 28 22 15 11 7 5 3 2 1 1\n17: 1 8 24 39 47 44 38 29 22 15 11 7 5 3 2 1 1\n18: 1 9 27 47 57 58 49 40 30 22 15 11 7 5 3 2 1 1\n19: 1 9 30 54 70 71 65 52 41 30 22 15 11 7 5 3 2 1 1\n20: 1 10 33 64 84 90 82 70 54 42 30 22 15 11 7 5 3 2 1 1\n21: 1 10 37 72 101 110 105 89 73 55 42 30 22 15 11 7 5 3 2 1 1\n22: 1 11 40 84 119 136 131 116 94 75 56 42 30 22 15 11 7 5 3 2 1 1\n23: 1 11 44 94 141 163 164 146 123 97 76 56 42 30 22 15 11 7 5 3 2 1 1\n24: 1 12 48 108 164 199 201 186 157 128 99 77 56 42 30 22 15 11 7 5 3 2 1 1\n25: 1 12 52 120 192 235 248 230 201 164 131 100 77 56 42 30 22 15 11 7 5 3 2 1 1\n\nSums:\n   23: 1255\n  123: 2552338241\n 1234: 156978797223733228787865722354959930\n12345: 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_177.txt",
        "content": "clear screen\n\nSub nine_billion_names(rows)\n    local p(rows, rows), i, j, column\n    \n    p(1, 1) = 1\n    \n    For i = 2 To rows\n        For j = 1 To i\n            p(i, j) = p(i - 1, j - 1) + p(i - j, j)\n        Next j\n    Next i\n    For i = 1 To rows\n        column = rows * 2 - 2 * i - 2\n        For j = 1 To i\n            Print at(column + j * 4 + (1 - len(str$(p(i, j)))), i), p(i, j)\n        Next j\n    Next i\nEnd Sub\n\nnine_billion_names(20)",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_178.txt",
        "content": "const std = @import(\"std\");\nconst print = std.debug.print;\nconst bigint = std.math.big.int.Managed;\nconst eql = std.mem.eql;\nconst Array = std.ArrayList;\nconst Array1 = Array(bigint);\nconst Array2 = Array(Array1);\nvar gpa = std.heap.GeneralPurposeAllocator(.{}){};\nconst allocator = gpa.allocator();\n\nfn cumu(cache: *Array2, n: usize) !*Array1 {\n    var y = cache.items.len;\n    while (cache.items.len <= n) : (y += 1) {\n        var roww = Array1.init(allocator);\n        try roww.append(try bigint.init(allocator));\n        for (1..y + 1) |x| {\n            var cache_value = try cache.items[y - x].items[@min(x, y - x)].clone();\n            try cache_value.add(&cache_value, &roww.getLast());\n            try roww.append(cache_value);\n        }\n        try cache.append(roww);\n    }\n    return &(cache.items[n]);\n}\n\nfn row(cache: *Array2, n: usize) !void {\n    const e = try cumu(cache, n);\n    var v = try bigint.init(allocator);\n    for (0..n) |i| {\n        try v.sub(&e.items[i + 1], &e.items[i]);\n        print(\" {} \", .{v});\n    }\n    v.deinit();\n    print(\"\\n\", .{});\n}\n\npub fn main() !void {\n    var cache = Array2.init(allocator);\n    defer {\n        cache.deinit();\n    }\n    defer {\n        while (cache.popOrNull()) |l| {\n            l.deinit();\n        }\n    }\n    var cache0 = Array1.init(allocator);\n    var v = try bigint.init(allocator);\n    try v.set(1);\n    try cache0.append(v);\n    try cache.append(cache0);\n\n    print(\"rows:\\n\", .{});\n    for (1..1000) |x| {\n        try row(&cache, x);\n    }\n\n    print(\"\\nsums:\\n\", .{});\n    for ([_]usize{ 23, 123, 999 }) |num| {\n        const r = try cumu(&cache, num);\n        print(\"{d: >4} {d}\\n\", .{ num, r.getLast() });\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_179.txt",
        "content": "rows:\n 1 \n 1  1 \n 1  1  1 \n 1  2  1  1 \n 1  2  2  1  1 \n 1  3  3  2  1  1 \n 1  3  4  3  2  1  1 \n 1  4  5  5  3  2  1  1 \n 1  4  7  6  5  3  2  1  1 \n 1  5  8  9  7  5  3  2  1  1 \n 1  5  10  11  10  7  5  3  2  1  1 \n 1  6  12  15  13  11  7  5  3  2  1  1 \n 1  6  14  18  18  14  11  7  5  3  2  1  1 \n 1  7  16  23  23  20  15  11  7  5  3  2  1  1 \n 1  7  19  27  30  26  21  15  11  7  5  3  2  1  1 \n 1  8  21  34  37  35  28  22  15  11  7  5  3  2  1  1 \n 1  8  24  39  47  44  38  29  22  15  11  7  5  3  2  1  1 \n 1  9  27  47  57  58  49  40  30  22  15  11  7  5  3  2  1  1 \n 1  9  30  54  70  71  65  52  41  30  22  15  11  7  5  3  2  1  1 \n 1  10  33  64  84  90  82  70  54  42  30  22  15  11  7  5  3  2  1  1 \n 1  10  37  72  101  110  105  89  73  55  42  30  22  15  11  7  5  3  2  1  1 \n 1  11  40  84  119  136  131  116  94  75  56  42  30  22  15  11  7  5  3  2  1  1 \n 1  11  44  94  141  163  164  146  123  97  76  56  42  30  22  15  11  7  5  3  2  1  1 \n 1  12  48  108  164  199  201  186  157  128  99  77  56  42  30  22  15  11  7  5  3  2  1  1 \n 1  12  52  120  192  235  248  230  201  164  131  100  77  56  42  30  22  15  11  7  5  3  2  1  1 \n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_18.txt",
        "content": "// Calculate hypotenuse n of OTT assuming only nothingness, unity, and hyp[n-1] if n>1\n// Nigel Galloway, May 6th., 2013\n#include <gmpxx.h>\nint N{123456};\nmpz_class hyp[N-3];\nconst mpz_class G(const int n,const int g){return g>n?0:(g==1 or n-g<2)?1:hyp[n-g-2];};\nvoid G_hyp(const int n){for(int i=0;i<N-2*n-1;i++) n==1?hyp[n-1+i]=1+G(i+n+1,n+1):hyp[n-1+i]+=G(i+n+1,n+1);}\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_180.txt",
        "content": "const std = @import(\"std\");\nconst print = std.debug.print;\nconst bigint = std.math.big.int.Managed;\nconst eql = std.mem.eql;\nconst Array = std.ArrayList;\nconst Array1 = Array(bigint);\nvar gpa = std.heap.GeneralPurposeAllocator(.{}){};\nconst allocator = gpa.allocator();\n\nfn calc ( n:usize, p:*Array1) !void {\n    for ( 1..n+1 ) |k| {\n        var d:i64 = @intCast(n);\n        d -= @intCast(k*(3*k - 1)/2);\n        inline for ( 0..2 ) |_| {\n            if ( d < 0 ) return;\n\t    if (k&1>0) try p.items[n].add ( &p.items[n], &p.items[@intCast(d)] )\n\t    else       try p.items[n].sub ( &p.items[n], &p.items[@intCast(d)] );\n            d -= @intCast(k);\n        }\n    }\n}\n\nfn main() !void {\n    const s = [_]usize{ 23, 123, 1234, 12345, 123456 };\n    var p = Array1.init ( allocator );\n    try p.append ( try bigint.initSet ( allocator, 1 ) );\n    var i:usize=1;\n    for ( s )|m|{\n        while (i<=m):(i+=1){\n            try p.append( try bigint.init(allocator) );\n            try calc( i, &p );\n        }\n        print(\"P({d}) = {d}\\n\", .{m,p.items[m]} );\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_181.txt",
        "content": "P(23) = 1255\nP(123) = 2552338241\nP(1234) = 156978797223733228787865722354959930\nP(12345) = 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\nP(123456) = 30817659578536496678545317146533980855296613274507139217608776782063054452191537379312358383342446230621170608408020911309259407611257151683372221925128388387168451943800027128045369650890220060901494540459081545445020808726917371699102825508039173543836338081612528477859613355349851184591540231790254269948278726548570660145691076819912972162262902150886818986555127204165221706149989\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_182.txt",
        "content": "var [const] BN=Import.lib(\"zklBigNum\");\n \nconst N=0d100_000;\np:=List.createLong(N+1,BN.fp(0),True);  // (0,0,...) all different\n\nfcn calc(n,p){\n   p[n].set(0);  // reset array for each run\n   foreach k in ([1..n]){\n      d:=n - k *(3*k - 1)/2;\n      do(2){\n         if (d<0) break(2);\n\t if (k.isOdd) p[n].add(p[d]);\n\t else         p[n].sub(p[d]);\n\t d-=k;\n      }\n   }\n}",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_183.txt",
        "content": "idx:=T(23, 123, 1234, 12345, 20000, 30000, 40000, 50000, N);\np[0].set(1);\n\nforeach i in (idx){\n   (1).pump(i,Void,calc.fp1(p));\t// for n in [1..i] do calc(n,p)\n   \"%2d:\\t%d\".fmt(i,p[i]).println();\n}",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_184.txt",
        "content": "23:\t1255\n123:\t2552338241\n1234:\t156978797223733228787865722354959930\n12345:\t69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\n...\n100000:\t27493510569775696512677516320986352688173429315980054758203125984302147328114964173055050741660736621590157844774296248940493063070200461792764493033510116079342457190155718943509725312466108452006369558934464248716828789832182345009262853831404597021307130674510624419227311238999702284408609370935531629697851569569892196108480158600569421098519\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_19.txt",
        "content": "#include <iostream>\n#include <iomanip>\nint main(){\n  N=25;\n  for (int n=1; n<N/2; n++){\n    G_hyp(n);\n    for (int g=0; g<N-3; g++) std::cout << std::setw(4) << hyp[g];\n    std::cout << std::endl;\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_2.txt",
        "content": "V cache = [[BigInt(1)]]\nF cumu(n)\n   L(l) :cache.len .. n\n      V r = [BigInt(0)]\n      L(x) 1 .. l\n         r.append(r.last + :cache[l - x][min(x, l - x)])\n      :cache.append(r)\n   R :cache[n]\n\nF row(n)\n   V r = cumu(n)\n   R (0 .< n).map(i -> @r[i + 1] - @r[i])\n\nprint(\u2018rows:\u2019)\nL(x) 1..10\n   print(\u2018#2:\u2019.format(x)\u2018 \u2019row(x))\n\nprint(\"\\nsums:\")\n\nV pp = [BigInt(1)]\n\nF partitions(n)\n   :pp.append(BigInt(0))\n\n   L(k) 1 .. n\n      V d = n - k * (3 * k - 1) I/ 2\n      I d < 0\n         L.break\n\n      I k [&] 1\u00a0!= 0\n         :pp[n] += :pp[d]\n      E\n         :pp[n] -= :pp[d]\n\n      d -= k\n      I d < 0\n         L.break\n\n      I k [&] 1\u00a0!= 0\n         :pp[n] += :pp[d]\n      E\n         :pp[n] -= :pp[d]\n\n   R :pp.last\n\nV ns = Set([23, 123, 1234, 12345])\nV max_ns = max(ns)\n\nL(i) 1 .. max_ns\n   I i > max_ns\n      L.break\n   V p = partitions(i)\n   I i C ns\n      print(\u2018#6: #.\u2019.format(i, p))",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_20.txt",
        "content": "   2   2   3   3   4   4   5   5   6   6   7   7   8   8   9   9  10  10  11  11  12  12\n   2   3   4   5   7   8  10  12  14  16  19  21  24  27  30  33  37  40  44  48  52  12\n   2   3   5   6   9  11  15  18  23  27  34  39  47  54  64  72  84  94 108 120  52  12\n   2   3   5   7  10  13  18  23  30  37  47  57  70  84 101 119 141 164 192 120  52  12\n   2   3   5   7  11  14  20  26  35  44  58  71  90 110 136 163 199 235 192 120  52  12\n   2   3   5   7  11  15  21  28  38  49  65  82 105 131 164 201 248 235 192 120  52  12\n   2   3   5   7  11  15  22  29  40  52  70  89 116 146 186 230 248 235 192 120  52  12\n   2   3   5   7  11  15  22  30  41  54  73  94 123 157 201 230 248 235 192 120  52  12\n   2   3   5   7  11  15  22  30  42  55  75  97 128 164 201 230 248 235 192 120  52  12\n   2   3   5   7  11  15  22  30  42  56  76  99 131 164 201 230 248 235 192 120  52  12\n   2   3   5   7  11  15  22  30  42  56  77 100 131 164 201 230 248 235 192 120  52  12\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_21.txt",
        "content": "int main(){\n  N = 25;\n  std::cout << std::setw(N+52) << \"1\" << std::endl;\n  std::cout << std::setw(N+55) << \"1     1\" << std::endl;\n  std::cout << std::setw(N+58) << \"1     1     1\" << std::endl;\n  std::string ott[N-3];\n  for (int n=1; n<N/2; n++) {\n    G_hyp(n);\n    for (int g=(n-1)*2; g<N-3; g++) {\n      std::string t = hyp[g-(n-1)].get_str();\n      //if (t.size()==1) t.insert(t.begin(),1,' ');\n      ott[g].append(t);\n      ott[g].append(6-t.size(),' ');\n    }\n  }\n  for(int n = 0; n<N-3; n++) {\n    std::cout <<std::setw(N+43-3*n) << 1 << \"     \" << ott[n];\n    for (int g = (n+1)/2; g>0; g--) {\n      std::string t{hyp[g-1].get_str()};\n      t.append(6-t.size(),' ');\n      std::cout << t;\n    }\n    std::cout << \"1     1\" << std::endl; \n  }\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_22.txt",
        "content": "                                                                            1\n                                                                         1     1\n                                                                      1     1     1\n                                                                   1     2     1     1\n                                                                1     2     2     1     1\n                                                             1     3     3     2     1     1\n                                                          1     3     4     3     2     1     1\n                                                       1     4     5     5     3     2     1     1\n                                                    1     4     7     6     5     3     2     1     1\n                                                 1     5     8     9     7     5     3     2     1     1\n                                              1     5     10    11    10    7     5     3     2     1     1\n                                           1     6     12    15    13    11    7     5     3     2     1     1\n                                        1     6     14    18    18    14    11    7     5     3     2     1     1\n                                     1     7     16    23    23    20    15    11    7     5     3     2     1     1\n                                  1     7     19    27    30    26    21    15    11    7     5     3     2     1     1\n                               1     8     21    34    37    35    28    22    15    11    7     5     3     2     1     1\n                            1     8     24    39    47    44    38    29    22    15    11    7     5     3     2     1     1\n                         1     9     27    47    57    58    49    40    30    22    15    11    7     5     3     2     1     1\n                      1     9     30    54    70    71    65    52    41    30    22    15    11    7     5     3     2     1     1\n                   1     10    33    64    84    90    82    70    54    42    30    22    15    11    7     5     3     2     1     1\n                1     10    37    72    101   110   105   89    73    55    42    30    22    15    11    7     5     3     2     1     1\n             1     11    40    84    119   136   131   116   94    75    56    42    30    22    15    11    7     5     3     2     1     1\n          1     11    44    94    141   163   164   146   123   97    76    56    42    30    22    15    11    7     5     3     2     1     1\n       1     12    48    108   164   199   201   186   157   128   99    77    56    42    30    22    15    11    7     5     3     2     1     1\n    1     12    52    120   192   235   248   230   201   164   131   100   77    56    42    30    22    15    11    7     5     3     2     1     1\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_23.txt",
        "content": "#include <iostream>\nint main(){\n  for (int n=1; n<N/2; n++) G_hyp(n);\n  std::cout << \"G(23)     = \" << hyp[21] << std::endl;\n  std::cout << \"G(123)    = \" << hyp[121] << std::endl;\n  std::cout << \"G(1234)   = \" << hyp[1232] << std::endl;\n  std::cout << \"G(12345)  = \" << hyp[12343] << std::endl;\n  mpz_class r{3};\n  for (int i = 0; i<N-3; i++) r += hyp[i];\n  std::cout << \"G(123456) = \" << r << std::endl;\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_24.txt",
        "content": "G(23)     = 1255\nG(123)    = 2552338241\nG(1234)   = 156978797223733228787865722354959930\nG(12345)  = 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\nG(123456) = 30817659578536496678545317146533980855296613274507139217608776782063054452191537379312358383342446230621170608408020911309259407611257151683372221925128388387168451943800027128045369650890220060901494540459081545445020808726917371699102825508039173543836338081612528477859613355349851184591540231790254269948278726548570660145691076819912972162262902150886818986555127204165221706149989\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_25.txt",
        "content": "(defn nine-billion-names [row column]\n  (cond (<= row 0) 0\n        (<= column 0) 0\n        (< row column) 0\n        (= row 1) 1\n        :else (let [addend (nine-billion-names (dec row) (dec column))\n                    augend (nine-billion-names (- row column) column)]\n\t            (+ addend augend))))\n\n(defn print-row [row]\n  (doseq [x (range 1 (inc row))]\n    (print (nine-billion-names row x) \\space)) \n    (println))\n\n(defn print-triangle [rows]\n  (doseq [x (range 1 (inc rows))]\n    (print-row x)))\n\n(print-triangle 25)\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_26.txt",
        "content": "(defun 9-billion-names (row column)\n  (cond ((<= row 0) 0)\n        ((<= column 0) 0)\n\t((< row column) 0)\n\t((equal row 1) 1)\n\t(t (let ((addend (9-billion-names (1- row) (1- column)))\n\t\t (augend (9-billion-names (- row column) column)))\n\t     (+ addend augend)))))\n\t\t\t     \n(defun 9-billion-names-triangle (rows)\n  (loop for row from 1 to rows\n     collect (loop for column from 1 to row\n\t\tcollect (9-billion-names row column))))\n\n(9-billion-names-triangle 25)\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_27.txt",
        "content": "def g(n, g)\n  return 1 unless 1 < g && g < n-1\n  (2..g).reduce(1){ |res, q| res + (q > n-g ? 0 : g(n-g, q)) }\nend\n \n(1..25).each { |n| puts (1..n).map { |g| \"%4s\" % g(n, g) }.join }\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_28.txt",
        "content": "   1\n   1   1\n   1   1   1\n   1   2   1   1\n   1   2   2   1   1\n   1   3   3   2   1   1\n   1   3   4   3   2   1   1\n   1   4   5   5   3   2   1   1\n   1   4   7   6   5   3   2   1   1\n   1   5   8   9   7   5   3   2   1   1\n   1   5  10  11  10   7   5   3   2   1   1\n   1   6  12  15  13  11   7   5   3   2   1   1\n   1   6  14  18  18  14  11   7   5   3   2   1   1\n   1   7  16  23  23  20  15  11   7   5   3   2   1   1\n   1   7  19  27  30  26  21  15  11   7   5   3   2   1   1\n   1   8  21  34  37  35  28  22  15  11   7   5   3   2   1   1\n   1   8  24  39  47  44  38  29  22  15  11   7   5   3   2   1   1\n   1   9  27  47  57  58  49  40  30  22  15  11   7   5   3   2   1   1\n   1   9  30  54  70  71  65  52  41  30  22  15  11   7   5   3   2   1   1\n   1  10  33  64  84  90  82  70  54  42  30  22  15  11   7   5   3   2   1   1\n   1  10  37  72 101 110 105  89  73  55  42  30  22  15  11   7   5   3   2   1   1\n   1  11  40  84 119 136 131 116  94  75  56  42  30  22  15  11   7   5   3   2   1   1\n   1  11  44  94 141 163 164 146 123  97  76  56  42  30  22  15  11   7   5   3   2   1   1\n   1  12  48 108 164 199 201 186 157 128  99  77  56  42  30  22  15  11   7   5   3   2   1   1\n   1  12  52 120 192 235 248 230 201 164 131 100  77  56  42  30  22  15  11   7   5   3   2   1   1\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_29.txt",
        "content": "import std.stdio, std.bigint, std.algorithm, std.range;\n\nauto cumu(in uint n) {\n    __gshared cache = [[1.BigInt]];\n    foreach (l; cache.length .. n + 1) {\n        auto r = [0.BigInt];\n        foreach (x; 1 .. l + 1)\n            r ~= r.back + cache[l - x][min(x, l - x)];\n        cache ~= r;\n    }\n    return cache[n];\n}\n\nauto row(in uint n) {\n    auto r = n.cumu;\n    return n.iota.map!(i => r[i + 1] - r[i]);\n}\n\nvoid main() {\n    writeln(\"Rows:\");\n    foreach (x; 1 .. 11)\n        writefln(\"%2d: %s\", x, x.row);\n\n    writeln(\"\\nSums:\");\n    foreach (x; [23, 123, 1234])\n        writeln(x, \" \", x.cumu.back);\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_3.txt",
        "content": "rows:\n 1: [1]\n 2: [1, 1]\n 3: [1, 1, 1]\n 4: [1, 2, 1, 1]\n 5: [1, 2, 2, 1, 1]\n 6: [1, 3, 3, 2, 1, 1]\n 7: [1, 3, 4, 3, 2, 1, 1]\n 8: [1, 4, 5, 5, 3, 2, 1, 1]\n 9: [1, 4, 7, 6, 5, 3, 2, 1, 1]\n10: [1, 5, 8, 9, 7, 5, 3, 2, 1, 1]\n\nsums:\n    23: 1255\n   123: 2552338241\n  1234: 156978797223733228787865722354959930\n 12345: 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_30.txt",
        "content": "Rows:\n 1: [1]\n 2: [1, 1]\n 3: [1, 1, 1]\n 4: [1, 2, 1, 1]\n 5: [1, 2, 2, 1, 1]\n 6: [1, 3, 3, 2, 1, 1]\n 7: [1, 3, 4, 3, 2, 1, 1]\n 8: [1, 4, 5, 5, 3, 2, 1, 1]\n 9: [1, 4, 7, 6, 5, 3, 2, 1, 1]\n10: [1, 5, 8, 9, 7, 5, 3, 2, 1, 1]\n\nSums:\n23 1255\n123 2552338241\n1234 156978797223733228787865722354959930",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_31.txt",
        "content": "import std.stdio, std.bigint, std.algorithm;\n\nstruct Names {\n    BigInt[] p = [1.BigInt];\n\n    int opApply(int delegate(ref immutable int, ref BigInt) dg) {\n        int result;\n\n        foreach (immutable n; 1 .. int.max) {\n            p.assumeSafeAppend;\n            p ~= 0.BigInt;\n\n            foreach (immutable k; 1 .. n + 1) {\n                auto d = n - k * (3 * k - 1) / 2;\n                if (d < 0)\n                    break;\n\n                if (k & 1)\n                    p[n] += p[d];\n                else\n                    p[n] -= p[d];\n\n                d -= k;\n                if (d < 0)\n                    break;\n\n                if (k & 1)\n                    p[n] += p[d];\n                else\n                    p[n] -= p[d];\n            }\n\n            result = dg(n, p[n]);\n            if (result) break;\n        }\n\n        return result;\n    }\n}\n\nvoid main() {\n    immutable ns = [23:0, 123:0, 1234:0, 12345:0];\n    immutable maxNs = ns.byKey.reduce!max;\n\n    foreach (immutable i, p; Names()) {\n        if (i > maxNs)\n            break;\n        if (i in ns)\n            writefln(\"%6d: %s\", i, p);\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_32.txt",
        "content": "    23: 1255\n   123: 2552338241\n  1234: 156978797223733228787865722354959930\n 12345: 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_33.txt",
        "content": "123456: \n3081765957853649667854531714653398085529661327450713921760877\n6782063054452191537379312358383342446230621170608408020911309\n2594076112571516833722219251283883871684519438000271280453696\n5089022006090149454045908154544502080872691737169910282550803\n9173543836338081612528477859613355349851184591540231790254269\n9482787265485706601456910768199129721622629021508868189865551\n27204165221706149989",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_34.txt",
        "content": "import 'dart:math';\n\nList<BigInt> partitions(int n) {\n  var cache = List<List<BigInt>>.filled(1, List<BigInt>.filled(1, BigInt.from(1)), growable: true);\n  for(int length = cache.length; length < n + 1; length++) {\n    var row = List<BigInt>.filled(1, BigInt.from(0), growable: true);\n    for(int index = 1; index < length + 1; index++) {\n      var partAtIndex = row[row.length - 1] + cache[length - index][min(index, length - index)];\n      row.add(partAtIndex);\n    }\n    cache.add(row);\n  }\n  return cache[n];\n}\n\nList<BigInt> row(int n) {\n  var parts = partitions(n);\n  return List<BigInt>.generate(n, (int index) => parts[index + 1] - parts[index]);\n}\n\nvoid printRows({int min = 1, int max = 11}) {\n  int maxDigits = max.toString().length;\n  print('Rows:');\n  for(int i in List.generate(max - min, (int index) => index + min)) {\n    print((' ' * (maxDigits - i.toString().length)) + '$i: ${row(i)}');\n  }\n}\n\nvoid printSums(List<int> args) {\n  print('Sums:');\n  for(int i in args) {\n    print('$i: ${partitions(i)[i]}');\n  }\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_35.txt",
        "content": " import 'package:DD1_NamesOfGod/DD1_NamesOfGod.dart' as names_of_god;\n\nmain(List<String> arguments) {\n  names_of_god.printRows(min: 1, max: 11);\n  names_of_god.printSums([23, 123, 1234, 12345]);\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_36.txt",
        "content": " Rows:\n 1: [1]\n 2: [1, 1]\n 3: [1, 1, 1]\n 4: [1, 2, 1, 1]\n 5: [1, 2, 2, 1, 1]\n 6: [1, 3, 3, 2, 1, 1]\n 7: [1, 3, 4, 3, 2, 1, 1]\n 8: [1, 4, 5, 5, 3, 2, 1, 1]\n 9: [1, 4, 7, 6, 5, 3, 2, 1, 1]\n10: [1, 5, 8, 9, 7, 5, 3, 2, 1, 1]\nSums:\n23: 1255\n123: 2552338241\n1234: 156978797223733228787865722354959930\n12345: 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_37.txt",
        "content": "var cache = [[1]]\n \nfunc namesOfGod(n) {\n    for l in cache.Length()..n {\n        var r = [0]\n        if l == 1 {\n            r.Add(r[r.Length() - 1] + cache[0][0])\n        } else {\n            for x in 1..l {\n                r.Add(r[r.Length() - 1] + cache[l - x][min(x, l-x)])\n            }\n        }\n        cache.Add(r)\n    }\n    return cache[n]\n}\n \nfunc row(n) {\n    let r = namesOfGod(n)\n    var xs = []\n    for i in 0..<n {\n        xs.Add(r[i + 1] - r[i])\n    }\n    return xs\n}\n \nfor x in 1..25 {\n    print(\"\\(x): \\(row(x))\")\n}",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_38.txt",
        "content": "1: [1]\n2: [1, 1]\n3: [1, 1, 1]\n4: [1, 2, 1, 1]\n5: [1, 2, 2, 1, 1]\n6: [1, 3, 3, 2, 1, 1]\n7: [1, 3, 4, 3, 2, 1, 1]\n8: [1, 4, 5, 5, 3, 2, 1, 1]\n9: [1, 4, 7, 6, 5, 3, 2, 1, 1]\n10: [1, 5, 8, 9, 7, 5, 3, 2, 1, 1]\n11: [1, 5, 10, 11, 10, 7, 5, 3, 2, 1, 1]\n12: [1, 6, 12, 15, 13, 11, 7, 5, 3, 2, 1, 1]\n13: [1, 6, 14, 18, 18, 14, 11, 7, 5, 3, 2, 1, 1]\n14: [1, 7, 16, 23, 23, 20, 15, 11, 7, 5, 3, 2, 1, 1]\n15: [1, 7, 19, 27, 30, 26, 21, 15, 11, 7, 5, 3, 2, 1, 1]\n16: [1, 8, 21, 34, 37, 35, 28, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n17: [1, 8, 24, 39, 47, 44, 38, 29, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n18: [1, 9, 27, 47, 57, 58, 49, 40, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n19: [1, 9, 30, 54, 70, 71, 65, 52, 41, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n20: [1, 10, 33, 64, 84, 90, 82, 70, 54, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n21: [1, 10, 37, 72, 101, 110, 105, 89, 73, 55, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n22: [1, 11, 40, 84, 119, 136, 131, 116, 94, 75, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n23: [1, 11, 44, 94, 141, 163, 164, 146, 123, 97, 76, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n24: [1, 12, 48, 108, 164, 199, 201, 186, 157, 128, 99, 77, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n25: [1, 12, 52, 120, 192, 235, 248, 230, 201, 164, 131, 100, 77, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_39.txt",
        "content": "defmodule God do\n  def g(n,g) when g == 1 or n < g, do: 1\n  def g(n,g) do\n    Enum.reduce(2..g, 1, fn q,res ->\n      res + (if q > n-g, do: 0, else: g(n-g,q))\n    end)\n  end\nend\n\nEnum.each(1..25, fn n ->\n  IO.puts Enum.map(1..n, fn g -> \"#{God.g(n,g)} \" end)\nend)\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_4.txt",
        "content": "/* ARM assembly AARCH64 Raspberry PI 3B */\n/*  program integerName64.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 MAXI,   524\n\n/*********************************/\n/* Initialized data              */\n/*********************************/\n.data\nsMessResult:        .asciz \"Total \u00a0: @  pour @ \\n\"\nszMessError:        .asciz \"Number too large\u00a0!!.\\n\"\nszCarriageReturn:   .asciz \"\\n\"\n/*********************************/\n/* UnInitialized data            */\n/*********************************/\n.bss\nsZoneConv:        .skip 24\ntbNames:          .skip 8 * MAXI\n/*********************************/\n/*  code section                 */\n/*********************************/\n.text\n.global main \nmain:                                 // entry of program \n    \n    mov x0,#5\n    bl functionG\n    \n    mov x0,#23\n    bl functionG\n\n    mov x0,#123\n    bl functionG\n    \n    mov x0,#524\n    bl functionG\n    \n    mov x0,#1234\n    bl functionG\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 \nqAdrszCarriageReturn:     .quad szCarriageReturn\nqAdrsMessResult:          .quad sMessResult\nqAdrtbNames:              .quad tbNames\nqAdrsZoneConv:            .quad sZoneConv\n/******************************************************************/\n/*            compute function G                                 */ \n/******************************************************************/\n/* x0 contains N */\nfunctionG:\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    cmp x0,#MAXI + 1\n    bge 2f\n    mov x3,x0\n    mov x2,#1\n1:                               // loop compute every item\n    mov x0,x2\n    bl computeNumber\n    add x2,x2,#1\n    cmp x2,x3\n    ble 1b\n \n    ldr x1,qAdrsZoneConv         // result display\n    bl conversion10              // call decimal conversion\n    ldr x0,qAdrsMessResult\n    ldr x1,qAdrsZoneConv         // insert conversion in message\n    bl strInsertAtCharInc\n    mov x4,x0\n    mov x0,x3\n    ldr x1,qAdrsZoneConv         // result display\n    bl conversion10              // call decimal conversion\n    mov x0,x4\n    ldr x1,qAdrsZoneConv         // insert conversion in message\n    bl strInsertAtCharInc\n    bl affichageMess\n    mov x0,#0\n    b 100f\n2:\n    ldr x0,qAdrszMessError\n    bl affichageMess\n    mov x0,#-1\n100:\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\nqAdrszMessError:         .quad szMessError\n/******************************************************************/\n/*            random door test strategy                           */ \n/******************************************************************/\n/* x0 contains N */\ncomputeNumber:\n    stp x1,lr,[sp,-16]!          // save  registres\n    stp x2,x3,[sp,-16]!          // save  registres\n    stp x4,x5,[sp,-16]!          // save  registres\n    stp x6,x7,[sp,-16]!          // save  registres\n    ldr x6,qAdrtbNames           // table address\n    mov x1,#1\n    str x1,[x6]                  // init item 0\n    mov x1,#0\n    str x1,[x6,x0,lsl #3]        // init item N\n    mov x2,#1                    // indice\n1:\n    add x3,x2,x2, lsl #1\n    sub x4,x3,#1\n    mul x4,x2,x4\n    lsr x4,x4,#1\n    subs x3,x0,x4                // compute new indice\n    blt 90f\n    tst x2,#1                    // indice owen\u00a0?\n    beq 2f\n    ldr x4,[x6,x3,lsl #3]\n    ldr x5,[x6,x0,lsl #3]\n    add x5,x5,x4                 // addition\n    str x5,[x6,x0,lsl #3]\n    b 3f\n2:                               // else substrac\n    ldr x4,[x6,x3,lsl #3]\n    ldr x5,[x6,x0,lsl #3]\n    sub x5,x5,x4\n    str x5,[x6,x0,lsl #3]\n3:\n    subs x3,x3,x2                // compute new indice\n    blt 90f\n    \n    tst x2,#1                    // owen\u00a0?\n    beq 4f\n    ldr x4,[x6,x3,lsl #3]\n    ldr x5,[x6,x0,lsl #3]\n    add x5,x5,x4\n    str x5,[x6,x0,lsl #3]\n    b 5f\n4:\n    ldr x4,[x6,x3,lsl #3]\n    ldr x5,[x6,x0,lsl #3]\n    sub x5,x5,x4\n    str x5,[x6,x0,lsl #3]\n5:\n    add x2,x2,#1\n    cmp x2,x0\n    ble 1b\n90:\n   ldr x0,[x6,x0,lsl #3]         // return last item of table\n100:\n    ldp x6,x7,[sp],16           // restaur des  2 registres\n    ldp x4,x5,[sp],16           // restaur des  2 registres\n    ldp x2,x3,[sp],16           // restaur des  2 registres\n    ldp x1,lr,[sp],16           // restaur des  2 registres\n    ret\n/********************************************************/\n/*        File Include fonctions                        */\n/********************************************************/\n/* for this file see task include a file in language AArch64 assembly */\n.include \"../includeARM64.inc\"",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_40.txt",
        "content": "1\n1 1\n1 1 1\n1 2 1 1\n1 2 2 1 1\n1 3 3 2 1 1\n1 3 4 3 2 1 1\n1 4 5 5 3 2 1 1\n1 4 7 6 5 3 2 1 1\n1 5 8 9 7 5 3 2 1 1\n1 5 10 11 10 7 5 3 2 1 1\n1 6 12 15 13 11 7 5 3 2 1 1\n1 6 14 18 18 14 11 7 5 3 2 1 1\n1 7 16 23 23 20 15 11 7 5 3 2 1 1\n1 7 19 27 30 26 21 15 11 7 5 3 2 1 1\n1 8 21 34 37 35 28 22 15 11 7 5 3 2 1 1\n1 8 24 39 47 44 38 29 22 15 11 7 5 3 2 1 1\n1 9 27 47 57 58 49 40 30 22 15 11 7 5 3 2 1 1\n1 9 30 54 70 71 65 52 41 30 22 15 11 7 5 3 2 1 1\n1 10 33 64 84 90 82 70 54 42 30 22 15 11 7 5 3 2 1 1\n1 10 37 72 101 110 105 89 73 55 42 30 22 15 11 7 5 3 2 1 1\n1 11 40 84 119 136 131 116 94 75 56 42 30 22 15 11 7 5 3 2 1 1\n1 11 44 94 141 163 164 146 123 97 76 56 42 30 22 15 11 7 5 3 2 1 1\n1 12 48 108 164 199 201 186 157 128 99 77 56 42 30 22 15 11 7 5 3 2 1 1\n1 12 52 120 192 235 248 230 201 164 131 100 77 56 42 30 22 15 11 7 5 3 2 1 1\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_41.txt",
        "content": "-module(triangle).\n-export([start/1]).\nstart(N)->\n  print(1,1,N).\nprint(N,N,N)->\n1;\nprint(A,B,N) when A>=B->\n   io:format(\"~p \",[formula(A,B)]),\n   print(A,B+1,N);\nprint(A,B,N) when B>A->\n   io:format(\"~n\"),\n   print(A+1,1,N).\n\nformula(_,0)->\n  0;\nformula(B,B)->\n  1;\nformula(A,B) when B>A->\n  0;\nformula(A1,B1)->\n  formula(A1-1,B1-1)+formula(A1-B1,B1).\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_42.txt",
        "content": "1 \n1 1 \n1 1 1 \n1 2 1 1 \n1 2 2 1 1 \n1 3 3 2 1 1 \n1 3 4 3 2 1 1 \n1 4 5 5 3 2 1 1 \n1 4 7 6 5 3 2 1 1 \n1 5 8 9 7 5 3 2 1 1 \n1 5 10 11 10 7 5 3 2 1 1 \n1 6 12 15 13 11 7 5 3 2 1 1 \n1 6 14 18 18 14 11 7 5 3 2 1 1 \n1 7 16 23 23 20 15 11 7 5 3 2 1 1 \n1 7 19 27 30 26 21 15 11 7 5 3 2 1 1 \n1 8 21 34 37 35 28 22 15 11 7 5 3 2 1 1 \n1 8 24 39 47 44 38 29 22 15 11 7 5 3 2 1 1 \n1 9 27 47 57 58 49 40 30 22 15 11 7 5 3 2 1 1 \n1 9 30 54 70 71 65 52 41 30 22 15 11 7 5 3 2 1 1 \n1 10 33 64 84 90 82 70 54 42 30 22 15 11 7 5 3 2 1 1 \n1 10 37 72 101 110 105 89 73 55 42 30 22 15 11 7 5 3 2 1 1 \n1 11 40 84 119 136 131 116 94 75 56 42 30 22 15 11 7 5 3 2 1 1 \n1 11 44 94 141 163 164 146 123 97 76 56 42 30 22 15 11 7 5 3 2 1 1 \n1 12 48 108 164 199 201 186 157 128 99 77 56 42 30 22 15 11 7 5 3 2 1 1 \n1 12 52 120 192 235 248 230 201 164 131 100 77 56 42 30 22 15 11 7 5 3 2 1 1 \n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_43.txt",
        "content": "USING: combinators io kernel math math.ranges memoize prettyprint\nsequences ;\n\nMEMO: p ( m n -- o )\n    {\n        { [ dup zero? ] [ nip ] }\n        { [ 2dup = ] [ 2drop 1 ] }\n        { [ 2dup < ] [ 2drop 0 ] }\n        [ [ [ 1 - ] bi@ p ] [ [ - ] [ ] bi p + ] 2bi ]\n    } cond ;\n\n: row ( n -- seq ) dup [1,b] [ p ] with map ;\n\n: .row ( n -- ) row [ pprint bl ] each nl ;\n\n: .triangle ( n -- ) [1,b] [ .row ] each ;\n\n: G ( n -- sum ) row sum ;\n\n25 .triangle nl\n\"Sums:\" print { 23 123 1234 12345 } [ dup pprint bl G . ] each\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_44.txt",
        "content": "1 \n1 1 \n1 1 1 \n1 2 1 1 \n1 2 2 1 1 \n1 3 3 2 1 1 \n1 3 4 3 2 1 1 \n1 4 5 5 3 2 1 1 \n1 4 7 6 5 3 2 1 1 \n1 5 8 9 7 5 3 2 1 1 \n1 5 10 11 10 7 5 3 2 1 1 \n1 6 12 15 13 11 7 5 3 2 1 1 \n1 6 14 18 18 14 11 7 5 3 2 1 1 \n1 7 16 23 23 20 15 11 7 5 3 2 1 1 \n1 7 19 27 30 26 21 15 11 7 5 3 2 1 1 \n1 8 21 34 37 35 28 22 15 11 7 5 3 2 1 1 \n1 8 24 39 47 44 38 29 22 15 11 7 5 3 2 1 1 \n1 9 27 47 57 58 49 40 30 22 15 11 7 5 3 2 1 1 \n1 9 30 54 70 71 65 52 41 30 22 15 11 7 5 3 2 1 1 \n1 10 33 64 84 90 82 70 54 42 30 22 15 11 7 5 3 2 1 1 \n1 10 37 72 101 110 105 89 73 55 42 30 22 15 11 7 5 3 2 1 1 \n1 11 40 84 119 136 131 116 94 75 56 42 30 22 15 11 7 5 3 2 1 1 \n1 11 44 94 141 163 164 146 123 97 76 56 42 30 22 15 11 7 5 3 2 1 1 \n1 12 48 108 164 199 201 186 157 128 99 77 56 42 30 22 15 11 7 5 3 2 1 1 \n1 12 52 120 192 235 248 230 201 164 131 100 77 56 42 30 22 15 11 7 5 3 2 1 1 \n\nSums:\n23 1255\n123 2552338241\n1234 156978797223733228787865722354959930\n^C\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_45.txt",
        "content": "NEEDS -xopg\nANEW -nbnog \\ The Nine Billion Names of God\n.arbitrary.p\n\n#100000 =: N  \nCREATE idx[ #23 , #123 , #1234 , #12345 , #20000 , #30000 , #40000 , #50000 , N , 0 ,\nN GARRAY p\n\n: CALC ( n -- )\n\t0 LOCALS| d n |\n\tn 1+ 1 ?DO  I 3 * 1-  I 2 */  n SWAP -  TO d   d 0< ?LEAVE\n\t\t    I 1 AND IF  LET p[n]=p[n]+p[d]: ELSE  LET p[n]=p[n]-p[d]: ENDIF\n\t\t    I -TO d   d 0< ?LEAVE\n\t\t    I 1 AND IF  LET p[n]=p[n]+p[d]: ELSE  LET p[n]=p[n]-p[d]: ENDIF\n\t      LOOP\u00a0;\n\n: .GOD ( -- )\n\t0 LOCAL at  \n\tLET p[0]=1: N 1 DO  I CALC  \n\t\t\t    idx[ at CELL[] @ I = IF  CR I 5 .R .\"\u00a0: \" LET. p[I]:  \n\t\t\t    \t\t\t     1 +TO at  \n\t\t\t    \t\t      ENDIF  \n\t\t      LOOP\u00a0;\n\t\n: .ABOUT ( -- ) .\" Try: .GOD\"\u00a0;\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_46.txt",
        "content": "FORTH> .god\n   23:  1.2550000000000000000000000000000000000000e+0003\n  123:  2.5523382410000000000000000000000000000000e+0009\n 1234:  1.5697879722373322878786572235495993000000e+0035\n12345:  6.9420357953926116819562977205209384460667e+0118\n20000:  2.5211481381252969791661953323047045228132e+0152\n30000:  4.2963584246325385174883157483005920912690e+0187\n40000:  2.2807728274470728289340571240816959704646e+0217\n50000:  3.6261860971416678445921408915956337281653e+0243 ok\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_47.txt",
        "content": "' version 03-11-2016\n' compile with: fbc -s console\n\n#Include Once \"gmp.bi\"\n\nSub partitions(max As ULong, p() As MpZ_ptr)\n    ' based on Numericana code example\n    Dim As ULong a, b, i, k\n    Dim As Long j\n\n    Dim As Mpz_ptr s = Allocate(Len(__mpz_struct)) : Mpz_init(s)\n\n    Mpz_set_ui(p(0), 1)\n\n    For i = 1 To max\n        j = 1 : k = 1 : b = 2 : a = 5\n        While j > 0\n            ' j = i - (3*k*k+k) \\ 2\n            j = i - b : b = b + a : a = a + 3\n            If j >= 0 Then\n                If k And 1 Then Mpz_add(s, s, p(j)) Else Mpz_sub(s, s, p(j))\n            End If\n            j = j + k\n            If j >= 0 Then\n                If k And 1 Then Mpz_add(s, s, p(j)) Else Mpz_sub(s, s, p(j))\n            End If\n            k = k +1\n        Wend\n        Mpz_swap(p(i), s)\n    Next\n\n    Mpz_clear(s)\n\nEnd Sub\n\n' ------=< MAIN >=------\n\nDim As ULong n, k, max = 25              ' with max > 416 the numbers become\nDim As ULongInt p(max, max)              ' to big for a 64bit unsigned integer         \n\np(1, 1) = 1                              ' fill the first 3 rows\np(2, 1) = 1 : p(2, 2) = 1\np(3, 1) = 1 : p(3, 2) = 1 : p(3, 3) = 1\n\nFor n = 4 To max                         ' fill the rest\n    For k = 1 To n\n        If k * 2 > n  Then\n           p(n,k)= p(n-1,k-1)\n        Else \n           p(n,k) = p(n-1,k-1) + p(n-k, k)\n        End If\n    Next\nNext\n\nFor n = 1 To 25                          ' print the triangle\n    Print Space((max - n) * 2);\n    For k = 1 To n\n        Print Using \"####\"; p(n, k);\n    Next\n    Print\nNext\nPrint : print\n\n                                         ' calculate the integer partition\nmax = 123456                             ' 1234567 takes about ten minutes\nDim As ZString Ptr ans\n\nReDim big_p(max) As Mpz_ptr\nFor n = 0 To max\n    big_p(n) = Allocate(Len(__mpz_struct)) : Mpz_init(big_p(n))\nNext\n\npartitions(max, big_p())\n\nFor n = 1 To Len(Str(max))\n    k = Val(Left(Str(max), n))\n    ans = Mpz_get_str (0, 10, big_p(k))\n    Print Space(10 - n); \"P(\"; Str(k); \") = \"; *ans\nNext\n\nFor n = 0 To max\n    Mpz_clear(big_p(n))\nNext\n\n' empty keyboard buffer\nWhile InKey <> \"\" : Wend\nPrint : Print \"hit any key to end program\"\nSleep\nEnd\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_48.txt",
        "content": "                                                   1\n                                                 1   1\n                                               1   1   1\n                                             1   2   1   1\n                                           1   2   2   1   1\n                                         1   3   3   2   1   1\n                                       1   3   4   3   2   1   1\n                                     1   4   5   5   3   2   1   1\n                                   1   4   7   6   5   3   2   1   1\n                                 1   5   8   9   7   5   3   2   1   1\n                               1   5  10  11  10   7   5   3   2   1   1\n                             1   6  12  15  13  11   7   5   3   2   1   1\n                           1   6  14  18  18  14  11   7   5   3   2   1   1\n                         1   7  16  23  23  20  15  11   7   5   3   2   1   1\n                       1   7  19  27  30  26  21  15  11   7   5   3   2   1   1\n                     1   8  21  34  37  35  28  22  15  11   7   5   3   2   1   1\n                   1   8  24  39  47  44  38  29  22  15  11   7   5   3   2   1   1\n                 1   9  27  47  57  58  49  40  30  22  15  11   7   5   3   2   1   1\n               1   9  30  54  70  71  65  52  41  30  22  15  11   7   5   3   2   1   1\n             1  10  33  64  84  90  82  70  54  42  30  22  15  11   7   5   3   2   1   1\n           1  10  37  72 101 110 105  89  73  55  42  30  22  15  11   7   5   3   2   1   1\n         1  11  40  84 119 136 131 116  94  75  56  42  30  22  15  11   7   5   3   2   1   1\n       1  11  44  94 141 163 164 146 123  97  76  56  42  30  22  15  11   7   5   3   2   1   1\n     1  12  48 108 164 199 201 186 157 128  99  77  56  42  30  22  15  11   7   5   3   2   1   1\n   1  12  52 120 192 235 248 230 201 164 131 100  77  56  42  30  22  15  11   7   5   3   2   1   1\n\n\n         P(1) = 1\n        P(12) = 77\n       P(123) = 2552338241\n      P(1234) = 156978797223733228787865722354959930\n     P(12345) = 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\n    P(123456) = 30817659578536496678545317146533980855296613274507139217608776782063054452191537379312358383342446230621170608408020911309259407611257151683372221925128388387168451943800027128045369650890220060901494540459081545445020808726917371699102825508039173543836338081612528477859613355349851184591540231790254269948278726548570660145691076819912972162262902150886818986555127204165221706149989",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_49.txt",
        "content": "class PartitionCount\n{\n   // Array of elements\n   class var triangle = [[0],[0,1]]\n\n   // Array of cumulative sums in each row.\n   class var sumTriangle = [[1],[0,1]]\n\n   class calcRowsTo[toRow]\u00a0:=\n   {\n      for row = length[triangle] to toRow\n      {\n         triangle@row = workrow = new array[[row+1],0]\n         sumTriangle@row = sumworkrow = new array[[row+1],0]\n         oversum = 0\n         for col = 1 to row\n         {\n            otherRow = row-col\n            sum = sumTriangle@otherRow@min[col,otherRow]\n            workrow@col = sum\n            oversum = oversum + sum\n            sumworkrow@col = oversum\n         }\n      }\n   }\n\n   class rowSum[row]\u00a0:=\n   {\n      calcRowsTo[row]\n      return sumTriangle@row@row\n   }\n}\n\nPartitionCount.calcRowsTo[25]\nfor row=1 to 25\n{\n   for col=1 to row\n      print[PartitionCount.triangle@row@col + \" \"]\n   println[]\n}\n\n// Test against Frink's built-in much faster partitionCount function that uses\n// Euler's pentagonal method for counting partitions.\ntestRow[row]\u00a0:=\n{\n   sum = PartitionCount.rowSum[row]\n   println[\"$row\\t$sum\\t\" + (sum == partitionCount[row]\u00a0? \"correct\"\u00a0: \"incorrect\")]\n}\n\nprintln[]\ntestRow[23]\ntestRow[123]\ntestRow[1234]\ntestRow[12345]",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_5.txt",
        "content": "Total \u00a0: 7  pour 5\nTotal \u00a0: 1255  pour 23\nTotal \u00a0: 2552338241  pour 123\nTotal \u00a0: 18324532310194337942  pour 524\nNumber too large\u00a0!!.\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_50.txt",
        "content": "1 \n1 1 \n1 1 1 \n1 2 1 1 \n1 2 2 1 1 \n1 3 3 2 1 1 \n1 3 4 3 2 1 1 \n1 4 5 5 3 2 1 1 \n1 4 7 6 5 3 2 1 1 \n1 5 8 9 7 5 3 2 1 1 \n1 5 10 11 10 7 5 3 2 1 1 \n1 6 12 15 13 11 7 5 3 2 1 1 \n1 6 14 18 18 14 11 7 5 3 2 1 1 \n1 7 16 23 23 20 15 11 7 5 3 2 1 1 \n1 7 19 27 30 26 21 15 11 7 5 3 2 1 1 \n1 8 21 34 37 35 28 22 15 11 7 5 3 2 1 1 \n1 8 24 39 47 44 38 29 22 15 11 7 5 3 2 1 1 \n1 9 27 47 57 58 49 40 30 22 15 11 7 5 3 2 1 1 \n1 9 30 54 70 71 65 52 41 30 22 15 11 7 5 3 2 1 1 \n1 10 33 64 84 90 82 70 54 42 30 22 15 11 7 5 3 2 1 1 \n1 10 37 72 101 110 105 89 73 55 42 30 22 15 11 7 5 3 2 1 1 \n1 11 40 84 119 136 131 116 94 75 56 42 30 22 15 11 7 5 3 2 1 1 \n1 11 44 94 141 163 164 146 123 97 76 56 42 30 22 15 11 7 5 3 2 1 1 \n1 12 48 108 164 199 201 186 157 128 99 77 56 42 30 22 15 11 7 5 3 2 1 1 \n1 12 52 120 192 235 248 230 201 164 131 100 77 56 42 30 22 15 11 7 5 3 2 1 1 \n\n23\t1255\tcorrect\n123\t2552338241\tcorrect\n1234\t156978797223733228787865722354959930\tcorrect\n12345\t69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\tcorrect\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_51.txt",
        "content": "PrintArray(List([1 .. 25], n -> List([1 .. n], k -> NrPartitions(n, k))));\n\n[ [    1 ],\n  [    1,    1 ],\n  [    1,    1,    1 ],\n  [    1,    2,    1,    1 ],\n  [    1,    2,    2,    1,    1 ],\n  [    1,    3,    3,    2,    1,    1 ],\n  [    1,    3,    4,    3,    2,    1,    1 ],\n  [    1,    4,    5,    5,    3,    2,    1,    1 ],\n  [    1,    4,    7,    6,    5,    3,    2,    1,    1 ],\n  [    1,    5,    8,    9,    7,    5,    3,    2,    1,    1 ],\n  [    1,    5,   10,   11,   10,    7,    5,    3,    2,    1,    1 ],\n  [    1,    6,   12,   15,   13,   11,    7,    5,    3,    2,    1,    1 ],\n  [    1,    6,   14,   18,   18,   14,   11,    7,    5,    3,    2,    1,    1 ],\n  [    1,    7,   16,   23,   23,   20,   15,   11,    7,    5,    3,    2,    1,    1 ],\n  [    1,    7,   19,   27,   30,   26,   21,   15,   11,    7,    5,    3,    2,    1,    1 ],\n  [    1,    8,   21,   34,   37,   35,   28,   22,   15,   11,    7,    5,    3,    2,    1,    1 ],\n  [    1,    8,   24,   39,   47,   44,   38,   29,   22,   15,   11,    7,    5,    3,    2,    1,    1 ],\n  [    1,    9,   27,   47,   57,   58,   49,   40,   30,   22,   15,   11,    7,    5,    3,    2,    1,    1 ],\n  [    1,    9,   30,   54,   70,   71,   65,   52,   41,   30,   22,   15,   11,    7,    5,    3,    2,    1,    1 ],\n  [    1,   10,   33,   64,   84,   90,   82,   70,   54,   42,   30,   22,   15,   11,    7,    5,    3,    2,    1,    1 ],\n  [    1,   10,   37,   72,  101,  110,  105,   89,   73,   55,   42,   30,   22,   15,   11,    7,    5,    3,    2,    1,    1 ],\n  [    1,   11,   40,   84,  119,  136,  131,  116,   94,   75,   56,   42,   30,   22,   15,   11,    7,    5,    3,    2,    1,    1 ],\n  [    1,   11,   44,   94,  141,  163,  164,  146,  123,   97,   76,   56,   42,   30,   22,   15,   11,    7,    5,    3,    2,    1,    1 ],\n  [    1,   12,   48,  108,  164,  199,  201,  186,  157,  128,   99,   77,   56,   42,   30,   22,   15,   11,    7,    5,    3,    2,    1,    1 ],\n  [    1,   12,   52,  120,  192,  235,  248,  230,  201,  164,  131,  100,   77,   56,   42,   30,   22,   15,   11,    7,    5,    3,    2,    1,    1 ] ]\n\n\nList([23, 123, 1234, 12345], NrPartitions);\n\n[ 1255, 2552338241, 156978797223733228787865722354959930,\n  69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736 ]\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_52.txt",
        "content": "package main\n\nimport (\n\t\"fmt\"\n\t\"math/big\"\n)\n\nfunc main() {\n\n\tintMin := func(a, b int) int {\n\t\tif a < b {\n\t\t\treturn a\n\t\t} else {\n\t\t\treturn b\n\t\t}\n\t}\n\n\tvar cache = [][]*big.Int{{big.NewInt(1)}}\n\n\tcumu := func(n int) []*big.Int {\n\t\tfor y := len(cache); y <= n; y++ {\n\t\t\trow := []*big.Int{big.NewInt(0)}\n\t\t\tfor x := 1; x <= y; x++ {\n\t\t\t\tcacheValue := cache[y-x][intMin(x, y-x)]\n\t\t\t\trow = append(row, big.NewInt(0).Add(row[len(row)-1], cacheValue))\n\t\t\t}\n\t\t\tcache = append(cache, row)\n\t\t}\n\t\treturn cache[n]\n\t}\n\n\trow := func(n int) {\n\t\te := cumu(n)\n\t\tfor i := 0; i < n; i++ {\n\t\t\tfmt.Printf(\" %v \", (big.NewInt(0).Sub(e[i+1], e[i])).Text(10))\n\t\t}\n\t\tfmt.Println()\n\t}\n\n\tfmt.Println(\"rows:\")\n\tfor x := 1; x < 11; x++ {\n\t\trow(x)\n\t}\n\tfmt.Println()\n\t\n\tfmt.Println(\"sums:\")\n\tfor _, num := range [...]int{23, 123, 1234, 12345} {\n\t\tr := cumu(num)\n\t\tfmt.Printf(\"%d %v\\n\", num, r[len(r)-1].Text(10))\n\t}\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_53.txt",
        "content": "rows:\n 1 \n 1  1 \n 1  1  1 \n 1  2  1  1 \n 1  2  2  1  1 \n 1  3  3  2  1  1 \n 1  3  4  3  2  1  1 \n 1  4  5  5  3  2  1  1 \n 1  4  7  6  5  3  2  1  1 \n 1  5  8  9  7  5  3  2  1  1 \n\n sums:\n23 1255 \n123 2552338241 \n1234 156978797223733228787865722354959930 \n12345 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736 \n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_54.txt",
        "content": "def partitions(c)\n{\n\n    def p=[]; \n    int k = 0;   \n     p[k] = c;   \n    int counter=0;\n    def counts=[];\n\tfor (i in 0..c-1)\n\t{counts[i]=0;}\n    while (true)\n    {\n     \n        counter++;\n\t\tcounts[p[0]-1]=counts[p[0]-1]+1;\n\t\tint rem_val = 0;\n        while (k >= 0 && p[k] == 1)\n        { rem_val += p[k];\n            k--;}\n        if (k < 0)  { break;}\n        p[k]--;\n        rem_val++;\n        while (rem_val > p[k])\n        {\n            p[k+1] = p[k];\n            rem_val = rem_val - p[k];\n            k++;\n        }\n        p[k+1] = rem_val;\n        k++;\n    }\n\tprintln counts;\n\treturn counter;\n}\n\n\nstatic void  main(String[] args)\n{\nfor( i in 1..25 )\n{partitions(i);}\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_55.txt",
        "content": "[1]\n[1, 1]\n[1, 1, 1]\n[1, 2, 1, 1]\n[1, 2, 2, 1, 1]\n[1, 3, 3, 2, 1, 1]\n[1, 3, 4, 3, 2, 1, 1]\n[1, 4, 5, 5, 3, 2, 1, 1]\n[1, 4, 7, 6, 5, 3, 2, 1, 1]\n[1, 5, 8, 9, 7, 5, 3, 2, 1, 1]\n[1, 5, 10, 11, 10, 7, 5, 3, 2, 1, 1]\n[1, 6, 12, 15, 13, 11, 7, 5, 3, 2, 1, 1]\n[1, 6, 14, 18, 18, 14, 11, 7, 5, 3, 2, 1, 1]\n[1, 7, 16, 23, 23, 20, 15, 11, 7, 5, 3, 2, 1, 1]\n[1, 7, 19, 27, 30, 26, 21, 15, 11, 7, 5, 3, 2, 1, 1]\n[1, 8, 21, 34, 37, 35, 28, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n[1, 8, 24, 39, 47, 44, 38, 29, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n[1, 9, 27, 47, 57, 58, 49, 40, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n[1, 9, 30, 54, 70, 71, 65, 52, 41, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n[1, 10, 33, 64, 84, 90, 82, 70, 54, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n[1, 10, 37, 72, 101, 110, 105, 89, 73, 55, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n[1, 11, 40, 84, 119, 136, 131, 116, 94, 75, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n[1, 11, 44, 94, 141, 163, 164, 146, 123, 97, 76, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n[1, 12, 48, 108, 164, 199, 201, 186, 157, 128, 99, 77, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n[1, 12, 52, 120, 192, 235, 248, 230, 201, 164, 131, 100, 77, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n\n\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_56.txt",
        "content": "import Data.List (mapAccumL)\n\ncumu :: [[Integer]]\ncumu = [1] : map (scanl (+) 0) rows\n\nrows :: [[Integer]]\nrows = snd $ mapAccumL f [] cumu where\n    f r row = (rr, new_row) where\n        new_row = map head rr\n        rr = map tailKeepOne (row:r)\n    tailKeepOne [x] = [x]\n    tailKeepOne (_:xs) = xs\n\nsums n = cumu !! n !! n\n--curiously, the following seems to be faster\n--sums = sum . (rows!!)\n\nmain :: IO ()\nmain = do\n    mapM_ print $ take 10 rows\n    mapM_ (print.sums) [23, 123, 1234, 12345]\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_57.txt",
        "content": "[1]\n[1,1]\n[1,1,1]\n[1,2,1,1]\n[1,2,2,1,1]\n[1,3,3,2,1,1]\n[1,3,4,3,2,1,1]\n[1,4,5,5,3,2,1,1]\n[1,4,7,6,5,3,2,1,1]\n[1,5,8,9,7,5,3,2,1,1]\n1255\n2552338241\n156978797223733228787865722354959930\n^C (probably don't have enough memory for 12345 anyway)\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_58.txt",
        "content": "procedure main(A)\n    n := integer(!A) | 10\n    every r := 2 to (n+1) do write(right(r-1,2),\": \",showList(row(r)))\n    write()\n    every r := 23 | 123 | 1234 | 12345 do write(r,\" \",cumu(r+1)[-1])\nend\n\nprocedure cumu(n)\n    static cache\n    initial cache := [[1]]\n    every l := *cache to n do {\n        every (r := [0], x := !l) do put(r, r[-1]+cache[1+l-x][1+min(x,l-x)])\n        put(cache, r)\n        }\n    return cache[n]\nend\n\nprocedure row(n)\n    return (r := cumu(n), [: (i := !(*r-1), r[i+1]-r[i]) :]) | r\nend\n\nprocedure showList(A)\n    every (s := \"[\") ||:= (!A||\", \")\n    return s[1:-2]||\"]\"\nend\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_59.txt",
        "content": "->9bnogti           \n 1: [1]\n 2: [1, 1]\n 3: [1, 1, 1]\n 4: [1, 2, 1, 1]\n 5: [1, 2, 2, 1, 1]\n 6: [1, 3, 3, 2, 1, 1]\n 7: [1, 3, 4, 3, 2, 1, 1]\n 8: [1, 4, 5, 5, 3, 2, 1, 1]\n 9: [1, 4, 7, 6, 5, 3, 2, 1, 1]\n10: [1, 5, 8, 9, 7, 5, 3, 2, 1, 1]\n\n23 1255\n123 2552338241\n1234 156978797223733228787865722354959930\n^C\n->\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_6.txt",
        "content": "with Ada.Text_IO;\nwith Ada.Numerics.Big_Numbers.Big_Integers;\n\nprocedure Names_Of_God is\n\n   NN         : constant := 100_000;\n   Row_Count  : constant := 25;\n   Max_Column : constant := 79;\n\n   package Triangle is\n      procedure Print;\n   end Triangle;\n\n   package Row_Summer is\n      procedure Calc (N : Integer);\n      procedure Put_Sums;\n   end Row_Summer;\n\n   package body Row_Summer is\n      use Ada.Text_IO;\n      use Ada.Numerics.Big_Numbers.Big_Integers;\n\n      P : array (0 .. NN + 1) of Big_Integer := (1, others => 0);\n\n      procedure Calc (N : Integer) is\n      begin\n         P (N) := 0;\n\n         for K in 1 .. N + 1 loop\n            declare\n               Add : constant Boolean := K mod 2 /= 0;\n               D_1 : constant Integer := N - K * (3 * K - 1) / 2;\n               D_2 : constant Integer := D_1 - K;\n            begin\n               exit when D_1 < 0;\n\n               if Add\n               then P (N) := P (N) + P (D_1);\n               else P (N) := P (N) - P (D_1);\n               end if;\n\n               exit when D_2 < 0;\n\n               if Add\n               then P (N) := P (N) + P (D_2);\n               else P (N) := P (N) - P (D_2);\n               end if;\n            end;\n         end loop;\n      end Calc;\n\n      procedure Put_Wrapped (Item : Big_Integer) is\n         Image : constant String := To_String (Item);\n      begin\n         Set_Col (11);\n         for I in Image'Range loop\n            if Ada.Text_IO.Col >= Max_Column then\n               Set_Col (12);\n            end if;\n            Put (Image (I));\n         end loop;\n      end Put_Wrapped;\n\n      procedure Put_Sums\n      is\n         package Integer_IO is new Ada.Text_IO.Integer_IO (Integer);\n\n         Printout : constant array (Natural range <>) of Integer :=\n           (23, 123, 1234, 12_345, 20_000, 30_000, 40_000, 50_000, NN);\n\n         Next : Natural := Printout'First;\n      begin\n         for A in 1 .. Printout (Printout'Last) loop\n            Calc (A);\n            if A = Printout (Next) then\n               Put (\"G (\");\n               Integer_IO.Put (A, Width => 0);\n               Put (\")\");\n               Put_Wrapped (P (A));\n               New_Line;\n               Next := Next + 1;\n            end if;\n         end loop;\n      end Put_Sums;\n\n   end Row_Summer;\n\n   package body Triangle is\n\n      Triangle : array (0 .. Row_Count,\n                        0 .. Row_Count) of Integer := (others => (others => 0));\n\n      procedure Calculate is\n      begin\n         Triangle (1,1) := 1;\n         Triangle (2,1) := 1;\n         Triangle (2,2) := 1;\n         Triangle (3,1) := 1;\n         Triangle (3,2) := 1;\n         Triangle (3,3) := 1;\n         for Row in 4 .. Row_Count loop\n            for Col in 1 .. Row loop\n               if Col * 2 > Row then\n                  Triangle (Row, Col) := Triangle (Row - 1, Col - 1);\n               else\n                  Triangle (Row, Col) :=\n                    Triangle (Row - 1, Col - 1) +\n                    Triangle (Row - Col, Col);\n               end if;\n            end loop;\n         end loop;\n      end Calculate;\n\n      procedure Print\n      is\n         use Ada.Text_IO;\n         Width : array (1 .. Row_Count) of Natural := (others => 0);\n      begin\n         for Row in 1 .. Row_count loop\n            for Col in 1 .. Row loop\n               Width (Row) := Width (Row) + Triangle (Row, Col)'Image'Length;\n            end loop;\n         end loop;\n\n         for Row in 1 .. Row_Count loop\n            Set_Col (1 + Positive_Count (1 + Width (Width'Last)\n                                           - Width (Row)) / 2);\n            for Col in 1 .. Row loop\n               Put (Triangle (Row, Col)'Image);\n            end loop;\n            New_Line;\n         end loop;\n      end Print;\n\n   begin\n      Calculate;\n   end Triangle;\n\nbegin\n   Triangle.Print;\n   Row_Summer.Put_Sums;\nend Names_Of_God;\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_60.txt",
        "content": "T=: 0:`1:`(($:&<:+ - $: ])`0:@.(0=]))@.(1+*@-) M. \"0\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_61.txt",
        "content": "rows=: <@(#~0<])@({: T ])\\@i.\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_62.txt",
        "content": "   ({.~1+1 i:~ '1'=])\"1 \":> }.rows 1+10\n1                  \n1 1                \n1 1 1              \n1 2 1 1            \n1 2 2 1 1          \n1 3 3 2 1 1        \n1 3 4 3 2 1 1      \n1 4 5 5 3 2 1 1    \n1 4 7 6 5 3 2 1 1  \n1 5 8 9 7 5 3 2 1 1\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_63.txt",
        "content": "rowSums=: 3 :0\"0\n  z=. (y+1){. 1x\n  for_ks. <\\1+i.y do.\n    n=.{: k=.>ks\n    r=.#c=. ({.~* i._1:)(n,0.5 _1.5) p. k\n    s=.#d=.({.~* i._1:)c-r{.k\n    'v i'=.|: \\:~(c,d),. r ,&({.&k) s\n    a=. +/(n{z),(_1^1x+2|i) * v{z\n    z=. a n}z \n  end.\n)\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_64.txt",
        "content": "   ({ [: rowSums >./) 3 23 123 1234\n3 1255 2552338241 156978797223733228787865722354959930",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_65.txt",
        "content": "import java.math.BigInteger;\nimport java.util.*;\nimport static java.util.Arrays.asList;\nimport static java.util.stream.Collectors.toList;\nimport static java.util.stream.IntStream.range;\nimport static java.lang.Math.min;\n\npublic class Test {\n\n    static List<BigInteger> cumu(int n) {\n        List<List<BigInteger>> cache = new ArrayList<>();\n        cache.add(asList(BigInteger.ONE));\n\n        for (int L = cache.size(); L < n + 1; L++) {\n            List<BigInteger> r = new ArrayList<>();\n            r.add(BigInteger.ZERO);\n            for (int x = 1; x < L + 1; x++)\n                r.add(r.get(r.size() - 1).add(cache.get(L - x).get(min(x, L - x))));\n            cache.add(r);\n        }\n        return cache.get(n);\n    }\n\n    static List<BigInteger> row(int n) {\n        List<BigInteger> r = cumu(n);\n        return range(0, n).mapToObj(i -> r.get(i + 1).subtract(r.get(i)))\n                .collect(toList());\n    }\n\n    public static void main(String[] args) {\n        System.out.println(\"Rows:\");\n        for (int x = 1; x < 11; x++)\n            System.out.printf(\"%2d: %s%n\", x, row(x));\n\n        System.out.println(\"\\nSums:\");\n        for (int x : new int[]{23, 123, 1234}) {\n            List<BigInteger> c = cumu(x);\n            System.out.printf(\"%s %s%n\", x, c.get(c.size() - 1));\n        }\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_66.txt",
        "content": "Rows:\n 1: [1]\n 2: [1, 1]\n 3: [1, 1, 1]\n 4: [1, 2, 1, 1]\n 5: [1, 2, 2, 1, 1]\n 6: [1, 3, 3, 2, 1, 1]\n 7: [1, 3, 4, 3, 2, 1, 1]\n 8: [1, 4, 5, 5, 3, 2, 1, 1]\n 9: [1, 4, 7, 6, 5, 3, 2, 1, 1]\n10: [1, 5, 8, 9, 7, 5, 3, 2, 1, 1]\n\nSums:\n23 1255\n123 2552338241\n1234 156978797223733228787865722354959930",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_67.txt",
        "content": "(function () {\n    var cache = [\n        [1]\n    ];\n//this was never needed.\n   /* function PyRange(start, end, step) {\n        step = step || 1;\n        if (!end) {\n            end = start;\n            start = 0;\n        }\n        var arr = [];\n        for (var i = start; i < end; i += step) arr.push(i);\n        return arr;\n    }*/ \n\n    function cumu(n) {\n        var /*ra = PyRange(cache.length, n + 1),*/ //Seems there is a better version for this\n            r, l, x, Aa, Mi;\n       // for (ll in ra) { too pythony\n       for (l=cache.length;l<n+1;l++) {\n            r = [0];\n//            l = ra[ll];\n//            ran = PyRange(1, l + 1);\n//            for (xx in ran) {\n            for(x=1;x<l+1;x++){\n//                x = ran[xx];\n                r.push(r[r.length - 1] + (Aa = cache[l - x < 0 ? cache.length - (l - x) : l - x])[(Mi = Math.min(x, l - x)) < 0 ? Aa.length - Mi : Mi]);\n            }\n            cache.push(r);\n        }\n        return cache[n];\n    }\n\n    function row(n) {\n        var r = cumu(n),\n//            rra = PyRange(n),\n            leArray = [],\n            i;\n//        for (ii in rra) {\n        for (i=0;i<n;i++) {\n//            i = rra[ii];\n            leArray.push(r[i + 1] - r[i]);\n        }\n        return leArray;\n    }\n\n    console.log(\"Rows:\");\n    for (iterator = 1; iterator < 12; iterator++) {\n        console.log(row(iterator));\n    }\n\n// PL clearly this was not tested:\n//    console.log(\"Sums\")[23, 123, 1234, 12345].foreach(function (a) {\n    console.log(\"Sums\");\n    [23, 123, 1234, 12345].forEach(function (a) {\n        var s = cumu(a);\n        console.log(a, s[s.length - 1]);\n    });\n})()\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_68.txt",
        "content": "function genTriangle(n){ // O(n^3) time and O(n^2) space\n    var a = new Array(n)\n    \n    for (let i = 0; i < n; i++){\n        a[i] = new Array(i+1)\n        for (let j = 0; j < i; j++){\n            a[i][j] = 0\n            let s = i-j-1, k = Math.min(s, j)\n            while (k >= 0) a[i][j] += a[s][k--]\n        }\n        a[i][i] = 1\n    }\n    \n    return a.map(x => x.join(\" \")).join(\"\\n\")\n}\n\nfunction G(n){ // At least O(n^2) time and O(n) space\n    var a = new Array(n+1)\n    a[0] = 1n\n    \n    for (let i = 1; i <= n; i++){\n        a[i] = 0n\n        for (let k = 1, s = 1; s <= i;){\n            a[i] += (k & 1 ? a[i-s]:-a[i-s])\n            k > 0 ? (s += k, k = -k):(k = -k+1, s = k*(3*k-1)/2)\n        }\n    }\n    \n    return a[n]\n}\n\nconsole.log(genTriangle(25))\nconsole.log(\"\")\n\nfor (const x of [23, 123, 1234, 12345]){\n    console.log(\"G(\" + x + \") = \" + G(x))\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_69.txt",
        "content": "1\n1 1\n1 1 1\n1 2 1 1\n1 2 2 1 1\n1 3 3 2 1 1\n1 3 4 3 2 1 1\n1 4 5 5 3 2 1 1\n1 4 7 6 5 3 2 1 1\n1 5 8 9 7 5 3 2 1 1\n1 5 10 11 10 7 5 3 2 1 1\n1 6 12 15 13 11 7 5 3 2 1 1\n1 6 14 18 18 14 11 7 5 3 2 1 1\n1 7 16 23 23 20 15 11 7 5 3 2 1 1\n1 7 19 27 30 26 21 15 11 7 5 3 2 1 1\n1 8 21 34 37 35 28 22 15 11 7 5 3 2 1 1\n1 8 24 39 47 44 38 29 22 15 11 7 5 3 2 1 1\n1 9 27 47 57 58 49 40 30 22 15 11 7 5 3 2 1 1\n1 9 30 54 70 71 65 52 41 30 22 15 11 7 5 3 2 1 1\n1 10 33 64 84 90 82 70 54 42 30 22 15 11 7 5 3 2 1 1\n1 10 37 72 101 110 105 89 73 55 42 30 22 15 11 7 5 3 2 1 1\n1 11 40 84 119 136 131 116 94 75 56 42 30 22 15 11 7 5 3 2 1 1\n1 11 44 94 141 163 164 146 123 97 76 56 42 30 22 15 11 7 5 3 2 1 1\n1 12 48 108 164 199 201 186 157 128 99 77 56 42 30 22 15 11 7 5 3 2 1 1\n1 12 52 120 192 235 248 230 201 164 131 100 77 56 42 30 22 15 11 7 5 3 2 1 1\n\nG(23) = 1255\nG(123) = 2552338241\nG(1234) = 156978797223733228787865722354959930\nG(12345) = 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_7.txt",
        "content": "                                       1\n                                      1 1\n                                     1 1 1\n                                    1 2 1 1\n                                   1 2 2 1 1\n                                  1 3 3 2 1 1\n                                 1 3 4 3 2 1 1\n                                1 4 5 5 3 2 1 1\n                               1 4 7 6 5 3 2 1 1\n                              1 5 8 9 7 5 3 2 1 1\n                           1 5 10 11 10 7 5 3 2 1 1\n                          1 6 12 15 13 11 7 5 3 2 1 1\n                        1 6 14 18 18 14 11 7 5 3 2 1 1\n                       1 7 16 23 23 20 15 11 7 5 3 2 1 1\n                     1 7 19 27 30 26 21 15 11 7 5 3 2 1 1\n                    1 8 21 34 37 35 28 22 15 11 7 5 3 2 1 1\n                  1 8 24 39 47 44 38 29 22 15 11 7 5 3 2 1 1\n                 1 9 27 47 57 58 49 40 30 22 15 11 7 5 3 2 1 1\n               1 9 30 54 70 71 65 52 41 30 22 15 11 7 5 3 2 1 1\n             1 10 33 64 84 90 82 70 54 42 30 22 15 11 7 5 3 2 1 1\n          1 10 37 72 101 110 105 89 73 55 42 30 22 15 11 7 5 3 2 1 1\n        1 11 40 84 119 136 131 116 94 75 56 42 30 22 15 11 7 5 3 2 1 1\n      1 11 44 94 141 163 164 146 123 97 76 56 42 30 22 15 11 7 5 3 2 1 1\n    1 12 48 108 164 199 201 186 157 128 99 77 56 42 30 22 15 11 7 5 3 2 1 1\n 1 12 52 120 192 235 248 230 201 164 131 100 77 56 42 30 22 15 11 7 5 3 2 1 1\nG (23)     1255\nG (123)    2552338241\nG (1234)   156978797223733228787865722354959930\nG (12345)  6942035795392611681956297720520938446066767309467146362027032170080\n           6074195845953959951425306140971942519870679768681736\nG (20000)  2521148138125296979166195332304704522813289496018115934368503141080\n           3428442380156495662397073168982436919232478935199490301641182623057\n           8166735959242113097\nG (30000)  4296358424632538517488315748300592091269024864540113906601448061276\n           4163986215458185192990173314832179564211367228855321718015074490598\n           095469727784182254987592569621576375743614022636192786\nG (40000)  2280772827447072828934057124081695970464622037835161185943949940867\n           2657828590548093703330014605000554127042566412316061732771683740688\n           0512642374788938691635864264873546003424774916205066033895952328900\n           82673857997469797\nG (50000)  3626186097141667844592140891595633728165383082527785049015872755414\n           1099042567120827181227473166105658246308817729102175442616592394326\n           7067153241385837825618898733387712189158660795738975053844747471259\n           2979263719012461858719791627302489739548263\nG (100000) 2749351056977569651267751632098635268817342931598005475820312598430\n           2147328114964173055050741660736621590157844774296248940493063070200\n           4617927644930335101160793424571901557189435097253124661084520063695\n           5893446424871682878983218234500926285383140459702130713067451062441\n           9227311238999702284408609370935531629697851569569892196108480158600\n           569421098519\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_70.txt",
        "content": "def cumu:\n  . as $n\n  | reduce range(1; $n+1) as $l ( {cache: [[1]]};\n      .r = [0]\n      | reduce range(1; $l+1) as $x (.;\n          .min = $l - $x\n          | if ($x < .min) then .min = $x else . end\n          | .r = .r + [.r[-1] + .cache[$l - $x][.min] ] )\n      | .cache = .cache + [.r] )\n  | .cache[$n]\u00a0;\n\ndef row:\n  cumu as $r\n  | reduce range(0; .) as $i ([]; . + [$r[$i+1] - $r[$i]] );\n\ndef task:\n  \"Rows:\",\n  (range(1; 26) |  [ ., row]),\n  \"\\nSums:\",\n  ( (23, 123, 1234)   #  12345 is a stretch for memory even using wren\n   | [., cumu[-1]] )\u00a0;",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_71.txt",
        "content": "Rows:\n[1,[1]]\n[2,[1,1]]\n[3,[1,1,1]]\n[4,[1,2,1,1]]\n[5,[1,2,2,1,1]]\n[6,[1,3,3,2,1,1]]\n[7,[1,3,4,3,2,1,1]]\n[8,[1,4,5,5,3,2,1,1]]\n[9,[1,4,7,6,5,3,2,1,1]]\n[10,[1,5,8,9,7,5,3,2,1,1]]\n[11,[1,5,10,11,10,7,5,3,2,1,1]]\n[12,[1,6,12,15,13,11,7,5,3,2,1,1]]\n[13,[1,6,14,18,18,14,11,7,5,3,2,1,1]]\n[14,[1,7,16,23,23,20,15,11,7,5,3,2,1,1]]\n[15,[1,7,19,27,30,26,21,15,11,7,5,3,2,1,1]]\n[16,[1,8,21,34,37,35,28,22,15,11,7,5,3,2,1,1]]\n[17,[1,8,24,39,47,44,38,29,22,15,11,7,5,3,2,1,1]]\n[18,[1,9,27,47,57,58,49,40,30,22,15,11,7,5,3,2,1,1]]\n[19,[1,9,30,54,70,71,65,52,41,30,22,15,11,7,5,3,2,1,1]]\n[20,[1,10,33,64,84,90,82,70,54,42,30,22,15,11,7,5,3,2,1,1]]\n[21,[1,10,37,72,101,110,105,89,73,55,42,30,22,15,11,7,5,3,2,1,1]]\n[22,[1,11,40,84,119,136,131,116,94,75,56,42,30,22,15,11,7,5,3,2,1,1]]\n[23,[1,11,44,94,141,163,164,146,123,97,76,56,42,30,22,15,11,7,5,3,2,1,1]]\n[24,[1,12,48,108,164,199,201,186,157,128,99,77,56,42,30,22,15,11,7,5,3,2,1,1]]\n[25,[1,12,52,120,192,235,248,230,201,164,131,100,77,56,42,30,22,15,11,7,5,3,2,1,1]]\n\nSums:\n[23,1255]\n[123,2552338241]\n[1234,156978797223733228787865722354959930]\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_72.txt",
        "content": "using Combinatorics, StatsBase\n\nnamesofline(n) = counts([x[1] for x in integer_partitions(n)])\n\nfunction centerjustpyramid(n)\n    maxwidth = length(string(namesofline(n)))\n    for i in 1:n\n        s = string(namesofline(i))\n        println(\" \" ^ div(maxwidth - length(s), 2), s)\n    end\nend\n\ncenterjustpyramid(25)\n\nconst cachecountpartitions = Dict{BigInt,BigInt}()\nfunction countpartitions(n::BigInt)\n    if n < 0\n        0\n    elseif n < 2\n        1\n    elseif (np = get(cachecountpartitions, n, 0)) > 0\n        np\n    else\n        np = 0\n        sgn = 1\n        for k = 1:n\n            np += sgn * (countpartitions(n - (k*(3k-1)) >> 1) + countpartitions(n - (k*(3k+1)) >> 1))\n            sgn = -sgn\n        end\n        cachecountpartitions[n] = np\n    end\nend\n\nG(n) = countpartitions(BigInt(n))\n\nfor g in [23, 123, 1234, 12345]\n    @time println(\"\\nG($g) is $(G(g))\")\nend\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_73.txt",
        "content": "\n\n                                                [1]\n                                               [1, 1]\n                                             [1, 1, 1]\n                                            [1, 2, 1, 1]\n                                          [1, 2, 2, 1, 1]\n                                         [1, 3, 3, 2, 1, 1]\n                                       [1, 3, 4, 3, 2, 1, 1]\n                                      [1, 4, 5, 5, 3, 2, 1, 1]\n                                    [1, 4, 7, 6, 5, 3, 2, 1, 1]\n                                   [1, 5, 8, 9, 7, 5, 3, 2, 1, 1]\n                                [1, 5, 10, 11, 10, 7, 5, 3, 2, 1, 1]\n                              [1, 6, 12, 15, 13, 11, 7, 5, 3, 2, 1, 1]\n                            [1, 6, 14, 18, 18, 14, 11, 7, 5, 3, 2, 1, 1]\n                          [1, 7, 16, 23, 23, 20, 15, 11, 7, 5, 3, 2, 1, 1]\n                        [1, 7, 19, 27, 30, 26, 21, 15, 11, 7, 5, 3, 2, 1, 1]\n                      [1, 8, 21, 34, 37, 35, 28, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n                    [1, 8, 24, 39, 47, 44, 38, 29, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n                  [1, 9, 27, 47, 57, 58, 49, 40, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n                [1, 9, 30, 54, 70, 71, 65, 52, 41, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n             [1, 10, 33, 64, 84, 90, 82, 70, 54, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n          [1, 10, 37, 72, 101, 110, 105, 89, 73, 55, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n       [1, 11, 40, 84, 119, 136, 131, 116, 94, 75, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n     [1, 11, 44, 94, 141, 163, 164, 146, 123, 97, 76, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n  [1, 12, 48, 108, 164, 199, 201, 186, 157, 128, 99, 77, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n\n[1, 12, 52, 120, 192, 235, 248, 230, 201, 164, 131, 100, 77, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\nG(23) is 1255\n\n 0.043878 seconds (82.76 k allocations: 3.730 MiB)\n\nG(123) is 2552338241\n\n 0.064343 seconds (435.68 k allocations: 7.199 MiB)\n\nG(1234) is 156978797223733228787865722354959930\n\n 6.439370 seconds (43.57 M allocations: 723.421 MiB, 30.61% gc time)\n\nG(12345) is 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736\n691.453611 seconds (4.32 G allocations: 71.973 GiB, 33.18% gc time)\n\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_74.txt",
        "content": "                                                [1]\n                                               [1, 1]\n                                             [1, 1, 1]\n                                            [1, 2, 1, 1]\n                                          [1, 2, 2, 1, 1]\n                                         [1, 3, 3, 2, 1, 1]\n                                       [1, 3, 4, 3, 2, 1, 1]\n                                      [1, 4, 5, 5, 3, 2, 1, 1]\n                                    [1, 4, 7, 6, 5, 3, 2, 1, 1]\n                                   [1, 5, 8, 9, 7, 5, 3, 2, 1, 1]\n                                [1, 5, 10, 11, 10, 7, 5, 3, 2, 1, 1]\n                              [1, 6, 12, 15, 13, 11, 7, 5, 3, 2, 1, 1]\n                            [1, 6, 14, 18, 18, 14, 11, 7, 5, 3, 2, 1, 1]\n                          [1, 7, 16, 23, 23, 20, 15, 11, 7, 5, 3, 2, 1, 1]\n                        [1, 7, 19, 27, 30, 26, 21, 15, 11, 7, 5, 3, 2, 1, 1]\n                      [1, 8, 21, 34, 37, 35, 28, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n                    [1, 8, 24, 39, 47, 44, 38, 29, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n                  [1, 9, 27, 47, 57, 58, 49, 40, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n                [1, 9, 30, 54, 70, 71, 65, 52, 41, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n             [1, 10, 33, 64, 84, 90, 82, 70, 54, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n          [1, 10, 37, 72, 101, 110, 105, 89, 73, 55, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n       [1, 11, 40, 84, 119, 136, 131, 116, 94, 75, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n     [1, 11, 44, 94, 141, 163, 164, 146, 123, 97, 76, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n  [1, 12, 48, 108, 164, 199, 201, 186, 157, 128, 99, 77, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_75.txt",
        "content": " 0.043878 seconds (82.76 k allocations: 3.730 MiB)\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_76.txt",
        "content": " 0.064343 seconds (435.68 k allocations: 7.199 MiB)\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_77.txt",
        "content": " 6.439370 seconds (43.57 M allocations: 723.421 MiB, 30.61% gc time)\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_78.txt",
        "content": "import java.lang.Math.min\nimport java.math.BigInteger\nimport java.util.ArrayList\nimport java.util.Arrays.asList\n\nfun namesOfGod(n: Int): List<BigInteger> {\n    val cache = ArrayList<List<BigInteger>>()\n    cache.add(asList(BigInteger.ONE))\n\n    (cache.size..n).forEach { l ->\n        val r = ArrayList<BigInteger>()\n        r.add(BigInteger.ZERO)\n\n        (1..l).forEach { x ->\n            r.add(r[r.size - 1] + cache[l - x][min(x, l - x)])\n        }\n        cache.add(r)\n    }\n    return cache[n]\n}\n\nfun row(n: Int) = namesOfGod(n).let { r -> (0 until n).map { r[it + 1] - r[it] } }\n\nfun main(args: Array<String>) {\n    println(\"Rows:\")\n    (1..25).forEach {\n        System.out.printf(\"%2d: %s%n\", it, row(it))\n    }\n\n    println(\"\\nSums:\")\n    intArrayOf(23, 123, 1234, 1234).forEach {\n        val c = namesOfGod(it)\n        System.out.printf(\"%s %s%n\", it, c[c.size - 1])\n    }\n}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_79.txt",
        "content": "Rows:\n 1: [1]\n 2: [1, 1]\n 3: [1, 1, 1]\n 4: [1, 2, 1, 1]\n 5: [1, 2, 2, 1, 1]\n 6: [1, 3, 3, 2, 1, 1]\n 7: [1, 3, 4, 3, 2, 1, 1]\n 8: [1, 4, 5, 5, 3, 2, 1, 1]\n 9: [1, 4, 7, 6, 5, 3, 2, 1, 1]\n10: [1, 5, 8, 9, 7, 5, 3, 2, 1, 1]\n11: [1, 5, 10, 11, 10, 7, 5, 3, 2, 1, 1]\n12: [1, 6, 12, 15, 13, 11, 7, 5, 3, 2, 1, 1]\n13: [1, 6, 14, 18, 18, 14, 11, 7, 5, 3, 2, 1, 1]\n14: [1, 7, 16, 23, 23, 20, 15, 11, 7, 5, 3, 2, 1, 1]\n15: [1, 7, 19, 27, 30, 26, 21, 15, 11, 7, 5, 3, 2, 1, 1]\n16: [1, 8, 21, 34, 37, 35, 28, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n17: [1, 8, 24, 39, 47, 44, 38, 29, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n18: [1, 9, 27, 47, 57, 58, 49, 40, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n19: [1, 9, 30, 54, 70, 71, 65, 52, 41, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n20: [1, 10, 33, 64, 84, 90, 82, 70, 54, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n21: [1, 10, 37, 72, 101, 110, 105, 89, 73, 55, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n22: [1, 11, 40, 84, 119, 136, 131, 116, 94, 75, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n23: [1, 11, 44, 94, 141, 163, 164, 146, 123, 97, 76, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n24: [1, 12, 48, 108, 164, 199, 201, 186, 157, 128, 99, 77, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n25: [1, 12, 52, 120, 192, 235, 248, 230, 201, 164, 131, 100, 77, 56, 42, 30, 22, 15, 11, 7, 5, 3, 2, 1, 1]\n\nSums:\n23 1255\n123 2552338241\n1234 156978797223733228787865722354959930\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_8.txt",
        "content": "INT number of rows = 123;\nMODE NAMEG = LONG INT;\n\n\n[ number of rows ]REF[]NAMEG c;\n[ number ofrows ]      NAMEG names;\nFOR i TO UPB names DO\n    names[ i ]\u00a0:= 0;\n    c[ i ]\u00a0:= HEAP [ i ]NAMEG;\n    FOR j TO i DO c[ i ][ j ]\u00a0:= 0 OD\nOD;\n\nFOR n TO UPB names DO\n    FOR col TO n DO\n        c[ n ][ col ]\u00a0:= IF   col = 1                         THEN 1\n                         ELIF col = 2                         THEN n OVER 2\n                         ELIF col >= n - 1                    THEN 1\n                         ELIF ( n - col ) < col               THEN names[ n - col ]\n                         ELIF ( n - col ) = col AND NOT ODD n THEN names[ n - col ]\n                         ELSE\n                             NAMEG partial sum\u00a0:= 0;\n                             FOR k TO col DO partial sum +:= c[ n - col ][ k ] OD;\n                             partial sum\n                         FI\n    OD;\n    names[ n ]:= 0;\n    FOR k TO n DO names[ n ] +:= c[ n ][ k ] OD\n; IF n MOD 200 = 0 THEN print( ( \"...\", whole( n, 0 ), newline ) ) FI\nOD;\n\n# display the first 25 rows of the triangle #\nFOR n TO 25 DO\n    print( ( \"(\", whole( names[ n ], -6 ), \")\", whole( n, -3 ), \":\" ) );\n    FOR col TO n DO\n        print( ( \" \", whole( c[ n ][ col ], -3 ) ) )\n    OD;\n    print( ( newline ) )\nOD;\n\nprint( ( \"   23: \", whole( names[    23 ], 0 ), newline ) );\nprint( ( \"  123: \", whole( names[   123 ], 0 ), newline ) )",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_80.txt",
        "content": "define cumu(n::integer) => {\n\tloop(-from=$cache->size,-to=#n+1) => {\n\t\tlocal(r = array(0), l = loop_count)\n\t\tloop(loop_count) => {\n\t\t\tprotect => { #r->insert(#r->last + $cache->get(#l - loop_count)->get(math_min(loop_count+1, #l - loop_count))) }\n\t\t}\n\t\t#r->size > 1 ? $cache->insert(#r)\n\t}\n\treturn $cache->get(#n)\n}\ndefine row(n::integer) => {\n\t// cache gets reset & rebuilt for each row, slower but more accurate\n\tvar(cache = array(array(1))) \n\tlocal(r = cumu(#n+1))\n\tlocal(o = array)\n\tloop(#n) => {\n\t\tprotect => { #o->insert(#r->get(loop_count+1) - #r->get(loop_count)) }\n\t}\t\n\treturn #o\n}\n'rows:\\r'\nloop(25) => {^\n\tloop_count + ': '+ row(loop_count)->join(' ') + '\\r'\n^}\n\n'sums:\\r'\nwith x in array(23, 123, 1234) do => {^\n\tvar(cache = array(array(1))) \n\tcumu(#x+1)->last\n\t'\\r'\n^}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_81.txt",
        "content": "rows:\n1: 1\n2: 1 1\n3: 1 1 1\n4: 1 2 1 1\n5: 1 2 2 1 1\n6: 1 3 3 2 1 1\n7: 1 3 4 3 2 1 1\n8: 1 4 5 5 3 2 1 1\n9: 1 4 7 6 5 3 2 1 1\n10: 1 5 8 9 7 5 3 2 1 1\n11: 1 5 10 11 10 7 5 3 2 1 1\n12: 1 6 12 15 13 11 7 5 3 2 1 1\n13: 1 6 14 18 18 14 11 7 5 3 2 1 1\n14: 1 7 16 23 23 20 15 11 7 5 3 2 1 1\n15: 1 7 19 27 30 26 21 15 11 7 5 3 2 1 1\n16: 1 8 21 34 37 35 28 22 15 11 7 5 3 2 1 1\n17: 1 8 24 39 47 44 38 29 22 15 11 7 5 3 2 1 1\n18: 1 9 27 47 57 58 49 40 30 22 15 11 7 5 3 2 1 1\n19: 1 9 30 54 70 71 65 52 41 30 22 15 11 7 5 3 2 1 1\n20: 1 10 33 64 84 90 82 70 54 42 30 22 15 11 7 5 3 2 1 1\n21: 1 10 37 72 101 110 105 89 73 55 42 30 22 15 11 7 5 3 2 1 1\n22: 1 11 40 84 119 136 131 116 94 75 56 42 30 22 15 11 7 5 3 2 1 1\n23: 1 11 44 94 141 163 164 146 123 97 76 56 42 30 22 15 11 7 5 3 2 1 1\n24: 1 12 48 108 164 199 201 186 157 128 99 77 56 42 30 22 15 11 7 5 3 2 1 1\n25: 1 12 52 120 192 235 248 230 201 164 131 100 77 56 42 30 22 15 11 7 5 3 2 1 1\n\nsums:\n23: 1255\n123: 2552338241\n1234: 156978797223733228787865722354959930\n12345: (ran long, timed out)",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_82.txt",
        "content": "function nog(n)\n  local tri = {{1}}\n  for r = 2, n do\n    tri[r] = {}\n    for c = 1, r do\n      tri[r][c] = (tri[r-1][c-1] or 0) + (tri[r-c] and tri[r-c][c] or 0)\n    end\n  end\n  return tri\nend\n\nfunction G(n)\n  local tri, sum = nog(n), 0\n  for _, v in ipairs(tri[n]) do sum = sum + v end\n  return sum\nend\n\ntri = nog(25)\nfor i, row in ipairs(tri) do\n  print(i .. \":  \" .. table.concat(row, \" \"))\nend\nprint(\"G(23) = \" .. G(23))\nprint(\"G(123) = \" .. G(123))\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_83.txt",
        "content": "1:  1\n2:  1 1\n3:  1 1 1\n4:  1 2 1 1\n5:  1 2 2 1 1\n6:  1 3 3 2 1 1\n7:  1 3 4 3 2 1 1\n8:  1 4 5 5 3 2 1 1\n9:  1 4 7 6 5 3 2 1 1\n10:  1 5 8 9 7 5 3 2 1 1\n11:  1 5 10 11 10 7 5 3 2 1 1\n12:  1 6 12 15 13 11 7 5 3 2 1 1\n13:  1 6 14 18 18 14 11 7 5 3 2 1 1\n14:  1 7 16 23 23 20 15 11 7 5 3 2 1 1\n15:  1 7 19 27 30 26 21 15 11 7 5 3 2 1 1\n16:  1 8 21 34 37 35 28 22 15 11 7 5 3 2 1 1\n17:  1 8 24 39 47 44 38 29 22 15 11 7 5 3 2 1 1\n18:  1 9 27 47 57 58 49 40 30 22 15 11 7 5 3 2 1 1\n19:  1 9 30 54 70 71 65 52 41 30 22 15 11 7 5 3 2 1 1\n20:  1 10 33 64 84 90 82 70 54 42 30 22 15 11 7 5 3 2 1 1\n21:  1 10 37 72 101 110 105 89 73 55 42 30 22 15 11 7 5 3 2 1 1\n22:  1 11 40 84 119 136 131 116 94 75 56 42 30 22 15 11 7 5 3 2 1 1\n23:  1 11 44 94 141 163 164 146 123 97 76 56 42 30 22 15 11 7 5 3 2 1 1\n24:  1 12 48 108 164 199 201 186 157 128 99 77 56 42 30 22 15 11 7 5 3 2 1 1\n25:  1 12 52 120 192 235 248 230 201 164 131 100 77 56 42 30 22 15 11 7 5 3 2 1 1\nG(23) = 1255\nG(123) = 2552338241",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_84.txt",
        "content": "TriangleLine(n)\u00a0:= map(rhs, Statistics\u00a0:- Tally(map(x -> x[-1],  combinat:-partition(n)))):\nTriangle\u00a0:= proc(m)  \n            local i;  \n            for i  from 1 to m do \n                print(op(TriangleLine(i)));  \n            end do  \n            end proc:",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_85.txt",
        "content": "Triangle(7);\n                               1\n                              1, 1\n                            1, 1, 1\n                           1, 2, 1, 1\n                         1, 2, 2, 1, 1\n                        1, 3, 3, 2, 1, 1\n                      1, 3, 4, 3, 2, 1, 1\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_86.txt",
        "content": "Table[Last /@ Reverse@Tally[First /@ IntegerPartitions[n]], {n, 10}] // Grid\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_87.txt",
        "content": "1\t\t\t\t\t\t\t\t\t\n1\t1\t\t\t\t\t\t\t\t\n1\t1\t1\t\t\t\t\t\t\t\n1\t2\t1\t1\t\t\t\t\t\t\n1\t2\t2\t1\t1\t\t\t\t\t\n1\t3\t3\t2\t1\t1\t\t\t\t\n1\t3\t4\t3\t2\t1\t1\t\t\t\n1\t4\t5\t5\t3\t2\t1\t1\t\t\n1\t4\t7\t6\t5\t3\t2\t1\t1\t\n1\t5\t8\t9\t7\t5\t3\t2\t1\t1",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_88.txt",
        "content": "PartitionsP /@ {23, 123, 1234, 12345}\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_89.txt",
        "content": "{1255, 2552338241, 156978797223733228787865722354959930, 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736}",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_9.txt",
        "content": "(     1)  1:   1\n(     2)  2:   1   1\n(     3)  3:   1   1   1\n(     5)  4:   1   2   1   1\n(     7)  5:   1   2   2   1   1\n(    11)  6:   1   3   3   2   1   1\n(    15)  7:   1   3   4   3   2   1   1\n(    22)  8:   1   4   5   5   3   2   1   1\n(    30)  9:   1   4   7   6   5   3   2   1   1\n(    42) 10:   1   5   8   9   7   5   3   2   1   1\n(    56) 11:   1   5  10  11  10   7   5   3   2   1   1\n(    77) 12:   1   6  12  15  13  11   7   5   3   2   1   1\n(   101) 13:   1   6  14  18  18  14  11   7   5   3   2   1   1\n(   135) 14:   1   7  16  23  23  20  15  11   7   5   3   2   1   1\n(   176) 15:   1   7  19  27  30  26  21  15  11   7   5   3   2   1   1\n(   231) 16:   1   8  21  34  37  35  28  22  15  11   7   5   3   2   1   1\n(   297) 17:   1   8  24  39  47  44  38  29  22  15  11   7   5   3   2   1   1\n(   385) 18:   1   9  27  47  57  58  49  40  30  22  15  11   7   5   3   2   1   1\n(   490) 19:   1   9  30  54  70  71  65  52  41  30  22  15  11   7   5   3   2   1   1\n(   627) 20:   1  10  33  64  84  90  82  70  54  42  30  22  15  11   7   5   3   2   1   1\n(   792) 21:   1  10  37  72 101 110 105  89  73  55  42  30  22  15  11   7   5   3   2   1   1\n(  1002) 22:   1  11  40  84 119 136 131 116  94  75  56  42  30  22  15  11   7   5   3   2   1   1\n(  1255) 23:   1  11  44  94 141 163 164 146 123  97  76  56  42  30  22  15  11   7   5   3   2   1   1\n(  1575) 24:   1  12  48 108 164 199 201 186 157 128  99  77  56  42  30  22  15  11   7   5   3   2   1   1\n(  1958) 25:   1  12  52 120 192 235 248 230 201 164 131 100  77  56  42  30  22  15  11   7   5   3   2   1   1\n   23: 1255\n  123: 2552338241\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_90.txt",
        "content": "DiscretePlot[PartitionsP[n], {n, 1, 999}, PlotRange -> All]\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_91.txt",
        "content": "for n thru 25 do print(makelist(length(integer_partitions(n-k,k)),k,1,n))$\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_92.txt",
        "content": "[1] \n[1,1] \n[1,1,1] \n[1,2,1,1] \n[1,2,2,1,1] \n[1,3,3,2,1,1] \n[1,3,4,3,2,1,1] \n[1,4,5,5,3,2,1,1] \n[1,4,7,6,5,3,2,1,1] \n[1,5,8,9,7,5,3,2,1,1] \n[1,5,10,11,10,7,5,3,2,1,1] \n[1,6,12,15,13,11,7,5,3,2,1,1] \n[1,6,14,18,18,14,11,7,5,3,2,1,1] \n[1,7,16,23,23,20,15,11,7,5,3,2,1,1] \n[1,7,19,27,30,26,21,15,11,7,5,3,2,1,1] \n[1,8,21,34,37,35,28,22,15,11,7,5,3,2,1,1] \n[1,8,24,39,47,44,38,29,22,15,11,7,5,3,2,1,1] \n[1,9,27,47,57,58,49,40,30,22,15,11,7,5,3,2,1,1] \n[1,9,30,54,70,71,65,52,41,30,22,15,11,7,5,3,2,1,1] \n[1,10,33,64,84,90,82,70,54,42,30,22,15,11,7,5,3,2,1,1] \n[1,10,37,72,101,110,105,89,73,55,42,30,22,15,11,7,5,3,2,1,1] \n[1,11,40,84,119,136,131,116,94,75,56,42,30,22,15,11,7,5,3,2,1,1] \n[1,11,44,94,141,163,164,146,123,97,76,56,42,30,22,15,11,7,5,3,2,1,1] \n[1,12,48,108,164,199,201,186,157,128,99,77,56,42,30,22,15,11,7,5,3,2,1,1] \n[1,12,52,120,192,235,248,230,201,164,131,100,77,56,42,30,22,15,11,7,5,3,2,1,1]",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_93.txt",
        "content": "makelist(num_partitions(n),n,[23,123,1234,12345]);\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_94.txt",
        "content": "(%o1) [1255, 2552338241, 156978797223733228787865722354959930, 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736]",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_95.txt",
        "content": "import bigints\n\nvar cache = @[@[1.initBigInt]]\n\nproc cumu(n: int): seq[BigInt] =\n  for m in cache.len .. n:\n    var r = @[0.initBigInt]\n    for x in 1..m:\n      r.add r[r.high] + cache[m-x][min(x, m-x)]\n    cache.add r\n  result = cache[n]\n\nproc row(n: int): seq[BigInt] =\n  let r = cumu n\n  result = @[]\n  for i in 0 .. <n:\n    result.add r[i+1] - r[i]\n\necho \"rows:\"\nfor x in 1..10:\n  echo row x\n\necho \"sums:\"\nfor x in [23, 123, 1234, 12345]:\n  let c = cumu(x)\n  echo x, \" \", c[c.high]\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_96.txt",
        "content": "@[1]\n@[1, 1]\n@[1, 1, 1]\n@[1, 2, 1, 1]\n@[1, 2, 2, 1, 1]\n@[1, 3, 3, 2, 1, 1]\n@[1, 3, 4, 3, 2, 1, 1]\n@[1, 4, 5, 5, 3, 2, 1, 1]\n@[1, 4, 7, 6, 5, 3, 2, 1, 1]\n@[1, 5, 8, 9, 7, 5, 3, 2, 1, 1]\nsums:\n23 1255\n123 2552338241\n1234 156978797223733228787865722354959930\n^C",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_97.txt",
        "content": "import bigints\n\nvar p = @[1.initBigInt]\n\nproc partitions(n): BigInt =\n  p.add 0.initBigInt\n\n  for k in 1..n:\n    var d = n - k * (3 * k - 1) div 2\n    if d < 0:\n      break\n\n    if (k and 1) != 0:\n      p[n] += p[d]\n    else:\n      p[n] -= p[d]\n\n    d -= k\n    if d < 0:\n      break\n\n    if (k and 1) != 0:\n      p[n] += p[d]\n    else:\n      p[n] -= p[d]\n\n  result = p[p.high]\n\nconst ns = [23, 123, 1234, 12345]\nfor i in 1 .. max(ns):\n  let p = partitions(i)\n  if i in ns:\n    echo i,\": \",p\n",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_98.txt",
        "content": "23: 1255\n123: 2552338241\n1234: 156978797223733228787865722354959930\n12345: 69420357953926116819562977205209384460667673094671463620270321700806074195845953959951425306140971942519870679768681736",
        "safe": true
    },
    {
        "filename": "9 billion names of God the integer_99.txt",
        "content": "let get, sum_unto =\n  let cache = ref [||]\n  let rec get i j =\n    if Array.length !cache < i then\n      cache :=\n        Array.init i begin fun i ->\n          try !cache.(i) with Invalid_argument _ ->\n          Array.make (i+1) (Num.num_of_int 0)\n        end;\n    if Num.(!cache.(i-1).(j-1) =/ num_of_int 0)\n    then !cache.(i-1).(j-1) <- sum_unto (i-j) j;\n    !cache.(i-1).(j-1)\n  and sum_unto i j =\n    let rec sum_unto sum i j =\n      match (i,j) with\n      |(0,0) -> (Num.num_of_int 1)\n      |(_,0) -> sum\n      |(i,j) when j > i -> sum_unto sum i i\n      |(i,j) -> sum_unto Num.(sum +/ (get i j)) i (j-1)\n    in\n    sum_unto (Num.num_of_int 0) i j\n  in\n  get, sum_unto\n\nlet sum_of_row n = sum_unto n n\n\nlet euler_recurrence =\n  let cache = ref [||] in\n  let rec recurrence = function\n    |n when n < 0 -> Num.num_of_int 0\n    |0 -> Num.num_of_int 1\n    |n ->\n        if n >= Array.length !cache then\n          cache :=\n            Array.init (n+1) (fun i ->\n              try !cache.(i) with Invalid_argument _ -> Num.num_of_int 0);\n        if Num.(!cache.(n) =/ num_of_int 0)\n        then begin\n          let rec summing sum = function\n            |0 -> sum\n            |k ->\n                let op = if k mod 2 = 0 then Num.sub_num else Num.add_num in\n                let sum = op sum (recurrence (n - k * (3*k - 1) / 2)) in\n                let sum = op sum (recurrence (n - k * (3*k + 1) / 2)) in\n                summing sum (k-1)\n          in\n          !cache.(n) <- summing (Num.num_of_int 0) n\n        end;\n        !cache.(n)\n  in\n  recurrence\n\nlet print i_max =\n  for i=1 to i_max do\n    print_int (i+1); print_string \": \";\n    for j=1 to i do\n      print_string (Num.string_of_num (get i j));\n      print_char ' ';\n    done;\n    print_newline ();\n  done\n\nlet () =\n  print 30;\n  print_newline ();\n  List.iter begin fun i ->\n      Printf.printf \"%i: %s\u00a0?= %s\\n\" i\n        (Num.string_of_num (sum_of_row i))\n        (Num.string_of_num (euler_recurrence i));\n      flush stdout;\n    end\n  [23;123;1234;];\n  List.iter begin fun i ->\n      Printf.printf \"%i: %s\\n\" i\n        (Num.string_of_num (euler_recurrence i));\n      flush stdout;\n    end\n  [23;123;1234;12345;123456]\n",
        "safe": true
    }
]